| /fs/btrfs/ |
| D | extent_map.c | 125 struct rb_node *prev = NULL; in __tree_search() local
132 prev = n; in __tree_search()
146 orig_prev = prev; in __tree_search()
147 while (prev && offset >= extent_map_end(prev_entry)) { in __tree_search()
148 prev = rb_next(prev); in __tree_search()
149 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
151 *prev_ret = prev; in __tree_search()
152 prev = orig_prev; in __tree_search()
156 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
157 while (prev && offset < prev_entry->start) { in __tree_search()
[all …]
|
| D | ordered-data.c | 71 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/ |
| D | nodelist.c | 27 struct jffs2_full_dirent **prev = list; in jffs2_add_fd_to_list() local
31 while ((*prev) && (*prev)->nhash <= new->nhash) { in jffs2_add_fd_to_list()
32 if ((*prev)->nhash == new->nhash && !strcmp((*prev)->name, new->name)) { in jffs2_add_fd_to_list()
34 if (new->version < (*prev)->version) { in jffs2_add_fd_to_list()
36 (*prev)->name, (*prev)->ino); in jffs2_add_fd_to_list()
41 (*prev)->name, (*prev)->ino); in jffs2_add_fd_to_list()
42 new->next = (*prev)->next; in jffs2_add_fd_to_list()
45 if ((*prev)->raw) in jffs2_add_fd_to_list()
46 jffs2_mark_node_obsolete(c, ((*prev)->raw)); in jffs2_add_fd_to_list()
47 jffs2_free_full_dirent(*prev); in jffs2_add_fd_to_list()
[all …]
|
| D | erase.c | 228 struct jffs2_raw_node_ref **prev; in jffs2_remove_node_refs_from_ino_list() local
230 prev = &ref->next_in_ino; in jffs2_remove_node_refs_from_ino_list()
234 if (!(*prev)->next_in_ino) { in jffs2_remove_node_refs_from_ino_list()
238 ic = (struct jffs2_inode_cache *)(*prev); in jffs2_remove_node_refs_from_ino_list()
239 prev = &ic->nodes; in jffs2_remove_node_refs_from_ino_list()
243 if (SECTOR_ADDR((*prev)->flash_offset) == jeb->offset) { in jffs2_remove_node_refs_from_ino_list()
247 this = *prev; in jffs2_remove_node_refs_from_ino_list()
248 *prev = this->next_in_ino; in jffs2_remove_node_refs_from_ino_list()
257 prev = &((*prev)->next_in_ino); in jffs2_remove_node_refs_from_ino_list()
|
| /fs/notify/dnotify/ |
| D | dnotify.c | 43 struct dnotify_struct **prev; in dnotify_flush() local
50 prev = &inode->i_dnotify; in dnotify_flush()
51 while ((dn = *prev) != NULL) { in dnotify_flush()
53 *prev = dn->dn_next; in dnotify_flush()
58 prev = &dn->dn_next; in dnotify_flush()
67 struct dnotify_struct **prev; in fcntl_dirnotify() local
86 prev = &inode->i_dnotify; in fcntl_dirnotify()
87 while ((odn = *prev) != NULL) { in fcntl_dirnotify()
94 prev = &odn->dn_next; in fcntl_dirnotify()
129 struct dnotify_struct **prev; in __inode_dir_notify() local
[all …]
|
| /fs/yaffs2/ |
| D | devextras.h | 43 struct ylist_head *prev; /* previous in chain */ member
57 (p)->prev = (p); \
68 newEntry->prev = list; in ylist_add()
70 listNext->prev = newEntry; in ylist_add()
77 struct ylist_head *listPrev = list->prev; in ylist_add_tail()
79 list->prev = newEntry; in ylist_add_tail()
81 newEntry->prev = listPrev; in ylist_add_tail()
92 struct ylist_head *listPrev = entry->prev; in ylist_del()
94 listNext->prev = listPrev; in ylist_del()
102 entry->next = entry->prev = entry; in ylist_del_init()
|
| /fs/nfs/ |
| D | pagelist.c | 246 static int nfs_can_coalesce_requests(struct nfs_page *prev, in nfs_can_coalesce_requests() argument
249 if (req->wb_context->cred != prev->wb_context->cred) in nfs_can_coalesce_requests()
251 if (req->wb_context->lockowner != prev->wb_context->lockowner) in nfs_can_coalesce_requests()
253 if (req->wb_context->state != prev->wb_context->state) in nfs_can_coalesce_requests()
255 if (req->wb_index != (prev->wb_index + 1)) in nfs_can_coalesce_requests()
259 if (prev->wb_pgbase + prev->wb_bytes != PAGE_CACHE_SIZE) in nfs_can_coalesce_requests()
278 struct nfs_page *prev; in nfs_pageio_do_add_request() local
292 prev = nfs_list_entry(desc->pg_list.prev); in nfs_pageio_do_add_request()
293 if (!nfs_can_coalesce_requests(prev, req)) in nfs_pageio_do_add_request()
368 struct nfs_page *prev = nfs_list_entry(desc->pg_list.prev); in nfs_pageio_cond_complete() local
[all …]
|
| D | callback_proc.c | 79 struct nfs_client *prev = clp; in nfs4_callback_recall() local
97 clp = nfs_find_client_next(prev); in nfs4_callback_recall()
98 nfs_put_client(prev); in nfs4_callback_recall()
|
| /fs/gfs2/ |
| D | eattr.c | 72 struct gfs2_ea_header *prev, void *private);
77 struct gfs2_ea_header *ea, *prev = NULL; in ea_foreach_i() local
83 for (ea = GFS2_EA_BH2FIRST(bh);; prev = ea, ea = GFS2_EA2NEXT(ea)) { in ea_foreach_i()
92 error = ea_call(ip, bh, ea, prev, data); in ea_foreach_i()
160 struct gfs2_ea_header *ea, struct gfs2_ea_header *prev, in ea_find_i() argument
176 el->el_prev = prev; in ea_find_i()
219 struct gfs2_ea_header *prev, void *private) in ea_dealloc_unstuffed() argument
285 if (prev && !leave) { in ea_dealloc_unstuffed()
288 len = GFS2_EA_REC_LEN(prev) + GFS2_EA_REC_LEN(ea); in ea_dealloc_unstuffed()
289 prev->ea_rec_len = cpu_to_be32(len); in ea_dealloc_unstuffed()
[all …]
|
| D | dir.c | 483 struct gfs2_dirent *dent, *prev; in gfs2_dirent_scan() local
493 prev = NULL; in gfs2_dirent_scan()
505 prev = dent; in gfs2_dirent_scan()
518 return prev ? prev : dent; in gfs2_dirent_scan()
624 struct gfs2_dirent *prev, struct gfs2_dirent *cur) in dirent_del() argument
639 if (!prev) { in dirent_del()
647 prev_rec_len = be16_to_cpu(prev->de_rec_len); in dirent_del()
650 if ((char *)prev + prev_rec_len != (char *)cur) in dirent_del()
656 prev->de_rec_len = cpu_to_be16(prev_rec_len); in dirent_del()
936 struct gfs2_dirent *dent = NULL, *prev = NULL, *next = NULL, *new; in dir_split_leaf() local
[all …]
|
| /fs/hfs/ |
| D | bnode.c | 143 be32_to_cpu(desc.next), be32_to_cpu(desc.prev), in hfs_bnode_dump()
177 if (node->prev) { in hfs_bnode_unlink()
178 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
192 tmp->prev = node->prev; in hfs_bnode_unlink()
193 cnid = cpu_to_be32(tmp->prev); in hfs_bnode_unlink()
194 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4); in hfs_bnode_unlink()
197 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
200 if (!node->prev && !node->next) { in hfs_bnode_unlink()
341 node->prev = be32_to_cpu(desc->prev); in hfs_bnode_find()
|
| D | brec.c | 246 new_node->prev = node->this; in hfs_bnode_split()
316 node_desc.prev = cpu_to_be32(new_node->prev); in hfs_bnode_split()
332 next_node->prev = new_node->this; in hfs_bnode_split()
334 node_desc.prev = cpu_to_be32(next_node->prev); in hfs_bnode_split()
478 new_node->prev = 0; in hfs_btree_inc_height()
482 node_desc.prev = cpu_to_be32(new_node->prev); in hfs_btree_inc_height()
|
| D | btree.c | 171 static struct hfs_bnode *hfs_bmap_new_bmap(struct hfs_bnode *prev, u32 idx) in hfs_bmap_new_bmap() argument
173 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap()
185 prev->next = idx; in hfs_bmap_new_bmap()
187 hfs_bnode_write(prev, &cnid, offsetof(struct hfs_bnode_desc, next), 4); in hfs_bmap_new_bmap()
193 desc.prev = 0; in hfs_bmap_new_bmap()
|
| D | btree.h | 48 u32 prev; member
126 __be32 prev; /* (V) Number of the prev node at this level */ member
|
| /fs/xfs/ |
| D | xfs_trans_ail.c | 171 struct xfs_ail_cursor *prev = NULL; in xfs_trans_ail_cursor_done() local
177 prev = &ailp->xa_cursors; in xfs_trans_ail_cursor_done()
178 for (cur = prev->next; cur; prev = cur, cur = prev->next) { in xfs_trans_ail_cursor_done()
180 prev->next = cur->next; in xfs_trans_ail_cursor_done()
708 prev_lip = list_entry(lip->li_ail.prev, xfs_log_item_t, li_ail); in xfs_ail_check()
|
| D | xfs_bmap.c | 213 xfs_bmap_free_item_t *prev, /* previous item on list, if any */
635 xfs_bmbt_irec_t prev; /* old extent at offset idx */ in xfs_bmap_add_extent() local
640 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, idx), &prev); in xfs_bmap_add_extent()
648 new->br_startoff + new->br_blockcount > prev.br_startoff) { in xfs_bmap_add_extent()
649 if (prev.br_state != XFS_EXT_UNWRITTEN && in xfs_bmap_add_extent()
650 isnullstartblock(prev.br_startblock)) { in xfs_bmap_add_extent()
651 da_old = startblockval(prev.br_startblock); in xfs_bmap_add_extent()
3427 xfs_bmap_free_item_t *prev, /* previous item on list, if any */ in xfs_bmap_del_free() argument
3430 if (prev) in xfs_bmap_del_free()
3431 prev->xbfi_next = free->xbfi_next; in xfs_bmap_del_free()
[all …]
|
| /fs/hfsplus/ |
| D | brec.c | 233 new_node->prev = node->this; in hfs_bnode_split()
290 node_desc.prev = cpu_to_be32(new_node->prev); in hfs_bnode_split()
307 next_node->prev = new_node->this; in hfs_bnode_split()
309 node_desc.prev = cpu_to_be32(next_node->prev); in hfs_bnode_split()
451 new_node->prev = 0; in hfs_btree_inc_height()
455 node_desc.prev = cpu_to_be32(new_node->prev); in hfs_btree_inc_height()
|
| D | bnode.c | 303 be32_to_cpu(desc.next), be32_to_cpu(desc.prev), in hfs_bnode_dump()
337 if (node->prev) { in hfs_bnode_unlink()
338 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
352 tmp->prev = node->prev; in hfs_bnode_unlink()
353 cnid = cpu_to_be32(tmp->prev); in hfs_bnode_unlink()
354 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4); in hfs_bnode_unlink()
357 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
360 if (!node->prev && !node->next) { in hfs_bnode_unlink()
501 node->prev = be32_to_cpu(desc->prev); in hfs_bnode_find()
|
| D | btree.c | 149 static struct hfs_bnode *hfs_bmap_new_bmap(struct hfs_bnode *prev, u32 idx) in hfs_bmap_new_bmap() argument
151 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap()
161 prev->next = idx; in hfs_bmap_new_bmap()
163 hfs_bnode_write(prev, &cnid, offsetof(struct hfs_bnode_desc, next), 4); in hfs_bmap_new_bmap()
169 desc.prev = 0; in hfs_bmap_new_bmap()
|
| /fs/omfs/ |
| D | dir.c | 168 u64 block, prev; in omfs_delete_entry() local
180 bh2 = omfs_scan_list(dir, block, name, namelen, &prev); in omfs_delete_entry()
190 if (prev != ~0) { in omfs_delete_entry()
194 clus_to_blk(OMFS_SB(dir->i_sb), prev)); in omfs_delete_entry()
205 if (prev != ~0) { in omfs_delete_entry()
206 dirty = omfs_iget(dir->i_sb, prev); in omfs_delete_entry()
|
| /fs/dlm/ |
| D | member.c | 38 newlist->prev = tmp->prev; in add_ordered_member()
40 tmp->prev->next = newlist; in add_ordered_member()
41 tmp->prev = newlist; in add_ordered_member()
|
| /fs/ext2/ |
| D | balloc.c | 213 struct ext2_reserve_window_node *rsv, *prev; in __rsv_window_dump() local
219 prev = NULL; in __rsv_window_dump()
233 if (prev && prev->rsv_end >= rsv->rsv_start) { in __rsv_window_dump()
246 prev = rsv; in __rsv_window_dump()
792 struct ext2_reserve_window_node *rsv, *prev; in find_next_reservable_window() local
819 prev = rsv; in find_next_reservable_window()
849 if ((prev != my_rsv) && (!rsv_is_empty(&my_rsv->rsv_window))) in find_next_reservable_window()
863 if (prev != my_rsv) in find_next_reservable_window()
|
| /fs/jfs/ |
| D | jfs_extent.c | 368 s64 prev; in extHint() local
377 prev = ((offset & ~POFFSET) >> JFS_SBI(sb)->l2bsize) - nbperpage; in extHint()
382 if (prev < 0) in extHint()
389 LXDoffset(&lxd, prev) in extHint()
|
| /fs/reiserfs/ |
| D | item_ops.c | 275 __u32 prev = INT_MAX; in indirect_print_item() local
285 if (sequence_finished(prev, &num, get_block_num(unp, j))) { in indirect_print_item()
286 print_sequence(prev, num); in indirect_print_item()
287 start_new_sequence(&prev, &num, get_block_num(unp, j)); in indirect_print_item()
290 print_sequence(prev, num); in indirect_print_item()
|
| /fs/ext3/ |
| D | balloc.c | 200 struct ext3_reserve_window_node *rsv, *prev; in __rsv_window_dump() local
206 prev = NULL; in __rsv_window_dump()
220 if (prev && prev->rsv_end >= rsv->rsv_start) { in __rsv_window_dump()
233 prev = rsv; in __rsv_window_dump()
985 struct ext3_reserve_window_node *rsv, *prev; in find_next_reservable_window() local
1012 prev = rsv; in find_next_reservable_window()
1042 if ((prev != my_rsv) && (!rsv_is_empty(&my_rsv->rsv_window))) in find_next_reservable_window()
1056 if (prev != my_rsv) in find_next_reservable_window()
|