abc-master
|
#include "kit.h"
Go to the source code of this file.
Functions | |
ABC_NAMESPACE_IMPL_START Kit_Graph_t * | Kit_GraphCreate (int nLeaves) |
DECLARATIONS ///. More... | |
Kit_Graph_t * | Kit_GraphCreateConst0 () |
Kit_Graph_t * | Kit_GraphCreateConst1 () |
Kit_Graph_t * | Kit_GraphCreateLeaf (int iLeaf, int nLeaves, int fCompl) |
void | Kit_GraphFree (Kit_Graph_t *pGraph) |
Kit_Node_t * | Kit_GraphAppendNode (Kit_Graph_t *pGraph) |
Kit_Edge_t | Kit_GraphAddNodeAnd (Kit_Graph_t *pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdge1) |
Kit_Edge_t | Kit_GraphAddNodeOr (Kit_Graph_t *pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdge1) |
Kit_Edge_t | Kit_GraphAddNodeXor (Kit_Graph_t *pGraph, Kit_Edge_t eEdge0, Kit_Edge_t eEdge1, int Type) |
Kit_Edge_t | Kit_GraphAddNodeMux (Kit_Graph_t *pGraph, Kit_Edge_t eEdgeC, Kit_Edge_t eEdgeT, Kit_Edge_t eEdgeE, int Type) |
unsigned | Kit_GraphToTruth (Kit_Graph_t *pGraph) |
Kit_Graph_t * | Kit_TruthToGraph (unsigned *pTruth, int nVars, Vec_Int_t *vMemory) |
int | Kit_GraphLeafDepth_rec (Kit_Graph_t *pGraph, Kit_Node_t *pNode, Kit_Node_t *pLeaf) |
Kit_Edge_t Kit_GraphAddNodeAnd | ( | Kit_Graph_t * | pGraph, |
Kit_Edge_t | eEdge0, | ||
Kit_Edge_t | eEdge1 | ||
) |
Function*************************************************************
Synopsis [Creates an AND node.]
Description []
SideEffects []
SeeAlso []
Definition at line 172 of file kitGraph.c.
Kit_Edge_t Kit_GraphAddNodeMux | ( | Kit_Graph_t * | pGraph, |
Kit_Edge_t | eEdgeC, | ||
Kit_Edge_t | eEdgeT, | ||
Kit_Edge_t | eEdgeE, | ||
int | Type | ||
) |
Function*************************************************************
Synopsis [Creates an XOR node.]
Description []
SideEffects []
SeeAlso []
Definition at line 265 of file kitGraph.c.
Kit_Edge_t Kit_GraphAddNodeOr | ( | Kit_Graph_t * | pGraph, |
Kit_Edge_t | eEdge0, | ||
Kit_Edge_t | eEdge1 | ||
) |
Function*************************************************************
Synopsis [Creates an OR node.]
Description []
SideEffects []
SeeAlso []
Definition at line 196 of file kitGraph.c.
Kit_Edge_t Kit_GraphAddNodeXor | ( | Kit_Graph_t * | pGraph, |
Kit_Edge_t | eEdge0, | ||
Kit_Edge_t | eEdge1, | ||
int | Type | ||
) |
Function*************************************************************
Synopsis [Creates an XOR node.]
Description []
SideEffects []
SeeAlso []
Definition at line 224 of file kitGraph.c.
Kit_Node_t* Kit_GraphAppendNode | ( | Kit_Graph_t * | pGraph | ) |
Function*************************************************************
Synopsis [Appends a new node to the graph.]
Description [This procedure is meant for internal use.]
SideEffects []
SeeAlso []
Definition at line 148 of file kitGraph.c.
ABC_NAMESPACE_IMPL_START Kit_Graph_t* Kit_GraphCreate | ( | int | nLeaves | ) |
DECLARATIONS ///.
CFile****************************************************************
FileName [kitGraph.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [Computation kit.]
Synopsis [Decomposition graph representation.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - Dec 6, 2006.]
Revision [
]FUNCTION DEFINITIONS /// Function*************************************************************
Synopsis [Creates a graph with the given number of leaves.]
Description []
SideEffects []
SeeAlso []
Definition at line 45 of file kitGraph.c.
Kit_Graph_t* Kit_GraphCreateConst0 | ( | ) |
Function*************************************************************
Synopsis [Creates constant 0 graph.]
Description []
SideEffects []
SeeAlso []
Definition at line 69 of file kitGraph.c.
Kit_Graph_t* Kit_GraphCreateConst1 | ( | ) |
Function*************************************************************
Synopsis [Creates constant 1 graph.]
Description []
SideEffects []
SeeAlso []
Definition at line 90 of file kitGraph.c.
Kit_Graph_t* Kit_GraphCreateLeaf | ( | int | iLeaf, |
int | nLeaves, | ||
int | fCompl | ||
) |
Function*************************************************************
Synopsis [Creates the literal graph.]
Description []
SideEffects []
SeeAlso []
Definition at line 110 of file kitGraph.c.
void Kit_GraphFree | ( | Kit_Graph_t * | pGraph | ) |
Function*************************************************************
Synopsis [Creates a graph with the given number of leaves.]
Description []
SideEffects []
SeeAlso []
Definition at line 131 of file kitGraph.c.
int Kit_GraphLeafDepth_rec | ( | Kit_Graph_t * | pGraph, |
Kit_Node_t * | pNode, | ||
Kit_Node_t * | pLeaf | ||
) |
Function*************************************************************
Synopsis [Derives the maximum depth from the leaf to the root.]
Description []
SideEffects []
SeeAlso []
Definition at line 383 of file kitGraph.c.
unsigned Kit_GraphToTruth | ( | Kit_Graph_t * | pGraph | ) |
Function*************************************************************
Synopsis [Derives the truth table.]
Description []
SideEffects []
SeeAlso []
Definition at line 306 of file kitGraph.c.
Kit_Graph_t* Kit_TruthToGraph | ( | unsigned * | pTruth, |
int | nVars, | ||
Vec_Int_t * | vMemory | ||
) |
Function*************************************************************
Synopsis [Derives the factored form from the truth table.]
Description []
SideEffects []
SeeAlso []
Definition at line 355 of file kitGraph.c.