Home
last modified time | relevance | path

Searched refs:next (Results 201 - 225 of 12712) sorted by relevance

12345678910>>...509

/third_party/mesa3d/src/gallium/auxiliary/pipebuffer/
H A Dpb_cache.c16 * next paragraph) shall be included in all copies or substantial portions
60 struct list_head *curr, *next; in release_expired_buffers_locked() local
63 curr = cache->next; in release_expired_buffers_locked()
64 next = curr->next; in release_expired_buffers_locked()
73 curr = next; in release_expired_buffers_locked()
74 next = curr->next; in release_expired_buffers_locked()
153 struct list_head *cur, *next; in pb_cache_reclaim_buffer() local
163 cur = cache->next; in pb_cache_reclaim_buffer()
229 struct list_head *curr, *next; pb_cache_release_all_buffers() local
[all...]
/third_party/backends/tools/
H A Dsane-desc.c134 struct url_entry *next; member
141 struct model_entry *next; member
158 struct desc_entry *next; member
167 struct mfg_entry *next; member
177 struct type_entry *next; member
186 struct backend_entry *next; member
199 struct model_record_entry *next; member
216 struct mfg_record_entry *next; member
229 struct manufacturer_model_type * next; member
236 struct usbid_type * next; member
245 struct scsiid_type * next; global() member
[all...]
/kernel/linux/linux-5.10/include/drm/
H A Dspsc_queue.h35 struct spsc_node *next; member
69 node->next = NULL; in spsc_queue_push()
73 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next); in spsc_queue_push()
91 struct spsc_node *next, *node; in spsc_queue_pop() local
101 next = READ_ONCE(node->next); in spsc_queue_pop()
102 WRITE_ONCE(queue->head, next); in spsc_queue_pop()
104 if (unlikely(!next)) { in spsc_queue_pop()
108 (long)&node->next, (long) &queue->head) != (long)&node->next) { in spsc_queue_pop()
[all...]
/kernel/linux/linux-6.6/include/drm/
H A Dspsc_queue.h35 struct spsc_node *next; member
69 node->next = NULL; in spsc_queue_push()
73 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next); in spsc_queue_push()
91 struct spsc_node *next, *node; in spsc_queue_pop() local
101 next = READ_ONCE(node->next); in spsc_queue_pop()
102 WRITE_ONCE(queue->head, next); in spsc_queue_pop()
104 if (unlikely(!next)) { in spsc_queue_pop()
108 (long)&node->next, (long) &queue->head) != (long)&node->next) { in spsc_queue_pop()
[all...]
/kernel/linux/linux-5.10/drivers/acpi/acpica/
H A Dexdump.c122 {ACPI_EXD_POINTER, ACPI_EXD_OFFSET(region.next), "Next"}
210 {ACPI_EXD_HDLR_LIST, ACPI_EXD_OFFSET(address_space.next), "Next"},
223 {ACPI_EXD_POINTER, ACPI_EXD_OFFSET(notify.next[0]),
225 {ACPI_EXD_POINTER, ACPI_EXD_OFFSET(notify.next[1]), "Next Device Notify"}
338 union acpi_operand_object *next; in acpi_ex_dump_object() local
440 next = start; in acpi_ex_dump_object()
442 acpi_os_printf("%20s : %p ", name, next); in acpi_ex_dump_object()
443 if (next) { in acpi_ex_dump_object()
446 (next), next in acpi_ex_dump_object()
[all...]
H A Devgpeutil.c64 gpe_block = gpe_block->next; in acpi_ev_walk_gpe_list()
67 gpe_xrupt_info = gpe_xrupt_info->next; in acpi_ev_walk_gpe_list()
150 next_gpe_xrupt = next_gpe_xrupt->next; in acpi_ev_get_gpe_xrupt_block()
167 while (next_gpe_xrupt->next) { in acpi_ev_get_gpe_xrupt_block()
168 next_gpe_xrupt = next_gpe_xrupt->next; in acpi_ev_get_gpe_xrupt_block()
171 next_gpe_xrupt->next = gpe_xrupt; in acpi_ev_get_gpe_xrupt_block()
237 gpe_xrupt->previous->next = gpe_xrupt->next; in acpi_ev_delete_gpe_xrupt()
241 acpi_gbl_gpe_xrupt_list_head = gpe_xrupt->next; in acpi_ev_delete_gpe_xrupt()
244 if (gpe_xrupt->next) { in acpi_ev_delete_gpe_xrupt()
276 struct acpi_gpe_notify_info *next; acpi_ev_delete_gpe_handlers() local
[all...]
/kernel/linux/linux-6.6/drivers/acpi/acpica/
H A Dexdump.c122 {ACPI_EXD_POINTER, ACPI_EXD_OFFSET(region.next), "Next"}
210 {ACPI_EXD_HDLR_LIST, ACPI_EXD_OFFSET(address_space.next), "Next"},
223 {ACPI_EXD_POINTER, ACPI_EXD_OFFSET(notify.next[0]),
225 {ACPI_EXD_POINTER, ACPI_EXD_OFFSET(notify.next[1]), "Next Device Notify"}
338 union acpi_operand_object *next; in acpi_ex_dump_object() local
440 next = start; in acpi_ex_dump_object()
442 acpi_os_printf("%20s : %p ", name, next); in acpi_ex_dump_object()
443 if (next) { in acpi_ex_dump_object()
446 (next), next in acpi_ex_dump_object()
[all...]
H A Devgpeutil.c64 gpe_block = gpe_block->next; in acpi_ev_walk_gpe_list()
67 gpe_xrupt_info = gpe_xrupt_info->next; in acpi_ev_walk_gpe_list()
150 next_gpe_xrupt = next_gpe_xrupt->next; in acpi_ev_get_gpe_xrupt_block()
167 while (next_gpe_xrupt->next) { in acpi_ev_get_gpe_xrupt_block()
168 next_gpe_xrupt = next_gpe_xrupt->next; in acpi_ev_get_gpe_xrupt_block()
171 next_gpe_xrupt->next = gpe_xrupt; in acpi_ev_get_gpe_xrupt_block()
237 gpe_xrupt->previous->next = gpe_xrupt->next; in acpi_ev_delete_gpe_xrupt()
241 acpi_gbl_gpe_xrupt_list_head = gpe_xrupt->next; in acpi_ev_delete_gpe_xrupt()
244 if (gpe_xrupt->next) { in acpi_ev_delete_gpe_xrupt()
276 struct acpi_gpe_notify_info *next; acpi_ev_delete_gpe_handlers() local
[all...]
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_graph.cpp40 for (IteratorRef it = safeIteratorDFS(); !it->end(); it->next()) in ~Graph()
56 prev[0]->next[0] = next[0]; in unlink()
57 next[0]->prev[0] = prev[0]; in unlink()
59 origin->out = (next[0] == this) ? NULL : next[0]; in unlink()
64 prev[1]->next[1] = next[1]; in unlink()
65 next[1]->prev[1] = prev[1]; in unlink()
67 target->in = (next[ in unlink()
234 virtual void next() { if (pos < count) ++pos; } next() function in nv50_ir::DFSIterator
280 virtual void next() { if (pos < count) ++pos; } next() function in nv50_ir::CFGIterator
423 Node *next = NULL; findLightestPathWeight() local
[all...]
/kernel/linux/linux-5.10/tools/power/cpupower/lib/
H A Dcpufreq.c281 current->next = malloc(sizeof(*current)); in cpufreq_get_available_governors()
282 if (!current->next) in cpufreq_get_available_governors()
284 current = current->next; in cpufreq_get_available_governors()
292 current->next = NULL; in cpufreq_get_available_governors()
308 current = first->next; in cpufreq_get_available_governors()
319 struct cpufreq_available_governors *tmp, *next; in cpufreq_put_available_governors() local
326 next = tmp->next; in cpufreq_put_available_governors()
330 tmp = next; in cpufreq_put_available_governors()
358 current->next in cpufreq_get_available_frequencies()
449 struct cpufreq_available_frequencies *tmp, *next; cpufreq_put_available_frequencies() local
530 struct cpufreq_affected_cpus *tmp, *next; cpufreq_put_affected_cpus() local
760 struct cpufreq_stats *tmp, *next; cpufreq_put_stats() local
[all...]
/kernel/linux/linux-6.6/tools/power/cpupower/lib/
H A Dcpufreq.c290 current->next = malloc(sizeof(*current)); in cpufreq_get_available_governors()
291 if (!current->next) in cpufreq_get_available_governors()
293 current = current->next; in cpufreq_get_available_governors()
301 current->next = NULL; in cpufreq_get_available_governors()
317 current = first->next; in cpufreq_get_available_governors()
328 struct cpufreq_available_governors *tmp, *next; in cpufreq_put_available_governors() local
335 next = tmp->next; in cpufreq_put_available_governors()
339 tmp = next; in cpufreq_put_available_governors()
367 current->next in cpufreq_get_available_frequencies()
458 struct cpufreq_available_frequencies *tmp, *next; cpufreq_put_available_frequencies() local
539 struct cpufreq_affected_cpus *tmp, *next; cpufreq_put_affected_cpus() local
769 struct cpufreq_stats *tmp, *next; cpufreq_put_stats() local
[all...]
/third_party/libcoap/src/oscore/
H A Doscore_context.c106 oscore_ctx_t *next = c_context->p_osc_ctx->next; in oscore_enter_context() local
108 while (next) { in oscore_enter_context()
109 prev = next; in oscore_enter_context()
110 next = next->next; in oscore_enter_context()
112 prev->next = osc_ctx; in oscore_enter_context()
135 oscore_recipient_ctx_t *next = osc_ctx->recipient_chain->next_recipient; in oscore_free_context() local
138 osc_ctx->recipient_chain = next; in oscore_free_context()
162 oscore_ctx_t *next = c_context->p_osc_ctx; oscore_remove_context() local
656 oscore_recipient_ctx_t *next = osc_ctx->recipient_chain; oscore_delete_recipient() local
[all...]
/kernel/linux/linux-5.10/ipc/
H A Dmsgutil.c24 * The next 2 defines are here bc this is the only file
38 struct msg_msgseg *next; member
39 /* the next part of the message follows immediately */
57 msg->next = NULL; in alloc_msg()
61 pseg = &msg->next; in alloc_msg()
72 seg->next = NULL; in alloc_msg()
73 pseg = &seg->next; in alloc_msg()
99 for (seg = msg->next; seg != NULL; seg = seg->next) { in load_msg()
130 for (dst_pseg = dst->next, src_pse in copy_msg()
[all...]
/kernel/linux/linux-6.6/ipc/
H A Dmsgutil.c24 * The next 2 defines are here bc this is the only file
38 struct msg_msgseg *next; member
39 /* the next part of the message follows immediately */
57 msg->next = NULL; in alloc_msg()
61 pseg = &msg->next; in alloc_msg()
72 seg->next = NULL; in alloc_msg()
73 pseg = &seg->next; in alloc_msg()
99 for (seg = msg->next; seg != NULL; seg = seg->next) { in load_msg()
130 for (dst_pseg = dst->next, src_pse in copy_msg()
[all...]
/third_party/node/deps/v8/src/heap/
H A Dlist.h34 DCHECK(!element->list_node().next()); in PushBack()
45 DCHECK(!element->list_node().next()); in PushFront()
61 front_ = element->list_node().next(); in Remove()
63 T* next = element->list_node().next(); in Remove() local
65 if (next) next->list_node().set_prev(prev); in Remove()
66 if (prev) prev->list_node().set_next(next); in Remove()
75 it = it->list_node().next(); in Contains()
92 DCHECK(!element->list_node().next()); in AddFirstElement()
132 T* next() { return next_; } next() function in v8::internal::heap::ListNode
135 const T* next() const { return next_; } next() function in v8::internal::heap::ListNode
144 set_next(T* next) set_next() argument
[all...]
/third_party/skia/fuzz/
H A DFuzzCanvas.cpp79 fuzz->next(&t); in make_fuzz_t()
99 fuzz->next(&color); in make_fuzz_colorfilter()
119 fuzz->next(&mul, &add); in make_fuzz_colorfilter()
126 fuzz->next(&grayscale); in make_fuzz_colorfilter()
192 fuzz->next(&color); in make_fuzz_shader()
198 fuzz->next(&useMatrix); in make_fuzz_shader()
222 fuzz->next(&useMatrix, &useTile); in make_fuzz_shader()
227 fuzz->next(&tile); in make_fuzz_shader()
247 fuzz->next(&useMatrix, &usePos); in make_fuzz_shader()
266 fuzz->next( in make_fuzz_shader()
[all...]
/kernel/linux/linux-5.10/drivers/net/wireguard/
H A Dqueueing.c60 offsetof(struct sk_buff, next) != offsetof(struct prev_queue, empty.next) - in wg_prev_queue_init()
82 struct sk_buff *tail = queue->tail, *next = smp_load_acquire(&NEXT(tail)); in wg_prev_queue_dequeue() local
85 if (!next) in wg_prev_queue_dequeue()
87 queue->tail = next; in wg_prev_queue_dequeue()
88 tail = next; in wg_prev_queue_dequeue()
89 next = smp_load_acquire(&NEXT(next)); in wg_prev_queue_dequeue()
91 if (next) { in wg_prev_queue_dequeue()
92 queue->tail = next; in wg_prev_queue_dequeue()
[all...]
/kernel/linux/linux-5.10/sound/pci/ctxfi/
H A Dctimap.c27 entry->next = entry->addr; in input_mapper_add()
49 pos = head->next; in input_mapper_add()
56 entry->next = pos_ent->addr; in input_mapper_add()
58 pre_ent->next = entry->addr; in input_mapper_add()
67 struct list_head *next, *pre, *head; in input_mapper_delete() local
76 next = (entry->list.next == head) ? head->next : entry->list.next; in input_mapper_delete()
80 entry->next in input_mapper_delete()
[all...]
/kernel/linux/linux-6.6/drivers/net/wireguard/
H A Dqueueing.c60 offsetof(struct sk_buff, next) != offsetof(struct prev_queue, empty.next) - in wg_prev_queue_init()
82 struct sk_buff *tail = queue->tail, *next = smp_load_acquire(&NEXT(tail)); in wg_prev_queue_dequeue() local
85 if (!next) in wg_prev_queue_dequeue()
87 queue->tail = next; in wg_prev_queue_dequeue()
88 tail = next; in wg_prev_queue_dequeue()
89 next = smp_load_acquire(&NEXT(next)); in wg_prev_queue_dequeue()
91 if (next) { in wg_prev_queue_dequeue()
92 queue->tail = next; in wg_prev_queue_dequeue()
[all...]
/kernel/linux/linux-6.6/sound/pci/ctxfi/
H A Dctimap.c27 entry->next = entry->addr; in input_mapper_add()
49 pos = head->next; in input_mapper_add()
56 entry->next = pos_ent->addr; in input_mapper_add()
58 pre_ent->next = entry->addr; in input_mapper_add()
67 struct list_head *next, *pre, *head; in input_mapper_delete() local
76 next = (entry->list.next == head) ? head->next : entry->list.next; in input_mapper_delete()
80 entry->next in input_mapper_delete()
[all...]
/third_party/musl/src/stdio/
H A Dofl.c51 ofl_free = ofl_free->next; in __ofl_alloc()
52 f->next = NULL; in __ofl_alloc()
77 /* retrieve fist and move to next free FILE */ in __ofl_alloc()
87 tmp->next = NULL; in __ofl_alloc()
88 f->next = tmp; in __ofl_alloc()
90 f = f->next; in __ofl_alloc()
93 /* reset and move to next free FILE */ in __ofl_alloc()
95 ofl_free = ofl_free->next; in __ofl_alloc()
99 f->next = NULL; in __ofl_alloc()
126 f->prev->next in __ofl_free()
[all...]
/third_party/mksh/
H A Dlalloc.c96 ap->next = NULL; in ainit()
115 while (ap->next != lp) in findptr()
116 if ((ap = ap->next) == NULL) { in findptr()
150 pp->next = lp->next; in aresize()
161 lp->next = ap->next; in aresize()
162 ap->next = lp; in aresize()
175 pp->next = lp->next; in afree()
[all...]
/third_party/skia/third_party/externals/expat/expat/tests/
H A Dmemcheck.c43 struct allocation_entry *next; member
69 entry->next = NULL; in tracking_malloc()
77 alloc_tail->next = entry; in tracking_malloc()
88 for (entry = alloc_head; entry != NULL; entry = entry->next) { in find_allocation()
110 entry->prev->next = entry->next; in tracking_free()
112 alloc_head = entry->next; in tracking_free()
113 if (entry->next != NULL) in tracking_free()
114 entry->next->prev = entry->prev; in tracking_free()
116 alloc_tail = entry->next; in tracking_free()
[all...]
/third_party/pulseaudio/src/pulsecore/
H A Dstrlist.c35 pa_strlist *next; member
48 n->next = l; in pa_strlist_prepend()
58 for (; l; l = l->next) { in pa_strlist_to_string()
76 pa_strlist *n = l->next; in pa_strlist_remove()
82 prev->next = n; in pa_strlist_remove()
90 l = l->next; in pa_strlist_remove()
100 l = l->next; in pa_strlist_free()
116 r = l->next; in pa_strlist_pop()
131 n->next = NULL; in pa_strlist_parse()
136 p->next in pa_strlist_parse()
[all...]
/third_party/selinux/checkpolicy/
H A Dqueue.c38 newnode->next = NULL; in queue_insert()
43 q->tail->next = newnode; in queue_insert()
62 newnode->next = NULL; in queue_push()
67 newnode->next = q->head; in queue_push()
86 q->head = q->head->next; in queue_remove()
118 p = p->next; in queue_destroy()
138 p = p->next; in queue_map()
159 last->next = p->next; in queue_map_remove_on_error()
160 if (last->next in queue_map_remove_on_error()
[all...]

Completed in 12 milliseconds

12345678910>>...509