Home
last modified time | relevance | path

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

/frameworks/compile/mclinker/unittests/
DHashTableTest.cpp85 EXPECT_TRUE(0 == hashTable.numOfEntries()); in TEST_F()
124 EXPECT_TRUE(100 == hashTable->numOfEntries()); in TEST_F()
197 EXPECT_TRUE(80 == hashTable->numOfEntries()); in TEST_F()
207 EXPECT_TRUE(100 == hashTable->numOfEntries()); in TEST_F()
299 ASSERT_TRUE(16 == hashTable->numOfEntries()); in TEST_F()
/frameworks/compile/mclinker/include/mcld/ADT/
DHashBase.h86 size_t numOfEntries() const { return m_NumOfEntries; } in numOfEntries() function
/frameworks/compile/mclinker/include/mcld/LD/
DNamePool.h91 size_type size() const { return m_Table.numOfEntries(); } in size()
/frameworks/compile/mclinker/lib/LD/
DBranchIsland.cpp81 return m_StubMap.numOfEntries(); in numOfStubs()
DNamePool.cpp126 return (m_Table.numOfBuckets() - m_Table.numOfEntries()); in capacity()
DArchive.cpp74 return m_ObjectMemberMap.numOfEntries(); in numOfObjectMember()
DELFReader.cpp497 size_t numOfEntries = dynamic_sect->size() / sizeof(llvm::ELF::Elf32_Dyn); in readDynamic() local
499 for (size_t idx = 0; idx < numOfEntries; ++idx) { in readDynamic()
991 size_t numOfEntries = dynamic_sect->size() / sizeof(llvm::ELF::Elf64_Dyn); in readDynamic() local
993 for (size_t idx = 0; idx < numOfEntries; ++idx) { in readDynamic()