/dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Mumps/MUMPS/PORD/lib/ |
H A D | minpriority.c | 97 minprior->nreach = 0; in newMinPriority() 238 int *pflag, nreach, nvtx, r, u, i; in eliminateStage() local 264 nreach = 0; in eliminateStage() 267 { reachset[nreach++] = u; in eliminateStage() 276 updateDegree(Gelim, reachset, nreach, auxbin); in eliminateStage() 279 for (i = 0; i < nreach; i++) in eliminateStage() 290 nreach = minprior->nreach; in eliminateStage() 330 for (i = 0; i < nreach; i++) in eliminateStage() 335 nreach = r; in eliminateStage() 348 for (i = 0; i < nreach; i++) in eliminateStage() [all …]
|
H A D | gelim.c | 511 for (i = 0; i < nreach; i++) in updateAdjncy() 589 for (i = 0; i < nreach; i++) in updateAdjncy() 629 for (i = 0; i < nreach; i++) in updateAdjncy() 660 for (i = 0; i < nreach; i++) in findIndNodes() 692 for (i = 0; i < nreach; i++) in findIndNodes() 750 for (i = 0; i < nreach; i++) in findIndNodes() 761 updateDegree(gelim_t *Gelim, int *reachset, int nreach, int *bin) in updateDegree() argument 778 for (r = 0; r < nreach; r++) in updateDegree() 787 for (r = 0; r < nreach; r++) in updateDegree() 913 for (r = 0; r < nreach; r++) in updateScore() [all …]
|
/dports/math/coinmumps/MUMPS_4.10.0/PORD/lib/ |
H A D | minpriority.c | 97 minprior->nreach = 0; in newMinPriority() 238 int *pflag, nreach, nvtx, r, u, i; in eliminateStage() local 264 nreach = 0; in eliminateStage() 267 { reachset[nreach++] = u; in eliminateStage() 276 updateDegree(Gelim, reachset, nreach, auxbin); in eliminateStage() 279 for (i = 0; i < nreach; i++) in eliminateStage() 290 nreach = minprior->nreach; in eliminateStage() 330 for (i = 0; i < nreach; i++) in eliminateStage() 335 nreach = r; in eliminateStage() 348 for (i = 0; i < nreach; i++) in eliminateStage() [all …]
|
H A D | gelim.c | 511 for (i = 0; i < nreach; i++) in updateAdjncy() 589 for (i = 0; i < nreach; i++) in updateAdjncy() 629 for (i = 0; i < nreach; i++) in updateAdjncy() 660 for (i = 0; i < nreach; i++) in findIndNodes() 692 for (i = 0; i < nreach; i++) in findIndNodes() 750 for (i = 0; i < nreach; i++) in findIndNodes() 761 updateDegree(gelim_t *Gelim, int *reachset, int nreach, int *bin) in updateDegree() argument 778 for (r = 0; r < nreach; r++) in updateDegree() 787 for (r = 0; r < nreach; r++) in updateDegree() 913 for (r = 0; r < nreach; r++) in updateScore() [all …]
|
/dports/math/mumps/mumps-5.1.2/PORD/lib/ |
H A D | minpriority.c | 97 minprior->nreach = 0; in newMinPriority() 238 PORD_INT *pflag, nreach, nvtx, r, u, i; in eliminateStage() local 264 nreach = 0; in eliminateStage() 267 { reachset[nreach++] = u; in eliminateStage() 276 updateDegree(Gelim, reachset, nreach, auxbin); in eliminateStage() 279 for (i = 0; i < nreach; i++) in eliminateStage() 290 nreach = minprior->nreach; in eliminateStage() 330 for (i = 0; i < nreach; i++) in eliminateStage() 335 nreach = r; in eliminateStage() 348 for (i = 0; i < nreach; i++) in eliminateStage() [all …]
|
H A D | gelim.c | 511 for (i = 0; i < nreach; i++) in updateAdjncy() 589 for (i = 0; i < nreach; i++) in updateAdjncy() 629 for (i = 0; i < nreach; i++) in updateAdjncy() 660 for (i = 0; i < nreach; i++) in findIndNodes() 692 for (i = 0; i < nreach; i++) in findIndNodes() 750 for (i = 0; i < nreach; i++) in findIndNodes() 761 updateDegree(gelim_t *Gelim, PORD_INT *reachset, PORD_INT nreach, PORD_INT *bin) in updateDegree() argument 778 for (r = 0; r < nreach; r++) in updateDegree() 787 for (r = 0; r < nreach; r++) in updateDegree() 913 for (r = 0; r < nreach; r++) in updateScore() [all …]
|
/dports/math/mumps4/MUMPS_4.10.0/PORD/lib/ |
H A D | minpriority.c | 97 minprior->nreach = 0; in newMinPriority() 238 int *pflag, nreach, nvtx, r, u, i; in eliminateStage() local 264 nreach = 0; in eliminateStage() 267 { reachset[nreach++] = u; in eliminateStage() 276 updateDegree(Gelim, reachset, nreach, auxbin); in eliminateStage() 279 for (i = 0; i < nreach; i++) in eliminateStage() 290 nreach = minprior->nreach; in eliminateStage() 330 for (i = 0; i < nreach; i++) in eliminateStage() 335 nreach = r; in eliminateStage() 348 for (i = 0; i < nreach; i++) in eliminateStage() [all …]
|
H A D | gelim.c | 511 for (i = 0; i < nreach; i++) in updateAdjncy() 589 for (i = 0; i < nreach; i++) in updateAdjncy() 629 for (i = 0; i < nreach; i++) in updateAdjncy() 660 for (i = 0; i < nreach; i++) in findIndNodes() 692 for (i = 0; i < nreach; i++) in findIndNodes() 750 for (i = 0; i < nreach; i++) in findIndNodes() 761 updateDegree(gelim_t *Gelim, int *reachset, int nreach, int *bin) in updateDegree() argument 778 for (r = 0; r < nreach; r++) in updateDegree() 787 for (r = 0; r < nreach; r++) in updateDegree() 913 for (r = 0; r < nreach; r++) in updateScore() [all …]
|
/dports/math/spooles-mpich/spooles.2.2/MSMD/src/ |
H A D | cleanReachSet.c | 25 int k, nreach ; in MSMD_cleanReachSet() local 38 nreach = IV_size(&msmd->reachIV) ; in MSMD_cleanReachSet() 44 if ( nreach < 0 || nreach > msmd->nvtx || reach == NULL ) { in MSMD_cleanReachSet() 47 msmd, nreach, reach, msmd->nvtx) ; in MSMD_cleanReachSet() 60 fprintf(stdout, "\n nreach = %d", nreach) ; in MSMD_cleanReachSet() 61 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 67 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 81 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 92 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet()
|
H A D | update.c | 18 int ii, jj, nreach, vid, wght ; in MSMD_update() local 45 if ( (nreach = IV_size(reachIV)) == 0 ) { in MSMD_update() 50 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 68 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 101 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 115 for ( ii = 0, jj = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 162 nreach = jj ; in MSMD_update() 168 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 196 IV_setSize(reachIV, nreach) ; in MSMD_update()
|
H A D | findInodes.c | 33 nreach, nvedge, sum, vid, vchk, vcount, wid ; in MSMD_findInodes() local 60 if ( (nreach = IV_size(&msmd->reachIV)) == 0 ) { in MSMD_findInodes() 69 "\n reach(%d) :", msmd, nreach) ; in MSMD_findInodes() 70 IVfp80(info->msgFile, nreach, reach, 10, &ierr); in MSMD_findInodes() 86 i = 0 ; j = nreach - 1 ; in MSMD_findInodes() 116 nlist = nreach ; in MSMD_findInodes()
|
H A D | eliminate.c | 18 int ierr, ii, jj, iv, nelim, nreach, stage, step ; in MSMD_eliminateStage() local 119 nreach = IV_size(reachIV) ; in MSMD_eliminateStage() 121 for ( ii = jj = 0 ; ii < nreach ; ii++ ) { in MSMD_eliminateStage()
|
/dports/math/spooles-mpich/spooles.2.2_SHARED/MSMD/src/ |
H A D | cleanReachSet.c | 25 int k, nreach ; in MSMD_cleanReachSet() local 38 nreach = IV_size(&msmd->reachIV) ; in MSMD_cleanReachSet() 44 if ( nreach < 0 || nreach > msmd->nvtx || reach == NULL ) { in MSMD_cleanReachSet() 47 msmd, nreach, reach, msmd->nvtx) ; in MSMD_cleanReachSet() 60 fprintf(stdout, "\n nreach = %d", nreach) ; in MSMD_cleanReachSet() 61 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 67 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 81 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 92 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet()
|
H A D | update.c | 18 int ii, jj, nreach, vid, wght ; in MSMD_update() local 45 if ( (nreach = IV_size(reachIV)) == 0 ) { in MSMD_update() 50 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 68 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 101 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 115 for ( ii = 0, jj = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 162 nreach = jj ; in MSMD_update() 168 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 196 IV_setSize(reachIV, nreach) ; in MSMD_update()
|
H A D | findInodes.c | 33 nreach, nvedge, sum, vid, vchk, vcount, wid ; in MSMD_findInodes() local 60 if ( (nreach = IV_size(&msmd->reachIV)) == 0 ) { in MSMD_findInodes() 69 "\n reach(%d) :", msmd, nreach) ; in MSMD_findInodes() 70 IVfp80(info->msgFile, nreach, reach, 10, &ierr); in MSMD_findInodes() 86 i = 0 ; j = nreach - 1 ; in MSMD_findInodes() 116 nlist = nreach ; in MSMD_findInodes()
|
H A D | eliminate.c | 18 int ierr, ii, jj, iv, nelim, nreach, stage, step ; in MSMD_eliminateStage() local 119 nreach = IV_size(reachIV) ; in MSMD_eliminateStage() 121 for ( ii = jj = 0 ; ii < nreach ; ii++ ) { in MSMD_eliminateStage()
|
/dports/math/spooles/spooles.2.2_SHARED/MSMD/src/ |
H A D | cleanReachSet.c | 25 int k, nreach ; in MSMD_cleanReachSet() local 38 nreach = IV_size(&msmd->reachIV) ; in MSMD_cleanReachSet() 44 if ( nreach < 0 || nreach > msmd->nvtx || reach == NULL ) { in MSMD_cleanReachSet() 47 msmd, nreach, reach, msmd->nvtx) ; in MSMD_cleanReachSet() 60 fprintf(stdout, "\n nreach = %d", nreach) ; in MSMD_cleanReachSet() 61 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 67 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 81 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 92 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet()
|
H A D | update.c | 18 int ii, jj, nreach, vid, wght ; in MSMD_update() local 45 if ( (nreach = IV_size(reachIV)) == 0 ) { in MSMD_update() 50 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 68 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 101 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 115 for ( ii = 0, jj = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 162 nreach = jj ; in MSMD_update() 168 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 196 IV_setSize(reachIV, nreach) ; in MSMD_update()
|
H A D | findInodes.c | 33 nreach, nvedge, sum, vid, vchk, vcount, wid ; in MSMD_findInodes() local 60 if ( (nreach = IV_size(&msmd->reachIV)) == 0 ) { in MSMD_findInodes() 69 "\n reach(%d) :", msmd, nreach) ; in MSMD_findInodes() 70 IVfp80(info->msgFile, nreach, reach, 10, &ierr); in MSMD_findInodes() 86 i = 0 ; j = nreach - 1 ; in MSMD_findInodes() 116 nlist = nreach ; in MSMD_findInodes()
|
/dports/math/spooles/spooles.2.2/MSMD/src/ |
H A D | cleanReachSet.c | 25 int k, nreach ; in MSMD_cleanReachSet() local 38 nreach = IV_size(&msmd->reachIV) ; in MSMD_cleanReachSet() 44 if ( nreach < 0 || nreach > msmd->nvtx || reach == NULL ) { in MSMD_cleanReachSet() 47 msmd, nreach, reach, msmd->nvtx) ; in MSMD_cleanReachSet() 60 fprintf(stdout, "\n nreach = %d", nreach) ; in MSMD_cleanReachSet() 61 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 67 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 81 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet() 92 for ( k = 0 ; k < nreach ; k++ ) { in MSMD_cleanReachSet()
|
H A D | update.c | 18 int ii, jj, nreach, vid, wght ; in MSMD_update() local 45 if ( (nreach = IV_size(reachIV)) == 0 ) { in MSMD_update() 50 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 68 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 101 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 115 for ( ii = 0, jj = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 162 nreach = jj ; in MSMD_update() 168 for ( ii = 0 ; ii < nreach ; ii++ ) { in MSMD_update() 196 IV_setSize(reachIV, nreach) ; in MSMD_update()
|
H A D | findInodes.c | 33 nreach, nvedge, sum, vid, vchk, vcount, wid ; in MSMD_findInodes() local 60 if ( (nreach = IV_size(&msmd->reachIV)) == 0 ) { in MSMD_findInodes() 69 "\n reach(%d) :", msmd, nreach) ; in MSMD_findInodes() 70 IVfp80(info->msgFile, nreach, reach, 10, &ierr); in MSMD_findInodes() 86 i = 0 ; j = nreach - 1 ; in MSMD_findInodes() 116 nlist = nreach ; in MSMD_findInodes()
|
H A D | eliminate.c | 18 int ierr, ii, jj, iv, nelim, nreach, stage, step ; in MSMD_eliminateStage() local 119 nreach = IV_size(reachIV) ; in MSMD_eliminateStage() 121 for ( ii = jj = 0 ; ii < nreach ; ii++ ) { in MSMD_eliminateStage()
|
/dports/math/highs/HiGHS-cfe064e/src/ipm/basiclu/src/ |
H A D | lu_update.c | 467 lu_int nreach, *col_reach, *row_reach; in lu_update() local 669 nreach = nz_roweta + 1; in lu_update() 675 for (n = 1; n < nreach; n++) in lu_update() 783 nreach = m-rtop; in lu_update() 784 for (n = 0; n < nreach; n++) in lu_update() 842 nreach = 1; in lu_update() 853 if (this->pivotlen + nreach > 2*m) in lu_update() 860 for (n = 0; n < nreach; n++) pivotrow[put++] = row_reach[n]; in lu_update() 864 for (n = 0; n < nreach; n++) pivotcol[put++] = col_reach[n]; in lu_update() 866 this->pivotlen += nreach; in lu_update()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/optimize/_highs/src/ipm/basiclu/src/ |
H A D | lu_update.c | 467 lu_int nreach, *col_reach, *row_reach; in lu_update() local 669 nreach = nz_roweta + 1; in lu_update() 675 for (n = 1; n < nreach; n++) in lu_update() 783 nreach = m-rtop; in lu_update() 784 for (n = 0; n < nreach; n++) in lu_update() 842 nreach = 1; in lu_update() 853 if (this->pivotlen + nreach > 2*m) in lu_update() 860 for (n = 0; n < nreach; n++) pivotrow[put++] = row_reach[n]; in lu_update() 864 for (n = 0; n < nreach; n++) pivotcol[put++] = col_reach[n]; in lu_update() 866 this->pivotlen += nreach; in lu_update()
|