Searched refs:node_iter (Results 1 – 6 of 6) sorted by relevance
| /linux/fs/bcachefs/ |
| A D | btree_journal_iter.c | 357 return bch2_btree_node_iter_peek_unpack(&iter->node_iter, in bch2_journal_iter_peek_btree()
363 bch2_btree_node_iter_advance(&iter->node_iter, iter->b); in bch2_journal_iter_advance_btree()
449 struct btree_node_iter node_iter, in __bch2_btree_and_journal_iter_init_node_iter() argument
456 iter->node_iter = node_iter; in __bch2_btree_and_journal_iter_init_node_iter()
476 struct btree_node_iter node_iter; in bch2_btree_and_journal_iter_init_node_iter() local
478 bch2_btree_node_iter_init_from_start(&node_iter, b); in bch2_btree_and_journal_iter_init_node_iter()
479 __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()
|
| A D | btree_journal_iter.h | 22 struct btree_node_iter node_iter; member
|
| A D | btree_iter.c | 419 struct btree_node_iter *node_iter, in __bch2_btree_node_iter_fix() argument
430 unsigned orig_iter_pos = node_iter->data[0].k; in __bch2_btree_node_iter_fix()
435 btree_node_iter_for_each(node_iter, set) in __bch2_btree_node_iter_fix()
468 bch2_btree_node_iter_sort(node_iter, b); in __bch2_btree_node_iter_fix()
470 if (node_iter->data[0].k != orig_iter_pos) in __bch2_btree_node_iter_fix()
480 if (!bch2_btree_node_iter_end(node_iter) && in __bch2_btree_node_iter_fix()
502 btree_node_iter_set_set_pos(node_iter, in __bch2_btree_node_iter_fix()
511 struct btree_node_iter *node_iter, in bch2_btree_node_iter_fix() argument
520 if (node_iter != &path->l[b->c.level].iter) { in bch2_btree_node_iter_fix()
525 bch2_btree_node_iter_verify(node_iter, b); in bch2_btree_node_iter_fix()
[all …]
|
| A D | btree_update_interior.c | 1355 struct btree_node_iter *node_iter, in bch2_insert_fixup_btree_ptr() argument
1385 while ((k = bch2_btree_node_iter_peek_all(node_iter, b)) && in bch2_insert_fixup_btree_ptr()
1387 bch2_btree_node_iter_advance(node_iter, b); in bch2_insert_fixup_btree_ptr()
1389 bch2_btree_bset_insert_key(trans, path, b, node_iter, insert); in bch2_insert_fixup_btree_ptr()
1409 struct btree_node_iter node_iter, in bch2_btree_insert_keys_interior() argument
1417 while ((k = bch2_btree_node_iter_prev_all(&node_iter, b)) && in bch2_btree_insert_keys_interior()
1427 bch2_insert_fixup_btree_ptr(as, trans, path, b, &node_iter, insert); in bch2_btree_insert_keys_interior()
1573 struct btree_node_iter node_iter; in btree_split_insert_keys() local
1575 bch2_btree_node_iter_init(&node_iter, b, &bch2_keylist_front(keys)->k.p); in btree_split_insert_keys()
1577 bch2_btree_insert_keys_interior(as, trans, path, b, node_iter, keys); in btree_split_insert_keys()
|
| A D | btree_trans_commit.c | 154 struct btree_node_iter *node_iter, in bch2_btree_bset_insert_key() argument
168 k = bch2_btree_node_iter_peek_all(node_iter, b); in bch2_btree_bset_insert_key()
215 k = bch2_btree_node_iter_bset_pos(node_iter, b, bset_tree_last(b)); in bch2_btree_bset_insert_key()
221 bch2_btree_node_iter_fix(trans, path, b, node_iter, k, in bch2_btree_bset_insert_key()
|
| A D | ec.c | 1300 struct btree_iter node_iter; in ec_stripe_update_extent() local
1303 b = bch2_backpointer_get_node(trans, &node_iter, *bp_pos, bp); in ec_stripe_update_extent()
1304 bch2_trans_iter_exit(trans, &node_iter); in ec_stripe_update_extent()
|
Completed in 24 milliseconds