MIDAPACK - MIcrowave Data Analysis PACKage
1.1b
Parallel software tools for high performance CMB DA analysis
|
Go to the source code of this file.
Functions | |
int | butterfly_reduce (int **R, int *nR, int nRmax, int **S, int *nS, int nSmax, double *val, int steps, MPI_Comm comm) |
int | butterfly_reshuffle (int **R, int *nR, int nRmax, int **S, int *nS, int nSmax, double *val, int steps, MPI_Comm comm) |
int | butterfly_reduce_init (int *indices, int count, int **R, int *nR, int **S, int *nS, int **com_indices, int *com_count, int steps, MPI_Comm comm) |
int | butterfly_reshuffle_init (int *indices_in, int count_in, int *indices_out, int count_out, int **R, int *nR, int **S, int *nS, int **com_indices, int *com_count, int steps, MPI_Comm comm) |
int | set_or (int *A1, int n1, int *A2, int n2, int *A1orA2) |
int | set_and (int *A1, int n1, int *A2, int n2, int *A1andA2) |
int | card_or (int *A1, int n1, int *A2, int n2) |
void | m2s (double *mapval, double *submapval, int *subset, int count) |
void | subset2map (int *A, int nA, int *subA, int nsubA) |
void | s2m_sum (double *mapval, double *submapval, int *subset, int count) |
void | s2m_copy (double *mapval, double *submapval, int *subset, int count) |
int butterfly_reduce | ( | int ** | R, |
int * | nR, | ||
int | nRmax, | ||
int ** | S, | ||
int * | nS, | ||
int | nSmax, | ||
double * | val, | ||
int | steps, | ||
MPI_Comm | comm | ||
) |
Definition at line 426 of file butterfly_new.c.
int butterfly_reshuffle | ( | int ** | R, |
int * | nR, | ||
int | nRmax, | ||
int ** | S, | ||
int * | nS, | ||
int | nSmax, | ||
double * | val, | ||
int | steps, | ||
MPI_Comm | comm | ||
) |
Definition at line 478 of file butterfly_new.c.
int butterfly_reduce_init | ( | int * | indices, |
int | count, | ||
int ** | R, | ||
int * | nR, | ||
int ** | S, | ||
int * | nS, | ||
int ** | com_indices, | ||
int * | com_count, | ||
int | steps, | ||
MPI_Comm | comm | ||
) |
Definition at line 30 of file butterfly_new.c.
int butterfly_reshuffle_init | ( | int * | indices_in, |
int | count_in, | ||
int * | indices_out, | ||
int | count_out, | ||
int ** | R, | ||
int * | nR, | ||
int ** | S, | ||
int * | nS, | ||
int ** | com_indices, | ||
int * | com_count, | ||
int | steps, | ||
MPI_Comm | comm | ||
) |
Definition at line 211 of file butterfly_new.c.
int set_or | ( | int * | A1, |
int | n1, | ||
int * | A2, | ||
int | n2, | ||
int * | A1orA2 | ||
) |
Compute A1 and A2 should be two ascending ordered sets. It requires the sizes of these two sets, n1 and n2. A1andA2 has to be previouly allocated.
n1 | number of elemnets in A1 |
A1 | set of indices |
n2 | number of elemnets in A2 |
A2 | set of indices |
address | to the set A1orA2 |
int set_and | ( | int * | A1, |
int | n1, | ||
int * | A2, | ||
int | n2, | ||
int * | A1andA2 | ||
) |
Compute A1 and A2 should be two monotony sets in ascending order. It requires the sizes of these two sets, n1 and n2. A1andA2 has to be previously allocated.
n1 | number of elemnets in A1 |
A1 | set of indices |
n2 | number of elemnets in A2 |
A2 | set of indices |
address | to the set A1andA2 |
int card_or | ( | int * | A1, |
int | n1, | ||
int * | A2, | ||
int | n2 | ||
) |
void m2s | ( | double * | mapval, |
double * | submapval, | ||
int * | subset, | ||
int | count | ||
) |
Definition at line 533 of file butterfly_new.c.
void subset2map | ( | int * | A, |
int | nA, | ||
int * | subA, | ||
int | nsubA | ||
) |
Transform a subset into a mapper array Parse a subset and replace element by his index in the larger set. A and subA should be two monotony sets in ascending ordered. subA has to belong to A.
A | a set of indices(monotony) |
nA | number of elemnets in A |
subA | a subset of A(monotony) |
nsubA | number of elemnets in A |
void s2m_sum | ( | double * | mapval, |
double * | submapval, | ||
int * | subset, | ||
int | count | ||
) |
Definition at line 540 of file butterfly_new.c.
void s2m_copy | ( | double * | mapval, |
double * | submapval, | ||
int * | subset, | ||
int | count | ||
) |
Definition at line 546 of file butterfly_new.c.