Home
last modified time | relevance | path

Searched defs:k (Results 1 – 25 of 1092) sorted by relevance

12345678910>>...44

/linux-6.15/fs/bcachefs/
H A Dextents.c254 struct bkey_s_c k) in bch2_btree_ptr_to_text()
286 struct bkey_s_c k) in bch2_btree_ptr_v2_to_text()
302 struct bkey_s k) in bch2_btree_ptr_v2_compat()
480 struct bkey_s_c k) in bch2_reservation_to_text()
634 void bch2_extent_crc_append(struct bkey_i *k, in bch2_extent_crc_append()
665 unsigned bch2_bkey_nr_ptrs(struct bkey_s_c k) in bch2_bkey_nr_ptrs()
1071 struct bkey_s k, in bch2_extent_ptr_set_cached()
1133 struct bkey_s k) in bch2_extent_normalize_by_opts()
1251 struct bkey_s_c k) in bch2_bkey_ptrs_to_text()
1303 struct bkey_s_c k, in extent_ptr_validate()
[all …]
H A Dextents.h84 static inline void __extent_entry_insert(struct bkey_i *k, in __extent_entry_insert()
228 static inline struct bkey_ptrs_c bch2_bkey_ptrs_c(struct bkey_s_c k) in bch2_bkey_ptrs_c()
276 static inline struct bkey_ptrs bch2_bkey_ptrs(struct bkey_s k) in bch2_bkey_ptrs()
470 static inline bool bkey_is_btree_ptr(const struct bkey *k) in bkey_is_btree_ptr()
481 static inline bool bkey_extent_is_direct_data(const struct bkey *k) in bkey_extent_is_direct_data()
494 static inline bool bkey_extent_is_inline_data(const struct bkey *k) in bkey_extent_is_inline_data()
519 static inline bool bkey_extent_is_data(const struct bkey *k) in bkey_extent_is_data()
529 static inline bool bkey_extent_is_allocation(const struct bkey *k) in bkey_extent_is_allocation()
545 static inline bool bkey_extent_is_unwritten(struct bkey_s_c k) in bkey_extent_is_unwritten()
555 static inline bool bkey_extent_is_reservation(struct bkey_s_c k) in bkey_extent_is_reservation()
[all …]
H A Dbkey_methods.c68 struct bkey_s_c k) in key_type_cookie_to_text()
92 struct bkey_s_c k) in key_type_inline_data_to_text()
169 int __bch2_bkey_validate(struct bch_fs *c, struct bkey_s_c k, in __bch2_bkey_validate()
247 int bch2_bkey_validate(struct bch_fs *c, struct bkey_s_c k, in bch2_bkey_validate()
255 struct bkey_s_c k, in bch2_bkey_in_btree_node()
316 struct bkey_s_c k) in bch2_val_to_text()
325 struct bkey_s_c k) in bch2_bkey_val_to_text()
335 void bch2_bkey_swab_val(struct bkey_s k) in bch2_bkey_swab_val()
343 bool bch2_bkey_normalize(struct bch_fs *c, struct bkey_s k) in bch2_bkey_normalize()
383 struct bkey_packed *k, in bch2_bkey_renumber()
[all …]
H A Dbkey_types.h15 static inline struct bkey_i *bkey_next(struct bkey_i *k) in bkey_next()
22 static inline size_t bkey_val_bytes(const struct bkey *k) in bkey_val_bytes()
27 static inline void set_bkey_val_u64s(struct bkey *k, unsigned val_u64s) in set_bkey_val_u64s()
35 static inline void set_bkey_val_bytes(struct bkey *k, unsigned bytes) in set_bkey_val_bytes()
49 const struct bkey *k; member
57 struct bkey *k; member
70 static inline struct bkey_s bkey_to_s(struct bkey *k) in bkey_to_s()
75 static inline struct bkey_s_c bkey_to_s_c(const struct bkey *k) in bkey_to_s_c()
80 static inline struct bkey_s bkey_i_to_s(struct bkey_i *k) in bkey_i_to_s()
85 static inline struct bkey_s_c bkey_i_to_s_c(const struct bkey_i *k) in bkey_i_to_s_c()
H A Dinode.c619 struct bkey_s_c k; in bch2_bkey_get_iter_snapshot_parent() local
637 struct bkey_s_c k; in bch2_inode_get_iter_snapshot_parent() local
654 struct bkey_s_c k; in __bch2_inode_has_child_snapshots() local
671 struct bkey_s k, in update_inode_has_children()
795 struct bkey_s_c k) in bch2_inode_generation_to_text()
942 struct bkey_s_c k; in bch2_inode_create() local
993 struct bkey_s_c k; in bch2_inode_delete_keys() local
1047 struct bkey_s_c k; in bch2_inode_rm() local
1249 struct bkey_s_c k; in __bch2_inode_rm_snapshot() local
1314 struct bkey_s_c k; in delete_ancestor_snapshot_inodes() local
[all …]
H A Drebalance.c47 struct bkey_s_c k, in bch2_bkey_ptrs_need_compress()
94 struct bkey_s_c k) in bch2_bkey_ptrs_need_rebalance()
138 struct bkey_s_c k) in bch2_bkey_rebalance_needs_update()
159 struct bkey_s k = bkey_i_to_s(_k); in bch2_bkey_set_needs_rebalance() local
181 struct bkey_s_c k) in bch2_get_update_rebalance_opts()
228 struct bkey_s_c k; in bch2_set_rebalance_needs_scan_trans() local
277 struct bkey_s_c k; in bch2_clear_rebalance_needs_scan() local
310 struct bkey_s_c k) in bch2_bkey_clear_needs_rebalance()
408 struct bkey_s_c k; in do_rebalance_extent() local
451 struct bkey_s_c k, in rebalance_pred()
[all …]
H A Dbset.c60 struct bkey_s_c k; in bch2_dump_bset() local
137 struct bkey_packed *k; in bch2_btree_node_count_keys() local
160 const struct bkey_packed *k, *n; in bch2_btree_node_iter_next_check() local
197 struct bkey_packed *k, *p; in bch2_btree_node_iter_verify() local
314 struct bpos k; member
679 struct bkey_packed *k; in __build_rw_aux_tree() local
859 struct bkey_packed *k, in bch2_bkey_prev_filter()
900 struct bkey_packed *k = start; in rw_aux_tree_insert_entry() local
1099 struct bkey_packed *k; in bset_search_tree() local
1243 struct bkey_packed *k; in btree_node_iter_init_pack_failed() local
[all …]
H A Dbtree_update.c33 struct bkey_s_c k, in extent_front_merge()
70 struct bkey_s_c k) in extent_back_merge()
97 struct bkey_s_c k; in need_whiteout_for_snapshot() local
291 struct bkey_s_c k; in bch2_trans_update_extent() local
352 struct bkey k; in flush_new_cached_update() local
554 struct bkey_i *k) in bch2_btree_insert_clone_trans()
627 enum btree_id btree, struct bkey_i *k, in bch2_btree_insert_nonextent()
678 struct bkey_i *k = bch2_trans_kmalloc(trans, sizeof(*k)); in bch2_btree_delete_at() local
712 struct bkey_s_c k; in bch2_btree_delete_range_trans() local
820 struct bkey_i k; in bch2_btree_bit_mod_buffered() local
[all …]
H A Dbkey.h227 static inline struct bkey_packed *bkey_to_packed(struct bkey_i *k) in bkey_to_packed()
296 static inline u64 bkey_start_offset(const struct bkey *k) in bkey_start_offset()
301 static inline struct bpos bkey_start_pos(const struct bkey *k) in bkey_start_pos()
313 const struct bkey_packed *k) in bkeyp_key_u64s()
319 const struct bkey_packed *k) in bkeyp_u64s_valid()
325 const struct bkey_packed *k) in bkeyp_key_bytes()
331 const struct bkey_packed *k) in bkeyp_val_u64s()
337 const struct bkey_packed *k) in bkeyp_val_bytes()
343 struct bkey_packed *k, unsigned val_u64s) in set_bkeyp_val_u64s()
464 const struct bkey_packed *k, in bkey_disassemble()
[all …]
H A Dreflink.c18 static inline bool bkey_extent_is_reflink_data(const struct bkey *k) in bkey_extent_is_reflink_data()
29 static inline unsigned bkey_type_to_indirect(const struct bkey *k) in bkey_type_to_indirect()
43 int bch2_reflink_p_validate(struct bch_fs *c, struct bkey_s_c k, in bch2_reflink_p_validate()
58 struct bkey_s_c k) in bch2_reflink_p_to_text()
91 int bch2_reflink_v_validate(struct bch_fs *c, struct bkey_s_c k, in bch2_reflink_v_validate()
107 struct bkey_s_c k) in bch2_reflink_v_to_text()
137 struct bch_fs *c, struct bkey_s_c k) in bch2_indirect_inline_data_to_text()
404 enum btree_id btree_id, unsigned level, struct bkey_s_c k, in __trigger_reflink_p()
499 struct bkey_s_c k; in bch2_make_extent_indirect() local
575 struct bkey_s_c k; in get_next_src() local
[all …]
H A Dalloc_background.c88 struct bkey_s_c k) in bch2_alloc_unpack_v1()
102 struct bkey_s_c k) in bch2_alloc_unpack_v2()
135 struct bkey_s_c k) in bch2_alloc_unpack_v3()
747 struct bkey_s_c k; in bch2_bucket_gen_update() local
1116 struct bkey_s_c k; in bch2_get_key_or_real_bucket_hole() local
1154 struct bkey_s_c k; in bch2_check_alloc_key() local
1247 struct bkey_s_c k; in bch2_check_alloc_hole_freespace() local
1300 struct bkey_s_c k; in bch2_check_alloc_hole_bucket_gens() local
1560 struct bkey_s_c k; in bch2_check_alloc_info() local
1832 struct bkey_s_c k; in bch2_discard_one_bucket() local
[all …]
H A Ddata_update.c32 static void bkey_put_dev_refs(struct bch_fs *c, struct bkey_s_c k) in bkey_put_dev_refs()
40 static bool bkey_get_dev_refs(struct bch_fs *c, struct bkey_s_c k) in bkey_get_dev_refs()
57 static void bkey_nocow_unlock(struct bch_fs *c, struct bkey_s_c k) in bkey_nocow_unlock()
69 static bool bkey_nocow_lock(struct bch_fs *c, struct moving_context *ctxt, struct bkey_s_c k) in bkey_nocow_lock()
203 struct bkey_s_c k; in __bch2_data_update_index_update() local
464 struct bkey_s_c k = bkey_i_to_s_c(update->k.k); in bch2_data_update_exit() local
485 struct bkey_s_c k; in bch2_update_unwritten_extent() local
617 struct bkey_s_c k, in bch2_extent_drop_ptrs()
739 struct bkey_s_c k) in bch2_data_update_init()
914 void bch2_data_update_opts_normalize(struct bkey_s_c k, struct data_update_opts *opts) in bch2_data_update_opts_normalize()
H A Dtests.c36 struct bkey_i_cookie k; in test_delete() local
77 struct bkey_i_cookie k; in test_delete_written() local
349 struct bkey_s_c k; in test_peek_end() local
371 struct bkey_s_c k; in test_peek_end_extents() local
394 struct bkey_i_cookie k; in insert_test_extent() local
448 struct bkey_i_cookie k; in insert_test_overlapping_extent() local
482 struct bkey_s_c k; in test_snapshot_filter() local
546 struct bkey_i_cookie k; in rand_insert() local
601 struct bkey_s_c k; in rand_lookup() local
627 struct bkey_s_c k; in rand_mixed_trans() local
[all …]
/linux-6.15/lib/
H A Dklist.c84 void klist_init(struct klist *k, void (*get)(struct klist_node *), in klist_init()
94 static void add_head(struct klist *k, struct klist_node *n) in add_head()
101 static void add_tail(struct klist *k, struct klist_node *n) in add_tail()
108 static void klist_node_init(struct klist *k, struct klist_node *n) in klist_node_init()
122 void klist_add_head(struct klist_node *n, struct klist *k) in klist_add_head()
134 void klist_add_tail(struct klist_node *n, struct klist *k) in klist_add_tail()
148 struct klist *k = knode_klist(pos); in klist_add_behind() local
164 struct klist *k = knode_klist(pos); in klist_add_before() local
211 struct klist *k = knode_klist(n); in klist_put() local
280 void klist_iter_init_node(struct klist *k, struct klist_iter *i, in klist_iter_init_node()
[all …]
H A Dbitmap.c40 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_equal() local
58 unsigned int k, lim = bits / BITS_PER_LONG; in __bitmap_or_equal() local
75 unsigned int k, lim = BITS_TO_LONGS(bits); in __bitmap_complement() local
95 unsigned k, lim = BITS_TO_LONGS(nbits); in __bitmap_shift_right() local
140 int k; in __bitmap_shift_left() local
232 unsigned int k; in __bitmap_and() local
248 unsigned int k; in __bitmap_or() local
259 unsigned int k; in __bitmap_xor() local
270 unsigned int k; in __bitmap_andnot() local
287 unsigned int k; in __bitmap_replace() local
[all …]
/linux-6.15/drivers/md/bcache/
H A Dextents.c48 static bool __ptr_invalid(struct cache_set *c, const struct bkey *k) in __ptr_invalid()
69 static const char *bch_ptr_status(struct cache_set *c, const struct bkey *k) in bch_ptr_status()
98 void bch_extent_to_text(char *buf, size_t size, const struct bkey *k) in bch_extent_to_text()
127 static void bch_bkey_dump(struct btree_keys *keys, const struct bkey *k) in bch_bkey_dump()
150 bool __bch_btree_ptr_invalid(struct cache_set *c, const struct bkey *k) in __bch_btree_ptr_invalid()
174 static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k) in btree_ptr_bad_expensive()
206 static bool bch_btree_ptr_bad(struct btree_keys *bk, const struct bkey *k) in bch_btree_ptr_bad()
320 static void bch_subtract_dirty(struct bkey *k, in bch_subtract_dirty()
344 struct bkey *k = bch_btree_iter_next(iter); in bch_extent_insert_fixup() local
487 bool __bch_extent_invalid(struct cache_set *c, const struct bkey *k) in __bch_extent_invalid()
[all …]
H A Dbset.h245 static inline bool bkey_written(struct btree_keys *b, struct bkey *k) in bkey_written()
262 #define __set_bytes(i, k) (sizeof(*(i)) + (k) * sizeof(uint64_t)) argument
265 #define __set_blocks(i, k, block_bytes) \ argument
317 struct bkey *k, *end; member
355 #define for_each_key_filter(b, k, iter, filter) \ argument
359 #define for_each_key(b, k, iter) \ argument
410 static inline void bkey_init(struct bkey *k) in bkey_init()
428 static inline bool bch_cut_front(const struct bkey *where, struct bkey *k) in bch_cut_front()
434 static inline bool bch_cut_back(const struct bkey *where, struct bkey *k) in bch_cut_back()
472 size_t size, const struct bkey *k) in bch_bkey_to_text()
[all …]
H A Dbtree.c1229 struct bkey *k) in __bch_btree_mark_key()
1311 struct bkey *k; in btree_gc_mark_node() local
1370 struct bkey *k; in btree_gc_coalesce() local
1574 struct bkey *k; in btree_gc_count_keys() local
1617 struct bkey *k; in btree_gc_recurse() local
1770 uint64_t *k; in bch_btree_gc_finish() local
1966 struct bkey *k, *p; in bch_btree_check_thread() local
2520 struct bkey *k; in bch_btree_insert() local
2565 struct bkey *k; in bch_btree_map_nodes_recurse() local
2599 struct bkey *k; in bch_btree_map_keys_recurse() local
[all …]
H A Dbset.c23 struct bkey *k, *next; in bch_dump_bset() local
58 struct bkey *k; in __bch_count_data() local
71 struct bkey *k, *p = NULL; in __bch_check_keys() local
117 struct bkey *k = iter->heap.data->k, *next = bkey_next(k); in bch_btree_iter_next_check() local
165 struct bkey *k = l->keys; in bch_keylist_pop() local
201 bool __bch_cut_front(const struct bkey *where, struct bkey *k) in __bch_cut_front()
221 bool __bch_cut_back(const struct bkey *where, struct bkey *k) in __bch_cut_back()
543 struct bkey *k) in bkey_to_cacheline_offset()
697 struct bkey *prev = NULL, *k = t->data->start; in bch_bset_build_written_tree() local
789 struct bkey *k) in bch_bset_fix_lookup_table()
[all …]
/linux-6.15/crypto/
H A Daes_generic.c1147 #define f_rn(bo, bi, n, k) do { \ argument
1154 #define f_nround(bo, bi, k) do {\ argument
1162 #define f_rl(bo, bi, n, k) do { \ argument
1169 #define f_lround(bo, bi, k) do {\ argument
1217 #define i_rn(bo, bi, n, k) do { \ argument
1224 #define i_nround(bo, bi, k) do {\ argument
1232 #define i_rl(bo, bi, n, k) do { \ argument
1239 #define i_lround(bo, bi, k) do {\ argument
/linux-6.15/tools/testing/selftests/bpf/prog_tests/
H A Dhashmap.c14 static size_t hash_fn(long k, void *ctx) in hash_fn()
56 long oldk, k = i; in test_hashmap_generic() local
93 long k = entry->key; in test_hashmap_generic() local
106 long oldk, k = i; in test_hashmap_generic() local
141 long k = entry->key; in test_hashmap_generic() local
164 long oldk, k; in test_hashmap_generic() local
198 long oldk, k; in test_hashmap_generic() local
334 static size_t collision_hash_fn(long k, void *ctx) in collision_hash_fn()
416 long k = 0; in test_hashmap_empty() local
/linux-6.15/drivers/gpu/drm/amd/display/dc/dml/calcs/
H A Ddcn_calc_auto.c42 int k; in scaler_settings_calculation() local
125 int k; in mode_support_and_system_configuration() local
1020 int k; in display_pipe_configuration() local
1178 int k; in dispclkdppclkdcfclk_deep_sleep_prefetch_parameters_watermarks_and_performance_calculation() local
/linux-6.15/drivers/gpu/drm/amd/display/dc/dml2/
H A Ddisplay_mode_core.c2698 for (dml_uint_t k = 0; k < num_active_planes; ++k) { in PixelClockAdjustmentForProgressiveToInterlaceUnit() local
3138 for (dml_uint_t k = 0; k < NumberOfActiveSurfaces; ++k) { in CalculateDCFCLKDeepSleep() local
3169 for (dml_uint_t k = 0; k < NumberOfActiveSurfaces; ++k) { in CalculateDCFCLKDeepSleep() local
3182 for (dml_uint_t k = 0; k < NumberOfActiveSurfaces; ++k) { in CalculateDCFCLKDeepSleep() local
3360 for (dml_uint_t k = 0; k < NumberOfActiveSurfaces; ++k) { in CalculatePixelDeliveryTimes() local
3395 for (dml_uint_t k = 0; k < NumberOfActiveSurfaces; ++k) { in CalculatePixelDeliveryTimes() local
6221 dml_uint_t k) in set_calculate_prefetch_schedule_params()
6276 dml_uint_t j, k; in dml_prefetch_check() local
6722 dml_uint_t j, k, m; in dml_core_mode_support() local
8302 dml_uint_t j = 0, k = 0; in dml_core_mode_programming() local
[all …]
/linux-6.15/arch/sparc/kernel/
H A Dtermios.c33 int user_termios_to_kernel_termios(struct ktermios *k, in user_termios_to_kernel_termios()
56 struct ktermios *k) in kernel_termios_to_user_termios()
77 int user_termios_to_kernel_termios_1(struct ktermios *k, in user_termios_to_kernel_termios_1()
98 struct ktermios *k) in kernel_termios_to_user_termios_1()
/linux-6.15/tools/lib/
H A Dbitmap.c10 unsigned int k, w = 0, lim = bits/BITS_PER_LONG; in __bitmap_weight() local
24 int k; in __bitmap_or() local
63 unsigned int k; in __bitmap_and() local
78 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_equal() local
93 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_intersects() local

12345678910>>...44