2 | cHash(n) | Number of hash buckets |
2 | Alignment | Filler to preserve alignment |
4n | Hash Table[n] | Each ulong entry is a file offset from the beginning of the chain table to the first chain item for each hash bucket. |
4n | Bucket Counts[n] | Each ulong entry is the count of items in the chain for each hash bucket. |
8m | Chain table[m] | Each entry is a pair of dwords. The first dword is the file offset of the referenced symbol from the beginning of the symbols. The second dword is the checksum of the referenced symbol generated by the above algorithm. |
n = the number of hash buckets
m = the number of symbols (with names) = the number of entries in the chain table
2 | cSeg(n) | Number of logical segments/sections |
2 | Alignment | Filler to preserve alignment |
4n | Segment Table[n] | Each ulong entry is a file offset from the beginning of the offset table to the first offset item for each segment/section. |
4n | Offset Counts[n] | Each ulong entry is the count of items in the offset table for each segment. |
8m | Offset Table[m] | Each entry is a pair of dwords. The first dword is the file offset of the referenced symbol from the beginning of the symbols. The second dword is the segment/section relative offset of the referenced symbol in memory. |