/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
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 | 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.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 | 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 | thread.h | 11 struct rb_node rb_node; member in union:thread::__anon25206
|
H A D | machine.h | 21 struct rb_node rb_node; member in struct:machine
|
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 | callchain.h | 27 struct rb_node rb_node; /* to sort nodes in an rbtree */ member in struct:callchain_node
|
H A D | dso.h | 67 struct rb_node rb_node; member in struct:dso_cache
|
H A D | map.h | 29 struct rb_node rb_node; member in union:map::__anon25193
|
H A D | sort.h | 78 struct rb_node rb_node_in; 79 struct rb_node rb_node; member in struct:hist_entry
|
H A D | symbol.h | 75 struct rb_node rb_node; member in struct:symbol
|
/external/jemalloc/include/jemalloc/internal/ |
H A D | rb.h | 27 #define rb_node(a_type) \ macro 33 #define rb_node(a_type) \ macro 214 * rb_node(ex_node_t) ex_link;
|
/external/linux-tools-perf/perf-3.12.0/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...] |
/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...] |
/external/chromium_org/tools/android/heap_profiler/ |
H A D | heap_profiler.h | 47 RB_ENTRY(Alloc) rb_node; // Anchor for the RB-tree; member in struct:Alloc
|
/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...] |
/external/fio/os/ |
H A D | os-netbsd.h | 10 #define rb_node _rb_node macro 12 #undef rb_node macro
|
/external/blktrace/btt/ |
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...] |
H A D | globals.h | 152 struct rb_node rb_node; member in struct:io 225 void rb_foreach(struct rb_node *n, struct io *iop,
|
/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...] |
/external/fio/ |
H A D | iolog.h | 78 struct rb_node rb_node; member in union:io_piece::__anon21435
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/ui/stdio/ |
H A D | hist.c | 86 struct rb_node *node, *next; 102 child = rb_entry(node, struct callchain_node, rb_node); 168 struct rb_node *node; 179 cnode = rb_entry(node, struct callchain_node, rb_node); 247 struct rb_node *rb_node; local 250 rb_node = rb_first(self); 251 while (rb_node) { 254 chain = rb_entry(rb_node, struct callchain_node, rb_node); [all...] |
/external/linux-tools-perf/perf-3.12.0/tools/perf/ui/browsers/ |
H A D | annotate.c | 15 struct rb_node rb_node; member in struct:browser_disasm_line 39 struct rb_node *curr_hot; 281 struct rb_node **p = &root->rb_node; 282 struct rb_node *parent = NULL; 287 l = rb_entry(parent, struct browser_disasm_line, rb_node); 294 rb_link_node(&bdl->rb_node, parent, p); 295 rb_insert_color(&bdl->rb_node, root); 322 struct rb_node *n [all...] |