Home
last modified time | relevance | path

Searched refs:NUM_THREADS (Results 1 – 12 of 12) sorted by relevance

/external/mesa3d/src/gallium/tests/unit/
Dpipe_barrier_test.c43 #define NUM_THREADS 10 macro
45 static pipe_thread threads[NUM_THREADS];
47 static int thread_ids[NUM_THREADS];
70 pipe_barrier_init(&barrier, NUM_THREADS); in main()
72 for (i = 0; i < NUM_THREADS; i++) { in main()
77 for (i = 0; i < NUM_THREADS; i++ ) { in main()
/external/valgrind/helgrind/tests/
Dtc21_pthonce.c46 #define NUM_THREADS 2 macro
59 assert(myid >= 0 && myid < NUM_THREADS); in maybe_stall()
80 pthread_t threads[NUM_THREADS]; in main()
82 id_arg = (int *)malloc(NUM_THREADS*sizeof(int)); in main()
85 for (i = 0; i < NUM_THREADS; i++) { in main()
91 for (i = 0; i < NUM_THREADS; i++) { in main()
/external/valgrind/none/tests/
Dpth_once.c31 #define NUM_THREADS 10 macro
57 pthread_t threads[NUM_THREADS]; in main()
59 id_arg = (int *)malloc(NUM_THREADS*sizeof(int)); in main()
61 for (thread_num = 0; thread_num < NUM_THREADS; (thread_num)++) { in main()
75 for (thread_num = 0; thread_num < NUM_THREADS; thread_num++) { in main()
Dpth_cvsimple.c19 #define NUM_THREADS 3 macro
72 for (i = 0; i < NUM_THREADS; i++) { in main()
/external/valgrind/drd/tests/
Dthread_name.c11 #define NUM_THREADS 10 macro
49 pthread_t tid[NUM_THREADS]; in main()
51 pthread_barrier_init(&s_barrier, NULL, NUM_THREADS); in main()
55 for (i = 0; i < NUM_THREADS; i++) in main()
58 for (i = 0; i < NUM_THREADS; i++) in main()
/external/stressapptest/src/
Dfindmask.c50 #define NUM_THREADS 128 // keep this a power of two macro
62 for (mask = num; mask < (1ULL << (NUM_BITS + 1)); mask += NUM_THREADS) { in thread_func()
129 pthread_t threads[NUM_THREADS]; in main()
133 for (i = 0; i < NUM_THREADS; i++) in main()
136 for (i = 0; i < NUM_THREADS; i++) in main()
/external/compiler-rt/test/asan/TestCases/Windows/
Dthread_stress.cc15 const int NUM_THREADS = 8; in main() local
16 HANDLE thr[NUM_THREADS]; in main()
17 for (int i = 0; i < NUM_THREADS; ++i) { in main()
22 for (int i = 0; i < NUM_THREADS; ++i) { in main()
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_attr_init/
D3-1.c24 #define NUM_THREADS 5 macro
34 pthread_t new_threads[NUM_THREADS]; in main()
46 for (i = 0; i < NUM_THREADS; i++) { in main()
/external/guava/guava-tests/benchmark/com/google/common/util/concurrent/
DExecutionListBenchmark.java49 private static final int NUM_THREADS = 10; // make a param? field in ExecutionListBenchmark
167 executorService = new ThreadPoolExecutor(NUM_THREADS,
168 NUM_THREADS,
174 for (int i = 0; i < NUM_THREADS * 10; i++) {
242 listenerLatch = new CountDownLatch(numListeners * NUM_THREADS);
243 for (int j = 0; j < NUM_THREADS; j++) {
264 listenerLatch = new CountDownLatch(numListeners * NUM_THREADS);
266 for (int j = 0; j < NUM_THREADS; j++) {
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_create/
D5-1.c24 #define NUM_THREADS 5 macro
39 for (i = 1; i < NUM_THREADS + 1; i++) { in main()
/external/ltp/testcases/realtime/func/pi-tests/
Dsbrk_mutex.c51 #define NUM_THREADS 50 macro
135 for (t = 0; t < NUM_THREADS; t++) { in main()
/external/ltp/testcases/realtime/
D00_Descriptions.txt141 - Uses NUM_THREADS to walk through an array of malloc'd pthread mutexes.