Home
last modified time | relevance | path

Searched refs:m_pTestee (Results 1 – 24 of 24) sorted by relevance

/aosp12/frameworks/compile/mclinker/unittests/
H A DPathTest.cpp26 delete m_pTestee; in ~PathTest()
46 delete m_pTestee; in TEST_F()
56 delete m_pTestee; in TEST_F()
66 delete m_pTestee; in TEST_F()
77 delete m_pTestee; in TEST_F()
91 delete m_pTestee; in TEST_F()
93 EXPECT_TRUE(*m_pTestee == *m_pTestee); in TEST_F()
104 delete m_pTestee; in TEST_F()
116 delete m_pTestee; in TEST_F()
120 delete m_pTestee; in TEST_F()
[all …]
H A DBinTreeTest.cpp21 m_pTestee = new BinaryTree<int>(); in BinTreeTest()
26 delete m_pTestee; in ~BinTreeTest()
61 EXPECT_TRUE(m_pTestee->size() == 8); in TEST_F()
80 EXPECT_TRUE(m_pTestee->size() == 5); in TEST_F()
119 m_pTestee->join<InputTree::Inclusive>(pos, a); in TEST_F()
122 m_pTestee->join<InputTree::Inclusive>(pos, c); in TEST_F()
125 m_pTestee->join<InputTree::Inclusive>(pos, e); in TEST_F()
146 m_pTestee->join<InputTree::Inclusive>(pos, a); in TEST_F()
211 bfs_it = m_pTestee->bfs_begin(); in TEST_F()
212 bfs_end = m_pTestee->bfs_end(); in TEST_F()
[all …]
H A DFileHandleTest.cpp21 m_pTestee = new FileHandle(); in FileHandleTest()
26 delete m_pTestee; in ~FileHandleTest()
46 ASSERT_TRUE(m_pTestee->isGood()); in TEST_F()
47 ASSERT_TRUE(m_pTestee->isOwned()); in TEST_F()
51 ASSERT_TRUE(m_pTestee->close()); in TEST_F()
53 ASSERT_TRUE(m_pTestee->isGood()); in TEST_F()
66 ASSERT_TRUE(m_pTestee->isGood()); in TEST_F()
71 ASSERT_TRUE(m_pTestee->close()); in TEST_F()
73 ASSERT_TRUE(m_pTestee->isGood()); in TEST_F()
88 ASSERT_TRUE(m_pTestee->isGood()); in TEST_F()
[all …]
H A DLinearAllocatorTest.cpp23 delete m_pTestee; in ~LinearAllocatorTest()
41 ASSERT_FALSE(m_pTestee->empty()); in TEST_F()
45 Data* pointer = m_pTestee->allocate(); in TEST_F()
48 ASSERT_FALSE(m_pTestee->empty()); in TEST_F()
55 ASSERT_TRUE(m_pTestee->empty()); in TEST_F()
60 m_pTestee->construct(pointer); in TEST_F()
70 m_pTestee->construct(pointer, data); in TEST_F()
80 m_pTestee->construct(pointer); in TEST_F()
90 m_pTestee->construct(pointer, data); in TEST_F()
101 m_pTestee->construct(pointer); in TEST_F()
[all …]
H A DRTLinearAllocatorTest.cpp23 delete m_pTestee; in ~RTLinearAllocatorTest()
42 ASSERT_FALSE(m_pTestee->empty()); in TEST_F()
46 Data* pointer = m_pTestee->allocate(); in TEST_F()
49 ASSERT_FALSE(m_pTestee->empty()); in TEST_F()
56 ASSERT_TRUE(m_pTestee->empty()); in TEST_F()
61 m_pTestee->construct(pointer); in TEST_F()
71 m_pTestee->construct(pointer, data); in TEST_F()
81 m_pTestee->construct(pointer); in TEST_F()
91 m_pTestee->construct(pointer, data); in TEST_F()
102 m_pTestee->construct(pointer); in TEST_F()
[all …]
H A DInputTreeTest.cpp31 m_pTestee = new mcld::InputTree(); in InputTreeTest()
32 m_pBuilder->setCurrentTree(*m_pTestee); in InputTreeTest()
37 delete m_pTestee; in ~InputTreeTest()
68 InputTree::iterator node = m_pTestee->root(); in TEST_F()
80 m_pTestee->enterGroup(node, InputTree::Downward); in TEST_F()
91 ASSERT_TRUE(m_pTestee->size() == 3); in TEST_F()
95 InputTree::iterator node = m_pTestee->root(); in TEST_F()
116 ASSERT_TRUE(m_pTestee->size() == 102); in TEST_F()
120 InputTree::iterator node = m_pTestee->root(); in TEST_F()
135 ASSERT_TRUE(m_pTestee->size() == 100); in TEST_F()
[all …]
H A DStringTableTest.cpp21 m_pTestee = new StringTable(*Pool); in StringTableTest()
26 delete m_pTestee; in ~StringTableTest()
46 ASSERT_NE(m_pTestee->insert(c), c); in TEST_F()
48 ASSERT_EQ(m_pTestee->size(), size); in TEST_F()
52 m_pTestee->insert("Hello"); in TEST_F()
53 m_pTestee->insert("World"); in TEST_F()
54 m_pTestee->insert("Media"); in TEST_F()
55 m_pTestee->insert("Tek"); in TEST_F()
65 ASSERT_EQ(it, m_pTestee->end()); in TEST_F()
69 m_pTestee->insert(""); in TEST_F()
[all …]
H A DSymbolCategoryTest.cpp27 delete m_pTestee; in ~SymbolCategoryTest()
61 m_pTestee->add(*ee); in TEST_F()
62 m_pTestee->add(*dd); in TEST_F()
63 m_pTestee->add(*cc); in TEST_F()
64 m_pTestee->add(*bb); in TEST_F()
65 m_pTestee->add(*aa); in TEST_F()
110 m_pTestee->add(*ee); in TEST_F()
111 m_pTestee->add(*dd); in TEST_F()
112 m_pTestee->add(*cc); in TEST_F()
113 m_pTestee->add(*bb); in TEST_F()
[all …]
H A DNamePoolTest.cpp26 m_pTestee = new NamePool(resolver, 10); in NamePoolTest()
31 delete m_pTestee; in ~NamePoolTest()
73 m_pTestee->insertSymbol( in TEST_F()
86 m_pTestee->insertSymbol( in TEST_F()
110 m_pTestee->insertSymbol( in TEST_F()
123 m_pTestee->insertSymbol( in TEST_F()
129 m_pTestee->insertSymbol("Different Symbol", in TEST_F()
153 LDSymbol* sym = m_pTestee->insertSymbol( in TEST_F()
183 syms[i][j] = m_pTestee->insertSymbol( in TEST_F()
193 LDSymbol* sym = m_pTestee->insertSymbol( in TEST_F()
[all …]
H A DSymbolTableTest.cpp18 m_pTestee = new SymbolTable<>(m_StrTable); in SymbolTableTest()
23 delete m_pTestee; in ~SymbolTableTest()
38 it = m_pTestee->begin(); in TEST_F()
39 ASSERT_EQ(it, m_pTestee->end()); in TEST_F()
H A DPathSetTest.cpp18 m_pTestee = new PathSet(); in PathSetTest()
23 delete m_pTestee; in ~PathSetTest()
H A DPathTest.h37 mcld::sys::fs::Path* m_pTestee;
H A DBinTreeTest.h44 mcld::BinaryTree<int>* m_pTestee;
H A DFileHandleTest.h41 mcld::FileHandle* m_pTestee;
H A DFragmentTest.h41 mcld::Fragment* m_pTestee;
H A DMCRegionFragmentTest.h42 mcld::MCRegionFragment* m_pTestee;
H A DNamePoolTest.h41 mcld::NamePool* m_pTestee;
H A DPathSetTest.h41 mcld::PathSet* m_pTestee;
H A DStringTableTest.h41 mcld::StringTable* m_pTestee;
H A DSymbolCategoryTest.h41 mcld::SymbolCategory* m_pTestee;
H A DSymbolTableTest.h41 mcld::SymbolTable<>* m_pTestee;
H A DInputTreeTest.h52 mcld::InputTree* m_pTestee; variable
H A DRTLinearAllocatorTest.h65 mcld::LinearAllocator<Data, 0>* m_pTestee;
H A DLinearAllocatorTest.h68 Alloc* m_pTestee;