Lines Matching +full:2 +full:k
9 unsigned i, j, k; in memset16_selftest() local
12 p = kmalloc(256 * 2 * 2, GFP_KERNEL); in memset16_selftest()
18 memset(p, 0xa1, 256 * 2 * sizeof(v)); in memset16_selftest()
20 for (k = 0; k < 512; k++) { in memset16_selftest()
21 v = p[k]; in memset16_selftest()
22 if (k < i) { in memset16_selftest()
25 } else if (k < i + j) { in memset16_selftest()
39 return (i << 24) | (j << 16) | k | 0x8000; in memset16_selftest()
45 unsigned i, j, k; in memset32_selftest() local
48 p = kmalloc(256 * 2 * 4, GFP_KERNEL); in memset32_selftest()
54 memset(p, 0xa1, 256 * 2 * sizeof(v)); in memset32_selftest()
56 for (k = 0; k < 512; k++) { in memset32_selftest()
57 v = p[k]; in memset32_selftest()
58 if (k < i) { in memset32_selftest()
61 } else if (k < i + j) { in memset32_selftest()
75 return (i << 24) | (j << 16) | k | 0x8000; in memset32_selftest()
81 unsigned i, j, k; in memset64_selftest() local
84 p = kmalloc(256 * 2 * 8, GFP_KERNEL); in memset64_selftest()
90 memset(p, 0xa1, 256 * 2 * sizeof(v)); in memset64_selftest()
92 for (k = 0; k < 512; k++) { in memset64_selftest()
93 v = p[k]; in memset64_selftest()
94 if (k < i) { in memset64_selftest()
97 } else if (k < i + j) { in memset64_selftest()
111 return (i << 24) | (j << 16) | k | 0x8000; in memset64_selftest()
151 for (j = 0; j < strlen(test_string) + 2; j++) { in strnchr_selftest()
191 test = 2; in string_selftest_init()