Home
last modified time | relevance | path

Searched refs:nfront1 (Results 1 – 4 of 4) sorted by relevance

/dports/math/spooles-mpich/spooles.2.2/ETree/src/
H A Dutil.c602 int ii, J, K, nfront0, nfront1, nfront2, nvtx, phi, v, vsize, w ; in ETree_spliceTwoETrees() local
624 nfront1 = etree1->nfront ; in ETree_spliceTwoETrees()
635 nfront2 = nfront0 + nfront1 ; in ETree_spliceTwoETrees()
652 for ( J = 0 ; J < nfront1 ; J++ ) { in ETree_spliceTwoETrees()
694 K = nfront1 ; in ETree_spliceTwoETrees()
725 if ( K < nfront1 ) { in ETree_spliceTwoETrees()
/dports/math/spooles/spooles.2.2/ETree/src/
H A Dutil.c602 int ii, J, K, nfront0, nfront1, nfront2, nvtx, phi, v, vsize, w ; in ETree_spliceTwoETrees() local
624 nfront1 = etree1->nfront ; in ETree_spliceTwoETrees()
635 nfront2 = nfront0 + nfront1 ; in ETree_spliceTwoETrees()
652 for ( J = 0 ; J < nfront1 ; J++ ) { in ETree_spliceTwoETrees()
694 K = nfront1 ; in ETree_spliceTwoETrees()
725 if ( K < nfront1 ) { in ETree_spliceTwoETrees()
/dports/math/spooles-mpich/spooles.2.2_SHARED/ETree/src/
H A Dutil.c602 int ii, J, K, nfront0, nfront1, nfront2, nvtx, phi, v, vsize, w ; in ETree_spliceTwoETrees() local
624 nfront1 = etree1->nfront ; in ETree_spliceTwoETrees()
635 nfront2 = nfront0 + nfront1 ; in ETree_spliceTwoETrees()
652 for ( J = 0 ; J < nfront1 ; J++ ) { in ETree_spliceTwoETrees()
694 K = nfront1 ; in ETree_spliceTwoETrees()
725 if ( K < nfront1 ) { in ETree_spliceTwoETrees()
/dports/math/spooles/spooles.2.2_SHARED/ETree/src/
H A Dutil.c602 int ii, J, K, nfront0, nfront1, nfront2, nvtx, phi, v, vsize, w ; in ETree_spliceTwoETrees() local
624 nfront1 = etree1->nfront ; in ETree_spliceTwoETrees()
635 nfront2 = nfront0 + nfront1 ; in ETree_spliceTwoETrees()
652 for ( J = 0 ; J < nfront1 ; J++ ) { in ETree_spliceTwoETrees()
694 K = nfront1 ; in ETree_spliceTwoETrees()
725 if ( K < nfront1 ) { in ETree_spliceTwoETrees()