/linux/drivers/clk/samsung/ |
H A D | clk-pll.h | 50 #define PLL_RATE(_fin, _m, _p, _s, _k, _ks) \ argument 51 ((u64)(_fin) * (BIT(_ks) * (_m) + (_k)) / BIT(_ks) / ((_p) << (_s))) 52 #define PLL_VALID_RATE(_fin, _fout, _m, _p, _s, _k, _ks) ((_fout) + \ argument 53 BUILD_BUG_ON_ZERO(PLL_RATE(_fin, _m, _p, _s, _k, _ks) != (_fout))) 64 #define PLL_36XX_RATE(_fin, _rate, _m, _p, _s, _k) \ argument 67 _m, _p, _s, _k, 16), \ 71 .kdiv = (_k), \ 84 #define PLL_4600_RATE(_fin, _rate, _m, _p, _s, _k, _vsel) \ argument 87 _m, _p, _s, _k, 16), \ 91 .kdiv = (_k), \ [all …]
|
/linux/fs/bcachefs/ |
H A D | siphash.h | 75 #define SipHash24_Init(_c, _k) SipHash_Init((_c), (_k)) argument 79 #define SipHash24(_k, _p, _l) SipHash((_k), 2, 4, (_p), (_l)) argument 81 #define SipHash48_Init(_c, _k) SipHash_Init((_c), (_k)) argument 85 #define SipHash48(_k, _p, _l) SipHash((_k), 4, 8, (_p), (_l)) argument
|
H A D | bkey_types.h | 13 #define bkey_p_next(_k) vstruct_next(_k) argument 20 #define bkey_val_u64s(_k) ((_k)->u64s - BKEY_U64s) argument 40 #define bkey_val_end(_k) ((void *) (((u64 *) (_k).v) + bkey_val_u64s((_k).k))) argument 42 #define bkey_deleted(_k) ((_k)->type == KEY_TYPE_deleted) argument 44 #define bkey_whiteout(_k) \ argument 45 ((_k)->type == KEY_TYPE_deleted || (_k)->type == KEY_TYPE_whiteout) 197 static inline struct bkey_i_##name *bkey_##name##_init(struct bkey_i *_k)\ 200 container_of(&_k->k, struct bkey_i_##name, k); \
|
H A D | btree_iter.h | 20 #define bkey_err(_k) __bkey_err((_k).k) argument 750 _end, _flags, _k, _do) \ 752 struct bkey_s_c _k; \ 757 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), \ 759 if (!(_k).k) \ 762 bkey_err(_k) ?: (_do); \ 770 #define for_each_btree_key_continue(_trans, _iter, _flags, _k, _do) \ argument 771 for_each_btree_key_upto_continue(_trans, _iter, SPOS_MAX, _flags, _k, _do) 774 _start, _end, _flags, _k, _do) \ 782 for_each_btree_key_upto_continue(_trans, _iter, _end, _flags, _k, _do);\ [all …]
|
H A D | bset.h | 214 #define bset_tree_for_each_key(_b, _t, _k) \ argument 215 for (_k = btree_bkey_first(_b, _t); \ 216 _k != btree_bkey_last(_b, _t); \ 217 _k = bkey_p_next(_k)) 489 #define btree_keys_account_key_add(_nr, _bset_idx, _k) \ argument 490 btree_keys_account_key(_nr, _bset_idx, _k, 1) 491 #define btree_keys_account_key_drop(_nr, _bset_idx, _k) \ argument 492 btree_keys_account_key(_nr, _bset_idx, _k, -1) 494 #define btree_account_key_add(_b, _k) \ argument 496 bch2_bkey_to_bset(_b, _k) - (_b)->set, _k, 1) [all …]
|
H A D | subvolume.h | 50 _end, _subvolid, _flags, _k, _do) \ 52 struct bkey_s_c _k; \ 57 (_k) = bch2_btree_iter_peek_in_subvolume_upto_type(&(_iter), \ 59 if (!(_k).k) \ 62 bkey_err(_k) ?: (_do); \ 71 _start, _end, _subvolid, _flags, _k, _do) \ 78 _end, _subvolid, _flags, _k, _do); \
|
H A D | extents.h | 320 #define __bkey_ptr_next_decode(_k, _end, _ptr, _entry) \ argument 335 (_ptr).crc = bch2_extent_crc_unpack(_k, \ 350 #define __bkey_for_each_ptr_decode(_k, _start, _end, _ptr, _entry) \ argument 351 for ((_ptr).crc = bch2_extent_crc_unpack(_k, NULL), \ 353 __bkey_ptr_next_decode(_k, _end, _ptr, _entry); \ 356 #define bkey_for_each_ptr_decode(_k, _p, _ptr, _entry) \ argument 357 __bkey_for_each_ptr_decode(_k, (_p).start, (_p).end, \ 360 #define bkey_crc_next(_k, _end, _crc, _iter) \ argument 364 (_crc) = bch2_extent_crc_unpack(_k, \ 372 #define __bkey_for_each_crc(_k, _start, _end, _crc, _iter) \ argument [all …]
|
H A D | keylist.h | 52 #define for_each_keylist_key(_keylist, _k) \ argument 53 for (struct bkey_i *_k = (_keylist)->keys; \ 54 _k != (_keylist)->top; \ 55 _k = bkey_next(_k))
|
H A D | bkey.h | 224 #define bkey_packed(_k) \ argument 225 ({ EBUG_ON((_k)->format > KEY_FORMAT_CURRENT); \ 226 (_k)->format != KEY_FORMAT_CURRENT; }) 228 #define bkey_packed(_k) ((_k)->format != KEY_FORMAT_CURRENT) argument 355 #define bkeyp_val(_format, _k) \ argument 356 ((struct bch_val *) ((u64 *) (_k)->_data + bkeyp_key_u64s(_format, _k)))
|
H A D | btree_update.h | 242 #define bch2_bkey_make_mut_noupdate_typed(_trans, _k, _type) \ argument 243 bkey_i_to_##_type(__bch2_bkey_make_mut_noupdate(_trans, _k, \ 270 #define bch2_bkey_make_mut_typed(_trans, _iter, _k, _flags, _type) \ argument 271 bkey_i_to_##_type(__bch2_bkey_make_mut(_trans, _iter, _k, _flags,\
|
H A D | bset.c | 58 struct bkey_packed *_k, *_n; in bch2_dump_bset() local 66 for (_k = i->start; in bch2_dump_bset() 67 _k < vstruct_last(i); in bch2_dump_bset() 68 _k = _n) { in bch2_dump_bset() 69 _n = bkey_p_next(_k); in bch2_dump_bset() 71 if (!_k->u64s) { in bch2_dump_bset() 73 _k->_data - i->_data); in bch2_dump_bset() 77 k = bkey_disassemble(b, _k, &uk); in bch2_dump_bset() 85 _k->_data - i->_data, buf.buf); in bch2_dump_bset()
|
H A D | debug.c | 446 struct bkey_packed *_k = in bch2_read_bfloat_failed() 454 bch2_bfloat_to_text(&i->buf, l->b, _k); in bch2_read_bfloat_failed()
|
H A D | bcachefs_format.h | 364 #define bkey_bytes(_k) ((_k)->u64s * sizeof(__u64)) argument
|
H A D | extents.c | 1500 int bch2_bkey_set_needs_rebalance(struct bch_fs *c, struct bkey_i *_k, in bch2_bkey_set_needs_rebalance() argument 1503 struct bkey_s k = bkey_i_to_s(_k); in bch2_bkey_set_needs_rebalance()
|
H A D | btree_iter.c | 1810 struct bkey_packed *_k; in bch2_btree_path_peek_slot() local 1820 _k = bch2_btree_node_iter_peek_all(&l->iter, l->b); in bch2_btree_path_peek_slot() 1821 k = _k ? bkey_disassemble(l->b, _k, u) : bkey_s_c_null; in bch2_btree_path_peek_slot()
|
/linux/drivers/clk/sunxi-ng/ |
H A D | ccu_nkm.c | 40 unsigned long _n, _k, _m; in ccu_nkm_find_best_with_parent_adj() local 42 for (_k = nkm->min_k; _k <= nkm->max_k; _k++) { in ccu_nkm_find_best_with_parent_adj() 47 tmp_parent = clk_hw_round_rate(parent_hw, rate * _m / (_n * _k)); in ccu_nkm_find_best_with_parent_adj() 52 tmp_rate = tmp_parent * _n * _k / _m; in ccu_nkm_find_best_with_parent_adj() 59 best_k = _k; in ccu_nkm_find_best_with_parent_adj() 80 unsigned long _n, _k, _m; in ccu_nkm_find_best() local 82 for (_k = nkm->min_k; _k <= nkm->max_k; _k++) { in ccu_nkm_find_best() 90 tmp_rate = parent * _n * _k / _m; in ccu_nkm_find_best() 95 best_k = _k; in ccu_nkm_find_best()
|
H A D | ccu_nk.c | 23 unsigned int _k, _n; in ccu_nk_find_best() local 25 for (_k = nk->min_k; _k <= nk->max_k; _k++) { in ccu_nk_find_best() 27 unsigned long tmp_rate = parent * _n * _k; in ccu_nk_find_best() 34 best_k = _k; in ccu_nk_find_best()
|
H A D | ccu_nkmp.c | 37 unsigned long _n, _k, _m, _p; in ccu_nkmp_find_best() local 39 for (_k = nkmp->min_k; _k <= nkmp->max_k; _k++) { in ccu_nkmp_find_best() 46 _n, _k, in ccu_nkmp_find_best() 55 best_k = _k; in ccu_nkmp_find_best()
|
/linux/arch/mips/include/asm/sn/ |
H A D | klconfig.h | 180 #define PTR_CH_MALLOC_HDR(_k) ((klc_malloc_hdr_t *)\ argument 181 ((unsigned long)_k + (_k->ch_malloc_hdr_off))) 185 #define PTR_CH_CONS_INFO(_k) ((console_t *)\ argument 186 ((unsigned long)_k + (_k->ch_cons_off)))
|
/linux/include/linux/ |
H A D | slab.h | 1028 #define kmem_cache_zalloc(_k, _flags) kmem_cache_alloc(_k, (_flags)|__GFP_ZERO) argument
|
/linux/drivers/clk/imx/ |
H A D | clk.h | 271 #define PLL_1443X_RATE(_rate, _m, _p, _s, _k) \ argument 277 .kdiv = (_k), \
|
/linux/drivers/clk/rockchip/ |
H A D | clk.h | 375 #define RK3588_PLL_RATE(_rate, _p, _m, _s, _k) \ argument 381 .k = _k, \
|
/linux/lib/ |
H A D | bch.c | 964 #define find_poly_roots(_p, _k, _elp, _loc) chien_search(_p, len, _elp, _loc) argument
|