alm.c

Go to the documentation of this file.

 
void m2s(double *mapval, double *submapval, int *subset, int count) {
    int i;
 
    // #pragma omp parallel for
    for (i = 0; i < count; i++) { submapval[i] = mapval[subset[i]]; }
}
 
void lmatvecprod(int *ind, double *val, int m, int nnz, double *in,
                 double *out) {
    int i, j, k;
    k = 0;
    for (i = 0; i < m; i++) { /*<local transform reduce*/
        for (j = 0; j < nnz; j++) {
            out[i] += val[k] * in[ind[k]];
            k++;
        }
    }
}
 
void s2m_sum(double *mapval, double *submapval, int *subset, int count) {
    int i;
    // #pragma omp parallel for
    for (i = 0; i < count; i++) { mapval[subset[i]] += submapval[i]; }
}
 
void s2m(double *mapval, double *submapval, int *subset, int count) {
    int i;
    for (i = 0; i < count; i++) { mapval[subset[i]] = submapval[i]; }
}
 
void cnt_nnz_dot_prod(double *out, double *in, int cnt, int *ind, double *val,
                      int nnz) {
    int i, j, k;
    k = 0;
    for (i = 0; i < cnt; i++) /*<local transform reduce*/
        for (j = 0; j < nnz; j++) out[ind[k]] += val[k] * in[i];
}
 
#if OPENMP
void omp_cnt_nnz_dot_prod(double *out, double *in, int cnt, int *ind,
                          double *val, int nnz) {
    int i, j, k;
    k = 0;
    for (i = 0; i < cnt; i++) /*<local transform reduce*/
        for (j = 0; j < nnz; j++) out[ind[k]] += val[k] * in[i];
}
#endif
 
int m2m(double *vA1, int *A1, int n1, double *vA2, int *A2, int n2) {
    int i = 0, j = 0, k = 0;
    while (i < n1 && j < n2) {
        if (A1[i] < A2[j]) {
            i++;
        } else if (A1[i] > A2[j]) {
            j++;
        } else {
            vA2[j] = vA1[i];
            k++;
            i++;
            j++;
        }
    }
    return k;
}
 
int m2m_sum(double *vA1, int *A1, int n1, double *vA2, int *A2, int n2) {
    int i = 0, j = 0, k = 0;
    while (i < n1 && j < n2) {
        if (A1[i] < A2[j]) {
            i++;
        } else if (A1[i] > A2[j]) {
            j++;
        } else {
            vA2[j] += vA1[i];
            k++;
            i++;
            j++;
        }
    }
    return k;
}
 
int m2m_sum_i(int *vA1, int *A1, int n1, int *vA2, int *A2, int n2) {
    int i = 0, j = 0, k = 0;
    while (i < n1 && j < n2) {
        if (A1[i] < A2[j]) {
            i++;
        } else if (A1[i] > A2[j]) {
            j++;
        } else {
            vA2[j] += vA1[i];
            k++;
            i++;
            j++;
        }
    }
    return k;
}