71 if (pastix_data == NULL) {
72 pastix_print_error(
"pastix_subtask_reordering: wrong pastix_data parameter" );
75 iparm = pastix_data->iparm;
76 procnum = pastix_data->procnum;
77 ordemesh = pastix_data->ordemesh;
79 assert(ordemesh->rangtab);
80 assert(ordemesh->treetab);
85 pastix_print( procnum, 0, OUT_STEP_REORDER,
111 memFree_null( pastix_data->symbmtx );
112 pastix_data->symbmtx = NULL;
126 pastix_print_error(
"pastix_subtask_reordering: pastixOrderCheck on final ordering failed !!!" );
130 pastix_print_error(
"pastix_subtask_reordering: symbolCheck on final symbol matrix failed !!!" );
139 pastix_print( procnum, 0, OUT_REORDERING_TIME,
140 (
double)clockVal(timer) );
int pastix_subtask_symbfact(pastix_data_t *pastix_data)
Computes the symbolic factorization step.
int pastix_subtask_reordering(pastix_data_t *pastix_data)
Apply the reordering step to compact off-diagonal blocks.
@ PASTIX_ERR_BADPARAMETER
BEGIN_C_DECLS struct pastix_order_s pastix_order_t
Order structure.
int pastixOrderSave(pastix_data_t *pastix_data, const pastix_order_t *ordeptr)
Save an ordering to a file.
int pastixOrderCheck(const pastix_order_t *ordeptr)
This routine checks the correctness of the ordering structure.
void pastixSymbolReordering(pastix_data_t *)
Compute the reordering on the complete matrix.
void pastixSymbolReorderingPrintComplexity(const symbol_matrix_t *symbptr)
Compute the number of operations required to compute the reordering on the complete matrix.
void pastixSymbolExit(symbol_matrix_t *symbptr)
Free the content of symbolic matrix.
int pastixSymbolCheck(const symbol_matrix_t *symbptr)
Checks the consistency of the given symbolic block matrix.