Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 25 of 54) sorted by relevance

123

/include/asm-generic/
A Dcmpxchg-local.h18 unsigned long flags, prev; in __generic_cmpxchg_local() local
28 case 1: prev = *(u8 *)ptr; in __generic_cmpxchg_local()
29 if (prev == (old & 0xffu)) in __generic_cmpxchg_local()
32 case 2: prev = *(u16 *)ptr; in __generic_cmpxchg_local()
36 case 4: prev = *(u32 *)ptr; in __generic_cmpxchg_local()
41 if (prev == old) in __generic_cmpxchg_local()
48 return prev; in __generic_cmpxchg_local()
57 u64 prev; in __generic_cmpxchg64_local() local
61 prev = *(u64 *)ptr; in __generic_cmpxchg64_local()
62 if (prev == old) in __generic_cmpxchg64_local()
[all …]
A Dswitch_to.h21 #define switch_to(prev, next, last) \ argument
23 ((last) = __switch_to((prev), (next))); \
A Dnommu_context.h11 static inline void switch_mm(struct mm_struct *prev, in switch_mm() argument
/include/linux/
A Dlist.h83 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid()
111 struct list_head *prev = entry->prev; in __list_del_entry_valid() local
119 if (likely(prev->next == entry && next->prev == entry)) in __list_del_entry_valid()
155 new->prev = prev; in __list_add()
195 next->prev = prev; in __list_del()
246 new->prev = old->prev; in list_replace()
328 last->next->prev = first->prev; in list_bulk_move_tail()
331 first->prev = head->prev; in list_bulk_move_tail()
517 list->prev = entry->prev; in list_cut_before()
530 first->prev = prev; in __list_splice()
[all …]
A Duser-return-notifier.h19 static inline void propagate_user_return_notify(struct task_struct *prev, in propagate_user_return_notify() argument
22 if (test_tsk_thread_flag(prev, TIF_USER_RETURN_NOTIFY)) { in propagate_user_return_notify()
23 clear_tsk_thread_flag(prev, TIF_USER_RETURN_NOTIFY); in propagate_user_return_notify()
39 static inline void propagate_user_return_notify(struct task_struct *prev, in propagate_user_return_notify() argument
A Drculist.h25 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD_RCU()
94 new->prev = prev; in __list_add_rcu()
96 next->prev = new; in __list_add_rcu()
169 entry->prev = LIST_POISON2; in list_del_rcu()
248 new->prev = old->prev; in list_replace_rcu()
250 new->next->prev = new; in list_replace_rcu()
251 old->prev = LIST_POISON2; in list_replace_rcu()
274 struct list_head *prev, in __list_splice_init_rcu() argument
310 first->prev = prev; in __list_splice_init_rcu()
311 next->prev = last; in __list_splice_init_rcu()
[all …]
A Dvtime.h48 extern void vtime_task_switch(struct task_struct *prev);
85 extern void vtime_task_switch_generic(struct task_struct *prev);
87 static inline void vtime_task_switch(struct task_struct *prev) in vtime_task_switch() argument
90 vtime_task_switch_generic(prev); in vtime_task_switch()
112 static inline void vtime_task_switch(struct task_struct *prev) { } in vtime_task_switch() argument
A Dagpgart.h91 struct agp_client *prev; member
99 struct agp_controller *prev; member
114 struct agp_file_private *prev; member
A Ddma-fence-chain.h27 struct dma_fence __rcu *prev; member
127 struct dma_fence *prev,
A Dlist_bl.h105 struct hlist_bl_node *prev) in hlist_bl_add_behind() argument
107 n->next = prev->next; in hlist_bl_add_behind()
108 n->pprev = &prev->next; in hlist_bl_add_behind()
109 prev->next = n; in hlist_bl_add_behind()
A Dinterval_tree_generic.h150 struct rb_node *rb = node->ITRB.rb_right, *prev; \
172 prev = &node->ITRB; \
175 } while (prev == rb); \
A Dof_pdt.h18 int (*nextprop)(phandle node, char *prev, char *buf);
A Dfolio_queue.h34 struct folio_queue *prev; /* Previous queue segment of NULL */ member
57 folioq->prev = NULL; in folioq_init()
A Dskbuff.h341 struct sk_buff *prev;
884 struct sk_buff *prev; member
1954 return skb->prev; in skb_queue_prev()
2282 WRITE_ONCE(newsk->prev, prev); in __skb_insert()
2295 WRITE_ONCE(first->prev, prev); in __skb_queue_splice()
2380 __skb_insert(newsk, prev, ((struct sk_buff_list *)prev)->next, list); in __skb_queue_after()
2434 struct sk_buff *next, *prev; in __skb_unlink() local
2438 prev = skb->prev; in __skb_unlink()
2440 WRITE_ONCE(next->prev, prev); in __skb_unlink()
4119 skb = skb->prev)
[all …]
A Dagp_backend.h71 struct agp_memory *prev; member
A Dof.h228 extern struct device_node *__of_find_all_nodes(struct device_node *prev);
229 extern struct device_node *of_find_all_nodes(struct device_node *prev);
291 struct device_node *prev);
293 struct device_node *prev,
296 const struct device_node *node, struct device_node *prev);
298 const struct device_node *node, struct device_node *prev);
368 extern struct device_node *of_get_next_cpu_node(struct device_node *prev);
548 const struct device_node *node, struct device_node *prev) in of_get_next_child() argument
554 const struct device_node *node, struct device_node *prev) in of_get_next_available_child() argument
560 const struct device_node *node, struct device_node *prev) in of_get_next_reserved_child() argument
[all …]
A Ddamon.h803 return container_of(r->list.prev, struct damon_region, list); in damon_prev_region()
869 struct damon_region *prev, struct damon_region *next, in damon_insert_region() argument
872 __list_add(&r->list, &prev->list, &next->list); in damon_insert_region()
/include/linux/sched/
A Dcputime.h49 extern void cputime_adjust(struct task_cputime *curr, struct prev_cputime *prev,
172 static inline void prev_cputime_init(struct prev_cputime *prev) in prev_cputime_init() argument
175 prev->utime = prev->stime = 0; in prev_cputime_init()
176 raw_spin_lock_init(&prev->lock); in prev_cputime_init()
/include/uapi/linux/netfilter_bridge/
A Debt_limit.h20 unsigned long prev; member
/include/uapi/linux/netfilter/
A Dxt_limit.h19 unsigned long prev; /* moved to xt_limit_priv */ member
/include/sound/
A Dutil_mem.h49 struct list_head *prev);
/include/net/
A Dxdp.h195 skb_frag_t *prev; in __xdp_buff_add_frag() local
209 prev = &sinfo->frags[nr_frags - 1]; in __xdp_buff_add_frag()
211 if (try_coalesce && netmem == skb_frag_netmem(prev) && in __xdp_buff_add_frag()
212 offset == skb_frag_off(prev) + skb_frag_size(prev)) { in __xdp_buff_add_frag()
213 skb_frag_size_add(prev, size); in __xdp_buff_add_frag()
/include/drm/
A Ddrm_gpuvm.h913 struct drm_gpuva_op_map *prev; member
1226 void drm_gpuva_remap(struct drm_gpuva *prev,
1247 const u64 va_start = op->prev ? in drm_gpuva_op_remap_to_unmap_range()
1248 op->prev->va.addr + op->prev->va.range : in drm_gpuva_op_remap_to_unmap_range()
/include/kunit/
A Dtest.h129 const void* (*generate_params)(const void *prev, char *desc);
1677 static const void *name##_gen_params(const void *prev, char *desc) \
1679 typeof((array)[0]) *__next = prev ? ((typeof(__next)) prev) + 1 : (array); \
1698 static const void *name##_gen_params(const void *prev, char *desc) \
1700 typeof((array)[0]) *__next = prev ? ((typeof(__next)) prev) + 1 : (array); \
/include/trace/events/
A Dsched.h223 struct task_struct *prev,
227 TP_ARGS(preempt, prev, next, prev_state),
240 memcpy(__entry->prev_comm, prev->comm, TASK_COMM_LEN);
241 __entry->prev_pid = prev->pid;
242 __entry->prev_prio = prev->prio;
243 __entry->prev_state = __trace_sched_switch_state(preempt, prev_state, prev);

Completed in 48 milliseconds

123