jdd.bdd.debug

Class DebugBDD

java.lang.Object

jdd.bdd.NodeTable

jdd.bdd.BDD

jdd.bdd.debug.DebugBDD

public class DebugBDD
extends BDD

The only function of the class is to verify the integrity of your BDD app by doing extensive tests on every BDD operation. Not to be used in production (slow!!)

Field Summary

Fields inherited from class jdd.bdd.BDD

CACHE_AND, CACHE_BIIMP, CACHE_EXISTS, CACHE_FORALL, CACHE_IMP, CACHE_NAND, CACHE_NOR, CACHE_OR, CACHE_RESTRICT, CACHE_XOR, ite_cache, last_sat_vars, nodeNames, not_cache, num_vars, oneSat_buffer, op_cache, quant_cache, quant_conj, quant_cube, quant_id, relprod_cache, replace_cache, restrict_careset, sat_cache, sign_vec, varset_last, varset_vec

Fields inherited from class jdd.bdd.NodeTable

dead_nodes, ht_chain, mark_stack, NODE_MARK, NODE_UNMARK, nodesminfree, stat_gc_count, stat_gc_freed, stat_gc_time, stat_grow_time, stat_lookup_count, stat_notify_time, stat_nt_grow, table_size, work_stack, work_stack_tos

Constructor Summary

Constructors

Constructor and Description
DebugBDD(int nodesize)
DebugBDD(int nodesize, int cache_size)

Method Summary

Modifier and Type	Method and Description
int	and(int a, int b) binary AND.
int	biimp(int a, int b) binary BI-IMPLICATION (double implication, equivalence, whatever...).
void	check_node(int n, String str) check if some node is ok.
int	imp(int a, int b) binary implication.
int	ite(int a, int b, int c) this is the If-Then-Else BDD function. it can be used to (inefficiently) simulate and binary operation. (i think it is described in the "Long" paper).
int	nand(int a, int b) binary NAND.
int	nor(int a, int b) binary NOR.
int	not(int a) binary NOT.
int	or(int a, int b) binary OR.
protected void	post_removal_callbak() this function is called after the garbage collector hash changed some internal data.
int	relProd(int u1, int u2, int c) This is the relational-product of Clarke et al.. It combines a conjunction and existential quantification that is often seen in image computation: EXISTS c.
int	xor(int a, int b) binary XOR.

Methods inherited from class jdd.bdd.BDD

andTo, cleanup, createPermutation, createVar, cube, cube, exists, forall, getMemoryUsage, getOne, getZero, internal_test, isVariable, member, minterm, minterm, mk, nodeCount, numberOfVariables, oneSat_rec, oneSat, oneSat, orTo, print, printCubes, printDot, printSet, quasiReducedNodeCount, replace, restrict, satCount_rec, satCount, setNodeNames, showStats, simplify, support

Methods inherited from class jdd.bdd.NodeTable

add, addDebugger, check_all_nodes, countRootNodes, deref, enableStackMarking, gc, getHigh, getLow, getRef, getVar, getVarUnmasked, grow, invalidate, isNodeMarked, isValid, mark_node, mark_tree, match_table, ref, saturate, setAll, setAll, show_table_all, show_table, show_tuple, signal_removed, tree_depth_changed, unmark_node, unmark_tree, update_grow_parameters

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DebugBDD

public DebugBDD(int nodesize)

DebugBDD

public DebugBDD(int nodesize,
                int cache_size)

Method Detail

and

public int and(int a,
               int b)

Description copied from class: BDD

binary AND.

Overrides:

and in class BDD

Returns:

u1 AND u2

See Also:

BDD.or(int, int)

or

public int or(int a,
              int b)

Description copied from class: BDD

binary OR.

Overrides:

or in class BDD

Returns:

u1 OR u2

See Also:

BDD.and(int, int)

xor

public int xor(int a,
               int b)

Description copied from class: BDD

binary XOR.

Overrides:

xor in class BDD

Returns:

u1 XOR u2

See Also:

BDD.biimp(int, int)

biimp

public int biimp(int a,
                 int b)

Description copied from class: BDD

binary BI-IMPLICATION (double implication, equivalence, whatever...).

Overrides:

biimp in class BDD

Returns:

(u1 <--> u2)

See Also:

BDD.xor(int, int)

imp

public int imp(int a,
               int b)

Description copied from class: BDD

binary implication.

Overrides:

imp in class BDD

Returns:

u1 -> u2

nor

public int nor(int a,
               int b)

Description copied from class: BDD

binary NOR.

Overrides:

nor in class BDD

Returns:

u1 NOR u2

See Also:

BDD.nand(int, int)

nand

public int nand(int a,
                int b)

Description copied from class: BDD

binary NAND.

Overrides:

nand in class BDD

Returns:

u1 NAND u2

See Also:

BDD.nor(int, int)

ite

public int ite(int a,
               int b,
               int c)

Description copied from class: BDD

this is the If-Then-Else BDD function.

it can be used to (inefficiently) simulate and binary operation.
(i think it is described in the "Long" paper).

Overrides:

ite in class BDD

Returns:

(f AND then_) OR (NOT f AND else_)

not

public int not(int a)

Description copied from class: BDD

binary NOT.

Overrides:

not in class BDD

Returns:

NOT u1

relProd

public int relProd(int u1,
                   int u2,
                   int c)

Description copied from class: BDD

This is the relational-product of Clarke et al..
It combines a conjunction and existential quantification that is often seen in image computation:
EXISTS c. (u1 AND u2)

Use this operation for better runtime performance!

Overrides:

relProd in class BDD

check_node

public void check_node(int n,
                       String str)

Description copied from class: NodeTable

check if some node is ok. it actuallt check the whole tree below the node

Overrides:

check_node in class NodeTable

post_removal_callbak

protected void post_removal_callbak()

Description copied from class: BDD

this function is called after the garbage collector hash changed some internal data. when we get here, data structures such as caches are instable, so we have to clean up after the garbage collector.

Overrides:

post_removal_callbak in class BDD