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
|
// Buffer for packing bits and values -*- c++ -*-
#ifdef __GNUC__
# pragma implementation
#endif // __GNUC__
#include "BitBuffer.h"
#include "StructValue.h"
#include "StructType.h"
#include "UnionValue.h"
#include "UnionType.h"
#include "VectorValue.h"
#include "VectorType.h"
#include "BufferValue.h"
#include "BufferType.h"
#include "LeafValue.h"
/** @file BitBuffer.C
* Encoding and decoding numbers and values in bit strings
*/
/* 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. */
void
BitPacker::append (const class Value& value)
{
card_t numValues = value.getType ().getNumValues ();
assert (numValues);
if (numValues == 1)
return;
if (numValues < CARD_T_MAX)
append (value.getType ().convert (value), log2 (numValues));
else {
switch (value.getKind ()) {
case Value::vStruct:
{
const class StructValue& s =
static_cast<const class StructValue&>(value);
for (unsigned i = 0; i < s.getSize (); i++)
append (s[i]);
}
break;
case Value::vUnion:
{
const class UnionValue& u =
static_cast<const class UnionValue&>(value);
if (unsigned bits = log2 (static_cast<const class UnionType&>
(u.getType ()).getSize ()))
append (u.getIndex (), bits);
append (u.getValue ());
}
break;
case Value::vVector:
{
const class VectorValue& v =
static_cast<const class VectorValue&>(value);
for (unsigned i = 0; i < v.getSize (); i++)
append (v[i]);
}
break;
case Value::vBuffer:
{
const class BufferValue& b =
static_cast<const class BufferValue&>(value);
card_t i = b.getCapacity ();
append (i, log2 (static_cast<const class BufferType&>(b.getType ())
.getSize () + 1));
while (i--)
append (*b[i]);
}
break;
case Value::vLeaf:
append (card_t (static_cast<const class LeafValue&>(value)), CARD_T_BIT);
break;
}
}
}
class Value*
BitUnpacker::extract (const class Type& type)
{
card_t numValues = type.getNumValues ();
assert (numValues);
if (numValues == 1)
return type.convert (card_t (0));
if (numValues < CARD_T_MAX)
return type.convert (extract (log2 (numValues)));
else {
switch (type.getKind ()) {
case Type::tStruct:
{
const class StructType& s =
static_cast<const class StructType&>(type);
class StructValue* sv = new class StructValue (type);
for (unsigned i = 0; i < s.getSize (); i++)
(*sv)[i] = extract (s[i]);
return sv;
}
case Type::tUnion:
{
const class UnionType& u =
static_cast<const class UnionType&>(type);
card_t i = u.getSize () > 1 ? extract (log2 (u.getSize ())) : 0;
return new class UnionValue (type, i, *extract (u[i]));
}
case Type::tVector:
{
const class VectorType& v =
static_cast<const class VectorType&>(type);
class VectorValue* vv = new class VectorValue (type);
for (unsigned i = 0; i < v.getSize (); i++)
(*vv)[i] = extract (v.getItemType ());
return vv;
}
case Type::tBuffer:
{
const class BufferType& b =
static_cast<const class BufferType&>(type);
class BufferValue* bv = new class BufferValue (type);
for (card_t i = extract (log2 (b.getSize () + 1)); i--; )
(*bv)[i] = extract (b.getItemType ());
return bv;
}
default:
return new class LeafValue (type, extract (CARD_T_BIT));
}
}
}
|
