#include "misc/util/util_hack.h"
#include "cuddInt.h"

Functions
static int	cuddZddCountStep (DdNode P, st__table table, DdNode base, DdNode empty)

static double	cuddZddCountDoubleStep (DdNode P, st__table table, DdNode base, DdNode empty)

static enum st__retval	st__zdd_countfree (char key, char value, char *arg)

static enum st__retval	st__zdd_count_dbl_free (char key, char value, char *arg)

int	Cudd_zddCount (DdManager zdd, DdNode P)

double	Cudd_zddCountDouble (DdManager zdd, DdNode P)

Variables
static ABC_NAMESPACE_IMPL_START char rcsid[]	DD_UNUSED = "$Id: cuddZddCount.c,v 1.14 2004/08/13 18:04:53 fabio Exp $"

Function Documentation

int Cudd_zddCount	(	DdManager *	zdd,
		DdNode *	P
	)

AutomaticEnd Function********************************************************************

Synopsis [Counts the number of minterms in a ZDD.]

Description [Returns an integer representing the number of minterms in a ZDD.]

SideEffects [None]

SeeAlso [Cudd_zddCountDouble]

Definition at line 137 of file cuddZddCount.c.

 {
     st__table    *table;
     int         res;
     DdNode      *base, *empty;
 
     base  = DD_ONE(zdd);
     empty = DD_ZERO(zdd);
     table = st__init_table( st__ptrcmp, st__ptrhash);
     if (table == NULL) return(CUDD_OUT_OF_MEM);
     res = cuddZddCountStep(P, table, base, empty);
     if (res == CUDD_OUT_OF_MEM) {
         zdd->errorCode = CUDD_MEMORY_OUT;
     }
     st__foreach(table, st__zdd_countfree, NIL(char));
     st__free_table(table);
 
     return(res);
 
 } /* end of Cudd_zddCount */

double Cudd_zddCountDouble	(	DdManager *	zdd,
		DdNode *	P
	)

Function********************************************************************

Synopsis [Counts the number of minterms of a ZDD.]

Description [Counts the number of minterms of a ZDD. The result is returned as a double. If the procedure runs out of memory, it returns (double) CUDD_OUT_OF_MEM. This procedure is used in Cudd_zddCountMinterm.]

SideEffects [None]

SeeAlso [Cudd_zddCountMinterm Cudd_zddCount]

Definition at line 176 of file cuddZddCount.c.

 {
     st__table    *table;
     double      res;
     DdNode      *base, *empty;
 
     base  = DD_ONE(zdd);
     empty = DD_ZERO(zdd);
     table = st__init_table( st__ptrcmp, st__ptrhash);
     if (table == NULL) return((double)CUDD_OUT_OF_MEM);
     res = cuddZddCountDoubleStep(P, table, base, empty);
     if (res == (double)CUDD_OUT_OF_MEM) {
         zdd->errorCode = CUDD_MEMORY_OUT;
     }
     st__foreach(table, st__zdd_count_dbl_free, NIL(char));
     st__free_table(table);
 
     return(res);
 
 } /* end of Cudd_zddCountDouble */

static double cuddZddCountDoubleStep	(	DdNode *	P,
		st__table *	table,
		DdNode *	base,
		DdNode *	empty
	)

static

Function********************************************************************

Synopsis [Performs the recursive step of Cudd_zddCountDouble.]

Description []

SideEffects [None]

SeeAlso []

Definition at line 272 of file cuddZddCount.c.

 {
     double      res;
     double      *dummy;
 
     if (P == empty)
         return((double)0.0);
     if (P == base)
         return((double)1.0);
 
     /* Check cache */
     if ( st__lookup(table, (const char *)P, (char **)&dummy)) {
         res = *dummy;
         return(res);
     }
 
     res = cuddZddCountDoubleStep(cuddE(P), table, base, empty) +
         cuddZddCountDoubleStep(cuddT(P), table, base, empty);
 
     dummy = ABC_ALLOC(double, 1);
     if (dummy == NULL) {
         return((double)CUDD_OUT_OF_MEM);
     }
     *dummy = res;
     if ( st__insert(table, (char *)P, (char *)dummy) == st__OUT_OF_MEM) {
         ABC_FREE(dummy);
         return((double)CUDD_OUT_OF_MEM);
     }
 
     return(res);
 
 } /* end of cuddZddCountDoubleStep */

static int cuddZddCountStep	(	DdNode *	P,
		st__table *	table,
		DdNode *	base,
		DdNode *	empty
	)

static

AutomaticStart

Function********************************************************************

Synopsis [Performs the recursive step of Cudd_zddCount.]

Description []

SideEffects [None]

SeeAlso []

Definition at line 222 of file cuddZddCount.c.

 {
     int         res;
     int         *dummy;
 
     if (P == empty)
         return(0);
     if (P == base)
         return(1);
 
     /* Check cache. */
     if ( st__lookup(table, (const char *)P, (char **)&dummy)) {
         res = *dummy;
         return(res);
     }
 
     res = cuddZddCountStep(cuddE(P), table, base, empty) +
         cuddZddCountStep(cuddT(P), table, base, empty);
 
     dummy = ABC_ALLOC(int, 1);
     if (dummy == NULL) {
         return(CUDD_OUT_OF_MEM);
     }
     *dummy = res;
     if ( st__insert(table, (char *)P, (char *)dummy) == st__OUT_OF_MEM) {
         ABC_FREE(dummy);
         return(CUDD_OUT_OF_MEM);
     }
 
     return(res);
 
 } /* end of cuddZddCountStep */

static enum st__retval st__zdd_count_dbl_free	(	char *	key,
		char *	value,
		char *	arg
	)

static

Function********************************************************************

Synopsis [Frees the memory associated with the computed table of Cudd_zddCountDouble.]

Description []

SideEffects [None]

SeeAlso []

Definition at line 350 of file cuddZddCount.c.

 {
     double      *d;
 
     d = (double *)value;
     ABC_FREE(d);
     return( st__CONTINUE);
 
 } /* end of st__zdd_count_dbl_free */

static enum st__retval st__zdd_countfree	(	char *	key,
		char *	value,
		char *	arg
	)

static

Function********************************************************************

Synopsis [Frees the memory associated with the computed table of Cudd_zddCount.]

Description []

SideEffects [None]

SeeAlso []

Definition at line 323 of file cuddZddCount.c.

 {
     int *d;
 
     d = (int *)value;
     ABC_FREE(d);
     return( st__CONTINUE);
 
 } /* end of st__zdd_countfree */

Variable Documentation

ABC_NAMESPACE_IMPL_START char rcsid [] DD_UNUSED = "$Id: cuddZddCount.c,v 1.14 2004/08/13 18:04:53 fabio Exp $"

static

CFile***********************************************************************

FileName [cuddZddCount.c]

PackageName [cudd]

Synopsis [Procedures to count the number of minterms of a ZDD.]

Description [External procedures included in this module:

Internal procedures included in this module:

Static procedures included in this module:

]

SeeAlso []

Author [Hyong-Kyoon Shin, In-Ho Moon]

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.

Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

Neither the name of the University of Colorado nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.]

Definition at line 91 of file cuddZddCount.c.

Functions

Variables

Function Documentation

Variable Documentation