| /external/syslinux/memdisk/ |
| 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[nranges].type = -1U
[all...] |
| /external/libchrome/base/metrics/ |
| 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(3)
[all...] |
| 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...] |
| /external/elfutils/tests/ |
| 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
|
| /system/update_engine/payload_generator/ |
| extent_ranges_unittest.cc | 34 void ExpectRangeEq(const ExtentRanges& ranges,
42 EXPECT_EQ(blocks, ranges.blocks()) << "line: " << line;
44 const ExtentRanges::ExtentSet& result = ranges.extent_set();
54 #define EXPECT_RANGE_EQ(ranges, var) \
56 ExpectRangeEq(ranges, var, arraysize(var), __LINE__); \
141 ExtentRanges ranges; local
145 ExpectRangeEq(ranges, expected, 0, __LINE__);
147 ranges.SubtractBlock(2);
151 ExpectRangeEq(ranges, expected, 0, __LINE__);
154 ranges.AddBlock(0)
241 ExtentRanges ranges; local
272 ExtentRanges ranges; local
291 ExtentRanges ranges; local
293 FilterExtentRanges(vector<Extent>(), ranges)); local
311 ExtentRanges ranges; local
334 ExtentRanges ranges; local
[all...] |
| /art/compiler/optimizing/ |
| live_interval_test.cc | 30 static constexpr size_t ranges[][2] = {{0, 42}}; local
31 LiveInterval* interval = BuildInterval(ranges, arraysize(ranges), allocator);
36 static constexpr size_t ranges[][2] = {{4, 12}, {14, 16}}; local
37 LiveInterval* interval = BuildInterval(ranges, arraysize(ranges), allocator);
47 static constexpr size_t ranges[][2] = {{0, 42}}; local
48 LiveInterval* interval = BuildInterval(ranges, arraysize(ranges), allocator);
57 static constexpr size_t ranges[][2] = {{4, 12}, {14, 16}} local
75 static constexpr size_t ranges[][2] = {{0, 42}}; local
85 static constexpr size_t ranges[][2] = {{4, 12}, {14, 16}}; local
196 static constexpr size_t ranges[][2] = {{0, 4}}; local
207 static constexpr size_t ranges[][2] = {{0, 4}}; local
218 static constexpr size_t ranges[][2] = {{0, 4}, {8, 12}}; local
229 static constexpr size_t ranges[][2] = {{0, 4}, {8, 12}}; local
240 static constexpr size_t ranges[][2] = {{0, 4}, {8, 12}}; local
251 static constexpr size_t ranges[][2] = {{0, 4}, {6, 10}}; local
262 static constexpr size_t ranges[][2] = {{0, 4}, {6, 10}}; local
273 static constexpr size_t ranges[][2] = {{0, 4}}; local
287 static constexpr size_t ranges[][2] = {{0, 4}}; local
298 static constexpr size_t ranges[][2] = {{2, 4}}; local
309 static constexpr size_t ranges[][2] = {{2, 4}, {8, 10}}; local
320 static constexpr size_t ranges[][2] = {{2, 4}, {10, 12}}; local
[all...] |
| /external/valgrind/coregrind/ |
| 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/ |
| 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) {
|
| /prebuilts/go/darwin-x86/src/regexp/syntax/ |
| make_perl_groups.pl | 8 # Generate table entries giving character ranges
38 my @ranges;
50 push @ranges, [$start, $i-1];
55 return @ranges;
59 my ($cname, $name, @ranges) = @_;
61 for (my $i=0; $i<@ranges; $i++) {
62 my @a = @{$ranges[$i]};
66 my $n = @ranges;
83 my @ranges = ComputeClass($cl);
84 push @entries, PrintClass(++$gen, $cl, @ranges);
[all...] |
| /prebuilts/go/linux-x86/src/regexp/syntax/ |
| make_perl_groups.pl | 8 # Generate table entries giving character ranges
38 my @ranges;
50 push @ranges, [$start, $i-1];
55 return @ranges;
59 my ($cname, $name, @ranges) = @_;
61 for (my $i=0; $i<@ranges; $i++) {
62 my @a = @{$ranges[$i]};
66 my $n = @ranges;
83 my @ranges = ComputeClass($cl);
84 push @entries, PrintClass(++$gen, $cl, @ranges);
[all...] |
| /external/icu/icu4c/source/tools/toolutil/ |
| 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);
|
| /hardware/interfaces/ir/1.0/ |
| IConsumerIr.hal | 37 * ranges. On error, returns false.
39 getCarrierFreqs() generates (bool success, vec<ConsumerIrFreqRange> ranges);
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| StringRange.java | 92 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there.
94 Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.class);
96 Ranges item = new Ranges(s);
100 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) {
101 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue());
102 for (Ranges ranges : compacted) {
103 adder.add(ranges.start(), ranges.end(shorterPairs))
120 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); local
168 private final Range[] ranges; field in class:StringRange.Ranges
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| StringRange.java | 88 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there.
90 Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.class);
92 Ranges item = new Ranges(s);
96 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) {
97 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue());
98 for (Ranges ranges : compacted) {
99 adder.add(ranges.start(), ranges.end(shorterPairs))
116 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); local
164 private final Range[] ranges; field in class:StringRange.Ranges
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableRangeSet.java | 103 ImmutableRangeSet(ImmutableList<Range<C>> ranges) {
104 this.ranges = ranges;
107 private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) {
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,
[all...] |
| /external/libmojo/base/android/library_loader/ |
| library_prefetcher.cc | 61 bool Prefetch(const std::vector<std::pair<uintptr_t, uintptr_t>>& ranges) {
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) {
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) ? 0 : 1)
197 std::vector<AddressRange> ranges; local
[all...] |
| 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.size(), 1U)
105 std::vector<NativeLibraryPrefetcher::AddressRange> ranges = { local
132 std::vector<NativeLibraryPrefetcher::AddressRange> ranges = { local
[all...] |
| 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/ |
| 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[i].length == minLength; ++i)
558 private WeightRange[] ranges = new WeightRange[7]; field in class:CollationWeights
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| 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[i].length == minLength; ++i)
556 private WeightRange[] ranges = new WeightRange[7]; field in class:CollationWeights
[all...] |
| /bionic/libc/tools/ |
| test_genseccomp.py | 134 ranges = genseccomp.convert_NRs_to_ranges([("b", 2), ("a", 1)])
135 self.assertEquals(len(ranges), 1)
136 self.assertEquals(ranges[0].begin, 1)
137 self.assertEquals(ranges[0].end, 3)
138 self.assertItemsEqual(ranges[0].names, ["a", "b"])
140 ranges = genseccomp.convert_NRs_to_ranges([("b", 3), ("a", 1)])
141 self.assertEquals(len(ranges), 2)
142 self.assertEquals(ranges[0].begin, 1)
143 self.assertEquals(ranges[0].end, 2)
144 self.assertItemsEqual(ranges[0].names, ["a"]
[all...] |
| genseccomp.py | 85 # Sort the values so we convert to ranges and binary chop
88 # Turn into a list of ranges. Keep the names for the comments
89 ranges = []
91 if not ranges:
92 ranges.append(SyscallRange(name, value))
95 last_range = ranges[-1]
99 ranges.append(SyscallRange(name, value))
100 return ranges
103 # Converts the sorted ranges of allowed syscalls to a binary tree bpf
105 # the jump ranges yet, since we don't know the size of the filter, so use
[all...] |
| /external/compiler-rt/test/msan/ |
| 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));
|
| /build/make/tools/releasetools/ |
| sparse_img.py | 151 def RangeSha1(self, ranges):
153 for data in self._GetRangeData(ranges):
157 def ReadRangeSet(self, ranges):
158 return [d for d in self._GetRangeData(ranges)]
165 ranges = self.care_map
167 ranges = ranges.subtract(self.clobbered_blocks)
168 return self.RangeSha1(ranges)
170 def WriteRangeDataToFd(self, ranges, fd):
171 for data in self._GetRangeData(ranges)
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| 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.get(i)
150 List<Range> ranges = new ArrayList<Range>(2); field in class:RangeDateRule
[all...] |
