Searched refs:threads (Results 1 - 25 of 217) sorted by relevance

123456789

/external/linux-tools-perf/util/
H A Dthread_map.c17 struct thread_map *threads; local
28 threads = malloc(sizeof(*threads) + sizeof(pid_t) * items);
29 if (threads != NULL) {
31 threads->map[i] = atoi(namelist[i]->d_name);
32 threads->nr = items;
39 return threads;
44 struct thread_map *threads = malloc(sizeof(*threads) + sizeof(pid_t)); local
46 if (threads !
61 thread_map__delete(struct thread_map *threads) argument
[all...]
H A Devlist.h32 struct thread_map *threads; member in struct:perf_evlist
39 struct thread_map *threads);
41 struct thread_map *threads);
64 struct thread_map *threads)
67 evlist->threads = threads;
62 perf_evlist__set_maps(struct perf_evlist *evlist, struct cpu_map *cpus, struct thread_map *threads) argument
H A Dthread_map.h14 void thread_map__delete(struct thread_map *threads);
/external/valgrind/main/drd/tests/
H A Dlinuxthreads_det.stdout.exp1 NPTL or non-Linux POSIX threads implementation detected.
/external/chromium-trace/trace-viewer/src/
H A Dtimeline_process.js25 this.threads = {};
32 for (var p in this.threads) {
43 for (var tid in this.threads)
44 this.threads[tid].shiftTimestampsForward(amount);
54 if (!this.threads[tid])
55 this.threads[tid] = new TimelineThread(this, tid);
56 return this.threads[tid];
H A Dtimeline_model.js10 * tokens are converted into a hierarchy of processes, threads,
126 for (var tid in process.threads) {
127 var thread = process.threads[tid];
140 for (var tid in process.threads) {
141 var slices = process.threads[tid].slices;
162 * Removes threads from the model that are fully empty.
168 for (var tid in process.threads) {
169 var thread = process.threads[tid];
173 process.threads = threadsToKeep;
182 var threads
[all...]
/external/compiler-rt/lib/tsan/rtl_tests/
H A Dtsan_thread.cc50 pthread_t threads[kAlive] = {}; local
52 if (threads[i % kAlive])
53 pthread_join(threads[i % kAlive], 0);
54 pthread_create(&threads[i % kAlive], 0, thread_alot_func, 0);
57 pthread_join(threads[i], 0);
/external/valgrind/main/coregrind/
H A Dm_threadstate.c43 ThreadState VG_(threads)[VG_N_THREADS];
65 vg_assert(VG_(threads)[tid].tid == tid);
66 return &VG_(threads)[tid];
74 if (VG_(threads)[tid].status == VgTs_Empty) return False;
98 return VG_(threads)[tid].exitreason != VgSrc_None;
108 if (VG_(threads)[tid].status != VgTs_Empty &&
109 VG_(threads)[tid].status != VgTs_Zombie)
115 /* Return the number of threads in VgTs_Runnable state */
122 if (VG_(threads)[tid].status == VgTs_Runnable)
135 if (VG_(threads)[ti
[all...]
/external/kernel-headers/original/asm-mips/
H A Dhardirq.h13 #include <linux/threads.h>
/external/linux-tools-perf/python/
H A Dtwatch.py20 threads = perf.thread_map()
25 evsel.open(cpus = cpus, threads = threads);
26 evlist = perf.evlist(cpus, threads)
/external/webkit/Source/WebCore/workers/
H A DSharedWorker.idl32 module threads {
H A DSharedWorkerContext.idl31 module threads {
/external/chromium/chrome/browser/resources/gpu_internals/
H A Dtimeline_model.js9 * tokens are converted into a hierarchy of processes, threads,
92 this.threads = {};
97 if (!this.threads[tid])
98 this.threads[tid] = new TimelineThread(this, tid);
99 return this.threads[tid];
127 * the TimelineModel as processes, threads, and slices.
205 var threads = this.getAllThreads();
206 for (var tI = 0; tI < threads.length; tI++) {
207 var thread = threads[tI];
218 var threads
[all...]
/external/compiler-rt/lib/tsan/unit_tests/
H A Dtsan_mutex_test.cc99 pthread_t threads[kThreads]; local
101 pthread_create(&threads[i], 0, write_mutex_thread<Mutex>, &data);
103 pthread_join(threads[i], 0);
109 pthread_t threads[kThreads]; local
111 pthread_create(&threads[i], 0, read_mutex_thread<Mutex>, &data);
113 pthread_join(threads[i], 0);
119 pthread_t threads[kThreads]; local
121 pthread_create(&threads[i], 0, write_mutex_thread<SpinMutex>, &data);
123 pthread_join(threads[i], 0);
/external/chromium/base/threading/
H A Dthread_local_storage_unittest.cc71 // threads that set the TLS, while the destructor cleans it up.
72 // After the threads finish, verify that the value is cleaned up.
76 DelegateSimpleThread* threads[kNumThreads]; local
80 // Spawn the threads.
84 threads[index] = new DelegateSimpleThread(thread_delegates[index],
86 threads[index]->Start();
89 // Wait for the threads to finish.
91 threads[index]->Join();
92 delete threads[index];
/external/chromium/chrome/browser/net/
H A Dchrome_net_log_unittest.cc42 // Only triggered once all threads have been created, to make it much less
57 ChromeNetLogTestThread threads[kThreads]; local
60 threads[i].Init(&log);
61 threads[i].Start();
65 threads[i].ReallyStart();
68 threads[i].Join();
/external/valgrind/main/none/tests/
H A Dpth_cvsimple.c65 pthread_t threads[3]; local
67 pthread_create(&threads[0], NULL, watch_count, NULL);
69 pthread_create(&threads[1], NULL, inc_count, NULL);
70 pthread_create(&threads[2], NULL, inc_count, NULL);
73 pthread_join(threads[i], NULL);
77 // inc_count threads could fully run before watch_count begins, and so
H A Dpth_once.c14 * A program spawns multiple threads and each one tries to
20 * exit of the threads using the pthread_join() operation.
57 pthread_t threads[NUM_THREADS]; local
65 if (( rtn = pthread_create(&threads[thread_num],
76 pthread_join(threads[thread_num], NULL);
H A Dthread-exits.stdout.exp2 creating threads...
/external/chromium-trace/trace-viewer/src/tracks/
H A Dtimeline_process_track.js63 // Get a sorted list of threads.
64 var threads = [];
65 for (var tid in this.process.threads)
66 threads.push(this.process.threads[tid]);
67 threads.sort(tracing.TimelineThread.compare);
69 // Create the threads.
70 threads.forEach(function(thread) {
/external/valgrind/main/helgrind/tests/
H A Dtc21_pthonce.c25 * A program spawns multiple threads and each one tries to
31 * exit of the threads using the pthread_join() operation.
43 /* With more than 2 threads, the precise error reports vary between
45 simple and just have 2 threads and so just 1 race. */
53 /* This is a hack: delay threads except the first enough so as to
54 ensure threads[0] gets to the pthread_once call first. This is so
80 pthread_t threads[NUM_THREADS]; local
86 r= pthread_create(&threads[i], NULL, child, &id_arg[i]);
91 pthread_join(threads[i], NULL);
/external/webkit/Source/WebCore/page/
H A DWorkerNavigator.idl29 module threads {
/external/kernel-headers/original/asm-arm/
H A Dhardirq.h5 #include <linux/threads.h>
/external/qemu/distrib/sdl-1.2.15/test/
H A Dtorturethread.c61 SDL_Thread *threads[NUMTHREADS]; local
73 threads[i] = SDL_CreateThread(ThreadFunc, (void *)(uintptr_t)i);
75 if ( threads[i] == NULL ) {
87 SDL_WaitThread(threads[i], NULL);
/external/v8/test/cctest/
H A Dtest-lockers.cc192 static void StartJoinAndDeleteThreads(const i::List<JoinableThread*>& threads) { argument
193 for (int i = 0; i < threads.length(); i++) {
194 threads[i]->Start();
196 for (int i = 0; i < threads.length(); i++) {
197 threads[i]->Join();
199 for (int i = 0; i < threads.length(); i++) {
200 delete threads[i];
205 // Run many threads all locking on the same isolate
212 i::List<JoinableThread*> threads(kNThreads);
215 threads
[all...]

Completed in 496 milliseconds

123456789