/external/libcxxabi/src/ |
D | cxa_demangle.cpp | 37 const char* parse_type(const char* first, const char* last, C& db); 39 const char* parse_encoding(const char* first, const char* last, C& db); 41 const char* parse_name(const char* first, const char* last, C& db, 44 const char* parse_expression(const char* first, const char* last, C& db); 46 const char* parse_template_args(const char* first, const char* last, C& db); 48 const char* parse_operator_name(const char* first, const char* last, C& db); 50 const char* parse_unqualified_name(const char* first, const char* last, C& db); 52 const char* parse_decltype(const char* first, const char* last, C& db); 97 print_state(const char* msg, const char* first, const char* last, const C& db) in print_state() argument 100 for (; first != last; ++first) in print_state() [all …]
|
/external/skia/src/core/ |
D | SkDeque.cpp | 118 Block* last = fBackBlock; in push_back() local 121 if (NULL == last->fBegin) { in push_back() 123 last->fBegin = last->start(); in push_back() 124 end = last->fBegin + fElemSize; in push_back() 126 end = last->fEnd + fElemSize; in push_back() 127 if (end > last->fStop) { // no more room in this chunk in push_back() 129 last = this->allocateBlock(fAllocCount); in push_back() 130 last->fPrev = fBackBlock; in push_back() 131 fBackBlock->fNext = last; in push_back() 132 fBackBlock = last; in push_back() [all …]
|
/external/webrtc/src/system_wrappers/source/spreadsortlib/ |
D | spreadsort.hpp | 60 …find_extremes(RandomAccessIter current, RandomAccessIter last, RandomAccessIter & max, RandomAcces… in find_extremes() argument 64 while(++current < last) { in find_extremes() 75 …find_extremes(RandomAccessIter current, RandomAccessIter last, RandomAccessIter & max, RandomAcces… in find_extremes() argument 78 while(++current < last) { in find_extremes() 125 …spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_… in spread_sort_rec() argument 131 find_extremes(first, last, max, min); in spread_sort_rec() 136 …unsigned log_divisor = get_log_divisor(last - first, rough_log_2_size((size_t)(*max >> 0) - (*min … in spread_sort_rec() 144 for (RandomAccessIter current = first; current != last;) in spread_sort_rec() 180 bins[bin_count - 1] = last; in spread_sort_rec() 187 size_t max_count = get_max_count(log_divisor, last - first); in spread_sort_rec() [all …]
|
/external/google-breakpad/src/common/linux/ |
D | linux_libc_support_unittest.cc | 171 const char* last; in TEST() local 173 last = my_read_hex_ptr(&result, ""); in TEST() 175 ASSERT_EQ(*last, 0); in TEST() 177 last = my_read_hex_ptr(&result, "0"); in TEST() 179 ASSERT_EQ(*last, 0); in TEST() 181 last = my_read_hex_ptr(&result, "0123"); in TEST() 183 ASSERT_EQ(*last, 0); in TEST() 185 last = my_read_hex_ptr(&result, "0123a"); in TEST() 187 ASSERT_EQ(*last, 0); in TEST() 189 last = my_read_hex_ptr(&result, "0123a-"); in TEST() [all …]
|
/external/v8/test/mjsunit/ |
D | cyrillic.js | 36 last: "\u044f", // ya property 51 last: "\u03c9", // omega property 71 var last = lc ? chars.last : chars.LAST; variable 74 var last_other_case = lc ? chars.LAST : chars.last; 76 assertTrue(Range(first, last).test(first), 1); 77 assertTrue(Range(first, last).test(middle), 2); 78 assertTrue(Range(first, last).test(last), 3); 80 assertFalse(Range(first, last).test(first_other_case), 4); 81 assertFalse(Range(first, last).test(middle_other_case), 5); 82 assertFalse(Range(first, last).test(last_other_case), 6); [all …]
|
/external/jetty/src/java/org/eclipse/jetty/server/ |
D | InclusiveByteRange.java | 55 long last = 0; field in InclusiveByteRange 57 public InclusiveByteRange(long first, long last) in InclusiveByteRange() argument 60 this.last = last; in InclusiveByteRange() 70 return last; in getLast() 102 long last = -1; in satisfiableRanges() local 114 last = Long.parseLong(t.substring(d + 1).trim()); in satisfiableRanges() 124 last = Long.parseLong(t.substring(d + 1).trim()); in satisfiableRanges() 129 if (first == -1 && last == -1) in satisfiableRanges() 132 if (first != -1 && last != -1 && (first > last)) in satisfiableRanges() 137 InclusiveByteRange range = new InclusiveByteRange(first,last); in satisfiableRanges() [all …]
|
/external/deqp/framework/delibs/decpp/ |
D | deRandom.hpp | 58 void choose (InputIter first, InputIter last, OutputIter result, int numItems); 61 T choose (InputIter first, InputIter last); 65 T chooseWeighted (InputIter first, InputIter last, WeightIter weight); 68 void shuffle (Iterator first, Iterator last); 103 void Random::choose (InputIter first, InputIter last, OutputIter result, int numItems) in choose() argument 110 for (ndx = 0; first != last; ++first, ++ndx) in choose() 126 T Random::choose (InputIter first, InputIter last) in choose() argument 129 DE_ASSERT(first != last); in choose() 130 choose(first, last, &val, 1); in choose() 135 T Random::chooseWeighted (InputIter first, InputIter last, WeightIter weight) in chooseWeighted() argument [all …]
|
/external/opencv/cv/src/ |
D | _cvkdtree.hpp | 84 int dimension_of_highest_variance(__instype * first, __instype * last, in dimension_of_highest_variance() argument 86 assert(last - first > 0); in dimension_of_highest_variance() 92 for (__instype * k = first; k < last; ++k) in dimension_of_highest_variance() 94 mean /= last - first; in dimension_of_highest_variance() 96 for (__instype * k = first; k < last; ++k) { in dimension_of_highest_variance() 100 var /= last - first; in dimension_of_highest_variance() 117 __instype * median_partition(__instype * first, __instype * last, in median_partition() argument 119 assert(last - first > 0); in median_partition() 120 __instype *k = first + (last - first) / 2; in median_partition() 121 median_partition(first, last, k, dim, ctor); in median_partition() [all …]
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
D | InsnList.java | 65 private AbstractInsnNode last; field in InsnList 99 return last; in getLast() 230 last = insn; in set() 264 if (last == null) { in add() 266 last = insn; in add() 268 last.next = insn; in add() 269 insn.prev = last; in add() 271 last = insn; in add() 291 if (last == null) { in add() 293 last = insns.last; in add() [all …]
|
/external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
D | Visitor.java | 64 Object last = null; in doAt() local 71 doBetween(c, last, item); in doAt() 73 doAt(last=item); in doAt() 75 doAfter(c, last); in doAt() 86 Object last = null; in doAt() local 96 cpr = last == cpr0 ? cpr1 : cpr0; // make sure we don't override last in doAt() 105 doBetween(c, last, item); in doAt() 107 doAt(last = item); in doAt() 109 doAfter(c, last); in doAt() 114 Object last = null; in doAt() local [all …]
|
/external/llvm/bindings/python/llvm/ |
D | object.py | 132 last = None 137 last = Section(sections) 139 last.cache() 141 yield last 144 last.expire() 146 if last is not None: 147 last.expire() 160 last = None 165 last = Symbol(symbols, self) 167 last.cache() [all …]
|
/external/bison/examples/calc++/ |
D | location.hh | 163 position last = loc.end - 1; in operator <<() local 165 if (last.filename in operator <<() 167 || *loc.begin.filename != *last.filename)) in operator <<() 168 ostr << '-' << last; in operator <<() 169 else if (loc.begin.line != last.line) in operator <<() 170 ostr << '-' << last.line << '.' << last.column; in operator <<() 171 else if (loc.begin.column != last.column) in operator <<() 172 ostr << '-' << last.column; in operator <<()
|
/external/zlib/src/examples/ |
D | gun.c | 156 last = have ? (have--, (int)(*next++)) : -1) 203 int last; /* last byte read by NEXT(), or -1 if EOF */ in lunpipe() local 227 if (last == -1) in lunpipe() 251 final = prev = (unsigned)last; /* low 8 bits of code */ in lunpipe() 254 if (last & 1) { /* code must be < 256 */ in lunpipe() 258 rem = (unsigned)last >> 1; /* remaining 7 bits */ in lunpipe() 287 code += (unsigned)last << left; /* middle (or high) bits of code */ in lunpipe() 293 code += (unsigned)last << left; /* high bits of code */ in lunpipe() 299 rem = (unsigned)last >> (8 - left); /* unused bits from last byte */ in lunpipe() 385 int ret, first, last; in gunpipe() local [all …]
|
D | gzjoin.c | 284 int last; /* true if processing the last block */ in gzcopy() local 313 last = start[0] & 1; in gzcopy() 314 if (last && clr) in gzcopy() 343 if (last) in gzcopy() 353 last = strm.next_in[-1] & pos; in gzcopy() 354 if (last && clr) in gzcopy() 366 last = strm.next_in[0] & 1; in gzcopy() 367 if (last && clr) in gzcopy() 380 last = in->next[-1]; in gzcopy() 383 putc(last, out); in gzcopy() [all …]
|
/external/selinux/libsepol/cil/src/ |
D | cil_list.c | 173 struct cil_list_item *last = item; in cil_list_append_item() local 183 while (last->next != NULL) { in cil_list_append_item() 184 last = last->next; in cil_list_append_item() 189 list->tail = last; in cil_list_append_item() 194 list->tail = last; in cil_list_append_item() 200 struct cil_list_item *last = item; in cil_list_prepend_item() local 210 while (last->next != NULL) { in cil_list_prepend_item() 211 last = last->next; in cil_list_prepend_item() 216 list->tail = last; in cil_list_prepend_item() 220 last->next = list->head; in cil_list_prepend_item()
|
/external/valgrind/coregrind/ |
D | m_options.c | 326 HChar const* last = VG_(clo_trace_children_skip); in VG_() local 328 while (*last) { in VG_() 331 HChar const* first = consume_commas(last); in VG_() 332 last = consume_field(first); in VG_() 333 if (first == last) in VG_() 335 vg_assert(last > first); in VG_() 338 patt = VG_(calloc)("m_options.swttc.1", last - first + 1, 1); in VG_() 339 VG_(memcpy)(patt, first, last - first); in VG_() 340 vg_assert(patt[last-first] == 0); in VG_() 351 HChar const* last = VG_(clo_trace_children_skip_by_arg); in VG_() local [all …]
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
D | util.rb | 154 range.exclude_end? ? last >= range.last : last > range.last 156 range.exclude_end? ? last.succ >= range.last : last >= range.last
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
D | MultidimensionalCounter.java | 65 private final int last; field in MultidimensionalCounter 85 counter[last] = -1; in Iterator() 105 for (int i = last; i >= 0; i--) { in next() 170 last = dimension - 1; in MultidimensionalCounter() 171 int tS = size[last]; in MultidimensionalCounter() 172 for (int i = 0; i < last; i++) { in MultidimensionalCounter() 180 uniCounterOffset[last] = 0; in MultidimensionalCounter() 224 for (int i = 0; i < last; i++) { in getCounts() 242 indices[last] = idx; in getCounts() 271 return count + c[last]; in getCount()
|
/external/libcxx/test/std/experimental/string.view/string.view.iterators/ |
D | rbegin.pass.cpp | 27 const size_t last = s.size() - 1; in test() local 28 assert( *b == s[last]); in test() 29 assert( &*b == &s[last]); in test() 30 assert( *cb1 == s[last]); in test() 31 assert(&*cb1 == &s[last]); in test() 32 assert( *cb2 == s[last]); in test() 33 assert(&*cb2 == &s[last]); in test()
|
/external/dhcpcd/ |
D | eloop.c | 65 struct event *e, *last = NULL; in add_event() local 74 last = e; in add_event() 87 if (last) in add_event() 88 last->next = e; in add_event() 96 struct event *e, *last = NULL; in delete_event() local 100 if (last) in delete_event() 101 last->next = e->next; in delete_event() 108 last = e; in delete_event() 189 struct timeout *t, *tt, *last = NULL; in v_delete_q_timeouts() local 203 if (last) in v_delete_q_timeouts() [all …]
|
/external/pdfium/third_party/freetype/src/base/ |
D | ftoutln.c | 88 FT_Int last; /* index of last point in contour */ in FT_Outline_Decompose() local 93 last = outline->contours[n]; in FT_Outline_Decompose() 94 if ( last < 0 ) in FT_Outline_Decompose() 96 limit = outline->points + last; in FT_Outline_Decompose() 102 v_last = outline->points[last]; in FT_Outline_Decompose() 120 if ( FT_CURVE_TAG( outline->tags[last] ) == FT_CURVE_TAG_ON ) in FT_Outline_Decompose() 282 first = last + 1; in FT_Outline_Decompose() 552 FT_Int first, last; in FT_Outline_Reverse() local 562 last = outline->contours[n]; in FT_Outline_Reverse() 567 FT_Vector* q = outline->points + last; in FT_Outline_Reverse() [all …]
|
/external/freetype/src/base/ |
D | ftoutln.c | 88 FT_Int last; /* index of last point in contour */ in FT_Outline_Decompose() local 93 last = outline->contours[n]; in FT_Outline_Decompose() 94 if ( last < 0 ) in FT_Outline_Decompose() 96 limit = outline->points + last; in FT_Outline_Decompose() 102 v_last = outline->points[last]; in FT_Outline_Decompose() 120 if ( FT_CURVE_TAG( outline->tags[last] ) == FT_CURVE_TAG_ON ) in FT_Outline_Decompose() 282 first = (FT_UInt)last + 1; in FT_Outline_Decompose() 552 FT_Int first, last; in FT_Outline_Reverse() local 562 last = outline->contours[n]; in FT_Outline_Reverse() 567 FT_Vector* q = outline->points + last; in FT_Outline_Reverse() [all …]
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/ |
D | BasicPeriodFormatter.java | 110 int last = counts.length - 1; in format() local 112 while (last > first && (mask & (1 << last)) == 0) --last; in format() 116 for (int i = first; i <= last; ++i) { in format() 146 boolean multiple = first != last; in format() 152 for (int i = first, j = i; i <= last; i = j) { in format() 160 while (++j < last && (mask & (1 << j)) == 0) { in format() 168 if (i == last) { in format() 176 boolean isLast = i == last; in format() 182 if (customs.separatorVariant != ESeparatorVariant.NONE && j <= last) { in format() 184 boolean beforeLast = j == last; in format()
|
/external/wpa_supplicant_8/src/utils/ |
D | edit.c | 178 struct edit_history *h, *match = NULL, *last = NULL; in history_add() local 189 last = h; in history_add() 200 if (count >= HISTORY_MAX && last) { in history_add() 201 dl_list_del(&last->list); in history_add() 202 os_free(last); in history_add() 561 static enum edit_key_code esc_seq_to_key1_no(char last) in esc_seq_to_key1_no() argument 563 switch (last) { in esc_seq_to_key1_no() 578 static enum edit_key_code esc_seq_to_key1_shift(char last) in esc_seq_to_key1_shift() argument 580 switch (last) { in esc_seq_to_key1_shift() 595 static enum edit_key_code esc_seq_to_key1_alt(char last) in esc_seq_to_key1_alt() argument [all …]
|
/external/chromium-trace/trace-viewer/tracing/third_party/tvcm/third_party/rjsmin/ |
D | rjsmin.py | 137 first, last, result = None, None, [] 139 if last is None: 140 first = last = char 141 elif last + 1 == char: 142 last = char 144 result.append((first, last)) 145 first = last = char 146 if last is not None: 147 result.append((first, last)) 150 last > first + 1 and '-' or '', [all …]
|