Home
last modified time | relevance | path

Searched refs:NChain (Results 1 – 10 of 10) sorted by relevance

/external/llvm-project/llvm/tools/obj2yaml/
Delf2yaml.cpp1234 uint32_t NChain = Data.getU32(Cur); in dumpHashSection() local
1235 if (Content.size() != (2 + NBucket + NChain) * 4) { in dumpHashSection()
1246 S->Chain.emplace(NChain); in dumpHashSection()
/external/llvm-project/llvm/test/tools/llvm-readobj/ELF/
Dhash-table.test263 NChain: [[NCHAIN]]
Ddyn-symbols-size-from-hash-table.test401 NChain: 0xFFFFFFFF
Dhash-histogram.test190 NChain: [[NCHAIN]]
Dhash-symbols.test450 NChain: [[NCHAIN=1]]
/external/llvm-project/llvm/include/llvm/ObjectYAML/
DELFYAML.h336 Optional<llvm::yaml::Hex64> NChain; member
/external/llvm-project/llvm/lib/ObjectYAML/
DELFYAML.cpp1179 (!Section.NBucket.hasValue() && !Section.NChain.hasValue())); in sectionMapping()
1180 IO.mapOptional("NChain", Section.NChain); in sectionMapping()
DELFEmitter.cpp1465 Section.NChain.getValueOr(llvm::yaml::Hex64(Section.Chain->size())), in writeSectionContent()
/external/llvm/tools/llvm-readobj/
DELFDumper.cpp3071 size_t NChain = HashTable->nchain; in printHashHistogram() local
3079 if (NChain == 0 || NBucket == 0) in printHashHistogram()
3086 for (size_t C = Buckets[B]; C > 0 && C < NChain; C = Chains[C]) in printHashHistogram()
/external/llvm-project/llvm/tools/llvm-readobj/
DELFDumper.cpp4847 size_t NChain = HashTable.nchain; in printHashHistogram() local
4855 if (NChain == 0 || NBucket == 0) in printHashHistogram()
4862 std::vector<bool> Visited(NChain); in printHashHistogram()
4863 for (size_t C = Buckets[B]; C < NChain; C = Chains[C]) { in printHashHistogram()