/* StarPU --- Runtime system for heterogeneous multicore architectures.
*
* Copyright (C) 2010-2013,2015-2017 CNRS
* Copyright (C) 2009,2010,2014-2017,2020 Université de Bordeaux
*
* StarPU is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation; either version 2.1 of the License, or (at
* your option) any later version.
*
* StarPU is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*
* See the GNU Lesser General Public License in COPYING.LGPL for more details.
*/
#include "mpi_cholesky.h"
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#ifdef STARPU_QUICK_CHECK
unsigned size = 4*64;
unsigned nblocks = 2;
unsigned nbigblocks = 2;
#elif !defined(STARPU_LONG_CHECK)
unsigned size = 4*320;
unsigned nblocks = 4;
unsigned nbigblocks = 2;
#else
unsigned size = 16*320;
unsigned nblocks = 16;
unsigned nbigblocks = 2;
#endif
unsigned noprio = 0;
unsigned check = 0;
unsigned display = 0;
int dblockx = -1;
int dblocky = -1;
void parse_args(int argc, char **argv, int nodes)
{
int i;
for (i = 1; i < argc; i++)
{
if (strcmp(argv[i], "-size") == 0)
{
char *argptr;
size = strtol(argv[++i], &argptr, 10);
}
if (strcmp(argv[i], "-dblockx") == 0)
{
char *argptr;
dblockx = strtol(argv[++i], &argptr, 10);
}
if (strcmp(argv[i], "-dblocky") == 0)
{
char *argptr;
dblocky = strtol(argv[++i], &argptr, 10);
}
if (strcmp(argv[i], "-nblocks") == 0)
{
char *argptr;
nblocks = strtol(argv[++i], &argptr, 10);
}
if (strcmp(argv[i], "-nbigblocks") == 0)
{
char *argptr;
nbigblocks = strtol(argv[++i], &argptr, 10);
}
if (strcmp(argv[i], "-no-prio") == 0)
{
noprio = 1;
}
if (strcmp(argv[i], "-check") == 0)
{
check = 1;
}
if (strcmp(argv[i], "-display") == 0)
{
display = 1;
}
if (strcmp(argv[i], "-h") == 0 || strcmp(argv[i], "--help") == 0)
{
printf("usage : %s [-size size] [-nblocks nblocks] [-no-prio] [-display] [-check]\n", argv[0]);
}
}
if (nblocks > size)
nblocks = size;
if (dblockx == -1 || dblocky == -1)
{
int factor;
dblockx = nodes;
dblocky = 1;
for(factor=sqrt(nodes) ; factor>1 ; factor--)
{
if (nodes % factor == 0)
{
dblockx = nodes/factor;
dblocky = factor;
break;
}
}
}
FPRINTF(stdout, "size: %u - nblocks: %u - dblocksx: %d - dblocksy: %d\n", size, nblocks, dblockx, dblocky);
}