Commit 86a0ae0b by Alan Mishchenko

Removed useless file.

parent 743ab55f
...@@ -3107,10 +3107,6 @@ SOURCE=.\src\aig\aig\aigPartSat.c ...@@ -3107,10 +3107,6 @@ SOURCE=.\src\aig\aig\aigPartSat.c
# End Source File # End Source File
# Begin Source File # Begin Source File
SOURCE=.\src\aig\aig\aigRepar.c
# End Source File
# Begin Source File
SOURCE=.\src\aig\aig\aigRepr.c SOURCE=.\src\aig\aig\aigRepr.c
# End Source File # End Source File
# Begin Source File # Begin Source File
......
...@@ -17,7 +17,6 @@ SRC += src/aig/aig/aigCheck.c \ ...@@ -17,7 +17,6 @@ SRC += src/aig/aig/aigCheck.c \
src/aig/aig/aigPart.c \ src/aig/aig/aigPart.c \
src/aig/aig/aigPartReg.c \ src/aig/aig/aigPartReg.c \
src/aig/aig/aigPartSat.c \ src/aig/aig/aigPartSat.c \
src/aig/aig/aigRepar.c \
src/aig/aig/aigRepr.c \ src/aig/aig/aigRepr.c \
src/aig/aig/aigRet.c \ src/aig/aig/aigRet.c \
src/aig/aig/aigRetF.c \ src/aig/aig/aigRetF.c \
......
...@@ -71,11 +71,12 @@ void Proof_ClauseSetEnts( Vec_Set_t* p, int h, int nEnts ) { Proof_Node ...@@ -71,11 +71,12 @@ void Proof_ClauseSetEnts( Vec_Set_t* p, int h, int nEnts ) { Proof_Node
// iterating through fanins of a proof node // iterating through fanins of a proof node
#define Proof_NodeForeachFanin( pProof, pNode, pFanin, i ) \ #define Proof_NodeForeachFanin( pProof, pNode, pFanin, i ) \
for ( i = 0; (i < (int)pNode->nEnts) && (((pFanin) = (pNode->pEnts[i] & 1) ? NULL : Proof_NodeRead(pProof, pNode->pEnts[i] >> 2)), 1); i++ ) for ( i = 0; (i < (int)pNode->nEnts) && (((pFanin) = (pNode->pEnts[i] & 1) ? NULL : Proof_NodeRead(pProof, pNode->pEnts[i] >> 2)), 1); i++ )
//#define Proof_NodeForeachLeaf( pClauses, pNode, pLeaf, i ) \ /*
// for ( i = 0; (i < (int)pNode->nEnts) && (((pLeaf) = (pNode->pEnts[i] & 1) ? Proof_ClauseRead(pClauses, pNode->pEnts[i] >> 2) : NULL), 1); i++ ) #define Proof_NodeForeachLeaf( pClauses, pNode, pLeaf, i ) \
//#define Proof_NodeForeachFaninLeaf( pProof, pClauses, pNode, pFanin, i ) \ for ( i = 0; (i < (int)pNode->nEnts) && (((pLeaf) = (pNode->pEnts[i] & 1) ? Proof_ClauseRead(pClauses, pNode->pEnts[i] >> 2) : NULL), 1); i++ )
// for ( i = 0; (i < (int)pNode->nEnts) && ((pFanin) = (pNode->pEnts[i] & 1) ? Proof_ClauseRead(pClauses, pNode->pEnts[i] >> 2) : Proof_NodeRead(pProof, pNode->pEnts[i] >> 2)); i++ ) #define Proof_NodeForeachFaninLeaf( pProof, pClauses, pNode, pFanin, i ) \
for ( i = 0; (i < (int)pNode->nEnts) && ((pFanin) = (pNode->pEnts[i] & 1) ? Proof_ClauseRead(pClauses, pNode->pEnts[i] >> 2) : Proof_NodeRead(pProof, pNode->pEnts[i] >> 2)); i++ )
*/
//////////////////////////////////////////////////////////////////////// ////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS /// /// FUNCTION DEFINITIONS ///
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment