| /fs/btrfs/ |
| A D | inode.c | 41 fi = btrfs_item_ptr(path.nodes[0], path.slots[0], in btrfs_readlink()
43 if (btrfs_file_extent_type(path.nodes[0], fi) != in btrfs_readlink()
49 if (btrfs_file_extent_compression(path.nodes[0], fi) != in btrfs_readlink()
55 if (btrfs_file_extent_ram_bytes(path.nodes[0], fi) >= in btrfs_readlink()
62 read_extent_buffer(path.nodes[0], target, in btrfs_readlink()
64 btrfs_file_extent_ram_bytes(path.nodes[0], fi)); in btrfs_readlink()
65 ret = btrfs_file_extent_ram_bytes(path.nodes[0], fi); in btrfs_readlink()
364 struct extent_buffer *leaf = path->nodes[0]; in btrfs_read_extent_inline()
424 struct extent_buffer *leaf = path->nodes[0]; in btrfs_read_extent_reg()
626 struct extent_buffer *leaf = path->nodes[0]; in read_and_truncate_page()
[all …]
|
| A D | ctree.c | 66 if (!p->nodes[i]) in btrfs_release_path()
352 eb = path->nodes[0]; in btrfs_find_item()
357 eb = path->nodes[0]; in btrfs_find_item()
426 p->nodes[level] = b; in btrfs_search_slot()
514 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
537 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
618 c = path->nodes[level]; in btrfs_prev_leaf()
638 c = path->nodes[level]; in btrfs_prev_leaf()
679 c = path->nodes[level]; in btrfs_next_sibling_tree_block()
695 c = path->nodes[level]; in btrfs_next_sibling_tree_block()
[all …]
|
| A D | subvolume.c | 55 iref = btrfs_item_ptr(path.nodes[0], path.slots[0], in get_path_in_subvol()
57 name_len = btrfs_inode_ref_name_len(path.nodes[0], in get_path_in_subvol()
63 read_extent_buffer(path.nodes[0], path_ret, in get_path_in_subvol()
69 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]); in get_path_in_subvol()
118 rr = btrfs_item_ptr(path.nodes[0], path.slots[0], in list_one_subvol()
121 name_len = btrfs_root_ref_name_len(path.nodes[0], rr); in list_one_subvol()
126 ino = btrfs_root_ref_dirid(path.nodes[0], rr); in list_one_subvol()
127 read_extent_buffer(path.nodes[0], path_ret, in list_one_subvol()
134 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]); in list_one_subvol()
187 if (path.slots[0] >= btrfs_header_nritems(path.nodes[0])) in list_subvolums()
[all …]
|
| A D | dir-item.c | 51 leaf = path->nodes[0]; in btrfs_match_dir_item_name()
106 leaf = path->nodes[0]; in btrfs_lookup_dir_item()
137 if (path.slots[0] >= btrfs_header_nritems(path.nodes[0])) { in btrfs_iter_dir()
149 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]); in btrfs_iter_dir()
152 di = btrfs_item_ptr(path.nodes[0], path.slots[0], in btrfs_iter_dir()
154 if (verify_dir_item(root, path.nodes[0], di)) { in btrfs_iter_dir()
158 ret = callback(root, path.nodes[0], di); in btrfs_iter_dir()
|
| A D | btrfs.c | 70 read_extent_buffer(path.nodes[0], &ii, in show_dir()
71 btrfs_item_ptr_offset(path.nodes[0], path.slots[0]), in show_dir()
218 ii = btrfs_item_ptr(path.nodes[0], path.slots[0], in btrfs_size()
220 *size = btrfs_inode_size(path.nodes[0], ii); in btrfs_size()
|
| A D | root-tree.c | 32 l = path->nodes[0]; in btrfs_find_last_root()
|
| A D | disk-io.c | 674 l = path->nodes[0]; in btrfs_read_fs_root_no_cache()
829 btrfs_dir_item_key_to_cpu(path.nodes[0], dir_item, key_ret); in get_default_subvolume()
|
| A D | ctree.h | 56 struct extent_buffer *nodes[BTRFS_MAX_LEVEL]; member
1270 if (p->slots[0] >= btrfs_header_nritems(p->nodes[0])) in btrfs_next_item()
|
| A D | volumes.c | 766 leaf = path->nodes[0]; in btrfs_read_chunk_tree()
|
| /fs/ubifs/ |
| A D | gc.c | 248 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
290 list_sort(c, &sleb->nodes, &data_nodes_cmp); in sort_nodes()
293 err = dbg_check_data_nodes_order(c, &sleb->nodes); in sort_nodes()
367 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in move_nodes()
406 if (list_empty(&sleb->nodes) && list_empty(&nondata)) in move_nodes()
421 list_splice_tail(&nondata, &sleb->nodes); in move_nodes()
512 ubifs_assert(!list_empty(&sleb->nodes)); in ubifs_garbage_collect_leb()
513 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list); in ubifs_garbage_collect_leb()
520 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_garbage_collect_leb()
|
| A D | scan.c | 144 INIT_LIST_HEAD(&sleb->nodes); in ubifs_start_scan()
219 list_add_tail(&snod->list, &sleb->nodes); in ubifs_add_snod()
365 head = &sleb->nodes; in ubifs_scan_destroy()
|
| A D | recovery.c | 505 if (!list_empty(&sleb->nodes)) { in fix_unclean_leb()
508 snod = list_entry(sleb->nodes.prev, in fix_unclean_leb()
574 while (!list_empty(&sleb->nodes)) { in drop_last_group()
578 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in drop_last_group()
605 if (!list_empty(&sleb->nodes)) { in drop_last_node()
606 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in drop_last_node()
888 snod = list_entry(sleb->nodes.next, in ubifs_recover_log_leb()
|
| A D | replay.c | 581 list_for_each_entry(snod, &sleb->nodes, list) { in replay_bud()
849 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list); in replay_log_leb()
893 list_for_each_entry(snod, &sleb->nodes, list) { in replay_log_leb()
|
| A D | master.c | 44 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in scan_for_master()
62 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list); in scan_for_master()
|
| A D | orphan.c | 561 list_for_each_entry(snod, &sleb->nodes, list) { in do_kill_orphans()
854 list_for_each_entry(snod, &sleb->nodes, list) { in dbg_read_orphans()
|
| A D | log.c | 647 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_consolidate_log()
|
| A D | lprops.c | 1120 list_for_each_entry(snod, &sleb->nodes, list) { in scan_check_cb()
|
| A D | ubifs.h | 919 struct list_head nodes; member
|
| A D | debug.c | 827 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_dump_sleb()
860 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_dump_leb()
|
| /fs/jffs2/ |
| A D | jffs2_1pass.c | 509 struct b_node nodes[NODE_CHUNK]; member
552 b = &memBase->nodes[index]; in add_node()
|