| /frameworks/compile/mclinker/unittests/ |
| PathTest.cpp | 21 m_pTestee = new Path();
26 delete m_pTestee;
43 m_pTestee->assign(root);
44 EXPECT_TRUE(exists(*m_pTestee));
46 delete m_pTestee;
47 m_pTestee = new Path(root);
48 EXPECT_TRUE(exists(*m_pTestee));
53 m_pTestee->assign(root);
54 EXPECT_FALSE(exists(*m_pTestee));
56 delete m_pTestee;
[all...] |
| FileHandleTest.cpp | 21 m_pTestee = new FileHandle();
26 delete m_pTestee;
43 ASSERT_TRUE(m_pTestee->open(path, FileHandle::OpenMode(FileHandle::ReadOnly),
45 ASSERT_TRUE(m_pTestee->isOpened());
46 ASSERT_TRUE(m_pTestee->isGood());
47 ASSERT_TRUE(m_pTestee->isOwned());
49 ASSERT_TRUE(27 == m_pTestee->size());
51 ASSERT_TRUE(m_pTestee->close());
52 ASSERT_FALSE(m_pTestee->isOpened());
53 ASSERT_TRUE(m_pTestee->isGood())
[all...] |
| SymbolTableTest.cpp | 18 m_pTestee = new SymbolTable<>(m_StrTable);
23 delete m_pTestee;
38 it = m_pTestee->begin();
39 ASSERT_EQ(it, m_pTestee->end());
|
| StringTableTest.cpp | 21 m_pTestee = new StringTable(*Pool);
26 delete m_pTestee;
46 ASSERT_NE(m_pTestee->insert(c), c);
48 ASSERT_EQ(m_pTestee->size(), size);
52 m_pTestee->insert("Hello");
53 m_pTestee->insert("World");
54 m_pTestee->insert("Media");
55 m_pTestee->insert("Tek");
56 StringTable::iterator it = m_pTestee->begin();
65 ASSERT_EQ(it, m_pTestee->end())
[all...] |
| LinearAllocatorTest.cpp | 18 m_pTestee = new LinearAllocator<Data, CHUNK_SIZE>();
23 delete m_pTestee;
38 Data* pointer = m_pTestee->allocate(10);
40 ASSERT_EQ(CHUNK_SIZE, m_pTestee->max_size());
41 ASSERT_FALSE(m_pTestee->empty());
45 Data* pointer = m_pTestee->allocate();
47 ASSERT_EQ(CHUNK_SIZE, m_pTestee->max_size());
48 ASSERT_FALSE(m_pTestee->empty());
52 Data* pointer = m_pTestee->allocate(CHUNK_SIZE + 1);
54 ASSERT_TRUE(0 == m_pTestee->max_size())
[all...] |
| RTLinearAllocatorTest.cpp | 18 m_pTestee = new LinearAllocator<Data, 0>(CHUNK_SIZE);
23 delete m_pTestee;
39 Data* pointer = m_pTestee->allocate(10);
41 ASSERT_TRUE(CHUNK_SIZE == m_pTestee->max_size());
42 ASSERT_FALSE(m_pTestee->empty());
46 Data* pointer = m_pTestee->allocate();
48 ASSERT_TRUE(CHUNK_SIZE == m_pTestee->max_size());
49 ASSERT_FALSE(m_pTestee->empty());
53 Data* pointer = m_pTestee->allocate(CHUNK_SIZE + 1);
55 ASSERT_TRUE(0 == m_pTestee->max_size())
[all...] |
| PathSetTest.cpp | 18 m_pTestee = new PathSet();
23 delete m_pTestee;
|
| BinTreeTest.cpp | 21 m_pTestee = new BinaryTree<int>();
26 delete m_pTestee;
43 BinaryTree<int>::iterator pos = m_pTestee->root();
44 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0);
46 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 1);
47 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1);
49 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2);
50 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2);
59 m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree);
61 EXPECT_TRUE(m_pTestee->size() == 8)
[all...] |
| InputTreeTest.cpp | 31 m_pTestee = new mcld::InputTree();
32 m_pBuilder->setCurrentTree(*m_pTestee);
37 delete m_pTestee;
68 InputTree::iterator node = m_pTestee->root();
80 m_pTestee->enterGroup(node, InputTree::Downward);
91 ASSERT_TRUE(m_pTestee->size() == 3);
95 InputTree::iterator node = m_pTestee->root();
98 m_pTestee->insert<InputTree::Inclusive>(node, *input);
104 m_pTestee->insert<InputTree::Inclusive>(node, *input);
108 m_pTestee->enterGroup(node, InputTree::Downward)
[all...] |
| SymbolCategoryTest.cpp | 22 m_pTestee = new SymbolCategory();
27 delete m_pTestee;
61 m_pTestee->add(*ee);
62 m_pTestee->add(*dd);
63 m_pTestee->add(*cc);
64 m_pTestee->add(*bb);
65 m_pTestee->add(*aa);
67 SymbolCategory::iterator sym = m_pTestee->begin();
78 ASSERT_TRUE(1 == m_pTestee->numOfLocals());
79 ASSERT_TRUE(1 == m_pTestee->numOfCommons())
[all...] |
| BinTreeTest.h | 44 mcld::BinaryTree<int>* m_pTestee;
|
| FileHandleTest.h | 41 mcld::FileHandle* m_pTestee;
|
| FragmentTest.h | 41 mcld::Fragment* m_pTestee;
|
| MCRegionFragmentTest.h | 42 mcld::MCRegionFragment* m_pTestee;
|
| NamePoolTest.h | 41 mcld::NamePool* m_pTestee;
|
| PathSetTest.h | 41 mcld::PathSet* m_pTestee;
|
| PathTest.h | 37 mcld::sys::fs::Path* m_pTestee;
|
| StringTableTest.h | 41 mcld::StringTable* m_pTestee;
|
| SymbolCategoryTest.h | 41 mcld::SymbolCategory* m_pTestee;
|
| SymbolTableTest.h | 41 mcld::SymbolTable<>* m_pTestee;
|
| NamePoolTest.cpp | 26 m_pTestee = new NamePool(resolver, 10);
31 delete m_pTestee;
48 llvm::StringRef result1 = m_pTestee->insertString(s1);
56 llvm::StringRef result1 = m_pTestee->insertString(s1);
57 llvm::StringRef result2 = m_pTestee->insertString(s2.c_str());
73 m_pTestee->insertSymbol(
86 m_pTestee->insertSymbol(
110 m_pTestee->insertSymbol(
123 m_pTestee->insertSymbol(
129 m_pTestee->insertSymbol("Different Symbol"
[all...] |
| InputTreeTest.h | 52 mcld::InputTree* m_pTestee;
|
| LinearAllocatorTest.h | 68 Alloc* m_pTestee;
|
| RTLinearAllocatorTest.h | 65 mcld::LinearAllocator<Data, 0>* m_pTestee;
|
