| /kernel/linux/linux-6.6/drivers/macintosh/ |
| H A D | macio-adb.c | 184 req->next = NULL; in macio_send_request()
191 last_req->next = req; in macio_send_request()
231 current_req = req->next; in macio_adb_interrupt()
251 current_req = req->next; in macio_adb_interrupt()
|
| /kernel/linux/linux-6.6/scripts/dtc/ |
| H A D | treesource.c | 201 dummy_marker.next = prop->val.markers; in write_propval()
208 size_t chunk_len = (m->next ? m->next->offset : len) - m->offset; in write_propval()
326 for (re = dti->reservelist; re; re = re->next) { in dt_to_source()
|
| /kernel/linux/linux-6.6/tools/perf/util/ |
| H A D | stream.c | 115 struct rb_node *next = rb_first_cached(&hists->entries); in init_hot_callchain() local
117 while (next) { in init_hot_callchain()
120 he = rb_entry(next, struct hist_entry, rb_node); in init_hot_callchain()
122 next = rb_next(&he->rb_node); in init_hot_callchain()
|
| /kernel/linux/linux-6.6/security/safesetid/ |
| H A D | securityfs.c | 78 hash_for_each_safe(pol->rules, bucket, tmp, rule, next) in __release_ruleset()
91 hash_add(pol->rules, &rule->next, __kuid_val(rule->src_id.uid)); in insert_rule()
93 hash_add(pol->rules, &rule->next, __kgid_val(rule->src_id.gid)); in insert_rule()
104 hash_for_each(pol->rules, bucket, rule, next) { in verify_ruleset()
|
| /kernel/linux/linux-6.6/sound/soc/au1x/ |
| H A D | ac97c.c | 100 goto next; in au1xac97c_ac97_read()
116 next: in au1xac97c_ac97_read()
139 goto next; in au1xac97c_ac97_write()
148 next: in au1xac97c_ac97_write()
|
| /kernel/linux/linux-6.6/drivers/s390/char/ |
| H A D | monwriter.c | 87 struct mon_buf *entry, *next; in monwrite_find_hdr() local
89 list_for_each_entry_safe(entry, next, &monpriv->list, list) in monwrite_find_hdr()
204 struct mon_buf *entry, *next; in monwrite_close() local
206 list_for_each_entry_safe(entry, next, &monpriv->list, list) { in monwrite_close()
|
| /kernel/linux/linux-6.6/kernel/trace/rv/ |
| H A D | rv_reactors.c | 116 .next = reactors_next,
156 .next = reactors_next,
331 struct rv_reactor_def *ptr, *next; in rv_unregister_reactor() local
336 list_for_each_entry_safe(ptr, next, &rv_reactors_list, list) { in rv_unregister_reactor()
|
| /kernel/linux/linux-6.6/kernel/sched/ |
| H A D | wait.c | 84 wait_queue_entry_t *curr, *next; in __wake_up_common() local
100 list_for_each_entry_safe_from(curr, next, &wq_head->head, entry) { in __wake_up_common()
114 (&next->entry != &wq_head->head)) { in __wake_up_common()
116 list_add_tail(&bookmark->entry, &next->entry); in __wake_up_common()
405 * the next and prev pointers, so that there cannot in finish_wait()
|
| /kernel/linux/linux-6.6/net/ax25/ |
| H A D | ax25_out.c | 245 unsigned short start, end, next; in ax25_kick() local
287 next = (ax25->vs + 1) % ax25->modulus; in ax25_kick()
288 last = (next == end); in ax25_kick()
308 ax25->vs = next; in ax25_kick()
|
| /kernel/linux/linux-6.6/kernel/time/ |
| H A D | timer_list.c | 64 unsigned long next = 0, i; in print_active_timers() local
80 while (curr && i < next) { in print_active_timers()
92 next++; in print_active_timers()
344 .next = timer_list_next,
|
| /kernel/linux/linux-6.6/net/dccp/ccids/lib/ |
| H A D | packet_history.c | 57 entry->next = *headp; in tfrc_tx_hist_add()
67 struct tfrc_tx_hist_entry *next = head->next; in tfrc_tx_hist_purge() local
70 head = next; in tfrc_tx_hist_purge()
435 h->rtt_sample_prev = 0; /* use current entry as next reference */ in tfrc_rx_hist_sample_rtt()
|
| /third_party/elfutils/libdwfl/ |
| H A D | cu.c | 216 cu->next = NULL; in intern_cu()
261 nextp = &lastcu->next; in __libdwfl_nextcu()
283 && (*nextp)->next == NULL && nextoff == (Dwarf_Off) -1l) in __libdwfl_nextcu()
284 (*nextp)->next = (void *) -1l; in __libdwfl_nextcu()
|
| /third_party/ffmpeg/libavformat/ |
| H A D | libsmbclient.c | 207 static int libsmbc_read_dir(URLContext *h, AVIODirEntry **next) in libsmbc_read_dir() argument
215 *next = entry = ff_alloc_dir_entry(); in libsmbc_read_dir()
223 av_freep(next); in libsmbc_read_dir()
257 av_freep(next); in libsmbc_read_dir()
|
| /third_party/fsverity-utils/lib/ |
| H A D | compute_digest.c | 26 * Hash a block, writing the result to the next level's pending block buffer.
31 struct block_buffer *next = cur + 1; in hash_one_block() local
39 libfsverity_hash_final(hash, &next->data[next->filled]); in hash_one_block()
41 next->filled += hash->alg->digest_size; in hash_one_block()
48 /* Would the next hash put us over the limit? */ in block_is_full()
|
| /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()
|