| /fs/btrfs/ |
| A D | extent-cache.c | 163 struct rb_node *next; in search_cache_extent() local
172 node = next; in search_cache_extent()
183 struct rb_node *next; in search_cache_extent2() local
193 node = next; in search_cache_extent2()
284 next = cache; in add_merge_cache_extent()
295 BUG_ON(next && start + size > next->start); in add_merge_cache_extent()
298 if (next && start + size == next->start) { in add_merge_cache_extent()
300 next->size = next->start + next->size - start; in add_merge_cache_extent()
301 next->start = start; in add_merge_cache_extent()
306 next->size = next->start + next->size - prev->start; in add_merge_cache_extent()
[all …]
|
| A D | ctree.c | 610 struct extent_buffer *next = NULL; in btrfs_prev_leaf() local
629 if (IS_ERR(next)) in btrfs_prev_leaf()
630 return PTR_ERR(next); in btrfs_prev_leaf()
640 slot = btrfs_header_nritems(next); in btrfs_prev_leaf()
643 path->nodes[level] = next; in btrfs_prev_leaf()
647 next = read_node_slot(fs_info, next, slot); in btrfs_prev_leaf()
649 if (IS_ERR(next)) in btrfs_prev_leaf()
650 return PTR_ERR(next); in btrfs_prev_leaf()
671 struct extent_buffer *next = NULL; in btrfs_next_sibling_tree_block() local
697 path->nodes[level] = next; in btrfs_next_sibling_tree_block()
[all …]
|
| A D | subvolume.c | 188 goto next; in list_subvolums()
195 goto next; in list_subvolums()
201 goto next; in list_subvolums()
211 next: in list_subvolums()
|
| A D | Kconfig | 12 next-generation Linux file system based on the copy-on-write
|
| A D | inode.c | 285 goto next; in btrfs_lookup_path()
334 next: in btrfs_lookup_path()
|
| /fs/exfat/ |
| A D | cluster.c | 76 le32_t next; in exfat_next_cluster() local
86 if (exfat_pread(ef->dev, &next, sizeof(next), fat_offset) < 0) in exfat_next_cluster()
89 return le32_to_cpu(next); in exfat_next_cluster()
175 cluster_t current, cluster_t next) in set_next_cluster() argument
184 next_le32 = cpu_to_le32(next); in set_next_cluster()
243 cluster_t next; in grow_file() local
276 next = allocate_cluster(ef, previous + 1); in grow_file()
277 if (CLUSTER_INVALID(*ef->sb, next)) in grow_file()
294 previous = next; in grow_file()
308 cluster_t next; in shrink_file() local
[all …]
|
| A D | node.c | 547 current->next = node; in exfat_cache_directory()
561 node = current->next; in exfat_cache_directory()
578 node->next = dir->child; in tree_attach()
586 node->prev->next = node->next; in tree_detach()
588 node->parent->child = node->next; in tree_detach()
589 if (node->next) in tree_detach()
590 node->next->prev = node->prev; in tree_detach()
593 node->next = NULL; in tree_detach()
725 for (last_node = node = dir->child; node; node = node->next) in shrink_directory()
849 for (p = dir->child; p != NULL; p = p->next) in find_slot()
|
| A D | lookup.c | 54 it->current = it->current->next; in exfat_readdir()
|
| /fs/jffs2/ |
| A D | mergesort.c | 25 q = q->next; in sort_list()
36 q = q->next; in sort_list()
40 p = p->next; in sort_list()
43 e->next = NULL; /* break accidental loops. */ in sort_list()
45 tail = &e->next; in sort_list()
|
| A D | summary.h | 86 union jffs2_sum_mem *next; member
92 union jffs2_sum_mem *next; member
102 union jffs2_sum_mem *next; member
116 union jffs2_sum_mem *next; member
126 union jffs2_sum_mem *next; member
|
| A D | jffs2_1pass.c | 508 struct mem_block *next; member
516 struct mem_block *next = list->listMemBase->next; in free_nodes() local
570 new->next = NULL; in insert_node()
963 struct b_node *next = b->next; in jffs2_1pass_list_inodes() local
965 if (!next) in jffs2_1pass_list_inodes()
976 b = next; in jffs2_1pass_list_inodes()
1134 b2 = b2->next; in jffs2_1pass_resolve_inode()
1224 b = b->next; in jffs2_1pass_rescan_needed()
1426 b = b->next; in dump_fragments()
1457 b = b->next; in dump_dirents()
[all …]
|
| A D | jffs2_private.h | 8 struct b_node *next; member
|
| /fs/ubifs/ |
| A D | ubifs.c | 510 char *next; in ubifs_findfile() local
537 next = strchr(name, '/'); in ubifs_findfile()
538 if (next) { in ubifs_findfile()
540 while (*next == '/') in ubifs_findfile()
541 *(next++) = '\0'; in ubifs_findfile()
568 next = name = link_name + 1; in ubifs_findfile()
575 link_name, next == NULL ? "" : next); in ubifs_findfile()
577 next = name = symlinkpath; in ubifs_findfile()
587 if (!next || *next == '\0') { in ubifs_findfile()
593 name = next; in ubifs_findfile()
|
| A D | replay.c | 482 struct ubifs_bud *next; in is_last_bud() local
516 next = list_entry(bud->list.next, struct ubifs_bud, list); in is_last_bud()
517 if (!list_is_last(&next->list, &jh->buds_list)) in is_last_bud()
520 err = ubifs_leb_read(c, next->lnum, (char *)&data, next->start, 4, 1); in is_last_bud()
723 b = list_entry(c->replay_buds.next, struct bud_entry, list); in destroy_bud_list()
849 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list); in replay_log_leb()
|
| A D | gc.c | 513 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list); in ubifs_garbage_collect_leb()
949 idx_gc = list_entry(c->idx_gc.next, struct ubifs_gced_idx_leb, in ubifs_destroy_idx_gc()
970 idx_gc = list_entry(c->idx_gc.next, struct ubifs_gced_idx_leb, list); in ubifs_get_idx_gc_leb()
|
| A D | debug.c | 2384 for (cur = head->next; cur->next != head; cur = cur->next) { in dbg_check_data_nodes_order()
2390 sb = container_of(cur->next, struct ubifs_scan_node, list); in dbg_check_data_nodes_order()
2451 for (cur = head->next; cur->next != head; cur = cur->next) { in dbg_check_nondata_nodes_order()
2457 sb = container_of(cur->next, struct ubifs_scan_node, list); in dbg_check_nondata_nodes_order()
|
| A D | scan.c | 367 node = list_entry(head->next, struct ubifs_scan_node, list); in ubifs_scan_destroy()
|
| A D | lprops.c | 794 lprops = list_entry(c->empty_list.next, struct ubifs_lprops, list); in ubifs_fast_find_empty()
817 lprops = list_entry(c->freeable_list.next, struct ubifs_lprops, list); in ubifs_fast_find_freeable()
841 lprops = list_entry(c->frdi_idx_list.next, struct ubifs_lprops, list); in ubifs_fast_find_frdi_idx()
|
| /fs/cbfs/ |
| A D | cbfs.c | 100 node->next = NULL; in fill_node()
197 cache_node = cache_node->next; in file_cbfs_fill_cache()
220 cache_tail = &node->next; in file_cbfs_fill_cache()
375 *filep = (*filep)->next; in cbfs_get_next()
402 *file = (*file)->next; in file_cbfs_get_next()
419 cache_node = cache_node->next; in cbfs_find_file()
|
| /fs/fat/ |
| A D | fat.c | 1120 const char *next; in fat_itr_resolve() local
1134 next = path; in fat_itr_resolve()
1135 while (next[0] && !ISDIRDELIM(next[0])) in fat_itr_resolve()
1136 next++; in fat_itr_resolve()
1140 if ((((next - path) == 1) && !strncmp(path, ".", 1)) || in fat_itr_resolve()
1141 (((next - path) == 2) && !strncmp(path, "..", 2))) { in fat_itr_resolve()
1150 if (next[0] == 0) { in fat_itr_resolve()
1157 return fat_itr_resolve(itr, next, type); in fat_itr_resolve()
1178 return fat_itr_resolve(itr, next, type); in fat_itr_resolve()
1179 } else if (next[0]) { in fat_itr_resolve()
[all …]
|
| /fs/ext4/ |
| A D | ext4_journal.c | 239 tmp_node->next = NULL; in _get_node()
268 prev_node->next = node; in ext4fs_push_revoke_blk()
280 tmp_node = tmp_node->next; in ext4fs_free_revoke_blks()
285 next_node = tmp_node->next; in ext4fs_free_revoke_blks()
319 tmp_revk_node = tmp_revk_node->next; in check_blknr_for_revoke()
|
| A D | ext4_journal.h | 112 struct revoke_blk_list *next; member
|
| A D | ext4_common.c | 2192 char *next; in ext4fs_find_file1() local
2213 next = strchr(name, '/'); in ext4fs_find_file1()
2214 if (next) { in ext4fs_find_file1()
2216 while (*next == '/') in ext4fs_find_file1()
2217 *(next++) = '\0'; in ext4fs_find_file1()
2276 if (!next || *next == '\0') { in ext4fs_find_file1()
2281 name = next; in ext4fs_find_file1()
|
| /fs/sandbox/ |
| A D | sandboxfs.c | 94 for (node = head; node; node = node->next) { in sandbox_fs_ls()
|
| /fs/zfs/ |
| A D | zfs.c | 1172 struct dnode_chain *next; in dnode_get_path() member
1180 dn_new->next = 0; in dnode_get_path()
1234 if (dn_new->next) { in dnode_get_path()
1236 dnode_path = dn_new->next; in dnode_get_path()
1263 dn_new->next = dnode_path; in dnode_get_path()
1278 dn_new = dnode_path->next; in dnode_get_path()
|