Home
last modified time | relevance | path

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

12345

/fs/btrfs/
Dextent_map.c150 struct rb_node *prev = NULL; in __tree_search() local
157 prev = n; in __tree_search()
169 orig_prev = prev; in __tree_search()
170 while (prev && offset >= extent_map_end(prev_entry)) { in __tree_search()
171 prev = rb_next(prev); in __tree_search()
172 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
174 *prev_ret = prev; in __tree_search()
175 prev = orig_prev; in __tree_search()
179 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
180 while (prev && offset < prev_entry->start) { in __tree_search()
[all …]
Dordered-data.c71 struct rb_node *prev = NULL; in __tree_search() local
78 prev = n; in __tree_search()
91 while (prev && file_offset >= entry_end(prev_entry)) { in __tree_search()
92 test = rb_next(prev); in __tree_search()
100 prev = test; in __tree_search()
102 if (prev) in __tree_search()
103 prev_entry = rb_entry(prev, struct btrfs_ordered_extent, in __tree_search()
105 while (prev && file_offset < entry_end(prev_entry)) { in __tree_search()
106 test = rb_prev(prev); in __tree_search()
111 prev = test; in __tree_search()
[all …]
/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 …]
Derase.c212 struct jffs2_raw_node_ref **prev; in jffs2_remove_node_refs_from_ino_list() local
214 prev = &ref->next_in_ino; in jffs2_remove_node_refs_from_ino_list()
218 if (!(*prev)->next_in_ino) { in jffs2_remove_node_refs_from_ino_list()
222 ic = (struct jffs2_inode_cache *)(*prev); in jffs2_remove_node_refs_from_ino_list()
223 prev = &ic->nodes; in jffs2_remove_node_refs_from_ino_list()
227 if (SECTOR_ADDR((*prev)->flash_offset) == jeb->offset) { in jffs2_remove_node_refs_from_ino_list()
231 this = *prev; in jffs2_remove_node_refs_from_ino_list()
232 *prev = this->next_in_ino; in jffs2_remove_node_refs_from_ino_list()
241 prev = &((*prev)->next_in_ino); in jffs2_remove_node_refs_from_ino_list()
/fs/nfs/
Dpagelist.c234 nfs_page_group_init(struct nfs_page *req, struct nfs_page *prev) in nfs_page_group_init() argument
237 WARN_ON_ONCE(prev == req); in nfs_page_group_init()
239 if (!prev) { in nfs_page_group_init()
245 WARN_ON_ONCE(prev->wb_this_page != prev->wb_head); in nfs_page_group_init()
246 WARN_ON_ONCE(!test_bit(PG_HEADLOCK, &prev->wb_head->wb_flags)); in nfs_page_group_init()
247 req->wb_head = prev->wb_head; in nfs_page_group_init()
248 req->wb_this_page = prev->wb_this_page; in nfs_page_group_init()
249 prev->wb_this_page = req; in nfs_page_group_init()
258 if (test_bit(PG_INODE_REF, &prev->wb_head->wb_flags)) { in nfs_page_group_init()
493 struct nfs_page *prev, struct nfs_page *req) in nfs_generic_pg_test() argument
[all …]
Dnfs4client.c494 struct nfs_client **prev, struct nfs_net *nn) in nfs4_match_client() argument
512 nfs_put_client(*prev); in nfs4_match_client()
513 *prev = pos; in nfs4_match_client()
555 struct nfs_client *pos, *prev = NULL; in nfs40_walk_client_list() local
568 status = nfs4_match_client(pos, new, &prev, nn); in nfs40_walk_client_list()
592 nfs_put_client(prev); in nfs40_walk_client_list()
593 prev = pos; in nfs40_walk_client_list()
604 prev = NULL; in nfs40_walk_client_list()
624 nfs_put_client(prev); in nfs40_walk_client_list()
721 struct nfs_client *pos, *prev = NULL; in nfs41_walk_client_list() local
[all …]
/fs/xfs/
Dxfs_bio_io.c40 struct bio *prev = bio; in xfs_rw_bdev() local
43 bio_copy_dev(bio, prev); in xfs_rw_bdev()
44 bio->bi_iter.bi_sector = bio_end_sector(prev); in xfs_rw_bdev()
45 bio->bi_opf = prev->bi_opf; in xfs_rw_bdev()
46 bio_chain(prev, bio); in xfs_rw_bdev()
48 submit_bio(prev); in xfs_rw_bdev()
/fs/notify/dnotify/
Ddnotify.c82 struct dnotify_struct **prev; in dnotify_handle_event() local
96 prev = &dn_mark->dn; in dnotify_handle_event()
97 while ((dn = *prev) != NULL) { in dnotify_handle_event()
99 prev = &dn->dn_next; in dnotify_handle_event()
105 prev = &dn->dn_next; in dnotify_handle_event()
107 *prev = dn->dn_next; in dnotify_handle_event()
146 struct dnotify_struct **prev; in dnotify_flush() local
162 prev = &dn_mark->dn; in dnotify_flush()
163 while ((dn = *prev) != NULL) { in dnotify_flush()
165 *prev = dn->dn_next; in dnotify_flush()
[all …]
/fs/xfs/libxfs/
Dxfs_iext_tree.c124 struct xfs_iext_leaf *prev; member
268 if (ifp->if_height > 1 && cur->leaf->prev) { in xfs_iext_prev()
269 cur->leaf = cur->leaf->prev; in xfs_iext_prev()
405 struct xfs_iext_leaf *prev = ifp->if_u1.if_root; in xfs_iext_grow() local
407 node->keys[0] = xfs_iext_leaf_key(prev, 0); in xfs_iext_grow()
408 node->ptrs[0] = prev; in xfs_iext_grow()
410 struct xfs_iext_node *prev = ifp->if_u1.if_root; in xfs_iext_grow() local
414 node->keys[0] = prev->keys[0]; in xfs_iext_grow()
415 node->ptrs[0] = prev; in xfs_iext_grow()
572 leaf->next->prev = new; in xfs_iext_split_leaf()
[all …]
/fs/gfs2/
Dxattr.c75 struct gfs2_ea_header *prev, void *private);
80 struct gfs2_ea_header *ea, *prev = NULL; in ea_foreach_i() local
86 for (ea = GFS2_EA_BH2FIRST(bh);; prev = ea, ea = GFS2_EA2NEXT(ea)) { in ea_foreach_i()
95 error = ea_call(ip, bh, ea, prev, data); in ea_foreach_i()
165 struct gfs2_ea_header *ea, struct gfs2_ea_header *prev, in ea_find_i() argument
180 el->el_prev = prev; in ea_find_i()
225 struct gfs2_ea_header *prev, void *private) in ea_dealloc_unstuffed() argument
294 if (prev && !leave) { in ea_dealloc_unstuffed()
297 len = GFS2_EA_REC_LEN(prev) + GFS2_EA_REC_LEN(ea); in ea_dealloc_unstuffed()
298 prev->ea_rec_len = cpu_to_be32(len); in ea_dealloc_unstuffed()
[all …]
Ddir.c563 struct gfs2_dirent *dent, *prev; in gfs2_dirent_scan() local
573 prev = NULL; in gfs2_dirent_scan()
585 prev = dent; in gfs2_dirent_scan()
599 return prev ? prev : dent; in gfs2_dirent_scan()
673 struct gfs2_dirent *prev, struct gfs2_dirent *cur) in dirent_del() argument
688 if (!prev) { in dirent_del()
696 prev_rec_len = be16_to_cpu(prev->de_rec_len); in dirent_del()
699 if ((char *)prev + prev_rec_len != (char *)cur) in dirent_del()
705 prev->de_rec_len = cpu_to_be16(prev_rec_len); in dirent_del()
1009 struct gfs2_dirent *dent = NULL, *prev = NULL, *next = NULL, *new; in dir_split_leaf() local
[all …]
/fs/iomap/
Dfiemap.c12 struct iomap prev; member
55 ret = iomap_to_fiemap(ctx->fi, &ctx->prev, 0); in iomap_fiemap_actor()
56 ctx->prev = *iomap; in iomap_fiemap_actor()
75 ctx.prev.type = IOMAP_HOLE; in iomap_fiemap()
102 if (ctx.prev.type != IOMAP_HOLE) { in iomap_fiemap()
103 ret = iomap_to_fiemap(fi, &ctx.prev, FIEMAP_EXTENT_LAST); in iomap_fiemap()
/fs/nilfs2/
Dalloc.c202 struct nilfs_bh_assoc *prev, in nilfs_palloc_get_block() argument
208 if (prev->bh && blkoff == prev->blkoff) { in nilfs_palloc_get_block()
209 get_bh(prev->bh); in nilfs_palloc_get_block()
210 *bhp = prev->bh; in nilfs_palloc_get_block()
223 brelse(prev->bh); in nilfs_palloc_get_block()
225 prev->bh = *bhp; in nilfs_palloc_get_block()
226 prev->blkoff = blkoff; in nilfs_palloc_get_block()
240 struct nilfs_bh_assoc *prev, in nilfs_palloc_delete_block() argument
244 if (prev->bh && blkoff == prev->blkoff) { in nilfs_palloc_delete_block()
245 brelse(prev->bh); in nilfs_palloc_delete_block()
[all …]
Dcpfile.c623 __u64 curr, prev; in nilfs_cpfile_set_snapshot() local
659 prev = le64_to_cpu(list->ssl_prev); in nilfs_cpfile_set_snapshot()
660 while (prev > cno) { in nilfs_cpfile_set_snapshot()
661 prev_blkoff = nilfs_cpfile_get_blkoff(cpfile, prev); in nilfs_cpfile_set_snapshot()
662 curr = prev; in nilfs_cpfile_set_snapshot()
676 prev = le64_to_cpu(list->ssl_prev); in nilfs_cpfile_set_snapshot()
680 if (prev != 0) { in nilfs_cpfile_set_snapshot()
681 ret = nilfs_cpfile_get_checkpoint_block(cpfile, prev, 0, in nilfs_cpfile_set_snapshot()
699 cp->cp_snapshot_list.ssl_prev = cpu_to_le64(prev); in nilfs_cpfile_set_snapshot()
705 cpfile, prev, prev_bh, kaddr); in nilfs_cpfile_set_snapshot()
[all …]
Dsegbuf.h88 #define NILFS_PREV_SEGBUF(segbuf) NILFS_LIST_SEGBUF((segbuf)->sb_list.prev)
89 #define NILFS_LAST_SEGBUF(head) NILFS_LIST_SEGBUF((head)->prev)
111 struct nilfs_segment_buffer *prev);
/fs/hfs/
Dbnode.c143 be32_to_cpu(desc.next), be32_to_cpu(desc.prev), in hfs_bnode_dump()
178 if (node->prev) { in hfs_bnode_unlink()
179 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
193 tmp->prev = node->prev; in hfs_bnode_unlink()
194 cnid = cpu_to_be32(tmp->prev); in hfs_bnode_unlink()
195 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4); in hfs_bnode_unlink()
198 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
201 if (!node->prev && !node->next) { in hfs_bnode_unlink()
339 node->prev = be32_to_cpu(desc->prev); in hfs_bnode_find()
Dbrec.c248 new_node->prev = node->this; in hfs_bnode_split()
318 node_desc.prev = cpu_to_be32(new_node->prev); in hfs_bnode_split()
334 next_node->prev = new_node->this; in hfs_bnode_split()
336 node_desc.prev = cpu_to_be32(next_node->prev); in hfs_bnode_split()
488 new_node->prev = 0; in hfs_btree_inc_height()
492 node_desc.prev = cpu_to_be32(new_node->prev); in hfs_btree_inc_height()
/fs/
Duserfaultfd.c879 struct vm_area_struct *vma, *prev; in userfaultfd_release() local
900 prev = NULL; in userfaultfd_release()
906 prev = vma; in userfaultfd_release()
911 prev = vma_merge(mm, prev, vma->vm_start, vma->vm_end, in userfaultfd_release()
917 if (prev) in userfaultfd_release()
918 vma = prev; in userfaultfd_release()
920 prev = vma; in userfaultfd_release()
1307 struct vm_area_struct *vma, *prev, *cur; in userfaultfd_register() local
1357 vma = find_vma_prev(mm, start, &prev); in userfaultfd_register()
1441 prev = vma; in userfaultfd_register()
[all …]
Dreaddir.c221 struct linux_dirent __user *dirent, *prev; in filldir() local
244 prev = (void __user *) dirent - prev_reclen; in filldir()
245 if (!user_access_begin(prev, reclen + prev_reclen)) in filldir()
249 unsafe_put_user(offset, &prev->d_off, efault_end); in filldir()
312 struct linux_dirent64 __user *dirent, *prev; in filldir64() local
329 prev = (void __user *)dirent - prev_reclen; in filldir64()
330 if (!user_access_begin(prev, reclen + prev_reclen)) in filldir64()
334 unsafe_put_user(offset, &prev->d_off, efault_end); in filldir64()
/fs/crypto/
Dhkdf.c123 const u8 *prev = NULL; in fscrypt_hkdf_expand() local
141 if (prev) { in fscrypt_hkdf_expand()
142 err = crypto_shash_update(desc, prev, HKDF_HASHLEN); in fscrypt_hkdf_expand()
168 prev = &okm[i]; in fscrypt_hkdf_expand()
/fs/hfsplus/
Dbnode.c307 be32_to_cpu(desc.next), be32_to_cpu(desc.prev), in hfs_bnode_dump()
342 if (node->prev) { in hfs_bnode_unlink()
343 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
358 tmp->prev = node->prev; in hfs_bnode_unlink()
359 cnid = cpu_to_be32(tmp->prev); in hfs_bnode_unlink()
361 offsetof(struct hfs_bnode_desc, prev), 4); in hfs_bnode_unlink()
364 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
367 if (!node->prev && !node->next) in hfs_bnode_unlink()
507 node->prev = be32_to_cpu(desc->prev); in hfs_bnode_find()
Dbrec.c252 new_node->prev = node->this; in hfs_bnode_split()
322 node_desc.prev = cpu_to_be32(new_node->prev); in hfs_bnode_split()
338 next_node->prev = new_node->this; in hfs_bnode_split()
340 node_desc.prev = cpu_to_be32(next_node->prev); in hfs_bnode_split()
492 new_node->prev = 0; in hfs_btree_inc_height()
496 node_desc.prev = cpu_to_be32(new_node->prev); in hfs_btree_inc_height()
/fs/autofs/
Dexpire.c97 static struct dentry *get_next_positive_subdir(struct dentry *prev, in get_next_positive_subdir() argument
105 q = positive_after(root, prev); in get_next_positive_subdir()
108 dput(prev); in get_next_positive_subdir()
115 static struct dentry *get_next_positive_dentry(struct dentry *prev, in get_next_positive_dentry() argument
119 struct dentry *p = prev, *ret = NULL, *d = NULL; in get_next_positive_dentry()
121 if (prev == NULL) in get_next_positive_dentry()
140 dput(prev); in get_next_positive_dentry()
/fs/omfs/
Ddir.c165 u64 block, prev; in omfs_delete_entry() local
177 bh2 = omfs_scan_list(dir, block, name, namelen, &prev); in omfs_delete_entry()
187 if (prev != ~0) { in omfs_delete_entry()
190 bh = omfs_bread(dir->i_sb, prev); in omfs_delete_entry()
201 if (prev != ~0) { in omfs_delete_entry()
202 dirty = omfs_iget(dir->i_sb, prev); in omfs_delete_entry()
/fs/ext4/
Dfsmap.c373 struct ext4_fsmap *prev = NULL; in ext4_getfsmap_merge_fixed_metadata() local
377 if (!prev) { in ext4_getfsmap_merge_fixed_metadata()
378 prev = p; in ext4_getfsmap_merge_fixed_metadata()
382 if (prev->fmr_owner == p->fmr_owner && in ext4_getfsmap_merge_fixed_metadata()
383 prev->fmr_physical + prev->fmr_length == p->fmr_physical) { in ext4_getfsmap_merge_fixed_metadata()
384 prev->fmr_length += p->fmr_length; in ext4_getfsmap_merge_fixed_metadata()
388 prev = p; in ext4_getfsmap_merge_fixed_metadata()

12345