/linux-master/fs/btrfs/ |
H A D | file-item.c | 179 leaf = path->nodes[0]; 221 leaf = path->nodes[0]; 296 if (path->nodes[0]) { 297 item = btrfs_item_ptr(path->nodes[0], path->slots[0], 299 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 300 itemsize = btrfs_item_size(path->nodes[0], path->slots[0]); 317 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 318 itemsize = btrfs_item_size(path->nodes[0], path->slots[0]); 327 read_extent_buffer(path->nodes[0], dst, (unsigned long)item, 495 leaf = path->nodes[ [all...] |
H A D | file.c | 256 leaf = path->nodes[0]; 264 leaf = path->nodes[0]; 274 leaf = path->nodes[0]; 359 leaf = path->nodes[0]; 525 leaf = path->nodes[0]; 640 leaf = path->nodes[0]; 738 leaf = path->nodes[0]; 2286 leaf = path->nodes[0]; 2455 leaf = path->nodes[0]; 3722 btrfs_item_key_to_cpu(path->nodes[ [all...] |
H A D | free-space-cache.c | 107 leaf = path->nodes[0]; 185 leaf = path->nodes[0]; 214 leaf = path->nodes[0]; 771 leaf = path->nodes[0]; 1169 leaf = path->nodes[0]; 2806 * Since the allocation info of tree-log nodes are not recorded 2813 * Advance the pointer not to overwrite the tree-log nodes.
|
H A D | free-space-tree.c | 87 leaf = path->nodes[0]; 125 return btrfs_item_ptr(path->nodes[0], path->slots[0], 242 leaf = path->nodes[0]; 285 leaf = path->nodes[0]; 323 leaf = path->nodes[0]; 379 leaf = path->nodes[0]; 428 leaf = path->nodes[0]; 493 flags = btrfs_free_space_flags(path->nodes[0], info); 494 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); 497 btrfs_set_free_space_extent_count(path->nodes[ [all...] |
H A D | inode-item.c | 101 return btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], 141 extref = btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], 149 leaf = path->nodes[0]; 210 ref = btrfs_find_name_in_backref(path->nodes[0], path->slots[0], name); 216 leaf = path->nodes[0]; 278 if (btrfs_find_name_in_ext_backref(path->nodes[0], 290 leaf = path->nodes[0]; 295 btrfs_set_inode_extref_name_len(path->nodes[0], extref, name->len); 296 btrfs_set_inode_extref_index(path->nodes[0], extref, index); 297 btrfs_set_inode_extref_parent(path->nodes[ [all...] |
H A D | inode.c | 178 eb = warn->path.nodes[0]; 279 eb = path.nodes[0]; 562 leaf = path->nodes[0]; 1865 * if path->nodes[0] is NULL or not if it needs to use the path afterwards. 1877 struct extent_buffer *leaf = path->nodes[0]; 2040 leaf = path->nodes[0]; 2050 leaf = path->nodes[0]; 2057 leaf = path->nodes[0]; 2138 if (!path->nodes[0]) 2966 leaf = path->nodes[ [all...] |
H A D | ioctl.c | 1588 leaf = path->nodes[0]; 1883 l = path->nodes[0]; 1968 leaf = path->nodes[0]; 1994 leaf = path->nodes[0]; 2053 leaf = path->nodes[0]; 2233 btrfs_header_nritems(path->nodes[0])) { 2243 leaf = path->nodes[0]; 2316 btrfs_header_nritems(path->nodes[0])) { 2326 leaf = path->nodes[0]; 3014 btrfs_set_dir_item_key(path->nodes[ [all...] |
H A D | locking.c | 28 * Lock-nesting across peer nodes is always done with the immediate parent 223 * btrfs_search_slot will keep the lock held on higher nodes in a few corner 236 if (!path->nodes[i]) 240 btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]);
|
H A D | props.c | 170 leaf = path->nodes[0];
|
H A D | qgroup.c | 432 l = path->nodes[0]; 531 l = path->nodes[0]; 668 btrfs_mark_buffer_dirty(trans, path->nodes[0]); 737 leaf = path->nodes[0]; 756 leaf = path->nodes[0]; 845 l = path->nodes[0]; 891 l = path->nodes[0]; 933 l = path->nodes[0]; 973 leaf = path->nodes[0]; 1107 leaf = path->nodes[ [all...] |
H A D | raid-stripe-tree.c | 51 leaf = path->nodes[0]; 192 leaf = path->nodes[0];
|
H A D | ref-verify.c | 440 struct extent_buffer *leaf = path->nodes[0]; 508 struct extent_buffer *leaf = path->nodes[0]; 567 eb = btrfs_read_node_slot(path->nodes[level], 572 path->nodes[level-1] = eb; 592 if (!path->nodes[l]) 597 btrfs_header_nritems(path->nodes[l])) { 602 btrfs_tree_unlock_rw(path->nodes[l], path->locks[l]); 603 free_extent_buffer(path->nodes[l]); 604 path->nodes[l] = NULL; 1002 path->nodes[leve [all...] |
H A D | reflink.c | 199 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { 206 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 219 ei = btrfs_item_ptr(path->nodes[0], path->slots[0], 226 if (btrfs_file_extent_type(path->nodes[0], ei) == 279 write_extent_buffer(path->nodes[0], inline_data, 280 btrfs_item_ptr_offset(path->nodes[0], 392 btrfs_item_key_to_cpu(path->nodes[0], &key, 398 nritems = btrfs_header_nritems(path->nodes[0]); 406 nritems = btrfs_header_nritems(path->nodes[0]); 408 leaf = path->nodes[ [all...] |
H A D | relocation.c | 157 /* size of relocated tree nodes */ 187 * walk up backref nodes until reach node presents tree root 208 * walk down backref nodes to find start of next reference path 263 * detached nodes are used to avoid unnecessary backref 265 * so the detached nodes are no longer useful. 282 * some nodes can be left in the pending list if there were 283 * errors during processing the pending nodes. 376 * For useless nodes, do two major clean ups: 378 * - Cleanup the children edges and nodes 382 * - Freeing up leaves (level 0), keeps nodes detache [all...] |
H A D | root-tree.c | 98 l = path->nodes[0]; 157 l = path->nodes[0]; 188 l = path->nodes[0]; 200 btrfs_mark_buffer_dirty(trans, path->nodes[0]); 243 leaf = path->nodes[0]; 250 leaf = path->nodes[0]; 367 leaf = path->nodes[0]; 443 leaf = path->nodes[0];
|
H A D | scrub.c | 423 eb = swarn->path->nodes[0]; 513 eb = path->nodes[0]; 1336 struct btrfs_fs_info *fs_info = path->nodes[0]->fs_info; 1340 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1380 if (path->nodes[0]) 1415 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1445 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 1450 *size_ret = path->nodes[0]->fs_info->nodesize; 1453 ei = btrfs_item_ptr(path->nodes[0], path->slots[0], struct btrfs_extent_item); 1454 *flags_ret = btrfs_extent_flags(path->nodes[ [all...] |
H A D | send.c | 99 * maple tree's internal nodes, is 24K. 165 * don't operate on stale extent buffers for nodes (level >= 1) or on 949 ii = btrfs_item_ptr(path->nodes[0], path->slots[0], 951 info->size = btrfs_inode_size(path->nodes[0], ii); 952 info->gen = btrfs_inode_generation(path->nodes[0], ii); 953 info->mode = btrfs_inode_mode(path->nodes[0], ii); 954 info->uid = btrfs_inode_uid(path->nodes[0], ii); 955 info->gid = btrfs_inode_gid(path->nodes[0], ii); 956 info->rdev = btrfs_inode_rdev(path->nodes[0], ii); 957 info->nlink = btrfs_inode_nlink(path->nodes[ [all...] |
H A D | super.c | 796 root_ref = btrfs_item_ptr(path->nodes[0], path->slots[0], 798 len = btrfs_root_ref_name_len(path->nodes[0], root_ref); 804 read_extent_buffer(path->nodes[0], ptr + 1, 807 dirid = btrfs_root_ref_dirid(path->nodes[0], root_ref); 836 inode_ref = btrfs_item_ptr(path->nodes[0], 839 len = btrfs_inode_ref_name_len(path->nodes[0], 846 read_extent_buffer(path->nodes[0], ptr + 1, 906 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &location);
|
H A D | tree-log.c | 200 * nodes from multiple log transactions to do sequential 407 u32 dst_size = btrfs_item_size(path->nodes[0], 427 dst_ptr = btrfs_item_ptr_offset(path->nodes[0], path->slots[0]); 428 read_extent_buffer(path->nodes[0], dst_copy, dst_ptr, 454 item = btrfs_item_ptr(path->nodes[0], path->slots[0], 456 nbytes = btrfs_inode_nbytes(path->nodes[0], item); 501 found_size = btrfs_item_size(path->nodes[0], 510 dst_ptr = btrfs_item_ptr_offset(path->nodes[0], 530 struct extent_buffer *dst_eb = path->nodes[0]; 548 S_ISDIR(btrfs_inode_mode(path->nodes[ [all...] |
H A D | ulist.c | 25 * for (all child nodes n in elem) 31 * This assumes the graph nodes are addressable by u64. This stems from the 50 INIT_LIST_HEAD(&ulist->nodes); 68 list_for_each_entry_safe(node, next, &ulist->nodes, list) { 72 INIT_LIST_HEAD(&ulist->nodes); 218 list_add_tail(&node->list, &ulist->nodes); 273 if (list_empty(&ulist->nodes)) 275 if (uiter->cur_list && uiter->cur_list->next == &ulist->nodes) 280 uiter->cur_list = ulist->nodes.next;
|
H A D | ulist.h | 42 struct list_head nodes; member in struct:ulist
|
/linux-master/fs/btrfs/tests/ |
H A D | extent-buffer-tests.c | 52 path->nodes[0] = eb;
|
H A D | free-space-tree-tests.c | 41 flags = btrfs_free_space_flags(path->nodes[0], info); 42 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); 54 while (++path->slots[0] < btrfs_header_nritems(path->nodes[0])) { 55 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 84 if (btrfs_header_nritems(path->nodes[0]) != num_extents + 1 || 89 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 124 flags = btrfs_free_space_flags(path->nodes[0], info);
|
H A D | inode-tests.c | 30 path.nodes[0] = leaf; 64 path.nodes[0] = leaf;
|
H A D | qgroup-tests.c | 48 leaf = path->nodes[0]; 97 item = btrfs_item_ptr(path->nodes[0], path->slots[0], 99 refs = btrfs_extent_refs(path->nodes[0], item); 100 btrfs_set_extent_refs(path->nodes[0], item, refs + 1); 179 item = btrfs_item_ptr(path->nodes[0], path->slots[0], 181 refs = btrfs_extent_refs(path->nodes[0], item); 182 btrfs_set_extent_refs(path->nodes[0], item, refs - 1);
|