void shadow_satisfy(shadow_mgr mgr, ref_t r) {
if (!mgr->do_cudd)
return;
DdNode *n = get_ddnode(mgr, r);
bool zdd = is_zdd(mgr, r);
FILE *logfile = get_logfile();
if (zdd) {
Cudd_zddPrintMinterm(mgr->bdd_manager, n);
if (logfile) {
FILE *savefile = Cudd_ReadStdout(mgr->bdd_manager);
Cudd_SetStdout(mgr->bdd_manager, logfile);
Cudd_zddPrintMinterm(mgr->bdd_manager, n);
Cudd_SetStdout(mgr->bdd_manager, savefile);
}
}
else {
Cudd_PrintMinterm(mgr->bdd_manager, n);
if (logfile) {
FILE *savefile = Cudd_ReadStdout(mgr->bdd_manager);
Cudd_SetStdout(mgr->bdd_manager, logfile);
Cudd_PrintMinterm(mgr->bdd_manager, n);
Cudd_SetStdout(mgr->bdd_manager, savefile);
}
}
}
/**
* @brief Basic test of ZDDs.
* @return 0 if successful; -1 otherwise.
*/
static int
testZdd(int verbosity)
{
DdManager *manager;
DdNode *f, *var, *tmp;
int i, ret;
manager = Cudd_Init(0,4,CUDD_UNIQUE_SLOTS, CUDD_CACHE_SLOTS,0);
if (!manager) {
if (verbosity) {
printf("initialization failed\n");
}
return -1;
}
tmp = Cudd_ReadZddOne(manager,0);
Cudd_Ref(tmp);
for (i = 3; i >= 0; i--) {
var = Cudd_zddIthVar(manager,i);
Cudd_Ref(var);
f = Cudd_zddIntersect(manager,var,tmp);
Cudd_Ref(f);
Cudd_RecursiveDerefZdd(manager,tmp);
Cudd_RecursiveDerefZdd(manager,var);
tmp = f;
}
f = Cudd_zddDiff(manager,Cudd_ReadZddOne(manager,0),tmp);
Cudd_Ref(f);
Cudd_RecursiveDerefZdd(manager,tmp);
if (verbosity) {
Cudd_zddPrintMinterm(manager,f);
printf("\n");
}
Cudd_RecursiveDerefZdd(manager,f);
ret = Cudd_CheckZeroRef(manager);
if (ret != 0 && verbosity) {
printf("%d unexpected non-zero references\n", ret);
}
Cudd_Quit(manager);
return 0;
}
/**Function********************************************************************
Synopsis [Prints to the standard output a ZDD and its statistics.]
Description [Prints to the standard output a DD and its statistics.
The statistics include the number of nodes and the number of minterms.
(The number of minterms is also the number of combinations in the set.)
The statistics are printed if pr > 0. Specifically:
<ul>
<li> pr = 0 : prints nothing
<li> pr = 1 : prints counts of nodes and minterms
<li> pr = 2 : prints counts + disjoint sum of products
<li> pr = 3 : prints counts + list of nodes
<li> pr > 3 : prints counts + disjoint sum of products + list of nodes
</ul>
Returns 1 if successful; 0 otherwise.
]
SideEffects [None]
SeeAlso []
******************************************************************************/
int
Cudd_zddPrintDebug(
DdManager * zdd,
DdNode * f,
int n,
int pr)
{
DdNode *empty = DD_ZERO(zdd);
int nodes;
double minterms;
int retval = 1;
if (f == empty && pr > 0) {
(void) fprintf(zdd->out,": is the empty ZDD\n");
(void) fflush(zdd->out);
return(1);
}
if (pr > 0) {
nodes = Cudd_zddDagSize(f);
if (nodes == CUDD_OUT_OF_MEM) retval = 0;
minterms = Cudd_zddCountMinterm(zdd, f, n);
if (minterms == (double)CUDD_OUT_OF_MEM) retval = 0;
(void) fprintf(zdd->out,": %d nodes %g minterms\n",
nodes, minterms);
if (pr > 2)
if (!cuddZddP(zdd, f)) retval = 0;
if (pr == 2 || pr > 3) {
if (!Cudd_zddPrintMinterm(zdd, f)) retval = 0;
(void) fprintf(zdd->out,"\n");
}
(void) fflush(zdd->out);
}
return(retval);
} /* end of Cudd_zddPrintDebug */
