[test-suite] Add pathfinder kernel from Rodinia Benchmark

[proton]

Summary

Runtime:

Optimization	Kernel	Program
-O0	0.913650	1.415s
-O3	0.081188s	0.341s
-O3 -polly	0.033881s	0.300s

[proton]

Changes:
removed typedef int matrix[row][col]
compare the hash of output instead of checking all values

[mstojanovic]

Can you add the Rodinia/Makefile file? It was present in the first revision r338163 but after it was reverted in r338166, the subsequent revisions didn't add it back and it's been causing buildbot failures ever since.

[Meinersbur]

In D49886#1180459, @mstojanovic wrote:

Can you add the Rodinia/Makefile file? It was present in the first revision r338163 but after it was reverted in r338166, the subsequent revisions didn't add it back and it's been causing buildbot failures ever since.

@homerdin took care of it. The Makefile template does not seem to be prepared to include a file from another directory (../Common/glibc_compat_rand.c), so we opted to exclude the benchmark from the Makefile build.

[mstojanovic]

Ok, thank you.

[MatzeB]

MultiSource/Benchmarks/Rodinia/pathfinder/CMakeLists.txt

1–6

Note: I am currently cleaning up the test-suite cmake code a bit. This needs to be changed to:

llvm_multisource(pathfinder main.c pathfinderKernel.c ../Common/glibc_compat_rand.c)

(with the set(PROG and set(Source lines removed)
before committing.

4

You can also drop the set(WORKDIR line if the benchmark isn't reading any files and doesn't care what directory it is running in.

[proton]

changed CMakeLists.txt

[Meinersbur]

LGTM

MultiSource/Benchmarks/Rodinia/CMakeLists.txt

 add_subdirectory(hotspot)
 add_subdirectory(srad)
+add_subdirectory(pathfinder)

MultiSource/Benchmarks/Rodinia/pathfinder/CMakeLists.txt

+set(PROG pathfinder)
+list(APPEND CFLAGS -I${CMAKE_CURRENT_SOURCE_DIR}/../Common/)
+set(Source main.c pathfinderKernel.c ../Common/glibc_compat_rand.c)
+set(WORKDIR ${CMAKE_CURRENT_BINARY_DIR})
+set(HASH_PROGRAM_OUTPUT 1)
+llvm_multisource()

MultiSource/Benchmarks/Rodinia/pathfinder/Makefile

+LEVEL = ../../../..
+LIBS += -lm
+CFLAGS += -I${PROJ_SRC_DIR}/../Common/
+PROG     = pathfinder
+HASH_PROGRAM_OUTPUT = 1
+include ../../Makefile.multisrc

MultiSource/Benchmarks/Rodinia/pathfinder/main.c

+#include "glibc_compat_rand.h"
+#include "pathfinder.h"
+#include <stdio.h>
+#include <stdlib.h>
+
+void pathFinderKernel(int rows, int cols, int *data, int *result, int *src);
+void initialize(int rows, int cols, int *result, int *data);
+void printResult(int len, int *result);
+
+int main() {
+
+  int *data = (int *)malloc(sizeof(int) * ROWS * COLS);
+  int *result = (int *)malloc(sizeof(int) * COLS);
+  int *src = (int *)malloc(sizeof(int) * COLS);
+
+  initialize(ROWS, COLS, result, data);
+
+  pathFinderKernel(ROWS, COLS, data, result, src);
+
+  printResult(COLS, result);
+
+  return 0;
+}
+
+void initialize(int rows, int cols, int *result, int *data) {
+  glibc_compat_srand(SEED);
+  for (int i = 0; i < rows; i++) {
+    for (int j = 0; j < cols; j++) {
+      data[i * cols + j] = glibc_compat_rand() % 10;
+    }
+  }
+  for (int j = 0; j < COLS; j++) {
+    result[j] = data[j];
+  }
+}
+
+void printResult(int len, int *result) {
+  for (int i = 0; i < len; i++) {
+    printf("%d\n", result[i]);
+  }
+}
 No newline at end of file

MultiSource/Benchmarks/Rodinia/pathfinder/pathfinder.h

+#ifndef _PATHFINDER_H_
+#define _PATHFINDER_H_
+
+#define ROWS 100000
+#define COLS 500
+#define SEED 9
+
+#endif
 No newline at end of file

MultiSource/Benchmarks/Rodinia/pathfinder/pathfinder.reference_output

+38b47b2426f6fc1af9d4d0e2066f834d

MultiSource/Benchmarks/Rodinia/pathfinder/pathfinderKernel.c

+#include "pathfinder.h"
+#include <stdio.h>
+#define MIN(a, b) ((a) <= (b) ? (a) : (b))
+void pathFinderKernel(int row, int col, int data[row][col], int result[col],
+                      int src[col]) {
+  for (int t = 0; t < row - 1; t++) {
+    for (int n = 0; n < col; n++) {
+      src[n] = result[n];
+    }
+    for (int n = 0; n < col; n++) {
+      if (n == 0) {
+        result[n] = data[t + 1][n] + MIN(src[n], src[n + 1]);
+      } else if (n == col - 1) {
+        result[n] = data[t + 1][n] + MIN(src[n], src[col - 2]);
+      } else {
+        result[n] = data[t + 1][n] + MIN(src[n], MIN(src[n - 1], src[n + 1]));
+      }
+    }
+  }
+}