| /dports/math/py-brial/BRiAl-1.2.10/cudd/ |
| H A D | cuddAndAbs.c | 204 unsigned int topf, topg, topcube, top, index;
239 topcube = manager->perm[cube->index];
241 while (topcube < top) {
246 topcube = manager->perm[cube->index];
282 if (topcube == top) { /* quantify */
|
| H A D | cuddClip.c | 411 unsigned int topf, topg, topcube, top, index; in cuddBddClipAndAbsRecur() local
458 topcube = manager->perm[cube->index]; in cuddBddClipAndAbsRecur()
460 if (topcube < top) { in cuddBddClipAndAbsRecur()
490 if (topcube == top) { in cuddBddClipAndAbsRecur()
502 if (t == one && topcube == top) { in cuddBddClipAndAbsRecur()
516 if (topcube == top) { /* abstract */ in cuddBddClipAndAbsRecur()
|
| H A D | cuddBddAbs.c | 511 unsigned int topf, topg, topcube, top, index; in cuddBddXorExistAbstractRecur() local
562 topcube = manager->perm[cube->index]; in cuddBddXorExistAbstractRecur()
564 if (topcube < top) { in cuddBddXorExistAbstractRecur()
593 if (topcube == top) { in cuddBddXorExistAbstractRecur()
605 if (t == one && topcube == top) { in cuddBddXorExistAbstractRecur()
618 if (topcube == top) { /* abstract */ in cuddBddXorExistAbstractRecur()
|
| /dports/math/brial/BRiAl-1.2.10/cudd/ |
| H A D | cuddAndAbs.c | 204 unsigned int topf, topg, topcube, top, index; in cuddBddAndAbstractRecur() local
239 topcube = manager->perm[cube->index]; in cuddBddAndAbstractRecur()
241 while (topcube < top) { in cuddBddAndAbstractRecur()
246 topcube = manager->perm[cube->index]; in cuddBddAndAbstractRecur()
282 if (topcube == top) { /* quantify */ in cuddBddAndAbstractRecur()
|
| H A D | cuddClip.c | 411 unsigned int topf, topg, topcube, top, index; in cuddBddClipAndAbsRecur() local
458 topcube = manager->perm[cube->index]; in cuddBddClipAndAbsRecur()
460 if (topcube < top) { in cuddBddClipAndAbsRecur()
490 if (topcube == top) { in cuddBddClipAndAbsRecur()
502 if (t == one && topcube == top) { in cuddBddClipAndAbsRecur()
516 if (topcube == top) { /* abstract */ in cuddBddClipAndAbsRecur()
|
| H A D | cuddBddAbs.c | 511 unsigned int topf, topg, topcube, top, index; in cuddBddXorExistAbstractRecur() local
562 topcube = manager->perm[cube->index]; in cuddBddXorExistAbstractRecur()
564 if (topcube < top) { in cuddBddXorExistAbstractRecur()
593 if (topcube == top) { in cuddBddXorExistAbstractRecur()
605 if (t == one && topcube == top) { in cuddBddXorExistAbstractRecur()
618 if (topcube == top) { /* abstract */ in cuddBddXorExistAbstractRecur()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/cudd/ |
| H A D | cuddAndAbs.c | 208 unsigned int topf, topg, topcube, top, index; in cuddBddAndAbstractRecur() local
243 topcube = manager->perm[cube->index]; in cuddBddAndAbstractRecur()
245 while (topcube < top) { in cuddBddAndAbstractRecur()
250 topcube = manager->perm[cube->index]; in cuddBddAndAbstractRecur()
289 if (topcube == top) { /* quantify */ in cuddBddAndAbstractRecur()
|
| H A D | cuddClip.c | 415 unsigned int topf, topg, topcube, top, index; in cuddBddClipAndAbsRecur() local
462 topcube = manager->perm[cube->index]; in cuddBddClipAndAbsRecur()
464 if (topcube < top) { in cuddBddClipAndAbsRecur()
494 if (topcube == top) { in cuddBddClipAndAbsRecur()
506 if (t == one && topcube == top) { in cuddBddClipAndAbsRecur()
520 if (topcube == top) { /* abstract */ in cuddBddClipAndAbsRecur()
|
| H A D | cuddBddAbs.c | 472 unsigned int topf, topg, topcube, top, index; in cuddBddXorExistAbstractRecur() local
523 topcube = manager->perm[cube->index]; in cuddBddXorExistAbstractRecur()
525 if (topcube < top) { in cuddBddXorExistAbstractRecur()
554 if (topcube == top) { in cuddBddXorExistAbstractRecur()
566 if (t == one && topcube == top) { in cuddBddXorExistAbstractRecur()
579 if (topcube == top) { /* abstract */ in cuddBddXorExistAbstractRecur()
|
| /dports/math/cudd/cudd-3.0.0/cudd/ |
| H A D | cuddAndAbs.c | 192 int topf, topg, top, topcube; in cuddBddAndAbstractRecur() local
228 topcube = manager->perm[cube->index]; in cuddBddAndAbstractRecur()
230 while (topcube < top) { in cuddBddAndAbstractRecur()
235 topcube = manager->perm[cube->index]; in cuddBddAndAbstractRecur()
273 if (topcube == top) { /* quantify */ in cuddBddAndAbstractRecur()
|
| H A D | cuddClip.c | 388 int topf, topg, topcube, top; in cuddBddClipAndAbsRecur() local
438 topcube = manager->perm[cube->index]; in cuddBddClipAndAbsRecur()
440 if (topcube < top) { in cuddBddClipAndAbsRecur()
470 if (topcube == top) { in cuddBddClipAndAbsRecur()
482 if (t == one && topcube == top) { in cuddBddClipAndAbsRecur()
496 if (topcube == top) { /* abstract */ in cuddBddClipAndAbsRecur()
|
| H A D | cuddBddAbs.c | 491 int topf, topg, topcube, top; in cuddBddXorExistAbstractRecur() local
545 topcube = manager->perm[cube->index]; in cuddBddXorExistAbstractRecur()
547 if (topcube < top) { in cuddBddXorExistAbstractRecur()
576 if (topcube == top) { in cuddBddXorExistAbstractRecur()
588 if (t == one && topcube == top) { in cuddBddXorExistAbstractRecur()
601 if (topcube == top) { /* abstract */ in cuddBddXorExistAbstractRecur()
|
| /dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/extrab/ |
| H A D | extraBddTime.c | 327 unsigned int topf, topg, topcube, top, index; in cuddBddAndAbstractRecurTime() local
362 topcube = manager->perm[cube->index]; in cuddBddAndAbstractRecurTime()
364 while (topcube < top) { in cuddBddAndAbstractRecurTime()
369 topcube = manager->perm[cube->index]; in cuddBddAndAbstractRecurTime()
409 if (topcube == top) { /* quantify */ in cuddBddAndAbstractRecurTime()
|