cudd
3.0.0
The University of Colorado Decision Diagram Package
|
Very simple boolean network data structure. More...
#include <bnet.h>
Data Fields | |
char * | name |
int | npis |
int | ninputs |
char ** | inputs |
int | npos |
int | noutputs |
char ** | outputs |
int | nlatches |
char *** | latches |
BnetNode * | nodes |
st_table * | hash |
char * | slope |
Very simple boolean network data structure.
st_table* BnetNetwork::hash |
symbol table to access nodes by name
char** BnetNetwork::inputs |
primary input names: from the .inputs directive
char*** BnetNetwork::latches |
next state names: from the .latch directives
char* BnetNetwork::name |
network name: from the .model directive
int BnetNetwork::ninputs |
number of inputs
int BnetNetwork::nlatches |
number of latches
BnetNode* BnetNetwork::nodes |
linked list of the nodes
int BnetNetwork::noutputs |
number of outputs
int BnetNetwork::npis |
number of primary inputs
int BnetNetwork::npos |
number of primary outputs
char** BnetNetwork::outputs |
primary output names: from the .outputs directive
char* BnetNetwork::slope |
wire_load_slope