HomeSort by relevance Sort by last modified time
    Searched defs:threads (Results 176 - 200 of 506) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/eigen/Eigen/src/SparseCore/
SparseDenseProduct.h 41 Index threads = Eigen::nbThreads(); local
49 if(threads>1 && lhsEval.nonZerosEstimate() > 20000)
51 #pragma omp parallel for schedule(dynamic,(n+threads*4-1)/(threads*4)) num_threads(threads)
  /external/google-breakpad/src/google_breakpad/processor/
process_state.h 106 const vector<CallStack*>* threads() const { return &threads_; } function in class:google_breakpad::ProcessState
154 // threads vector. If a dump was produced as a result of a crash, this
  /external/google-breakpad/src/testing/test/
gmock_stress_test.cc 33 // threads concurrently.
44 // The maximum number of test threads (not including helper threads)
147 // threads. This should generate no Google Test failure.
172 // Tests invoking methods of the same mock object in multiple threads.
227 // Tests using the same mock object in multiple threads when the
276 // Tests using Google Mock constructs in many threads concurrently.
289 ThreadWithParam<Dummy>* threads[kTestThreads] = {}; local
292 threads[i] =
297 // At this point, we have many threads running
    [all...]
  /external/googletest/googlemock/test/
gmock_stress_test.cc 33 // threads concurrently.
44 // The maximum number of test threads (not including helper threads)
147 // threads. This should generate no Google Test failure.
172 // Tests invoking methods of the same mock object in multiple threads.
227 // Tests using the same mock object in multiple threads when the
276 // Tests using Google Mock constructs in many threads concurrently.
289 ThreadWithParam<Dummy>* threads[kTestThreads] = {}; local
292 threads[i] =
297 // At this point, we have many threads running
    [all...]
  /external/guice/core/test/com/google/inject/
PerformanceComparison.java 180 Thread[] threads = new Thread[threadCount]; local
183 threads[i] = new Thread() {
201 threads[i].start();
206 threads[i].join();
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/
CollationThreadTest.java 229 private void runThreads(Thread[] threads, Control control) {
230 for (int i = 0; i < threads.length; ++i) {
231 threads[i].start();
244 for (int i = 0; i < threads.length; ++i) {
245 threads[i].join();
262 Thread[] threads = new Thread[10]; local
263 for (int i = 0; i < threads.length; ++i) {
274 threads[i] = new Thread(test);
277 runThreads(threads, control);
287 Thread[] threads = new Thread[10] local
    [all...]
  /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
CollationThreadTest.java 226 private void runThreads(Thread[] threads, Control control) {
227 for (int i = 0; i < threads.length; ++i) {
228 threads[i].start();
241 for (int i = 0; i < threads.length; ++i) {
242 threads[i].join();
259 Thread[] threads = new Thread[10]; local
260 for (int i = 0; i < threads.length; ++i) {
271 threads[i] = new Thread(test);
274 runThreads(threads, control);
284 Thread[] threads = new Thread[10] local
    [all...]
  /external/libchrome/base/
observer_list_unittest.cc 186 bool do_notifies_; // Whether these threads should do notifications.
425 // of observer threads, each of which constantly adds/removes itself
427 // to true, the observer threads will also trigger notifications to
447 base::PlatformThreadHandle threads[kMaxThreads]; local
451 threaded_observer[index], &threads[index]));
466 PlatformThread::Join(threads[index]);
471 // Use 7 observer threads. Notifications only come from
477 // Use 3 observer threads. Notifications will fire from
478 // the main thread and all 3 observer threads.
  /external/ltp/testcases/kernel/sched/pthreads/
pth_str03.c 24 * DESCRIPTION : create a tree of threads does calculations, and
51 pthread_t *threads; /* dynamic array of thread id of kids */ member in struct:kid_info
71 pthread_attr_t attr; /* attributes for created threads */
376 pthread_create(&(info_p->threads[child]), &attr,
385 &(info_p->threads[child]));
401 &(info_p->threads[child]));
405 pthread_join((info_p->threads[child]), &status))) {
548 tst_resm(TINFO, "Can't create %d threads; max is %d.",
567 if ((child_info[ind].threads = malloc(breadth * sizeof(pthread_t))) ==
569 perror("malloc threads");
    [all...]
  /external/ltp/testcases/misc/math/float/
main.c 63 to stop creating new threads (signal caught) */
65 int indice = 0; /* # of threads created, to be canceled by handle_signals
69 pthread_t *threads; variable
193 "%s: will run %d functions, %d threads per function",
205 * Start all calculation threads...
207 threads = malloc(nb_func * num_threads * sizeof(pthread_t));
208 if (threads == NULL)
254 retval = pthread_create(&threads[indice], &newattr,
264 /*alarm(60*time); *//* start all threads for TEST_time */
267 * Wait for the threads finish their tas
    [all...]
  /external/ltp/testcases/open_posix_testsuite/functional/threads/pi_test/
pitest-1.c 9 /* There are n TF threads, n is equal to the processors in the system minus
15 * control the running steps of those threads, including creating threads,
16 * stopping threads. There is another thread to collect the sample data with
20 * 1. Create n TF threads, n is equal to processors number minus one. TF
31 * 6. Stop these threads.
236 pthread_t threads[cpus - 1], threadsample, threadtp, threadtl, threadtb; local
260 /* Start the TF threads */
263 rc = pthread_create(&threads[i], &threadattr, thread_fn,
313 /* Stop TF threads */
    [all...]
pitest-2.c 10 /* There are n TF threads, n is equal to the processors in the system minus
17 * those threads, including creating threads, stopping threads. There is
21 * 1. Create n TF threads, n is equal to processors number minus one. TF
23 * 2. Create 2 TP threads(TP1, TP2) and do workload. The 2 threads will
34 * 7. Stop these threads.
261 pthread_t threads[cpus - 1]; local
286 /* Start the TF threads */
    [all...]
pitest-3.c 10 /* There are n TF threads, n is equal to the processors in the system minus
16 * There are another 2 threads TP1 and TP2, which are used to check the
19 * which will control the running steps of those threads, including
20 * creating threads, stopping threads. There is another thread to collect
24 * 1. Create n TF threads, n is equal to processors number minus one. TF
26 * 2. Create 2 TP threads: TP1 and TP2 and do workload. The 2 threads
34 * 6. Stop these threads.
272 pthread_t threads[cpus - 1] local
    [all...]
pitest-4.c 10 /* There are n TF threads, n is equal to the processors in the system minus
20 * which will control the running steps of those threads, including
21 * creating threads, stopping threads. There is another thread to collect
25 * 1. Create n TF threads, n is equal to processors number minus one. TF
27 * 2. Create 1 TP threads and do workload. The thread
35 * 6. Stop these threads.
242 pthread_t threads[cpus - 1]; local
268 /* Start the TF threads */
269 DPRINTF(stderr, "Main Thread: Creating %d TF threads\n", cpus - 1)
    [all...]
pitest-5.c 10 /* There are n TF threads, n is equal to the processors in the system minus
16 * control the running steps of those threads, including creating threads,
17 * stopping threads. There is another thread to collect the sample data
21 * 1. Create n TF threads, n is equal to processors number minus one. TF
32 * 6. Stop these threads.
260 pthread_t threads[cpus - 1], threadsample, threadtp, threadtl, threadtb; local
282 /* Start the TF threads */
283 DPRINTF(stderr, "Main Thread: Creating %d TF threads\n", cpus - 1);
285 rc = pthread_create(&threads[i], &threadattr, thread_fn
    [all...]
pitest-6.c 10 /* There are n TF threads, n is equal to the processors in the system minus
16 * control the running steps of those threads, including creating threads,
17 * stopping threads. There is another thread to collect the sample data with
21 * 1. Create n TF threads, n is equal to processors number minus one. TF
31 * 6. Stop these threads.
235 pthread_t threads[cpus - 1], threadsample, threadtp, threadtl, threadtb; local
259 /* Start the TF threads */
260 DPRINTF(stderr, "Main Thread: Creating %d TF threads\n", cpus - 1);
262 rc = pthread_create(&threads[i], &threadattr, thread_fn
    [all...]
  /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_mutex_lock/
stress.c 21 * -> For each king of mutex, we create 10*F threads (F is a scalability factor)
22 * -> we call those threads 1 to 10.
23 * -> thread 1 sends signal USR2 to the other 9 threads (which have a handler for it)
108 #define N 2 /* N * 10 * 6 * SCALABILITY_FACTOR threads will be created */
123 * for one group of ten threads */
125 pthread_t threads[10]; /* The 10 threads */ member in struct:__anon28621
126 pthread_mutex_t mtx; /* The mutex those threads work on */
128 char sigok; /* Used to tell the threads they can return */
130 int id; /* An identifier for the threads group *
    [all...]
  /external/ltp/utils/benchmark/ebizzy-0.3/
ebizzy.c 68 static unsigned int threads; variable
101 "-t <num>\t Number of threads (2 * number cpus by default)\n"
125 threads = 2 * sysconf(_SC_NPROCESSORS_ONLN);
171 threads = atoi(optarg);
172 if (threads == 0)
204 printf("threads %u\n", threads);
453 pthread_t thread_array[threads];
461 printf("Threads starting\n");
463 for (i = 0; i < threads; i++)
    [all...]
  /external/lzma/C/
MtCoder.h 7 #include "Threads.h"
89 CMtThread threads[NUM_MT_CODER_THREADS_MAX]; member in struct:_CMtCoder
  /external/mesa3d/src/gallium/drivers/llvmpipe/
lp_rast_priv.h 123 /** The scene currently being rasterized by the threads */
130 pipe_thread threads[LP_MAX_THREADS]; member in struct:lp_rasterizer
132 /** For synchronizing the rasterization threads */
  /external/v8/testing/gmock/test/
gmock_stress_test.cc 33 // threads concurrently.
44 // The maximum number of test threads (not including helper threads)
147 // threads. This should generate no Google Test failure.
172 // Tests invoking methods of the same mock object in multiple threads.
227 // Tests using the same mock object in multiple threads when the
276 // Tests using Google Mock constructs in many threads concurrently.
289 ThreadWithParam<Dummy>* threads[kTestThreads] = {}; local
292 threads[i] =
297 // At this point, we have many threads running
    [all...]
  /external/webrtc/webrtc/base/
criticalsection_unittest.cc 79 // Signal all threads to start.
82 // Wait for all threads to finish.
99 // Returns true if all threads have finished.
199 void StartThreads(ScopedPtrCollection<Thread>* threads,
205 threads->PushBack(thread);
246 // Create and start lots of threads.
248 ScopedPtrCollection<Thread> threads; local
249 StartThreads(&threads, &runner);
258 // Create and start lots of threads.
261 ScopedPtrCollection<Thread> threads; local
273 ScopedPtrCollection<Thread> threads; local
285 ScopedPtrCollection<Thread> threads; local
297 ScopedPtrCollection<Thread> threads; local
    [all...]
  /frameworks/base/tests/JankBench/app/src/main/jni/
Bench.cpp 125 int threads = useMT ? 1 : 0; local
128 threads = options & 0x1f;
131 //__android_log_print(ANDROID_LOG_INFO, "bench", "threads %i", threads);
133 mWorkers.launchWork(testWork, this, threads);
  /frameworks/rs/cpu_ref/
rsCpuIntrinsicBlur.cpp 465 uint32_t threads = mCtx->getThreadCount(); local
467 for (size_t i = 0; i < threads; i++) {
  /libcore/jsr166-tests/src/test/java/jsr166/
PhaserTest.java 309 List<Thread> threads = new ArrayList<Thread>(); local
312 threads.add(newStartedThread(new CheckedRunnable() {
318 for (Thread thread : threads)
627 List<Thread> threads = new ArrayList<Thread>();
629 threads.add(newStartedThread(new CheckedRunnable() {
639 for (Thread thread : threads)
651 List<Thread> threads = new ArrayList<Thread>();
655 threads.add(newStartedThread(new CheckedRunnable() {
670 for (Thread thread : threads)
727 final List<Thread> threads = new ArrayList<Thread>()
    [all...]

Completed in 875 milliseconds

1 2 3 4 5 6 78 91011>>