Searched refs:NUM_TASKS (Results 1 – 12 of 12) sorted by relevance
11 int start_tid[NUM_TASKS]; in test_omp_taskyield()12 int current_tid[NUM_TASKS]; in test_omp_taskyield()14 for (i=0; i< NUM_TASKS; i++) { in test_omp_taskyield()23 for (i = 0; i < NUM_TASKS; i++) { in test_omp_taskyield()38 for (i=0;i<NUM_TASKS; i++) { in test_omp_taskyield()44 return (count<NUM_TASKS); in test_omp_taskyield()
15 int array[NUM_TASKS]; in test_omp_taskwait()19 for (i = 0; i < NUM_TASKS; i++) in test_omp_taskwait()26 for (i = 0; i < NUM_TASKS; i++) { in test_omp_taskwait()42 for (i = 0; i < NUM_TASKS; i++) in test_omp_taskwait()48 for (i = 0; i < NUM_TASKS; i++) { in test_omp_taskwait()60 for (i = 0; i < NUM_TASKS; i++) { in test_omp_taskwait()
25 #define NUM_TASKS 2000 macro39 for (i = 0; i < NUM_TASKS; i++) { in main()49 failed = throttling ? enqueued == NUM_TASKS : enqueued < NUM_TASKS; in main()
9 int tids[NUM_TASKS]; in test_omp_task_final()10 int includedtids[NUM_TASKS]; in test_omp_task_final()17 for (i = 0; i < NUM_TASKS; i++) { in test_omp_task_final()45 for (i = 10; i < NUM_TASKS; i++) { in test_omp_task_final()
9 int tids[NUM_TASKS]; in test_omp_task()16 for (i = 0; i < NUM_TASKS; i++) { in test_omp_task()34 for (i = 1; i < NUM_TASKS; i++) { in test_omp_task()
17 for (k = 0; k < NUM_TASKS; k++) { in test_omp_task_imp_shared()27 return ((result == NUM_TASKS)); in test_omp_task_imp_shared()
17 for (k = 0; k < NUM_TASKS; k++) { in test_omp_task_imp_firstprivate()24 for(j = 0; j < NUM_TASKS; j++) in test_omp_task_imp_firstprivate()
19 for (i = 0; i < NUM_TASKS; i++) { in test_omp_task_firstprivate()
20 for (i = 0; i < NUM_TASKS; i++) { in test_omp_task_private()
14 #pragma omp parallel for schedule(static) num_threads(NUM_TASKS) in test_omp_init_lock()
20 #define NUM_TASKS 25 macro
403 2.9.2 num-tasks-clause -> NUM_TASKS (scalar-int-expr)