rb_prev           895 block/bfq-iosched.c 	struct rb_node *rbprev = rb_prev(&last->rb_node);
rb_prev          2267 block/bfq-iosched.c 	    rb_prev(&req->rb_node) &&
rb_prev          2269 block/bfq-iosched.c 	    blk_rq_pos(container_of(rb_prev(&req->rb_node),
rb_prev          2441 block/bfq-iosched.c 		node = rb_prev(&__bfqq->pos_node);
rb_prev           356 block/bfq-wf2q.c 		next = rb_prev(&entity->rb_node);
rb_prev           815 block/elevator.c 	struct rb_node *rbprev = rb_prev(&rq->rb_node);
rb_prev           372 drivers/gpu/drm/drm_mm.c 		return rb_hole_size_to_node(rb_prev(&node->rb_hole_size));
rb_prev           378 drivers/gpu/drm/drm_mm.c 		return rb_hole_addr_to_node(rb_prev(&node->rb_hole_addr));
rb_prev           205 drivers/iommu/iova.c 		curr = rb_prev(curr);
rb_prev           543 drivers/md/bcache/util.h 	container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
rb_prev           571 drivers/md/dm-writecache.c 			node = rb_prev(&e->rb_node);
rb_prev           748 drivers/md/dm-writecache.c 		struct rb_node *rb_node = rb_prev(&e->rb_node);
rb_prev          1652 drivers/md/dm-writecache.c 		node = rb_prev(&e->rb_node);
rb_prev           370 fs/btrfs/delayed-inode.c 		else if ((node = rb_prev(prev_node)) != NULL) {
rb_prev           424 fs/btrfs/extent_io.c 			prev = rb_prev(prev);
rb_prev           471 fs/btrfs/extent_io.c 	other_node = rb_prev(&state->rb_node);
rb_prev           129 fs/btrfs/extent_map.c 		parent = rb_prev(parent);
rb_prev           181 fs/btrfs/extent_map.c 			prev = rb_prev(prev);
rb_prev           248 fs/btrfs/extent_map.c 		rb = rb_prev(&em->rb_node);
rb_prev           524 fs/btrfs/extent_map.c 	prev = rb_prev(&em->rb_node);
rb_prev          1557 fs/btrfs/free-space-cache.c 			n = rb_prev(&entry->offset_index);
rb_prev          1575 fs/btrfs/free-space-cache.c 		n = rb_prev(&entry->offset_index);
rb_prev          1589 fs/btrfs/free-space-cache.c 		n = rb_prev(&entry->offset_index);
rb_prev          2181 fs/btrfs/free-space-cache.c 	if (right_info && rb_prev(&right_info->offset_index))
rb_prev          2182 fs/btrfs/free-space-cache.c 		left_info = rb_entry(rb_prev(&right_info->offset_index),
rb_prev          3703 fs/btrfs/free-space-cache.c 		n = rb_prev(&info->offset_index);
rb_prev          3710 fs/btrfs/free-space-cache.c 				n = rb_prev(&tmp->offset_index);
rb_prev           106 fs/btrfs/ordered-data.c 		test = rb_prev(prev);
rb_prev           866 fs/btrfs/ordered-data.c 		node = rb_prev(&ordered->rb_node);
rb_prev           880 fs/btrfs/ordered-data.c 	for (; node; node = rb_prev(node)) {
rb_prev           318 fs/ext2/balloc.c 		n = rb_prev(&rsv->rsv_node);
rb_prev           108 fs/ext4/block_validity.c 	node = rb_prev(new_node);
rb_prev           535 fs/ext4/extents_status.c 	node = rb_prev(&es->rb_node);
rb_prev          1011 fs/ext4/extents_status.c 			node = rb_prev(&es->rb_node);
rb_prev          1195 fs/ext4/extents_status.c 			node = rb_prev(&es->rb_node);
rb_prev          4695 fs/ext4/mballoc.c 	node = rb_prev(new_node);
rb_prev           150 fs/f2fs/extent_cache.c 		tmp_node = rb_prev(parent);
rb_prev           157 fs/f2fs/extent_cache.c 		tmp_node = rb_prev(&re->rb_node);
rb_prev           348 fs/jffs2/nodelist.h #define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb)
rb_prev           355 fs/jffs2/nodelist.h #define tn_prev(tn) rb_entry(rb_prev(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
rb_prev            28 fs/nfs/blocklayout/extent_tree.c 	struct rb_node *node = rb_prev(&be->be_node);
rb_prev            55 include/linux/rbtree.h extern struct rb_node *rb_prev(const struct rb_node *);
rb_prev          3402 include/linux/skbuff.h #define skb_rb_prev(skb)   rb_to_skb(rb_prev(&(skb)->rbnode))
rb_prev           180 ipc/mqueue.c   		info->msg_tree_rightmost = rb_prev(node);
rb_prev          1315 kernel/events/uprobes.c 		for (t = n; t; t = rb_prev(t)) {
rb_prev           551 lib/rbtree.c   EXPORT_SYMBOL(rb_prev);
rb_prev           570 mm/memcontrol.c 		mctz->rb_rightmost = rb_prev(&mz->tree_node);
rb_prev          2306 mm/mempolicy.c 		struct rb_node *prev = rb_prev(n);
rb_prev           365 mm/mmap.c      	for (nd = pn; nd; nd = rb_prev(nd))
rb_prev           530 mm/mmap.c      	struct rb_node **__rb_link, *__rb_parent, *rb_prev;
rb_prev           533 mm/mmap.c      	rb_prev = __rb_parent = NULL;
rb_prev           547 mm/mmap.c      			rb_prev = __rb_parent;
rb_prev           553 mm/mmap.c      	if (rb_prev)
rb_prev           554 mm/mmap.c      		*pprev = rb_entry(rb_prev, struct vm_area_struct, vm_rb);
rb_prev           590 mm/nommu.c     	struct rb_node **p, *parent, *rb_prev;
rb_prev           609 mm/nommu.c     	parent = rb_prev = NULL;
rb_prev           620 mm/nommu.c     			rb_prev = parent;
rb_prev           625 mm/nommu.c     			rb_prev = parent;
rb_prev           630 mm/nommu.c     			rb_prev = parent;
rb_prev           641 mm/nommu.c     	if (rb_prev)
rb_prev           642 mm/nommu.c     		prev = rb_entry(rb_prev, struct vm_area_struct, vm_rb);
rb_prev          3316 mm/vmalloc.c   			va = node_to_va(rb_prev(&va->rb_node));
rb_prev          5087 net/ipv4/tcp_input.c 		prev = rb_prev(node);
rb_prev            54 tools/include/linux/rbtree.h extern struct rb_node *rb_prev(const struct rb_node *);
rb_prev           331 tools/perf/builtin-annotate.c 				nd = rb_prev(nd);
rb_prev           368 tools/perf/builtin-annotate.c 				next = rb_prev(nd);
rb_prev           162 tools/perf/ui/browser.c 			nd = rb_prev(nd);
rb_prev           713 tools/perf/ui/browsers/annotate.c 				nd = rb_prev(nd);
rb_prev          1543 tools/perf/util/callchain.c 		chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node);
rb_prev          1962 tools/perf/util/hist.c 	node = rb_prev(node);
rb_prev           491 tools/perf/util/symbol.c 		for (n = rb_prev(n); n; n = rb_prev(n)) {