Home
last modified time | relevance | path

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

12345678910

/linux-4.19.296/lib/
Dlist_debug.c20 bool __list_add_valid(struct list_head *new, struct list_head *prev, in __list_add_valid() argument
23 if (CHECK_DATA_CORRUPTION(prev == NULL, in __list_add_valid()
27 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid()
29 prev, next->prev, next) || in __list_add_valid()
30 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid()
32 next, prev->next, prev) || in __list_add_valid()
33 CHECK_DATA_CORRUPTION(new == prev || new == next, in __list_add_valid()
35 new, prev, next)) in __list_add_valid()
44 struct list_head *prev, *next; in __list_del_entry_valid() local
46 prev = entry->prev; in __list_del_entry_valid()
[all …]
Dplist.c36 WARN(n->prev != p || p->next != n, in plist_check_prev_next()
40 t, t->next, t->prev, in plist_check_prev_next()
41 p, p->next, p->prev, in plist_check_prev_next()
42 n, n->next, n->prev); in plist_check_prev_next()
47 struct list_head *prev = top, *next = top->next; in plist_check_list() local
49 plist_check_prev_next(top, prev, next); in plist_check_list()
51 prev = next; in plist_check_list()
52 next = prev->next; in plist_check_list()
53 plist_check_prev_next(top, prev, next); in plist_check_list()
76 struct plist_node *first, *iter, *prev = NULL; in plist_add() local
[all …]
Dklist.c338 struct klist_node *prev; in klist_prev() local
344 prev = to_klist_node(last->n_node.prev); in klist_prev()
348 prev = to_klist_node(i->i_klist->k_list.prev); in klist_prev()
351 while (prev != to_klist_node(&i->i_klist->k_list)) { in klist_prev()
352 if (likely(!knode_dead(prev))) { in klist_prev()
353 kref_get(&prev->n_ref); in klist_prev()
354 i->i_cur = prev; in klist_prev()
357 prev = to_klist_node(prev->n_node.prev); in klist_prev()
Dlist_sort.c59 a->prev = tail; in merge_and_restore_back_links()
63 b->prev = tail; in merge_and_restore_back_links()
80 tail->next->prev = tail; in merge_and_restore_back_links()
85 head->prev = tail; in merge_and_restore_back_links()
117 head->prev->next = NULL; in list_sort()
/linux-4.19.296/include/asm-generic/
Dcmpxchg-local.h18 unsigned long flags, prev; in __cmpxchg_local_generic() local
28 case 1: prev = *(u8 *)ptr; in __cmpxchg_local_generic()
29 if (prev == old) in __cmpxchg_local_generic()
32 case 2: prev = *(u16 *)ptr; in __cmpxchg_local_generic()
33 if (prev == old) in __cmpxchg_local_generic()
36 case 4: prev = *(u32 *)ptr; in __cmpxchg_local_generic()
37 if (prev == old) in __cmpxchg_local_generic()
40 case 8: prev = *(u64 *)ptr; in __cmpxchg_local_generic()
41 if (prev == old) in __cmpxchg_local_generic()
48 return prev; in __cmpxchg_local_generic()
[all …]
/linux-4.19.296/include/linux/
Dlist.h29 list->prev = list; in INIT_LIST_HEAD()
34 struct list_head *prev,
39 struct list_head *prev, in __list_add_valid() argument
57 struct list_head *prev, in __list_add() argument
60 if (!__list_add_valid(new, prev, next)) in __list_add()
63 next->prev = new; in __list_add()
65 new->prev = prev; in __list_add()
66 WRITE_ONCE(prev->next, new); in __list_add()
93 __list_add(new, head->prev, head); in list_add_tail()
103 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
[all …]
Drculist.h34 WRITE_ONCE(list->prev, list); in INIT_LIST_HEAD_RCU()
50 struct list_head *prev, struct list_head *next) in __list_add_rcu() argument
52 if (!__list_add_valid(new, prev, next)) in __list_add_rcu()
56 new->prev = prev; in __list_add_rcu()
57 rcu_assign_pointer(list_next_rcu(prev), new); in __list_add_rcu()
58 next->prev = new; in __list_add_rcu()
101 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
131 entry->prev = LIST_POISON2; in list_del_rcu()
174 new->prev = old->prev; in list_replace_rcu()
175 rcu_assign_pointer(list_next_rcu(new->prev), new); in list_replace_rcu()
[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
Dvtime.h50 extern void vtime_task_switch(struct task_struct *prev);
52 extern void vtime_common_task_switch(struct task_struct *prev);
53 static inline void vtime_task_switch(struct task_struct *prev) in vtime_task_switch() argument
56 vtime_common_task_switch(prev); in vtime_task_switch()
65 static inline void vtime_task_switch(struct task_struct *prev) { } in vtime_task_switch() argument
Dnet_dim.h274 struct net_dim_stats *prev) in net_dim_stats_compare() argument
276 if (!prev->bpms) in net_dim_stats_compare()
280 if (IS_SIGNIFICANT_DIFF(curr->bpms, prev->bpms)) in net_dim_stats_compare()
281 return (curr->bpms > prev->bpms) ? NET_DIM_STATS_BETTER : in net_dim_stats_compare()
284 if (!prev->ppms) in net_dim_stats_compare()
288 if (IS_SIGNIFICANT_DIFF(curr->ppms, prev->ppms)) in net_dim_stats_compare()
289 return (curr->ppms > prev->ppms) ? NET_DIM_STATS_BETTER : in net_dim_stats_compare()
292 if (!prev->epms) in net_dim_stats_compare()
295 if (IS_SIGNIFICANT_DIFF(curr->epms, prev->epms)) in net_dim_stats_compare()
296 return (curr->epms < prev->epms) ? NET_DIM_STATS_BETTER : in net_dim_stats_compare()
Dagpgart.h93 struct agp_client *prev; member
101 struct agp_controller *prev; member
116 struct agp_file_private *prev; member
/linux-4.19.296/fs/btrfs/
Dextent_map.c146 struct rb_node *prev = NULL; in __tree_search() local
153 prev = n; in __tree_search()
165 orig_prev = prev; in __tree_search()
166 while (prev && offset >= extent_map_end(prev_entry)) { in __tree_search()
167 prev = rb_next(prev); in __tree_search()
168 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
170 *prev_ret = prev; in __tree_search()
171 prev = orig_prev; in __tree_search()
175 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
176 while (prev && offset < prev_entry->start) { in __tree_search()
[all …]
Dordered-data.c68 struct rb_node *prev = NULL; in __tree_search() local
75 prev = n; in __tree_search()
88 while (prev && file_offset >= entry_end(prev_entry)) { in __tree_search()
89 test = rb_next(prev); in __tree_search()
97 prev = test; in __tree_search()
99 if (prev) in __tree_search()
100 prev_entry = rb_entry(prev, struct btrfs_ordered_extent, in __tree_search()
102 while (prev && file_offset < entry_end(prev_entry)) { in __tree_search()
103 test = rb_prev(prev); in __tree_search()
108 prev = test; in __tree_search()
[all …]
/linux-4.19.296/fs/jffs2/
Dnodelist.c28 struct jffs2_full_dirent **prev = list; in jffs2_add_fd_to_list() local
32 while ((*prev) && (*prev)->nhash <= new->nhash) { in jffs2_add_fd_to_list()
33 if ((*prev)->nhash == new->nhash && !strcmp((*prev)->name, new->name)) { in jffs2_add_fd_to_list()
35 if (new->version < (*prev)->version) { in jffs2_add_fd_to_list()
37 (*prev)->name, (*prev)->ino); in jffs2_add_fd_to_list()
42 (*prev)->name, (*prev)->ino); in jffs2_add_fd_to_list()
43 new->next = (*prev)->next; in jffs2_add_fd_to_list()
46 if ((*prev)->raw) in jffs2_add_fd_to_list()
47 jffs2_mark_node_obsolete(c, ((*prev)->raw)); in jffs2_add_fd_to_list()
48 jffs2_free_full_dirent(*prev); in jffs2_add_fd_to_list()
[all …]
/linux-4.19.296/drivers/char/agp/
Dfrontend.c68 struct agp_memory *prev; in agp_remove_from_pool() local
76 prev = temp->prev; in agp_remove_from_pool()
78 if (prev != NULL) { in agp_remove_from_pool()
79 prev->next = next; in agp_remove_from_pool()
81 next->prev = prev; in agp_remove_from_pool()
86 next->prev = NULL; in agp_remove_from_pool()
201 struct agp_memory *prev; in agp_insert_into_pool() local
203 prev = agp_fe.current_controller->pool; in agp_insert_into_pool()
205 if (prev != NULL) { in agp_insert_into_pool()
206 prev->prev = temp; in agp_insert_into_pool()
[all …]
/linux-4.19.296/crypto/
Dxcbc.c86 u8 *prev = PTR_ALIGN(&ctx->ctx[0], alignmask + 1) + bs; in crypto_xcbc_digest_init() local
89 memset(prev, 0, bs); in crypto_xcbc_digest_init()
104 u8 *prev = odds + bs; in crypto_xcbc_digest_update() local
118 crypto_xor(prev, odds, bs); in crypto_xcbc_digest_update()
119 crypto_cipher_encrypt_one(tfm, prev, prev); in crypto_xcbc_digest_update()
126 crypto_xor(prev, p, bs); in crypto_xcbc_digest_update()
127 crypto_cipher_encrypt_one(tfm, prev, prev); in crypto_xcbc_digest_update()
151 u8 *prev = odds + bs; in crypto_xcbc_digest_final() local
168 crypto_xor(prev, odds, bs); in crypto_xcbc_digest_final()
169 crypto_xor(prev, consts + offset, bs); in crypto_xcbc_digest_final()
[all …]
Dcmac.c114 u8 *prev = PTR_ALIGN((void *)ctx->ctx, alignmask + 1) + bs; in crypto_cmac_digest_init() local
117 memset(prev, 0, bs); in crypto_cmac_digest_init()
132 u8 *prev = odds + bs; in crypto_cmac_digest_update() local
146 crypto_xor(prev, odds, bs); in crypto_cmac_digest_update()
147 crypto_cipher_encrypt_one(tfm, prev, prev); in crypto_cmac_digest_update()
154 crypto_xor(prev, p, bs); in crypto_cmac_digest_update()
155 crypto_cipher_encrypt_one(tfm, prev, prev); in crypto_cmac_digest_update()
180 u8 *prev = odds + bs; in crypto_cmac_digest_final() local
197 crypto_xor(prev, odds, bs); in crypto_cmac_digest_final()
198 crypto_xor(prev, consts + offset, bs); in crypto_cmac_digest_final()
[all …]
/linux-4.19.296/drivers/isdn/divert/
Disdn_divert.c30 struct call_struc *prev; member
38 struct deflect_struc *next, *prev; member
93 if (cs->prev) in deflect_timer_expire()
94 cs->prev->next = cs->next; /* forward link */ in deflect_timer_expire()
98 cs->next->prev = cs->prev; /* back link */ in deflect_timer_expire()
189 cs->prev = NULL; in cf_command()
293 ds->prev = table_tail; /* previous entry */ in insertrule()
295 if (ds->prev) in insertrule()
296 ds->prev->next = ds; /* last forward */ in insertrule()
302 ds->prev = ds1->prev; /* prev entry */ in insertrule()
[all …]
/linux-4.19.296/fs/notify/dnotify/
Ddnotify.c90 struct dnotify_struct **prev; in dnotify_handle_event() local
104 prev = &dn_mark->dn; in dnotify_handle_event()
105 while ((dn = *prev) != NULL) { in dnotify_handle_event()
107 prev = &dn->dn_next; in dnotify_handle_event()
113 prev = &dn->dn_next; in dnotify_handle_event()
115 *prev = dn->dn_next; in dnotify_handle_event()
154 struct dnotify_struct **prev; in dnotify_flush() local
170 prev = &dn_mark->dn; in dnotify_flush()
171 while ((dn = *prev) != NULL) { in dnotify_flush()
173 *prev = dn->dn_next; in dnotify_flush()
[all …]
/linux-4.19.296/fs/nfs/
Dpagelist.c256 nfs_page_group_init(struct nfs_page *req, struct nfs_page *prev) in nfs_page_group_init() argument
259 WARN_ON_ONCE(prev == req); in nfs_page_group_init()
261 if (!prev) { in nfs_page_group_init()
267 WARN_ON_ONCE(prev->wb_this_page != prev->wb_head); in nfs_page_group_init()
268 WARN_ON_ONCE(!test_bit(PG_HEADLOCK, &prev->wb_head->wb_flags)); in nfs_page_group_init()
269 req->wb_head = prev->wb_head; in nfs_page_group_init()
270 req->wb_this_page = prev->wb_this_page; in nfs_page_group_init()
271 prev->wb_this_page = req; in nfs_page_group_init()
280 if (test_bit(PG_INODE_REF, &prev->wb_head->wb_flags)) { in nfs_page_group_init()
491 struct nfs_page *prev, struct nfs_page *req) in nfs_generic_pg_test() argument
[all …]
/linux-4.19.296/include/linux/sched/
Dcputime.h57 extern void cputime_adjust(struct task_cputime *curr, struct prev_cputime *prev,
178 static inline void prev_cputime_init(struct prev_cputime *prev) in prev_cputime_init() argument
181 prev->utime = prev->stime = 0; in prev_cputime_init()
182 raw_spin_lock_init(&prev->lock); in prev_cputime_init()
/linux-4.19.296/fs/xfs/libxfs/
Dxfs_iext_tree.c128 struct xfs_iext_leaf *prev; member
272 if (ifp->if_height > 1 && cur->leaf->prev) { in xfs_iext_prev()
273 cur->leaf = cur->leaf->prev; in xfs_iext_prev()
409 struct xfs_iext_leaf *prev = ifp->if_u1.if_root; in xfs_iext_grow() local
411 node->keys[0] = xfs_iext_leaf_key(prev, 0); in xfs_iext_grow()
412 node->ptrs[0] = prev; in xfs_iext_grow()
414 struct xfs_iext_node *prev = ifp->if_u1.if_root; in xfs_iext_grow() local
418 node->keys[0] = prev->keys[0]; in xfs_iext_grow()
419 node->ptrs[0] = prev; in xfs_iext_grow()
576 leaf->next->prev = new; in xfs_iext_split_leaf()
[all …]
/linux-4.19.296/drivers/misc/mic/scif/
Dscif_rma_list.c31 struct scif_window *prev = list_entry(head, struct scif_window, list); in scif_insert_tcw() local
37 curr = list_entry(head->prev, struct scif_window, list); in scif_insert_tcw()
47 prev = curr; in scif_insert_tcw()
49 list_add(&window->list, &prev->list); in scif_insert_tcw()
60 struct scif_window *curr = NULL, *prev = NULL; in scif_insert_window() local
68 prev = curr; in scif_insert_window()
70 if (!prev) in scif_insert_window()
73 list_add(&window->list, &prev->list); in scif_insert_window()
/linux-4.19.296/fs/gfs2/
Dxattr.c78 struct gfs2_ea_header *prev, void *private);
83 struct gfs2_ea_header *ea, *prev = NULL; in ea_foreach_i() local
89 for (ea = GFS2_EA_BH2FIRST(bh);; prev = ea, ea = GFS2_EA2NEXT(ea)) { in ea_foreach_i()
98 error = ea_call(ip, bh, ea, prev, data); in ea_foreach_i()
168 struct gfs2_ea_header *ea, struct gfs2_ea_header *prev, in ea_find_i() argument
183 el->el_prev = prev; in ea_find_i()
228 struct gfs2_ea_header *prev, void *private) in ea_dealloc_unstuffed() argument
297 if (prev && !leave) { in ea_dealloc_unstuffed()
300 len = GFS2_EA_REC_LEN(prev) + GFS2_EA_REC_LEN(ea); in ea_dealloc_unstuffed()
301 prev->ea_rec_len = cpu_to_be32(len); in ea_dealloc_unstuffed()
[all …]
/linux-4.19.296/fs/autofs/
Dexpire.c79 static struct dentry *get_next_positive_subdir(struct dentry *prev, in get_next_positive_subdir() argument
89 if (prev) in get_next_positive_subdir()
90 next = prev->d_child.next; in get_next_positive_subdir()
92 prev = dget_dlock(root); in get_next_positive_subdir()
93 next = prev->d_subdirs.next; in get_next_positive_subdir()
100 dput(prev); in get_next_positive_subdir()
118 dput(prev); in get_next_positive_subdir()
126 static struct dentry *get_next_positive_dentry(struct dentry *prev, in get_next_positive_dentry() argument
133 if (prev == NULL) in get_next_positive_dentry()
138 p = prev; in get_next_positive_dentry()
[all …]

12345678910