58 int   nb, nfront, nv, nind, nvtx, v ;  in ETree_nFactorIndices()  local
66    || (nfront = etree->nfront) <= 0  in ETree_nFactorIndices()
75 for ( v = 0 ; v < nfront ; v++ ) {  in ETree_nFactorIndices()
100 int   J, nfront, nvtx, nzf ;  in ETree_nFactorEntries()  local
107    || (nfront = etree->nfront) <= 0  in ETree_nFactorEntries()
114 for ( J = 0 ; J < nfront ; J++ ) {  in ETree_nFactorEntries()
142 int      J, nfront, nvtx ;  in ETree_nFactorOps()  local
149    || (nfront = etree->nfront) <= 0  in ETree_nFactorOps()
156 for ( J = 0 ; J < nfront ; J++ ) {  in ETree_nFactorOps()
183    || etree->nfront <= 0  in ETree_nFactorEntriesInFront()
184    || J < 0 || J >= etree->nfront ) {  in ETree_nFactorEntriesInFront()
231    || etree->nfront <= 0  in ETree_nInternalOpsInFront()
232    || J < 0 || J >= etree->nfront ) {  in ETree_nInternalOpsInFront()
290    || etree->nfront <= 0  in ETree_nExternalOpsInFront()
291    || J < 0 || J >= etree->nfront ) {  in ETree_nExternalOpsInFront()
345          nadj, nfront, size, wghtJ, wghtK ;  in ETree_backwardOps()  local
357 nfront     = etree->nfront ;  in ETree_backwardOps()
359 list   = IVinit(nfront, -1) ;  in ETree_backwardOps()
360 mark   = IVinit(nfront, -1) ;  in ETree_backwardOps()
361 counts = IVinit(nfront, 0) ;  in ETree_backwardOps()
368 DV_init(opsDV, nfront, NULL) ;  in ETree_backwardOps()
376 for ( J = 0 ; J < nfront ; J++ ) {  in ETree_backwardOps()
449 int   J, nfront ;  in ETree_factorEntriesIV()  local
462 nfront = ETree_nfront(etree) ;  in ETree_factorEntriesIV()
469 IV_init(nzfIV, nfront, NULL) ;  in ETree_factorEntriesIV()
477 for ( J = 0 ; J < nfront ; J++ ) {  in ETree_factorEntriesIV()
499 int      J, nfront ;  in ETree_forwardOps()  local
510 nfront     = etree->nfront ;  in ETree_forwardOps()
512 DV_init(opsDV, nfront, NULL) ;  in ETree_forwardOps()
515 for ( J = 0 ; J < nfront ; J++ ) {  in ETree_forwardOps()
537 int     ii, ndof, nfront ;  in ETree_expand()  local
549 nfront = etree->nfront ;  in ETree_expand()
557 ETree_init1(etree2, nfront, ndof) ;  in ETree_expand()
561 IVcopy(nfront, etree2->tree->par, etree->tree->par) ;  in ETree_expand()
562 IVcopy(nfront, etree2->tree->fch, etree->tree->fch) ;  in ETree_expand()
563 IVcopy(nfront, etree2->tree->sib, etree->tree->sib) ;  in ETree_expand()
616 nfront0     = etree0->nfront ;  in ETree_spliceTwoETrees()
624 nfront1     = etree1->nfront ;  in ETree_spliceTwoETrees()