Lines Matching +full:2 +full:k
8 unsigned i, j, k; in memset16_selftest() local
11 p = kmalloc(256 * 2 * 2, GFP_KERNEL); in memset16_selftest()
17 memset(p, 0xa1, 256 * 2 * sizeof(v)); in memset16_selftest()
19 for (k = 0; k < 512; k++) { in memset16_selftest()
20 v = p[k]; in memset16_selftest()
21 if (k < i) { in memset16_selftest()
24 } else if (k < i + j) { in memset16_selftest()
38 return (i << 24) | (j << 16) | k | 0x8000; in memset16_selftest()
44 unsigned i, j, k; in memset32_selftest() local
47 p = kmalloc(256 * 2 * 4, GFP_KERNEL); in memset32_selftest()
53 memset(p, 0xa1, 256 * 2 * sizeof(v)); in memset32_selftest()
55 for (k = 0; k < 512; k++) { in memset32_selftest()
56 v = p[k]; in memset32_selftest()
57 if (k < i) { in memset32_selftest()
60 } else if (k < i + j) { in memset32_selftest()
74 return (i << 24) | (j << 16) | k | 0x8000; in memset32_selftest()
80 unsigned i, j, k; in memset64_selftest() local
83 p = kmalloc(256 * 2 * 8, GFP_KERNEL); in memset64_selftest()
89 memset(p, 0xa1, 256 * 2 * sizeof(v)); in memset64_selftest()
91 for (k = 0; k < 512; k++) { in memset64_selftest()
92 v = p[k]; in memset64_selftest()
93 if (k < i) { in memset64_selftest()
96 } else if (k < i + j) { in memset64_selftest()
110 return (i << 24) | (j << 16) | k | 0x8000; in memset64_selftest()
123 test = 2; in string_selftest_init()