Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 347) sorted by relevance

12345678910>>...14

/fs/ntfs3/lib/
A Ddecompress_common.h66 const u8 *next; member
78 is->next = buffer; in init_input_bitstream()
79 is->end = is->next + size; in init_input_bitstream()
91 if (is->end - is->next >= 2) { in bitstream_ensure_bits()
94 is->next += 2; in bitstream_ensure_bits()
148 return *is->next++; in bitstream_read_byte()
159 v = get_unaligned_le16(is->next); in bitstream_read_u16()
160 is->next += 2; in bitstream_read_u16()
172 v = get_unaligned_le32(is->next); in bitstream_read_u32()
173 is->next += 4; in bitstream_read_u32()
[all …]
/fs/jfs/
A Djfs_txnmgr.c663 lid_to_tlock(last)->next = tlck->next; in txLock()
916 for (lid = tblk->next; lid; lid = next) { in txUnlock()
918 next = tlck->next; in txUnlock()
1084 linelock->next = tlock->next; in txLinelock()
2193 next = tlck->next; in txForce()
2194 tlck->next = tblk->next; in txForce()
2203 for (lid = tblk->next; lid; lid = next) { in txForce()
2205 next = tlck->next; in txForce()
2562 xtlck->next = tlck->next; in txFreelock()
2603 for (lid = tblk->next; lid; lid = next) { in txAbort()
[all …]
A Djfs_dtree.c1572 f->next = -1; in dtSplitPage()
1797 f->next = -1; in dtExtendPage()
1809 f->next = n; in dtExtendPage()
2731 int i, next; in jfs_readdir() local
2972 next = d->next; in jfs_readdir()
2991 next = t->next; in jfs_readdir()
3666 lh->next = h->next; in dtInsertEntry()
3681 ih->next = h->next; in dtInsertEntry()
3868 next = slh->next; in dtMoveEntry()
3880 next = sih->next; in dtMoveEntry()
[all …]
/fs/
A Dchar_dev.c156 cd->next = curr; in __register_chrdev_region()
159 cd->next = prev->next; in __register_chrdev_region()
160 prev->next = cd; in __register_chrdev_region()
185 *cp = cd->next; in __unregister_chrdev_region()
204 dev_t n, next; in register_chrdev_region() local
208 if (next > to) in register_chrdev_region()
209 next = to; in register_chrdev_region()
211 next - n, name); in register_chrdev_region()
314 dev_t n, next; in unregister_chrdev_region() local
318 if (next > to) in unregister_chrdev_region()
[all …]
A Dfilesystems.c52 for (p = &file_systems; *p; p = &(*p)->next) in find_filesystem()
82 if (fs->next) in register_filesystem()
116 *tmp = fs->next; in unregister_filesystem()
117 fs->next = NULL; in unregister_filesystem()
122 tmp = &(*tmp)->next; in unregister_filesystem()
145 for (tmp=file_systems, index=0 ; tmp ; tmp=tmp->next, index++) { in fs_index()
162 for (tmp = file_systems; tmp; tmp = tmp->next, index--) { in fs_name()
186 for (tmp = file_systems, index = 0 ; tmp ; tmp = tmp->next, index++) in fs_maxindex()
223 for (p = file_systems; p; p = p->next) { in list_bdev_fs_names()
251 tmp = tmp->next; in filesystems_proc_show()
A Dpnode.c19 return list_entry(p->mnt_share.next, struct mount, mnt_share); in next_peer()
146 struct mount *next = next_peer(m); in __propagation_next() local
147 return (next == origin) ? NULL : next; in __propagation_next()
148 } else if (m->mnt_slave.next) in __propagation_next()
194 struct mount *next; in next_group() local
197 next = next_peer(m); in next_group()
199 if (next == origin) in next_group()
201 } else if (m->mnt_slave.next != &next->mnt_slave) in next_group()
203 m = next; in next_group()
208 if (m->mnt_slave.next) in next_group()
[all …]
/fs/orangefs/
A Ddir.c141 if (part->next) in parse_readdir()
148 new->next = NULL; in parse_readdir()
154 part->next = new; in parse_readdir()
220 goto next; in fill_from_part()
223 goto next; in fill_from_part()
234 next: in fill_from_part()
250 part = part->next; in orangefs_dir_fill()
290 struct orangefs_dir_part *next = part->next; in orangefs_dir_llseek() local
292 part = next; in orangefs_dir_llseek()
382 struct orangefs_dir_part *next = part->next; in orangefs_dir_release() local
[all …]
/fs/jffs2/
A Dnodelist.c43 new->next = (*prev)->next; in jffs2_add_fd_to_list()
55 new->next = *prev; in jffs2_add_fd_to_list()
77 frag = next; in jffs2_truncate_fragtree()
397 if (next) { in jffs2_add_full_dnode_to_inode()
399 if (next->node) in jffs2_add_full_dnode_to_inode()
427 ret = ret->next; in jffs2_get_ino_cache()
495 next = this->next; in jffs2_free_ino_caches()
498 this = next; in jffs2_free_ino_caches()
515 next = NULL; in jffs2_free_raw_node_refs()
518 this = next; in jffs2_free_raw_node_refs()
[all …]
A Dxattr.c570 ref->next = ic->xref; in create_xattr_ref()
607 _ref = ref->next; in jffs2_xattr_delete_inode()
622 _ref = ref->next; in jffs2_xattr_free_inode()
648 for (ref=ic->xref, pref=&ic->xref; ref; pref=&ref->next, ref=ref->next) { in check_xattr_ref_inode()
658 for (cmp=ref->next, pcmp=&ref->next; cmp; pcmp=&cmp->next, cmp=cmp->next) { in check_xattr_ref_inode()
747 _ref = ref->next; in jffs2_clear_xattr_subsystem()
752 _ref = ref->next; in jffs2_clear_xattr_subsystem()
796 _ref = ref->next; in jffs2_build_xattr_subsystem()
835 _ref = ref->next; in jffs2_build_xattr_subsystem()
1196 *pref = ref->next; in do_jffs2_setxattr()
[all …]
A Dbuild.c40 if (ic->next) in next_inode()
41 return ic->next; in next_inode()
61 for(fd = ic->scan_dents; fd; fd = fd->next) { in jffs2_build_inode_pass1()
151 dead_fds = fd->next; in jffs2_build_filesystem()
181 ic->scan_dents = fd->next; in jffs2_build_filesystem()
232 ic->scan_dents = fd->next; in jffs2_build_filesystem()
253 struct jffs2_raw_node_ref *next = raw->next_in_ino; in jffs2_build_remove_unlinked_inode() local
256 raw = next; in jffs2_build_remove_unlinked_inode()
267 ic->scan_dents = fd->next; in jffs2_build_remove_unlinked_inode()
295 fd->next = *dead_fds; in jffs2_build_remove_unlinked_inode()
/fs/f2fs/
A Dshrinker.c48 p = f2fs_list.next; in f2fs_shrink_count()
54 p = p->next; in f2fs_shrink_count()
72 p = p->next; in f2fs_shrink_count()
92 p = f2fs_list.next; in f2fs_shrink_scan()
101 p = p->next; in f2fs_shrink_scan()
123 p = p->next; in f2fs_shrink_scan()
140 p = f2fs_list.next; in f2fs_donate_files()
146 p = p->next; in f2fs_donate_files()
154 p = p->next; in f2fs_donate_files()
216 p = p->next; in f2fs_reclaim_caches()
[all …]
/fs/overlayfs/
A Dexport.c116 next = dget(dentry); in ovl_connect_layer()
138 dput(next); in ovl_connect_layer()
139 next = parent; in ovl_connect_layer()
143 dput(next); in ovl_connect_layer()
500 next = dget(real); in ovl_lookup_real_ancestor()
527 dput(next); in ovl_lookup_real_ancestor()
528 next = parent; in ovl_lookup_real_ancestor()
532 dput(next); in ovl_lookup_real_ancestor()
595 dput(next); in ovl_lookup_real()
596 next = parent; in ovl_lookup_real()
[all …]
/fs/bcachefs/
A Drcu_pending.c143 l1->tail->next.next = (void *) l2->head; in rcu_pending_list_merge()
157 l->tail->next = n; in rcu_pending_list_add()
159 n->next = NULL; in rcu_pending_list_add()
164 l->tail->next.next = (void *) n; in rcu_pending_list_add()
166 n->next.next = NULL; in rcu_pending_list_add()
221 list = obj->next; in __process_finished_items()
223 list = (void *) obj->next.next; in __process_finished_items()
252 list = obj->next; in __process_finished_items()
254 list = (void *) obj->next.next; in __process_finished_items()
270 list = (void *) obj->next.next; in __process_finished_items()
[all …]
/fs/omfs/
A Dfile.c37 u64 next, last; in omfs_shrink_inode() local
45 next = inode->i_ino; in omfs_shrink_inode()
52 bh = omfs_bread(inode->i_sb, next); in omfs_shrink_inode()
69 last = next; in omfs_shrink_inode()
70 next = be64_to_cpu(oe->e_next); in omfs_shrink_inode()
89 if (next == ~0) in omfs_shrink_inode()
92 bh = omfs_bread(inode->i_sb, next); in omfs_shrink_inode()
221 sector_t next, offset; in omfs_get_block() local
239 next = inode->i_ino; in omfs_get_block()
247 next = be64_to_cpu(oe->e_next); in omfs_get_block()
[all …]
/fs/xfs/libxfs/
A Dxfs_iext_tree.c241 cur->leaf->next) { in xfs_iext_next()
578 if (leaf->next) in xfs_iext_split_leaf()
579 leaf->next->prev = new; in xfs_iext_split_leaf()
580 new->next = leaf->next; in xfs_iext_split_leaf()
582 leaf->next = new; in xfs_iext_split_leaf()
732 return next; in xfs_iext_rebalance_node()
835 if (leaf->next) { in xfs_iext_rebalance_leaf()
846 leaf->next->recs[i]; in xfs_iext_rebalance_leaf()
855 leaf = leaf->next; in xfs_iext_rebalance_leaf()
863 leaf->prev->next = leaf->next; in xfs_iext_rebalance_leaf()
[all …]
/fs/btrfs/
A Dextent_map.c297 next->disk_bytenr + next->disk_num_bytes) - in merge_ondisk_extents()
621 if (!next) in next_extent_map()
666 end = next ? next->start : btrfs_extent_map_end(em); in merge_extent_mapping()
854 goto next; in btrfs_drop_extent_map_range()
975 next: in btrfs_drop_extent_map_range()
1158 goto next; in btrfs_scan_inode()
1175 next: in btrfs_scan_inode()
1187 node = next; in btrfs_scan_inode()
1216 goto next; in find_first_inode_to_shrink()
1228 goto next; in find_first_inode_to_shrink()
[all …]
A Ddefrag.c668 goto next; in defrag_get_extent()
678 goto next; in defrag_get_extent()
711 goto next; in defrag_get_extent()
716 next: in defrag_get_extent()
812 if (!next || next->disk_bytenr >= EXTENT_MAP_LAST_BYTE) in defrag_check_next_extent()
986 goto next; in defrag_collect_targets()
991 goto next; in defrag_collect_targets()
995 goto next; in defrag_collect_targets()
999 goto next; in defrag_collect_targets()
1028 goto next; in defrag_collect_targets()
[all …]
A Dextent-io-tree.c359 struct extent_state *next; in merge_next_state() local
361 next = next_state(state); in merge_next_state()
362 if (next && next->start == state->end + 1 && next->state == state->state) { in merge_next_state()
365 state->end = next->end; in merge_next_state()
590 return next; in clear_state_bit()
683 goto next; in btrfs_clear_extent_bit_changeset()
714 goto next; in btrfs_clear_extent_bit_changeset()
750 next: in btrfs_clear_extent_bit_changeset()
1575 state = next; in btrfs_find_first_clear_extent_bit()
1937 if (next) in btrfs_next_extent_state()
[all …]
/fs/erofs/
A Ddecompressor_lzma.c6 struct z_erofs_lzma *next; member
37 struct z_erofs_lzma *n = strm->next; in z_erofs_lzma_exit()
64 strm->next = z_erofs_lzma_head; in z_erofs_lzma_init()
121 for (last = strm; last->next; last = last->next) in z_erofs_load_lzma_config()
123 last->next = head; in z_erofs_load_lzma_config()
129 for (strm = head; strm; strm = strm->next) { in z_erofs_load_lzma_config()
177 z_erofs_lzma_head = strm->next; in z_erofs_lzma_decompress()
222 strm->next = z_erofs_lzma_head; in z_erofs_lzma_decompress()
A Ddecompressor_zstd.c6 struct z_erofs_zstd *next; member
32 z_erofs_zstd_head = all ? NULL : strm->next; in z_erofs_isolate_strms()
43 n = strm->next; in z_erofs_zstd_exit()
68 strm->next = z_erofs_zstd_head; in z_erofs_zstd_init()
107 n = strm->next; in z_erofs_load_zstd_config()
108 strm->next = head; in z_erofs_load_zstd_config()
116 for (strm = head; strm; strm = strm->next) { in z_erofs_load_zstd_config()
206 strm->next = z_erofs_zstd_head; in z_erofs_zstd_decompress()
/fs/netfs/
A Drolling_buffer.c109 smp_store_release(&head->next, fq); in rolling_buffer_make_space()
184 struct folio_queue *spent = roll->tail, *next = READ_ONCE(spent->next); in rolling_buffer_delete_spent() local
186 if (!next) in rolling_buffer_delete_spent()
188 next->prev = NULL; in rolling_buffer_delete_spent()
190 roll->tail = next; in rolling_buffer_delete_spent()
191 return next; in rolling_buffer_delete_spent()
205 roll->tail = p->next; in rolling_buffer_clear()
/fs/nilfs2/
A Dsegbuf.h41 sector_t next; member
87 #define NILFS_NEXT_SEGBUF(segbuf) NILFS_LIST_SEGBUF((segbuf)->sb_list.next)
90 #define NILFS_FIRST_SEGBUF(head) NILFS_LIST_SEGBUF((head)->next)
91 #define NILFS_SEGBUF_IS_LAST(segbuf, head) ((segbuf)->sb_list.next == (head))
98 (list_entry((head)->next, struct buffer_head, b_assoc_buffers))
100 (list_entry((bh)->b_assoc_buffers.next, struct buffer_head, \
102 #define NILFS_SEGBUF_BH_IS_LAST(bh, head) ((bh)->b_assoc_buffers.next == head)
/fs/xfs/
A Dxfs_mru_cache.c232 struct xfs_mru_cache_elem *elem, *next; in _xfs_mru_cache_clear_reap_list() local
235 list_for_each_entry_safe(elem, next, &mru->reap_list, list_node) { in _xfs_mru_cache_clear_reap_list()
248 list_for_each_entry_safe(elem, next, &tmp, list_node) { in _xfs_mru_cache_clear_reap_list()
269 unsigned long now, next; in _xfs_mru_cache_reap() local
276 next = _xfs_mru_cache_migrate(mru, jiffies); in _xfs_mru_cache_reap()
279 mru->queued = next; in _xfs_mru_cache_reap()
282 if (next <= now) in _xfs_mru_cache_reap()
283 next = 0; in _xfs_mru_cache_reap()
285 next -= now; in _xfs_mru_cache_reap()
286 queue_delayed_work(xfs_mru_reap_wq, &mru->work, next); in _xfs_mru_cache_reap()
/fs/iomap/
A Dioend.c302 struct iomap_ioend *next) in iomap_ioend_can_merge() argument
304 if (ioend->io_bio.bi_status != next->io_bio.bi_status) in iomap_ioend_can_merge()
306 if (next->io_flags & IOMAP_IOEND_BOUNDARY) in iomap_ioend_can_merge()
309 (next->io_flags & IOMAP_IOEND_NOMERGE_FLAGS)) in iomap_ioend_can_merge()
311 if (ioend->io_offset + ioend->io_size != next->io_offset) in iomap_ioend_can_merge()
324 next->io_sector) in iomap_ioend_can_merge()
332 struct iomap_ioend *next; in iomap_ioend_try_merge() local
336 while ((next = list_first_entry_or_null(more_ioends, struct iomap_ioend, in iomap_ioend_try_merge()
338 if (!iomap_ioend_can_merge(ioend, next)) in iomap_ioend_try_merge()
340 list_move_tail(&next->io_list, &ioend->io_list); in iomap_ioend_try_merge()
[all …]
/fs/proc/
A Dgeneric.c175 cp = next + 1; in __xlate_proc_name()
310 struct proc_dir_entry *next; in proc_readdir_de() local
320 next = pde_subdir_next(de); in proc_readdir_de()
322 de = next; in proc_readdir_de()
766 next = pde_subdir_first(de); in remove_proc_subtree()
767 if (next) { in remove_proc_subtree()
771 next->parent->name, next->name); in remove_proc_subtree()
775 de = next; in remove_proc_subtree()
778 next = de->parent; in remove_proc_subtree()
780 next->nlink--; in remove_proc_subtree()
[all …]

Completed in 76 milliseconds

12345678910>>...14