Home
last modified time | relevance | path

Searched full:tree (Results 1 – 25 of 1964) sorted by relevance

12345678910>>...79

/openbmc/u-boot/test/py/tests/
H A Dtest_bind.py31 tree = u_boot_console.run_command('dm tree')
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)
39 tree = u_boot_console.run_command('dm tree')
40 assert in_tree(tree, 'bind-test', 'simple_bus', 'generic_simple_bus', 0, True)
41 assert 'bind-test-child1' not in tree
42 assert in_tree(tree, 'bind-test-child2', 'simple_bus', 'generic_simple_bus', 1, True)
47 tree = u_boot_console.run_command('dm tree')
48 assert in_tree(tree, 'bind-test', 'simple_bus', 'generic_simple_bus', 0, True)
[all …]
/openbmc/qemu/tests/unit/
H A Dtest-qtree.c6 * https://gitlab.gnome.org/GNOME/glib/-/blob/main/glib/tests/tree.c
94 QTree *tree; in test_tree_search() local
99 tree = q_tree_new_with_data(my_compare_with_data, GINT_TO_POINTER(123)); in test_tree_search()
102 q_tree_insert(tree, &chars[i], &chars[i]); in test_tree_search()
105 q_tree_foreach(tree, my_traverse, NULL); in test_tree_search()
107 g_assert(q_tree_nnodes(tree) == strlen(chars)); in test_tree_search()
108 g_assert(q_tree_height(tree) == 6); in test_tree_search()
111 q_tree_foreach(tree, check_order, &p); in test_tree_search()
114 removed = q_tree_remove(tree, &chars[i + 10]); in test_tree_search()
119 removed = q_tree_remove(tree, &c); in test_tree_search()
[all …]
/openbmc/qemu/include/qemu/
H A Dqtree.h34 * used by the tree implementation. Until Glib 2.75.3, GTree uses Glib's
65 QTree *q_tree_ref(QTree *tree);
66 void q_tree_unref(QTree *tree);
67 void q_tree_destroy(QTree *tree);
68 void q_tree_insert(QTree *tree,
71 void q_tree_replace(QTree *tree,
74 gboolean q_tree_remove(QTree *tree,
76 gboolean q_tree_steal(QTree *tree,
78 gpointer q_tree_lookup(QTree *tree,
80 gboolean q_tree_lookup_extended(QTree *tree,
[all …]
H A Diova-tree.h2 * An very simplified iova tree implementation based on GTree.
15 * Currently the iova tree will only allow to keep ranges
18 * tree. It can save a lot of memory when the ranges are split but
22 * protections. Callers of the iova tree should be responsible
46 * Create a new GPA->IOVA tree.
48 * Returns: the tree point on success, or NULL otherwise.
55 * @tree: The GPA->IOVA tree we're inserting the mapping to
58 * Inserts a GPA range to the GPA->IOVA tree. If there are overlapped
63 int gpa_tree_insert(IOVATree *tree, const DMAMap *map);
68 * Create a new iova tree.
[all …]
/openbmc/qemu/hw/virtio/
H A Dvhost-iova-tree.c2 * vhost software live migration iova tree
11 #include "qemu/iova-tree.h"
12 #include "vhost-iova-tree.h"
46 VhostIOVATree *tree = g_new(VhostIOVATree, 1); in vhost_iova_tree_new() local
49 tree->iova_first = MAX(iova_first, iova_min_addr); in vhost_iova_tree_new()
50 tree->iova_last = iova_last; in vhost_iova_tree_new()
52 tree->iova_taddr_map = iova_tree_new(); in vhost_iova_tree_new()
53 tree->iova_map = iova_tree_new(); in vhost_iova_tree_new()
54 tree->gpa_iova_map = gpa_tree_new(); in vhost_iova_tree_new()
55 return tree; in vhost_iova_tree_new()
[all …]
/openbmc/qemu/util/
H A Dqtree.c73 * [balanced binary tree][glib-Balanced-Binary-Trees]. It should be
99 static QTreeNode *q_tree_insert_internal(QTree *tree,
103 static gboolean q_tree_remove_internal(QTree *tree,
107 static QTreeNode *q_tree_find_node(QTree *tree,
199 QTree *tree; in q_tree_new_full() local
203 tree = g_new(QTree, 1); in q_tree_new_full()
204 tree->root = NULL; in q_tree_new_full()
205 tree->key_compare = key_compare_func; in q_tree_new_full()
206 tree->key_destroy_func = key_destroy_func; in q_tree_new_full()
207 tree->value_destroy_func = value_destroy_func; in q_tree_new_full()
[all …]
H A Diova-tree.c2 * IOVA tree implementation based on GTree.
13 #include "qemu/iova-tree.h"
16 GTree *tree; member
49 * @next: The next mapping in the tree. Can be NULL to signal the last one
79 iova_tree->tree = g_tree_new_full(iova_tree_compare, NULL, g_free, NULL); in iova_tree_new()
84 const DMAMap *iova_tree_find(const IOVATree *tree, const DMAMap *map) in iova_tree_find() argument
86 return g_tree_lookup(tree->tree, map); in iova_tree_find()
108 const DMAMap *iova_tree_find_iova(const IOVATree *tree, const DMAMap *map) in iova_tree_find_iova() argument
114 g_tree_foreach(tree->tree, iova_tree_find_address_iterator, &args); in iova_tree_find_iova()
124 int iova_tree_insert(IOVATree *tree, const DMAMap *map) in iova_tree_insert() argument
[all …]
/openbmc/qemu/docs/devel/
H A Dcodebase.rst48 * `accel <https://gitlab.com/qemu-project/qemu/-/tree/master/accel>`_:
53 `target <https://gitlab.com/qemu-project/qemu/-/tree/master/target>`_.
54 * `audio <https://gitlab.com/qemu-project/qemu/-/tree/master/audio>`_:
56 * `authz <https://gitlab.com/qemu-project/qemu/-/tree/master/authz>`_:
58 * `backends <https://gitlab.com/qemu-project/qemu/-/tree/master/backends>`_:
61 * `block <https://gitlab.com/qemu-project/qemu/-/tree/master/block>`_:
63 * `bsd-user <https://gitlab.com/qemu-project/qemu/-/tree/master/bsd-user>`_:
67 * `chardev <https://gitlab.com/qemu-project/qemu/-/tree/master/chardev>`_:
69 * `common-user <https://gitlab.com/qemu-project/qemu/-/tree/master/common-user>`_:
71 * `configs <https://gitlab.com/qemu-project/qemu/-/tree/master/configs>`_:
[all …]
/openbmc/u-boot/dts/
H A DKconfig2 # Device Tree Control
22 menu "Device Tree Control"
26 bool "Run-time configuration via Device Tree"
30 via a flattened device tree.
33 bool "Board-specific manipulation of Device Tree"
36 U-Boot's device tree (e.g. to delete device from it). This option
37 make the Device Tree writeable and provides a board-specific
39 enables the board initialization to modifiy the Device Tree. The
43 bool "Enable run-time configuration via Device Tree in SPL"
46 Some boards use device tree in U-Boot but only have 4KB of SRAM
[all …]
/openbmc/u-boot/doc/driver-model/
H A Dlivetree.txt1 Driver Model with Live Device Tree
8 Traditionally U-Boot has used a 'flat' device tree. This means that it
9 reads directly from the device tree binary structure. It is called a flat
10 device tree because nodes are listed one after the other, with the
13 This document describes U-Boot's support for a 'live' device tree, meaning
14 that the tree is loaded into a hierarchical data structure within U-Boot.
20 The flat device tree has several advantages:
22 - it is the format produced by the device tree compiler, so no translation
30 However the flat device tree does have some limitations. Adding new
32 The overall tree has a fixed maximum size so sometimes the tree must be
[all …]
H A Dfdt-fixup.txt1 Pre-relocation device tree manipulation
32 device tree overlay mechanism: There exists one "base" device tree, which
35 boards is then detected, and the corresponding device tree overlays are applied
42 In the U-Boot boot loader, support for device tree overlays has recently been
43 integrated, and is used on some boards to alter the device tree that is later
44 passed to Linux. But since U-Boot's driver model, which is device tree-based as
46 device tree starts cropping up in U-Boot itself as well.
48 An additional problem with the device tree in U-Boot is that it is read-only,
49 and the current mechanisms don't allow easy manipulation of the device tree
51 tree (at least after the relocation) would greatly simplify the solution of
[all …]
H A Dof-plat.txt1 Driver Model Compiled-in Device Tree / Platform Data
8 Device tree is the standard configuration method in U-Boot. It is used to
12 The overhead of adding device tree access to U-Boot is fairly modest,
14 that in most cases it is best to use device tree for configuration.
19 case the overhead of device tree access may be too great.
23 bypasses the use of device tree completely, effectively creating a parallel
27 device tree contents into C code which can be compiled into the SPL binary.
42 - Device tree does not describe data types. But the C code must define a
48 in the device tree file.
51 the naming in the device tree, which may result in C identifiers that
[all …]
/openbmc/qemu/hw/hyperv/
H A Dhv-balloon-page_range_tree.c37 static GTreeNode *page_range_tree_insert_new(PageRangeTree tree, in page_range_tree_insert_new() argument
48 return g_tree_insert_node(tree.t, key, range); in page_range_tree_insert_new()
51 void hvb_page_range_tree_insert(PageRangeTree tree, in hvb_page_range_tree_insert() argument
65 node = g_tree_upper_bound(tree.t, &start); in hvb_page_range_tree_insert()
69 node = g_tree_node_last(tree.t); in hvb_page_range_tree_insert()
82 * !node case: the tree is empty or the very first node in the tree in hvb_page_range_tree_insert()
84 * the other case: there is a gap in the tree between the new range in hvb_page_range_tree_insert()
86 * anyway, let's just insert the new range into the tree. in hvb_page_range_tree_insert()
88 node = page_range_tree_insert_new(tree, start, count); in hvb_page_range_tree_insert()
94 * the previous range in the tree either partially covers the new in hvb_page_range_tree_insert()
[all …]
/openbmc/qemu/tests/bench/
H A Dqtree-bench.c86 void *tree; in init_empty_tree_and_keys() local
89 tree = g_tree_new(compare_func); in init_empty_tree_and_keys()
92 tree = q_tree_new(compare_func); in init_empty_tree_and_keys()
98 *ret_tree = tree; in init_empty_tree_and_keys()
107 static inline void remove_all(void *tree, enum impl_type impl) in remove_all() argument
111 g_tree_destroy(tree); in remove_all()
114 q_tree_destroy(tree); in remove_all()
125 void *tree; in run_benchmark() local
128 init_empty_tree_and_keys(impl, &tree, &keys, n_elems); in run_benchmark()
133 g_tree_insert(tree, &keys[i], &keys[i]); in run_benchmark()
[all …]
/openbmc/openbmc/poky/bitbake/lib/toaster/toastergui/static/js/
H A Djquery.treetable.js9 var $, Node, Tree, methods; variable
14 function Node(row, tree, settings) { argument
18 this.tree = tree;
125 return this.tree[this.parentId];
172 this.tree[this.parentId].removeChild(this);
242 Tree = (function() { function
243 function Tree(table, settings) { class in Tree
246 this.tree = {};
253 Tree.prototype.collapseAll = function() { class
264 Tree.prototype.expandAll = function() {
[all …]
/openbmc/libpldm/include/libpldm/
H A Dpdr.h348 /** @brief Make a new entity association tree
350 * @return opaque pointer that acts as a handle to the tree; NULL if no
351 * tree could be created
355 /** @brief Add a local entity into the entity association tree
357 * @param[in/out] tree - opaque pointer acting as a handle to the tree
371 pldm_entity_association_tree *tree, pldm_entity *entity,
375 /** @brief Add an entity into the entity association tree based on remote field
378 * @param[in/out] tree - opaque pointer acting as a handle to the tree
389 * the tree or a host entity
399 pldm_entity_association_tree *tree, pldm_entity *entity,
[all …]
/openbmc/u-boot/scripts/dtc/
H A Dfstree.c31 struct node *tree; in read_fstree() local
37 tree = build_node(NULL, NULL); in read_fstree()
64 add_property(tree, prop); in read_fstree()
72 add_child(tree, newchild); in read_fstree()
79 return tree; in read_fstree()
84 struct node *tree; in dt_from_fs() local
86 tree = read_fstree(dirname); in dt_from_fs()
87 tree = name_node(tree, ""); in dt_from_fs()
89 return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpuid(tree)); in dt_from_fs()
/openbmc/u-boot/arch/arm/cpu/armv8/fsl-layerscape/doc/
H A DREADME.falcon16 An important part of falcon boot is to prepare the device tree. A normal U-Boot
18 SPL, skipping the normal U-Boot. The device tree has to be prepared in advance.
20 It is equivalent to go through "bootm" step-by-step until device tree fixup is
21 done. The device tree in memory is the one needed for falcon boot. Falcon boot
25 Linux, the device tree stored in FIT image overwrites the memory loaded by spl
29 to understand the device tree in FIT image should be the one actually used, or
31 image with embedded static device tree to multiple boards.
34 the stored sectors to. Normally this is the static device tree. The second
39 is no longer used. The static device tree is copied into this location. So
40 this macro is passed as the location of device tree when booting Linux.
[all …]
/openbmc/u-boot/scripts/dtc/libfdt/
H A Dfdt_overlay.c2 * libfdt - Flat Device Tree manipulation
61 * @fdto: pointer to the device tree overlay blob
90 * @fdt: Base device tree blob
91 * @fdto: Device tree overlay blob
96 * device tree of a fragment, no matter how the actual targetting is
100 * the targetted node offset in the base device tree
149 * @fdt: Base device tree blob
150 * @node: Device tree overlay blob
188 * @fdto: Device tree overlay blob
195 * phandles to not conflict with the overlays of the base device tree.
[all …]
/openbmc/u-boot/drivers/pinctrl/renesas/
H A DKconfig15 The driver is controlled by a device tree node which contains both
25 The driver is controlled by a device tree node which contains both
35 The driver is controlled by a device tree node which contains both
45 The driver is controlled by a device tree node which contains both
55 The driver is controlled by a device tree node which contains both
65 The driver is controlled by a device tree node which contains both
75 The driver is controlled by a device tree node which contains both
85 The driver is controlled by a device tree node which contains both
95 The driver is controlled by a device tree node which contains both
105 The driver is controlled by a device tree node which contains both
/openbmc/docs/
H A Dkernel-development.md3 The OpenBMC project maintains a kernel tree for use by the project. The tree's
8 The OpenBMC kernel tree is hosted at <https://github.com/openbmc/linux> and
12 Your code will make it into the OpenBMC tree in these ways, from most to least
18 3. Patches included in the OpenBMC tree temporarily
22 If you require a patch added to the tree, follow these steps:
34 hardware you wish to support. Check the OpenBMC `-dev` tree, check upstream, and
49 list with a reference to the upstream tree. This may be Linus' tree, or it might
51 decide how best to include your code in the OpenBMC tree.
58 chose to carry the patches in the OpenBMC tree while the upstream development is
63 `arch/arm/mach-aspeed/aspeed.c`, and the device tree source files `dts`. The
[all …]
/openbmc/u-boot/lib/zlib/
H A Dtrees.c13 * Each code tree is stored in a compressed form which is itself
92 /* The static literal tree. Since the bit lengths are imposed, there is no
94 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
99 /* The static distance tree. (Actually a trivial tree since all codes use
123 const ct_data *static_tree; /* static tree or NULL */
126 int elems; /* max number of elements in the tree */
145 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
147 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
149 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
150 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
[all …]
/openbmc/openbmc/meta-arm/meta-arm-bsp/dynamic-layers/meta-arm-systemready/recipes-test/arm-systemready-acs/files/fvp-base/
H A D0001-check-sr-results-Change-the-expected-SR-result-confi.patch72 # The following tree applies to all ACS-IR 2.0 versions.
73 tree:
79 @@ -24,8 +23,6 @@ tree:
88 @@ -36,13 +33,9 @@ tree:
102 @@ -53,7 +46,7 @@ tree:
111 @@ -64,16 +57,11 @@ tree:
113 tree:
128 @@ -95,9 +83,14 @@ tree:
145 @@ -180,6 +173,7 @@ tree:
146 tree:
[all …]
/openbmc/u-boot/drivers/clk/mediatek/
H A Dclk-mtk.c115 const struct mtk_pll_data *pll = &priv->tree->plls[clk->id]; in mtk_pll_set_rate_regs()
152 const struct mtk_pll_data *pll = &priv->tree->plls[clk->id]; in mtk_pll_calc_values()
168 do_div(_pcw, priv->tree->xtal2_rate); in mtk_pll_calc_values()
187 const struct mtk_pll_data *pll = &priv->tree->plls[clk->id]; in mtk_apmixedsys_get_rate()
198 return __mtk_pll_recalc_rate(pll, priv->tree->xtal2_rate, in mtk_apmixedsys_get_rate()
205 const struct mtk_pll_data *pll = &priv->tree->plls[clk->id]; in mtk_apmixedsys_enable()
234 const struct mtk_pll_data *pll = &priv->tree->plls[clk->id]; in mtk_apmixedsys_disable()
271 const struct mtk_fixed_factor *fdiv = &priv->tree->fdivs[off]; in mtk_topckgen_get_factor_rate()
284 rate = priv->tree->xtal_rate; in mtk_topckgen_get_factor_rate()
293 const struct mtk_composite *mux = &priv->tree->muxes[off]; in mtk_topckgen_get_mux_rate()
[all …]
/openbmc/docs/designs/
H A Dentity-manager-hw-id-vpd-discover-via-device-tree.md1 # Entity-Manager HW ID: VPD Discovery via Device-Tree Properties
16 gathered from device tree file paths for Entity-Manager consumption.
34 modifications to the device-tree to output properties as one file handle per
86 the flattened device tree, setting the values for ['/model' and
87 '/serial-number,' which both have well-known paths in the device tree
98 detecting supported hardware configurations. The contents of 'device-tree/model'
104 affect how a service would collect data from the device-tree passed to the
105 kernel from u-Boot. One alternative to modifying the flat device-tree would be
106 to have values like 'model' set in the platform's device-tree source at image
109 This document discusses leveraging a 'device-tree -> D-Bus' daemon in
[all …]

12345678910>>...79