/third_party/node/deps/v8/src/zone/ |
H A D | zone.cc | 75 segment_head_ = segment_head_->next(); in Reset() 111 Segment* next = current->next(); in DeleteAll() local 114 current = next; in DeleteAll() 209 Segment* next = current->next(); in ~ZoneScope() local 211 current = next; in ~ZoneScope()
|
/third_party/libwebsockets/win32port/zlib/ |
H A D | inftrees.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */
local 151 filled is at next and has curr index bits. The code being used is huff
201 next = *table; /* current table to fill in */
233 min = fill; /* save offset to next table */
236 next[(huff >> drop) + fill] = here;
250 /* go to next symbol, update count, len */
264 next += min; /* here min is 1 << curr */
266 /* determine length of next tabl [all...] |
/third_party/ltp/testcases/open_posix_testsuite/stress/threads/pthread_mutex_lock/ |
H A D | s-c2.c | 98 /* The condition used to signal the main thread to go to the next step */ 118 struct _td *next; /* It is a chained list */ member 240 sentinel.next = NULL; in main() 314 cur->next = tmp; in main() 363 while (cur->next != NULL) { in main() 365 tmp = cur->next; in main() 366 cur->next = tmp->next; in main()
|
/third_party/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_pipe_offset.c | 15 * next paragraph) shall be included in all copies or substantial portions 127 stage->next->tri( stage->next, header ); in do_offset_tri() 211 stage->next->flush( stage->next, flags ); in offset_flush() 217 stage->next->reset_stipple_counter( stage->next ); in offset_reset_stipple_counter() 239 offset->stage.next = NULL; in draw_offset_stage()
|
/third_party/pulseaudio/src/pulsecore/ |
H A D | memblockq.h | 84 struct list_item *next, *prev; member 113 q->prev->next = q->next; in drop_block() 116 bq->blocks = q->next; in drop_block() 119 if (q->next) { in drop_block() 120 q->next->prev = q->prev; in drop_block() 131 bq->current_read = q->next; in drop_block() 168 /* Return a copy of the next memory chunk in the queue. It is not
|
/third_party/skia/src/core/ |
H A D | SkTSort.h | 116 for (T* next = left + 1; next <= right; ++next) { in SkTInsertionSort() 117 if (!lessThan(*next, *(next - 1))) { in SkTInsertionSort() 120 T insert = std::move(*next); in SkTInsertionSort() 121 T* hole = next; in SkTInsertionSort()
|
/third_party/skia/third_party/externals/tint/tools/src/cmd/intrinsic-gen/lexer/ |
H A D | lexer.go | 52 l.next() 54 l.next() 75 l.next() // Skip opening quote 81 l.next() // Skip closing quote 86 l.next() // Consume newline 105 // next() consumes and returns the next rune in the source, or 0 if reached EOF 106 func (l *lexer) next() rune { 122 // skip() consumes the next `n` runes in the source 125 l.next() [all...] |
/third_party/toybox/kconfig/ |
H A D | expr.h | 19 struct file *next; member 72 struct symbol *next; member 85 #define for_all_symbols(i, sym) for (i = 0; i < 257; i++) for (sym = symbol_hash[i]; sym; sym = sym->next) if (sym->type != S_OTHER) 114 struct property *next; member 126 for (st = sym->prop; st; st = st->next) \ 131 for (st = sym->prop; st; st = st->next) \ 135 struct menu *next; member
|
/third_party/toybox/scripts/ |
H A D | mkflags.c | 17 struct flag *next; member 99 new->next = list->lopt; in digest() 104 blank->next = list; in digest() 132 new->next = list; in digest() 214 offlist = offlist->next; in main() 240 aflist = aflist->next; in main() 241 if (enabled) flist = flist->next; in main()
|
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/tls/ |
H A D | pkcs1.c | 204 const u8 *pos, *end, *next, *da_end; in pkcs1_v15_sig_ver() local 270 if (asn1_get_oid(hdr.payload, hdr.length, &oid, &next)) { in pkcs1_v15_sig_ver() 277 next, da_end - next); in pkcs1_v15_sig_ver() 284 if (da_end > next && in pkcs1_v15_sig_ver() 285 (asn1_get_next(next, da_end - next, &hdr) < 0 || in pkcs1_v15_sig_ver()
|
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/tls/ |
H A D | pkcs1.c | 208 const u8 *pos, *end, *next, *da_end; in pkcs1_v15_sig_ver() local 270 if (asn1_get_oid(hdr.payload, hdr.length, &oid, &next)) { in pkcs1_v15_sig_ver() 277 next, da_end - next); in pkcs1_v15_sig_ver() 284 if (da_end > next && in pkcs1_v15_sig_ver() 285 (asn1_get_next(next, da_end - next, &hdr) < 0 || in pkcs1_v15_sig_ver()
|
/third_party/curl/lib/ |
H A D | cookie.c | 348 list = list->next; in Curl_cookie_loadfiles() 376 * the past. If the cookiejar has recorded the next timestamp at which one or 390 * counter in order to track the next one. In case the recorded first in remove_expired() 404 nx = co->next; in remove_expired() 407 cookies->cookies[i] = co->next; in remove_expired() 410 pv->next = co->next; in remove_expired() 418 * seen so far then record it for the next round of expirations. in remove_expired() 1138 clist = clist->next; in Curl_cookie_add() 1143 co->next in Curl_cookie_add() 1519 struct Cookie *next; Curl_cookie_freelist() local 1534 struct Cookie *first, *curr, *next, *prev = NULL; Curl_cookie_clearsess() local [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/lib/Support/ |
H A D | regcomp.c | 65 char *next; /* next character in RE */ member 122 #define PEEK() (*p->next) 123 #define PEEK2() (*(p->next+1)) 124 #define MORE() (p->next < p->end) 125 #define MORE2() (p->next+1 < p->end) 130 #define NEXT() (p->next++) 131 #define NEXT2() (p->next += 2) 132 #define NEXTn(n) (p->next += (n)) 133 #define GETNEXT() (*p->next [all...] |
/third_party/ffmpeg/libavcodec/ |
H A D | dpx_parser.c | 46 int next = END_NOT_FOUND; in dpx_parse() local 53 next = 0; in dpx_parse() 94 next = i - 3; in dpx_parse() 101 if (ff_combine_frame(&d->pc, next, &buf, &buf_size) < 0) in dpx_parse() 108 return next; in dpx_parse()
|
H A D | mjpeg_parser.c | 38 * @return the position of the first byte of the next frame, or -1 111 int next; in jpeg_parse() local 114 next= buf_size; in jpeg_parse() 116 next= find_frame_end(m, buf, buf_size); in jpeg_parse() 118 if (ff_combine_frame(pc, next, &buf, &buf_size) < 0) { in jpeg_parse() 127 return next; in jpeg_parse()
|
H A D | avs3_parser.c | 153 int next; in avs3_parse() local 156 next = buf_size; in avs3_parse() 158 next = avs3_find_frame_end(pc, buf, buf_size); in avs3_parse() 159 if (ff_combine_frame(pc, next, &buf, &buf_size) < 0) { in avs3_parse() 171 return next; in avs3_parse()
|
H A D | dnxhd_parser.c | 124 int next; in dnxhd_parse() local 127 next = buf_size; in dnxhd_parse() 129 next = dnxhd_find_frame_end(dctx, buf, buf_size); in dnxhd_parse() 130 if (ff_combine_frame(pc, next, &buf, &buf_size) < 0) { in dnxhd_parse() 138 return next; in dnxhd_parse()
|
H A D | png_parser.c | 42 int next = END_NOT_FOUND; in png_parse() local 67 next = i; in png_parse() 88 next = ppc->chunk_length + i + 1; in png_parse() 103 if (ff_combine_frame(&ppc->pc, next, &buf, &buf_size) < 0) in png_parse() 110 return next; in png_parse()
|
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | CharacterIteration.java | 25 * Move the iterator forward to the next code point, and return that code point, 29 * @return The next code point. 33 // which leaves it in position for underlying iterator's next() to work. in next32() 36 c = ci.next(); in next32() 42 // For BMP chars, this next() is the real deal. in next32() 43 c = ci.next(); in next32() 61 // The call site does an initial ci.next() and calls this function 64 // middle of a surrogate pair. ci.next() will work correctly 73 char cTrail = ci.next(); in nextTrail32() 98 ci.next(); in previous32() [all...] |
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | UCharacterIterator.java | 158 // next code point in currentCodePoint() 159 next(); in currentCodePoint() 161 // current() after next() actually in currentCodePoint() 194 * Returns the UTF16 code unit at index, and increments to the next code unit (post-increment semantics). If index 197 * @return the next UTF16 code unit, or DONE if the index is at the limit of the text. 201 public abstract int next(); in next() method in UCharacterIterator 204 * Returns the code point at index, and increments to the next code point (post-increment semantics). If index does 205 * not point to a valid surrogate pair, the behavior is the same as <code>next()</code>. Otherwise the iterator is 208 * @return the next codepoint in text, or DONE if the index is at the limit of the text. 213 int ch1 = next(); in nextCodePoint() [all...] |
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
H A D | UCharacterIterator.java | 147 // next code point in currentCodePoint() 148 next(); in currentCodePoint() 150 // current() after next() actually in currentCodePoint() 181 * Returns the UTF16 code unit at index, and increments to the next code unit (post-increment semantics). If index 184 * @return the next UTF16 code unit, or DONE if the index is at the limit of the text. 187 public abstract int next(); in next() method in UCharacterIterator 190 * Returns the code point at index, and increments to the next code point (post-increment semantics). If index does 191 * not point to a valid surrogate pair, the behavior is the same as <code>next()</code>. Otherwise the iterator is 194 * @return the next codepoint in text, or DONE if the index is at the limit of the text. 198 int ch1 = next(); in nextCodePoint() [all...] |
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/ |
H A D | CharacterIteration.java | 29 * Move the iterator forward to the next code point, and return that code point, 33 * @return The next code point. 37 // which leaves it in position for underlying iterator's next() to work. in next32() 40 c = ci.next(); in next32() 46 // For BMP chars, this next() is the real deal. in next32() 47 c = ci.next(); in next32() 65 // The call site does an initial ci.next() and calls this function 68 // middle of a surrogate pair. ci.next() will work correctly 77 char cTrail = ci.next(); in nextTrail32() 102 ci.next(); in previous32() [all...] |
/third_party/libuv/src/win/ |
H A D | fs-fd-hash-inl.h | 60 struct uv__fd_hash_entry_group_s* next; member 116 for (group_ptr = group_ptr->next; \ 118 group_ptr = group_ptr->next) \ 153 new_group_ptr->next = bucket_ptr->data; in uv__fd_hash_add() 187 bucket_ptr->data = old_group_ptr->next; in uv__fd_hash_remove()
|
/third_party/mesa3d/src/gallium/frontends/nine/ |
H A D | threadpool.c | 11 * The above copyright notice and this permission notice (including the next 63 pool->workqueue = task->next; in threadpool_worker() 160 task->next = NULL; in _mesa_threadpool_queue_task() 169 while (previous && previous->next) in _mesa_threadpool_queue_task() 170 previous = previous->next; in _mesa_threadpool_queue_task() 172 previous->next = task; in _mesa_threadpool_queue_task()
|
/third_party/node/deps/v8/src/handles/ |
H A D | local-handles.cc | 26 prev_next_ = data->next; in OpenMainThreadScope() 57 FullObjectSlot(scope_.next)); in Iterate() 70 : scope_.next; in Contains() 80 DCHECK_EQ(scope_.next, scope_.limit); in AddBlock() 83 scope_.next = block; in AddBlock()
|