HomeSort by relevance Sort by last modified time
    Searched refs:num_threads (Results 1 - 25 of 147) sorted by null

1 2 3 4 5 6

  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
tags.h 49 thread_index_t num_threads; member in struct:__gnu_parallel::parallel_tag
55 this->num_threads = 0;
59 * @param num_threads Desired number of threads. */
60 parallel_tag(thread_index_t num_threads)
62 this->num_threads = num_threads;
69 if(num_threads == 0)
72 return num_threads;
76 * @param num_threads Desired number of threads. */
77 inline void set_num_threads(thread_index_t num_threads)
    [all...]
equally_split.h 38 * The resulting sequence s of length num_threads+1 contains the splitting
43 * @param num_threads Number of parts
45 * @returns End of splitter sequence, i. e. @c s+num_threads+1 */
48 equally_split(difference_type n, thread_index_t num_threads, OutputIterator s)
50 difference_type chunk_length = n / num_threads;
51 difference_type num_longer_chunks = n % num_threads;
53 for (thread_index_t i = 0; i < num_threads; ++i)
69 * @param num_threads Number of parts
74 thread_index_t num_threads,
77 difference_type chunk_length = n / num_threads;
    [all...]
omp_loop.h 80 thread_index_t num_threads = local
85 # pragma omp parallel num_threads(num_threads)
89 num_threads = omp_get_num_threads();
90 thread_results = new Result[num_threads];
92 for (thread_index_t i = 0; i < num_threads; ++i)
104 for (thread_index_t i = 0; i < num_threads; ++i)
omp_loop_static.h 80 thread_index_t num_threads = local
85 # pragma omp parallel num_threads(num_threads)
89 num_threads = omp_get_num_threads();
90 thread_results = new Result[num_threads];
92 for (thread_index_t i = 0; i < num_threads; ++i)
103 for (thread_index_t i = 0; i < num_threads; ++i)
par_loop.h 82 thread_index_t num_threads = local
85 # pragma omp parallel num_threads(num_threads)
89 num_threads = omp_get_num_threads();
91 ::operator new(num_threads * sizeof(Result)));
92 constructed = new bool[num_threads];
101 start = equally_split_point(length, num_threads, iam),
102 stop = equally_split_point(length, num_threads, iam + 1);
119 for (thread_index_t i = 0; i < num_threads; ++i)
unique_copy.h 69 thread_index_t num_threads = get_max_threads(); local
71 # pragma omp parallel num_threads(num_threads)
75 num_threads = omp_get_num_threads();
76 borders = new difference_type[num_threads + 2];
77 equally_split(size, num_threads + 1, borders);
78 counter = new difference_type[num_threads + 1];
130 for (int t = 0; t < num_threads; ++t)
137 begin = borders[num_threads];
149 counter[num_threads] = i
    [all...]
quicksort.h 46 * @param num_threads Number of threads that are allowed to work on
57 num_samples, thread_index_t num_threads)
85 parallel_partition(begin, end, pred, num_threads);
96 * @param num_threads Number of threads that are allowed to work on
104 thread_index_t num_threads)
110 if (num_threads <= 1)
123 if ((num_threads % 2) == 1)
124 num_threads_left = num_threads / 2 + 1;
126 num_threads_left = num_threads / 2;
128 pivot_rank = n * num_threads_left / num_threads;
    [all...]
partial_sum.h 83 * @param num_threads Number of threads to use.
102 thread_index_t num_threads =
105 if (num_threads < 2)
117 # pragma omp parallel num_threads(num_threads)
121 num_threads = omp_get_num_threads();
123 borders = new difference_type[num_threads + 2];
126 equally_split(n, num_threads + 1, borders);
131 / ((double)num_threads + __s.partial_sum_dilation)),
132 borderstart = n - num_threads * chunk_length
    [all...]
multiway_mergesort.h 69 thread_index_t num_threads; member in struct:__gnu_parallel::PMWMSSortingData
144 seqs(sd->num_threads);
145 for (thread_index_t s = 0; s < sd->num_threads; s++)
150 std::vector<SortingPlacesIterator> offsets(sd->num_threads);
153 if (iam < sd->num_threads - 1)
157 for (int seq = 0; seq < sd->num_threads; seq++)
160 if (iam < (sd->num_threads - 1))
170 for (thread_index_t seq = 0; seq < sd->num_threads; seq++)
207 sd->samples + (num_samples * sd->num_threads),
212 for (thread_index_t s = 0; s < sd->num_threads; ++s
    [all...]
random_shuffle.h 66 * Dimensions (num_threads + 1) x (num_bins + 1). */
94 int num_threads; member in struct:__gnu_parallel::DRSSorterPU
138 value_type** temporaries = new value_type*[d->num_threads];
164 // Sum up bins, sd->dist[s + 1][d->num_threads] now contains the
168 sd->dist[s + 1] + d->num_threads + 1,
176 global_offset += sd->dist[s + 1][d->num_threads];
182 for (int t = 0; t < d->num_threads + 1; ++t)
184 offset = sd->dist[s + 1][d->num_threads];
197 for (thread_index_t t = 0; t < d->num_threads; ++t)
209 // Last column [d->num_threads] stays unchanged
330 thread_index_t num_threads = omp_get_num_threads(); local
    [all...]
  /external/ceres-solver/internal/ceres/
compressed_row_jacobian_writer.h 57 ScratchEvaluatePreparer* CreateEvaluatePreparers(int num_threads) {
58 return ScratchEvaluatePreparer::Create(*program_, num_threads);
scratch_evaluate_preparer.cc 42 int num_threads) {
43 ScratchEvaluatePreparer* preparers = new ScratchEvaluatePreparer[num_threads];
46 for (int i = 0; i < num_threads; i++) {
block_jacobian_writer.h 61 BlockEvaluatePreparer* CreateEvaluatePreparers(int num_threads);
scratch_evaluate_preparer.h 49 // Create num_threads ScratchEvaluatePreparers.
51 int num_threads);
  /external/chromium_org/third_party/tcmalloc/chromium/src/base/
thread_lister.h 45 int num_threads,
76 int ResumeAllProcessThreads(int num_threads, pid_t *thread_pids);
linuxthreads.cc 252 int proc = -1, marker = -1, num_threads = 0; local
351 sig_num_threads = num_threads;
404 for (i = 0; i < num_threads; i++) {
415 if (num_threads >= max_threads) {
422 pids[num_threads++] = pid;
423 sig_num_threads = num_threads;
433 num_threads--;
434 sig_num_threads = num_threads;
440 num_threads--;
441 sig_num_threads = num_threads;
    [all...]
  /external/chromium_org/third_party/tcmalloc/vendor/src/base/
thread_lister.h 45 int num_threads,
76 int ResumeAllProcessThreads(int num_threads, pid_t *thread_pids);
linuxthreads.cc 252 int proc = -1, marker = -1, num_threads = 0; local
351 sig_num_threads = num_threads;
404 for (i = 0; i < num_threads; i++) {
415 if (num_threads >= max_threads) {
422 pids[num_threads++] = pid;
423 sig_num_threads = num_threads;
433 num_threads--;
434 sig_num_threads = num_threads;
440 num_threads--;
441 sig_num_threads = num_threads;
    [all...]
  /external/valgrind/main/drd/tests/
omp_printf.c 27 int num_threads = 2; local
36 case 't': num_threads = atoi(optarg); break;
47 assert(num_threads > 0);
49 omp_set_num_threads(num_threads);
  /art/runtime/
barrier_test.cc 61 static int32_t num_threads; member in class:art::BarrierTest
64 int32_t BarrierTest::num_threads = 4; member in class:art::BarrierTest
69 ThreadPool thread_pool(num_threads);
74 for (int32_t i = 0; i < num_threads; ++i) {
78 barrier.Increment(self, num_threads);
80 // equal to num_threads.
81 EXPECT_EQ(num_threads, count1);
85 barrier.Increment(self, num_threads);
86 // Count 2 should be equal to num_threads since each thread must have passed the second barrier
88 EXPECT_EQ(num_threads, count2)
    [all...]
  /external/chromium_org/third_party/tcmalloc/chromium/src/tests/
profiler_unittest.cc 35 // the num_threads argument to this program is ingored).
83 fprintf(stderr, "USAGE: %s <iters> [num_threads] [filename]\n", argv[0]);
85 fprintf(stderr, " num_threads: how many concurrent threads.\n");
95 int num_threads = 1; local
98 num_threads = atoi(argv[2]);
113 RunManyThreads(test_other_thread, num_threads);
118 for (; num_threads < 0; ++num_threads) { // -<num_threads> to fork
  /external/chromium_org/third_party/tcmalloc/vendor/src/tests/
profiler_unittest.cc 35 // the num_threads argument to this program is ingored).
83 fprintf(stderr, "USAGE: %s <iters> [num_threads] [filename]\n", argv[0]);
85 fprintf(stderr, " num_threads: how many concurrent threads.\n");
95 int num_threads = 1; local
98 num_threads = atoi(argv[2]);
113 RunManyThreads(test_other_thread, num_threads);
118 for (; num_threads < 0; ++num_threads) { // -<num_threads> to fork
  /external/chromium_org/cc/resources/
image_raster_worker_pool.h 17 ResourceProvider* resource_provider, size_t num_threads) {
19 new ImageRasterWorkerPool(resource_provider, num_threads));
29 size_t num_threads);
  /external/ceres-solver/include/ceres/
covariance.h 210 num_threads(1),
358 int num_threads; member in struct:ceres::Covariance::Options
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
lp_screen.h 52 unsigned num_threads; member in struct:llvmpipe_screen

Completed in 395 milliseconds

1 2 3 4 5 6