Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 25 of 79) sorted by relevance

1234

/fs/bcachefs/
A Dbtree_node_scan.c46 darray_for_each(nodes, i) { in found_btree_nodes_to_text()
379 if (f->nodes.nr) in bch2_scan_for_btree_nodes()
388 if (!f->nodes.nr) { in bch2_scan_for_btree_nodes()
401 …sort_nonatomic(f->nodes.data, f->nodes.nr, sizeof(f->nodes.data[0]), found_btree_node_cmp_cookie, … in bch2_scan_for_btree_nodes()
419 f->nodes.nr = dst; in bch2_scan_for_btree_nodes()
421 …sort_nonatomic(f->nodes.data, f->nodes.nr, sizeof(f->nodes.data[0]), found_btree_node_cmp_pos, NUL… in bch2_scan_for_btree_nodes()
430 swap(nodes_heap, f->nodes); in bch2_scan_for_btree_nodes()
466 for (struct found_btree_node *n = f->nodes.data; n < &darray_last(f->nodes); n++) in bch2_scan_for_btree_nodes()
478 …eytzinger0_sort(f->nodes.data, f->nodes.nr, sizeof(f->nodes.data[0]), found_btree_node_cmp_pos, NU… in bch2_scan_for_btree_nodes()
496 for (size_t _idx = eytzinger0_find_gt((_f)->nodes.data, (_f)->nodes.nr, \
[all …]
/fs/btrfs/
A Dctree.c166 if (!p->nodes[i]) in btrfs_release_path()
173 p->nodes[i] = NULL; in btrfs_release_path()
1673 eb = path->nodes[0]; in btrfs_find_item()
1762 p->nodes[level] = b; in btrfs_search_slot_get_root()
2446 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
2560 t = path->nodes[i]; in fixup_low_keys()
2586 eb = path->nodes[0]; in btrfs_set_item_key_safe()
3252 if (!path->nodes[1]) in push_leaf_right()
3466 if (!path->nodes[1]) in push_leaf_left()
3660 l = path->nodes[0]; in split_leaf()
[all …]
A Dinode-item.c145 leaf = path->nodes[0]; in btrfs_del_inode_extref()
205 leaf = path->nodes[0]; in btrfs_del_inode_ref()
267 if (btrfs_find_name_in_ext_backref(path->nodes[0], in btrfs_insert_inode_extref()
279 leaf = path->nodes[0]; in btrfs_insert_inode_extref()
327 ref = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_insert_inode_ref()
331 btrfs_set_inode_ref_index(path->nodes[0], ref, index); in btrfs_insert_inode_ref()
336 if (btrfs_find_name_in_backref(path->nodes[0], in btrfs_insert_inode_ref()
345 ref = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_insert_inode_ref()
348 btrfs_set_inode_ref_index(path->nodes[0], ref, index); in btrfs_insert_inode_ref()
399 leaf = path->nodes[0]; in btrfs_lookup_inode()
[all …]
A Dfile-item.c181 leaf = path->nodes[0]; in btrfs_insert_hole_extent()
220 leaf = path->nodes[0]; in btrfs_lookup_csum()
295 if (path->nodes[0]) { in search_csum_tree()
491 leaf = path->nodes[0]; in btrfs_lookup_csums_list()
520 leaf = path->nodes[0]; in btrfs_lookup_csums_list()
629 if (path->nodes[0]) { in btrfs_lookup_csums_bitmap()
647 leaf = path->nodes[0]; in btrfs_lookup_csums_bitmap()
677 leaf = path->nodes[0]; in btrfs_lookup_csums_bitmap()
832 leaf = path->nodes[0]; in truncate_one_csum()
1140 leaf = path->nodes[0]; in btrfs_csum_file_blocks()
[all …]
A Dulist.c50 INIT_LIST_HEAD(&ulist->nodes); in ulist_init()
69 list_for_each_entry_safe(node, next, &ulist->nodes, list) { in ulist_release()
75 INIT_LIST_HEAD(&ulist->nodes); in ulist_release()
232 list_add_tail(&node->list, &ulist->nodes); in ulist_add_merge()
287 if (list_empty(&ulist->nodes)) in ulist_next()
289 if (uiter->cur_list && uiter->cur_list->next == &ulist->nodes) in ulist_next()
294 uiter->cur_list = ulist->nodes.next; in ulist_next()
A Dfiemap.c308 struct extent_buffer *clone = path->nodes[0]; in fiemap_next_leaf_item()
314 if (path->slots[0] < btrfs_header_nritems(path->nodes[0])) in fiemap_next_leaf_item()
333 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in fiemap_next_leaf_item()
349 clone->start = path->nodes[0]->start; in fiemap_next_leaf_item()
351 copy_extent_buffer_full(clone, path->nodes[0]); in fiemap_next_leaf_item()
355 path->nodes[0] = clone; in fiemap_next_leaf_item()
419 clone = btrfs_clone_extent_buffer(path->nodes[0]); in fiemap_search_slot()
425 path->nodes[0] = clone; in fiemap_search_slot()
584 leaf = path->nodes[0]; in fiemap_find_last_extent_offset()
620 leaf = path->nodes[0]; in fiemap_find_last_extent_offset()
[all …]
A Dtree-log.c427 dst_eb = path->nodes[0]; in overwrite_item()
516 dst_eb = path->nodes[0]; in overwrite_item()
929 leaf = path->nodes[0]; in drop_one_dir_item()
1314 eb = path->nodes[0]; in unlink_old_inode_refs()
1555 leaf = path->nodes[0]; in count_inode_extrefs()
2170 eb = path->nodes[0]; in check_item_in_log()
3775 src = path->nodes[0]; in process_dir_items_leaf()
4805 leaf = path->nodes[0]; in log_one_extent()
4866 leaf = path->nodes[0]; in btrfs_log_prealloc_extents()
4886 leaf = path->nodes[0]; in btrfs_log_prealloc_extents()
[all …]
A Dsend.c1126 eb = path->nodes[0]; in iterate_dir_item()
2519 leaf = path->nodes[0]; in send_subvol_begin()
2742 eb = path->nodes[0]; in send_utimes()
5791 leaf = path->nodes[0]; in send_capabilities()
6186 eb = left_path->nodes[0]; in is_extent_unchanged()
6235 eb = path->nodes[0]; in is_extent_unchanged()
6318 eb = path->nodes[0]; in is_extent_unchanged()
7164 leaf = path->nodes[0]; in compare_refs()
7228 if (left_path->nodes[0]) in changed_cb()
7404 path->nodes[level] = clone; in replace_node_with_clone()
[all …]
A Dfree-space-tree.c87 leaf = path->nodes[0]; in add_new_free_space_info()
121 return btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_search_free_space_info()
241 leaf = path->nodes[0]; in btrfs_convert_free_space_to_bitmaps()
287 leaf = path->nodes[0]; in btrfs_convert_free_space_to_bitmaps()
328 leaf = path->nodes[0]; in btrfs_convert_free_space_to_bitmaps()
384 leaf = path->nodes[0]; in btrfs_convert_free_space_to_extents()
436 leaf = path->nodes[0]; in btrfs_convert_free_space_to_extents()
528 leaf = path->nodes[0]; in btrfs_free_space_test_bit()
554 leaf = path->nodes[0]; in free_space_modify_bits()
1248 nr = btrfs_header_nritems(path->nodes[0]); in clear_free_space_tree()
[all …]
A Dextent-tree.c459 leaf = path->nodes[0]; in lookup_extent_data_ref()
470 leaf = path->nodes[0]; in lookup_extent_data_ref()
527 leaf = path->nodes[0]; in insert_extent_data_ref()
554 leaf = path->nodes[0]; in insert_extent_data_ref()
587 leaf = path->nodes[0]; in remove_extent_data_ref()
630 leaf = path->nodes[0]; in extent_data_ref_count()
846 leaf = path->nodes[0]; in lookup_inline_extent_backref()
1006 leaf = path->nodes[0]; in setup_inline_extent_backref()
1514 leaf = path->nodes[0]; in __btrfs_inc_extent_ref()
1692 leaf = path->nodes[0]; in run_delayed_extent_op()
[all …]
A Dqgroup.c426 l = path->nodes[0]; in btrfs_read_qgroup_config()
540 l = path->nodes[0]; in btrfs_read_qgroup_config()
742 leaf = path->nodes[0]; in add_qgroup_item()
759 leaf = path->nodes[0]; in add_qgroup_item()
846 l = path->nodes[0]; in update_qgroup_limit_item()
889 l = path->nodes[0]; in update_qgroup_info_item()
928 l = path->nodes[0]; in update_qgroup_status_item()
965 leaf = path->nodes[0]; in btrfs_clean_quota_tree()
1089 leaf = path->nodes[0]; in btrfs_quota_enable()
1121 leaf = path->nodes[0]; in btrfs_quota_enable()
[all …]
A Droot-tree.c98 l = path->nodes[0]; in btrfs_find_root()
157 l = path->nodes[0]; in btrfs_update_root()
188 l = path->nodes[0]; in btrfs_update_root()
242 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
249 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
366 leaf = path->nodes[0]; in btrfs_del_root_ref()
442 leaf = path->nodes[0]; in btrfs_add_root_ref()
A Dreflink.c197 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { in clone_copy_inline_extent()
204 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in clone_copy_inline_extent()
217 ei = btrfs_item_ptr(path->nodes[0], path->slots[0], in clone_copy_inline_extent()
224 if (btrfs_file_extent_type(path->nodes[0], ei) == in clone_copy_inline_extent()
281 write_extent_buffer(path->nodes[0], inline_data, in clone_copy_inline_extent()
282 btrfs_item_ptr_offset(path->nodes[0], in clone_copy_inline_extent()
394 btrfs_item_key_to_cpu(path->nodes[0], &key, in btrfs_clone()
400 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
408 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
410 leaf = path->nodes[0]; in btrfs_clone()
A Dbackref.c487 eb = path->nodes[level]; in add_all_parents()
504 eb = path->nodes[0]; in add_all_parents()
515 eb = path->nodes[0]; in add_all_parents()
676 eb = path->nodes[level]; in resolve_indirect_ref()
683 eb = path->nodes[level]; in resolve_indirect_ref()
1025 leaf = path->nodes[0]; in add_inline_refs()
1161 leaf = path->nodes[0]; in add_keyed_refs()
1478 leaf = path->nodes[0]; in find_parent_nodes()
2064 leaf = path->nodes[0]; in btrfs_find_one_extref()
2165 eb = path->nodes[0]; in btrfs_ref_to_path()
[all …]
A Ddir-item.c44 leaf = path->nodes[0]; in insert_with_overflow()
83 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
145 leaf = path->nodes[0]; in btrfs_insert_dir_item()
269 leaf = path->nodes[0]; in btrfs_check_dir_item_collision()
381 leaf = path->nodes[0]; in btrfs_match_dir_item_name()
417 leaf = path->nodes[0]; in btrfs_delete_one_dir_name()
A Draid-stripe-tree.c36 leaf = path->nodes[0]; in btrfs_partially_delete_raid_extent()
108 if (path->slots[0] == btrfs_header_nritems(path->nodes[0])) in btrfs_delete_raid_extent()
111 leaf = path->nodes[0]; in btrfs_delete_raid_extent()
141 leaf = path->nodes[0]; in btrfs_delete_raid_extent()
286 leaf = path->nodes[0]; in update_raid_extent_item()
412 leaf = path->nodes[0]; in btrfs_get_raid_extent_offset()
A Drelocation.c843 leaf = path->nodes[0]; in get_new_location()
1274 path->nodes[i] = NULL; in walk_up_reloc_tree()
1278 eb = path->nodes[i]; in walk_up_reloc_tree()
1290 path->nodes[i] = NULL; in walk_up_reloc_tree()
1311 eb = path->nodes[i]; in walk_down_reloc_tree()
1334 path->nodes[i - 1] = eb; in walk_down_reloc_tree()
3071 eb = path->nodes[0]; in add_tree_block()
3389 leaf = path->nodes[0]; in find_next_extent()
3573 path->nodes[0], in relocate_block_group()
3702 leaf = path->nodes[0]; in __insert_orphan_inode()
[all …]
A Duuid-tree.c57 eb = path->nodes[0]; in btrfs_uuid_tree_lookup()
120 eb = path->nodes[0]; in btrfs_uuid_tree_add()
129 eb = path->nodes[0]; in btrfs_uuid_tree_add()
188 eb = path->nodes[0]; in btrfs_uuid_tree_remove()
327 leaf = path->nodes[0]; in btrfs_uuid_tree_iterate()
437 eb = path->nodes[0]; in btrfs_uuid_scan_kthread()
A Dref-verify.c422 struct extent_buffer *leaf = path->nodes[0]; in process_extent_item()
495 struct extent_buffer *leaf = path->nodes[0]; in process_leaf()
554 eb = btrfs_read_node_slot(path->nodes[level], in walk_down_tree()
559 path->nodes[level-1] = eb; in walk_down_tree()
579 if (!path->nodes[l]) in walk_up_tree()
584 btrfs_header_nritems(path->nodes[l])) { in walk_up_tree()
589 btrfs_tree_unlock_rw(path->nodes[l], path->locks[l]); in walk_up_tree()
590 free_extent_buffer(path->nodes[l]); in walk_up_tree()
591 path->nodes[l] = NULL; in walk_up_tree()
990 path->nodes[level] = eb; in btrfs_build_ref_tree()
A Ddefrag.c496 if (!path->nodes[1]) { in btrfs_defrag_leaves()
507 path->nodes[1], 0, in btrfs_defrag_leaves()
523 path->slots[1] = btrfs_header_nritems(path->nodes[1]); in btrfs_defrag_leaves()
640 if (path.slots[0] >= btrfs_header_nritems(path.nodes[0])) { in defrag_get_extent()
646 ASSERT(btrfs_header_nritems(path.nodes[0])); in defrag_get_extent()
647 path.slots[0] = btrfs_header_nritems(path.nodes[0]) - 1; in defrag_get_extent()
649 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]); in defrag_get_extent()
657 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]); in defrag_get_extent()
667 if (path.slots[0] >= btrfs_header_nritems(path.nodes[0])) in defrag_get_extent()
670 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]); in defrag_get_extent()
[all …]
/fs/jffs2/
A DREADME.Locking22 When writing new nodes, the alloc_sem must be held until the new nodes
25 nodes to an inode may obsolete old ones, and by holding the alloc_sem
28 was written afterwards. Hence, we can ensure the newly-obsoleted nodes
76 (NB) the per-inode list of physical nodes. The latter is a special
84 Note that the per-inode list of physical nodes (f->nodes) is a special
85 case. Any changes to _valid_ nodes (i.e. ->flash_offset & 1 == 0) in
87 may remove _obsolete_ nodes from the list while holding only the
126 The latter function on NAND flash must read _obsolete_ nodes to
/fs/dlm/
A Dmember.c544 if (rv->nodes[i].nodeid == nodeid) in find_config_node()
545 return &rv->nodes[i]; in find_config_node()
593 node = &rv->nodes[i]; in dlm_recover_members()
715 struct dlm_config_node *nodes = NULL; in dlm_ls_start() local
722 error = dlm_config_nodes(ls->ls_name, &nodes, &count); in dlm_ls_start()
737 rv->nodes = nodes; in dlm_ls_start()
747 kfree(rv_old->nodes); in dlm_ls_start()
756 kfree(nodes); in dlm_ls_start()
/fs/btrfs/tests/
A Dqgroup-tests.c48 leaf = path->nodes[0]; in insert_normal_tree_ref()
97 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in add_tree_ref()
99 refs = btrfs_extent_refs(path->nodes[0], item); in add_tree_ref()
100 btrfs_set_extent_refs(path->nodes[0], item, refs + 1); in add_tree_ref()
179 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in remove_extent_ref()
181 refs = btrfs_extent_refs(path->nodes[0], item); in remove_extent_ref()
182 btrfs_set_extent_refs(path->nodes[0], item, refs - 1); in remove_extent_ref()
A Dfree-space-tree-tests.c41 flags = btrfs_free_space_flags(path->nodes[0], info); in __check_free_space_extents()
42 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); in __check_free_space_extents()
54 while (++path->slots[0] < btrfs_header_nritems(path->nodes[0])) { in __check_free_space_extents()
55 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in __check_free_space_extents()
84 if (btrfs_header_nritems(path->nodes[0]) != num_extents + 1 || in __check_free_space_extents()
89 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in __check_free_space_extents()
124 flags = btrfs_free_space_flags(path->nodes[0], info); in check_free_space_extents()
/fs/ubifs/
A Dgc.c237 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
280 list_sort(c, &sleb->nodes, &data_nodes_cmp); in sort_nodes()
283 err = dbg_check_data_nodes_order(c, &sleb->nodes); in sort_nodes()
357 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in move_nodes()
436 if (list_empty(&sleb->nodes) && list_empty(&nondata)) in move_nodes()
451 list_splice_tail(&nondata, &sleb->nodes); in move_nodes()
542 ubifs_assert(c, !list_empty(&sleb->nodes)); in ubifs_garbage_collect_leb()
543 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list); in ubifs_garbage_collect_leb()
550 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_garbage_collect_leb()

Completed in 117 milliseconds

1234