Home
last modified time | relevance | path

Searched refs:NUM_TASKS (Results 1 – 20 of 20) sorted by relevance

/external/llvm-project/openmp/runtime/test/tasking/
Domp_taskyield.c11 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()
Domp_taskwait.c15 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()
Domp_fill_taskqueue.c25 #define NUM_TASKS 2000 macro
39 for (i = 0; i < NUM_TASKS; i++) { in main()
49 failed = throttling ? enqueued == NUM_TASKS : enqueued < NUM_TASKS; in main()
Domp_task_final.c9 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()
Domp_task.c9 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()
Domp_task_shared.c17 for (k = 0; k < NUM_TASKS; k++) { in test_omp_task_imp_shared()
27 return ((result == NUM_TASKS)); in test_omp_task_imp_shared()
Domp_task_imp_firstprivate.c17 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()
Domp_task_firstprivate.c19 for (i = 0; i < NUM_TASKS; i++) { in test_omp_task_firstprivate()
Domp_task_private.c20 for (i = 0; i < NUM_TASKS; i++) { in test_omp_task_private()
/external/toolchain-utils/bestflags/
Dgeneration_test.py21 NUM_TASKS = 20 variable
46 testing_tasks = range(NUM_TASKS)
54 permutation = [(t * STRIDE) % NUM_TASKS for t in range(NUM_TASKS)]
/external/ltp/testcases/kernel/sched/eas/
Dsched_cfs_prio.c174 #define NUM_TASKS 4 macro
177 pthread_t tasks[NUM_TASKS]; in run()
181 NUM_TASKS, TEST_TASK_SECONDS); in run()
190 for (i = 0; i < NUM_TASKS; i++) in run()
193 for (i = 0; i < NUM_TASKS; i++) in run()
Deas_two_big_three_small.c107 #define NUM_TASKS 5 macro
111 pthread_t tasks[NUM_TASKS]; in run()
125 for (i = 0; i < NUM_TASKS; i++) in run()
127 for (i = 0; i < NUM_TASKS; i++) in run()
Dsched_prio_3_rr.c140 #define NUM_TASKS 3 macro
147 printf("Running %d RT RR tasks for 10 seconds...\n", NUM_TASKS); in run()
/external/ltp/testcases/kernel/controllers/cpuctl/
Drun_cpuctl_latency_test.sh43 NUM_TASKS=100;
60 for i in $(seq 1 $NUM_TASKS)
146 for i in $(seq 1 $NUM_TASKS)
177 for num in $(seq 1 $NUM_TASKS)
Dcpuctl_testplan.txt139 In the following two testcases we run n(NUM_TASKS set in script) tasks as the
/external/rust/crates/tokio/src/runtime/tests/
Dqueue.rs132 const NUM_TASKS: usize = 1_000_000; in stress2() constant
160 for i in 0..NUM_TASKS { in stress2()
183 assert_eq!(num_pop, NUM_TASKS); in stress2()
Dloom_queue.rs112 const NUM_TASKS: usize = 5; in multi_stealer() constant
135 for _ in 0..NUM_TASKS { in multi_stealer()
160 assert_eq!(n, NUM_TASKS); in multi_stealer()
/external/llvm-project/openmp/runtime/test/lock/
Domp_init_lock.c14 #pragma omp parallel for schedule(static) num_threads(NUM_TASKS) in test_omp_init_lock()
/external/llvm-project/openmp/runtime/test/
Domp_testsuite.h20 #define NUM_TASKS 25 macro
/external/llvm-project/flang/docs/
DOpenMP-4.5-grammar.md403 2.9.2 num-tasks-clause -> NUM_TASKS (scalar-int-expr)