/* * * MLD2P4 version 2.0 * MultiLevel Domain Decomposition Parallel Preconditioners Package * based on PSBLAS (Parallel Sparse BLAS version 3.0) * * (C) Copyright 2008,2009,2010 * * Salvatore Filippone University of Rome Tor Vergata * Alfredo Buttari CNRS-IRIT, Toulouse * Pasqua D'Ambra ICAR-CNR, Naples * Daniela di Serafino Second University of Naples * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions, and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. The name of the MLD2P4 group or the names of its contributors may * not be used to endorse or promote products derived from this * software without specific written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE MLD2P4 GROUP OR ITS CONTRIBUTORS * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. * * * File: mld_slud_interface.c * * Functions: mld_dsludist_fact_, mld_dsludist_solve_, mld_dsludist_free_. * * This file is an interface to the SuperLU_dist routines for sparse factorization and * solve. It was obtained by modifying the c_fortran_dgssv.c file from the SuperLU_dist * source distribution; original copyright terms are reproduced below. * */ /* ===================== Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy) All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: (1) Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. (2) Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. (3) Neither the name of Lawrence Berkeley National Laboratory, U.S. Dept. of Energy nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /* * -- Distributed SuperLU routine (version 2.0) -- * Lawrence Berkeley National Lab, Univ. of California Berkeley. * March 15, 2003 * */ #ifdef Have_SLUDist_ #include #include "superlu_ddefs.h" #define HANDLE_SIZE 8 /* kind of integer to hold a pointer. Use int. This might need to be changed on 64-bit systems. */ #ifdef Ptr64Bits typedef long long fptr; #else typedef int fptr; /* 32-bit by default */ #endif typedef struct { SuperMatrix *A; LUstruct_t *LUstruct; gridinfo_t *grid; ScalePermstruct_t *ScalePermstruct; } factors_t; #else #include #endif int mld_dsludist_fact(int n, int nl, int nnzl, int ffstr, double *values, int *rowptr, int *colind, void **f_factors, int nprow, int npcol) { /* * This routine can be called from Fortran. * performs LU decomposition. * * f_factors (input/output) fptr* * On output contains the pointer pointing to * the structure of the factored matrices. * */ #ifdef Have_SLUDist_ SuperMatrix *A; NRformat_loc *Astore; ScalePermstruct_t *ScalePermstruct; LUstruct_t *LUstruct; SOLVEstruct_t SOLVEstruct; gridinfo_t *grid; int i, panel_size, permc_spec, relax, info; trans_t trans; double drop_tol = 0.0,b[1],berr[1]; mem_usage_t mem_usage; superlu_options_t options; SuperLUStat_t stat; factors_t *LUfactors; int fst_row; int *icol,*irpt; double *ival; trans = NOTRANS; /* fprintf(stderr,"Entry to sludist_fact\n"); */ grid = (gridinfo_t *) SUPERLU_MALLOC(sizeof(gridinfo_t)); superlu_gridinit(MPI_COMM_WORLD, nprow, npcol, grid); /* Initialize the statistics variables. */ PStatInit(&stat); fst_row = (ffstr) -1; A = (SuperMatrix *) malloc(sizeof(SuperMatrix)); dCreate_CompRowLoc_Matrix_dist(A, n, n, nnzl, nl, fst_row, values, colind, rowptr, SLU_NR_loc, SLU_D, SLU_GE); /* Initialize ScalePermstruct and LUstruct. */ ScalePermstruct = (ScalePermstruct_t *) SUPERLU_MALLOC(sizeof(ScalePermstruct_t)); LUstruct = (LUstruct_t *) SUPERLU_MALLOC(sizeof(LUstruct_t)); ScalePermstructInit(n,n, ScalePermstruct); LUstructInit(n,n, LUstruct); /* Set the default input options. */ set_default_options_dist(&options); options.IterRefine=NO; options.PrintStat=NO; pdgssvx(&options, A, ScalePermstruct, b, nl, 0, grid, LUstruct, &SOLVEstruct, berr, &stat, &info); if ( info == 0 ) { ; } else { printf("pdgssvx() error returns INFO= %d\n", info); if ( info <= n ) { /* factorization completes */ ; } } if (options.SolveInitialized) { dSolveFinalize(&options,&SOLVEstruct); } /* Save the LU factors in the factors handle */ LUfactors = (factors_t *) SUPERLU_MALLOC(sizeof(factors_t)); LUfactors->LUstruct = LUstruct; LUfactors->grid = grid; LUfactors->A = A; LUfactors->ScalePermstruct = ScalePermstruct; /* fprintf(stderr,"slud factor: LUFactors %p \n",LUfactors); */ /* fprintf(stderr,"slud factor: A %p %p\n",A,LUfactors->A); */ /* fprintf(stderr,"slud factor: grid %p %p\n",grid,LUfactors->grid); */ /* fprintf(stderr,"slud factor: LUstruct %p %p\n",LUstruct,LUfactors->LUstruct); */ *f_factors = (void *) LUfactors; PStatFree(&stat); return(info); #else fprintf(stderr," SLUDist Not Configured, fix make.inc and recompile\n"); return(-1); #endif } void mld_dsludist_solve_(int *itrans, int *n, int *nrhs, double *b, int *ldb, #ifdef Have_SLUDist_ fptr *f_factors, /* a handle containing the address pointing to the factored matrices */ #else void *f_factors, #endif int *info) { /* * This routine can be called from Fortran. * performs triangular solve * */ #ifdef Have_SLUDist_ SuperMatrix *A; ScalePermstruct_t *ScalePermstruct; LUstruct_t *LUstruct; SOLVEstruct_t SOLVEstruct; gridinfo_t *grid; int i, panel_size, permc_spec, relax; trans_t trans; double drop_tol = 0.0; double *berr; mem_usage_t mem_usage; superlu_options_t options; SuperLUStat_t stat; factors_t *LUfactors; LUfactors = (factors_t *) *f_factors ; A = LUfactors->A ; LUstruct = LUfactors->LUstruct ; grid = LUfactors->grid ; ScalePermstruct = LUfactors->ScalePermstruct; /* fprintf(stderr,"slud solve: LUFactors %p \n",LUfactors); */ /* fprintf(stderr,"slud solve: A %p %p\n",A,LUfactors->A); */ /* fprintf(stderr,"slud solve: grid %p %p\n",grid,LUfactors->grid); */ /* fprintf(stderr,"slud solve: LUstruct %p %p\n",LUstruct,LUfactors->LUstruct); */ if (*itrans == 0) { trans = NOTRANS; } else if (*itrans ==1) { trans = TRANS; } else if (*itrans ==2) { trans = CONJ; } else { trans = NOTRANS; } /* fprintf(stderr,"Entry to sludist_solve\n"); */ berr = (double *) malloc((*nrhs) *sizeof(double)); /* Initialize the statistics variables. */ PStatInit(&stat); /* Set the default input options. */ set_default_options_dist(&options); options.IterRefine = NO; options.Fact = FACTORED; options.PrintStat = NO; pdgssvx(&options, A, ScalePermstruct, b, *ldb, *nrhs, grid, LUstruct, &SOLVEstruct, berr, &stat, info); /* fprintf(stderr,"Double check: after solve %d %lf\n",*info,berr[0]); */ if (options.SolveInitialized) { dSolveFinalize(&options,&SOLVEstruct); } PStatFree(&stat); free(berr); #else fprintf(stderr," SLUDist Not Configured, fix make.inc and recompile\n"); *info=-1; #endif } void mld_dsludist_free_( #ifdef Have_SLUDist_ fptr *f_factors, /* a handle containing the address pointing to the factored matrices */ #else void *f_factors, #endif int *info) { /* * This routine can be called from Fortran. * * free all storage in the end * */ #ifdef Have_SLUDist_ SuperMatrix *A; ScalePermstruct_t *ScalePermstruct; LUstruct_t *LUstruct; SOLVEstruct_t SOLVEstruct; gridinfo_t *grid; int i, panel_size, permc_spec, relax; trans_t trans; double drop_tol = 0.0; double *berr; mem_usage_t mem_usage; superlu_options_t options; SuperLUStat_t stat; factors_t *LUfactors; LUfactors = (factors_t *) *f_factors ; A = LUfactors->A ; LUstruct = LUfactors->LUstruct ; grid = LUfactors->grid ; ScalePermstruct = LUfactors->ScalePermstruct; Destroy_CompRowLoc_Matrix_dist(A); ScalePermstructFree(ScalePermstruct); LUstructFree(LUstruct); superlu_gridexit(grid); free(grid); free(LUstruct); free(LUfactors); #else fprintf(stderr," SLUDist Not Configured, fix make.inc and recompile\n"); *info=-1; #endif }