/Linux-v6.1/drivers/block/paride/ |
D | on26.c | 40 #define P1 w2(5);w2(0xd);w2(5);w2(0xd);w2(5);w2(4); 41 #define P2 w2(5);w2(7);w2(5);w2(4); 67 case 4: w3(1); w3(1); w2(5); w4(r); w2(4); in on26_read_regr() 91 case 4: w3(1); w3(1); w2(5); w4(r); w2(4); in on26_write_regr() 93 w2(5); w4(val); w2(4); in on26_write_regr() 94 w2(5); w4(val); w2(4); in on26_write_regr() 100 w0(0x87);w0(0x78);w0(x);w2(4);w2(5);w2(4);w0(0xff); 136 pi->delay = 5; in on26_test_port() 146 w0(0x20);w2(4);w2(5); in on26_test_port() 182 return 5; in on26_test_port() [all …]
|
D | dstr.c | 37 #define P1 w2(5);w2(0xd);w2(5);w2(4); 38 #define P2 w2(5);w2(7);w2(5);w2(4); 87 case 1: w0(val); w2(5); w2(7); w2(5); w2(4); in dstr_write_regr() 99 w0(x);w2(5);w2(4); 117 { int k, a, b; in dstr_read_block() local 125 case 0: for (k=0;k<count;k++) { in dstr_read_block() 128 buf[k] = j44(a,b); in dstr_read_block() 133 for (k=0;k<count;k++) { in dstr_read_block() 134 w2(0x26); buf[k] = r0(); w2(0x24); in dstr_read_block() 140 for (k=0;k<count;k++) buf[k] = r4(); in dstr_read_block() [all …]
|
D | kbic.c | 57 case 1: w0(regr|0x38|s); w2(4); w2(6); w2(4); w2(5); w0(8); in kbic_read_regr() 67 case 5: w0(0x20|s); w2(4); w2(6); w2(4); w3(regr); in kbic_read_regr() 86 w0(val); w2(5); w2(4); in kbic_write_regr() 91 case 5: w0(0x20|s); w2(4); w2(6); w2(4); w3(regr); in kbic_write_regr() 136 { int k, a, b; in kbic_read_block() local 141 for (k=0;k<count/2;k++) { in kbic_read_block() 144 buf[2*k] = j44(a,b); in kbic_read_block() 145 w2(5); b = r1(); in kbic_read_block() 147 buf[2*k+1] = j44(a,b); in kbic_read_block() 153 for (k=0;k<count/4;k++) { in kbic_read_block() [all …]
|
D | epia.c | 33 1 5/3 reads on ports 1 & 2, 8-bit writes 37 5 32-bit EPP 64 w2(3); w2(5); w0(r|0xf0); in epia_read_regr() 75 case 5: w3(regr); w2(0x24); a = r4(); w2(4); in epia_read_regr() 98 case 5: r = regr^0x40; in epia_write_regr() 138 { int k, ph, a, b; in epia_read_block() local 144 for (k=0;k<count;k++) { in epia_read_block() 147 buf[k] = j44(a,b); in epia_read_block() 154 w0(0x51); w2(5); w0(0xd1); in epia_read_block() 156 for (k=0;k<count;k++) { in epia_read_block() [all …]
|
D | friq.c | 74 w2(5);w2(7);w2(5);w2(4); in friq_write_regr() 79 { int h, l, k, ph; in friq_read_block_int() local 84 for (k=0;k<count;k++) { in friq_read_block_int() 87 buf[k] = j44(l,h); in friq_read_block_int() 95 for (k=0;k<count;k++) { in friq_read_block_int() 97 buf[k] = r0(); in friq_read_block_int() 104 for (k=0;k<count-2;k++) buf[k] = r4(); in friq_read_block_int() 112 for (k=0;k<(count/2)-1;k++) ((u16 *)buf)[k] = r4w(); in friq_read_block_int() 120 for (k=0;k<(count/4)-1;k++) ((u32 *)buf)[k] = r4l(); in friq_read_block_int() 139 { int k; in friq_write_block() local [all …]
|
D | frpw.c | 71 w2(5);w2(7);w2(5);w2(4); in frpw_write_regr() 76 { int h, l, k, ph; in frpw_read_block_int() local 81 for (k=0;k<count;k++) { in frpw_read_block_int() 84 buf[k] = j44(l,h); in frpw_read_block_int() 92 for (k=0;k<count;k++) { in frpw_read_block_int() 94 buf[k] = r0(); in frpw_read_block_int() 101 for (k=0;k<count;k++) buf[k] = r4(); in frpw_read_block_int() 107 for (k=0;k<count-2;k++) buf[k] = r4(); in frpw_read_block_int() 115 for (k=0;k<(count/2)-1;k++) ((u16 *)buf)[k] = r4w(); in frpw_read_block_int() 122 case 5: w2(4); w0(regr + 0x80); cec4; in frpw_read_block_int() [all …]
|
D | epat.c | 62 case 5: w3(0x40+r); w4(val); in epat_write_regr() 90 case 5: w3(r); w2(0x24); a = r4(); w2(4); in epat_read_regr() 99 { int k, ph, a, b; in epat_read_block() local 105 for(k=0;k<count;k++) { in epat_read_block() 106 if (k == count-1) w0(0xfd); in epat_read_block() 110 buf[k] = j44(a,b); in epat_read_block() 116 case 1: w0(0x47); w2(1); w2(5); w0(0xff); in epat_read_block() 118 for(k=0;k<count;k++) { in epat_read_block() 119 if (k == count-1) w0(0xfd); in epat_read_block() 122 buf[k] = j53(a,b); in epat_read_block() [all …]
|
D | comm.c | 36 #define P1 w2(5);w2(0xd);w2(0xd);w2(5);w2(4); 37 #define P2 w2(5);w2(7);w2(7);w2(5);w2(4); 151 { int k; in comm_write_block() local 157 for (k=0;k<count;k++) { in comm_write_block() 158 w2(5); w0(buf[k^1]); w2(7); in comm_write_block() 160 w2(5); w2(4); in comm_write_block() 164 for (k=0;k<count;k++) w4(buf[k^1]); in comm_write_block() 168 for (k=0;k<count/2;k++) w4w(pi_swab16(buf,k)); in comm_write_block() 172 for (k=0;k<count/4;k++) w4l(pi_swab32(buf,k)); in comm_write_block() 181 { char *mode_string[5] = {"4-bit","8-bit","EPP-8","EPP-16","EPP-32"}; in comm_log_adapter() [all …]
|
D | fit2.c | 43 w2(0xc); w0(regr); w2(4); w0(val); w2(5); w0(0); w2(4); in fit2_write_regr() 55 w2(0xc); w0(r); w2(4); w2(5); in fit2_read_regr() 66 { int k, a, b, c, d; in fit2_read_block() local 70 for (k=0;k<count/4;k++) { in fit2_read_block() 72 w2(4); w2(5); in fit2_read_block() 75 buf[4*k+0] = j44(a,b); in fit2_read_block() 76 buf[4*k+1] = j44(d,c); in fit2_read_block() 78 w2(4); w2(5); in fit2_read_block() 81 buf[4*k+2] = j44(d,c); in fit2_read_block() 82 buf[4*k+3] = j44(a,b); in fit2_read_block() [all …]
|
D | on20.c | 27 #define op(f) w2(4);w0(f);w2(5);w2(0xd);w2(5);w2(0xd);w2(5);w2(4); 28 #define vl(v) w2(4);w0(v);w2(5);w2(7);w2(5);w2(4); 89 { int k, l, h; in on20_read_block() local 93 for (k=0;k<count;k++) in on20_read_block() 95 w2(4); w2(0x26); buf[k] = r0(); in on20_read_block() 99 buf[k] = j44(l,h); in on20_read_block() 106 { int k; in on20_write_block() local 110 for (k=0;k<count;k++) { w2(5); w0(buf[k]); w2(7); } in on20_write_block()
|
/Linux-v6.1/tools/lib/ |
D | list_sort.c | 50 __attribute__((nonnull(2,3,4,5))) 129 * 2:1 balanced merges. Given two pending sublists of size 2^k, they are 130 * merged to a size-2^(k+1) list as soon as we have 2^k following elements. 132 * Thus, it will avoid cache thrashing as long as 3*2^k elements can 141 * Each time we increment "count", we set one bit (bit k) and clear 142 * bits k-1 .. 0. Each time this happens (except the very first time 143 * for each bit, when count increments to 2^k), we merge two lists of 144 * size 2^k into one list of size 2^(k+1). 147 * 2^k, which is when we have 2^k elements pending in smaller lists, 148 * so it's safe to merge away two lists of size 2^k. [all …]
|
/Linux-v6.1/lib/ |
D | list_sort.c | 51 __attribute__((nonnull(2,3,4,5))) 130 * 2:1 balanced merges. Given two pending sublists of size 2^k, they are 131 * merged to a size-2^(k+1) list as soon as we have 2^k following elements. 133 * Thus, it will avoid cache thrashing as long as 3*2^k elements can 142 * Each time we increment "count", we set one bit (bit k) and clear 143 * bits k-1 .. 0. Each time this happens (except the very first time 144 * for each bit, when count increments to 2^k), we merge two lists of 145 * size 2^k into one list of size 2^(k+1). 148 * 2^k, which is when we have 2^k elements pending in smaller lists, 149 * so it's safe to merge away two lists of size 2^k. [all …]
|
/Linux-v6.1/crypto/ |
D | serpent_generic.c | 25 ({ b ^= d; b ^= c; b ^= a; b ^= PHI ^ i; b = rol32(b, 11); k[j] = b; }) 28 ({ x0 = k[i]; x1 = k[i+1]; x2 = k[i+2]; x3 = k[i+3]; }) 31 ({ k[i] = x0; k[i+1] = x1; k[i+2] = x2; k[i+3] = x3; }) 36 #define K(x0, x1, x2, x3, i) ({ \ macro 37 x3 ^= k[4*(i)+3]; x2 ^= k[4*(i)+2]; \ 38 x1 ^= k[4*(i)+1]; x0 ^= k[4*(i)+0]; \ 48 x0 ^= x3; x2 ^= x4; x3 ^= k[4*i+3]; \ 49 x1 ^= k[4*i+1]; x0 = rol32(x0, 5); x2 = rol32(x2, 22);\ 50 x0 ^= k[4*i+0]; x2 ^= k[4*i+2]; \ 54 x0 ^= k[4*i+0]; x1 ^= k[4*i+1]; x2 ^= k[4*i+2]; \ [all …]
|
D | wp512.c | 784 u64 K[8]; /* the round key */ in wp512_process_buffer() local 793 state[0] = block[0] ^ (K[0] = wctx->hash[0]); in wp512_process_buffer() 794 state[1] = block[1] ^ (K[1] = wctx->hash[1]); in wp512_process_buffer() 795 state[2] = block[2] ^ (K[2] = wctx->hash[2]); in wp512_process_buffer() 796 state[3] = block[3] ^ (K[3] = wctx->hash[3]); in wp512_process_buffer() 797 state[4] = block[4] ^ (K[4] = wctx->hash[4]); in wp512_process_buffer() 798 state[5] = block[5] ^ (K[5] = wctx->hash[5]); in wp512_process_buffer() 799 state[6] = block[6] ^ (K[6] = wctx->hash[6]); in wp512_process_buffer() 800 state[7] = block[7] ^ (K[7] = wctx->hash[7]); in wp512_process_buffer() 804 L[0] = C0[(int)(K[0] >> 56) ] ^ in wp512_process_buffer() [all …]
|
/Linux-v6.1/include/uapi/linux/ |
D | keyboard.h | 13 #define KG_SHIFTR 5 34 #define KT_CONS 5 45 #define K(t,v) (((t)<<8)|(v)) macro 49 #define K_F1 K(KT_FN,0) 50 #define K_F2 K(KT_FN,1) 51 #define K_F3 K(KT_FN,2) 52 #define K_F4 K(KT_FN,3) 53 #define K_F5 K(KT_FN,4) 54 #define K_F6 K(KT_FN,5) 55 #define K_F7 K(KT_FN,6) [all …]
|
/Linux-v6.1/tools/testing/selftests/tc-testing/tc-tests/actions/ |
D | police.json | 17 "cmdUnderTest": "$TC actions add action police rate 1kbit burst 10k index 1", 40 "$TC actions add action police rate 4Mbit burst 120k index 9" 42 "cmdUnderTest": "$TC actions add action police rate 8kbit burst 24k index 9", 66 "cmdUnderTest": "$TC actions add action police rate 90kbit burst 10k mtu 1k index 98", 90 …"cmdUnderTest": "$TC actions add action police rate 90kbit burst 10k mtu 2kb peakrate 100kbit inde… 114 … "cmdUnderTest": "$TC actions add action police rate 5kbit burst 6kb peakrate 10kbit index 9", 117 "matchPattern": "action order [0-9]*: police 0x9 rate 5Kb burst 10Kb", 138 "cmdUnderTest": "$TC actions add action police rate 1mbit burst 100k overhead 64 index 64", 162 … "cmdUnderTest": "$TC actions add action police rate 2mbit burst 200k linklayer ethernet index 8", 186 "cmdUnderTest": "$TC actions add action police rate 2mbit burst 200k linklayer atm index 8", [all …]
|
/Linux-v6.1/net/ceph/ |
D | ceph_hash.c | 17 c = c - a; c = c - b; c = c ^ (b >> 5); \ 25 const unsigned char *k = (const unsigned char *)str; in ceph_str_hash_rjenkins() local 37 a = a + (k[0] + ((__u32)k[1] << 8) + ((__u32)k[2] << 16) + in ceph_str_hash_rjenkins() 38 ((__u32)k[3] << 24)); in ceph_str_hash_rjenkins() 39 b = b + (k[4] + ((__u32)k[5] << 8) + ((__u32)k[6] << 16) + in ceph_str_hash_rjenkins() 40 ((__u32)k[7] << 24)); in ceph_str_hash_rjenkins() 41 c = c + (k[8] + ((__u32)k[9] << 8) + ((__u32)k[10] << 16) + in ceph_str_hash_rjenkins() 42 ((__u32)k[11] << 24)); in ceph_str_hash_rjenkins() 44 k = k + 12; in ceph_str_hash_rjenkins() 52 c = c + ((__u32)k[10] << 24); in ceph_str_hash_rjenkins() [all …]
|
/Linux-v6.1/drivers/media/platform/verisilicon/ |
D | hantro_vp8.c | 53 u32 i, j, k; in hantro_vp8_prob_update() local 64 dst[5] = hdr->segment.segment_probs[1]; in hantro_vp8_prob_update() 74 dst[5] = entropy->uv_mode_probs[1]; in hantro_vp8_prob_update() 85 dst[5] = entropy->mv_probs[0][9 + 9]; in hantro_vp8_prob_update() 104 dst[5] = entropy->mv_probs[i][5 + 2]; in hantro_vp8_prob_update() 115 for (k = 0; k < 3; ++k) { in hantro_vp8_prob_update() 116 dst[0] = entropy->coeff_probs[i][j][k][0]; in hantro_vp8_prob_update() 117 dst[1] = entropy->coeff_probs[i][j][k][1]; in hantro_vp8_prob_update() 118 dst[2] = entropy->coeff_probs[i][j][k][2]; in hantro_vp8_prob_update() 119 dst[3] = entropy->coeff_probs[i][j][k][3]; in hantro_vp8_prob_update() [all …]
|
/Linux-v6.1/drivers/media/usb/pwc/ |
D | pwc-dec23.c | 92 int compression_mode, j, k, bit, pw; in build_table_color() local 104 for (k = 0; k < 16; k++) { in build_table_color() 105 if (k == 0) in build_table_color() 107 else if (k >= 1 && k < 3) in build_table_color() 109 else if (k >= 3 && k < 6) in build_table_color() 111 else if (k >= 6 && k < 10) in build_table_color() 113 else if (k >= 10 && k < 13) in build_table_color() 115 else if (k >= 13 && k < 15) in build_table_color() 119 if (k == 0) in build_table_color() 126 p0[k + 0x00] = (1 * pw) + 0x80; in build_table_color() [all …]
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/haswell/ |
D | virtual-memory.json | 5 "CounterHTOff": "0,1,2,3,4,5,6,7", 15 "CounterHTOff": "0,1,2,3,4,5,6,7", 25 "CounterHTOff": "0,1,2,3,4,5,6,7", 35 "CounterHTOff": "0,1,2,3,4,5,6,7", 43 "BriefDescription": "Load misses that miss the DTLB and hit the STLB (4K)", 45 "CounterHTOff": "0,1,2,3,4,5,6,7", 48 …"PublicDescription": "This event counts load operations from a 4K page that miss the first DTLB le… 55 "CounterHTOff": "0,1,2,3,4,5,6,7", 65 "CounterHTOff": "0,1,2,3,4,5,6,7", 74 "CounterHTOff": "0,1,2,3,4,5,6,7", [all …]
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/haswellx/ |
D | virtual-memory.json | 5 "CounterHTOff": "0,1,2,3,4,5,6,7", 15 "CounterHTOff": "0,1,2,3,4,5,6,7", 25 "CounterHTOff": "0,1,2,3,4,5,6,7", 35 "CounterHTOff": "0,1,2,3,4,5,6,7", 43 "BriefDescription": "Load misses that miss the DTLB and hit the STLB (4K)", 45 "CounterHTOff": "0,1,2,3,4,5,6,7", 48 …"PublicDescription": "This event counts load operations from a 4K page that miss the first DTLB le… 55 "CounterHTOff": "0,1,2,3,4,5,6,7", 65 "CounterHTOff": "0,1,2,3,4,5,6,7", 74 "CounterHTOff": "0,1,2,3,4,5,6,7", [all …]
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/broadwell/ |
D | virtual-memory.json | 5 "CounterHTOff": "0,1,2,3,4,5,6,7", 9 …event counts load misses in all DTLB levels that cause page walks of any page size (4K/2M/4M/1G).", 16 "CounterHTOff": "0,1,2,3,4,5,6,7", 25 "CounterHTOff": "0,1,2,3,4,5,6,7", 32 "BriefDescription": "Load misses that miss the DTLB and hit the STLB (4K).", 34 "CounterHTOff": "0,1,2,3,4,5,6,7", 43 "CounterHTOff": "0,1,2,3,4,5,6,7", 53 "CounterHTOff": "0,1,2,3,4,5,6,7", 64 "CounterHTOff": "0,1,2,3,4,5,6,7", 73 …oad Miss in all translation lookaside buffer (TLB) levels causes a page walk that completes (4K).", [all …]
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/broadwellde/ |
D | virtual-memory.json | 5 "CounterHTOff": "0,1,2,3,4,5,6,7", 9 …event counts load misses in all DTLB levels that cause page walks of any page size (4K/2M/4M/1G).", 16 "CounterHTOff": "0,1,2,3,4,5,6,7", 25 "CounterHTOff": "0,1,2,3,4,5,6,7", 32 "BriefDescription": "Load misses that miss the DTLB and hit the STLB (4K).", 34 "CounterHTOff": "0,1,2,3,4,5,6,7", 43 "CounterHTOff": "0,1,2,3,4,5,6,7", 53 "CounterHTOff": "0,1,2,3,4,5,6,7", 64 "CounterHTOff": "0,1,2,3,4,5,6,7", 73 …oad Miss in all translation lookaside buffer (TLB) levels causes a page walk that completes (4K).", [all …]
|
/Linux-v6.1/tools/perf/pmu-events/arch/x86/broadwellx/ |
D | virtual-memory.json | 5 "CounterHTOff": "0,1,2,3,4,5,6,7", 9 …event counts load misses in all DTLB levels that cause page walks of any page size (4K/2M/4M/1G).", 16 "CounterHTOff": "0,1,2,3,4,5,6,7", 25 "CounterHTOff": "0,1,2,3,4,5,6,7", 32 "BriefDescription": "Load misses that miss the DTLB and hit the STLB (4K).", 34 "CounterHTOff": "0,1,2,3,4,5,6,7", 43 "CounterHTOff": "0,1,2,3,4,5,6,7", 53 "CounterHTOff": "0,1,2,3,4,5,6,7", 64 "CounterHTOff": "0,1,2,3,4,5,6,7", 73 …oad Miss in all translation lookaside buffer (TLB) levels causes a page walk that completes (4K).", [all …]
|
/Linux-v6.1/arch/arm64/crypto/ |
D | aes-ce.S | 57 .macro do_enc_Nx, de, mc, k, i0, i1, i2, i3, i4 58 aes\de \i0\().16b, \k\().16b 61 aes\de \i1\().16b, \k\().16b 64 aes\de \i2\().16b, \k\().16b 66 aes\de \i3\().16b, \k\().16b 69 aes\de \i4\().16b, \k\().16b 76 /* up to 5 interleaved encryption rounds with the same round key */ 77 .macro round_Nx, enc, k, i0, i1, i2, i3, i4 79 do_enc_Nx e, mc, \k, \i0, \i1, \i2, \i3, \i4 81 do_enc_Nx d, imc, \k, \i0, \i1, \i2, \i3, \i4 [all …]
|