Searched refs:leaked (Results 1 – 12 of 12) sorted by relevance
| /system/memory/libmemunreachable/tests/ |
| D | LeakFolding_test.cpp | 58 allocator::vector<LeakFolding::Leak> leaked(heap_); in TEST_F() local
61 ASSERT_EQ(true, folding.Leaked(leaked, &num_leaks, &leaked_bytes)); in TEST_F()
65 ASSERT_EQ(1U, leaked.size()); in TEST_F()
66 EXPECT_EQ(0U, leaked[0].referenced_count); in TEST_F()
67 EXPECT_EQ(0U, leaked[0].referenced_size); in TEST_F()
83 allocator::vector<LeakFolding::Leak> leaked(heap_); in TEST_F() local
86 ASSERT_EQ(true, folding.Leaked(leaked, &num_leaks, &leaked_bytes)); in TEST_F()
90 ASSERT_EQ(2U, leaked.size()); in TEST_F()
91 EXPECT_EQ(0U, leaked[0].referenced_count); in TEST_F()
92 EXPECT_EQ(0U, leaked[0].referenced_size); in TEST_F()
[all …]
|
| D | HeapWalker_test.cpp | 108 allocator::vector<Range> leaked(heap_); in TEST_F() local
111 ASSERT_EQ(true, heap_walker.Leaked(leaked, 100, &num_leaks, &leaked_bytes)); in TEST_F()
115 ASSERT_EQ(1U, leaked.size()); in TEST_F()
116 EXPECT_EQ(buffer_begin(buffer2), leaked[0].begin); in TEST_F()
117 EXPECT_EQ(buffer_end(buffer2), leaked[0].end); in TEST_F()
136 allocator::vector<Range> leaked(heap_); in TEST_F() local
139 ASSERT_EQ(true, heap_walker.Leaked(leaked, 100, &num_leaks, &leaked_bytes)); in TEST_F()
143 EXPECT_EQ(0U, leaked.size()); in TEST_F()
164 allocator::vector<Range> leaked(heap_); in TEST_F() local
167 ASSERT_EQ(true, heap_walker.Leaked(leaked, 100, &num_leaks, &leaked_bytes)); in TEST_F()
[all …]
|
| /system/memory/libmemunreachable/ |
| D | HeapWalker.cpp | 162 bool HeapWalker::Leaked(allocator::vector<Range>& leaked, size_t limit, size_t* num_leaks_out, in Leaked() argument
164 leaked.clear(); in Leaked()
179 leaked.push_back(it->first); in Leaked()
|
| D | LeakFolding.cpp | 110 bool LeakFolding::Leaked(allocator::vector<LeakFolding::Leak>& leaked, size_t* num_leaks_out, in Leaked() argument
123 leaked.emplace_back(Leak{leak.range, leak.scc->cuumulative_count - 1, in Leaked()
|
| D | README.md | 8 …te (upper bound) size, and the the first 32 bytes of the contents of the leaked allocation. If ma…
39 …leaked memory to the log. A summary is always written, followed by details of up to `limit` leaks…
51 …leaked memory. A summary is always written, followed by details of up to `limit` leaks. If `log_…
|
| D | LeakFolding.h | 41 bool Leaked(allocator::vector<Leak>& leaked, size_t* num_leaks_out, size_t* leak_bytes_out);
|
| D | MemUnreachable.cpp | 158 allocator::vector<LeakFolding::Leak> leaked{allocator_}; in GetUnreachableMemory() local
160 if (!folding.Leaked(leaked, num_leaks, leak_bytes)) { in GetUnreachableMemory()
168 leaks.reserve(leaked.size()); in GetUnreachableMemory()
170 for (auto& it : leaked) { in GetUnreachableMemory()
|
| /system/sepolicy/private/ |
| D | netd.te | 38 # leaked to other processes. Make sure it never leaks.
|
| /system/sepolicy/prebuilts/api/27.0/public/ |
| D | netd.te | 124 # leaked to other processes. Make sure it never leaks.
|
| /system/sepolicy/prebuilts/api/28.0/public/ |
| D | netd.te | 143 # leaked to other processes. Make sure it never leaks.
|
| /system/sepolicy/prebuilts/api/29.0/public/ |
| D | netd.te | 164 # leaked to other processes. Make sure it never leaks.
|
| /system/sepolicy/prebuilts/api/30.0/public/ |
| D | netd.te | 161 # leaked to other processes. Make sure it never leaks.
|