| /linux/include/linux/ |
| 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()
221 static inline struct llist_node *llist_next(struct llist_node *node) in llist_next()
227 struct llist_node *new_last,
231 struct llist_node *new_last, in __llist_add_batch()
271 struct llist_node *first = head->first; in __llist_del_all()
288 struct llist_node *n = llist_del_first(head); in llist_del_first_init()
296 struct llist_node *this);
[all …]
|
| 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()
|
| A D | rethook.h | 54 struct llist_node llist;
67 struct llist_node **cur);
|
| 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()
|
| A D | smp_types.h | 59 struct llist_node llist;
|
| A D | tty_buffer.h | 13 struct llist_node free;
|
| /linux/lib/ |
| A D | llist.c | 26 bool llist_add_batch(struct llist_node *new_first, struct llist_node *new_last, in llist_add_batch()
29 struct llist_node *first = READ_ONCE(head->first); in llist_add_batch()
53 struct llist_node *llist_del_first(struct llist_head *head) in llist_del_first()
55 struct llist_node *entry, *next; in llist_del_first()
80 struct llist_node *this) in llist_del_first_this()
82 struct llist_node *entry, *next; in llist_del_first_this()
103 struct llist_node *llist_reverse_order(struct llist_node *head) in llist_reverse_order()
105 struct llist_node *new_head = NULL; in llist_reverse_order()
108 struct llist_node *tmp = head; in llist_reverse_order()
|
| 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()
|
| A D | closure.c | 79 struct llist_node *list; in __closure_wake_up()
81 struct llist_node *reverse = NULL; in __closure_wake_up()
|
| /linux/kernel/bpf/ |
| A D | memalloc.c | 36 #define LLIST_NODE_SZ sizeof(struct llist_node)
108 struct llist_node *free_by_rcu_tail;
110 struct llist_node *waiting_for_gp_tail;
130 struct llist_node *entry, *next; in __llist_del_first()
268 struct llist_node *pos, *t; in free_all()
299 struct llist_node *llnode = obj; in enque_to_free()
309 struct llist_node *llnode, *t; in do_call_rcu_ttrace()
339 struct llist_node *llnode, *t; in free_bulk()
368 struct llist_node *llnode; in __free_by_rcu()
387 struct llist_node *llnode, *t; in check_free_by_rcu()
[all …]
|
| /linux/kernel/trace/ |
| 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/arch/x86/kernel/cpu/mce/ |
| 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()
76 struct llist_node *head; in mce_gen_pool_process()
|
| A D | internal.h | 28 struct llist_node llnode;
36 struct llist_node *mce_gen_pool_prepare_records(void);
|
| /linux/net/rds/ |
| A D | ib_rdma.c | 201 struct llist_node *ret; in rds_ib_reuse_mr()
299 struct llist_node *node; in llist_append_to_list()
300 struct llist_node *next; in llist_append_to_list()
320 struct llist_node **nodes_head, in list_to_llist_nodes()
321 struct llist_node **nodes_tail) in list_to_llist_nodes()
324 struct llist_node *cur = NULL; in list_to_llist_nodes()
325 struct llist_node **next = nodes_head; in list_to_llist_nodes()
346 struct llist_node *clean_nodes; in rds_ib_flush_mr_pool()
347 struct llist_node *clean_tail; in rds_ib_flush_mr_pool()
|
| /linux/drivers/gpu/drm/i915/ |
| 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()
370 struct llist_node *head = NULL, *tail = NULL; in ____active_del_barrier()
371 struct llist_node *pos, *next; in ____active_del_barrier()
861 struct llist_node *first = NULL, *last = NULL; in i915_active_acquire_preallocate_barrier()
879 struct llist_node *prev = first; in i915_active_acquire_preallocate_barrier()
941 struct llist_node *pos, *next; in i915_active_acquire_barrier()
982 static struct dma_fence **ll_to_fence_slot(struct llist_node *node) in ll_to_fence_slot()
990 struct llist_node *node, *next; in i915_request_add_active_barriers()
|
| /linux/kernel/rcu/ |
| A D | tree.h | 327 struct llist_node node;
417 struct llist_node *srs_wait_tail; /* wait for GP users. */
418 struct llist_node *srs_done_tail; /* ready for GP users. */
|
| /linux/drivers/gpu/drm/i915/gt/ |
| A D | intel_breadcrumbs.c | 163 static struct llist_node *
164 slist_add(struct llist_node *node, struct llist_node *head) in slist_add()
174 struct llist_node *signal, *sn; in signal_irq_work()
|
| /linux/drivers/net/ethernet/mellanox/mlx5/core/ |
| A D | fs_counters.c | 56 struct llist_node addlist;
57 struct llist_node dellist;
279 struct llist_node *dellist = llist_del_all(&fc_stats->dellist); in mlx5_fc_stats_work()
280 struct llist_node *addlist = llist_del_all(&fc_stats->addlist); in mlx5_fc_stats_work()
460 struct llist_node *tmplist; in mlx5_cleanup_fc_stats()
|
| /linux/drivers/gpu/drm/xe/ |
| A D | xe_bo_types.h | 61 struct llist_node freed;
|
| A D | xe_range_fence.h | 43 struct llist_node link;
|
| /linux/include/linux/sunrpc/ |
| A D | svc_rdma.h | 178 struct llist_node rc_node;
232 struct llist_node sc_node;
|
| /linux/io_uring/ |
| A D | io_uring.h | 88 struct llist_node *io_handle_tw_list(struct llist_node *node, unsigned int *count, unsigned int max…
89 struct llist_node *tctx_task_work_run(struct io_uring_task *tctx, unsigned int max_entries, unsigne…
|
| A D | sqpoll.c | 231 static unsigned int io_sq_tw(struct llist_node **retry_list, int max_entries) in io_sq_tw()
249 static bool io_sq_tw_pending(struct llist_node *retry_list) in io_sq_tw_pending()
269 struct llist_node *retry_list = NULL; in io_sq_thread()
|
| /linux/arch/arm/include/asm/ |
| A D | stacktrace.h | 21 struct llist_node *kr_cur;
|
| /linux/arch/s390/include/asm/ |
| A D | unwind.h | 41 struct llist_node *kr_cur;
|