Lines Matching defs:next_free
1594 int next_free = le16_to_cpu(el->l_next_free_rec);
1598 BUG_ON(!next_free);
1600 BUG_ON(next_free >= count);
1602 num_bytes = sizeof(struct ocfs2_extent_rec) * next_free;
1610 int i, insert_index, next_free, has_empty, num_bytes;
1614 next_free = le16_to_cpu(el->l_next_free_rec);
1617 BUG_ON(!next_free);
1624 * empty extent and temporarily decrement next_free.
1628 * If next_free was 1 (only an empty extent), this
1632 for(i = 0; i < (next_free - 1); i++)
1635 next_free--;
1641 for(i = 0; i < next_free; i++) {
1649 mlog(0, "ins %u: index %d, has_empty %d, next_free %d, count %d\n",
1650 insert_cpos, insert_index, has_empty, next_free, le16_to_cpu(el->l_count));
1654 BUG_ON(insert_index > next_free);
1659 if (insert_index != next_free) {
1660 BUG_ON(next_free >= le16_to_cpu(el->l_count));
1662 num_bytes = next_free - insert_index;
1674 next_free++;
1675 el->l_next_free_rec = cpu_to_le16(next_free);
1710 int next_free = le16_to_cpu(el->l_next_free_rec);
1714 if (next_free == 0)
2316 int next_free;
2319 next_free = le16_to_cpu(left_el->l_next_free_rec);
2320 rec = &left_el->l_recs[next_free - 1];
2329 int next_free = le16_to_cpu(el->l_next_free_rec);
2333 if (next_free == 0)
2339 if (next_free == 1)
2773 * next_free. This is allowed to remove the last
2841 int next_free;
2849 next_free = le16_to_cpu(el->l_next_free_rec);
2852 if (j == (next_free - 1)) {
3350 int ret, next_free, i;
3374 next_free = le16_to_cpu(right_el->l_next_free_rec);
3375 BUG_ON(next_free <= 0);
3378 BUG_ON(next_free <= 1);
3916 int ret, i, next_free;
3928 next_free = le16_to_cpu(el->l_next_free_rec);
3929 if (next_free == 0) {
3937 rec = &el->l_recs[next_free - 1];
3955 int ret, next_free;
3973 next_free = le16_to_cpu(el->l_next_free_rec);
3974 if (next_free == 0 ||
3975 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) {
5356 int next_free;
5362 next_free = le16_to_cpu(el->l_next_free_rec);
5363 if (is_rightmost_tree_rec && next_free > 1) {
5368 rec = &el->l_recs[next_free - 1];