Home
last modified time | relevance | path

Searched refs:numOfEntries (Results 1 – 7 of 7) sorted by relevance

/frameworks/compile/mclinker/unittests/
DHashTableTest.cpp102 EXPECT_TRUE(0 == hashTable.numOfEntries()); in TEST_F()
139 EXPECT_TRUE(100 == hashTable->numOfEntries()); in TEST_F()
212 EXPECT_TRUE(80 == hashTable->numOfEntries()); in TEST_F()
222 EXPECT_TRUE(100 == hashTable->numOfEntries()); in TEST_F()
315 ASSERT_TRUE(16 == hashTable->numOfEntries()); in TEST_F()
/frameworks/compile/mclinker/include/mcld/ADT/
DHashBase.h93 size_t numOfEntries() const in numOfEntries() function
/frameworks/compile/mclinker/include/mcld/LD/
DNamePool.h91 { return m_Table.numOfEntries(); } in size()
/frameworks/compile/mclinker/lib/LD/
DBranchIsland.cpp93 return m_StubMap.numOfEntries(); in numOfStubs()
DNamePool.cpp132 return (m_Table.numOfBuckets() - m_Table.numOfEntries()); in capacity()
DArchive.cpp84 return m_ObjectMemberMap.numOfEntries(); in numOfObjectMember()
DELFReader.cpp553 size_t numOfEntries = dynamic_sect->size() / sizeof(llvm::ELF::Elf32_Dyn); in readDynamic() local
555 for (size_t idx = 0; idx < numOfEntries; ++idx) { in readDynamic()
1109 size_t numOfEntries = dynamic_sect->size() / sizeof(llvm::ELF::Elf64_Dyn); in readDynamic() local
1111 for (size_t idx = 0; idx < numOfEntries; ++idx) { in readDynamic()