Reorganize and commit all the modified TACLeBench code and run scripts

8 files changed, 3344 insertions, 0 deletions

diff --git a/baseline/source/rijndael_dec/ChangeLog.txt b/baseline/source/rijndael_dec/ChangeLog.txt
new file mode 100644
index 0000000..75e26a8
--- /dev/null
+++ b/baseline/source/rijndael_dec/ChangeLog.txt
@@ -0,0 +1,58 @@
+File: rijndael_decoder.c
+Source: security section of MiBench
+
+- Prefix library functions with rijndael_dec
+- Move functionality from function main into functions
+  rijndael_enc_init, rijndael_enc_main, and rijndael_enc_return
+  (reusing code from rijndael_enc benchmark)
+- Added general TACLeBench header to beginning of source code
+- Applied code formatting with astyle as in the example
+- Rename to rijndael_dec.c
+- Make loop counter in rijndael_dec_init unsigned
+- Remove dead code in rijndael_dec_decfile
+
+File: aes.h
+Source: security section of MiBench
+
+2016-04-20:
+- Replace with file aes.h from rijndael_enc benchmark
+- Declare prototype for rijndael_enc_decrypt instead of rijndael_enc_encrypt
+
+File: aes.c
+Source: security section of MiBench
+
+2016-04-20:
+- Replace with file aes.h from rijndael_enc benchmark, using prefix
+  rijndael_dec
+- Replace implementation for rijndael_enc_encrypt with implementation
+  for rijndael_enc_decrypt
+- Applied code formatting with astyle as in the example
+- Remove unused macros s, ff_poly, ff_hi, m1, m2, m3, FFmulX,
+  fwd_mcol, fwd_var, inv_var, si, so, fwd_rnd, inv_rnd, fwd_lrnd,
+  inv_lrnd, locals, l_copy, state_in, state_out, round
+
+2016-06-14:
+- Added cast to make C++ compiler happy
+
+File: aestab.h
+Source: security section of MiBench
+
+2016-04-20:
+- Replace with file aestab.h from rijndael_enc benchmark, using prefix
+  rijndael_dec
+- Remove unused arrays rijndael_dec_s_box, rijndael_dec_inv_s_box,
+  rijndael_dec_ft_tab
+
+Files: glibc_common.c, my_file.c, glibc_common.h, my_file.h
+Source: security section of MiBench
+
+2016-04-20:
+- Replace with files rijndael_enc_libc.c and rijndael_enc_libc.h from
+  rijndael_enc benchmark (renamed to rijndael_dec_libc.c and
+  rijndael_dec_libc.h, using prefix rijndael_dec)
+
+File: input_small_enc.c
+Source: security section of MiBench
+
+2016-02-26:
+- Prefix input array with rijndael_dec
diff --git a/baseline/source/rijndael_dec/aes.c b/baseline/source/rijndael_dec/aes.c
new file mode 100644
index 0000000..f47adfd
--- /dev/null
+++ b/baseline/source/rijndael_dec/aes.c
@@ -0,0 +1,406 @@
+/*
+  -----------------------------------------------------------------------
+  Copyright (c) 2001 Dr Brian Gladman <brg@gladman.uk.net>, Worcester, UK
+
+  TERMS
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions
+  are met:
+  1. Redistributions of source code must retain the above copyright
+     notice, this list of conditions and the following disclaimer.
+  2. Redistributions in binary form must reproduce the above copyright
+     notice, this list of conditions and the following disclaimer in the
+     documentation and/or other materials provided with the distribution.
+
+  This software is provided 'as is' with no guarantees of correctness or
+  fitness for purpose.
+  -----------------------------------------------------------------------
+
+  FUNCTION
+
+  The AES algorithm Rijndael implemented for block and key sizes of 128,
+  bits (16 bytes) by Brian Gladman.
+
+  This is an implementation of the AES encryption algorithm (Rijndael)
+  designed by Joan Daemen and Vincent Rijmen.
+*/
+
+#include "aes.h"
+
+#include "aestab.h"
+
+#define four_tables(x,tab,vf,rf,c)  ( tab[0][bval(vf(x,0,c),rf(0,c))] ^ \
+                                      tab[1][bval(vf(x,1,c),rf(1,c))] ^ \
+                                      tab[2][bval(vf(x,2,c),rf(2,c))] ^ \
+                                      tab[3][bval(vf(x,3,c),rf(3,c))] )
+
+#define vf1(x,r,c)  (x)
+#define rf1(r,c)    (r)
+#define rf2(r,c)    ((r-c)&3)
+
+#define ls_box(x,c)     four_tables(x,rijndael_dec_fl_tab,vf1,rf2,c)
+
+#define inv_mcol(x)     four_tables(x,rijndael_dec_im_tab,vf1,rf1,0)
+
+/*
+  Subroutine to set the block size (if variable) in bytes, legal
+  values being 16, 24 and 32.
+*/
+
+#define nc   (Ncol)
+
+/*
+  Initialise the key schedule from the user supplied key. The key
+  length is now specified in bytes - 16, 24 or 32 as appropriate.
+  This corresponds to bit lengths of 128, 192 and 256 bits, and
+  to Nk values of 4, 6 and 8 respectively.
+*/
+
+#define mx(t,f) (*t++ = inv_mcol(*f),f++)
+#define cp(t,f) *t++ = *f++
+
+#define cpy(d,s)    do { cp(d,s); cp(d,s); cp(d,s); cp(d,s); } while (0)
+#define mix(d,s)    do { mx(d,s); mx(d,s); mx(d,s); mx(d,s); } while (0)
+
+aes_ret rijndael_dec_set_key( byte in_key[], const word n_bytes,
+                              const enum aes_key f, struct aes *cx )
+{
+  word    *kf, *kt, rci;
+
+  if ( ( n_bytes & 7 ) || n_bytes < 16 || n_bytes > 32 || ( !( f & 1 ) &&
+       !( f & 2 ) ) )
+    return ( n_bytes ? cx->mode &= ~0x03, aes_bad : ( aes_ret )( cx->Nkey << 2 ) );
+
+  cx->mode = ( cx->mode & ~0x03 ) | ( ( byte )f & 0x03 );
+  cx->Nkey = n_bytes >> 2;
+  cx->Nrnd = Nr( cx->Nkey, ( word )nc );
+
+  cx->e_key[0] = word_in( in_key     );
+  cx->e_key[1] = word_in( in_key +  4 );
+  cx->e_key[2] = word_in( in_key +  8 );
+  cx->e_key[3] = word_in( in_key + 12 );
+
+  kf = cx->e_key;
+  kt = kf + nc * ( cx->Nrnd + 1 ) - cx->Nkey;
+  rci = 0;
+
+  switch ( cx->Nkey ) {
+    case 4:
+      _Pragma( "loopbound min 0 max 0" )
+      do {
+        kf[4] = kf[0] ^ ls_box( kf[3], 3 ) ^ rijndael_dec_rcon_tab[rci++];
+        kf[5] = kf[1] ^ kf[4];
+        kf[6] = kf[2] ^ kf[5];
+        kf[7] = kf[3] ^ kf[6];
+        kf += 4;
+      } while ( kf < kt );
+      break;
+
+    case 6:
+      cx->e_key[4] = word_in( in_key + 16 );
+      cx->e_key[5] = word_in( in_key + 20 );
+      _Pragma( "loopbound min 0 max 0" )
+      do {
+        kf[ 6] = kf[0] ^ ls_box( kf[5], 3 ) ^ rijndael_dec_rcon_tab[rci++];
+        kf[ 7] = kf[1] ^ kf[ 6];
+        kf[ 8] = kf[2] ^ kf[ 7];
+        kf[ 9] = kf[3] ^ kf[ 8];
+        kf[10] = kf[4] ^ kf[ 9];
+        kf[11] = kf[5] ^ kf[10];
+        kf += 6;
+      } while ( kf < kt );
+      break;
+
+    case 8:
+      cx->e_key[4] = word_in( in_key + 16 );
+      cx->e_key[5] = word_in( in_key + 20 );
+      cx->e_key[6] = word_in( in_key + 24 );
+      cx->e_key[7] = word_in( in_key + 28 );
+      _Pragma( "loopbound min 7 max 7" )
+      do {
+        kf[ 8] = kf[0] ^ ls_box( kf[7], 3 ) ^ rijndael_dec_rcon_tab[rci++];
+        kf[ 9] = kf[1] ^ kf[ 8];
+        kf[10] = kf[2] ^ kf[ 9];