101 lines
4.0 KiB
C
101 lines
4.0 KiB
C
/*********************************************************************/
|
|
/* Copyright 2009, 2010 The University of Texas at Austin. */
|
|
/* All rights reserved. */
|
|
/* */
|
|
/* Redistribution and use in source and binary forms, with or */
|
|
/* without modification, are permitted provided that the following */
|
|
/* conditions are met: */
|
|
/* */
|
|
/* 1. Redistributions of source code must retain the above */
|
|
/* copyright notice, this list of conditions and the following */
|
|
/* disclaimer. */
|
|
/* */
|
|
/* 2. Redistributions in binary form must reproduce the above */
|
|
/* copyright notice, this list of conditions and the following */
|
|
/* disclaimer in the documentation and/or other materials */
|
|
/* provided with the distribution. */
|
|
/* */
|
|
/* THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY OF TEXAS AT */
|
|
/* AUSTIN ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, */
|
|
/* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
|
|
/* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
|
|
/* DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT */
|
|
/* AUSTIN OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, */
|
|
/* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES */
|
|
/* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE */
|
|
/* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR */
|
|
/* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF */
|
|
/* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT */
|
|
/* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT */
|
|
/* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE */
|
|
/* POSSIBILITY OF SUCH DAMAGE. */
|
|
/* */
|
|
/* The views and conclusions contained in the software and */
|
|
/* documentation are those of the authors and should not be */
|
|
/* interpreted as representing official policies, either expressed */
|
|
/* or implied, of The University of Texas at Austin. */
|
|
/*********************************************************************/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "common.h"
|
|
|
|
int CNAME(int mode, blas_arg_t *arg, BLASLONG *range_m, BLASLONG *range_n, int (*function)(blas_arg_t*, BLASLONG*, BLASLONG*,FLOAT *, FLOAT *, BLASLONG), void *sa, void *sb, BLASLONG nthreads) {
|
|
|
|
blas_queue_t queue[MAX_CPU_NUMBER];
|
|
BLASLONG range[MAX_CPU_NUMBER + 1];
|
|
|
|
BLASLONG width, i, num_cpu;
|
|
|
|
if (!range_n) {
|
|
range[0] = 0;
|
|
i = arg -> n;
|
|
} else {
|
|
range[0] = range_n[0];
|
|
i = range_n[1] - range_n[0];
|
|
}
|
|
|
|
num_cpu = 0;
|
|
|
|
while (i > 0){
|
|
|
|
width = blas_quickdivide(i + nthreads - num_cpu - 1, nthreads - num_cpu);
|
|
|
|
i -= width;
|
|
if (i < 0) width = width + i;
|
|
|
|
range[num_cpu + 1] = range[num_cpu] + width;
|
|
|
|
queue[num_cpu].mode = mode;
|
|
queue[num_cpu].routine = function;
|
|
queue[num_cpu].args = arg;
|
|
queue[num_cpu].range_m = range_m;
|
|
queue[num_cpu].range_n = &range[num_cpu];
|
|
#if 0 //defined(LOONGSON3A)
|
|
queue[num_cpu].sa = sa + GEMM_OFFSET_A1 * num_cpu;
|
|
queue[num_cpu].sb = queue[num_cpu].sa + GEMM_OFFSET_A1 * 5;
|
|
#else
|
|
queue[num_cpu].sa = NULL;
|
|
queue[num_cpu].sb = NULL;
|
|
#endif
|
|
queue[num_cpu].next = &queue[num_cpu + 1];
|
|
num_cpu ++;
|
|
}
|
|
|
|
if (num_cpu) {
|
|
#if 0 //defined(LOONGSON3A)
|
|
queue[0].sa = sa;
|
|
queue[0].sb = sa + GEMM_OFFSET_A1 * 5;
|
|
#else
|
|
queue[0].sa = sa;
|
|
queue[0].sb = sb;
|
|
#endif
|
|
queue[num_cpu - 1].next = NULL;
|
|
|
|
exec_blas(num_cpu,
|
|
queue);
|
|
}
|
|
|
|
return 0;
|
|
}
|