diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2011-12-06 17:48:31 -0800 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2011-12-06 17:48:31 -0800 |
| commit | 780321cf54b8da33be6800ea4533d3f8176fd822 (patch) | |
| tree | 5d2d13b8832a5608e110f439146bbecd328a4de3 /src/bdd/cudd/cuddZddReord.c | |
| parent | 7cce97b4b305c4fc4593f8426648228c3ca63b82 (diff) | |
| download | abc-780321cf54b8da33be6800ea4533d3f8176fd822.tar.gz abc-780321cf54b8da33be6800ea4533d3f8176fd822.tar.bz2 abc-780321cf54b8da33be6800ea4533d3f8176fd822.zip | |
Another attempt to make CUDD platform- and runtime-independent.
Diffstat (limited to 'src/bdd/cudd/cuddZddReord.c')
| -rw-r--r-- | src/bdd/cudd/cuddZddReord.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/bdd/cudd/cuddZddReord.c b/src/bdd/cudd/cuddZddReord.c index 80e3601c..c5fcb9fb 100644 --- a/src/bdd/cudd/cuddZddReord.c +++ b/src/bdd/cudd/cuddZddReord.c @@ -592,7 +592,7 @@ cuddZddSwapInPlace( */ } else { /* Check xlist for triple (xindex, f11, f01). */ - posn = ddHash(f11, f01, xshift); + posn = ddHash(cuddF2L(f11), cuddF2L(f01), xshift); /* For each element newf1 in collision list xlist[posn]. */ newf1 = xlist[posn]; while (newf1 != NULL) { @@ -630,7 +630,7 @@ cuddZddSwapInPlace( cuddSatInc(newf0->ref); } else { /* Check xlist for triple (xindex, f10, f00). */ - posn = ddHash(f10, f00, xshift); + posn = ddHash(cuddF2L(f10), cuddF2L(f00), xshift); /* For each element newf0 in collision list xlist[posn]. */ newf0 = xlist[posn]; while (newf0 != NULL) { @@ -662,7 +662,7 @@ cuddZddSwapInPlace( ** The modified f does not already exists in ylist. ** (Because of the uniqueness of the cofactors.) */ - posn = ddHash(newf1, newf0, yshift); + posn = ddHash(cuddF2L(newf1), cuddF2L(newf0), yshift); newykeys++; f->next = ylist[posn]; ylist[posn] = f; @@ -1456,7 +1456,7 @@ zddReorderPostprocess( ** nodes with zero reference count; hence lower probability of finding ** a result in the cache. */ - if (table->reclaimed > table->allocated * 0.5) return(1); + if (table->reclaimed > table->allocated / 2) return(1); /* Resize subtables. */ for (i = 0; i < table->sizeZ; i++) { @@ -1491,7 +1491,7 @@ zddReorderPostprocess( node = oldnodelist[j]; while (node != NULL) { next = node->next; - posn = ddHash(cuddT(node), cuddE(node), shift); + posn = ddHash(cuddF2L(cuddT(node)), cuddF2L(cuddE(node)), shift); node->next = nodelist[posn]; nodelist[posn] = node; node = next; |