rb_node 374 block/as-iosched.c struct rb_node *rbnext = rb_next(&last->rb_node);
rb_node 375 block/as-iosched.c struct rb_node *rbprev = rb_prev(&last->rb_node);
rb_node 378 block/as-iosched.c BUG_ON(RB_EMPTY_NODE(&last->rb_node));
rb_node 389 block/as-iosched.c if (rbnext && rbnext != &last->rb_node)
rb_node 978 block/as-iosched.c BUG_ON(RB_EMPTY_NODE(&rq->rb_node));
rb_node 118 block/blk-core.c RB_CLEAR_NODE(&rq->rb_node);
rb_node 72 block/cfq-iosched.c struct rb_node *left;
rb_node 142 block/cfq-iosched.c struct rb_node rb_node;
rb_node 413 block/cfq-iosched.c return rb_entry(root->left, struct cfq_queue, rb_node);
rb_node 434 block/cfq-iosched.c struct rb_node *rbnext = rb_next(&last->rb_node);
rb_node 435 block/cfq-iosched.c struct rb_node *rbprev = rb_prev(&last->rb_node);
rb_node 438 block/cfq-iosched.c BUG_ON(RB_EMPTY_NODE(&last->rb_node));
rb_node 447 block/cfq-iosched.c if (rbnext && rbnext != &last->rb_node)
rb_node 472 block/cfq-iosched.c struct rb_node **p, *parent;
rb_node 480 block/cfq-iosched.c if (parent && parent != &cfqq->rb_node) {
rb_node 481 block/cfq-iosched.c __cfqq = rb_entry(parent, struct cfq_queue, rb_node);
rb_node 492 block/cfq-iosched.c if (!RB_EMPTY_NODE(&cfqq->rb_node)) {
rb_node 499 block/cfq-iosched.c cfq_rb_erase(&cfqq->rb_node, &cfqd->service_tree);
rb_node 504 block/cfq-iosched.c p = &cfqd->service_tree.rb.rb_node;
rb_node 506 block/cfq-iosched.c struct rb_node **n;
rb_node 509 block/cfq-iosched.c __cfqq = rb_entry(parent, struct cfq_queue, rb_node);
rb_node 536 block/cfq-iosched.c cfqd->service_tree.left = &cfqq->rb_node;
rb_node 539 block/cfq-iosched.c rb_link_node(&cfqq->rb_node, parent, p);
rb_node 540 block/cfq-iosched.c rb_insert_color(&cfqq->rb_node, &cfqd->service_tree.rb);
rb_node 579 block/cfq-iosched.c if (!RB_EMPTY_NODE(&cfqq->rb_node))
rb_node 580 block/cfq-iosched.c cfq_rb_erase(&cfqq->rb_node, &cfqd->service_tree);
rb_node 1468 block/cfq-iosched.c RB_CLEAR_NODE(&cfqq->rb_node);
rb_node 68 block/deadline-iosched.c struct rb_node *node = rb_next(&rq->rb_node);
rb_node 375 block/elevator.c struct rb_node **p = &root->rb_node;
rb_node 376 block/elevator.c struct rb_node *parent = NULL;
rb_node 381 block/elevator.c __rq = rb_entry(parent, struct request, rb_node);
rb_node 391 block/elevator.c rb_link_node(&rq->rb_node, parent, p);
rb_node 392 block/elevator.c rb_insert_color(&rq->rb_node, root);
rb_node 399 block/elevator.c BUG_ON(RB_EMPTY_NODE(&rq->rb_node));
rb_node 400 block/elevator.c rb_erase(&rq->rb_node, root);
rb_node 401 block/elevator.c RB_CLEAR_NODE(&rq->rb_node);
rb_node 407 block/elevator.c struct rb_node *n = root->rb_node;
rb_node 411 block/elevator.c rq = rb_entry(n, struct request, rb_node);
rb_node 1219 block/elevator.c struct rb_node *rbprev = rb_prev(&rq->rb_node);
rb_node 1231 block/elevator.c struct rb_node *rbnext = rb_next(&rq->rb_node);
rb_node 48 fs/afs/callback.c vnode = rb_entry(server->cb_promises.rb_node,
rb_node 147 fs/afs/callback.c struct rb_node *p;
rb_node 151 fs/afs/callback.c p = server->fs_vnodes.rb_node;
rb_node 253 fs/afs/callback.c ASSERT(server->cb_promises.rb_node != NULL);
rb_node 277 fs/afs/callback.c ASSERT(server->cb_promises.rb_node != NULL);
rb_node 276 fs/afs/internal.h struct rb_node master_rb; /* link in master by-addr tree */
rb_node 368 fs/afs/internal.h struct rb_node server_rb; /* link in server->fs_vnodes */
rb_node 369 fs/afs/internal.h struct rb_node cb_promise; /* link in server->cb_promises */
rb_node 35 fs/afs/server.c struct rb_node **pp, *p;
rb_node 43 fs/afs/server.c pp = &afs_servers.rb_node;
rb_node 184 fs/afs/server.c struct rb_node *p;
rb_node 191 fs/afs/server.c p = afs_servers.rb_node;
rb_node 258 fs/afs/server.c ASSERTCMP(server->fs_vnodes.rb_node, ==, NULL);
rb_node 259 fs/afs/server.c ASSERTCMP(server->cb_promises.rb_node, ==, NULL);
rb_node 52 fs/afs/vnode.c if (dump_tree_aux(server->cb_promises.rb_node, NULL, 0, '-'))
rb_node 65 fs/afs/vnode.c struct rb_node *parent, **p;
rb_node 83 fs/afs/vnode.c p = &server->fs_vnodes.rb_node;
rb_node 119 fs/afs/vnode.c struct rb_node *parent, **p;
rb_node 154 fs/afs/vnode.c p = &server->cb_promises.rb_node;
rb_node 138 fs/eventpoll.c struct rb_node rbn;
rb_node 413 fs/eventpoll.c struct rb_node *rbp;
rb_node 563 fs/eventpoll.c struct rb_node *rbp;
rb_node 568 fs/eventpoll.c for (rbp = ep->rbr.rb_node; rbp; ) {
rb_node 679 fs/eventpoll.c struct rb_node **p = &ep->rbr.rb_node, *parent = NULL;
rb_node 212 fs/ext2/balloc.c struct rb_node *n;
rb_node 303 fs/ext2/balloc.c struct rb_node *n = root->rb_node;
rb_node 343 fs/ext2/balloc.c struct rb_node *node = &rsv->rsv_node;
rb_node 346 fs/ext2/balloc.c struct rb_node ** p = &root->rb_node;
rb_node 347 fs/ext2/balloc.c struct rb_node * parent = NULL;
rb_node 791 fs/ext2/balloc.c struct rb_node *next;
rb_node 1052 fs/ext2/balloc.c struct rb_node *next;
rb_node 199 fs/ext3/balloc.c struct rb_node *n;
rb_node 290 fs/ext3/balloc.c struct rb_node *n = root->rb_node;
rb_node 330 fs/ext3/balloc.c struct rb_node *node = &rsv->rsv_node;
rb_node 333 fs/ext3/balloc.c struct rb_node ** p = &root->rb_node;
rb_node 334 fs/ext3/balloc.c struct rb_node * parent = NULL;
rb_node 984 fs/ext3/balloc.c struct rb_node *next;
rb_node 1247 fs/ext3/balloc.c struct rb_node *next;
rb_node 255 fs/ext3/dir.c struct rb_node rb_hash;
rb_node 269 fs/ext3/dir.c struct rb_node *n = root->rb_node;
rb_node 270 fs/ext3/dir.c struct rb_node *parent;
rb_node 297 fs/ext3/dir.c root->rb_node = NULL;
rb_node 332 fs/ext3/dir.c struct rb_node **p, *parent = NULL;
rb_node 338 fs/ext3/dir.c p = &info->root.rb_node;
rb_node 261 fs/ext4/dir.c struct rb_node rb_hash;
rb_node 275 fs/ext4/dir.c struct rb_node *n = root->rb_node;
rb_node 276 fs/ext4/dir.c struct rb_node *parent;
rb_node 303 fs/ext4/dir.c root->rb_node = NULL;
rb_node 338 fs/ext4/dir.c struct rb_node **p, *parent = NULL;
rb_node 344 fs/ext4/dir.c p = &info->root.rb_node;
rb_node 937 fs/ext4/ext4.h struct rb_node *curr_node;
rb_node 123 fs/jffs2/nodelist.c struct rb_node *parent = &base->rb;
rb_node 124 fs/jffs2/nodelist.c struct rb_node **link = &parent;
rb_node 192 fs/jffs2/nodelist.c rb_link_node(&holefrag->rb, NULL, &root->rb_node);
rb_node 206 fs/jffs2/nodelist.c rb_link_node(&newfrag->rb, NULL, &root->rb_node);
rb_node 527 fs/jffs2/nodelist.c struct rb_node *next;
rb_node 533 fs/jffs2/nodelist.c next = fragtree->rb_node;
rb_node 569 fs/jffs2/nodelist.c if (!root->rb_node)
rb_node 574 fs/jffs2/nodelist.c frag = (rb_entry(root->rb_node, struct jffs2_node_frag, rb));
rb_node 229 fs/jffs2/nodelist.h struct rb_node rb;
rb_node 267 fs/jffs2/nodelist.h struct rb_node rb;
rb_node 325 fs/jffs2/nodelist.h struct rb_node *node = rb_first(root);
rb_node 335 fs/jffs2/nodelist.h struct rb_node *node = rb_last(root);
rb_node 369 fs/jffs2/nodelist.h struct rb_node *rb_next(struct rb_node *);
rb_node 370 fs/jffs2/nodelist.h struct rb_node *rb_prev(struct rb_node *);
rb_node 177 fs/jffs2/readinode.c struct rb_node *next;
rb_node 182 fs/jffs2/readinode.c next = tn_root->rb_node;
rb_node 331 fs/jffs2/readinode.c struct rb_node *parent;
rb_node 332 fs/jffs2/readinode.c struct rb_node **link = &rii->tn_root.rb_node;
rb_node 384 fs/jffs2/readinode.c struct rb_node *parent = rb_parent(node);
rb_node 385 fs/jffs2/readinode.c struct rb_node **link;
rb_node 391 fs/jffs2/readinode.c link = &root->rb_node;
rb_node 406 fs/jffs2/readinode.c struct rb_node **link = &ver_root->rb_node;
rb_node 407 fs/jffs2/readinode.c struct rb_node *parent = NULL;
rb_node 519 fs/jffs2/readinode.c struct rb_node *this;
rb_node 522 fs/jffs2/readinode.c this = list->rb_node;
rb_node 546 fs/jffs2/readinode.c list->rb_node = NULL;
rb_node 1695 fs/nfs/dir.c rb_erase(&cache->rb_node, &nfsi->access_cache);
rb_node 1723 fs/nfs/dir.c struct rb_node *n, *dispose = NULL;
rb_node 1728 fs/nfs/dir.c entry = rb_entry(n, struct nfs_access_entry, rb_node);
rb_node 1741 fs/nfs/dir.c nfs_access_free_entry(rb_entry(n, struct nfs_access_entry, rb_node));
rb_node 1761 fs/nfs/dir.c struct rb_node *n = NFS_I(inode)->access_cache.rb_node;
rb_node 1765 fs/nfs/dir.c entry = rb_entry(n, struct nfs_access_entry, rb_node);
rb_node 1800 fs/nfs/dir.c rb_erase(&cache->rb_node, &nfsi->access_cache);
rb_node 1815 fs/nfs/dir.c struct rb_node **p = &root_node->rb_node;
rb_node 1816 fs/nfs/dir.c struct rb_node *parent = NULL;
rb_node 1822 fs/nfs/dir.c entry = rb_entry(parent, struct nfs_access_entry, rb_node);
rb_node 1831 fs/nfs/dir.c rb_link_node(&set->rb_node, parent, p);
rb_node 1832 fs/nfs/dir.c rb_insert_color(&set->rb_node, root_node);
rb_node 1837 fs/nfs/dir.c rb_replace_node(parent, &set->rb_node, root_node);
rb_node 1849 fs/nfs/dir.c RB_CLEAR_NODE(&cache->rb_node);
rb_node 74 fs/nfs/nfs4_fs.h struct rb_node rb_node;
rb_node 87 fs/nfs/nfs4_fs.h struct rb_node so_client_node;
rb_node 100 fs/nfs/nfs4state.c struct rb_node *pos;
rb_node 116 fs/nfs/nfs4state.c struct rb_node *pos;
rb_node 134 fs/nfs/nfs4state.c struct rb_node **p, *parent;
rb_node 147 fs/nfs/nfs4state.c p = &root->rb_node;
rb_node 152 fs/nfs/nfs4state.c pos = rb_entry(parent, struct nfs_unique_id, rb_node);
rb_node 161 fs/nfs/nfs4state.c rb_link_node(&new->rb_node, parent, p);
rb_node 162 fs/nfs/nfs4state.c rb_insert_color(&new->rb_node, root);
rb_node 174 fs/nfs/nfs4state.c pos = rb_entry(parent, struct nfs_unique_id, rb_node);
rb_node 183 fs/nfs/nfs4state.c rb_erase(&id->rb_node, root);
rb_node 190 fs/nfs/nfs4state.c struct rb_node **p = &clp->cl_state_owners.rb_node,
rb_node 222 fs/nfs/nfs4state.c struct rb_node **p = &clp->cl_state_owners.rb_node,
rb_node 906 fs/nfs/nfs4state.c struct rb_node *pos;
rb_node 935 fs/nfs/nfs4state.c struct rb_node *pos;
rb_node 78 fs/ocfs2/cluster/nodemanager.c struct rb_node **p = &cluster->cl_node_ip_tree.rb_node;
rb_node 79 fs/ocfs2/cluster/nodemanager.c struct rb_node *parent = NULL;
rb_node 262 fs/ocfs2/cluster/nodemanager.c struct rb_node **p, *parent;
rb_node 44 fs/ocfs2/cluster/nodemanager.h struct rb_node nd_ip_node;
rb_node 707 fs/ocfs2/cluster/tcp.c struct rb_node **p = &o2net_handler_tree.rb_node;
rb_node 708 fs/ocfs2/cluster/tcp.c struct rb_node *parent = NULL;
rb_node 756 fs/ocfs2/cluster/tcp.c struct rb_node **p, *parent;
rb_node 185 fs/ocfs2/cluster/tcp_internal.h struct rb_node nh_node;
rb_node 72 fs/ocfs2/uptodate.c struct rb_node c_node;
rb_node 92 fs/ocfs2/uptodate.c struct rb_node *node;
rb_node 168 fs/ocfs2/uptodate.c struct rb_node * n = ci->ci_cache.ci_tree.rb_node;
rb_node 266 fs/ocfs2/uptodate.c struct rb_node *parent = NULL;
rb_node 267 fs/ocfs2/uptodate.c struct rb_node **p = &ci->ci_cache.ci_tree.rb_node;
rb_node 85 fs/proc/nommu.c vma = rb_entry((struct rb_node *) v, struct vm_area_struct, vm_rb);
rb_node 91 fs/proc/nommu.c struct rb_node *_rb;
rb_node 116 fs/proc/nommu.c return rb_next((struct rb_node *) v);
rb_node 585 fs/ubifs/debug.c struct rb_node *rb;
rb_node 1491 fs/ubifs/debug.c struct rb_node rb;
rb_node 1529 fs/ubifs/debug.c struct rb_node **p, *parent = NULL;
rb_node 1533 fs/ubifs/debug.c p = &fsckd->inodes.rb_node;
rb_node 1582 fs/ubifs/debug.c struct rb_node *p;
rb_node 1585 fs/ubifs/debug.c p = fsckd->inodes.rb_node;
rb_node 1825 fs/ubifs/debug.c struct rb_node *this = fsckd->inodes.rb_node;
rb_node 1865 fs/ubifs/debug.c struct rb_node *this = rb_first(&fsckd->inodes);
rb_node 48 fs/ubifs/log.c struct rb_node *p;
rb_node 52 fs/ubifs/log.c p = c->buds.rb_node;
rb_node 77 fs/ubifs/log.c struct rb_node *p;
rb_node 85 fs/ubifs/log.c p = c->buds.rb_node;
rb_node 140 fs/ubifs/log.c struct rb_node **p, *parent = NULL;
rb_node 145 fs/ubifs/log.c p = &c->buds.rb_node;
rb_node 183 fs/ubifs/log.c struct rb_node *p;
rb_node 337 fs/ubifs/log.c struct rb_node *p;
rb_node 344 fs/ubifs/log.c struct rb_node *p1 = p;
rb_node 573 fs/ubifs/log.c struct rb_node rb;
rb_node 587 fs/ubifs/log.c struct rb_node **p = &done_tree->rb_node, *parent = NULL;
rb_node 619 fs/ubifs/log.c struct rb_node *this = done_tree->rb_node;
rb_node 72 fs/ubifs/orphan.c struct rb_node **p, *parent = NULL;
rb_node 86 fs/ubifs/orphan.c p = &c->orph_tree.rb_node;
rb_node 122 fs/ubifs/orphan.c struct rb_node *p;
rb_node 125 fs/ubifs/orphan.c p = c->orph_tree.rb_node;
rb_node 512 fs/ubifs/orphan.c struct rb_node **p, *parent = NULL;
rb_node 519 fs/ubifs/orphan.c p = &c->orph_tree.rb_node;
rb_node 726 fs/ubifs/orphan.c struct rb_node rb;
rb_node 742 fs/ubifs/orphan.c struct rb_node *p;
rb_node 745 fs/ubifs/orphan.c p = c->orph_tree.rb_node;
rb_node 764 fs/ubifs/orphan.c struct rb_node **p, *parent = NULL;
rb_node 771 fs/ubifs/orphan.c p = &root->rb_node;
rb_node 792 fs/ubifs/orphan.c struct rb_node *p;
rb_node 794 fs/ubifs/orphan.c p = root->rb_node;
rb_node 809 fs/ubifs/orphan.c struct rb_node *this = root->rb_node;
rb_node 1209 fs/ubifs/recovery.c struct rb_node rb;
rb_node 1228 fs/ubifs/recovery.c struct rb_node **p = &c->size_tree.rb_node, *parent = NULL;
rb_node 1262 fs/ubifs/recovery.c struct rb_node *p = c->size_tree.rb_node;
rb_node 1298 fs/ubifs/recovery.c struct rb_node *this = c->size_tree.rb_node;
rb_node 1459 fs/ubifs/recovery.c struct rb_node *this = rb_first(&c->size_tree);
rb_node 72 fs/ubifs/replay.c struct rb_node rb;
rb_node 258 fs/ubifs/replay.c struct rb_node *this = c->replay_tree.rb_node;
rb_node 294 fs/ubifs/replay.c struct rb_node *this = rb_first(&c->replay_tree);
rb_node 336 fs/ubifs/replay.c struct rb_node **p = &c->replay_tree.rb_node, *parent = NULL;
rb_node 401 fs/ubifs/replay.c struct rb_node **p = &c->replay_tree.rb_node, *parent = NULL;
rb_node 664 fs/ubifs/replay.c struct rb_node **p = &c->replay_tree.rb_node, *parent = NULL;
rb_node 787 fs/ubifs/super.c struct rb_node *this = c->buds.rb_node;
rb_node 79 fs/ubifs/tnc.c struct rb_node **p, *parent = NULL;
rb_node 87 fs/ubifs/tnc.c p = &c->old_idx.rb_node;
rb_node 180 fs/ubifs/tnc.c struct rb_node *this = c->old_idx.rb_node;
rb_node 168 fs/ubifs/tnc_commit.c struct rb_node *p;
rb_node 170 fs/ubifs/tnc_commit.c p = c->old_idx.rb_node;
rb_node 252 fs/ubifs/ubifs.h struct rb_node rb;
rb_node 682 fs/ubifs/ubifs.h struct rb_node rb;
rb_node 853 fs/ubifs/ubifs.h struct rb_node rb;
rb_node 177 include/linux/blkdev.h struct rb_node rb_node; /* sort/lookup */
rb_node 174 include/linux/elevator.h #define rb_entry_rq(node) rb_entry((node), struct request, rb_node)
rb_node 39 include/linux/ext2_fs_sb.h struct rb_node rsv_node;
rb_node 737 include/linux/ext3_fs.h struct rb_node *curr_node;
rb_node 38 include/linux/ext3_fs_i.h struct rb_node rsv_node;
rb_node 123 include/linux/hrtimer.h struct rb_node node;
rb_node 167 include/linux/hrtimer.h struct rb_node *first;
rb_node 125 include/linux/key.h struct rb_node serial_node;
rb_node 176 include/linux/mempolicy.h struct rb_node nd;
rb_node 120 include/linux/mm_types.h struct rb_node vm_rb;
rb_node 72 include/linux/nfs_fs.h struct rb_node rb_node;
rb_node 240 include/linux/pktcdvd.h struct rb_node rb_node;
rb_node 105 include/linux/rbtree.h struct rb_node *rb_right;
rb_node 106 include/linux/rbtree.h struct rb_node *rb_left;
rb_node 112 include/linux/rbtree.h struct rb_node *rb_node;
rb_node 116 include/linux/rbtree.h #define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3))
rb_node 135 include/linux/rbtree.h #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
rb_node 143 include/linux/rbtree.h extern struct rb_node *rb_next(struct rb_node *);
rb_node 144 include/linux/rbtree.h extern struct rb_node *rb_prev(struct rb_node *);
rb_node 145 include/linux/rbtree.h extern struct rb_node *rb_first(struct rb_root *);
rb_node 146 include/linux/rbtree.h extern struct rb_node *rb_last(struct rb_root *);
rb_node 959 include/linux/sched.h struct rb_node run_node;
rb_node 79 include/net/garp.h struct rb_node node;
rb_node 259 kernel/fork.c struct rb_node **rb_link, *rb_parent;
rb_node 279 kernel/fork.c rb_link = &mm->mm_rb.rb_node;
rb_node 834 kernel/hrtimer.c struct rb_node **link = &base->active.rb_node;
rb_node 835 kernel/hrtimer.c struct rb_node *parent = NULL;
rb_node 1302 kernel/hrtimer.c struct rb_node *node;
rb_node 1392 kernel/hrtimer.c struct rb_node *node;
rb_node 1600 kernel/hrtimer.c struct rb_node *node;
rb_node 73 kernel/power/swsusp.c struct rb_node node;
rb_node 82 kernel/power/swsusp.c struct rb_node **new = &(swsusp_extents.rb_node);
rb_node 83 kernel/power/swsusp.c struct rb_node *parent = NULL;
rb_node 148 kernel/power/swsusp.c struct rb_node *node;
rb_node 150 kernel/power/swsusp.c while ((node = swsusp_extents.rb_node)) {
rb_node 165 kernel/power/swsusp.c return (swsusp_extents.rb_node != NULL);
rb_node 391 kernel/sched.c struct rb_node *rb_leftmost;
rb_node 229 kernel/sched_fair.c struct rb_node **link = &cfs_rq->tasks_timeline.rb_node;
rb_node 230 kernel/sched_fair.c struct rb_node *parent = NULL;
rb_node 274 kernel/sched_fair.c struct rb_node *next_node;
rb_node 295 kernel/sched_fair.c static inline struct rb_node *first_fair(struct cfs_rq *cfs_rq)
rb_node 307 kernel/sched_fair.c struct rb_node *last = rb_last(&cfs_rq->tasks_timeline);
rb_node 79 kernel/time/timer_list.c struct rb_node *curr;
rb_node 28 lib/rbtree.c struct rb_node *right = node->rb_right;
rb_node 29 lib/rbtree.c struct rb_node *parent = rb_parent(node);
rb_node 45 lib/rbtree.c root->rb_node = right;
rb_node 51 lib/rbtree.c struct rb_node *left = node->rb_left;
rb_node 52 lib/rbtree.c struct rb_node *parent = rb_parent(node);
rb_node 68 lib/rbtree.c root->rb_node = left;
rb_node 74 lib/rbtree.c struct rb_node *parent, *gparent;
rb_node 83 lib/rbtree.c register struct rb_node *uncle = gparent->rb_right;
rb_node 96 lib/rbtree.c register struct rb_node *tmp;
rb_node 108 lib/rbtree.c register struct rb_node *uncle = gparent->rb_left;
rb_node 121 lib/rbtree.c register struct rb_node *tmp;
rb_node 134 lib/rbtree.c rb_set_black(root->rb_node);
rb_node 141 lib/rbtree.c struct rb_node *other;
rb_node 143 lib/rbtree.c while ((!node || rb_is_black(node)) && node != root->rb_node)
rb_node 166 lib/rbtree.c struct rb_node *o_left;
rb_node 178 lib/rbtree.c node = root->rb_node;
rb_node 203 lib/rbtree.c register struct rb_node *o_right;
rb_node 215 lib/rbtree.c node = root->rb_node;
rb_node 226 lib/rbtree.c struct rb_node *child, *parent;
rb_node 235 lib/rbtree.c struct rb_node *old = node, *left;
rb_node 263 lib/rbtree.c root->rb_node = node;
rb_node 284 lib/rbtree.c root->rb_node = child;
rb_node 295 lib/rbtree.c struct rb_node *rb_first(struct rb_root *root)
rb_node 297 lib/rbtree.c struct rb_node *n;
rb_node 299 lib/rbtree.c n = root->rb_node;
rb_node 308 lib/rbtree.c struct rb_node *rb_last(struct rb_root *root)
rb_node 310 lib/rbtree.c struct rb_node *n;
rb_node 312 lib/rbtree.c n = root->rb_node;
rb_node 321 lib/rbtree.c struct rb_node *rb_next(struct rb_node *node)
rb_node 323 lib/rbtree.c struct rb_node *parent;
rb_node 350 lib/rbtree.c struct rb_node *rb_prev(struct rb_node *node)
rb_node 352 lib/rbtree.c struct rb_node *parent;
rb_node 378 lib/rbtree.c struct rb_node *parent = rb_parent(victim);
rb_node 387 lib/rbtree.c root->rb_node = new;
rb_node 1693 mm/mempolicy.c struct rb_node *n = sp->root.rb_node;
rb_node 1709 mm/mempolicy.c struct rb_node *prev = rb_prev(n);
rb_node 1724 mm/mempolicy.c struct rb_node **p = &sp->root.rb_node;
rb_node 1725 mm/mempolicy.c struct rb_node *parent = NULL;
rb_node 1751 mm/mempolicy.c if (!sp->root.rb_node)
rb_node 1797 mm/mempolicy.c struct rb_node *next = rb_next(&n->nd);
rb_node 1894 mm/mempolicy.c struct rb_node *next;
rb_node 1896 mm/mempolicy.c if (!p->root.rb_node)
rb_node 306 mm/mmap.c struct rb_node *nd, *pn = NULL;
rb_node 358 mm/mmap.c struct rb_node ** __rb_link, * __rb_parent, * rb_prev;
rb_node 360 mm/mmap.c __rb_link = &mm->mm_rb.rb_node;
rb_node 480 mm/mmap.c struct rb_node ** rb_link, * rb_parent;
rb_node 1100 mm/mmap.c struct rb_node **rb_link, *rb_parent;
rb_node 1470 mm/mmap.c struct rb_node * rb_node;
rb_node 1472 mm/mmap.c rb_node = mm->mm_rb.rb_node;
rb_node 1475 mm/mmap.c while (rb_node) {
rb_node 1478 mm/mmap.c vma_tmp = rb_entry(rb_node,
rb_node 1485 mm/mmap.c rb_node = rb_node->rb_left;
rb_node 1487 mm/mmap.c rb_node = rb_node->rb_right;
rb_node 1504 mm/mmap.c struct rb_node * rb_node;
rb_node 1512 mm/mmap.c rb_node = mm->mm_rb.rb_node;
rb_node 1514 mm/mmap.c while (rb_node) {
rb_node 1516 mm/mmap.c vma_tmp = rb_entry(rb_node, struct vm_area_struct, vm_rb);
rb_node 1519 mm/mmap.c rb_node = rb_node->rb_left;
rb_node 1524 mm/mmap.c rb_node = rb_node->rb_right;
rb_node 1963 mm/mmap.c struct rb_node ** rb_link, * rb_parent;
rb_node 2098 mm/mmap.c struct rb_node ** rb_link, * rb_parent;
rb_node 2137 mm/mmap.c struct rb_node **rb_link, *rb_parent;
rb_node 480 mm/nommu.c struct rb_node *n = nommu_vma_tree.rb_node;
rb_node 503 mm/nommu.c struct rb_node **p = &nommu_vma_tree.rb_node;
rb_node 504 mm/nommu.c struct rb_node *parent = NULL;
rb_node 887 mm/nommu.c struct rb_node *rb;
rb_node 151 net/802/garp.c struct rb_node *parent = app->gid.rb_node;
rb_node 170 net/802/garp.c struct rb_node *parent = NULL, **p = &app->gid.rb_node;
rb_node 385 net/802/garp.c struct rb_node *node, *next;
rb_node 316 net/rxrpc/ar-accept.c struct rb_node *parent, **pp;
rb_node 331 net/rxrpc/ar-accept.c pp = &rx->calls.rb_node;
rb_node 153 net/rxrpc/ar-call.c struct rb_node *p, *parent, **pp;
rb_node 163 net/rxrpc/ar-call.c p = rx->calls.rb_node;
rb_node 193 net/rxrpc/ar-call.c pp = &rx->calls.rb_node;
rb_node 251 net/rxrpc/ar-call.c struct rb_node **p, *parent;
rb_node 316 net/rxrpc/ar-call.c p = &conn->calls.rb_node;
rb_node 383 net/rxrpc/ar-call.c struct rb_node *p;
rb_node 391 net/rxrpc/ar-call.c p = rx->calls.rb_node;
rb_node 588 net/rxrpc/ar-call.c struct rb_node *p;
rb_node 71 net/rxrpc/ar-connection.c struct rb_node *p, *parent, **pp;
rb_node 85 net/rxrpc/ar-connection.c p = trans->bundles.rb_node;
rb_node 112 net/rxrpc/ar-connection.c pp = &trans->bundles.rb_node;
rb_node 226 net/rxrpc/ar-connection.c struct rb_node *parent, **p;
rb_node 243 net/rxrpc/ar-connection.c p = &conn->trans->client_conns.rb_node;
rb_node 301 net/rxrpc/ar-connection.c struct rb_node *parent, **p;
rb_node 307 net/rxrpc/ar-connection.c p = &conn->calls.rb_node;
rb_node 610 net/rxrpc/ar-connection.c struct rb_node *p, **pp;
rb_node 625 net/rxrpc/ar-connection.c p = trans->server_conns.rb_node;
rb_node 666 net/rxrpc/ar-connection.c pp = &trans->server_conns.rb_node;
rb_node 740 net/rxrpc/ar-connection.c struct rb_node *p;
rb_node 752 net/rxrpc/ar-connection.c p = trans->server_conns.rb_node;
rb_node 754 net/rxrpc/ar-connection.c p = trans->client_conns.rb_node;
rb_node 32 net/rxrpc/ar-connevent.c struct rb_node *p;
rb_node 532 net/rxrpc/ar-input.c struct rb_node *p;
rb_node 581 net/rxrpc/ar-input.c p = conn->calls.rb_node;
rb_node 222 net/rxrpc/ar-internal.h struct rb_node node; /* node in transport's lookup tree */
rb_node 244 net/rxrpc/ar-internal.h struct rb_node node; /* node in transport's lookup tree */
rb_node 309 net/rxrpc/ar-internal.h struct rb_node sock_node; /* node in socket call tree */
rb_node 310 net/rxrpc/ar-internal.h struct rb_node conn_node; /* node in connection call tree */
rb_node 132 net/sched/sch_hfsc.c struct rb_node el_node; /* qdisc's eligible tree member */
rb_node 134 net/sched/sch_hfsc.c struct rb_node vt_node; /* parent's vt_tree member */
rb_node 136 net/sched/sch_hfsc.c struct rb_node cf_node; /* parent's cf_heap member */
rb_node 202 net/sched/sch_hfsc.c struct rb_node **p = &cl->sched->eligible.rb_node;
rb_node 203 net/sched/sch_hfsc.c struct rb_node *parent = NULL;
rb_node 236 net/sched/sch_hfsc.c struct rb_node *n;
rb_node 252 net/sched/sch_hfsc.c struct rb_node *n;
rb_node 267 net/sched/sch_hfsc.c struct rb_node **p = &cl->cl_parent->vt_tree.rb_node;
rb_node 268 net/sched/sch_hfsc.c struct rb_node *parent = NULL;
rb_node 300 net/sched/sch_hfsc.c struct rb_node *n;
rb_node 336 net/sched/sch_hfsc.c struct rb_node **p = &cl->cl_parent->cf_tree.rb_node;
rb_node 337 net/sched/sch_hfsc.c struct rb_node *parent = NULL;
rb_node 666 net/sched/sch_hfsc.c struct rb_node *n = rb_first(&cl->cf_tree);
rb_node 681 net/sched/sch_hfsc.c struct rb_node *n;
rb_node 98 net/sched/sch_htb.c struct rb_node *ptr[TC_HTB_NUMPRIO]; /* current class ptr */
rb_node 106 net/sched/sch_htb.c struct rb_node node[TC_HTB_NUMPRIO]; /* node for self or feed tree */
rb_node 107 net/sched/sch_htb.c struct rb_node pq_node; /* node for event queue */
rb_node 146 net/sched/sch_htb.c struct rb_node *ptr[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
rb_node 257 net/sched/sch_htb.c struct rb_node **p = &root->rb_node, *parent = NULL;
rb_node 283 net/sched/sch_htb.c struct rb_node **p = &q->wait_pq[cl->level].rb_node, *parent = NULL;
rb_node 365 net/sched/sch_htb.c if (!q->row[cl->level][prio].rb_node)
rb_node 389 net/sched/sch_htb.c if (p->un.inner.feed[prio].rb_node)
rb_node 434 net/sched/sch_htb.c if (!p->un.inner.feed[prio].rb_node)
rb_node 708 net/sched/sch_htb.c struct rb_node *p = rb_first(&q->wait_pq[level]);
rb_node 729 net/sched/sch_htb.c static struct rb_node *htb_id_find_next_upper(int prio, struct rb_node *n,
rb_node 732 net/sched/sch_htb.c struct rb_node *r = NULL;
rb_node 759 net/sched/sch_htb.c struct rb_node *root;
rb_node 760 net/sched/sch_htb.c struct rb_node **pptr;
rb_node 764 net/sched/sch_htb.c WARN_ON(!tree->rb_node);
rb_node 765 net/sched/sch_htb.c sp->root = tree->rb_node;
rb_node 794 net/sched/sch_htb.c (++sp)->root = cl->un.inner.feed[prio].rb_node;
rb_node 49 security/keys/internal.h struct rb_node node;
rb_node 66 security/keys/key.c struct rb_node *parent = NULL;
rb_node 67 security/keys/key.c struct rb_node **p;
rb_node 70 security/keys/key.c p = &key_user_tree.rb_node;
rb_node 153 security/keys/key.c struct rb_node *parent, **p;
rb_node 168 security/keys/key.c p = &key_serial_tree.rb_node;
rb_node 533 security/keys/key.c struct rb_node *_n;
rb_node 615 security/keys/key.c struct rb_node *n;
rb_node 621 security/keys/key.c n = key_serial_tree.rb_node;
rb_node 939 security/keys/key.c struct rb_node *_n;
rb_node 1001 security/keys/key.c &key_user_tree.rb_node);
rb_node 102 security/keys/proc.c struct rb_node *_p;
rb_node 120 security/keys/proc.c return rb_next((struct rb_node *) v);
rb_node 131 security/keys/proc.c struct rb_node *_p = v;
rb_node 214 security/keys/proc.c struct rb_node *_p;
rb_node 232 security/keys/proc.c return rb_next((struct rb_node *) v);
rb_node 243 security/keys/proc.c struct rb_node *_p = v;