SuperLU Distributed 8.2.1
Distributed memory sparse direct solver
treeFactorization.c File Reference

factorization routines in 3D algorithms More...

#include "superlu_ddefs.h"
Include dependency graph for treeFactorization.c:

Functions

int_t initCommRequests (commRequests_t *comReqs, gridinfo_t *grid)
 
commRequests_t ** initCommRequestsArr (int_t mxLeafNode, int_t ldt, gridinfo_t *grid)
 
int freeCommRequestsArr (int_t mxLeafNode, commRequests_t **comReqss)
 
int_t initFactStat (int_t nsupers, factStat_t *factStat)
 
int freeFactStat (factStat_t *factStat)
 
int_t initFactNodelists (int_t ldt, int_t num_threads, int_t nsupers, factNodelists_t *fNlists)
 
int freeFactNodelists (factNodelists_t *fNlists)
 
int_t initMsgs (msgs_t *msgs)
 
msgs_t ** initMsgsArr (int_t numLA)
 
int freeMsgsArr (int_t numLA, msgs_t **msgss)
 
int_t initPackLUInfo (int_t nsupers, packLUInfo_t *packLUInfo)
 
int freePackLUInfo (packLUInfo_t *packLUInfo)
 
int_t getNumLookAhead (superlu_dist_options_t *options)
 
int_t checkRecvUDiag (int_t k, commRequests_t *comReqs, gridinfo_t *grid, SCT_t *SCT)
 
int_t checkRecvLDiag (int_t k, commRequests_t *comReqs, gridinfo_t *grid, SCT_t *SCT)
 

Detailed Description

factorization routines in 3D algorithms

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 7.0) --
Lawrence Berkeley National Lab, Oak Ridge National Lab
May 12, 2021

Function Documentation

◆ checkRecvLDiag()

int_t checkRecvLDiag ( int_t  k,
commRequests_t comReqs,
gridinfo_t grid,
SCT_t SCT 
)

◆ checkRecvUDiag()

int_t checkRecvUDiag ( int_t  k,
commRequests_t comReqs,
gridinfo_t grid,
SCT_t SCT 
)

◆ freeCommRequestsArr()

int freeCommRequestsArr ( int_t  mxLeafNode,
commRequests_t **  comReqss 
)

◆ freeFactNodelists()

int freeFactNodelists ( factNodelists_t fNlists)

◆ freeFactStat()

int freeFactStat ( factStat_t factStat)

◆ freeMsgsArr()

int freeMsgsArr ( int_t  numLA,
msgs_t **  msgss 
)

◆ freePackLUInfo()

int freePackLUInfo ( packLUInfo_t packLUInfo)

◆ getNumLookAhead()

int_t getNumLookAhead ( superlu_dist_options_t options)

◆ initCommRequests()

int_t initCommRequests ( commRequests_t comReqs,
gridinfo_t grid 
)
Here is the caller graph for this function:

◆ initCommRequestsArr()

commRequests_t ** initCommRequestsArr ( int_t  mxLeafNode,
int_t  ldt,
gridinfo_t grid 
)

◆ initFactNodelists()

int_t initFactNodelists ( int_t  ldt,
int_t  num_threads,
int_t  nsupers,
factNodelists_t fNlists 
)

◆ initFactStat()

int_t initFactStat ( int_t  nsupers,
factStat_t factStat 
)

◆ initMsgs()

int_t initMsgs ( msgs_t msgs)
Here is the caller graph for this function:

◆ initMsgsArr()

msgs_t ** initMsgsArr ( int_t  numLA)

◆ initPackLUInfo()

int_t initPackLUInfo ( int_t  nsupers,
packLUInfo_t packLUInfo 
)