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

1 2

  /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...]
balanced_quicksort.h 78 thread_index_t num_threads; member in struct:__gnu_parallel::QSBThreadLocal
95 * @param num_threads Number of threads that are allowed to work on
101 Comparator comp, thread_index_t num_threads)
103 _GLIBCXX_PARALLEL_ASSERT(num_threads > 0);
136 begin, end - 1, pred, num_threads);
159 * @param num_threads
166 thread_index_t iam, thread_index_t num_threads,
175 if (num_threads <= 1 || n <= 1)
186 difference_type split_pos = qsb_divide(begin, end, comp, num_threads);
194 num_threads - 1, split_pos * num_threads / n))
253 thread_index_t num_threads = tl.num_threads; local
    [all...]
search.h 111 thread_index_t num_threads = local
118 # pragma omp parallel num_threads(num_threads)
122 num_threads = omp_get_num_threads();
123 splitters = new difference_type[num_threads + 1];
124 equally_split(input_length, num_threads, splitters);
find.h 117 thread_index_t num_threads = get_max_threads(); local
118 # pragma omp parallel num_threads(num_threads)
122 num_threads = omp_get_num_threads();
123 borders = new difference_type[num_threads + 1];
124 equally_split(length, num_threads, borders);
223 thread_index_t num_threads = get_max_threads(); local
224 # pragma omp parallel shared(result) num_threads(num_threads)
227 num_threads = omp_get_num_threads()
344 thread_index_t num_threads = get_max_threads(); local
    [all...]
workstealing.h 134 thread_index_t num_threads = local
138 # pragma omp parallel shared(busy) num_threads(num_threads)
143 num_threads = omp_get_num_threads();
146 job = new Job<difference_type>[num_threads * stride];
170 // (modulo num_threads).
171 random_number rand_gen(iam, num_threads);
181 static_cast<difference_type>(iam * (length / num_threads));
183 my_job.last = (iam == (num_threads - 1)) ?
184 (length - 1) : ((iam + 1) * (length / num_threads) - 1)
    [all...]
partition.h 51 * @param num_threads Maximum number of threads to use for this task.
56 Predicate pred, thread_index_t num_threads)
81 if(right - left + 1 >= 2 * num_threads * chunk_size)
82 # pragma omp parallel num_threads(num_threads)
86 num_threads = omp_get_num_threads();
87 reserved_left = new bool[num_threads];
88 reserved_right = new bool[num_threads];
93 / (double)num_threads);
98 while (right - left + 1 >= 2 * num_threads * chunk_size
    [all...]
set_operations.h 379 thread_index_t num_threads = local
383 # pragma omp parallel num_threads(num_threads)
387 num_threads = omp_get_num_threads();
389 borders = new difference_type[num_threads + 2];
390 equally_split(size, num_threads + 1, borders);
391 block_begins = new iterator_pair[num_threads + 1];
394 lengths = new difference_type[num_threads];
449 for (int i = 0; i < num_threads; ++i)
452 block_begin = block_begins[num_threads];
    [all...]
multiway_merge.h 1115 int num_threads = omp_get_num_threads(); local
1196 const int num_threads = omp_get_num_threads(); local
    [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);
omp_prime.c 42 int num_threads = 2; local
55 num_threads = atoi(optarg);
76 assert(num_threads >= 1);
81 omp_set_num_threads(num_threads);
  /external/chromium/third_party/libjingle/source/talk/session/phone/
codec.h 142 num_threads(kDefaultMaxThreads),
148 num_threads(kDefaultMaxThreads),
154 num_threads(t),
160 num_threads = config.num_threads;
167 num_threads == config.num_threads &&
176 int num_threads; member in struct:cricket::VideoEncoderConfig
  /external/chromium/base/
observer_list_unittest.cc 274 static void ThreadSafeObserverHarness(int num_threads,
279 num_threads = num_threads > kMaxThreads ? kMaxThreads : num_threads;
293 for (int index = 0; index < num_threads; index++) {
309 for (int index = 0; index < num_threads; index++) {
  /external/chromium/base/threading/
simple_thread.cc 80 int num_threads)
82 num_threads_(num_threads),
simple_thread.h 152 DelegateSimpleThreadPool(const std::string& name_prefix, int num_threads);
  /system/core/toolbox/
top.c 70 int num_threads; member in struct:proc_info
271 proc->num_threads = 0;
308 proc->num_threads++;
480 printf("%5d %2d %3ld%% %c %5d %6ldK %6ldK %3s %-8.8s %s\n", proc->pid, proc->prs, proc->delta_time * 100 / total_delta_time, proc->state, proc->num_threads,
553 return -numcmp(pa->num_threads, pb->num_threads);
  /external/opencv/cv/src/
cvtemplmatch.cpp 52 int k, num_threads = 0; local
134 num_threads = cvGetNumThreads();
136 for( k = 0; k < num_threads; k++ )
151 for( k = 0; k < num_threads; k++ )
193 #pragma omp parallel for num_threads(num_threads) schedule(dynamic)
299 for( k = 0; k < num_threads; k++ )

Completed in 311 milliseconds

1 2