Lines Matching full:gap
23 BUG_ON(pos >= keys->gap && pos < keys->gap + gap_size); in pos_to_idx()
25 if (pos >= keys->gap) in pos_to_idx()
34 if (idx >= keys->gap) in idx_to_pos()
200 BUG_ON(iter->idx >= keys->gap && in journal_iter_verify()
201 iter->idx < keys->gap + gap_size); in journal_iter_verify()
215 /* The key we just inserted is immediately before the gap: */ in journal_iters_fix()
216 size_t gap_end = keys->gap + (keys->size - keys->nr); in journal_iters_fix()
217 struct journal_key *new_key = &keys->data[keys->gap - 1]; in journal_iters_fix()
231 iter->idx = keys->gap - 1; in journal_iters_fix()
277 if (idx > keys->gap) in bch2_journal_key_insert_take()
280 size_t old_gap = keys->gap; in bch2_journal_key_insert_take()
298 /* Since @keys was full, there was no gap: */ in bch2_journal_key_insert_take()
305 /* And now the gap is at the end: */ in bch2_journal_key_insert_take()
306 keys->gap = keys->nr; in bch2_journal_key_insert_take()
314 keys->data[keys->gap++] = n; in bch2_journal_key_insert_take()
453 if (iter->idx == iter->keys->gap) in bch2_journal_iter_advance()
678 keys->nr = keys->gap = keys->size = 0; in bch2_journal_keys_put()
754 keys->gap = keys->nr; in bch2_journal_keys_sort()
776 keys->nr = keys->gap = dst; in bch2_shoot_down_journal_keys()