Searched refs:rb_node (Results 1 - 25 of 51) sorted by relevance

123

/external/linux-tools-perf/util/include/linux/added/
H A Drbtree.h37 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)
106 struct rb_node struct
111 struct rb_node *rb_right;
112 struct rb_node *rb_lef
118 struct rb_node *rb_node; member in struct:rb_root
[all...]
/external/kernel-headers/original/linux/
H A Drbtree.h37 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/blktrace/
H A Drbtree.h37 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 Drbtree.c25 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/blktrace/btt/
H A Ddip_rb.c27 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 Dproc.c26 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 Dseek.c25 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/util/added/
H A Drbtree.c26 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root)
28 struct rb_node *right = node->rb_right;
29 struct rb_node *parent = rb_parent(node);
45 root->rb_node = right;
49 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root)
51 struct rb_node *left = node->rb_left;
52 struct rb_node *parent = rb_parent(node);
68 root->rb_node = left;
72 void rb_insert_color(struct rb_node *node, struct rb_root *root)
74 struct rb_node *paren
[all...]
/external/linux-tools-perf/util/
H A Dstrlist.h15 struct rb_node rb_node; member in struct:str_node
53 struct rb_node *rn = rb_first(&self->entries);
54 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
58 struct rb_node *rn;
61 rn = rb_next(&sn->rb_node);
62 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
H A Dstrlist.c42 struct rb_node **p = &self->entries.rb_node;
43 struct rb_node *parent = NULL;
50 sn = rb_entry(parent, struct str_node, rb_node);
65 rb_link_node(&sn->rb_node, parent, p);
66 rb_insert_color(&sn->rb_node, &self->entries);
101 rb_erase(&sn->rb_node, &self->entries);
107 struct rb_node **p = &self->entries.rb_node;
108 struct rb_node *paren
[all...]
H A Dmap.c31 RB_CLEAR_NODE(&self->rb_node);
82 struct rb_node *nd = rb_first(symbols);
84 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
92 struct rb_node *nd = rb_last(symbols);
94 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
235 struct rb_node *next = rb_first(self);
238 struct map *pos = rb_entry(next, struct map, rb_node);
240 next = rb_next(&pos->rb_node);
241 rb_erase(&pos->rb_node, self);
272 struct rb_node *nex
[all...]
H A Dthread.c66 struct rb_node **p = &self->threads.rb_node;
67 struct rb_node *parent = NULL;
80 th = rb_entry(parent, struct thread, rb_node);
95 rb_link_node(&th->rb_node, parent, p);
96 rb_insert_color(&th->rb_node, &self->threads);
131 struct rb_node *nd;
134 struct thread *pos = rb_entry(nd, struct thread, rb_node);
H A Dhist.c134 struct rb_node **p = &self->entries.rb_node;
135 struct rb_node *parent = NULL;
154 he = rb_entry(parent, struct hist_entry, rb_node);
173 rb_link_node(&he->rb_node, parent, p);
174 rb_insert_color(&he->rb_node, &self->entries);
228 struct rb_node **p = &root->rb_node;
229 struct rb_node *parent = NULL;
235 iter = rb_entry(parent, struct hist_entry, rb_node);
562 struct rb_node *rb_node; local
[all...]
H A Dthread.h16 struct rb_node rb_node; member in union:thread::__anon8999
H A Dtop.c46 struct rb_node **p = &tree->rb_node;
47 struct rb_node *parent = NULL;
52 iter = rb_entry(parent, struct sym_entry, rb_node);
60 rb_link_node(&se->rb_node, parent, p);
61 rb_insert_color(&se->rb_node, tree);
216 struct rb_node *nd;
222 struct sym_entry *syme = rb_entry(nd, struct sym_entry, rb_node);
H A Dtop.h22 struct rb_node rb_node; member in struct:sym_entry
H A Dsort.h56 struct rb_node rb_node; member in struct:hist_entry
H A Dcallchain.c39 struct rb_node **p = &root->rb_node;
40 struct rb_node *parent = NULL;
48 rnode = rb_entry(parent, struct callchain_node, rb_node);
71 rb_link_node(&chain->rb_node, parent, p);
72 rb_insert_color(&chain->rb_node, root);
119 rb_root->rb_node = chain_root->node.rb_root.rb_node;
144 rb_root->rb_node = chain_root->node.rb_root.rb_node;
[all...]
H A Dsymbol.c95 struct rb_node *nd, *prevnd = rb_first(symbols);
101 curr = rb_entry(prevnd, struct symbol, rb_node);
105 curr = rb_entry(nd, struct symbol, rb_node);
119 struct rb_node *nd, *prevnd = rb_first(&mg->maps[type]);
124 curr = rb_entry(prevnd, struct map, rb_node);
128 curr = rb_entry(nd, struct map, rb_node);
230 struct rb_node *next = rb_first(symbols);
233 pos = rb_entry(next, struct symbol, rb_node);
234 next = rb_next(&pos->rb_node);
235 rb_erase(&pos->rb_node, symbol
301 struct rb_node rb_node; member in struct:symbol_name_rb_node
[all...]
H A Dcallchain.h29 struct rb_node rb_node; /* to sort nodes in an rbtree */ member in struct:callchain_node
/external/linux-tools-perf/
H A Dbuiltin-diff.c72 struct rb_node **p = &root->rb_node;
73 struct rb_node *parent = NULL;
78 iter = rb_entry(parent, struct hist_entry, rb_node);
85 rb_link_node(&he->rb_node, parent, p);
86 rb_insert_color(&he->rb_node, root);
93 struct rb_node *next = rb_first(&self->entries);
96 struct hist_entry *n = rb_entry(next, struct hist_entry, rb_node);
98 next = rb_next(&n->rb_node);
99 rb_erase(&n->rb_node,
[all...]
H A Dbuiltin-kmem.c52 struct rb_node node;
122 struct rb_node **node = &root_alloc_stat.rb_node;
123 struct rb_node *parent = NULL;
162 struct rb_node **node = &root_caller_stat.rb_node;
163 struct rb_node *parent = NULL;
238 struct rb_node *node = root->rb_node;
350 struct rb_node *nex
[all...]
/external/linux-tools-perf/util/ui/browsers/
H A Dannotate.c22 struct rb_node *curr_hot;
26 struct rb_node rb_node; member in struct:objdump_line_rb_node
101 struct rb_node **p = &self->rb_node;
102 struct rb_node *parent = NULL;
107 l = rb_entry(parent, struct objdump_line_rb_node, rb_node);
113 rb_link_node(&line->rb_node, parent, p);
114 rb_insert_color(&line->rb_node, self);
118 struct rb_node *n
[all...]
H A Dhists.c71 struct rb_node *nd;
74 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
112 struct rb_node *nd;
116 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
134 struct rb_node *nd = rb_first(&self->rb_root);
137 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
167 struct rb_node *nd;
170 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
209 struct rb_node *nd;
212 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);
[all...]
H A Dmap.c55 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
73 return ((void *)self) - sizeof(struct rb_node) - sizeof(u32);
94 self->b.top = &sym->rb_node;
138 struct rb_node *nd;
143 struct symbol *pos = rb_entry(nd, struct symbol, rb_node);

Completed in 298 milliseconds

123