HomeSort by relevance Sort by last modified time
    Searched refs:Leaked (Results 1 - 7 of 7) sorted by null

  /system/core/libmemunreachable/tests/
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())
    [all...]
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())
    [all...]
  /system/core/libmemunreachable/
LeakFolding.h 36 bool Leaked(allocator::vector<Leak>& leaked,
HeapWalker.h 71 bool Leaked(allocator::vector<Range>&, size_t limit, size_t* num_leaks,
HeapWalker.cpp 119 bool HeapWalker::Leaked(allocator::vector<Range>& leaked, size_t limit,
121 leaked.clear();
136 leaked.push_back(it->first);
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,
126 leaked.emplace_back(Leak{leak.range,
MemUnreachable.cpp 134 heap_walker_.Leaked(leaked1, 0, num_leaks, leak_bytes);
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 139 milliseconds