Home
last modified time | relevance | path

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

12345678910>>...108

/linux/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/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()
124 return tree; in hfs_btree_open()
132 kfree(tree); in hfs_btree_open()
142 if (!tree) in hfs_btree_close()
157 kfree(tree); in hfs_btree_close()
190 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
241 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.c63 struct hfs_btree *tree; in hfs_bnode_read_key() local
66 tree = node->tree; in hfs_bnode_read_key()
188 struct hfs_btree *tree; in hfs_bnode_unlink() local
192 tree = node->tree; in hfs_bnode_unlink()
220 tree->root = 0; in hfs_bnode_unlink()
221 tree->depth = 0; in hfs_bnode_unlink()
269 node->tree = tree; in __hfs_bnode_create()
276 spin_lock(&tree->hash_lock); in __hfs_bnode_create()
282 tree->node_hash_cnt++; in __hfs_bnode_create()
323 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/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()
253 kfree(tree); in hfs_btree_open()
263 if (!tree) in hfs_btree_close()
279 kfree(tree); in hfs_btree_close()
314 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
367 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.c61 struct hfs_btree *tree; in hfs_bnode_read_key() local
64 tree = node->tree; in hfs_bnode_read_key()
337 struct hfs_btree *tree; in hfs_bnode_unlink() local
341 tree = node->tree; in hfs_bnode_unlink()
370 tree->root = 0; in hfs_bnode_unlink()
371 tree->depth = 0; in hfs_bnode_unlink()
419 node->tree = tree; in __hfs_bnode_create()
426 spin_lock(&tree->hash_lock); in __hfs_bnode_create()
432 tree->node_hash_cnt++; in __hfs_bnode_create()
474 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/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/fs/btrfs/
A Dextent-io-tree.h103 struct extent_io_tree *tree, unsigned int owner,
105 void extent_io_tree_release(struct extent_io_tree *tree);
112 return lock_extent_bits(tree, start, end, NULL); in lock_extent()
120 u64 count_range_bits(struct extent_io_tree *tree,
164 return clear_extent_bit(tree, start, end, bits, wake, 0, NULL); in clear_extent_bits()
200 return clear_extent_bit(tree, start, end, in clear_extent_dirty()
213 return set_extent_bit(tree, start, end, in set_extent_delalloc()
221 return set_extent_bit(tree, start, end, in set_extent_defrag()
240 int find_first_extent_bit(struct extent_io_tree *tree, u64 start,
247 int extent_invalidatepage(struct extent_io_tree *tree,
[all …]
A Dordered-data.c127 struct rb_root *root = &tree->tree; in tree_search()
132 if (tree->last) { in tree_search()
136 return tree->last; in tree_search()
142 tree->last = ret; in tree_search()
218 node = tree_insert(&tree->tree, file_offset, in __btrfs_add_ordered_extent()
561 rb_erase(node, &tree->tree); in btrfs_remove_ordered_extent()
564 tree->last = NULL; in btrfs_remove_ordered_extent()
890 for (n = rb_first(&tree->tree); n; n = rb_next(n)) { in btrfs_get_ordered_extents_for_logging()
949 node = tree->tree.rb_node; in btrfs_lookup_first_ordered_range()
1105 rb_erase(node, &tree->tree); in btrfs_split_ordered_extent()
[all …]
A Dextent_map.c38 tree->map = RB_ROOT_CACHED; in extent_map_tree_init()
39 INIT_LIST_HEAD(&tree->modified_extents); in extent_map_tree_init()
40 rwlock_init(&tree->lock); in extent_map_tree_init()
303 write_lock(&tree->lock); in unpin_extent_cache()
321 try_merge_map(tree, em); in unpin_extent_cache()
330 write_unlock(&tree->lock); in unpin_extent_cache()
339 try_merge_map(tree, em); in clear_em_logging()
353 try_merge_map(tree, em); in setup_extent_mapping()
405 lockdep_assert_held_write(&tree->lock); in add_extent_mapping()
407 ret = tree_insert(&tree->map, em); in add_extent_mapping()
[all …]
/linux/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/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/scripts/gcc-plugins/
A Dlatent_entropy_plugin.c110 static tree tree_get_random_const(tree type) in tree_get_random_const()
122 static tree handle_latent_entropy_attribute(tree *node, tree name, in handle_latent_entropy_attribute()
127 tree type; in handle_latent_entropy_attribute()
165 tree fieldtype; in handle_latent_entropy_attribute()
259 tree list; in latent_entropy_gate()
273 static tree create_var(tree type, const char *name) in create_var()
275 tree var; in create_var()
329 tree op2) in create_assign()
338 tree rhs; in perturb_local_entropy()
352 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.c76 static tree handle_randomize_layout_attr(tree *node, tree name, tree args, int flags, bool *no_add_… in handle_randomize_layout_attr()
78 tree type; in handle_randomize_layout_attr()
119 static tree handle_randomize_considered_attr(tree *node, tree name, tree args, int flags, bool *no_… in handle_randomize_considered_attr()
129 static tree handle_randomize_performed_attr(tree *node, tree name, tree args, int flags, bool *no_a… in handle_randomize_performed_attr()
228 tree tmp; in performance_shuffle()
247 tree tmp; in full_shuffle()
327 tree list; in relayout_struct()
530 tree decl = (tree)event_data; in randomize_layout_finish_decl()
531 tree type; in randomize_layout_finish_decl()
558 tree type = (tree)event_data; in finish_type()
[all …]
/linux/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()
367 tree = codec->widgets = kzalloc(sizeof(*tree), GFP_KERNEL); in widget_tree_create()
368 if (!tree) in widget_tree_create()
372 if (!tree->root) in widget_tree_create()
375 tree->nodes = kcalloc(codec->num_nodes + 1, sizeof(*tree->nodes), in widget_tree_create()
377 if (!tree->nodes) in widget_tree_create()
433 tree = kmemdup(codec->widgets, sizeof(*tree), GFP_KERNEL); in hda_widget_sysfs_reinit()
434 if (!tree) in hda_widget_sysfs_reinit()
[all …]
/linux/net/sched/
A Dematch.c165 return &tree->matches[index]; in tcf_em_get_match()
304 struct tcf_ematch_tree *tree) in tcf_em_tree_validate() argument
312 memset(tree, 0, sizeof(*tree)); in tcf_em_tree_validate()
336 if (tree->matches == NULL) in tcf_em_tree_validate()
360 em = tcf_em_get_match(tree, idx); in tcf_em_tree_validate()
384 tcf_em_tree_destroy(tree); in tcf_em_tree_validate()
402 if (tree->matches == NULL) in tcf_em_tree_destroy()
417 tree->hdr.nmatches = 0; in tcf_em_tree_destroy()
418 kfree(tree->matches); in tcf_em_tree_destroy()
419 tree->matches = NULL; in tcf_em_tree_destroy()
[all …]
/linux/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/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/mm/
A Dzswap.c958 spin_lock(&tree->lock); in zswap_writeback_entry()
1018 spin_lock(&tree->lock); in zswap_writeback_entry()
1043 spin_lock(&tree->lock); in zswap_writeback_entry()
1216 spin_lock(&tree->lock); in zswap_frontswap_store()
1259 spin_lock(&tree->lock); in zswap_frontswap_load()
1316 spin_lock(&tree->lock); in zswap_frontswap_load()
1330 spin_lock(&tree->lock); in zswap_frontswap_invalidate_page()
1353 if (!tree) in zswap_frontswap_invalidate_area()
1362 kfree(tree); in zswap_frontswap_invalidate_area()
1370 tree = kzalloc(sizeof(*tree), GFP_KERNEL); in zswap_frontswap_init()
[all …]
/linux/Documentation/devicetree/
A Dof_unittest.rst13 is attached to the live tree dynamically, independent of the machine's
62 Un-flattened device tree structure:
64 Un-flattened device tree consists of connected device_node(s) in form of a tree
67 // following struct members are used to construct the tree
105 Figure 1: Generic structure of un-flattened device tree
117 blob. And finally, if the machine's device tree (i.e live tree) is present,
118 then it attaches the unflattened test data tree to the live tree, else it
119 attaches itself as a live device tree.
122 live tree as explained below. To explain the same, the test data tree described
123 in Figure 2 is attached to the live tree described in Figure 1::
[all …]

Completed in 53 milliseconds

12345678910>>...108