Initial revision

buddy/examples/adder/adder.cxx

@@ -0,0 +1,218 @@
+/*************************************************************************
+  FILE:  adder.cc
+  DESCR: BDD implementation of an N bit adder.
+  AUTH:  Jorn Lind
+  DATE:  feb 1998
+*************************************************************************/
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "bdd.h"
+
+int N;
+
+bdd *ainp;
+bdd *binp;
+bdd *co;
+bdd *xout;
+
+
+/*************************************************************************
+  Adder
+*************************************************************************/
+
+void build_adder(void)
+{
+   int n;
+   
+   for (n=0 ; n<N ; n++)
+   {
+      if (n > 0)
+      {
+	 xout[n] = ainp[n] ^ binp[n] ^ co[n-1];
+	 co[n] = ainp[n] & binp[n] |
+                 ainp[n] & co[n-1] |
+	         binp[n] & co[n-1];
+      }
+      else
+      {
+	 xout[n] = ainp[n] ^ binp[n];
+	 co[n] = ainp[n] & binp[n];
+      }
+   }
+}
+
+
+int main(int argc, char **argv)
+{
+   int method=BDD_REORDER_NONE;
+   int n;
+   
+   if(argc < 2 || argc > 3)
+   {
+      cout << "usage: adder N R\n";
+      cout << "       N number of bits\n";
+      cout << "       R -> enable reordering if R is win2,win2ite,win3,win3ite,sift,siftite\n";
+      cout << "            in this case 'adder' starts with a worst case ordering\n";
+      exit(1);
+   }
+   
+   N = atoi(argv[1]);
+   if (N <= 0)
+   {
+      cout << "The number of bits must be more than zero\n";
+      exit(2);
+   }
+
+   if (argc == 3)
+   {
+      if (strcmp(argv[2], "win2") == 0)
+	 method = BDD_REORDER_WIN2;
+      else
+      if (strcmp(argv[2], "win2ite") == 0)
+	 method = BDD_REORDER_WIN2ITE;
+      else
+      if (strcmp(argv[2], "win3") == 0)
+	 method = BDD_REORDER_WIN3;
+      else
+      if (strcmp(argv[2], "win3ite") == 0)
+	 method = BDD_REORDER_WIN3ITE;
+      else
+      if (strcmp(argv[2], "sift") == 0)
+	 method = BDD_REORDER_SIFT;
+      else
+      if (strcmp(argv[2], "siftite") == 0)
+	 method = BDD_REORDER_SIFTITE;
+      else
+      if (strcmp(argv[2], "rand") == 0)
+	 method = BDD_REORDER_RANDOM;
+   }
+   
+   long c0 = clock();
+   
+   bdd_init(500,1000);
+   bdd_setvarnum(2*N);
+      
+   ainp = new bdd[N];
+   binp = new bdd[N];
+   co = new bdd[N];
+   xout = new bdd[N];
+   
+   for (n=0 ; n<N ; n++)
+   {
+      if (method == BDD_REORDER_NONE)
+      {
+	 ainp[n] = bdd_ithvar(2*n);
+	 binp[n] = bdd_ithvar(2*n+1);
+      }
+      else
+      {
+	 ainp[n] = bdd_ithvar(n);
+	 binp[n] = bdd_ithvar(N+n);
+      }
+   }
+
+   for (n=0 ; n<N ; n++)
+   {
+      bdd_addvarblock(ainp[n],1);
+      bdd_addvarblock(binp[n],1);
+   }
+
+   //bdd_autoreorder(method);
+   //bdd_reorder_verbose(2);
+   build_adder();
+   
+   if (method != BDD_REORDER_NONE)
+   {
+      cout << "Sizes before reordering:\n";
+      for (n=0 ; n<N ; n++)
+	 cout << "Out[" << n << "]: " << bdd_nodecount(xout[n]) << " nodes\n";
+
+      long c1 = clock();
+      cout << (float)(c1-c0)/(float)(CLOCKS_PER_SEC) << " sec.\n";
+      
+      bdd_reorder(method);
+      cout << "Sizes after reordering:\n";
+   }
+   else
+      cout << "Sizes:\n";
+
+   long c1 = clock();
+   
+   for (n=0 ; n<N ; n++)
+      cout << "Out[" << n << "]: " << bdd_nodecount(xout[n]) << " nodes\n";
+   
+   cout << (float)(c1-c0)/(float)(CLOCKS_PER_SEC) << " sec.\n";
+}
+
+
+
+/*=== DEBUGING =========================================================*/
+
+bdd setval(int val, int v)
+{
+   bdd x = bddtrue;
+   
+   for (int n=0 ; n<N ; n++)
+   {
+      if (val & 1)
+      {
+	 if (v == 0)
+	    x &= ainp[n];
+	 else
+	    x &= binp[n];
+      }
+      else
+      {
+	 if (v == 0)
+	    x &= !ainp[n];
+	 else
+	    x &= !binp[n];
+      }
+
+      val = val >> 1;
+   }
+
+   return x;
+}
+
+
+int test_vector(bdd av, bdd bv, int a, int b)
+{
+   int res = a+b;
+
+   for (int n=0 ; n<N ; n++)
+   {
+      bdd resv = av & bv & xout[n];
+      
+      if (resv == bddfalse && (res & 1) || resv != bddfalse && !(res & 1))
+	 return 0;
+
+      res = res >> 1;
+   }
+
+   return 1;
+}
+
+
+int test_adder(void)
+{
+   int m = 1 << N;
+   
+   for (int a=0 ; a<m ; a++)
+   {
+      for (int b=0 ; b<m ; b++)
+      {
+	 bdd av = setval(a,0);
+	 bdd bv = setval(b,1);
+
+	 if (test_vector(av,bv,a,b) == 0)
+	    return 0;
+      }
+   }
+
+   return 1;
+}
+
+
+/* EOF */

buddy/examples/adder/makefile

@@ -0,0 +1,36 @@
+# --------------------------------
+# Makefile for adder test example
+# --------------------------------
+
+# --- Compiler flags
+CFLAGS = -g -pedantic -Wall -ansi -L../../src -I../../src
+
+# --- C++ compiler
+CPP = g++
+
+# --- C compiler
+CC = gcc
+
+
+# --- Do not touch ---
+
+.SUFFIXES: .cxx .c
+
+.cxx.o:
+	$(CPP) $(CFLAGS) -c $<
+
+.c.o:
+	$(CC) $(CFLAGS) -c $<
+
+adder:	adder.o bddlib
+	$(CPP) $(CFLAGS) adder.o -o adder -lbdd -lm
+
+bddlib:
+	cd ../..; make
+
+clean:
+	rm -f *~
+	rm -f *.o
+	rm -f adder
+
+adder.o:	../../src/bdd.h