| /third_party/alsa-lib/src/topology/ |
| H A D | builder.c | 89 elem_next = list_entry(pos->next, struct tplg_elem, list); in write_elem_block()
93 if ((pos->next == base) || (elem_next->index != elem->index)) { in write_elem_block()
131 next sub list*/ in write_elem_block()
174 elem_next = list_entry(pos->next, struct tplg_elem, list); in calc_real_size()
176 if ((pos->next == base) || (elem_next->index != elem->index)) in calc_real_size()
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/breakiter/ |
| H A D | CjkBreakEngine.java | 75 while (iterator.next()) { in loadHiragana()
123 inText.next(); in divideUpDictionaryRange()
148 normalizer.next(); in divideUpDictionaryRange()
318 sb.append(text.next()); in getPatternFromText()
|
| /third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| H A D | ContractionsAndExpansions.java | 57 while (trieIterator.hasNext() && !(range = trieIterator.next()).leadSurrogate) { in forData()
68 while (trieIterator.hasNext() && !(range = trieIterator.next()).leadSurrogate) { in forData()
236 Entry e = prefixes.next(); in handlePrefixes()
261 Entry e = suffixes.next(); in handleContractions()
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| H A D | CanonicalIterator.java | 80 * Get the next canonically equivalent string.
82 * @return the next string that is canonically equivalent. The value null is returned when
86 public String next() { in next() method in CanonicalIterator
97 // find next value for next time in next()
260 String item = it.next(); in getEquivalents()
265 String possible = it2.next(); in getEquivalents()
309 for(UnicodeSetIterator iter = new UnicodeSetIterator(starts); iter.next();) { in getEquivalents2()
342 while (usi.next()) { in getEquivalents2()
353 String item = (String) it.next(); in getEquivalents2()
[all...] |
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/ |
| H A D | ContractionsAndExpansions.java | 64 while (trieIterator.hasNext() && !(range = trieIterator.next()).leadSurrogate) { in forData()
75 while (trieIterator.hasNext() && !(range = trieIterator.next()).leadSurrogate) { in forData()
243 Entry e = prefixes.next(); in handlePrefixes()
268 Entry e = suffixes.next(); in handleContractions()
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| H A D | CanonicalIterator.java | 78 * Get the next canonically equivalent string.
80 * @return the next string that is canonically equivalent. The value null is returned when
83 public String next() { in next() method in CanonicalIterator
94 // find next value for next time in next()
256 String item = it.next(); in getEquivalents()
261 String possible = it2.next(); in getEquivalents()
305 for(UnicodeSetIterator iter = new UnicodeSetIterator(starts); iter.next();) { in getEquivalents2()
338 while (usi.next()) { in getEquivalents2()
349 String item = (String) it.next(); in getEquivalents2()
[all...] |
| /third_party/icu/icu4c/source/i18n/ |
| H A D | collationbuilder.h | 99 * The node's previous and next indexes must not be set yet.
162 * Counts the tailored nodes of the given strength up to the next node
253 static inline int64_t nodeFromNextIndex(int32_t next) { in nodeFromNextIndex() argument
254 return next << 8; in nodeFromNextIndex()
292 static inline int64_t changeNodeNextIndex(int64_t node, int32_t next) { in changeNodeNextIndex() argument
293 return (node & INT64_C(0xfffffffff00000ff)) | nodeFromNextIndex(next); in changeNodeNextIndex()
342 * - a root/default node of the next-weaker strength, or
369 * until the next relation is added.
393 * - index to the next node: 20 bits 27..8
|
| /third_party/icu/icu4c/source/common/ |
| H A D | ustrenum.cpp | 44 StringEnumeration::next(int32_t *resultLength, UErrorCode &status) { in next() function in StringEnumeration
78 const char *s=next(&length, status); in snext()
164 const char *UStringEnumeration::next(int32_t *resultLength, UErrorCode &status) { in next() function in UStringEnumeration
228 return THIS(en)->next(resultLength, *ec); in ustrenum_next()
|
| /third_party/lzma/CPP/7zip/Compress/ |
| H A D | LzmaDecoder.cpp | 138 SizeT next = _state.dicBufSize;
in CodeSpec() local
139 if (next - wrPos > _outStep)
in CodeSpec()
140 next = wrPos + _outStep;
in CodeSpec()
141 size = next - dicPos;
in CodeSpec()
|
| /third_party/ltp/lib/ |
| H A D | tst_bool_expr.c | 107 for (i = expr->rpn; i; i = i->next) { in tst_bool_expr_print()
111 if (i->next) in tst_bool_expr_print()
328 out[j]->next = out[j + 1]; in shunting_yard()
369 for (i = expr->rpn; i; i = i->next) { in tst_bool_expr_eval()
|
| /third_party/libwebsockets/minimal-examples/dbus-server/minimal-dbus-server/ |
| H A D | main.c | 261 lws_dll2_remove(&ctx->next); in destroy_dbus_server_conn()
303 lws_dll2_add_head(&conn_ctx->next, &ctx->owner); in new_conn()
401 lws_container_of(rdt, struct lws_dbus_ctx, next); in destroy_dbus_server_listener()
426 lws_container_of(rdt, struct lws_dbus_ctx, next); in spam_connected_clients()
|
| /third_party/mesa3d/src/gallium/frontends/clover/util/ |
| H A D | range.hpp | 315 return std::next(o.begin(), i); in begin()
320 return std::next(o.begin(), j); in end()
325 return std::next(o.begin(), i); in begin()
330 return std::next(o.begin(), j); in end()
|
| /third_party/node/deps/v8/tools/testrunner/local/ |
| H A D | testsuite.py | 226 return self.next()
228 def next(self): member in TestGenerator
229 return next(self._iterator)
280 next(iter(self.ListTests()), None)
|
| /third_party/node/deps/icu-small/source/i18n/ |
| H A D | collationbuilder.h | 99 * The node's previous and next indexes must not be set yet.
162 * Counts the tailored nodes of the given strength up to the next node
253 static inline int64_t nodeFromNextIndex(int32_t next) { in nodeFromNextIndex() argument
254 return next << 8; in nodeFromNextIndex()
292 static inline int64_t changeNodeNextIndex(int64_t node, int32_t next) { in changeNodeNextIndex() argument
293 return (node & INT64_C(0xfffffffff00000ff)) | nodeFromNextIndex(next); in changeNodeNextIndex()
342 * - a root/default node of the next-weaker strength, or
369 * until the next relation is added.
393 * - index to the next node: 20 bits 27..8
|
| /third_party/node/deps/icu-small/source/common/ |
| H A D | ustrenum.cpp | 44 StringEnumeration::next(int32_t *resultLength, UErrorCode &status) { in next() function in StringEnumeration
78 const char *s=next(&length, status); in snext()
164 const char *UStringEnumeration::next(int32_t *resultLength, UErrorCode &status) { in next() function in UStringEnumeration
228 return THIS(en)->next(resultLength, *ec); in ustrenum_next()
|
| /third_party/mesa3d/src/mesa/program/ |
| H A D | prog_parameter_layout.c | 11 * The above copyright notice and this permission notice (including the next
140 * - other constants are next
157 for (inst = state->inst_head; inst != NULL; inst = inst->next) { in _mesa_layout_parameters()
191 for (inst = state->inst_head; inst != NULL; inst = inst->next) { in _mesa_layout_parameters()
228 for (inst = state->inst_head; inst != NULL; inst = inst->next) { in _mesa_layout_parameters()
266 for (inst = state->inst_head; inst != NULL; inst = inst->next) { in _mesa_layout_parameters()
|
| /third_party/node/deps/npm/node_modules/cacache/lib/ |
| H A D | entry-index.js | 149 return entries.reduce((latest, next) => {
150 if (next && next.key === key) {
151 return formatEntry(cache, next)
260 // eslint-ignore-next-line no-empty-block
|
| /third_party/mesa3d/src/gallium/drivers/nouveau/ |
| H A D | nouveau_mm.c | 195 slab = list_entry(bucket->used.next, struct mm_slab, head); in nouveau_mm_allocate()
200 slab = list_entry(bucket->free.next, struct mm_slab, head); in nouveau_mm_allocate()
278 struct mm_slab *slab, *next; in nouveau_mm_free_slabs() local
280 LIST_FOR_EACH_ENTRY_SAFE(slab, next, head, head) { in nouveau_mm_free_slabs()
|
| /third_party/mesa3d/src/gallium/drivers/nouveau/nv30/ |
| H A D | nv30_vertprog.c | 96 while (heap->next && heap->size < vp->nr_insns) { in nv30_vertprog_validate()
97 struct nouveau_heap **evict = heap->next->priv; in nv30_vertprog_validate()
139 while (heap->next && heap->size < vp->nr_consts) { in nv30_vertprog_validate()
140 struct nv30_vertprog *evp = heap->next->priv; in nv30_vertprog_validate()
|
| /third_party/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/ |
| H A D | AnyTransliterator.java | 52 while (it.next(run)) { in handleTransliterate()
118 public boolean next(Position run); in next() method
160 public boolean next(Position run) { in next() method in AnyTransliterator.ScriptRunIterator
274 String variant = (String) variants.next(); in registerAnyToScript()
|
| /third_party/lwip/src/apps/snmp/ |
| H A D | snmp_mib2_udp.c | 157 pcb = pcb->next; in udp_endpointTable_get_cell_value()
177 /* init struct to search next oid */ in udp_endpointTable_get_next_cell_instance_and_value()
180 /* iterate over all possible OIDs to find the next one */ in udp_endpointTable_get_next_cell_instance_and_value()
195 /* check generated OID: is it a candidate for the next one? */ in udp_endpointTable_get_next_cell_instance_and_value()
198 pcb = pcb->next; in udp_endpointTable_get_next_cell_instance_and_value()
201 /* did we find a next one? */ in udp_endpointTable_get_next_cell_instance_and_value()
271 pcb = pcb->next; in udp_Table_get_cell_value()
285 /* init struct to search next oid */ in udp_Table_get_next_cell_instance_and_value()
288 /* iterate over all possible OIDs to find the next one */ in udp_Table_get_next_cell_instance_and_value()
297 /* check generated OID: is it a candidate for the next on in udp_Table_get_next_cell_instance_and_value()
[all...] |
| /third_party/node/deps/v8/src/profiler/ |
| H A D | sampling-heap-profiler.cc | 31 double next = (-base::ieee754::log(u)) * rate; in GetNextSampleInterval() local
32 return next < kTaggedSize in GetNextSampleInterval()
34 : (next > INT_MAX ? INT_MAX : static_cast<intptr_t>(next)); in GetNextSampleInterval()
|
| /third_party/mesa3d/src/gallium/drivers/crocus/ |
| H A D | crocus_resource.h | 11 * The above copyright notice and this permission notice (including the next
316 if (p_res->next && p_res->next->format == PIPE_FORMAT_S8_UINT) in _crocus_resource_get_separate_stencil()
317 return p_res->next; in _crocus_resource_get_separate_stencil()
509 return res->base.b.next != NULL && res->mod_info && in crocus_resource_unfinished_aux_import()
|
| /third_party/skia/third_party/externals/angle2/src/common/ |
| H A D | PoolAlloc.cpp | 219 PageHeader *next = mInUseList->nextPage; in ~PoolAllocator() local
222 mInUseList = next; in ~PoolAllocator()
230 PageHeader *next = mFreeList->nextPage; in ~PoolAllocator() local
232 mFreeList = next; in ~PoolAllocator()
392 // Make next allocation come from a new page in allocate()
|
| /third_party/skia/third_party/externals/sfntly/java/src/com/google/typography/font/sfntly/table/opentype/component/ |
| H A D | TagOffsetsTable.java | 57 public S next() { in iterator()
61 TagOffsetRecord record = recordIterator.next(); in iterator()
192 TagOffsetRecord record = recordIterator.next(); in initFromData()
194 // Each table ends at the next start, or at the end of the data. in initFromData()
203 TagOffsetRecord record = recordIterator.next(); in initFromData()
|