rb_prev
struct rb_node *rbprev = rb_prev(&last->rb_node);
rb_prev(&req->rb_node) &&
blk_rq_pos(container_of(rb_prev(&req->rb_node),
node = rb_prev(&__bfqq->pos_node);
next = rb_prev(&entity->rb_node);
struct rb_node *rbprev = rb_prev(&rq->rb_node);
rb_node = rb_prev(&node->rb);
iter = rb_prev(iter);
iter = rb_prev(iter);
iter = rb_prev(iter);
node = rb_prev(¬ifier->itree.rb);
node = rb_prev(&range->itree.rb);
node = rb_prev(&va->rb.node);
return rb_hole_size_to_node(rb_prev(&node->rb_hole_size));
curr = rb_prev(curr);
container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
node = rb_prev(&e->rb_node);
node = rb_prev(&e->rb_node);
struct rb_node *rb_node = rb_prev(&e->rb_node);
for (n = rb_prev(n); n; n = rb_prev(n)) {
for (; n; n = rb_prev(n)) {
for (p = rb_prev(n); p; p = rb_prev(p)) {
while ((prev = rb_prev(prev))) {
struct rb_node *next = rb_prev(&state->rb_node);
parent = rb_prev(parent);
prev = rb_prev(prev);
rb = rb_prev(&em->rb_node);
prev = rb_prev(&em->rb_node);
n = rb_prev(&entry->offset_index);
n = rb_prev(&entry->offset_index);
n = rb_prev(&entry->offset_index);
right_prev = rb_prev(&right_info->offset_index);
n = rb_prev(&info->offset_index);
n = rb_prev(&tmp->offset_index);
test = rb_prev(prev);
prev = rb_prev(cur);
if (entry->val > start && rb_prev(&entry->rb_node))
entry = rb_entry(rb_prev(&entry->rb_node), struct ulist_node,
prev = rb_prev(prev);
n = rb_prev(&rsv->rsv_node);
node = rb_prev(new_node);
node = rb_prev(&es->rb_node);
node = rb_prev(&es->rb_node);
node = rb_prev(&es->rb_node);
tmp = rb_prev(&right_pa->pa_node.inode_node);
iter = rb_prev(iter)) {
tmp = rb_prev(&tmp_pa->pa_node.inode_node);
for (iter = &tmp_pa->pa_node.inode_node;; iter = rb_prev(iter)) {
node = rb_prev(&entry->efd_node);
tmp_node = rb_prev(parent);
tmp_node = rb_prev(&en->rb_node);
ve = rb_entry(stage == 0 ? rb_prev(&ve->rb_node) :
tmp_node = rb_prev(parent);
tmp_node = rb_prev(&dc->rb_node);
#define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb)
#define tn_prev(tn) rb_entry(rb_prev(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
ns->mnt_last_node = rb_prev(&mnt->mnt_node);
node = rb_prev(&curr->mnt_node);
struct rb_node *node = rb_prev(&be->be_node);
n = rb_prev(n);
} else if (rb_prev(&e->count.node)) {
tmp = rb_prev(iter->node);
extern struct rb_node *rb_prev(const struct rb_node *);
#define skb_rb_prev(skb) rb_to_skb(rb_prev(&(skb)->rbnode))
info->msg_tree_rightmost = rb_prev(node);
for (t = n; t; t = rb_prev(t)) {
struct rb_node *n = rb_prev(&w->tree.entry);
prev = rb_prev(&node->ns_node);
rbp = rb_prev(&p->scx.dsq_priq);
EXPORT_SYMBOL(rb_prev);
mctz->rb_rightmost = rb_prev(&mz->tree_node);
struct rb_node *prev = rb_prev(n);
va = node_to_va(rb_prev(&va->rb_node));
prev = rb_prev(node);
node = rb_prev(node);
struct rb_node *prev = rb_prev(&rbe->node);
prev = rb_prev(prev);
node = rb_prev(&rbe->node);
extern struct rb_node *rb_prev(const struct rb_node *);
pnode = rb_prev(&sym->node);
nd = rb_prev(nd);
next = rb_prev(nd);
next = rb_prev(nd);
nd = rb_prev(nd);
nd = rb_prev(nd);
chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node);
node = rb_prev(node);