Home
last modified time | relevance | path

Searched refs:max_key (Results 1 – 16 of 16) sorted by relevance

/fs/bcachefs/
A Dbtree_node_scan.c32 bch2_bpos_to_text(out, n->max_key); in found_btree_node_to_text()
58 bp->k.p = f->max_key; in found_btree_node_to_key()
178 .max_key = bn->max_key, in try_read_btree_node()
325 bpos_gt(l->max_key, r->min_key)); in nodes_overlap()
339 if (bpos_cmp(l->max_key, r->max_key) >= 0) in handle_overwrites()
355 if (bpos_cmp(l->max_key, r->max_key) >= 0) in handle_overwrites()
492 bpos_cmp(l->max_key, r->min_key); in found_btree_node_range_start_cmp()
513 .max_key = b->key.k.p, in bch2_btree_node_is_stale()
532 .max_key = SPOS_MAX, in bch2_btree_has_scanned_nodes()
570 .max_key = node_max, in bch2_get_scanned_nodes()
[all …]
A Dbtree_io.h221 bn->max_key.snapshot = 0; in compat_btree_node()
224 compat_bpos(level, btree_id, version, big_endian, write, &bn->max_key); in compat_btree_node()
228 bn->max_key.snapshot = U32_MAX; in compat_btree_node()
A Dbset.c598 struct bkey_packed *max_key) in make_bfloat() argument
606 ? max_key in make_bfloat()
707 struct bkey_i min_key, max_key; in __build_ro_aux_tree() local
743 if (!bkey_pack_pos(bkey_to_packed(&max_key), b->data->max_key, b)) { in __build_ro_aux_tree()
744 bkey_init(&max_key.k); in __build_ro_aux_tree()
745 max_key.k.p = b->data->max_key; in __build_ro_aux_tree()
752 bkey_to_packed(&max_key)); in __build_ro_aux_tree()
1316 EBUG_ON(bpos_gt(*search, b->data->max_key)); in bch2_btree_node_iter_init()
A Dbtree_node_scan_types.h17 struct bpos max_key; member
A Dbtree_update_interior.c79 if (!bpos_eq(b->data->max_key, SPOS_MAX)) { in bch2_btree_node_check_topology()
82 bch2_bpos_to_text(&buf, b->data->max_key); in bch2_btree_node_check_topology()
171 bch2_bkey_format_add_pos(&s, b->data->max_key); in bch2_btree_calc_format()
428 b->data->max_key = pos; in btree_set_max()
448 btree_set_max(n, b->data->max_key); in bch2_btree_node_alloc_replacement()
1244 as->node_end = b->data->max_key; in bch2_btree_update_start()
1547 btree_set_max(n[1], b->data->max_key); in __btree_split_node()
2052 : bpos_successor(b->data->max_key); in __bch2_foreground_maybe_merge()
2087 bch2_bpos_to_text(&buf, prev->data->max_key); in __bch2_foreground_maybe_merge()
2129 as->node_end = next->data->max_key; in __bch2_foreground_maybe_merge()
[all …]
A Dbtree_io.c37 bch2_bpos_to_text(out, bn->max_key); in bch2_btree_node_header_to_text()
698 if (bkey_cmp_left_packed(b, k, &b->data->max_key) > 0) in bch2_btree_node_drop_keys_outside_node()
720 BUG_ON(bpos_gt(k.k->p, b->data->max_key)); in bch2_btree_node_drop_keys_outside_node()
831 b->data->max_key = b->key.k.p; in validate_bset()
845 btree_err_on(!bpos_eq(bn->max_key, b->key.k.p), in validate_bset()
851 bch2_bpos_to_text(&buf1, bn->max_key), buf1.buf)); in validate_bset()
1096 bch2_bpos_to_text(&buf, b->data->max_key); in bch2_btree_node_read_done()
A Dbtree_gc.c196 b->data->max_key = new_max; in set_node_max()
278 if (bpos_ge(expected_start, cur->data->max_key)) { /* fully? */ in btree_check_node_boundaries()
359 BUG_ON(bpos_gt(k.k->p, b->data->max_key)); in bch2_btree_repair_topology_recurse()
A Dbtree_cache.c1021 bch2_bpos_to_text(&buf, b->data->max_key); in btree_bad_header()
1032 !bpos_eq(b->data->max_key, b->key.k.p) || in btree_check_header()
1440 bch2_bpos_to_text(out, b->data->max_key); in bch2_btree_node_to_text()
A Dbkey_methods.c264 bkey_fsck_err_on(bpos_gt(k.k->p, b->data->max_key), in bch2_bkey_in_btree_node()
A Dbtree_journal_iter.c587 if (ret.k && iter->b && bpos_gt(ret.k->p, iter->b->data->max_key)) in bch2_btree_and_journal_iter_peek()
A Dbcachefs_format.h1498 struct bpos max_key; member
A Dbtree_trans_commit.c166 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key)); in bch2_btree_bset_insert_key()
A Dbtree_iter.c651 bpos_cmp(i->k->k.p, b->data->max_key) <= 0) { in bch2_trans_revalidate_updates_in_node()
/fs/btrfs/
A Dtree-log.c4130 u64 max_key; in log_directory_changes() local
4138 max_key = 0; in log_directory_changes()
4142 ctx, min_key, &max_key); in log_directory_changes()
4145 if (max_key == (u64)-1) in log_directory_changes()
4147 min_key = max_key + 1; in log_directory_changes()
6447 struct btrfs_key max_key; in btrfs_log_inode() local
6474 max_key.objectid = ino; in btrfs_log_inode()
6484 max_key.type = (u8)-1; in btrfs_log_inode()
6485 max_key.offset = (u64)-1; in btrfs_log_inode()
6597 inode, max_key.type); in btrfs_log_inode()
[all …]
A Drelocation.c1346 const struct btrfs_key *max_key) in invalidate_extent_cache() argument
1362 if (objectid > max_key->objectid) in invalidate_extent_cache()
1370 if (ino > max_key->objectid) { in invalidate_extent_cache()
1392 if (unlikely(max_key->objectid == ino)) { in invalidate_extent_cache()
1393 if (max_key->type < BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1395 if (max_key->type > BTRFS_EXTENT_DATA_KEY) { in invalidate_extent_cache()
1398 if (max_key->offset == 0) in invalidate_extent_cache()
1400 end = max_key->offset; in invalidate_extent_cache()
/fs/ubifs/
A Dreplay.c184 union ubifs_key min_key, max_key; in trun_remove_range() local
198 data_key_init(c, &max_key, ino, max_blk); in trun_remove_range()
200 return ubifs_tnc_remove_range(c, &min_key, &max_key); in trun_remove_range()

Completed in 61 milliseconds