/third_party/pulseaudio/src/pulsecore/ |
H A D | database-gdbm.c | 145 datum next; in pa_database_clear() local 147 next = gdbm_nextkey(MAKE_GDBM_FILE(db), gdbm_key); in pa_database_clear() 152 gdbm_key = next; in pa_database_clear() 169 datum next; in pa_database_size() local 173 next = gdbm_nextkey(MAKE_GDBM_FILE(db), gdbm_key); in pa_database_size() 175 gdbm_key = next; in pa_database_size() 208 pa_datum* pa_database_next(pa_database *db, const pa_datum *key, pa_datum *next, pa_datum *data) { in pa_database_next() argument 213 pa_assert(next); in pa_database_next() 216 return pa_database_first(db, next, data); in pa_database_next() 234 datum_from_gdbm(next, in pa_database_next() [all...] |
/third_party/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_pipe_twoside.c | 15 * next paragraph) shall be included in all copies or substantial portions 93 stage->next->tri( stage->next, &tmp ); in twoside_tri() 96 stage->next->tri( stage->next, header ); in twoside_tri() 148 stage->next->flush( stage->next, flags ); in twoside_flush() 154 stage->next->reset_stipple_counter( stage->next ); in twoside_reset_stipple_counter() 176 twoside->stage.next in draw_twoside_stage() [all...] |
H A D | draw_pipe_wide_line.c | 15 * next paragraph) shall be included in all copies or substantial portions 132 stage->next->tri( stage->next, &tri ); in wideline_line() 137 stage->next->tri( stage->next, &tri ); in wideline_line() 167 stage->next->flush( stage->next, flags ); in wideline_flush() 180 stage->next->reset_stipple_counter( stage->next ); in wideline_reset_stipple_counter() 199 wide->stage.next in draw_wide_line_stage() [all...] |
/third_party/pulseaudio/src/pulse/ |
H A D | mainloop-signal.c | 56 pa_signal_event *previous, *next; member 82 for (s = signals; s; s = s->next) in dispatch() 166 for (e = signals; e; e = e->next) in pa_signal_new() 189 e->next = signals; in pa_signal_new() 201 if (e->next) in pa_signal_free() 202 e->next->previous = e->previous; in pa_signal_free() 204 e->previous->next = e->next; in pa_signal_free() 206 signals = e->next; in pa_signal_free()
|
/third_party/skia/third_party/externals/microhttpd/src/examples/ |
H A D | mhd2spdy_structures.h | 74 struct SPDY_Connection *next; member 110 struct Proxy *next; member 192 * element are structs with prev and next fields. 199 (element)->next = (head); \ 211 * with prev and next fields. 219 (head) = (element)->next; \ 221 (element)->prev->next = (element)->next; \ 222 if ((element)->next == NULL) \ 225 (element)->next [all...] |
/third_party/skia/src/sksl/lex/ |
H A D | NFAtoDFA.h | 79 for (int next : state.fData) { in add() 80 this->add(next, states); in add() 92 void addTransition(char c, int start, int next) { in addTransition() argument 100 row[start] = next; in addTransition() 106 std::vector<int> next; in scanState() local 115 this->add(nextState, &next); in scanState() 119 std::sort(next.begin(), next.end()); in scanState() 120 DFAState* nextState = this->getState(DFAState::Label(next)); in scanState()
|
/third_party/vk-gl-cts/framework/delibs/decpp/ |
H A D | deAppendList.hpp | 46 * current block runs out, allocation of next block will happen in a single 72 Block* volatile next; member 78 , next (DE_NULL) in Block() 120 m_curBlock = m_curBlock->next; in operator ++() 182 curBlock = delBlock->next; in ~AppendList() 206 curBlock = delBlock->next; in clear() 219 m_first->next = DE_NULL; in clear() 239 if (curBlock->next) in append() 240 curBlock = curBlock->next; in append() 256 // they are being blocked by curBlock->next bein in append() [all...] |
/third_party/mesa3d/src/glx/apple/ |
H A D | apple_glx_drawable.c | 79 for (i = drawables_list; i; i = i->next) { in apple_glx_find_drawable() 151 d->previous->next = d->next; in destroy_drawable() 158 drawables_list = d->next; in destroy_drawable() 161 if (d->next) in destroy_drawable() 162 d->next->previous = d->previous; in destroy_drawable() 297 d->next = NULL; in common_init() 306 agd->next = drawables_list; in link_tail() 381 dnext = d->next; in apple_glx_garbage_collect_drawables() 433 for (d = drawables_list; d; d = d->next) in apple_glx_get_drawable_count() [all...] |
/third_party/node/tools/inspector_protocol/jinja2/ |
H A D | debug.py | 47 def set_next(self, next): 50 tb_set_next(self.tb, next and next.tb or None) 56 self._tb_next = next 175 # save a reference to the next frame if we override the current 177 next = tb.tb_next 187 tb = next 345 def tb_set_next(tb, next): 348 (next is None or isinstance(next, TracebackTyp [all...] |
/third_party/lwip/src/core/ |
H A D | lowpower.c | 193 timeout->next = NULL; in sys_timeout_reg() 198 while (temp->next != NULL) { in sys_timeout_reg() 199 temp = temp->next; in sys_timeout_reg() 201 temp->next = timeout; in sys_timeout_reg() 207 /* deal timeout and return next timer prev */ 236 LWIP_DEBUGF(LOWPOWER_DEBUG, ("next->tick is NULL\n")); in get_timer_tick() 251 p->next = n; in handle_timer_and_free() 254 t->next = NULL; in handle_timer_and_free() 263 *pn = p->next; in handle_timer_and_free() 280 n = t->next; in get_sleep_time() [all...] |
/third_party/python/Lib/ |
H A D | heapq.py | 70 find the "next" winner is to move some loser (let's say cell 30 in the 351 next = it.__next__ 352 h_append([next(), order * direction, next]) 359 value, order, next = s = h[0] 361 s[0] = next() # raises StopIteration when exhausted 367 value, order, next = h[0] 369 yield from next.__self__ 374 next = it.__next__ 375 value = next() [all...] |
/third_party/skia/third_party/externals/swiftshader/src/System/ |
H A D | LRUCache.hpp | 108 Entry *next = nullptr; member 197 entry = entry->next; in operator ++() 223 entry->next = free; // No need for back link here. in LRUCache() 256 free = entry->next; in add() 257 entry->next = nullptr; in add() 285 entry->next = free; // No need for back link here. in clear() 306 if(head == entry) { head = entry->next; } in unlink() 308 if(entry->prev) { entry->prev->next = entry->next; } in unlink() 309 if(entry->next) { entr in unlink() [all...] |
/third_party/skia/src/pathops/ |
H A D | SkPathOpsCommon.cpp | 31 angle = angle->next(); in AngleWinding() 60 angle = angle->next(); in AngleWinding() 78 } while ((contour = contour->next())); in FindUndone() 88 *startPtr = span->ptT()->next()->span(); in FindChase() 121 while ((angle = angle->next()) != firstAngle) { in FindChase() 162 } while ((contour = contour->next())); in SortContourList() 175 SkOpContour* next = list[index]; in SortContourList() local 176 contour->setNext(next); in SortContourList() 177 contour = next; in SortContourList() 188 } while ((contour = contour->next())); in DEBUG_COIN_DECLARE_PARAMS() [all...] |
/third_party/skia/fuzz/ |
H A D | FuzzGradients.cpp | 44 fuzz->next(&c, &s); in initGradientParams() 110 fuzz->next(&pts[0].fX, &pts[0].fY, &pts[1].fX, &pts[1].fY); in fuzzLinearGradient() 112 fuzz->next(&useLocalMatrix, &useGlobalMatrix); in fuzzLinearGradient() 121 fuzz->next(&flags); in fuzzLinearGradient() 146 fuzz->next(¢er.fX, ¢er.fY); in fuzzRadialGradient() 149 fuzz->next(&radius, &useLocalMatrix, &useGlobalMatrix); in fuzzRadialGradient() 159 fuzz->next(&flags); in fuzzRadialGradient() 183 fuzz->next(&start.fX, &start.fY); in fuzzTwoPointConicalGradient() 185 fuzz->next(&end.fX, &end.fY); in fuzzTwoPointConicalGradient() 188 fuzz->next( in fuzzTwoPointConicalGradient() [all...] |
/base/security/certificate_manager/services/cert_manager_standard/cert_manager_engine/main/core/include/ |
H A D | cert_manager_double_list.h | 27 struct DoubleList *next; member 49 for (p = (head)->next, (st) = (__typeof__(st))p; p != (head); p = p->next, (st) = (__typeof__(st))p) 54 for (p = (head)->next, (st) = (__typeof__(st))p, tmp = *p; p != (head); \ 55 p = tmp.next, tmp = *p, (st) = (__typeof__(st))p)
|
/base/security/huks/utils/list/ |
H A D | hks_double_list.h | 21 struct DoubleList *next; member 48 p = (head)->next; \ 51 for (; p != NULL && p != (head); p = p->next, (st) = (__typeof__(st))p) 56 for (p = (head)->next, (st) = (__typeof__(st))p, _tmp = *p; p != (head); \ 57 p = _tmp.next, _tmp = *p, (st) = (__typeof__(st))p)
|
/third_party/ffmpeg/libavcodec/ |
H A D | ipu_parser.c | 39 int next = END_NOT_FOUND, i = 0; in ipu_parse() local 48 next = buf_size; in ipu_parse() 53 next = i + 1; in ipu_parse() 59 if (ff_combine_frame(&ipc->pc, next, &buf, &buf_size) < 0) { in ipu_parse() 69 return next; in ipu_parse()
|
H A D | qoi_parser.c | 39 int next = END_NOT_FOUND, i = 0; in qoi_parse() local 48 next = buf_size; in qoi_parse() 53 next = i + 1; in qoi_parse() 59 if (ff_combine_frame(&ipc->pc, next, &buf, &buf_size) < 0) { in qoi_parse() 69 return next; in qoi_parse()
|
/third_party/musl/porting/uniproton/kernel/src/stdio/ |
H A D | fclose.c | 27 if (f->prev) f->prev->next = f->next;
in __fclose() 28 if (f->next) f->next->prev = f->prev;
in __fclose() 29 if (*head == f) *head = f->next;
in __fclose()
|
/third_party/musl/porting/liteos_m/kernel/src/stdio/ |
H A D | fclose.c | 27 if (f->prev) f->prev->next = f->next;
in __fclose() 28 if (f->next) f->next->prev = f->prev;
in __fclose() 29 if (*head == f) *head = f->next;
in __fclose()
|
/third_party/skia/third_party/externals/swiftshader/tests/ReactorBenchmarks/ |
H A D | ReactorBenchmarks.cpp | 46 Int next = 1; in BENCHMARK_DEFINE_F() local 49 Yield(next); in BENCHMARK_DEFINE_F() 50 auto tmp = current + next; in BENCHMARK_DEFINE_F() 51 current = next; in BENCHMARK_DEFINE_F() 52 next = tmp; in BENCHMARK_DEFINE_F()
|
/third_party/musl/src/process/ |
H A D | posix_spawn_file_actions_destroy.c | 7 struct fdop *op = fa->__actions, *next; in posix_spawn_file_actions_destroy() local 9 next = op->next; in posix_spawn_file_actions_destroy() 11 op = next; in posix_spawn_file_actions_destroy()
|
/third_party/icu/tools/colprobe/ |
H A D | sortedlines.cpp | 170 logger->log("Cannot deduce distance from empty using next element. Something is very wrong! Line:"); in classifyRepertoire() 246 while(exemplarUSetIter.next()) { in init() 317 curr->next = *(sortingArray+i+1); in sort() 349 while(it1.next()) { in updateBounds() 721 if(left->right && left->right->previous && left->right->next) { in noteContraction() 725 test.setToConcat(left->left, left->right->next); in noteContraction() 736 if(right->previous && right->next) { in noteContraction() 738 trial2.setToConcat(left, right->next); in noteContraction() 748 if(left->previous && left->next) { in noteContraction() 750 trial2.setToConcat(left->next, righ in noteContraction() [all...] |
/third_party/node/deps/v8/src/builtins/ |
H A D | builtins-regexp-gen.cc | 470 Label next(this), unreachable(this, Label::kDeferred); in RegExpExecInternal() 479 Label* labels[] = {&next, &atom, &next}; in RegExpExecInternal() 487 BIND(&next); in RegExpExecInternal() 516 Label next(this), if_isonebyte(this), if_istwobyte(this, Label::kDeferred); in RegExpExecInternal() 529 Goto(&next); in RegExpExecInternal() 541 Goto(&next); in RegExpExecInternal() 544 BIND(&next); in RegExpExecInternal() 552 Label next(this); in RegExpExecInternal() 553 GotoIfNot(TaggedIsSmi(var_code.value()), &next); in RegExpExecInternal() local 1196 GotoIfNot(IsUndefined(new_target), &next); TF_BUILTIN() local 1200 GotoIfNot(IsUndefined(flags), &next); TF_BUILTIN() local 1205 GotoIfNot(TaggedEqual(value, regexp_function), &next); TF_BUILTIN() local 1214 GotoIf(TaggedIsSmi(pattern), &next); TF_BUILTIN() local 1313 GotoIf(TaggedIsSmi(maybe_pattern), &next); TF_BUILTIN() local 1538 Branch(SmiEqual(limit, SmiZero()), &return_empty_array, &next); RegExpPrototypeSplitBody() local 1548 Branch(SmiEqual(string_length, SmiZero()), &if_stringisempty, &next); RegExpPrototypeSplitBody() local 1602 &next); RegExpPrototypeSplitBody() local 1618 Branch(IsNull(match_indices_ho), &push_suffix_and_out, &next); RegExpPrototypeSplitBody() local 1633 GotoIfNot(SmiEqual(match_to, next_search_from), &next); RegExpPrototypeSplitBody() local 1634 GotoIfNot(SmiEqual(match_to, last_matched_until), &next); RegExpPrototypeSplitBody() local [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
H A D | JSON.cpp | 242 char next() { return P == End ? 0 : *P++; } in next() function in llvm::json::__anon24323::Parser 258 switch (char C = next()) { in parseValue() 262 return (next() == 'u' && next() == 'l' && next() == 'l') || in parseValue() 266 return (next() == 'r' && next() == 'u' && next() == 'e') || in parseValue() 270 return (next() == 'a' && next() in parseValue() [all...] |