/linux-master/tools/perf/util/ |
H A D | map.c | 321 struct rb_node *nd = rb_first_cached(symbols); 324 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); 334 struct rb_node *nd = rb_last(&symbols->rb_root); 337 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
|
H A D | machine.h | 33 struct rb_node rb_node; member in struct:machine
|
/linux-master/drivers/mtd/ubi/ |
H A D | ubi.h | 172 struct rb_node rb; 194 struct rb_node rb; 684 struct rb_node rb; 719 struct rb_node rb; 1037 * @rb: a pointer to type 'struct rb_node' to use as a loop counter 1040 * @member: the name of the 'struct rb_node' within the RB-tree entry
|
/linux-master/arch/sh/include/asm/ |
H A D | dwarf.h | 248 struct rb_node node; 266 struct rb_node node;
|
/linux-master/drivers/infiniband/hw/mlx4/ |
H A D | mcg.c | 103 struct rb_node node; 165 struct rb_node *node = ctx->mcg_table.rb_node; 186 struct rb_node **link = &ctx->mcg_table.rb_node; 187 struct rb_node *parent = NULL; 1086 struct rb_node *p; 1238 struct rb_node *p;
|
/linux-master/tools/perf/tests/ |
H A D | hists_link.c | 164 struct rb_node *node; 214 struct rb_node *node;
|
/linux-master/fs/jffs2/ |
H A D | nodelist.c | 124 struct rb_node *parent = &base->rb; 125 struct rb_node **link = &parent; 193 rb_link_node(&holefrag->rb, NULL, &root->rb_node); 207 rb_link_node(&newfrag->rb, NULL, &root->rb_node); 528 struct rb_node *next; 534 next = fragtree->rb_node;
|
/linux-master/fs/ubifs/ |
H A D | recovery.c | 1230 struct rb_node rb; 1249 struct rb_node **p = &c->size_tree.rb_node, *parent = NULL; 1283 struct rb_node *p = c->size_tree.rb_node; 1530 struct rb_node *this = rb_first(&c->size_tree);
|
/linux-master/drivers/gpu/drm/vmwgfx/ |
H A D | vmwgfx_resource.c | 44 struct rb_node **new = &gbo->res_tree.rb_node, *parent = NULL; 760 struct rb_node *node = vbo->res_tree.rb_node; 1078 struct rb_node *cur = vbo->res_tree.rb_node;
|
/linux-master/net/802/ |
H A D | mrp.c | 240 struct rb_node *parent = app->mad.rb_node; 260 struct rb_node *parent = NULL, **p = &app->mad.rb_node; 298 struct rb_node *node, *next; 581 struct rb_node *node, *next;
|
/linux-master/fs/btrfs/ |
H A D | free-space-cache.c | 66 struct rb_node *node; 904 struct rb_node *n; 1080 struct rb_node *node = rb_first(&ctl->free_space_offset); 1592 struct rb_node **p; 1593 struct rb_node *parent = NULL; 1604 p = &root->rb_node; 1687 static bool entry_less(struct rb_node *node, const struct rb_node *parent) 1707 struct rb_node *n = ctl->free_space_offset.rb_node; [all...] |
H A D | disk-io.c | 659 RB_CLEAR_NODE(&root->rb_node); 750 static int global_root_cmp(struct rb_node *a_node, const struct rb_node *b_node) 752 const struct btrfs_root *a = rb_entry(a_node, struct btrfs_root, rb_node); 753 const struct btrfs_root *b = rb_entry(b_node, struct btrfs_root, rb_node); 758 static int global_root_key_cmp(const void *k, const struct rb_node *node) 761 const struct btrfs_root *root = rb_entry(node, struct btrfs_root, rb_node); 769 struct rb_node *tmp; 773 tmp = rb_find_add(&root->rb_node, &fs_info->global_root_tree, global_root_cmp); 789 rb_erase(&root->rb_node, [all...] |
/linux-master/tools/perf/ |
H A D | builtin-lock.c | 90 struct rb_node *node; 93 node = thread_stats.rb_node; 109 struct rb_node **rb = &thread_stats.rb_node; 110 struct rb_node *parent = NULL; 167 rb_link_node(&st->rb, NULL, &thread_stats.rb_node); 399 struct rb_node **rb = &sorted.rb_node; 400 struct rb_node *parent = NULL; 444 struct rb_node **r [all...] |
/linux-master/fs/ceph/ |
H A D | inode.c | 260 struct rb_node **p; 261 struct rb_node *parent = NULL; 265 p = &ci->i_fragtree.rb_node; 299 struct rb_node *n = ci->i_fragtree.rb_node; 470 struct rb_node *rb_node; local 485 rb_node = rb_first(&ci->i_fragtree); 486 frag = rb_entry(rb_node, struct ceph_inode_frag, node); 487 if (frag->frag != ceph_frag_make(0, 0) || rb_next(rb_node)) [all...] |
H A D | xattr.c | 576 struct rb_node **p; 577 struct rb_node *parent = NULL; 582 p = &ci->i_xattrs.index.rb_node; 675 struct rb_node **p; 676 struct rb_node *parent = NULL; 681 p = &ci->i_xattrs.index.rb_node; 743 struct rb_node *p; 767 struct rb_node *p, *tmp; 911 struct rb_node *p;
|
/linux-master/drivers/gpu/drm/i915/gvt/ |
H A D | kvmgt.c | 98 struct rb_node gfn_node; 99 struct rb_node dma_addr_node; 212 struct rb_node *node = vgpu->dma_addr_cache.rb_node; 230 struct rb_node *node = vgpu->gfn_cache.rb_node; 250 struct rb_node **link, *parent = NULL; 263 link = &vgpu->gfn_cache.rb_node; 278 link = &vgpu->dma_addr_cache.rb_node; 307 struct rb_node *nod [all...] |
/linux-master/mm/ |
H A D | ksm.c | 162 struct rb_node node; /* when node of stable tree */ 216 struct rb_node node; /* when node of unstable tree */ 1178 while (root_stable_tree[nid].rb_node) { 1179 stable_node = rb_entry(root_stable_tree[nid].rb_node, 1821 struct rb_node **new; 1822 struct rb_node *parent; 1836 new = &root->rb_node; 2072 struct rb_node **new; 2073 struct rb_node *parent; 2082 new = &root->rb_node; [all...] |
/linux-master/kernel/power/ |
H A D | swap.c | 124 struct rb_node node; 133 struct rb_node **new = &(swsusp_extents.rb_node); 134 struct rb_node *parent = NULL; 199 struct rb_node *node; 201 while ((node = swsusp_extents.rb_node)) { 216 return (swsusp_extents.rb_node != NULL);
|
/linux-master/block/ |
H A D | mq-deadline.c | 137 struct rb_node *node = rb_prev(&rq->rb_node); 151 struct rb_node *node = rb_next(&rq->rb_node); 166 struct rb_node *node = per_prio->sort_list[data_dir].rb_node; 219 if (!RB_EMPTY_NODE(&rq->rb_node))
|
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...] |
/linux-master/fs/gfs2/ |
H A D | rgrp.c | 526 struct rb_node *n, *next; 530 n = sdp->sd_rindex_tree.rb_node; 564 const struct rb_node *n; 585 const struct rb_node *n; 705 struct rb_node *n; 718 struct rb_node *n; 866 struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL; 1490 struct rb_node **newn, *parent = NULL; 1498 newn = &rgd->rd_rstree.rb_node; [all...] |
/linux-master/fs/ |
H A D | eventpoll.c | 134 struct rb_node rbn; 869 struct rb_node *rbp, *next; 1010 struct rb_node *rbp; 1112 struct rb_node *rbp; 1117 for (rbp = ep->rbr.rb_root.rb_node; rbp; ) { 1136 struct rb_node *rbp; 1407 struct rb_node **p = &ep->rbr.rb_root.rb_node, *parent = NULL; 2069 struct rb_node *rbp;
|
/linux-master/fs/afs/ |
H A D | cell.c | 56 struct rb_node *p; 73 p = net->cells.rb_node; 238 struct rb_node *parent, **pp; 268 pp = &net->cells.rb_node; 848 struct rb_node *cursor;
|
/linux-master/include/linux/ |
H A D | sched.h | 539 struct rb_node run_node; 599 struct rb_node rb_node; member in struct:sched_dl_entity 804 struct rb_node core_node; 879 struct rb_node pushable_dl_tasks;
|
/linux-master/fs/ext4/ |
H A D | dir.c | 406 struct rb_node rb_hash; 464 struct rb_node **p, *parent = NULL; 470 p = &info->root.rb_node;
|