template <class Elf>

class CompatHash

Defined at line 43 of file ../../src/lib/elfldltl/include/lib/elfldltl/compat-hash.h

In DT_HASH format, there is a table mapping hash buckets to indices of the

first symbol table entry in the bucket. A second "chain" table maps the

symbol table index of each symbol to the next symbol in the same bucket.

Empty buckets and the end of a chain are identified by index 0 (STN_UNDEF),

which is always a null entry. The first two words of the DT_HASH data are

the number of buckets and the number of chain entries (i.e. the number of

symbol table entries). Then the bucket words follow, then the chain words.

Public Methods

void CompatHash<Elf> (std::span<const Word> table)

Defined at line 47 of file ../../src/lib/elfldltl/include/lib/elfldltl/compat-hash.h

void CompatHash<Elf> (std::span<const Word> table)

Defined at line 47 of file ../../src/lib/elfldltl/include/lib/elfldltl/compat-hash.h

void CompatHash<Elf> (std::span<const Word> table)

Defined at line 47 of file ../../src/lib/elfldltl/include/lib/elfldltl/compat-hash.h

void CompatHash<Elf> (std::span<const Word> table)

Defined at line 47 of file ../../src/lib/elfldltl/include/lib/elfldltl/compat-hash.h

void CompatHash<Elf> (std::span<const Word> table)

Defined at line 47 of file ../../src/lib/elfldltl/include/lib/elfldltl/compat-hash.h

bool Valid (std::span<const Word> table)