LOWER             349 fs/btrfs/relocation.c 				  struct backref_edge, list[LOWER]);
LOWER             370 fs/btrfs/relocation.c 		lower = edge->node[LOWER];
LOWER             371 fs/btrfs/relocation.c 		if (list_is_last(&edge->list[LOWER], &lower->upper)) {
LOWER             375 fs/btrfs/relocation.c 		edge = list_entry(edge->list[LOWER].next,
LOWER             376 fs/btrfs/relocation.c 				  struct backref_edge, list[LOWER]);
LOWER             430 fs/btrfs/relocation.c 				  list[LOWER]);
LOWER             432 fs/btrfs/relocation.c 		list_del(&edge->list[LOWER]);
LOWER             755 fs/btrfs/relocation.c 				  list[LOWER]);
LOWER             869 fs/btrfs/relocation.c 			list_add_tail(&edge->list[LOWER], &cur->upper);
LOWER             870 fs/btrfs/relocation.c 			edge->node[LOWER] = cur;
LOWER            1005 fs/btrfs/relocation.c 			list_add_tail(&edge->list[LOWER], &lower->upper);
LOWER            1006 fs/btrfs/relocation.c 			edge->node[LOWER] = lower;
LOWER            1054 fs/btrfs/relocation.c 	list_for_each_entry(edge, &node->upper, list[LOWER])
LOWER            1062 fs/btrfs/relocation.c 			list_del(&edge->list[LOWER]);
LOWER            1063 fs/btrfs/relocation.c 			lower = edge->node[LOWER];
LOWER            1105 fs/btrfs/relocation.c 		list_for_each_entry(edge, &upper->upper, list[LOWER])
LOWER            1128 fs/btrfs/relocation.c 			list_del(&edge->list[LOWER]);
LOWER            1129 fs/btrfs/relocation.c 			lower = edge->node[LOWER];
LOWER            1157 fs/btrfs/relocation.c 			list_del(&edge->list[LOWER]);
LOWER            1158 fs/btrfs/relocation.c 			lower = edge->node[LOWER];
LOWER            1174 fs/btrfs/relocation.c 			list_for_each_entry(edge, &upper->upper, list[LOWER])
LOWER            1256 fs/btrfs/relocation.c 			new_edge->node[LOWER] = edge->node[LOWER];
LOWER            1271 fs/btrfs/relocation.c 			list_add_tail(&new_edge->list[LOWER],
LOWER            1272 fs/btrfs/relocation.c 				      &new_edge->node[LOWER]->upper);
LOWER            2735 fs/btrfs/relocation.c 					  struct backref_edge, list[LOWER]);
LOWER            2815 fs/btrfs/relocation.c 	list_for_each_entry(edge, &node->upper, list[LOWER]) {
LOWER            3037 fs/btrfs/relocation.c 					  struct backref_edge, list[LOWER]);