filename
stringlengths 78
241
| omp_pragma_line
stringlengths 24
416
| context_chars
int64 100
100
| text
stringlengths 152
177k
|
|---|---|---|---|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp_mic.c
|
#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)
| 100
|
)
{
#pragma omp for
for (i = 0; i < n; i++) {
sum += data[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp_mic.c
|
#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)
| 100
|
)
{
#pragma omp for
for (i = 0; i < n; i++) {
sum += data[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp_mic.c
|
#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)
| 100
|
)
{
#pragma omp for
for (i = 0; i < n; i++) {
sum += data[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp_mic.c
|
#pragma omp parallel for
| 100
|
c) {
int i;
// int num_t = omp_get _num_threads();
int num_b = size / sizeof(unsigned long);
<LOOP-START>#pragma ivdep
//#pragma vector nontemporal (dst)
for (i = 0; i < num_b; i++) {
// memcpy((unsigned char *) dst+i, (unsigned char *) src+i, size);
*((unsigned long *)dst + i) = *((unsigned long *)src + i);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for
| 100
|
ze);
int i;
// int num_t = omp_get _num_threads();
int num_b = size / sizeof(unsigned long);
<LOOP-START>#pragma ivdep
//#pragma vector nontemporal (dst)
for (i = 0; i < num_b; i++) {
// memcpy((unsigned char *) dst+i, (unsigned char *) src+i, size);
*((unsigned long *)dst + i) = *((unsigned long *)src + i);
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for shared(n, data1, data2) private(i) reduction(+ : sum)
| 100
|
add_pd(
_mm256_add_pd(_mm256_add_pd(sum1, sum2), _mm256_add_pd(sum3, sum4)));
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data1, data2) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for shared(n, data1, data2) private(i) reduction(+ : sum)
| 100
|
add_ps(
_mm256_add_ps(_mm256_add_ps(sum1, sum2), _mm256_add_ps(sum3, sum4)));
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data1, data2) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for
| 100
|
i;
#ifdef USE_AVX
#pragma omp parallel shared(n, data1, data2) private(i) reduction(+ : sum)
{
<LOOP-START>for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for shared(n, data1, data2) private(i) reduction(+ : sum)
| 100
|
arallel for
for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data1, data2) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for
| 100
|
i;
#ifdef USE_AVX
#pragma omp parallel shared(n, data1, data2) private(i) reduction(+ : sum)
{
<LOOP-START>for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for shared(n, data1, data2) private(i) reduction(+ : sum)
| 100
|
arallel for
for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data1, data2) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for
| 100
|
i;
#ifdef USE_AVX
#pragma omp parallel shared(n, data1, data2) private(i) reduction(+ : sum)
{
<LOOP-START>for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for shared(n, data1, data2) private(i) reduction(+ : sum)
| 100
|
arallel for
for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data1[i] * data2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data1, data2) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)
| 100
|
)
{
#pragma omp for
for (i = 0; i < n; i++) {
sum += data[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)
| 100
|
)
{
#pragma omp for
for (i = 0; i < n; i++) {
sum += data[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)
| 100
|
)
{
#pragma omp for
for (i = 0; i < n; i++) {
sum += data[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)
| 100
|
)
{
#pragma omp for
for (i = 0; i < n; i++) {
sum += data[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/vtsynergy/MetaMorph/metamorph-backends/openmp-backend/metamorph_openmp.c
|
#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)
| 100
|
)
{
#pragma omp for
for (i = 0; i < n; i++) {
sum += data[i];
}
}
#else
<LOOP-START>for (i = 0; i < n; i++) {
sum += data[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for shared(n, data) private(i) reduction(+ : sum)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/ntuhpc/training-ay1819/4-Parallel_Programming_Models/OpenMP/solution/vec_total_omp_buggy.cpp
|
#pragma omp parallel for default(none) shared(v1, v2, result)
| 100
|
;
}
cout<<"\n";
}
int vec_sum(vector<int> v1, vector<int> v2)
{
int result=0;
<LOOP-START>for (int i=0; i<v1.size(); ++i)
{
result+=v1[i]+v2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for default(none) shared(v1, v2, result)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/ntuhpc/training-ay1819/4-Parallel_Programming_Models/OpenMP/solution/vec_total_omp.cpp
|
#pragma omp parallel for default(none) shared(v1, v2) reduction (+:result)
| 100
|
;
}
cout<<"\n";
}
int vec_sum(vector<int> v1, vector<int> v2)
{
int result=0;
<LOOP-START>for (int i=0; i<v1.size(); ++i)
{
result+=v1[i]+v2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for default(none) shared(v1, v2) reduction (+:result)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/ntuhpc/training-ay1819/4-Parallel_Programming_Models/OpenMP/solution/vec_add_omp.cpp
|
#pragma omp parallel for default(none) shared(v1,v2,result)
| 100
|
vector<int> vec_add(vector<int> v1, vector<int> v2)
{
vector<int> result(v1.size());
<LOOP-START>for (int i=0; i<v1.size(); ++i)
{
result[i]=v1[i]+v2[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for default(none) shared(v1,v2,result)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/ntuhpc/training-ay1819/OpenMP/Example/program_with_bugs/omp_bug1.c
|
#pragma omp parallel for \
| 100
|
[N];
/* Some initializations */
for (i=0; i < N; i++)
a[i] = b[i] = i * 1.0;
chunk = CHUNKSIZE;
<LOOP-START>shared(a,b,c,chunk) \
private(i,tid) \
schedule(static,chunk)
{
tid = omp_get_thread_num();
for (i=0; i < N; i++)
{
c[i] = a[i] + b[i];
printf("tid= %d i= %d c[i]= %f\n", tid, i, c[i]);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for \<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/ntuhpc/training-ay1819/OpenMP/Example/program_with_bugs/omp_bug1fix.c
|
#pragma omp parallel for \
| 100
|
ializations */
for (i=0; i < N; i++)
a[i] = b[i] = i * 1.0;
chunk = CHUNKSIZE;
first_time = 'y';
<LOOP-START>shared(a,b,c,chunk) \
private(i,tid) \
schedule(static,chunk) \
firstprivate(first_time)
for (i=0; i < N; i++)
{
if (first_time == 'y')
{
tid = omp_get_thread_num();
first_time = 'n';
}
c[i] = a[i] + b[i];
printf("tid= %d i= %d c[i]= %f\n", tid, i, c[i]);
}<LOOP-END> <OMP-START>#pragma omp parallel for \<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/lanl/libquo/demos/mpi-openmp/dgemv.c
|
#pragma omp parallel for \
| 100
|
const double *restrict y,
int64_t n)
{
double res = 0.0;
int64_t i = 0;
<LOOP-START>default(shared) private(i) \
schedule(static, DDOT_OMP_CHUNK_SIZE) \
reduction(+:res)
for (i = 0; i < n; ++i) {
res += x[i] * y[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for \<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/starpu-runtime/starpu/examples/parallel_workers/parallel_workers.c
|
#pragma omp parallel for
| 100
|
parallel
fprintf(stderr, "hello from the task %d\n", omp_get_thread_num());
for (k=0;k<10;k++)
{
<LOOP-START>for (i=0; i<size; i++)
{
v_dst[i]+=v_src0[i]+v_src1[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/starpu-runtime/starpu/examples/openmp/vector_scal_omp.c
|
#pragma omp parallel for num_threads(starpu_combined_worker_get_size())
| 100
|
PTR(vector);
FPRINTF(stderr, "running task with %d CPUs.\n", starpu_combined_worker_get_size());
<LOOP-START>for (i = 0; i < n; i++)
{
float v = val[i];
int j;
for (j = 0; j < 100; j++)
v = v * f;
val[i] = v;
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(starpu_combined_worker_get_size())<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/starpu-runtime/starpu/examples/sched_ctx/parallel_tasks_reuse_handle.c
|
#pragma omp parallel for
| 100
|
ET_PTR(descr[2]);
int size = STARPU_VECTOR_GET_NX(descr[0]);
int i, k;
for (k=0;k<LOOPS;k++)
{
<LOOP-START>for (i=0; i<size; i++)
{
v_dst[i]+=v_src0[i]+v_src1[i];
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/starpu-runtime/starpu/doc/doxygen/chapters/starpu_extensions/code/forkmode.c
|
#pragma omp parallel for num_threads(starpu_combined_worker_get_size())
| 100
|
nsigned n = STARPU_VECTOR_GET_NX(vector);
float *val = (float *)STARPU_VECTOR_GET_PTR(vector);
<LOOP-START>for (i = 0; i < n; i++)
val[i] *= *factor;
}
static struct starpu_codelet cl =
{
.modes = { STARPU_RW },
.where = STARPU_CPU,
.type = STARPU_FORKJOIN,
.max_parallelism = INT_MAX,
.cpu_funcs = {scal_cpu_func},
.cpu_funcs_name = {"scal_cpu_func"},
.nbuffers = 1,
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(starpu_combined_worker_get_size())<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/starpu-runtime/starpu/tests/main/combined_workers/bfs/bfs_func/bfs_omp_func.cpp
|
#pragma omp parallel for num_threads(starpu_combined_worker_get_size())
| 100
|
l stop;
do
{
//if no thread changes this value then the loop stops
stop=false;
#ifdef OPEN
<LOOP-START>for(int tid = 0; tid < no_of_nodes; tid++ )
{
if (graph_mask[tid] == true)
{
graph_mask[tid]=false;
for(int i=graph_nodes[tid].starting; i<(graph_nodes[tid].no_of_edges + graph_nodes[tid].starting); i++)
{
int id = graph_edges[i];
if(!graph_visited[id])
{
cost[id]=cost[tid]+1;
updating_graph_mask[id]=true;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for num_threads(starpu_combined_worker_get_size())<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/WarwickRSE/ParallelismPrimer/OpenMP/C/01 Loop Decompose.c
|
#pragma omp parallel for
| 100
|
int *its_per_proc;
nproc = omp_get_max_threads();
its_per_proc = calloc(nproc, sizeof(int));
<LOOP-START>for (i = 0; i< MAX_ITS; ++i){
thread_id = omp_get_thread_num();
its_per_proc[thread_id] ++;
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/WarwickRSE/ParallelismPrimer/Examples/Collatz/C/collatz_omp_guided.c
|
#pragma omp parallel for private(iint, itrial) shared(counts) schedule(guided)
| 100
|
< NUMS; ++iint){
counts[iint] = -1;
}
/*Loop over all numbers to start the sequence from*/
<LOOP-START>for (iint = 0; iint < NUMS; ++iint){
icurr = iint + 1; /*Capture the value to start from*/
/*Loop to a maximum number of iterations
You can check if any are not converged after MAXITS by checking for
the sentinal value of -1 in count*/
for (itrial = 1; itrial <= MAXITS; ++itrial){
/*If icurr is even divide by two*/
if (icurr%2 == 0) {
icurr = icurr / 2;
} else {
/*Otherwise multiply by 3 and add 1*/
icurr = icurr * 3 + 1;
}
/*If the number reaches 1 then sequence has converged*/
if (icurr == 1) {
counts[iint] = itrial;
break;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(iint, itrial) shared(counts) schedule(guided)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/WarwickRSE/ParallelismPrimer/Examples/Collatz/C/collatz_omp.c
|
#pragma omp parallel for private(iint, itrial) shared(counts)
| 100
|
< NUMS; ++iint){
counts[iint] = -1;
}
/*Loop over all numbers to start the sequence from*/
<LOOP-START>for (iint = 0; iint < NUMS; ++iint){
icurr = iint + 1; /*Capture the value to start from*/
/*Loop to a maximum number of iterations
You can check if any are not converged after MAXITS by checking for
the sentinal value of -1 in count*/
for (itrial = 1; itrial <= MAXITS; ++itrial){
/*If icurr is even divide by two*/
if (icurr%2 == 0) {
icurr = icurr / 2;
} else {
/*Otherwise multiply by 3 and add 1*/
icurr = icurr * 3 + 1;
}
/*If the number reaches 1 then sequence has converged*/
if (icurr == 1) {
counts[iint] = itrial;
break;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(iint, itrial) shared(counts)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/WarwickRSE/ParallelismPrimer/Examples/Collatz/C/collatz_omp_dynamic.c
|
#pragma omp parallel for private(iint, itrial) shared(counts) schedule(dynamic)
| 100
|
< NUMS; ++iint){
counts[iint] = -1;
}
/*Loop over all numbers to start the sequence from*/
<LOOP-START>for (iint = 0; iint < NUMS; ++iint){
icurr = iint + 1; /*Capture the value to start from*/
/*Loop to a maximum number of iterations
You can check if any are not converged after MAXITS by checking for
the sentinal value of -1 in count*/
for (itrial = 1; itrial <= MAXITS; ++itrial){
/*If icurr is even divide by two*/
if (icurr%2 == 0) {
icurr = icurr / 2;
} else {
/*Otherwise multiply by 3 and add 1*/
icurr = icurr * 3 + 1;
}
/*If the number reaches 1 then sequence has converged*/
if (icurr == 1) {
counts[iint] = itrial;
break;
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(iint, itrial) shared(counts) schedule(dynamic)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/WarwickRSE/ParallelismPrimer/Examples/Prime/C/prime_omp_guided.c
|
#pragma omp parallel for private(i) reduction(+:ct) schedule(guided)
| 100
|
ll be accumulated on each thread individually
and then summed at the end to get the total count */
<LOOP-START>for (i = 2; i<=20000000; ++i){
if (check_prime(i))ct = ct + 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i) reduction(+:ct) schedule(guided)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/WarwickRSE/ParallelismPrimer/Examples/Prime/C/prime_omp_dynamic.c
|
#pragma omp parallel for private(i) reduction(+:ct) schedule(dynamic)
| 100
|
ll be accumulated on each thread individually
and then summed at the end to get the total count */
<LOOP-START>for (i = 2; i<=20000000; ++i){
if (check_prime(i))ct = ct + 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i) reduction(+:ct) schedule(dynamic)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/WarwickRSE/ParallelismPrimer/Examples/Prime/C/prime_omp.c
|
#pragma omp parallel for private(i) reduction(+:ct)
| 100
|
ll be accumulated on each thread individually
and then summed at the end to get the total count */
<LOOP-START>for (i = 2; i<=20000000; ++i){
if (check_prime(i))ct = ct + 1;
}<LOOP-END> <OMP-START>#pragma omp parallel for private(i) reduction(+:ct)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/trmm.c
|
#pragma omp parallel for
| 100
|
(x) < (y) ? (x) : (y))
#define max(x,y) ((x) > (y) ? (x) : (y))
#pragma scop
if (_PB_M >= 1) {
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_N; ir1 += 1) {
if (_PB_M >= 2) {
const int ii0_prim_lb = 0, ii0_prim_ub = (_PB_M - 1) / 8;
for (register int ii0_prim = ii0_prim_lb; ii0_prim <= ii0_prim_ub; ii0_prim += 1) {
const int ii3_prim_lb = ii0_prim, ii3_prim_ub = (_PB_M - 1) / 8;
for (register int ii3_prim = ii3_prim_lb; ii3_prim <= ii3_prim_ub; ii3_prim += 1) {
const int i0_lb = 8 * ii0_prim, i0_ub = min(min(_PB_M - 2, 8 * ii0_prim + 7), 8 * ii3_prim + 6);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i3_lb = max(8 * ii3_prim, i0 + 1), i3_ub = min(_PB_M - 1, 8 * ii3_prim + 7);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
B[i0][ir1] += (A[i3][i0] * B[i3][ir1]);
}
}
}
if (ii0_prim >= 1) {
const int i0_lb = 8 * ii0_prim, i0_ub = min(_PB_M - 1, 8 * ii0_prim + 7);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
B[i0][ir1] = (alpha * B[i0][ir1]);
}
} else {
const int i0_lb = 0, i0_ub = min(7, _PB_M - 1);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
B[i0][ir1] = (alpha * B[i0][ir1]);
}
}
}
} else {
B[0][ir1] = (alpha * B[0][ir1]);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/gemm.c
|
#pragma omp parallel for
| 100
|
((x) < (y) ? (x) : (y))
#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
<LOOP-START>for (register int ir0 = 0; ir0 < _PB_NI; ir0 += 1) {
for (register int ir2 = 0; ir2 < _PB_NJ; ir2 += 1) {
C[ir0][ir2] *= beta;
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NK - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_NK - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[ir0][ir2] += ((alpha * A[ir0][i2]) * B[i2][ir2]);
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/mvt.c
|
#pragma omp parallel for
| 100
|
ling --omp-for-codegen --debug -b 8 */
#define min(x,y) ((x) < (y) ? (x) : (y))
#pragma scop
{
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_N; ir1 += 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 8;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_N - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
x1[ir1] = (x1[ir1] + (A[ir1][i2] * y_1[i2]));
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/mvt.c
|
#pragma omp parallel for
| 100
|
; i2 <= i2_ub; i2 += 1) {
x1[ir1] = (x1[ir1] + (A[ir1][i2] * y_1[i2]));
}
}
}
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_N; ir1 += 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 8;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_N - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
x2[ir1] = (x2[ir1] + (A[i2][ir1] * y_2[i2]));
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/bicg.c
|
#pragma omp parallel for
| 100
|
) < (y) ? (x) : (y))
#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
{
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_M; ir1 += 1) {
s[ir1] = 0;
const int ii1_prim_lb = 0, ii1_prim_ub = floord(_PB_N - 1, 8);
for (register int ii1_prim = ii1_prim_lb; ii1_prim <= ii1_prim_ub; ii1_prim += 1) {
const int i1_lb = 8 * ii1_prim, i1_ub = min(_PB_N - 1, 8 * ii1_prim + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
s[ir1] = (s[ir1] + (r[i1] * A[i1][ir1]));
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/bicg.c
|
#pragma omp parallel for
| 100
|
1_lb; i1 <= i1_ub; i1 += 1) {
s[ir1] = (s[ir1] + (r[i1] * A[i1][ir1]));
}
}
}
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_N; ir1 += 1) {
q[ir1] = SCALAR_VAL(0.0);
const int ii3_prim_lb = 0, ii3_prim_ub = floord(_PB_M - 1, 8);
for (register int ii3_prim = ii3_prim_lb; ii3_prim <= ii3_prim_ub; ii3_prim += 1) {
const int i3_lb = 8 * ii3_prim, i3_ub = min(_PB_M - 1, 8 * ii3_prim + 7);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
q[ir1] = (q[ir1] + (A[ir1][i3] * p[i3]));
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/syr2k.c
|
#pragma omp parallel for
| 100
|
((x) < (y) ? (x) : (y))
#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_N; ir1 += 1) {
for (register int ir2 = 0; ir2 < _PB_N; ir2 += 1) {
C[ir1][ir2] *= beta;
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_M - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[ir1][ir2] += (((A[ir2][i2] * alpha) * B[ir1][i2]) + ((B[ir2][i2] * alpha) * A[ir1][i2]));
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/gesummv.c
|
#pragma omp parallel for
| 100
|
heduling --omp-for-codegen --debug -b 8 */
#define min(x,y) ((x) < (y) ? (x) : (y))
#pragma scop
<LOOP-START>for (register int ir0 = 0; ir0 < _PB_N; ir0 += 1) {
{
tmp[ir0] = SCALAR_VAL(0.0);
y[ir0] = SCALAR_VAL(0.0);
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 8;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_N - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
tmp[ir0] = ((A[ir0][i2] * x[i2]) + tmp[ir0]);
}
const int i2_lb2 = 8 * ii2_prim, i2_ub2 = min(_PB_N - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb2; i2 <= i2_ub2; i2 += 1) {
y[ir0] = ((B[ir0][i2] * x[i2]) + y[ir0]);
}
}
}
y[ir0] = ((alpha * tmp[ir0]) + (beta * y[ir0]));
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/syrk.c
|
#pragma omp parallel for
| 100
|
n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
{
const int ir0_lb = 0, ir0_ub = _PB_N - 7;
<LOOP-START>for (register int ir0 = ir0_lb; ir0 < ir0_ub; ir0 += 1) {
for (register int ir2 = 0; ir2 <= ir0; ir2 += 1) {
C[ir0][ir2] *= beta;
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_M - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[ir0][ir2] += ((alpha * A[ir0][i2]) * A[ir2][i2]);
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/syrk.c
|
#pragma omp parallel for
| 100
|
[ir2][i2]);
}
}
}
}
const int ir0_lb2 = max(0, _PB_N - 7), ir0_ub2 = _PB_N;
<LOOP-START>for (register int ir0 = ir0_lb2; ir0 < ir0_ub2; ir0 += 1) {
for (register int ir2 = 0; ir2 <= ir0; ir2 += 1) {
if (_PB_N >= ((7 * ir0 + 7) % 8) + ir0 + 1) {
C[ir0][ir2] *= beta;
} else {
C[ir0][ir2] *= beta;
}
if (_PB_N >= ((7 * ir0 + 7) % 8) + ir0 + 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_M - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[ir0][ir2] += ((alpha * A[ir0][i2]) * A[ir2][i2]);
}
}
} else {
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_M - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[ir0][ir2] += ((alpha * A[ir0][i2]) * A[ir2][i2]);
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/2mm.c
|
#pragma omp parallel for
| 100
|
y))
#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
if (_PB_NJ >= 1) {
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_NI; ir1 += 1) {
if (_PB_NL >= 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NJ - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_NJ - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
tmp[ir1][i2] = SCALAR_VAL(0.0);
}
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NK - 1, 8);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_NJ - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i4_lb = 8 * ii4_prim, i4_ub = min(_PB_NK - 1, 8 * ii4_prim + 7);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
tmp[ir1][i2] += ((alpha * A[ir1][i4]) * B[i4][i2]);
}
}
}
}
} else {
for (register int ir2 = 0; ir2 < _PB_NJ; ir2 += 1) {
tmp[ir1][ir2] = SCALAR_VAL(0.0);
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NK - 1, 8);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i4_lb = 8 * ii4_prim, i4_ub = min(_PB_NK - 1, 8 * ii4_prim + 7);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
tmp[ir1][ir2] += ((alpha * A[ir1][i4]) * B[i4][ir2]);
}
}
}
}
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NL - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_NL - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
D[ir1][i2] *= beta;
}
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NJ - 1, 8);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_NL - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i4_lb = 8 * ii4_prim, i4_ub = min(_PB_NJ - 1, 8 * ii4_prim + 7);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
D[ir1][i2] += (tmp[ir1][i4] * C[i4][i2]);
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/8/2mm.c
|
#pragma omp parallel for
| 100
|
D[ir1][i2] += (tmp[ir1][i4] * C[i4][i2]);
}
}
}
}
}
} else {
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_NI; ir1 += 1) {
for (register int ir2 = 0; ir2 < _PB_NL; ir2 += 1) {
D[ir1][ir2] *= beta;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/trmm.c
|
#pragma omp parallel for
| 100
|
(x) < (y) ? (x) : (y))
#define max(x,y) ((x) > (y) ? (x) : (y))
#pragma scop
if (_PB_M >= 1) {
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_N; ir1 += 1) {
if (_PB_M >= 2) {
const int ii0_prim_lb = 0, ii0_prim_ub = (_PB_M - 1) / 32;
for (register int ii0_prim = ii0_prim_lb; ii0_prim <= ii0_prim_ub; ii0_prim += 1) {
const int ii3_prim_lb = ii0_prim, ii3_prim_ub = (_PB_M - 1) / 32;
for (register int ii3_prim = ii3_prim_lb; ii3_prim <= ii3_prim_ub; ii3_prim += 1) {
const int i0_lb = 32 * ii0_prim, i0_ub = min(min(_PB_M - 2, 32 * ii0_prim + 31), 32 * ii3_prim + 30);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i3_lb = max(32 * ii3_prim, i0 + 1), i3_ub = min(_PB_M - 1, 32 * ii3_prim + 31);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
B[i0][ir1] += (A[i3][i0] * B[i3][ir1]);
}
}
}
if (ii0_prim >= 1) {
const int i0_lb = 32 * ii0_prim, i0_ub = min(_PB_M - 1, 32 * ii0_prim + 31);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
B[i0][ir1] = (alpha * B[i0][ir1]);
}
} else {
const int i0_lb = 0, i0_ub = min(31, _PB_M - 1);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
B[i0][ir1] = (alpha * B[i0][ir1]);
}
}
}
} else {
B[0][ir1] = (alpha * B[0][ir1]);
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/gemm.c
|
#pragma omp parallel for
| 100
|
((x) < (y) ? (x) : (y))
#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
<LOOP-START>for (register int ir0 = 0; ir0 < _PB_NI; ir0 += 1) {
for (register int ir2 = 0; ir2 < _PB_NJ; ir2 += 1) {
C[ir0][ir2] *= beta;
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NK - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_NK - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[ir0][ir2] += ((alpha * A[ir0][i2]) * B[i2][ir2]);
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/mvt.c
|
#pragma omp parallel for
| 100
|
ing --omp-for-codegen --debug -b 32 */
#define min(x,y) ((x) < (y) ? (x) : (y))
#pragma scop
{
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_N; ir1 += 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 32;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_N - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
x1[ir1] = (x1[ir1] + (A[ir1][i2] * y_1[i2]));
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/mvt.c
|
#pragma omp parallel for
| 100
|
; i2 <= i2_ub; i2 += 1) {
x1[ir1] = (x1[ir1] + (A[ir1][i2] * y_1[i2]));
}
}
}
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_N; ir1 += 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 32;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_N - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
x2[ir1] = (x2[ir1] + (A[i2][ir1] * y_2[i2]));
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/bicg.c
|
#pragma omp parallel for
| 100
|
) < (y) ? (x) : (y))
#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
{
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_M; ir1 += 1) {
s[ir1] = 0;
const int ii1_prim_lb = 0, ii1_prim_ub = floord(_PB_N - 1, 32);
for (register int ii1_prim = ii1_prim_lb; ii1_prim <= ii1_prim_ub; ii1_prim += 1) {
const int i1_lb = 32 * ii1_prim, i1_ub = min(_PB_N - 1, 32 * ii1_prim + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
s[ir1] = (s[ir1] + (r[i1] * A[i1][ir1]));
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/bicg.c
|
#pragma omp parallel for
| 100
|
1_lb; i1 <= i1_ub; i1 += 1) {
s[ir1] = (s[ir1] + (r[i1] * A[i1][ir1]));
}
}
}
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_N; ir1 += 1) {
q[ir1] = SCALAR_VAL(0.0);
const int ii3_prim_lb = 0, ii3_prim_ub = floord(_PB_M - 1, 32);
for (register int ii3_prim = ii3_prim_lb; ii3_prim <= ii3_prim_ub; ii3_prim += 1) {
const int i3_lb = 32 * ii3_prim, i3_ub = min(_PB_M - 1, 32 * ii3_prim + 31);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
q[ir1] = (q[ir1] + (A[ir1][i3] * p[i3]));
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/syr2k.c
|
#pragma omp parallel for
| 100
|
((x) < (y) ? (x) : (y))
#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_N; ir1 += 1) {
for (register int ir2 = 0; ir2 < _PB_N; ir2 += 1) {
C[ir1][ir2] *= beta;
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_M - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[ir1][ir2] += (((A[ir2][i2] * alpha) * B[ir1][i2]) + ((B[ir2][i2] * alpha) * A[ir1][i2]));
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/gesummv.c
|
#pragma omp parallel for
| 100
|
eduling --omp-for-codegen --debug -b 32 */
#define min(x,y) ((x) < (y) ? (x) : (y))
#pragma scop
<LOOP-START>for (register int ir0 = 0; ir0 < _PB_N; ir0 += 1) {
{
tmp[ir0] = SCALAR_VAL(0.0);
y[ir0] = SCALAR_VAL(0.0);
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 32;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_N - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
tmp[ir0] = ((A[ir0][i2] * x[i2]) + tmp[ir0]);
}
const int i2_lb2 = 32 * ii2_prim, i2_ub2 = min(_PB_N - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb2; i2 <= i2_ub2; i2 += 1) {
y[ir0] = ((B[ir0][i2] * x[i2]) + y[ir0]);
}
}
}
y[ir0] = ((alpha * tmp[ir0]) + (beta * y[ir0]));
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/syrk.c
|
#pragma omp parallel for
| 100
|
)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
{
const int ir0_lb = 0, ir0_ub = _PB_N - 31;
<LOOP-START>for (register int ir0 = ir0_lb; ir0 < ir0_ub; ir0 += 1) {
for (register int ir2 = 0; ir2 <= ir0; ir2 += 1) {
C[ir0][ir2] *= beta;
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_M - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[ir0][ir2] += ((alpha * A[ir0][i2]) * A[ir2][i2]);
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/syrk.c
|
#pragma omp parallel for
| 100
|
ir2][i2]);
}
}
}
}
const int ir0_lb2 = max(0, _PB_N - 31), ir0_ub2 = _PB_N;
<LOOP-START>for (register int ir0 = ir0_lb2; ir0 < ir0_ub2; ir0 += 1) {
for (register int ir2 = 0; ir2 <= ir0; ir2 += 1) {
if (_PB_N >= ((31 * ir0 + 31) % 32) + ir0 + 1) {
C[ir0][ir2] *= beta;
} else {
C[ir0][ir2] *= beta;
}
if (_PB_N >= ((31 * ir0 + 31) % 32) + ir0 + 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_M - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[ir0][ir2] += ((alpha * A[ir0][i2]) * A[ir2][i2]);
}
}
} else {
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_M - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[ir0][ir2] += ((alpha * A[ir0][i2]) * A[ir2][i2]);
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/2mm.c
|
#pragma omp parallel for
| 100
|
y))
#define floord(n,d) (((n)<0) ? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
if (_PB_NJ >= 1) {
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_NI; ir1 += 1) {
if (_PB_NL >= 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NJ - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_NJ - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
tmp[ir1][i2] = SCALAR_VAL(0.0);
}
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NK - 1, 32);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_NJ - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i4_lb = 32 * ii4_prim, i4_ub = min(_PB_NK - 1, 32 * ii4_prim + 31);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
tmp[ir1][i2] += ((alpha * A[ir1][i4]) * B[i4][i2]);
}
}
}
}
} else {
for (register int ir2 = 0; ir2 < _PB_NJ; ir2 += 1) {
tmp[ir1][ir2] = SCALAR_VAL(0.0);
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NK - 1, 32);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i4_lb = 32 * ii4_prim, i4_ub = min(_PB_NK - 1, 32 * ii4_prim + 31);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
tmp[ir1][ir2] += ((alpha * A[ir1][i4]) * B[i4][ir2]);
}
}
}
}
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NL - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_NL - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
D[ir1][i2] *= beta;
}
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NJ - 1, 32);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_NL - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i4_lb = 32 * ii4_prim, i4_ub = min(_PB_NJ - 1, 32 * ii4_prim + 31);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
D[ir1][i2] += (tmp[ir1][i4] * C[i4][i2]);
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-single/32/2mm.c
|
#pragma omp parallel for
| 100
|
D[ir1][i2] += (tmp[ir1][i4] * C[i4][i2]);
}
}
}
}
}
} else {
<LOOP-START>for (register int ir1 = 0; ir1 < _PB_NI; ir1 += 1) {
for (register int ir2 = 0; ir2 < _PB_NL; ir2 += 1) {
D[ir1][ir2] *= beta;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/trmm.c
|
#pragma omp parallel for
| 100
|
: (n)/(d))
#pragma scop
if (_PB_M >= 1) {
const int ii1_lb = 0, ii1_ub = floord(_PB_N - 1, 8);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
if (_PB_M >= 2) {
const int ii0_prim_lb = 0, ii0_prim_ub = (_PB_M - 1) / 8;
for (register int ii0_prim = ii0_prim_lb; ii0_prim <= ii0_prim_ub; ii0_prim += 1) {
const int ii3_prim_lb = ii0_prim, ii3_prim_ub = (_PB_M - 1) / 8;
for (register int ii3_prim = ii3_prim_lb; ii3_prim <= ii3_prim_ub; ii3_prim += 1) {
const int i0_lb = 8 * ii0_prim, i0_ub = min(min(_PB_M - 2, 8 * ii0_prim + 7), 8 * ii3_prim + 6);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_N - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i3_lb = max(8 * ii3_prim, i0 + 1), i3_ub = min(_PB_M - 1, 8 * ii3_prim + 7);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
B[i0][i1] += (A[i3][i0] * B[i3][i1]);
}
}
}
}
if (ii0_prim >= 1) {
const int i0_lb = 8 * ii0_prim, i0_ub = min(_PB_M - 1, 8 * ii0_prim + 7);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_N - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
B[i0][i1] = (alpha * B[i0][i1]);
}
}
} else {
const int i0_lb = 0, i0_ub = min(7, _PB_M - 1);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_N - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
B[i0][i1] = (alpha * B[i0][i1]);
}
}
}
}
} else {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_N - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
B[0][i1] = (alpha * B[0][i1]);
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/gemm.c
|
#pragma omp parallel for
| 100
|
? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
const int ii0_lb = 0, ii0_ub = floord(_PB_NI - 1, 8);
<LOOP-START>for (register int ii0 = ii0_lb; ii0 <= ii0_ub; ii0 += 1) {
const int ii2_lb = 0, ii2_ub = floord(_PB_NJ - 1, 8);
for (register int ii2 = ii2_lb; ii2 <= ii2_ub; ii2 += 1) {
const int i0_lb = 8 * ii0, i0_ub = min(_PB_NI - 1, 8 * ii0 + 7);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i2_lb = 8 * ii2, i2_ub = min(_PB_NJ - 1, 8 * ii2 + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[i0][i2] *= beta;
}
}
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NK - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i0_lb = 8 * ii0, i0_ub = min(_PB_NI - 1, 8 * ii0 + 7);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_NK - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i3_lb = 8 * ii2, i3_ub = min(_PB_NJ - 1, 8 * ii2 + 7);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
C[i0][i3] += ((alpha * A[i0][i2]) * B[i2][i3]);
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/mvt.c
|
#pragma omp parallel for
| 100
|
-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
{
const int ii1_lb = 0, ii1_ub = floord(_PB_N - 1, 8);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 8;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_N - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_N - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
x1[i1] = (x1[i1] + (A[i1][i2] * y_1[i2]));
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/mvt.c
|
#pragma omp parallel for
| 100
|
* y_1[i2]));
}
}
}
}
const int ii1_lb2 = 0, ii1_ub2 = floord(_PB_N - 1, 8);
<LOOP-START>for (register int ii1 = ii1_lb2; ii1 <= ii1_ub2; ii1 += 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 8;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_N - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_N - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
x2[i1] = (x2[i1] + (A[i2][i1] * y_2[i2]));
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/bicg.c
|
#pragma omp parallel for
| 100
|
-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
{
const int ii1_lb = 0, ii1_ub = floord(_PB_M - 1, 8);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_M - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
s[i1] = 0;
}
const int ii1_prim_lb = 0, ii1_prim_ub = floord(_PB_N - 1, 8);
for (register int ii1_prim = ii1_prim_lb; ii1_prim <= ii1_prim_ub; ii1_prim += 1) {
const int i1_lb = 8 * ii1_prim, i1_ub = min(_PB_N - 1, 8 * ii1_prim + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i3_lb = 8 * ii1, i3_ub = min(_PB_M - 1, 8 * ii1 + 7);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
s[i3] = (s[i3] + (r[i1] * A[i1][i3]));
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/bicg.c
|
#pragma omp parallel for
| 100
|
A[i1][i3]));
}
}
}
}
const int ii1_lb2 = 0, ii1_ub2 = floord(_PB_N - 1, 8);
<LOOP-START>for (register int ii1 = ii1_lb2; ii1 <= ii1_ub2; ii1 += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_N - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
q[i1] = SCALAR_VAL(0.0);
}
const int ii3_prim_lb = 0, ii3_prim_ub = floord(_PB_M - 1, 8);
for (register int ii3_prim = ii3_prim_lb; ii3_prim <= ii3_prim_ub; ii3_prim += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_N - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i3_lb = 8 * ii3_prim, i3_ub = min(_PB_M - 1, 8 * ii3_prim + 7);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
q[i1] = (q[i1] + (A[i1][i3] * p[i3]));
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/syr2k.c
|
#pragma omp parallel for
| 100
|
? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
const int ii1_lb = 0, ii1_ub = floord(_PB_N - 1, 8);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
const int ii2_lb = 0, ii2_ub = (_PB_N - 1) / 8;
for (register int ii2 = ii2_lb; ii2 <= ii2_ub; ii2 += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_N - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2, i2_ub = min(_PB_N - 1, 8 * ii2 + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[i1][i2] *= beta;
}
}
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_N - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_M - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i3_lb = 8 * ii2, i3_ub = min(_PB_N - 1, 8 * ii2 + 7);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
C[i1][i3] += (((A[i3][i2] * alpha) * B[i1][i2]) + ((B[i3][i2] * alpha) * A[i1][i2]));
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/gesummv.c
|
#pragma omp parallel for
| 100
|
? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
const int ii0_lb = 0, ii0_ub = floord(_PB_N - 1, 8);
<LOOP-START>for (register int ii0 = ii0_lb; ii0 <= ii0_ub; ii0 += 1) {
{
const int i0_lb = 8 * ii0, i0_ub = min(_PB_N - 1, 8 * ii0 + 7);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
tmp[i0] = SCALAR_VAL(0.0);
}
const int i0_lb2 = 8 * ii0, i0_ub2 = min(_PB_N - 1, 8 * ii0 + 7);
for (register int i0 = i0_lb2; i0 <= i0_ub2; i0 += 1) {
y[i0] = SCALAR_VAL(0.0);
}
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 8;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i0_lb = 8 * ii0, i0_ub = min(_PB_N - 1, 8 * ii0 + 7);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_N - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
tmp[i0] = ((A[i0][i2] * x[i2]) + tmp[i0]);
}
}
const int i0_lb2 = 8 * ii0, i0_ub2 = min(_PB_N - 1, 8 * ii0 + 7);
for (register int i0 = i0_lb2; i0 <= i0_ub2; i0 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_N - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
y[i0] = ((B[i0][i2] * x[i2]) + y[i0]);
}
}
}
}
const int i0_lb = 8 * ii0, i0_ub = min(_PB_N - 1, 8 * ii0 + 7);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
y[i0] = ((alpha * tmp[i0]) + (beta * y[i0]));
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/syrk.c
|
#pragma omp parallel for
| 100
|
? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
const int ii0_lb = 0, ii0_ub = floord(_PB_N - 1, 8);
<LOOP-START>for (register int ii0 = ii0_lb; ii0 <= ii0_ub; ii0 += 1) {
for (register int ii2 = 0; ii2 <= ii0; ii2 += 1) {
const int i0_lb = 8 * ii0, i0_ub = min(_PB_N - 1, 8 * ii0 + 7);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i2_lb = 8 * ii2, i2_ub = min(8 * ii2 + 7, i0);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[i0][i2] *= beta;
}
}
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i0_lb = 8 * ii0, i0_ub = min(_PB_N - 1, 8 * ii0 + 7);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_M - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i3_lb = 8 * ii2, i3_ub = min(8 * ii2 + 7, i0);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
C[i0][i3] += ((alpha * A[i0][i2]) * A[i3][i2]);
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/2mm.c
|
#pragma omp parallel for
| 100
|
(n)/(d))
#pragma scop
if (_PB_NJ >= 1) {
const int ii1_lb = 0, ii1_ub = floord(_PB_NI - 1, 8);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
if (_PB_NL >= 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NJ - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_NI - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_NJ - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
tmp[i1][i2] = SCALAR_VAL(0.0);
}
}
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NK - 1, 8);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_NI - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_NJ - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i4_lb = 8 * ii4_prim, i4_ub = min(_PB_NK - 1, 8 * ii4_prim + 7);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
tmp[i1][i2] += ((alpha * A[i1][i4]) * B[i4][i2]);
}
}
}
}
}
} else {
const int ii2_lb = 0, ii2_ub = floord(_PB_NJ - 1, 8);
for (register int ii2 = ii2_lb; ii2 <= ii2_ub; ii2 += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_NI - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2, i2_ub = min(_PB_NJ - 1, 8 * ii2 + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
tmp[i1][i2] = SCALAR_VAL(0.0);
}
}
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NK - 1, 8);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_NI - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2, i2_ub = min(_PB_NJ - 1, 8 * ii2 + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i4_lb = 8 * ii4_prim, i4_ub = min(_PB_NK - 1, 8 * ii4_prim + 7);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
tmp[i1][i2] += ((alpha * A[i1][i4]) * B[i4][i2]);
}
}
}
}
}
}
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NL - 1, 8);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_NI - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_NL - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
D[i1][i2] *= beta;
}
}
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NJ - 1, 8);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_NI - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2_prim, i2_ub = min(_PB_NL - 1, 8 * ii2_prim + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i4_lb = 8 * ii4_prim, i4_ub = min(_PB_NJ - 1, 8 * ii4_prim + 7);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
D[i1][i2] += (tmp[i1][i4] * C[i4][i2]);
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/8/2mm.c
|
#pragma omp parallel for
| 100
|
}
}
}
}
}
} else {
const int ii1_lb = 0, ii1_ub = floord(_PB_NI - 1, 8);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
const int ii2_lb = 0, ii2_ub = floord(_PB_NL - 1, 8);
for (register int ii2 = ii2_lb; ii2 <= ii2_ub; ii2 += 1) {
const int i1_lb = 8 * ii1, i1_ub = min(_PB_NI - 1, 8 * ii1 + 7);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 8 * ii2, i2_ub = min(_PB_NL - 1, 8 * ii2 + 7);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
D[i1][i2] *= beta;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/trmm.c
|
#pragma omp parallel for
| 100
|
: (n)/(d))
#pragma scop
if (_PB_M >= 1) {
const int ii1_lb = 0, ii1_ub = floord(_PB_N - 1, 32);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
if (_PB_M >= 2) {
const int ii0_prim_lb = 0, ii0_prim_ub = (_PB_M - 1) / 32;
for (register int ii0_prim = ii0_prim_lb; ii0_prim <= ii0_prim_ub; ii0_prim += 1) {
const int ii3_prim_lb = ii0_prim, ii3_prim_ub = (_PB_M - 1) / 32;
for (register int ii3_prim = ii3_prim_lb; ii3_prim <= ii3_prim_ub; ii3_prim += 1) {
const int i0_lb = 32 * ii0_prim, i0_ub = min(min(_PB_M - 2, 32 * ii0_prim + 31), 32 * ii3_prim + 30);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_N - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i3_lb = max(32 * ii3_prim, i0 + 1), i3_ub = min(_PB_M - 1, 32 * ii3_prim + 31);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
B[i0][i1] += (A[i3][i0] * B[i3][i1]);
}
}
}
}
if (ii0_prim >= 1) {
const int i0_lb = 32 * ii0_prim, i0_ub = min(_PB_M - 1, 32 * ii0_prim + 31);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_N - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
B[i0][i1] = (alpha * B[i0][i1]);
}
}
} else {
const int i0_lb = 0, i0_ub = min(31, _PB_M - 1);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_N - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
B[i0][i1] = (alpha * B[i0][i1]);
}
}
}
}
} else {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_N - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
B[0][i1] = (alpha * B[0][i1]);
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/gemm.c
|
#pragma omp parallel for
| 100
|
-((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
const int ii0_lb = 0, ii0_ub = floord(_PB_NI - 1, 32);
<LOOP-START>for (register int ii0 = ii0_lb; ii0 <= ii0_ub; ii0 += 1) {
const int ii2_lb = 0, ii2_ub = floord(_PB_NJ - 1, 32);
for (register int ii2 = ii2_lb; ii2 <= ii2_ub; ii2 += 1) {
const int i0_lb = 32 * ii0, i0_ub = min(_PB_NI - 1, 32 * ii0 + 31);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i2_lb = 32 * ii2, i2_ub = min(_PB_NJ - 1, 32 * ii2 + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[i0][i2] *= beta;
}
}
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NK - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i0_lb = 32 * ii0, i0_ub = min(_PB_NI - 1, 32 * ii0 + 31);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_NK - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i3_lb = 32 * ii2, i3_ub = min(_PB_NJ - 1, 32 * ii2 + 31);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
C[i0][i3] += ((alpha * A[i0][i2]) * B[i2][i3]);
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/mvt.c
|
#pragma omp parallel for
| 100
|
(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
{
const int ii1_lb = 0, ii1_ub = floord(_PB_N - 1, 32);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 32;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_N - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_N - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
x1[i1] = (x1[i1] + (A[i1][i2] * y_1[i2]));
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/mvt.c
|
#pragma omp parallel for
| 100
|
y_1[i2]));
}
}
}
}
const int ii1_lb2 = 0, ii1_ub2 = floord(_PB_N - 1, 32);
<LOOP-START>for (register int ii1 = ii1_lb2; ii1 <= ii1_ub2; ii1 += 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 32;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_N - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_N - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
x2[i1] = (x2[i1] + (A[i2][i1] * y_2[i2]));
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/bicg.c
|
#pragma omp parallel for
| 100
|
(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
{
const int ii1_lb = 0, ii1_ub = floord(_PB_M - 1, 32);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_M - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
s[i1] = 0;
}
const int ii1_prim_lb = 0, ii1_prim_ub = floord(_PB_N - 1, 32);
for (register int ii1_prim = ii1_prim_lb; ii1_prim <= ii1_prim_ub; ii1_prim += 1) {
const int i1_lb = 32 * ii1_prim, i1_ub = min(_PB_N - 1, 32 * ii1_prim + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i3_lb = 32 * ii1, i3_ub = min(_PB_M - 1, 32 * ii1 + 31);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
s[i3] = (s[i3] + (r[i1] * A[i1][i3]));
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/bicg.c
|
#pragma omp parallel for
| 100
|
[i1][i3]));
}
}
}
}
const int ii1_lb2 = 0, ii1_ub2 = floord(_PB_N - 1, 32);
<LOOP-START>for (register int ii1 = ii1_lb2; ii1 <= ii1_ub2; ii1 += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_N - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
q[i1] = SCALAR_VAL(0.0);
}
const int ii3_prim_lb = 0, ii3_prim_ub = floord(_PB_M - 1, 32);
for (register int ii3_prim = ii3_prim_lb; ii3_prim <= ii3_prim_ub; ii3_prim += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_N - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i3_lb = 32 * ii3_prim, i3_ub = min(_PB_M - 1, 32 * ii3_prim + 31);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
q[i1] = (q[i1] + (A[i1][i3] * p[i3]));
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/syr2k.c
|
#pragma omp parallel for
| 100
|
? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
const int ii1_lb = 0, ii1_ub = floord(_PB_N - 1, 32);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
const int ii2_lb = 0, ii2_ub = (_PB_N - 1) / 32;
for (register int ii2 = ii2_lb; ii2 <= ii2_ub; ii2 += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_N - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2, i2_ub = min(_PB_N - 1, 32 * ii2 + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[i1][i2] *= beta;
}
}
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_N - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_M - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i3_lb = 32 * ii2, i3_ub = min(_PB_N - 1, 32 * ii2 + 31);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
C[i1][i3] += (((A[i3][i2] * alpha) * B[i1][i2]) + ((B[i3][i2] * alpha) * A[i1][i2]));
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/gesummv.c
|
#pragma omp parallel for
| 100
|
? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
const int ii0_lb = 0, ii0_ub = floord(_PB_N - 1, 32);
<LOOP-START>for (register int ii0 = ii0_lb; ii0 <= ii0_ub; ii0 += 1) {
{
const int i0_lb = 32 * ii0, i0_ub = min(_PB_N - 1, 32 * ii0 + 31);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
tmp[i0] = SCALAR_VAL(0.0);
}
const int i0_lb2 = 32 * ii0, i0_ub2 = min(_PB_N - 1, 32 * ii0 + 31);
for (register int i0 = i0_lb2; i0 <= i0_ub2; i0 += 1) {
y[i0] = SCALAR_VAL(0.0);
}
const int ii2_prim_lb = 0, ii2_prim_ub = (_PB_N - 1) / 32;
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i0_lb = 32 * ii0, i0_ub = min(_PB_N - 1, 32 * ii0 + 31);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_N - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
tmp[i0] = ((A[i0][i2] * x[i2]) + tmp[i0]);
}
}
const int i0_lb2 = 32 * ii0, i0_ub2 = min(_PB_N - 1, 32 * ii0 + 31);
for (register int i0 = i0_lb2; i0 <= i0_ub2; i0 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_N - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
y[i0] = ((B[i0][i2] * x[i2]) + y[i0]);
}
}
}
}
const int i0_lb = 32 * ii0, i0_ub = min(_PB_N - 1, 32 * ii0 + 31);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
y[i0] = ((alpha * tmp[i0]) + (beta * y[i0]));
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/syrk.c
|
#pragma omp parallel for
| 100
|
? -((-(n)+(d)-1)/(d)) : (n)/(d))
#pragma scop
const int ii0_lb = 0, ii0_ub = floord(_PB_N - 1, 32);
<LOOP-START>for (register int ii0 = ii0_lb; ii0 <= ii0_ub; ii0 += 1) {
for (register int ii2 = 0; ii2 <= ii0; ii2 += 1) {
const int i0_lb = 32 * ii0, i0_ub = min(_PB_N - 1, 32 * ii0 + 31);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i2_lb = 32 * ii2, i2_ub = min(32 * ii2 + 31, i0);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
C[i0][i2] *= beta;
}
}
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_M - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i0_lb = 32 * ii0, i0_ub = min(_PB_N - 1, 32 * ii0 + 31);
for (register int i0 = i0_lb; i0 <= i0_ub; i0 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_M - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i3_lb = 32 * ii2, i3_ub = min(32 * ii2 + 31, i0);
for (register int i3 = i3_lb; i3 <= i3_ub; i3 += 1) {
C[i0][i3] += ((alpha * A[i0][i2]) * A[i3][i2]);
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/2mm.c
|
#pragma omp parallel for
| 100
|
(n)/(d))
#pragma scop
if (_PB_NJ >= 1) {
const int ii1_lb = 0, ii1_ub = floord(_PB_NI - 1, 32);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
if (_PB_NL >= 1) {
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NJ - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_NI - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_NJ - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
tmp[i1][i2] = SCALAR_VAL(0.0);
}
}
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NK - 1, 32);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_NI - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_NJ - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i4_lb = 32 * ii4_prim, i4_ub = min(_PB_NK - 1, 32 * ii4_prim + 31);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
tmp[i1][i2] += ((alpha * A[i1][i4]) * B[i4][i2]);
}
}
}
}
}
} else {
const int ii2_lb = 0, ii2_ub = floord(_PB_NJ - 1, 32);
for (register int ii2 = ii2_lb; ii2 <= ii2_ub; ii2 += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_NI - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2, i2_ub = min(_PB_NJ - 1, 32 * ii2 + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
tmp[i1][i2] = SCALAR_VAL(0.0);
}
}
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NK - 1, 32);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_NI - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2, i2_ub = min(_PB_NJ - 1, 32 * ii2 + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i4_lb = 32 * ii4_prim, i4_ub = min(_PB_NK - 1, 32 * ii4_prim + 31);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
tmp[i1][i2] += ((alpha * A[i1][i4]) * B[i4][i2]);
}
}
}
}
}
}
const int ii2_prim_lb = 0, ii2_prim_ub = floord(_PB_NL - 1, 32);
for (register int ii2_prim = ii2_prim_lb; ii2_prim <= ii2_prim_ub; ii2_prim += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_NI - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_NL - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
D[i1][i2] *= beta;
}
}
const int ii4_prim_lb = 0, ii4_prim_ub = floord(_PB_NJ - 1, 32);
for (register int ii4_prim = ii4_prim_lb; ii4_prim <= ii4_prim_ub; ii4_prim += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_NI - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2_prim, i2_ub = min(_PB_NL - 1, 32 * ii2_prim + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
const int i4_lb = 32 * ii4_prim, i4_ub = min(_PB_NJ - 1, 32 * ii4_prim + 31);
for (register int i4 = i4_lb; i4 <= i4_ub; i4 += 1) {
D[i1][i2] += (tmp[i1][i4] * C[i4][i2]);
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/tc-multi/32/2mm.c
|
#pragma omp parallel for
| 100
|
}
}
}
}
}
} else {
const int ii1_lb = 0, ii1_ub = floord(_PB_NI - 1, 32);
<LOOP-START>for (register int ii1 = ii1_lb; ii1 <= ii1_ub; ii1 += 1) {
const int ii2_lb = 0, ii2_ub = floord(_PB_NL - 1, 32);
for (register int ii2 = ii2_lb; ii2 <= ii2_ub; ii2 += 1) {
const int i1_lb = 32 * ii1, i1_ub = min(_PB_NI - 1, 32 * ii1 + 31);
for (register int i1 = i1_lb; i1 <= i1_ub; i1 += 1) {
const int i2_lb = 32 * ii2, i2_ub = min(_PB_NL - 1, 32 * ii2 + 31);
for (register int i2 = i2_lb; i2 <= i2_ub; i2 += 1) {
D[i1][i2] *= beta;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/trmm.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)
| 100
|
de */
if ((_PB_M >= 1) && (_PB_N >= 1)) {
if (_PB_M >= 2) {
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=floord(_PB_M-2,8);t3++) {
for (t4=t3;t4<=floord(_PB_M-1,8);t4++) {
for (t5=8*t3;t5<=min(min(_PB_M-2,8*t3+7),8*t4+6);t5++) {
for (t6=max(8*t4,t5+1);t6<=min(_PB_M-1,8*t4+7);t6++) {
lbv=8*t2;
ubv=min(_PB_N-1,8*t2+7);
#pragma ivdep
#pragma vector always
for (t7=lbv;t7<=ubv;t7++) {
B[t5][t7] += A[t6][t5] * B[t6][t7];;
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/trmm.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)
| 100
|
}
}
}
}
}
}
}
lbp=0;
ubp=floord(_PB_M-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=floord(_PB_N-1,8);t3++) {
for (t4=8*t2;t4<=min(_PB_M-1,8*t2+7);t4++) {
lbv=8*t3;
ubv=min(_PB_N-1,8*t3+7);
#pragma ivdep
#pragma vector always
for (t5=lbv;t5<=ubv;t5++) {
B[t4][t5] = alpha * B[t4][t5];;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/gemm.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)
| 100
|
/* Start of CLooG code */
if ((_PB_NI >= 1) && (_PB_NJ >= 1)) {
lbp=0;
ubp=floord(_PB_NI-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=floord(_PB_NJ-1,8);t3++) {
for (t4=8*t2;t4<=min(_PB_NI-1,8*t2+7);t4++) {
lbv=8*t3;
ubv=min(_PB_NJ-1,8*t3+7);
#pragma ivdep
#pragma vector always
for (t5=lbv;t5<=ubv;t5++) {
C[t4][t5] *= beta;;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/gemm.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)
| 100
|
] *= beta;;
}
}
}
}
if (_PB_NK >= 1) {
lbp=0;
ubp=floord(_PB_NI-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=floord(_PB_NJ-1,8);t3++) {
for (t4=0;t4<=floord(_PB_NK-1,8);t4++) {
for (t5=8*t2;t5<=min(_PB_NI-1,8*t2+7);t5++) {
for (t6=8*t4;t6<=min(_PB_NK-1,8*t4+7);t6++) {
lbv=8*t3;
ubv=min(_PB_NJ-1,8*t3+7);
#pragma ivdep
#pragma vector always
for (t7=lbv;t7<=ubv;t7++) {
C[t5][t7] += alpha * A[t5][t6] * B[t6][t7];;
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/mvt.c
|
#pragma omp parallel for private(lbv,ubv,t2,t3,t4)
| 100
|
egister int lbv, ubv;
/* Start of CLooG code */
if (_PB_N >= 1) {
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t1=lbp;t1<=ubp;t1++) {
for (t2=0;t2<=floord(_PB_N-1,8);t2++) {
for (t3=8*t1;t3<=min(_PB_N-1,8*t1+7);t3++) {
for (t4=8*t2;t4<=min(_PB_N-1,8*t2+7);t4++) {
x1[t3] = x1[t3] + A[t3][t4] * y_1[t4];;
x2[t3] = x2[t3] + A[t4][t3] * y_2[t4];;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t2,t3,t4)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/bicg.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5)
| 100
|
lbp, ubp, lb2, ub2;
register int lbv, ubv;
/* Start of CLooG code */
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
lbv=8*t2;
ubv=min(_PB_N-1,8*t2+7);
#pragma ivdep
#pragma vector always
for (t3=lbv;t3<=ubv;t3++) {
q[t3] = SCALAR_VAL(0.0);;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/bicg.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5)
| 100
|
ubv;t3++) {
q[t3] = SCALAR_VAL(0.0);;
}
}
if (_PB_M >= 1) {
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=floord(_PB_M-1,8);t3++) {
for (t4=8*t2;t4<=min(_PB_N-1,8*t2+7);t4++) {
for (t5=8*t3;t5<=min(_PB_M-1,8*t3+7);t5++) {
q[t4] = q[t4] + A[t4][t5] * p[t5];;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/bicg.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5)
| 100
|
q[t4] = q[t4] + A[t4][t5] * p[t5];;
}
}
}
}
}
lbp=0;
ubp=floord(_PB_M-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
lbv=8*t2;
ubv=min(_PB_M-1,8*t2+7);
#pragma ivdep
#pragma vector always
for (t3=lbv;t3<=ubv;t3++) {
s[t3] = 0;;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/bicg.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5)
| 100
|
r (t3=lbv;t3<=ubv;t3++) {
s[t3] = 0;;
}
}
if (_PB_N >= 1) {
lbp=0;
ubp=floord(_PB_M-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=floord(_PB_N-1,8);t3++) {
for (t4=8*t3;t4<=min(_PB_N-1,8*t3+7);t4++) {
lbv=8*t2;
ubv=min(_PB_M-1,8*t2+7);
#pragma ivdep
#pragma vector always
for (t5=lbv;t5<=ubv;t5++) {
s[t5] = s[t5] + r[t4] * A[t4][t5];;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/syr2k.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)
| 100
|
egister int lbv, ubv;
/* Start of CLooG code */
if (_PB_N >= 1) {
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=floord(_PB_N-1,8);t3++) {
for (t4=8*t2;t4<=min(_PB_N-1,8*t2+7);t4++) {
lbv=8*t3;
ubv=min(_PB_N-1,8*t3+7);
#pragma ivdep
#pragma vector always
for (t5=lbv;t5<=ubv;t5++) {
C[t4][t5] *= beta;;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/syr2k.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)
| 100
|
t5] *= beta;;
}
}
}
}
if (_PB_M >= 1) {
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=floord(_PB_N-1,8);t3++) {
for (t4=0;t4<=floord(_PB_M-1,8);t4++) {
for (t5=8*t2;t5<=min(_PB_N-1,8*t2+7);t5++) {
for (t6=8*t3;t6<=min(_PB_N-1,8*t3+7);t6++) {
for (t7=8*t4;t7<=min(_PB_M-1,8*t4+7);t7++) {
C[t5][t6] += A[t6][t7] * alpha * B[t5][t7] + B[t6][t7] * alpha * A[t5][t7];;
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/gesummv.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5)
| 100
|
egister int lbv, ubv;
/* Start of CLooG code */
if (_PB_N >= 1) {
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
lbv=8*t2;
ubv=min(_PB_N-1,8*t2+7);
#pragma ivdep
#pragma vector always
for (t3=lbv;t3<=ubv;t3++) {
y[t3] = SCALAR_VAL(0.0);;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/gesummv.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5)
| 100
|
(t3=lbv;t3<=ubv;t3++) {
y[t3] = SCALAR_VAL(0.0);;
}
}
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=floord(_PB_N-1,8);t3++) {
for (t4=8*t2;t4<=min(_PB_N-1,8*t2+7);t4++) {
for (t5=8*t3;t5<=min(_PB_N-1,8*t3+7);t5++) {
y[t4] = B[t4][t5] * x[t5] + y[t4];;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/gesummv.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5)
| 100
|
y[t4] = B[t4][t5] * x[t5] + y[t4];;
}
}
}
}
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
lbv=8*t2;
ubv=min(_PB_N-1,8*t2+7);
#pragma ivdep
#pragma vector always
for (t3=lbv;t3<=ubv;t3++) {
tmp[t3] = SCALAR_VAL(0.0);;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/gesummv.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5)
| 100
|
3=lbv;t3<=ubv;t3++) {
tmp[t3] = SCALAR_VAL(0.0);;
}
}
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=floord(_PB_N-1,8);t3++) {
for (t4=8*t2;t4<=min(_PB_N-1,8*t2+7);t4++) {
for (t5=8*t3;t5<=min(_PB_N-1,8*t3+7);t5++) {
tmp[t4] = A[t4][t5] * x[t5] + tmp[t4];;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/gesummv.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5)
| 100
|
p[t4] = A[t4][t5] * x[t5] + tmp[t4];;
}
}
}
}
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
lbv=8*t2;
ubv=min(_PB_N-1,8*t2+7);
#pragma ivdep
#pragma vector always
for (t3=lbv;t3<=ubv;t3++) {
y[t3] = alpha * tmp[t3] + beta * y[t3];;
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/syrk.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)
| 100
|
egister int lbv, ubv;
/* Start of CLooG code */
if (_PB_N >= 1) {
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=t2;t3++) {
for (t4=8*t2;t4<=min(_PB_N-1,8*t2+7);t4++) {
lbv=8*t3;
ubv=min(t4,8*t3+7);
#pragma ivdep
#pragma vector always
for (t5=lbv;t5<=ubv;t5++) {
C[t4][t5] *= beta;;
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)<OMP-END>
|
/ascldap/users/netienn/Research/HPC-Coder/data/ClonedRepos/piotr-skotnicki/tc-optimizer/results/sfs-tiling/pluto/8/syrk.c
|
#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)
| 100
|
t5] *= beta;;
}
}
}
}
if (_PB_M >= 1) {
lbp=0;
ubp=floord(_PB_N-1,8);
<LOOP-START>for (t2=lbp;t2<=ubp;t2++) {
for (t3=0;t3<=t2;t3++) {
for (t4=0;t4<=floord(_PB_M-1,8);t4++) {
for (t5=8*t2;t5<=min(_PB_N-1,8*t2+7);t5++) {
for (t6=8*t3;t6<=min(t5,8*t3+7);t6++) {
for (t7=8*t4;t7<=min(_PB_M-1,8*t4+7);t7++) {
C[t5][t6] += alpha * A[t5][t7] * A[t6][t7];;
}
}
}
}
}
}<LOOP-END> <OMP-START>#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7)<OMP-END>
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.