Searched refs:IntervalTreeNode (Results 1 – 13 of 13) sorted by relevance
/qemu/include/qemu/ |
H A D | interval-tree.h | 34 typedef struct IntervalTreeNode struct 41 } IntervalTreeNode; argument 63 void interval_tree_insert(IntervalTreeNode *node, IntervalTreeRoot *root); 72 void interval_tree_remove(IntervalTreeNode *node, IntervalTreeRoot *root); 83 IntervalTreeNode *interval_tree_iter_first(IntervalTreeRoot *root, 96 IntervalTreeNode *interval_tree_iter_next(IntervalTreeNode *node,
|
H A D | selfmap.h | 15 IntervalTreeNode itree;
|
/qemu/util/ |
H A D | interval-tree.c | 654 IntervalTreeNode *child; in interval_tree_compute_max() 679 IntervalTreeNode *node = rb_to_itree(rb); in interval_tree_propagate() 689 IntervalTreeNode *old = rb_to_itree(rb_old); in interval_tree_copy() 690 IntervalTreeNode *new = rb_to_itree(rb_new); in interval_tree_copy() 697 IntervalTreeNode *old = rb_to_itree(rb_old); in interval_tree_rotate() 698 IntervalTreeNode *new = rb_to_itree(rb_new); in interval_tree_rotate() 715 IntervalTreeNode *parent; in interval_tree_insert() 753 static IntervalTreeNode *interval_tree_subtree_search(IntervalTreeNode *node, in interval_tree_subtree_search() 798 IntervalTreeNode *node, *leftmost; in interval_tree_iter_first() 830 IntervalTreeNode *interval_tree_iter_next(IntervalTreeNode *node, in interval_tree_iter_next() [all …]
|
/qemu/tests/unit/ |
H A D | test-interval-tree.c | 12 static IntervalTreeNode nodes[20]; 15 static void rand_interval(IntervalTreeNode *n, uint64_t start, uint64_t last) in rand_interval() 62 IntervalTreeNode *find0, *find1; in test_find_two_point() 156 IntervalTreeNode *find; in test_find_many_range()
|
/qemu/accel/tcg/ |
H A D | user-exec.c | 152 IntervalTreeNode itree; 160 IntervalTreeNode *n; in pageflags_find() 169 IntervalTreeNode *n; in pageflags_next() 177 IntervalTreeNode *n; in walk_memory_regions() 876 IntervalTreeNode itree; 884 IntervalTreeNode *n, *next; in page_reset_target_data() 922 IntervalTreeNode *n; in page_get_target_data()
|
H A D | tb-maint.c | 132 IntervalTreeNode *n = interval_tree_iter_first(&tb_root, start, last); in foreach_tb_first() 140 IntervalTreeNode *n; in foreach_tb_next()
|
/qemu/include/exec/ |
H A D | translation-block.h | 103 IntervalTreeNode itree;
|
/qemu/linux-user/ |
H A D | mmap.c | 79 IntervalTreeNode *i = g_new0(IntervalTreeNode, 1); in shm_region_add() 88 IntervalTreeNode *i; in shm_region_find() 101 IntervalTreeNode *i, *n; in shm_region_rm_complete()
|
H A D | elfload.c | 2897 IntervalTreeNode *n; in pgb_try_itree() 2979 IntervalTreeNode *b = g_new0(IntervalTreeNode, 1); in pgb_dynamic()
|
H A D | syscall.c | 8108 IntervalTreeNode *n = in open_self_maps_2()
|
/qemu/target/hppa/ |
H A D | cpu.h | 185 IntervalTreeNode itree;
|
H A D | mem_helper.c | 74 IntervalTreeNode *i = interval_tree_iter_first(&env->tlb_root, addr, addr); in hppa_find_tlb() 120 IntervalTreeNode *i, *n; in hppa_flush_tlb_range()
|
/qemu/tcg/ |
H A D | optimize.c | 42 IntervalTreeNode itree; 187 IntervalTreeNode *r = interval_tree_iter_first(&ctx->mem_copy, s, l); in mem_copy_first() 193 IntervalTreeNode *r = interval_tree_iter_next(&mem->itree, s, l); in mem_copy_next()
|