| /dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Mumps/MUMPS/PORD/lib/ |
| H A D | minpriority.c | 92 mymalloc(minprior->reachset, nvtx, int); in newMinPriority()
112 free(minprior->reachset); in freeMinPriority()
244 reachset = minprior->reachset; in eliminateStage()
267 { reachset[nreach++] = u; in eliminateStage()
280 { u = reachset[i]; in eliminateStage()
331 { u = reachset[i]; in eliminateStage()
333 reachset[r++] = u; in eliminateStage()
349 { u = reachset[i]; in eliminateStage()
365 int *stage, *reachset, *auxtmp; in eliminateStep() local
374 reachset = minprior->reachset; in eliminateStep()
[all …]
|
| H A D | gelim.c | 512 { u = reachset[i]; in updateAdjncy()
590 { u = reachset[i]; in updateAdjncy()
630 { u = reachset[i]; in updateAdjncy()
661 { u = reachset[i]; in findIndNodes()
693 { u = reachset[i]; in findIndNodes()
751 { u = reachset[i]; in findIndNodes()
761 updateDegree(gelim_t *Gelim, int *reachset, int nreach, int *bin) in updateDegree() argument
779 { u = reachset[r]; in updateDegree()
788 { u = reachset[r]; in updateDegree()
914 { u = reachset[r]; in updateScore()
[all …]
|
| /dports/math/coinmumps/MUMPS_4.10.0/PORD/lib/ |
| H A D | minpriority.c | 92 mymalloc(minprior->reachset, nvtx, int); in newMinPriority()
112 free(minprior->reachset); in freeMinPriority()
244 reachset = minprior->reachset; in eliminateStage()
267 { reachset[nreach++] = u; in eliminateStage()
280 { u = reachset[i]; in eliminateStage()
331 { u = reachset[i]; in eliminateStage()
333 reachset[r++] = u; in eliminateStage()
349 { u = reachset[i]; in eliminateStage()
365 int *stage, *reachset, *auxtmp; in eliminateStep() local
374 reachset = minprior->reachset; in eliminateStep()
[all …]
|
| H A D | gelim.c | 512 { u = reachset[i]; in updateAdjncy()
590 { u = reachset[i]; in updateAdjncy()
630 { u = reachset[i]; in updateAdjncy()
661 { u = reachset[i]; in findIndNodes()
693 { u = reachset[i]; in findIndNodes()
751 { u = reachset[i]; in findIndNodes()
761 updateDegree(gelim_t *Gelim, int *reachset, int nreach, int *bin) in updateDegree() argument
779 { u = reachset[r]; in updateDegree()
788 { u = reachset[r]; in updateDegree()
914 { u = reachset[r]; in updateScore()
[all …]
|
| /dports/math/mumps/mumps-5.1.2/PORD/lib/ |
| H A D | minpriority.c | 92 mymalloc(minprior->reachset, nvtx, PORD_INT); in newMinPriority()
112 free(minprior->reachset); in freeMinPriority()
244 reachset = minprior->reachset; in eliminateStage()
267 { reachset[nreach++] = u; in eliminateStage()
280 { u = reachset[i]; in eliminateStage()
331 { u = reachset[i]; in eliminateStage()
333 reachset[r++] = u; in eliminateStage()
349 { u = reachset[i]; in eliminateStage()
365 PORD_INT *stage, *reachset, *auxtmp; in eliminateStep() local
374 reachset = minprior->reachset; in eliminateStep()
[all …]
|
| H A D | gelim.c | 512 { u = reachset[i]; in updateAdjncy()
590 { u = reachset[i]; in updateAdjncy()
630 { u = reachset[i]; in updateAdjncy()
661 { u = reachset[i]; in findIndNodes()
693 { u = reachset[i]; in findIndNodes()
751 { u = reachset[i]; in findIndNodes()
761 updateDegree(gelim_t *Gelim, PORD_INT *reachset, PORD_INT nreach, PORD_INT *bin) in updateDegree() argument
779 { u = reachset[r]; in updateDegree()
788 { u = reachset[r]; in updateDegree()
914 { u = reachset[r]; in updateScore()
[all …]
|
| /dports/math/mumps4/MUMPS_4.10.0/PORD/lib/ |
| H A D | minpriority.c | 92 mymalloc(minprior->reachset, nvtx, int); in newMinPriority()
112 free(minprior->reachset); in freeMinPriority()
244 reachset = minprior->reachset; in eliminateStage()
267 { reachset[nreach++] = u; in eliminateStage()
280 { u = reachset[i]; in eliminateStage()
331 { u = reachset[i]; in eliminateStage()
333 reachset[r++] = u; in eliminateStage()
349 { u = reachset[i]; in eliminateStage()
365 int *stage, *reachset, *auxtmp; in eliminateStep() local
374 reachset = minprior->reachset; in eliminateStep()
[all …]
|
| H A D | gelim.c | 512 { u = reachset[i]; in updateAdjncy()
590 { u = reachset[i]; in updateAdjncy()
630 { u = reachset[i]; in updateAdjncy()
661 { u = reachset[i]; in findIndNodes()
693 { u = reachset[i]; in findIndNodes()
751 { u = reachset[i]; in findIndNodes()
761 updateDegree(gelim_t *Gelim, int *reachset, int nreach, int *bin) in updateDegree() argument
779 { u = reachset[r]; in updateDegree()
788 { u = reachset[r]; in updateDegree()
914 { u = reachset[r]; in updateScore()
[all …]
|
| /dports/math/ipopt/Ipopt-3.12.13/ThirdParty/Mumps/MUMPS/PORD/include/ |
| H A D | types.h | 122 int *reachset; member
|
| /dports/math/coinmumps/MUMPS_4.10.0/PORD/include/ |
| H A D | types.h | 122 int *reachset; member
|
| /dports/math/mumps4/MUMPS_4.10.0/PORD/include/ |
| H A D | types.h | 122 int *reachset; member
|
| /dports/math/mumps/mumps-5.1.2/PORD/include/ |
| H A D | types.h | 132 PORD_INT *reachset; member
|