Fixing some warnings by adding cast from 'int' to 'size_t' in memset, memcpy, etc.

12 files changed, 20 insertions, 20 deletions

diff --git a/src/bdd/cas/casCore.c b/src/bdd/cas/casCore.c
index 42c04c02..b283d6f0 100644
--- a/src/bdd/cas/casCore.c
+++ b/src/bdd/cas/casCore.c
@@ -524,9 +524,9 @@ DdNode * GetSingleOutputFunction( DdManager * dd, DdNode ** pbOuts, int nOuts, D
     }
     
     // order the outputs
-    qsort( (void*)Order,     nOuts, sizeof(int), (int(*)(const void*, const void*)) CompareSupports );
+    qsort( (void*)Order,     (size_t)nOuts, sizeof(int), (int(*)(const void*, const void*)) CompareSupports );
     // order the outputs
-//  qsort( (void*)OrderMint, nOuts, sizeof(int), (int(*)(const void*, const void*)) CompareMinterms );
+//  qsort( (void*)OrderMint, (size_t)nOuts, sizeof(int), (int(*)(const void*, const void*)) CompareMinterms );
 
 
     bResult = b0;   Cudd_Ref( bResult );
diff --git a/src/bdd/cudd/cuddGroup.c b/src/bdd/cudd/cuddGroup.c
index e0b9ccf5..d916ed5a 100644
--- a/src/bdd/cudd/cuddGroup.c
+++ b/src/bdd/cudd/cuddGroup.c
@@ -755,7 +755,7 @@ ddGroupSifting(
         }
     }
 
-    qsort((void *)var,classes,sizeof(int),
+    qsort((void *)var,(size_t)classes,sizeof(int),
           (DD_QSFP) ddUniqueCompareGroup);
 
     if (lazyFlag) {
diff --git a/src/bdd/cudd/cuddLCache.c b/src/bdd/cudd/cuddLCache.c
index f5bcfd66..1c3330ca 100644
--- a/src/bdd/cudd/cuddLCache.c
+++ b/src/bdd/cudd/cuddLCache.c
@@ -219,7 +219,7 @@ cuddLocalCacheInit(
     manager->memused += cacheSize * cache->itemsize + sizeof(DdLocalCache);
 
     /* Initialize the cache. */
-    memset(cache->item, 0, cacheSize * cache->itemsize);
+    memset(cache->item, 0, (size_t)(cacheSize * cache->itemsize));
 
     /* Add to manager's list of local caches for GC. */
     cuddLocalCacheAddToList(cache);
@@ -407,7 +407,7 @@ cuddLocalCacheClearAll(
     DdLocalCache *cache = manager->localCaches;
 
     while (cache != NULL) {
-        memset(cache->item, 0, cache->slots * cache->itemsize);
+        memset(cache->item, 0, (size_t)(cache->slots * cache->itemsize));
         cache = cache->next;
     }
     return;
@@ -569,7 +569,7 @@ cuddHashTableInit(
         ABC_FREE(hash);
         return(NULL);
     }
-    memset(hash->bucket, 0, hash->numBuckets * sizeof(DdHashItem *));
+    memset(hash->bucket, 0, (size_t)(hash->numBuckets * sizeof(DdHashItem *)));
     hash->size = 0;
     hash->maxsize = hash->numBuckets * DD_MAX_HASHTABLE_DENSITY;
 #ifdef __osf__
@@ -1140,7 +1140,7 @@ cuddLocalCacheResize(
     cache->manager->memused += (slots - oldslots) * cache->itemsize;
 
     /* Clear new cache. */
-    memset(item, 0, slots * cache->itemsize);
+    memset(item, 0, (size_t)(slots * cache->itemsize));
 
     /* Copy from old cache to new one. */
     for (i = 0; (unsigned) i < oldslots; i++) {
diff --git a/src/bdd/cudd/cuddLevelQ.c b/src/bdd/cudd/cuddLevelQ.c
index 5a88b772..822ea21c 100644
--- a/src/bdd/cudd/cuddLevelQ.c
+++ b/src/bdd/cudd/cuddLevelQ.c
@@ -304,7 +304,7 @@ cuddLevelQueueEnqueue(
         queue->freelist = item->next;
     }
     /* Initialize. */
-    memset(item, 0, queue->itemsize);
+    memset(item, 0, (size_t)queue->itemsize);
     item->key = key;
     /* Update stats. */
     queue->size++;
diff --git a/src/bdd/cudd/cuddLinear.c b/src/bdd/cudd/cuddLinear.c
index 0dd688f2..7a0bf8db 100644
--- a/src/bdd/cudd/cuddLinear.c
+++ b/src/bdd/cudd/cuddLinear.c
@@ -295,7 +295,7 @@ cuddLinearAndSifting(
         var[i] = i;
     }
 
-    qsort((void *)var,size,sizeof(int),(DD_QSFP)ddLinearUniqueCompare);
+    qsort((void *)var,(size_t)size,sizeof(int),(DD_QSFP)ddLinearUniqueCompare);
 
     /* Now sift. */
     for (i = 0; i < ddMin(table->siftMaxVar,size); i++) {
diff --git a/src/bdd/cudd/cuddReorder.c b/src/bdd/cudd/cuddReorder.c
index a68cef28..c48b0c13 100644
--- a/src/bdd/cudd/cuddReorder.c
+++ b/src/bdd/cudd/cuddReorder.c
@@ -541,7 +541,7 @@ cuddSifting(
         var[i] = i;
     }
 
-    qsort((void *)var,size,sizeof(int),(DD_QSFP)ddUniqueCompare);
+    qsort((void *)var,(size_t)size,sizeof(int),(DD_QSFP)ddUniqueCompare);
 
     /* Now sift. */
     for (i = 0; i < ddMin(table->siftMaxVar,size); i++) {
diff --git a/src/bdd/cudd/cuddSymmetry.c b/src/bdd/cudd/cuddSymmetry.c
index e6f49da4..310286c4 100644
--- a/src/bdd/cudd/cuddSymmetry.c
+++ b/src/bdd/cudd/cuddSymmetry.c
@@ -356,7 +356,7 @@ cuddSymmSifting(
         var[i] = i;
     }
 
-    qsort((void *)var,size,sizeof(int),(DD_QSFP)ddSymmUniqueCompare);
+    qsort((void *)var,(size_t)size,sizeof(int),(DD_QSFP)ddSymmUniqueCompare);
 
     /* Initialize the symmetry of each subtable to itself. */
     for (i = lower; i <= upper; i++) {
@@ -480,7 +480,7 @@ cuddSymmSiftingConv(
         var[i] = i;
     }
 
-    qsort((void *)var,size,sizeof(int),(DD_QSFP)ddSymmUniqueCompare);
+    qsort((void *)var,(size_t)size,sizeof(int),(DD_QSFP)ddSymmUniqueCompare);
 
     /* Initialize the symmetry of each subtable to itself
     ** for first pass of converging symmetric sifting.
@@ -535,7 +535,7 @@ cuddSymmSiftingConv(
             var[classes] = i;
         }
 
-        qsort((void *)var,classes,sizeof(int),(DD_QSFP)ddSymmUniqueCompare);
+        qsort((void *)var,(size_t)classes,sizeof(int),(DD_QSFP)ddSymmUniqueCompare);
 
         /* Now sift. */
         for (i = 0; i < ddMin(table->siftMaxVar,classes); i++) {
diff --git a/src/bdd/cudd/cuddZddGroup.c b/src/bdd/cudd/cuddZddGroup.c
index f5972292..67f9472f 100644
--- a/src/bdd/cudd/cuddZddGroup.c
+++ b/src/bdd/cudd/cuddZddGroup.c
@@ -682,7 +682,7 @@ zddGroupSifting(
         }
     }
 
-    qsort((void *)var,classes,sizeof(int),(DD_QSFP)zddUniqueCompareGroup);
+    qsort((void *)var,(size_t)classes,sizeof(int),(DD_QSFP)zddUniqueCompareGroup);
 
     /* Now sift. */
     for (i = 0; i < ddMin(table->siftMaxVar,classes); i++) {
diff --git a/src/bdd/cudd/cuddZddLin.c b/src/bdd/cudd/cuddZddLin.c
index 0e2e3c3a..a711e9a6 100644
--- a/src/bdd/cudd/cuddZddLin.c
+++ b/src/bdd/cudd/cuddZddLin.c
@@ -189,7 +189,7 @@ cuddZddLinearSifting(
         var[i] = i;
     }
 
-    qsort((void *)var, size, sizeof(int), (DD_QSFP)cuddZddUniqueCompare);
+    qsort((void *)var, (size_t)size, sizeof(int), (DD_QSFP)cuddZddUniqueCompare);
 
     /* Now sift. */
     for (i = 0; i < ddMin(table->siftMaxVar, size); i++) {
diff --git a/src/bdd/cudd/cuddZddReord.c b/src/bdd/cudd/cuddZddReord.c
index 3a6ea8ed..c195f5b5 100644
--- a/src/bdd/cudd/cuddZddReord.c
+++ b/src/bdd/cudd/cuddZddReord.c
@@ -899,7 +899,7 @@ cuddZddSifting(
         var[i] = i;
     }
 
-    qsort((void *)var, size, sizeof(int), (DD_QSFP)cuddZddUniqueCompare);
+    qsort((void *)var, (size_t)size, sizeof(int), (DD_QSFP)cuddZddUniqueCompare);
 
     /* Now sift. */
     for (i = 0; i < ddMin(table->siftMaxVar, size); i++) {
diff --git a/src/bdd/cudd/cuddZddSymm.c b/src/bdd/cudd/cuddZddSymm.c
index bdc5e656..92970002 100644
--- a/src/bdd/cudd/cuddZddSymm.c
+++ b/src/bdd/cudd/cuddZddSymm.c
@@ -337,7 +337,7 @@ cuddZddSymmSifting(
         var[i] = i;
     }
 
-    qsort((void *)var, nvars, sizeof(int), (DD_QSFP)cuddZddUniqueCompare);
+    qsort((void *)var, (size_t)nvars, sizeof(int), (DD_QSFP)cuddZddUniqueCompare);
 
     /* Initialize the symmetry of each subtable to itself. */
     for (i = lower; i <= upper; i++)
@@ -462,7 +462,7 @@ cuddZddSymmSiftingConv(
         var[i] = i;
     }
 
-    qsort((void *)var, nvars, sizeof(int), (DD_QSFP)cuddZddUniqueCompare);
+    qsort((void *)var, (size_t)nvars, sizeof(int), (DD_QSFP)cuddZddUniqueCompare);
 
     /* Initialize the symmetry of each subtable to itself
     ** for first pass of converging symmetric sifting.
@@ -519,7 +519,7 @@ cuddZddSymmSiftingConv(
             var[classes] = i;
         }
 
-        qsort((void *)var,classes,sizeof(int),(DD_QSFP)cuddZddUniqueCompare);
+        qsort((void *)var,(size_t)classes,sizeof(int),(DD_QSFP)cuddZddUniqueCompare);
 
         /* Now sift. */
         iteration = ddMin(table->siftMaxVar, nvars);
diff --git a/src/bdd/extrab/extraBddUnate.c b/src/bdd/extrab/extraBddUnate.c
index 9ebdd4e5..a8affc4f 100644
--- a/src/bdd/extrab/extraBddUnate.c
+++ b/src/bdd/extrab/extraBddUnate.c
@@ -197,7 +197,7 @@ void Extra_UnateInfoPrint( Extra_UnateInfo_t * p )
     char * pBuffer;
     int i;
     pBuffer = ABC_ALLOC( char, p->nVarsMax+1 );
-    memset( pBuffer, ' ', p->nVarsMax );
+    memset( pBuffer, ' ', (size_t)p->nVarsMax );
     pBuffer[p->nVarsMax] = 0;
     for ( i = 0; i < p->nVars; i++ )
         if ( p->pVars[i].Neg )