Home
last modified time | relevance | path

Searched refs:min_key (Results 1 – 22 of 22) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbtree_node_scan.c30 bch2_bpos_to_text(out, n->min_key); in found_btree_node_to_text()
63 bp->v.min_key = f->min_key; in found_btree_node_to_key()
139 bpos_cmp(l->min_key, r->min_key) ?: in found_btree_node_cmp_pos()
210 .min_key = bn->min_key, in try_read_btree_node()
327 bpos_gt(l->max_key, r->min_key)); in nodes_overlap()
350 BUG_ON(bpos_eq(l->min_key, r->min_key)); in handle_overwrites()
492 bpos_cmp(l->max_key, r->min_key); in found_btree_node_range_start_cmp()
512 .min_key = b->data->min_key, in bch2_btree_node_is_stale()
527 .min_key = POS_MIN, in bch2_btree_has_scanned_nodes()
565 .min_key = node_min, in bch2_get_scanned_nodes()
[all …]
H A Dbtree_io.h205 !bpos_eq(bn->min_key, POS_MIN) && in compat_btree_node()
207 bn->min_key = bpos_nosnap_predecessor(bn->min_key); in compat_btree_node()
213 compat_bpos(level, btree_id, version, big_endian, write, &bn->min_key); in compat_btree_node()
222 !bpos_eq(bn->min_key, POS_MIN) && in compat_btree_node()
224 bn->min_key = bpos_nosnap_successor(bn->min_key); in compat_btree_node()
H A Dbtree_gc.c121 dst->v.min_key = b->data->min_key; in btree_ptr_to_v2()
155 b->data->min_key = new_min; in set_node_min()
156 new->v.min_key = new_min; in set_node_min()
223 ? b->data->min_key in btree_check_node_boundaries()
230 b->data->min_key)); in btree_check_node_boundaries()
232 if (bpos_eq(expected_start, cur->data->min_key)) in btree_check_node_boundaries()
253 bpos_predecessor(cur->data->min_key)); in btree_check_node_boundaries()
257 *pulled_from_scan = cur->data->min_key; in btree_check_node_boundaries()
266 if (bpos_ge(prev->data->min_key, cur->data->min_key)) { /* fully? */ in btree_check_node_boundaries()
274 bpos_predecessor(cur->data->min_key)); in btree_check_node_boundaries()
[all …]
H A Dbtree_node_scan_types.h16 struct bpos min_key; member
H A Dbset.c589 struct bkey_packed *min_key, in make_bfloat() argument
595 ? min_key in make_bfloat()
699 struct bkey_i min_key, max_key; in __build_ro_aux_tree() local
730 if (!bkey_pack_pos(bkey_to_packed(&min_key), b->data->min_key, b)) { in __build_ro_aux_tree()
731 bkey_init(&min_key.k); in __build_ro_aux_tree()
732 min_key.k.p = b->data->min_key; in __build_ro_aux_tree()
743 bkey_to_packed(&min_key), in __build_ro_aux_tree()
1307 EBUG_ON(bpos_lt(*search, b->data->min_key)); in bch2_btree_node_iter_init()
H A Dbtree_update_interior.c51 ? bkey_i_to_btree_ptr_v2(&b->key)->v.min_key in bch2_btree_node_check_topology()
52 : b->data->min_key; in bch2_btree_node_check_topology()
63 b->data->min_key)); in bch2_btree_node_check_topology()
70 if (!bpos_eq(b->data->min_key, POS_MIN)) { in bch2_btree_node_check_topology()
73 bch2_bpos_to_text(&buf, b->data->min_key); in bch2_btree_node_check_topology()
101 if (!bpos_eq(expected_min, bp.v->min_key)) { in bch2_btree_node_check_topology()
418 b->data->min_key = pos; in btree_set_min()
443 btree_set_min(n, b->data->min_key); in bch2_btree_node_alloc_replacement()
1502 btree_set_min(n[0], b->data->min_key); in __btree_split_node()
2008 ? bpos_predecessor(b->data->min_key) in __bch2_foreground_maybe_merge()
[all …]
H A Dextents.c270 bkey_fsck_err_on(bpos_ge(bp.v->min_key, bp.k->p), in bch2_btree_ptr_v2_validate()
295 bch2_bpos_to_text(out, bp.v->min_key); in bch2_btree_ptr_v2_to_text()
306 compat_bpos(0, btree_id, version, big_endian, write, &bp.v->min_key); in bch2_btree_ptr_v2_compat()
310 !bkey_eq(bp.v->min_key, POS_MIN)) in bch2_btree_ptr_v2_compat()
311 bp.v->min_key = write in bch2_btree_ptr_v2_compat()
312 ? bpos_nosnap_predecessor(bp.v->min_key) in bch2_btree_ptr_v2_compat()
313 : bpos_nosnap_successor(bp.v->min_key); in bch2_btree_ptr_v2_compat()
H A Dextents_format.h258 struct bpos min_key; member
H A Dbtree_io.c32 bch2_bpos_to_text(out, bn->min_key); in bch2_btree_node_header_to_text()
643 if (bkey_cmp_left_packed(b, k, &b->data->min_key) >= 0) in bch2_btree_node_drop_keys_outside_node()
677 BUG_ON(bpos_lt(k.k->p, b->data->min_key)); in bch2_btree_node_drop_keys_outside_node()
791 b->data->min_key = bp->min_key; in validate_bset()
795 btree_err_on(!bpos_eq(b->data->min_key, bp->min_key), in validate_bset()
801 bch2_bpos_to_text(&buf1, bn->min_key), buf1.buf), in validate_bset()
803 bch2_bpos_to_text(&buf2, bp->min_key), buf2.buf)); in validate_bset()
1052 bch2_bpos_to_text(&buf, b->data->min_key); in bch2_btree_node_read_done()
H A Dbtree_cache.c1018 bch2_bpos_to_text(&buf, b->data->min_key); in btree_bad_header()
1034 !bpos_eq(b->data->min_key, in btree_check_header()
1035 bkey_i_to_btree_ptr_v2(&b->key)->v.min_key))) in btree_check_header()
1438 bch2_bpos_to_text(out, b->data->min_key); in bch2_btree_node_to_text()
H A Dbtree_journal_iter.c615 iter->pos = b->data->min_key; in __bch2_btree_and_journal_iter_init_node_iter()
637 __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()
H A Dbtree_iter.c100 return bpos_lt(path->pos, b->data->min_key); in btree_path_pos_before_node()
345 if (bkey_ge(pos, path->l[0].b->data->min_key) && in bch2_assert_pos_locked()
573 path->pos = k.k ? k.k->p : l->b->data->min_key; in btree_path_level_prev()
636 bpos_cmp(i->k->k.p, b->data->min_key) >= 0 && in bch2_trans_revalidate_updates_in_node()
1514 bch2_bpos_to_text(out, b->data->min_key); in bch2_btree_path_to_text_short()
2068 struct bpos end = path_l(btree_iter_path(trans, iter))->b->data->min_key; in bch2_btree_trans_peek_prev_updates()
2558 } else if (likely(!bpos_eq(path->l[0].b->data->min_key, POS_MIN))) { in __bch2_btree_iter_peek_prev()
2560 search_key = bpos_predecessor(path->l[0].b->data->min_key); in __bch2_btree_iter_peek_prev()
H A Dbkey_methods.c260 bkey_fsck_err_on(bpos_lt(k.k->p, b->data->min_key), in bch2_bkey_in_btree_node()
H A Dbcachefs_format.h1475 struct bpos min_key; member
H A Dbtree_trans_commit.c163 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key)); in bch2_btree_bset_insert_key()
H A Dbackpointers.c953 struct bpos pos = bkey_s_c_to_btree_ptr_v2(k).v->min_key; in backpointer_node_has_missing()
/linux-6.15/fs/btrfs/
H A Dtree-log.c3815 struct btrfs_key min_key; in log_dir_items() local
3823 min_key.objectid = ino; in log_dir_items()
3835 min_key.objectid = ino; in log_dir_items()
3941 if (min_key.objectid != ino || min_key.type != BTRFS_DIR_INDEX_KEY) { in log_dir_items()
4071 u64 min_key; in log_directory_changes() local
4089 min_key = max_key + 1; in log_directory_changes()
5977 min_key->offset++; in copy_inode_items_to_log()
5979 min_key->type++; in copy_inode_items_to_log()
5980 min_key->offset = 0; in copy_inode_items_to_log()
6419 min_key.objectid = ino; in btrfs_log_inode()
[all …]
H A Dctree.h557 int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key,
H A Drelocation.c1317 const struct btrfs_key *min_key, in invalidate_extent_cache() argument
1326 objectid = min_key->objectid; in invalidate_extent_cache()
1351 if (unlikely(min_key->objectid == ino)) { in invalidate_extent_cache()
1352 if (min_key->type > BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1354 if (min_key->type < BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1357 start = min_key->offset; in invalidate_extent_cache()
H A Dctree.c4605 int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, in btrfs_search_forward() argument
4633 sret = btrfs_bin_search(cur, 0, min_key, &slot); in btrfs_search_forward()
4646 btrfs_item_key_to_cpu(cur, min_key, slot); in btrfs_search_forward()
4672 sret = btrfs_find_next_key(root, path, min_key, level, in btrfs_search_forward()
4684 btrfs_node_key_to_cpu(cur, min_key, slot); in btrfs_search_forward()
/linux-6.15/tools/testing/selftests/net/openvswitch/
H A Dopenvswitch.sh273 min_key='in_port(1),eth(),eth_type(0x0800),ipv4()'
280 ovs_test_flow_fails "test_psample" psample $min_key $2
/linux-6.15/fs/ubifs/
H A Dreplay.c184 union ubifs_key min_key, max_key; in trun_remove_range() local
197 data_key_init(c, &min_key, ino, min_blk); in trun_remove_range()
200 return ubifs_tnc_remove_range(c, &min_key, &max_key); in trun_remove_range()