/external/syslinux/memdisk/ |
H A D | e820func.c | 29 struct e820range ranges[MAXRANGES]; variable in typeref:struct:e820range 34 memset(ranges, 0, sizeof(ranges)); 36 ranges[1].type = -1U; 44 ranges[i] = ranges[i - 1]; 46 ranges[where].start = start; 47 ranges[where].type = type; 50 ranges[nranges].start = 0ULL; 51 ranges[nrange [all...] |
H A D | e820.h | 26 extern struct e820range ranges[];
|
H A D | e820test.c | 41 ranges[i].start, 42 ranges[i + 1].start - ranges[i].start, ranges[i].type);
|
/external/libchrome/base/metrics/ |
H A D | bucket_ranges_unittest.cc | 15 BucketRanges ranges(5); 16 ASSERT_EQ(5u, ranges.size()); 17 ASSERT_EQ(4u, ranges.bucket_count()); 20 EXPECT_EQ(0, ranges.range(i)); 22 EXPECT_EQ(0u, ranges.checksum()); 24 ranges.set_range(3, 100); 25 EXPECT_EQ(100, ranges.range(3)); 29 // Compare empty ranges. 38 // Compare full filled ranges. 61 BucketRanges ranges( [all...] |
H A D | sample_vector_unittest.cc | 23 BucketRanges ranges(3); 24 ranges.set_range(0, 1); 25 ranges.set_range(1, 5); 26 ranges.set_range(2, 10); 27 SampleVector samples(1, &ranges); 50 BucketRanges ranges(3); 51 ranges.set_range(0, 1); 52 ranges.set_range(1, 250000000); 53 ranges.set_range(2, 500000000); 54 SampleVector samples(1, &ranges); [all...] |
H A D | histogram.cc | 119 BucketRanges* ranges = new BucketRanges(bucket_count_ + 1); local 120 Histogram::InitializeBucketRanges(minimum_, maximum_, ranges); 121 return ranges; 126 virtual std::unique_ptr<HistogramBase> HeapAlloc(const BucketRanges* ranges) { argument 127 return WrapUnique(new Histogram(name_, minimum_, maximum_, ranges)); 278 const BucketRanges* ranges, 284 return WrapUnique(new Histogram(name, minimum, maximum, ranges, counts, 293 // ranges(i) == ranges(i + 1) 301 BucketRanges* ranges) { 274 PersistentCreate( const std::string& name, Sample minimum, Sample maximum, const BucketRanges* ranges, HistogramBase::AtomicCount* counts, HistogramBase::AtomicCount* logged_counts, uint32_t counts_size, HistogramSamples::Metadata* meta, HistogramSamples::Metadata* logged_meta) argument 299 InitializeBucketRanges(Sample minimum, Sample maximum, BucketRanges* ranges) argument 363 Sample Histogram::ranges(uint32_t i) const { function in class:base::Histogram 500 Histogram(const std::string& name, Sample minimum, Sample maximum, const BucketRanges* ranges) argument 512 Histogram(const std::string& name, Sample minimum, Sample maximum, const BucketRanges* ranges, HistogramBase::AtomicCount* counts, HistogramBase::AtomicCount* logged_counts, uint32_t counts_size, HistogramSamples::Metadata* meta, HistogramSamples::Metadata* logged_meta) argument 749 BucketRanges* ranges = new BucketRanges(bucket_count_ + 1); variable 815 PersistentCreate( const std::string& name, Sample minimum, Sample maximum, const BucketRanges* ranges, HistogramBase::AtomicCount* counts, HistogramBase::AtomicCount* logged_counts, uint32_t counts_size, HistogramSamples::Metadata* meta, HistogramSamples::Metadata* logged_meta) argument 849 LinearHistogram(const std::string& name, Sample minimum, Sample maximum, const BucketRanges* ranges) argument 856 LinearHistogram(const std::string& name, Sample minimum, Sample maximum, const BucketRanges* ranges, HistogramBase::AtomicCount* counts, HistogramBase::AtomicCount* logged_counts, uint32_t counts_size, HistogramSamples::Metadata* meta, HistogramSamples::Metadata* logged_meta) argument 889 InitializeBucketRanges(Sample minimum, Sample maximum, BucketRanges* ranges) argument 941 BucketRanges* ranges = new BucketRanges(3 + 1); variable 964 PersistentCreate( const std::string& name, const BucketRanges* ranges, HistogramBase::AtomicCount* counts, HistogramBase::AtomicCount* logged_counts, HistogramSamples::Metadata* meta, HistogramSamples::Metadata* logged_meta) argument 979 BooleanHistogram(const std::string& name, const BucketRanges* ranges) argument 983 BooleanHistogram(const std::string& name, const BucketRanges* ranges, HistogramBase::AtomicCount* counts, HistogramBase::AtomicCount* logged_counts, HistogramSamples::Metadata* meta, HistogramSamples::Metadata* logged_meta) argument 1031 std::vector<int> ranges = *custom_ranges_; variable 1072 PersistentCreate( const std::string& name, const BucketRanges* ranges, HistogramBase::AtomicCount* counts, HistogramBase::AtomicCount* logged_counts, uint32_t counts_size, HistogramSamples::Metadata* meta, HistogramSamples::Metadata* logged_meta) argument 1103 CustomHistogram(const std::string& name, const BucketRanges* ranges) argument 1110 CustomHistogram(const std::string& name, const BucketRanges* ranges, HistogramBase::AtomicCount* counts, HistogramBase::AtomicCount* logged_counts, uint32_t counts_size, HistogramSamples::Metadata* meta, HistogramSamples::Metadata* logged_meta) argument [all...] |
/external/elfutils/tests/ |
H A D | run-dwarf-ranges.sh | 20 testfiles debug-ranges-no-lowpc.o 22 testrun_compare ${abs_builddir}/dwarf-ranges debug-ranges-no-lowpc.o 0xb <<\EOF
|
/external/valgrind/coregrind/ |
H A D | m_rangemap.c | 54 XArray* ranges; member in struct:_RangeMap 77 rm->ranges = VG_(newXA)( alloc_fn, cc, free_fn, sizeof(Range) ); 83 Word i = VG_(addToXA)(rm->ranges, &r); 85 vg_assert(VG_(sizeXA)(rm->ranges) == 1); 94 vg_assert(rm->ranges); 95 VG_(deleteXA)(rm->ranges); 110 Range* rng = VG_(indexXA)(rm->ranges, i); 120 Range* rng = (Range*)VG_(indexXA)(rm->ranges, i); 128 vg_assert(rm && rm->ranges); 129 Word size = VG_(sizeXA)(rm->ranges); 149 XArray* ranges = rm->ranges; local 165 XArray* ranges = rm->ranges; local 188 XArray* ranges = rm->ranges; local [all...] |
/external/easymock/src/org/easymock/internal/ |
H A D | Results.java | 29 private final LinkedList<Range> ranges = new LinkedList<Range>();
field in class:Results 34 if (!ranges.isEmpty()) {
35 Range lastRange = ranges.getLast();
41 ranges.add(range);
47 for (int i = 0; i < ranges.size(); i++) {
48 Range interval = ranges.get(i);
74 for (Range interval : ranges) {
|
/external/icu/icu4c/source/tools/toolutil/ |
H A D | denseranges.h | 16 * Helper code for finding a small number of dense ranges. 25 * Does it make sense to write 1..capacity ranges? 26 * Returns 0 if not, otherwise the number of ranges. 31 * @param ranges Output ranges array. 32 * @param capacity Maximum number of ranges. 33 * @return Minimum number of ranges (at most capacity) that have the desired density, 39 int32_t ranges[][2], int32_t capacity);
|
H A D | denseranges.cpp | 16 * Helper code for finding a small number of dense ranges. 89 * Does it make sense to write 1..capacity ranges? 90 * Returns 0 if not, otherwise the number of ranges. 95 * @param ranges Output ranges array. 96 * @param capacity Maximum number of ranges. 97 * @return Minimum number of ranges (at most capacity) that have the desired density, 103 int32_t ranges[][2], int32_t capacity) { 114 ranges[0][0]=minValue; 115 ranges[ 101 uprv_makeDenseRanges(const int32_t values[], int32_t length, int32_t density, int32_t ranges[][2], int32_t capacity) argument [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
H A D | StringRange.java | 92 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there. 102 for (Ranges ranges : compacted) { 103 adder.add(ranges.start(), ranges.end(shorterPairs)); 120 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); 123 for (Iterator<Ranges> it = ranges.iterator(); it.hasNext();) { 134 return ranges; 168 private final Range[] ranges; field in class:StringRange.Ranges 171 ranges = new Range[array.length]; 173 ranges[ [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | StringRange.java | 88 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there. 98 for (Ranges ranges : compacted) { 99 adder.add(ranges.start(), ranges.end(shorterPairs)); 116 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); 119 for (Iterator<Ranges> it = ranges.iterator(); it.hasNext();) { 130 return ranges; 164 private final Range[] ranges; field in class:StringRange.Ranges 167 ranges = new Range[array.length]; 169 ranges[ [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | ImmutableRangeSet.java | 103 ImmutableRangeSet(ImmutableList<Range<C>> ranges) { argument 104 this.ranges = ranges; 107 private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) { argument 108 this.ranges = ranges; 112 private transient final ImmutableList<Range<C>> ranges; field in class:ImmutableRangeSet 116 int index = SortedLists.binarySearch(ranges, 122 return index != -1 && ranges.get(index).encloses(otherRange); 127 int index = SortedLists.binarySearch(ranges, 512 private final ImmutableList<Range<C>> ranges; field in class:ImmutableRangeSet.AsSetSerializedForm 515 AsSetSerializedForm(ImmutableList<Range<C>> ranges, DiscreteDomain<C> domain) argument 578 addAll(RangeSet<C> ranges) argument 594 private final ImmutableList<Range<C>> ranges; field in class:ImmutableRangeSet.SerializedForm 596 SerializedForm(ImmutableList<Range<C>> ranges) argument [all...] |
H A D | ImmutableRangeMap.java | 88 * A builder for immutable range maps. Overlapping ranges are prohibited. 102 * @throws IllegalArgumentException if {@code range} overlaps with any other ranges inserted 115 "Overlapping ranges: range " + range + " overlaps with entry " + entry); 127 * @throws IllegalArgumentException if any of the ranges in {@code rangeMap} overlap with ranges 154 private final ImmutableList<Range<K>> ranges; field in class:ImmutableRangeMap 157 ImmutableRangeMap(ImmutableList<Range<K>> ranges, ImmutableList<V> values) { argument 158 this.ranges = ranges; 165 int index = SortedLists.binarySearch(ranges, Rang [all...] |
/external/libmojo/base/android/library_loader/ |
H A D | library_prefetcher.cc | 61 bool Prefetch(const std::vector<std::pair<uintptr_t, uintptr_t>>& ranges) { argument 62 for (const auto& range : ranges) { 93 std::vector<AddressRange>* ranges) { 106 ranges->push_back(std::make_pair(region.start, region.end)); 111 bool NativeLibraryPrefetcher::FindRanges(std::vector<AddressRange>* ranges) { argument 126 FilterLibchromeRangesOnlyIfPossible(regions_to_prefetch, ranges); 138 // Looking for ranges is done before the fork, to avoid syscalls and/or memory 143 std::vector<AddressRange> ranges; 144 if (!FindRanges(&ranges)) 151 _exit(Prefetch(ranges) 91 FilterLibchromeRangesOnlyIfPossible( const std::vector<base::debug::MappedMemoryRegion>& regions, std::vector<AddressRange>* ranges) argument 168 PercentageOfResidentCode( const std::vector<AddressRange>& ranges) argument 197 std::vector<AddressRange> ranges; local [all...] |
H A D | library_prefetcher_unittest.cc | 72 std::vector<NativeLibraryPrefetcher::AddressRange> ranges; local 74 &ranges); 75 EXPECT_EQ(ranges.size(), 2U); 76 EXPECT_EQ(ranges[0].first, 0x1U); 77 EXPECT_EQ(ranges[0].second, 0x2U); 78 EXPECT_EQ(ranges[1].first, 0x3U); 79 EXPECT_EQ(ranges[1].second, 0x4U); 91 std::vector<NativeLibraryPrefetcher::AddressRange> ranges; local 93 &ranges); 94 EXPECT_EQ(ranges 105 std::vector<NativeLibraryPrefetcher::AddressRange> ranges = { local 132 std::vector<NativeLibraryPrefetcher::AddressRange> ranges = { local [all...] |
H A D | library_prefetcher.h | 30 // Finds the ranges matching the native library, forks a low priority 31 // process pre-fetching these ranges and wait()s for it. 42 // Filters the regions to keep only libchrome ranges if possible. 45 std::vector<AddressRange>* ranges); 46 // Finds the ranges matching the native library in /proc/self/maps. 48 static bool FindRanges(std::vector<AddressRange>* ranges); 50 // Returns the percentage of the given address ranges currently resident in 52 static int PercentageOfResidentCode(const std::vector<AddressRange>& ranges);
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
H A D | CollationWeights.java | 76 * what ranges to use for a given number of weights between (excluding) 79 * @param lowerLimit A collation element weight; the ranges will be filled to cover 81 * @param upperLimit A collation element weight; the ranges will be filled to cover 89 // which ranges to use for a given number of weights between (excluding) 94 // printf("error: unable to get Weight ranges\n"); 98 /* try until we find suitably large ranges */ 101 int minLength=ranges[0].length; 113 /* no good match, lengthen all minLength ranges and iterate */ 114 // printf("lengthen the short ranges from %ld bytes to %ld and iterate\n", minLength, minLength+1); 115 for (int i = 0; i < rangeCount && ranges[ 558 private WeightRange[] ranges = new WeightRange[7]; field in class:CollationWeights [all...] |
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
H A D | CollationWeights.java | 74 * what ranges to use for a given number of weights between (excluding) 77 * @param lowerLimit A collation element weight; the ranges will be filled to cover 79 * @param upperLimit A collation element weight; the ranges will be filled to cover 87 // which ranges to use for a given number of weights between (excluding) 92 // printf("error: unable to get Weight ranges\n"); 96 /* try until we find suitably large ranges */ 99 int minLength=ranges[0].length; 111 /* no good match, lengthen all minLength ranges and iterate */ 112 // printf("lengthen the short ranges from %ld bytes to %ld and iterate\n", minLength, minLength+1); 113 for (int i = 0; i < rangeCount && ranges[ 556 private WeightRange[] ranges = new WeightRange[7]; field in class:CollationWeights [all...] |
/external/compiler-rt/test/msan/ |
H A D | ifaddrs.cc | 22 ranges.push_back(std::make_pair((void *)addr, (size_t)size)); \ 38 std::vector<std::pair<void *, size_t> > ranges; local 51 for (int i = 0; i < ranges.size(); i++) 52 assert(0 == __msan_test_shadow(ranges[i].first, ranges[i].second));
|
/external/icu/android_icu4j/src/main/java/android/icu/util/ |
H A D | RangeDateRule.java | 33 // public RangeDateRule(Range[] ranges) 35 // for (int i = 0; i < ranges.length; i++) { 36 // this.ranges.addElement(ranges[i]); 53 ranges.add(new Range(start, rule)); 64 if (index == ranges.size()) { 130 * returns an index >= ranges.size() if there is none 133 int lastIndex = ranges.size(); 135 for (int i = 0; i < ranges.size(); i++) { 136 Range r = ranges 150 List<Range> ranges = new ArrayList<Range>(2); field in class:RangeDateRule [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
H A D | RangeDateRule.java | 33 // public RangeDateRule(Range[] ranges) 35 // for (int i = 0; i < ranges.length; i++) { 36 // this.ranges.addElement(ranges[i]); 55 ranges.add(new Range(start, rule)); 67 if (index == ranges.size()) { 136 * returns an index >= ranges.size() if there is none 139 int lastIndex = ranges.size(); 141 for (int i = 0; i < ranges.size(); i++) { 142 Range r = ranges 156 List<Range> ranges = new ArrayList<Range>(2); field in class:RangeDateRule [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_prim_restart.c | 132 struct range *ranges; member in struct:range_info 146 info->ranges = MALLOC(info->max * sizeof(struct range)); 147 if (!info->ranges) { 152 /* grow the ranges[] array */ 153 info->ranges = REALLOC(info->ranges, 156 if (!info->ranges) { 164 info->ranges[info->count].start = start; 165 info->ranges[info->count].count = count; 184 struct range_info ranges local [all...] |
/external/v8/tools/profviz/ |
H A D | composer.js | 67 this.ranges = []; 169 var ranges = []; 172 ranges.push( 175 return ranges; 178 function MergeRanges(ranges) { 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 [all...] |