/external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
D | SDL_qsort.c | 110 typedef struct { char * first; char * last; } stack_entry; member 111 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;} 112 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;} 113 #define doLeft {first=ffirst;llast=last;continue;} 114 #define doRight {ffirst=first;last=llast;continue;} 117 last=llast=stack[stacktop].last;\ 187 { size_t l=last-ffirst,r=llast-first; \ 199 if ((size_t)(last-first)>PIVOT_THRESHOLD*sz) mid=pivot_big(first,mid,last,sz,compare);\ 202 if (compare(mid,last)>0) { \ 203 swapper(mid,last); \ [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/chromium_org/third_party/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/chromium_org/chrome/common/extensions/docs/examples/apps/calculator/tests/ |
D | utilities.js | 60 var last = this.display[this.display.length - 1]; 62 accumulator: last && last[0] || null, 63 operator: last && last[1] || null, 64 operand: last && last[2] || null 319 var last = expected[expected.length - 1]; 320 var empty = (last && !last[0] && !last[1] && !last[2] && !last[3]); 321 var operand = last && last.slice(2).join(''); 328 expected.splice(-1, 1, [operand, last[1], operand], ['', element, '']); 414 var last = expected[expected.length - 1]; 415 var prefix = (last && !last[0] && last.length > 3 && last[2]) || ''; [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/chromium_org/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/oprofile/daemon/ |
D | opd_mangling.c | 69 mangle_filename(struct sfile * last, struct sfile const * sf, int counter, int cg) in mangle_filename() argument 109 if (last->kernel) { in mangle_filename() 110 values.cg_image_name = last->kernel->name; in mangle_filename() 111 } else if (last->anon) { in mangle_filename() 113 values.cg_image_name = mangle_anon(last->anon); in mangle_filename() 114 values.anon_name = last->anon->name; in mangle_filename() 116 values.cg_image_name = find_cookie(last->cookie); in mangle_filename() 141 int opd_open_sample_file(odb_t *file, struct sfile *last, in opd_open_sample_file() argument 150 mangled = mangle_filename(last, sf, counter, cg); in opd_open_sample_file() 161 if (sf != last) in opd_open_sample_file() [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/chromium_org/sandbox/linux/seccomp-bpf/ |
D | syscall_iterator_unittest.cc | 23 for (uint32_t last = next; !iter.Done(); last = next) { in SANDBOX_TEST() local 25 SANDBOX_ASSERT(last < next); in SANDBOX_TEST() 42 for (uint32_t last = next; next < MAX_PUBLIC_SYSCALL + 1; last = next) { in SANDBOX_TEST() local 43 SANDBOX_ASSERT((next = iter.Next()) == last + 1); in SANDBOX_TEST() 58 for (uint32_t last = next; next < MAX_PRIVATE_SYSCALL + 1; last = next) { in SANDBOX_TEST() local 59 SANDBOX_ASSERT((next = iter.Next()) == last + 1); in SANDBOX_TEST() 73 for (uint32_t last = next; next < MAX_SYSCALL + 1; last = next) { in SANDBOX_TEST() local 74 SANDBOX_ASSERT((next = iter.Next()) == last + 1); in SANDBOX_TEST()
|
/external/oprofile/libregex/tests/ |
D | regex_test.cpp | 36 string test, expect, last; in do_test() local 38 while (getline(fin, last)) { in do_test() 39 last = trim(last); in do_test() 40 if (last.length() == 0 || last[0] == '#') in do_test() 44 test = last; in do_test() 47 expect = last; in do_test()
|
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/ |
D | rjsmin.py | 125 first, last, result = None, None, [] 127 if last is None: 128 first = last = char 129 elif last + 1 == char: 130 last = char 132 result.append((first, last)) 133 first = last = char 134 if last is not None: 135 result.append((first, last)) 138 last > first + 1 and '-' or '', [all …]
|
/external/llvm/bindings/python/llvm/ |
D | object.py | 129 last = None 134 last = Section(sections) 136 last.cache() 138 yield last 141 last.expire() 143 if last is not None: 144 last.expire() 157 last = None 162 last = Symbol(symbols, self) 164 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/chromium_org/third_party/WebKit/Source/core/rendering/ |
D | RenderTableRow.cpp | 113 RenderObject* last = beforeChild; in addChild() local 114 if (!last) in addChild() 115 last = lastChild(); in addChild() 116 if (last && last->isAnonymous() && last->isTableCell() && !last->isBeforeOrAfterContent()) { in addChild() 117 if (beforeChild == last) in addChild() 118 beforeChild = last->firstChild(); in addChild() 119 last->addChild(child, beforeChild); in addChild() 132 …if (last && !last->isTableCell() && last->parent() && last->parent()->isAnonymous() && !last->pare… in addChild() 133 last->parent()->addChild(child, beforeChild); in addChild()
|
/external/chromium_org/third_party/bintrees/bintrees/ |
D | rbtree.py | 163 last = 0 181 if node is parent[last]: 182 grand_grand_parent[direction2] = jsw_single(grand_parent, 1 - last) 184 grand_grand_parent[direction2] = jsw_double(grand_parent, 1 - last) 191 last = direction 217 last = direction 233 parent[last] = jsw_single(node, direction) 234 parent = parent[last] 236 sibling = parent[1 - last] 238 if (not is_red(sibling[1 - last])) and (not is_red(sibling[last])): [all …]
|
/external/stlport/src/ |
D | num_put.cpp | 31 __insert_grouping_aux(Char* first, Char* last, const string& grouping, in __insert_grouping_aux() argument 36 if (first == last) in __insert_grouping_aux() 47 Char* cur_group = last; // Points immediately beyond the rightmost in __insert_grouping_aux() 63 ++last; in __insert_grouping_aux() 64 copy_backward(cur_group, last, last + 1); in __insert_grouping_aux() 68 return (last - first) + sign + basechars; in __insert_grouping_aux() 135 __insert_grouping(char * first, char * last, const string& grouping, in __insert_grouping() argument 137 return __insert_grouping_aux(first, last, grouping, in __insert_grouping() 149 __insert_grouping(wchar_t* first, wchar_t* last, const string& grouping, in __insert_grouping() argument 152 return __insert_grouping_aux(first, last, grouping, separator, in __insert_grouping()
|
/external/valgrind/main/coregrind/ |
D | m_options.c | 300 HChar const* last = VG_(clo_trace_children_skip); in VG_() local 302 while (*last) { in VG_() 305 HChar const* first = consume_commas(last); in VG_() 306 last = consume_field(first); in VG_() 307 if (first == last) in VG_() 309 vg_assert(last > first); in VG_() 312 patt = VG_(calloc)("m_options.swttc.1", last - first + 1, 1); in VG_() 313 VG_(memcpy)(patt, first, last - first); in VG_() 314 vg_assert(patt[last-first] == 0); in VG_() 325 HChar const* last = VG_(clo_trace_children_skip_by_arg); in VG_() local [all …]
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
D | string-fasta.js | 6 var last = 42, A = 3877, C = 29573, M = 139968; variable 9 last = (last * A + C) % M; 10 return max * last / M; 37 var last = null; 39 if (last) table[c] += table[last]; 40 last = c;
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
D | string-fasta.js | 6 var last = 42, A = 3877, C = 29573, M = 139968; variable 9 last = (last * A + C) % M; 10 return max * last / M; 37 var last = null; 39 if (last) table[c] += table[last]; 40 last = c;
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
D | string-fasta.js | 6 var last = 42, A = 3877, C = 29573, M = 139968; variable 9 last = (last * A + C) % M; 10 return max * last / M; 37 var last = null; 39 if (last) table[c] += table[last]; 40 last = c;
|
/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/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/chromium_org/chrome/browser/extensions/activity_log/ |
D | activity_log_browsertest.cc | 45 scoped_refptr<Action> last = i->front(); in Prerender_Arguments() local 47 ASSERT_EQ(extension_id, last->extension_id()); in Prerender_Arguments() 48 ASSERT_EQ(Action::ACTION_CONTENT_SCRIPT, last->action_type()); in Prerender_Arguments() 50 ActivityLogPolicy::Util::Serialize(last->args())); in Prerender_Arguments() 53 last->SerializePageUrl()); in Prerender_Arguments() 56 last->page_title()); in Prerender_Arguments() 58 ActivityLogPolicy::Util::Serialize(last->other())); in Prerender_Arguments() 59 ASSERT_EQ("", last->api_name()); in Prerender_Arguments() 60 ASSERT_EQ("", last->SerializeArgUrl()); in Prerender_Arguments()
|