Home
last modified time | relevance | path

Searched refs:b (Results 1 – 25 of 4212) sorted by relevance

12345678910>>...169

/linux/arch/arm64/crypto/
H A Dsha3-ce-core.S15 .irp b,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31
16 .set .Lv\b\().2d, \b
17 .set .Lv\b\().16b, \b
59 ld1 {v25.8b-v28.8b}, [x1], #32
60 ld1 {v29.8b-v31.8b}, [x1], #24
61 eor v0.8b, v0.8b, v25.8b
62 eor v1.8b, v1.8b, v26.8b
63 eor v2.8b, v2.8b, v27.8b
64 eor v3.8b, v3.8b, v28.8b
65 eor v4.8b, v4.8b, v29.8b
[all …]
H A Daes-neon.S45 movi v12.16b, #0x1b
49 ld1 {v16.16b-v19.16b}, [\temp], #64
50 ld1 {v20.16b-v23.16b}, [\temp], #64
51 ld1 {v24.16b-v27.16b}, [\temp], #64
52 ld1 {v28.16b-v31.16b}, [\temp]
71 sub v9.16b, \in\().16b, v15.16b
72 tbl \in\().16b, {v16.16b-v19.16b}, \in\().16b
73 sub v10.16b, v9.16b, v15.16b
74 tbx \in\().16b, {v20.16b-v23.16b}, v9.16b
75 sub v11.16b, v10.16b, v15.16b
[all …]
H A Daes-neonbs-core.S192 in_bs_ch \b0\().16b, \b1\().16b, \b2\().16b, \b3\().16b, \
193 \b4\().16b, \b5\().16b, \b6\().16b, \b7\().16b
194 inv_gf256 \b6\().16b, \b5\().16b, \b0\().16b, \b3\().16b, \
195 \b7\().16b, \b1\().16b, \b4\().16b, \b2\().16b, \
196 \t0\().16b, \t1\().16b, \t2\().16b, \t3\().16b, \
197 \s0\().16b, \s1\().16b, \s2\().16b, \s3\().16b
198 out_bs_ch \b7\().16b, \b1\().16b, \b4\().16b, \b2\().16b, \
199 \b6\().16b, \b5\().16b, \b0\().16b, \b3\().16b
204 inv_in_bs_ch \b0\().16b, \b1\().16b, \b2\().16b, \b3\().16b, \
205 \b4\().16b, \b5\().16b, \b6\().16b, \b7\().16b
[all …]
H A Dsm4-ce-core.S17 .irp b, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, \
19 .set .Lv\b\().4s, \b
51 ld1 {v0.16b}, [x0];
52 rev32 v0.16b, v0.16b;
53 ld1 {v1.16b}, [x3];
55 ld1 {v24.16b-v27.16b}, [x4], #64;
56 ld1 {v28.16b-v31.16b}, [x4];
59 eor v0.16b, v0.16b, v1.16b;
71 ld1 {v24.16b}, [x5]
73 st1 {v0.16b-v3.16b}, [x1], #64;
[all …]
H A Dghash-ce-core.S72 ext t3.8b, \ad\().8b, \ad\().8b, #1 // A1
73 ext t5.8b, \ad\().8b, \ad\().8b, #2 // A2
74 ext t7.8b, \ad\().8b, \ad\().8b, #3 // A3
80 tbl t3.16b, {\ad\().16b}, perm1.16b // A1
81 tbl t5.16b, {\ad\().16b}, perm2.16b // A2
82 tbl t7.16b, {\ad\().16b}, perm3.16b // A3
88 __pmull_p8_tail \rq, \ad\().8b, SHASH.8b, 8b,, sh1, sh2, sh3, sh4
92 __pmull_p8_tail \rq, \ad\().8b, SHASH2.8b, 8b,, ss1, ss2, ss3, ss4
96 __pmull_p8_tail \rq, \ad\().16b, SHASH.16b, 16b, 2, sh1, sh2, sh3, sh4
109 eor t3.16b, t3.16b, t4.16b // L = E + F
[all …]
H A Dsm4-ce-gcm-core.S18 .irp b, 0, 1, 2, 3, 24, 25, 26, 27, 28, 29, 30, 31
19 .set .Lv\b\().4s, \b
40 ext T0.16b, m1.16b, m1.16b, #8; \
45 eor T0.16b, T0.16b, T1.16b; \
46 ext T1.16b, RZERO.16b, T0.16b, #8; \
47 ext T0.16b, T0.16b, RZERO.16b, #8; \
48 eor r0.16b, r0.16b, T1.16b; \
49 eor r1.16b, r1.16b, T0.16b;
55 ext T0.16b, m1.16b, m1.16b, #8; \
56 ext T2.16b, m3.16b, m3.16b, #8; \
[all …]
H A Dcrct10dif-ce-core.S116 movi perm4.8b, #8
118 eor perm1.16b, perm1.16b, perm4.16b
128 tbl bd1.16b, {\bd\().16b}, perm1.16b
129 tbl bd2.16b, {\bd\().16b}, perm2.16b
130 tbl bd3.16b, {\bd\().16b}, perm3.16b
131 tbl bd4.16b, {\bd\().16b}, perm4.16b
136 ext t4.8b, ad.8b, ad.8b, #1 // A1
137 ext t5.8b, ad.8b, ad.8b, #2 // A2
138 ext t6.8b, ad.8b, ad.8b, #3 // A3
140 pmull t4.8h, t4.8b, fold_consts.8b // F = A1*B
[all …]
H A Dsm4-neon-core.S35 ld1 {v16.16b-v19.16b}, [x5], #64; \
36 ld1 {v20.16b-v23.16b}, [x5], #64; \
37 ld1 {v24.16b-v27.16b}, [x5], #64; \
38 ld1 {v28.16b-v31.16b}, [x5];
99 eor RTMP1.16b, s2.16b, s3.16b; \
100 eor RX0.16b, RX0.16b, s1.16b; \
101 eor RX0.16b, RX0.16b, RTMP1.16b; \
104 movi RTMP3.16b, #64; /* sizeof(sbox) / 4 */ \
105 tbl RTMP0.16b, {v16.16b-v19.16b}, RX0.16b; \
106 sub RX0.16b, RX0.16b, RTMP3.16b; \
[all …]
H A Daes-modes.S62 ld1 {v0.16b-v3.16b}, [x1], #64 /* get 4 pt blocks */
64 ST5( ld1 {v4.16b}, [x1], #16 )
66 st1 {v0.16b-v3.16b}, [x0], #64
67 ST5( st1 {v4.16b}, [x0], #16 )
68 b .LecbencloopNx
73 ld1 {v0.16b}, [x1], #16 /* get next pt block */
75 st1 {v0.16b}, [x0], #16
92 ld1 {v0.16b-v3.16b}, [x1], #64 /* get 4 ct blocks */
94 ST5( ld1 {v4.16b}, [x1], #16 )
96 st1 {v0.16b-v3.16b}, [x0], #64
[all …]
H A Dsm4-ce-ccm-core.S17 .irp b, 0, 1, 8, 9, 10, 11, 12, 13, 14, 15, 16, 24, 25, 26, 27, 28, 29, 30, 31
18 .set .Lv\b\().4s, \b
35 rev64 vctr.16b, vctr.16b; \
49 ld1 {RMAC.16b}, [x1]
57 ld1 {v0.16b-v3.16b}, [x2], #64
60 eor RMAC.16b, RMAC.16b, v0.16b
62 eor RMAC.16b, RMAC.16b, v1.16b
64 eor RMAC.16b, RMAC.16b, v2.16b
66 eor RMAC.16b, RMAC.16b, v3.16b
69 b .Lcbcmac_loop_4x
[all …]
H A Dpolyval-ce-core.S96 ext v25.16b, X.16b, X.16b, #8
97 ext v26.16b, Y.16b, Y.16b, #8
98 eor v25.16b, v25.16b, X.16b
99 eor v26.16b, v26.16b, Y.16b
103 eor HI.16b, HI.16b, v28.16b
104 eor LO.16b, LO.16b, v29.16b
105 eor MI.16b, MI.16b, v27.16b
117 ext v25.16b, X.16b, X.16b, #8
118 ext v26.16b, Y.16b, Y.16b, #8
119 eor v25.16b, v25.16b, X.16b
[all …]
H A Dchacha-neon-core.S47 eor v3.16b, v3.16b, v0.16b
52 eor v4.16b, v1.16b, v2.16b
58 eor v3.16b, v3.16b, v0.16b
59 tbl v3.16b, {v3.16b}, v12.16b
63 eor v4.16b, v1.16b, v2.16b
68 ext v1.16b, v1.16b, v1.16b, #4
70 ext v2.16b, v2.16b, v2.16b, #8
72 ext v3.16b, v3.16b, v3.16b, #12
76 eor v3.16b, v3.16b, v0.16b
81 eor v4.16b, v1.16b, v2.16b
[all …]
H A Daes-ce-core.S13 ld1 {v0.16b}, [x2]
18 mov v3.16b, v1.16b
19 b 2f
20 0: mov v2.16b, v1.16b
22 1: aese v0.16b, v2.16b
23 aesmc v0.16b, v0.16b
25 aese v0.16b, v3.16b
26 aesmc v0.16b, v0.16b
29 aese v0.16b, v1.16b
30 aesmc v0.16b, v0.16b
[all …]
H A Daes-ce-ccm-core.S27 aese \va\().16b, \vk\().16b
28 aesmc \va\().16b, \va\().16b
29 aese \vb\().16b, \vk\().16b
30 aesmc \vb\().16b, \vb\().16b
43 aese \va\().16b, v4.16b
44 aese \vb\().16b, v4.16b
50 ld1 {v0.16b}, [x5] /* load mac */
55 ld1 {v1.8b}, [x6] /* load upper ctr */
65 ld1 {v2.16b}, [x1], #16 /* load next input block */
67 eor v2.16b, v2.16b, v5.16b /* final round enc+mac */
[all …]
/linux/arch/x86/lib/
H A Dusercopy_32.c45 _ASM_EXTABLE_TYPE_REG(0b, 2b, EX_TYPE_UCOPY_LEN4, %2) \
46 _ASM_EXTABLE_UA(1b, 2b) \
147 _ASM_EXTABLE_UA(1b, 100b) in __copy_user_intel()
148 _ASM_EXTABLE_UA(2b, 100b) in __copy_user_intel()
149 _ASM_EXTABLE_UA(3b, 100b) in __copy_user_intel()
150 _ASM_EXTABLE_UA(4b, 100b) in __copy_user_intel()
151 _ASM_EXTABLE_UA(5b, 100b) in __copy_user_intel()
152 _ASM_EXTABLE_UA(6b, 100b) in __copy_user_intel()
153 _ASM_EXTABLE_UA(7b, 100b) in __copy_user_intel()
154 _ASM_EXTABLE_UA(8b, 100b) in __copy_user_intel()
[all …]
/linux/drivers/iommu/
H A Dmsm_iommu_hw-8xxx.h20 #define SET_GLOBAL_REG_N(b, n, r, v) SET_GLOBAL_REG(b, ((r) + (n << 2)), (v)) argument
21 #define GET_GLOBAL_REG_N(b, n, r) GET_GLOBAL_REG(b, ((r) + (n << 2))) argument
24 #define GET_GLOBAL_FIELD(b, r, F) GET_FIELD(((b) + (r)), F##_MASK, F##_SHIFT) argument
25 #define GET_CONTEXT_FIELD(b, c, r, F) \ argument
26 GET_FIELD(((b) + (r) + ((c) << CTX_SHIFT)), F##_MASK, F##_SHIFT)
28 #define SET_GLOBAL_FIELD(b, r, F, v) \ argument
29 SET_FIELD(((b) + (r)), F##_MASK, F##_SHIFT, (v))
30 #define SET_CONTEXT_FIELD(b, c, r, F, v) \ argument
31 SET_FIELD(((b) + (r) + ((c) << CTX_SHIFT)), F##_MASK, F##_SHIFT, (v))
84 #define SET_M2VCBR_N(b, N, v) SET_GLOBAL_REG_N(M2VCBR_N, N, (b), (v)) argument
[all …]
/linux/fs/bcachefs/
H A Dbtree_cache.c36 if (!c->btree_roots_known[0].b) in bch2_recalc_btree_reserve()
42 if (r->b)
43 reserve += min_t(unsigned, 1, r->b->c.level) * 8; in btree_cache_can_free()
54 static void btree_node_to_freedlist(struct btree_cache *bc, struct btree *b) in btree_node_to_freedlist()
56 if (b->c.lock.readers) in btree_node_data_free() argument
57 list_move(&b->list, &bc->freed_pcpu); in btree_node_data_free()
59 list_move(&b->list, &bc->freed_nonpcpu); in btree_node_data_free()
62 static void btree_node_data_free(struct bch_fs *c, struct btree *b) in btree_node_data_free()
66 EBUG_ON(btree_node_write_in_flight(b)); in btree_node_data_free()
68 clear_btree_node_just_written(b); in btree_node_data_free()
48 btree_node_to_freedlist(struct btree_cache * bc,struct btree * b) btree_node_to_freedlist() argument
81 const struct btree *b = obj; bch2_btree_cache_cmp_fn() local
94 btree_node_data_alloc(struct bch_fs * c,struct btree * b,gfp_t gfp) btree_node_data_alloc() argument
121 struct btree *b; __btree_node_mem_alloc() local
137 struct btree *b; __bch2_btree_node_mem_alloc() local
157 bch2_btree_node_hash_remove(struct btree_cache * bc,struct btree * b) bch2_btree_node_hash_remove() argument
167 __bch2_btree_node_hash_insert(struct btree_cache * bc,struct btree * b) __bch2_btree_node_hash_insert() argument
176 bch2_btree_node_hash_insert(struct btree_cache * bc,struct btree * b,unsigned level,enum btree_id id) bch2_btree_node_hash_insert() argument
206 __btree_node_reclaim(struct bch_fs * c,struct btree * b,bool flush) __btree_node_reclaim() argument
289 btree_node_reclaim(struct bch_fs * c,struct btree * b) btree_node_reclaim() argument
294 btree_node_write_and_reclaim(struct bch_fs * c,struct btree * b) btree_node_write_and_reclaim() argument
304 struct btree *b, *t; bch2_btree_cache_scan() local
412 struct btree *b; bch2_fs_btree_cache_exit() local
564 struct btree *b; btree_node_cannibalize() local
591 struct btree *b, *b2; bch2_btree_node_mem_alloc() local
711 struct btree *b; bch2_btree_node_fill() local
802 btree_bad_header(struct bch_fs * c,struct btree * b) btree_bad_header() argument
830 btree_check_header(struct bch_fs * c,struct btree * b) btree_check_header() argument
848 struct btree *b; __bch2_btree_node_get() local
968 struct btree *b; bch2_btree_node_get() local
1045 struct btree *b; bch2_btree_node_get_noiter() local
1133 struct btree *b = btree_cache_find(bc, k); bch2_btree_node_prefetch() local
1148 struct btree *b; bch2_btree_node_evict() local
1192 bch2_btree_pos_to_text(struct printbuf * out,struct bch_fs * c,const struct btree * b) bch2_btree_pos_to_text() argument
1201 bch2_btree_node_to_text(struct printbuf * out,struct bch_fs * c,const struct btree * b) bch2_btree_node_to_text() argument
[all...]
H A Dbset.c34 struct bset_tree *bch2_bkey_to_bset(struct btree *b, struct bkey_packed *k) in bch2_bkey_to_bset() argument
36 return bch2_bkey_to_bset_inlined(b, k); in bch2_bkey_to_bset()
55 void bch2_dump_bset(struct bch_fs *c, struct btree *b, in bch2_dump_bset() argument
77 k = bkey_disassemble(b, _k, &uk); in bch2_dump_bset()
90 n = bkey_unpack_key(b, _n); in bch2_dump_bset()
104 void bch2_dump_btree_node(struct bch_fs *c, struct btree *b) in bch2_dump_btree_node() argument
107 for_each_bset(b, t) in bch2_dump_btree_node()
108 bch2_dump_bset(c, b, bset(b, t), t - b in bch2_dump_btree_node()
114 bch2_dump_btree_node_iter(struct btree * b,struct btree_node_iter * iter) bch2_dump_btree_node_iter() argument
137 bch2_btree_node_count_keys(struct btree * b) bch2_btree_node_count_keys() argument
152 __bch2_verify_btree_nr_keys(struct btree * b) __bch2_verify_btree_nr_keys() argument
160 bch2_btree_node_iter_next_check(struct btree_node_iter * _iter,struct btree * b) bch2_btree_node_iter_next_check() argument
197 bch2_btree_node_iter_verify(struct btree_node_iter * iter,struct btree * b) bch2_btree_node_iter_verify() argument
242 bch2_verify_insert_pos(struct btree * b,struct bkey_packed * where,struct bkey_packed * insert,unsigned clobber_u64s) bch2_verify_insert_pos() argument
293 bch2_btree_node_iter_next_check(struct btree_node_iter * iter,struct btree * b) bch2_btree_node_iter_next_check() argument
343 bset_aux_tree_buf_start(const struct btree * b,const struct bset_tree * t) bset_aux_tree_buf_start() argument
351 __aux_tree_base(const struct btree * b,const struct bset_tree * t) __aux_tree_base() argument
357 ro_aux_tree_base(const struct btree * b,const struct bset_tree * t) ro_aux_tree_base() argument
365 ro_aux_tree_prev(const struct btree * b,const struct bset_tree * t) ro_aux_tree_prev() argument
373 bkey_float(const struct btree * b,const struct bset_tree * t,unsigned idx) bkey_float() argument
380 bset_aux_tree_verify(const struct btree * b) bset_aux_tree_verify() argument
399 bch2_btree_keys_init(struct btree * b) bch2_btree_keys_init() argument
434 bset_cacheline(const struct btree * b,const struct bset_tree * t,unsigned cacheline) bset_cacheline() argument
443 cacheline_to_bkey(const struct btree * b,const struct bset_tree * t,unsigned cacheline,unsigned offset) cacheline_to_bkey() argument
451 bkey_to_cacheline(const struct btree * b,const struct bset_tree * t,const struct bkey_packed * k) bkey_to_cacheline() argument
458 __bkey_to_cacheline_offset(const struct btree * b,const struct bset_tree * t,unsigned cacheline,const struct bkey_packed * k) __bkey_to_cacheline_offset() argument
466 bkey_to_cacheline_offset(const struct btree * b,const struct bset_tree * t,unsigned cacheline,const struct bkey_packed * k) bkey_to_cacheline_offset() argument
477 tree_to_bkey(const struct btree * b,const struct bset_tree * t,unsigned j) tree_to_bkey() argument
486 tree_to_prev_bkey(const struct btree * b,const struct bset_tree * t,unsigned j) tree_to_prev_bkey() argument
495 rw_aux_tree(const struct btree * b,const struct bset_tree * t) rw_aux_tree() argument
507 rw_aux_to_bkey(const struct btree * b,struct bset_tree * t,unsigned j) rw_aux_to_bkey() argument
514 rw_aux_tree_set(const struct btree * b,struct bset_tree * t,unsigned j,struct bkey_packed * k) rw_aux_tree_set() argument
525 bch2_bset_verify_rw_aux_tree(struct btree * b,struct bset_tree * t) bch2_bset_verify_rw_aux_tree() argument
561 rw_aux_tree_bsearch(struct btree * b,struct bset_tree * t,unsigned offset) rw_aux_tree_bsearch() argument
615 make_bfloat(struct btree * b,struct bset_tree * t,unsigned j,struct bkey_packed * min_key,struct bkey_packed * max_key) make_bfloat() argument
688 __bset_tree_capacity(const struct btree * b,const struct bset_tree * t) __bset_tree_capacity() argument
695 bset_ro_tree_capacity(const struct btree * b,const struct bset_tree * t) bset_ro_tree_capacity() argument
701 bset_rw_tree_capacity(const struct btree * b,const struct bset_tree * t) bset_rw_tree_capacity() argument
706 __build_rw_aux_tree(struct btree * b,struct bset_tree * t) __build_rw_aux_tree() argument
712 rw_aux_tree(b, t)[0].offset = __build_rw_aux_tree() local
725 __build_ro_aux_tree(struct btree * b,struct bset_tree * t) __build_ro_aux_tree() argument
753 ro_aux_tree_prev(b, t)[j] = prev->u64s; __build_ro_aux_tree() local
781 bset_alloc_tree(struct btree * b,struct bset_tree * t) bset_alloc_tree() argument
797 bch2_bset_build_aux_tree(struct btree * b,struct bset_tree * t,bool writeable) bch2_bset_build_aux_tree() argument
818 bch2_bset_init_first(struct btree * b,struct bset * i) bch2_bset_init_first() argument
832 bch2_bset_init_next(struct btree * b,struct btree_node_entry * bne) bch2_bset_init_next() argument
853 __bkey_prev(struct btree * b,struct bset_tree * t,struct bkey_packed * k) __bkey_prev() argument
891 bch2_bkey_prev_filter(struct btree * b,struct bset_tree * t,struct bkey_packed * k,unsigned min_key_type) bch2_bkey_prev_filter() argument
922 bch2_bset_fix_lookup_table(struct btree * b,struct bset_tree * t,struct bkey_packed * _where,unsigned clobber_u64s,unsigned new_u64s) bch2_bset_fix_lookup_table() argument
966 rw_aux_tree(b, t)[j].offset += shift; bch2_bset_fix_lookup_table() local
1005 bch2_bset_insert(struct btree * b,struct btree_node_iter * iter,struct bkey_packed * where,struct bkey_i * insert,unsigned clobber_u64s) bch2_bset_insert() argument
1047 bch2_bset_delete(struct btree * b,struct bkey_packed * where,unsigned clobber_u64s) bch2_bset_delete() argument
1069 bset_search_write_set(const struct btree * b,struct bset_tree * t,struct bpos * search) bset_search_write_set() argument
1104 bkey_mantissa_bits_dropped(const struct btree * b,const struct bkey_float * f,unsigned idx) bkey_mantissa_bits_dropped() argument
1120 bset_search_tree(const struct btree * b,const struct bset_tree * t,const struct bpos * search,const struct bkey_packed * packed_search) bset_search_tree() argument
1174 __bch2_bset_search(struct btree * b,struct bset_tree * t,struct bpos * search,const struct bkey_packed * lossy_packed_search) __bch2_bset_search() argument
1208 bch2_bset_search_linear(struct btree * b,struct bset_tree * t,struct bpos * search,struct bkey_packed * packed_search,const struct bkey_packed * lossy_packed_search,struct bkey_packed * m) bch2_bset_search_linear() argument
1240 __bch2_btree_node_iter_push(struct btree_node_iter * iter,struct btree * b,const struct bkey_packed * k,const struct bkey_packed * end) __bch2_btree_node_iter_push() argument
1259 bch2_btree_node_iter_push(struct btree_node_iter * iter,struct btree * b,const struct bkey_packed * k,const struct bkey_packed * end) bch2_btree_node_iter_push() argument
1269 btree_node_iter_init_pack_failed(struct btree_node_iter * iter,struct btree * b,struct bpos * search) btree_node_iter_init_pack_failed() argument
1328 bch2_btree_node_iter_init(struct btree_node_iter * iter,struct btree * b,struct bpos * search) bch2_btree_node_iter_init() argument
1375 bch2_btree_node_iter_init_from_start(struct btree_node_iter * iter,struct btree * b) bch2_btree_node_iter_init_from_start() argument
1389 bch2_btree_node_iter_bset_pos(struct btree_node_iter * iter,struct btree * b,struct bset_tree * t) bch2_btree_node_iter_bset_pos() argument
1402 btree_node_iter_sort_two(struct btree_node_iter * iter,struct btree * b,unsigned first) btree_node_iter_sort_two() argument
1415 bch2_btree_node_iter_sort(struct btree_node_iter * iter,struct btree * b) bch2_btree_node_iter_sort() argument
1439 __bch2_btree_node_iter_advance(struct btree_node_iter * iter,struct btree * b) __bch2_btree_node_iter_advance() argument
1466 bch2_btree_node_iter_advance(struct btree_node_iter * iter,struct btree * b) bch2_btree_node_iter_advance() argument
1480 bch2_btree_node_iter_prev_all(struct btree_node_iter * iter,struct btree * b) bch2_btree_node_iter_prev_all() argument
1529 bch2_btree_node_iter_prev(struct btree_node_iter * iter,struct btree * b) bch2_btree_node_iter_prev() argument
1541 bch2_btree_node_iter_peek_unpack(struct btree_node_iter * iter,struct btree * b,struct bkey * u) bch2_btree_node_iter_peek_unpack() argument
1551 bch2_btree_keys_stats(const struct btree * b,struct bset_stats * stats) bch2_btree_keys_stats() argument
1574 bch2_bfloat_to_text(struct printbuf * out,struct btree * b,struct bkey_packed * k) bch2_bfloat_to_text() argument
[all...]
/linux/drivers/md/bcache/
H A Dbtree.c104 #define insert_lock(s, b) ((b)->level <= (s)->lock) argument
107 static inline struct bset *write_block(struct btree *b) in write_block() argument
109 return ((void *) btree_bset_first(b)) + b->written * block_bytes(b->c->cache); in write_block()
112 static void bch_btree_init_next(struct btree *b) in bch_btree_init_next() argument
115 if (b->level && b->keys.nsets) in bch_btree_init_next()
116 bch_btree_sort(&b in bch_btree_init_next()
139 btree_csum_set(struct btree * b,struct bset * i) btree_csum_set() argument
148 bch_btree_node_read_done(struct btree * b) bch_btree_node_read_done() argument
243 bch_btree_node_read(struct btree * b) bch_btree_node_read() argument
281 btree_complete_write(struct btree * b,struct btree_write * w) btree_complete_write() argument
329 struct btree *b = container_of(cl, struct btree, io); btree_node_write_endio() local
338 do_btree_node_write(struct btree * b) do_btree_node_write() argument
403 __bch_btree_node_write(struct btree * b,struct closure * parent) __bch_btree_node_write() argument
434 bch_btree_node_write(struct btree * b,struct closure * parent) bch_btree_node_write() argument
452 bch_btree_node_write_sync(struct btree * b) bch_btree_node_write_sync() argument
467 struct btree *b = container_of(to_delayed_work(w), struct btree, work); btree_node_write_work() local
475 bch_btree_leaf_dirty(struct btree * b,atomic_t * journal_ref) bch_btree_leaf_dirty() argument
524 mca_data_free(struct btree * b) mca_data_free() argument
534 mca_bucket_free(struct btree * b) mca_bucket_free() argument
548 mca_data_alloc(struct btree * b,struct bkey * k,gfp_t gfp) mca_data_alloc() argument
569 const struct btree *b = container_of(_b, struct btree, lock.dep_map); btree_lock_cmp_fn() local
576 const struct btree *b = container_of(map, struct btree, lock.dep_map); btree_lock_print_fn() local
590 struct btree *b = kzalloc(sizeof(struct btree), gfp); mca_bucket_alloc() local
608 mca_reap(struct btree * b,unsigned int min_order,bool flush) mca_reap() argument
671 struct btree *b, *t; bch_mca_scan() local
750 struct btree *b; bch_btree_cache_free() local
857 struct btree *b; mca_find() local
889 struct btree *b; mca_cannibalize() local
927 struct btree *b; mca_alloc() local
1012 struct btree *b; bch_btree_node_get() local
1066 struct btree *b; btree_node_prefetch() local
1081 btree_node_free(struct btree * b) btree_node_free() argument
1126 struct btree *b; __bch_btree_node_alloc() local
1171 btree_node_alloc_replacement(struct btree * b,struct btree_op * op) btree_node_alloc_replacement() argument
1186 make_btree_freeing_key(struct btree * b,struct bkey * k) make_btree_freeing_key() argument
1205 btree_check_reserve(struct btree * b,struct btree_op * op) btree_check_reserve() argument
1280 btree_mark_key(b,k) global() argument
1289 struct bucket *b = PTR_BUCKET(c, k, i); bch_initial_mark_key() local
1307 btree_gc_mark_node(struct btree * b,struct gc_stat * gc) btree_gc_mark_node() argument
1352 struct btree *b; global() member
1361 btree_gc_coalesce(struct btree * b,struct btree_op * op,struct gc_stat * gc,struct gc_merge_info * r) btree_gc_coalesce() argument
1532 btree_gc_rewrite_node(struct btree * b,struct btree_op * op,struct btree * replace) btree_gc_rewrite_node() argument
1570 btree_gc_count_keys(struct btree * b) btree_gc_count_keys() argument
1608 btree_gc_recurse(struct btree * b,struct btree_op * op,struct closure * writes,struct gc_stat * gc) btree_gc_recurse() argument
1699 bch_btree_gc_root(struct btree * b,struct btree_op * op,struct closure * writes,struct gc_stat * gc) bch_btree_gc_root() argument
1737 struct bucket *b; btree_gc_start() local
1761 struct bucket *b; bch_btree_gc_finish() local
1911 bch_btree_check_recurse(struct btree * b,struct btree_op * op) bch_btree_check_recurse() argument
2126 struct bucket *b; bch_initial_gc_finish() local
2161 btree_insert_key(struct btree * b,struct bkey * k,struct bkey * replace_key) btree_insert_key() argument
2180 insert_u64s_remaining(struct btree * b) insert_u64s_remaining() argument
2193 bch_btree_insert_keys(struct btree * b,struct btree_op * op,struct keylist * insert_keys,struct bkey * replace_key) bch_btree_insert_keys() argument
2235 btree_split(struct btree * b,struct btree_op * op,struct keylist * insert_keys,struct bkey * replace_key) btree_split() argument
2369 bch_btree_insert_node(struct btree * b,struct btree_op * op,struct keylist * insert_keys,atomic_t * journal_ref,struct bkey * replace_key) bch_btree_insert_node() argument
2425 bch_btree_insert_check_key(struct btree * b,struct btree_op * op,struct bkey * check_key) bch_btree_insert_check_key() argument
2470 btree_insert_fn(struct btree_op * b_op,struct btree * b) btree_insert_fn() argument
2517 bch_btree_set_root(struct btree * b) bch_btree_set_root() argument
2543 bch_btree_map_nodes_recurse(struct btree * b,struct btree_op * op,struct bkey * from,btree_map_nodes_fn * fn,int flags) bch_btree_map_nodes_recurse() argument
2578 bch_btree_map_keys_recurse(struct btree * b,struct btree_op * op,struct bkey * from,btree_map_keys_fn * fn,int flags) bch_btree_map_keys_recurse() argument
2639 refill_keybuf_fn(struct btree_op * op,struct btree * b,struct bkey * k) refill_keybuf_fn() argument
[all...]
/linux/drivers/gpu/drm/i915/gt/
H A Dintel_breadcrumbs.c19 static bool irq_enable(struct intel_breadcrumbs *b) in irq_enable() argument
21 return intel_engine_irq_enable(b->irq_engine); in irq_enable()
24 static void irq_disable(struct intel_breadcrumbs *b) in irq_disable() argument
26 intel_engine_irq_disable(b->irq_engine); in irq_disable()
29 static void __intel_breadcrumbs_arm_irq(struct intel_breadcrumbs *b) in __intel_breadcrumbs_arm_irq() argument
37 wakeref = intel_gt_pm_get_if_awake(b->irq_engine->gt); in __intel_breadcrumbs_arm_irq()
47 WRITE_ONCE(b->irq_armed, wakeref); in __intel_breadcrumbs_arm_irq()
50 if (!b->irq_enabled++ && b->irq_enable(b)) in __intel_breadcrumbs_arm_irq()
54 intel_breadcrumbs_arm_irq(struct intel_breadcrumbs * b) intel_breadcrumbs_arm_irq() argument
65 __intel_breadcrumbs_disarm_irq(struct intel_breadcrumbs * b) __intel_breadcrumbs_disarm_irq() argument
77 intel_breadcrumbs_disarm_irq(struct intel_breadcrumbs * b) intel_breadcrumbs_disarm_irq() argument
85 add_signaling_context(struct intel_breadcrumbs * b,struct intel_context * ce) add_signaling_context() argument
95 remove_signaling_context(struct intel_breadcrumbs * b,struct intel_context * ce) remove_signaling_context() argument
157 add_retire(struct intel_breadcrumbs * b,struct intel_timeline * tl) add_retire() argument
172 struct intel_breadcrumbs *b = container_of(work, typeof(*b), irq_work); signal_irq_work() local
273 struct intel_breadcrumbs *b; intel_breadcrumbs_create() local
295 intel_breadcrumbs_reset(struct intel_breadcrumbs * b) intel_breadcrumbs_reset() argument
312 __intel_breadcrumbs_park(struct intel_breadcrumbs * b) __intel_breadcrumbs_park() argument
329 struct intel_breadcrumbs *b = container_of(kref, typeof(*b), ref); intel_breadcrumbs_free() local
339 irq_signal_request(struct i915_request * rq,struct intel_breadcrumbs * b) irq_signal_request() argument
351 struct intel_breadcrumbs *b = READ_ONCE(rq->engine)->breadcrumbs; insert_breadcrumb() local
438 struct intel_breadcrumbs *b = READ_ONCE(rq->engine)->breadcrumbs; i915_request_cancel_breadcrumb() local
461 intel_context_remove_breadcrumbs(struct intel_context * ce,struct intel_breadcrumbs * b) intel_context_remove_breadcrumbs() argument
493 print_signals(struct intel_breadcrumbs * b,struct drm_printer * p) print_signals() argument
516 struct intel_breadcrumbs *b; intel_engine_print_breadcrumbs() local
[all...]
/linux/drivers/staging/media/atomisp/pci/hive_isp_css_include/
H A Dmath_support.h32 #define IMPLIES(a, b) (!(a) || (b)) argument
36 #define MAX(a, b) (((a) > (b)) ? (a) : (b)) argument
37 #define MIN(a, b) (((a) < (b)) ? (a) : (b)) argument
39 #define ROUND_DIV(a, b) (((b) != 0) ? ((a) + ((b) >> 1)) / (b) : 0) argument
40 #define CEIL_DIV(a, b) (((b) != 0) ? ((a) + (b) - 1) / (b) : 0) argument
41 #define CEIL_MUL(a, b) (CEIL_DIV(a, b) * (b)) argument
42 #define CEIL_MUL2(a, b) (((a) + (b) - 1) & ~((b) - 1)) argument
43 #define CEIL_SHIFT(a, b) (((a) + (1 << (b)) - 1) >> (b)) argument
44 #define CEIL_SHIFT_MUL(a, b) (CEIL_SHIFT(a, b) << (b)) argument
45 #define ROUND_HALF_DOWN_DIV(a, b) (((b) != 0) ? ((a) + (b / 2) - 1) / (b) : 0) argument
[all …]
/linux/Documentation/driver-api/media/drivers/ccs/
H A Dccs-regs.asc8 # - b bool bit
127 - b horizontal_mirror 0
128 - b vertical_flip 1
141 - b enable 0
142 - b ack 1
159 - b raw8_packing_for_raw16 0
160 - b raw10_packing_for_raw20 1
161 - b raw12_packing_for_raw24 2
166 - b enable 0
187 - b enabled 0
[all …]
/linux/net/ceph/crush/
H A Dcrush.c27 int crush_get_bucket_item_weight(const struct crush_bucket *b, int p) in crush_get_bucket_item_weight() argument
29 if ((__u32)p >= b->size) in crush_get_bucket_item_weight()
32 switch (b->alg) { in crush_get_bucket_item_weight()
34 return ((struct crush_bucket_uniform *)b)->item_weight; in crush_get_bucket_item_weight()
36 return ((struct crush_bucket_list *)b)->item_weights[p]; in crush_get_bucket_item_weight()
38 return ((struct crush_bucket_tree *)b)->node_weights[crush_calc_tree_node(p)]; in crush_get_bucket_item_weight()
40 return ((struct crush_bucket_straw *)b)->item_weights[p]; in crush_get_bucket_item_weight()
42 return ((struct crush_bucket_straw2 *)b)->item_weights[p]; in crush_get_bucket_item_weight()
47 void crush_destroy_bucket_uniform(struct crush_bucket_uniform *b) in crush_destroy_bucket_uniform() argument
49 kfree(b->h.items); in crush_destroy_bucket_uniform()
[all …]
/linux/drivers/misc/
H A Dvmw_balloon.c406 static inline void vmballoon_stats_op_inc(struct vmballoon *b, unsigned int op, in vmballoon_stats_op_inc() argument
410 atomic64_inc(&b->stats->ops[op][type]); in vmballoon_stats_op_inc()
413 static inline void vmballoon_stats_gen_inc(struct vmballoon *b, in vmballoon_stats_gen_inc() argument
417 atomic64_inc(&b->stats->general_stat[stat]); in vmballoon_stats_gen_inc()
420 static inline void vmballoon_stats_gen_add(struct vmballoon *b, in vmballoon_stats_gen_add() argument
425 atomic64_add(val, &b->stats->general_stat[stat]); in vmballoon_stats_gen_add()
428 static inline void vmballoon_stats_page_inc(struct vmballoon *b, in vmballoon_stats_page_inc() argument
433 atomic64_inc(&b->stats->page_stat[stat][size]); in vmballoon_stats_page_inc()
436 static inline void vmballoon_stats_page_add(struct vmballoon *b, in vmballoon_stats_page_add() argument
442 atomic64_add(val, &b->stats->page_stat[stat][size]); in vmballoon_stats_page_add()
[all …]
/linux/arch/x86/xen/
H A Dmulticalls.c58 struct mc_buffer *b = this_cpu_ptr(&mc_buffer); in xen_mc_flush() local
70 trace_xen_mc_flush(b->mcidx, b->argidx, b->cbidx); in xen_mc_flush()
73 memcpy(b->debug, b->entries, in xen_mc_flush()
74 b->mcidx * sizeof(struct multicall_entry)); in xen_mc_flush()
77 switch (b->mcidx) { in xen_mc_flush()
80 BUG_ON(b->argidx != 0); in xen_mc_flush()
86 mc = &b->entries[0]; in xen_mc_flush()
95 if (HYPERVISOR_multicall(b->entries, b->mcidx) != 0) in xen_mc_flush()
97 for (i = 0; i < b->mcidx; i++) in xen_mc_flush()
98 if (b->entries[i].result < 0) in xen_mc_flush()
[all …]

12345678910>>...169