| /frameworks/compile/mclinker/unittests/ |
| PathTest.cpp | 23 m_pTestee = new Path();
29 delete m_pTestee;
48 m_pTestee->assign(root);
49 EXPECT_TRUE(exists(*m_pTestee));
51 delete m_pTestee;
52 m_pTestee = new Path(root);
53 EXPECT_TRUE(exists(*m_pTestee));
58 m_pTestee->assign(root);
59 EXPECT_FALSE(exists(*m_pTestee));
61 delete m_pTestee;
[all...] |
| FileHandleTest.cpp | 23 m_pTestee = new FileHandle();
29 delete m_pTestee;
48 ASSERT_TRUE(m_pTestee->open(path, FileHandle::ReadOnly));
49 ASSERT_TRUE(m_pTestee->isOpened());
50 ASSERT_TRUE(m_pTestee->isGood());
51 ASSERT_TRUE(m_pTestee->isOwned());
53 ASSERT_TRUE(27 == m_pTestee->size());
55 ASSERT_TRUE(m_pTestee->close());
56 ASSERT_FALSE(m_pTestee->isOpened());
57 ASSERT_TRUE(m_pTestee->isGood())
[all...] |
| SymbolTableTest.cpp | 20 m_pTestee = new SymbolTable<>(m_StrTable);
26 delete m_pTestee;
43 it = m_pTestee->begin();
44 ASSERT_EQ(it, m_pTestee->end());
|
| StringTableTest.cpp | 23 m_pTestee = new StringTable(*Pool);
29 delete m_pTestee;
51 ASSERT_NE(m_pTestee->insert(c), c);
53 ASSERT_EQ(m_pTestee->size(), size);
57 m_pTestee->insert("Hello");
58 m_pTestee->insert("World");
59 m_pTestee->insert("Media");
60 m_pTestee->insert("Tek");
61 StringTable::iterator it = m_pTestee->begin();
70 ASSERT_EQ(it, m_pTestee->end())
[all...] |
| LinearAllocatorTest.cpp | 20 m_pTestee = new LinearAllocator<Data, CHUNK_SIZE>();
26 delete m_pTestee;
43 Data* pointer = m_pTestee->allocate(10);
45 ASSERT_EQ(CHUNK_SIZE, m_pTestee->max_size());
46 ASSERT_FALSE(m_pTestee->empty());
50 Data* pointer = m_pTestee->allocate();
52 ASSERT_EQ(CHUNK_SIZE, m_pTestee->max_size());
53 ASSERT_FALSE(m_pTestee->empty());
57 Data* pointer = m_pTestee->allocate(CHUNK_SIZE+1);
59 ASSERT_TRUE(0 == m_pTestee->max_size())
[all...] |
| RTLinearAllocatorTest.cpp | 20 m_pTestee = new LinearAllocator<Data, 0>(CHUNK_SIZE);
26 delete m_pTestee;
44 Data* pointer = m_pTestee->allocate(10);
46 ASSERT_TRUE(CHUNK_SIZE == m_pTestee->max_size());
47 ASSERT_FALSE(m_pTestee->empty());
51 Data* pointer = m_pTestee->allocate();
53 ASSERT_TRUE(CHUNK_SIZE == m_pTestee->max_size());
54 ASSERT_FALSE(m_pTestee->empty());
58 Data* pointer = m_pTestee->allocate(CHUNK_SIZE+1);
60 ASSERT_TRUE(0 == m_pTestee->max_size())
[all...] |
| PathSetTest.cpp | 20 m_pTestee = new PathSet();
26 delete m_pTestee;
|
| BinTreeTest.cpp | 23 m_pTestee = new BinaryTree<int>();
29 delete m_pTestee;
50 BinaryTree<int>::iterator pos = m_pTestee->root();
51 m_pTestee->join<TreeIteratorBase::Rightward>(pos,0);
53 m_pTestee->join<TreeIteratorBase::Rightward>(pos,1);
54 m_pTestee->join<TreeIteratorBase::Leftward>(pos,1);
56 m_pTestee->join<TreeIteratorBase::Rightward>(pos,2);
57 m_pTestee->join<TreeIteratorBase::Leftward>(pos,2);
66 m_pTestee->merge<TreeIteratorBase::Rightward>(pos,*mergeTree);
68 EXPECT_TRUE(m_pTestee->size()==8)
[all...] |
| SymbolCategoryTest.cpp | 24 m_pTestee = new SymbolCategory();
30 delete m_pTestee;
66 m_pTestee->add(*ee);
67 m_pTestee->add(*dd);
68 m_pTestee->add(*cc);
69 m_pTestee->add(*bb);
70 m_pTestee->add(*aa);
72 SymbolCategory::iterator sym = m_pTestee->begin();
83 ASSERT_TRUE(1 == m_pTestee->numOfLocals());
84 ASSERT_TRUE(1 == m_pTestee->numOfCommons())
[all...] |
| BinTreeTest.h | 46 mcld::BinaryTree<int>* m_pTestee;
|
| FileHandleTest.h | 44 mcld::FileHandle* m_pTestee;
|
| FragmentTest.h | 44 mcld::Fragment* m_pTestee;
|
| MCRegionFragmentTest.h | 45 mcld::MCRegionFragment* m_pTestee;
|
| MemoryAreaTest.h | 44 mcld::MemoryArea* m_pTestee;
|
| NamePoolTest.h | 44 mcld::NamePool* m_pTestee;
|
| PathSetTest.h | 44 mcld::PathSet* m_pTestee;
|
| PathTest.h | 39 mcld::sys::fs::Path* m_pTestee;
|
| StringTableTest.h | 44 mcld::StringTable* m_pTestee;
|
| SymbolCategoryTest.h | 44 mcld::SymbolCategory* m_pTestee;
|
| SymbolTableTest.h | 44 mcld::SymbolTable<>* m_pTestee;
|
| InputTreeTest.cpp | 37 m_pTestee = new mcld::InputTree();
38 m_pBuilder->setCurrentTree(*m_pTestee);
44 delete m_pTestee;
78 InputTree::iterator node = m_pTestee->root();
90 m_pTestee->enterGroup(node, InputTree::Downward);
101 ASSERT_TRUE(m_pTestee->size()==3);
105 InputTree::iterator node = m_pTestee->root();
109 m_pTestee->insert<InputTree::Inclusive>(node, *input);
116 m_pTestee->insert<InputTree::Inclusive>(node, *input);
120 m_pTestee->enterGroup(node, InputTree::Downward)
[all...] |
| NamePoolTest.cpp | 28 m_pTestee = new NamePool(resolver, 10);
34 delete m_pTestee;
54 llvm::StringRef result1 = m_pTestee->insertString(s1);
62 llvm::StringRef result1 = m_pTestee->insertString(s1);
63 llvm::StringRef result2 = m_pTestee->insertString(s2.c_str());
79 m_pTestee->insertSymbol(name,
99 m_pTestee->insertSymbol(name,
130 m_pTestee->insertSymbol(name,
150 m_pTestee->insertSymbol(name,
163 m_pTestee->insertSymbol("Different Symbol"
[all...] |
| InputTreeTest.h | 53 mcld::InputTree* m_pTestee;
|
| LinearAllocatorTest.h | 69 Alloc* m_pTestee;
|
| RTLinearAllocatorTest.h | 68 mcld::LinearAllocator<Data,0>* m_pTestee;
|
