Home
last modified time | relevance | path

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

/linux-6.15/drivers/tee/optee/
H A Dnotif.c38 if (key > optee->notif.max_key) in optee_notif_wait()
95 if (key > optee->notif.max_key) in optee_notif_send()
114 int optee_notif_init(struct optee *optee, u_int max_key) in optee_notif_init() argument
118 optee->notif.bitmap = bitmap_zalloc(max_key, GFP_KERNEL); in optee_notif_init()
122 optee->notif.max_key = max_key; in optee_notif_init()
H A Doptee_private.h80 u_int max_key; member
275 int optee_notif_init(struct optee *optee, u_int max_key);
/linux-6.15/fs/bcachefs/
H 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()
211 .max_key = bn->max_key, in try_read_btree_node()
327 bpos_gt(l->max_key, r->min_key)); in nodes_overlap()
341 if (bpos_cmp(l->max_key, r->max_key) >= 0) in handle_overwrites()
357 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()
528 .max_key = SPOS_MAX, in bch2_btree_has_scanned_nodes()
566 .max_key = node_max, in bch2_get_scanned_nodes()
[all …]
H A Dbtree_io.h211 bn->max_key.snapshot = 0; in compat_btree_node()
214 compat_bpos(level, btree_id, version, big_endian, write, &bn->max_key); in compat_btree_node()
218 bn->max_key.snapshot = U32_MAX; in compat_btree_node()
H A Dbtree_node_scan_types.h17 struct bpos max_key; member
H A Dbset.c590 struct bkey_packed *max_key) in make_bfloat() argument
598 ? max_key in make_bfloat()
699 struct bkey_i min_key, max_key; in __build_ro_aux_tree() local
735 if (!bkey_pack_pos(bkey_to_packed(&max_key), b->data->max_key, b)) { in __build_ro_aux_tree()
736 bkey_init(&max_key.k); in __build_ro_aux_tree()
737 max_key.k.p = b->data->max_key; in __build_ro_aux_tree()
744 bkey_to_packed(&max_key)); in __build_ro_aux_tree()
1308 EBUG_ON(bpos_gt(*search, b->data->max_key)); in bch2_btree_node_iter_init()
H A Dbtree_update_interior.c79 if (!bpos_eq(b->data->max_key, SPOS_MAX)) { in bch2_btree_node_check_topology()
81 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()
424 b->data->max_key = pos; in btree_set_max()
444 btree_set_max(n, b->data->max_key); in bch2_btree_node_alloc_replacement()
1505 btree_set_max(n[1], b->data->max_key); in __btree_split_node()
1509 bch2_bkey_format_add_pos(&format[i], n[i]->data->max_key); in __btree_split_node()
2009 : bpos_successor(b->data->max_key); in __bch2_foreground_maybe_merge()
2044 bch2_bpos_to_text(&buf, prev->data->max_key); in __bch2_foreground_maybe_merge()
2059 bch2_bkey_format_add_pos(&new_s, next->data->max_key); in __bch2_foreground_maybe_merge()
[all …]
H A Dbtree_io.c35 bch2_bpos_to_text(out, bn->max_key); in bch2_btree_node_header_to_text()
656 if (bkey_cmp_left_packed(b, k, &b->data->max_key) > 0) in bch2_btree_node_drop_keys_outside_node()
678 BUG_ON(bpos_gt(k.k->p, b->data->max_key)); in bch2_btree_node_drop_keys_outside_node()
792 b->data->max_key = b->key.k.p; in validate_bset()
806 btree_err_on(!bpos_eq(bn->max_key, b->key.k.p), in validate_bset()
812 bch2_bpos_to_text(&buf1, bn->max_key), buf1.buf)); in validate_bset()
1054 bch2_bpos_to_text(&buf, b->data->max_key); in bch2_btree_node_read_done()
H A Dbtree_gc.c195 b->data->max_key = new_max; in set_node_max()
277 if (bpos_ge(expected_start, cur->data->max_key)) { /* fully? */ in btree_check_node_boundaries()
358 BUG_ON(bpos_gt(k.k->p, b->data->max_key)); in bch2_btree_repair_topology_recurse()
H 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()
H A Dbkey_methods.c264 bkey_fsck_err_on(bpos_gt(k.k->p, b->data->max_key), in bch2_bkey_in_btree_node()
H A Dbtree_journal_iter.c582 if (ret.k && iter->b && bpos_gt(ret.k->p, iter->b->data->max_key)) in bch2_btree_and_journal_iter_peek()
H A Dbcachefs_format.h1476 struct bpos max_key; member
H A Dbtree_trans_commit.c164 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key)); in bch2_btree_bset_insert_key()
H A Dbtree_iter.c637 bpos_cmp(i->k->k.p, b->data->max_key) <= 0) { in bch2_trans_revalidate_updates_in_node()
/linux-6.15/samples/bpf/
H A Dlwt_len_hist_user.c34 uint64_t key = 0, next_key, max_key = 0; in main() local
58 if (sum && next_key > max_key) in main()
59 max_key = next_key; in main()
67 for (i = 1; i <= max_key + 1; i++) { in main()
/linux-6.15/tools/testing/selftests/bpf/prog_tests/
H A Dbpf_loop.c145 const int max_key = 12; in check_stack() local
157 for (key = 1; key <= max_key; ++key) { in check_stack()
167 for (key = 1; key <= max_key; ++key) { in check_stack()
/linux-6.15/fs/btrfs/
H A Dtree-log.c4072 u64 max_key; in log_directory_changes() local
4080 max_key = 0; in log_directory_changes()
4084 ctx, min_key, &max_key); in log_directory_changes()
4087 if (max_key == (u64)-1) in log_directory_changes()
4089 min_key = max_key + 1; in log_directory_changes()
6396 struct btrfs_key max_key; in btrfs_log_inode() local
6423 max_key.objectid = ino; in btrfs_log_inode()
6433 max_key.type = (u8)-1; in btrfs_log_inode()
6434 max_key.offset = (u64)-1; in btrfs_log_inode()
6546 inode, max_key.type); in btrfs_log_inode()
[all …]
H A Drelocation.c1318 const struct btrfs_key *max_key) in invalidate_extent_cache() argument
1334 if (objectid > max_key->objectid) in invalidate_extent_cache()
1342 if (ino > max_key->objectid) { in invalidate_extent_cache()
1364 if (unlikely(max_key->objectid == ino)) { in invalidate_extent_cache()
1365 if (max_key->type < BTRFS_EXTENT_DATA_KEY) in invalidate_extent_cache()
1367 if (max_key->type > BTRFS_EXTENT_DATA_KEY) { in invalidate_extent_cache()
1370 if (max_key->offset == 0) in invalidate_extent_cache()
1372 end = max_key->offset; in invalidate_extent_cache()
/linux-6.15/fs/ubifs/
H 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()