Lines Matching refs:next_free
1595 int next_free = le16_to_cpu(el->l_next_free_rec);
1599 BUG_ON(!next_free);
1601 BUG_ON(next_free >= count);
1603 num_bytes = sizeof(struct ocfs2_extent_rec) * next_free;
1611 int i, insert_index, next_free, has_empty, num_bytes;
1615 next_free = le16_to_cpu(el->l_next_free_rec);
1618 BUG_ON(!next_free);
1625 * empty extent and temporarily decrement next_free.
1629 * If next_free was 1 (only an empty extent), this
1633 for(i = 0; i < (next_free - 1); i++)
1636 next_free--;
1642 for(i = 0; i < next_free; i++) {
1651 has_empty, next_free,
1656 BUG_ON(insert_index > next_free);
1661 if (insert_index != next_free) {
1662 BUG_ON(next_free >= le16_to_cpu(el->l_count));
1664 num_bytes = next_free - insert_index;
1676 next_free++;
1677 el->l_next_free_rec = cpu_to_le16(next_free);
1712 int next_free = le16_to_cpu(el->l_next_free_rec);
1716 if (next_free == 0)
2310 int next_free;
2313 next_free = le16_to_cpu(left_el->l_next_free_rec);
2314 rec = &left_el->l_recs[next_free - 1];
2323 int next_free = le16_to_cpu(el->l_next_free_rec);
2327 if (next_free == 0)
2333 if (next_free == 1)
2753 * next_free. This is allowed to remove the last
2820 int next_free;
2828 next_free = le16_to_cpu(el->l_next_free_rec);
2831 if (j == (next_free - 1)) {
3346 int ret, next_free, i;
3370 next_free = le16_to_cpu(right_el->l_next_free_rec);
3371 BUG_ON(next_free <= 0);
3374 BUG_ON(next_free <= 1);
3952 int i, next_free;
3964 next_free = le16_to_cpu(el->l_next_free_rec);
3965 if (next_free == 0) {
3972 rec = &el->l_recs[next_free - 1];
3990 int ret, next_free;
4008 next_free = le16_to_cpu(el->l_next_free_rec);
4009 if (next_free == 0 ||
4010 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) {
5450 int next_free;
5455 next_free = le16_to_cpu(el->l_next_free_rec);
5456 if (is_rightmost_tree_rec && next_free > 1) {
5461 rec = &el->l_recs[next_free - 1];