Home
last modified time | relevance | path

Searched refs:interval_tree_iter_first (Results 1 – 7 of 7) sorted by relevance

/openbmc/qemu/tests/unit/
H A Dtest-interval-tree.c35 g_assert(interval_tree_iter_first(&root, 0, UINT64_MAX) == NULL); in test_empty()
46 g_assert(interval_tree_iter_first(&root, 0, 9) == &nodes[0]); in test_find_one_point()
48 g_assert(interval_tree_iter_first(&root, 0, 0) == NULL); in test_find_one_point()
50 g_assert(interval_tree_iter_first(&root, 0, 1) == &nodes[0]); in test_find_one_point()
51 g_assert(interval_tree_iter_first(&root, 1, 1) == &nodes[0]); in test_find_one_point()
52 g_assert(interval_tree_iter_first(&root, 1, 2) == &nodes[0]); in test_find_one_point()
53 g_assert(interval_tree_iter_first(&root, 2, 2) == NULL); in test_find_one_point()
72 find0 = interval_tree_iter_first(&root, 0, 9); in test_find_two_point()
81 g_assert(interval_tree_iter_first(&root, 0, 9) == &nodes[0]); in test_find_two_point()
95 g_assert(interval_tree_iter_first(&root, 0, 9) == &nodes[0]); in test_find_one_range()
[all …]
/openbmc/qemu/include/qemu/
H A Dinterval-tree.h83 IntervalTreeNode *interval_tree_iter_first(IntervalTreeRoot *root,
/openbmc/qemu/linux-user/
H A Dmmap.c92 for (i = interval_tree_iter_first(&shm_regions, start, start); i; in shm_region_find()
105 for (i = interval_tree_iter_first(&shm_regions, start, last); i; i = n) { in shm_region_rm_complete()
H A Delfload.c979 n = interval_tree_iter_first(root, s, l); in pgb_try_itree()
H A Dsyscall.c8467 interval_tree_iter_first(d->host_maps, host_start, host_start); in open_self_maps_2()
/openbmc/qemu/util/
H A Dinterval-tree.c795 IntervalTreeNode *interval_tree_iter_first(IntervalTreeRoot *root, in interval_tree_iter_first() function
/openbmc/qemu/tcg/
H A Doptimize.c158 IntervalTreeNode *r = interval_tree_iter_first(&ctx->mem_copy, s, l); in mem_copy_first()