Home
last modified time | relevance | path

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

/frameworks/compile/mclinker/unittests/
DPathTest.cpp21 m_pTestee = new Path(); in PathTest()
26 delete m_pTestee; in ~PathTest()
43 m_pTestee->assign(root); in TEST_F()
44 EXPECT_TRUE(exists(*m_pTestee)); in TEST_F()
46 delete m_pTestee; in TEST_F()
47 m_pTestee = new Path(root); in TEST_F()
48 EXPECT_TRUE(exists(*m_pTestee)); in TEST_F()
53 m_pTestee->assign(root); in TEST_F()
54 EXPECT_FALSE(exists(*m_pTestee)); in TEST_F()
56 delete m_pTestee; in TEST_F()
[all …]
DFileHandleTest.cpp21 m_pTestee = new FileHandle(); in FileHandleTest()
26 delete m_pTestee; in ~FileHandleTest()
43 ASSERT_TRUE(m_pTestee->open(path, FileHandle::OpenMode(FileHandle::ReadOnly), in TEST_F()
45 ASSERT_TRUE(m_pTestee->isOpened()); in TEST_F()
46 ASSERT_TRUE(m_pTestee->isGood()); in TEST_F()
47 ASSERT_TRUE(m_pTestee->isOwned()); in TEST_F()
49 ASSERT_TRUE(27 == m_pTestee->size()); in TEST_F()
51 ASSERT_TRUE(m_pTestee->close()); in TEST_F()
52 ASSERT_FALSE(m_pTestee->isOpened()); in TEST_F()
53 ASSERT_TRUE(m_pTestee->isGood()); in TEST_F()
[all …]
DBinTreeTest.cpp21 m_pTestee = new BinaryTree<int>(); in BinTreeTest()
26 delete m_pTestee; in ~BinTreeTest()
43 BinaryTree<int>::iterator pos = m_pTestee->root(); in TEST_F()
44 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0); in TEST_F()
46 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 1); in TEST_F()
47 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1); in TEST_F()
49 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2); in TEST_F()
50 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2); in TEST_F()
59 m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree); in TEST_F()
61 EXPECT_TRUE(m_pTestee->size() == 8); in TEST_F()
[all …]
DRTLinearAllocatorTest.cpp18 m_pTestee = new LinearAllocator<Data, 0>(CHUNK_SIZE); in RTLinearAllocatorTest()
23 delete m_pTestee; in ~RTLinearAllocatorTest()
39 Data* pointer = m_pTestee->allocate(10); in TEST_F()
41 ASSERT_TRUE(CHUNK_SIZE == m_pTestee->max_size()); in TEST_F()
42 ASSERT_FALSE(m_pTestee->empty()); in TEST_F()
46 Data* pointer = m_pTestee->allocate(); in TEST_F()
48 ASSERT_TRUE(CHUNK_SIZE == m_pTestee->max_size()); in TEST_F()
49 ASSERT_FALSE(m_pTestee->empty()); in TEST_F()
53 Data* pointer = m_pTestee->allocate(CHUNK_SIZE + 1); in TEST_F()
55 ASSERT_TRUE(0 == m_pTestee->max_size()); in TEST_F()
[all …]
DLinearAllocatorTest.cpp18 m_pTestee = new LinearAllocator<Data, CHUNK_SIZE>(); in LinearAllocatorTest()
23 delete m_pTestee; in ~LinearAllocatorTest()
38 Data* pointer = m_pTestee->allocate(10); in TEST_F()
40 ASSERT_EQ(CHUNK_SIZE, m_pTestee->max_size()); in TEST_F()
41 ASSERT_FALSE(m_pTestee->empty()); in TEST_F()
45 Data* pointer = m_pTestee->allocate(); in TEST_F()
47 ASSERT_EQ(CHUNK_SIZE, m_pTestee->max_size()); in TEST_F()
48 ASSERT_FALSE(m_pTestee->empty()); in TEST_F()
52 Data* pointer = m_pTestee->allocate(CHUNK_SIZE + 1); in TEST_F()
54 ASSERT_TRUE(0 == m_pTestee->max_size()); in TEST_F()
[all …]
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()
56 StringTable::iterator it = m_pTestee->begin(); in TEST_F()
65 ASSERT_EQ(it, m_pTestee->end()); in TEST_F()
[all …]
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()
98 m_pTestee->insert<InputTree::Inclusive>(node, *input); in TEST_F()
104 m_pTestee->insert<InputTree::Inclusive>(node, *input); in TEST_F()
108 m_pTestee->enterGroup(node, InputTree::Downward); in TEST_F()
[all …]
DSymbolCategoryTest.cpp22 m_pTestee = new SymbolCategory(); in SymbolCategoryTest()
27 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()
67 SymbolCategory::iterator sym = m_pTestee->begin(); in TEST_F()
78 ASSERT_TRUE(1 == m_pTestee->numOfLocals()); in TEST_F()
79 ASSERT_TRUE(1 == m_pTestee->numOfCommons()); in TEST_F()
[all …]
DNamePoolTest.cpp26 m_pTestee = new NamePool(resolver, 10); in NamePoolTest()
31 delete m_pTestee; in ~NamePoolTest()
48 llvm::StringRef result1 = m_pTestee->insertString(s1); in TEST_F()
56 llvm::StringRef result1 = m_pTestee->insertString(s1); in TEST_F()
57 llvm::StringRef result2 = m_pTestee->insertString(s2.c_str()); in TEST_F()
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()
[all …]
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()
DPathSetTest.cpp18 m_pTestee = new PathSet(); in PathSetTest()
23 delete m_pTestee; in ~PathSetTest()
DPathTest.h37 mcld::sys::fs::Path* m_pTestee;
DPathSetTest.h41 mcld::PathSet* m_pTestee;
DSymbolCategoryTest.h41 mcld::SymbolCategory* m_pTestee;
DFragmentTest.h41 mcld::Fragment* m_pTestee;
DBinTreeTest.h44 mcld::BinaryTree<int>* m_pTestee;
DMCRegionFragmentTest.h42 mcld::MCRegionFragment* m_pTestee;
DNamePoolTest.h41 mcld::NamePool* m_pTestee;
DFileHandleTest.h41 mcld::FileHandle* m_pTestee;
DStringTableTest.h41 mcld::StringTable* m_pTestee;
DSymbolTableTest.h41 mcld::SymbolTable<>* m_pTestee;
DInputTreeTest.h52 mcld::InputTree* m_pTestee; variable
DRTLinearAllocatorTest.h65 mcld::LinearAllocator<Data, 0>* m_pTestee;
DLinearAllocatorTest.h68 Alloc* m_pTestee;