diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2012-07-07 18:15:08 -0700 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2012-07-07 18:15:08 -0700 |
commit | 4760983a461142eacceeed45ddcf5598e6a389a2 (patch) | |
tree | 87afc6370242742e1571cc42ff7824a9d8ce722f /src/map/mapper | |
parent | 3aab7245738a69f1dd4d898493d5dabf6596ea61 (diff) | |
download | abc-4760983a461142eacceeed45ddcf5598e6a389a2.tar.gz abc-4760983a461142eacceeed45ddcf5598e6a389a2.tar.bz2 abc-4760983a461142eacceeed45ddcf5598e6a389a2.zip |
Fixing time primtouts throughout the code.
Diffstat (limited to 'src/map/mapper')
-rw-r--r-- | src/map/mapper/mapperCut.c | 4 |
1 files changed, 2 insertions, 2 deletions
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 ); |