diff options
Diffstat (limited to 'src/bdd')
-rw-r--r-- | src/bdd/cudd/cuddAPI.c | 2 | ||||
-rw-r--r-- | src/bdd/cudd/cuddAddIte.c | 2 | ||||
-rw-r--r-- | src/bdd/cudd/cuddBddIte.c | 2 | ||||
-rw-r--r-- | src/bdd/cudd/cuddDecomp.c | 2 | ||||
-rw-r--r-- | src/bdd/cudd/cuddGroup.c | 6 | ||||
-rw-r--r-- | src/bdd/cudd/cuddHarwell.c | 2 | ||||
-rw-r--r-- | src/bdd/cudd/cuddLinear.c | 2 | ||||
-rw-r--r-- | src/bdd/cudd/cuddPriority.c | 6 | ||||
-rw-r--r-- | src/bdd/cudd/cuddSubsetSP.c | 4 | ||||
-rw-r--r-- | src/bdd/cudd/cuddSymmetry.c | 4 | ||||
-rw-r--r-- | src/bdd/cudd/cuddTable.c | 2 | ||||
-rw-r--r-- | src/bdd/cudd/cuddUtil.c | 2 | ||||
-rw-r--r-- | src/bdd/cudd/cuddZddGroup.c | 4 | ||||
-rw-r--r-- | src/bdd/cudd/cuddZddReord.c | 4 | ||||
-rw-r--r-- | src/bdd/cudd/cuddZddSymm.c | 2 | ||||
-rw-r--r-- | src/bdd/reo/reoTransfer.c | 2 |
16 files changed, 24 insertions, 24 deletions
diff --git a/src/bdd/cudd/cuddAPI.c b/src/bdd/cudd/cuddAPI.c index 6456d17c..800e01c1 100644 --- a/src/bdd/cudd/cuddAPI.c +++ b/src/bdd/cudd/cuddAPI.c @@ -3067,7 +3067,7 @@ Cudd_PrintInfo( if (retval == EOF) return(0); retval = fprintf(fp,"Number of dead ZDD nodes: %u\n", dd->deadZ); if (retval == EOF) return(0); - retval = fprintf(fp,"Total number of nodes allocated: %d\n", dd->allocated); + retval = fprintf(fp,"Total number of nodes allocated: %d\n", (int)dd->allocated); if (retval == EOF) return(0); retval = fprintf(fp,"Total number of nodes reclaimed: %.0f\n", dd->reclaimed); diff --git a/src/bdd/cudd/cuddAddIte.c b/src/bdd/cudd/cuddAddIte.c index b9b8c3e3..29307756 100644 --- a/src/bdd/cudd/cuddAddIte.c +++ b/src/bdd/cudd/cuddAddIte.c @@ -451,7 +451,7 @@ cuddAddIteRecur( DdNode *one,*zero; DdNode *r,*Fv,*Fnv,*Gv,*Gnv,*Hv,*Hnv,*t,*e; unsigned int topf,topg,toph,v; - int index; + int index = -1; statLine(dd); /* Trivial cases. */ diff --git a/src/bdd/cudd/cuddBddIte.c b/src/bdd/cudd/cuddBddIte.c index d3386088..18ebee20 100644 --- a/src/bdd/cudd/cuddBddIte.c +++ b/src/bdd/cudd/cuddBddIte.c @@ -639,7 +639,7 @@ cuddBddIteRecur( DdNode *one, *zero, *res; DdNode *r, *Fv, *Fnv, *Gv, *Gnv, *H, *Hv, *Hnv, *t, *e; unsigned int topf, topg, toph, v; - int index; + int index = -1; int comple; statLine(dd); diff --git a/src/bdd/cudd/cuddDecomp.c b/src/bdd/cudd/cuddDecomp.c index 99aa9348..ff31e04c 100644 --- a/src/bdd/cudd/cuddDecomp.c +++ b/src/bdd/cudd/cuddDecomp.c @@ -1693,7 +1693,7 @@ BuildConjuncts( st_table * mintermTable) { int topid, distance; - Conjuncts *factorsNv, *factorsNnv, *factors; + Conjuncts *factorsNv = NULL, *factorsNnv = NULL, *factors; Conjuncts *dummy; DdNode *N, *Nv, *Nnv, *temp, *g1, *g2, *h1, *h2, *topv; double minNv = 0.0, minNnv = 0.0; diff --git a/src/bdd/cudd/cuddGroup.c b/src/bdd/cudd/cuddGroup.c index 598cc9a1..547810b2 100644 --- a/src/bdd/cudd/cuddGroup.c +++ b/src/bdd/cudd/cuddGroup.c @@ -456,7 +456,7 @@ ddReorderChildren( Cudd_ReorderingType method) { int lower; - int upper; + int upper = -1; int result; unsigned int initialSize; @@ -1494,7 +1494,7 @@ ddGroupMove( Move *move; int size; int i,j,xtop,xbot,xsize,ytop,ybot,ysize,newxtop; - int swapx,swapy; + int swapx = -1,swapy = -1; #if defined(DD_DEBUG) && defined(DD_VERBOSE) int initialSize,bestSize; #endif @@ -1674,7 +1674,7 @@ ddGroupSiftingBackward( { Move *move; int res; - Move *end_move; + Move *end_move = NULL; int diff, tmp_diff; int index; unsigned int pairlev; diff --git a/src/bdd/cudd/cuddHarwell.c b/src/bdd/cudd/cuddHarwell.c index b61af2e0..02018a11 100644 --- a/src/bdd/cudd/cuddHarwell.c +++ b/src/bdd/cudd/cuddHarwell.c @@ -144,7 +144,7 @@ Cudd_addHarwell( DdNode *cubex, *cubey, *minterm1; int u, v, err, i, j, nv; double val; - DdNode **lx, **ly, **lxn, **lyn; /* local copies of x, y, xn, yn_ */ + DdNode **lx = NULL, **ly = NULL, **lxn = NULL, **lyn = NULL; /* local copies of x, y, xn, yn_ */ int lnx, lny; /* local copies of nx and ny */ char title[73], key[9], mxtype[4], rhstyp[4]; int totcrd, ptrcrd, indcrd, valcrd, rhscrd, diff --git a/src/bdd/cudd/cuddLinear.c b/src/bdd/cudd/cuddLinear.c index 601b6496..38f75beb 100644 --- a/src/bdd/cudd/cuddLinear.c +++ b/src/bdd/cudd/cuddLinear.c @@ -377,7 +377,7 @@ cuddLinearInPlace( int posn; int isolated; DdNode *f,*f0,*f1,*f01,*f00,*f11,*f10,*newf1,*newf0; - DdNode *g,*next,*last; + DdNode *g,*next,*last=NULL; DdNodePtr *previousP; DdNode *tmp; DdNode *sentinel = &(table->sentinel); diff --git a/src/bdd/cudd/cuddPriority.c b/src/bdd/cudd/cuddPriority.c index 2ecc1636..ab362dea 100644 --- a/src/bdd/cudd/cuddPriority.c +++ b/src/bdd/cudd/cuddPriority.c @@ -790,7 +790,7 @@ Cudd_Inequality( int leftChild, middleChild, rightChild; DdNode *g0, *g1, *fplus, *fequal, *fminus; int j; - DdNode *newMap[2]; + DdNode *newMap[2] = {NULL}; int newIndex[2]; kTrueLower = kTrue; @@ -978,7 +978,7 @@ Cudd_Disequality( int leftChild, middleChild, rightChild; DdNode *g0, *g1, *fplus, *fequal, *fminus; int j; - DdNode *newMap[2]; + DdNode *newMap[2] = {NULL}; int newIndex[2]; kTrueLbLower = kTrueLb; @@ -1430,7 +1430,7 @@ cuddCProjectionRecur( { DdNode *res, *res1, *res2, *resA; DdNode *r, *y, *RT, *RE, *YT, *YE, *Yrest, *Ra, *Ran, *Gamma, *Alpha; - unsigned int topR, topY, top, index; + unsigned int topR, topY, top, index = 0; DdNode *one = DD_ONE(dd); statLine(dd); diff --git a/src/bdd/cudd/cuddSubsetSP.c b/src/bdd/cudd/cuddSubsetSP.c index 5eb3e099..b5673d88 100644 --- a/src/bdd/cudd/cuddSubsetSP.c +++ b/src/bdd/cudd/cuddSubsetSP.c @@ -1261,12 +1261,12 @@ BuildSubsetBdd( { DdNode *N, *Nv, *Nnv; DdNode *ThenBranch, *ElseBranch, *childBranch; - DdNode *child, *regChild, *regNnv, *regNv; + DdNode *child, *regChild, *regNnv = NULL, *regNv = NULL; NodeDist_t *nodeStatNv, *nodeStat, *nodeStatNnv; DdNode *neW, *topv, *regNew; char *entry; unsigned int topid; - unsigned int childPathLength, oddLen, evenLen, NnvPathLength, NvPathLength; + unsigned int childPathLength, oddLen, evenLen, NnvPathLength = 0, NvPathLength = 0; unsigned int NvBotDist, NnvBotDist; int tiebreakChild; int processingDone, thenDone, elseDone; diff --git a/src/bdd/cudd/cuddSymmetry.c b/src/bdd/cudd/cuddSymmetry.c index 630c3778..dfdc6c85 100644 --- a/src/bdd/cudd/cuddSymmetry.c +++ b/src/bdd/cudd/cuddSymmetry.c @@ -1479,10 +1479,10 @@ ddSymmGroupMove( Move ** moves) { Move *move; - int size; + int size = -1; int i,j; int xtop,xbot,xsize,ytop,ybot,ysize,newxtop; - int swapx,swapy; + int swapx = -1,swapy = -1; #ifdef DD_DEBUG assert(x < y); /* we assume that x < y */ diff --git a/src/bdd/cudd/cuddTable.c b/src/bdd/cudd/cuddTable.c index f64f1f8e..a45a1efd 100644 --- a/src/bdd/cudd/cuddTable.c +++ b/src/bdd/cudd/cuddTable.c @@ -1804,7 +1804,7 @@ cuddInsertSubtables( int oldsize,newsize; int i,j,index,reorderSave; unsigned int numSlots = unique->initSlots; - int *newperm, *newinvperm, *newmap; + int *newperm, *newinvperm, *newmap=NULL; DdNode *one, *zero; #ifdef DD_DEBUG diff --git a/src/bdd/cudd/cuddUtil.c b/src/bdd/cudd/cuddUtil.c index 046c1957..8a1f9b2c 100644 --- a/src/bdd/cudd/cuddUtil.c +++ b/src/bdd/cudd/cuddUtil.c @@ -1404,7 +1404,7 @@ Cudd_bddPickArbitraryMinterms( DdNode **old, *neW; double minterms; char *saveString; - int saveFlag, savePoint, isSame; + int saveFlag, savePoint = -1, isSame; minterms = Cudd_CountMinterm(dd,f,n); if ((double)k > minterms) { diff --git a/src/bdd/cudd/cuddZddGroup.c b/src/bdd/cudd/cuddZddGroup.c index 2d2a5049..dfdf8bb3 100644 --- a/src/bdd/cudd/cuddZddGroup.c +++ b/src/bdd/cudd/cuddZddGroup.c @@ -436,7 +436,7 @@ zddReorderChildren( Cudd_ReorderingType method) { int lower; - int upper; + int upper = -1; int result; unsigned int initialSize; @@ -1084,7 +1084,7 @@ zddGroupMove( Move *move; int size; int i,j,xtop,xbot,xsize,ytop,ybot,ysize,newxtop; - int swapx,swapy; + int swapx=-1,swapy=-1; #if defined(DD_DEBUG) && defined(DD_VERBOSE) int initialSize,bestSize; #endif diff --git a/src/bdd/cudd/cuddZddReord.c b/src/bdd/cudd/cuddZddReord.c index 8a7ae526..8a1d14cb 100644 --- a/src/bdd/cudd/cuddZddReord.c +++ b/src/bdd/cudd/cuddZddReord.c @@ -495,7 +495,7 @@ cuddZddSwapInPlace( int i; int posn; DdNode *f, *f1, *f0, *f11, *f10, *f01, *f00; - DdNode *newf1, *newf0, *next; + DdNode *newf1=NULL, *newf0, *next; DdNodePtr g, *lastP, *previousP; #ifdef DD_DEBUG @@ -756,7 +756,7 @@ cuddZddSwapping( int iterate; int previousSize; Move *moves, *move; - int pivot; + int pivot = -1; int modulo; int result; diff --git a/src/bdd/cudd/cuddZddSymm.c b/src/bdd/cudd/cuddZddSymm.c index 4979968a..f04772c9 100644 --- a/src/bdd/cudd/cuddZddSymm.c +++ b/src/bdd/cudd/cuddZddSymm.c @@ -1487,7 +1487,7 @@ zdd_group_move( Move *move; int size; int i, temp, gxtop, gxbot, gybot, yprev; - int swapx, swapy; + int swapx = -1, swapy = -1; #ifdef DD_DEBUG assert(x < y); /* we assume that x < y */ diff --git a/src/bdd/reo/reoTransfer.c b/src/bdd/reo/reoTransfer.c index 7fd64d75..df8b5cf0 100644 --- a/src/bdd/reo/reoTransfer.c +++ b/src/bdd/reo/reoTransfer.c @@ -72,7 +72,7 @@ reo_unit * reoTransferNodesToUnits_rec( reo_man * p, DdNode * F ) if ( cuddIsConstant(F) ) { pUnit->lev = REO_CONST_LEVEL; - pUnit->pE = (reo_unit*)((int)(ABC_PTRUINT_T)(cuddV(F))); + pUnit->pE = (reo_unit*)(ABC_PTRUINT_T)(cuddV(F)); pUnit->pT = NULL; // check if the diagram that is being reordering has complement edges if ( F != dd->one ) |