From: Luke Kenneth Casson Leighton <lkcl@lkcl.net>
Date: Mon, 18 Apr 2022 20:48:54 +0000 (+0100)
Subject: add mul knuth algorithm by hannah suarez
X-Git-Tag: opf_rfc_ls005_v1~2719
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=51dbabe47930264f11a8c511872f3ebbd49502d3;p=libreriscv.git

add mul knuth algorithm by hannah suarez
---

diff --git a/openpower/sv/bitmanip/mulmnu.c b/openpower/sv/bitmanip/mulmnu.c
new file mode 100644
index 000000000..2acdc08ec
--- /dev/null
+++ b/openpower/sv/bitmanip/mulmnu.c
@@ -0,0 +1,96 @@
+/* from hacker's delight, originsl by hannah suarez (hcs0) */
+// Computes the m+n-halfword product of n halfwords x m halfwords, unsigned.
+// Max line length is 57, to fit in hacker.book.
+#include <stdio.h>
+#include <stdlib.h>     //To define "exit", req'd by XLC.
+
+// w[0], u[0], and v[0] contain the LEAST significant halfwords.
+// (The halfwords are in little-endian order).
+// This is Knuth's Algorithm M from [Knuth Vol. 2 Third edition (1998)]
+// section 4.3.1.  Picture is:
+//                   u[m-1] ... u[1] u[0]
+//                 x v[n-1] ... v[1] v[0]
+//                   --------------------
+//        w[m+n-1] ............ w[1] w[0]
+
+void mulmnu(unsigned short w[], unsigned short u[],
+   unsigned short v[], int m, int n) {
+
+   unsigned int k, t;
+   int i, j;
+
+   for (i = 0; i < m; i++)
+      w[i] = 0;
+
+   for (j = 0; j < n; j++) {
+      k = 0;
+      for (i = 0; i < m; i++) {
+         t = u[i]*v[j] + w[i + j] + k;
+         w[i + j] = t;          // (I.e., t & 0xFFFF).
+         k = t >> 16;
+      }
+      w[j + m] = k;
+   }
+   return;
+}
+
+int errors;
+
+void check(unsigned short result[], unsigned short u[],
+   unsigned short v[], int m, int n, unsigned short correct[]) {
+   int i, j;
+
+   for (i = 0; i < m + n; i++) {
+      if (correct[i] != result[i]) {
+         errors = errors + 1;
+         printf("Error, m = %d, n = %d, u = ", m, n);
+         for (j = 0; j < m; j++) printf(" %04x", u[j]);
+         printf(" v =");
+         for (j = 0; j < n; j++) printf(" %04x", v[j]);
+         printf("\nShould get:");
+         for (j = 0; j < n+m; j++) printf(" %04x", correct[j]);
+         printf("\n       Got:");
+         for (j = 0; j < n+m; j++) printf(" %04x", result[j]);
+         printf("\n");
+         break;
+      }
+   }
+}
+
+int main() {
+   static unsigned short test[] = {
+   //  m, n, u ..., v ..., result.
+      1, 1, 7, 3,                  21,0,
+      1, 1,      2, 0xFFFF,        0xFFFE,0x0001, // 2*FFFF = 0001_FFFE.
+      1, 1, 0xFFFF, 0xFFFF,        1,0xFFFE,
+      1, 2, 7, 5, 6,               35,42,0,
+      1, 2, 65000, 63000, 64000,   0xBDC0,0x8414,0xF7F5,
+      1, 3, 65535, 31000, 32000, 33000, 0x86E8,0xFC17,0xFC17,0x80E7,
+      2, 3, 400, 300, 500, 100, 200, 0x0D40,0xE633,0xADB2,0xEA61,0,
+      2, 3, 400, 65535, 500, 100, 65534, 0x0D40,0x9A4F,0xFE70,0x01F5,0xFFFD,
+      4, 4, 65535, 65535, 65535, 65535, 65535, 65535, 65535, 65535,
+                1,     0,     0,     0, 65534, 65535, 65535, 65535,
+   };
+   int i, n, m, ncases;
+   unsigned short result[10];
+   unsigned short *u, *v;
+
+   printf("mulmnu:\n");
+   i = 0;
+   ncases = 0;
+   while (i < sizeof(test)/2) {
+      m = test[i];
+      n = test[i+1];
+      u = &test[i+2];
+      v = &test[i+2+m];
+      mulmnu(result, u, v, m, n);
+      check (result, u, v, m, n, &test[i+2+m+n]);
+      mulmnu(result, v, u, n, m);       // Interchange operands.
+      check (result, v, u, n, m, &test[i+2+m+n]);
+      i = i + 2 + 2*(m + n);
+      ncases = ncases + 1;
+   }
+
+   if (errors == 0)
+      printf("Passed all %d cases.\n", ncases);
+}