2K (full) in projects: linux - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched +full:2 +full:k (Results 1 – 25 of 1063) sorted by relevance

12 3 4 5 6 7 8 9 10 >>...43

/linux/drivers/gpu/drm/amd/display/dc/dml/dcn32/
H A D	display_mode_vba_util_32.c	46 …mSlices = number of slices in the horiziontal direction per DSC engine in the set of {1, 2, 3, 4} in dml32_dscceComputeDelay() 52 // N422/N420 operate at 2 pixels per clock in dml32_dscceComputeDelay() 57 pixelsPerClock = 2; in dml32_dscceComputeDelay() 59 pixelsPerClock = 2; in dml32_dscceComputeDelay() 86 wx = (w + 2) / 3; in dml32_dscceComputeDelay() 90 ax = (a + 2) / 3 + D + 6 + 1; in dml32_dscceComputeDelay() 98 //dsc processes 3 pixel containers per cycle and a container can contain 1 or 2 pixels in dml32_dscceComputeDelay() 120 Delay = Delay + 2; in dml32_dscComputeDelay() 126 Delay = Delay + 2; in dml32_dscComputeDelay() 132 Delay = Delay + 2; in dml32_dscComputeDelay() [all …]
/linux/tools/lib/
H A D	list_sort.c	12 __attribute__((nonnull(2,3,4))) 48 __attribute__((nonnull(2,3,4,5))) 117 * 2:1 balanced merges. Given two pending sublists of size 2^k, they are 118 * merged to a size-2^(k+1) list as soon as we have 2^k following elements. 120 * Thus, it will avoid cache thrashing as long as 32^k elements can 129 Each time we increment "count", we set one bit (bit k) and clear 130 * bits k-1 .. 0. Each time this happens (except the very first time 131 * for each bit, when count increments to 2^k), we merge two lists of 132 * size 2^k into one list of size 2^(k+1). 135 * 2^k, which is when we have 2^k elements pending in smaller lists, [all …]
/linux/drivers/ata/pata_parport/
H A D	frpw.c	`30 static int cont_map[2] = { 0x08, 0x10 }; 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() 73 ph = 2; 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() 79 ph = 2 - ph; in frpw_read_block_int() 84 case 2: in frpw_read_block_int() 86 for (k = 0; k < count; k++) in frpw_read_block_int() [all …]`
H A D	friq.c	`44 static int cont_map[2] = { 0x08, 0x10 }; 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() 84 ph = 2; 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() 90 ph = 2 - ph; in friq_read_block_int() 94 case 2: in friq_read_block_int() 96 for (k = 0; k < count - 2; k++) in friq_read_block_int() [all …]`
H A D	epia.c	`23 * 1 5/3 reads on ports 1 & 2, 8-bit writes 24 * 2 8-bit reads and writes 37 static int cont_map[2] = { 0, 0x80 }; 57 case 2: in epia_read_regr() 81 case 2: 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() 136 w2(2+ph); a = r1(); in epia_read_block() 138 buf[k] = j44(a, b); in epia_read_block() 147 for (k = 0; k < count; k++) { in epia_read_block() [all …]`
H A D	kbic.c	`33 static int cont_map[2] = { 0x80, 0x40 }; 50 case 2: in kbic_read_regr() 72 case 2: 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() 143 buf[2 * k + 1] = j44(a, b); in kbic_read_block() 149 for (k = 0; k < count / 4; k++) { in kbic_read_block() 153 buf[4 * k] = j53(r12w()); in kbic_read_block() 155 buf[4 * k + 1] = j53(r12w()); in kbic_read_block() [all …]`
H A D	epat.c	`33 * cont = 2 internal EPAT registers 44 case 2: in epat_write_regr() 71 case 2: 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() 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 …]`
H A D	on26.c	`21 * 2 8-bit EPP mode 47 r = (regr << 2) + 1 + cont; in on26_read_regr() 60 case 2: in on26_read_regr() 74 int r = (regr << 2) + 1 + cont; in on26_write_regr() 82 case 2: in on26_write_regr() 113 w0(2); P1; w0(8); P2; in on26_connect() 114 w0(2); P1; w0(x); P2; in on26_connect() 119 if (pi->mode >= 2) { in on26_disconnect() 156 w0(2); P1; w0(0); P2; in on26_test_port() 158 w0(2); P1; w0(8); P2; udelay(100); in on26_test_port() [all …]`
H A D	dstr.c	`21 * 2 8-bit EPP mode 37 static int cont_map[2] = { 0x20, 0x40 }; 59 case 2: in dstr_read_regr() 74 if (pi->mode >= 2) in dstr_write_regr() 85 case 2: in dstr_write_regr() 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() [all …]`
H A D	fit3.c	`44 case 2: in fit3_write_regr() 70 case 2: in fit3_read_regr() 83 int k, a, b, c, d; in fit3_read_block() local 88 for (k = 0; k < count / 2; k++) { in fit3_read_block() 93 buf[2 * k] = j44(a, b); in fit3_read_block() 94 buf[2 * k + 1] = j44(c, d); in fit3_read_block() 101 for (k = 0; k < count / 2; k++) { in fit3_read_block() 104 buf[2 * k] = a; in fit3_read_block() 105 buf[2 * k + 1] = b; in fit3_read_block() 110 case 2: in fit3_read_block() [all …]`
H A D	aten.c	`26 static int cont_map[2] = { 0x08, 0x20 }; 62 int k, a, b, c, d; in aten_read_block() local 68 for (k = 0; k < count / 2; k++) { in aten_read_block() 69 w2(7); w2(6); w2(2); in aten_read_block() 72 buf[2 * k] = j44(c, d); in aten_read_block() 73 buf[2 * k + 1] = j44(a, b); in aten_read_block() 80 for (k = 0; k < count / 2; k++) { in aten_read_block() 83 buf[2 * k] = b; in aten_read_block() 84 buf[2 * k + 1] = a; in aten_read_block() 93 int k; in aten_write_block() local [all …]`
H A D	comm.c	`22 * 2 8-bit EPP mode 34 static int cont_map[2] = { 0x08, 0x10 }; 53 case 2: in comm_read_regr() 73 case 2: in comm_write_regr() 121 case 2: in comm_read_block() 129 for (i = 0; i < count / 2; i++) in comm_read_block() 145 int k; in comm_write_block() local 151 for (k = 0; k < count; k++) { in comm_write_block() 153 w0(buf[k ^ 1]); in comm_write_block() 158 case 2: in comm_write_block() [all …]`
/linux/include/uapi/linux/
H A D	keyboard.h	`8 #define KG_CTRL 2 31 #define KT_SPEC 2 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/Documentation/admin-guide/media/
H A D	dvb_intro.rst	`133 T 177500000 7MHz AUTO AUTO QAM64 8k 1/16 NONE 134 T 184500000 7MHz AUTO AUTO QAM64 8k 1/8 NONE 135 T 191625000 7MHz AUTO AUTO QAM64 8k 1/16 NONE 136 T 219500000 7MHz AUTO AUTO QAM64 8k 1/16 NONE 137 T 226500000 7MHz AUTO AUTO QAM64 8k 1/16 NONE 138 T 557625000 7MHz AUTO AUTO QPSK 8k 1/16 NONE 151 TRANSMISSION_MODE = 8K 179 TRANSMISSION_MODE = 8K 194 TRANSMISSION_MODE = 8K 198 [ABC TV 2] [all …]`
/linux/tools/testing/selftests/tc-testing/tc-tests/actions/
H A D	police.json	20 "cmdUnderTest": "$TC actions add action police rate 1kbit burst 10k index 1", 46 "$TC actions add action police rate 4Mbit burst 120k index 9" 48 "cmdUnderTest": "$TC actions add action police rate 8kbit burst 24k index 9", 75 "cmdUnderTest": "$TC actions add action police rate 90kbit burst 10k mtu 1k index 98", 102 "cmdUnderTest": "$TC actions add action police rate 90kbit burst 10k mtu 2kb peakrate 100kbit index 3", 105 "matchPattern": "action order [0-9]: police 0x3 rate 90Kbit burst 10Kb mtu 2Kb peakrate 100Kbit", 156 "cmdUnderTest": "$TC actions add action police rate 1mbit burst 100k overhead 64 index 64", 159 "matchPattern": "action order [0-9]: police 0x40 rate 1Mbit burst 100Kb mtu 2K 16 1, global() number 43 1, global() number 57 { global() object 71 1, global() number 98 1, global() number 125 1, global() number 152 1, global() number 179 1, global() number 206 1, global() number 233 1, global() number 260 1, global() number 287 1, global() number 314 1, global() number 341 1, global() number 368 1, global() number 395 1, global() number 422 1, global() number 449 1, global() number 476 1, global() number 503 1, global() number 530 1, global() number 558 1, global() number 562 "$TC actions add action police rate 2mbit burst 200k index 2", global() string 593 1, global() number 621 1, global() number 625 "$TC actions add action police rate 2mbit burst 200k index 2", global() string 655 "$TC actions add action police rate 3mbit burst 300k index 3", global() string 685 1, global() number 712 1, global() number 739 1, global() number 766 1, global() number 793 1, global() number 820 1, global() number 847 1, global() number 875 1, global() number 902 1, global() number 929 1, global() number [all...]
/linux/drivers/input/joystick/
H A D	tmdc.c	46 static const unsigned char tmdc_byte_d[16] = { 2, 5, 8, 9 }; 83 { 1, "ThrustMaster Millennium 3D Inceptor", 6, 2, { 4, 2 }, { 4, 6 }, tmdc_abs, tmdc_btn_joy }, 84 { 3, "ThrustMaster Rage 3D Gamepad", 2, 0, { 8, 2 }, { 0, 0 }, tmdc_abs, tmdc_btn_pad }, 85 { 4, "ThrustMaster Attack Throttle", 5, 2, { 4, 6 }, { 4, 2 }, tmdc_abs_at, tmdc_btn_at }, 86 { 8, "ThrustMaster FragMaster", 4, 0, { 8, 2 }, { 0, 0 }, tmdc_abs_fm, tmdc_btn_fm }, 87 { 163, "Thrustmaster Fusion GamePad", 2, 0, { 8, 2 }, { 0, 0 }, tmdc_abs, tmdc_btn_pad }, 106 struct tmdc_port port[2]; 108 struct input_dev dev[2]; 109 char name[2][64]; 110 char phys[2][32]; [all …]
/linux/tools/testing/selftests/bpf/progs/
H A D	test_jhash.h	`39 const unsigned char k = key; in jhash() local 44 a += (volatile u32 )(k); in jhash() 45 b += (volatile u32 )(k + 4); in jhash() 46 c += (volatile u32 *)(k + 8); in jhash() 49 k += 12; in jhash() 52 case 12: c += (u32)k[11]<<24; in jhash() 53 case 11: c += (u32)k[10]<<16; in jhash() 54 case 10: c += (u32)k[9]<<8; in jhash() 55 case 9: c += k[8]; in jhash() 56 case 8: b += (u32)k[7]<<24; in jhash() [all …]`
/linux/arch/sparc/net/
H A D	bpf_jit_comp_32.c	`20 #define SEEN_XREG 2 /* ebx is used */ 56 #define WDISP22(X) (((X) >> 2) & 0x3fffff) 58 #define BA (F2(0, 2) \| CONDA) 59 #define BGU (F2(0, 2) \| CONDGU) 60 #define BLEU (F2(0, 2) \| CONDLEU) 61 #define BGEU (F2(0, 2) \| CONDGEU) 62 #define BLU (F2(0, 2) \| CONDLU) 63 #define BE (F2(0, 2) \| CONDE) 64 #define BNE (F2(0, 2) \| CONDNE) 68 #define SETHI(K, REG) \ argument [all …]`
/linux/tools/include/linux/
H A D	jhash.h	`61 * @k: sequence of bytes as key 73 const u8 *k = key; in jhash() local 80 a += __get_unaligned_cpu32(k); in jhash() 81 b += __get_unaligned_cpu32(k + 4); in jhash() 82 c += __get_unaligned_cpu32(k + 8); in jhash() 85 k += 12; in jhash() 90 case 12: c += (u32)k[11]<<24; in jhash() 91 case 11: c += (u32)k[10]<<16; in jhash() 92 case 10: c += (u32)k[9]<<8; in jhash() 93 case 9: c += k[8]; in jhash() [all …]`
/linux/include/linux/
H A D	jhash.h	`61 * @k: sequence of bytes as key 73 const u8 k = key; in jhash() local 80 a += get_unaligned((u32 )k); in jhash() 81 b += get_unaligned((u32 )(k + 4)); in jhash() 82 c += get_unaligned((u32 )(k + 8)); in jhash() 85 k += 12; in jhash() 89 case 12: c += (u32)k[11]<<24; fallthrough; in jhash() 90 case 11: c += (u32)k[10]<<16; fallthrough; in jhash() 91 case 10: c += (u32)k[9]<<8; fallthrough; in jhash() 92 case 9: c += k[8]; fallthrough; in jhash() [all …]`
/linux/drivers/media/platform/verisilicon/
H A D	hantro_vp8.c	26 u8 prob_mv_context[2][V4L2_VP8_MV_PROB_CNT]; 27 u8 padding2[2]; 41 { 2, -11, 108, 36, -8, 1 }, 45 { 1, -8, 36, 108, -11, 2 }, 53 u32 i, j, k; in hantro_vp8_prob_update() local 61 dst[2] = hdr->prob_last; in hantro_vp8_prob_update() 65 dst[6] = hdr->segment.segment_probs[2]; in hantro_vp8_prob_update() 71 dst[2] = entropy->y_mode_probs[2]; in hantro_vp8_prob_update() 75 dst[6] = entropy->uv_mode_probs[2]; in hantro_vp8_prob_update() 82 dst[2] = entropy->mv_probs[0][1]; /* sign */ in hantro_vp8_prob_update() [all …]
/linux/drivers/md/bcache/
H A D	bset.c	23 struct bkey k, next; in bch_dump_bset() local 25 for (k = i->start; k < bset_bkey_last(i); k = next) { in bch_dump_bset() 26 next = bkey_next(k); in bch_dump_bset() 29 (unsigned int) ((u64 ) k - i->d), i->keys); in bch_dump_bset() 32 b->ops->key_dump(b, k); in bch_dump_bset() 34 pr_cont("%llu:%llu\n", KEY_INODE(k), KEY_OFFSET(k)); in bch_dump_bset() 37 bkey_cmp(k, b->ops->is_extents ? in bch_dump_bset() 58 struct bkey k; in __bch_count_data() local 61 for_each_key(b, k, &iter) in __bch_count_data() 62 ret += KEY_SIZE(k); in __bch_count_data() [all …]
/linux/tools/thermal/tmon/
H A D	pid.c	`39 * y[k] = y[k-1] - kp(x[k] - x[k-1]) + KiTse[k] - Kd(x[k] 40 * - 2x[k-1]+x[k-2])/Ts 46 static double xk_1, xk_2; / input temperature x[k-#] / 51 2. calculate PID based on Ziegler-Nichols rule 81 * y[k] = y[k-1] - kp(x[k] - x[k-1]) + KiTse[k] - Kd(x[k] 82 * - 2x[k-1]+x[k-2])/Ts 85 #define GUARD_BAND (2) 102 d_term = -p_param.kp p_param.kd * (xk - 2 * xk_1 + xk_2) / p_param.ts; in controller_handler()`
/linux/tools/testing/selftests/bpf/prog_tests/
H A D	hashmap.c	1 // SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause) 14 static size_t hash_fn(long k, void *ctx) in hash_fn() argument 16 return k; in hash_fn() 56 long oldk, k = i; in test_hashmap_generic() local 59 err = hashmap__update(map, k, v, &oldk, &oldv); in test_hashmap_generic() 64 if (i % 2) { in test_hashmap_generic() 65 err = hashmap__add(map, k, v); in test_hashmap_generic() 67 err = hashmap__set(map, k, v, &oldk, &oldv); in test_hashmap_generic() 69 "unexpected k/v: %ld=%ld\n", oldk, oldv)) in test_hashmap_generic() 73 if (CHECK(err, "elem_add", "failed to add k/v %ld = %ld: %d\n", k, v, err)) in test_hashmap_generic() [all …]
/linux/lib/
H A D	bitmap.c	40 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_equal() local 41 for (k = 0; k < lim; ++k) in __bitmap_equal() 42 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal() 46 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal() 58 unsigned int k, lim = bits / BITS_PER_LONG; in __bitmap_or_equal() local 61 for (k = 0; k < lim; ++k) { in __bitmap_or_equal() 62 if ((bitmap1[k] \| bitmap2[k]) != bitmap3[k]) in __bitmap_or_equal() 69 tmp = (bitmap1[k] \| bitmap2[k]) ^ bitmap3[k]; in __bitmap_or_equal() 75 unsigned int k, lim = BITS_TO_LONGS(bits); in __bitmap_complement() local 76 for (k = 0; k < lim; ++k) in __bitmap_complement() [all …]

12 3 4 5 6 7 8 9 10 >>...43