| /include/linux/ |
| D | list.h | 37 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
55 struct list_head *next);
67 struct list_head *next) in __list_add_valid() argument
83 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid()
88 ret &= __list_add_valid_or_report(new, prev, next); in __list_add_valid()
112 struct list_head *next = entry->next; in __list_del_entry_valid() local
119 if (likely(prev->next == entry && next->prev == entry)) in __list_del_entry_valid()
130 struct list_head *next) in __list_add_valid() argument
148 struct list_head *next) in __list_add() argument
150 if (!__list_add_valid(new, prev, next)) in __list_add()
[all …]
|
| D | list_bl.h | 39 struct hlist_bl_node *next, **pprev; member
46 h->next = NULL; in INIT_HLIST_BL_NODE()
82 n->next = first; in hlist_bl_add_head()
84 first->pprev = &n->next; in hlist_bl_add_head()
90 struct hlist_bl_node *next) in hlist_bl_add_before() argument
92 struct hlist_bl_node **pprev = next->pprev; in hlist_bl_add_before()
95 n->next = next; in hlist_bl_add_before()
96 next->pprev = &n->next; in hlist_bl_add_before()
107 n->next = prev->next; in hlist_bl_add_behind()
108 n->pprev = &prev->next; in hlist_bl_add_behind()
[all …]
|
| D | rculist.h | 24 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD_RCU()
32 #define list_next_rcu(list) (*((struct list_head __rcu **)(&(list)->next)))
77 struct list_head *prev, struct list_head *next) in __list_add_rcu() argument
79 if (!__list_add_valid(new, prev, next)) in __list_add_rcu()
82 new->next = next; in __list_add_rcu()
85 next->prev = new; in __list_add_rcu()
106 __list_add_rcu(new, head, head->next); in list_add_rcu()
203 new->next = old->next; in list_replace_rcu()
206 new->next->prev = new; in list_replace_rcu()
231 struct list_head *next, in __list_splice_init_rcu() argument
[all …]
|
| D | list_nulls.h | 26 struct hlist_nulls_node *next, **pprev; member
96 n->next = first; in hlist_nulls_add_head()
100 WRITE_ONCE(first->pprev, &n->next); in hlist_nulls_add_head()
105 struct hlist_nulls_node *next = n->next; in __hlist_nulls_del() local
108 WRITE_ONCE(*pprev, next); in __hlist_nulls_del()
109 if (!is_a_nulls(next)) in __hlist_nulls_del()
110 WRITE_ONCE(next->pprev, pprev); in __hlist_nulls_del()
131 pos = pos->next)
143 pos = pos->next)
|
| D | rculist_nulls.h | 53 (*((struct hlist_nulls_node __rcu __force **)&(node)->next))
104 WRITE_ONCE(n->next, first); in hlist_nulls_add_head_rcu()
108 WRITE_ONCE(first->pprev, &n->next); in hlist_nulls_add_head_rcu()
136 for (i = h->first; !is_a_nulls(i); i = i->next) in hlist_nulls_add_tail_rcu()
140 WRITE_ONCE(n->next, last->next); in hlist_nulls_add_tail_rcu()
141 n->pprev = &last->next; in hlist_nulls_add_tail_rcu()
151 n->pprev = &n->next; in hlist_nulls_add_fake()
152 n->next = (struct hlist_nulls_node *)NULLS_MARKER(NULL); in hlist_nulls_add_fake()
|
| D | pagewalk.h | 70 unsigned long next, struct mm_walk *walk);
72 unsigned long next, struct mm_walk *walk);
74 unsigned long next, struct mm_walk *walk);
76 unsigned long next, struct mm_walk *walk);
78 unsigned long next, struct mm_walk *walk);
79 int (*pte_hole)(unsigned long addr, unsigned long next,
82 unsigned long addr, unsigned long next,
84 int (*test_walk)(unsigned long addr, unsigned long next,
89 int (*install_pte)(unsigned long addr, unsigned long next,
|
| D | llist.h | 61 struct llist_node *next; member
86 node->next = node; in init_llist_node()
100 return node->next != node; in llist_on_list()
144 for ((pos) = (node); pos; (pos) = (pos)->next)
163 for ((pos) = (node); (pos) && ((n) = (pos)->next, true); (pos) = (n))
183 (pos) = llist_entry((pos)->member.next, typeof(*(pos)), member))
205 (n = llist_entry(pos->member.next, typeof(*n), member), true); \
223 return node->next; in llist_next()
234 new_last->next = head->first; in __llist_add_batch()
236 return new_last->next == NULL; in __llist_add_batch()
|
| D | user-return-notifier.h | 20 struct task_struct *next) in propagate_user_return_notify() argument
24 set_tsk_thread_flag(next, TIF_USER_RETURN_NOTIFY); in propagate_user_return_notify()
40 struct task_struct *next) in propagate_user_return_notify() argument
|
| D | damon.h | 648 return container_of(r->list.next, struct damon_region, list); in damon_next_region()
678 #define damon_for_each_region_safe(r, next, t) \ argument
679 list_for_each_entry_safe(r, next, &t->regions_list, list)
684 #define damon_for_each_target_safe(t, next, ctx) \ argument
685 list_for_each_entry_safe(t, next, &(ctx)->adaptive_targets, list)
690 #define damon_for_each_scheme_safe(s, next, ctx) \ argument
691 list_for_each_entry_safe(s, next, &(ctx)->schemes, list)
696 #define damos_for_each_quota_goal_safe(goal, next, quota) \ argument
697 list_for_each_entry_safe(goal, next, &(quota)->goals, list)
702 #define damos_for_each_filter_safe(f, next, scheme) \ argument
[all …]
|
| D | page_ext.h | 95 void *next = curr; in page_ext_next() local
96 next += page_ext_size; in page_ext_next()
97 return next; in page_ext_next()
|
| D | rculist_bl.h | 79 n->next = first; in hlist_bl_add_head_rcu()
81 first->pprev = &n->next; in hlist_bl_add_head_rcu()
99 pos = rcu_dereference_raw(pos->next))
|
| D | agpgart.h | 90 struct agp_client *next; member
98 struct agp_controller *next; member
113 struct agp_file_private *next; member
|
| D | rhashtable.h | 425 pos = rht_dereference_bucket((pos)->next, tbl, hash))
449 pos = rht_dereference_bucket((pos)->next, tbl, hash))
476 #define rht_for_each_entry_safe(tpos, pos, next, tbl, hash, member) \ argument
478 next = !rht_is_a_nulls(pos) ? \
479 rht_dereference_bucket(pos->next, tbl, hash) : NULL; \
481 pos = next, \
482 next = !rht_is_a_nulls(pos) ? \
483 rht_dereference_bucket(pos->next, tbl, hash) : NULL)
500 pos = rcu_dereference_raw(pos->next))
516 pos = rcu_dereference_raw(pos->next))
[all …]
|
| D | cookie.h | 39 s64 next = atomic64_add_return(COOKIE_LOCAL_BATCH, in gen_cookie_next() local
41 val = next - COOKIE_LOCAL_BATCH; in gen_cookie_next()
|
| D | msg.h | 13 struct msg_msgseg *next; member
|
| D | if_tunnel.h | 15 for (pos = rcu_dereference(start); pos; pos = rcu_dereference(pos->next))
|
| D | lwq.h | 85 _t2 = ((*_t1)->next), \
88 (_n) ? (_t1 = &(_n)->_member.node.next, 0) \
|
| /include/drm/ |
| D | spsc_queue.h | 35 struct spsc_node *next; member
69 node->next = NULL; in spsc_queue_push()
76 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next); in spsc_queue_push()
93 struct spsc_node *next, *node; in spsc_queue_pop() local
103 next = READ_ONCE(node->next); in spsc_queue_pop()
104 WRITE_ONCE(queue->head, next); in spsc_queue_pop()
106 if (unlikely(!next)) { in spsc_queue_pop()
110 (long)&node->next, (long) &queue->head) != (long)&node->next) { in spsc_queue_pop()
114 } while (unlikely(!(queue->head = READ_ONCE(node->next)))); in spsc_queue_pop()
|
| /include/asm-generic/ |
| D | switch_to.h | 21 #define switch_to(prev, next, last) \ argument
23 ((last) = __switch_to((prev), (next))); \
|
| D | nommu_context.h | 12 struct mm_struct *next, in switch_mm() argument
|
| /include/trace/hooks/ |
| D | fpsimd.h | 15 TP_PROTO(struct task_struct *prev, struct task_struct *next),
16 TP_ARGS(prev, next))
|
| D | mpam.h | 15 TP_PROTO(struct task_struct *prev, struct task_struct *next),
16 TP_ARGS(prev, next));
|
| /include/net/ |
| D | atmclip.h | 34 struct clip_vcc *next; /* next VCC */ member
50 struct net_device *next; /* next CLIP interface */ member
|
| /include/sound/ |
| D | soundfont.h | 20 struct snd_sf_zone *next; /* Link to next */ member
38 struct snd_sf_sample *next; member
45 struct snd_soundfont *next; /* Link to next */ member
|
| /include/uapi/linux/ |
| D | dm-ioctl.h | 168 __u32 next; member
193 __u32 next; /* offset to the next record from member
216 __u32 next; member
|