diff -durp cudd-2.4.2.ORIG/cudd/cuddAddIte.c cudd-2.4.2/cudd/cuddAddIte.c --- cudd-2.4.2.ORIG/cudd/cuddAddIte.c 2004-08-24 15:37:42.000000000 -0600 +++ cudd-2.4.2/cudd/cuddAddIte.c 2009-05-12 10:21:14.000000000 -0600 @@ -447,7 +447,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 = 0; statLine(dd); /* Trivial cases. */ diff -durp cudd-2.4.2.ORIG/cudd/cuddAddWalsh.c cudd-2.4.2/cudd/cuddAddWalsh.c --- cudd-2.4.2.ORIG/cudd/cuddAddWalsh.c 2009-02-17 07:16:38.000000000 -0700 +++ cudd-2.4.2/cudd/cuddAddWalsh.c 2009-05-12 10:21:14.000000000 -0600 @@ -298,7 +298,7 @@ addWalshInt( int n) { DdNode *one, *minusone; - DdNode *t, *u, *t1, *u1, *v, *w; + DdNode *t = NULL, *u, *t1, *u1, *v, *w; int i; one = DD_ONE(dd); diff -durp cudd-2.4.2.ORIG/cudd/cuddBddIte.c cudd-2.4.2/cudd/cuddBddIte.c --- cudd-2.4.2.ORIG/cudd/cuddBddIte.c 2004-08-24 15:37:43.000000000 -0600 +++ cudd-2.4.2/cudd/cuddBddIte.c 2009-05-12 10:21:14.000000000 -0600 @@ -635,7 +635,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 = 0; int comple; statLine(dd); diff -durp cudd-2.4.2.ORIG/cudd/cuddDecomp.c cudd-2.4.2/cudd/cuddDecomp.c --- cudd-2.4.2.ORIG/cudd/cuddDecomp.c 2004-08-24 15:37:43.000000000 -0600 +++ cudd-2.4.2/cudd/cuddDecomp.c 2009-05-12 10:21:14.000000000 -0600 @@ -1689,7 +1689,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 -durp cudd-2.4.2.ORIG/cudd/cuddGroup.c cudd-2.4.2/cudd/cuddGroup.c --- cudd-2.4.2.ORIG/cudd/cuddGroup.c 2009-05-12 10:20:42.000000000 -0600 +++ cudd-2.4.2/cudd/cuddGroup.c 2009-05-12 10:21:14.000000000 -0600 @@ -454,7 +454,7 @@ ddReorderChildren( Cudd_ReorderingType method) { int lower; - int upper; + int upper = 0; int result; unsigned int initialSize; @@ -1492,7 +1492,7 @@ ddGroupMove( Move *move; int size; int i,j,xtop,xbot,xsize,ytop,ybot,ysize,newxtop; - int swapx,swapy; + int swapx = 0, swapy = 0; #if defined(DD_DEBUG) && defined(DD_VERBOSE) int initialSize,bestSize; #endif @@ -1672,7 +1672,7 @@ ddGroupSiftingBackward( { Move *move; int res; - Move *end_move; + Move *end_move = NULL; int diff, tmp_diff; int index; unsigned int pairlev; diff -durp cudd-2.4.2.ORIG/cudd/cuddHarwell.c cudd-2.4.2/cudd/cuddHarwell.c --- cudd-2.4.2.ORIG/cudd/cuddHarwell.c 2004-08-24 15:37:44.000000000 -0600 +++ cudd-2.4.2/cudd/cuddHarwell.c 2009-05-12 10:21:14.000000000 -0600 @@ -248,6 +248,7 @@ Cudd_addHarwell( lny = i; /* Allocate or reallocate arrays for variables as needed */ + lx = ly = lxn = lyn = NULL; if (*nx == 0) { if (lnx > 0) { *x = lx = ALLOC(DdNode *,lnx); diff -durp cudd-2.4.2.ORIG/cudd/cuddLinear.c cudd-2.4.2/cudd/cuddLinear.c --- cudd-2.4.2.ORIG/cudd/cuddLinear.c 2009-02-19 19:17:45.000000000 -0700 +++ cudd-2.4.2/cudd/cuddLinear.c 2009-05-12 10:21:14.000000000 -0600 @@ -373,7 +373,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 -durp cudd-2.4.2.ORIG/cudd/cuddPriority.c cudd-2.4.2/cudd/cuddPriority.c --- cudd-2.4.2.ORIG/cudd/cuddPriority.c 2009-02-19 19:17:45.000000000 -0700 +++ cudd-2.4.2/cudd/cuddPriority.c 2009-05-12 10:22:48.000000000 -0600 @@ -781,6 +781,7 @@ Cudd_Inequality( else if ((-(1 << N) + 1) >= c) return(one); /* Build the result bottom up. */ + map[0] = map[1] = NULL; for (i = 1; i <= N; i++) { int kTrueLower, kFalseLower; int leftChild, middleChild, rightChild; @@ -789,6 +790,7 @@ Cudd_Inequality( DdNode *newMap[2]; int newIndex[2]; + newMap[0] = newMap[1] = NULL; kTrueLower = kTrue; kFalseLower = kFalse; /* kTrue = ceiling((c-1)/2^i) + 1 */ @@ -969,6 +971,7 @@ Cudd_Disequality( if ((1 << N) - 1 < c || (-(1 << N) + 1) > c) return(one); /* Build the result bottom up. */ + map[0] = map[1] = NULL; for (i = 1; i <= N; i++) { int kTrueLbLower, kTrueUbLower; int leftChild, middleChild, rightChild; @@ -977,6 +980,7 @@ Cudd_Disequality( DdNode *newMap[2]; int newIndex[2]; + newMap[0] = newMap[1] = NULL; kTrueLbLower = kTrueLb; kTrueUbLower = kTrueUb; /* kTrueLb = floor((c-1)/2^i) + 2 */ @@ -1426,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 = 0U; DdNode *one = DD_ONE(dd); statLine(dd); diff -durp cudd-2.4.2.ORIG/cudd/cuddReorder.c cudd-2.4.2/cudd/cuddReorder.c --- cudd-2.4.2.ORIG/cudd/cuddReorder.c 2009-02-21 11:25:01.000000000 -0700 +++ cudd-2.4.2/cudd/cuddReorder.c 2009-05-12 10:21:14.000000000 -0600 @@ -606,7 +606,7 @@ cuddSwapping( int iterate; int previousSize; Move *moves, *move; - int pivot; + int pivot = 0; int modulo; int result; diff -durp cudd-2.4.2.ORIG/cudd/cuddSubsetSP.c cudd-2.4.2/cudd/cuddSubsetSP.c --- cudd-2.4.2.ORIG/cudd/cuddSubsetSP.c 2009-02-19 19:17:45.000000000 -0700 +++ cudd-2.4.2/cudd/cuddSubsetSP.c 2009-05-12 10:21:14.000000000 -0600 @@ -1257,17 +1257,17 @@ 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; + unsigned int NnvPathLength = 0U, NvPathLength = 0U; unsigned int NvBotDist, NnvBotDist; int tiebreakChild; int processingDone, thenDone, elseDone; - #ifdef DD_DEBUG numCalls++; #endif diff -durp cudd-2.4.2.ORIG/cudd/cuddSymmetry.c cudd-2.4.2/cudd/cuddSymmetry.c --- cudd-2.4.2.ORIG/cudd/cuddSymmetry.c 2009-02-19 19:17:45.000000000 -0700 +++ cudd-2.4.2/cudd/cuddSymmetry.c 2009-05-12 10:21:14.000000000 -0600 @@ -1472,10 +1472,10 @@ ddSymmGroupMove( Move ** moves) { Move *move; - int size; + int size = 0; int i,j; int xtop,xbot,xsize,ytop,ybot,ysize,newxtop; - int swapx,swapy; + int swapx = 0, swapy = 0; #ifdef DD_DEBUG assert(x < y); /* we assume that x < y */ @@ -1551,7 +1551,7 @@ ddSymmGroupMoveBackward( int x, int y) { - int size; + int size = 0; int i,j; int xtop,xbot,xsize,ytop,ybot,ysize,newxtop; diff -durp cudd-2.4.2.ORIG/cudd/cuddTable.c cudd-2.4.2/cudd/cuddTable.c --- cudd-2.4.2.ORIG/cudd/cuddTable.c 2009-02-19 19:17:45.000000000 -0700 +++ cudd-2.4.2/cudd/cuddTable.c 2009-05-12 10:21:14.000000000 -0600 @@ -1789,7 +1789,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 @@ -2516,7 +2516,7 @@ ddResizeTable( int oldsize,newsize; int i,j,reorderSave; int numSlots = unique->initSlots; - int *newperm, *newinvperm, *newmap; + int *newperm, *newinvperm, *newmap = NULL; DdNode *one, *zero; oldsize = unique->size; diff -durp cudd-2.4.2.ORIG/cudd/cuddUtil.c cudd-2.4.2/cudd/cuddUtil.c --- cudd-2.4.2.ORIG/cudd/cuddUtil.c 2009-03-07 21:08:41.000000000 -0700 +++ cudd-2.4.2/cudd/cuddUtil.c 2009-05-12 10:21:14.000000000 -0600 @@ -1400,7 +1400,7 @@ Cudd_bddPickArbitraryMinterms( DdNode **old, *neW; double minterms; char *saveString; - int saveFlag, savePoint, isSame; + int saveFlag, savePoint = 0, isSame; minterms = Cudd_CountMinterm(dd,f,n); if ((double)k > minterms) { diff -durp cudd-2.4.2.ORIG/cudd/cuddZddGroup.c cudd-2.4.2/cudd/cuddZddGroup.c --- cudd-2.4.2.ORIG/cudd/cuddZddGroup.c 2009-05-12 10:20:42.000000000 -0600 +++ cudd-2.4.2/cudd/cuddZddGroup.c 2009-05-12 10:21:14.000000000 -0600 @@ -434,7 +434,7 @@ zddReorderChildren( Cudd_ReorderingType method) { int lower; - int upper; + int upper = 0; int result; unsigned int initialSize; @@ -1082,7 +1082,7 @@ zddGroupMove( Move *move; int size; int i,j,xtop,xbot,xsize,ytop,ybot,ysize,newxtop; - int swapx,swapy; + int swapx = 0, swapy = 0; #if defined(DD_DEBUG) && defined(DD_VERBOSE) int initialSize,bestSize; #endif diff -durp cudd-2.4.2.ORIG/cudd/cuddZddReord.c cudd-2.4.2/cudd/cuddZddReord.c --- cudd-2.4.2.ORIG/cudd/cuddZddReord.c 2004-08-24 15:37:47.000000000 -0600 +++ cudd-2.4.2/cudd/cuddZddReord.c 2009-05-12 10:21:14.000000000 -0600 @@ -491,7 +491,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 @@ -752,7 +752,7 @@ cuddZddSwapping( int iterate; int previousSize; Move *moves, *move; - int pivot; + int pivot = 0; int modulo; int result; diff -durp cudd-2.4.2.ORIG/cudd/cuddZddSymm.c cudd-2.4.2/cudd/cuddZddSymm.c --- cudd-2.4.2.ORIG/cudd/cuddZddSymm.c 2004-08-24 15:37:47.000000000 -0600 +++ cudd-2.4.2/cudd/cuddZddSymm.c 2009-05-12 10:21:14.000000000 -0600 @@ -1483,7 +1483,7 @@ zdd_group_move( Move *move; int size; int i, temp, gxtop, gxbot, gybot, yprev; - int swapx, swapy; + int swapx = 0, swapy = 0; #ifdef DD_DEBUG assert(x < y); /* we assume that x < y */ @@ -1586,7 +1586,7 @@ zdd_group_move_backward( int x, int y) { - int size; + int size = 0; int i, temp, gxtop, gxbot, gybot, yprev; #ifdef DD_DEBUG diff -durp cudd-2.4.2.ORIG/nanotrav/bnet.c cudd-2.4.2/nanotrav/bnet.c --- cudd-2.4.2.ORIG/nanotrav/bnet.c 2009-02-20 23:35:51.000000000 -0700 +++ cudd-2.4.2/nanotrav/bnet.c 2009-05-12 10:21:14.000000000 -0600 @@ -1890,6 +1890,7 @@ buildMuxBDD( DdNode *func, *f, *g, *h; BnetNode *auxnd; + mux[0] = mux[1] = phase[0] = phase[1] = 0; if (nd->ninp != 3) return(0); for (line = nd->f; line != NULL; line = line->next) { diff -durp cudd-2.4.2.ORIG/nanotrav/ntr.c cudd-2.4.2/nanotrav/ntr.c --- cudd-2.4.2.ORIG/nanotrav/ntr.c 2009-02-20 23:35:51.000000000 -0700 +++ cudd-2.4.2/nanotrav/ntr.c 2009-05-12 10:21:14.000000000 -0600 @@ -964,7 +964,7 @@ Ntr_SCC( DdNode *neW; DdNode *one, *zero; DdNode *states, *scc; - DdNode *tmp; + DdNode *tmp = NULL; DdNode *SCCs[10]; int depth; int nscc = 0;