1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
|
/**CFile****************************************************************
FileName [mapperCut.c]
PackageName [MVSIS 1.3: Multi-valued logic synthesis system.]
Synopsis [Generic technology mapping engine.]
Author [MVSIS Group]
Affiliation [UC Berkeley]
Date [Ver. 2.0. Started - June 1, 2004.]
Revision [$Id: mapperCut.c,v 1.12 2005/02/28 05:34:27 alanmi Exp $]
***********************************************************************/
#include "mapperInt.h"
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
// the largest number of cuts considered
#define MAP_CUTS_MAX_COMPUTE 1000
// the largest number of cuts used
#define MAP_CUTS_MAX_USE 250
// temporary hash table to store the cuts
typedef struct Map_CutTableStrutct_t Map_CutTable_t;
struct Map_CutTableStrutct_t
{
Map_Cut_t ** pBins; // the table used for linear probing
int nBins; // the size of the table
int * pCuts; // the array of cuts currently stored
int nCuts; // the number of cuts currently stored
Map_Cut_t ** pArray; // the temporary array of cuts
Map_Cut_t ** pCuts1; // the temporary array of cuts
Map_Cut_t ** pCuts2; // the temporary array of cuts
};
// primes used to compute the hash key
static int s_HashPrimes[10] = { 109, 499, 557, 619, 631, 709, 797, 881, 907, 991 };
static Map_Cut_t * Map_CutCompute( Map_Man_t * p, Map_CutTable_t * pTable, Map_Node_t * pNode );
static void Map_CutFilter( Map_Man_t * p, Map_Node_t * pNode );
static Map_Cut_t * Map_CutMergeLists( Map_Man_t * p, Map_CutTable_t * pTable, Map_Cut_t * pList1, Map_Cut_t * pList2, int fComp1, int fComp2 );
static int Map_CutMergeTwo( Map_Cut_t * pCut1, Map_Cut_t * pCut2, Map_Node_t * ppNodes[], int nNodesMax );
static Map_Cut_t * Map_CutUnionLists( Map_Cut_t * pList1, Map_Cut_t * pList2 );
static int Map_CutBelongsToList( Map_Cut_t * pList, Map_Node_t * ppNodes[], int nNodes );
static void Map_CutListPrint( Map_Man_t * pMan, Map_Node_t * pRoot );
static void Map_CutListPrint2( Map_Man_t * pMan, Map_Node_t * pRoot );
static void Map_CutPrint_( Map_Man_t * pMan, Map_Cut_t * pCut, Map_Node_t * pRoot );
static Map_CutTable_t * Map_CutTableStart( Map_Man_t * pMan );
static void Map_CutTableStop( Map_CutTable_t * p );
static unsigned Map_CutTableHash( Map_Node_t * ppNodes[], int nNodes );
static int Map_CutTableLookup( Map_CutTable_t * p, Map_Node_t * ppNodes[], int nNodes );
static Map_Cut_t * Map_CutTableConsider( Map_Man_t * pMan, Map_CutTable_t * p, Map_Node_t * ppNodes[], int nNodes );
static void Map_CutTableRestart( Map_CutTable_t * p );
static Map_Cut_t * Map_CutSortCuts( Map_Man_t * pMan, Map_CutTable_t * p, Map_Cut_t * pList );
static int Map_CutList2Array( Map_Cut_t ** pArray, Map_Cut_t * pList );
static Map_Cut_t * Map_CutArray2List( Map_Cut_t ** pArray, int nCuts );
// iterator through all the cuts of the list
#define Map_ListForEachCut( pList, pCut ) \
for ( pCut = pList; \
pCut; \
pCut = pCut->pNext )
#define Map_ListForEachCutSafe( pList, pCut, pCut2 ) \
for ( pCut = pList, \
pCut2 = pCut? pCut->pNext: NULL; \
pCut; \
pCut = pCut2, \
pCut2 = pCut? pCut->pNext: NULL )
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Computes the cuts for each node in the object graph.]
Description [The cuts are computed in one sweep over the mapping graph.
First, the elementary cuts, which include the node itself, are assigned
to the PI nodes. The internal nodes are considered in the DFS order.
Each node is two-input AND-gate. So to compute the cuts at a node, we
need to merge the sets of cuts of its two predecessors. The merged set
contains only unique cuts with the number of inputs equal to k or less.
Finally, the elementary cut, composed of the node itself, is added to
the set of cuts for the node.
This procedure is pretty fast for 5-feasible cuts, but it dramatically
slows down on some "dense" networks when computing 6-feasible cuts.
The problem is that there are too many cuts in this case. We should
think how to heuristically trim the number of cuts in such cases,
to have reasonable runtime.]
SideEffects []
SeeAlso []
***********************************************************************/
void Map_MappingCuts( Map_Man_t * p )
{
ProgressBar * pProgress;
Map_CutTable_t * pTable;
Map_Node_t * pNode;
Map_Cut_t * pCut;
int nCuts, nNodes, i;
// set the elementary cuts for the PI variables
assert( p->nVarsMax > 1 && p->nVarsMax < 7 );
for ( i = 0; i < p->nInputs; i++ )
{
pCut = Map_CutAlloc( p );
pCut->nLeaves = 1;
pCut->ppLeaves[0] = p->pInputs[i];
// pCut->fLevel = (float)pCut->ppLeaves[0]->Level;
p->pInputs[i]->pCuts = pCut;
p->pInputs[i]->pCutBest[0] = NULL; // negative polarity is not mapped
p->pInputs[i]->pCutBest[1] = pCut; // positive polarity is a trivial cut
pCut->M[0].AreaFlow = 0.0;
pCut->M[1].AreaFlow = 0.0;
}
// compute the cuts for the internal nodes
nNodes = p->vAnds->nSize;
pProgress = Extra_ProgressBarStart( stdout, nNodes );
pTable = Map_CutTableStart( p );
for ( i = 0; i < nNodes; i++ )
{
pNode = p->vAnds->pArray[i];
if ( !Map_NodeIsAnd( pNode ) )
continue;
Map_CutCompute( p, pTable, pNode );
Extra_ProgressBarUpdate( pProgress, i, "Cuts ..." );
}
Extra_ProgressBarStop( pProgress );
Map_CutTableStop( pTable );
// report the stats
if ( p->fVerbose )
{
nCuts = Map_MappingCountAllCuts(p);
printf( "Nodes = %6d. Total %d-feasible cuts = %d. Cuts per node = %.1f.\n",
p->nNodes, p->nVarsMax, nCuts, ((float)nCuts)/p->nNodes );
}
// print the cuts for the first primary output
// Map_CutListPrint( p, Map_Regular(p->pOutputs[0]) );
}
/**Function*************************************************************
Synopsis [Performs technology mapping for variable-size-LUTs.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Map_MappingCreatePiCuts( Map_Man_t * p )
{
Map_Cut_t * pCut;
int i;
// set the elementary cuts for the PI variables
for ( i = 0; i < p->nInputs; i++ )
{
pCut = Map_CutAlloc( p );
pCut->nLeaves = 1;
pCut->ppLeaves[0] = p->pInputs[i];
// pCut->fLevel = (float)pCut->ppLeaves[0]->Level;
p->pInputs[i]->pCuts = pCut;
p->pInputs[i]->pCutBest[1] = pCut;
p->pInputs[i]->pCutBest[0] = pCut;
// set the input arrival times
// p->pInputs[i]->pCut[1]->tArrival = p->pInputArrivals[i];
// set the input arrival times
pCut = p->pInputs[i]->pCutBest[1];
pCut->M[1].tArrive = p->pInputArrivals[i];
pCut->M[1].tArrive.Worst = MAP_MAX( pCut->M[1].tArrive.Rise, pCut->M[1].tArrive.Fall );
// set the arrival times of the negative phases of the PI nodes
pCut = p->pInputs[i]->pCutBest[0];
pCut->M[0].tArrive.Rise = p->pInputArrivals[i].Fall + p->pSuperLib->tDelayInv.Rise;
pCut->M[0].tArrive.Fall = p->pInputArrivals[i].Rise + p->pSuperLib->tDelayInv.Fall;
pCut->M[0].tArrive.Worst = MAP_MAX( pCut->M[0].tArrive.Rise, pCut->M[0].tArrive.Fall );
}
}
/**Function*************************************************************
Synopsis [Computes the cuts for one node.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Map_Cut_t * Map_CutCompute( Map_Man_t * p, Map_CutTable_t * pTable, Map_Node_t * pNode )
{
Map_Node_t * pTemp;
Map_Cut_t * pList, * pList1, * pList2;
Map_Cut_t * pCut;
// if the cuts are computed return them
if ( pNode->pCuts )
return pNode->pCuts;
// compute the cuts for the children
pList1 = Map_Regular(pNode->p1)->pCuts;
pList2 = Map_Regular(pNode->p2)->pCuts;
// merge the lists
pList = Map_CutMergeLists( p, pTable, pList1, pList2,
Map_IsComplement(pNode->p1), Map_IsComplement(pNode->p2) );
// if there are functionally equivalent nodes, union them with this list
assert( pList );
// only add to the list of cuts if the node is a representative one
if ( pNode->pRepr == NULL )
{
for ( pTemp = pNode->pNextE; pTemp; pTemp = pTemp->pNextE )
{
assert( pTemp->pCuts );
pList = Map_CutUnionLists( pList, pTemp->pCuts );
assert( pTemp->pCuts );
pList = Map_CutSortCuts( p, pTable, pList );
}
}
// add the new cut
pCut = Map_CutAlloc( p );
pCut->nLeaves = 1;
pCut->ppLeaves[0] = pNode;
// pCut->fLevel = (float)pCut->ppLeaves[0]->Level;
// append (it is important that the elementary cut is appended first)
pCut->pNext = pList;
// set at the node
pNode->pCuts = pCut;
// remove the dominated cuts
// Map_CutFilter( p, pNode );
// set the phase correctly
if ( pNode->pRepr && Map_NodeComparePhase(pNode, pNode->pRepr) )
{
Map_ListForEachCut( pNode->pCuts, pCut )
pCut->Phase = 1;
}
/*
{
int i, Counter = 0;;
for ( pCut = pNode->pCuts->pNext; pCut; pCut = pCut->pNext )
for ( i = 0; i < pCut->nLeaves; i++ )
Counter += (pCut->ppLeaves[i]->Level >= pNode->Level);
// if ( Counter )
// printf( " %d", Counter );
}
*/
return pCut;
}
/**Function*************************************************************
Synopsis [Filter the cuts using dominance.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Map_CutFilter( Map_Man_t * p, Map_Node_t * pNode )
{
Map_Cut_t * pTemp, * pPrev, * pCut, * pCut2;
int i, k, Counter;
Counter = 0;
pPrev = pNode->pCuts;
Map_ListForEachCutSafe( pNode->pCuts->pNext, pCut, pCut2 )
{
// go through all the previous cuts up to pCut
for ( pTemp = pNode->pCuts->pNext; pTemp != pCut; pTemp = pTemp->pNext )
{
// check if every node in pTemp is contained in pCut
for ( i = 0; i < pTemp->nLeaves; i++ )
{
for ( k = 0; k < pCut->nLeaves; k++ )
if ( pTemp->ppLeaves[i] == pCut->ppLeaves[k] )
break;
if ( k == pCut->nLeaves ) // node i in pTemp is not contained in pCut
break;
}
if ( i == pTemp->nLeaves ) // every node in pTemp is contained in pCut
{
Counter++;
break;
}
}
if ( pTemp != pCut ) // pTemp contain pCut
{
pPrev->pNext = pCut->pNext; // skip pCut
// recycle pCut
Map_CutFree( p, pCut );
}
else
pPrev = pCut;
}
// printf( "Dominated = %3d. \n", Counter );
}
/**Function*************************************************************
Synopsis [Merges two lists of cuts.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Map_Cut_t * Map_CutMergeLists( Map_Man_t * p, Map_CutTable_t * pTable,
Map_Cut_t * pList1, Map_Cut_t * pList2, int fComp1, int fComp2 )
{
Map_Node_t * ppNodes[6];
Map_Cut_t * pListNew, ** ppListNew, * pLists[7] = { NULL };
Map_Cut_t * pCut, * pPrev, * pTemp1, * pTemp2;
int nNodes, Counter, i;
Map_Cut_t ** ppArray1, ** ppArray2, ** ppArray3;
int nCuts1, nCuts2, nCuts3, k, fComp3;
ppArray1 = pTable->pCuts1;
ppArray2 = pTable->pCuts2;
nCuts1 = Map_CutList2Array( ppArray1, pList1 );
nCuts2 = Map_CutList2Array( ppArray2, pList2 );
// swap the lists based on their length
if ( nCuts1 > nCuts2 )
{
ppArray3 = ppArray1;
ppArray1 = ppArray2;
ppArray2 = ppArray3;
nCuts3 = nCuts1;
nCuts1 = nCuts2;
nCuts2 = nCuts3;
fComp3 = fComp1;
fComp1 = fComp2;
fComp2 = fComp3;
}
// pList1 is shorter or equal length compared to pList2
// prepare the manager for the cut computation
Map_CutTableRestart( pTable );
// go through the cut pairs
Counter = 0;
// for ( pTemp1 = pList1; pTemp1; pTemp1 = fPivot1? NULL: pTemp1->pNext )
// for ( pTemp2 = pList2; pTemp2; pTemp2 = fPivot2? NULL: pTemp2->pNext )
for ( i = 0; i < nCuts1; i++ )
{
for ( k = 0; k <= i; k++ )
{
pTemp1 = ppArray1[i];
pTemp2 = ppArray2[k];
if ( pTemp1->nLeaves == p->nVarsMax && pTemp2->nLeaves == p->nVarsMax )
{
if ( pTemp1->ppLeaves[0] != pTemp2->ppLeaves[0] )
continue;
if ( pTemp1->ppLeaves[1] != pTemp2->ppLeaves[1] )
continue;
}
// check if k-feasible cut exists
nNodes = Map_CutMergeTwo( pTemp1, pTemp2, ppNodes, p->nVarsMax );
if ( nNodes == 0 )
continue;
// consider the cut for possible addition to the set of new cuts
pCut = Map_CutTableConsider( p, pTable, ppNodes, nNodes );
if ( pCut == NULL )
continue;
// add data to the cut
pCut->pOne = Map_CutNotCond( pTemp1, fComp1 );
pCut->pTwo = Map_CutNotCond( pTemp2, fComp2 );
// add it to the corresponding list
pCut->pNext = pLists[pCut->nLeaves];
pLists[pCut->nLeaves] = pCut;
// count this cut and quit if limit is reached
Counter++;
if ( Counter == MAP_CUTS_MAX_COMPUTE )
goto QUITS;
}
for ( k = 0; k < i; k++ )
{
pTemp1 = ppArray1[k];
pTemp2 = ppArray2[i];
if ( pTemp1->nLeaves == p->nVarsMax && pTemp2->nLeaves == p->nVarsMax )
{
if ( pTemp1->ppLeaves[0] != pTemp2->ppLeaves[0] )
continue;
if ( pTemp1->ppLeaves[1] != pTemp2->ppLeaves[1] )
continue;
}
// check if k-feasible cut exists
nNodes = Map_CutMergeTwo( pTemp1, pTemp2, ppNodes, p->nVarsMax );
if ( nNodes == 0 )
continue;
// consider the cut for possible addition to the set of new cuts
pCut = Map_CutTableConsider( p, pTable, ppNodes, nNodes );
if ( pCut == NULL )
continue;
// add data to the cut
pCut->pOne = Map_CutNotCond( pTemp1, fComp1 );
pCut->pTwo = Map_CutNotCond( pTemp2, fComp2 );
// add it to the corresponding list
pCut->pNext = pLists[pCut->nLeaves];
pLists[pCut->nLeaves] = pCut;
// count this cut and quit if limit is reached
Counter++;
if ( Counter == MAP_CUTS_MAX_COMPUTE )
goto QUITS;
}
}
// consider the rest of them
for ( i = nCuts1; i < nCuts2; i++ )
for ( k = 0; k < nCuts1; k++ )
{
pTemp1 = ppArray1[k];
pTemp2 = ppArray2[i];
if ( pTemp1->nLeaves == p->nVarsMax && pTemp2->nLeaves == p->nVarsMax )
{
if ( pTemp1->ppLeaves[0] != pTemp2->ppLeaves[0] )
continue;
if ( pTemp1->ppLeaves[1] != pTemp2->ppLeaves[1] )
continue;
}
// check if k-feasible cut exists
nNodes = Map_CutMergeTwo( pTemp1, pTemp2, ppNodes, p->nVarsMax );
if ( nNodes == 0 )
continue;
// consider the cut for possible addition to the set of new cuts
pCut = Map_CutTableConsider( p, pTable, ppNodes, nNodes );
if ( pCut == NULL )
continue;
// add data to the cut
pCut->pOne = Map_CutNotCond( pTemp1, fComp1 );
pCut->pTwo = Map_CutNotCond( pTemp2, fComp2 );
// add it to the corresponding list
pCut->pNext = pLists[pCut->nLeaves];
pLists[pCut->nLeaves] = pCut;
// count this cut and quit if limit is reached
Counter++;
if ( Counter == MAP_CUTS_MAX_COMPUTE )
goto QUITS;
}
QUITS :
// combine all the lists into one
pListNew = NULL;
ppListNew = &pListNew;
for ( i = 1; i <= p->nVarsMax; i++ )
{
if ( pLists[i] == NULL )
continue;
// find the last entry
for ( pPrev = pLists[i], pCut = pPrev->pNext; pCut;
pPrev = pCut, pCut = pCut->pNext );
// connect these lists
*ppListNew = pLists[i];
ppListNew = &pPrev->pNext;
}
*ppListNew = NULL;
// soft the cuts by arrival times and use only the first MAP_CUTS_MAX_USE
pListNew = Map_CutSortCuts( p, pTable, pListNew );
return pListNew;
}
/**Function*************************************************************
Synopsis [Merges two lists of cuts.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Map_Cut_t * Map_CutMergeLists2( Map_Man_t * p, Map_CutTable_t * pTable,
Map_Cut_t * pList1, Map_Cut_t * pList2, int fComp1, int fComp2 )
{
Map_Node_t * ppNodes[6];
Map_Cut_t * pListNew, ** ppListNew, * pLists[7] = { NULL };
Map_Cut_t * pCut, * pPrev, * pTemp1, * pTemp2;
int nNodes, Counter, i;
// prepare the manager for the cut computation
Map_CutTableRestart( pTable );
// go through the cut pairs
Counter = 0;
for ( pTemp1 = pList1; pTemp1; pTemp1 = pTemp1->pNext )
for ( pTemp2 = pList2; pTemp2; pTemp2 = pTemp2->pNext )
{
// check if k-feasible cut exists
nNodes = Map_CutMergeTwo( pTemp1, pTemp2, ppNodes, p->nVarsMax );
if ( nNodes == 0 )
continue;
// consider the cut for possible addition to the set of new cuts
pCut = Map_CutTableConsider( p, pTable, ppNodes, nNodes );
if ( pCut == NULL )
continue;
// add data to the cut
pCut->pOne = Map_CutNotCond( pTemp1, fComp1 );
pCut->pTwo = Map_CutNotCond( pTemp2, fComp2 );
// add it to the corresponding list
pCut->pNext = pLists[pCut->nLeaves];
pLists[pCut->nLeaves] = pCut;
// count this cut and quit if limit is reached
Counter++;
if ( Counter == MAP_CUTS_MAX_COMPUTE )
goto QUITS;
}
QUITS :
// combine all the lists into one
pListNew = NULL;
ppListNew = &pListNew;
for ( i = 1; i <= p->nVarsMax; i++ )
{
if ( pLists[i] == NULL )
continue;
// find the last entry
for ( pPrev = pLists[i], pCut = pPrev->pNext; pCut;
pPrev = pCut, pCut = pCut->pNext );
// connect these lists
*ppListNew = pLists[i];
ppListNew = &pPrev->pNext;
}
*ppListNew = NULL;
// soft the cuts by arrival times and use only the first MAP_CUTS_MAX_USE
pListNew = Map_CutSortCuts( p, pTable, pListNew );
return pListNew;
}
/**Function*************************************************************
Synopsis [Merges two cuts.]
Description [Returns the number of nodes in the resulting cut, or 0 if the
cut is infeasible. Returns the resulting nodes in the array ppNodes[].]
SideEffects []
SeeAlso []
***********************************************************************/
int Map_CutMergeTwo( Map_Cut_t * pCut1, Map_Cut_t * pCut2, Map_Node_t * ppNodes[], int nNodesMax )
{
Map_Node_t * pNodeTemp;
int nTotal, i, k, min, fMismatch;
// check the special case when at least of the cuts is the largest
if ( pCut1->nLeaves == nNodesMax )
{
if ( pCut2->nLeaves == nNodesMax )
{
// return 0 if the cuts are different
for ( i = 0; i < nNodesMax; i++ )
if ( pCut1->ppLeaves[i] != pCut2->ppLeaves[i] )
return 0;
// return nNodesMax if they are the same
for ( i = 0; i < nNodesMax; i++ )
ppNodes[i] = pCut1->ppLeaves[i];
return nNodesMax;
}
else if ( pCut2->nLeaves == nNodesMax - 1 )
{
// return 0 if the cuts are different
fMismatch = 0;
for ( i = 0; i < nNodesMax; i++ )
if ( pCut1->ppLeaves[i] != pCut2->ppLeaves[i - fMismatch] )
{
if ( fMismatch == 1 )
return 0;
fMismatch = 1;
}
// return nNodesMax if they are the same
for ( i = 0; i < nNodesMax; i++ )
ppNodes[i] = pCut1->ppLeaves[i];
return nNodesMax;
}
}
else if ( pCut1->nLeaves == nNodesMax - 1 && pCut2->nLeaves == nNodesMax )
{
// return 0 if the cuts are different
fMismatch = 0;
for ( i = 0; i < nNodesMax; i++ )
if ( pCut1->ppLeaves[i - fMismatch] != pCut2->ppLeaves[i] )
{
if ( fMismatch == 1 )
return 0;
fMismatch = 1;
}
// return nNodesMax if they are the same
for ( i = 0; i < nNodesMax; i++ )
ppNodes[i] = pCut2->ppLeaves[i];
return nNodesMax;
}
// count the number of unique entries in pCut2
nTotal = pCut1->nLeaves;
for ( i = 0; i < pCut2->nLeaves; i++ )
{
// try to find this entry among the leaves of pCut1
for ( k = 0; k < pCut1->nLeaves; k++ )
if ( pCut2->ppLeaves[i] == pCut1->ppLeaves[k] )
break;
if ( k < pCut1->nLeaves ) // found
continue;
// we found a new entry to add
if ( nTotal == nNodesMax )
return 0;
ppNodes[nTotal++] = pCut2->ppLeaves[i];
}
// we know that the feasible cut exists
// add the starting entries
for ( k = 0; k < pCut1->nLeaves; k++ )
ppNodes[k] = pCut1->ppLeaves[k];
// selection-sort the entries
for ( i = 0; i < nTotal - 1; i++ )
{
min = i;
for ( k = i+1; k < nTotal; k++ )
if ( ppNodes[k] < ppNodes[min] )
min = k;
pNodeTemp = ppNodes[i];
ppNodes[i] = ppNodes[min];
ppNodes[min] = pNodeTemp;
}
return nTotal;
}
/**Function*************************************************************
Synopsis [Computes the union of the two lists of cuts.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Map_Cut_t * Map_CutUnionLists( Map_Cut_t * pList1, Map_Cut_t * pList2 )
{
Map_Cut_t * pTemp, * pRoot;
// find the last cut in the first list
pRoot = pList1;
Map_ListForEachCut( pList1, pTemp )
pRoot = pTemp;
// attach the non-trival part of the second cut to the end of the first
assert( pRoot->pNext == NULL );
pRoot->pNext = pList2->pNext;
pList2->pNext = NULL;
return pList1;
}
/**Function*************************************************************
Synopsis [Checks whether the given cut belongs to the list.]
Description [This procedure takes most of the runtime in the cut
computation.]
SideEffects []
SeeAlso []
***********************************************************************/
int Map_CutBelongsToList( Map_Cut_t * pList, Map_Node_t * ppNodes[], int nNodes )
{
Map_Cut_t * pTemp;
int i;
for ( pTemp = pList; pTemp; pTemp = pTemp->pNext )
{
for ( i = 0; i < nNodes; i++ )
if ( pTemp->ppLeaves[i] != ppNodes[i] )
break;
if ( i == nNodes )
return 1;
}
return 0;
}
/**Function*************************************************************
Synopsis [Counts all the cuts.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Map_MappingCountAllCuts( Map_Man_t * pMan )
{
Map_Node_t * pNode;
Map_Cut_t * pCut;
int i, nCuts;
nCuts = 0;
for ( i = 0; i < pMan->nBins; i++ )
for ( pNode = pMan->pBins[i]; pNode; pNode = pNode->pNext )
for ( pCut = pNode->pCuts; pCut; pCut = pCut->pNext )
if ( pCut->nLeaves > 1 ) // skip the elementary cuts
nCuts++;
return nCuts;
}
/**Function*************************************************************
Synopsis [Prints the cuts in the list.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Map_CutListPrint( Map_Man_t * pMan, Map_Node_t * pRoot )
{
Map_Cut_t * pTemp;
int Counter;
for ( Counter = 0, pTemp = pRoot->pCuts; pTemp; pTemp = pTemp->pNext, Counter++ )
{
printf( "%2d : ", Counter + 1 );
Map_CutPrint_( pMan, pTemp, pRoot );
}
}
/**Function*************************************************************
Synopsis [Prints the cuts in the list.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Map_CutListPrint2( Map_Man_t * pMan, Map_Node_t * pRoot )
{
Map_Cut_t * pTemp;
int Counter;
for ( Counter = 0, pTemp = pRoot->pCuts; pTemp; pTemp = pTemp->pNext, Counter++ )
{
printf( "%2d : ", Counter + 1 );
Map_CutPrint_( pMan, pTemp, pRoot );
}
}
/**Function*************************************************************
Synopsis [Prints the cut.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Map_CutPrint_( Map_Man_t * pMan, Map_Cut_t * pCut, Map_Node_t * pRoot )
{
int i;
printf( "(%3d) {", pRoot->Num );
for ( i = 0; i < pMan->nVarsMax; i++ )
if ( pCut->ppLeaves[i] )
printf( " %3d", pCut->ppLeaves[i]->Num );
printf( " }\n" );
}
/**Function*************************************************************
Synopsis [Starts the hash table to canonicize cuts.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Map_CutTable_t * Map_CutTableStart( Map_Man_t * pMan )
{
Map_CutTable_t * p;
// allocate the table
p = ALLOC( Map_CutTable_t, 1 );
memset( p, 0, sizeof(Map_CutTable_t) );
p->nBins = Cudd_Prime( 10 * MAP_CUTS_MAX_COMPUTE );
p->pBins = ALLOC( Map_Cut_t *, p->nBins );
memset( p->pBins, 0, sizeof(Map_Cut_t *) * p->nBins );
p->pCuts = ALLOC( int, 2 * MAP_CUTS_MAX_COMPUTE );
p->pArray = ALLOC( Map_Cut_t *, 2 * MAP_CUTS_MAX_COMPUTE );
p->pCuts1 = ALLOC( Map_Cut_t *, 2 * MAP_CUTS_MAX_COMPUTE );
p->pCuts2 = ALLOC( Map_Cut_t *, 2 * MAP_CUTS_MAX_COMPUTE );
return p;
}
/**Function*************************************************************
Synopsis [Stops the hash table.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Map_CutTableStop( Map_CutTable_t * p )
{
free( p->pCuts1 );
free( p->pCuts2 );
free( p->pArray );
free( p->pBins );
free( p->pCuts );
free( p );
}
/**Function*************************************************************
Synopsis [Computes the hash value of the cut.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
unsigned Map_CutTableHash( Map_Node_t * ppNodes[], int nNodes )
{
unsigned uRes;
int i;
uRes = 0;
for ( i = 0; i < nNodes; i++ )
uRes += s_HashPrimes[i] * ppNodes[i]->Num;
return uRes;
}
/**Function*************************************************************
Synopsis [Looks up the table for the available cut.]
Description [Returns -1 if the same cut is found. Returns the index
of the cell where the cut should be added, if it does not exist.]
SideEffects []
SeeAlso []
***********************************************************************/
int Map_CutTableLookup( Map_CutTable_t * p, Map_Node_t * ppNodes[], int nNodes )
{
Map_Cut_t * pCut;
unsigned Key;
int b, i;
Key = Map_CutTableHash(ppNodes, nNodes) % p->nBins;
for ( b = Key; p->pBins[b]; b = (b+1) % p->nBins )
{
pCut = p->pBins[b];
if ( pCut->nLeaves != nNodes )
continue;
for ( i = 0; i < nNodes; i++ )
if ( pCut->ppLeaves[i] != ppNodes[i] )
break;
if ( i == nNodes )
return -1;
}
return b;
}
/**Function*************************************************************
Synopsis [Starts the hash table to canonicize cuts.]
Description [Considers addition of the cut to the hash table.]
SideEffects []
SeeAlso []
***********************************************************************/
Map_Cut_t * Map_CutTableConsider( Map_Man_t * pMan, Map_CutTable_t * p, Map_Node_t * ppNodes[], int nNodes )
{
Map_Cut_t * pCut;
int Place, i;
// int clk;
// check the cut
Place = Map_CutTableLookup( p, ppNodes, nNodes );
if ( Place == -1 )
return NULL;
assert( nNodes > 0 );
// create the new cut
//clk = clock();
pCut = Map_CutAlloc( pMan );
//pMan->time1 += clock() - clk;
pCut->nLeaves = nNodes;
// pCut->fLevel = 0;
for ( i = 0; i < nNodes; i++ )
{
pCut->ppLeaves[i] = ppNodes[i];
// pCut->fLevel += ppNodes[i]->Level;
}
// pCut->fLevel /= nNodes;
// add the cut to the table
assert( p->pBins[Place] == NULL );
p->pBins[Place] = pCut;
// add the cut to the new list
p->pCuts[ p->nCuts++ ] = Place;
return pCut;
}
/**Function*************************************************************
Synopsis [Prepares the table to be used with other cuts.]
Description [Restarts the table by cleaning the info about cuts stored
when the previous node was considered.]
SideEffects []
SeeAlso []
***********************************************************************/
void Map_CutTableRestart( Map_CutTable_t * p )
{
int i;
for ( i = 0; i < p->nCuts; i++ )
{
assert( p->pBins[ p->pCuts[i] ] );
p->pBins[ p->pCuts[i] ] = NULL;
}
p->nCuts = 0;
}
/**Function*************************************************************
Synopsis [Compares the cuts by the number of leaves and then by delay.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Map_CutSortCutsCompare( Map_Cut_t ** pC1, Map_Cut_t ** pC2 )
{
if ( (*pC1)->nLeaves < (*pC2)->nLeaves )
return -1;
if ( (*pC1)->nLeaves > (*pC2)->nLeaves )
return 1;
/*
if ( (*pC1)->fLevel < (*pC2)->fLevel )
return -1;
if ( (*pC1)->fLevel > (*pC2)->fLevel )
return 1;
*/
return 0;
}
/**Function*************************************************************
Synopsis [Sorts the cuts by average arrival time.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Map_Cut_t * Map_CutSortCuts( Map_Man_t * pMan, Map_CutTable_t * p, Map_Cut_t * pList )
{
Map_Cut_t * pListNew;
int nCuts, i;
// int clk;
// move the cuts from the list into the array
nCuts = Map_CutList2Array( p->pCuts1, pList );
assert( nCuts <= MAP_CUTS_MAX_COMPUTE );
// sort the cuts
//clk = clock();
qsort( (void *)p->pCuts1, nCuts, sizeof(Map_Cut_t *),
(int (*)(const void *, const void *)) Map_CutSortCutsCompare );
//pMan->time2 += clock() - clk;
// move them back into the list
if ( nCuts > MAP_CUTS_MAX_USE - 1 )
{
// free the remaining cuts
for ( i = MAP_CUTS_MAX_USE - 1; i < nCuts; i++ )
Extra_MmFixedEntryRecycle( pMan->mmCuts, (char *)p->pCuts1[i] );
// update the number of cuts
nCuts = MAP_CUTS_MAX_USE - 1;
}
pListNew = Map_CutArray2List( p->pCuts1, nCuts );
return pListNew;
}
/**Function*************************************************************
Synopsis [Moves the nodes from the list into the array.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Map_CutList2Array( Map_Cut_t ** pArray, Map_Cut_t * pList )
{
int i;
for ( i = 0; pList; pList = pList->pNext, i++ )
pArray[i] = pList;
return i;
}
/**Function*************************************************************
Synopsis [Moves the nodes from the array into the list.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Map_Cut_t * Map_CutArray2List( Map_Cut_t ** pArray, int nCuts )
{
Map_Cut_t * pListNew, ** ppListNew;
int i;
pListNew = NULL;
ppListNew = &pListNew;
for ( i = 0; i < nCuts; i++ )
{
// connect these lists
*ppListNew = pArray[i];
ppListNew = &pArray[i]->pNext;
//printf( " %d(%.2f)", pArray[i]->nLeaves, pArray[i]->fLevel );
}
//printf( "\n" );
*ppListNew = NULL;
return pListNew;
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
|