Home
last modified time | relevance | path

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

1234

/linux-4.19.296/lib/
Dinterval_tree_test.c23 static struct interval_tree_node *nodes = NULL; variable
48 nodes[i].start = a; in init()
49 nodes[i].last = b; in init()
67 nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), in interval_tree_test_init()
69 if (!nodes) in interval_tree_test_init()
74 kfree(nodes); in interval_tree_test_init()
87 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
89 interval_tree_remove(nodes + j, &root); in interval_tree_test_init()
101 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
123 kfree(nodes); in interval_tree_test_init()
Drbtree_test.c27 static struct test_node *nodes = NULL; variable
168 nodes[i].key = prandom_u32_state(&rnd); in init()
169 nodes[i].val = prandom_u32_state(&rnd); in init()
250 nodes = kmalloc_array(nnodes, sizeof(*nodes), GFP_KERNEL); in rbtree_test_init()
251 if (!nodes) in rbtree_test_init()
263 insert(nodes + j, &root); in rbtree_test_init()
265 erase(nodes + j, &root); in rbtree_test_init()
279 insert_cached(nodes + j, &root); in rbtree_test_init()
281 erase_cached(nodes + j, &root); in rbtree_test_init()
292 insert(nodes + i, &root); in rbtree_test_init()
[all …]
/linux-4.19.296/fs/btrfs/
Dinode-item.c101 if (!btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_lookup_inode_extref()
145 if (!btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_del_inode_extref()
153 leaf = path->nodes[0]; in btrfs_del_inode_extref()
216 if (!btrfs_find_name_in_backref(path->nodes[0], path->slots[0], in btrfs_del_inode_ref()
222 leaf = path->nodes[0]; in btrfs_del_inode_ref()
285 if (btrfs_find_name_in_ext_backref(path->nodes[0], in btrfs_insert_inode_extref()
297 leaf = path->nodes[0]; in btrfs_insert_inode_extref()
303 btrfs_set_inode_extref_name_len(path->nodes[0], extref, name_len); in btrfs_insert_inode_extref()
304 btrfs_set_inode_extref_index(path->nodes[0], extref, index); in btrfs_insert_inode_extref()
305 btrfs_set_inode_extref_parent(path->nodes[0], extref, ref_objectid); in btrfs_insert_inode_extref()
[all …]
Dctree.c45 if (!p->nodes[i] || !p->locks[i]) in btrfs_set_path_blocking()
47 btrfs_set_lock_blocking_rw(p->nodes[i], p->locks[i]); in btrfs_set_path_blocking()
78 if (p->nodes[i] && p->locks[i]) { in btrfs_clear_path_blocking()
79 btrfs_clear_lock_blocking_rw(p->nodes[i], p->locks[i]); in btrfs_clear_path_blocking()
112 if (!p->nodes[i]) in btrfs_release_path()
115 btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]); in btrfs_release_path()
118 free_extent_buffer(p->nodes[i]); in btrfs_release_path()
119 p->nodes[i] = NULL; in btrfs_release_path()
1893 mid = path->nodes[level]; in balance_level()
1902 parent = path->nodes[level + 1]; in balance_level()
[all …]
Dulist.c49 INIT_LIST_HEAD(&ulist->nodes); in ulist_init()
66 list_for_each_entry_safe(node, next, &ulist->nodes, list) { in ulist_release()
70 INIT_LIST_HEAD(&ulist->nodes); in ulist_release()
212 list_add_tail(&node->list, &ulist->nodes); in ulist_add_merge()
265 if (list_empty(&ulist->nodes)) in ulist_next()
267 if (uiter->cur_list && uiter->cur_list->next == &ulist->nodes) in ulist_next()
272 uiter->cur_list = ulist->nodes.next; in ulist_next()
Dtree-log.c362 u32 dst_size = btrfs_item_size_nr(path->nodes[0], in overwrite_item()
382 dst_ptr = btrfs_item_ptr_offset(path->nodes[0], path->slots[0]); in overwrite_item()
383 read_extent_buffer(path->nodes[0], dst_copy, dst_ptr, in overwrite_item()
409 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in overwrite_item()
411 nbytes = btrfs_inode_nbytes(path->nodes[0], item); in overwrite_item()
456 found_size = btrfs_item_size_nr(path->nodes[0], in overwrite_item()
466 dst_ptr = btrfs_item_ptr_offset(path->nodes[0], in overwrite_item()
486 struct extent_buffer *dst_eb = path->nodes[0]; in overwrite_item()
510 S_ISDIR(btrfs_inode_mode(path->nodes[0], dst_item))) { in overwrite_item()
512 saved_i_size = btrfs_inode_size(path->nodes[0], in overwrite_item()
[all …]
Dfile-item.c54 leaf = path->nodes[0]; in btrfs_insert_file_extent()
96 leaf = path->nodes[0]; in btrfs_lookup_csum()
250 btrfs_item_key_to_cpu(path->nodes[0], &found_key, in __btrfs_lookup_bio_sums()
254 item_size = btrfs_item_size_nr(path->nodes[0], in __btrfs_lookup_bio_sums()
259 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in __btrfs_lookup_bio_sums()
271 read_extent_buffer(path->nodes[0], csum, in __btrfs_lookup_bio_sums()
340 leaf = path->nodes[0]; in btrfs_lookup_csums_range()
353 leaf = path->nodes[0]; in btrfs_lookup_csums_range()
360 leaf = path->nodes[0]; in btrfs_lookup_csums_range()
380 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_lookup_csums_range()
[all …]
Dfree-space-tree.c64 leaf = path->nodes[0]; in add_new_free_space_info()
101 return btrfs_item_ptr(path->nodes[0], path->slots[0], in search_free_space_info()
217 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
260 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
299 leaf = path->nodes[0]; in convert_free_space_to_bitmaps()
355 leaf = path->nodes[0]; in convert_free_space_to_extents()
404 leaf = path->nodes[0]; in convert_free_space_to_extents()
470 flags = btrfs_free_space_flags(path->nodes[0], info); in update_free_space_extent_count()
471 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); in update_free_space_extent_count()
474 btrfs_set_free_space_extent_count(path->nodes[0], info, extent_count); in update_free_space_extent_count()
[all …]
Ddir-item.c43 leaf = path->nodes[0]; in insert_with_overflow()
83 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
95 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_insert_xattr_item()
144 leaf = path->nodes[0]; in btrfs_insert_dir_item()
249 leaf = path->nodes[0]; in btrfs_check_dir_item_collision()
314 leaf = path->nodes[0]; in btrfs_search_dir_index_item()
324 leaf = path->nodes[0]; in btrfs_search_dir_index_item()
382 leaf = path->nodes[0]; in btrfs_match_dir_item_name()
418 leaf = path->nodes[0]; in btrfs_delete_one_dir_name()
Droot-tree.c88 l = path->nodes[0]; in btrfs_find_root()
148 l = path->nodes[0]; in btrfs_update_root()
179 l = path->nodes[0]; in btrfs_update_root()
191 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_update_root()
236 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
243 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
370 leaf = path->nodes[0]; in btrfs_del_root_ref()
446 leaf = path->nodes[0]; in btrfs_add_root_ref()
Dtree-defrag.c90 if (!path->nodes[1]) { in btrfs_defrag_leaves()
101 path->nodes[1], 0, in btrfs_defrag_leaves()
117 path->slots[1] = btrfs_header_nritems(path->nodes[1]); in btrfs_defrag_leaves()
Dsend.c829 ii = btrfs_item_ptr(path->nodes[0], path->slots[0], in __get_inode_info()
832 *size = btrfs_inode_size(path->nodes[0], ii); in __get_inode_info()
834 *gen = btrfs_inode_generation(path->nodes[0], ii); in __get_inode_info()
836 *mode = btrfs_inode_mode(path->nodes[0], ii); in __get_inode_info()
838 *uid = btrfs_inode_uid(path->nodes[0], ii); in __get_inode_info()
840 *gid = btrfs_inode_gid(path->nodes[0], ii); in __get_inode_info()
842 *rdev = btrfs_inode_rdev(path->nodes[0], ii); in __get_inode_info()
880 struct extent_buffer *eb = path->nodes[0]; in iterate_inode_ref()
1028 eb = path->nodes[0]; in iterate_dir_item()
1151 btrfs_item_key_to_cpu(p->nodes[0], &found_key, p->slots[0]); in get_inode_path()
[all …]
Duuid-tree.c53 eb = path->nodes[0]; in btrfs_uuid_tree_lookup()
116 eb = path->nodes[0]; in btrfs_uuid_tree_add()
125 eb = path->nodes[0]; in btrfs_uuid_tree_add()
187 eb = path->nodes[0]; in btrfs_uuid_tree_remove()
282 leaf = path->nodes[0]; in btrfs_uuid_tree_iterate()
Drelocation.c734 eb = path1->nodes[0]; in build_backref_tree()
745 eb = path1->nodes[0]; in build_backref_tree()
882 eb = path2->nodes[level]; in build_backref_tree()
896 if (!path2->nodes[level]) { in build_backref_tree()
912 eb = path2->nodes[level]; in build_backref_tree()
1576 leaf = path->nodes[0]; in get_new_location()
1724 btrfs_node_key(path->nodes[level], &key2, path->slots[level]); in memcmp_node_keys()
1764 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); in replace_path()
1808 eb = path->nodes[level]; in replace_path()
1862 btrfs_node_key_to_cpu(path->nodes[level], &key, in replace_path()
[all …]
Dref-verify.c448 struct extent_buffer *leaf = path->nodes[0]; in process_extent_item()
512 struct extent_buffer *leaf = path->nodes[0]; in process_leaf()
573 block_bytenr = btrfs_node_blockptr(path->nodes[level], in walk_down_tree()
575 gen = btrfs_node_ptr_generation(path->nodes[level], in walk_down_tree()
577 btrfs_node_key_to_cpu(path->nodes[level], &first_key, in walk_down_tree()
589 path->nodes[level-1] = eb; in walk_down_tree()
608 if (!path->nodes[l]) in walk_up_tree()
613 btrfs_header_nritems(path->nodes[l])) { in walk_up_tree()
618 btrfs_tree_unlock_rw(path->nodes[l], path->locks[l]); in walk_up_tree()
619 free_extent_buffer(path->nodes[l]); in walk_up_tree()
[all …]
Ddelayed-inode.h34 int nodes; /* for delayed nodes */ member
81 delayed_root->nodes = 0; in btrfs_init_delayed_root()
/linux-4.19.296/fs/jffs2/
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
DTODO24 By writing _new_ nodes to one block, and garbage-collected REF_PRISTINE
25 nodes to a different one, we can separate clean nodes from those which
/linux-4.19.296/drivers/misc/mic/scif/
Dscif_fd.c270 u16 *nodes; in scif_fdioctl() local
280 nodes = kmalloc_array(entries, sizeof(u16), GFP_KERNEL); in scif_fdioctl()
281 if (entries && !nodes) { in scif_fdioctl()
285 node_ids.len = scif_get_node_ids(nodes, entries, &self); in scif_fdioctl()
287 unodes = (void __user *)node_ids.nodes; in scif_fdioctl()
288 if (copy_to_user(unodes, nodes, sizeof(u16) * entries)) { in scif_fdioctl()
304 kfree(nodes); in scif_fdioctl()
/linux-4.19.296/fs/dlm/
Dmember.c520 if (rv->nodes[i].nodeid == nodeid) in find_config_node()
521 return &rv->nodes[i]; in find_config_node()
564 node = &rv->nodes[i]; in dlm_recover_members()
674 struct dlm_config_node *nodes = NULL; in dlm_ls_start() local
681 error = dlm_config_nodes(ls->ls_name, &nodes, &count); in dlm_ls_start()
696 rv->nodes = nodes; in dlm_ls_start()
706 kfree(rv_old->nodes); in dlm_ls_start()
715 kfree(nodes); in dlm_ls_start()
/linux-4.19.296/fs/btrfs/tests/
Dqgroup-tests.c47 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()
181 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in remove_extent_ref()
183 refs = btrfs_extent_refs(path->nodes[0], item); in remove_extent_ref()
184 btrfs_set_extent_refs(path->nodes[0], item, refs - 1); in remove_extent_ref()
Dfree-space-tree-tests.c39 flags = btrfs_free_space_flags(path->nodes[0], info); in __check_free_space_extents()
40 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); in __check_free_space_extents()
52 while (++path->slots[0] < btrfs_header_nritems(path->nodes[0])) { in __check_free_space_extents()
53 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()
/linux-4.19.296/fs/ubifs/
Dgc.c252 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in sort_nodes()
294 list_sort(c, &sleb->nodes, &data_nodes_cmp); in sort_nodes()
297 err = dbg_check_data_nodes_order(c, &sleb->nodes); in sort_nodes()
371 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) { in move_nodes()
410 if (list_empty(&sleb->nodes) && list_empty(&nondata)) in move_nodes()
425 list_splice_tail(&nondata, &sleb->nodes); in move_nodes()
516 ubifs_assert(c, !list_empty(&sleb->nodes)); in ubifs_garbage_collect_leb()
517 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list); in ubifs_garbage_collect_leb()
524 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_garbage_collect_leb()
/linux-4.19.296/drivers/of/unittest-data/
Doverlay_base.dts9 * Do not add any nodes other than "/testcase-data-2" in node "/".
11 * dtc will create nodes "/__symbols__" and "/__local_fixups__".
/linux-4.19.296/include/trace/events/
Dbcache.h276 TP_PROTO(unsigned nodes),
277 TP_ARGS(nodes),
280 __field(unsigned, nodes )
284 __entry->nodes = nodes;
287 TP_printk("coalesced %u nodes", __entry->nodes)

1234