Skip to content

Commit

Permalink
Merge pull request #21 from edin-dal/hotfix/plus-equal-in-computation
Browse files Browse the repository at this point in the history
bug fixed: make the computation always use += instead of =
  • Loading branch information
mtghorbani authored Jul 16, 2024
2 parents 5eba1c9 + 97537ca commit 690f24a
Show file tree
Hide file tree
Showing 88 changed files with 192 additions and 192 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -598,7 +598,7 @@ object Codegen {
accesses,
symbols,
codeLang,
if (ind > 0) kind else RedundancyMap
kind
)
}
}
Expand Down
6 changes: 3 additions & 3 deletions src/test/resources/correct_test_outputs/LRA_w_body.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -61,21 +61,21 @@ for (int i = 0; i < N; ++i) {

for (int j = max({i, 0}); j < N; ++j) {

A[i][j] = (f[i] * f[j]);
A[i][j] += (f[i] * f[j]);
}
}
for (int i = 0; i < N; ++i) {

for (int j = max({i, 0}); j < N; ++j) {

B[i][j] = (g[i] * g[j]);
B[i][j] += (g[i] * g[j]);
}
}
for (int i = 0; i < N; ++i) {

for (int j = max({i, 0}); j < N; ++j) {

C[i][j] = (f[i] * f[j]);
C[i][j] += (f[i] * f[j]);
}
}
for (int i = 0; i < N; ++i) {
Expand Down
6 changes: 3 additions & 3 deletions src/test/resources/correct_test_outputs/LRA_wo_body.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -17,21 +17,21 @@ for (int i = 0; i < N; ++i) {

for (int j = max({i, 0}); j < N; ++j) {

A[i][j] = (f[i] * f[j]);
A[i][j] += (f[i] * f[j]);
}
}
for (int i = 0; i < N; ++i) {

for (int j = max({i, 0}); j < N; ++j) {

B[i][j] = (g[i] * g[j]);
B[i][j] += (g[i] * g[j]);
}
}
for (int i = 0; i < N; ++i) {

for (int j = max({i, 0}); j < N; ++j) {

C[i][j] = (f[i] * f[j]);
C[i][j] += (f[i] * f[j]);
}
}
for (int i = 0; i < N; ++i) {
Expand Down
2 changes: 1 addition & 1 deletion src/test/resources/correct_test_outputs/LRC_w_body.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -36,7 +36,7 @@ for (int i = 0; i < N; ++i) {

for (int j = max({i, 0}); j < N; ++j) {

A[i][j] = (f[i] * f[j]);
A[i][j] += (f[i] * f[j]);
}
}
end_computation = duration_cast<microseconds>(system_clock::now().time_since_epoch()).count();
Expand Down
2 changes: 1 addition & 1 deletion src/test/resources/correct_test_outputs/LRC_wo_body.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,7 @@ for (int i = 0; i < N; ++i) {

for (int j = max({i, 0}); j < N; ++j) {

A[i][j] = (f[i] * f[j]);
A[i][j] += (f[i] * f[j]);
}
}
end_computation = duration_cast<microseconds>(system_clock::now().time_since_epoch()).count();
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -79,7 +79,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B[i][k][l] * C[k][j] * D[l][j]);
A[i][j] += (B[i][k][l] * C[k][j] * D[l][j]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -84,7 +84,7 @@ for (int l = 0; l < P; ++l) {

int j = J;
if (j >= 0 && j < Q) {
D2[l] = D[l][j];
D2[l] += D[l][j];
}
}
for (int k = 0; k < N; ++k) {
Expand All @@ -93,7 +93,7 @@ for (int l = 0; l < P; ++l) {

int i = I;
if (i >= 0 && i < M) {
B2[k][l] = B[i][k][l];
B2[k][l] += B[i][k][l];
}
}
}
Expand All @@ -106,7 +106,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B2[k][l] * C[k][j] * D2[l]);
A[i][j] += (B2[k][l] * C[k][j] * D2[l]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B[i][k][l] * C[k][j] * D[l][j]);
A[i][j] += (B[i][k][l] * C[k][j] * D[l][j]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ for (int l = 0; l < P; ++l) {

int j = J;
if (j >= 0 && j < Q) {
D2[l] = D[l][j];
D2[l] += D[l][j];
}
}
for (int k = 0; k < N; ++k) {
Expand All @@ -23,7 +23,7 @@ for (int l = 0; l < P; ++l) {

int i = I;
if (i >= 0 && i < M) {
B2[k][l] = B[i][k][l];
B2[k][l] += B[i][k][l];
}
}
}
Expand All @@ -36,7 +36,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B2[k][l] * C[k][j] * D2[l]);
A[i][j] += (B2[k][l] * C[k][j] * D2[l]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -78,7 +78,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B[i][k][l] * C[k][j] * D[l][j]);
A[i][j] += (B[i][k][l] * C[k][j] * D[l][j]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -81,7 +81,7 @@ for (int l = 0; l < P; ++l) {

int i = I;
if (i >= 0 && i < M) {
B2[k][l] = B[i][k][l];
B2[k][l] += B[i][k][l];
}
}
}
Expand All @@ -94,7 +94,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B2[k][l] * C[k][j] * D[l][j]);
A[i][j] += (B2[k][l] * C[k][j] * D[l][j]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B[i][k][l] * C[k][j] * D[l][j]);
A[i][j] += (B[i][k][l] * C[k][j] * D[l][j]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@ for (int l = 0; l < P; ++l) {

int i = I;
if (i >= 0 && i < M) {
B2[k][l] = B[i][k][l];
B2[k][l] += B[i][k][l];
}
}
}
Expand All @@ -29,7 +29,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B2[k][l] * C[k][j] * D[l][j]);
A[i][j] += (B2[k][l] * C[k][j] * D[l][j]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -78,7 +78,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B[i][k][l] * C[k][j] * D[l][j]);
A[i][j] += (B[i][k][l] * C[k][j] * D[l][j]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -75,7 +75,7 @@ for (int l = 0; l < P; ++l) {

int j = J;
if (j >= 0 && j < Q) {
D2[l] = D[l][j];
D2[l] += D[l][j];
}
}
long time_computation = 0, start_computation, end_computation;
Expand All @@ -88,7 +88,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B[i][k][l] * C[k][j] * D2[l]);
A[i][j] += (B[i][k][l] * C[k][j] * D2[l]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B[i][k][l] * C[k][j] * D[l][j]);
A[i][j] += (B[i][k][l] * C[k][j] * D[l][j]);
}
}
}
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ for (int l = 0; l < P; ++l) {

int j = J;
if (j >= 0 && j < Q) {
D2[l] = D[l][j];
D2[l] += D[l][j];
}
}
long time_computation = 0, start_computation, end_computation;
Expand All @@ -27,7 +27,7 @@ for (int k = 0; k < N; ++k) {

for (int l = 0; l < P; ++l) {

A[i][j] = (B[i][k][l] * C[k][j] * D2[l]);
A[i][j] += (B[i][k][l] * C[k][j] * D2[l]);
}
}
}
Expand Down
2 changes: 1 addition & 1 deletion src/test/resources/correct_test_outputs/PGLM_w_body.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -45,7 +45,7 @@ int i = 0;
if (i >= 0 && i < W) {
for (int j = 0; j < W; ++j) {

A[i] = (B[i][j] * C[j]);
A[i] += (B[i][j] * C[j]);
}
}
for (int i = max({0, 1}); i < W; ++i) {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -50,22 +50,22 @@ for (int j = 0; j < W; ++j) {

int i = 0;
if (i >= 0 && i < W) {
B1[j] = B[i][j];
B1[j] += B[i][j];
}
}
for (int i = max({1, 0}); i < W; ++i) {

int j = (i - 1);
if (j >= 0 && j < W) {
B2[j] = B[i][j];
B2[j] += B[i][j];
}
}
long time_computation = 0, start_computation, end_computation;
start_computation = duration_cast<microseconds>(system_clock::now().time_since_epoch()).count();
int i = 0;
for (int i30 = 0; i30 < W; ++i30) {

A[i] = (B1[i30] * C[i30]);
A[i] += (B1[i30] * C[i30]);
}
for (int i = 1; i < W; ++i) {

Expand Down
2 changes: 1 addition & 1 deletion src/test/resources/correct_test_outputs/PGLM_wo_body.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,7 @@ int i = 0;
if (i >= 0 && i < W) {
for (int j = 0; j < W; ++j) {

A[i] = (B[i][j] * C[j]);
A[i] += (B[i][j] * C[j]);
}
}
for (int i = max({0, 1}); i < W; ++i) {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -14,22 +14,22 @@ for (int j = 0; j < W; ++j) {

int i = 0;
if (i >= 0 && i < W) {
B1[j] = B[i][j];
B1[j] += B[i][j];
}
}
for (int i = max({1, 0}); i < W; ++i) {

int j = (i - 1);
if (j >= 0 && j < W) {
B2[j] = B[i][j];
B2[j] += B[i][j];
}
}
long time_computation = 0, start_computation, end_computation;
start_computation = duration_cast<microseconds>(system_clock::now().time_since_epoch()).count();
int i = 0;
for (int i28 = 0; i28 < W; ++i28) {

A[i] = (B1[i28] * C[i28]);
A[i] += (B1[i28] * C[i28]);
}
for (int i = 1; i < W; ++i) {

Expand Down
Loading

0 comments on commit 690f24a

Please sign in to comment.