PaStiX Handbook
6.3.2
|
Go to the source code of this file.
Data Structures | |
struct | cand_s |
Processor candidate group to own a column blok. More... | |
Typedefs | |
typedef struct cand_s | Cand |
Processor candidate group to own a column blok. | |
Functions | |
Cand * | candInit (pastix_int_t cblknbr) |
Initialize the candtab array with default values. More... | |
void | candExit (Cand *candtab) |
Exit and free the candtab structure given. More... | |
int | candCheck (const Cand *candtab, const symbol_matrix_t *symbmtx) |
Check the correctness of the computed candidates. More... | |
void | candSave (const Cand *candtab, pastix_int_t cblknbr, const char *directory) |
Print the candidates array into the candtab.txt file. More... | |
void | candBuild (pastix_int_t level_tasks2d, pastix_int_t width_tasks2d, pastix_compress_when_t lr_when, pastix_int_t lr_width, Cand *candtab, EliminTree *etree, const symbol_matrix_t *symbmtx, const CostMatrix *costmtx) |
Finish to build the candtab array for the proportionnal mapping. More... | |
void | candUpdate (Cand *candtab, EliminTree *etree, const symbol_matrix_t *symbmtx, const CostMatrix *costmtx) |
Update the candtab array costs after the symbol split algorithm has been applied. More... | |
void | candSetClusterCand (Cand *candtab, pastix_int_t cblknbr, const pastix_int_t *core2clust, pastix_int_t coresnbr) |
Set the clusters candidates from the cores canditates. More... | |
void | candGenDot (const EliminTree *etree, const Cand *candtab, FILE *stream) |
Print the elimination tree in a dot file. More... | |
void | candGenDotLevel (const EliminTree *etree, const Cand *candtab, FILE *stream, pastix_int_t level) |
Print the first levels of the elimination tree in a dot file. More... | |
void | candGenCompressedDot (const EliminTree *etree, const Cand *candtab, FILE *stream) |
Print the compressed elimination tree in a dot file, where all nodes with the same candidates are merged together. More... | |
PaStiX analyse headers for candidate array functions.
Definition in file cand.h.