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
|
// Maria union type expression class -*- c++ -*-
#ifdef __GNUC__
# pragma implementation
#endif // __GNUC__
#include "UnionTypeExpression.h"
#include "UnionType.h"
#include "UnionValue.h"
#include "BoolType.h"
#include "LeafValue.h"
#include "Net.h"
#include "Printer.h"
/** @file UnionTypeExpression.C
* Union determinant
*/
/* Copyright 1999-2002 Marko Mkel (msmakela@tcs.hut.fi).
This file is part of MARIA, a reachability analyzer and model checker
for high-level Petri nets.
MARIA is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
MARIA is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
The GNU General Public License is often shipped with GNU software, and
is generally kept in a file called COPYING or LICENSE. If you do not
have a copy of the license, write to the Free Software Foundation,
59 Temple Place, Suite 330, Boston, MA 02111 USA. */
UnionTypeExpression::UnionTypeExpression (class Expression& expr,
card_t i) :
myExpr (&expr), myIndex (i)
{
assert (myExpr && myExpr->getType ());
assert (myExpr->getType ()->getKind () == Type::tUnion);
assert (myExpr->isBasic ());
setType (Net::getBoolType ());
}
UnionTypeExpression::~UnionTypeExpression ()
{
myExpr->destroy ();
}
class Value*
UnionTypeExpression::do_eval (const class Valuation& valuation) const
{
class Value* v = myExpr->eval (valuation);
if (!v)
return NULL;
assert (v->getKind () == Value::vUnion);
bool is = static_cast<class UnionValue*>(v)->getIndex () == myIndex;
delete v;
return constrain (valuation, new class LeafValue (*getType (), is));
}
class Expression*
UnionTypeExpression::ground (const class Valuation& valuation,
class Transition* transition,
bool declare)
{
class Expression* e = myExpr->ground (valuation, transition, declare);
if (!e)
return NULL;
assert (valuation.isOK ());
if (e == myExpr) {
e->destroy ();
return copy ();
}
else
return static_cast<class Expression*>
(new class UnionTypeExpression (*e, myIndex))->ground (valuation);
}
class Expression*
UnionTypeExpression::substitute (class Substitution& substitution)
{
class Expression* e = myExpr->substitute (substitution);
if (e == myExpr) {
e->destroy ();
return copy ();
}
else
return (new class UnionTypeExpression (*e, myIndex))->cse ();
}
bool
UnionTypeExpression::depends (const class VariableSet& vars,
bool complement) const
{
return myExpr->depends (vars, complement);
}
bool
UnionTypeExpression::forVariables (bool (*operation)
(const class Expression&,void*),
void* data) const
{
return myExpr->forVariables (operation, data);
}
#ifdef EXPR_COMPILE
# include "CExpression.h"
void
UnionTypeExpression::compile (class CExpression& cexpr,
unsigned indent,
const char* lvalue,
const class VariableSet* vars) const
{
char* rvalue = 0;
class StringBuffer& out = cexpr.getOut ();
if (cexpr.getVariable (*myExpr, rvalue))
myExpr->compile (cexpr, indent, rvalue, vars);
out.indent (indent);
out.append (lvalue);
out.append ("=");
out.append (rvalue);
out.append (".t==");
out.append (myIndex);
out.append (";\n");
delete[] rvalue;
compileConstraint (cexpr, indent, lvalue);
}
#endif // EXPR_COMPILE
/** Determine whether an expression needs to be enclosed in parentheses
* @param kind kind of the expression
* @return whether parentheses are necessary
*/
inline static bool
needParentheses (enum Expression::Kind kind)
{
switch (kind) {
case Expression::eVariable:
case Expression::eConstant:
case Expression::eUndefined:
case Expression::eStructComponent:
case Expression::eUnionComponent:
case Expression::eVectorIndex:
case Expression::eNot:
case Expression::eTypecast:
case Expression::eUnop:
case Expression::eBufferUnop:
case Expression::eCardinality:
return false;
case Expression::eMarking:
case Expression::eTransitionQualifier:
case Expression::ePlaceContents:
case Expression::eSubmarking:
case Expression::eMapping:
case Expression::eEmptySet:
case Expression::eSet:
case Expression::eTemporalBinop:
case Expression::eTemporalUnop:
case Expression::eBooleanBinop:
case Expression::eUnionType:
case Expression::eBinop:
case Expression::eRelop:
case Expression::eBuffer:
case Expression::eBufferRemove:
case Expression::eBufferWrite:
case Expression::eBufferIndex:
assert (false);
case Expression::eIfThenElse:
case Expression::eStruct:
case Expression::eUnion:
case Expression::eVector:
case Expression::eStructAssign:
case Expression::eVectorAssign:
case Expression::eVectorShift:
break;
}
return true;
}
void
UnionTypeExpression::display (const class Printer& printer) const
{
if (::needParentheses (myExpr->getKind ())) {
printer.delimiter ('(')++;
myExpr->display (printer);
--printer.delimiter (')');
}
else
myExpr->display (printer);
printer.delimiter (' ');
printer.printRaw ("is");
printer.delimiter (' ');
printer.print (static_cast<const class UnionType*>(myExpr->getType ())
->getComponentName (myIndex));
}
|
