view tomsfastmath/src/generators/comba_mult_smallgen.c @ 643:a362b62d38b2 dropbear-tfm

Add tomsfastmath from git rev bfa4582842bc3bab42e4be4aed5703437049502a with Makefile.in renamed
author Matt Johnston <matt@ucc.asn.au>
date Wed, 23 Nov 2011 18:10:20 +0700
parents
children
line wrap: on
line source
/* program emits a NxN comba multiplier for 1x1 to 16x16 */
#include <stdio.h>

int main(int argc, char **argv)
{
   int N, x, y, z;

   /* print out preamble */
printf(
"void fp_mul_comba_small(fp_int *A, fp_int *B, fp_int *C)\n"
"{\n"
"   fp_digit c0, c1, c2, at[32];\n"
"   switch (MAX(A->used, B->used)) { \n"
);

for (N = 1; N <= 16; N++) {

printf(
"\n"
"   case %d:\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);

   /* 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"
"      break;\n", N+N-1, N+N);
}
printf("   }\n}\n\n");

  return 0;
}

/* $Source$ */
/* $Revision$ */
/* $Date$ */