File: BufferValue.C

package info (click to toggle)
maria 1.3.5-6
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 4,068 kB
  • sloc: cpp: 43,408; yacc: 8,080; ansic: 436; sh: 404; lisp: 395; makefile: 228; perl: 21
file content (430 lines) | stat: -rw-r--r-- 11,192 bytes parent folder | download | duplicates (6)
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
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
// Buffer value class -*- c++ -*-

#include "snprintf.h"

#ifdef __GNUC__
# pragma implementation
#endif // __GNUC__
#include "BufferValue.h"
#include "BufferType.h"
#include "Constraint.h"

/** @file BufferValue.C
 * The contents of a queue or stack
 */

/* 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. */

BufferValue::BufferValue (const class Type& type) :
  Value (type),
  myComponents (static_cast<const class BufferType&>(type).getSize ())
{
  assert (getType ().getKind () == Type::tBuffer);
}

BufferValue::BufferValue (const class BufferValue& old) :
  Value (old.getType ()),
  myComponents (old.myComponents)
{
  assert (getType ().getKind () == Type::tBuffer);
}

BufferValue::~BufferValue ()
{
}

bool
BufferValue::operator< (const class BufferValue& other) const
{
  assert (other.myComponents.getSize () == myComponents.getSize ());

  card_t size = getCapacity (), osize = other.getCapacity ();
  if (size < osize)
    return true;
  else if (osize < size)
    return false;

  while (size--)
    if (*myComponents[size] < *other.myComponents[size])
      return true;
    else if (*other.myComponents[size] < *myComponents[size])
      return false;

  return false;
}

bool
BufferValue::operator== (const class BufferValue& other) const
{
  assert (other.myComponents.getSize () == myComponents.getSize ());

  for (card_t i = 0; i < myComponents.getSize (); i++) {
    if (!myComponents[i])
      return !other.myComponents[i];
    if (!other.myComponents[i] ||
	!(*myComponents[i] == *other.myComponents[i]))
      return false;
  }

  return true;
}

card_t
BufferValue::operator- (const class BufferValue& other) const
{
  if (!getSize ())
    return 0;

  const class Type& itemType =
    static_cast<const class BufferType&>(getType ()).getItemType ();
  card_t numItemValues = itemType.getNumValues ();
  card_t offset = 0, i = 0;
  for (card_t mult = 1; i < getSize () && myComponents[i];
       mult *= numItemValues, i++)
    if (!other.myComponents[i])
      offset += mult;
  assert (i == getSize () || !other.myComponents[i]);

  card_t diff = 0;
  while (i--) {
    diff *= numItemValues;
    if (!other.myComponents[i])
      diff += itemType.convert (*myComponents[i]);
    else if (*other.myComponents[i] < *myComponents[i])
      diff += *myComponents[i] - *other.myComponents[i];
    else
      diff -= *other.myComponents[i] - *myComponents[i];
  }
  return diff + offset;
}

void
BufferValue::bottom ()
{
  assert (getSize () ==
	  static_cast<const class BufferType&>(getType ()).getSize ());

  if (const class Constraint* c = getType ().getConstraint ()) {
    const class Value& v = c->getFirstValue ();
    assert (&v.getType () == &getType () && v.getKind () == getKind ());
    const class BufferValue& bv = static_cast<const class BufferValue&>(v);

    for (card_t i = getSize (); i--; ) {
      delete myComponents[i];
      myComponents[i] = bv[i] ? bv[i]->copy () : NULL;
    }

    return;
  }

  for (card_t i = 0; i < getSize (); i++)
    delete myComponents[i], myComponents[i] = NULL;
}

void
BufferValue::top ()
{
  assert (getSize () ==
	  static_cast<const class BufferType&>(getType ()).getSize ());

  if (const class Constraint* c = getType ().getConstraint ()) {
    const class Value& v = c->getLastValue ();
    assert (&v.getType () == &getType () && v.getKind () == getKind ());
    const class BufferValue& bv = static_cast<const class BufferValue&>(v);

    for (card_t i = getSize (); i--; ) {
      delete myComponents[i];
      myComponents[i] = bv[i] ? bv[i]->copy () : NULL;
    }

    return;
  }

  for (card_t i = 0; i < getSize (); i++)
    delete myComponents[i], myComponents[i] =
      &static_cast<const class BufferType&>(getType ()).getItemType ()
      .getLastValue ();
}

bool
BufferValue::increment ()
{
  assert (getSize () ==
	  static_cast<const class BufferType&>(getType ()).getSize ());

  if (const class Constraint* c = getType ().getConstraint ()) {
    const class Value* v = &c->getNextHigh (*this);
    assert (&v->getType () == &getType () && v->getKind () == getKind ());
    if (*this == *static_cast<const class BufferValue*>(v)) {
      if (!(v = c->getNextLow (*this))) {
	bottom ();
	return false;
      }
      assert (&v->getType () == &getType () && v->getKind () == getKind ());
      const class BufferValue& bv = *static_cast<const class BufferValue*>(v);
      for (card_t i = getSize (); i--; ) {
	delete myComponents[i];
	myComponents[i] = bv[i] ? bv[i]->copy () : NULL;
      }
      return true;
    }
  }

  for (card_t i = 0; i < getSize (); i++) {
    if (!myComponents[i]) {
      myComponents[i] =
	&static_cast<const class BufferType&>(getType ()).getItemType ()
	.getFirstValue ();
      return true;
    }

    if (myComponents[i]->increment ())
      return true;
  }

  bottom ();
  return false;
}

bool
BufferValue::decrement ()
{
  assert (getSize () ==
	  static_cast<const class BufferType&>(getType ()).getSize ());

  if (const class Constraint* c = getType ().getConstraint ()) {
    const class Value* v = &c->getPrevLow (*this);
    assert (&v->getType () == &getType () && v->getKind () == getKind ());
    if (*this == *static_cast<const class BufferValue*>(v)) {
      if (!(v = c->getPrevHigh (*this))) {
	top ();
	return false;
      }
      assert (&v->getType () == &getType () && v->getKind () == getKind ());
      const class BufferValue& bv = *static_cast<const class BufferValue*>(v);
      for (card_t i = getSize (); i--; ) {
	delete myComponents[i];
	myComponents[i] = bv[i] ? bv[i]->copy () : NULL;
      }
      return true;
    }
  }

  card_t i;
  for (i = 0; i < getSize (); i++)
    if (!myComponents[i])
      break;
    else if (myComponents[i]->decrement ())
      return true;

  if (i--) {
    delete myComponents[i];
    myComponents[i] = NULL;
    return true;
  }
  else {
    top ();
    return false;
  }
}

class Value*
BufferValue::cast (const class Type& type)
{
  assert (getType ().isAssignable (type));
  if (&type == &getType () || type.getKind () != Type::tBuffer)
    return Value::cast (type);
  const class BufferType& bt = static_cast<const class BufferType&>(type);
  const class Type& itemType = bt.getItemType ();

  card_t i;
  for (i = 0; i < getSize () && (*this)[i]; i++);

  if (i > bt.getSize ()) {
    delete this;
    return NULL;
  }

  class BufferValue* value = new class BufferValue (type);
  for (i = 0; i < getSize () && (*this)[i]; i++)
    (*value)[i] = (*this)[i], (*this)[i] = NULL;
  delete this;

  while (i--) {
    if (!((*value)[i] = (*value)[i]->cast (itemType))) {
      delete value;
      return NULL;
    }
  }
  return value->cast (type);
}

#include "Printer.h"

void
BufferValue::display (const class Printer& printer) const
{
  printer.delimiter ('{')++;
  for (card_t i = 0; myComponents[i]; ) {
    myComponents[i]->display (printer);
    if (++i == getSize () || !myComponents[i])
      break;
    else
      printer.delimiter (',');
  }
  printer--.delimiter ('}');
}

#ifdef EXPR_COMPILE
# include "StringBuffer.h"
# include <stdio.h>

/** maximum length of a 64-bit index value, plus delimiters */
static const size_t ixlength = 25;

void
BufferValue::compile (class StringBuffer&) const
{
  assert (false);
}

void
BufferValue::compileInit (const char* name,
			  unsigned indent,
			  class StringBuffer& out) const
{
  /** length of the supplied name string */
  size_t length = strlen (name);
  /** an extended name */
  char* ixname = new char[length + ixlength];
  memcpy (ixname, name, length);

  out.indent (indent);
  out.append (name);
  out.append (".s=");
  out.append (getCapacity ());
  out.append (indent ? ";\n" : ", ");

  // initialized buffer items
  for (card_t i = 0; i < getSize () && myComponents[i]; ) {
    snprintf (ixname + length, ixlength, ".a[%u]", i);
    myComponents[i++]->compileInit (ixname, indent, out);
    if (i < getSize () && myComponents[i] && !indent) out.append (", ");
  }

  delete[] ixname;
}

bool
BufferValue::compileEqual (class StringBuffer& out,
			   unsigned indent,
			   const char* var,
			   bool equal,
			   bool first,
			   bool last) const
{
  /** length of the supplied name string */
  size_t length = strlen (var);
  /** an extended name */
  char* ixname = new char[length + ixlength];
  memcpy (ixname, var, length);
  /** length of the buffer value */
  card_t capacity = getCapacity ();

  if (!first)
    out.indent (indent);
  out.append (var);
  out.append (".s");
  out.append (equal ? "==" : "!=");
  out.append (capacity);
  if (capacity)
    out.append (equal ? "&&\n" : "||\n");

  // initialized buffer items
  for (card_t i = capacity; i--; ) {
    snprintf (ixname + length, ixlength, ".a[%u]", i);
    myComponents[i]->compileEqual (out, indent, ixname, equal, false, !i);
  }

  if (!last)
    out.append (equal ? "&&\n" : "||\n");

  delete[] ixname;
  return true;
}

unsigned
BufferValue::compileOrder (class StringBuffer& out,
			   unsigned indent,
			   const char* var,
			   bool less,
			   bool equal,
			   bool first,
			   bool last) const
{
  assert (!equal || last);
  /** length of the supplied name string */
  size_t length = strlen (var);
  /** an extended name */
  char* ixname = new char[length + ixlength];
  memcpy (ixname, var, length);
  /** length of the buffer value */
  card_t capacity = getCapacity ();

  if (!first)
    out.indent (indent);
  out.openParen (1);
  out.append (var);
  out.append (less ? ".s<" : ".s>");
  out.append (capacity);
  out.append ("||\n");
  out.indent (indent + 1);
  out.openParen (1);
  out.append (var);
  out.append (".s==");
  out.append (capacity);
  if (capacity)
    out.append ("&&\n");

  /** number of opened parentheses */
  unsigned opened = 2;

  // initialized buffer items
  for (card_t i = capacity; i--; ) {
    snprintf (ixname + length, ixlength, ".a[%u]", i);
    if (i) {
      opened += myComponents[i]->compileOrder (out, indent + opened, ixname,
					       less, false, false, false);
      myComponents[i]->compileEqual (out, indent + opened, ixname,
				     true, false, false);
    }
    else
      opened += myComponents[i]->compileOrder (out, indent + opened, ixname,
					       less, equal, false, true);
  }
  out.closeParen (opened);
  if (!last)
    out.append ("||\n");
  delete[] ixname;
  return 0;
}

#endif // EXPR_COMPILE