/dports/math/spooles-mpich/spooles.2.2/Perm/src/ |
H A D | util.c | 28 if ( perm->oldToNew != NULL ) { in Perm_sizeOf() 48 int *counts, *newToOld, *oldToNew ; in Perm_checkPerm() local 79 if ( (oldToNew = perm->oldToNew) != NULL ) { in Perm_checkPerm() 82 if ( 0 <= (inew = oldToNew[iold]) && inew < size ) { in Perm_checkPerm() 129 int *oldToNew = perm->oldToNew = IVinit(size, -1) ; in Perm_fillOldToNew() local 132 oldToNew[newToOld[inew]] = inew ; in Perm_fillOldToNew() 167 int *oldToNew = perm->oldToNew ; in Perm_fillNewToOld() local 170 newToOld[oldToNew[iold]] = iold ; in Perm_fillNewToOld() 206 IVfree(perm->oldToNew) ; in Perm_releaseOldToNew() 210 IVfree(perm->oldToNew) ; in Perm_releaseOldToNew()
|
H A D | compress.c | 21 int *eqmap, *head, *link, *newToOld, *oldToNew, *vals ; in Perm_compress() local 44 if ( (oldToNew = perm->oldToNew) == NULL ) { in Perm_compress() 46 oldToNew = perm->oldToNew ; in Perm_compress() 81 vnew = perm->oldToNew[v] ; in Perm_compress() 83 if ( vnew > perm->oldToNew[v] ) { in Perm_compress() 84 vnew = perm->oldToNew[v] ; in Perm_compress() 91 perm2->oldToNew[perm2->newToOld[vcomp]] = vcomp ; in Perm_compress()
|
/dports/math/spooles-mpich/spooles.2.2_SHARED/Perm/src/ |
H A D | util.c | 28 if ( perm->oldToNew != NULL ) { in Perm_sizeOf() 48 int *counts, *newToOld, *oldToNew ; in Perm_checkPerm() local 79 if ( (oldToNew = perm->oldToNew) != NULL ) { in Perm_checkPerm() 82 if ( 0 <= (inew = oldToNew[iold]) && inew < size ) { in Perm_checkPerm() 129 int *oldToNew = perm->oldToNew = IVinit(size, -1) ; in Perm_fillOldToNew() local 132 oldToNew[newToOld[inew]] = inew ; in Perm_fillOldToNew() 167 int *oldToNew = perm->oldToNew ; in Perm_fillNewToOld() local 170 newToOld[oldToNew[iold]] = iold ; in Perm_fillNewToOld() 206 IVfree(perm->oldToNew) ; in Perm_releaseOldToNew() 210 IVfree(perm->oldToNew) ; in Perm_releaseOldToNew()
|
H A D | compress.c | 21 int *eqmap, *head, *link, *newToOld, *oldToNew, *vals ; in Perm_compress() local 44 if ( (oldToNew = perm->oldToNew) == NULL ) { in Perm_compress() 46 oldToNew = perm->oldToNew ; in Perm_compress() 81 vnew = perm->oldToNew[v] ; in Perm_compress() 83 if ( vnew > perm->oldToNew[v] ) { in Perm_compress() 84 vnew = perm->oldToNew[v] ; in Perm_compress() 91 perm2->oldToNew[perm2->newToOld[vcomp]] = vcomp ; in Perm_compress()
|
/dports/math/spooles/spooles.2.2_SHARED/Perm/src/ |
H A D | util.c | 28 if ( perm->oldToNew != NULL ) { in Perm_sizeOf() 48 int *counts, *newToOld, *oldToNew ; in Perm_checkPerm() local 79 if ( (oldToNew = perm->oldToNew) != NULL ) { in Perm_checkPerm() 82 if ( 0 <= (inew = oldToNew[iold]) && inew < size ) { in Perm_checkPerm() 129 int *oldToNew = perm->oldToNew = IVinit(size, -1) ; in Perm_fillOldToNew() local 132 oldToNew[newToOld[inew]] = inew ; in Perm_fillOldToNew() 167 int *oldToNew = perm->oldToNew ; in Perm_fillNewToOld() local 170 newToOld[oldToNew[iold]] = iold ; in Perm_fillNewToOld() 206 IVfree(perm->oldToNew) ; in Perm_releaseOldToNew() 210 IVfree(perm->oldToNew) ; in Perm_releaseOldToNew()
|
H A D | compress.c | 21 int *eqmap, *head, *link, *newToOld, *oldToNew, *vals ; in Perm_compress() local 44 if ( (oldToNew = perm->oldToNew) == NULL ) { in Perm_compress() 46 oldToNew = perm->oldToNew ; in Perm_compress() 81 vnew = perm->oldToNew[v] ; in Perm_compress() 83 if ( vnew > perm->oldToNew[v] ) { in Perm_compress() 84 vnew = perm->oldToNew[v] ; in Perm_compress() 91 perm2->oldToNew[perm2->newToOld[vcomp]] = vcomp ; in Perm_compress()
|
/dports/math/spooles/spooles.2.2/Perm/src/ |
H A D | util.c | 28 if ( perm->oldToNew != NULL ) { in Perm_sizeOf() 48 int *counts, *newToOld, *oldToNew ; in Perm_checkPerm() local 79 if ( (oldToNew = perm->oldToNew) != NULL ) { in Perm_checkPerm() 82 if ( 0 <= (inew = oldToNew[iold]) && inew < size ) { in Perm_checkPerm() 129 int *oldToNew = perm->oldToNew = IVinit(size, -1) ; in Perm_fillOldToNew() local 132 oldToNew[newToOld[inew]] = inew ; in Perm_fillOldToNew() 167 int *oldToNew = perm->oldToNew ; in Perm_fillNewToOld() local 170 newToOld[oldToNew[iold]] = iold ; in Perm_fillNewToOld() 206 IVfree(perm->oldToNew) ; in Perm_releaseOldToNew() 210 IVfree(perm->oldToNew) ; in Perm_releaseOldToNew()
|
H A D | compress.c | 21 int *eqmap, *head, *link, *newToOld, *oldToNew, *vals ; in Perm_compress() local 44 if ( (oldToNew = perm->oldToNew) == NULL ) { in Perm_compress() 46 oldToNew = perm->oldToNew ; in Perm_compress() 81 vnew = perm->oldToNew[v] ; in Perm_compress() 83 if ( vnew > perm->oldToNew[v] ) { in Perm_compress() 84 vnew = perm->oldToNew[v] ; in Perm_compress() 91 perm2->oldToNew[perm2->newToOld[vcomp]] = vcomp ; in Perm_compress()
|
/dports/math/spooles-mpich/spooles.2.2_SHARED/misc/src/ |
H A D | localND.c | 38 int oldToNew[] in localND2D() argument 49 || oldToNew == NULL ) { in localND2D() 178 oldToNew[ij] = now++ ; in localND2D() 201 oldToNew[ij] = now++ ; in localND2D() 208 oldToNew[ij] = now++ ; in localND2D() 214 oldToNew[ij] = now++ ; in localND2D() 245 oldToNew[ij] = now++ ; in localND2D() 272 oldToNew[ij] = now++ ; in localND2D() 331 int oldToNew[] in localND3D() argument 350 if ( oldToNew == NULL ) { in localND3D() [all …]
|
/dports/math/spooles-mpich/spooles.2.2/misc/src/ |
H A D | localND.c | 38 int oldToNew[] in localND2D() argument 49 || oldToNew == NULL ) { in localND2D() 178 oldToNew[ij] = now++ ; in localND2D() 201 oldToNew[ij] = now++ ; in localND2D() 208 oldToNew[ij] = now++ ; in localND2D() 214 oldToNew[ij] = now++ ; in localND2D() 245 oldToNew[ij] = now++ ; in localND2D() 272 oldToNew[ij] = now++ ; in localND2D() 331 int oldToNew[] in localND3D() argument 350 if ( oldToNew == NULL ) { in localND3D() [all …]
|
/dports/math/spooles/spooles.2.2_SHARED/misc/src/ |
H A D | localND.c | 38 int oldToNew[] in localND2D() argument 49 || oldToNew == NULL ) { in localND2D() 178 oldToNew[ij] = now++ ; in localND2D() 201 oldToNew[ij] = now++ ; in localND2D() 208 oldToNew[ij] = now++ ; in localND2D() 214 oldToNew[ij] = now++ ; in localND2D() 245 oldToNew[ij] = now++ ; in localND2D() 272 oldToNew[ij] = now++ ; in localND2D() 331 int oldToNew[] in localND3D() argument 350 if ( oldToNew == NULL ) { in localND3D() [all …]
|
/dports/math/spooles/spooles.2.2/misc/src/ |
H A D | localND.c | 38 int oldToNew[] in localND2D() argument 49 || oldToNew == NULL ) { in localND2D() 178 oldToNew[ij] = now++ ; in localND2D() 201 oldToNew[ij] = now++ ; in localND2D() 208 oldToNew[ij] = now++ ; in localND2D() 214 oldToNew[ij] = now++ ; in localND2D() 245 oldToNew[ij] = now++ ; in localND2D() 272 oldToNew[ij] = now++ ; in localND2D() 331 int oldToNew[] in localND3D() argument 350 if ( oldToNew == NULL ) { in localND3D() [all …]
|
/dports/math/spooles-mpich/spooles.2.2_SHARED/Tree/src/ |
H A D | perms.c | 52 int oldToNew[] in Tree_fillOldToNewPerm() argument 60 if ( tree == NULL || tree->n < 1 || oldToNew == NULL ) { in Tree_fillOldToNewPerm() 62 "\n bad input\n", tree, oldToNew) ; in Tree_fillOldToNewPerm() 73 oldToNew[v] = i++ ; in Tree_fillOldToNewPerm() 89 int oldToNew[] in Tree_fillBothPerms() argument 98 || newToOld == NULL || oldToNew == NULL ) { in Tree_fillBothPerms() 100 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_fillBothPerms() 112 oldToNew[v] = i++ ; in Tree_fillBothPerms()
|
H A D | permute.c | 17 int oldToNew[] in Tree_permute() argument 27 || newToOld == NULL || oldToNew == NULL ) { in Tree_permute() 29 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_permute() 47 tree2->par[v_new] = oldToNew[w_old] ; in Tree_permute() 50 tree2->fch[v_new] = oldToNew[u_old] ; in Tree_permute() 53 tree2->sib[v_new] = oldToNew[u_old] ; in Tree_permute() 57 tree2->root = oldToNew[tree->root] ; in Tree_permute()
|
/dports/math/spooles-mpich/spooles.2.2/Tree/src/ |
H A D | perms.c | 52 int oldToNew[] in Tree_fillOldToNewPerm() argument 60 if ( tree == NULL || tree->n < 1 || oldToNew == NULL ) { in Tree_fillOldToNewPerm() 62 "\n bad input\n", tree, oldToNew) ; in Tree_fillOldToNewPerm() 73 oldToNew[v] = i++ ; in Tree_fillOldToNewPerm() 89 int oldToNew[] in Tree_fillBothPerms() argument 98 || newToOld == NULL || oldToNew == NULL ) { in Tree_fillBothPerms() 100 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_fillBothPerms() 112 oldToNew[v] = i++ ; in Tree_fillBothPerms()
|
H A D | permute.c | 17 int oldToNew[] in Tree_permute() argument 27 || newToOld == NULL || oldToNew == NULL ) { in Tree_permute() 29 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_permute() 47 tree2->par[v_new] = oldToNew[w_old] ; in Tree_permute() 50 tree2->fch[v_new] = oldToNew[u_old] ; in Tree_permute() 53 tree2->sib[v_new] = oldToNew[u_old] ; in Tree_permute() 57 tree2->root = oldToNew[tree->root] ; in Tree_permute()
|
/dports/math/spooles/spooles.2.2_SHARED/Tree/src/ |
H A D | perms.c | 52 int oldToNew[] in Tree_fillOldToNewPerm() argument 60 if ( tree == NULL || tree->n < 1 || oldToNew == NULL ) { in Tree_fillOldToNewPerm() 62 "\n bad input\n", tree, oldToNew) ; in Tree_fillOldToNewPerm() 73 oldToNew[v] = i++ ; in Tree_fillOldToNewPerm() 89 int oldToNew[] in Tree_fillBothPerms() argument 98 || newToOld == NULL || oldToNew == NULL ) { in Tree_fillBothPerms() 100 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_fillBothPerms() 112 oldToNew[v] = i++ ; in Tree_fillBothPerms()
|
H A D | permute.c | 17 int oldToNew[] in Tree_permute() argument 27 || newToOld == NULL || oldToNew == NULL ) { in Tree_permute() 29 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_permute() 47 tree2->par[v_new] = oldToNew[w_old] ; in Tree_permute() 50 tree2->fch[v_new] = oldToNew[u_old] ; in Tree_permute() 53 tree2->sib[v_new] = oldToNew[u_old] ; in Tree_permute() 57 tree2->root = oldToNew[tree->root] ; in Tree_permute()
|
/dports/math/spooles/spooles.2.2/Tree/src/ |
H A D | perms.c | 52 int oldToNew[] in Tree_fillOldToNewPerm() argument 60 if ( tree == NULL || tree->n < 1 || oldToNew == NULL ) { in Tree_fillOldToNewPerm() 62 "\n bad input\n", tree, oldToNew) ; in Tree_fillOldToNewPerm() 73 oldToNew[v] = i++ ; in Tree_fillOldToNewPerm() 89 int oldToNew[] in Tree_fillBothPerms() argument 98 || newToOld == NULL || oldToNew == NULL ) { in Tree_fillBothPerms() 100 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_fillBothPerms() 112 oldToNew[v] = i++ ; in Tree_fillBothPerms()
|
H A D | permute.c | 17 int oldToNew[] in Tree_permute() argument 27 || newToOld == NULL || oldToNew == NULL ) { in Tree_permute() 29 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_permute() 47 tree2->par[v_new] = oldToNew[w_old] ; in Tree_permute() 50 tree2->fch[v_new] = oldToNew[u_old] ; in Tree_permute() 53 tree2->sib[v_new] = oldToNew[u_old] ; in Tree_permute() 57 tree2->root = oldToNew[tree->root] ; in Tree_permute()
|
/dports/devel/binaryen/binaryen-version_98/src/passes/ |
H A D | ReorderLocals.cpp | 103 std::vector<Index> oldToNew; in doWalkFunction() local 104 oldToNew.resize(num); in doWalkFunction() 107 oldToNew[i] = i; in doWalkFunction() 109 oldToNew[newToOld[i]] = i; in doWalkFunction() 115 std::vector<Index>& oldToNew; in doWalkFunction() member 117 ReIndexer(Function* func, std::vector<Index>& oldToNew) in doWalkFunction() 118 : func(func), oldToNew(oldToNew) {} in doWalkFunction() 121 curr->index = oldToNew[curr->index]; in doWalkFunction() 125 curr->index = oldToNew[curr->index]; in doWalkFunction() 128 ReIndexer reIndexer(curr, oldToNew); in doWalkFunction()
|
/dports/math/spooles-mpich/spooles.2.2_SHARED/DenseMtx/src/ |
H A D | permute.c | 20 int *oldToNew, *rowind ; in DenseMtx_permuteRows() local 40 IV_sizeAndEntries(oldToNewIV, &maxnrow, &oldToNew) ; in DenseMtx_permuteRows() 49 rowind[ii] = oldToNew[rowind[ii]] ; in DenseMtx_permuteRows() 77 int *oldToNew, *colind ; in DenseMtx_permuteColumns() local 97 IV_sizeAndEntries(oldToNewIV, &maxncol, &oldToNew) ; in DenseMtx_permuteColumns() 107 colind[ii] = oldToNew[jcol] ; in DenseMtx_permuteColumns()
|
/dports/math/spooles-mpich/spooles.2.2/DenseMtx/src/ |
H A D | permute.c | 20 int *oldToNew, *rowind ; in DenseMtx_permuteRows() local 40 IV_sizeAndEntries(oldToNewIV, &maxnrow, &oldToNew) ; in DenseMtx_permuteRows() 49 rowind[ii] = oldToNew[rowind[ii]] ; in DenseMtx_permuteRows() 77 int *oldToNew, *colind ; in DenseMtx_permuteColumns() local 97 IV_sizeAndEntries(oldToNewIV, &maxncol, &oldToNew) ; in DenseMtx_permuteColumns() 107 colind[ii] = oldToNew[jcol] ; in DenseMtx_permuteColumns()
|
/dports/math/spooles/spooles.2.2_SHARED/DenseMtx/src/ |
H A D | permute.c | 20 int *oldToNew, *rowind ; in DenseMtx_permuteRows() local 40 IV_sizeAndEntries(oldToNewIV, &maxnrow, &oldToNew) ; in DenseMtx_permuteRows() 49 rowind[ii] = oldToNew[rowind[ii]] ; in DenseMtx_permuteRows() 77 int *oldToNew, *colind ; in DenseMtx_permuteColumns() local 97 IV_sizeAndEntries(oldToNewIV, &maxncol, &oldToNew) ; in DenseMtx_permuteColumns() 107 colind[ii] = oldToNew[jcol] ; in DenseMtx_permuteColumns()
|
/dports/math/spooles/spooles.2.2/DenseMtx/src/ |
H A D | permute.c | 20 int *oldToNew, *rowind ; in DenseMtx_permuteRows() local 40 IV_sizeAndEntries(oldToNewIV, &maxnrow, &oldToNew) ; in DenseMtx_permuteRows() 49 rowind[ii] = oldToNew[rowind[ii]] ; in DenseMtx_permuteRows() 77 int *oldToNew, *colind ; in DenseMtx_permuteColumns() local 97 IV_sizeAndEntries(oldToNewIV, &maxncol, &oldToNew) ; in DenseMtx_permuteColumns() 107 colind[ii] = oldToNew[jcol] ; in DenseMtx_permuteColumns()
|