Lines Matching refs:N
193 const int N = 1e6; in ktest_idr_case2() local
198 for (int i = 0; i < N; i++) in ktest_idr_case2()
222 assert(*ptr == N - 1); in ktest_idr_case2()
229 for (int i = (N)-1; i >= M; i--) in ktest_idr_case2()
232 assert(*ptr == N - 1); in ktest_idr_case2()
238 for (int i = 0; i < N; i++) in ktest_idr_case2()
274 const int N = 1949; in ktest_idr_case3() local
278 for (int i = 0; i < N; i++) in ktest_idr_case3()
289 for (int i = 1; i <= N; i++) in ktest_idr_case3()
293 if (likely(i < N)) in ktest_idr_case3()
296 assert(*ptr == N - 1); in ktest_idr_case3()
306 int sz = N; in ktest_idr_case3()
308 for (int i = N / 3, j = 2 * (N / 3), k = 0; i <= j; k++, i++) in ktest_idr_case3()
312 assert(*ptr == N - 1); in ktest_idr_case3()
321 for (int i = 1; i <= N; i++) in ktest_idr_case3()
325 if (likely(i < N)) in ktest_idr_case3()
327 int target = i < N / 3 ? i : max(i, 2 * (N / 3) + 1); in ktest_idr_case3()
329 assert(*ptr == N - 1); in ktest_idr_case3()
358 const int N = 91173; in ktest_idr_case4() local
363 int M = N / i, T = M / 3, b = 2 * T; in ktest_idr_case4()
416 const int N = 128; in ktest_idr_case5() local
417 int a[N]; in ktest_idr_case5()
420 for (int i = 0; i < N; i++) in ktest_idr_case5()
427 for (int i = 0; i < N; i++) in ktest_idr_case5()
430 int flags = idr_replace_get_old(&k_idr, &a[(i + 1) % N], i, (void *)&ptr); in ktest_idr_case5()
438 assert(*ptr == (i + 1) % N); in ktest_idr_case5()
447 for (int i = 0; i < N; i++) in ktest_idr_case5()
480 const int N = IDA_FULL * IDR_SIZE + 1; in ktest_idr_case6() local
482 for (int i = 0; i < N; i++) in ktest_idr_case6()
492 for (int i = 0; i < N; i++) in ktest_idr_case6()
498 for (int i = N - 1; i >= 0; i--) in ktest_idr_case6()
508 for (int i = 0; i < N; i++) in ktest_idr_case6()
530 for (int i = 0; i < N; i++) in ktest_idr_case6()
540 for (int i = 0; i < N / 3; i++) in ktest_idr_case6()
548 for (int i = 2 * N / 3; i < N; i++) in ktest_idr_case6()