| /external/mesa3d/src/util/ |
| D | rb_tree.h | 37 struct rb_node { struct
48 struct rb_node *left; argument
51 struct rb_node *right; argument
55 static inline struct rb_node *
56 rb_node_parent(struct rb_node *n) in rb_node_parent()
58 return (struct rb_node *)(n->parent & ~(uintptr_t)1); in rb_node_parent()
67 struct rb_node *root;
107 void rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent,
108 struct rb_node *node, bool insert_left);
119 rb_tree_insert(struct rb_tree *T, struct rb_node *node, in rb_tree_insert()
[all …]
|
| D | rb_tree.c | 43 rb_node_is_black(struct rb_node *n) in rb_node_is_black()
50 rb_node_is_red(struct rb_node *n) in rb_node_is_red()
56 rb_node_set_black(struct rb_node *n) in rb_node_set_black()
62 rb_node_set_red(struct rb_node *n) in rb_node_set_red()
68 rb_node_copy_color(struct rb_node *dst, struct rb_node *src) in rb_node_copy_color()
74 rb_node_set_parent(struct rb_node *n, struct rb_node *p) in rb_node_set_parent()
79 static struct rb_node *
80 rb_node_minimum(struct rb_node *node) in rb_node_minimum()
87 static struct rb_node *
88 rb_node_maximum(struct rb_node *node) in rb_node_maximum()
[all …]
|
| D | rb_tree_test.c | 52 struct rb_node node;
56 rb_test_node_cmp_void(const struct rb_node *n, const void *v) in rb_test_node_cmp_void()
63 rb_test_node_cmp(const struct rb_node *a, const struct rb_node *b) in rb_test_node_cmp()
163 struct rb_node *n; in validate_search()
190 struct rb_node *next = rb_node_next(n); in validate_search()
197 struct rb_node *prev = rb_node_prev(n); in validate_search()
|
| /external/e2fsprogs/lib/ext2fs/ |
| D | rbtree.h | 111 struct rb_node struct
116 struct rb_node *rb_right; argument
117 struct rb_node *rb_left; argument
123 struct rb_node *rb_node; member
127 #define ext2fs_rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
134 static inline void ext2fs_rb_set_parent(struct rb_node *rb, struct rb_node *p) in ext2fs_rb_set_parent()
138 static inline void ext2fs_rb_set_color(struct rb_node *rb, int color) in ext2fs_rb_set_color()
148 return root->rb_node == NULL; in ext2fs_rb_empty_root()
151 static inline int ext2fs_rb_empty_node(struct rb_node *node) in ext2fs_rb_empty_node()
156 static inline void ext2fs_rb_clear_node(struct rb_node *node) in ext2fs_rb_clear_node()
[all …]
|
| D | rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) in __rb_rotate_left()
27 struct rb_node *right = node->rb_right; in __rb_rotate_left()
28 struct rb_node *parent = ext2fs_rb_parent(node); in __rb_rotate_left()
44 root->rb_node = right; in __rb_rotate_left()
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) in __rb_rotate_right()
50 struct rb_node *left = node->rb_left; in __rb_rotate_right()
51 struct rb_node *parent = ext2fs_rb_parent(node); in __rb_rotate_right()
67 root->rb_node = left; in __rb_rotate_right()
71 void ext2fs_rb_insert_color(struct rb_node *node, struct rb_root *root) in ext2fs_rb_insert_color()
73 struct rb_node *parent, *gparent; in ext2fs_rb_insert_color()
[all …]
|
| D | blkmap64_rb.c | 38 struct rb_node node;
54 inline static struct bmap_rb_extent *node_to_extent(struct rb_node *node) in node_to_extent()
74 struct rb_node *node = NULL; in print_tree()
90 struct rb_node *node; in check_tree()
218 struct rb_node *node, *next; in rb_free_tree()
244 struct rb_node *dest_node, *src_node, *dest_last, **n; in rb_copy_bmap()
267 n = &dest_bp->root.rb_node; in rb_copy_bmap()
287 struct rb_node *node; in rb_truncate()
331 struct rb_node *parent = NULL, *next; in rb_test_bit()
332 struct rb_node **n = &bp->root.rb_node; in rb_test_bit()
[all …]
|
| /external/blktrace/ |
| D | rbtree.h | 99 struct rb_node struct
104 struct rb_node *rb_right; argument
105 struct rb_node *rb_left; argument
110 struct rb_node *rb_node; member
124 #define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
131 static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) in rb_set_parent()
135 static inline void rb_set_color(struct rb_node *rb, int color) in rb_set_color()
143 extern void rb_insert_color(struct rb_node *, struct rb_root *);
144 extern void rb_erase(struct rb_node *, struct rb_root *);
147 extern struct rb_node *rb_next(struct rb_node *);
[all …]
|
| D | rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) in __rb_rotate_left()
27 struct rb_node *right = node->rb_right; in __rb_rotate_left()
28 struct rb_node *parent = rb_parent(node); in __rb_rotate_left()
44 root->rb_node = right; in __rb_rotate_left()
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) in __rb_rotate_right()
50 struct rb_node *left = node->rb_left; in __rb_rotate_right()
51 struct rb_node *parent = rb_parent(node); in __rb_rotate_right()
67 root->rb_node = left; in __rb_rotate_right()
71 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
73 struct rb_node *parent, *gparent; in rb_insert_color()
[all …]
|
| D | blkparse.c | 226 struct rb_node rb_node; member
246 struct rb_node rb_node; member
784 rb_erase(&t->rb_node, &pci->rb_last); in __put_trace_last()
793 rb_erase(&t->rb_node, &rb_sort_root); in put_trace()
801 struct rb_node **p = &root->rb_node; in trace_rb_insert()
802 struct rb_node *parent = NULL; in trace_rb_insert()
808 __t = rb_entry(parent, struct trace, rb_node); in trace_rb_insert()
824 rb_link_node(&t->rb_node, parent, p); in trace_rb_insert()
825 rb_insert_color(&t->rb_node, root); in trace_rb_insert()
849 struct rb_node *n = rb_first(&pci->rb_last); in trace_rb_insert_last()
[all …]
|
| D | blkiomon.c | 46 struct rb_node node;
52 struct rb_node **node_ptr;
53 struct rb_node *parent;
63 struct rb_node node;
177 struct rb_node **p = &(dstat_tree[dstat_curr].rb_node); in blkiomon_find_dstat()
178 struct rb_node *parent = NULL; in blkiomon_find_dstat()
|
| /external/blktrace/btt/ |
| D | proc.c | 26 struct rb_node rb_node; member
36 static void __foreach(struct rb_node *n, void (*f)(struct p_info *, void *), in __foreach()
41 f(rb_entry(n, struct pn_info, rb_node)->pip, arg); in __foreach()
46 static void __destroy(struct rb_node *n, int free_name, int free_pip) in __destroy()
49 struct pn_info *pnp = rb_entry(n, struct pn_info, rb_node); in __destroy()
68 struct rb_node *n = root_pid.rb_node; in __find_process_pid()
71 this = rb_entry(n, struct pn_info, rb_node); in __find_process_pid()
87 struct rb_node *n = root_name.rb_node; in __find_process_name()
90 this = rb_entry(n, struct pn_info, rb_node); in __find_process_name()
106 struct rb_node *parent = NULL; in insert_pid()
[all …]
|
| D | dip_rb.c | 27 struct rb_node *parent = NULL; in rb_insert()
28 struct rb_node **p = &root->rb_node; in rb_insert()
33 __iop = rb_entry(parent, struct io, rb_node); in rb_insert()
41 rb_replace_node(parent, &iop->rb_node, root); in rb_insert()
46 rb_link_node(&iop->rb_node, parent, p); in rb_insert()
47 rb_insert_color(&iop->rb_node, root); in rb_insert()
54 struct rb_node *n = root->rb_node; in rb_find_sec()
57 __iop = rb_entry(n, struct io, rb_node); in rb_find_sec()
69 void rb_foreach(struct rb_node *n, struct io *iop, in rb_foreach()
74 struct io *this = rb_entry(n, struct io, rb_node); in rb_foreach()
|
| D | seek.c | 25 struct rb_node rb_node; member
66 struct rb_node *parent = NULL; in __insert()
67 struct rb_node **p = &root->rb_node; in __insert()
71 sbp = rb_entry(parent, struct seek_bkt, rb_node); in __insert()
86 rb_link_node(&sbp->rb_node, parent, p); in __insert()
87 rb_insert_color(&sbp->rb_node, root); in __insert()
90 static void __destroy(struct rb_node *n) in __destroy()
93 struct seek_bkt *sbp = rb_entry(n, struct seek_bkt, rb_node); in __destroy()
135 static int __median(struct rb_node *n, long long sofar, long long target, in __median()
140 sbp = rb_entry(n, struct seek_bkt, rb_node); in __median()
[all …]
|
| D | p_live.c | 25 struct rb_node rb_node; member
78 struct rb_node *parent = NULL; in __p_live_add()
79 struct rb_node **p = &root->rb_node; in __p_live_add()
83 plp = rb_entry(parent, struct p_live, rb_node); in __p_live_add()
87 rb_erase(&plp->rb_node, root); in __p_live_add()
103 rb_link_node(&plp->rb_node, parent, p); in __p_live_add()
104 rb_insert_color(&plp->rb_node, root); in __p_live_add()
125 static void p_live_visit(struct rb_node *n, struct get_info *gip) in p_live_visit()
127 struct p_live *plp = rb_entry(n, struct p_live, rb_node); in p_live_visit()
171 if (root->rb_node) in p_live_get()
[all …]
|
| D | devs.c | 34 static void __destroy(struct rb_node *n) in __destroy()
37 struct io *iop = rb_entry(n, struct io, rb_node); in __destroy()
50 __destroy(roots[i].rb_node); in __destroy_heads()
|
| D | globals.h | 152 struct rb_node rb_node; member
230 void rb_foreach(struct rb_node *n, struct io *iop,
|
| D | inlines.h | 298 rb_erase(&iop->rb_node, __get_root(iop->dip, iop->type)); in dip_rb_rem()
306 rb_foreach(__get_root(dip, type)->rb_node, iop, fnc, head); in dip_rb_fe()
|
| /external/llvm/test/Transforms/ConstProp/ |
| D | 2009-09-01-GEP-Crash.ll | 9 %3 = type { %struct.hrtimer_cpu_base*, i32, %struct.rb_root, %struct.rb_node*, %struct.pgprot, i64 …
11 …k_base = type { %struct.hrtimer_cpu_base*, i32, %struct.rb_root, %struct.rb_node*, %struct.pgprot,…
14 %struct.rb_node = type { i64, %struct.rb_node*, %struct.rb_node* }
15 %struct.rb_root = type { %struct.rb_node* }
|
| /external/llvm-project/llvm/test/Transforms/InstSimplify/ConstProp/ |
| D | 2009-09-01-GEP-Crash.ll | 9 %3 = type { %struct.hrtimer_cpu_base*, i32, %struct.rb_root, %struct.rb_node*, %struct.pgprot, i64 …
11 …k_base = type { %struct.hrtimer_cpu_base*, i32, %struct.rb_root, %struct.rb_node*, %struct.pgprot,…
14 %struct.rb_node = type { i64, %struct.rb_node*, %struct.rb_node* }
15 %struct.rb_root = type { %struct.rb_node* }
|
| /external/mesa3d/src/intel/tools/ |
| D | aub_mem.c | 40 struct rb_node node;
46 struct rb_node node;
80 struct rb_node *node = rb_node_next(&entry->node); in ggtt_entry_next()
97 cmp_ggtt_entry(const struct rb_node *node, const void *addr) in cmp_ggtt_entry()
106 struct rb_node *node = rb_tree_search_sloppy(&mem->ggtt, &virt_addr, in ensure_ggtt_entry()
124 struct rb_node *node = rb_tree_search(&mem->ggtt, &virt_addr, cmp_ggtt_entry); in search_ggtt_entry()
133 cmp_phys_mem(const struct rb_node *node, const void *addr) in cmp_phys_mem()
142 struct rb_node *node = rb_tree_search_sloppy(&mem->mem, &phys_addr, cmp_phys_mem); in ensure_phys_mem()
168 struct rb_node *node = rb_tree_search(&mem->mem, &phys_addr, cmp_phys_mem); in search_phys_mem()
|
| /external/jemalloc_new/include/jemalloc/internal/ |
| D | prof_structs.h | 80 rb_node(prof_tctx_t) tctx_link;
122 rb_node(prof_gctx_t) dump_link;
153 rb_node(prof_tdata_t) tdata_link;
|
| D | rb.h | 31 #define rb_node(a_type) \ macro
37 #define rb_node(a_type) \ macro
|
| /external/jemalloc_new/test/unit/ |
| D | rb.c | 21 rb_node(node_t) link;
|
| /external/libabigail/tests/data/test-read-dwarf/ |
| D | PR25007-sdhci.ko.abi | 2493 …<class-decl name='rb_node' size-in-bits='192' is-struct='yes' visibility='default' filepath='/ws/a…
3145 …<var-decl name='rb_node' type-id='type-id-529' visibility='default' filepath='/ws/android/kernel/a…
4578 …<var-decl name='rb_node' type-id='type-id-184' visibility='default' filepath='/ws/android/kernel/a…
|
| /external/libabigail/tests/data/test-diff-dwarf-abixml/ |
| D | PR25409-librte_bus_dpaa.so.20.0.abi | 2714 …<class-decl name='rb_node' size-in-bits='128' is-struct='yes' visibility='default' filepath='../..…
|