| /external/e2fsprogs/lib/ext2fs/ |
| D | rbtree.h | 110 struct rb_node struct
115 struct rb_node *rb_right; argument
116 struct rb_node *rb_left; argument
122 struct rb_node *rb_node; member
126 #define ext2fs_rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
133 static inline void ext2fs_rb_set_parent(struct rb_node *rb, struct rb_node *p) in ext2fs_rb_set_parent()
137 static inline void ext2fs_rb_set_color(struct rb_node *rb, int color) in ext2fs_rb_set_color()
145 #define EXT2FS_RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
149 extern void ext2fs_rb_insert_color(struct rb_node *, struct rb_root *);
150 extern void ext2fs_rb_erase(struct rb_node *, struct rb_root *);
[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 | 34 struct rb_node node;
50 inline static struct bmap_rb_extent *node_to_extent(struct rb_node *node) in node_to_extent()
70 struct rb_node *node = NULL; in print_tree()
86 struct rb_node *new_node, *node, *next; in check_tree()
210 struct rb_node *node, *next; in rb_free_tree()
236 struct rb_node *dest_node, *src_node, *dest_last, **n; in rb_copy_bmap()
259 n = &dest_bp->root.rb_node; in rb_copy_bmap()
279 struct rb_node *node; in rb_truncate()
325 struct rb_node *parent = NULL, *next; in rb_test_bit()
326 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
782 rb_erase(&t->rb_node, &pci->rb_last); in __put_trace_last()
791 rb_erase(&t->rb_node, &rb_sort_root); in put_trace()
799 struct rb_node **p = &root->rb_node; in trace_rb_insert()
800 struct rb_node *parent = NULL; in trace_rb_insert()
806 __t = rb_entry(parent, struct trace, rb_node); in trace_rb_insert()
822 rb_link_node(&t->rb_node, parent, p); in trace_rb_insert()
823 rb_insert_color(&t->rb_node, root); in trace_rb_insert()
847 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/fio/lib/ |
| D | rbtree.h | 100 struct rb_node struct
105 struct rb_node *rb_right; argument
106 struct rb_node *rb_left; argument
112 struct rb_node *rb_node; member
116 #define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
123 static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) in rb_set_parent()
127 static inline void rb_set_color(struct rb_node *rb, int color) in rb_set_color()
135 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
139 extern void rb_insert_color(struct rb_node *, struct rb_root *);
140 extern void rb_erase(struct rb_node *, struct rb_root *);
[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 …]
|
| /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()
44 rb_link_node(&iop->rb_node, parent, p); in rb_insert()
45 rb_insert_color(&iop->rb_node, root); in rb_insert()
52 struct rb_node *n = root->rb_node; in rb_find_sec()
55 __iop = rb_entry(n, struct io, rb_node); in rb_find_sec()
67 void rb_foreach(struct rb_node *n, struct io *iop, in rb_foreach()
72 struct io *this = rb_entry(n, struct io, rb_node); in rb_foreach()
|
| D | seek.c | 25 struct rb_node rb_node; member
65 struct rb_node *parent = NULL; in __insert()
66 struct rb_node **p = &root->rb_node; in __insert()
70 sbp = rb_entry(parent, struct seek_bkt, rb_node); in __insert()
85 rb_link_node(&sbp->rb_node, parent, p); in __insert()
86 rb_insert_color(&sbp->rb_node, root); in __insert()
89 static void __destroy(struct rb_node *n) in __destroy()
92 struct seek_bkt *sbp = rb_entry(n, struct seek_bkt, rb_node); in __destroy()
138 static int __median(struct rb_node *n, long long sofar, long long target, in __median()
143 sbp = rb_entry(n, struct seek_bkt, rb_node); in __median()
[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
225 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/fio/t/ |
| D | dedupe.c | 52 struct rb_node rb_node; member
197 struct rb_node **p, *parent; in insert_chunk()
201 p = &rb_root.rb_node; in insert_chunk()
206 c = rb_entry(parent, struct chunk, rb_node); in insert_chunk()
230 RB_CLEAR_NODE(&c->rb_node); in insert_chunk()
233 rb_link_node(&c->rb_node, parent, p); in insert_chunk()
234 rb_insert_color(&c->rb_node, &rb_root); in insert_chunk()
500 struct rb_node *n; in iter_rb_tree()
511 c = rb_entry(n, struct chunk, rb_node); in iter_rb_tree()
|
| /external/fio/os/ |
| D | os-netbsd.h | 10 #define rb_node _rb_node macro
12 #undef rb_node
|
| D | os-dragonfly.h | 9 #define rb_node _rb_node macro
11 #undef rb_node
|
| /external/fio/ |
| D | iolog.c | 179 struct rb_node *n; in prune_io_piece_log()
182 ipo = rb_entry(n, struct io_piece, rb_node); in prune_io_piece_log()
203 struct rb_node **p, *parent; in log_io_piece()
244 RB_CLEAR_NODE(&ipo->rb_node); in log_io_piece()
250 p = &td->io_hist_tree.rb_node; in log_io_piece()
256 __ipo = rb_entry(parent, struct io_piece, rb_node); in log_io_piece()
284 rb_link_node(&ipo->rb_node, parent, p); in log_io_piece()
285 rb_insert_color(&ipo->rb_node, &td->io_hist_tree); in log_io_piece()
298 rb_erase(&ipo->rb_node, &td->io_hist_tree); in unlog_io_piece()
|
| D | iolog.h | 146 struct rb_node rb_node; member
|
| D | trim.c | 43 rb_erase(&ipo->rb_node, &td->io_hist_tree); in get_next_trim()
|
| /external/jemalloc/include/jemalloc/internal/ |
| D | extent.h | 49 rb_node(extent_node_t) szad_link;
56 rb_node(extent_node_t) ad_link;
|
| D | prof.h | 121 rb_node(prof_tctx_t) tctx_link;
163 rb_node(prof_gctx_t) dump_link;
194 rb_node(prof_tdata_t) tdata_link;
|
| /external/jemalloc/test/unit/ |
| D | rb.c | 19 rb_node(node_t) link;
|