Searched refs:interval_tree_iter_next (Results 1 – 4 of 4) sorted by relevance
| /openbmc/qemu/tests/unit/ |
| H A D | test-interval-tree.c | 47 g_assert(interval_tree_iter_next(&nodes[0], 0, 9) == NULL); in test_find_one_point()
49 g_assert(interval_tree_iter_next(&nodes[0], 0, 0) == NULL); in test_find_one_point()
75 find1 = interval_tree_iter_next(find0, 0, 9); in test_find_two_point()
82 g_assert(interval_tree_iter_next(&nodes[0], 0, 9) == NULL); in test_find_two_point()
96 g_assert(interval_tree_iter_next(&nodes[0], 0, 9) == NULL); in test_find_one_range()
131 g_assert(interval_tree_iter_next(&nodes[0], 100, 199) == NULL); in test_find_one_range_many()
182 find = interval_tree_iter_next(find, 2000, 2999); in test_find_many_range()
|
| /openbmc/qemu/include/qemu/ |
| H A D | interval-tree.h | 96 IntervalTreeNode *interval_tree_iter_next(IntervalTreeNode *node,
|
| /openbmc/qemu/util/ |
| H A D | interval-tree.c | 830 IntervalTreeNode *interval_tree_iter_next(IntervalTreeNode *node, in interval_tree_iter_next() function
|
| /openbmc/qemu/tcg/ |
| H A D | optimize.c | 164 IntervalTreeNode *r = interval_tree_iter_next(&mem->itree, s, l); in mem_copy_next()
|