| /system/memory/libmemunreachable/ |
| D | HeapWalker.h | 31 struct Range { struct
36 bool operator==(const Range& other) const { argument
39 bool operator!=(const Range& other) const { return !(*this == other); }
44 bool operator()(const Range& a, const Range& b) const { return a.end <= b.begin; } in operator()
84 bool Leaked(allocator::vector<Range>&, size_t limit, size_t* num_leaks, size_t* leak_bytes);
89 void ForEachPtrInRange(const Range& range, F&& f);
99 void RecurseRoot(const Range& root);
100 bool WordContainsAllocationPtr(uintptr_t ptr, Range* range, AllocationInfo** info);
105 using AllocationMap = allocator::map<Range, AllocationInfo, compare_range>;
108 Range valid_allocations_range_;
[all …]
|
| D | HeapWalker.cpp | 51 Range range{begin, end}; in Allocation()
59 auto inserted = allocations_.insert(std::pair<Range, AllocationInfo>(range, AllocationInfo{})); in Allocation()
66 Range overlap = inserted.first->first; in Allocation()
86 bool HeapWalker::WordContainsAllocationPtr(uintptr_t word_ptr, Range* range, AllocationInfo** info)… in WordContainsAllocationPtr()
95 AllocationMap::iterator it = allocations_.find(Range{value, value + 1}); in WordContainsAllocationPtr()
105 void HeapWalker::RecurseRoot(const Range& root) { in RecurseRoot()
106 allocator::vector<Range> to_do(1, root, allocator_); in RecurseRoot()
108 Range range = to_do.back(); in RecurseRoot()
112 ForEachPtrInRange(range, [&](Range& ref_range, AllocationInfo* ref_info) { in RecurseRoot()
118 walking_range_ = Range{0, 0}; in RecurseRoot()
[all …]
|
| D | LeakFolding.h | 36 const Range range;
79 const Range range;
83 LeakInfo(const Range& range, Allocator<LeakInfo> allocator) in LeakInfo()
93 allocator::map<Range, LeakInfo, compare_range> leak_map_;
|
| D | LeakFolding.cpp | 75 heap_walker_.ForEachAllocation([&](const Range& range, HeapWalker::AllocationInfo& allocation) { in FoldLeaks()
88 [&](Range& ptr_range, HeapWalker::AllocationInfo* ptr_info) { in FoldLeaks()
|
| D | MemUnreachable.cpp | 146 allocator::vector<Range> leaked1{allocator_}; in GetUnreachableMemory()
|
| /system/update_engine/common/ |
| D | multi_range_http_fetcher.h | 62 ranges_.push_back(Range(offset, size)); in AddRange()
65 void AddRange(off_t offset) { ranges_.push_back(Range(offset)); } in AddRange()
128 class Range {
130 Range(off_t offset, size_t length) : offset_(offset), length_(length) {} in Range() function
131 explicit Range(off_t offset) : offset_(offset), length_(0) {} in Range() function
145 typedef std::vector<Range> RangesVect;
|
| D | multi_range_http_fetcher.cc | 73 Range range = ranges_[current_index_]; in StartTransfer()
96 Range range = ranges_[current_index_]; in ReceivedBytes()
140 Range range = ranges_[current_index_]; in TransferEnded()
187 std::string MultiRangeHttpFetcher::Range::ToString() const { in ToString()
198 for (const Range& range : ranges_) { in SetOffset()
|
| /system/memory/libmemunreachable/tests/ |
| D | HeapWalker_test.cpp | 108 allocator::vector<Range> leaked(heap_); in TEST_F()
136 allocator::vector<Range> leaked(heap_); in TEST_F()
164 allocator::vector<Range> leaked(heap_); in TEST_F()
189 allocator::vector<Range> leaked(heap_); in TEST_F()
213 allocator::vector<Range> leaked(heap_); in TEST_F()
|
| /system/libhwbinder/vts/performance/ |
| D | Benchmark.cpp | 127 BENCHMARK(BM_sendVec_binderize)->RangeMultiplier(2)->Range(4, 65536); in main()
129 BENCHMARK(BM_sendVec_passthrough)->RangeMultiplier(2)->Range(4, 65536); in main()
|
| D | Benchmark_binder.cpp | 93 BENCHMARK(BM_sendVec_binder)->RangeMultiplier(2)->Range(4, 65536);
|
| /system/bt/gd/packet/ |
| D | fragmenting_inserter_unittest.cc | 172 INSTANTIATE_TEST_CASE_P(chopomatic, FragmentingTest, ::testing::Range<size_t>(1, kPacketSize + 1));
|
| /system/logging/logd/ |
| D | README.replay.md | 27 4. Range (the range of time that the logs cover in seconds)
|
| D | README.property | 65 - number - support multipliers (K or M) for convenience. Range is limited
|
| /system/media/camera/docs/ |
| D | html.mako | 206 <th class="th_range">Range</th>
230 <th class="th_range">Range</th>
|
| /system/teeui/libteeui/include/teeui/ |
| D | utils.h | 968 template <typename Iterator> class Range {
973 Range(Iterator begin, Iterator end) : begin_(begin), end_(end) {}
978 template <typename Iterator> Range<Iterator> makeRange(Iterator begin, Iterator end) {
|
| /system/bt/gd/hci/ |
| D | hci_packets.pdl | 887 max_period_length : 16, // Range 0x0003 to 0xffff (times 1.28s)
888 min_period_length : 16, // Range 0x0002 to 0xfffe (times 1.28s)
1891 page_scan_interval : 16, // Range: 0x0012 to 0x1000; only even values are valid * 0x625 ms
1896 page_scan_interval : 16, // Range: 0x0012 to 0x1000; only even values are valid * 0x625 ms
1913 inquiry_scan_interval : 16, // Range: 0x0012 to 0x1000; only even values are valid * 0x625 ms
1914 inquiry_scan_window : 16, // Range: 0x0011 to 0x1000
1922 inquiry_scan_interval : 16, // Range: 0x0012 to 0x1000; only even values are valid * 0x625 ms
1923 inquiry_scan_window : 16, // Range: 0x0011 to 0x1000
|