|
int_t | log2i (int_t index) |
|
int_t * | supernodal_etree (int_t nsuper, int_t *etree, int_t *supno, int_t *xsup) |
|
int_t * | topological_ordering (int_t nsuper, int_t *setree) |
|
treeList_t * | setree2list (int_t nsuper, int_t *setree) |
|
int | free_treelist (int_t nsuper, treeList_t *treeList) |
|
int_t | estimateWeight (int_t nsupers, int_t *setree, treeList_t *treeList, int_t *xsup) |
|
int_t | calcTreeWeight (int_t nsupers, int_t *setree, treeList_t *treeList, int_t *xsup) |
|
int_t | printFileList (char *sname, int_t nnodes, int_t *dlist, int_t *setree) |
|
int_t | getDescendList (int_t k, int_t *dlist, treeList_t *treeList) |
|
int_t | getCommonAncsCount (int_t k, treeList_t *treeList) |
|
int_t | getCommonAncestorList (int_t k, int_t *alist, int_t *seTree, treeList_t *treeList) |
|
int | cmpfunc (const void *a, const void *b) |
|
int_t * | getPermNodeList (int_t nnode, int_t *nlist, int_t *perm_c_sup, int_t *iperm_c_sup) |
|
int_t * | getEtreeLB (int_t nnodes, int_t *perm_l, int_t *gTopOrder) |
|
int_t * | getSubTreeRoots (int_t k, treeList_t *treeList) |
|
int_t | testSubtreeNodelist (int_t nsupers, int_t numList, int_t **nodeList, int_t *nodeCount) |
|
int_t | testListPerm (int_t nodeCount, int_t *nodeList, int_t *permList, int_t *gTopLevel) |
|
int_t | mergPermTest (int_t nperms, int_t *gperms, int_t *nnodes) |
|
int_t * | merg_perms (int_t nperms, int_t *nnodes, int_t **perms) |
|
int_t * | getGlobal_iperm (int_t nsupers, int_t nperms, int_t **perms, int_t *nnodes) |
|
int_t * | getTreeHeads (int_t maxLvl, int_t nsupers, treeList_t *treeList) |
|
int_t * | calcNumNodes (int_t maxLvl, int_t *treeHeads, treeList_t *treeList) |
|
int_t ** | getNodeList (int_t maxLvl, int_t *setree, int_t *nnodes, int_t *treeHeads, treeList_t *treeList) |
|
int_t * | getGridTrees (gridinfo3d_t *grid3d) |
|
int_t * | getReplicatedTrees (gridinfo3d_t *grid3d) |
|
int_t * | getMyIperm (int_t nnodes, int_t nsupers, int_t *myPerm) |
|
int_t * | getMyTopOrder (int_t nnodes, int_t *myPerm, int_t *myIperm, int_t *setree) |
|
int_t | checkConsistancyPermTopOrder (int_t nnodes, int_t *myTopOrder) |
|
int_t * | getMyEtLims (int_t nnodes, int_t *myTopOrder) |
|
treeTopoInfo_t | getMyTreeTopoInfo (int_t nnodes, int_t nsupers, int_t *myPerm, int_t *setree) |
|
int_t * | Etree_LevelBoundry (int_t *perm, int_t *tsort_etree, int_t nsuper) |
|
int_t * | calculate_num_children (int_t nsuper, int_t *setree) |
|
void | Print_EtreeLevelBoundry (int_t *Etree_LvlBdry, int_t max_level, int_t nsuper) |
|
void | print_etree_leveled (int_t *setree, int_t *tsort_etree, int_t nsuper) |
|
void | printEtree (int_t nsuper, int_t *setree, treeList_t *treeList) |
|
void | print_etree (int_t *setree, int_t *iperm, int_t nsuper) |
|
function to generate supernodal etree
-- Distributed SuperLU routine (version 7.0) --
Lawrence Berkeley National Lab, Oak Ridge National Lab
May 12, 2021