9 for (
int i=0; i< NCLR; i++)
11 printf(
"%f %f %f %f %f %f\n",a->e[i][0].re,a->e[i][0].im,a->e[i][1].re,a->e[i][1].im,a->e[i][2].re,a->e[i][2].im);
21 for ( j=0; j< NCLR; j++)
22 for ( i=0; i< NCLR; i++)
28 for ( j=0; j< NCLR; j++)
29 a->e[j][j].re = 100*rank + coords[0] +
41 for(i = 0; i <
count; i++)
43 for(x[2] = 0; x[2] < lattice_size[2]; x[2]++)
44 for(x[1] = 0; x[1] < lattice_size[1]; x[1]++)
45 for(x[0] = 0; x[0] < lattice_size[0]; x[0]++)
49 vfill_m(field[i] + index, x, i);
58 for(i = 0; i <
count; i++){
61 printf(
"vcreate_M(%d): Can't malloc field\n",
this_node);
73 for(i = 0; i <
count; i++)
85 for ( j=0; j< NCLR; j++)
86 for ( i=0; i< NCLR; i++)
88 diff = fielda[k][m].e[j][i].re - fieldb[k][m].e[j][i].re;
90 diff = fielda[k][m].e[j][i].im - fieldb[k][m].e[j][i].im;
102 suN_matrix **field = (suN_matrix **)s2;
104 suN_matrix *src = (suN_matrix *)s1;
110 for (i=0;i<
count;i++)
112 dest = field[i] +
index;
119 suN_matrix **field = (suN_matrix **)s2;
121 suN_matrix *dest = (suN_matrix *)s1;
126 for (i=0; i<
count; i++, dest++)
128 src = field[i] +
index;
139 for(i = 0; i < 4; i++)
140 if(lower[i] > x[i] || upper[i] < x[i]){
void vset_M(suN_matrix *field[], int count)
int inside_subset(int x[], int lower[], int upper[])
int node_number(const int x[])
int node_index(const int x[])
void vput_M(char *s1, size_t index, int count, void *s2)
void vdestroy_M(suN_matrix *field[], int count)
void vget_M(char *s1, size_t index, int count, void *s2)
void vfill_m(suN_matrix *a, int coords[], int rank)
static int index(int ndim, const int *dims, const int *x)
void print_m(suN_matrix *a)
int vcreate_M(suN_matrix *field[], int count)
float vcompare_M(suN_matrix *fielda[], suN_matrix *fieldb[], int count)
__device__ unsigned int count[QUDA_MAX_MULTI_REDUCE]