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
|
/**CFile****************************************************************
FileName [msatQueue.c]
PackageName [A C version of SAT solver MINISAT, originally developed
in C++ by Niklas Een and Niklas Sorensson, Chalmers University of
Technology, Sweden: http://www.cs.chalmers.se/~een/Satzoo.]
Synopsis [The manager of the assignment propagation queue.]
Author [Alan Mishchenko <alanmi@eecs.berkeley.edu>]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - January 1, 2004.]
Revision [$Id: msatQueue.c,v 1.0 2004/01/01 1:00:00 alanmi Exp $]
***********************************************************************/
#include "msatInt.h"
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
struct Msat_Queue_t_
{
int nVars;
int * pVars;
int iFirst;
int iLast;
};
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis [Allocates the variable propagation queue.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
Msat_Queue_t * Msat_QueueAlloc( int nVars )
{
Msat_Queue_t * p;
p = ALLOC( Msat_Queue_t, 1 );
memset( p, 0, sizeof(Msat_Queue_t) );
p->nVars = nVars;
p->pVars = ALLOC( int, nVars );
return p;
}
/**Function*************************************************************
Synopsis [Deallocate the variable propagation queue.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Msat_QueueFree( Msat_Queue_t * p )
{
free( p->pVars );
free( p );
}
/**Function*************************************************************
Synopsis [Reads the queue size.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Msat_QueueReadSize( Msat_Queue_t * p )
{
return p->iLast - p->iFirst;
}
/**Function*************************************************************
Synopsis [Insert an entry into the queue.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Msat_QueueInsert( Msat_Queue_t * p, int Lit )
{
if ( p->iLast == p->nVars )
{
int i;
assert( 0 );
for ( i = 0; i < p->iLast; i++ )
printf( "entry = %2d lit = %2d var = %2d \n", i, p->pVars[i], p->pVars[i]/2 );
}
assert( p->iLast < p->nVars );
p->pVars[p->iLast++] = Lit;
}
/**Function*************************************************************
Synopsis [Extracts an entry from the queue.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int Msat_QueueExtract( Msat_Queue_t * p )
{
if ( p->iFirst == p->iLast )
return -1;
return p->pVars[p->iFirst++];
}
/**Function*************************************************************
Synopsis [Resets the queue.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Msat_QueueClear( Msat_Queue_t * p )
{
p->iFirst = 0;
p->iLast = 0;
}
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
|
