| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/ |
| D | trivial-devices.yaml | 109 # 5 Bit Programmable, Pulse-Width Modulator 151 # Microchip 7-bit Single I2C Digital POT (5k) 153 # Microchip 7-bit Single I2C Digital POT (10k) 155 # Microchip 7-bit Single I2C Digital POT (50k) 157 # Microchip 7-bit Single I2C Digital POT (100k) 159 # Microchip 7-bit Single I2C Digital POT (5k) 161 # Microchip 7-bit Single I2C Digital POT (10k) 163 # Microchip 7-bit Single I2C Digital POT (50k) 165 # Microchip 7-bit Single I2C Digital POT (100k) 167 # Microchip 7-bit Single I2C Digital POT (5k) [all …]
|
| /kernel/linux/linux-6.6/drivers/ata/pata_parport/ |
| D | on26.c | 30 w2(5); w2(0xd); w2(5); w2(0xd); w2(5); w2(4); \ 35 w2(5); w2(7); w2(5); w2(4); \ 63 w3(1); w3(1); w2(5); w4(r); w2(4); in on26_read_regr() 85 w3(1); w3(1); w2(5); w4(r); w2(4); in on26_write_regr() 87 w2(5); w4(val); w2(4); in on26_write_regr() 88 w2(5); w4(val); w2(4); in on26_write_regr() 97 w2(4); w2(5); w2(4); w0(0xff); \ 141 pi->delay = 5; in on26_test_port() 151 w0(0x20); w2(4); w2(5); in on26_test_port() 188 return 5; in on26_test_port() [all …]
|
| D | dstr.c | 29 #define P1 w2(5);w2(0xd);w2(5);w2(4); 30 #define P2 w2(5);w2(7);w2(5);w2(4); 83 w0(val); w2(5); w2(7); w2(5); w2(4); in dstr_write_regr() 98 w0(x); w2(5); w2(4); \ 117 int k, a, b; in dstr_read_block() local 128 for (k = 0; k < count; k++) { in dstr_read_block() 131 buf[k] = j44(a, b); in dstr_read_block() 136 for (k = 0; k < count; k++) { in dstr_read_block() 138 buf[k] = r0(); in dstr_read_block() 145 for (k = 0; k < count; k++) in dstr_read_block() [all …]
|
| D | kbic.c | 47 w0(regr|0x38 | s); w2(4); w2(6); w2(4); w2(5); w0(8); in kbic_read_regr() 56 case 5: in kbic_read_regr() 74 w0(val); w2(5); w2(4); in kbic_write_regr() 78 case 5: in kbic_write_regr() 128 int k, a, b; in kbic_read_block() local 133 for (k = 0; k < count / 2; k++) { in kbic_read_block() 138 buf[2 * k] = j44(a, b); in kbic_read_block() 139 w2(5); in kbic_read_block() 143 buf[2 * k + 1] = j44(a, b); in kbic_read_block() 149 for (k = 0; k < count / 4; k++) { in kbic_read_block() [all …]
|
| D | epia.c | 23 * 1 5/3 reads on ports 1 & 2, 8-bit writes 27 * 5 32-bit EPP 54 w2(3); w2(5); w0(r | 0xf0); in epia_read_regr() 64 case 5: in epia_read_regr() 87 case 5: in epia_write_regr() 129 int k, ph, a, b; in epia_read_block() local 135 for (k = 0; k < count; k++) { in epia_read_block() 138 buf[k] = j44(a, b); in epia_read_block() 145 w0(0x51); w2(5); w0(0xd1); in epia_read_block() 147 for (k = 0; k < count; k++) { in epia_read_block() [all …]
|
| D | frpw.c | 53 w2(5); w2(7); w2(5); w2(4); in frpw_write_regr() 59 int h, l, k, ph; in frpw_read_block_int() local 64 for (k = 0; k < count; k++) { in frpw_read_block_int() 67 buf[k] = j44(l, h); in frpw_read_block_int() 76 for (k = 0; k < count; k++) { in frpw_read_block_int() 78 buf[k] = r0(); in frpw_read_block_int() 86 for (k = 0; k < count; k++) in frpw_read_block_int() 87 buf[k] = r4(); in frpw_read_block_int() 94 for (k = 0; k < count - 2; k++) in frpw_read_block_int() 95 buf[k] = r4(); in frpw_read_block_int() [all …]
|
| D | friq.c | 66 w2(5); w2(7); w2(5); w2(4); in friq_write_regr() 71 int h, l, k, ph; in friq_read_block_int() local 76 for (k = 0; k < count; k++) { in friq_read_block_int() 79 buf[k] = j44(l, h); in friq_read_block_int() 87 for (k = 0; k < count; k++) { in friq_read_block_int() 89 buf[k] = r0(); in friq_read_block_int() 96 for (k = 0; k < count - 2; k++) in friq_read_block_int() 97 buf[k] = r4(); in friq_read_block_int() 105 for (k = 0; k < count / 2 - 1; k++) in friq_read_block_int() 106 ((u16 *)buf)[k] = r4w(); in friq_read_block_int() [all …]
|
| D | epat.c | 49 case 5: in epat_write_regr() 77 case 5: in epat_read_regr() 87 int k, ph, a, b; in epat_read_block() local 94 for (k = 0; k < count; k++) { in epat_read_block() 95 if (k == count-1) in epat_read_block() 103 buf[k] = j44(a, b); in epat_read_block() 110 w0(0x47); w2(1); w2(5); w0(0xff); in epat_read_block() 112 for (k = 0; k < count; k++) { in epat_read_block() 113 if (k == count - 1) in epat_read_block() 117 buf[k] = j53(a, b); in epat_read_block() [all …]
|
| D | comm.c | 27 #define P1 w2(5);w2(0xd);w2(0xd);w2(5);w2(4); 28 #define P2 w2(5);w2(7);w2(7);w2(5);w2(4); 145 int k; in comm_write_block() local 151 for (k = 0; k < count; k++) { in comm_write_block() 152 w2(5); in comm_write_block() 153 w0(buf[k ^ 1]); in comm_write_block() 156 w2(5); w2(4); in comm_write_block() 160 for (k = 0; k < count; k++) in comm_write_block() 161 w4(buf[k ^ 1]); in comm_write_block() 165 for (k = 0; k < count / 2; k++) in comm_write_block() [all …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/patches/linux-4.19/prebuilts/usr/include/linux/ |
| D | keyboard.h | 15 #define KG_SHIFTR 5 30 #define KT_CONS 5 39 #define K(t,v) (((t)<<8)|(v)) macro 42 #define K_F1 K(KT_FN,0) 43 #define K_F2 K(KT_FN,1) 44 #define K_F3 K(KT_FN,2) 45 #define K_F4 K(KT_FN,3) 46 #define K_F5 K(KT_FN,4) 47 #define K_F6 K(KT_FN,5) 48 #define K_F7 K(KT_FN,6) [all …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-5.10/include/uapi/linux/ |
| D | keyboard.h | 13 #define KG_SHIFTR 5 35 #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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/patches/linux-5.10/prebuilts/usr/include/linux/ |
| D | keyboard.h | 28 #define KG_SHIFTR 5 43 #define KT_CONS 5 52 #define K(t,v) (((t) << 8) | (v)) macro 55 #define K_F1 K(KT_FN, 0) 56 #define K_F2 K(KT_FN, 1) 57 #define K_F3 K(KT_FN, 2) 58 #define K_F4 K(KT_FN, 3) 59 #define K_F5 K(KT_FN, 4) 60 #define K_F6 K(KT_FN, 5) 61 #define K_F7 K(KT_FN, 6) [all …]
|