Skip to content

Commit

Permalink
[eval] use #ifdef instead of commenting code
Browse files Browse the repository at this point in the history
  • Loading branch information
Lucas-Wye committed Jan 26, 2025
1 parent 804da11 commit f51b47e
Show file tree
Hide file tree
Showing 7 changed files with 54 additions and 48 deletions.
11 changes: 4 additions & 7 deletions tests/eval/_ntt/ntt.c
Original file line number Diff line number Diff line change
@@ -1,9 +1,6 @@
#include <assert.h>
#include <stdio.h>

// #define USERN 32
// #define DEBUG

// array is of length n=2^l, p is a prime number
// roots is of length l, where g = roots[0] satisfies that
// g^(2^l) == 1 mod p and g^(2^(l-1)) == -1 mod p
Expand Down Expand Up @@ -94,15 +91,15 @@ void ntt(const int *array, int l, const int *twiddle, int p, int *dst) {
"vle32.v v12, 0(%5)\n"

#ifdef DEBUG
"vse32.v v8, 0(%6)\n"// c
"vse32.v v12, 0(%7)\n"// c
"vse32.v v16, 0(%8)\n"// c
"vse32.v v8, 0(%6)\n"
"vse32.v v12, 0(%7)\n"
"vse32.v v16, 0(%8)\n"
#endif

// butterfly operation
"vmul.vv v12, v12, v16\n"
"vrem.vx v12, v12, %3\n"
"vadd.vv v16, v8, v12\n" // TODO: will it overflow?
"vadd.vv v16, v8, v12\n" // NOTE: use lazy reduction here
"vsub.vv v20, v8, v12\n"
// save half coefficients
"vse32.v v16, 0(%4)\n"
Expand Down
18 changes: 10 additions & 8 deletions tests/eval/_ntt/ntt_1024_main.c
Original file line number Diff line number Diff line change
Expand Up @@ -148,12 +148,14 @@ void test() {
int dst[1024];
ntt(arr, l, twiddle, p, dst);

// for (int i = 0; i < n; i++) {
// printf("%d", dst[i]);
// if ((i + 1) % 8 == 0) {
// printf("\n");
// } else {
// printf(" ");
// }
// }
#ifdef DEBUG
for (int i = 0; i < n; i++) {
printf("%d", dst[i]);
if ((i + 1) % 8 == 0) {
printf("\n");
} else {
printf(" ");
}
}
#endif
}
18 changes: 10 additions & 8 deletions tests/eval/_ntt/ntt_128_main.c
Original file line number Diff line number Diff line change
Expand Up @@ -48,12 +48,14 @@ void test() {
int dst[128];
ntt(arr, l, twiddle, p, dst);

// for (int i = 0; i < n; i++) {
// printf("%d", dst[i]);
// if ((i + 1) % 8 == 0) {
// printf("\n");
// } else {
// printf(" ");
// }
// }
#ifdef DEBUG
for (int i = 0; i < n; i++) {
printf("%d", dst[i]);
if ((i + 1) % 8 == 0) {
printf("\n");
} else {
printf(" ");
}
}
#endif
}
18 changes: 10 additions & 8 deletions tests/eval/_ntt/ntt_256_main.c
Original file line number Diff line number Diff line change
Expand Up @@ -64,12 +64,14 @@ void test() {
int dst[256];
ntt(arr, l, twiddle, p, dst);

// for (int i = 0; i < n; i++) {
// printf("%d", dst[i]);
// if ((i + 1) % 8 == 0) {
// printf("\n");
// } else {
// printf(" ");
// }
// }
#ifdef DEBUG
for (int i = 0; i < n; i++) {
printf("%d", dst[i]);
if ((i + 1) % 8 == 0) {
printf("\n");
} else {
printf(" ");
}
}
#endif
}
18 changes: 10 additions & 8 deletions tests/eval/_ntt/ntt_4096_main.c
Original file line number Diff line number Diff line change
Expand Up @@ -459,12 +459,14 @@ void test() {
int dst[4096];
ntt(arr, l, twiddle, p, dst);

// for (int i = 0; i < n; i++) {
// printf("%d", dst[i]);
// if ((i + 1) % 8 == 0) {
// printf("\n");
// } else {
// printf(" ");
// }
// }
#ifdef DEBUG
for (int i = 0; i < n; i++) {
printf("%d", dst[i]);
if ((i + 1) % 8 == 0) {
printf("\n");
} else {
printf(" ");
}
}
#endif
}
18 changes: 10 additions & 8 deletions tests/eval/_ntt/ntt_512_main.c
Original file line number Diff line number Diff line change
Expand Up @@ -94,12 +94,14 @@ void test() {
int dst[512];
ntt(arr, l, twiddle, p, dst);

// for (int i = 0; i < n; i++) {
// printf("%d", dst[i]);
// if ((i + 1) % 8 == 0) {
// printf("\n");
// } else {
// printf(" ");
// }
// }
#ifdef DEBUG
for (int i = 0; i < n; i++) {
printf("%d", dst[i]);
if ((i + 1) % 8 == 0) {
printf("\n");
} else {
printf(" ");
}
}
#endif
}
1 change: 0 additions & 1 deletion tests/eval/_ntt/ntt_64_main.c
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,6 @@

#include <stdio.h>
#include <assert.h>
// #define DEBUG

void ntt(const int *array, int l, const int *twiddle, int p, int *dst);

Expand Down

0 comments on commit f51b47e

Please sign in to comment.