/frameworks/compile/mclinker/unittests/ |
H A D | 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...] |
H A D | FileHandleTest.cpp | 23 m_pTestee = new FileHandle(); 29 delete m_pTestee; 50 ASSERT_TRUE(m_pTestee->open(path, FileHandle::ReadOnly)); 51 ASSERT_TRUE(m_pTestee->isOpened()); 52 ASSERT_TRUE(m_pTestee->isGood()); 54 ASSERT_EQ(27, m_pTestee->size()); 56 ASSERT_TRUE(m_pTestee->close()); 57 ASSERT_FALSE(m_pTestee->isOpened()); 58 ASSERT_TRUE(m_pTestee->isGood()); 60 ASSERT_EQ(0, m_pTestee [all...] |
H A D | 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());
|
H A D | 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 [all...] |
H A D | 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 [all...] |
H A D | 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 [all...] |
H A D | 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 [all...] |
H A D | PathSetTest.cpp | 20 m_pTestee = new PathSet(); 26 delete m_pTestee;
|
H A D | 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 [all...] |
H A D | 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 [all...] |
H A D | BinTreeTest.h | 46 mcld::BinaryTree<int>* m_pTestee; member in class:mcldtest::BinTreeTest
|
H A D | FileHandleTest.h | 44 mcld::FileHandle* m_pTestee; member in class:mcldtest::FileHandleTest
|
H A D | FragmentTest.h | 44 mcld::Fragment* m_pTestee; member in class:mcldtest::FragmentTest
|
H A D | MCRegionFragmentTest.h | 45 mcld::MCRegionFragment* m_pTestee; member in class:mcldtest::MCRegionFragmentTest
|
H A D | MemoryAreaTest.h | 44 mcld::MemoryArea* m_pTestee; member in class:mcldtest::MemoryAreaTest
|
H A D | NamePoolTest.h | 44 mcld::NamePool* m_pTestee; member in class:mcldtest::NamePoolTest
|
H A D | PathSetTest.h | 44 mcld::PathSet* m_pTestee; member in class:mcldtest::PathSetTest
|
H A D | PathTest.h | 39 mcld::sys::fs::Path* m_pTestee; member in class:mcldtest::PathTest
|
H A D | StringTableTest.h | 44 mcld::StringTable* m_pTestee; member in class:mcldtest::StringTableTest
|
H A D | 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 [all...] |
H A D | InputTreeTest.h | 48 mcld::InputTree* m_pTestee; member in class:mcldtest::InputTreeTest
|
H A D | SymbolCategoryTest.h | 45 mcld::SymbolCategory* m_pTestee; member in class:mcldtest::SymbolCategoryTest
|
H A D | SymbolTableTest.h | 44 mcld::SymbolTable<>* m_pTestee; member in class:mcldtest::SymbolTableTest
|
H A D | RTLinearAllocatorTest.h | 68 mcld::LinearAllocator<Data,0>* m_pTestee; member in class:mcldtest::RTLinearAllocatorTest
|
H A D | LinearAllocatorTest.h | 69 Alloc* m_pTestee; member in class:mcldtest::LinearAllocatorTest
|