/linux-master/fs/bcachefs/ |
H A D | btree_node_scan_types.h | 15 struct bpos min_key; member in struct:found_btree_node
|
H A D | btree_node_scan.c | 26 bch2_bpos_to_text(out, n->min_key); 60 bp->v.min_key = f->min_key; 114 bpos_cmp(l->min_key, r->min_key) ?: 155 .min_key = bn->min_key, 286 bpos_lt(n->min_key, start->max_key); 295 n->min_key = bpos_successor(start->max_key); 301 BUG_ON(bpos_cmp(n->min_key, star [all...] |
H A D | btree_io.h | 201 !bpos_eq(bn->min_key, POS_MIN) && 203 bn->min_key = bpos_nosnap_predecessor(bn->min_key); 209 compat_bpos(level, btree_id, version, big_endian, write, &bn->min_key); 218 !bpos_eq(bn->min_key, POS_MIN) && 220 bn->min_key = bpos_nosnap_successor(bn->min_key);
|
H A D | btree_gc.c | 87 dst->v.min_key = b->data->min_key; 150 b->data->min_key = new_min; 151 new->v.min_key = new_min; 217 ? b->data->min_key 223 !bpos_eq(bkey_i_to_btree_ptr_v2(&b->key)->v.min_key, 224 b->data->min_key)); 226 if (bpos_eq(expected_start, cur->data->min_key)) 241 if (bpos_lt(expected_start, cur->data->min_key)) { /* gap */ 243 bpos_lt(*pulled_from_scan, cur->data->min_key)) { [all...] |
H A D | extents_format.h | 249 struct bpos min_key; member in struct:bch_btree_ptr_v2
|
H A D | bset.c | 617 struct bkey_packed *min_key, 623 ? min_key 728 struct bkey_i min_key, max_key; local 764 if (!bkey_pack_pos(bkey_to_packed(&min_key), b->data->min_key, b)) { 765 bkey_init(&min_key.k); 766 min_key.k.p = b->data->min_key; 777 bkey_to_packed(&min_key), 1335 EBUG_ON(bpos_lt(*search, b->data->min_key)); 615 make_bfloat(struct btree *b, struct bset_tree *t, unsigned j, struct bkey_packed *min_key, struct bkey_packed *max_key) argument [all...] |
H A D | btree_update_interior.c | 64 ? bkey_i_to_btree_ptr_v2(&b->key)->v.min_key 65 : b->data->min_key; 73 !bpos_eq(bkey_i_to_btree_ptr_v2(&b->key)->v.min_key, 74 b->data->min_key)); 93 if (!bpos_eq(expected_min, bp.v->min_key)) { 177 bch2_bkey_format_add_pos(&s, b->data->min_key); 433 bkey_i_to_btree_ptr_v2(&b->key)->v.min_key = pos; 434 b->data->min_key = pos; 459 btree_set_min(n, b->data->min_key); 1492 btree_set_min(n[0], b->data->min_key); [all...] |
H A D | extents.c | 200 bkey_fsck_err_on(bpos_ge(bp.v->min_key, bp.k->p), 202 "min_key > key"); 214 prt_printf(out, "seq %llx written %u min_key %s", 219 bch2_bpos_to_text(out, bp.v->min_key); 230 compat_bpos(0, btree_id, version, big_endian, write, &bp.v->min_key); 234 !bkey_eq(bp.v->min_key, POS_MIN)) 235 bp.v->min_key = write 236 ? bpos_nosnap_predecessor(bp.v->min_key) 237 : bpos_nosnap_successor(bp.v->min_key);
|
H A D | btree_io.c | 629 if (bkey_cmp_left_packed(b, k, &b->data->min_key) >= 0) 663 BUG_ON(bpos_lt(k.k->p, b->data->min_key)); 777 b->data->min_key = bp->min_key; 781 btree_err_on(!bpos_eq(b->data->min_key, bp->min_key), 785 "incorrect min_key: got %s should be %s", 787 bch2_bpos_to_text(&buf1, bn->min_key), buf1.buf), 789 bch2_bpos_to_text(&buf2, bp->min_key), buf2.buf)); 1016 bch2_bpos_to_text(&buf, b->data->min_key); [all...] |
H A D | btree_journal_iter.c | 472 iter->pos = b->data->min_key; 494 __bch2_btree_and_journal_iter_init_node_iter(trans, iter, b, node_iter, b->data->min_key);
|
H A D | btree_cache.c | 820 bch2_bpos_to_text(&buf, b->data->min_key); 836 !bpos_eq(b->data->min_key, 837 bkey_i_to_btree_ptr_v2(&b->key)->v.min_key))) 1210 bch2_bpos_to_text(out, b->data->min_key);
|
H A D | bkey_methods.c | 239 bkey_fsck_err_on(bpos_lt(k.k->p, b->data->min_key), c, err,
|
H A D | btree_iter.c | 100 return bpos_lt(path->pos, b->data->min_key); 355 if (bkey_ge(pos, path->l[0].b->data->min_key) && 597 path->pos = k.k ? k.k->p : l->b->data->min_key; 660 bpos_cmp(i->k->k.p, b->data->min_key) >= 0 && 1908 struct bpos end = path_l(btree_iter_path(trans, iter))->b->data->min_key; 2404 } else if (likely(!bpos_eq(path->l[0].b->data->min_key, POS_MIN))) { 2406 search_key = bpos_predecessor(path->l[0].b->data->min_key);
|
H A D | btree_trans_commit.c | 140 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key));
|
H A D | bcachefs_format.h | 1603 struct bpos min_key; member in struct:btree_node
|
/linux-master/fs/btrfs/ |
H A D | tree-log.c | 3813 struct btrfs_key min_key; local 3821 min_key.objectid = ino; 3822 min_key.type = BTRFS_DIR_INDEX_KEY; 3823 min_key.offset = min_offset; 3825 ret = btrfs_search_forward(root, &min_key, path, trans->transid); 3831 if (ret != 0 || min_key.objectid != ino || 3832 min_key.type != BTRFS_DIR_INDEX_KEY) { 3833 min_key.objectid = ino; 3834 min_key.type = BTRFS_DIR_INDEX_KEY; 3835 min_key 4069 u64 min_key; local 5848 copy_inode_items_to_log(struct btrfs_trans_handle *trans, struct btrfs_inode *inode, struct btrfs_key *min_key, const struct btrfs_key *max_key, struct btrfs_path *path, struct btrfs_path *dst_path, const u64 logged_isize, const int inode_only, struct btrfs_log_ctx *ctx, bool *need_log_inode_item) argument 6392 struct btrfs_key min_key; local [all...] |
H A D | ctree.h | 535 int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key,
|
H A D | relocation.c | 1517 * [min_key, max_key) 1520 const struct btrfs_key *min_key, 1529 objectid = min_key->objectid; 1553 if (unlikely(min_key->objectid == ino)) { 1554 if (min_key->type > BTRFS_EXTENT_DATA_KEY) 1556 if (min_key->type < BTRFS_EXTENT_DATA_KEY) 1559 start = min_key->offset; 1519 invalidate_extent_cache(struct btrfs_root *root, const struct btrfs_key *min_key, const struct btrfs_key *max_key) argument
|
H A D | ctree.c | 4596 * A helper function to walk down the tree starting at min_key, and looking 4601 * into min_key, so you can call btrfs_search_slot with cow=1 on the 4614 int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, argument 4643 sret = btrfs_bin_search(cur, 0, min_key, &slot); 4681 sret = btrfs_find_next_key(root, path, min_key, level, 4713 memcpy(min_key, &found_key, sizeof(found_key));
|
/linux-master/fs/ubifs/ |
H A D | replay.c | 183 union ubifs_key min_key, max_key; local 196 data_key_init(c, &min_key, ino, min_blk); 199 return ubifs_tnc_remove_range(c, &min_key, &max_key);
|