Home
last modified time | relevance | path

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

123

/include/asm-generic/
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) in __generic_cmpxchg_local()
32 case 2: prev = *(u16 *)ptr; in __generic_cmpxchg_local()
33 if (prev == old) in __generic_cmpxchg_local()
36 case 4: prev = *(u32 *)ptr; in __generic_cmpxchg_local()
37 if (prev == old) in __generic_cmpxchg_local()
40 case 8: prev = *(u64 *)ptr; in __generic_cmpxchg_local()
41 if (prev == old) in __generic_cmpxchg_local()
48 return prev; in __generic_cmpxchg_local()
[all …]
Dswitch_to.h21 #define switch_to(prev, next, last) \ argument
23 ((last) = __switch_to((prev), (next))); \
Dnommu_context.h11 static inline void switch_mm(struct mm_struct *prev, in switch_mm() argument
/include/linux/
Dlist.h38 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD()
43 struct list_head *prev,
48 struct list_head *prev, in __list_add_valid() argument
66 struct list_head *prev, in __list_add() argument
69 if (!__list_add_valid(new, prev, next)) in __list_add()
72 next->prev = new; in __list_add()
74 new->prev = prev; in __list_add()
75 WRITE_ONCE(prev->next, new); in __list_add()
102 __list_add(new, head->prev, head); in list_add_tail()
112 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
[all …]
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
Drculist.h25 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD_RCU()
42 #define list_tail_rcu(head) (*((struct list_head __rcu **)(&(head)->prev)))
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()
83 new->prev = prev; in __list_add_rcu()
84 rcu_assign_pointer(list_next_rcu(prev), new); in __list_add_rcu()
85 next->prev = new; in __list_add_rcu()
128 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
158 entry->prev = LIST_POISON2; in list_del_rcu()
201 new->prev = old->prev; in list_replace_rcu()
[all …]
Dfreelist.h81 struct freelist_node *prev, *next, *head = smp_load_acquire(&list->head); in freelist_try_get() local
85 prev = head; in freelist_try_get()
121 refs = atomic_fetch_add(-1, &prev->refs); in freelist_try_get()
123 __freelist_add(prev, list); in freelist_try_get()
Dvtime.h53 extern void vtime_task_switch(struct task_struct *prev);
90 extern void vtime_task_switch_generic(struct task_struct *prev);
92 static inline void vtime_task_switch(struct task_struct *prev) in vtime_task_switch() argument
95 vtime_task_switch_generic(prev); in vtime_task_switch()
117 static inline void vtime_task_switch(struct task_struct *prev) { } in vtime_task_switch() argument
Dagpgart.h91 struct agp_client *prev; member
99 struct agp_controller *prev; member
114 struct agp_file_private *prev; member
Ddma-fence-chain.h27 struct dma_fence __rcu *prev; member
125 struct dma_fence *prev,
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()
Dinterval_tree_generic.h154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
176 prev = &node->ITRB; \
179 } while (prev == rb); \
Dosq_lock.h10 struct optimistic_spin_node *next, *prev; member
Damd-pstate.h71 struct amd_aperf_mperf prev; member
Dof_pdt.h18 int (*nextprop)(phandle node, char *prev, char *buf);
Dskbuff.h343 struct sk_buff *prev;
861 struct sk_buff *prev; member
1827 return skb->prev == (const struct sk_buff *) list; in skb_queue_is_first()
1863 return skb->prev; in skb_queue_prev()
2109 struct sk_buff *skb = READ_ONCE(list_->prev); in skb_peek_tail()
2152 list->prev = list->next = (struct sk_buff *)list; in __skb_queue_head_init()
2184 struct sk_buff *prev, struct sk_buff *next, in __skb_insert() argument
2191 WRITE_ONCE(newsk->prev, prev); in __skb_insert()
2192 WRITE_ONCE(((struct sk_buff_list *)next)->prev, newsk); in __skb_insert()
2193 WRITE_ONCE(((struct sk_buff_list *)prev)->next, newsk); in __skb_insert()
[all …]
Dagp_backend.h71 struct agp_memory *prev; member
Ddamon.h482 return container_of(r->list.prev, struct damon_region, list); in damon_prev_region()
530 struct damon_region *prev, struct damon_region *next, in damon_insert_region() argument
533 __list_add(&r->list, &prev->list, &next->list); in damon_insert_region()
/include/trace/hooks/
Dfpsimd.h15 TP_PROTO(struct task_struct *prev, struct task_struct *next),
16 TP_ARGS(prev, next))
Dmpam.h15 TP_PROTO(struct task_struct *prev, struct task_struct *next),
16 TP_ARGS(prev, next));
/include/linux/sched/
Dcputime.h58 extern void cputime_adjust(struct task_cputime *curr, struct prev_cputime *prev,
181 static inline void prev_cputime_init(struct prev_cputime *prev) in prev_cputime_init() argument
184 prev->utime = prev->stime = 0; in prev_cputime_init()
185 raw_spin_lock_init(&prev->lock); in prev_cputime_init()
/include/uapi/linux/netfilter_bridge/
Debt_limit.h20 unsigned long prev; member
/include/uapi/linux/netfilter/
Dxt_limit.h19 unsigned long prev; /* moved to xt_limit_priv */ member
/include/sound/
Dutil_mem.h49 struct list_head *prev);
/include/trace/events/
Dsched.h225 struct task_struct *prev,
229 TP_ARGS(preempt, prev, next, prev_state),
243 __entry->prev_pid = prev->pid;
244 __entry->prev_prio = prev->prio;
245 __entry->prev_state = __trace_sched_switch_state(preempt, prev_state, prev);
246 memcpy(__entry->prev_comm, prev->comm, TASK_COMM_LEN);

123