Lines Matching refs:next_free
845 int next_free = le16_to_cpu(el->l_next_free_rec);
849 BUG_ON(!next_free);
851 BUG_ON(next_free >= count);
853 num_bytes = sizeof(struct ocfs2_extent_rec) * next_free;
861 int i, insert_index, next_free, has_empty, num_bytes;
865 next_free = le16_to_cpu(el->l_next_free_rec);
868 BUG_ON(!next_free);
876 * empty extent and temporarily decrement next_free.
880 * If next_free was 1 (only an empty extent), this
884 for(i = 0; i < (next_free - 1); i++)
887 next_free--;
893 for(i = 0; i < next_free; i++) {
901 mlog(0, "ins %u: index %d, has_empty %d, next_free %d, count %d\n",
902 insert_cpos, insert_index, has_empty, next_free, le16_to_cpu(el->l_count));
906 BUG_ON(insert_index > next_free);
911 if (insert_index != next_free) {
912 BUG_ON(next_free >= le16_to_cpu(el->l_count));
914 num_bytes = next_free - insert_index;
926 next_free++;
927 el->l_next_free_rec = cpu_to_le16(next_free);
946 int next_free = le16_to_cpu(el->l_next_free_rec);
950 if (next_free == 0)
1560 int next_free;
1563 next_free = le16_to_cpu(left_el->l_next_free_rec);
1564 rec = &left_el->l_recs[next_free - 1];
1823 int ret, i, next_free;
1842 next_free = le16_to_cpu(el->l_next_free_rec);
1843 if (next_free == 0 ||
1844 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) {
1896 next_free = le16_to_cpu(el->l_next_free_rec);
1897 if (next_free == 0) {
1905 rec = &el->l_recs[next_free - 1];
2943 int next_free, ret = 0;
2971 next_free = le16_to_cpu(el->l_next_free_rec);
2974 if (next_free > 2)
2978 if (next_free == 2)
2986 if (next_free > 1)