Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 1384) sorted by relevance

12345678910>>...56

/linux-6.3-rc2/tools/testing/radix-tree/
A Dtag_check.c22 item_insert(tree, index); in __simple_checks()
33 item_insert(tree, index); in __simple_checks()
54 item_kill_tree(&tree); in simple_checks()
66 item_insert(&tree, 43); in extend_checks()
73 item_insert(&tree, 0); in extend_checks()
77 item_delete(&tree, 43); in extend_checks()
83 item_kill_tree(&tree); in extend_checks()
96 item_insert(&tree, tmp); in contract_checks()
111 item_kill_tree(&tree); in contract_checks()
283 item_kill_tree(&tree); in thrash_tags()
[all …]
A Dmain.c18 RADIX_TREE(tree, GFP_KERNEL); in __gang_check()
35 item_kill_tree(&tree); in __gang_check()
83 item_insert(&tree, 44); in add_and_check()
86 item_kill_tree(&tree); in add_and_check()
95 item_insert(&tree, 42); in dynamic_height_check()
98 item_insert(&tree, 1000000); in dynamic_height_check()
108 item_insert(&tree, i); in dynamic_height_check()
123 item_kill_tree(&tree); in dynamic_height_check()
175 item_insert(&tree, start); in copy_tag_check()
188 item_insert(&tree, end); in copy_tag_check()
[all …]
/linux-6.3-rc2/fs/hfs/
A Dbtree.c27 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
28 if (!tree) in hfs_btree_open()
34 tree->sb = sb; in hfs_btree_open()
35 tree->cnid = id; in hfs_btree_open()
125 return tree; in hfs_btree_open()
134 kfree(tree); in hfs_btree_open()
144 if (!tree) in hfs_btree_close()
159 kfree(tree); in hfs_btree_close()
193 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
244 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
[all …]
A Dbrec.c74 tree = fd->tree; in hfs_brec_insert()
76 if (!tree->root) in hfs_brec_insert()
78 node = hfs_bnode_find(tree, tree->leaf_head); in hfs_brec_insert()
108 tree->leaf_count++; in hfs_brec_insert()
183 tree = fd->tree; in hfs_brec_remove()
190 tree->leaf_count--; in hfs_brec_remove()
239 tree = fd->tree; in hfs_bnode_split()
360 tree = fd->tree; in hfs_brec_update_parent()
466 if (tree->root) { in hfs_btree_inc_height()
467 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
[all …]
A Dbnode.c60 struct hfs_btree *tree; in hfs_bnode_read_key() local
63 tree = node->tree; in hfs_bnode_read_key()
181 struct hfs_btree *tree; in hfs_bnode_unlink() local
185 tree = node->tree; in hfs_bnode_unlink()
213 tree->root = 0; in hfs_bnode_unlink()
214 tree->depth = 0; in hfs_bnode_unlink()
262 node->tree = tree; in __hfs_bnode_create()
269 spin_lock(&tree->hash_lock); in __hfs_bnode_create()
275 tree->node_hash_cnt++; in __hfs_bnode_create()
313 node->tree->node_hash_cnt--; in hfs_bnode_unhash()
[all …]
A Dbfind.c19 fd->tree = tree; in hfs_find_init()
25 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
28 switch (tree->cnid) { in hfs_find_init()
50 mutex_unlock(&fd->tree->tree_lock); in hfs_find_exit()
51 fd->tree = NULL; in hfs_find_exit()
109 struct hfs_btree *tree; in hfs_brec_find() local
115 tree = fd->tree; in hfs_brec_find()
119 nidx = tree->root; in hfs_brec_find()
122 height = tree->depth; in hfs_brec_find()
176 struct hfs_btree *tree; in hfs_brec_goto() local
[all …]
/linux-6.3-rc2/fs/hfsplus/
A Dbtree.c142 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in hfs_btree_open()
143 if (!tree) in hfs_btree_open()
148 tree->sb = sb; in hfs_btree_open()
149 tree->cnid = id; in hfs_btree_open()
245 return tree; in hfs_btree_open()
254 kfree(tree); in hfs_btree_open()
264 if (!tree) in hfs_btree_close()
280 kfree(tree); in hfs_btree_close()
315 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
368 tree->free_nodes += count - tree->node_count; in hfs_bmap_reserve()
[all …]
A Dbrec.c72 tree = fd->tree; in hfs_brec_insert()
74 if (!tree->root) in hfs_brec_insert()
76 node = hfs_bnode_find(tree, tree->leaf_head); in hfs_brec_insert()
106 tree->leaf_count++; in hfs_brec_insert()
185 tree = fd->tree; in hfs_brec_remove()
192 tree->leaf_count--; in hfs_brec_remove()
243 tree = fd->tree; in hfs_bnode_split()
364 tree = fd->tree; in hfs_brec_update_parent()
470 if (tree->root) { in hfs_btree_inc_height()
471 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
[all …]
A Dbnode.c59 struct hfs_btree *tree; in hfs_bnode_read_key() local
62 tree = node->tree; in hfs_bnode_read_key()
330 struct hfs_btree *tree; in hfs_bnode_unlink() local
334 tree = node->tree; in hfs_bnode_unlink()
363 tree->root = 0; in hfs_bnode_unlink()
364 tree->depth = 0; in hfs_bnode_unlink()
412 node->tree = tree; in __hfs_bnode_create()
419 spin_lock(&tree->hash_lock); in __hfs_bnode_create()
425 tree->node_hash_cnt++; in __hfs_bnode_create()
463 node->tree->node_hash_cnt--; in hfs_bnode_unhash()
[all …]
A Dbfind.c19 fd->tree = tree; in hfs_find_init()
25 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
28 switch (tree->cnid) { in hfs_find_init()
50 mutex_unlock(&fd->tree->tree_lock); in hfs_find_exit()
51 fd->tree = NULL; in hfs_find_exit()
166 struct hfs_btree *tree; in hfs_brec_find() local
172 tree = fd->tree; in hfs_brec_find()
176 nidx = tree->root; in hfs_brec_find()
179 height = tree->depth; in hfs_brec_find()
233 struct hfs_btree *tree; in hfs_brec_goto() local
[all …]
/linux-6.3-rc2/kernel/
A Daudit_tree.c98 if (tree) { in alloc_tree()
108 return tree; in alloc_tree()
618 for (p = tree->chunks.next; p != &tree->chunks; p = q) { in trim_marked()
631 if (!tree->root && !tree->goner) { in trim_marked()
650 tree = rule->tree; in audit_remove_tree_rule()
651 if (tree) { in audit_remove_tree_rule()
654 if (list_empty(&tree->rules) && !tree->goner) { in audit_remove_tree_rule()
802 struct audit_tree *seed = rule->tree, *tree; in audit_add_tree_rule() local
811 rule->tree = tree; in audit_add_tree_rule()
816 tree = seed; in audit_add_tree_rule()
[all …]
/linux-6.3-rc2/fs/btrfs/
A Dextent-io-tree.c99 tree->fs_info = fs_info; in extent_io_tree_init()
100 tree->state = RB_ROOT; in extent_io_tree_init()
102 tree->inode = NULL; in extent_io_tree_init()
103 tree->owner = owner; in extent_io_tree_init()
110 spin_lock(&tree->lock); in extent_io_tree_release()
134 spin_unlock(&tree->lock); in extent_io_tree_release()
349 if (tree->inode) in merge_state()
359 if (tree->inode) in merge_state()
375 if (tree->inode) in set_state_bits()
463 if (tree->inode) in split_state()
[all …]
A Dextent-io-tree.h107 struct extent_io_tree *tree, unsigned int owner);
108 void extent_io_tree_release(struct extent_io_tree *tree);
110 int lock_extent(struct extent_io_tree *tree, u64 start, u64 end,
119 u64 count_range_bits(struct extent_io_tree *tree,
137 return __clear_extent_bit(tree, start, end, bits, cached, in clear_extent_bit()
151 return clear_extent_bit(tree, start, end, bits, NULL); in clear_extent_bits()
168 return set_extent_bit(tree, start, end, bits, NULL, GFP_NOFS); in set_extent_bits()
174 return __clear_extent_bit(tree, start, end, EXTENT_UPTODATE, in clear_extent_uptodate()
187 return clear_extent_bit(tree, start, end, in clear_extent_dirty()
200 return set_extent_bit(tree, start, end, in set_extent_delalloc()
[all …]
A Dordered-data.c130 struct rb_root *root = &tree->tree; in tree_search()
135 if (tree->last) { in tree_search()
139 return tree->last; in tree_search()
145 tree->last = ret; in tree_search()
230 node = tree_insert(&tree->tree, file_offset, in btrfs_add_ordered_extent()
559 rb_erase(node, &tree->tree); in btrfs_remove_ordered_extent()
562 tree->last = NULL; in btrfs_remove_ordered_extent()
902 for (n = rb_first(&tree->tree); n; n = rb_next(n)) { in btrfs_get_ordered_extents_for_logging()
963 node = tree->tree.rb_node; in btrfs_lookup_first_ordered_range()
1127 rb_erase(node, &tree->tree); in btrfs_split_ordered_extent()
[all …]
A Dextent_map.c37 tree->map = RB_ROOT_CACHED; in extent_map_tree_init()
39 rwlock_init(&tree->lock); in extent_map_tree_init()
302 write_lock(&tree->lock); in unpin_extent_cache()
320 try_merge_map(tree, em); in unpin_extent_cache()
329 write_unlock(&tree->lock); in unpin_extent_cache()
340 try_merge_map(tree, em); in clear_em_logging()
354 try_merge_map(tree, em); in setup_extent_mapping()
675 write_lock(&tree->lock); in drop_all_extent_maps_fast()
688 write_unlock(&tree->lock); in drop_all_extent_maps_fast()
955 write_lock(&tree->lock); in btrfs_replace_extent_map_range()
[all …]
/linux-6.3-rc2/lib/
A Dtest_maple_tree.c2827 check_load(&tree, set[1], &tree); in maple_tree_seed()
2829 check_load(&tree, set[3], &tree); in maple_tree_seed()
2832 check_load(&tree, set[1], &tree); in maple_tree_seed()
2838 check_load(&tree, set[1], &tree); in maple_tree_seed()
2840 check_load(&tree, set[3], &tree); in maple_tree_seed()
2842 check_load(&tree, set[5], &tree); in maple_tree_seed()
2845 check_load(&tree, set[1], &tree); in maple_tree_seed()
2847 check_load(&tree, set[3], &tree); in maple_tree_seed()
2849 check_load(&tree, set[5], &tree); in maple_tree_seed()
2858 check_load(&tree, set[1], &tree); in maple_tree_seed()
[all …]
/linux-6.3-rc2/fs/unicode/
A Dmkutf8data.c417 static void tree_walk(struct tree *tree) in tree_walk() argument
428 printf("%s_%x root %p\n", tree->type, tree->maxage, tree->root); in tree_walk()
431 tree->leaf_print(tree->root, indent); in tree_walk()
654 static void prune(struct tree *tree) in prune() argument
961 index += tree->leaf_size(tree->root); in index_nodes()
1048 static int size_nodes(struct tree *tree) in size_nodes() argument
1211 tree->leaf_emit(tree->root, data); in emit()
1212 size = tree->leaf_size(tree->root); in emit()
1745 static void verify(struct tree *tree) in verify() argument
2967 struct tree *tree; member
[all …]
/linux-6.3-rc2/sound/hda/
A Dhdac_sysfs.c325 if (!tree) in widget_tree_free()
328 if (tree->nodes) { in widget_tree_free()
334 kfree(tree); in widget_tree_free()
369 tree = codec->widgets = kzalloc(sizeof(*tree), GFP_KERNEL); in widget_tree_create()
370 if (!tree) in widget_tree_create()
374 if (!tree->root) in widget_tree_create()
377 tree->nodes = kcalloc(codec->num_nodes + 1, sizeof(*tree->nodes), in widget_tree_create()
379 if (!tree->nodes) in widget_tree_create()
435 tree = kmemdup(codec->widgets, sizeof(*tree), GFP_KERNEL); in hda_widget_sysfs_reinit()
436 if (!tree) in hda_widget_sysfs_reinit()
[all …]
/linux-6.3-rc2/lib/zlib_deflate/
A Ddeftree.c150 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
156 send_bits(s, tree[c].Code, tree[c].Len); }
308 (tree[n].Freq < tree[m].Freq || \
309 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
380 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
390 f = tree[n].Freq; in gen_bitlen()
507 tree[n].Len = 0; in build_tree()
518 tree[node].Freq = 1; in build_tree()
542 tree[node].Freq = tree[n].Freq + tree[m].Freq; in build_tree()
544 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
[all …]
/linux-6.3-rc2/scripts/dtc/
A Dfstree.c16 struct node *tree; in read_fstree() local
22 tree = build_node(NULL, NULL, NULL); in read_fstree()
50 add_property(tree, prop); in read_fstree()
58 add_child(tree, newchild); in read_fstree()
65 return tree; in read_fstree()
70 struct node *tree; in dt_from_fs() local
72 tree = read_fstree(dirname); in dt_from_fs()
73 tree = name_node(tree, ""); in dt_from_fs()
75 return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpuid(tree)); in dt_from_fs()
/linux-6.3-rc2/scripts/gcc-plugins/
A Dlatent_entropy_plugin.c116 static tree tree_get_random_const(tree type) in tree_get_random_const()
128 static tree handle_latent_entropy_attribute(tree *node, tree name, in handle_latent_entropy_attribute()
133 tree type; in handle_latent_entropy_attribute()
171 tree fieldtype; in handle_latent_entropy_attribute()
265 tree list; in latent_entropy_gate()
279 static tree create_var(tree type, const char *name) in create_var()
281 tree var; in create_var()
335 tree op2) in create_assign()
344 tree rhs; in perturb_local_entropy()
358 tree temp; in __perturb_latent_entropy()
[all …]
A Dstructleak_plugin.c53 static tree handle_user_attribute(tree *node, tree name, tree args, int flags, bool *no_add_attrs) in handle_user_attribute()
76 static tree get_field_type(tree field) in get_field_type()
81 static bool is_userspace_type(tree type) in is_userspace_type()
83 tree field; in is_userspace_type()
101 tree type = (tree)event_data; in finish_type()
116 static void initialize(tree var) in initialize()
120 tree initializer; in initialize()
122 tree type; in initialize()
130 tree rhs1; in initialize()
171 tree var; in structleak_execute()
[all …]
A Drandomize_layout_plugin.c58 static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_… in handle_randomize_layout_attr()
60 tree type; in handle_randomize_layout_attr()
101 static tree handle_randomize_considered_attr(tree *node, tree name, tree args, int flags, bool *no_… in handle_randomize_considered_attr()
111 static tree handle_randomize_performed_attr(tree *node, tree name, tree args, int flags, bool *no_a… in handle_randomize_performed_attr()
210 tree tmp; in performance_shuffle()
229 tree tmp; in full_shuffle()
309 tree list; in relayout_struct()
512 tree decl = (tree)event_data; in randomize_layout_finish_decl()
513 tree type; in randomize_layout_finish_decl()
540 tree type = (tree)event_data; in finish_type()
[all …]
/linux-6.3-rc2/scripts/tracing/
A Ddraw_functrace.py59 tree = self
60 while tree != CallTree.ROOT and tree._func != func:
61 tree = tree._parent
62 if tree == CallTree.ROOT:
65 return tree
114 tree = CallTree.ROOT
123 tree = tree.getParent(caller)
124 tree = tree.calls(callee, calltime)
/linux-6.3-rc2/net/sched/
A Dematch.c165 return &tree->matches[index]; in tcf_em_get_match()
306 struct tcf_ematch_tree *tree) in tcf_em_tree_validate() argument
314 memset(tree, 0, sizeof(*tree)); in tcf_em_tree_validate()
338 if (tree->matches == NULL) in tcf_em_tree_validate()
362 em = tcf_em_get_match(tree, idx); in tcf_em_tree_validate()
386 tcf_em_tree_destroy(tree); in tcf_em_tree_validate()
404 if (tree->matches == NULL) in tcf_em_tree_destroy()
419 tree->hdr.nmatches = 0; in tcf_em_tree_destroy()
420 kfree(tree->matches); in tcf_em_tree_destroy()
421 tree->matches = NULL; in tcf_em_tree_destroy()
[all …]

Completed in 65 milliseconds

12345678910>>...56