Add more examples and solutions for kocher

BCB/Cheang et al/Example NI/exNI.c

+void victim_function_nested_ifs(unsigned x) {
+    unsigned val1, val2;
+    if (x < array1_size) {
+        val1 = array1[x];
+        if (val1 & 1) {
+            val2 = array2[0];
+        }   
+    }
+}
\ No newline at end of file

BCB/Cheang et al/Example NI/exNI_cheang.c

+void cheang_sol_nested_ifs(unsigned x) {
+    unsigned val1, val2;
+    if (x < array1_size) {
+        val1 = array1[x];
+        if (val1 & 1) {
+            _mm_lfence();
+            val2 = array2[0];
+        }   
+    }
+}
\ No newline at end of file

BCB/Oleksenko et al/ConditionalBranchMisprediction/cbm.c

+checkpoint()
+if x >= array_size:
+goto skip_branch
+if x < array_size
+skip_branch:
+result = array[x]
+...
+if terminate_simulation():
+rollback() // to line 4
\ No newline at end of file

BCB/Paul Kocher/Example 1/ex01.c

+#include "../ex_main.h"
+
 void victim_function_v01(size_t x) {
-     if (x < array1_size) {
-          temp &= array2[array1[x] * 512];
-     }
-}
+    if (x < array1_size) {
+        temp &= array2[array1[x] * 512];
+    }
+}
\ No newline at end of file

BCB/Paul Kocher/Example 1/ex01_ms.c

+#include "../ex_main.h"
+
+void ms_solution_v01(size_t x) {
+    if (x < array1_size) {
+        __mm_lfence();
+        temp &= array2[array1[x] * 512];
+    }
+}

BCB/Paul Kocher/Example 1/ex01_optimal.c

+#include "../ex_main.h"
+
+void optimal_solution_v01(size_t x) {
+     if (x < array1_size) {
+        uint8_t v = array1[x] * 512;
+        __mm_lfence();
+        temp &= array2[v];
+     }
+}

BCB/Paul Kocher/Example 10/ex10.c

+#include "../ex_main.h"
+
 void victim_function_v10(size_t x, uint8_t k) {
-     if (x < array1_size) {
-          if (array1[x] == k)
-               temp &= array2[0];
-     }
+    if (x < array1_size) {
+        if (array1[x] == k)
+            temp &= array2[0];
+    }
 }
\ No newline at end of file

BCB/Paul Kocher/Example 10/ex10_cheang.c

+#include "../ex_main.h"
+
+void cheang_sol_v10(size_t x, uint8_t k) {
+    if (x < array1_size) {
+        _mm_lfence();
+        if (array1[x] == k)
+            temp &= array2[0];
+    }
+}
\ No newline at end of file

BCB/Paul Kocher/Example 11/ex11.c

+#include "../ex_main.h"
+
 void victim_function_v11(size_t x) {
      if (x < array1_size)
           temp = memcmp(&temp, array2 + (array1[x] * 512), 1);

BCB/Paul Kocher/Example 11/ex11_cheang.c

+#include "../ex_main.h"
+
+void cheang_sol_v11(size_t x) {
+    if (x < array1_size) {
+        _mm_lfence();
+        temp = memcmp(&temp, array2 + (array1[x] * 512), 1);
+    }
+}

BCB/Paul Kocher/Example 11/ex11_sol.c

+#include "../ex_main.h"
+
+void optimal_sol_v11(size_t x) {
+    if (x < array1_size) {
+        uint8_t v = (array1[x] * 512);
+        _mm_lfence();
+        temp = memcmp(&temp, array2 + v, 1);
+    }
+}

BCB/Paul Kocher/Example 12/ex12.c

+#include "../ex_main.h"
+
 void victim_function_v12(size_t x, size_t y) {
      if ((x + y) < array1_size)
           temp &= array2[array1[x + y] * 512];
-}
+}
\ No newline at end of file

BCB/Paul Kocher/Example 12/ex12_sol.c

+#include "../ex_main.h"
+
+void optimal_sol_v12(size_t x, size_t y) {
+    if ((x + y) < array1_size)
+        uint8_t v = array1[x + y] * 512;
+        _mm_lfence();
+        temp &= array2[v];
+}

BCB/Paul Kocher/Example 13/ex13.c

+#include "../ex_main.h"
+
 __inline int is_x_safe(size_t x) { if (x < array1_size) return 1; return 0; }
 void victim_function_v13(size_t x) {
      if (is_x_safe(x))
           temp &= array2[array1[x] * 512];
-}
+}
\ No newline at end of file

BCB/Paul Kocher/Example 13/ex13_sol.c

+#include "../ex_main.h"
+
+__inline int is_x_safe(size_t x) { if (x < array1_size) return 1; return 0; }
+void victim_function_v13(size_t x) {
+    if (is_x_safe(x))
+        uint8_t v = array1[x] * 512;
+        _mm_lfence();
+        temp &= array2[v];
+}

BCB/Paul Kocher/Example 14/ex14.c

+#include "../ex_main.h"
+
 void victim_function_v14(size_t x) {
      if (x < array1_size)
           temp &= array2[array1[x ^ 255] * 512];
-}
+}
\ No newline at end of file