rb_parent 38 fs/afs/vnode.c if (rb_parent(node) != parent) { rb_parent 39 fs/afs/vnode.c printk("BAD: %p != %p\n", rb_parent(node), parent); rb_parent 289 fs/ext3/dir.c parent = rb_parent(n); rb_parent 295 fs/ext4/dir.c parent = rb_parent(n); rb_parent 345 fs/jffs2/nodelist.h #define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb) rb_parent 352 fs/jffs2/nodelist.h #define tn_parent(tn) rb_entry(rb_parent(&(tn)->rb), struct jffs2_tmp_dnode_info, rb) rb_parent 384 fs/jffs2/readinode.c struct rb_node *parent = rb_parent(node); rb_parent 535 fs/jffs2/readinode.c this = rb_parent(this); rb_parent 1835 fs/ubifs/debug.c this = rb_parent(this); rb_parent 631 fs/ubifs/log.c this = rb_parent(this); rb_parent 821 fs/ubifs/orphan.c this = rb_parent(this); rb_parent 1312 fs/ubifs/recovery.c this = rb_parent(this); rb_parent 270 fs/ubifs/replay.c this = rb_parent(this); rb_parent 797 fs/ubifs/super.c this = rb_parent(this); rb_parent 192 fs/ubifs/tnc.c this = rb_parent(this); rb_parent 136 include/linux/rbtree.h #define RB_EMPTY_NODE(node) (rb_parent(node) == node) rb_parent 259 kernel/fork.c struct rb_node **rb_link, *rb_parent; rb_parent 280 kernel/fork.c rb_parent = NULL; rb_parent 343 kernel/fork.c __vma_link_rb(mm, tmp, rb_link, rb_parent); rb_parent 345 kernel/fork.c rb_parent = &tmp->vm_rb; rb_parent 29 lib/rbtree.c struct rb_node *parent = rb_parent(node); rb_parent 52 lib/rbtree.c struct rb_node *parent = rb_parent(node); rb_parent 76 lib/rbtree.c while ((parent = rb_parent(node)) && rb_is_red(parent)) rb_parent 78 lib/rbtree.c gparent = rb_parent(parent); rb_parent 160 lib/rbtree.c parent = rb_parent(node); rb_parent 197 lib/rbtree.c parent = rb_parent(node); rb_parent 241 lib/rbtree.c parent = rb_parent(node); rb_parent 256 lib/rbtree.c if (rb_parent(old)) rb_parent 258 lib/rbtree.c if (rb_parent(old)->rb_left == old) rb_parent 259 lib/rbtree.c rb_parent(old)->rb_left = node; rb_parent 261 lib/rbtree.c rb_parent(old)->rb_right = node; rb_parent 271 lib/rbtree.c parent = rb_parent(node); rb_parent 325 lib/rbtree.c if (rb_parent(node) == node) rb_parent 343 lib/rbtree.c while ((parent = rb_parent(node)) && node == parent->rb_right) rb_parent 354 lib/rbtree.c if (rb_parent(node) == node) rb_parent 368 lib/rbtree.c while ((parent = rb_parent(node)) && node == parent->rb_left) rb_parent 378 lib/rbtree.c struct rb_node *parent = rb_parent(victim); rb_parent 385 mm/mmap.c *rb_parent = __rb_parent; rb_parent 398 mm/mmap.c if (rb_parent) rb_parent 399 mm/mmap.c vma->vm_next = rb_entry(rb_parent, rb_parent 409 mm/mmap.c rb_link_node(&vma->vm_rb, rb_parent, rb_link); rb_parent 440 mm/mmap.c __vma_link_list(mm, vma, prev, rb_parent); rb_parent 441 mm/mmap.c __vma_link_rb(mm, vma, rb_link, rb_parent); rb_parent 460 mm/mmap.c __vma_link(mm, vma, prev, rb_link, rb_parent); rb_parent 480 mm/mmap.c struct rb_node ** rb_link, * rb_parent; rb_parent 482 mm/mmap.c __vma = find_vma_prepare(mm, vma->vm_start,&prev, &rb_link, &rb_parent); rb_parent 484 mm/mmap.c __vma_link(mm, vma, prev, rb_link, rb_parent); rb_parent 1100 mm/mmap.c struct rb_node **rb_link, *rb_parent; rb_parent 1107 mm/mmap.c vma = find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent); rb_parent 1216 mm/mmap.c vma_link(mm, vma, prev, rb_link, rb_parent); rb_parent 1963 mm/mmap.c struct rb_node ** rb_link, * rb_parent; rb_parent 2010 mm/mmap.c vma = find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent); rb_parent 2047 mm/mmap.c vma_link(mm, vma, prev, rb_link, rb_parent); rb_parent 2098 mm/mmap.c struct rb_node ** rb_link, * rb_parent; rb_parent 2116 mm/mmap.c __vma = find_vma_prepare(mm,vma->vm_start,&prev,&rb_link,&rb_parent); rb_parent 2122 mm/mmap.c vma_link(mm, vma, prev, rb_link, rb_parent); rb_parent 2137 mm/mmap.c struct rb_node **rb_link, *rb_parent; rb_parent 2147 mm/mmap.c find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent); rb_parent 2177 mm/mmap.c vma_link(mm, new_vma, prev, rb_link, rb_parent);