#include "DSDUtilities.h"
Functions | |
DdNode * | symbolic_merger (DdManager *manager, DdNode *base, DdNode *branch, DdNode *top_func) |
int_32 | __Get_Input_Count (DSDNode *dsd_node) |
DSDNode * | __Get_First_Input (DSDNode *dsd_node) |
ActualNode * | list_intersection (DdManager *manager, ActualNode *list1, ActualNode *list2, int *size) |
void | list_intersection_special (DdManager *manager, ActualNode *list1, ActualNode *list2, int *size) |
ActualNode * | list_residue (DdManager *manager, ActualNode *list1, ActualNode *list2, int *size) |
int | node_exists (ActualNode *list1, DSDNode *node) |
int | node_exists_special (ActualNode *list1, DSDNode *node) |
void | set_canonical_var (DSDNode *node) |
int | canonical_var (DSDNode *node) |
int | support_compare (DSDManager *manager, DSDNode *node1, DSDNode *node2) |
void | support_create (DSDManager *manager, DSDNode *node) |
DdNode * | symbolic_or (DdManager *manager, DSDNode *node) |
DdNode * | symbolic_xor (DdManager *manager, DSDNode *node) |
DdNode * | symbolic_mux (DdManager *manager, int top, int e, int t, DSDNode *top_node, DSDNode *Enode, DSDNode *Tnode) |
void | protect (DSDManager *manager, ActualNode *list) |
void | unprotect (DSDManager *manager, ActualNode *list) |
ActualNode * | copy_actual_list (ActualNode *container) |
|
Internal function that returns the DSD node corresponding to the canonically first element in the actuals list of DSD dsd_node |
|
Internal function that returns the number inputs for the DSD dsd_node |
|
Internal function that returns the lowest variable in the decomposition tree rooted in the DSD node |
|
Internal function that produces a copy of the actuals list container |
|
Internal function to find common actual lists members between list1 and list2 |
|
Internal function to find common actual lists members between list1 and list2 and returns the number of actuals list members that are common through the pointer size |
|
Internal function returns ActualNodes that are in list1 but are not in list2, i.e. list1 - list2 |
|
Internal function that checks whether the DSDNode node occurs in the actuals list list1 |
|
|
|
Internal function that calls __DSD_Ref for each DSDNode in the ActualNode list |
|
Internal function that sets the data structure in DSDNode to explicitly state what the lowest variable is in the decomposition tree rooted in this DSD |
|
|
|
|
|
Internal function substitutes the branch BDD for the top_func variable in the base function |
|
Internal function that creates a BDD that is a mux of the representative variables of the DSDNodes top_node, Enode, and Tnode |
|
Internal function that creates a BDD that is an OR of the representative variables of the actuals list of the DSDNode node |
|
Internal function that creates a BDD that is an XOR of the representative variables of the actuals list of the DSDNode node |
|
Internal function that calls __DSD_RecursiveDeref for each DSDNdoe in the ActualNode list |