i_caps            436 fs/ceph/caps.c 	struct rb_node *n = ci->i_caps.rb_node;
i_caps            466 fs/ceph/caps.c 	struct rb_node **p = &ci->i_caps.rb_node;
i_caps            482 fs/ceph/caps.c 	rb_insert_color(&new->ci_node, &ci->i_caps);
i_caps            798 fs/ceph/caps.c 	for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) {
i_caps            829 fs/ceph/caps.c 	for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) {
i_caps            879 fs/ceph/caps.c 	for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) {
i_caps            905 fs/ceph/caps.c 				for (q = rb_first(&ci->i_caps); q != p;
i_caps            930 fs/ceph/caps.c 	for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) {
i_caps            994 fs/ceph/caps.c 	for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) {
i_caps           1011 fs/ceph/caps.c 	return rb_first(&ci->i_caps) == rb_last(&ci->i_caps);
i_caps           1016 fs/ceph/caps.c 	return !RB_EMPTY_ROOT(&ci->i_caps);
i_caps           1062 fs/ceph/caps.c 	rb_erase(&cap->ci_node, &ci->i_caps);
i_caps           1247 fs/ceph/caps.c 	p = rb_first(&ci->i_caps);
i_caps           1923 fs/ceph/caps.c 	for (p = rb_first(&ci->i_caps); p; p = rb_next(p)) {
i_caps            463 fs/ceph/inode.c 	ci->i_caps = RB_ROOT;
i_caps           1002 fs/ceph/mds_client.c 	if (!cap && !RB_EMPTY_ROOT(&ci->i_caps))
i_caps           1003 fs/ceph/mds_client.c 		cap = rb_entry(rb_first(&ci->i_caps), struct ceph_cap, ci_node);
i_caps            344 fs/ceph/super.h 	struct rb_root i_caps;           /* cap list */
i_caps            631 fs/ceph/super.h 	return !RB_EMPTY_ROOT(&ci->i_caps);