Home
last modified time | relevance | path

Searched refs:keys (Results 1 – 25 of 41) sorted by relevance

12

/fs/bcachefs/
A Dbtree_journal_iter.c226 size_t gap_end = keys->gap + (keys->size - keys->nr); in journal_iters_fix()
288 idx -= keys->size - keys->nr; in bch2_journal_key_insert_take()
292 if (keys->nr == keys->size) { in bch2_journal_key_insert_take()
316 keys->gap = keys->nr; in bch2_journal_key_insert_take()
324 keys->data[keys->gap++] = n; in bch2_journal_key_insert_take()
670 move_gap(keys, keys->nr); in bch2_journal_keys_put()
684 keys->nr = keys->gap = keys->size = 0; in bch2_journal_keys_put()
778 keys->gap = keys->nr; in bch2_journal_keys_sort()
791 move_gap(keys, keys->nr); in bch2_shoot_down_journal_keys()
800 keys->nr = keys->gap = dst; in bch2_shoot_down_journal_keys()
[all …]
A Dbtree_write_buffer.c226 if (!wb->inc.keys.nr) in move_keys_from_inc_to_flushing()
232 darray_resize(&wb->flushing.keys, min_t(size_t, 1U << 20, wb->flushing.keys.nr + wb->inc.keys.nr)); in move_keys_from_inc_to_flushing()
235 if (!wb->flushing.keys.nr && wb->sorted.size >= wb->inc.keys.nr) { in move_keys_from_inc_to_flushing()
236 swap(wb->flushing.keys, wb->inc.keys); in move_keys_from_inc_to_flushing()
250 sizeof(wb->inc.keys.data[0]) * (wb->inc.keys.nr - nr)); in move_keys_from_inc_to_flushing()
253 wb->inc.keys.nr -= nr; in move_keys_from_inc_to_flushing()
255 if (!wb->inc.keys.nr) in move_keys_from_inc_to_flushing()
491 wb->flushing.keys.nr = dst - wb->flushing.keys.data; in bch2_btree_write_buffer_flush_locked()
565 *did_work |= wb->inc.keys.nr || wb->flushing.keys.nr; in btree_write_buffer_flush_seq()
759 dst->wb->keys.nr++; in bch2_journal_key_to_wb_slowpath()
[all …]
A Dbtree_write_buffer.h12 return wb->inc.keys.nr + wb->flushing.keys.nr > wb->inc.keys.size / 4; in bch2_btree_write_buffer_should_flush()
19 return wb->inc.keys.nr > wb->inc.keys.size * 3 / 4; in bch2_btree_write_buffer_must_wait()
79 struct btree_write_buffered_key *wb_k = &darray_top(dst->wb->keys); in __bch2_journal_key_to_wb()
83 dst->wb->keys.nr++; in __bch2_journal_key_to_wb()
A Dkeylist.h34 return l->top == l->keys; in bch2_keylist_empty()
49 return l->keys; in bch2_keylist_front()
53 for (struct bkey_i *_k = (_keylist)->keys; \
57 static inline u64 keylist_sectors(struct keylist *keys) in keylist_sectors() argument
61 for_each_keylist_key(keys, k) in keylist_sectors()
A Dbtree_io.c250 i = &dst->keys; in bch2_drop_whiteouts()
261 i = &dst->keys; in bch2_drop_whiteouts()
1268 btree_err_on(bne->keys.seq == b->data->keys.seq && in bch2_btree_node_read_done()
1287 b->data->keys.u64s = sorted->keys.u64s; in bch2_btree_node_read_done()
1533 if (bne->keys.seq != bn->keys.seq) in btree_node_sectors_written()
1552 if (bne->keys.seq == bn->keys.seq) in btree_node_has_extra_bsets()
1633 if (bne->keys.seq != bn->keys.seq) in CLOSURE_CALLBACK()
1647 if (bne->keys.seq == bn->keys.seq) { in CLOSURE_CALLBACK()
2436 i = &bn->keys; in __bch2_btree_node_write()
2439 bne->keys = b->data->keys; in __bch2_btree_node_write()
[all …]
A Dbtree_update_interior.c591 bkey_copy(keys->top, k); in btree_update_add_key()
594 bch2_keylist_push(keys); in btree_update_add_key()
1440 struct keylist *keys) in bch2_btree_insert_keys_interior() argument
1460 for (struct bkey_i *k = keys->keys; in bch2_btree_insert_keys_interior()
1473 memmove_u64s_down(keys->keys, insert, keys->top_p - insert->_data); in bch2_btree_insert_keys_interior()
1474 keys->top_p -= insert->_data - keys->keys_p; in bch2_btree_insert_keys_interior()
1613 struct keylist *keys) in btree_split_insert_keys() argument
1633 struct keylist *keys) in btree_split() argument
1660 if (keys) { in btree_split()
1719 if (keys) { in btree_split()
[all …]
A Dio_write.c375 struct keylist *keys = &op->insert_keys; in bch2_write_index_default() local
392 k = bch2_keylist_front(keys); in bch2_write_index_default()
421 } while (!bch2_keylist_empty(keys)); in bch2_write_index_default()
562 struct keylist *keys = &op->insert_keys; in bch2_write_drop_io_error_ptrs() local
563 struct bkey_i *src, *dst = keys->keys, *n; in bch2_write_drop_io_error_ptrs()
565 for (src = keys->keys; src != keys->top; src = n) { in bch2_write_drop_io_error_ptrs()
581 keys->top = dst; in bch2_write_drop_io_error_ptrs()
592 struct keylist *keys = &op->insert_keys; in __bch2_write_index() local
602 if (!bch2_keylist_empty(keys)) { in __bch2_write_index()
610 BUG_ON(keylist_sectors(keys) && !ret); in __bch2_write_index()
[all …]
A Dkeylist.c38 memmove_u64s_down(l->keys, in bch2_keylist_pop_front()
39 bkey_next(l->keys), in bch2_keylist_pop_front()
A Dbtree_node_scan.c152 if (bch2_csum_type_is_encryption(BSET_CSUM_TYPE(&bn->keys))) { in try_read_btree_node()
156 struct nonce nonce = btree_nonce(&bn->keys, 0); in try_read_btree_node()
157 unsigned bytes = (void *) &bn->keys - (void *) &bn->flags; in try_read_btree_node()
159 bch2_encrypt(c, BSET_CSUM_TYPE(&bn->keys), nonce, &bn->flags, bytes); in try_read_btree_node()
176 .cookie = le64_to_cpu(bn->keys.seq), in try_read_btree_node()
206 n.journal_seq = le64_to_cpu(bn->keys.journal_seq), in try_read_btree_node()
210 if (BSET_BIG_ENDIAN(&bn->keys) != CPU_BIG_ENDIAN) { in try_read_btree_node()
A Drecovery.c182 static void zero_out_btree_mem_ptr(struct journal_keys *keys) in zero_out_btree_mem_ptr() argument
184 darray_for_each(*keys, i) in zero_out_btree_mem_ptr()
344 struct journal_keys *keys = &c->journal_keys; in bch2_journal_replay() local
353 if (keys->nr) { in bch2_journal_replay()
355 keys->nr, start_seq, end_seq); in bch2_journal_replay()
360 BUG_ON(!atomic_read(&keys->ref)); in bch2_journal_replay()
362 move_gap(keys, keys->nr); in bch2_journal_replay()
369 darray_for_each(*keys, k) { in bch2_journal_replay()
395 darray_for_each(*keys, k) { in bch2_journal_replay()
480 if (keys->nr) in bch2_journal_replay()
A Ddisk_accounting.c803 struct journal_keys *keys = &c->journal_keys; in bch2_accounting_read() local
804 struct journal_key *dst = keys->data; in bch2_accounting_read()
805 move_gap(keys, keys->nr); in bch2_accounting_read()
807 darray_for_each(*keys, i) { in bch2_accounting_read()
826 if (i + 1 < &darray_top(*keys) && in bch2_accounting_read()
845 keys->gap = keys->nr = dst - keys->data; in bch2_accounting_read()
A Ddebug.c43 struct bset *sorted, *inmemory = &b->data->keys; in bch2_btree_verify_replica()
73 sorted = &n_sorted->keys; in bch2_btree_verify_replica()
93 i = &n_ondisk->keys; in bch2_btree_verify_replica()
99 i = &bne->keys; in bch2_btree_verify_replica()
136 struct bset *inmemory = &b->data->keys; in __bch2_btree_verify()
236 i = &n_ondisk->keys; in bch2_btree_node_ondisk_to_text()
258 i = &bne->keys; in bch2_btree_node_ondisk_to_text()
260 if (i->seq != n_ondisk->keys.seq) in bch2_btree_node_ondisk_to_text()
A Dkeylist_types.h7 struct bkey_i *keys; member
A Dbtree_io.h114 struct btree_node *bn = container_of(i, struct btree_node, keys); in bset_encrypt()
115 unsigned bytes = (void *) &bn->keys - (void *) &bn->flags; in bset_encrypt()
A Dbtree_write_buffer_types.h45 DARRAY(struct btree_write_buffered_key) keys;
A Drecovery_passes.c209 struct journal_keys *keys = &c->journal_keys; in bch2_set_may_go_rw() local
216 move_gap(keys, keys->nr); in bch2_set_may_go_rw()
A Dbtree_journal_iter.h12 struct journal_keys *keys; member
/fs/xfs/libxfs/
A Dxfs_iext_tree.c281 if (node->keys[n] > offset) in xfs_iext_key_cmp()
421 node->keys[0] = prev->keys[0]; in xfs_iext_grow()
479 new->keys[i] = node->keys[nr_keep + i]; in xfs_iext_split_node()
532 node->keys[i] = node->keys[i - 1]; in xfs_iext_insert_node()
535 node->keys[pos] = offset; in xfs_iext_insert_node()
539 offset = new->keys[0]; in xfs_iext_insert_node()
709 prev->keys[nr_prev + i] = node->keys[i]; in xfs_iext_rebalance_node()
727 node->keys[nr_entries + i] = next->keys[i]; in xfs_iext_rebalance_node()
757 offset = node->keys[0]; in xfs_iext_remove_node()
759 node->keys[i] = node->keys[i + 1]; in xfs_iext_remove_node()
[all …]
/fs/xfs/
A Dxfs_fsmap.c469 const struct xfs_fsmap *keys, in __xfs_getfsmap_datadev() argument
540 keys[1].fmr_offset); in __xfs_getfsmap_datadev()
629 const struct xfs_fsmap *keys, in xfs_getfsmap_datadev_rmapbt() argument
664 const struct xfs_fsmap *keys, in xfs_getfsmap_datadev_bnobt() argument
679 const struct xfs_fsmap *keys, in xfs_getfsmap_logdev() argument
695 keys[0].fmr_physical + keys[0].fmr_length); in xfs_getfsmap_logdev()
699 if (keys[0].fmr_length > 0) in xfs_getfsmap_logdev()
754 const struct xfs_fsmap *keys, in xfs_getfsmap_rtdev_rtbitmap() argument
773 keys[0].fmr_physical + keys[0].fmr_length); in xfs_getfsmap_rtdev_rtbitmap()
774 if (keys[0].fmr_length > 0) { in xfs_getfsmap_rtdev_rtbitmap()
[all …]
/fs/ext4/
A Dfsmap.c59 struct ext4_fsmap *keys,
313 info->gfi_low = keys[0]; in ext4_getfsmap_logdev()
328 if (keys[0].fmr_physical > 0) in ext4_getfsmap_logdev()
525 struct ext4_fsmap *keys, in ext4_getfsmap_datadev() argument
542 if (keys[0].fmr_physical >= eofs) in ext4_getfsmap_datadev()
545 keys[0].fmr_physical = bofs; in ext4_getfsmap_datadev()
546 if (keys[1].fmr_physical >= eofs) in ext4_getfsmap_datadev()
548 if (keys[1].fmr_physical < keys[0].fmr_physical) in ext4_getfsmap_datadev()
551 end_fsb = keys[1].fmr_physical; in ext4_getfsmap_datadev()
562 info->gfi_low = keys[0]; in ext4_getfsmap_datadev()
[all …]
/fs/nilfs2/
A Dbmap.c105 __u64 keys[NILFS_BMAP_SMALL_HIGH + 1]; in nilfs_bmap_do_insert() local
113 bmap, keys, ptrs, NILFS_BMAP_SMALL_HIGH + 1); in nilfs_bmap_do_insert()
117 bmap, key, ptr, keys, ptrs, n); in nilfs_bmap_do_insert()
157 __u64 keys[NILFS_BMAP_LARGE_LOW + 1]; in nilfs_bmap_do_delete() local
165 bmap, keys, ptrs, NILFS_BMAP_LARGE_LOW + 1); in nilfs_bmap_do_delete()
169 bmap, key, keys, ptrs, n); in nilfs_bmap_do_delete()
A Ddirect.c208 __u64 *keys, __u64 *ptrs, int nitems) in nilfs_direct_gather_data() argument
220 keys[n] = key; in nilfs_direct_gather_data()
229 __u64 key, __u64 *keys, __u64 *ptrs, int n) in nilfs_direct_delete_and_convert() argument
248 if ((j < n) && (i == keys[j])) { in nilfs_direct_delete_and_convert()
/fs/btrfs/
A Dlocking.c61 struct lock_class_key keys[BTRFS_MAX_LEVEL]; member
86 ASSERT(level < ARRAY_SIZE(ks->keys)); in btrfs_set_buffer_lockdep_class()
93 lockdep_set_class_and_name(&eb->lock, &ks->keys[level], ks->names[level]); in btrfs_set_buffer_lockdep_class()
/fs/ecryptfs/
A DKconfig22 for userspace to wrap/unwrap file encryption keys by other
/fs/verity/
A Dsignature.c70 if (fsverity_keyring->keys.nr_leaves_on_tree == 0) { in fsverity_verify_signature()

Completed in 63 milliseconds

12