block/bfq-wf2q.c

456

parent = rb_parent(node);

block/bfq-wf2q.c

549

deepest = rb_parent(node);

block/bfq-wf2q.c

558

else if (rb_parent(deepest) != node)

block/bfq-wf2q.c

559

deepest = rb_parent(deepest);

drivers/gpu/drm/drm_mm.c

183

rb = rb_parent(rb);

drivers/gpu/drm/drm_mm.c

248

struct rb_node **link = &root->rb_node, *rb_parent = NULL;

drivers/gpu/drm/drm_mm.c

253

rb_parent = *link;

drivers/gpu/drm/drm_mm.c

254

parent = rb_entry(rb_parent, struct drm_mm_node, rb_hole_addr);

drivers/gpu/drm/drm_mm.c

263

rb_link_node(&node->rb_hole_addr, rb_parent, link);

drivers/gpu/drm/drm_mm.c

405

while ((parent = rb_parent(node)) && node == parent->first) \

drivers/md/dm-crypt.c

1932

BUG_ON(rb_parent(write_tree.rb_node));

drivers/mtd/ubi/attach.c

1290

this = rb_parent(this);

drivers/mtd/ubi/attach.c

1348

rb = rb_parent(rb);

drivers/mtd/ubi/wl.c

1650

rb = rb_parent(rb);

fs/jffs2/nodelist.h

349

#define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb)

fs/jffs2/nodelist.h

356

#define tn_parent(tn) rb_entry(rb_parent(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)

fs/jffs2/readinode.c

404

struct rb_node *parent = rb_parent(node);

include/linux/interval_tree_generic.h

169

rb = rb_parent(&node->ITRB); \

include/linux/interval_tree_generic.h

41

struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \

include/linux/interval_tree_generic.h

47

rb_parent = *link; \

include/linux/interval_tree_generic.h

48

parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \

include/linux/interval_tree_generic.h

60

rb_link_node(&node->ITRB, rb_parent, link); \

include/linux/rbtree_augmented.h

109

rb = rb_parent(&node->RBFIELD); \

lib/rbtree.c

134

parent = rb_parent(node);

lib/rbtree.c

190

parent = rb_parent(node);

lib/rbtree.c

286

parent = rb_parent(node);

lib/rbtree.c

376

parent = rb_parent(node);

lib/rbtree.c

505

while ((parent = rb_parent(node)) && node == parent->rb_right)

lib/rbtree.c

534

while ((parent = rb_parent(node)) && node == parent->rb_left)

lib/rbtree.c

544

struct rb_node *parent = rb_parent(victim);

lib/rbtree.c

561

struct rb_node *parent = rb_parent(victim);

lib/rbtree.c

597

parent = rb_parent(node);

lib/rbtree.c

78

struct rb_node *parent = rb_parent(old);

lib/rbtree_test.c

106

rb_link_node(&node->rb, rb_parent, new);

lib/rbtree_test.c

113

struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;

lib/rbtree_test.c

120

rb_parent = *new;

lib/rbtree_test.c

121

parent = rb_entry(rb_parent, struct test_node, rb);

lib/rbtree_test.c

133

rb_link_node(&node->rb, rb_parent, new);

lib/rbtree_test.c

167

for (count = 0; rb; rb = rb_parent(rb))

lib/rbtree_test.c

202

(!rb_parent(rb) || is_red(rb_parent(rb))));

lib/rbtree_test.c

89

struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;

lib/rbtree_test.c

95

rb_parent = *new;

lib/rbtree_test.c

96

parent = rb_entry(rb_parent, struct test_node, rb);

mm/kmemleak.c

722

struct rb_node **link, *rb_parent;

mm/kmemleak.c

746

rb_parent = NULL;

mm/kmemleak.c

748

rb_parent = *link;

mm/kmemleak.c

749

parent = rb_entry(rb_parent, struct kmemleak_object, rb_node);

mm/kmemleak.c

772

rb_link_node(&object->rb_node, rb_parent, link);

mm/vmalloc.c

1603

while ((node = rb_parent(node))) {

net/tipc/name_table.c

197

while ((p = rb_parent(n)) && n == p->rb_right)

tools/include/linux/interval_tree_generic.h

169

rb = rb_parent(&node->ITRB); \

tools/include/linux/interval_tree_generic.h

41

struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \

tools/include/linux/interval_tree_generic.h

47

rb_parent = *link; \

tools/include/linux/interval_tree_generic.h

48

parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \

tools/include/linux/interval_tree_generic.h

60

rb_link_node(&node->ITRB, rb_parent, link); \

tools/include/linux/rbtree_augmented.h

85

rb = rb_parent(&node->RBFIELD); \

tools/lib/rbtree.c

134

parent = rb_parent(node);

tools/lib/rbtree.c

190

parent = rb_parent(node);

tools/lib/rbtree.c

286

parent = rb_parent(node);

tools/lib/rbtree.c

376

parent = rb_parent(node);

tools/lib/rbtree.c

511

while ((parent = rb_parent(node)) && node == parent->rb_right)

tools/lib/rbtree.c

539

while ((parent = rb_parent(node)) && node == parent->rb_left)

tools/lib/rbtree.c

548

struct rb_node *parent = rb_parent(victim);

tools/lib/rbtree.c

578

parent = rb_parent(node);

tools/lib/rbtree.c

78

struct rb_node *parent = rb_parent(old);