Home
last modified time | relevance | path

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

12345

/qemu/util/
A Dqtree.c199 QTree *tree; in q_tree_new_full() local
212 return tree; in q_tree_new_full()
233 if (!tree->root) { in q_tree_node_first()
237 tmp = tree->root; in q_tree_node_first()
346 tree->root = NULL; in q_tree_remove_all()
348 tree->nnodes = 0; in q_tree_remove_all()
371 return tree; in q_tree_ref()
394 g_free(tree); in q_tree_unref()
547 if (!tree->root) { in q_tree_insert_internal()
555 node = tree->root; in q_tree_insert_internal()
[all …]
A Diova-tree.c16 GTree *tree; member
86 return g_tree_lookup(tree->tree, map); in iova_tree_find()
114 g_tree_foreach(tree->tree, iova_tree_find_address_iterator, &args); in iova_tree_find_iova()
133 if (iova_tree_find(tree, map)) { in iova_tree_insert()
139 iova_tree_insert_internal(tree->tree, new); in iova_tree_insert()
149 g_tree_remove(tree->tree, overlap); in iova_tree_remove()
236 g_tree_foreach(tree->tree, iova_tree_alloc_traverse, &args); in iova_tree_alloc_map()
252 return iova_tree_insert(tree, map); in iova_tree_alloc_map()
255 void iova_tree_destroy(IOVATree *tree) in iova_tree_destroy() argument
257 g_tree_destroy(tree->tree); in iova_tree_destroy()
[all …]
A Dqsp.c523 GTree *tree = userp; in qsp_sort() local
525 g_tree_insert(tree, e, NULL); in qsp_sort()
599 static void qsp_mktree(GTree *tree, bool callsite_coalesce) in qsp_mktree() argument
639 qht_iter(htp, qsp_sort, tree); in qsp_mktree()
771 GTree *tree = g_tree_new_full(qsp_tree_cmp, &sort_by, g_free, NULL); in qsp_report() local
780 qsp_mktree(tree, callsite_coalesce); in qsp_report()
781 g_tree_foreach(tree, qsp_tree_report, &rep); in qsp_report()
782 g_tree_destroy(tree); in qsp_report()
/qemu/tests/unit/
A Dtest-qtree.c94 QTree *tree; in test_tree_search() local
195 q_tree_destroy(tree); in test_tree_search()
200 QTree *tree; in test_tree_remove() local
247 q_tree_destroy(tree); in test_tree_remove()
252 QTree *tree; in test_tree_destroy() local
264 q_tree_ref(tree); in test_tree_destroy()
270 q_tree_unref(tree); in test_tree_destroy()
275 QTree *tree; in test_tree_insert() local
288 q_tree_unref(tree); in test_tree_insert()
297 q_tree_unref(tree); in test_tree_insert()
[all …]
/qemu/include/qemu/
A Dqtree.h65 QTree *q_tree_ref(QTree *tree);
66 void q_tree_unref(QTree *tree);
68 void q_tree_insert(QTree *tree,
71 void q_tree_replace(QTree *tree,
84 void q_tree_foreach(QTree *tree,
90 gint q_tree_height(QTree *tree);
91 gint q_tree_nnodes(QTree *tree);
121 return g_tree_ref(tree); in q_tree_ref()
126 g_tree_unref(tree); in q_tree_unref()
131 g_tree_destroy(tree); in q_tree_destroy()
[all …]
A Diova-tree.h63 int iova_tree_insert(IOVATree *tree, const DMAMap *map);
76 void iova_tree_remove(IOVATree *tree, DMAMap map);
94 const DMAMap *iova_tree_find(const IOVATree *tree, const DMAMap *map);
112 const DMAMap *iova_tree_find_iova(const IOVATree *tree, const DMAMap *map);
128 int iova_tree_alloc_map(IOVATree *tree, DMAMap *map, hwaddr iova_begin,
140 void iova_tree_destroy(IOVATree *tree);
/qemu/hw/hyperv/
A Dhv-balloon-page_range_tree.c65 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()
132 g_tree_remove(tree.t, &start); in hvb_page_range_tree_insert()
142 node = g_tree_node_last(tree.t); in hvb_page_range_tree_pop()
160 g_tree_remove(tree.t, &out->start); in hvb_page_range_tree_pop()
176 node = g_tree_upper_bound(tree.t, &start); in hvb_page_range_tree_intree_any()
185 node = g_tree_node_last(tree.t); in hvb_page_range_tree_intree_any()
191 node = g_tree_node_first(tree.t); in hvb_page_range_tree_intree_any()
223 if (!tree->t) { in hvb_page_range_tree_destroy()
227 g_tree_destroy(tree->t); in hvb_page_range_tree_destroy()
[all …]
A Dhv-balloon-page_range_tree.h97 static inline bool page_range_tree_is_empty(PageRangeTree tree) in page_range_tree_is_empty() argument
99 guint nnodes = g_tree_nnodes(tree.t); in page_range_tree_is_empty()
104 void hvb_page_range_tree_init(PageRangeTree *tree);
105 void hvb_page_range_tree_destroy(PageRangeTree *tree);
107 bool hvb_page_range_tree_intree_any(PageRangeTree tree,
110 bool hvb_page_range_tree_pop(PageRangeTree tree, PageRange *out,
113 void hvb_page_range_tree_insert(PageRangeTree tree,
/qemu/tests/bench/
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()
111 g_tree_destroy(tree); in remove_all()
114 q_tree_destroy(tree); in remove_all()
125 void *tree; in run_benchmark() local
180 g_tree_remove(tree, &keys[i]); in run_benchmark()
183 q_tree_remove(tree, &keys[i]); in run_benchmark()
191 remove_all(tree, impl); in run_benchmark()
[all …]
/qemu/hw/virtio/
A Dvhost-iova-tree.c40 VhostIOVATree *tree = g_new(VhostIOVATree, 1); in vhost_iova_tree_new() local
43 tree->iova_first = MAX(iova_first, iova_min_addr); in vhost_iova_tree_new()
44 tree->iova_last = iova_last; in vhost_iova_tree_new()
46 tree->iova_taddr_map = iova_tree_new(); in vhost_iova_tree_new()
47 return tree; in vhost_iova_tree_new()
67 const DMAMap *vhost_iova_tree_find_iova(const VhostIOVATree *tree, in vhost_iova_tree_find_iova() argument
70 return iova_tree_find_iova(tree->iova_taddr_map, map); in vhost_iova_tree_find_iova()
86 int vhost_iova_tree_map_alloc(VhostIOVATree *tree, DMAMap *map) in vhost_iova_tree_map_alloc() argument
89 hwaddr iova_first = tree->iova_first ?: qemu_real_host_page_size(); in vhost_iova_tree_map_alloc()
97 return iova_tree_alloc_map(tree->iova_taddr_map, map, iova_first, in vhost_iova_tree_map_alloc()
[all …]
/qemu/scripts/simplebench/
A Dtable_templater.py34 self.tree = parser.parse(template)
38 for x in self.tree.children:
52 for x in self.tree.children:
/qemu/
A DMakefile54 $(error This is an out of tree build but your source tree ($(SRC_PATH)) \
55 seems to have been used for an in-tree build. You can fix this by running \
56 "$(MAKE) distclean && rm -rf *-linux-user *-softmmu" in your source tree)
A Dhmp-commands-info.hx233 .help = "show memory tree (-f: dump flat view for address spaces;"
234 "-d: dump dispatch tree, valid with -f only);"
242 Show memory tree.
532 .help = "show device tree (-b: brief, omit properties)",
538 Show device tree.
555 .name = "qom-tree",
558 .help = "show QOM composition tree",
564 ``info qom-tree``
565 Show QOM composition tree.
/qemu/tcg/
A Dregion.c51 QTree *tree; member
190 rt->tree = q_tree_new_full(tb_tc_cmp, NULL, NULL, tb_destroy); in tcg_region_trees_init()
229 q_tree_insert(rt->tree, &tb->tc, tb); in tcg_tb_insert()
239 q_tree_remove(rt->tree, &tb->tc); in tcg_tb_remove()
259 tb = q_tree_lookup(rt->tree, &s); in tcg_tb_lookup()
294 q_tree_foreach(rt->tree, func, user_data); in tcg_tb_foreach()
308 nb_tbs += q_tree_nnodes(rt->tree); in tcg_nb_tbs()
323 q_tree_ref(rt->tree); in tcg_region_tree_reset_all()
324 q_tree_destroy(rt->tree); in tcg_region_tree_reset_all()
/qemu/docs/specs/
A Dppc-spapr-hotplug.rst22 Device tree description of DRCs
28 paths in the device tree depending on the type of resource the DRCs manage.
32 arrays would be fetched as part of the device tree retrieval interfaces
272 ``0``: completed transmittal of device tree node.
274 ``1``: instruct guest to prepare for next device tree sibling node.
276 ``2``: instruct guest to prepare for next device tree child node.
278 ``3``: instruct guest to prepare for next device tree property.
280 ``4``: instruct guest to ascend to parent device tree node.
290 ``wa[0]``: DRC index of the DRC to fetch device tree nodes from.
344 guest's device tree using the standard format described in [LoPAR]_,
[all …]
/qemu/scripts/
A Ddecodetree.py834 def __prop_format(tree): argument
838 for (b, s) in tree.subs:
845 for (b, s) in tree.subs:
852 tree.base = f
856 self.__prop_format(self.tree)
1479 def prop_size(tree): argument
1482 if isinstance(tree, SizeTree):
1484 for (b, s) in tree.subs:
1488 assert min >= tree.width
1489 tree.width = min
[all …]
A Dupdate-syscalltbl.sh33 OUTPUT_PATH output directory, usually the qemu source tree (default: $PWD)
A Dgit.orderfile36 # decoding tree specification
/qemu/accel/tcg/
A Dtb-maint.c308 QTree *tree; member
554 pe = q_tree_lookup(set->tree, &index); in page_trylock_add()
565 q_tree_insert(set->tree, &pe->index, pe); in page_trylock_add()
612 set->tree = q_tree_new_full(tb_page_addr_cmp, NULL, NULL, in page_collection_lock()
618 q_tree_foreach(set->tree, page_entry_lock, NULL); in page_collection_lock()
629 q_tree_foreach(set->tree, page_entry_unlock, NULL); in page_collection_lock()
638 q_tree_foreach(set->tree, page_entry_unlock, NULL); in page_collection_lock()
649 q_tree_destroy(set->tree); in page_collection_unlock()
/qemu/python/
A DPACKAGE.rst22 the QEMU source tree. Contributions are welcome and follow the `QEMU
28 <https://gitlab.com/jsnow/qemu/-/tree/python>`_, and there is an
/qemu/tests/tcg/multiarch/gdbstub/
A Dregisters.py39 tree = ET.fromstring(xml)
40 for f in tree.findall("feature"):
/qemu/docs/devel/
A Dtrivial-patches.rst30 - git://github.com/vivier/qemu.git trivial-patches - `browse <https://github.com/vivier/qemu/tree/t…
39 2. Review trivial patches, merge them into a git tree, and reply to state
A Dsubmitting-a-pull-request.rst9 for more details). Generally only existing submaintainers of a tree
63 targeting a stable branch or some submaintainer tree, please include the
70 <https://git.linaro.org/people/peter.maydell/misc-scripts.git/tree/make-pullreq>`__
/qemu/docs/system/arm/
A Dversatile.rst35 enough to get something running. Nowadays an out-of-tree build is
38 points to the root of the Linux source tree. You can drop $SRC if you
/qemu/migration/
A Dvmstate-types.c720 GTree *tree = *pval; in put_gtree() local
721 uint32_t nnodes = g_tree_nnodes(tree); in put_gtree()
726 g_tree_foreach(tree, put_gtree_elem, (gpointer)&capsule); in put_gtree()
748 GTree *tree = *pval; in get_gtree() local
796 g_tree_insert(tree, key, val); in get_gtree()

Completed in 65 milliseconds

12345