Home
last modified time | relevance | path

Searched refs:in_tree (Results 1 – 12 of 12) sorted by relevance

/openbmc/u-boot/test/py/tests/
H A Dtest_bind.py8 def in_tree(response, name, uclass, drv, depth, last_child): function
32 assert in_tree(tree, 'bind-test', 'simple_bus', 'generic_simple_bus', 0, True)
33 assert in_tree(tree, 'bind-test-child1', 'phy', 'phy_sandbox', 1, False)
34 assert in_tree(tree, 'bind-test-child2', 'simple_bus', 'generic_simple_bus', 1, True)
40 assert in_tree(tree, 'bind-test', 'simple_bus', 'generic_simple_bus', 0, True)
42 assert in_tree(tree, 'bind-test-child2', 'simple_bus', 'generic_simple_bus', 1, True)
48 assert in_tree(tree, 'bind-test', 'simple_bus', 'generic_simple_bus', 0, True)
49 assert in_tree(tree, 'bind-test-child1', 'phy', 'phy_sandbox', 1, True)
50 assert in_tree(tree, 'bind-test-child2', 'simple_bus', 'generic_simple_bus', 1, False)
56 assert in_tree(tree, 'bind-test', 'simple_bus', 'generic_simple_bus', 0, True)
[all …]
/openbmc/linux/fs/ubifs/
H A Dfind.c84 const struct ubifs_lprops *lprops, int in_tree, in scan_for_dirty_cb() argument
93 if (!in_tree && valuable(c, lprops)) in scan_for_dirty_cb()
351 const struct ubifs_lprops *lprops, int in_tree, in scan_for_free_cb() argument
360 if (!in_tree && valuable(c, lprops)) in scan_for_free_cb()
591 const struct ubifs_lprops *lprops, int in_tree, in scan_for_idx_cb() argument
600 if (!in_tree && valuable(c, lprops)) in scan_for_idx_cb()
784 const struct ubifs_lprops *lprops, int in_tree, in scan_dirty_idx_cb() argument
793 if (!in_tree && valuable(c, lprops)) in scan_dirty_idx_cb()
H A Dlpt.c1932 int in_tree; member
1962 path->in_tree = 1; in scan_get_nnode()
1967 path->in_tree = 0; in scan_get_nnode()
2021 path->in_tree = 1; in scan_get_pnode()
2026 path->in_tree = 0; in scan_get_pnode()
2107 path[0].in_tree = 1; in ubifs_lpt_scan_nolock()
2135 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
2146 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
2156 path[h].in_tree = 1; in ubifs_lpt_scan_nolock()
2159 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
[all …]
H A Dlprops.c1016 const struct ubifs_lprops *lp, int in_tree, in scan_check_cb() argument
1035 if (in_tree) { in scan_check_cb()
1070 if (in_tree && cat > 0 && cat <= LPROPS_HEAP_CNT) { in scan_check_cb()
H A Dubifs.h659 int in_tree, void *data);
/openbmc/u-boot/fs/ubifs/
H A Dlpt.c1780 int in_tree; member
1810 path->in_tree = 1; in scan_get_nnode()
1815 path->in_tree = 0; in scan_get_nnode()
1869 path->in_tree = 1; in scan_get_pnode()
1874 path->in_tree = 0; in scan_get_pnode()
1955 path[0].in_tree = 1; in ubifs_lpt_scan_nolock()
1983 ret = scan_cb(c, lprops, path[h].in_tree, data); in ubifs_lpt_scan_nolock()
1994 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
2004 path[h].in_tree = 1; in ubifs_lpt_scan_nolock()
2007 if (path[h].in_tree) in ubifs_lpt_scan_nolock()
[all …]
H A Dlprops.c1021 const struct ubifs_lprops *lp, int in_tree, in scan_check_cb() argument
1040 if (in_tree) { in scan_check_cb()
1075 if (in_tree && cat > 0 && cat <= LPROPS_HEAP_CNT) { in scan_check_cb()
H A Dubifs.h1245 int in_tree, void *data);
/openbmc/u-boot/tools/buildman/
H A Dcontrol.py314 builder.in_tree = options.in_tree
H A Dbuilderthread.py142 if self.builder.in_tree:
206 if not self.builder.in_tree:
H A Dbuilder.py276 self.in_tree = False
/openbmc/linux/fs/btrfs/
H A Dextent-tree.c2132 WARN_ON(!entry->in_tree); in find_middle()