From d4fe483efd3e0062f12430efe9deb66d43d914d7 Mon Sep 17 00:00:00 2001
From: irungentoo <irungentoo@gmail.com>
Date: Sat, 13 Jul 2013 10:09:38 -0400
Subject: NaCl moved to other repo.

---
 nacl/try-anything.c | 173 ----------------------------------------------------
 1 file changed, 173 deletions(-)
 delete mode 100644 nacl/try-anything.c

(limited to 'nacl/try-anything.c')

diff --git a/nacl/try-anything.c b/nacl/try-anything.c
deleted file mode 100644
index b6847473..00000000
--- a/nacl/try-anything.c
+++ /dev/null
@@ -1,173 +0,0 @@
-/*
- * try-anything.c version 20090215
- * D. J. Bernstein
- * Public domain.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <time.h>
-#include <unistd.h>
-#include <sys/time.h>
-#include <sys/types.h>
-#include <sys/resource.h>
-#include "cpucycles.h"
-
-typedef int uint32;
-
-static uint32 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 in[12];
-static uint32 out[8];
-static int outleft = 0;
-
-#define ROTATE(x,b) (((x) << (b)) | ((x) >> (32 - (b))))
-#define MUSH(i,b) x = t[i] += (((x ^ seed[i]) + sum) ^ ROTATE(x,b));
-
-static void surf(void)
-{
-  uint32 t[12]; uint32 x; uint32 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];
-  }
-}
-
-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;
-  }
-}
-
-extern void preallocate(void);
-extern void allocate(void);
-extern void predoit(void);
-extern void doit(void);
-extern char checksum[];
-extern const char *checksum_compute(void);
-extern const char *primitiveimplementation;
-
-static void printword(const char *s)
-{
-  if (!*s) putchar('-');
-  while (*s) {
-    if (*s == ' ') putchar('_');
-    else if (*s == '\t') putchar('_');
-    else if (*s == '\r') putchar('_');
-    else if (*s == '\n') putchar('_');
-    else putchar(*s);
-    ++s;
-  }
-  putchar(' ');
-}
-
-static void printnum(long long x)
-{
-  printf("%lld ",x);
-}
-
-static void fail(const char *why)
-{
-  printf("%s\n",why);
-  exit(111);
-}
-
-unsigned char *alignedcalloc(unsigned long long len)
-{
-  unsigned char *x = (unsigned char *) calloc(1,len + 256);
-  long long i;
-  if (!x) fail("out of memory");
-  /* will never deallocate so shifting is ok */
-  for (i = 0;i < len + 256;++i) x[i] = random();
-  x += 64;
-  x += 63 & (-(unsigned long) x);
-  for (i = 0;i < len;++i) x[i] = 0;
-  return x;
-}
-
-#define TIMINGS 63
-static long long cycles[TIMINGS + 1];
-
-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
-}
-
-int main()
-{
-  long long i;
-  long long j;
-  long long abovej;
-  long long belowj;
-  long long checksumcycles;
-  long long cyclespersecond;
-  const char *problem;
-
-  cyclespersecond = cpucycles_persecond();
-  preallocate();
-  limits();
-
-  allocate();
-  srandom(getpid());
-
-  cycles[0] = cpucycles();
-  problem = checksum_compute(); if (problem) fail(problem);
-  cycles[1] = cpucycles();
-  checksumcycles = cycles[1] - cycles[0];
-
-  predoit();
-  for (i = 0;i <= TIMINGS;++i) {
-    cycles[i] = cpucycles();
-  }
-  for (i = 0;i <= TIMINGS;++i) {
-    cycles[i] = cpucycles();
-    doit();
-  }
-  for (i = 0;i < TIMINGS;++i) cycles[i] = cycles[i + 1] - cycles[i];
-  for (j = 0;j < TIMINGS;++j) {
-    belowj = 0;
-    for (i = 0;i < TIMINGS;++i) if (cycles[i] < cycles[j]) ++belowj;
-    abovej = 0;
-    for (i = 0;i < TIMINGS;++i) if (cycles[i] > cycles[j]) ++abovej;
-    if (belowj * 2 < TIMINGS && abovej * 2 < TIMINGS) break;
-  }
-
-  printword(checksum);
-  printnum(cycles[j]);
-  printnum(checksumcycles);
-  printnum(cyclespersecond);
-  printword(primitiveimplementation);
-  printf("\n");
-  return 0;
-}
-- 
cgit v1.2.3