formatting

Author: vidsinghal

benchrunner/cxx/benchmarks.h

@@ -28,6 +28,11 @@ void *cilksort(void *const pbase, size_t total_elems, size_t size, __compar_fn_t
 void *cilksort_par(void *const pbase, size_t total_elems, size_t size, __compar_fn_t cmp);
 template <typename T> T *bottomUpMergeSort(T *a, T *b, int n);
 
+// Relating to C++ templatized versions
+int64_t *bottom_up_merge_sort_int(int64_t *pbase, size_t total_elems);
+int64_t *insertionsort_int(int64_t *pbase, size_t total_elems);
+int64_t *quicksort_int(int64_t *pbase, size_t total_elems);
+
 // Microbenchmarks.
 int64_t* __attribute__ ((noinline)) fill_array_seq(size_t total_elems, int64_t val);
 int64_t* __attribute__ ((noinline)) fill_array_par(size_t total_elems, int64_t val);

benchrunner/cxx/insertionsort_int_wrapper.cpp

@@ -0,0 +1,6 @@
+#include "benchmarks.h"
+#include "insertionsort.cpp"
+
+int64_t *insertionsort_int(int64_t *pbase, size_t total_elems){
+    return insertionsort_inplace<int64_t>(pbase, total_elems);
+}

benchrunner/cxx/mergesort_int_wrapper.cpp

@@ -0,0 +1,10 @@
+#include "benchmarks.h"
+#include "mergesort.cpp"
+
+
+int64_t *bottom_up_merge_sort_int(int64_t *pbase, size_t total_elems){
+
+    int64_t *copy_pbase = new int64_t[total_elems];
+    copyArray<int64_t>(pbase, copy_pbase, total_elems);
+    return bottomUpMergeSort<int64_t>(pbase, copy_pbase, total_elems);
+}

benchrunner/cxx/quicksort_int_wrapper.cpp

@@ -0,0 +1,6 @@
+#include "benchmarks.h"
+#include "quicksort.cpp"
+
+int64_t *quicksort_int(int64_t *pbase, size_t total_elems){
+    return quicksort_inplace<int64_t>(pbase, total_elems);
+}