| /external/syslinux/memdisk/ |
| D | e820func.c | 29 struct e820range ranges[MAXRANGES]; variable
34 memset(ranges, 0, sizeof(ranges)); in e820map_init()
36 ranges[1].type = -1U; in e820map_init()
44 ranges[i] = ranges[i - 1]; in insertrange_at()
46 ranges[where].start = start; in insertrange_at()
47 ranges[where].type = type; in insertrange_at()
50 ranges[nranges].start = 0ULL; in insertrange_at()
51 ranges[nranges].type = -1U; in insertrange_at()
68 while (start > ranges[i].start && ranges[i].type != -1U) { in insertrange()
69 oldtype = ranges[i].type; in insertrange()
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | ImmutableRangeSet.java | 103 ImmutableRangeSet(ImmutableList<Range<C>> ranges) { in ImmutableRangeSet() argument
104 this.ranges = ranges; in ImmutableRangeSet()
107 private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) { in ImmutableRangeSet() argument
108 this.ranges = ranges; in ImmutableRangeSet()
112 private transient final ImmutableList<Range<C>> ranges; field in ImmutableRangeSet
116 int index = SortedLists.binarySearch(ranges, in encloses()
122 return index != -1 && ranges.get(index).encloses(otherRange); in encloses()
127 int index = SortedLists.binarySearch(ranges, in rangeContaining()
134 Range<C> range = ranges.get(index); in rangeContaining()
142 if (ranges.isEmpty()) { in span()
[all …]
|
| D | ImmutableRangeMap.java | 154 private final ImmutableList<Range<K>> ranges; field in ImmutableRangeMap
157 ImmutableRangeMap(ImmutableList<Range<K>> ranges, ImmutableList<V> values) { in ImmutableRangeMap() argument
158 this.ranges = ranges; in ImmutableRangeMap()
165 int index = SortedLists.binarySearch(ranges, Range.<K>lowerBoundFn(), in get()
170 Range<K> range = ranges.get(index); in get()
178 int index = SortedLists.binarySearch(ranges, Range.<K>lowerBoundFn(), in getEntry()
183 Range<K> range = ranges.get(index); in getEntry()
190 if (ranges.isEmpty()) { in span()
193 Range<K> firstRange = ranges.get(0); in span()
194 Range<K> lastRange = ranges.get(ranges.size() - 1); in span()
[all …]
|
| /external/valgrind/coregrind/ |
| D | m_rangemap.c | 54 XArray* ranges; member
77 rm->ranges = VG_(newXA)( alloc_fn, cc, free_fn, sizeof(Range) ); in VG_()
83 Word i = VG_(addToXA)(rm->ranges, &r); in VG_()
85 vg_assert(VG_(sizeXA)(rm->ranges) == 1); in VG_()
94 vg_assert(rm->ranges); in VG_()
95 VG_(deleteXA)(rm->ranges); in VG_()
110 Range* rng = VG_(indexXA)(rm->ranges, i); in VG_()
120 Range* rng = (Range*)VG_(indexXA)(rm->ranges, i); in VG_()
128 vg_assert(rm && rm->ranges); in VG_()
129 Word size = VG_(sizeXA)(rm->ranges); in VG_()
[all …]
|
| /external/libchrome/base/metrics/ |
| D | sample_vector_unittest.cc | 23 BucketRanges ranges(3); in TEST() local
24 ranges.set_range(0, 1); in TEST()
25 ranges.set_range(1, 5); in TEST()
26 ranges.set_range(2, 10); in TEST()
27 SampleVector samples(1, &ranges); in TEST()
50 BucketRanges ranges(3); in TEST() local
51 ranges.set_range(0, 1); in TEST()
52 ranges.set_range(1, 250000000); in TEST()
53 ranges.set_range(2, 500000000); in TEST()
54 SampleVector samples(1, &ranges); in TEST()
[all …]
|
| D | bucket_ranges_unittest.cc | 15 BucketRanges ranges(5); in TEST() local
16 ASSERT_EQ(5u, ranges.size()); in TEST()
17 ASSERT_EQ(4u, ranges.bucket_count()); in TEST()
20 EXPECT_EQ(0, ranges.range(i)); in TEST()
22 EXPECT_EQ(0u, ranges.checksum()); in TEST()
24 ranges.set_range(3, 100); in TEST()
25 EXPECT_EQ(100, ranges.range(3)); in TEST()
61 BucketRanges ranges(3); in TEST() local
62 ranges.set_range(0, 0); in TEST()
63 ranges.set_range(1, 1); in TEST()
[all …]
|
| D | histogram.cc | 119 BucketRanges* ranges = new BucketRanges(bucket_count_ + 1); in CreateRanges() local
120 Histogram::InitializeBucketRanges(minimum_, maximum_, ranges); in CreateRanges()
121 return ranges; in CreateRanges()
126 virtual std::unique_ptr<HistogramBase> HeapAlloc(const BucketRanges* ranges) { in HeapAlloc() argument
127 return WrapUnique(new Histogram(name_, minimum_, maximum_, ranges)); in HeapAlloc()
278 const BucketRanges* ranges, in PersistentCreate() argument
284 return WrapUnique(new Histogram(name, minimum, maximum, ranges, counts, in PersistentCreate()
301 BucketRanges* ranges) { in InitializeBucketRanges() argument
307 ranges->set_range(bucket_index, current); in InitializeBucketRanges()
308 size_t bucket_count = ranges->bucket_count(); in InitializeBucketRanges()
[all …]
|
| D | histogram_unittest.cc | 208 BucketRanges ranges(9); in TEST_P() local
209 Histogram::InitializeBucketRanges(1, 64, &ranges); in TEST_P()
210 EXPECT_EQ(0, ranges.range(0)); in TEST_P()
213 EXPECT_EQ(power_of_2, ranges.range(i)); in TEST_P()
216 EXPECT_EQ(HistogramBase::kSampleType_MAX, ranges.range(8)); in TEST_P()
221 EXPECT_TRUE(ranges.Equals(histogram->bucket_ranges())); in TEST_P()
252 BucketRanges ranges(9); in TEST_P() local
253 LinearHistogram::InitializeBucketRanges(1, 7, &ranges); in TEST_P()
256 EXPECT_EQ(i, ranges.range(i)); in TEST_P()
257 EXPECT_EQ(HistogramBase::kSampleType_MAX, ranges.range(8)); in TEST_P()
[all …]
|
| D | histogram_base_unittest.cc | 118 std::vector<HistogramBase::Sample> ranges; in TEST_F() local
119 ranges.push_back(13); in TEST_F()
120 ranges.push_back(5); in TEST_F()
121 ranges.push_back(9); in TEST_F()
124 "TestHistogram", ranges, HistogramBase::kIPCSerializationSourceFlag); in TEST_F()
170 std::vector<HistogramBase::Sample> ranges; in TEST_F() local
171 ranges.push_back(1); in TEST_F()
172 ranges.push_back(2); in TEST_F()
173 ranges.push_back(4); in TEST_F()
174 ranges.push_back(8); in TEST_F()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| D | CollationWeights.java | 101 int minLength=ranges[0].length; in allocWeights()
115 for (int i = 0; i < rangeCount && ranges[i].length == minLength; ++i) { in allocWeights()
116 lengthenRange(ranges[i]); in allocWeights()
127 if(rangeCount < ranges.length) { in allocWeights()
128 ranges[rangeCount] = null; // force a crash when going out of bounds in allocWeights()
145 WeightRange range = ranges[rangeIndex]; in nextWeight()
446 ranges[0] = middle; in getWeightRanges()
452 ranges[rangeCount++]=upper[length]; in getWeightRanges()
455 ranges[rangeCount++]=lower[length]; in getWeightRanges()
463 for(int i = 0; i < rangeCount && ranges[i].length <= (minLength + 1); ++i) { in allocWeightsInShortRanges()
[all …]
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| D | CollationWeights.java | 99 int minLength=ranges[0].length; in allocWeights()
113 for (int i = 0; i < rangeCount && ranges[i].length == minLength; ++i) { in allocWeights()
114 lengthenRange(ranges[i]); in allocWeights()
125 if(rangeCount < ranges.length) { in allocWeights()
126 ranges[rangeCount] = null; // force a crash when going out of bounds in allocWeights()
143 WeightRange range = ranges[rangeIndex]; in nextWeight()
444 ranges[0] = middle; in getWeightRanges()
450 ranges[rangeCount++]=upper[length]; in getWeightRanges()
453 ranges[rangeCount++]=lower[length]; in getWeightRanges()
461 for(int i = 0; i < rangeCount && ranges[i].length <= (minLength + 1); ++i) { in allocWeightsInShortRanges()
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | StringRange.java | 98 for (Ranges ranges : compacted) { in compact()
99 adder.add(ranges.start(), ranges.end(shorterPairs)); in compact()
116 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); in compact() local
119 for (Iterator<Ranges> it = ranges.iterator(); it.hasNext();) { in compact()
130 return ranges; in compact()
164 private final Range[] ranges; field in StringRange.Ranges
167 ranges = new Range[array.length]; in Ranges()
169 ranges[i] = new Range(array[i], array[i]); in Ranges()
174 for (int i = ranges.length-1; i >= 0; --i) { in merge()
176 if (ranges[i].max != other.ranges[i].min-1) { // not adjacent in merge()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | StringRange.java | 102 for (Ranges ranges : compacted) { in compact()
103 adder.add(ranges.start(), ranges.end(shorterPairs)); in compact()
120 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); in compact() local
123 for (Iterator<Ranges> it = ranges.iterator(); it.hasNext();) { in compact()
134 return ranges; in compact()
168 private final Range[] ranges; field in StringRange.Ranges
171 ranges = new Range[array.length]; in Ranges()
173 ranges[i] = new Range(array[i], array[i]); in Ranges()
178 for (int i = ranges.length-1; i >= 0; --i) { in merge()
180 if (ranges[i].max != other.ranges[i].min-1) { // not adjacent in merge()
[all …]
|
| /external/icu/icu4c/source/i18n/ |
| D | collationweights.cpp | 374 uprv_memcpy(ranges, &middle, sizeof(WeightRange)); in getWeightRanges()
380 uprv_memcpy(ranges+rangeCount, upper+length, sizeof(WeightRange)); in getWeightRanges()
384 uprv_memcpy(ranges+rangeCount, lower+length, sizeof(WeightRange)); in getWeightRanges()
394 for(int32_t i = 0; i < rangeCount && ranges[i].length <= (minLength + 1); ++i) { in allocWeightsInShortRanges()
395 if(n <= ranges[i].count) { in allocWeightsInShortRanges()
397 if(ranges[i].length > minLength) { in allocWeightsInShortRanges()
401 ranges[i].count = n; in allocWeightsInShortRanges()
411 uprv_sortArray(ranges, rangeCount, sizeof(WeightRange), in allocWeightsInShortRanges()
417 n -= ranges[i].count; // still >0 in allocWeightsInShortRanges()
430 ranges[minLengthRangeCount].length == minLength; in allocWeightsInMinLengthRanges()
[all …]
|
| D | collationsettings.cpp | 86 const uint32_t *ranges, int32_t rangesLength, in aliasReordering() argument
94 (ranges[0] & 0xffff) == 0 && (ranges[rangesLength - 1] & 0xffff) != 0)) { in aliasReordering()
107 (ranges[firstSplitByteRangeIndex] & 0xff0000) == 0) { in aliasReordering()
117 U_ASSERT(table[ranges[firstSplitByteRangeIndex] >> 24] == 0); in aliasReordering()
118 minHighNoReorder = ranges[rangesLength - 1] & 0xffff0000; in aliasReordering()
119 reorderRanges = ranges + firstSplitByteRangeIndex; in aliasReordering()
145 const uint32_t *ranges = reinterpret_cast<uint32_t *>(rangesList.getBuffer()); in setReordering() local
151 U_ASSERT((ranges[0] & 0xffff) == 0 && (ranges[rangesLength - 1] & 0xffff) != 0); in setReordering()
152 minHighNoReorder = ranges[rangesLength - 1] & 0xffff0000; in setReordering()
160 uint32_t pair = ranges[i]; in setReordering()
[all …]
|
| /external/libmojo/base/android/library_loader/ |
| D | library_prefetcher_unittest.cc | 72 std::vector<NativeLibraryPrefetcher::AddressRange> ranges; in TEST() local
74 &ranges); in TEST()
75 EXPECT_EQ(ranges.size(), 2U); in TEST()
76 EXPECT_EQ(ranges[0].first, 0x1U); in TEST()
77 EXPECT_EQ(ranges[0].second, 0x2U); in TEST()
78 EXPECT_EQ(ranges[1].first, 0x3U); in TEST()
79 EXPECT_EQ(ranges[1].second, 0x4U); in TEST()
91 std::vector<NativeLibraryPrefetcher::AddressRange> ranges; in TEST() local
93 &ranges); in TEST()
94 EXPECT_EQ(ranges.size(), 1U); in TEST()
[all …]
|
| D | library_prefetcher.cc | 61 bool Prefetch(const std::vector<std::pair<uintptr_t, uintptr_t>>& ranges) { in Prefetch() argument
62 for (const auto& range : ranges) { in Prefetch()
93 std::vector<AddressRange>* ranges) { in FilterLibchromeRangesOnlyIfPossible() argument
106 ranges->push_back(std::make_pair(region.start, region.end)); in FilterLibchromeRangesOnlyIfPossible()
111 bool NativeLibraryPrefetcher::FindRanges(std::vector<AddressRange>* ranges) { in FindRanges() argument
126 FilterLibchromeRangesOnlyIfPossible(regions_to_prefetch, ranges); in FindRanges()
143 std::vector<AddressRange> ranges; in ForkAndPrefetchNativeLibrary() local
144 if (!FindRanges(&ranges)) in ForkAndPrefetchNativeLibrary()
151 _exit(Prefetch(ranges) ? 0 : 1); in ForkAndPrefetchNativeLibrary()
169 const std::vector<AddressRange>& ranges) { in PercentageOfResidentCode() argument
[all …]
|
| /external/v8/tools/profviz/ |
| D | composer.js | 67 this.ranges = []; property in PlotScriptComposer.TimerEvent
169 var ranges = [];
172 ranges.push(
175 return ranges;
178 function MergeRanges(ranges) { argument
179 ranges.sort(function(a, b) { return a.start - b.start; });
182 for (var i = 0; i < ranges.length; i = j) {
183 var merge_start = ranges[i].start;
185 var merge_end = ranges[i].end;
186 for (j = i + 1; j < ranges.length; j++) {
[all …]
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| D | u_prim_restart.c | 132 struct range *ranges; member
146 info->ranges = MALLOC(info->max * sizeof(struct range)); in add_range()
147 if (!info->ranges) { in add_range()
153 info->ranges = REALLOC(info->ranges, in add_range()
156 if (!info->ranges) { in add_range()
164 info->ranges[info->count].start = start; in add_range()
165 info->ranges[info->count].count = count; in add_range()
184 struct range_info ranges = {0}; in util_draw_vbo_without_prim_restart() local
220 if (!add_range(&ranges, info->start + start, count)) { \ in util_draw_vbo_without_prim_restart()
258 for (i = 0; i < ranges.count; i++) { in util_draw_vbo_without_prim_restart()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | LiveInterval.cpp | 40 size_t Len = ranges.size(); in find()
54 std::lower_bound(ranges.begin(), ranges.end(), End); in killedInRange()
57 if (r == ranges.begin()) in killedInRange()
97 if (i != ranges.begin()) --i; in overlapsFrom()
103 if (j != other.ranges.begin()) --j; in overlapsFrom()
167 assert(I != ranges.end() && "Not a valid interval!"); in extendIntervalEndTo()
172 for (; MergeTo != ranges.end() && NewEnd >= MergeTo->end; ++MergeTo) { in extendIntervalEndTo()
180 ranges.erase(llvm::next(I), MergeTo); in extendIntervalEndTo()
185 if (Next != ranges.end() && Next->start <= I->end && Next->valno == ValNo) { in extendIntervalEndTo()
187 ranges.erase(Next); in extendIntervalEndTo()
[all …]
|
| /external/linux-kselftest/tools/testing/selftests/x86/ |
| D | mpx-dig.c | 82 struct vaddr_range *ranges; variable
119 ranges[nr_ranges_populated].start = start; in __pid_load_vaddrs()
120 ranges[nr_ranges_populated].end = end; in __pid_load_vaddrs()
134 if (!ranges) { in pid_load_vaddrs()
136 ranges = malloc(nr_ranges_allocated * sizeof(ranges[0])); in pid_load_vaddrs()
138 nr_ranges_allocated, ranges); in pid_load_vaddrs()
139 assert(ranges != NULL); in pid_load_vaddrs()
148 ranges = realloc(ranges, in pid_load_vaddrs()
149 nr_ranges_allocated * sizeof(ranges[0])); in pid_load_vaddrs()
151 pid, nr_ranges_allocated, ranges); in pid_load_vaddrs()
[all …]
|
| /external/easymock/src/org/easymock/internal/ |
| D | Results.java | 29 private final LinkedList<Range> ranges = new LinkedList<Range>(); field in Results
34 if (!ranges.isEmpty()) { in add()
35 Range lastRange = ranges.getLast(); in add()
41 ranges.add(range); in add()
47 for (int i = 0; i < ranges.size(); i++) { in next()
48 Range interval = ranges.get(i); in next()
74 for (Range interval : ranges) { in getMainInterval()
|
| /external/pdfium/core/fpdfapi/font/ |
| D | cpdf_cmap.cpp | 186 const std::vector<CPDF_CMap::CodeRange>& ranges) { in CheckFourByteCodeRange() argument
187 for (size_t i = ranges.size(); i > 0; i--) { in CheckFourByteCodeRange()
189 if (ranges[seg].m_CharSize < size) in CheckFourByteCodeRange()
193 if (codes[iChar] < ranges[seg].m_Lower[iChar] || in CheckFourByteCodeRange()
194 codes[iChar] > ranges[seg].m_Upper[iChar]) { in CheckFourByteCodeRange()
199 if (iChar == ranges[seg].m_CharSize) in CheckFourByteCodeRange()
202 return (size == ranges[seg].m_CharSize) ? 2 : 1; in CheckFourByteCodeRange()
209 const std::vector<CPDF_CMap::CodeRange>& ranges) { in GetFourByteCharSizeImpl() argument
210 if (ranges.empty()) in GetFourByteCharSizeImpl()
219 for (size_t j = 0; j < ranges.size(); j++) { in GetFourByteCharSizeImpl()
[all …]
|
| /external/fonttools/Lib/fontTools/ttLib/tables/ |
| D | otTables.py | 45 ranges = rawTable["RangeRecord"]
50 sorted_ranges = sorted(ranges, key=lambda a: a.StartCoverageIndex)
51 if ranges != sorted_ranges:
53 ranges = sorted_ranges
55 for r in ranges:
92 ranges = [[last]]
95 ranges[-1].append(last)
96 ranges.append([glyphID])
98 ranges[-1].append(last)
100 if brokenOrder or len(ranges) * 3 < len(glyphs): # 3 words vs. 1 word
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| D | RangeDateRule.java | 53 ranges.add(new Range(start, rule)); in add()
64 if (index == ranges.size()) { in firstAfter()
133 int lastIndex = ranges.size(); in startIndex()
135 for (int i = 0; i < ranges.size(); i++) { in startIndex()
136 Range r = ranges.get(i); in startIndex()
146 return (index < ranges.size()) ? ranges.get(index) in rangeAt()
150 List<Range> ranges = new ArrayList<Range>(2); field in RangeDateRule
|