From 3ca227f1137e6a3b65bc33f5689e1c230d591595 Mon Sep 17 00:00:00 2001
From: Andres Erbsen <andreser@mit.edu>
Date: Tue, 8 Jan 2019 04:21:38 -0500
Subject: remove old pipeline

---
 etc/measure.c | 121 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 121 insertions(+)
 create mode 100644 etc/measure.c

(limited to 'etc')

diff --git a/etc/measure.c b/etc/measure.c
new file mode 100644
index 000000000..8b206550e
--- /dev/null
+++ b/etc/measure.c
@@ -0,0 +1,121 @@
+/*
+ * Benchmarking utilities extracted from SUPERCOP by Andres Erbsen
+ * based on measure-anything.c version 20120328 and measure.c
+ * by D. J. Bernstein
+ * Public domain.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <string.h>
+#include <time.h>
+#include <sys/time.h>
+#include <sys/types.h>
+#include <sys/resource.h>
+
+// cpucycles_amd64cpuinfo
+long long cpucycles(void)
+{
+  unsigned long long result;
+  asm volatile(".byte 15;.byte 49;shlq $32,%%rdx;orq %%rdx,%%rax"
+    : "=a" (result) ::  "%rdx");
+  return result;
+}
+
+// SUPERCOP randombytes
+static uint32_t seed[32] = { 3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3,2,3,8,4,6,2,6,4,3,3,8,3,2,7,9,5 } ;
+static uint32_t in[12];
+static uint32_t out[8];
+static int outleft = 0;
+static void surf(void)
+{
+  #define ROTATE(x,b) (((x) << (b)) | ((x) >> (32 - (b))))
+  #define MUSH(i,b) x = t[i] += (((x ^ seed[i]) + sum) ^ ROTATE(x,b));
+  uint32_t t[12]; uint32_t x; uint32_t sum = 0;
+  int r; int i; int loop;
+
+  for (i = 0;i < 12;++i) t[i] = in[i] ^ seed[12 + i];
+  for (i = 0;i < 8;++i) out[i] = seed[24 + i];
+  x = t[11];
+  for (loop = 0;loop < 2;++loop) {
+    for (r = 0;r < 16;++r) {
+      sum += 0x9e3779b9;
+      MUSH(0,5) MUSH(1,7) MUSH(2,9) MUSH(3,13)
+      MUSH(4,5) MUSH(5,7) MUSH(6,9) MUSH(7,13)
+      MUSH(8,5) MUSH(9,7) MUSH(10,9) MUSH(11,13)
+    }
+    for (i = 0;i < 8;++i) out[i] ^= t[i + 4];
+  }
+  #undef ROTATE
+  #undef MUSH
+}
+void randombytes(unsigned char *x,unsigned long long xlen)
+{
+  while (xlen > 0) {
+    if (!outleft) {
+      if (!++in[0]) if (!++in[1]) if (!++in[2]) ++in[3];
+      surf();
+      outleft = 8;
+    }
+    *x = out[--outleft];
+    ++x;
+    --xlen;
+  }
+}
+
+// SUPERCOP limits
+void limits()
+{
+#ifdef RLIM_INFINITY
+  struct rlimit r;
+  r.rlim_cur = 0;
+  r.rlim_max = 0;
+#ifdef RLIMIT_NOFILE
+  setrlimit(RLIMIT_NOFILE,&r);
+#endif
+#ifdef RLIMIT_NPROC
+  setrlimit(RLIMIT_NPROC,&r);
+#endif
+#ifdef RLIMIT_CORE
+  setrlimit(RLIMIT_CORE,&r);
+#endif
+#endif
+}
+
+void UUT(unsigned char*);
+
+// place the call to UUT in a separate function, because gcc prohibits
+// use of bp in inline assembly if you have a variable-length array or
+// alloca in the code; see
+// https://stackoverflow.com/questions/46248430/how-can-i-determine-preferably-at-compile-time-whether-gcc-is-using-rbp-based?noredirect=1#comment79462384_46248430
+void __attribute__ ((noinline)) measure_helper(int n, unsigned char *buf, long long* cycles)
+{
+  for (int i = 0;i <= n;++i) {
+	  cycles[i] = cpucycles();
+	  UUT(buf);
+  }
+}
+
+void measure(int n)
+{
+  unsigned char *buf = aligned_alloc(64, 1024);
+  long long* cycles = calloc(n + 1, sizeof(long long));
+
+  measure_helper(n, buf, cycles);
+  for (int i = 0;i < n;++i) cycles[i] = cycles[i + 1] - cycles[i];
+  for (int i = 0;i < n;++i) printf("%lld\n", cycles[i]);
+
+    __asm__ __volatile__("" :: "m" (buf)); // do not optimize buf away
+  free(cycles);
+}
+
+int main(int argc, char** argv)
+{
+  int n = 0;
+  if (argc != 2) return 111;
+  sscanf(argv[1], "%d", &n);
+  limits();
+  measure(n);
+  return 0;
+}
-- 
cgit v1.2.3