Searched refs:tree (Results 1 - 25 of 43) sorted by relevance

12

/u-boot/fs/btrfs/
H A Dextent-cache.h25 void cache_tree_init(struct cache_tree *tree);
27 struct cache_extent *first_cache_extent(struct cache_tree *tree);
28 struct cache_extent *last_cache_extent(struct cache_tree *tree);
37 struct cache_extent *search_cache_extent(struct cache_tree *tree, u64 start);
44 struct cache_extent *lookup_cache_extent(struct cache_tree *tree,
48 * Add an non-overlap extent into cache tree
52 int add_cache_extent(struct cache_tree *tree, u64 start, u64 size);
57 int insert_cache_extent(struct cache_tree *tree, struct cache_extent *pe);
58 void remove_cache_extent(struct cache_tree *tree, struct cache_extent *pe);
60 static inline int cache_tree_empty(struct cache_tree *tree) argument
[all...]
H A Dextent-cache.c83 void cache_tree_init(struct cache_tree *tree) argument
85 tree->root = RB_ROOT;
101 int add_cache_extent(struct cache_tree *tree, u64 start, u64 size) argument
109 ret = insert_cache_extent(tree, pe);
116 int insert_cache_extent(struct cache_tree *tree, struct cache_extent *pe) argument
118 return rb_insert(&tree->root, &pe->rb_node, cache_tree_comp_nodes);
121 int insert_cache_extent2(struct cache_tree *tree, struct cache_extent *pe) argument
123 return rb_insert(&tree->root, &pe->rb_node, cache_tree_comp_nodes2);
126 struct cache_extent *lookup_cache_extent(struct cache_tree *tree, argument
135 node = rb_search(&tree
143 lookup_cache_extent2(struct cache_tree *tree, u64 objectid, u64 start, u64 size) argument
161 search_cache_extent(struct cache_tree *tree, u64 start) argument
180 search_cache_extent2(struct cache_tree *tree, u64 objectid, u64 start) argument
201 first_cache_extent(struct cache_tree *tree) argument
210 last_cache_extent(struct cache_tree *tree) argument
237 remove_cache_extent(struct cache_tree *tree, struct cache_extent *pe) argument
242 cache_tree_free_extents(struct cache_tree *tree, free_cache_extent free_func) argument
258 free_extent_cache_tree(struct cache_tree *tree) argument
263 add_merge_cache_extent(struct cache_tree *tree, u64 start, u64 size) argument
[all...]
H A Dextent-io.c17 void extent_io_tree_init(struct extent_io_tree *tree) argument
19 cache_tree_init(&tree->state);
20 cache_tree_init(&tree->cache);
21 tree->cache_size = 0;
55 void extent_io_tree_cleanup(struct extent_io_tree *tree) argument
57 cache_tree_free_extents(&tree->state, free_extent_state_func);
69 * extent in the tree. Extents with EXTENT_IO in their state field are
72 static int merge_state(struct extent_io_tree *tree, argument
89 remove_cache_extent(&tree->state, &other->cache_node);
101 remove_cache_extent(&tree
112 insert_state(struct extent_io_tree *tree, struct extent_state *state, u64 start, u64 end, int bits) argument
134 split_state(struct extent_io_tree *tree, struct extent_state *orig, struct extent_state *prealloc, u64 split) argument
152 clear_state_bit(struct extent_io_tree *tree, struct extent_state *state, int bits) argument
226 clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits) argument
320 set_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits) argument
443 set_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end) argument
448 clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end) argument
453 find_first_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, int bits) argument
484 test_range_bit(struct extent_io_tree *tree, u64 start, u64 end, int bits, int filled) argument
522 set_state_private(struct extent_io_tree *tree, u64 start, u64 private) argument
543 get_state_private(struct extent_io_tree *tree, u64 start, u64 *private) argument
608 struct extent_io_tree *tree = &eb->fs_info->extent_cache; local
641 find_extent_buffer(struct extent_io_tree *tree, u64 bytenr, u32 blocksize) argument
656 find_first_extent_buffer(struct extent_io_tree *tree, u64 start) argument
674 struct extent_io_tree *tree = &fs_info->extent_cache; local
791 struct extent_io_tree *tree = &eb->fs_info->extent_cache; local
802 struct extent_io_tree *tree = &eb->fs_info->extent_cache; local
[all...]
H A Dextent-io.h96 void extent_io_tree_init(struct extent_io_tree *tree);
97 void extent_io_tree_cleanup(struct extent_io_tree *tree);
98 int set_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits);
99 int clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits);
100 int find_first_extent_bit(struct extent_io_tree *tree, u64 start,
102 int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end,
104 int set_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end);
105 int clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end);
127 int set_state_private(struct extent_io_tree *tree, u64 start, u64 xprivate);
128 int get_state_private(struct extent_io_tree *tree, u6
[all...]
H A DMakefile7 common/rbtree-utils.o extent-cache.o volumes.o root-tree.o
/u-boot/test/py/tests/
H A Dtest_bind.py32 tree = u_boot_console.run_command('dm tree')
33 assert in_tree(tree, 'bind-test', 'simple_bus', 'simple_bus', 0, True)
34 assert in_tree(tree, 'bind-test-child1', 'phy', 'phy_sandbox', 1, False)
35 assert in_tree(tree, 'bind-test-child2', 'simple_bus', 'simple_bus', 1, True)
38 ##New entry usb_ether should appear in the dm tree
41 tree = u_boot_console.run_command('dm tree')
42 assert in_tree(tree, 'usb@1', 'ethernet', 'usb_ether', 1, True)
47 tree
[all...]
/u-boot/scripts/dtc/
H A Dfstree.c31 struct node *tree; local
37 tree = build_node(NULL, NULL);
64 add_property(tree, prop);
72 add_child(tree, newchild);
79 return tree;
84 struct node *tree; local
86 tree = read_fstree(dirname);
87 tree = name_node(tree, "");
89 return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpui
[all...]
H A Ddtc.c44 static void fill_fullpaths(struct node *tree, const char *prefix) argument
49 tree->fullpath = join_path(prefix, tree->name);
51 unit = strchr(tree->name, '@');
53 tree->basenamelen = unit - tree->name;
55 tree->basenamelen = strlen(tree->name);
57 for_each_child(tree, child)
58 fill_fullpaths(child, tree
[all...]
H A Dlivetree.c400 struct node *tree, uint32_t boot_cpuid_phys)
407 dti->dt = tree;
448 struct property *get_property_by_label(struct node *tree, const char *label, argument
454 *node = tree;
456 for_each_property(tree, prop) {
464 for_each_child(tree, c) {
474 struct marker *get_marker_label(struct node *tree, const char *label, argument
481 *node = tree;
483 for_each_property(tree, p) {
491 for_each_child(tree,
398 build_dt_info(unsigned int dtsflags, struct reserve_info *reservelist, struct node *tree, uint32_t boot_cpuid_phys) argument
513 get_node_by_path(struct node *tree, const char *path) argument
540 get_node_by_label(struct node *tree, const char *label) argument
560 get_node_by_phandle(struct node *tree, cell_t phandle) argument
584 get_node_by_ref(struct node *tree, const char *ref) argument
625 guess_boot_cpuid(struct node *tree) argument
[all...]
H A Dtreesource.c41 die("Unable to parse input tree\n");
44 die("Syntax error parsing input tree\n");
236 static void write_tree_source_node(FILE *f, struct node *tree, int level) argument
243 for_each_label(tree->labels, l)
245 if (tree->name && (*tree->name))
246 fprintf(f, "%s {\n", tree->name);
250 for_each_property(tree, prop) {
257 for_each_child(tree, child) {
H A Ddtc.h226 struct property *get_property_by_label(struct node *tree, const char *label,
228 struct marker *get_marker_label(struct node *tree, const char *label,
231 struct node *get_node_by_path(struct node *tree, const char *path);
232 struct node *get_node_by_label(struct node *tree, const char *label);
233 struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
234 struct node *get_node_by_ref(struct node *tree, const char *ref);
237 uint32_t guess_boot_cpuid(struct node *tree);
239 /* Boot info (tree plus memreserve information */
260 struct node *dt; /* the device tree */
270 struct node *tree, uint32_
[all...]
/u-boot/test/boot/
H A Dvbe_fixup.c3 * Test for VBE device tree fix-ups
17 * Basic test of reading nvdata and updating a fwupd node in the device tree
18 * This test works when called from test_vbe.py and it must use the flat tree,
19 * since device tree fix-ups do not yet support live tree.
25 oftree tree; local
28 tree = oftree_from_fdt(working_fdt);
29 ut_assert(oftree_valid(tree));
31 chosen = oftree_path(tree, "/chosen");
H A Dvbe_simple.c20 * Basic test of reading nvdata and updating a fwupd node in the device tree
57 fixup.tree = oftree_from_np(np);
59 fixup.tree = oftree_from_fdt(fdt_buf);
66 * control FDT, since it has no way of accessing the live tree created
74 node = oftree_path(fixup.tree, "/chosen/fwupd/firmware0");
/u-boot/
H A D.checkpatch.conf1 # Not Linux, so don't expect a Linux tree.
2 --no-tree
/u-boot/tools/patman/
H A D.checkpatch.conf1 # Not Linux, so don't expect a Linux tree.
2 --no-tree
/u-boot/drivers/clk/mediatek/
H A Dclk-mtk.c124 const struct mtk_pll_data *pll = &priv->tree->plls[clk->id];
166 const struct mtk_pll_data *pll = &priv->tree->plls[clk->id];
184 do_div(_pcw, priv->tree->xtal2_rate);
203 const struct mtk_pll_data *pll = &priv->tree->plls[clk->id];
214 return __mtk_pll_recalc_rate(pll, priv->tree->xtal2_rate,
221 const struct mtk_pll_data *pll = &priv->tree->plls[clk->id];
250 const struct mtk_pll_data *pll = &priv->tree->plls[clk->id];
287 const struct mtk_fixed_factor *fdiv = &priv->tree->fdivs[off];
301 rate = priv->tree->xtal_rate;
310 const struct mtk_fixed_factor *fdiv = &priv->tree
577 mtk_common_clk_init(struct udevice *dev, const struct mtk_clk_tree *tree) argument
602 mtk_common_clk_gate_init(struct udevice *dev, const struct mtk_clk_tree *tree, const struct mtk_gate *gates) argument
[all...]
H A Dclk-mtk.h197 /* struct mtk_clk_tree - clock tree */
213 const struct mtk_clk_tree *tree; member in struct:mtk_clk_priv
219 const struct mtk_clk_tree *tree; member in struct:mtk_cg_priv
229 const struct mtk_clk_tree *tree);
231 const struct mtk_clk_tree *tree,
/u-boot/lib/zlib/
H A Dtrees.c13 * Each code tree is stored in a compressed form which is itself
93 /* The static literal tree. Since the bit lengths are imposed, there is no
95 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
100 /* The static distance tree. (Actually a trivial tree since all codes use
124 const ct_data *static_tree; /* static tree or NULL */
127 int elems; /* max number of elements in the tree */
146 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
148 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
150 local void scan_tree OF((deflate_state *s, ct_data *tree, in
499 ct_data *tree = desc->dyn_tree; local
628 ct_data *tree = desc->dyn_tree; local
[all...]
/u-boot/include/dm/
H A Dofnode.h62 * oftree_from_fdt() - Returns an oftree from a flat device tree pointer
67 * @fdt: Device tree to use
76 * @other_node: Node in the same tree to use as a reference
106 oftree tree; local
110 tree.fdt = fdt;
112 tree.fdt = NULL;
114 return tree;
132 * oftree_new() - Create a new, empty tree
134 * @treep: Returns a pointer to the tree, on success
143 * @tree
191 oftree_lookup_fdt(oftree tree) argument
276 oftree_valid(oftree tree) argument
292 oftree tree; local
353 oftree tree; local
371 oftree tree; local
[all...]
/u-boot/cmd/
H A Dcedit.c38 oftree tree; local
53 tree = oftree_from_fdt(buf);
54 if (!oftree_valid(tree)) {
59 ret = expo_build(oftree_root(tree), &exp);
60 oftree_dispose(tree);
108 oftree tree; local
122 tree = oftree_from_fdt(buf);
123 if (!oftree_valid(tree)) {
129 ret = cedit_read_settings(cur_exp, tree);
130 oftree_dispose(tree);
[all...]
/u-boot/boot/
H A Dvbe_simple_os.c55 oftree tree = event->data.ft_fixup.tree; local
72 chosen = oftree_path(tree, "/chosen");
/u-boot/scripts/
H A Dspdxcheck.py37 lictree = repo.head.commit.tree['LICENSES']
206 def scan_git_tree(tree):
207 for el in tree.traverse():
219 def scan_git_subtree(tree, path):
221 tree = tree[p]
222 scan_git_tree(tree)
227 ap.add_argument('path', nargs='*', help='Check path or file. If not given full git tree scan. For stdin use "-"')
271 scan_git_subtree(repo.head.reference.commit.tree, p)
276 # Full git tree sca
[all...]
/u-boot/include/
H A Dcedit.h78 * @tree: Tree to read from
81 int cedit_read_settings(struct expo *exp, oftree tree);
/u-boot/test/dm/
H A Dofnode.c12 * particularly with flat tree, where a tree ID is included in ofnode as part of
35 * get_other_oftree() - Convert a flat tree into an oftree object
42 oftree tree; local
45 tree = oftree_from_np(uts->of_other);
47 tree = oftree_from_fdt(uts->other_fdt);
49 /* An invalid tree may cause failure or crashes */
50 if (!oftree_valid(tree))
53 return tree;
57 * get_oftree() - Convert a flat tree int
68 oftree tree; local
90 free_oftree(oftree tree) argument
827 oftree tree; local
1239 oftree tree; local
1353 oftree tree; local
1372 oftree tree; local
1481 oftree tree, check; local
[all...]
/u-boot/drivers/core/
H A Dofnode.c63 oftree tree; local
72 log_err("Failed to create live tree: err=%d\n", ret);
75 tree = oftree_from_np(root);
77 return tree;
87 log_err("Invalid device tree blob header\n");
91 /* register the new tree */
94 log_debug("oftree: registered tree %d: %p\n", i, fdt);
103 tree.fdt = fdt;
105 return tree;
110 oftree tree local
143 oftree_dispose(oftree tree) argument
200 oftree tree; local
251 oftree_to_fdt(oftree tree, struct abuf *buf) argument
282 ofnode_from_tree_offset(oftree tree, int offset) argument
721 oftree_get_by_phandle(oftree tree, uint phandle) argument
951 oftree_root(oftree tree) argument
960 oftree_path(oftree tree, const char *path) argument
[all...]

Completed in 254 milliseconds

12