SuperLU Distributed 8.2.1
Distributed memory sparse direct solver
psymbfact.h File Reference

Definitions for parallel symbolic factorization routine. More...

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  Pslu_freeable_t
 
struct  Llu_symbfact_t
 
struct  vtcsInfo_symbfact_t
 Local information on vertices distribution. More...
 
struct  matrix_symbfact_t
 Structure used for redistributing A for the symbolic factorization algorithm. More...
 
struct  comm_symbfact_t
 
struct  psymbfact_stat_t
 statistics collected during parallel symbolic factorization More...
 

Macros

#define OWNER(x)   ((x) / maxNvtcsPProc)
 
#define LOCAL_IND(x)   ((x) % maxNvtcsPProc)
 
#define MEM_LSUB(Llu, VInfo)   (Llu->szLsub - VInfo->nnz_ainf_loc)
 
#define MEM_USUB(Llu, VInfo)   (Llu->szUsub - VInfo->nnz_asup_loc)
 
#define tag_interLvl   2
 
#define tag_interLvl_LData   0
 
#define tag_interLvl_UData   1
 
#define tag_intraLvl_szMsg   1000
 
#define tag_intraLvl_LData   1001
 
#define tag_intraLvl_UData   1002
 
#define tag_intraLvl   1003
 
#define DIAG_IND   0
 
#define NELTS_IND   1
 
#define RCVD_IND   2
 
#define SUCCES_RET   0 /* successful return from a routine */
 
#define ERROR_RET   1 /* error return code from a routine */
 
#define FILLED_SEP   2 /* the current separator is dense */
 
#define FILLED_SEPS
 
#define USUB_PR   0
 
#define LSUB_PR   1
 
#define RL_SYMB   0
 
#define DOMAIN_SYMB   1
 
#define LL_SYMB   2
 
#define DNS_UPSEPS   3
 
#define DNS_CURSEP   4
 

Detailed Description

Definitions for parallel symbolic factorization routine.

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.

The source code is distributed under BSD license, see the file License.txt at the top-level directory.

-- Distributed SuperLU routine (version 2.0) --
Lawrence Berkeley National Lab, Univ. of California Berkeley.
March 15, 2003

Macro Definition Documentation

◆ DIAG_IND

#define DIAG_IND   0

◆ DNS_CURSEP

#define DNS_CURSEP   4

◆ DNS_UPSEPS

#define DNS_UPSEPS   3

◆ DOMAIN_SYMB

#define DOMAIN_SYMB   1

◆ ERROR_RET

#define ERROR_RET   1 /* error return code from a routine */

◆ FILLED_SEP

#define FILLED_SEP   2 /* the current separator is dense */

◆ FILLED_SEPS

#define FILLED_SEPS
Value:
3 /* all the separators situated on the path from the current
separator to the root separator are dense */

◆ LL_SYMB

#define LL_SYMB   2

◆ LOCAL_IND

#define LOCAL_IND (   x)    ((x) % maxNvtcsPProc)

◆ LSUB_PR

#define LSUB_PR   1

◆ MEM_LSUB

#define MEM_LSUB (   Llu,
  VInfo 
)    (Llu->szLsub - VInfo->nnz_ainf_loc)

◆ MEM_USUB

#define MEM_USUB (   Llu,
  VInfo 
)    (Llu->szUsub - VInfo->nnz_asup_loc)

◆ NELTS_IND

#define NELTS_IND   1

◆ OWNER

#define OWNER (   x)    ((x) / maxNvtcsPProc)

◆ RCVD_IND

#define RCVD_IND   2

◆ RL_SYMB

#define RL_SYMB   0

◆ SUCCES_RET

#define SUCCES_RET   0 /* successful return from a routine */

◆ tag_interLvl

#define tag_interLvl   2

◆ tag_interLvl_LData

#define tag_interLvl_LData   0

◆ tag_interLvl_UData

#define tag_interLvl_UData   1

◆ tag_intraLvl

#define tag_intraLvl   1003

◆ tag_intraLvl_LData

#define tag_intraLvl_LData   1001

◆ tag_intraLvl_szMsg

#define tag_intraLvl_szMsg   1000

◆ tag_intraLvl_UData

#define tag_intraLvl_UData   1002

◆ USUB_PR

#define USUB_PR   0