filename stringlengths 19 182 | omp_pragma_line stringlengths 24 416 | context_chars int64 100 100 | text stringlengths 152 177k |
|---|---|---|---|
openwall/john/src/DES_bs.c | #pragma omp parallel for if(n >= 96) default(none) private(value, mask, bit, b, depth, t) shared(n, DES_bs_all_p, retval, binary) | 100 | (DES_BS_DEPTH - 1)) / DES_BS_DEPTH;
#endif
int retval = 0;
#if defined(_OPENMP) && DES_BS_VECTOR
<LOOP-START>#elif defined(_OPENMP)
#pragma omp parallel for if(n >= 96) default(none) private(value, mask, bit, b, t) shared(n, DES_bs_all_p, retval, binary)
for_each_t(n)
for_each_depth() {
value = binary[0];
b =... |
openwall/john/src/DES_bs.c | #pragma omp parallel for if(n >= 96) default(none) private(value, mask, bit, b, t) shared(n, DES_bs_all_p, retval, binary) | 100 | ivate(value, mask, bit, b, depth, t) shared(n, DES_bs_all_p, retval, binary)
#elif defined(_OPENMP)
<LOOP-START>for_each_t(n)
for_each_depth() {
value = binary[0];
b = (DES_bs_vector *)&DES_bs_all.B[0] DEPTH;
mask = b[0] START ^ -(value & 1);
mask |= b[1] START ^ -((value >> 1) & 1);
mask |= b[2] START ^ -(... |
openwall/john/src/mscash1_fmt_plug.c | #pragma omp parallel for default(none) private(i) shared(count, ms_buffer1x, crypt_out, last) | 100 | output1x[4*index+3] & PH_MASK_6; }
static void nt_hash(int count)
{
int i;
#if defined(_OPENMP)
<LOOP-START>for (i = 0; i < count; i++) {
unsigned int a;
unsigned int b;
unsigned int c;
unsigned int d;
/* Round 1 */
a = 0xFFFFFFFF + ms_buffer1x[16*i+0];a = (a << 3 ) | (a >> 29);
d = INIT_D + (I... |
openwall/john/src/mscash1_fmt_plug.c | #pragma omp parallel for default(none) private(i) shared(count, last, crypt_out, salt_buffer, output1x) | 100 | count = *pcount;
int i;
if (new_key)
{
new_key=0;
nt_hash(count);
}
#if defined(_OPENMP)
<LOOP-START>for (i = 0; i < count; i++) {
unsigned int a;
unsigned int b;
unsigned int c;
unsigned int d;
a = last[4*i+0];
b = last[4*i+1];
c = last[4*i+2];
d = last[4*i+3];
a += (d ^ (b & (c ^ d))) ... |
openwall/john/src/has160_fmt_plug.c | #pragma omp parallel for | 100 | ypt_all(int *pcount, struct db_salt *salt)
{
const int count = *pcount;
int index;
#ifdef _OPENMP
<LOOP-START>for (index = 0; index < count; index++) {
has160_ctx ctx;
rhash_has160_init(&ctx);
rhash_has160_update(&ctx, (unsigned char*)saved_key[index], saved_len[index]);
rhash_has160_final(&ctx, (unsigned ch... |
openwall/john/src/mongodb_fmt_plug.c | #pragma omp parallel for | 100 | pt_all(int *pcount, struct db_salt *salt)
{
const int count = *pcount;
int index;
#ifdef _OPENMP
<LOOP-START>for (index = 0; index < count; index++) {
if (cur_salt->type == 0) {
MD5_CTX ctx;
MD5_Init(&ctx);
MD5_Update(&ctx, cur_salt->username, strlen((char*)cur_salt->username));
MD5_Update(&ctx, ":mong... |
openwall/john/src/tacacs_plus_fmt_plug.c | #pragma omp parallel for | 100 | ndex;
if (any_cracked) {
memset(cracked, 0, cracked_size);
any_cracked = 0;
}
#ifdef _OPENMP
<LOOP-START>for (index = 0; index < count; index++) {
if (check_password(index, cur_salt)) {
cracked[index] = 1;
#ifdef _OPENMP
#pragma omp atomic
any_cracked |= 1;
}
}<LOOP-END> <OMP-START>#pragma omp parall... |
openwall/john/src/mysql_netauth_fmt_plug.c | #pragma omp parallel for | 100 | pt_all(int *pcount, struct db_salt *salt)
{
const int count = *pcount;
int index;
#ifdef _OPENMP
<LOOP-START>for (index = 0; index < count; index++) {
unsigned char stage1_hash[20];
unsigned char inner_hash[20];
unsigned char token[20];
SHA_CTX ctx;
int i;
unsigned char *p = (unsigned char*)crypt_out[ind... |
openwall/john/src/scrypt_fmt.c | #pragma omp parallel for default(none) private(index) shared(count, failed, max_threads, local, saved_salt, buffer) | 100 | *pcount, struct db_salt *salt)
{
int count = *pcount;
int index;
int failed = 0;
#ifdef _OPENMP
<LOOP-START>for (index = 0; index < count; index++) {
#ifdef _OPENMP
int t = omp_get_thread_num();
if (t >= max_threads) {
failed = -1;
continue;
}
#else
const int t = 0;
uint8_t *hash;
hash = yescrypt... |
openwall/john/src/XSHA512_fmt_plug.c | #pragma omp parallel for default(none) private(index) shared(count, ctx_salt, saved_key, saved_len, crypt_out) | 100 | nt count = *pcount;
int index;
#ifdef _OPENMP
#ifndef SIMD_COEF_64
#ifdef PRECOMPUTE_CTX_FOR_SALT
<LOOP-START>#else
#pragma omp parallel for default(none) private(index) shared(count, saved_salt, saved_key, saved_len, crypt_out)
#else
#pragma omp parallel for
for (index = 0; index < count; index += MIN_KEYS_PER_C... |
openwall/john/src/XSHA512_fmt_plug.c | #pragma omp parallel for default(none) private(index) shared(count, saved_salt, saved_key, saved_len, crypt_out) | 100 | lel for default(none) private(index) shared(count, ctx_salt, saved_key, saved_len, crypt_out)
#else
<LOOP-START>#else
#pragma omp parallel for
for (index = 0; index < count; index += MIN_KEYS_PER_CRYPT) {
#ifdef SIMD_COEF_64
SIMDSHA512body(&saved_key[index/MIN_KEYS_PER_CRYPT], &crypt_out[HASH_IDX], NULL, SSEi_MIXE... |
openwall/john/src/XSHA512_fmt_plug.c | #pragma omp parallel for | 100 | efault(none) private(index) shared(count, saved_salt, saved_key, saved_len, crypt_out)
#endif
#else
<LOOP-START>for (index = 0; index < count; index += MIN_KEYS_PER_CRYPT) {
#ifdef SIMD_COEF_64
SIMDSHA512body(&saved_key[index/MIN_KEYS_PER_CRYPT], &crypt_out[HASH_IDX], NULL, SSEi_MIXED_IN);
#else
SHA512_CTX ctx;
#if... |
openwall/john/src/pbkdf2_hmac_sha256_fmt_plug.c | #pragma omp parallel for | 100 | pt_all(int *pcount, struct db_salt *salt)
{
const int count = *pcount;
int index;
#ifdef _OPENMP
<LOOP-START>for (index = 0; index < count; index += MIN_KEYS_PER_CRYPT) {
#ifdef SSE_GROUP_SZ_SHA256
int lens[SSE_GROUP_SZ_SHA256], i;
unsigned char *pin[SSE_GROUP_SZ_SHA256];
union {
uint32_t *pout[SSE_GROUP_SZ... |
openwall/john/src/sm3_fmt_plug.c | #pragma omp parallel for | 100 | t crypt_all(int *pcount, struct db_salt *salt)
{
int count = *pcount;
int index;
#ifdef _OPENMP
<LOOP-START>for (index = 0; index < count; index++) {
sm3_ctx ctx;
sm3_init(&ctx);
sm3_update(&ctx, (unsigned char *)saved_key[index], strlen(saved_key[index]));
sm3_final(&ctx, (unsigned char *)crypt_out[index]... |
openwall/john/src/yescrypt/yescrypt-opt.c | #pragma omp parallel for default(none) private(i) shared(B, r, N, p, t, flags, V, NROM, VROM, XY, S) | 100 |
smix(B, r, N, p, t, flags, V, NROM, VROM, XY, S, sha256);
} else {
uint32_t i;
#ifdef _OPENMP
<LOOP-START>for (i = 0; i < p; i++) {
#ifdef _OPENMP
smix(&B[(size_t)128 * r * i], r, N, 1, t, flags,
&V[(size_t)2 * r * i * N],
NROM, VROM,
&XY[(size_t)4 * r * i], NULL, NULL);
#else
smix(&B[(... |
openwall/john/src/yescrypt/userom.c | #pragma omp parallel for default(none) private(i) shared(n, shared, thread_data, setting, seed, count, save, nsave, key) | 100 | );
}
}
start = times(&start_tms);
n = count * omp_get_max_threads();
count = 0;
do {
<LOOP-START>for (i = 0; i < n; i++) {
unsigned int j = count + i;
char p[32];
uint8_t hash[128];
snprintf(p, sizeof(p), "%u", seed + j);
thread_data_s *td = &thread_data[omp_get_thread_num()].s;
u... |
openwall/php_mt_seed/php_mt_seed.c | #pragma omp parallel for default(none) private(base) shared(match, flavor, start, end, found, seed_and_0x80000000, seed_shr_30, vvalue) | 100 | ;
seed_shr_30 = seed >> 30;
#endif
}
#ifdef _OPENMP
#if defined(__SSE4_1__) || defined(__MIC__)
<LOOP-START>#elif defined(__SSE2__)
#pragma omp parallel for default(none) private(base) shared(match, flavor, start, end, found, seed_and_0x80000000, seed_shr_30)
#else
#pragma omp parallel for default(none) private(bas... |
openwall/php_mt_seed/php_mt_seed.c | #pragma omp parallel for default(none) private(base) shared(match, flavor, start, end, found, seed_and_0x80000000, seed_shr_30) | 100 | match, flavor, start, end, found, seed_and_0x80000000, seed_shr_30, vvalue)
#elif defined(__SSE2__)
<LOOP-START>#else
#pragma omp parallel for default(none) private(base) shared(match, flavor, start, end, found, seed_and_0x80000000, seed_shr_30)
for (base = start; base < end; base++) {
uint32_t seed = (uint32_t)ba... |
openwall/php_mt_seed/php_mt_seed.c | #pragma omp parallel for default(none) private(base) shared(match, flavor, start, end, found, seed_and_0x80000000, seed_shr_30) | 100 | one) private(base) shared(match, flavor, start, end, found, seed_and_0x80000000, seed_shr_30)
#else
<LOOP-START>for (base = start; base < end; base++) {
uint32_t seed = (uint32_t)base << P;
#if defined(__SSE2__) || defined(__MIC__)
typedef struct {
vtype a, b, c, d, e, f, g, h;
} atype;
atype xM, x = {}, x71... |
LorienLV/genarchbench/benchmarks/kmer-cnt/parallel.h | #pragma omp parallel for | 100 | obId(0);
ProgressPercent progress(scheduledTasks.size());
if (progressBar) progress.advance(0);
<LOOP-START>for (size_t i = 0; i < std::min(maxThreads, scheduledTasks.size()); ++i)
{
bool finished = false;
while (!finished)
{
size_t expected = 0;
while(true)
{
expected = jobId;
if (jobId == ... |
LorienLV/genarchbench/benchmarks/fmi/bwa-mem2/x86_64/src/FMI_search.cpp | #pragma omp parallel for num_threads(nthreads) | 100 | ries(int64_t *posArray, int64_t *coordArray, uint32_t count, int32_t nthreads)
{
uint32_t i;
// <LOOP-START>for(i = 0; i < count; i++)
{
int64_t pos = posArray[i];
int64_t sa_entry = sa_ms_byte[pos];
sa_entry = sa_entry << 32;
sa_entry = sa_entry + sa_ls_word[pos];
//_mm_... |
LorienLV/genarchbench/benchmarks/fmi/bwa-mem2/sve/src/FMI_search.cpp | #pragma omp parallel for num_threads(nthreads) | 100 | ries(int64_t *posArray, int64_t *coordArray, uint32_t count, int32_t nthreads)
{
uint32_t i;
// <LOOP-START>for(i = 0; i < count; i++)
{
int64_t pos = posArray[i];
int64_t sa_entry = sa_ms_byte[pos];
sa_entry = sa_entry << 32;
sa_entry = sa_entry + sa_ls_word[pos];
//_mm_... |
Dragon1573/Parallel-GMM/Parallel-GMM/OpenMP/clustering.h | #pragma omp parallel for num_threads(threads) reduction(+: distance) | 100 | ce = 0;
int i = 0;
#pragma warning(disable: 6993)
/* 你Code Analysis无法分析那就别分析啊，警告无法分析是什么鬼 */
<LOOP-START>for (i = 0; i < dimensions; i++) {
distance += pow(datasets[sampleId * dimensions + i]
- centers[clusterId * dimensions + i], 2
);
}<LOOP-END> <OMP-START>#pragma omp parallel f... |
Dragon1573/Parallel-GMM/Parallel-GMM/OpenMP/clustering.h | #pragma omp parallel for num_threads(threads) | 100 | 新成本*/
costs[0] = costs[1];
costs[1] = 0;
/* 聚类预测 */
int j = 0;
<LOOP-START>for (j = 0; j < dataSize; j++) {
// 累计成本
costs[1] += getCost(j);
// 类簇计数器自增
#pragma warning(disable: 6011)
sampleCounts[labels[j]] += 1;
// ... |
Dragon1573/Parallel-GMM/Parallel-GMM/OpenMP/clustering.h | #pragma omp parallel for num_threads(threads) | 100 | uble));
memset(overallMeans, 0, dimensions * sizeof(double));
/* 并行遍历数据集 */
int i = 0;
<LOOP-START>for (i = 0; i < dataSize; i++) {
// 将当前样本分配至相应的聚类集合
counts[labels[i]] += 1;
for (int j = 0; j < dimensions; j++) {
// 当前特征的偏离
const double axes = datasets[i * ... |
Dragon1573/Parallel-GMM/Parallel-GMM/OpenMP/clustering.h | #pragma omp parallel for num_threads(threads) | 100 | 存器 */
costs[0] = costs[1];
costs[1] = 0;
/* 模型调优 */
int j = 0;
<LOOP-START>for (j = 0; j < dataSize; j++) {
// 样本概率
probabilities[j] = 0;
// 遍历分布
for (int k = 0; k < clusters; k++) {
// 样本属于此分布的概率
double... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.2/ordered/test_ordered_doacross_omp_cur_iteration.c | #pragma omp parallel for ordered | 100 | int ordered_doacross(){
int a[N];
int b[N];
int c[N];
a[0] = 0;
b[0] = 0;
c[0] = 0;
<LOOP-START>for(int i = 1; i < N; i++){
a[i] = i;
#pragma omp ordered doacross(sink: i-1)
b[i] = a[i-1];
#pragma omp ordered doacross(source:omp_cur_iteration)
c[i] = a[i] + b[i];
}<LOOP-END> <OMP-S... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.2/ordered/test_ordered_doacross.c | #pragma omp parallel for ordered | 100 | int ordered_doacross(){
int a[N];
int b[N];
int c[N];
a[0] = 0;
b[0] = 0;
c[0] = 0;
<LOOP-START>for(int i = 1; i < N; i++){
a[i] = i;
#pragma omp ordered doacross(sink: i-1)
b[i] = a[i-1];
#pragma omp ordered doacross(source:)
c[i] = a[i] + b[i];
}<LOOP-END> <OMP-START>#pragma omp ... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.2/runtime_calls/test_omp_in_explicit_task.c | #pragma omp parallel for | 100 | en called inside an explicit task");
for(int i = 0; i < N; i++){
A[i] = 1;
<LOOP-START>for(int i = 0; i < N; i++){
A[i] = omp_in_explicit_task();
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/4.5/application_kernels/gemv_target_many_matrices.cpp | #pragma omp parallel for | 100 | out.push_back(allocate<float>(N));
}
// Doing the computation
{
Timer local("GEMV");
<LOOP-START>for(int i=0; i < NUM_CALC; i++) {
gemv(N, 1.0f, manyA[i], manyV[i], manyVout[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/4.5/application_kernels/gemv_target_reduction.cpp | #pragma omp parallel for reduction(+:sum) | 100 | :Vout[:n])
for(int row=0; row<n; row++)
{
T sum = T(0);
const T * A_row = A+row*n;
<LOOP-START>for(int col=0; col<n; col++) {
sum += A_row[col]*V[col];
}<LOOP-END> <OMP-START>#pragma omp parallel for reduction(+:sum)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/4.5/task/test_task_target.c | #pragma omp parallel for | 100 | , c[N];
int errors = 0, i;
#pragma omp task shared(a) private(i)
#pragma omp target map(from: a)
<LOOP-START>for (i = 0; i < N; i++)
a[i] = i;
#pragma omp task shared(b) private(i)
#pragma omp target map(from: b)
#pragma omp parallel for
for (i = 0; i < N; i++)
b[i] = 10;
#pragma omp taskwait
#pragma... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/4.5/task/test_task_target.c | #pragma omp parallel for | 100 | i < N; i++)
a[i] = i;
#pragma omp task shared(b) private(i)
#pragma omp target map(from: b)
<LOOP-START>for (i = 0; i < N; i++)
b[i] = 10;
#pragma omp taskwait
#pragma omp task shared(c) private(i)
#pragma omp target map(from: c) map(to:a,b)
#pragma omp parallel for
for (i = 0; i < N; i++)
c[i] = a[... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/4.5/task/test_task_target.c | #pragma omp parallel for | 100 | gma omp taskwait
#pragma omp task shared(c) private(i)
#pragma omp target map(from: c) map(to:a,b)
<LOOP-START>for (i = 0; i < N; i++)
c[i] = a[i] + b[i];
#pragma omp taskwait
for (i = 0; i < N; i++) {
OMPVV_TEST_AND_SET(errors, (c[i] != i + 10));
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/4.5/target_teams_distribute_parallel_for/test_target_teams_distribute_parallel_for_if_parallel_modifier.c | #pragma omp parallel for num_threads(OMPVV_NUM_THREADS_DEVICE) | 100 | READS_DEVICE)
for (i = 0; i < N; i++) {
init_num_threads_dev[i] = omp_get_num_threads();
}
<LOOP-START>for (i = 0; i < N; i++) {
init_num_threads_host[i] = omp_get_num_threads();
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(OMPVV_NUM_THREADS_DEVICE)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/4.5/target_teams_distribute_parallel_for/test_target_teams_distribute_parallel_for_if_no_modifier.c | #pragma omp parallel for num_threads(OMPVV_NUM_THREADS_DEVICE) | 100 | READS_DEVICE)
for (i = 0; i < N; i++) {
init_num_threads_dev[i] = omp_get_num_threads();
}
<LOOP-START>for (i = 0; i < N; i++) {
init_num_threads_host[i] = omp_get_num_threads();
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(OMPVV_NUM_THREADS_DEVICE)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/requires/test_requires_dynamic_allocators.c | #pragma omp parallel for simd simdlen(16) aligned(x: 64) | 100 | = omp_init_allocator(x_memspace, 1, x_traits);
x = (int *) omp_alloc(N*sizeof(int), x_alloc);
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(16) aligned(x: 64)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/atomic/test_atomic_hint.c | #pragma omp parallel for num_threads(OMPVV_NUM_THREADS_HOST) default(shared) | 100 | int errors = 0, num_threads = -1;
int a[N];
for (int i = 0; i < N; i++) {
a[i] = 1;
}
<LOOP-START>for (int i = 0; i < N; i++) {
if (i == 0) {
num_threads = omp_get_num_threads();
#pragma omp atomic hint(omp_sync_hint_speculative)
a[1] += 1;
}
#pragma omp atomic hint(omp_sync_hint_specu... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/taskwait/test_taskwait_depend.c | #pragma omp parallel for | 100 | .h"
#define N 1024
int errors = 0;
int test_wrapper() { //wrapper for taskwait depend function
<LOOP-START>for (int i=1; i<N; i++){
int x,y,err = 0;
#pragma omp task depend(inout: x) shared(x) // 1st Task
x=i;
#pragma omp task depend(inout: y) shared(y) // 2nd Task
... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/declare_target/test_declare_target_parallel_for.c | #pragma omp parallel for num_threads(OMPVV_NUM_THREADS_DEVICE) shared(num_threads) | 100 | gma omp declare target
int parallel_for_fun(int a[N], int b[N], int c[N]) {
int num_threads = -1;
<LOOP-START>for (int i = 0; i < N; i++) {
a[i] = b[i]*c[i];
if (omp_get_thread_num() == 0) {
num_threads = omp_get_num_threads();
}
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(OMPVV_NU... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/declare_target/test_declare_target_nested.c | #pragma omp parallel for | 100 | lare target
int test_target() { //function in declare target statement
//change values on device
<LOOP-START>for (i = 0; i < N; i++) {
a[i] = 5;
b[i] = 10;
c[i] = 15;
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/task/test_parallel_for_reduction_task_device.c | #pragma omp parallel for reduction(task, +: sum) num_threads(OMPVV_NUM_THREADS_DEVICE) shared(y, z, num_threads) | 100 | y[i] = i + 1;
z[i] = 2*(i + 1);
}
#pragma omp target map(tofrom: sum, y, z, num_threads)
{
<LOOP-START>for (int i = 0; i < N; i++) {
#pragma omp task in_reduction(+: sum)
sum += y[i]*z[i];
if (omp_get_thread_num() == 0) {
num_threads = omp_get_num_threads();
}
}<LOOP-END> <OMP-STA... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/task/test_parallel_for_reduction_task.c | #pragma omp parallel for reduction(task, +: sum) num_threads(OMPVV_NUM_THREADS_HOST) shared(y, z, num_threads) | 100 | int expected_sum = 0;
for (int i = 0; i < N; i++) {
y[i] = i + 1;
z[i] = 2*(i + 1);
}
<LOOP-START>for (int i = 0; i < N; i++) {
#pragma omp task in_reduction(+: sum)
sum += y[i]*z[i];
if (omp_get_thread_num() == 0) {
num_threads = omp_get_num_threads();
}
}<LOOP-END> <OMP-START>#pragma... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/parallel_for_simd/test_parallel_for_simd_atomic.c | #pragma omp parallel for simd shared(x) num_threads(OMPVV_NUM_THREADS_HOST) | 100 | lel_for_simd_atomic() {
OMPVV_INFOMSG("test_parallel_for_simd_atomic");
int errors = 0, x = 0;
<LOOP-START>for (int i = 0; i < N; i++) {
#pragma omp atomic update
x += 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd shared(x) num_threads(OMPVV_NUM_THREADS_HOST)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/target/test_target_imperfect_loop.c | #pragma omp parallel for collapse(2) | 100 | 0; j < M; j++){
data2[i][j] = 0;
}
}
#pragma omp target map(tofrom: data1, data2)
{
<LOOP-START>for( int i = 0; i < N; i++){
data1[i] += i;
for(int j = 0; j < M; j++){
data2[i][j] += i + j;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for collapse(2)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/allocate/test_allocate.c | #pragma omp parallel for | 100 | .h"
#define N 1024
int test_allocate() {
int errors = 0;
int x[N];
#pragma omp allocate(x)
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/allocate/test_allocate_allocator.c | #pragma omp parallel for simd simdlen(16) aligned(x, y: 64) | 100 | ERROR_IF(((intptr_t) x) % 64 != 0,
"Condition (intptr_t) x) %% 64 != 0 failed")
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = i;
y[i] = 3*i;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(16) aligned(x, y: 64)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/allocate/test_allocate_on_device.c | #pragma omp parallel for | 100 | llocator(omp_default_mem_alloc)
x = (int *) omp_alloc(N*sizeof(int), omp_default_mem_alloc);
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = 2*i;
}<LOOP-END> <OMP-START>#pragma omp parallel for <OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/scan/test_scan.c | #pragma omp parallel for simd reduction(inscan, +: x) num_threads(OMPVV_NUM_THREADS_HOST) | 100 | ed_x = 0;
int a[N];
int b[N];
for (int i = 0; i < N; i++) {
a[i] = i;
b[i] = 0;
}
<LOOP-START>for (int i = 0; i < N; i++) {
x += a[i];
#pragma omp scan inclusive(x)
b[i] = x;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd reduction(inscan, +: x) num_threads(OMPVV_NUM_THREADS_HOST)<OMP-... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/scan/test_scan.c | #pragma omp parallel for simd reduction(inscan, +: x) num_threads(OMPVV_NUM_THREADS_HOST) | 100 | ed_x = 0;
int a[N];
int b[N];
for (int i = 0; i < N; i++) {
a[i] = i;
b[i] = 0;
}
<LOOP-START>for (int i = 0; i < N; i++) {
b[i] = x;
#pragma omp scan exclusive(x)
x += a[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for simd reduction(inscan, +: x) num_threads(OMPVV_NUM_THREADS_HOST)<OMP-... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/parallel_for/test_parallel_for_notequals.c | #pragma omp parallel for num_threads(OMPVV_NUM_THREADS_HOST) shared(x, y, z) | 100 | t z[N];
for (int i = 0; i < N; i++) {
x[i] = 1;
y[i] = i + 1;
z[i] = 2*(i + 1);
}
<LOOP-START>for (int i = 0; i != N; i++) {
x[i] += y[i]*z[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(OMPVV_NUM_THREADS_HOST) shared(x, y, z)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/parallel_for/test_parallel_for_order_concurrent.c | #pragma omp parallel for order(concurrent) num_threads(OMPVV_NUM_THREADS_HOST) shared(x, y, z) | 100 | t z[N];
for (int i = 0; i < N; i++) {
x[i] = 1;
y[i] = i + 1;
z[i] = 2*(i + 1);
}
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] += y[i]*z[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for order(concurrent) num_threads(OMPVV_NUM_THREADS_HOST) shared(x, y, z)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.0/parallel_for/test_parallel_for_allocate.c | #pragma omp parallel for allocate(x_alloc: x) private(x) shared(result) num_threads(OMPVV_NUM_THREADS_HOST) | 100 | for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
result[i][j] = -1;
}
}
<LOOP-START>for (int i = 0; i < N; i++) {
x = (int *) malloc(N*sizeof(int));
if (x != NULL) {
#pragma omp simd simdlen(16) aligned(x: 64)
for (int j = 0; j < N; j++) {
x[j] = j*i;
}
for ... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/atomic/test_atomic_compare.c | #pragma omp parallel for shared(pmax) | 100 | s max through non-parallel methods
if(arr[i] > smax){
smax = arr[i];
}
}
<LOOP-START>for(int i = 0; i<N; i++){
#pragma omp atomic compare
if(arr[i] > pmax){
pmax = arr[i];
}
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(pmax) <OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/dispatch/test_dispatch.c | #pragma omp parallel for | 100 | t *arr);
#pragma omp declare variant(add_two) match(construct={dispatch})
void add(int *arr){
<LOOP-START>for (int i = 0; i < N; i++){ // Base function adds 1 to array values
arr[i] = arr[i]+1;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/dispatch/test_dispatch_is_device_ptr.c | #pragma omp parallel for | 100 | e device pointer");
return 1;
}
#pragma omp target is_device_ptr(arr)
{
<LOOP-START>for(int i = 0; i < N; i++){
arr[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/dispatch/test_dispatch_device.c | #pragma omp parallel for | 100 | nt *arr);
#pragma omp declare variant(add_dev) match(construct={dispatch})
void add(int *arr){
<LOOP-START>for (int i = 0; i < N; i++){ // Base function adds 1 to array values
arr[i] = arr[i]+1;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/order/test_parallel_for_order_unconstrained.c | #pragma omp parallel for order(unconstrained:concurrent) | 100 | = 0; i < N; i++) {
x[i] = i;
}
OMPVV_TEST_OFFLOADING;
#pragma omp target map(tofrom: x)
{
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = x[i] + 2;
}<LOOP-END> <OMP-START>#pragma omp parallel for order(unconstrained:concurrent)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_calloc_host.c | #pragma omp parallel for | 100 | null");
return (1);
}
int not_init_to_zero = 0;
int not_correct_updated_values = 0;
<LOOP-START>for (int i = 0; i < N; i++) {
if (x[i] != 0) {
#pragma omp atomic write
not_init_to_zero = 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_calloc_host.c | #pragma omp parallel for | 100 | +) {
if (x[i] != 0) {
#pragma omp atomic write
not_init_to_zero = 1;
}
}
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_calloc_host.c | #pragma omp parallel for | 100 | = 1;
}
}
#pragma omp parallel for
for (int i = 0; i < N; i++) {
x[i] = i;
}
<LOOP-START>for (int i = 0; i < N; i++) {
if (x[i] != i) {
#pragma omp atomic write
not_correct_updated_values = 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_target_aligned_calloc.c | #pragma omp parallel for simd simdlen(16) aligned(x: 64) | 100 | ndition ((intptr_t)(x))%%64 != 0 failed. The memory does not seem to be properly aligned.");
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(16) aligned(x: 64)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_target_aligned_calloc.c | #pragma omp parallel for simd simdlen(16) aligned(x: 64) | 100 | imd simdlen(16) aligned(x: 64)
for (int i = 0; i < N; i++) {
x[i] = i;
}
<LOOP-START>for (int i = 0; i < N; i++) {
if (x[i] != i) {
#pragma omp atomic write
not_correct_array_values = 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_omp_target_aligned_alloc_device.c | #pragma omp parallel for simd simdlen(16) aligned(x: 64) | 100 | OMPVV_ERROR_IF(((intptr_t)(x))%64 != 0, " Condition ((intptr_t)(x))%%64 != 0 failed ");
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(16) aligned(x: 64)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_omp_target_aligned_alloc_device.c | #pragma omp parallel for simd simdlen(16) aligned(x: 64) | 100 | imd simdlen(16) aligned(x: 64)
for (int i = 0; i < N; i++) {
x[i] = i;
}
<LOOP-START>for (int i = 0; i < N; i++) {
if (x[i] != i) {
#pragma omp atomic write
not_correct_array_values = 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(... |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_target_calloc.c | #pragma omp parallel for | 100 | s++;
} else {
int not_init_to_zero = 0;
int not_correct_updated_values = 0;
<LOOP-START>for (int i = 0; i < N; i++) {
if (x[i] != 0) {
#pragma omp atomic write
not_init_to_zero = 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_target_calloc.c | #pragma omp parallel for | 100 | 0) {
#pragma omp atomic write
not_init_to_zero = 1;
}
}
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_target_calloc.c | #pragma omp parallel for | 100 | #pragma omp parallel for
for (int i = 0; i < N; i++) {
x[i] = i;
}
<LOOP-START>for (int i = 0; i < N; i++) {
if (x[i] != i) {
#pragma omp atomic write
not_correct_updated_values = 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_omp_aligned_alloc_host.c | #pragma omp parallel for simd simdlen(16) aligned(x: 64) | 100 | _SET_VERBOSE(errors, ((intptr_t)(x))%64 != 0);
int values_did_not_match_expected_changes = 0;
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(16) aligned(x: 64)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_omp_aligned_alloc_host.c | #pragma omp parallel for simd simdlen(16) aligned(x: 64) | 100 | p parallel for simd simdlen(16) aligned(x: 64)
for (int i = 0; i < N; i++) {
x[i] = i;
}
<LOOP-START>for (int i = 0; i < N; i++) {
if (x[i] != i) {
values_did_not_match_expected_changes = 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(16) aligned(x: 64)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_allocate_allocator_align.c | #pragma omp parallel for simd simdlen(16) aligned(x: 64) | 100 | omp allocate(x) allocator(omp_default_mem_alloc) align(64)
#pragma omp target map(from:x[:N])
{
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(16) aligned(x: 64)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_aligned_calloc.c | #pragma omp parallel for simd simdlen(16) aligned(x: 64) | 100 | Condition ((intptr_t)(x))%%64 != 0 failed. The memory does not seem to be properly aligned.");
<LOOP-START>for (int i = 0; i < N; i++) {
x[i] = i;
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(16) aligned(x: 64)<OMP-END> |
OpenMP-Validation-and-Verification/OpenMP_VV/tests/5.1/allocate/test_aligned_calloc.c | #pragma omp parallel for simd simdlen(16) aligned(x: 64) | 100 | el for simd simdlen(16) aligned(x: 64)
for (int i = 0; i < N; i++) {
x[i] = i;
}
<LOOP-START>for (int i = 0; i < N; i++) {
if (x[i] != i) {
#pragma omp atomic write
not_correct_array_values = 1;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for simd simdlen(16) aligne... |
antoniopelusi/lu-solver/OpenMP/lu_for_static.c | #pragma omp parallel for schedule(static) | 100 | DATA_TYPE POLYBENCH_2D(A, N, N, n, n))
{
int i, j, k;
for (k = 0; k < _PB_N; k++)
{
<LOOP-START>for (j = k + 1; j < _PB_N; j++)
A[k][j] = A[k][j] / A[k][k];
#pragma omp parallel for schedule(static)
for (i = k + 1; i < _PB_N; i++)
for (j = k + 1; j < _PB_N; j++)
A[i][j] = A[i... |
antoniopelusi/lu-solver/OpenMP/lu_for_static.c | #pragma omp parallel for schedule(static) | 100 | lel for schedule(static)
for (j = k + 1; j < _PB_N; j++)
A[k][j] = A[k][j] / A[k][k];
<LOOP-START>for (i = k + 1; i < _PB_N; i++)
for (j = k + 1; j < _PB_N; j++)
A[i][j] = A[i][j] - A[i][k] * A[k][j];
}
}
int main(int argc, char **argv)
{
/* Retrieve problem size. */
int n = N;
/* ... |
antoniopelusi/lu-solver/OpenMP/lu_for_dynamic.c | #pragma omp parallel for schedule(dynamic) | 100 | DATA_TYPE POLYBENCH_2D(A, N, N, n, n))
{
int i, j, k;
for (k = 0; k < _PB_N; k++)
{
<LOOP-START>for (j = k + 1; j < _PB_N; j++)
A[k][j] = A[k][j] / A[k][k];
#pragma omp parallel for schedule(dynamic)
for (i = k + 1; i < _PB_N; i++)
for (j = k + 1; j < _PB_N; j++)
A[i][j] = A[... |
antoniopelusi/lu-solver/OpenMP/lu_for_dynamic.c | #pragma omp parallel for schedule(dynamic) | 100 | el for schedule(dynamic)
for (j = k + 1; j < _PB_N; j++)
A[k][j] = A[k][j] / A[k][k];
<LOOP-START>for (i = k + 1; i < _PB_N; i++)
for (j = k + 1; j < _PB_N; j++)
A[i][j] = A[i][j] - A[i][k] * A[k][j];
}
}
int main(int argc, char **argv)
{
/* Retrieve problem size. */
int n = N;
/* ... |
antoniopelusi/lu-solver/OpenMP/lu_wrong_for.c | #pragma omp parallel for | 100 | kernel_lu(int n,
DATA_TYPE POLYBENCH_2D(A, N, N, n, n))
{
int i, j, k;
<LOOP-START>for (k = 0; k < _PB_N; k++)
{
for (j = k + 1; j < _PB_N; j++)
A[k][j] = A[k][j] / A[k][k];
for (i = k + 1; i < _PB_N; i++)
for (j = k + 1; j < _PB_N; j++)
A[i][j] = A[i][j] - A[i... |
antoniopelusi/lu-solver/OpenMP/lu_gpu.c | #pragma omp parallel for | 100 | #pragma omp target data map(tofrom:A)
{
for (k = 0; k < _PB_N; k++)
{
<LOOP-START>for (j = k + 1; j < _PB_N; j++)
A[k][j] = A[k][j] / A[k][k];
#pragma omp parallel for
for (i = k + 1; i < _PB_N; i++)
for (j = k + 1; j < _PB_N; j++)
A[i][j] =... |
antoniopelusi/lu-solver/OpenMP/lu_gpu.c | #pragma omp parallel for | 100 | lel for
for (j = k + 1; j < _PB_N; j++)
A[k][j] = A[k][j] / A[k][k];
<LOOP-START>for (i = k + 1; i < _PB_N; i++)
for (j = k + 1; j < _PB_N; j++)
A[i][j] = A[i][j] - A[i][k] * A[k][j];
}
}
}
}
int main(int argc, char **argv)
{
/* Retrieve problem size. *... |
antoniopelusi/lu-solver/OpenMP/lu_for_guided.c | #pragma omp parallel for schedule(guided) | 100 | DATA_TYPE POLYBENCH_2D(A, N, N, n, n))
{
int i, j, k;
for (k = 0; k < _PB_N; k++)
{
<LOOP-START>for (j = k + 1; j < _PB_N; j++)
A[k][j] = A[k][j] / A[k][k];
#pragma omp parallel for schedule(guided)
for (i = k + 1; i < _PB_N; i++)
for (j = k + 1; j < _PB_N; j++)
A[i][j] = A[i... |
antoniopelusi/lu-solver/OpenMP/lu_for_guided.c | #pragma omp parallel for schedule(guided) | 100 | lel for schedule(guided)
for (j = k + 1; j < _PB_N; j++)
A[k][j] = A[k][j] / A[k][k];
<LOOP-START>for (i = k + 1; i < _PB_N; i++)
for (j = k + 1; j < _PB_N; j++)
A[i][j] = A[i][j] - A[i][k] * A[k][j];
}
}
int main(int argc, char **argv)
{
/* Retrieve problem size. */
int n = N;
/* ... |
hypre-space/hypre/src/multivector/csr_matmultivec.c | #pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE | 100 | --------------------------------------*/
if (alpha == 0.0)
{
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (i = 0; i < num_rows * num_vectors; i++) { y_data[i] *= beta; }<LOOP-END> <OMP-START>#pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/csr_matmultivec.c | #pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE | 100 | alpha;
if (temp != 1.0)
{
if (temp == 0.0)
{
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (i = 0; i < num_rows * num_vectors; i++) { y_data[i] = 0.0; }<LOOP-END> <OMP-START>#pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/csr_matmultivec.c | #pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE | 100 | um_vectors; i++) { y_data[i] = 0.0; }
}
else
{
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (i = 0; i < num_rows * num_vectors; i++) { y_data[i] *= temp; }<LOOP-END> <OMP-START>#pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/csr_matmultivec.c | #pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE | 100 | --------------------------------------*/
if (alpha != 1.0)
{
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (i = 0; i < num_rows * num_vectors; i++)
{
y_data[i] *= alpha;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/csr_matmultivec.c | #pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE | 100 | --------------------------------------*/
if (alpha == 0.0)
{
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (i = 0; i < num_cols * num_vectors; i++) { y_data[i] *= beta; }<LOOP-END> <OMP-START>#pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/csr_matmultivec.c | #pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE | 100 | alpha;
if (temp != 1.0)
{
if (temp == 0.0)
{
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (i = 0; i < num_cols * num_vectors; i++) { y_data[i] = 0.0; }<LOOP-END> <OMP-START>#pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/csr_matmultivec.c | #pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE | 100 | um_vectors; i++) { y_data[i] = 0.0; }
}
else
{
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (i = 0; i < num_cols * num_vectors; i++) { y_data[i] *= temp; }<LOOP-END> <OMP-START>#pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/csr_matmultivec.c | #pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE | 100 | --------------------------------------*/
if (alpha != 1.0)
{
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (i = 0; i < num_cols * num_vectors; i++)
{
y_data[i] *= alpha;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/seq_multivector.c | #pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE | 100 | ectorData(v);
if (v->num_active_vectors == v->num_vectors)
{
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (j = 0; j < v->num_vectors * size; j++) { vector_data[j] = value; }<LOOP-END> <OMP-START>#pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/seq_multivector.c | #pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE | 100 | e_indices[i] * size;
end_offset = start_offset + size;
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (j = start_offset; j < end_offset; j++) { vector_data[j] = value; }<LOOP-END> <OMP-START>#pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/seq_multivector.c | #pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE | 100 | ind[i] * size;
dest = y_data + y_active_ind[i] * size;
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (j = 0; j < size; j++) { dest[j] += alpha * src[j]; }<LOOP-END> <OMP-START>#pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/seq_multivector.c | #pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE | 100 | ve_ind[i] * size;
current_alpha = alpha[ al_active_ind[i] ];
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (j = 0; j < size; j++)
{
dest[j] = current_alpha * src[j];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/seq_multivector.c | #pragma omp parallel for private(k) reduction(+:current_product) HYPRE_SMP_SCHEDULE | 100 | _data + x_active_ind[i] * size;
current_product = 0.0;
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (k = 0; k < size; k++)
{
current_product += x_ptr[k] * hypre_conj(y_ptr[k]);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(k) reduction(+:current_product) HYPRE_SMP... |
hypre-space/hypre/src/multivector/seq_multivector.c | #pragma omp parallel for private(k) reduction(+:current_product) HYPRE_SMP_SCHEDULE | 100 | tr = y_data + y_active_ind[i] * size;
current_product = 0.0;
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (k = 0; k < size; k++)
{
current_product += x_ptr[k] * hypre_conj(y_ptr[k]);
}<LOOP-END> <OMP-START>#pragma omp parallel for private(k) reduction(+:current_product) HYPRE_SMP_SCHEDULE... |
hypre-space/hypre/src/multivector/seq_multivector.c | #pragma omp parallel for private(k) HYPRE_SMP_SCHEDULE | 100 | r = x_data + x_active_ind[0] * size;
current_coef = *rVal++;
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (k = 0; k < size; k++)
{
y_ptr[k] = current_coef * x_ptr[k];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(k) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/seq_multivector.c | #pragma omp parallel for private(k) HYPRE_SMP_SCHEDULE | 100 | data + x_active_ind[i] * size;
current_coef = *rVal++;
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (k = 0; k < size; k++)
{
y_ptr[k] += current_coef * x_ptr[k];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(k) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/multivector/seq_multivector.c | #pragma omp parallel for private(k) HYPRE_SMP_SCHEDULE | 100 | data + x_active_ind[i] * size;
current_coef = *rVal++;
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (k = 0; k < size; k++)
{
y_ptr[k] += current_coef * x_ptr[k];
}<LOOP-END> <OMP-START>#pragma omp parallel for private(k) HYPRE_SMP_SCHEDULE<OMP-END> |
hypre-space/hypre/src/IJ_mv/IJMatrix_parcsr.c | #pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE | 100 | }
if (!hypre_AuxParCSRMatrixNeedAux(aux_matrix))
{
#ifdef HYPRE_USING_OPENMP
<LOOP-START>for (i = 0; i < local_num_rows; i++)
{
hypre_AuxParCSRMatrixIndxDiag(aux_matrix)[i] = hypre_CSRMatrixI(diag)[i];
hypre_AuxParCSRMatrixIndxOffd(aux_matrix)[i] = hypre_CSRMatrix... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.