Searched refs:IntervalTreeNode (Results 1 – 13 of 13) sorted by relevance
/openbmc/qemu/include/qemu/ |
H A D | interval-tree.h | 34 typedef struct IntervalTreeNode struct 41 } IntervalTreeNode; typedef 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;
|
/openbmc/qemu/util/ |
H A D | interval-tree.c | 650 #define rb_to_itree(N) container_of(N, IntervalTreeNode, rb) 652 static bool interval_tree_compute_max(IntervalTreeNode *node, bool exit) in interval_tree_compute_max() 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() 711 void interval_tree_insert(IntervalTreeNode *node, IntervalTreeRoot *root) in interval_tree_insert() 715 IntervalTreeNode *parent; in interval_tree_insert() [all …]
|
/openbmc/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()
|
/openbmc/qemu/accel/tcg/ |
H A D | user-exec.c | 151 IntervalTreeNode itree; 159 IntervalTreeNode *n; in pageflags_find() 168 IntervalTreeNode *n; in pageflags_next() 176 IntervalTreeNode *n; in walk_memory_regions() 870 IntervalTreeNode itree; 878 IntervalTreeNode *n, *next; in page_reset_target_data() 916 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()
|
/openbmc/qemu/include/exec/ |
H A D | translation-block.h | 103 IntervalTreeNode itree;
|
/openbmc/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 | 2899 IntervalTreeNode *n; in pgb_try_itree() 2981 IntervalTreeNode *b = g_new0(IntervalTreeNode, 1); in pgb_dynamic()
|
H A D | syscall.c | 8147 IntervalTreeNode *n = in open_self_maps_2()
|
/openbmc/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()
|
/openbmc/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()
|