forked from ibphoenix/tomsfastmath
50 lines
996 B
C
50 lines
996 B
C
/* program emits a NxN comba multiplier */
|
|
#include <stdio.h>
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
int N, x, y, z;
|
|
N = atoi(argv[1]);
|
|
|
|
/* print out preamble */
|
|
printf(
|
|
"void fp_mul_comba%d(fp_int *A, fp_int *B, fp_int *C)\n"
|
|
"{\n"
|
|
" fp_digit c0, c1, c2, at[%d];\n"
|
|
"\n"
|
|
" memcpy(at, A->dp, %d * sizeof(fp_digit));\n"
|
|
" memcpy(at+%d, B->dp, %d * sizeof(fp_digit));\n"
|
|
" COMBA_START;\n"
|
|
"\n"
|
|
" COMBA_CLEAR;\n", N, N+N, N, N, N, N);
|
|
|
|
/* now do the rows */
|
|
for (x = 0; x < (N+N-1); x++) {
|
|
printf(
|
|
" /* %d */\n", x);
|
|
if (x > 0) {
|
|
printf(
|
|
" COMBA_FORWARD;\n");
|
|
}
|
|
for (y = 0; y < N; y++) {
|
|
for (z = 0; z < N; z++) {
|
|
if ((y+z)==x) {
|
|
printf(" MULADD(at[%d], at[%d]); ", y, z+N);
|
|
}
|
|
}
|
|
}
|
|
printf(
|
|
"\n"
|
|
" COMBA_STORE(C->dp[%d]);\n", x);
|
|
}
|
|
printf(
|
|
" COMBA_STORE2(C->dp[%d]);\n"
|
|
" C->used = %d;\n"
|
|
" C->sign = A->sign ^ B->sign;\n"
|
|
" fp_clamp(C);\n"
|
|
" COMBA_FINI;\n"
|
|
"}\n\n\n", N+N-1, N+N, N+N);
|
|
|
|
return 0;
|
|
}
|