| /frameworks/compile/mclinker/unittests/ |
| PathTest.cpp | 23 m_pTestee = new Path();
29 delete m_pTestee;
47 m_pTestee->assign(root);
48 EXPECT_TRUE(exists(*m_pTestee));
50 delete m_pTestee;
51 m_pTestee = new Path(root);
52 EXPECT_TRUE(exists(*m_pTestee));
57 m_pTestee->assign(root);
58 EXPECT_FALSE(exists(*m_pTestee));
60 delete m_pTestee;
[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_EQ(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_EQ(CHUNK_SIZE, m_pTestee->max_size());
47 ASSERT_FALSE(m_pTestee->empty());
51 Data* pointer = m_pTestee->allocate();
53 ASSERT_EQ(CHUNK_SIZE, m_pTestee->max_size());
54 ASSERT_FALSE(m_pTestee->empty());
58 Data* pointer = m_pTestee->allocate(CHUNK_SIZE+1);
60 ASSERT_EQ(0, m_pTestee->max_size())
[all...] |
| 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...] |
| PathSetTest.cpp | 20 m_pTestee = new PathSet();
26 delete m_pTestee;
|
| InputTreeTest.cpp | 23 m_pTestee = new InputTree(*m_pAlloc);
29 delete m_pTestee;
48 InputTree::iterator node = m_pTestee->root();
49 m_pTestee->insert<InputTree::Inclusive>(node, "FileSpec", "path1");
55 ASSERT_TRUE(m_pTestee->hasInput());
56 ASSERT_EQ(1, m_pTestee->numOfInputs());
60 m_pTestee->enterGroup(node, InputTree::Downward);
68 ASSERT_TRUE(m_pTestee->hasInput());
69 ASSERT_FALSE(m_pTestee->numOfInputs()==0);
71 ASSERT_TRUE(m_pTestee->size()==2)
[all...] |
| SymbolCategoryTest.cpp | 24 m_pTestee = new SymbolCategory();
30 delete m_pTestee;
72 m_pTestee->add(ee);
73 m_pTestee->add(dd);
74 m_pTestee->add(cc);
75 m_pTestee->add(bb);
76 m_pTestee->add(aa);
78 SymbolCategory::iterator sym = m_pTestee->begin();
89 ASSERT_EQ(2, m_pTestee->numOfLocals());
90 ASSERT_EQ(1, m_pTestee->numOfCommons())
[all...] |
| BinTreeTest.h | 46 mcld::BinaryTree<int>* m_pTestee;
|
| MCRegionFragmentTest.h | 45 mcld::MCRegionFragment* m_pTestee;
|
| MemoryAreaTest.h | 44 mcld::MemoryArea* m_pTestee;
|
| PathSetTest.h | 44 mcld::PathSet* m_pTestee;
|
| PathTest.h | 39 mcld::sys::fs::Path* m_pTestee;
|
| StrSymPoolTest.h | 44 mcld::StrSymPool* m_pTestee;
|
| StringTableTest.h | 44 mcld::StringTable* m_pTestee;
|
| SymbolTableTest.h | 44 mcld::SymbolTable<>* m_pTestee;
|
| StrSymPoolTest.cpp | 23 m_pTestee = new StrSymPool(1, 1, resolver);
29 delete m_pTestee;
49 const char *result1 = m_pTestee->insertString(s1);
57 const char *result1 = m_pTestee->insertString(s1);
58 const char *result2 = m_pTestee->insertString(s2.c_str());
74 LDSymbol *sym = m_pTestee->insertSymbol(name,
92 LDSymbol *sym2 = m_pTestee->insertSymbol(name,
124 LDSymbol *sym = m_pTestee->insertSymbol(name,
143 LDSymbol *sym2 = m_pTestee->insertSymbol(name,
156 LDSymbol *sym3 = m_pTestee->insertSymbol("Different symbol"
[all...] |
| InputTreeTest.h | 48 mcld::InputTree* m_pTestee;
|
| SymbolCategoryTest.h | 45 mcld::SymbolCategory* m_pTestee;
|
| LinearAllocatorTest.h | 69 Alloc* m_pTestee;
|
| RTLinearAllocatorTest.h | 68 mcld::LinearAllocator<Data,0>* m_pTestee;
|
| /frameworks/compile/mclinker/templates/ |
| implTest.cpp | 20 m_pTestee = new ${class_name}();
26 delete m_pTestee;
|
| headerTest.h | 44 mcld::${class_name}* m_pTestee;
|
