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
|
/*
* Copyright 2001-2006 Adrian Thurston <thurston@cs.queensu.ca>
*/
/* This file is part of Ragel.
*
* Ragel 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 of the License, or
* (at your option) any later version.
*
* Ragel 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.
*
* You should have received a copy of the GNU General Public License
* along with Ragel; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef _COMMON_H
#define _COMMON_H
#include <fstream>
#include <climits>
#include "dlist.h"
typedef unsigned long long Size;
struct Key
{
private:
long key;
public:
friend inline Key operator+(const Key key1, const Key key2);
friend inline Key operator-(const Key key1, const Key key2);
friend inline Key operator/(const Key key1, const Key key2);
friend inline long operator&(const Key key1, const Key key2);
friend inline bool operator<( const Key key1, const Key key2 );
friend inline bool operator<=( const Key key1, const Key key2 );
friend inline bool operator>( const Key key1, const Key key2 );
friend inline bool operator>=( const Key key1, const Key key2 );
friend inline bool operator==( const Key key1, const Key key2 );
friend inline bool operator!=( const Key key1, const Key key2 );
friend struct KeyOps;
Key( ) {}
Key( const Key &key ) : key(key.key) {}
Key( long key ) : key(key) {}
/* Returns the value used to represent the key. This value must be
* interpreted based on signedness. */
long getVal() const { return key; };
/* Returns the key casted to a long long. This form of the key does not
* require and signedness interpretation. */
long long getLongLong() const;
bool isUpper() const { return ( 'A' <= key && key <= 'Z' ); }
bool isLower() const { return ( 'a' <= key && key <= 'z' ); }
bool isPrintable() const
{
return ( 7 <= key && key <= 13 ) || ( 32 <= key && key < 127 );
}
Key toUpper() const
{ return Key( 'A' + ( key - 'a' ) ); }
Key toLower() const
{ return Key( 'a' + ( key - 'A' ) ); }
void operator+=( const Key other )
{
/* FIXME: must be made aware of isSigned. */
key += other.key;
}
void operator-=( const Key other )
{
/* FIXME: must be made aware of isSigned. */
key -= other.key;
}
void operator|=( const Key other )
{
/* FIXME: must be made aware of isSigned. */
key |= other.key;
}
/* Decrement. Needed only for ranges. */
inline void decrement();
inline void increment();
};
struct HostType
{
const char *data1;
const char *data2;
bool isSigned;
long long minVal;
long long maxVal;
unsigned int size;
};
struct HostLang
{
HostType *hostTypes;
int numHostTypes;
HostType *defaultAlphType;
bool explicitUnsigned;
};
/* Target language. */
enum HostLangType
{
CCode,
DCode,
JavaCode,
RubyCode
};
extern HostLang *hostLang;
extern HostLangType hostLangType;
extern HostLang hostLangC;
extern HostLang hostLangD;
extern HostLang hostLangJava;
extern HostLang hostLangRuby;
/* An abstraction of the key operators that manages key operations such as
* comparison and increment according the signedness of the key. */
struct KeyOps
{
/* Default to signed alphabet. */
KeyOps() :
isSigned(true),
alphType(0)
{}
/* Default to signed alphabet. */
KeyOps( bool isSigned )
:isSigned(isSigned) {}
bool isSigned;
Key minKey, maxKey;
HostType *alphType;
void setAlphType( HostType *alphType )
{
this->alphType = alphType;
isSigned = alphType->isSigned;
if ( isSigned ) {
minKey = (long) alphType->minVal;
maxKey = (long) alphType->maxVal;
}
else {
minKey = (long) (unsigned long) alphType->minVal;
maxKey = (long) (unsigned long) alphType->maxVal;
}
}
/* Compute the distance between two keys. */
Size span( Key key1, Key key2 )
{
return isSigned ?
(unsigned long long)(
(long long)key2.key -
(long long)key1.key + 1) :
(unsigned long long)(
(unsigned long)key2.key) -
(unsigned long long)((unsigned long)key1.key) + 1;
}
Size alphSize()
{ return span( minKey, maxKey ); }
HostType *typeSubsumes( long long maxVal )
{
for ( int i = 0; i < hostLang->numHostTypes; i++ ) {
if ( maxVal <= hostLang->hostTypes[i].maxVal )
return hostLang->hostTypes + i;
}
return 0;
}
HostType *typeSubsumes( bool isSigned, long long maxVal )
{
for ( int i = 0; i < hostLang->numHostTypes; i++ ) {
if ( ( isSigned == hostLang->hostTypes[i].isSigned ) &&
maxVal <= hostLang->hostTypes[i].maxVal )
return hostLang->hostTypes + i;
}
return 0;
}
};
extern KeyOps *keyOps;
inline bool operator<( const Key key1, const Key key2 )
{
return keyOps->isSigned ? key1.key < key2.key :
(unsigned long)key1.key < (unsigned long)key2.key;
}
inline bool operator<=( const Key key1, const Key key2 )
{
return keyOps->isSigned ? key1.key <= key2.key :
(unsigned long)key1.key <= (unsigned long)key2.key;
}
inline bool operator>( const Key key1, const Key key2 )
{
return keyOps->isSigned ? key1.key > key2.key :
(unsigned long)key1.key > (unsigned long)key2.key;
}
inline bool operator>=( const Key key1, const Key key2 )
{
return keyOps->isSigned ? key1.key >= key2.key :
(unsigned long)key1.key >= (unsigned long)key2.key;
}
inline bool operator==( const Key key1, const Key key2 )
{
return key1.key == key2.key;
}
inline bool operator!=( const Key key1, const Key key2 )
{
return key1.key != key2.key;
}
/* Decrement. Needed only for ranges. */
inline void Key::decrement()
{
key = keyOps->isSigned ? key - 1 : ((unsigned long)key)-1;
}
/* Increment. Needed only for ranges. */
inline void Key::increment()
{
key = keyOps->isSigned ? key+1 : ((unsigned long)key)+1;
}
inline long long Key::getLongLong() const
{
return keyOps->isSigned ? (long long)key : (long long)(unsigned long)key;
}
inline Key operator+(const Key key1, const Key key2)
{
/* FIXME: must be made aware of isSigned. */
return Key( key1.key + key2.key );
}
inline Key operator-(const Key key1, const Key key2)
{
/* FIXME: must be made aware of isSigned. */
return Key( key1.key - key2.key );
}
inline long operator&(const Key key1, const Key key2)
{
/* FIXME: must be made aware of isSigned. */
return key1.key & key2.key;
}
inline Key operator/(const Key key1, const Key key2)
{
/* FIXME: must be made aware of isSigned. */
return key1.key / key2.key;
}
/* Filter on the output stream that keeps track of the number of lines
* output. */
class output_filter : public std::filebuf
{
public:
output_filter( char *fileName ) : fileName(fileName), line(1) { }
virtual int sync();
virtual std::streamsize xsputn(const char* s, std::streamsize n);
char *fileName;
int line;
};
char *findFileExtension( char *stemFile );
char *fileNameFromStem( char *stemFile, const char *suffix );
struct Export
{
Export(const char *name, Key key )
: name(name), key(key) {}
const char *name;
Key key;
Export *prev, *next;
};
typedef DList<Export> ExportList;
#endif /* _COMMON_H */
|
