Procedures for dynamic variable ordering of ZDDs. More...

#include "util.h"
#include "cuddInt.h"

Include dependency graph for cuddZddLin.c:

Macros
#define	CUDD_SWAP_MOVE 0

#define	CUDD_LINEAR_TRANSFORM_MOVE 1

#define	CUDD_INVERSE_TRANSFORM_MOVE 2

Functions
int	cuddZddLinearSifting (DdManager *table, int lower, int upper)
	Implementation of the linear sifting algorithm for ZDDs. More...

static int	cuddZddLinearInPlace (DdManager *table, int x, int y)
	Linearly combines two adjacent variables. More...

static int	cuddZddLinearAux (DdManager *table, int x, int xLow, int xHigh)
	Given xLow <= x <= xHigh moves x up and down between the boundaries. More...

static Move *	cuddZddLinearUp (DdManager table, int y, int xLow, Move prevMoves)
	Sifts a variable up applying the XOR transformation. More...

static Move *	cuddZddLinearDown (DdManager table, int x, int xHigh, Move prevMoves)
	Sifts a variable down and applies the XOR transformation. More...

static int	cuddZddLinearBackward (DdManager table, int size, Move moves)
	Given a set of moves, returns the ZDD heap to the position giving the minimum size. More...

static Move *	cuddZddUndoMoves (DdManager table, Move moves)
	Given a set of moves, returns the ZDD heap to the order in effect before the moves. More...

Detailed Description

Procedures for dynamic variable ordering of ZDDs.

See also: cuddLinear.c cuddZddReord.c

Author: Fabio Somenzi

Copyright

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.

Function Documentation

◆ cuddZddLinearAux()

static int cuddZddLinearAux	(	DdManager *	table,
		int	x,
		int	xLow,
		int	xHigh
	)

static

Given xLow <= x <= xHigh moves x up and down between the boundaries.

Finds the best position and does the required changes.

Returns: 1 if successful; 0 otherwise.

Side effects None

◆ cuddZddLinearBackward()

static int cuddZddLinearBackward	(	DdManager *	table,
		int	size,
		Move *	moves
	)

static

Given a set of moves, returns the ZDD heap to the position giving the minimum size.

In case of ties, returns to the closest position giving the minimum size.

Returns: 1 in case of success; 0 otherwise.

Side effects None

◆ cuddZddLinearDown()

static Move* cuddZddLinearDown	(	DdManager *	table,
		int	x,
		int	xHigh,
		Move *	prevMoves
	)

static

Sifts a variable down and applies the XOR transformation.

Sifts a variable down. Moves x down until either it reaches the bound (xHigh) or the size of the ZDD heap increases too much.

Returns: the set of moves in case of success; NULL if memory is full.

Side effects None

◆ cuddZddLinearInPlace()

static int cuddZddLinearInPlace	(	DdManager *	table,
		int	x,
		int	y
	)

static

Linearly combines two adjacent variables.

It assumes that no dead nodes are present on entry to this procedure. The procedure then guarantees that no dead nodes will be present when it terminates. cuddZddLinearInPlace assumes that x < y.

Returns: the number of keys in the table if successful; 0 otherwise.

Side effects None

See also: cuddZddSwapInPlace cuddLinearInPlace

◆ cuddZddLinearSifting()

int cuddZddLinearSifting	(	DdManager *	table,
		int	lower,
		int	upper
	)

Implementation of the linear sifting algorithm for ZDDs.

Assumes that no dead nodes are present.

Order all the variables according to the number of entries in each unique table.
Sift the variable up and down and applies the XOR transformation, remembering each time the total size of the DD heap.
Select the best permutation.
Repeat 3 and 4 for all variables.

Returns: 1 if successful; 0 otherwise.

Side effects None

◆ cuddZddLinearUp()

static Move* cuddZddLinearUp	(	DdManager *	table,
		int	y,
		int	xLow,
		Move *	prevMoves
	)

static

Sifts a variable up applying the XOR transformation.

Moves y up until either it reaches the bound (xLow) or the size of the ZDD heap increases too much.

Returns: the set of moves in case of success; NULL if memory is full.

Side effects None

◆ cuddZddUndoMoves()

static Move* cuddZddUndoMoves	(	DdManager *	table,
		Move *	moves
	)

static

Given a set of moves, returns the ZDD heap to the order in effect before the moves.

Returns: 1 in case of success; 0 otherwise.

Side effects None

Macros

Functions

Detailed Description

Function Documentation

◆ cuddZddLinearAux()

◆ cuddZddLinearBackward()

◆ cuddZddLinearDown()

◆ cuddZddLinearInPlace()

◆ cuddZddLinearSifting()

◆ cuddZddLinearUp()

◆ cuddZddUndoMoves()