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
|
// Marking cardinality/multiplicity expression class -*- c++ -*-
#ifdef __GNUC__
# pragma implementation
#endif // __GNUC__
#include "CardinalityExpression.h"
#include "PlaceMarking.h"
#include "Net.h"
#include "CardType.h"
#include "LeafValue.h"
#include "Valuation.h"
#include "Printer.h"
/** @file CardinalityExpression.C
* Aggregate operations on multi-sets
*/
/* Copyright 1998-2001 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. */
CardinalityExpression::CardinalityExpression (enum Op op,
class Expression& expr) :
Expression (),
myOp (op), myExpr (&expr)
{
assert (myExpr && !myExpr->isTemporal ());
setType (Net::getCardType ());
}
CardinalityExpression::~CardinalityExpression ()
{
myExpr->destroy ();
}
class Value*
CardinalityExpression::do_eval (const class Valuation& valuation) const
{
if (class PlaceMarking* p = myExpr->meval (valuation)) {
card_t count = myOp == cMin ? CARD_T_MAX : 0;
for (PlaceMarking::const_iterator i = p->begin (); i != p->end (); i++) {
card_t add = PlaceMarking::getCount (i);
switch (myOp) {
case cCard:
if (CARD_T_MAX - count < add) {
valuation.flag (errOver, *this);
delete p;
return NULL;
}
else
count += add;
break;
case cMin:
if (count > add) count = add;
break;
case cMax:
if (count < add) count = add;
break;
}
}
delete p;
return constrain (valuation, new class LeafValue (*getType (), count));
}
return NULL;
}
class Expression*
CardinalityExpression::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 CardinalityExpression (myOp, *e))->ground (valuation);
}
class Expression*
CardinalityExpression::substitute (class Substitution& substitution)
{
class Expression* e = myExpr->substitute (substitution);
if (!e)
return NULL;
if (e == myExpr) {
e->destroy ();
return copy ();
}
else
return (new class CardinalityExpression (myOp, *e))->cse ();
}
bool
CardinalityExpression::depends (const class VariableSet& vars,
bool complement) const
{
return myExpr->depends (vars, complement);
}
bool
CardinalityExpression::forExpressions (bool (*operation)
(const class Expression&,void*),
void* data) const
{
return
(*operation) (*this, data) &&
myExpr->forExpressions (operation, data);
}
#ifdef EXPR_COMPILE
# include "CExpression.h"
# include "PlaceContents.h"
# include "Place.h"
void
CardinalityExpression::compile (class CExpression& cexpr,
unsigned indent,
const char* lvalue,
const class VariableSet* vars) const
{
class StringBuffer& out = cexpr.getOut ();
if (myExpr->getKind () == Expression::ePlaceContents) {
const class PlaceContents& p =
*static_cast<const class PlaceContents*>(myExpr);
if (!p.getPlace ().getCapacityBits ()) {
out.indent (indent);
out.append (lvalue);
out.append ("=");
out.append (p.getPlace ().getMaxNumTokens ());
out.append (";\n");
return;
}
if (p.getPlace ().getMaxNumTokens () == 1) {
out.indent (indent);
out.append (lvalue);
out.append ("=");
out.append (cexpr.getMultiset ());
out.append (".p");
out.append (p.getPlace ().getIndex ());
out.append (myOp == cMin ? "?1:UINT_MAX" : "?1:0;\n");
return;
}
}
char* expr;
if (cexpr.getVariable (*myExpr, expr))
myExpr->compileMset (cexpr, indent, 0, expr, vars);
char* iter = cexpr.getLabel ();
out.indent (indent);
out.append ("{\n");
out.indent (indent + 2);
out.append ("register const ");
myExpr->getType ()->appendMSetName (out);
out.append ("* ");
out.append (iter);
out.append (" = ");
out.append (expr);
out.append (";\n");
out.indent (indent + 2);
out.append ("FIRST (");
out.append (iter);
out.append (");\n");
out.indent (indent + 2);
out.append ("for (");
out.append (lvalue);
out.append (myOp == cMin ? "=UINT_MAX; " : "=0; ");
out.append (iter);
out.append ("; ) {\n");
switch (myOp) {
case cCard:
out.indent (indent + 4);
out.append ("if ("), out.append (lvalue), out.append (">UINT_MAX-");
out.append (iter), out.append ("->count)\n");
cexpr.compileError (indent + 6, errOver);
out.indent (indent + 4);
out.append (lvalue);
out.append ("+=");
out.append (iter);
out.append ("->count;\n");
break;
case cMin:
case cMax:
out.indent (indent + 4);
out.append ("if ("), out.append (lvalue);
out.append (myOp == cMin ? ">" : "<");
out.append (iter), out.append ("->count) ");
out.append (lvalue), out.append ("=");
out.append (iter), out.append ("->count;\n");
break;
}
out.indent (indent + 4);
out.append ("NEXT (");
out.append (iter);
out.append (");\n");
out.indent (indent + 2);
out.append ("}\n");
out.indent (indent);
out.append ("}\n");
delete[] iter;
delete[] expr;
compileConstraint (cexpr, indent, lvalue);
}
#endif // EXPR_COMPILE
void
CardinalityExpression::display (const class Printer& printer) const
{
switch (myOp) {
case cCard:
printer.printRaw ("cardinality");
break;
case cMin:
printer.printRaw ("min");
break;
case cMax:
printer.printRaw ("max");
break;
}
printer.delimiter (' ');
if (myExpr->getKind () == Expression::eMarking) {
printer.delimiter ('(')++;
myExpr->display (printer);
--printer.delimiter (')');
}
else
myExpr->display (printer);
}
|