/dports/math/spooles-mpich/spooles.2.2_SHARED/misc/src/ |
H A D | ND.c | 64 int newToOld[], in mkNDperm() argument 79 n1, n2, n3, newToOld, in mkNDperm() 95 SplitX(n1, n2, n3, newToOld, in mkNDperm() 102 SplitY(n1, n2, n3, newToOld, in mkNDperm() 109 SplitZ(n1, n2, n3, newToOld, in mkNDperm() 166 int newToOld[], in SplitX() argument 188 mkNDperm(n1, n2, n3, newToOld + k1, in SplitX() 194 mkNDperm(n1, n2, n3, newToOld + k2, in SplitX() 221 int newToOld[], in SplitY() argument 244 mkNDperm(n1, n2, n3, newToOld + k1, in SplitY() [all …]
|
H A D | ND2.c | 69 int newToOld[], in mkNDperm2() argument 85 n1, n2, n3, newToOld, in mkNDperm2() 110 SplitX(n1, n2, n3, newToOld, in mkNDperm2() 118 SplitY(n1, n2, n3, newToOld, in mkNDperm2() 126 SplitZ(n1, n2, n3, newToOld, in mkNDperm2() 183 int newToOld[], in SplitX() argument 215 mkNDperm2(n1, n2, n3, newToOld + k1, in SplitX() 223 mkNDperm2(n1, n2, n3, newToOld + k2, in SplitX() 259 int newToOld[], in SplitY() argument 296 mkNDperm2(n1, n2, n3, newToOld + k1, in SplitY() [all …]
|
/dports/math/spooles-mpich/spooles.2.2/misc/src/ |
H A D | ND.c | 64 int newToOld[], in mkNDperm() argument 79 n1, n2, n3, newToOld, in mkNDperm() 95 SplitX(n1, n2, n3, newToOld, in mkNDperm() 102 SplitY(n1, n2, n3, newToOld, in mkNDperm() 109 SplitZ(n1, n2, n3, newToOld, in mkNDperm() 166 int newToOld[], in SplitX() argument 188 mkNDperm(n1, n2, n3, newToOld + k1, in SplitX() 194 mkNDperm(n1, n2, n3, newToOld + k2, in SplitX() 221 int newToOld[], in SplitY() argument 244 mkNDperm(n1, n2, n3, newToOld + k1, in SplitY() [all …]
|
H A D | ND2.c | 69 int newToOld[], in mkNDperm2() argument 85 n1, n2, n3, newToOld, in mkNDperm2() 110 SplitX(n1, n2, n3, newToOld, in mkNDperm2() 118 SplitY(n1, n2, n3, newToOld, in mkNDperm2() 126 SplitZ(n1, n2, n3, newToOld, in mkNDperm2() 183 int newToOld[], in SplitX() argument 215 mkNDperm2(n1, n2, n3, newToOld + k1, in SplitX() 223 mkNDperm2(n1, n2, n3, newToOld + k2, in SplitX() 259 int newToOld[], in SplitY() argument 296 mkNDperm2(n1, n2, n3, newToOld + k1, in SplitY() [all …]
|
/dports/math/spooles/spooles.2.2_SHARED/misc/src/ |
H A D | ND.c | 64 int newToOld[], in mkNDperm() argument 79 n1, n2, n3, newToOld, in mkNDperm() 95 SplitX(n1, n2, n3, newToOld, in mkNDperm() 102 SplitY(n1, n2, n3, newToOld, in mkNDperm() 109 SplitZ(n1, n2, n3, newToOld, in mkNDperm() 166 int newToOld[], in SplitX() argument 188 mkNDperm(n1, n2, n3, newToOld + k1, in SplitX() 194 mkNDperm(n1, n2, n3, newToOld + k2, in SplitX() 221 int newToOld[], in SplitY() argument 244 mkNDperm(n1, n2, n3, newToOld + k1, in SplitY() [all …]
|
H A D | ND2.c | 69 int newToOld[], in mkNDperm2() argument 85 n1, n2, n3, newToOld, in mkNDperm2() 110 SplitX(n1, n2, n3, newToOld, in mkNDperm2() 118 SplitY(n1, n2, n3, newToOld, in mkNDperm2() 126 SplitZ(n1, n2, n3, newToOld, in mkNDperm2() 183 int newToOld[], in SplitX() argument 215 mkNDperm2(n1, n2, n3, newToOld + k1, in SplitX() 223 mkNDperm2(n1, n2, n3, newToOld + k2, in SplitX() 259 int newToOld[], in SplitY() argument 296 mkNDperm2(n1, n2, n3, newToOld + k1, in SplitY() [all …]
|
/dports/math/spooles/spooles.2.2/misc/src/ |
H A D | ND.c | 64 int newToOld[], in mkNDperm() argument 79 n1, n2, n3, newToOld, in mkNDperm() 95 SplitX(n1, n2, n3, newToOld, in mkNDperm() 102 SplitY(n1, n2, n3, newToOld, in mkNDperm() 109 SplitZ(n1, n2, n3, newToOld, in mkNDperm() 166 int newToOld[], in SplitX() argument 188 mkNDperm(n1, n2, n3, newToOld + k1, in SplitX() 194 mkNDperm(n1, n2, n3, newToOld + k2, in SplitX() 221 int newToOld[], in SplitY() argument 244 mkNDperm(n1, n2, n3, newToOld + k1, in SplitY() [all …]
|
H A D | ND2.c | 69 int newToOld[], in mkNDperm2() argument 85 n1, n2, n3, newToOld, in mkNDperm2() 110 SplitX(n1, n2, n3, newToOld, in mkNDperm2() 118 SplitY(n1, n2, n3, newToOld, in mkNDperm2() 126 SplitZ(n1, n2, n3, newToOld, in mkNDperm2() 183 int newToOld[], in SplitX() argument 215 mkNDperm2(n1, n2, n3, newToOld + k1, in SplitX() 223 mkNDperm2(n1, n2, n3, newToOld + k2, in SplitX() 259 int newToOld[], in SplitY() argument 296 mkNDperm2(n1, n2, n3, newToOld + k1, in SplitY() [all …]
|
/dports/math/spooles-mpich/spooles.2.2/Perm/src/ |
H A D | util.c | 25 if ( perm->newToOld != NULL ) { in Perm_sizeOf() 48 int *counts, *newToOld, *oldToNew ; in Perm_checkPerm() local 63 if ( (newToOld = perm->newToOld) != NULL ) { in Perm_checkPerm() 65 if ( 0 <= (iold = newToOld[inew]) && iold < size ) { in Perm_checkPerm() 128 int *newToOld = perm->newToOld ; in Perm_fillOldToNew() local 132 oldToNew[newToOld[inew]] = inew ; in Perm_fillOldToNew() 166 int *newToOld = perm->newToOld = IVinit(size, -1) ; in Perm_fillNewToOld() local 170 newToOld[oldToNew[iold]] = iold ; in Perm_fillNewToOld() 247 IVfree(perm->newToOld) ; in Perm_releaseNewToOld() 253 IVfree(perm->newToOld) ; in Perm_releaseNewToOld()
|
H A D | compress.c | 21 int *eqmap, *head, *link, *newToOld, *oldToNew, *vals ; in Perm_compress() local 48 if ( (newToOld = perm->newToOld) == NULL ) { in Perm_compress() 50 newToOld = perm->newToOld ; in Perm_compress() 77 IVramp(N, perm2->newToOld, 0, 1) ; in Perm_compress() 89 IV2qsortUp(N, vals, perm2->newToOld) ; in Perm_compress() 91 perm2->oldToNew[perm2->newToOld[vcomp]] = vcomp ; in Perm_compress()
|
H A D | IO.c | 166 int *newToOld = perm->newToOld ; in Perm_readFromFormattedFile() local 167 if ( (rc = IVfscanf(fp, size, newToOld)) != size ) { in Perm_readFromFormattedFile() 174 if ( newToOld[i] == size ) { in Perm_readFromFormattedFile() 176 newToOld[j]-- ; in Perm_readFromFormattedFile() 278 int *newToOld = perm->newToOld ; in Perm_readFromBinaryFile() local 279 if ( (rc = fread(newToOld, sizeof(int), size, fp)) != size ) { in Perm_readFromBinaryFile() 285 if ( newToOld[i] == size ) { in Perm_readFromBinaryFile() 287 newToOld[j]-- ; in Perm_readFromBinaryFile() 440 IVfp80(fp, perm->size, perm->newToOld, 80, &ierr) ; in Perm_writeToFormattedFile() 512 rc = fwrite((void *) perm->newToOld, sizeof(int), size, fp) ; in Perm_writeToBinaryFile() [all …]
|
/dports/math/spooles-mpich/spooles.2.2_SHARED/Perm/src/ |
H A D | util.c | 25 if ( perm->newToOld != NULL ) { in Perm_sizeOf() 48 int *counts, *newToOld, *oldToNew ; in Perm_checkPerm() local 63 if ( (newToOld = perm->newToOld) != NULL ) { in Perm_checkPerm() 65 if ( 0 <= (iold = newToOld[inew]) && iold < size ) { in Perm_checkPerm() 128 int *newToOld = perm->newToOld ; in Perm_fillOldToNew() local 132 oldToNew[newToOld[inew]] = inew ; in Perm_fillOldToNew() 166 int *newToOld = perm->newToOld = IVinit(size, -1) ; in Perm_fillNewToOld() local 170 newToOld[oldToNew[iold]] = iold ; in Perm_fillNewToOld() 247 IVfree(perm->newToOld) ; in Perm_releaseNewToOld() 253 IVfree(perm->newToOld) ; in Perm_releaseNewToOld()
|
H A D | compress.c | 21 int *eqmap, *head, *link, *newToOld, *oldToNew, *vals ; in Perm_compress() local 48 if ( (newToOld = perm->newToOld) == NULL ) { in Perm_compress() 50 newToOld = perm->newToOld ; in Perm_compress() 77 IVramp(N, perm2->newToOld, 0, 1) ; in Perm_compress() 89 IV2qsortUp(N, vals, perm2->newToOld) ; in Perm_compress() 91 perm2->oldToNew[perm2->newToOld[vcomp]] = vcomp ; in Perm_compress()
|
H A D | IO.c | 166 int *newToOld = perm->newToOld ; in Perm_readFromFormattedFile() local 167 if ( (rc = IVfscanf(fp, size, newToOld)) != size ) { in Perm_readFromFormattedFile() 174 if ( newToOld[i] == size ) { in Perm_readFromFormattedFile() 176 newToOld[j]-- ; in Perm_readFromFormattedFile() 278 int *newToOld = perm->newToOld ; in Perm_readFromBinaryFile() local 279 if ( (rc = fread(newToOld, sizeof(int), size, fp)) != size ) { in Perm_readFromBinaryFile() 285 if ( newToOld[i] == size ) { in Perm_readFromBinaryFile() 287 newToOld[j]-- ; in Perm_readFromBinaryFile() 440 IVfp80(fp, perm->size, perm->newToOld, 80, &ierr) ; in Perm_writeToFormattedFile() 512 rc = fwrite((void *) perm->newToOld, sizeof(int), size, fp) ; in Perm_writeToBinaryFile() [all …]
|
/dports/math/spooles/spooles.2.2_SHARED/Perm/src/ |
H A D | util.c | 25 if ( perm->newToOld != NULL ) { in Perm_sizeOf() 48 int *counts, *newToOld, *oldToNew ; in Perm_checkPerm() local 63 if ( (newToOld = perm->newToOld) != NULL ) { in Perm_checkPerm() 65 if ( 0 <= (iold = newToOld[inew]) && iold < size ) { in Perm_checkPerm() 128 int *newToOld = perm->newToOld ; in Perm_fillOldToNew() local 132 oldToNew[newToOld[inew]] = inew ; in Perm_fillOldToNew() 166 int *newToOld = perm->newToOld = IVinit(size, -1) ; in Perm_fillNewToOld() local 170 newToOld[oldToNew[iold]] = iold ; in Perm_fillNewToOld() 247 IVfree(perm->newToOld) ; in Perm_releaseNewToOld() 253 IVfree(perm->newToOld) ; in Perm_releaseNewToOld()
|
H A D | compress.c | 21 int *eqmap, *head, *link, *newToOld, *oldToNew, *vals ; in Perm_compress() local 48 if ( (newToOld = perm->newToOld) == NULL ) { in Perm_compress() 50 newToOld = perm->newToOld ; in Perm_compress() 77 IVramp(N, perm2->newToOld, 0, 1) ; in Perm_compress() 89 IV2qsortUp(N, vals, perm2->newToOld) ; in Perm_compress() 91 perm2->oldToNew[perm2->newToOld[vcomp]] = vcomp ; in Perm_compress()
|
H A D | IO.c | 166 int *newToOld = perm->newToOld ; in Perm_readFromFormattedFile() local 167 if ( (rc = IVfscanf(fp, size, newToOld)) != size ) { in Perm_readFromFormattedFile() 174 if ( newToOld[i] == size ) { in Perm_readFromFormattedFile() 176 newToOld[j]-- ; in Perm_readFromFormattedFile() 278 int *newToOld = perm->newToOld ; in Perm_readFromBinaryFile() local 279 if ( (rc = fread(newToOld, sizeof(int), size, fp)) != size ) { in Perm_readFromBinaryFile() 285 if ( newToOld[i] == size ) { in Perm_readFromBinaryFile() 287 newToOld[j]-- ; in Perm_readFromBinaryFile() 440 IVfp80(fp, perm->size, perm->newToOld, 80, &ierr) ; in Perm_writeToFormattedFile() 512 rc = fwrite((void *) perm->newToOld, sizeof(int), size, fp) ; in Perm_writeToBinaryFile() [all …]
|
/dports/math/spooles/spooles.2.2/Perm/src/ |
H A D | util.c | 25 if ( perm->newToOld != NULL ) { in Perm_sizeOf() 48 int *counts, *newToOld, *oldToNew ; in Perm_checkPerm() local 63 if ( (newToOld = perm->newToOld) != NULL ) { in Perm_checkPerm() 65 if ( 0 <= (iold = newToOld[inew]) && iold < size ) { in Perm_checkPerm() 128 int *newToOld = perm->newToOld ; in Perm_fillOldToNew() local 132 oldToNew[newToOld[inew]] = inew ; in Perm_fillOldToNew() 166 int *newToOld = perm->newToOld = IVinit(size, -1) ; in Perm_fillNewToOld() local 170 newToOld[oldToNew[iold]] = iold ; in Perm_fillNewToOld() 247 IVfree(perm->newToOld) ; in Perm_releaseNewToOld() 253 IVfree(perm->newToOld) ; in Perm_releaseNewToOld()
|
H A D | compress.c | 21 int *eqmap, *head, *link, *newToOld, *oldToNew, *vals ; in Perm_compress() local 48 if ( (newToOld = perm->newToOld) == NULL ) { in Perm_compress() 50 newToOld = perm->newToOld ; in Perm_compress() 77 IVramp(N, perm2->newToOld, 0, 1) ; in Perm_compress() 89 IV2qsortUp(N, vals, perm2->newToOld) ; in Perm_compress() 91 perm2->oldToNew[perm2->newToOld[vcomp]] = vcomp ; in Perm_compress()
|
H A D | IO.c | 166 int *newToOld = perm->newToOld ; in Perm_readFromFormattedFile() local 167 if ( (rc = IVfscanf(fp, size, newToOld)) != size ) { in Perm_readFromFormattedFile() 174 if ( newToOld[i] == size ) { in Perm_readFromFormattedFile() 176 newToOld[j]-- ; in Perm_readFromFormattedFile() 278 int *newToOld = perm->newToOld ; in Perm_readFromBinaryFile() local 279 if ( (rc = fread(newToOld, sizeof(int), size, fp)) != size ) { in Perm_readFromBinaryFile() 285 if ( newToOld[i] == size ) { in Perm_readFromBinaryFile() 287 newToOld[j]-- ; in Perm_readFromBinaryFile() 440 IVfp80(fp, perm->size, perm->newToOld, 80, &ierr) ; in Perm_writeToFormattedFile() 512 rc = fwrite((void *) perm->newToOld, sizeof(int), size, fp) ; in Perm_writeToBinaryFile() [all …]
|
/dports/devel/binaryen/binaryen-version_98/src/passes/ |
H A D | ReorderLocals.cpp | 60 std::vector<Index> newToOld(num); in doWalkFunction() local 62 newToOld[i] = i; in doWalkFunction() 66 newToOld.begin(), newToOld.end(), [this, curr](Index a, Index b) -> bool { in doWalkFunction() 87 assert(newToOld[i] < numParams); in doWalkFunction() 88 newToOld[i] = i; in doWalkFunction() 94 Index index = newToOld[i]; in doWalkFunction() 98 newToOld.resize(i); in doWalkFunction() 105 for (size_t i = 0; i < newToOld.size(); i++) { in doWalkFunction() 109 oldToNew[newToOld[i]] = i; in doWalkFunction() 135 for (size_t i = 0; i < newToOld.size(); i++) { in doWalkFunction() [all …]
|
/dports/math/spooles-mpich/spooles.2.2_SHARED/Tree/src/ |
H A D | perms.c | 16 int newToOld[] in Tree_fillNewToOldPerm() argument 24 if ( tree == NULL || tree->n < 1 || newToOld == NULL ) { in Tree_fillNewToOldPerm() 26 "\n bad input\n", tree, newToOld) ; in Tree_fillNewToOldPerm() 37 newToOld[i++] = v ; in Tree_fillNewToOldPerm() 88 int newToOld[], in Tree_fillBothPerms() argument 98 || newToOld == NULL || oldToNew == NULL ) { in Tree_fillBothPerms() 100 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_fillBothPerms() 111 newToOld[i] = v ; in Tree_fillBothPerms()
|
/dports/math/spooles-mpich/spooles.2.2/Tree/src/ |
H A D | perms.c | 16 int newToOld[] in Tree_fillNewToOldPerm() argument 24 if ( tree == NULL || tree->n < 1 || newToOld == NULL ) { in Tree_fillNewToOldPerm() 26 "\n bad input\n", tree, newToOld) ; in Tree_fillNewToOldPerm() 37 newToOld[i++] = v ; in Tree_fillNewToOldPerm() 88 int newToOld[], in Tree_fillBothPerms() argument 98 || newToOld == NULL || oldToNew == NULL ) { in Tree_fillBothPerms() 100 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_fillBothPerms() 111 newToOld[i] = v ; in Tree_fillBothPerms()
|
/dports/math/spooles/spooles.2.2_SHARED/Tree/src/ |
H A D | perms.c | 16 int newToOld[] in Tree_fillNewToOldPerm() argument 24 if ( tree == NULL || tree->n < 1 || newToOld == NULL ) { in Tree_fillNewToOldPerm() 26 "\n bad input\n", tree, newToOld) ; in Tree_fillNewToOldPerm() 37 newToOld[i++] = v ; in Tree_fillNewToOldPerm() 88 int newToOld[], in Tree_fillBothPerms() argument 98 || newToOld == NULL || oldToNew == NULL ) { in Tree_fillBothPerms() 100 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_fillBothPerms() 111 newToOld[i] = v ; in Tree_fillBothPerms()
|
/dports/math/spooles/spooles.2.2/Tree/src/ |
H A D | perms.c | 16 int newToOld[] in Tree_fillNewToOldPerm() argument 24 if ( tree == NULL || tree->n < 1 || newToOld == NULL ) { in Tree_fillNewToOldPerm() 26 "\n bad input\n", tree, newToOld) ; in Tree_fillNewToOldPerm() 37 newToOld[i++] = v ; in Tree_fillNewToOldPerm() 88 int newToOld[], in Tree_fillBothPerms() argument 98 || newToOld == NULL || oldToNew == NULL ) { in Tree_fillBothPerms() 100 "\n bad input\n", tree, newToOld, oldToNew) ; in Tree_fillBothPerms() 111 newToOld[i] = v ; in Tree_fillBothPerms()
|