| /linux/include/linux/ |
| H A D | llist.h | 57 struct llist_node *first;
60 struct llist_node { struct
61 struct llist_node *next; argument
84 static inline void init_llist_node(struct llist_node *node) in init_llist_node()
98 static inline bool llist_on_list(const struct llist_node *node) in llist_on_list()
221 static inline struct llist_node *llist_next(struct llist_node *node) in llist_next()
234 static inline bool llist_add_batch(struct llist_node *new_first, in llist_add_batch()
235 struct llist_node *new_last, in llist_add_batch()
238 struct llist_node *first = READ_ONCE(head->first); in llist_add_batch()
247 static inline bool __llist_add_batch(struct llist_node *new_first, in __llist_add_batch()
[all …]
|
| H A D | lwq.h | 20 struct llist_node node;
25 struct llist_node *ready; /* entries to be dequeued */
54 struct llist_node *__lwq_dequeue(struct lwq *q);
66 ({ struct llist_node *_n = __lwq_dequeue(q); \
69 struct llist_node *lwq_dequeue_all(struct lwq *q);
116 static inline bool lwq_enqueue_batch(struct llist_node *n, struct lwq *q) in lwq_enqueue_batch()
118 struct llist_node *e = n; in lwq_enqueue_batch()
|
| H A D | rethook.h | 54 struct llist_node llist;
67 struct llist_node **cur);
|
| H A D | kprobes.h | 167 struct llist_node llist;
548 struct llist_node **cur) in kretprobe_find_ret_addr()
559 struct llist_node **cur);
569 struct llist_node **cur) in kretprobe_find_ret_addr()
|
| H A D | smp_types.h | 59 struct llist_node llist;
|
| H A D | tty_buffer.h | 13 struct llist_node free;
|
| /linux/lib/ |
| H A D | llist.c | 31 struct llist_node *llist_del_first(struct llist_head *head) in llist_del_first()
33 struct llist_node *entry, *next; in llist_del_first()
58 struct llist_node *this) in llist_del_first_this()
60 struct llist_node *entry, *next; in llist_del_first_this()
81 struct llist_node *llist_reverse_order(struct llist_node *head) in llist_reverse_order()
83 struct llist_node *new_head = NULL; in llist_reverse_order()
86 struct llist_node *tmp = head; in llist_reverse_order()
|
| H A D | lwq.c | 19 struct llist_node *__lwq_dequeue(struct lwq *q) in __lwq_dequeue()
21 struct llist_node *this; in __lwq_dequeue()
49 struct llist_node *lwq_dequeue_all(struct lwq *q) in lwq_dequeue_all()
51 struct llist_node *r, *t, **ep; in lwq_dequeue_all()
103 struct llist_node *l, **t1, *t2; in lwq_test()
|
| H A D | closure.c | 79 struct llist_node *list; in __closure_wake_up()
81 struct llist_node *reverse = NULL; in __closure_wake_up()
|
| /linux/io_uring/ |
| H A D | tw.c | 22 struct llist_node *node = llist_del_all(&ctx->fallback_llist); in io_fallback_req_func()
53 struct llist_node *io_handle_tw_list(struct llist_node *node, in io_handle_tw_list()
61 struct llist_node *next = node->next; in io_handle_tw_list()
88 static __cold void __io_fallback_tw(struct llist_node *node, bool sync) in __io_fallback_tw()
118 struct llist_node *node = llist_del_all(&tctx->task_list); in io_fallback_tw()
123 struct llist_node *tctx_task_work_run(struct io_uring_task *tctx, in tctx_task_work_run()
127 struct llist_node *node; in tctx_task_work_run()
146 struct llist_node *ret; in tctx_task_work()
174 struct llist_node *head; in io_req_local_work_add()
276 struct llist_node *node = llist_del_all(&ctx->work_llist); in io_move_task_work_from_local()
[all …]
|
| H A D | tw.h | 26 struct llist_node *io_handle_tw_list(struct llist_node *node, unsigned int *count, unsigned int max…
37 struct llist_node *tctx_task_work_run(struct io_uring_task *tctx, unsigned int max_entries, unsigne…
|
| /linux/kernel/bpf/ |
| H A D | stream.c | 97 static void bpf_stream_free_list(struct llist_node *list) in bpf_stream_free_list()
105 static struct llist_node *bpf_stream_backlog_peek(struct bpf_stream *stream) in bpf_stream_backlog_peek()
110 static struct llist_node *bpf_stream_backlog_pop(struct bpf_stream *stream) in bpf_stream_backlog_pop()
112 struct llist_node *node; in bpf_stream_backlog_pop()
124 struct llist_node *head, *tail; in bpf_stream_backlog_fill()
159 struct llist_node *node; in bpf_stream_read()
286 struct llist_node *list; in bpf_stream_stage_free()
304 struct llist_node *node; in bpf_stream_stage_printk()
332 struct llist_node *list, *head, *tail; in bpf_stream_stage_commit()
|
| H A D | memalloc.c | 36 #define LLIST_NODE_SZ sizeof(struct llist_node)
110 struct llist_node *free_by_rcu_tail;
112 struct llist_node *waiting_for_gp_tail;
130 static struct llist_node notrace *__llist_del_first(struct llist_head *head) in __llist_del_first()
132 struct llist_node *entry, *next; in __llist_del_first()
265 static int free_all(struct bpf_mem_cache *c, struct llist_node *llnode, bool percpu) in free_all()
267 struct llist_node *pos, *t; in free_all()
300 struct llist_node *llnode = obj; in enque_to_free()
310 struct llist_node *llnode, *t; in do_call_rcu_ttrace()
340 struct llist_node *llnode, *t; in free_bulk()
[all …]
|
| /linux/kernel/trace/ |
| H A D | rethook.c | 23 struct llist_node *node; in rethook_flush_task()
206 struct llist_node **cur) in __rethook_find_ret_addr()
209 struct llist_node *node = *cur; in __rethook_find_ret_addr()
245 struct llist_node **cur) in rethook_find_ret_addr()
282 struct llist_node *first, *node = NULL; in rethook_trampoline_handler()
|
| /linux/net/rds/ |
| H A D | ib_rdma.c | 197 struct llist_node *ret; in rds_ib_reuse_mr()
295 struct llist_node *node; in llist_append_to_list()
296 struct llist_node *next; in llist_append_to_list()
316 struct llist_node **nodes_head, in list_to_llist_nodes()
317 struct llist_node **nodes_tail) in list_to_llist_nodes()
320 struct llist_node *cur = NULL; in list_to_llist_nodes()
321 struct llist_node **next = nodes_head; in list_to_llist_nodes()
342 struct llist_node *clean_nodes; in rds_ib_flush_mr_pool()
343 struct llist_node *clean_tail; in rds_ib_flush_mr_pool()
|
| /linux/arch/x86/kernel/cpu/mce/ |
| H A D | genpool.c | 55 struct llist_node *mce_gen_pool_prepare_records(void) in mce_gen_pool_prepare_records()
57 struct llist_node *head; in mce_gen_pool_prepare_records()
77 struct llist_node *head; in mce_gen_pool_process()
|
| H A D | internal.h | 28 struct llist_node llnode;
36 struct llist_node *mce_gen_pool_prepare_records(void);
|
| /linux/drivers/gpu/drm/i915/ |
| H A D | i915_active.c | 48 static inline struct llist_node *barrier_to_ll(struct active_node *node) in barrier_to_ll()
51 return (struct llist_node *)&node->base.cb.node; in barrier_to_ll()
67 static inline struct active_node *barrier_from_ll(struct llist_node *x) in barrier_from_ll()
369 struct llist_node *head = NULL, *tail = NULL; in ____active_del_barrier()
370 struct llist_node *pos, *next; in ____active_del_barrier()
842 struct llist_node *first = NULL, *last = NULL; in i915_active_acquire_preallocate_barrier()
860 struct llist_node *prev = first; in i915_active_acquire_preallocate_barrier()
922 struct llist_node *pos, *next; in i915_active_acquire_barrier()
963 static struct dma_fence **ll_to_fence_slot(struct llist_node *node) in ll_to_fence_slot()
971 struct llist_node *node, *next; in i915_request_add_active_barriers()
|
| /linux/kernel/rcu/ |
| H A D | tree.h | 338 struct llist_node node;
428 struct llist_node *srs_wait_tail; /* wait for GP users. */
429 struct llist_node *srs_done_tail; /* ready for GP users. */
|
| /linux/drivers/gpu/drm/i915/gt/ |
| H A D | intel_breadcrumbs.c | 165 static struct llist_node *
166 slist_add(struct llist_node *node, struct llist_node *head) in slist_add()
176 struct llist_node *signal, *sn; in signal_irq_work()
|
| /linux/include/linux/sunrpc/ |
| H A D | svc_rdma.h | 178 struct llist_node rc_node;
233 struct llist_node sc_node;
|
| /linux/drivers/gpu/drm/xe/ |
| H A D | xe_bo_types.h | 81 struct llist_node freed;
|
| H A D | xe_range_fence.h | 43 struct llist_node link;
|
| /linux/drivers/dma/ |
| H A D | cv1800b-dmamux.c | 70 struct llist_node node;
102 struct llist_node *node; in cv1800_dmamux_route_allocate()
|
| /linux/arch/arm/include/asm/ |
| H A D | stacktrace.h | 22 struct llist_node *kr_cur;
|