1 /*********************************************************************/
2 /* Copyright 2009, 2010 The University of Texas at Austin. */
3 /* All rights reserved. */
4 /* */
5 /* Redistribution and use in source and binary forms, with or */
6 /* without modification, are permitted provided that the following */
7 /* conditions are met: */
8 /* */
9 /* 1. Redistributions of source code must retain the above */
10 /* copyright notice, this list of conditions and the following */
11 /* disclaimer. */
12 /* */
13 /* 2. Redistributions in binary form must reproduce the above */
14 /* copyright notice, this list of conditions and the following */
15 /* disclaimer in the documentation and/or other materials */
16 /* provided with the distribution. */
17 /* */
18 /* THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY OF TEXAS AT */
19 /* AUSTIN ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, */
20 /* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
21 /* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
22 /* DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT */
23 /* AUSTIN OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, */
24 /* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES */
25 /* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE */
26 /* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR */
27 /* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF */
28 /* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT */
29 /* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT */
30 /* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE */
31 /* POSSIBILITY OF SUCH DAMAGE. */
32 /* */
33 /* The views and conclusions contained in the software and */
34 /* documentation are those of the authors and should not be */
35 /* interpreted as representing official policies, either expressed */
36 /* or implied, of The University of Texas at Austin. */
37 /*********************************************************************/
38
39 #include <stdio.h>
40 #include <stdlib.h>
41 #include "common.h"
42
CNAME(int mode,blas_arg_t * arg,BLASLONG * range_m,BLASLONG * range_n,int (* function)(),void * sa,void * sb,BLASLONG nthreads)43 int CNAME(int mode, blas_arg_t *arg, BLASLONG *range_m, BLASLONG *range_n, int (*function)(), void *sa, void *sb, BLASLONG nthreads) {
44
45 blas_queue_t queue[MAX_CPU_NUMBER];
46 BLASLONG range[MAX_CPU_NUMBER + 1];
47
48 BLASLONG width, i, num_cpu;
49
50 if (!range_n) {
51 range[0] = 0;
52 i = arg -> n;
53 } else {
54 range[0] = range_n[0];
55 i = range_n[1] - range_n[0];
56 }
57
58 num_cpu = 0;
59
60 while (i > 0){
61
62 width = blas_quickdivide(i + nthreads - num_cpu - 1, nthreads - num_cpu);
63
64 i -= width;
65 if (i < 0) width = width + i;
66
67 range[num_cpu + 1] = range[num_cpu] + width;
68
69 queue[num_cpu].mode = mode;
70 queue[num_cpu].routine = function;
71 queue[num_cpu].args = arg;
72 queue[num_cpu].range_m = range_m;
73 queue[num_cpu].range_n = &range[num_cpu];
74 queue[num_cpu].sa = NULL;
75 queue[num_cpu].sb = NULL;
76 queue[num_cpu].next = &queue[num_cpu + 1];
77 num_cpu ++;
78 }
79
80 if (num_cpu) {
81 queue[0].sa = sa;
82 queue[0].sb = sb;
83
84 queue[num_cpu - 1].next = NULL;
85
86 exec_blas(num_cpu,
87 queue);
88 }
89
90 return 0;
91 }
92