Searched refs:leaked (Results 1 - 6 of 6) sorted by relevance
/system/core/libmemunreachable/tests/ |
H A D | LeakFolding_test.cpp | 56 allocator::vector<LeakFolding::Leak> leaked(heap_); 59 ASSERT_EQ(true, folding.Leaked(leaked, &num_leaks, &leaked_bytes)); 63 ASSERT_EQ(1U, leaked.size()); 64 EXPECT_EQ(0U, leaked[0].referenced_count); 65 EXPECT_EQ(0U, leaked[0].referenced_size); 81 allocator::vector<LeakFolding::Leak> leaked(heap_); 84 ASSERT_EQ(true, folding.Leaked(leaked, &num_leaks, &leaked_bytes)); 88 ASSERT_EQ(2U, leaked.size()); 89 EXPECT_EQ(0U, leaked[0].referenced_count); 90 EXPECT_EQ(0U, leaked[ [all...] |
H A D | HeapWalker_test.cpp | 88 allocator::vector<Range> leaked(heap_); 91 ASSERT_EQ(true, heap_walker.Leaked(leaked, 100, &num_leaks, &leaked_bytes)); 95 ASSERT_EQ(1U, leaked.size()); 96 EXPECT_EQ(buffer_begin(buffer2), leaked[0].begin); 97 EXPECT_EQ(buffer_end(buffer2), leaked[0].end); 116 allocator::vector<Range> leaked(heap_); 119 ASSERT_EQ(true, heap_walker.Leaked(leaked, 100, &num_leaks, &leaked_bytes)); 123 EXPECT_EQ(0U, leaked.size()); 144 allocator::vector<Range> leaked(heap_); 147 ASSERT_EQ(true, heap_walker.Leaked(leaked, 10 [all...] |
/system/core/libmemunreachable/ |
H A D | HeapWalker.cpp | 119 bool HeapWalker::Leaked(allocator::vector<Range>& leaked, size_t limit, argument 121 leaked.clear(); 136 leaked.push_back(it->first);
|
H A D | LeakFolding.h | 36 bool Leaked(allocator::vector<Leak>& leaked,
|
H A D | LeakFolding.cpp | 75 // Find all leaked allocations insert them into leak_map_ and leak_graph_ 87 // Find references between leaked allocations and connect them in leak_graph_ 113 bool LeakFolding::Leaked(allocator::vector<LeakFolding::Leak>& leaked, argument 126 leaked.emplace_back(Leak{leak.range,
|
H A D | MemUnreachable.cpp | 145 allocator::vector<LeakFolding::Leak> leaked{allocator_}; 147 if (!folding.Leaked(leaked, num_leaks, leak_bytes)) { 155 leaks.reserve(leaked.size()); 157 for (auto& it: leaked) {
|
Completed in 66 milliseconds