fs/bcachefs/btree_update_interior.c

63 	struct bpos node_min = b->key.k.type == KEY_TYPE_btree_ptr_v2
64 		? bkey_i_to_btree_ptr_v2(&b->key)->v.min_key
72 	BUG_ON(b->key.k.type == KEY_TYPE_btree_ptr_v2 &&
73 	       !bpos_eq(bkey_i_to_btree_ptr_v2(&b->key)->v.min_key,
100 			bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
121 		bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
125 	} else if (!bpos_eq(prev.k->k.p, b->key.k.p)) {
132 		bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
133 		prt_str(&buf, "\n  last key ");
371 	bkey_copy(&b->key, &tmp.k);
410 	if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
411 		struct bkey_i_btree_ptr_v2 *bp = bkey_i_to_btree_ptr_v2(&b->key);
432 	if (b->key.k.type == KEY_TYPE_btree_ptr_v2)
433 		bkey_i_to_btree_ptr_v2(&b->key)->v.min_key = pos;
439 	b->key.k.p = pos;
506 				bkey_copy(&a->k, &b->key);
598 	struct bkey_i *k = &b->key;
739 						as->btree_id, b->c.level, b->key.k.p);
921 	struct bkey_i *insert = &b->key;
972 	if (b->key.k.type == KEY_TYPE_btree_ptr_v2) {
976 		bkey_i_to_btree_ptr_v2(&b->key)->v.sectors_written =
1429 		if (bpos_gt(insert->k.p, b->key.k.p))
1622 		path1 = get_unlocked_mut_path(trans, as->btree_id, n1->c.level, n1->key.k.p);
1627 		path2 = get_unlocked_mut_path(trans, as->btree_id, n2->c.level, n2->key.k.p);
1637 		bch2_keylist_add(&as->parent_keys, &n1->key);
1638 		bch2_keylist_add(&as->parent_keys, &n2->key);
1672 		path1 = get_unlocked_mut_path(trans, as->btree_id, n1->c.level, n1->key.k.p);
1678 			bch2_keylist_add(&as->parent_keys, &n1->key);
1895 	bch2_keylist_add(&as->parent_keys, &b->key);
2075 	new_path = get_unlocked_mut_path(trans, btree, n->c.level, n->key.k.p);
2081 	delete.k.p = prev->key.k.p;
2083 	bch2_keylist_add(&as->parent_keys, &n->key);
2153 	new_path = get_unlocked_mut_path(trans, iter->btree_id, n->c.level, n->key.k.p);
2161 		bch2_keylist_add(&as->parent_keys, &n->key);
2219 			bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
2263 	a->pos		= b->key.k.p;
2335 					     bkey_i_to_s_c(&b->key),
2345 		bkey_copy(&new_hash->key, new_key);
2397 		bkey_copy(&b->key, new_key);
2402 		bkey_copy(&b->key, new_key);
2474 	bch2_trans_node_iter_init(trans, &iter, b->c.btree_id, b->key.k.p,
2492 			    !bch2_bkey_has_device(bkey_i_to_s(&b->key), ptr->dev));
2536 	bkey_btree_ptr_init(&b->key);
2537 	b->key.k.p = SPOS_MAX;
2538 	*((u64 *) bkey_i_to_btree_ptr(&b->key)->v.start) = U64_MAX - id;
2618 	bkey_copy(&r->key, (struct bkey_i *) entry->start);
2637 					  i, r->level, &r->key, r->key.k.u64s);