commit | 72716896e42ce82f9113d69b4c4340383bdd70e3 | [log] [tgz] |
---|---|---|
author | Bob Badour <bbadour@google.com> | Tue Feb 16 18:48:19 2021 +0000 |
committer | Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com> | Tue Feb 16 18:48:19 2021 +0000 |
tree | 0a031ffb45338947eace1b5a83c67c16c196f968 | |
parent | 10f0fc2b24aa83aeb1159c26072b025e3a50857e [diff] | |
parent | ae5409bee61a970d295a3e36d4469b4a146566ef [diff] |
[LSC] Add LOCAL_LICENSE_KINDS to external/pthreadpool am: 3424fb16ee am: ae5409bee6 Original change: https://android-review.googlesource.com/c/platform/external/pthreadpool/+/1589013 MUST ONLY BE SUBMITTED BY AUTOMERGER Change-Id: I16365946f9c2a1b4d6608638914fdc7e403840d7
pthreadpool is a portable and efficient thread pool implementation. It provides similar functionality to #pragma omp parallel for
, but with additional features.
The following example demonstates using the thread pool for parallel addition of two arrays:
static void add_arrays(struct array_addition_context* context, size_t i) { context->sum[i] = context->augend[i] + context->addend[i]; } #define ARRAY_SIZE 4 int main() { double augend[ARRAY_SIZE] = { 1.0, 2.0, 4.0, -5.0 }; double addend[ARRAY_SIZE] = { 0.25, -1.75, 0.0, 0.5 }; double sum[ARRAY_SIZE]; pthreadpool_t threadpool = pthreadpool_create(0); assert(threadpool != NULL); const size_t threads_count = pthreadpool_get_threads_count(threadpool); printf("Created thread pool with %zu threads\n", threads_count); struct array_addition_context context = { augend, addend, sum }; pthreadpool_parallelize_1d(threadpool, (pthreadpool_task_1d_t) add_arrays, (void*) &context, ARRAY_SIZE, PTHREADPOOL_FLAG_DISABLE_DENORMALS /* flags */); pthreadpool_destroy(threadpool); threadpool = NULL; printf("%8s\t%.2lf\t%.2lf\t%.2lf\t%.2lf\n", "Augend", augend[0], augend[1], augend[2], augend[3]); printf("%8s\t%.2lf\t%.2lf\t%.2lf\t%.2lf\n", "Addend", addend[0], addend[1], addend[2], addend[3]); printf("%8s\t%.2lf\t%.2lf\t%.2lf\t%.2lf\n", "Sum", sum[0], sum[1], sum[2], sum[3]); return 0; }