Home
last modified time | relevance | path

Searched refs:interval_tree_iter_next (Results 1 – 8 of 8) sorted by relevance

/qemu/tests/unit/
H A Dtest-interval-tree.c47 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()
/qemu/include/qemu/
H A Dinterval-tree.h96 IntervalTreeNode *interval_tree_iter_next(IntervalTreeNode *node,
/qemu/accel/tcg/
H A Duser-exec.c171 n = interval_tree_iter_next(&p->itree, start, last); in pageflags_next()
183 n = interval_tree_iter_next(n, 0, -1)) { in walk_memory_regions()
892 next = n ? interval_tree_iter_next(n, start, last) : NULL; in page_reset_target_data()
895 next = next ? interval_tree_iter_next(n, start, last) : NULL) { in page_reset_target_data()
H A Dtb-maint.c143 n = interval_tree_iter_next(&tb->itree, start, last); in foreach_tb_next()
/qemu/linux-user/
H A Dmmap.c91 i = interval_tree_iter_next(i, start, start)) { in shm_region_find()
104 n = interval_tree_iter_next(i, start, last); in shm_region_rm_complete()
/qemu/util/
H A Dinterval-tree.c830 IntervalTreeNode *interval_tree_iter_next(IntervalTreeNode *node, in interval_tree_iter_next() function
/qemu/target/hppa/
H A Dmem_helper.c130 n = interval_tree_iter_next(i, va_b, va_e); in hppa_flush_tlb_range()
/qemu/tcg/
H A Doptimize.c193 IntervalTreeNode *r = interval_tree_iter_next(&mem->itree, s, l); in mem_copy_next()