abc/src/bdd/cudd/cuddSubsetHB.c
/**Function********************************************************************

  Synopsis    [Procedure to recursively store nodes that are retained in the subset.]

  Description [rocedure to recursively store nodes that are retained in the subset.]

  SideEffects [None]

  SeeAlso     [StoreNodes]

******************************************************************************/
Function
Synopsis    [Procedure to recursively store nodes that are retained in the subset.]

Description [rocedure to recursively store nodes that are retained in the subset.]




Function Synopsis [ Procedure to recursively store nodes that are retained in the subset . ] Description [ rocedure to recursively store nodes that are retained in the subset . ]
static void
StoreNodes(
  st__table * storeTable,
  DdManager * dd,
  DdNode * node)
{
    DdNode *N, *Nt, *Ne;
    if (Cudd_IsConstant(dd)) {
        return;
    }
    N = Cudd_Regular(node);
    if ( st__lookup(storeTable, (char *)N, NIL(char *))) {
        return;
    }
    cuddRef(N);
    if ( st__insert(storeTable, (char *)N, NIL(char)) == st__OUT_OF_MEM) {
        fprintf(dd->err,"Something wrong, st__table insert failed\n");
    }
    Nt = Cudd_T(N);
    Ne = Cudd_E(N);
    StoreNodes(storeTable, dd, Nt);
    StoreNodes(storeTable, dd, Ne);
    return;
}
static void StoreNodes ( st__table * storeTable , DdManager * dd , DdNode * node ) { DdNode * N , * Nt , * Ne ; if ( Cudd_IsConstant ( dd ) ) { return ; } N = Cudd_Regular ( node ) ; if ( st__lookup ( storeTable , ( char * ) N , NIL ( char * ) ) ) { return ; } cuddRef ( N ) ; if ( st__insert ( storeTable , ( char * ) N , NIL ( char ) ) == st__OUT_OF_MEM ) { fprintf ( dd -> err , " \n " ) ; } Nt = Cudd_T ( N ) ; Ne = Cudd_E ( N ) ; StoreNodes ( storeTable , dd , Nt ) ; StoreNodes ( storeTable , dd , Ne ) ; return ; }
Function
Synopsis    [Procedure to recursively store nodes that are retained in the subset.]
Function Synopsis [ Procedure to recursively store nodes that are retained in the subset . ]