/linux-master/arch/sh/include/asm/ |
H A D | dwarf.h | 248 struct rb_node node; 266 struct rb_node node;
|
/linux-master/arch/sh/kernel/ |
H A D | dwarf.c | 305 struct rb_node **rb_node = &cie_root.rb_node; local 320 while (*rb_node) { 323 cie_tmp = rb_entry(*rb_node, struct dwarf_cie, node); 332 rb_node = &(*rb_node)->rb_left; 334 rb_node = &(*rb_node)->rb_right; 349 struct rb_node **rb_nod local 738 struct rb_node **rb_node = &cie_root.rb_node; local 869 struct rb_node **rb_node = &fde_root.rb_node; local [all...] |
/linux-master/drivers/infiniband/hw/usnic/ |
H A D | usnic_uiom_interval_tree.h | 40 struct rb_node rb;
|
/linux-master/fs/ubifs/ |
H A D | log.c | 32 struct rb_node *p; 36 p = c->buds.rb_node; 61 struct rb_node *p; 69 p = c->buds.rb_node; 114 struct rb_node **p, *parent = NULL; 119 p = &c->buds.rb_node; 299 struct rb_node *p; 306 struct rb_node *p1 = p; 549 struct rb_node rb; 563 struct rb_node ** [all...] |
/linux-master/include/linux/ceph/ |
H A D | string_table.h | 13 struct rb_node node;
|
/linux-master/include/net/ |
H A D | inetpeer.h | 37 struct rb_node rb_node; member in struct:inet_peer
|
/linux-master/net/ceph/ |
H A D | auth_x.h | 16 struct rb_node node;
|
H A D | string_table.c | 14 struct rb_node **p, *parent; 19 p = &string_tree.rb_node; 52 p = &string_tree.rb_node;
|
/linux-master/tools/perf/util/ |
H A D | block-range.h | 23 struct rb_node node; 40 struct rb_node *n = rb_next(&br->node);
|
H A D | call-path.c | 22 RB_CLEAR_NODE(&cp->rb_node); 81 struct rb_node **p; 82 struct rb_node *node_parent = NULL; 92 p = &parent->children.rb_node; 95 cp = rb_entry(node_parent, struct call_path, rb_node); 110 rb_link_node(&cp->rb_node, node_parent, p); 111 rb_insert_color(&cp->rb_node, &parent->children);
|
H A D | comm.c | 14 struct rb_node rb_node; member in struct:comm_str 34 rb_erase(&cs->rb_node, &comm_str_root); 63 struct rb_node **p = &root->rb_node; 64 struct rb_node *parent = NULL; 70 iter = rb_entry(parent, struct comm_str, rb_node); 91 rb_link_node(&new->rb_node, parent, p); 92 rb_insert_color(&new->rb_node, root);
|
H A D | rblist.c | 15 struct rb_node **p = &rblist->entries.rb_root.rb_node; 16 struct rb_node *parent = NULL, *new_node; 46 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node) argument 48 rb_erase_cached(rb_node, &rblist->entries); 50 rblist->node_delete(rblist, rb_node); 53 static struct rb_node *__rblist__findnew(struct rblist *rblist, 57 struct rb_node **p = &rblist->entries.rb_root.rb_node; [all...] |
H A D | rblist.h | 11 * struct rb_node rb_node; 26 int (*node_cmp)(struct rb_node *rbn, const void *entry); 27 struct rb_node *(*node_new)(struct rblist *rlist, const void *new_entry); 28 void (*node_delete)(struct rblist *rblist, struct rb_node *rb_node); 35 void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node); 36 struct rb_node *rblist__find(struct rblist *rblist, const void *entry); 37 struct rb_node *rblist__findne [all...] |
H A D | strlist.c | 15 struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry) 18 struct rb_node *rc = NULL; 29 rc = &snode->rb_node; 47 void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node) argument 50 struct str_node *snode = container_of(rb_node, struct str_node, rb_node); 55 static int strlist__node_cmp(struct rb_node *rb_node, const void *entry) argument 58 struct str_node *snode = container_of(rb_node, struc 103 struct rb_node *rb_node = rblist__find(&slist->rblist, entry); local 201 struct rb_node *rb_node; local [all...] |
H A D | strlist.h | 11 struct rb_node rb_node; member in struct:str_node 60 struct rb_node *rn = rb_first_cached(&slist->rblist.entries); 61 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; 65 struct rb_node *rn; 68 rn = rb_next(&sn->rb_node); 69 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
|
/linux-master/arch/arm/xen/ |
H A D | p2m.c | 26 struct rb_node rbnode_phys; 35 struct rb_node **link = &phys_to_mach.rb_node; 36 struct rb_node *parent = NULL; 66 struct rb_node *n; 71 n = phys_to_mach.rb_node; 156 struct rb_node *n; 160 n = phys_to_mach.rb_node;
|
/linux-master/arch/arm64/kvm/ |
H A D | mmu.c | 433 struct rb_node node; 439 static struct hyp_shared_pfn *find_shared_pfn(u64 pfn, struct rb_node ***node, 440 struct rb_node **parent) 444 *node = &hyp_shared_pfns.rb_node; 462 struct rb_node **node, *parent; 492 struct rb_node **node, *parent;
|
/linux-master/arch/powerpc/kernel/ |
H A D | eeh_cache.c | 41 struct rb_node rb_node; member in struct:pci_io_addr_range 56 struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node; 60 piar = rb_entry(n, struct pci_io_addr_range, rb_node); 100 struct rb_node *n; 106 piar = rb_entry(n, struct pci_io_addr_range, rb_node); 121 struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node; 122 struct rb_node *paren [all...] |
/linux-master/arch/powerpc/perf/ |
H A D | hv-24x7.c | 601 struct rb_node node; 635 struct rb_node **new = &(root->rb_node), *parent = NULL;
|
/linux-master/arch/s390/kvm/ |
H A D | kvm-s390.c | 2225 struct rb_node *mnode = &ms->gfn_node[slots->node_idx];
|
H A D | kvm-s390.h | 242 struct rb_node *node;
|
/linux-master/arch/x86/events/intel/ |
H A D | uncore_discovery.c | 52 static inline int __type_cmp(const void *key, const struct rb_node *b) 68 struct rb_node *node = rb_find(&type_id, &discovery_tables, __type_cmp); 73 static inline bool __type_less(struct rb_node *a, const struct rb_node *b) 606 struct rb_node *node;
|
H A D | uncore_discovery.h | 117 struct rb_node node;
|
/linux-master/arch/x86/mm/pat/ |
H A D | memtype.h | 15 struct rb_node rb;
|
/linux-master/block/ |
H A D | bfq-iosched.c | 729 sector_t sector, struct rb_node **ret_parent, 730 struct rb_node ***rb_link) 732 struct rb_node **p, *parent; 736 p = &root->rb_node; 738 struct rb_node **n; 786 struct rb_node **p, *parent; 871 (bfqd->queue_weights_tree.rb_root.rb_node->rb_left || 872 bfqd->queue_weights_tree.rb_root.rb_node->rb_right); 903 struct rb_node **new = &(root->rb_root.rb_node), *paren [all...] |