/linux-master/tools/perf/util/ |
H A D | block-info.c | 407 struct rb_node *next = rb_first_cached(&hists->entries); 418 he = rb_entry(next, struct hist_entry, rb_node); 421 next = rb_next(&he->rb_node);
|
H A D | annotate.h | 152 struct rb_node rb_node; member in struct:annotation_line
|
H A D | annotate.c | 2480 struct rb_node **p = &root->rb_node; 2481 struct rb_node *parent = NULL; 2487 iter = rb_entry(parent, struct annotation_line, rb_node); 2509 rb_link_node(&al->rb_node, parent, p); 2510 rb_insert_color(&al->rb_node, root); 2529 struct rb_node **p = &root->rb_node; 2530 struct rb_node *parent = NULL; 2534 iter = rb_entry(parent, struct annotation_line, rb_node); [all...] |
/linux-master/drivers/infiniband/ulp/ipoib/ |
H A D | ipoib_main.c | 560 struct rb_node *n = priv->path_tree.rb_node; 565 path = rb_entry(n, struct ipoib_path, rb_node); 584 struct rb_node **n = &priv->path_tree.rb_node; 585 struct rb_node *pn = NULL; 591 tpath = rb_entry(pn, struct ipoib_path, rb_node); 603 rb_link_node(&path->rb_node, pn, n); 604 rb_insert_color(&path->rb_node, &priv->path_tree); 653 struct rb_node * [all...] |
/linux-master/drivers/infiniband/hw/qib/ |
H A D | qib_user_sdma.c | 61 struct rb_node node; 144 struct rb_node *node = root->rb_node; 162 struct rb_node **node = &(root->rb_node); 163 struct rb_node *parent = NULL;
|
/linux-master/drivers/block/xen-blkback/ |
H A D | blkback.c | 171 struct rb_node **new = NULL, *parent = NULL; 181 new = &ring->persistent_gnts.rb_node; 209 struct rb_node *node = NULL; 211 node = ring->persistent_gnts.rb_node; 248 struct rb_node *n; 335 struct rb_node *n;
|
/linux-master/mm/ |
H A D | nommu.c | 424 struct rb_node *p, *lastp; 457 struct rb_node **p, *parent; 462 p = &nommu_region_tree.rb_node; 487 BUG_ON(!nommu_region_tree.rb_node); 516 BUG_ON(!nommu_region_tree.rb_node); 1024 struct rb_node *rb;
|
/linux-master/drivers/mtd/ubi/ |
H A D | eba.c | 210 struct rb_node *p; 212 p = ubi->ltree.rb_node; 271 struct rb_node **p, *parent = NULL; 279 p = &ubi->ltree.rb_node; 1535 struct rb_node *rb; 1629 struct rb_node *rb;
|
/linux-master/drivers/platform/surface/aggregator/ |
H A D | controller.c | 291 struct rb_node node; 320 struct rb_node **link = &nf->refcount.rb_node; 321 struct rb_node *parent = NULL; 382 struct rb_node *node = nf->refcount.rb_node; 2530 struct rb_node *n; 2575 struct rb_node *n;
|
/linux-master/security/apparmor/ |
H A D | label.c | 670 struct rb_node **new, *parent = NULL; 679 new = &ls->root.rb_node; 726 struct rb_node *node; 732 node = vec_labelset(vec, n)->root.rb_node; 1147 struct rb_node *node; 1156 node = ls->root.rb_node; 1985 struct rb_node *node; 2017 struct rb_node *node;
|
/linux-master/fs/proc/ |
H A D | proc_sysctl.c | 117 struct rb_node *node = dir->root.rb_node; 145 struct rb_node *node = &head->node[entry - head->ctl_table].node; 146 struct rb_node **p = &head->parent->root.rb_node; 147 struct rb_node *parent = NULL; 184 struct rb_node *node = &head->node[entry - head->ctl_table].node; 362 static struct ctl_node *first_usable_entry(struct rb_node *node)
|
H A D | generic.c | 72 struct rb_node *node = dir->subdir.rb_node; 94 struct rb_node **new = &root->rb_node, *parent = NULL;
|
/linux-master/net/smc/ |
H A D | smc_core.h | 446 struct rb_node *node; 448 node = lgr->conns_all.rb_node;
|
/linux-master/fs/afs/ |
H A D | volume.c | 24 struct rb_node *parent = NULL, **pp; 28 pp = &cell->volumes.rb_node;
|
/linux-master/fs/btrfs/ |
H A D | ctree.h | 165 struct rb_node rb_node; member in struct:btrfs_root
|
/linux-master/drivers/block/ |
H A D | loop.c | 793 struct rb_node rb_node; member in struct:loop_worker 818 struct rb_node **node, *parent = NULL; 828 node = &lo->worker_tree.rb_node; 832 cur_worker = container_of(*node, struct loop_worker, rb_node); 864 rb_link_node(&worker->rb_node, parent, node); 865 rb_insert_color(&worker->rb_node, &lo->worker_tree); 903 rb_erase(&worker->rb_node, &lo->worker_tree);
|
/linux-master/include/net/ |
H A D | nexthop.h | 143 struct rb_node rb_node; /* entry on netns rbtree */ member in struct:nexthop
|
/linux-master/drivers/md/ |
H A D | dm-bio-prison-v1.c | 145 struct rb_node **new = &root->rb_node, *parent = NULL;
|
/linux-master/include/linux/ |
H A D | swap.h | 194 struct rb_node rb_node; member in struct:swap_extent
|
H A D | nfs_fs.h | 61 struct rb_node rb_node; member in struct:nfs_access_entry
|
/linux-master/tools/testing/selftests/kvm/lib/ |
H A D | kvm_util.c | 631 struct rb_node *node; 633 for (node = vm->regions.gpa_tree.rb_node; node; ) { 861 struct rb_node **cur, *parent; 863 for (cur = &gpa_tree->rb_node, parent = NULL; *cur; ) { 887 struct rb_node **cur, *parent; 889 for (cur = &hva_tree->rb_node, parent = NULL; *cur; ) { 1632 struct rb_node *node; 1634 for (node = vm->regions.hva_tree.rb_node; node; ) {
|
/linux-master/drivers/gpu/drm/nouveau/nvkm/subdev/mmu/ |
H A D | vmm.c | 852 struct rb_node **ptr = &vmm->free.rb_node; 853 struct rb_node *parent = NULL; 894 struct rb_node **ptr = &vmm->root.rb_node; 895 struct rb_node *parent = NULL; 916 struct rb_node *node = vmm->root.rb_node; 1031 struct rb_node *node; 1709 struct rb_node *nod [all...] |
/linux-master/tools/perf/ |
H A D | builtin-kwork.c | 315 struct rb_node *node = root->rb_root.rb_node; 339 struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; 549 struct rb_node *next; 1686 struct rb_node *node; 1904 struct rb_node *next; 1999 struct rb_node *next; 2071 struct rb_node *next; 2113 struct rb_node *nod [all...] |
H A D | builtin-sched.c | 114 struct rb_node node; 971 struct rb_node *node = root->rb_root.rb_node; 997 struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; 1469 struct rb_node *node; 2799 struct rb_node *rb_node = rb_first_cached(root); local 2805 while (rb_node) { 2806 chain = rb_entry(rb_node, struc [all...] |
/linux-master/block/ |
H A D | blk-throttle.c | 44 #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node) 361 RB_CLEAR_NODE(&tg->rb_node); 502 struct rb_node *n; 511 static void throtl_rb_erase(struct rb_node *n, 532 struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node; 533 struct rb_node *parent = NULL; 550 rb_link_node(&tg->rb_node, parent, node); 551 rb_insert_color_cached(&tg->rb_node, &parent_sq->pending_tree, 570 throtl_rb_erase(&tg->rb_node, parent_s [all...] |