| /openbmc/linux/tools/testing/radix-tree/ |
| D | tag_check.c | |
| D | main.c | |
| /openbmc/linux/fs/hfs/ |
| D | btree.c | |
| D | brec.c | |
| D | bnode.c | |
| D | bfind.c | |
| /openbmc/u-boot/test/py/tests/ |
| H A D | test_bind.py | 31 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/linux/fs/hfsplus/ |
| D | btree.c | |
| D | brec.c | |
| D | bnode.c | |
| D | bfind.c | |
| /openbmc/qemu/tests/unit/ |
| H A D | test-qtree.c | 6 * 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 D | qtree.h | 34 * 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 D | iova-tree.h | 2 * 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/util/ |
| H A D | qtree.c | 73 * [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 D | iova-tree.c | 2 * 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/hw/virtio/ |
| H A D | vhost-iova-tree.c | 2 * 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/docs/devel/ |
| H A D | codebase.rst | 48 * `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 D | Kconfig | 2 # 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 D | livetree.txt | 1 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 D | fdt-fixup.txt | 1 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 …]
|
| /openbmc/qemu/hw/hyperv/ |
| H A D | hv-balloon-page_range_tree.c | 37 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/linux/tools/include/linux/ |
| D | rbtree.h | |
| /openbmc/linux/Documentation/devicetree/ |
| D | of_unittest.rst | |
| /openbmc/linux/sound/hda/ |
| D | hdac_sysfs.c | |