Lines Matching refs:data
41 return keys->data + idx_to_pos(keys, idx); in idx_to_key()
214 struct journal_key *k = keys->data + iter->idx; in journal_iter_verify()
227 struct journal_key *new_key = &keys->data[keys->gap - 1]; in journal_iters_fix()
280 journal_key_cmp(&n, &keys->data[idx]) == 0) { in bch2_journal_key_insert_take()
281 if (keys->data[idx].allocated) in bch2_journal_key_insert_take()
282 kfree(keys->data[idx].k); in bch2_journal_key_insert_take()
283 keys->data[idx] = n; in bch2_journal_key_insert_take()
301 new_keys.data = bch2_kvmalloc(new_keys.size * sizeof(new_keys.data[0]), GFP_KERNEL); in bch2_journal_key_insert_take()
302 if (!new_keys.data) { in bch2_journal_key_insert_take()
309 memcpy(new_keys.data, keys->data, sizeof(keys->data[0]) * keys->nr); in bch2_journal_key_insert_take()
310 kvfree(keys->data); in bch2_journal_key_insert_take()
311 keys->data = new_keys.data; in bch2_journal_key_insert_take()
324 keys->data[keys->gap++] = n; in bch2_journal_key_insert_take()
374 keys->data[idx].btree_id == btree && in bch2_key_deleted_in_journal()
375 keys->data[idx].level == level && in bch2_key_deleted_in_journal()
376 bpos_eq(keys->data[idx].k->k.p, pos) && in bch2_key_deleted_in_journal()
377 bkey_deleted(&keys->data[idx].k->k)); in bch2_key_deleted_in_journal()
382 struct journal_key *k = keys->data + pos; in __bch2_journal_key_overwritten()
387 struct journal_key *prev = idx > 0 ? keys->data + idx_to_pos(keys, idx - 1) : NULL; in __bch2_journal_key_overwritten()
388 struct journal_key *next = idx + 1 < keys->nr ? keys->data + idx_to_pos(keys, idx + 1) : NULL; in __bch2_journal_key_overwritten()
404 keys->data[pos].overwritten_range = prev_range; in __bch2_journal_key_overwritten()
406 struct journal_key *ip = keys->data + idx_to_pos(keys, i); in __bch2_journal_key_overwritten()
449 keys->data[idx].btree_id == btree && in bch2_journal_key_overwritten()
450 keys->data[idx].level == level && in bch2_journal_key_overwritten()
451 bpos_eq(keys->data[idx].k->k.p, pos) && in bch2_journal_key_overwritten()
452 !keys->data[idx].overwritten) { in bch2_journal_key_overwritten()
474 struct journal_key *k = iter->keys->data + iter->idx; in bch2_journal_iter_peek()
587 if (ret.k && iter->b && bpos_gt(ret.k->p, iter->b->data->max_key)) in bch2_btree_and_journal_iter_peek()
620 iter->pos = b->data->min_key; in __bch2_btree_and_journal_iter_init_node_iter()
642 __bch2_btree_and_journal_iter_init_node_iter(trans, iter, b, node_iter, b->data->min_key); in bch2_btree_and_journal_iter_init_node_iter()
682 kvfree(keys->data); in bch2_journal_keys_put()
683 keys->data = NULL; in bch2_journal_keys_put()
696 sort_nonatomic(keys->data, keys->nr, sizeof(keys->data[0]), in __journal_keys_sort()
701 struct journal_key *dst = keys->data; in __journal_keys_sort()
717 keys->nr = dst - keys->data; in __journal_keys_sort()
799 keys->data[dst++] = *i; in bch2_shoot_down_journal_keys()