Searched refs:threads (Results 1 - 13 of 13) sorted by relevance
/system/extras/tests/bionic/libc/common/ |
H A D | test_pthread_once.c | 65 pthread_t threads[N_THREADS]; local 69 if (pthread_create( &threads[nn], NULL, thread_function, (void*)(long int)nn) < 0) { 76 if (pthread_join(threads[nn], NULL)) {
|
H A D | test_pthread_getcpuclockid.c | 73 pthread_t threads[MAX_THREADS]; local 79 pthread_create( &threads[nn], &attr, thread_func, (void*)nn ); 83 pthread_join( threads[nn], &dummy );
|
/system/core/toolbox/ |
H A D | schedtop.c | 46 struct thread_table threads; variable in typeref:struct:thread_table 103 info = get_item(&threads); 152 commit_item(&threads); 180 for (j = 0; j < threads.active; j++) 181 if (tid == threads.data[j].tid) 183 if (j == threads.active) 185 else if (!(flags & FLAG_HIDE_IDLE) || threads.data[j].run_count - last_threads.data[i].run_count) 187 NS_TO_S_D(threads.data[j].exec_time - last_threads.data[i].exec_time), 188 NS_TO_S_D(threads.data[j].delay_time - last_threads.data[i].delay_time), 189 threads [all...] |
H A D | top.c | 87 static int max_procs, delay, iterations, threads; variable 161 if (!strcmp(argv[i], "-t")) { threads = 1; continue; } 171 if (threads && proc_cmp == &proc_thr_cmp) { 172 fprintf(stderr, "Sorting by threads per thread makes no sense!\n"); 236 new_procs = calloc(INIT_PROCS * (threads ? THREAD_MULT : 1), sizeof(struct proc_info *)); 237 num_new_procs = INIT_PROCS * (threads ? THREAD_MULT : 1); 254 if (!threads) { 289 if (threads) { 313 if (!threads) 458 if (!threads) [all...] |
H A D | ps.c | 107 nexttok(&ptr); // threads 199 int threads = 0; local 206 threads = 1; 233 if(threads) ps_threads(pid, namefilter);
|
/system/media/wilhelm/tests/sandbox/ |
H A D | multithread.c | 17 // Multiple threads create and destroy objects 37 pthread_t threads[MAX_THREAD]; variable 128 // create threads 155 ok = pthread_create(&threads[i], (const pthread_attr_t *) NULL, thread_start, 171 // signal threads that they should exit 183 // now wait for the threads to actually exit 185 ok = pthread_join(threads[i], NULL);
|
/system/core/libcutils/ |
H A D | threads.c | 1 /* libs/cutils/threads.c 17 #include <cutils/threads.h>
|
H A D | Android.mk | 49 threads.c \
|
H A D | properties.c | 75 * threads in the process, so we use a mutex to ensure that requests 76 * from multiple threads don't get interleaved. 256 #include <cutils/threads.h>
|
H A D | hashmap.c | 20 #include <cutils/threads.h>
|
/system/core/adb/ |
H A D | sysdeps_win32.c | 1442 * waiting threads as there are chunks. Then each thread would wait on a chunk of 1453 * accross all the waiting threads, so each waiting thread knows when any 1458 * the original array. This pointer is shared accross all the waiting threads 1460 * waiting threads exit, the value contained here would indicate the first 1484 * sibling threads is exiting. */ 1515 WaitForAllParam* threads; local 1519 /* This variable is going to be accessed by several threads at the same time, 1534 threads = (WaitForAllParam*)malloc((chunks + (remains ? 1 : 0)) * 1536 if (threads == NULL) { 1541 /* Create main event to wait on for all waiting threads [all...] |
/system/media/wilhelm/tests/mimeUri/ |
H A D | slesTestGetPositionUri.cpp | 20 #include <utils/threads.h>
|
/system/media/wilhelm/tests/examples/ |
H A D | slesTestDecodeToBuffQueue.cpp | 44 #include <utils/threads.h>
|
Completed in 288 milliseconds