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
|
// Maria vector expression class -*- c++ -*-
#include "snprintf.h"
#ifdef __GNUC__
# pragma implementation
#endif // __GNUC__
#include "VectorExpression.h"
#include "VectorValue.h"
#include "Printer.h"
#include <string.h>
/** @file VectorExpression.C
* Vector constructor
*/
/* 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. */
VectorExpression::VectorExpression (const class VectorType& type) :
Expression (),
myComponents (NULL)
{
assert (type.getSize () > 0);
myComponents = new class Expression*[type.getSize ()];
memset (myComponents, 0, type.getSize () * sizeof *myComponents);
setType (type);
}
VectorExpression::~VectorExpression ()
{
for (card_t i = static_cast<const class VectorType*>(getType ())->getSize ();
i--; )
myComponents[i]->destroy ();
delete[] myComponents;
}
void
VectorExpression::setType (const class Type& type)
{
assert (type.getKind () == Type::tVector);
const class Type& itemType =
static_cast<const class VectorType&>(type).getItemType ();
for (card_t i = static_cast<const class VectorType&>(type).getSize ();
i--; )
if (myComponents[i])
myComponents[i]->setType (itemType);
Expression::setType (type);
}
class Value*
VectorExpression::do_eval (const class Valuation& valuation) const
{
class VectorValue* vector = new class VectorValue (*getType ());
for (card_t i = static_cast<const class VectorType*>(getType ())->getSize ();
i--; ) {
assert (!!myComponents[i]);
if (class Value* v = myComponents[i]->eval (valuation)) {
assert (&v->getType () ==
&static_cast<const class VectorType*>
(getType ())->getItemType ());
(*vector)[i] = v;
}
else {
delete vector;
return NULL;
}
}
return constrain (valuation, vector);
}
class Expression*
VectorExpression::ground (const class Valuation& valuation,
class Transition* transition,
bool declare)
{
bool same = true;
const class VectorType* const type =
static_cast<const class VectorType*>(getType ());
class VectorExpression* expr = new class VectorExpression (*type);
for (card_t i = static_cast<const class VectorType*>(getType ())->getSize ();
i--; ) {
assert (!!myComponents[i]);
class Expression* e =
myComponents[i]->ground (valuation, transition, declare);
if (!e) {
expr->destroy ();
return NULL;
}
assert (valuation.isOK ());
if (e != myComponents[i])
same = false;
expr->myComponents[i] = e;
}
if (same) {
expr->destroy ();
return copy ();
}
return static_cast<class Expression*>(expr)->ground (valuation);
}
class Expression*
VectorExpression::substitute (class Substitution& substitution)
{
bool same = true;
const class VectorType* const type =
static_cast<const class VectorType*>(getType ());
class VectorExpression* expr = new class VectorExpression (*type);
for (card_t i = static_cast<const class VectorType*>(getType ())->getSize ();
i--; ) {
assert (!!myComponents[i]);
class Expression* e = myComponents[i]->substitute (substitution);
if (e != myComponents[i])
same = false;
expr->myComponents[i] = e;
}
if (same) {
expr->destroy ();
return copy ();
}
else
return expr->cse ();
}
bool
VectorExpression::depends (const class VariableSet& vars,
bool complement) const
{
for (card_t i = static_cast<const class VectorType*>(getType ())->getSize ();
i--; ) {
assert (!!myComponents[i]);
if (myComponents[i]->depends (vars, complement))
return true;
}
return false;
}
bool
VectorExpression::forExpressions (bool (*operation)
(const class Expression&,void*),
void* data) const
{
if (!(*operation) (*this, data))
return false;
for (card_t i = static_cast<const class VectorType*>(getType ())->getSize ();
i--; ) {
assert (!!myComponents[i]);
if (!myComponents[i]->forExpressions (operation, data))
return false;
}
return true;
}
bool
VectorExpression::isCompatible (const class Value& value,
const class Valuation& valuation) const
{
assert (value.getKind () == Value::vVector &&
value.getType ().getKind () == Type::tVector);
const class VectorValue& vv = static_cast<const class VectorValue&>(value);
const class VectorType* vt =
static_cast<const class VectorType*>(getType ());
assert (vv.getSize () ==
static_cast<const class VectorType&>(vv.getType ()).getSize ());
if (!vv.getType ().isAssignable (*getType ()))
return false;
for (card_t i = vt->getSize (); i--; )
if (!myComponents[i]->isCompatible (vv[i], valuation))
return false;
return true;
}
void
VectorExpression::getLvalues (const class Value& value,
class Valuation& valuation,
const class VariableSet& vars) const
{
assert (value.getKind () == Value::vVector);
assert (&value.getType () == getType ());
const class VectorValue& vv = static_cast<const class VectorValue&>(value);
for (card_t i = static_cast<const class VectorType*>(getType ())->getSize ();
i--; )
myComponents[i]->getLvalues (vv[i], valuation, vars);
}
void
VectorExpression::getLvalues (const class VariableSet& rvalues,
class VariableSet*& lvalues) const
{
for (card_t i = static_cast<const class VectorType*>(getType ())->getSize ();
i--; )
myComponents[i]->getLvalues (rvalues, lvalues);
}
#ifdef EXPR_COMPILE
# include "CExpression.h"
# include <stdio.h>
void
VectorExpression::compileLvalue (class CExpression& cexpr,
unsigned indent,
const class VariableSet& vars,
const char* lvalue) const
{
assert (!!lvalue);
const size_t len = strlen (lvalue);
char* const newlvalue = new char[len + 25];
char* const suffix = newlvalue + len;
memcpy (newlvalue, lvalue, len);
const card_t size =
static_cast<const class VectorType*>(getType ())->getSize ();
for (card_t i = 0; i < size; i++) {
snprintf (suffix, 25, ".a[%u]", i);
myComponents[i]->compileLvalue (cexpr, indent, vars, newlvalue);
}
delete[] newlvalue;
}
void
VectorExpression::compileCompatible (class CExpression& cexpr,
unsigned indent,
const class VariableSet& vars,
const char* value) const
{
const size_t len = strlen (value);
char* const val = new char[len + 25];
char* const suffix = val + len;
memcpy (val, value, len);
const card_t size =
static_cast<const class VectorType*>(getType ())->getSize ();
for (card_t i = 0; i < size; i++) {
snprintf (suffix, 25, ".a[%u]", i);
myComponents[i]->compileCompatible (cexpr, indent, vars, val);
}
delete[] val;
}
void
VectorExpression::compile (class CExpression& cexpr,
unsigned indent,
const char* lvalue,
const class VariableSet* vars) const
{
size_t len = strlen (lvalue);
char* const newlvalue = new char[len + 25];
char* const suffix = newlvalue + len;
memcpy (newlvalue, lvalue, len);
for (card_t i = 0;
i < static_cast<const class VectorType*>(getType ())->getSize ();
i++) {
snprintf (suffix, 25, ".a[%u]", i);
myComponents[i]->compile (cexpr, indent, newlvalue, vars);
}
delete[] newlvalue;
compileConstraint (cexpr, indent, lvalue);
}
#endif // EXPR_COMPILE
void
VectorExpression::display (const class Printer& printer) const
{
const class VectorType* type =
static_cast<const class VectorType*>(getType ());
printer.delimiter ('{')++;
for (card_t i = 0;;) {
assert (!!myComponents[i]);
myComponents[i]->display (printer);
if (++i == type->getSize ())
break;
printer.delimiter (',');
}
--printer.delimiter ('}');
}
|