From 951afa27cb5f2621ddac2f003a4844288e01eddf Mon Sep 17 00:00:00 2001 From: Alan Mishchenko Date: Mon, 27 Jan 2020 10:43:37 -0800 Subject: Cleaning up code and fixing for several typos. --- src/aig/saig/saigInd.c | 4 ++-- src/base/abci/abcQbf.c | 8 ++------ src/base/acb/acbFunc.c | 2 +- src/bdd/reo/reo.h | 2 +- src/bool/dec/dec.h | 4 ++-- src/bool/deco/deco.h | 4 ++-- src/opt/ret/retDelay.c | 2 +- src/proof/fra/fraLcr.c | 2 +- 8 files changed, 12 insertions(+), 16 deletions(-) (limited to 'src') diff --git a/src/aig/saig/saigInd.c b/src/aig/saig/saigInd.c index f437dba0..d3665c85 100644 --- a/src/aig/saig/saigInd.c +++ b/src/aig/saig/saigInd.c @@ -383,9 +383,9 @@ nextrun: else if ( status == l_Undef ) printf( "Conflict limit (%d) was reached during iteration %d.\n", nConfMax, f+1 ); else if ( fUnique || fUniqueAll ) - printf( "Completed %d interations and added %d uniqueness constraints.\n", f+1, nConstrs ); + printf( "Completed %d iterations and added %d uniqueness constraints.\n", f+1, nConstrs ); else - printf( "Completed %d interations.\n", f+1 ); + printf( "Completed %d iterations.\n", f+1 ); } // cleanup sat_solver_delete( pSat ); diff --git a/src/base/abci/abcQbf.c b/src/base/abci/abcQbf.c index aa67ad74..5ddd25f1 100644 --- a/src/base/abci/abcQbf.c +++ b/src/base/abci/abcQbf.c @@ -195,8 +195,6 @@ clkV = Abc_Clock() - clkV; ABC_PRT( "Syn", clkS ); // ABC_PRT( "Ver", clkV ); } - if ( nIters+1 == nItersMax ) - break; } Abc_NtkDelete( pNtkSyn ); // report the results @@ -206,12 +204,10 @@ clkV = Abc_Clock() - clkV; printf( "Parameters: " ); Abc_NtkVectorPrintPars( vPiValues, nPars ); printf( " Statistics: 0=%d 1=%d\n", nZeros, Vec_IntSize(vPiValues) - nZeros ); - printf( "Solved after %d interations. ", nIters ); + printf( "Solved after %d iterations. ", nIters ); } else if ( nIters == nItersMax ) - printf( "Unsolved after %d interations. ", nIters ); - else if ( nIters == nItersMax ) - printf( "Quit after %d interatios. ", nItersMax ); + printf( "Quit after %d iterations. ", nItersMax ); else printf( "Implementation does not exist. " ); ABC_PRT( "Total runtime", Abc_Clock() - clkTotal ); diff --git a/src/base/acb/acbFunc.c b/src/base/acb/acbFunc.c index 6ffeb0e8..ff7e4504 100644 --- a/src/base/acb/acbFunc.c +++ b/src/base/acb/acbFunc.c @@ -1094,7 +1094,7 @@ Vec_Int_t * Acb_FindSupport( sat_solver * pSat, int iFirstDiv, Vec_Int_t * vWeig vSuppBest = Vec_IntDup( vSuppStart ); printf( "Starting cost = %d.\n", CostBest ); - // interatively find the one with the most ones in the uncovered rows + // iteratively find the one with the most ones in the uncovered rows for ( Iter = 0; Iter < 200; Iter++ ) { if ( Abc_Clock() > clkLimit ) diff --git a/src/bdd/reo/reo.h b/src/bdd/reo/reo.h index a3ee844c..3916ac06 100644 --- a/src/bdd/reo/reo.h +++ b/src/bdd/reo/reo.h @@ -106,7 +106,7 @@ struct _reo_man int fVerbose; // the verbosity level int fVerify; // the flag toggling verification int fRemapUp; // the flag to enable remapping - int nIters; // the number of interations of sifting to perform + int nIters; // the number of iterations of sifting to perform // parameters given by the user when reordering is called DdManager * dd; // the CUDD BDD manager diff --git a/src/bool/dec/dec.h b/src/bool/dec/dec.h index 07bf9f6b..e02b96c4 100644 --- a/src/bool/dec/dec.h +++ b/src/bool/dec/dec.h @@ -94,10 +94,10 @@ struct Dec_Man_t_ /// ITERATORS /// //////////////////////////////////////////////////////////////////////// -// interator throught the leaves +// iterator through the leaves #define Dec_GraphForEachLeaf( pGraph, pLeaf, i ) \ for ( i = 0; (i < (pGraph)->nLeaves) && (((pLeaf) = Dec_GraphNode(pGraph, i)), 1); i++ ) -// interator throught the internal nodes +// iterator through the internal nodes #define Dec_GraphForEachNode( pGraph, pAnd, i ) \ for ( i = (pGraph)->nLeaves; (i < (pGraph)->nSize) && (((pAnd) = Dec_GraphNode(pGraph, i)), 1); i++ ) diff --git a/src/bool/deco/deco.h b/src/bool/deco/deco.h index a1db47ce..33dbed87 100644 --- a/src/bool/deco/deco.h +++ b/src/bool/deco/deco.h @@ -94,10 +94,10 @@ struct Dec_Man_t_ /// ITERATORS /// //////////////////////////////////////////////////////////////////////// -// interator throught the leaves +// iterator through the leaves #define Dec_GraphForEachLeaf( pGraph, pLeaf, i ) \ for ( i = 0; (i < (pGraph)->nLeaves) && (((pLeaf) = Dec_GraphNode(pGraph, i)), 1); i++ ) -// interator throught the internal nodes +// iterator through the internal nodes #define Dec_GraphForEachNode( pGraph, pAnd, i ) \ for ( i = (pGraph)->nLeaves; (i < (pGraph)->nSize) && (((pAnd) = Dec_GraphNode(pGraph, i)), 1); i++ ) diff --git a/src/opt/ret/retDelay.c b/src/opt/ret/retDelay.c index 92680cd0..d5b8834f 100644 --- a/src/opt/ret/retDelay.c +++ b/src/opt/ret/retDelay.c @@ -123,7 +123,7 @@ if ( fVerbose && !fInitial ) // quit after timing analysis if ( i == nIterLimit ) break; - // skip if 10 interations did not give improvement + // skip if 10 iterations did not give improvement if ( i - IterBest > 20 ) break; // skip if delay limit is reached diff --git a/src/proof/fra/fraLcr.c b/src/proof/fra/fraLcr.c index 2d8b3d64..b9e2ccb4 100644 --- a/src/proof/fra/fraLcr.c +++ b/src/proof/fra/fraLcr.c @@ -604,7 +604,7 @@ p->timePart += Abc_Clock() - clk2; p->nNodesBeg = Aig_ManNodeNum(p->pAig); p->nRegsBeg = Aig_ManRegNum(p->pAig); - // perforn interative reduction of the partitions + // perform iterative reduction of the partitions p->fRefining = 1; for ( nIter = 0; p->fRefining; nIter++ ) { -- cgit v1.2.3