37 for (i = 0; i < n; i++)
40 for (j = 0; j < n; j++) {
59 for (i = 0; i < n; i++) {
71 void kernel_gesummv(
int n,
83 for (i = 0; i <
_PB_N; i++)
87 for (j = 0; j <
_PB_N; j++)
89 tmp[i] =
A[i][j] *
x[j] + tmp[i];
90 y[i] =
B[i][j] *
x[j] + y[i];
92 y[i] = alpha * tmp[i] + beta * y[i];
99 int main(
int argc,
char** argv)
124 kernel_gesummv (n, alpha, beta,
#define POLYBENCH_ARRAY(x)
__attribute__((noinline))
Convert the given fixedpt number to a decimal string.
#define POLYBENCH_DUMP_BEGIN(s)
int main(int argc, char **argv)
#define POLYBENCH_FREE_ARRAY(x)
#define POLYBENCH_2D(var, dim1, dim2, ddim1, ddim2)
#define POLYBENCH_DUMP_START
#define POLYBENCH_2D_ARRAY_DECL(var, type, dim1, dim2, ddim1, ddim2)
#define DATA_PRINTF_MODIFIER
#define polybench_prevent_dce(func)
#define POLYBENCH_DUMP_TARGET
#define POLYBENCH_DUMP_END(s)
static void print_array(int n, DATA_TYPE POLYBENCH_1D(y, N, n))
#define POLYBENCH_1D(var, dim1, ddim1)
#define POLYBENCH_DUMP_FINISH
x
Return the smallest n such that 2^n >= _x.
#define POLYBENCH_1D_ARRAY_DECL(var, type, dim1, ddim1)
static void init_array(int n, DATA_TYPE *alpha, DATA_TYPE *beta, DATA_TYPE POLYBENCH_2D(A, N, N, n, n), DATA_TYPE POLYBENCH_2D(B, N, N, n, n), DATA_TYPE POLYBENCH_1D(x, N, n))
This version is stamped on May 10, 2016.
#define polybench_stop_instruments
#define polybench_print_instruments
#define polybench_start_instruments