Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 148) sorted by relevance

123456

/include/linux/
A Dlist.h83 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid()
112 struct list_head *next = entry->next; in __list_del_entry_valid() local
154 new->next = next; in __list_add()
196 WRITE_ONCE(prev->next, next); in __list_del()
244 new->next = old->next; in list_replace()
327 first->prev->next = last->next; in list_bulk_move_tail()
458 list->next = head->next; in __list_cut_position()
515 list->next = head->next; in list_cut_before()
533 last->next = next; in __list_splice()
1040 WRITE_ONCE(n->next, next); in hlist_add_before()
[all …]
A Dlist_bl.h46 h->next = NULL; in INIT_HLIST_BL_NODE()
82 n->next = first; in hlist_bl_add_head()
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()
109 prev->next = n; in hlist_bl_add_behind()
111 if (n->next) in hlist_bl_add_behind()
112 n->next->pprev = &n->next; in hlist_bl_add_behind()
117 struct hlist_bl_node *next = n->next; in __hlist_bl_del() local
127 if (next) in __hlist_bl_del()
[all …]
A Drculist.h93 new->next = next; in __list_add_rcu()
247 new->next = old->next; in list_replace_rcu()
308 last->next = next; in __list_splice_init_rcu()
576 struct hlist_node *next = old->next; in hlist_replace_rcu() local
578 new->next = next; in hlist_replace_rcu()
582 WRITE_ONCE(new->next->pprev, &new->next); in hlist_replace_rcu()
674 n->next = last->next; in hlist_add_tail_rcu()
704 n->next = next; in hlist_add_before_rcu()
706 WRITE_ONCE(next->pprev, &n->next); in hlist_add_before_rcu()
730 n->next = prev->next; in hlist_add_behind_rcu()
[all …]
A Dlist_nulls.h26 struct hlist_nulls_node *next, **pprev; member
97 n->next = first; in hlist_nulls_add_head()
101 WRITE_ONCE(first->pprev, &n->next); in hlist_nulls_add_head()
106 struct hlist_nulls_node *next = n->next; in __hlist_nulls_del() local
109 WRITE_ONCE(*pprev, next); in __hlist_nulls_del()
110 if (!is_a_nulls(next)) in __hlist_nulls_del()
111 WRITE_ONCE(next->pprev, pprev); in __hlist_nulls_del()
132 pos = pos->next)
144 pos = pos->next)
A Drculist_nulls.h53 (*((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()
A Dllist.h61 struct llist_node *next; member
86 WRITE_ONCE(node->next, node); in init_llist_node()
100 return READ_ONCE(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 READ_ONCE(node->next); in llist_next()
241 new_last->next = first; in llist_add_batch()
251 new_last->next = head->first; in __llist_add_batch()
[all …]
A Dpagewalk.h72 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);
80 unsigned long next, struct mm_walk *walk);
81 int (*pte_hole)(unsigned long addr, unsigned long next,
84 unsigned long addr, unsigned long next,
86 int (*test_walk)(unsigned long addr, unsigned long next,
91 int (*install_pte)(unsigned long addr, unsigned long next,
A Duser-return-notifier.h20 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
A Ddamon.h828 #define damon_for_each_region_safe(r, next, t) \ argument
829 list_for_each_entry_safe(r, next, &t->regions_list, list)
834 #define damon_for_each_target_safe(t, next, ctx) \ argument
840 #define damon_for_each_scheme_safe(s, next, ctx) \ argument
841 list_for_each_entry_safe(s, next, &(ctx)->schemes, list)
846 #define damos_for_each_quota_goal_safe(goal, next, quota) \ argument
847 list_for_each_entry_safe(goal, next, &(quota)->goals, list)
852 #define damos_for_each_filter_safe(f, next, scheme) \ argument
858 #define damos_for_each_ops_filter_safe(f, next, scheme) \ argument
869 struct damon_region *prev, struct damon_region *next, in damon_insert_region() argument
[all …]
A Drculist_bl.h79 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))
A Dagpgart.h90 struct agp_client *next; member
98 struct agp_controller *next; member
113 struct agp_file_private *next; member
A Drhashtable.h481 pos = next, \
500 pos = rcu_dereference_raw(pos->next))
516 pos = rcu_dereference_raw(pos->next))
750 pprev = &head->next; in __rhashtable_insert_fast()
763 RCU_INIT_POINTER(list->next, plist); in __rhashtable_insert_fast()
788 RCU_INIT_POINTER(obj->next, head); in __rhashtable_insert_fast()
793 RCU_INIT_POINTER(list->next, NULL); in __rhashtable_insert_fast()
1022 pprev = &he->next; in __rhashtable_remove_fast_one()
1028 lpprev = &list->next; in __rhashtable_remove_fast_one()
1176 pprev = &he->next; in __rhashtable_replace_fast()
[all …]
A Dcookie.h39 s64 next = atomic64_add_return(COOKIE_LOCAL_BATCH, in gen_cookie_next() local
41 val = next - COOKIE_LOCAL_BATCH; in gen_cookie_next()
A Dpage_ext.h107 void *next = curr; in page_ext_next() local
108 next += page_ext_size; in page_ext_next()
109 return next; in page_ext_next()
A Dmsg.h13 struct msg_msgseg *next; member
A Dif_tunnel.h15 for (pos = rcu_dereference(start); pos; pos = rcu_dereference(pos->next))
A Drhashtable-types.h19 struct rhash_head __rcu *next; member
24 struct rhlist_head __rcu *next; member
/include/drm/
A Dspsc_queue.h35 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/
A Dswitch_to.h21 #define switch_to(prev, next, last) \ argument
23 ((last) = __switch_to((prev), (next))); \
A Dmcs_spinlock.h5 struct mcs_spinlock *next; member
A Dnommu_context.h12 struct mm_struct *next, in switch_mm() argument
/include/net/
A Datmclip.h34 struct clip_vcc *next; /* next VCC */ member
50 struct net_device *next; /* next CLIP interface */ member
/include/sound/
A Dsoundfont.h20 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/rv/
A Dltl_monitor.h124 char states[32], next[32]; in ltl_trace_event() local
131 snprintf(next, sizeof(next), "%*pbl", RV_MAX_BA_STATES, next_state); in ltl_trace_event()
140 CONCATENATE(trace_event_, MONITOR_NAME)(task, states, atoms.buffer, next); in ltl_trace_event()
/include/uapi/linux/
A Ddm-ioctl.h168 __u32 next; member
193 __u32 next; /* offset to the next record from member
216 __u32 next; member

Completed in 751 milliseconds

123456