Searched refs:N (Results 1 – 2 of 2) sorted by relevance
193 const int N = 1e6; in ktest_idr_case2() local198 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() local278 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()[all …]
278 const int N = 100; in __test_completion() local279 struct completion *one_to_one = kzalloc(sizeof(struct completion) * N, 0); in __test_completion()281 struct completion *waiter_many_to_one = kzalloc(sizeof(struct completion) * N, 0); in __test_completion()282 struct completion *worker_many_to_one = kzalloc(sizeof(struct completion) * N, 0); in __test_completion()283 struct __test_data *waiter_data = kzalloc(sizeof(struct __test_data) * N, 0); in __test_completion()284 struct __test_data *worker_data = kzalloc(sizeof(struct __test_data) * N, 0); in __test_completion()287 for (int i = 0; i < N; i++) in __test_completion()294 for (int i = 0; i < N; i++) in __test_completion()303 for (int i = 0; i < N; i++) in __test_completion()317 wait_for_multicompletion(waiter_many_to_one, N); in __test_completion()[all …]