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
|
/**CFile****************************************************************
FileName [mvcSort.c]
PackageName [MVSIS 2.0: Multi-valued logic synthesis system.]
Synopsis [Sorting cubes in the cover with the mask.]
Author [MVSIS Group]
Affiliation [uC Berkeley]
Date [Ver. 1.0. Started - February 1, 2003.]
Revision [$Id: mvcSort.c,v 1.5 2003/04/27 01:03:45 wjiang Exp $]
***********************************************************************/
#include "mvc.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
Mvc_Cube_t * Mvc_CoverSort_rec( Mvc_Cube_t * pList, int nItems, Mvc_Cube_t * pMask, int (* pCompareFunc)(Mvc_Cube_t *, Mvc_Cube_t *, Mvc_Cube_t *) );
Mvc_Cube_t * Mvc_CoverSortMerge( Mvc_Cube_t * pList1, Mvc_Cube_t * pList2, Mvc_Cube_t * pMask, int (* pCompareFunc)(Mvc_Cube_t *, Mvc_Cube_t *, Mvc_Cube_t *) );
////////////////////////////////////////////////////////////////////////
/// FuNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Sorts cubes using the given cost function.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Mvc_CoverSort( Mvc_Cover_t * pCover, Mvc_Cube_t * pMask, int (* pCompareFunc)(Mvc_Cube_t *, Mvc_Cube_t *, Mvc_Cube_t *) )
{
Mvc_Cube_t * pHead;
int nCubes;
// one cube does not need sorting
nCubes = Mvc_CoverReadCubeNum(pCover);
if ( nCubes <= 1 )
return;
// sort the cubes
pHead = Mvc_CoverSort_rec( Mvc_CoverReadCubeHead(pCover), nCubes, pMask, pCompareFunc );
// insert the sorted list into the cover
Mvc_CoverSetCubeHead( pCover, pHead );
Mvc_CoverSetCubeTail( pCover, Mvc_ListGetTailFromHead(pHead) );
// make sure that the list is sorted in the increasing order
assert( pCompareFunc( Mvc_CoverReadCubeHead(pCover), Mvc_CoverReadCubeTail(pCover), pMask ) <= 0 );
}
/**Function*************************************************************
Synopsis [Recursive part of Mvc_CoverSort()]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Mvc_Cube_t * Mvc_CoverSort_rec( Mvc_Cube_t * pList, int nItems, Mvc_Cube_t * pMask, int (* pCompareFunc)(Mvc_Cube_t *, Mvc_Cube_t *, Mvc_Cube_t *) )
{
Mvc_Cube_t * pList1, * pList2;
int nItems1, nItems2, i;
// trivial case
if ( nItems == 1 )
{
Mvc_CubeSetNext( pList, NULL );
return pList;
}
// select the new sizes
nItems1 = nItems/2;
nItems2 = nItems - nItems1;
// set the new beginnings
pList1 = pList2 = pList;
for ( i = 0; i < nItems1; i++ )
pList2 = Mvc_CubeReadNext( pList2 );
// solve recursively
pList1 = Mvc_CoverSort_rec( pList1, nItems1, pMask, pCompareFunc );
pList2 = Mvc_CoverSort_rec( pList2, nItems2, pMask, pCompareFunc );
// merge
return Mvc_CoverSortMerge( pList1, pList2, pMask, pCompareFunc );
}
/**Function*************************************************************
Synopsis [Merges two NULL-terminated linked lists.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Mvc_Cube_t * Mvc_CoverSortMerge( Mvc_Cube_t * pList1, Mvc_Cube_t * pList2, Mvc_Cube_t * pMask, int (* pCompareFunc)(Mvc_Cube_t *, Mvc_Cube_t *, Mvc_Cube_t *) )
{
Mvc_Cube_t * pList = NULL, ** ppTail = &pList;
Mvc_Cube_t * pCube;
while ( pList1 && pList2 )
{
if ( pCompareFunc( pList1, pList2, pMask ) < 0 )
{
pCube = pList1;
pList1 = Mvc_CubeReadNext(pList1);
}
else
{
pCube = pList2;
pList2 = Mvc_CubeReadNext(pList2);
}
*ppTail = pCube;
ppTail = Mvc_CubeReadNextP(pCube);
}
*ppTail = pList1? pList1: pList2;
return pList;
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
