/linux-master/fs/nfsd/ |
H A D | cache.h | 34 struct rb_node c_node;
|
/linux-master/tools/perf/util/ |
H A D | lock-contention.h | 21 struct rb_node rb; /* used for sorting */ 93 struct rb_node rb;
|
H A D | symbol.c | 193 struct rb_node *nd; 202 curr = rb_entry(nd, struct symbol, rb_node); 204 nd = rb_next(&curr->rb_node); 208 next = rb_entry(nd, struct symbol, rb_node); 215 rb_erase_cached(&next->rb_node, symbols); 221 nd = rb_next(&curr->rb_node); 222 rb_erase_cached(&curr->rb_node, symbols); 231 struct rb_node *nd, *prevnd = rb_first_cached(symbols); 237 curr = rb_entry(prevnd, struct symbol, rb_node); 241 curr = rb_entry(nd, struct symbol, rb_node); 1013 struct rb_node rb_node; member in struct:module_info [all...] |
H A D | callchain.c | 382 struct rb_node **p = &root->rb_node; 383 struct rb_node *parent = NULL; 391 rnode = rb_entry(parent, struct callchain_node, rb_node); 415 rb_link_node(&chain->rb_node, parent, p); 416 rb_insert_color(&chain->rb_node, root); 423 struct rb_node *n; 453 struct rb_node *n; 475 rb_root->rb_node = chain_root->node.rb_root.rb_node; 1759 struct rb_node *rb_node = rb_first(root); local [all...] |
H A D | dsos.c | 134 struct rb_node **p = &root->rb_node; 135 struct rb_node *parent = NULL; 143 struct dso *this = rb_entry(*p, struct dso, rb_node); 173 rb_link_node(&dso->rb_node, parent, p); 174 rb_insert_color(&dso->rb_node, root);
|
/linux-master/drivers/android/ |
H A D | binder_internal.h | 177 * @rb_node: element for proc->nodes tree 235 struct rb_node rb_node; member in union:binder_node::__anon78 320 struct rb_node rb_node_desc; 321 struct rb_node rb_node_node; 442 * @rb_node: element for proc->threads rbtree 478 struct rb_node rb_node; member in struct:binder_thread
|
H A D | binder_alloc.h | 24 * @rb_node: node for allocated_buffers/free_buffers rb trees 44 struct rb_node rb_node; /* free entry by size or allocated entry */ member in struct:binder_buffer
|
/linux-master/fs/ |
H A D | xattr.c | 1114 static int rbtree_simple_xattr_cmp(const void *key, const struct rb_node *node) 1119 xattr = rb_entry(node, struct simple_xattr, rb_node); 1133 static int rbtree_simple_xattr_node_cmp(struct rb_node *new_node, 1134 const struct rb_node *node) 1137 xattr = rb_entry(new_node, struct simple_xattr, rb_node); 1160 struct rb_node *rbp; 1166 xattr = rb_entry(rbp, struct simple_xattr, rb_node); 1210 struct rb_node *parent = NULL, **rbp; 1227 rbp = &xattrs->rb_root.rb_node; 1236 old_xattr = rb_entry(*rbp, struct simple_xattr, rb_node); [all...] |
/linux-master/tools/bpf/resolve_btfids/ |
H A D | main.c | 102 struct rb_node rb_node; member in struct:btf_id 179 struct rb_node *p = root->rb_node; 184 id = rb_entry(p, struct btf_id, rb_node); 199 struct rb_node **p = &root->rb_node; 200 struct rb_node *parent = NULL; 206 id = rb_entry(parent, struct btf_id, rb_node); 220 rb_link_node(&id->rb_node, paren [all...] |
/linux-master/tools/perf/ui/stdio/ |
H A D | hist.c | 113 struct rb_node *node, *next; 130 child = rb_entry(node, struct callchain_node, rb_node); 206 static bool need_percent_display(struct rb_node *node, u64 parent_samples) 213 cnode = rb_entry(node, struct callchain_node, rb_node); 225 struct rb_node *node; 232 cnode = rb_entry(node, struct callchain_node, rb_node); 311 struct rb_node *rb_node = rb_first(tree); local 313 while (rb_node) { 314 chain = rb_entry(rb_node, struc 362 struct rb_node *rb_node = rb_first(tree); local [all...] |
/linux-master/fs/ext4/ |
H A D | block_validity.c | 24 struct rb_node node; 74 struct rb_node **n = &system_blks->root.rb_node, *node; 75 struct rb_node *parent = NULL, *new_node = NULL; 127 struct rb_node *node; 301 struct rb_node *n; 319 n = system_blks->root.rb_node;
|
/linux-master/fs/btrfs/ |
H A D | ref-verify.c | 25 struct rb_node node; 39 struct rb_node node; 74 struct rb_node node; 81 struct rb_node **p = &root->rb_node; 82 struct rb_node *parent_node = NULL; 103 struct rb_node *n; 106 n = root->rb_node; 122 struct rb_node **p = &root->rb_node; [all...] |
H A D | relocation.c | 93 struct rb_node rb_node; member in struct:mapping_node::__anon1702 109 struct rb_node rb_node; member in struct:tree_block::__anon1703 237 struct rb_node *rb_node; local 238 rb_erase(&node->rb_node, &cache->rb_root); 240 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); 241 if (rb_node) 360 struct rb_node *rb_node; local 555 struct rb_node *rb_node; local 634 struct rb_node *rb_node; local 667 struct rb_node *rb_node; local 711 struct rb_node *rb_node; local 2106 struct rb_node *rb_node; local 3236 struct rb_node *rb_node; local [all...] |
H A D | delayed-inode.h | 84 struct rb_node rb_node; member in struct:btrfs_delayed_item
|
/linux-master/kernel/trace/ |
H A D | trace_stat.c | 27 struct rb_node node; 77 struct rb_node **new = &(root->rb_node), *parent = NULL; 174 struct rb_node *node; 198 struct rb_node *node = p;
|
/linux-master/kernel/power/ |
H A D | wakelock.c | 29 struct rb_node node; 40 struct rb_node *node; 150 struct rb_node **node = &wakelocks_tree.rb_node; 151 struct rb_node *parent = *node;
|
/linux-master/drivers/md/ |
H A D | dm-cache-background-tracker.c | 16 struct rb_node node; 93 struct rb_node **new = &b->pending.rb_node, *parent = NULL; 122 struct rb_node **new = &b->pending.rb_node;
|
H A D | dm-writecache.c | 83 struct rb_node rb_node; member in struct:wc_entry 611 struct rb_node *node = wc->tree.rb_node; 617 e = container_of(node, struct wc_entry, rb_node); 622 e->rb_node.rb_left : e->rb_node.rb_right); 629 node = rb_next(&e->rb_node); 633 e = container_of(node, struct wc_entry, rb_node); 642 node = rb_prev(&e->rb_node); 838 struct rb_node *rb_node = rb_prev(&e->rb_node); local [all...] |
/linux-master/kernel/locking/ |
H A D | rtmutex_common.h | 33 struct rb_node entry; 123 struct rb_node *leftmost = rb_first_cached(&lock->waiters); 130 struct rb_node *leftmost = rb_first_cached(&lock->waiters);
|
/linux-master/include/net/ |
H A D | inetpeer.h | 37 struct rb_node rb_node; member in struct:inet_peer
|
/linux-master/include/linux/ |
H A D | xattr.h | 110 struct rb_node rb_node; member in struct:simple_xattr
|
H A D | pktcdvd.h | 144 struct rb_node rb_node; member in struct:pkt_rb_node
|
/linux-master/block/ |
H A D | blk-throttle.h | 72 struct rb_node rb_node; member in struct:throtl_grp
|
/linux-master/drivers/mtd/ubi/ |
H A D | fastmap-wl.c | 28 struct rb_node *p; 79 if (!ubi->free.rb_node) 151 if (!ubi->free.rb_node) 275 while (!ubi->free.rb_node && ubi->works_count) { 375 if (!ubi->used.rb_node) 380 if (!ubi->free.rb_node) 386 if (ubi->free.rb_node) { 550 e = rb_entry(rb_next(root->rb_node),
|
/linux-master/fs/f2fs/ |
H A D | gc.h | 61 struct rb_node rb_node; /* rb node located in rb-tree */ member in struct:victim_entry
|