/linux-master/tools/perf/util/ |
H A D | callchain.h | 64 struct rb_node rb_node_in; /* to insert nodes in an rbtree */ 65 struct rb_node rb_node; /* to sort nodes in an output tree */ member in struct:callchain_node
|
H A D | sort.h | 93 struct rb_node rb_node_in; 94 struct rb_node rb_node; member in struct:hist_entry
|
H A D | symbol.h | 49 struct rb_node rb_node; member in struct:symbol 82 * @nd: the 'struct rb_node *' to use as a temporary storage 86 nd && (pos = rb_entry(nd, struct symbol, rb_node)); \
|
H A D | annotate-data.c | 32 static int data_type_cmp(const void *_key, const struct rb_node *node) 44 static bool data_type_less(struct rb_node *node_a, const struct rb_node *node_b) 132 struct rb_node *node; 437 struct rb_node *node = rb_first(root);
|
/linux-master/fs/btrfs/ |
H A D | qgroup.h | 129 struct rb_node node; 147 struct rb_node node; 267 struct rb_node node; /* tree of qgroups */
|
H A D | backref.h | 259 struct rb_node rbnode; 317 struct rb_node rb_node; member in struct:btrfs_backref_node::__anon1678
|
H A D | defrag.c | 26 struct rb_node rb_node; member in struct:inode_defrag 77 struct rb_node **p; 78 struct rb_node *parent = NULL; 81 p = &fs_info->defrag_inodes.rb_node; 84 entry = rb_entry(parent, struct inode_defrag, rb_node); 105 rb_link_node(&defrag->rb_node, parent, p); 106 rb_insert_color(&defrag->rb_node, &fs_info->defrag_inodes); 179 struct rb_node *p; 180 struct rb_node *paren [all...] |
H A D | delayed-inode.c | 333 RB_CLEAR_NODE(&item->rb_node); 354 struct rb_node *node = root->rb_node; 359 rb_node); 374 struct rb_node **p, *node; 375 struct rb_node *parent_node = NULL; 385 p = &root->rb_root.rb_node; 386 node = &ins->rb_node; 391 rb_node); 432 if (RB_EMPTY_NODE(&delayed_item->rb_node)) [all...] |
/linux-master/mm/ |
H A D | backing-dev.c | 923 static struct rb_node **bdi_lookup_rb_node(u64 id, struct rb_node **parentp) 925 struct rb_node **p = &bdi_tree.rb_node; 926 struct rb_node *parent = NULL; 933 bdi = rb_entry(parent, struct backing_dev_info, rb_node); 958 struct rb_node **p; 963 bdi = rb_entry(*p, struct backing_dev_info, rb_node); 974 struct rb_node *parent, **p; 995 rb_link_node(&bdi->rb_node, paren [all...] |
H A D | kmemleak.c | 137 * rb_node are already protected by the corresponding locks or mutex (see 146 struct rb_node rb_node; member in struct:kmemleak_object 413 struct rb_node *rb = object_tree(objflags)->rb_node; 420 object = rb_entry(rb, struct kmemleak_object, rb_node); 424 rb = object->rb_node.rb_left; 426 rb = object->rb_node.rb_right; 585 rb_erase(&object->rb_node, object_tree(object->flags)); 691 struct rb_node **lin [all...] |
/linux-master/tools/perf/ui/browsers/ |
H A D | annotate.c | 27 struct rb_node *curr_hot; 251 struct rb_node **p = &root->rb_node; 252 struct rb_node *parent = NULL; 257 l = rb_entry(parent, struct annotation_line, rb_node); 264 rb_link_node(&al->rb_node, parent, p); 265 rb_insert_color(&al->rb_node, root); 292 struct rb_node *nd) 294 struct annotation_line * pos = rb_entry(nd, struct annotation_line, rb_node); 322 RB_CLEAR_NODE(&pos->al.rb_node); [all...] |
/linux-master/net/sched/ |
H A D | sch_fq.c | 78 struct rb_node fq_node; /* anchor in fq_root[] trees */ 93 struct rb_node rate_node; /* anchor in q->delayed tree */ 219 struct rb_node **p = &q->delayed.rb_node, *parent = NULL; 259 struct rb_node **p, *parent; 264 p = &root->rb_node; 349 struct rb_node **p, *parent; 397 p = &root->rb_node; 494 struct rb_node **p, *parent; 509 p = &flow->t_root.rb_node; [all...] |
H A D | sch_hfsc.c | 127 struct rb_node el_node; /* qdisc's eligible tree member */ 129 struct rb_node vt_node; /* parent's vt_tree member */ 131 struct rb_node cf_node; /* parent's cf_heap member */ 187 struct rb_node **p = &cl->sched->eligible.rb_node; 188 struct rb_node *parent = NULL; 221 struct rb_node *n; 237 struct rb_node *n; 252 struct rb_node **p = &cl->cl_parent->vt_tree.rb_node; [all...] |
/linux-master/block/ |
H A D | bfq-iosched.h | 121 struct rb_node weights_node; 153 struct rb_node rb_node; member in struct:bfq_entity 272 struct rb_node pos_node; 1137 struct bfq_entity *bfq_entity_of(struct rb_node *node);
|
/linux-master/tools/perf/tests/ |
H A D | hists_cumulate.c | 135 struct rb_node *node; 147 he = rb_entry(node, struct hist_entry, rb_node); 197 struct rb_node *node; 217 node && (he = rb_entry(node, struct hist_entry, rb_node)); 238 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node);
|
/linux-master/drivers/infiniband/hw/hfi1/ |
H A D | pin_system.c | 88 * kref_get()'s an additional kref on the returned rb_node to prevent rb_node 89 * from being released until after rb_node is assigned to an SDMA descriptor 91 * virtual address range for rb_node is invalidated between now and then. 97 struct mmu_rb_node *rb_node; local 101 rb_node = hfi1_mmu_rb_get_first(handler, start, (end - start)); 102 if (!rb_node) { 108 kref_get(&rb_node->refcount); 111 return container_of(rb_node, struct sdma_mmu_node, rb);
|
/linux-master/drivers/gpu/drm/nouveau/nvkm/core/ |
H A D | object.c | 37 struct rb_node *node = client->objroot.rb_node; 76 struct rb_node **ptr; 77 struct rb_node *parent = NULL; 81 ptr = &object->client->objroot.rb_node;
|
/linux-master/kernel/events/ |
H A D | uprobes.c | 55 struct rb_node rb_node; /* node in the rb tree */ member in struct:uprobe 631 rb_entry((node), struct uprobe, rb_node) 638 static inline int __uprobe_cmp_key(const void *key, const struct rb_node *b) 644 static inline int __uprobe_cmp(struct rb_node *a, const struct rb_node *b) 656 struct rb_node *node = rb_find(&key, &uprobes_tree, __uprobe_cmp_key); 681 struct rb_node *node; 683 node = rb_find_add(&uprobe->rb_node, &uprobes_tree, __uprobe_cmp); 926 return !RB_EMPTY_NODE(&uprobe->rb_node); [all...] |
/linux-master/fs/ubifs/ |
H A D | orphan.c | 49 struct rb_node **p, *parent = NULL; 64 p = &c->orph_tree.rb_node; 99 struct rb_node *p; 101 p = c->orph_tree.rb_node; 585 struct rb_node **p, *parent = NULL; 592 p = &c->orph_tree.rb_node; 841 struct rb_node rb; 868 struct rb_node **p, *parent = NULL; 875 p = &root->rb_node; 896 struct rb_node * [all...] |
/linux-master/drivers/gpu/drm/i915/ |
H A D | i915_active.c | 27 struct rb_node node; 143 ref->cache = fetch_node(ref->tree.rb_node); 152 rb_link_node(&ref->cache->node, NULL, &ref->tree.rb_node); 154 GEM_BUG_ON(ref->tree.rb_node != &ref->cache->node); 272 it = fetch_node(ref->tree.rb_node); 292 struct rb_node **p, *parent; 302 p = &ref->tree.rb_node; 776 struct rb_node *prev, *p; 796 p = ref->tree.rb_node; 812 * No quick match, but we did find the leftmost rb_node fo [all...] |
/linux-master/net/netfilter/ |
H A D | nf_conncount.c | 50 struct rb_node node; 320 struct rb_node **rbnode, *parent; 330 rbnode = &(root->rb_node); 403 struct rb_node *parent; 411 parent = rcu_dereference_raw(root->rb_node); 460 struct rb_node *node; 573 struct rb_node *node;
|
/linux-master/drivers/xen/ |
H A D | evtchn.c | 84 struct rb_node node; 110 struct rb_node **new = &(u->evtchns.rb_node), *parent = NULL; 145 struct rb_node *node = u->evtchns.rb_node; 671 struct rb_node *node; 673 while ((node = u->evtchns.rb_node)) {
|
/linux-master/fs/ntfs3/ |
H A D | bitmap.c | 26 struct rb_node node; 125 struct rb_node *node, *next; 142 static struct rb_node *rb_lookup(struct rb_root *root, size_t v) 144 struct rb_node **p = &root->rb_node; 145 struct rb_node *r = NULL; 169 struct rb_node **p = &root->rb_node; 170 struct rb_node *parent = NULL; 202 struct rb_node ** [all...] |
/linux-master/fs/overlayfs/ |
H A D | readdir.c | 24 struct rb_node node; 63 static struct ovl_cache_entry *ovl_cache_entry_from_node(struct rb_node *n) 69 struct rb_node ***link, 70 struct rb_node **parent) 73 struct rb_node **newp = *link; 97 struct rb_node *node = root->rb_node; 181 struct rb_node **newp = &rdd->root->rb_node; 182 struct rb_node *paren [all...] |
/linux-master/drivers/vfio/ |
H A D | vfio_iommu_type1.c | 89 struct rb_node node; 128 struct rb_node node; 168 struct rb_node *node = iommu->dma_list.rb_node; 184 static struct rb_node *vfio_find_dma_first_node(struct vfio_iommu *iommu, 187 struct rb_node *res = NULL; 188 struct rb_node *node = iommu->dma_list.rb_node; 211 struct rb_node **link = &iommu->dma_list.rb_node, *paren [all...] |