Home
last modified time | relevance | path

Searched refs:range (Results 1 – 25 of 154) sorted by relevance

1234567

/system/update_engine/common/
Dmulti_range_http_fetcher.cc71 Range range = ranges_[current_index_]; in StartTransfer() local
72 LOG(INFO) << "starting transfer of range " << range.ToString(); in StartTransfer()
75 base_fetcher_->SetOffset(range.offset()); in StartTransfer()
76 if (range.HasLength()) in StartTransfer()
77 base_fetcher_->SetLength(range.length()); in StartTransfer()
81 delegate_->SeekToOffset(range.offset()); in StartTransfer()
94 Range range = ranges_[current_index_]; in ReceivedBytes() local
95 if (range.HasLength()) { in ReceivedBytes()
97 std::min(next_size, range.length() - bytes_received_this_range_); in ReceivedBytes()
107 if (range.HasLength() && bytes_received_this_range_ >= range.length()) { in ReceivedBytes()
[all …]
/system/unwinding/libunwindstack/tests/
DMemoryRangeTest.cpp44 MemoryRange range(process_memory_, 9001, 1024, 0); in TEST_F() local
47 ASSERT_TRUE(range.ReadFully(0, dst.data(), dst.size())); in TEST_F()
56 MemoryRange range(process_memory_, 1000, 1024, 0); in TEST_F() local
59 ASSERT_TRUE(range.ReadFully(1020, dst.data(), 4)); in TEST_F()
65 ASSERT_FALSE(range.ReadFully(1020, dst.data(), 5)); in TEST_F()
66 ASSERT_FALSE(range.ReadFully(1024, dst.data(), 1)); in TEST_F()
67 ASSERT_FALSE(range.ReadFully(1024, dst.data(), 1024)); in TEST_F()
70 ASSERT_TRUE(range.ReadFully(1020, dst.data(), 4)); in TEST_F()
84 MemoryRange range(process_memory_, 1000, 1024, 0); in TEST_F() local
87 ASSERT_EQ(4U, range.Read(1020, dst.data(), dst.size())); in TEST_F()
[all …]
/system/extras/ext4_utils/
Dwipe.cpp41 u64 range[2]; in wipe_block_device() local
49 range[0] = 0; in wipe_block_device()
50 range[1] = len; in wipe_block_device()
51 ret = ioctl(fd, BLKSECDISCARD, &range); in wipe_block_device()
53 range[0] = 0; in wipe_block_device()
54 range[1] = len; in wipe_block_device()
55 ret = ioctl(fd, BLKDISCARD, &range); in wipe_block_device()
/system/netd/tests/benchmarks/
Dbpf_benchmark.cpp42 mBpfTestMap.writeValue(state.range(0), state.range(0), BPF_NOEXIST); in BENCHMARK_DEFINE_F()
53 mBpfTestMap.writeValue(state.range(0), state.range(0) + 1, BPF_EXIST); in BENCHMARK_DEFINE_F()
64 mBpfTestMap.deleteValue(state.range(0)); in BENCHMARK_DEFINE_F()
66 mBpfTestMap.writeValue(state.range(0), state.range(0) + 1, BPF_NOEXIST); in BENCHMARK_DEFINE_F()
/system/media/audio_utils/benchmarks/
Dprimitives_benchmark.cpp26 const size_t count = state.range(0); in BM_MemcpyToFloatFromFloatWithClamping()
27 const float srcMax = state.range(1); in BM_MemcpyToFloatFromFloatWithClamping()
53 state.SetComplexityN(state.range(0)); in BM_MemcpyToFloatFromFloatWithClamping()
59 const size_t count = state.range(0); in BM_MemcpyFloat()
82 state.SetComplexityN(state.range(0)); in BM_MemcpyFloat()
88 const size_t count = state.range(0); in BM_MemcpyToFloatFromI16()
108 state.SetComplexityN(state.range(0)); in BM_MemcpyToFloatFromI16()
115 const size_t count = state.range(0); in BM_MemcpyToI16FromFloat()
135 state.SetComplexityN(state.range(0)); in BM_MemcpyToI16FromFloat()
Dbiquad_filter_benchmark.cpp42 bool doParallel = (state.range(0) == 1); in BM_BiquadFilter1D()
421 bool isSubnormal = (state.range(0) == 1); in BM_BiquadFilter()
422 const size_t channelCount = state.range(1); in BM_BiquadFilter()
423 const size_t occupancy = state.range(2); in BM_BiquadFilter()
451 state.SetComplexityN(state.range(1)); // O(channelCount) in BM_BiquadFilter()
/system/extras/pinner/
Dpin_utils.cpp133 VmaRange range; in parse() local
137 android::base::ParseUint(token, &range.offset); in parse()
144 android::base::ParseUint(token, &range.length); in parse()
145 pin_config_file.ranges.push_back(range); in parse()
165 for (auto&& range : pin_file.ranges) { in parse()
166 cout << "offset=" << range.offset << " bytes=" << range.length << endl; in parse()
246 for (auto&& range : file.coverage.ranges) { in dump_coverages()
250 uint64_t offset_in_file = range.offset - file.info.offset_in_zip; in dump_coverages()
252 cout << "zip_offset=" << range.offset << " file_offset=" << offset_in_file in dump_coverages()
253 << " total_bytes=" << range.length << endl; in dump_coverages()
[all …]
Dmeminspect.cpp17 for (auto&& range : ranges) { in compute_total_size()
18 total_size += range.length; in compute_total_size()
24 for (auto&& range : ranges) { in apply_offset()
25 range.offset += offset; in apply_offset()
29 void VmaRangeGroup::compute_coverage(const VmaRange& range, VmaRangeGroup& out_memres) const { in compute_coverage() argument
31 VmaRange intersect_res = resident_range.intersect(range); in compute_coverage()
216 for (auto&& range : coverage.ranges) { in compute_coverage()
217 probe.compute_coverage(range, file_coverage.coverage); in compute_coverage()
/system/memory/libmemunreachable/
DLeakFolding.cpp43 leak_scc->size += node->ptr->range.size(); in ComputeDAG()
75 heap_walker_.ForEachAllocation([&](const Range& range, HeapWalker::AllocationInfo& allocation) { in FoldLeaks() argument
77 auto it = leak_map_.emplace(std::piecewise_construct, std::forward_as_tuple(range), in FoldLeaks()
78 std::forward_as_tuple(range, allocator_)); in FoldLeaks()
87 heap_walker_.ForEachPtrInRange(leak.range, in FoldLeaks()
117 leak_bytes += leak.range.size(); in Leaked()
123 leaked.emplace_back(Leak{leak.range, leak.scc->cuumulative_count - 1, in Leaked()
124 leak.scc->cuumulative_size - leak.range.size()}); in Leaked()
DLeakFolding.h36 const Range range; member
79 const Range range; member
83 LeakInfo(const Range& range, Allocator<LeakInfo> allocator) in LeakInfo()
84 : node(this, allocator), range(range), scc(nullptr) {} in LeakInfo()
DHeapWalker.cpp51 Range range{begin, end}; in Allocation() local
59 auto inserted = allocations_.insert(std::pair<Range, AllocationInfo>(range, AllocationInfo{})); in Allocation()
63 allocation_bytes_ += range.size(); in Allocation()
67 if (overlap != range) { in Allocation()
86 bool HeapWalker::WordContainsAllocationPtr(uintptr_t word_ptr, Range* range, AllocationInfo** info)… in WordContainsAllocationPtr() argument
97 *range = it->first; in WordContainsAllocationPtr()
108 Range range = to_do.back(); in RecurseRoot() local
111 walking_range_ = range; in RecurseRoot()
112 ForEachPtrInRange(range, [&](Range& ref_range, AllocationInfo* ref_info) { in RecurseRoot()
DHeapWalker.h89 void ForEachPtrInRange(const Range& range, F&& f);
100 bool WordContainsAllocationPtr(uintptr_t ptr, Range* range, AllocationInfo** info);
123 inline void HeapWalker::ForEachPtrInRange(const Range& range, F&& f) { in ForEachPtrInRange() argument
124 uintptr_t begin = (range.begin + (sizeof(uintptr_t) - 1)) & ~(sizeof(uintptr_t) - 1); in ForEachPtrInRange()
128 for (uintptr_t i = begin; i < range.end; i += sizeof(uintptr_t)) { in ForEachPtrInRange()
140 const Range& range = it.first; in ForEachAllocation() local
142 f(range, allocation); in ForEachAllocation()
/system/media/audio/include/system/audio_effects/
Daidl_effects_utils.h76 if (cap.range.getTag() == rangeTag) { in inRange()
77 const auto& ranges = cap.range.template get<rangeTag>(); in inRange()
89 if (cap.range.getTag() != RangeTag) { in getRange()
93 const auto& ranges = cap.range.template get<RangeTag>(); in getRange()
116 if (cap.range.getTag() == rangeTag) { in isRangeValid()
117 const auto& ranges = cap.range.template get<rangeTag>(); in isRangeValid()
/system/core/storaged/tools/
Dranker.py109 for j in range(8):
113 for j in range(8):
127 for j in range(8):
131 uid_io = [long(words[i+j]) for j in range(8)]
149 uid_rank = [[(uids[uid][0][i], uid) for uid in uids] for i in range(8)]
150 for i in range(8):
161 for i in range(8):
163 for j in range(min(args.uidcnt, len(uid_rank[0]))):
/system/netd/server/
DUidRanges.cpp152 for (const auto &range : mRanges) { in toString() local
153 if (length(range) == 0) { in toString()
154 StringAppendF(&s, "<BAD: %u-%u> ", range.start, range.stop); in toString()
155 } else if (length(range) == 1) { in toString()
156 StringAppendF(&s, "%u ", range.start); in toString()
158 StringAppendF(&s, "%u-%u ", range.start, range.stop); in toString()
/system/extras/tests/storage/
Dwipe_blkdev.c53 u64 range[2]; in wipe_block_device() local
57 range[0] = 0; in wipe_block_device()
58 range[1] = len; in wipe_block_device()
65 ret = ioctl(fd, req, &range); in wipe_block_device()
/system/extras/simpleperf/doc/
Dsample_filter.md36 The nearest pair of GLOBAL_BEGIN and GLOBAL_END commands makes a time range. When these commands
57 range. When these commands are used, each process has a list of time ranges, and only samples
67 For the example above, process 1 samples in time range [1000, 3000) and process 2 samples in time
68 range [2000, 4000) are reported.
78 range. When these commands are used, each thread has a list of time ranges, and only samples in the
88 For the example above, thread 1 samples in time range [1000, 3000) and thread 2 samples in time
89 range [2000, 4000) are reported.
/system/libziparchive/
Dzip_archive_benchmark.cpp58 std::unique_ptr<TemporaryFile> temp_file(CreateZip(4, int(state.range(0)))); in OpenClose()
69 std::unique_ptr<TemporaryFile> temp_file(CreateZip(4, int(state.range(0)))); in FindEntry_no_match()
87 std::unique_ptr<TemporaryFile> temp_file(CreateZip(4, int(state.range(0)))); in Iterate_all_files()
110 auto alignment = uint32_t(state.range(0)); in StartAlignedEntry()
126 const auto size = int(state.range(0)); in ExtractEntry()
151 const auto size = int(state.range(0)); in ExtractStored()
/system/vold/
Dsecdiscard.cpp183 uint64_t range[2]; in secdiscard_path() local
184 range[0] = fiemap->fm_extents[i].fe_physical; in secdiscard_path()
185 range[1] = fiemap->fm_extents[i].fe_length; in secdiscard_path()
186 if (ioctl(fs_fd.get(), BLKSECDISCARD, range) == -1) { in secdiscard_path()
188 if (!overwrite_with_zeros(fs_fd.get(), range[0], range[1])) return false; in secdiscard_path()
/system/libvintf/include/vintf/
DHalGroup.h44 auto range = mHals.equal_range(name); in getHals() local
45 for (auto it = range.first; it != range.second; ++it) { in getHals()
56 auto range = mHals.equal_range(name); in getHals() local
57 for (auto it = range.first; it != range.second; ++it) { in getHals()
/system/libvintf/
DMatrixInstance.cpp37 MatrixInstance::MatrixInstance(HalFormat format, FqInstance&& fqInstance, VersionRange&& range, in MatrixInstance() argument
41 mRange(std::move(range)), in MatrixInstance()
46 const VersionRange& range, bool optional, bool isRegex) in MatrixInstance() argument
49 mRange(range), in MatrixInstance()
DKernelConfigTypedValue.cpp79 KernelConfigRangeValue range; in matchValue() local
80 return parseRange(s, &range) && range == mRangeValue; in matchValue()
/system/libbase/
Dfile_benchmark.cpp29 CHECK_EQ(ftruncate(fd, state.range(0)), 0); in BenchmarkReadFdToString()
35 state.SetBytesProcessed(state.iterations() * state.range(0)); in BenchmarkReadFdToString()
/system/media/camera/docs/
Dplots.py52 for x in range(0, np.size(imgMap, 1)):
53 for y in range(0, np.size(imgMap, 0)):
57 axes.set_xticks(range(0, np.size(imgMap, 1)))
58 axes.set_yticks(range(0, np.size(imgMap, 0)))
185 axes.set_xticks(range(0, np.size(rgbMap, 1)))
186 axes.set_yticks(range(0, np.size(rgbMap, 0)))
/system/extras/libatrace_rust/benchmark/src/
Datrace_benchmark.cc25 std::string name(state.range(0), '0'); in BM_TracingOffAtraceBegin()
40 std::string name(state.range(0), '0'); in BM_TracingOnAtraceBegin()

1234567