Lines Matching refs:next_free
1597 int next_free = le16_to_cpu(el->l_next_free_rec);
1601 BUG_ON(!next_free);
1603 BUG_ON(next_free >= count);
1605 num_bytes = sizeof(struct ocfs2_extent_rec) * next_free;
1613 int i, insert_index, next_free, has_empty, num_bytes;
1617 next_free = le16_to_cpu(el->l_next_free_rec);
1620 BUG_ON(!next_free);
1627 * empty extent and temporarily decrement next_free.
1631 * If next_free was 1 (only an empty extent), this
1635 for(i = 0; i < (next_free - 1); i++)
1638 next_free--;
1644 for(i = 0; i < next_free; i++) {
1653 has_empty, next_free,
1658 BUG_ON(insert_index > next_free);
1663 if (insert_index != next_free) {
1664 BUG_ON(next_free >= le16_to_cpu(el->l_count));
1666 num_bytes = next_free - insert_index;
1678 next_free++;
1679 el->l_next_free_rec = cpu_to_le16(next_free);
1714 int next_free = le16_to_cpu(el->l_next_free_rec);
1718 if (next_free == 0)
2312 int next_free;
2315 next_free = le16_to_cpu(left_el->l_next_free_rec);
2316 rec = &left_el->l_recs[next_free - 1];
2325 int next_free = le16_to_cpu(el->l_next_free_rec);
2329 if (next_free == 0)
2335 if (next_free == 1)
2755 * next_free. This is allowed to remove the last
2822 int next_free;
2830 next_free = le16_to_cpu(el->l_next_free_rec);
2833 if (j == (next_free - 1)) {
3348 int ret, next_free, i;
3372 next_free = le16_to_cpu(right_el->l_next_free_rec);
3373 BUG_ON(next_free <= 0);
3376 BUG_ON(next_free <= 1);
3954 int i, next_free;
3966 next_free = le16_to_cpu(el->l_next_free_rec);
3967 if (next_free == 0) {
3974 rec = &el->l_recs[next_free - 1];
3992 int ret, next_free;
4010 next_free = le16_to_cpu(el->l_next_free_rec);
4011 if (next_free == 0 ||
4012 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) {
5452 int next_free;
5457 next_free = le16_to_cpu(el->l_next_free_rec);
5458 if (is_rightmost_tree_rec && next_free > 1) {
5463 rec = &el->l_recs[next_free - 1];