| /fs/jffs2/ |
| A D | nodelist.c | 32 while ((*prev) && (*prev)->nhash <= new->nhash) { 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()
53 prev = &((*prev)->next); in jffs2_add_fd_to_list()
56 *prev = new; in jffs2_add_fd_to_list()
448 while ((*prev) && (*prev)->ino < new->ino) { in jffs2_add_ino_cache()
449 prev = &(*prev)->next; in jffs2_add_ino_cache()
469 while ((*prev) && (*prev)->ino < old->ino) { in jffs2_del_ino_cache()
470 prev = &(*prev)->next; in jffs2_del_ino_cache()
541 if (!prev || frag->ofs > prev->ofs) in jffs2_lookup_node_frag()
[all …]
|
| A D | erase.c | 210 struct jffs2_raw_node_ref **prev; in jffs2_remove_node_refs_from_ino_list() local
212 prev = &ref->next_in_ino; in jffs2_remove_node_refs_from_ino_list()
216 if (!(*prev)->next_in_ino) { in jffs2_remove_node_refs_from_ino_list()
220 ic = (struct jffs2_inode_cache *)(*prev); in jffs2_remove_node_refs_from_ino_list()
221 prev = &ic->nodes; in jffs2_remove_node_refs_from_ino_list()
225 if (SECTOR_ADDR((*prev)->flash_offset) == jeb->offset) { in jffs2_remove_node_refs_from_ino_list()
229 this = *prev; in jffs2_remove_node_refs_from_ino_list()
230 *prev = this->next_in_ino; in jffs2_remove_node_refs_from_ino_list()
239 prev = &((*prev)->next_in_ino); in jffs2_remove_node_refs_from_ino_list()
|
| /fs/btrfs/ |
| A D | extent_map.c | 152 prev = n; in tree_search()
163 orig_prev = prev; in tree_search()
165 prev = rb_next(prev); in tree_search()
173 if (prev) { in tree_search()
178 prev = orig_prev; in tree_search()
181 prev = rb_prev(prev); in tree_search()
296 new_disk_num_bytes = max(prev->disk_bytenr + prev->disk_num_bytes, in merge_ondisk_extents()
299 new_offset = prev->disk_bytenr + prev->offset - new_disk_bytenr; in merge_ondisk_extents()
631 if (!prev) in prev_extent_map()
660 prev = existing; in merge_extent_mapping()
[all …]
|
| A D | extent-io-tree.c | 244 struct rb_node *prev = NULL; in tree_search_for_insert() local
248 prev = *node; in tree_search_for_insert()
262 *parent_ret = prev; in tree_search_for_insert()
344 struct extent_state *prev; in merge_prev_state() local
346 prev = prev_state(state); in merge_prev_state()
347 if (prev && prev->end == state->start - 1 && prev->state == state->state) { in merge_prev_state()
350 state->start = prev->start; in merge_prev_state()
1615 if (prev) in btrfs_find_first_clear_extent_bit()
1703 if (!prev) in btrfs_count_range_bits()
1705 else if (prev->start <= cur_start && cur_start <= prev->end) in btrfs_count_range_bits()
[all …]
|
| A D | ordered-data.c | 75 prev = n; in __tree_search()
89 test = rb_next(prev); in __tree_search()
97 prev = test; in __tree_search()
99 if (prev) in __tree_search()
103 test = rb_prev(prev); in __tree_search()
108 prev = test; in __tree_search()
110 *prev_ret = prev; in __tree_search()
142 ret = prev; in ordered_tree_search()
1098 struct rb_node *prev; in btrfs_lookup_first_ordered_range() local
1133 prev = cur; in btrfs_lookup_first_ordered_range()
[all …]
|
| A D | lru_cache.c | 73 struct list_head *prev = entry->list.prev; in btrfs_lru_cache_remove() local
81 if (list_empty(prev)) { in btrfs_lru_cache_remove()
90 ASSERT(head == prev); in btrfs_lru_cache_remove()
|
| /fs/nfs/ |
| A D | pagelist.c | 314 WARN_ON_ONCE(prev == req); in nfs_page_group_init()
316 if (!prev) { in nfs_page_group_init()
322 WARN_ON_ONCE(prev->wb_this_page != prev->wb_head); in nfs_page_group_init()
324 req->wb_head = prev->wb_head; in nfs_page_group_init()
326 prev->wb_this_page = req; in nfs_page_group_init()
1048 size_t prev_end = prev->wb_pgbase + prev->wb_bytes; in nfs_page_is_contiguous()
1050 if (req_offset(req) != req_offset(prev) + prev->wb_bytes) in nfs_page_is_contiguous()
1081 if (prev) { in nfs_coalesce_size()
1122 prev = nfs_list_entry(mirror->pg_list.prev); in nfs_pageio_do_add_request()
1432 struct nfs_page *prev; in nfs_pageio_cond_complete() local
[all …]
|
| /fs/xfs/ |
| A D | xfs_bio_io.c | 35 struct bio *prev = bio; in xfs_rw_bdev() local
37 bio = bio_alloc(prev->bi_bdev, in xfs_rw_bdev()
39 prev->bi_opf, GFP_KERNEL); in xfs_rw_bdev()
40 bio->bi_iter.bi_sector = bio_end_sector(prev); in xfs_rw_bdev()
41 bio_chain(prev, bio); in xfs_rw_bdev()
42 submit_bio(prev); in xfs_rw_bdev()
|
| /fs/iomap/ |
| A D | fiemap.c | 40 struct fiemap_extent_info *fi, struct iomap *prev) in iomap_fiemap_iter() argument
47 ret = iomap_to_fiemap(fi, prev, 0); in iomap_fiemap_iter()
48 *prev = iter->iomap; in iomap_fiemap_iter()
67 struct iomap prev = { in iomap_fiemap() local
77 iter.status = iomap_fiemap_iter(&iter, fi, &prev); in iomap_fiemap()
79 if (prev.type != IOMAP_HOLE) { in iomap_fiemap()
80 ret = iomap_to_fiemap(fi, &prev, FIEMAP_EXTENT_LAST); in iomap_fiemap()
|
| /fs/notify/dnotify/ |
| A D | dnotify.c | 95 struct dnotify_struct **prev; in dnotify_handle_event() local
106 prev = &dn_mark->dn; in dnotify_handle_event()
107 while ((dn = *prev) != NULL) { in dnotify_handle_event()
109 prev = &dn->dn_next; in dnotify_handle_event()
115 prev = &dn->dn_next; in dnotify_handle_event()
117 *prev = dn->dn_next; in dnotify_handle_event()
156 struct dnotify_struct **prev; in dnotify_flush() local
172 prev = &dn_mark->dn; in dnotify_flush()
173 while ((dn = *prev) != NULL) { in dnotify_flush()
175 *prev = dn->dn_next; in dnotify_flush()
[all …]
|
| /fs/xfs/libxfs/ |
| A D | xfs_iext_tree.c | 124 struct xfs_iext_leaf *prev; member
269 cur->leaf = cur->leaf->prev; in xfs_iext_prev()
415 node->ptrs[0] = prev; in xfs_iext_grow()
421 node->keys[0] = prev->keys[0]; in xfs_iext_grow()
422 node->ptrs[0] = prev; in xfs_iext_grow()
579 leaf->next->prev = new; in xfs_iext_split_leaf()
581 new->prev = leaf; in xfs_iext_split_leaf()
820 if (leaf->prev) { in xfs_iext_rebalance_leaf()
828 cur->leaf = leaf->prev; in xfs_iext_rebalance_leaf()
862 if (leaf->prev) in xfs_iext_rebalance_leaf()
[all …]
|
| /fs/gfs2/ |
| A D | xattr.c | 92 struct gfs2_ea_header *ea, *prev = NULL; in ea_foreach_i() local
112 error = ea_call(ip, bh, ea, prev, data); in ea_foreach_i()
195 el->el_prev = prev; in ea_find_i()
305 if (prev && !leave) { in ea_dealloc_unstuffed()
309 prev->ea_rec_len = cpu_to_be32(len); in ea_dealloc_unstuffed()
312 prev->ea_flags |= GFS2_EAFLAG_LAST; in ea_dealloc_unstuffed()
854 prev = GFS2_EA2NEXT(prev); in ea_set_remove_stuffed()
859 prev->ea_rec_len = cpu_to_be32(len); in ea_set_remove_stuffed()
862 prev->ea_flags |= GFS2_EAFLAG_LAST; in ea_set_remove_stuffed()
1101 if (prev) { in ea_remove_stuffed()
[all …]
|
| /fs/bcachefs/ |
| A D | btree_gc.c | 241 if (prev) { in btree_check_node_boundaries()
352 cur = prev = NULL; in bch2_btree_repair_topology_recurse()
421 if (prev) in bch2_btree_repair_topology_recurse()
423 prev = NULL; in bch2_btree_repair_topology_recurse()
438 prev = cur; in bch2_btree_repair_topology_recurse()
453 if (!IS_ERR_OR_NULL(prev)) in bch2_btree_repair_topology_recurse()
455 prev = NULL; in bch2_btree_repair_topology_recurse()
518 if (!IS_ERR_OR_NULL(prev)) in bch2_btree_repair_topology_recurse()
644 if (*prev != b) { in bch2_gc_mark_key()
649 *prev = b; in bch2_gc_mark_key()
[all …]
|
| A D | bset.c | 247 BUG_ON(prev && in __bch2_verify_insert_pos()
250 if (prev && in __bch2_verify_insert_pos()
1209 BUG_ON(prev && in bch2_bset_search_linear()
1460 struct bkey_packed *k, *prev = NULL; in bch2_btree_node_iter_prev_all() local
1470 (!prev || bkey_iter_cmp(b, k, prev) > 0)) { in bch2_btree_node_iter_prev_all()
1471 prev = k; in bch2_btree_node_iter_prev_all()
1476 if (!prev) in bch2_btree_node_iter_prev_all()
1500 return prev; in bch2_btree_node_iter_prev_all()
1506 struct bkey_packed *prev; in bch2_btree_node_iter_prev() local
1510 } while (prev && bkey_deleted(prev)); in bch2_btree_node_iter_prev()
[all …]
|
| /fs/xfs/scrub/ |
| A D | alloc.c | 49 struct xfs_alloc_rec_incore prev; member
124 if (ca->prev.ar_blockcount > 0 && in xchk_allocbt_mergeable()
125 ca->prev.ar_startblock + ca->prev.ar_blockcount == irec->ar_startblock && in xchk_allocbt_mergeable()
126 ca->prev.ar_blockcount + irec->ar_blockcount < (uint32_t)~0U) in xchk_allocbt_mergeable()
129 memcpy(&ca->prev, irec, sizeof(*irec)); in xchk_allocbt_mergeable()
|
| /fs/ |
| A D | readdir.c | 262 struct linux_dirent __user *dirent, *prev; in filldir() local
289 prev = (void __user *) dirent - prev_reclen; in filldir()
290 if (!user_write_access_begin(prev, reclen + prev_reclen)) in filldir()
294 unsafe_put_user(offset, &prev->d_off, efault_end); in filldir()
351 struct linux_dirent64 __user *dirent, *prev; in filldir64() local
372 prev = (void __user *)dirent - prev_reclen; in filldir64()
373 if (!user_write_access_begin(prev, reclen + prev_reclen)) in filldir64()
377 unsafe_put_user(offset, &prev->d_off, efault_end); in filldir64()
516 struct compat_linux_dirent __user *dirent, *prev; in compat_filldir() local
543 prev = (void __user *) dirent - prev_reclen; in compat_filldir()
[all …]
|
| /fs/nilfs2/ |
| A D | alloc.c | 224 struct nilfs_bh_assoc *prev, in nilfs_palloc_get_block() argument
230 if (prev->bh && blkoff == prev->blkoff && in nilfs_palloc_get_block()
232 get_bh(prev->bh); in nilfs_palloc_get_block()
233 *bhp = prev->bh; in nilfs_palloc_get_block()
246 brelse(prev->bh); in nilfs_palloc_get_block()
248 prev->bh = *bhp; in nilfs_palloc_get_block()
249 prev->blkoff = blkoff; in nilfs_palloc_get_block()
269 struct nilfs_bh_assoc *prev, in nilfs_palloc_delete_block() argument
273 if (prev->bh && blkoff == prev->blkoff) { in nilfs_palloc_delete_block()
274 brelse(prev->bh); in nilfs_palloc_delete_block()
[all …]
|
| A D | cpfile.c | 773 __u64 curr, prev; in nilfs_cpfile_set_snapshot() local
816 prev = le64_to_cpu(list->ssl_prev); in nilfs_cpfile_set_snapshot()
817 while (prev > cno) { in nilfs_cpfile_set_snapshot()
819 curr = prev; in nilfs_cpfile_set_snapshot()
836 if (prev != 0) { in nilfs_cpfile_set_snapshot()
843 cpfile, prev, prev_bh); in nilfs_cpfile_set_snapshot()
901 __u64 next, prev; in nilfs_cpfile_clear_snapshot() local
932 prev = le64_to_cpu(list->ssl_prev); in nilfs_cpfile_clear_snapshot()
948 if (prev != 0) { in nilfs_cpfile_clear_snapshot()
955 cpfile, prev, prev_bh); in nilfs_cpfile_clear_snapshot()
[all …]
|
| /fs/hfs/ |
| A D | bnode.c | 249 be32_to_cpu(desc.next), be32_to_cpu(desc.prev), in hfs_bnode_dump()
284 if (node->prev) { in hfs_bnode_unlink()
285 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
299 tmp->prev = node->prev; in hfs_bnode_unlink()
300 cnid = cpu_to_be32(tmp->prev); in hfs_bnode_unlink()
301 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4); in hfs_bnode_unlink()
304 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
307 if (!node->prev && !node->next) { in hfs_bnode_unlink()
443 node->prev = be32_to_cpu(desc->prev); in hfs_bnode_find()
|
| A D | brec.c | 248 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/hfsplus/ |
| A D | brec.c | 252 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()
|
| A D | bnode.c | 398 be32_to_cpu(desc.next), be32_to_cpu(desc.prev), in hfs_bnode_dump()
433 if (node->prev) { in hfs_bnode_unlink()
434 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
449 tmp->prev = node->prev; in hfs_bnode_unlink()
450 cnid = cpu_to_be32(tmp->prev); in hfs_bnode_unlink()
452 offsetof(struct hfs_bnode_desc, prev), 4); in hfs_bnode_unlink()
455 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
458 if (!node->prev && !node->next) in hfs_bnode_unlink()
594 node->prev = be32_to_cpu(desc->prev); in hfs_bnode_find()
|
| /fs/jfs/ |
| A D | jfs_extent.c | 201 s64 prev; in extHint() local
213 prev = ((offset & ~POFFSET) >> JFS_SBI(sb)->l2bsize) - nbperpage; in extHint()
217 if (prev < 0) in extHint()
220 rc = xtLookup(ip, prev, nbperpage, &xflag, &xaddr, &xlen, 0); in extHint()
229 XADoffset(xp, prev); in extHint()
|
| /fs/autofs/ |
| A D | expire.c | 94 static struct dentry *get_next_positive_subdir(struct dentry *prev, in get_next_positive_subdir() argument
102 q = positive_after(root, prev); in get_next_positive_subdir()
105 dput(prev); in get_next_positive_subdir()
112 static struct dentry *get_next_positive_dentry(struct dentry *prev, in get_next_positive_dentry() argument
116 struct dentry *p = prev, *ret = NULL, *d = NULL; in get_next_positive_dentry()
118 if (prev == NULL) in get_next_positive_dentry()
137 dput(prev); in get_next_positive_dentry()
|
| /fs/omfs/ |
| A D | dir.c | 165 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()
|