Commit 1e34a38b by Alan Mishchenko

g++ warnings.

parent 6ad94cd9
...@@ -277,7 +277,7 @@ void Rtm_ObjAddFirst2( Rtm_Man_t * p, Rtm_Edg_t * pEdge, Rtm_Init_t Val ) ...@@ -277,7 +277,7 @@ void Rtm_ObjAddFirst2( Rtm_Man_t * p, Rtm_Edg_t * pEdge, Rtm_Init_t Val )
void Rtm_PrintEdge( Rtm_Man_t * p, Rtm_Edg_t * pEdge ) void Rtm_PrintEdge( Rtm_Man_t * p, Rtm_Edg_t * pEdge )
{ {
// unsigned LData = pEdge->LData; // unsigned LData = pEdge->LData;
printf( "%d : ", pEdge->nLats ); printf( "%d : ", (int)pEdge->nLats );
/* /*
if ( pEdge->nLats > 10 ) if ( pEdge->nLats > 10 )
Extra_PrintBinary( stdout, p->pExtra + pEdge->LData, 2*(pEdge->nLats+1) ); Extra_PrintBinary( stdout, p->pExtra + pEdge->LData, 2*(pEdge->nLats+1) );
......
...@@ -511,7 +511,7 @@ void Gia_IsoSimulateBack( Gia_IsoMan_t * p, int Iter ) ...@@ -511,7 +511,7 @@ void Gia_IsoSimulateBack( Gia_IsoMan_t * p, int Iter )
***********************************************************************/ ***********************************************************************/
void Gia_IsoAssignOneClass2( Gia_IsoMan_t * p ) void Gia_IsoAssignOneClass2( Gia_IsoMan_t * p )
{ {
int i, iBegin, nSize = -1; int i, iBegin = -1, nSize = -1;
// find two variable class // find two variable class
assert( Vec_IntSize(p->vClasses) > 0 ); assert( Vec_IntSize(p->vClasses) > 0 );
Vec_IntForEachEntryDouble( p->vClasses, iBegin, nSize, i ) Vec_IntForEachEntryDouble( p->vClasses, iBegin, nSize, i )
......
...@@ -112,7 +112,7 @@ int Sfm_NtkWindow( Sfm_Ntk_t * p, int iNode ) ...@@ -112,7 +112,7 @@ int Sfm_NtkWindow( Sfm_Ntk_t * p, int iNode )
void Sfm_NtkWin2Sat( Sfm_Ntk_t * p ) void Sfm_NtkWin2Sat( Sfm_Ntk_t * p )
{ {
Vec_Int_t * vClause; Vec_Int_t * vClause;
int RetValue, Lit, iNode, iFanin, i, k; int RetValue, Lit, iNode = -1, iFanin, i, k;
sat_solver * pSat0 = sat_solver_new(); sat_solver * pSat0 = sat_solver_new();
sat_solver * pSat1 = sat_solver_new(); sat_solver * pSat1 = sat_solver_new();
sat_solver_setnvars( pSat0, 1 + Vec_IntSize(p->vLeaves) + Vec_IntSize(p->vNodes) + 2 * Vec_IntSize(p->vTfo) + Vec_IntSize(p->vRoots) ); sat_solver_setnvars( pSat0, 1 + Vec_IntSize(p->vLeaves) + Vec_IntSize(p->vNodes) + 2 * Vec_IntSize(p->vTfo) + Vec_IntSize(p->vRoots) );
......
...@@ -523,7 +523,7 @@ void Llb_ManCutPrint( Aig_Man_t * p, Vec_Ptr_t * vLower, Vec_Ptr_t * vUpper ) ...@@ -523,7 +523,7 @@ void Llb_ManCutPrint( Aig_Man_t * p, Vec_Ptr_t * vLower, Vec_Ptr_t * vUpper )
***********************************************************************/ ***********************************************************************/
void Llb_ManResultPrint( Aig_Man_t * p, Vec_Ptr_t * vResult ) void Llb_ManResultPrint( Aig_Man_t * p, Vec_Ptr_t * vResult )
{ {
Vec_Ptr_t * vLower, * vUpper; Vec_Ptr_t * vLower, * vUpper = NULL;
int i; int i;
Vec_PtrForEachEntryReverse( Vec_Ptr_t *, vResult, vLower, i ) Vec_PtrForEachEntryReverse( Vec_Ptr_t *, vResult, vLower, i )
{ {
......
...@@ -179,7 +179,7 @@ void Ssc_GiaPrintPiPatterns( Gia_Man_t * p ) ...@@ -179,7 +179,7 @@ void Ssc_GiaPrintPiPatterns( Gia_Man_t * p )
{ {
Gia_Obj_t * pObj; Gia_Obj_t * pObj;
word * pSimAig; word * pSimAig;
int i, nWords = Gia_ObjSimWords( p ); int i;//, nWords = Gia_ObjSimWords( p );
Gia_ManForEachCi( p, pObj, i ) Gia_ManForEachCi( p, pObj, i )
{ {
pSimAig = Gia_ObjSimObj( p, pObj ); pSimAig = Gia_ObjSimObj( p, pObj );
......
...@@ -147,7 +147,7 @@ word Cnf_CutDeriveTruth( Aig_Man_t * p, Vec_Ptr_t * vLeaves, Vec_Ptr_t * vNodes ...@@ -147,7 +147,7 @@ word Cnf_CutDeriveTruth( Aig_Man_t * p, Vec_Ptr_t * vLeaves, Vec_Ptr_t * vNodes
}; };
static word C[2] = { 0, ~(word)0 }; static word C[2] = { 0, ~(word)0 };
static word S[256]; static word S[256];
Aig_Obj_t * pObj; Aig_Obj_t * pObj = NULL;
int i; int i;
assert( Vec_PtrSize(vLeaves) <= 6 && Vec_PtrSize(vNodes) > 0 ); assert( Vec_PtrSize(vLeaves) <= 6 && Vec_PtrSize(vNodes) > 0 );
assert( Vec_PtrSize(vLeaves) + Vec_PtrSize(vNodes) <= 256 ); assert( Vec_PtrSize(vLeaves) + Vec_PtrSize(vNodes) <= 256 );
......
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