/external/fio/lib/ |
H A D | rbtree.h | 37 struct rb_node * n = inode->i_rb_page_cache.rb_node; 56 struct rb_node * node) 58 struct rb_node ** p = &inode->i_rb_page_cache.rb_node; 59 struct rb_node * parent = NULL; 82 struct rb_node * node) 100 struct rb_node struct 105 struct rb_node *rb_right; 106 struct rb_node *rb_lef 112 struct rb_node *rb_node; member in struct:rb_root [all...] |
H A D | rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) 27 struct rb_node *right = node->rb_right; 28 struct rb_node *parent = rb_parent(node); 44 root->rb_node = right; 48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) 50 struct rb_node *left = node->rb_left; 51 struct rb_node *parent = rb_parent(node); 67 root->rb_node = left; 71 void rb_insert_color(struct rb_node *node, struct rb_root *root) 73 struct rb_node *paren [all...] |
/external/linux-tools-perf/src/include/linux/ |
H A D | rbtree.h | 35 struct rb_node { struct 37 struct rb_node *rb_right; 38 struct rb_node *rb_left; 43 struct rb_node *rb_node; member in struct:rb_root 47 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) 52 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL) 61 extern void rb_insert_color(struct rb_node *, struct rb_root *); 62 extern void rb_erase(struct rb_node *, struct rb_root *); 66 extern struct rb_node *rb_nex [all...] |
H A D | rbtree_augmented.h | 39 void (*propagate)(struct rb_node *node, struct rb_node *stop); 40 void (*copy)(struct rb_node *old, struct rb_node *new); 41 void (*rotate)(struct rb_node *old, struct rb_node *new); 44 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, 45 void (*augment_rotate)(struct rb_node *old, struct rb_node *new)); 47 rb_insert_augmented(struct rb_node *nod [all...] |
/external/blktrace/ |
H A D | rbtree.h | 37 struct rb_node * n = inode->i_rb_page_cache.rb_node; 56 struct rb_node * node) 58 struct rb_node ** p = &inode->i_rb_page_cache.rb_node; 59 struct rb_node * parent = NULL; 82 struct rb_node * node) 99 struct rb_node struct 104 struct rb_node *rb_right; 105 struct rb_node *rb_lef 110 struct rb_node *rb_node; member in struct:rb_root [all...] |
H A D | rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) 27 struct rb_node *right = node->rb_right; 28 struct rb_node *parent = rb_parent(node); 44 root->rb_node = right; 48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) 50 struct rb_node *left = node->rb_left; 51 struct rb_node *parent = rb_parent(node); 67 root->rb_node = left; 71 void rb_insert_color(struct rb_node *node, struct rb_root *root) 73 struct rb_node *paren [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | rbtree.h | 37 struct rb_node * n = inode->i_rb_page_cache.rb_node; 56 struct rb_node * node) 58 struct rb_node ** p = &inode->i_rb_page_cache.rb_node; 59 struct rb_node * parent = NULL; 82 struct rb_node * node) 110 struct rb_node struct 115 struct rb_node *rb_right; 116 struct rb_node *rb_lef 122 struct rb_node *rb_node; member in struct:rb_root [all...] |
H A D | rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root) 27 struct rb_node *right = node->rb_right; 28 struct rb_node *parent = ext2fs_rb_parent(node); 44 root->rb_node = right; 48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root) 50 struct rb_node *left = node->rb_left; 51 struct rb_node *parent = ext2fs_rb_parent(node); 67 root->rb_node = left; 71 void ext2fs_rb_insert_color(struct rb_node *node, struct rb_root *root) 73 struct rb_node *paren [all...] |
/external/linux-tools-perf/src/tools/perf/util/ |
H A D | intlist.c | 14 static struct rb_node *intlist__node_new(struct rblist *rblist __maybe_unused, 18 struct rb_node *rc = NULL; 23 rc = &node->rb_node; 35 struct rb_node *rb_node) 37 struct int_node *node = container_of(rb_node, struct int_node, rb_node); 42 static int intlist__node_cmp(struct rb_node *rb_node, const void *entry) argument 45 struct int_node *node = container_of(rb_node, struc 34 intlist__node_delete(struct rblist *rblist __maybe_unused, struct rb_node *rb_node) argument 63 struct rb_node *rb_node; local 124 struct rb_node *rb_node; local [all...] |
H A D | rblist.h | 10 * struct rb_node rb_node; 25 int (*node_cmp)(struct rb_node *rbn, const void *entry); 26 struct rb_node *(*node_new)(struct rblist *rlist, const void *new_entry); 27 void (*node_delete)(struct rblist *rblist, struct rb_node *rb_node); 33 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node); 34 struct rb_node *rblist__find(struct rblist *rblist, const void *entry); 35 struct rb_node *rblist__entr [all...] |
H A D | rblist.c | 16 struct rb_node **p = &rblist->entries.rb_node; 17 struct rb_node *parent = NULL, *new_node; 44 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node) argument 46 rb_erase(rb_node, &rblist->entries); 48 rblist->node_delete(rblist, rb_node); 51 struct rb_node *rblist__find(struct rblist *rblist, const void *entry) 53 struct rb_node **p = &rblist->entries.rb_node; [all...] |
H A D | strlist.c | 14 struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry) 17 struct rb_node *rc = NULL; 28 rc = &snode->rb_node; 46 void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node) argument 49 struct str_node *snode = container_of(rb_node, struct str_node, rb_node); 54 static int strlist__node_cmp(struct rb_node *rb_node, const void *entry) argument 57 struct str_node *snode = container_of(rb_node, struc 102 struct rb_node *rb_node = rblist__find(&slist->rblist, entry); local 165 struct rb_node *rb_node; local [all...] |
H A D | intlist.h | 10 struct rb_node rb_node; member in struct:int_node 45 struct rb_node *rn = rb_first(&ilist->rblist.entries); 46 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; 50 struct rb_node *rn; 53 rn = rb_next(&in->rb_node); 54 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
|
H A D | strlist.h | 10 struct rb_node rb_node; member in struct:str_node 47 struct rb_node *rn = rb_first(&slist->rblist.entries); 48 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; 52 struct rb_node *rn; 55 rn = rb_next(&sn->rb_node); 56 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
|
H A D | map.c | 44 RB_CLEAR_NODE(&map->rb_node); 132 struct rb_node *nd = rb_first(symbols); 134 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); 142 struct rb_node *nd = rb_last(symbols); 144 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); 283 struct rb_node *next = rb_first(maps); 286 struct map *pos = rb_entry(next, struct map, rb_node); 288 next = rb_next(&pos->rb_node); 289 rb_erase(&pos->rb_node, maps); 320 struct rb_node *nex [all...] |
H A D | symbol.c | 143 struct rb_node *nd; 149 curr = rb_entry(nd, struct symbol, rb_node); 151 nd = rb_next(&curr->rb_node); 152 next = rb_entry(nd, struct symbol, rb_node); 161 rb_erase(&next->rb_node, symbols); 164 nd = rb_next(&curr->rb_node); 165 rb_erase(&curr->rb_node, symbols); 172 struct rb_node *nd, *prevnd = rb_first(symbols); 178 curr = rb_entry(prevnd, struct symbol, rb_node); 182 curr = rb_entry(nd, struct symbol, rb_node); 344 struct rb_node rb_node; member in struct:symbol_name_rb_node [all...] |
H A D | hist.c | 167 struct rb_node *next = rb_first(&hists->entries); 174 n = rb_entry(next, struct hist_entry, rb_node); 177 next = rb_next(&n->rb_node); 246 struct rb_node *next = rb_first(&hists->entries); 250 n = rb_entry(next, struct hist_entry, rb_node); 251 next = rb_next(&n->rb_node); 261 rb_erase(&n->rb_node, &hists->entries); 346 struct rb_node **p; 347 struct rb_node *parent = NULL; 351 p = &hists->entries_in->rb_node; [all...] |
/external/blktrace/btt/ |
H A D | dip_rb.c | 27 struct rb_node *parent = NULL; 28 struct rb_node **p = &root->rb_node; 33 __iop = rb_entry(parent, struct io, rb_node); 44 rb_link_node(&iop->rb_node, parent, p); 45 rb_insert_color(&iop->rb_node, root); 52 struct rb_node *n = root->rb_node; 55 __iop = rb_entry(n, struct io, rb_node); 67 void rb_foreach(struct rb_node * [all...] |
H A D | proc.c | 26 struct rb_node rb_node; member in struct:pn_info 36 static void __foreach(struct rb_node *n, void (*f)(struct p_info *, void *), 41 f(rb_entry(n, struct pn_info, rb_node)->pip, arg); 46 static void __destroy(struct rb_node *n, int free_name, int free_pip) 49 struct pn_info *pnp = rb_entry(n, struct pn_info, rb_node); 68 struct rb_node *n = root_pid.rb_node; 71 this = rb_entry(n, struct pn_info, rb_node); 87 struct rb_node * [all...] |
H A D | seek.c | 25 struct rb_node rb_node; member in struct:seek_bkt 65 struct rb_node *parent = NULL; 66 struct rb_node **p = &root->rb_node; 70 sbp = rb_entry(parent, struct seek_bkt, rb_node); 85 rb_link_node(&sbp->rb_node, parent, p); 86 rb_insert_color(&sbp->rb_node, root); 89 static void __destroy(struct rb_node *n) 92 struct seek_bkt *sbp = rb_entry(n, struct seek_bkt, rb_node); [all...] |
/external/linux-tools-perf/src/lib/ |
H A D | rbtree.c | 47 static inline void rb_set_black(struct rb_node *rb) 52 static inline struct rb_node *rb_red_parent(struct rb_node *red) 54 return (struct rb_node *)red->__rb_parent_color; 63 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, 66 struct rb_node *parent = rb_parent(old); 73 __rb_insert(struct rb_node *node, struct rb_root *root, 74 void (*augment_rotate)(struct rb_node *old, struct rb_node *ne [all...] |
/external/fio/os/ |
H A D | os-dragonfly.h | 9 #define rb_node _rb_node macro 11 #undef rb_node macro
|
H A D | os-netbsd.h | 10 #define rb_node _rb_node macro 12 #undef rb_node macro
|
/external/linux-tools-perf/src/tools/perf/ui/browsers/ |
H A D | map.c | 23 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); 41 return ((void *)self) - sizeof(struct rb_node) - sizeof(u32); 63 self->b.top = &sym->rb_node; 112 struct rb_node *nd; 117 struct symbol *pos = rb_entry(nd, struct symbol, rb_node);
|
/external/linux-tools-perf/src/tools/perf/tests/ |
H A D | vmlinux-kallsyms.c | 24 struct rb_node *nd; 124 sym = rb_entry(nd, struct symbol, rb_node); 163 struct rb_node *nnd; 165 nnd = backwards ? rb_prev(&pair->rb_node) : 166 rb_next(&pair->rb_node); 168 struct symbol *next = rb_entry(nnd, struct symbol, rb_node); 198 struct map *pos = rb_entry(nd, struct map, rb_node), *pair; 218 struct map *pos = rb_entry(nd, struct map, rb_node), *pair; 243 struct map *pos = rb_entry(nd, struct map, rb_node);
|