asum.c

#include <bl_test.h>

#undef ASUM

#ifdef COMPLEX
#ifdef DOUBLE
#define ASUM   BLASFUNC(dzasum)
#else
#define ASUM   BLASFUNC(scasum)
#endif

#else

#ifdef DOUBLE
#define ASUM   BLASFUNC(dasum)
#else
#define ASUM   BLASFUNC(sasum)
#endif

#endif

int main(int argc, char *argv[]) {

    FLOAT *x, *nx;

    blasint m, i;
    blasint inc_x = 1;
    char *p;

    int from = 1;
    int to = 200;
    int step = 1;


    argc--;
    argv++;

    if (argc > 0) {
        from = atol(*argv);
        argc--;
        argv++;
    }
    if (argc > 0) {
        to = MAX(atol(*argv), from);
        argc--;
        argv++;
    }
    if (argc > 0) {
        step = atol(*argv);
        argc--;
        argv++;
    }


    if ((p = getenv("OPENBLAS_INCX"))) inc_x = atoi(p);


    LOG( "From : %3d  To : %3d Step = %3d Inc_x = %d  \n", from, to, step, inc_x);

    if ((x = (FLOAT *) malloc(sizeof (FLOAT) * to * abs(inc_x) * COMPSIZE)) == NULL) {
        LOG( "Out of Memory!!\n");
        exit(1);
    }
    if ((nx = (FLOAT *) malloc(sizeof (FLOAT) * to * abs(inc_x) * COMPSIZE)) == NULL) {
        LOG( "Out of Memory!!\n");
        exit(1);
    }


#ifdef linux
    srandom(getpid());
#endif


    for (m = from; m <= to; m += step) {

        LOG( " %6d : ", (int) m);


        for (i = 0; i < m * COMPSIZE * abs(inc_x); i++) {
            x[i] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
            nx[i] = x[i];
        }


        FLOAT ret1 = ASUM(&m, x, &inc_x);
        FLOAT ret2 = ref_asum(m, x, inc_x);
        compare_vals(m, x, inc_x, nx, inc_x, "input change : ");
        compare_aggregate_real(m,  ret1,  ret2,STRINGIZE(ASUM));
        LOG( "------------\n");

    }
    free(x);
    free(nx);

    return 0;
}