From 4760983a461142eacceeed45ddcf5598e6a389a2 Mon Sep 17 00:00:00 2001
From: Alan Mishchenko <alanmi@berkeley.edu>
Date: Sat, 7 Jul 2012 18:15:08 -0700
Subject: Fixing time primtouts throughout the code.

---
 src/map/amap/amapRule.c    | 2 +-
 src/map/fpga/fpgaMatch.c   | 3 ++-
 src/map/if/ifCut.c         | 2 +-
 src/map/if/ifMap.c         | 2 +-
 src/map/mapper/mapperCut.c | 4 ++--
 5 files changed, 7 insertions(+), 6 deletions(-)

(limited to 'src/map')

diff --git a/src/map/amap/amapRule.c b/src/map/amap/amapRule.c
index e8cb48c4..78016f4f 100644
--- a/src/map/amap/amapRule.c
+++ b/src/map/amap/amapRule.c
@@ -338,7 +338,7 @@ void Amap_LibCreateRules( Amap_Lib_t * pLib, int fVeryVerbose )
 {
     Amap_Gat_t * pGate;
     int i, nGates = 0;
-//    int clk = clock();
+//    clock_t clk = clock();
     pLib->fVerbose = fVeryVerbose;
     pLib->vRules   = Vec_PtrAlloc( 100 );
     pLib->vRulesX  = Vec_PtrAlloc( 100 );
diff --git a/src/map/fpga/fpgaMatch.c b/src/map/fpga/fpgaMatch.c
index dd04e562..5f233533 100644
--- a/src/map/fpga/fpgaMatch.c
+++ b/src/map/fpga/fpgaMatch.c
@@ -667,7 +667,8 @@ Fpga_Cut_t * Fpga_MappingAreaWithoutNode( Fpga_Man_t * p, Fpga_Node_t * pNode, F
 {
     Fpga_Cut_t * pCut, * pCutBestOld, * pCutRes;
     float aAreaCutBest;
-    int i, clk;
+    int i;
+    clock_t clk;
     // make sure that at least one cut other than the trivial is present
     if ( pNode->pCuts->pNext == NULL )
     {
diff --git a/src/map/if/ifCut.c b/src/map/if/ifCut.c
index c1d770fd..efeacdac 100644
--- a/src/map/if/ifCut.c
+++ b/src/map/if/ifCut.c
@@ -1407,7 +1407,7 @@ int If_CutCountTotalFanins( If_Man_t * p )
     If_Obj_t * pObj;
     Vec_Int_t * vLeaves;
     int i, nFaninsTotal = 0, Counter = 0;
-    int clk = clock();
+    clock_t clk = clock();
     vLeaves = Vec_IntAlloc( 100 );
     If_ManForEachObj( p, pObj, i )
     {
diff --git a/src/map/if/ifMap.c b/src/map/if/ifMap.c
index ea1d5f33..1293521a 100644
--- a/src/map/if/ifMap.c
+++ b/src/map/if/ifMap.c
@@ -203,7 +203,7 @@ void If_ObjPerformMappingAnd( If_Man_t * p, If_Obj_t * pObj, int Mode, int fPrep
         pCut->fCompl = 0;
         if ( p->pPars->fTruth )
         {
-//            int clk = clock();
+//            clock_t clk = clock();
             int RetValue = If_CutComputeTruth( p, pCut, pCut0, pCut1, pObj->fCompl0, pObj->fCompl1 );
 //            p->timeTruth += clock() - clk;
             pCut->fUseless = 0;
diff --git a/src/map/mapper/mapperCut.c b/src/map/mapper/mapperCut.c
index 12ee5d92..bec1870a 100644
--- a/src/map/mapper/mapperCut.c
+++ b/src/map/mapper/mapperCut.c
@@ -915,7 +915,7 @@ Map_Cut_t * Map_CutTableConsider( Map_Man_t * pMan, Map_CutTable_t * p, Map_Node
 {
     Map_Cut_t * pCut;
     int Place, i;
-//    int clk;
+//    clock_t clk;
     // check the cut
     Place = Map_CutTableLookup( p, ppNodes, nNodes );
     if ( Place == -1 )
@@ -996,7 +996,7 @@ Map_Cut_t * Map_CutSortCuts( Map_Man_t * pMan, Map_CutTable_t * p, Map_Cut_t * p
 {
     Map_Cut_t * pListNew;
     int nCuts, i;
-//    int clk;
+//    clock_t clk;
     // move the cuts from the list into the array
     nCuts = Map_CutList2Array( p->pCuts1, pList );
     assert( nCuts <= MAP_CUTS_MAX_COMPUTE );
-- 
cgit v1.2.3