/external/lldb/include/lldb/Symbol/ |
H A D | LineEntry.h | 147 AddressRange range; ///< The section offset address range for this line entry. member in struct:lldb_private::LineEntry
|
/external/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFDebugAranges.h | 43 // Use append range multiple times and then call sort 78 const Range *range = m_aranges.GetEntryAtIndex (idx); local 79 if (range) 80 return range->data;
|
/external/llvm/unittests/ADT/ |
H A D | DAGDeltaAlgorithmTest.cpp | 49 std::set<unsigned> range(unsigned Start, unsigned End) { function in namespace:__anon11198 56 std::set<unsigned> range(unsigned N) { function in namespace:__anon11198 57 return range(0, N); 72 EXPECT_EQ(fixed_set(4, 1, 3, 5, 7), FDA.Run(range(20), Deps)); 91 EXPECT_EQ(fixed_set(4, 0, 1, 2, 3), FDA2.Run(range(5), Deps)); 100 EXPECT_EQ(fixed_set(2, 0, 4), FDA3.Run(range(5), Deps));
|
H A D | DeltaAlgorithmTest.cpp | 64 std::set<unsigned> range(unsigned Start, unsigned End) { function in namespace:__anon11199 71 std::set<unsigned> range(unsigned N) { function in namespace:__anon11199 72 return range(0, N); 80 EXPECT_EQ(fixed_set(3, 3, 5, 7), FDA.Run(range(20))); 85 EXPECT_EQ(range(10,20), FDA.Run(range(10,20))); 94 FDA = FixedDeltaAlgorithm(range(10)); 95 EXPECT_EQ(range(4), FDA.Run(range(4)));
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/misc/ |
H A D | FastQueue.java | 49 protected int range = -1; // how deep have we gone? field in class:FastQueue 70 public int range() { return range; } method in class:FastQueue 86 if ( absIndex>range ) range = absIndex;
|
/external/clang/include/clang/ARCMigrate/ |
H A D | ARCMT.h | 113 virtual void remove(CharSourceRange range) { } argument
|
/external/icu/icu4c/source/common/unicode/ |
H A D | usetiter.h | 83 * iteration range, if <tt>codepoint != IS_STRING</tt>. If 127 * code point range, depending on whether <tt>next()</tt> or 134 * of the range, and <tt>getCodepointEnd()</tt> returns the end 135 * of the range. 148 * Returns the end of the current code point range, if 193 * Returns the next element in the set, either a code point range 197 * range of one or more code points from <tt>getCodepoint()</tt> to 253 /** End range 260 int32_t range; member in class:UnicodeSetIterator 296 /** Load range [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | USerializedSet.java | 94 * Returns a range of characters contained in the given serialized 96 * @param rangeIndex a non-negative integer in the range <code>0.. 98 * @param range variable to receive the data in the range 101 public final boolean getRange(int rangeIndex, int[] range) { argument 108 if(range==null || range.length <2){ 113 range[0]=array[rangeIndex++]; 115 range[1]=array[rangeIndex]-1; 117 range[ [all...] |
/external/iptables/extensions/ |
H A D | libip6t_NETMAP.c | 39 struct nf_nat_range *range = cb->data; local 43 range->flags |= NF_NAT_RANGE_MAP_IPS; 45 range->min_addr.ip6[i] = cb->val.haddr.ip6[i] & 47 range->max_addr.ip6[i] = range->min_addr.ip6[i] |
|
/external/iptables/include/linux/netfilter/ |
H A D | nf_nat.h | 22 struct nf_nat_ipv4_range range[1]; member in struct:nf_nat_ipv4_multi_range_compat
|
/external/selinux/libsepol/include/sepol/policydb/ |
H A D | context.h | 29 * identity, a role, a type and a MLS range. 35 mls_range_t range; member in struct:context_struct 40 mls_range_init(&c->range); 47 if (mls_range_cpy(&dst->range, &src->range) < 0) 55 return (mls_level_eq(&c1->range.level[0], &c2->range.level[0]) && 56 mls_level_eq(&c1->range.level[1], &c2->range.level[1])); 65 mls_range_destroy(&c->range); [all...] |
/external/skia/tests/ |
H A D | ClampRangeTest.cpp | 34 static void slow_check(const SkClampRange& range, argument 36 SkASSERT(range.fCount0 + range.fCount1 + range.fCount2 == count); 41 for (int i = 0; i < range.fCount0; i++) { 42 check_value(bigfx, range.fV0); 46 for (int i = 0; i < range.fCount1; i++) { 51 for (int i = 0; i < range.fCount2; i++) { 52 check_value(bigfx, range.fV1); 62 SkClampRange range; local [all...] |
/external/webp/src/utils/ |
H A D | bit_reader_inl.h | 111 // 'range' *before* calling VP8LoadNewBytes(), even if this function doesn't 113 range_t range = br->range_; local 119 const range_t split = (range * prob) >> 8; 124 range -= split + 1; 127 range = split; 132 range -= split + 1; 136 range = split; 140 if (range <= (range_t)0x7e) { 141 const int shift = kVP8Log2Range[range]; 142 range [all...] |
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/ |
H A D | ValPixConverter.java | 33 double range = range(min, max);
34 double scale = lengthPix / range;
44 public static double range(double min, double max) {
method in class:ValPixConverter 50 double valRange = range(min, max);
76 double range = range(min, max);
77 return ((range / lengthPix) * pMult) + min;
83 * @param y Real y (range) component of the point to convert.
87 * @param minY Minimum visible real value on the y (range) axi [all...] |
/external/bison/examples/calc++/ |
H A D | stack.hh | 111 slice (const S& stack, unsigned int range) argument 113 , range_ (range)
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_coverage_mapping_libcdep.cc | 85 const auto *range = iter.next(); local 86 if (range->executable) { 87 uptr start = range->beg; 88 uptr end = range->end;
|
/external/fio/ |
H A D | tickmarks.c | 96 double graphmin, graphmax; /* graph range min and max */ 97 double range, x; local 101 range = nicenum(max - min, 0); 102 d = nicenum(range / (nticks - 1), 1); 128 printf("Testing range %g - %g\n", x, y);
|
/external/freetype/src/autofit/ |
H A D | afglobal.c | 167 AF_Script_UniRange range; local 174 * Scan all Unicode points in the range and set the corresponding 183 for ( range = script_class->script_uni_ranges; 184 range->first != 0; 185 range++ ) 187 FT_ULong charcode = range->first; 202 if ( gindex == 0 || charcode > range->last )
|
/external/google-breakpad/src/common/ |
H A D | memory_range_unittest.cc | 95 MemoryRange range; local 96 EXPECT_EQ(NULL, range.data()); 97 EXPECT_EQ(0U, range.length()); 101 MemoryRange range(kBuffer, kBufferSize); 102 EXPECT_EQ(kBufferPointer, range.data()); 103 EXPECT_EQ(kBufferSize, range.length()); 107 MemoryRange range; local 108 range.Reset(); 109 EXPECT_EQ(NULL, range.data()); 110 EXPECT_EQ(0U, range 122 MemoryRange range; local 133 MemoryRange range; local [all...] |
/external/google-breakpad/src/tools/linux/md2core/ |
H A D | minidump_memory_range_unittest.cc | 96 MinidumpMemoryRange range; local 97 EXPECT_EQ(NULL, range.data()); 98 EXPECT_EQ(0U, range.length()); 102 MinidumpMemoryRange range(kBuffer, kBufferSize); 103 EXPECT_EQ(kBufferPointer, range.data()); 104 EXPECT_EQ(kBufferSize, range.length()); 108 MinidumpMemoryRange range; local 109 range.Reset(); 110 EXPECT_EQ(NULL, range.data()); 111 EXPECT_EQ(0U, range 123 MinidumpMemoryRange range; local 134 MinidumpMemoryRange range; local [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | ContiguousSet.java | 45 * {@linkplain Range#contains contained} by the range. 47 * @throws IllegalArgumentException if neither range nor the domain has a lower bound, or if 53 Range<C> range, DiscreteDomain<C> domain) { 54 checkNotNull(range); 56 Range<C> effectiveRange = range; 58 if (!range.hasLowerBound()) { 61 if (!range.hasUpperBound()) { 71 range.lowerBound.leastValueAbove(domain), 72 range.upperBound.greatestValueBelow(domain)) > 0; 148 * Returns a range, close 52 create( Range<C> range, DiscreteDomain<C> domain) argument 153 public abstract Range<C> range(); method in class:ContiguousSet 166 public abstract Range<C> range(BoundType lowerBoundType, BoundType upperBoundType); method in class:ContiguousSet [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | ContiguousSet.java | 42 * {@linkplain Range#contains contained} by the range. 44 * @throws IllegalArgumentException if neither range nor the domain has a lower bound, or if 50 Range<C> range, DiscreteDomain<C> domain) { 51 checkNotNull(range); 53 Range<C> effectiveRange = range; 55 if (!range.hasLowerBound()) { 58 if (!range.hasUpperBound()) { 68 range.lowerBound.leastValueAbove(domain), 69 range.upperBound.greatestValueBelow(domain)) > 0; 117 * Returns a range, close 49 create( Range<C> range, DiscreteDomain<C> domain) argument 122 public abstract Range<C> range(); method in class:ContiguousSet 135 public abstract Range<C> range(BoundType lowerBoundType, BoundType upperBoundType); method in class:ContiguousSet [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | UnicodeSetIterator.java | 60 * iteration range, if <tt>codepoint != IS_STRING</tt>. If 120 if (range < endRange) { 121 loadRange(++range); 140 * Returns the next element in the set, either a code point range 144 * range of one or more code points from <tt>codepoint</tt> to 166 if (range < endRange) { 167 loadRange(++range); 205 range = 0; 209 loadRange(range); 235 private int range field in class:UnicodeSetIterator [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/ |
H A D | NumberFormatRoundTripTest.java | 82 * Return a random value from -range..+range. 85 public double randomDouble(double range) { argument 89 return random.nextDouble() * range;
|
/external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
H A D | UnicodeMapIterator.java | 63 * iteration range, if <tt>codepoint != IS_STRING</tt>. If 78 * The value associated with this element or range. 122 while (range < endRange) { 123 if (loadRange(++range) == null) { 140 * Returns the next element in the set, either a code point range 144 * range of one or more code points from <tt>codepoint</tt> to 165 while (range < endRange) { 166 if (loadRange(++range) == null) { 202 // we set them to fail this test, which will cause them to load the first range 205 range 231 private int range = 0; field in class:UnicodeMapIterator 240 loadRange(int range) argument [all...] |