Initial commit

1_motivation/check32.c

+int check_for_32(int a) {
+  int res;
+  if (a == 32)
+    res = a;
+  return res;
+}

1_motivation/check_null_pointer.c

+void contains_null_check(int *P) {
+  int dead = *P;
+  if (P == 0)
+    return;
+  *P = 4;
+}

2_msan/msan.c

+#include <stdio.h>
+
+int check_for_32(int *a) {
+  int res;
+  if (*a == 32)
+    res = *a;
+  return res;
+}
+
+
+int main(){
+  int a;
+  
+  printf("check_for_32(%i) = %i\n", a, check_for_32(&a) );
+
+}

3_asan/asan.cc

+int main(int argc, char **argv) {
+  int *array = new int[100];
+  delete [] array;
+  return array[argc];  // BOOM
+}

3_asan/asan2.cc

+int main(int argc, char **argv) {
+  int *array = new int[99];
+  int tmp = array[argc-2]; // BOOM
+  return tmp; // leaking array
+}

4_ubsan/ubsan.c

+int main(int argc, char **argv) {
+  int k = 0x7ffffffe;
+  k += argc;
+  return 0;
+}
\ No newline at end of file

4_ubsan/ubsan2.c

+int foo(int i) {
+  int x[2];
+  x[i] = 12;
+  return x[i];
+}
+
+int main() {
+  return foo(2);
+}
\ No newline at end of file

5_tsan/datarace.cc

+#include <stdio.h>
+#include <math.h>
+
+int main(int argc, char** argv){
+  int a = 0, l = 100;
+  if(argc>1)
+    l = atoi(argv[1]);
+  double sum=0;
+#pragma omp parallel num_threads(8) shared(a) reduction(+:sum)
+  while (a < l){
+    sum+=sin(a++);
+  }
+  printf("a=%i, sum=%lf\n", a, sum);
+}
+

5_tsan/prime_omp.c

+/*
+ * Copyright (c) 2006, 2010, Oracle and/or its affiliates. All Rights Reserved.
+ * @(#)prime_omp.c 1.3 (Oracle) 10/03/26
+ * Downloaded at https://docs.oracle.com/cd/E37069_01/html/E37080/geazt.html
+ */
+
+#include <stdio.h>
+#include <math.h>
+
+#define N 1000000
+
+int primes[N];
+int pflag[N];
+
+int is_prime(int v)
+{
+ int i;
+ int bound = floor(sqrt(v)) + 1;
+
+ for (i = 2; i < bound; i++) {
+        /* no need to check against known composites */
+        if (!pflag[i])
+            continue;
+        if (v % i == 0) {
+            pflag[v] = 0;
+            return 0;
+        }
+    }
+    return (v > 1);
+}
+
+int main(int argn, char **argv)
+{
+    int i;
+    int total = 0;
+
+    for (i = 0; i < N; i++) {
+        pflag[i] = 1;
+    }
+
+    #pragma omp parallel for schedule(dynamic)
+    for (i = 2; i < N; i++) {
+        if ( is_prime(i) ) {
+            primes[total++] = i;
+        }
+    }
+
+    printf("Number of prime numbers between 2 and %d: %d\n",
+           N, total);
+
+    return 0;
+}

5_tsan/racecondition.cc

+#include <stdio.h>
+#include <math.h>
+#include <atomic>
+int main(int argc, char** argv){
+  std::atomic<int> a{0}; int l=100;
+  if(argc>1)
+    l = atoi(argv[1]);
+  double sum=0;
+#pragma omp parallel num_threads(8) shared(a) reduction(+:sum)
+  while (a < l){
+    sum += sin(a++);
+  }
+  printf("a=%i, sum=%lf\n", a.load(), sum);
+}
+

5_tsan/racecondition2.cc

+#include <stdio.h>
+#include <math.h>
+#include <atomic>
+int main(int argc, char** argv){
+  std::atomic<int> a{0}; int l=100;
+  if(argc>1)
+    l = atoi(argv[1]);
+  double sum=0;
+#pragma omp parallel num_threads(8) shared(a) reduction(+:sum)
+  while (a++ < l){
+    sum += sin(a.load());
+  }
+  printf("a=%i, sum=%lf\n", a.load(), sum);
+}
+

5_tsan/tsan.c

+#include <pthread.h>
+int Global;
+void *Thread1(void *x) {
+ Global = 42;
+ return x;
+}
+int main() {
+ pthread_t t;
+ pthread_create(&t, NULL, Thread1, NULL);
+ Global = 43;
+ pthread_join(t, NULL);
+ return Global;
+}
+