search for: filepointerofrawdata

...run `dumpbin /headers foo.obj` on a clang-generated object file that has a .debug$H section already (e.g. run clang with -emit-codeview-ghash-section, and look at the properties of the .debug$H section and use the same values). The only invariant that needs to be maintained is that Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + Section[N-1]->SizeOfRawData On Sat, Jan 20, 2018 at 11:52 AM Leonardo Santagada <santagada at gmail.com> wrote: > Thanks for the tips, I now have something that reads the obj file, finds > .debug$T sections and global hashes it (proof of c...

...e .debug$H >> section and use the same values). >> > > Thanks I will do that and then also look at how the CodeView part of the > code does it if I can't understand some of it. > > >> The only invariant that needs to be maintained is that >> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >> Section[N-1]->SizeOfRawData >> > > Well, that and all the sections need to be on the final file... But I'm > hopeful. > > > Anyone has times on linking a big project like chrome with this so that at > least I know...

...h-section, and look at the properties of the .debug$H > section and use the same values). > Thanks I will do that and then also look at how the CodeView part of the code does it if I can't understand some of it. > The only invariant that needs to be maintained is that Section[N]->FilePointerOfRawData == > Section[N-1]->FilePointerOfRawData + Section[N-1]->SizeOfRawData > Well, that and all the sections need to be on the final file... But I'm hopeful. Anyone has times on linking a big project like chrome with this so that at least I know what kind of performance to expect? My...

...use the same values). >>> >> >> Thanks I will do that and then also look at how the CodeView part of the >> code does it if I can't understand some of it. >> >> >>> The only invariant that needs to be maintained is that >>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>> Section[N-1]->SizeOfRawData >>> >> >> Well, that and all the sections need to be on the final file... But I'm >> hopeful. >> >> >> Anyone has times on linking a big project like chrome with t...

...lues). >>>> >>> >>> Thanks I will do that and then also look at how the CodeView part of the >>> code does it if I can't understand some of it. >>> >>> >>>> The only invariant that needs to be maintained is that Section[N]->FilePointerOfRawData == >>>> Section[N-1]->FilePointerOfRawData + Section[N-1]->SizeOfRawData >>>> >>> >>> Well, that and all the sections need to be on the final file... But I'm >>> hopeful. >>> >>> >>> Anyone has times on linking...

...>>> Thanks I will do that and then also look at how the CodeView part of >>>> the code does it if I can't understand some of it. >>>> >>>> >>>>> The only invariant that needs to be maintained is that >>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>> Section[N-1]->SizeOfRawData >>>>> >>>> >>>> Well, that and all the sections need to be on the final file... But I'm >>>> hopeful. >>>> >>>> >>>&...

...;>>>> Thanks I will do that and then also look at how the CodeView part of >>>>> the code does it if I can't understand some of it. >>>>> >>>>> >>>>>> The only invariant that needs to be maintained is that Section[N]->FilePointerOfRawData == >>>>>> Section[N-1]->FilePointerOfRawData + Section[N-1]->SizeOfRawData >>>>>> >>>>> >>>>> Well, that and all the sections need to be on the final file... But >>>>> I'm hopeful. >>>>> >&g...

...do that and then also look at how the CodeView part of >>>>>>> the code does it if I can't understand some of it. >>>>>>> >>>>>>> >>>>>>>> The only invariant that needs to be maintained is that Section[N]->FilePointerOfRawData == >>>>>>>> Section[N-1]->FilePointerOfRawData + Section[N-1]->SizeOfRawData >>>>>>>> >>>>>>> >>>>>>> Well, that and all the sections need to be on the final file... But >>>>>>> I...

...hen also look at how the CodeView part of >>>>>> the code does it if I can't understand some of it. >>>>>> >>>>>> >>>>>>> The only invariant that needs to be maintained is that >>>>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>>>> Section[N-1]->SizeOfRawData >>>>>>> >>>>>> >>>>>> Well, that and all the sections need to be on the final file... But >>>>>> I'm hopeful. >&gt...

...gt;>>>>>>> of the code does it if I can't understand some of it. >>>>>>>> >>>>>>>> >>>>>>>>> The only invariant that needs to be maintained is that >>>>>>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>>>>>> Section[N-1]->SizeOfRawData >>>>>>>>> >>>>>>>> >>>>>>>> Well, that and all the sections need to be on the final file... But >>>>&...

...gt;>>> of the code does it if I can't understand some of it. >>>>>>>>> >>>>>>>>> >>>>>>>>>> The only invariant that needs to be maintained is that >>>>>>>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>>>>>>> Section[N-1]->SizeOfRawData >>>>>>>>>> >>>>>>>>> >>>>>>>>> Well, that and all the sections need to be on the final file... >&...

Thanks for the tips, I now have something that reads the obj file, finds .debug$T sections and global hashes it (proof of concept kind of code). What I can't find is: how does clang itself writes the coff files with global hashes, as that might help me understand how to create the .debug$H section, how to update the file section count and how to properly write this back. The code on yaml2coff

...it if I can't understand some of it. >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>>> The only invariant that needs to be maintained is that >>>>>>>>>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>>>>>>>>> Section[N-1]->SizeOfRawData >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> Well, that and all the sections need...

...of the code does it if I can't understand some of it. >>>>>>>>>> >>>>>>>>>> >>>>>>>>>>> The only invariant that needs to be maintained is that >>>>>>>>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>>>>>>>> Section[N-1]->SizeOfRawData >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Well, that and all the sections need to be on the fin...

...me of it. >>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>>> The only invariant that needs to be maintained is that >>>>>>>>>>>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>>>>>>>>>>> Section[N-1]->SizeOfRawData >>>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> Well,...

...;t understand some of it. >>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>>> The only invariant that needs to be maintained is that >>>>>>>>>>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>>>>>>>>>> Section[N-1]->SizeOfRawData >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> Well, that and all th...

...t;>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>>>>> The only invariant that needs to be maintained is that >>>>>>>>>>>>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>>>>>>>>>>>> Section[N-1]->SizeOfRawData >>>>>>>>>>>>>>> >>>>>>>>>>>>>> >>>>>>>>>>>&g...

On Fri, Jan 19, 2018 at 1:02 PM Leonardo Santagada <santagada at gmail.com> wrote: > On Fri, Jan 19, 2018 at 9:44 PM, Zachary Turner <zturner at google.com> > wrote: > >> >> >> On Fri, Jan 19, 2018 at 12:29 PM Leonardo Santagada <santagada at gmail.com> >> wrote: >> >>> Hi, >>> >>> No I didn't, I used cl.exe

...t;>>>>>>>>> >>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> The only invariant that needs to be maintained is that >>>>>>>>>>>>>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>>>>>>>>>>>>> Section[N-1]->SizeOfRawData >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>> >>>>>>>>&g...

...t;>>> >>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>>> The only invariant that needs to be maintained is that >>>>>>>>>>>>>>>>>> Section[N]->FilePointerOfRawData == Section[N-1]->FilePointerOfRawData + >>>>>>>>>>>>>>>>>> Section[N-1]->SizeOfRawData >>>>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> >>&g...