|
@@ -180,7 +180,7 @@ static void run_cholesky(starpu_data_handle_t **data_handles, int rank, int node
|
|
|
/* TODO: generate from compiler polyhedral analysis of classical algorithm */
|
|
|
static void run_cholesky_column(starpu_data_handle_t **data_handles, int rank, int nodes)
|
|
|
{
|
|
|
- unsigned k, m, n, i;
|
|
|
+ unsigned k, m, n;
|
|
|
unsigned unbound_prio = STARPU_MAX_PRIO == INT_MAX && STARPU_MIN_PRIO == INT_MIN;
|
|
|
unsigned nn = size/nblocks;
|
|
|
|
|
@@ -244,8 +244,8 @@ static void run_cholesky_column(starpu_data_handle_t **data_handles, int rank, i
|
|
|
/* TODO: generate from compiler polyhedral analysis of classical algorithm */
|
|
|
static void run_cholesky_antidiagonal(starpu_data_handle_t **data_handles, int rank, int nodes)
|
|
|
{
|
|
|
- unsigned a, c;
|
|
|
- unsigned k, m, n, i;
|
|
|
+ unsigned a;
|
|
|
+ unsigned k, m, n;
|
|
|
unsigned unbound_prio = STARPU_MAX_PRIO == INT_MAX && STARPU_MIN_PRIO == INT_MIN;
|
|
|
unsigned nn = size/nblocks;
|
|
|
|