diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2012-07-12 19:07:24 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2012-07-12 19:07:24 -0700 |
| commit | 86a0ae0bca9c604c95e90d802785ff73338efba1 (patch) | |
| tree | 9a05c73d0ae5d001e865fc6de6fc1034a8b5d668 /src | |
| parent | 743ab55fad2c4295aadd0aae348163200a59e07f (diff) | |
| download | abc-86a0ae0bca9c604c95e90d802785ff73338efba1.tar.gz abc-86a0ae0bca9c604c95e90d802785ff73338efba1.tar.bz2 abc-86a0ae0bca9c604c95e90d802785ff73338efba1.zip | |
Removed useless file.
Diffstat (limited to 'src')
| -rw-r--r-- | src/aig/aig/module.make | 1 | ||||
| -rw-r--r-- | src/sat/bsat/satProof.c | 11 |
2 files changed, 6 insertions, 6 deletions
diff --git a/src/aig/aig/module.make b/src/aig/aig/module.make index aaf5bf6d..c291433f 100644 --- a/src/aig/aig/module.make +++ b/src/aig/aig/module.make @@ -17,7 +17,6 @@ SRC += src/aig/aig/aigCheck.c \ src/aig/aig/aigPart.c \ src/aig/aig/aigPartReg.c \ src/aig/aig/aigPartSat.c \ - src/aig/aig/aigRepar.c \ src/aig/aig/aigRepr.c \ src/aig/aig/aigRet.c \ src/aig/aig/aigRetF.c \ diff --git a/src/sat/bsat/satProof.c b/src/sat/bsat/satProof.c index a669d2be..680b1996 100644 --- a/src/sat/bsat/satProof.c +++ b/src/sat/bsat/satProof.c @@ -71,11 +71,12 @@ void Proof_ClauseSetEnts( Vec_Set_t* p, int h, int nEnts ) { Proof_Node // iterating through fanins of a proof node #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++ ) -//#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_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++ ) - +/* +#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_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 /// |