fs/ocfs2/alloc.c

1602 	int next_free = le16_to_cpu(el->l_next_free_rec);
1606 	BUG_ON(!next_free);
1608 	BUG_ON(next_free >= count);
1610 	num_bytes = sizeof(struct ocfs2_extent_rec) * next_free;
1618 	int i, insert_index, next_free, has_empty, num_bytes;
1622 	next_free = le16_to_cpu(el->l_next_free_rec);
1625 	BUG_ON(!next_free);
1632 	 * empty extent and temporarily decrement next_free.
1636 		 * If next_free was 1 (only an empty extent), this
1640 		for(i = 0; i < (next_free - 1); i++)
1643 		next_free--;
1649 	for(i = 0; i < next_free; i++) {
1658 				has_empty, next_free,
1663 	BUG_ON(insert_index > next_free);
1668 	if (insert_index != next_free) {
1669 		BUG_ON(next_free >= le16_to_cpu(el->l_count));
1671 		num_bytes = next_free - insert_index;
1683 	next_free++;
1684 	el->l_next_free_rec = cpu_to_le16(next_free);
1719 	int next_free = le16_to_cpu(el->l_next_free_rec);
1723 	if (next_free == 0)
2317 	int next_free;
2320 	next_free = le16_to_cpu(left_el->l_next_free_rec);
2321 	rec = &left_el->l_recs[next_free - 1];
2330 	int next_free = le16_to_cpu(el->l_next_free_rec);
2334 	if (next_free == 0)
2340 		if (next_free == 1)
2760 		 * next_free. This is allowed to remove the last
2827 		int next_free;
2835 		next_free = le16_to_cpu(el->l_next_free_rec);
2838 				if (j == (next_free - 1)) {
3353 	int ret, next_free, i;
3377 		next_free = le16_to_cpu(right_el->l_next_free_rec);
3378 		BUG_ON(next_free <= 0);
3381 			BUG_ON(next_free <= 1);
3959 	int i, next_free;
3971 		next_free = le16_to_cpu(el->l_next_free_rec);
3972 		if (next_free == 0) {
3979 		rec = &el->l_recs[next_free - 1];
3997 	int ret, next_free;
4015 	next_free = le16_to_cpu(el->l_next_free_rec);
4016 	if (next_free == 0 ||
4017 	    (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) {
5457 		int next_free;
5462 		next_free = le16_to_cpu(el->l_next_free_rec);
5463 		if (is_rightmost_tree_rec && next_free > 1) {
5468 			rec = &el->l_recs[next_free - 1];