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
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
|
/*
* Copyright 2001-2006 Adrian Thurston <thurston@cs.queensu.ca>
* 2004 Erich Ocean <eric.ocean@ampede.com>
* 2005 Alan West <alan@alanz.com>
*/
/* 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
*/
#include "rlgen-cd.h"
#include "fsmcodegen.h"
#include "redfsm.h"
#include "gendata.h"
#include <sstream>
#include <string>
#include <assert.h>
using std::ostream;
using std::ostringstream;
using std::string;
using std::cerr;
using std::endl;
void lineDirective( ostream &out, char *fileName, int line )
{
if ( noLineDirectives )
out << "/* ";
/* Write the preprocessor line info for to the input file. */
out << "#line " << line << " \"";
for ( char *pc = fileName; *pc != 0; pc++ ) {
if ( *pc == '\\' )
out << "\\\\";
else
out << *pc;
}
out << '"';
if ( noLineDirectives )
out << " */";
out << '\n';
}
void genLineDirective( ostream &out )
{
std::streambuf *sbuf = out.rdbuf();
output_filter *filter = static_cast<output_filter*>(sbuf);
lineDirective( out, filter->fileName, filter->line + 1 );
}
/* Init code gen with in parameters. */
FsmCodeGen::FsmCodeGen( ostream &out )
:
CodeGenData(out)
{
}
unsigned int FsmCodeGen::arrayTypeSize( unsigned long maxVal )
{
long long maxValLL = (long long) maxVal;
HostType *arrayType = keyOps->typeSubsumes( maxValLL );
assert( arrayType != 0 );
return arrayType->size;
}
string FsmCodeGen::ARRAY_TYPE( unsigned long maxVal )
{
long long maxValLL = (long long) maxVal;
HostType *arrayType = keyOps->typeSubsumes( maxValLL );
assert( arrayType != 0 );
string ret = arrayType->data1;
if ( arrayType->data2 != 0 ) {
ret += " ";
ret += arrayType->data2;
}
return ret;
}
/* Write out the fsm name. */
string FsmCodeGen::FSM_NAME()
{
return fsmName;
}
/* Emit the offset of the start state as a decimal integer. */
string FsmCodeGen::START_STATE_ID()
{
ostringstream ret;
ret << redFsm->startState->id;
return ret.str();
};
/* Write out the array of actions. */
std::ostream &FsmCodeGen::ACTIONS_ARRAY()
{
out << "\t0, ";
int totalActions = 1;
for ( ActionTableMap::Iter act = redFsm->actionMap; act.lte(); act++ ) {
/* Write out the length, which will never be the last character. */
out << act->key.length() << ", ";
/* Put in a line break every 8 */
if ( totalActions++ % 8 == 7 )
out << "\n\t";
for ( ActionTable::Iter item = act->key; item.lte(); item++ ) {
out << item->value->actionId;
if ( ! (act.last() && item.last()) )
out << ", ";
/* Put in a line break every 8 */
if ( totalActions++ % 8 == 7 )
out << "\n\t";
}
}
out << "\n";
return out;
}
string FsmCodeGen::CS()
{
ostringstream ret;
if ( curStateExpr != 0 ) {
/* Emit the user supplied method of retrieving the key. */
ret << "(";
INLINE_LIST( ret, curStateExpr, 0, false );
ret << ")";
}
else {
/* Expression for retrieving the key, use simple dereference. */
ret << ACCESS() << "cs";
}
return ret.str();
}
string FsmCodeGen::ACCESS()
{
ostringstream ret;
if ( accessExpr != 0 )
INLINE_LIST( ret, accessExpr, 0, false );
return ret.str();
}
string FsmCodeGen::GET_WIDE_KEY()
{
if ( redFsm->anyConditions() )
return "_widec";
else
return GET_KEY();
}
string FsmCodeGen::GET_WIDE_KEY( RedStateAp *state )
{
if ( state->stateCondList.length() > 0 )
return "_widec";
else
return GET_KEY();
}
string FsmCodeGen::GET_KEY()
{
ostringstream ret;
if ( getKeyExpr != 0 ) {
/* Emit the user supplied method of retrieving the key. */
ret << "(";
INLINE_LIST( ret, getKeyExpr, 0, false );
ret << ")";
}
else {
/* Expression for retrieving the key, use simple dereference. */
ret << "(*" << P() << ")";
}
return ret.str();
}
/* Write out level number of tabs. Makes the nested binary search nice
* looking. */
string FsmCodeGen::TABS( int level )
{
string result;
while ( level-- > 0 )
result += "\t";
return result;
}
/* Write out a key from the fsm code gen. Depends on wether or not the key is
* signed. */
string FsmCodeGen::KEY( Key key )
{
ostringstream ret;
if ( keyOps->isSigned || !hostLang->explicitUnsigned )
ret << key.getVal();
else
ret << (unsigned long) key.getVal() << 'u';
return ret.str();
}
void FsmCodeGen::EXEC( ostream &ret, InlineItem *item, int targState, int inFinish )
{
/* The parser gives fexec two children. The double brackets are for D
* code. If the inline list is a single word it will get interpreted as a
* C-style cast by the D compiler. */
ret << "{" << P() << " = ((";
INLINE_LIST( ret, item->children, targState, inFinish );
ret << "))-1;}";
}
void FsmCodeGen::EXECTE( ostream &ret, InlineItem *item, int targState, int inFinish )
{
/* Tokend version of exec. */
/* The parser gives fexec two children. The double brackets are for D
* code. If the inline list is a single word it will get interpreted as a
* C-style cast by the D compiler. */
ret << "{" << TOKEND() << " = ((";
INLINE_LIST( ret, item->children, targState, inFinish );
ret << "));}";
}
void FsmCodeGen::LM_SWITCH( ostream &ret, InlineItem *item,
int targState, int inFinish )
{
ret <<
" switch( " << ACT() << " ) {\n";
/* If the switch handles error then we also forced the error state. It
* will exist. */
if ( item->handlesError ) {
ret << " case 0: " << TOKEND() << " = " << TOKSTART() << "; ";
GOTO( ret, redFsm->errState->id, inFinish );
ret << "\n";
}
for ( InlineList::Iter lma = *item->children; lma.lte(); lma++ ) {
/* Write the case label, the action and the case break. */
ret << " case " << lma->lmId << ":\n";
/* Write the block and close it off. */
ret << " {";
INLINE_LIST( ret, lma->children, targState, inFinish );
ret << "}\n";
ret << " break;\n";
}
/* Default required for D code. */
ret <<
" default: break;\n"
" }\n"
"\t";
}
void FsmCodeGen::SET_ACT( ostream &ret, InlineItem *item )
{
ret << ACT() << " = " << item->lmId << ";";
}
void FsmCodeGen::SET_TOKEND( ostream &ret, InlineItem *item )
{
/* The tokend action sets tokend. */
ret << TOKEND() << " = " << P();
if ( item->offset != 0 )
out << "+" << item->offset;
out << ";";
}
void FsmCodeGen::GET_TOKEND( ostream &ret, InlineItem *item )
{
ret << TOKEND();
}
void FsmCodeGen::INIT_TOKSTART( ostream &ret, InlineItem *item )
{
ret << TOKSTART() << " = " << NULL_ITEM() << ";";
}
void FsmCodeGen::INIT_ACT( ostream &ret, InlineItem *item )
{
ret << ACT() << " = 0;";
}
void FsmCodeGen::SET_TOKSTART( ostream &ret, InlineItem *item )
{
ret << TOKSTART() << " = " << P() << ";";
}
void FsmCodeGen::SUB_ACTION( ostream &ret, InlineItem *item,
int targState, bool inFinish )
{
if ( item->children->length() > 0 ) {
/* Write the block and close it off. */
ret << "{";
INLINE_LIST( ret, item->children, targState, inFinish );
ret << "}";
}
}
/* Write out an inline tree structure. Walks the list and possibly calls out
* to virtual functions than handle language specific items in the tree. */
void FsmCodeGen::INLINE_LIST( ostream &ret, InlineList *inlineList,
int targState, bool inFinish )
{
for ( InlineList::Iter item = *inlineList; item.lte(); item++ ) {
switch ( item->type ) {
case InlineItem::Text:
ret << item->data;
break;
case InlineItem::Goto:
GOTO( ret, item->targState->id, inFinish );
break;
case InlineItem::Call:
CALL( ret, item->targState->id, targState, inFinish );
break;
case InlineItem::Next:
NEXT( ret, item->targState->id, inFinish );
break;
case InlineItem::Ret:
RET( ret, inFinish );
break;
case InlineItem::PChar:
ret << P();
break;
case InlineItem::Char:
ret << GET_KEY();
break;
case InlineItem::Hold:
ret << P() << "--;";
break;
case InlineItem::Exec:
EXEC( ret, item, targState, inFinish );
break;
case InlineItem::HoldTE:
ret << TOKEND() << "--;";
break;
case InlineItem::ExecTE:
EXECTE( ret, item, targState, inFinish );
break;
case InlineItem::Curs:
CURS( ret, inFinish );
break;
case InlineItem::Targs:
TARGS( ret, inFinish, targState );
break;
case InlineItem::Entry:
ret << item->targState->id;
break;
case InlineItem::GotoExpr:
GOTO_EXPR( ret, item, inFinish );
break;
case InlineItem::CallExpr:
CALL_EXPR( ret, item, targState, inFinish );
break;
case InlineItem::NextExpr:
NEXT_EXPR( ret, item, inFinish );
break;
case InlineItem::LmSwitch:
LM_SWITCH( ret, item, targState, inFinish );
break;
case InlineItem::LmSetActId:
SET_ACT( ret, item );
break;
case InlineItem::LmSetTokEnd:
SET_TOKEND( ret, item );
break;
case InlineItem::LmGetTokEnd:
GET_TOKEND( ret, item );
break;
case InlineItem::LmInitTokStart:
INIT_TOKSTART( ret, item );
break;
case InlineItem::LmInitAct:
INIT_ACT( ret, item );
break;
case InlineItem::LmSetTokStart:
SET_TOKSTART( ret, item );
break;
case InlineItem::SubAction:
SUB_ACTION( ret, item, targState, inFinish );
break;
case InlineItem::Break:
BREAK( ret, targState );
break;
}
}
}
/* Write out paths in line directives. Escapes any special characters. */
string FsmCodeGen::LDIR_PATH( char *path )
{
ostringstream ret;
for ( char *pc = path; *pc != 0; pc++ ) {
if ( *pc == '\\' )
ret << "\\\\";
else
ret << *pc;
}
return ret.str();
}
void FsmCodeGen::ACTION( ostream &ret, Action *action, int targState, bool inFinish )
{
/* Write the preprocessor line info for going into the source file. */
lineDirective( ret, sourceFileName, action->loc.line );
/* Write the block and close it off. */
ret << "\t{";
INLINE_LIST( ret, action->inlineList, targState, inFinish );
ret << "}\n";
}
void FsmCodeGen::CONDITION( ostream &ret, Action *condition )
{
ret << "\n";
lineDirective( ret, sourceFileName, condition->loc.line );
INLINE_LIST( ret, condition->inlineList, 0, false );
}
string FsmCodeGen::ERROR_STATE()
{
ostringstream ret;
if ( redFsm->errState != 0 )
ret << redFsm->errState->id;
else
ret << "-1";
return ret.str();
}
string FsmCodeGen::FIRST_FINAL_STATE()
{
ostringstream ret;
if ( redFsm->firstFinState != 0 )
ret << redFsm->firstFinState->id;
else
ret << redFsm->nextStateId;
return ret.str();
}
void FsmCodeGen::writeInit()
{
out << " {\n";
if ( redFsm->startState != 0 )
out << "\t" << CS() << " = " << START() << ";\n";
/* If there are any calls, then the stack top needs initialization. */
if ( redFsm->anyActionCalls() || redFsm->anyActionRets() )
out << "\t" << TOP() << " = 0;\n";
if ( hasLongestMatch ) {
out <<
" " << TOKSTART() << " = " << NULL_ITEM() << ";\n"
" " << TOKEND() << " = " << NULL_ITEM() << ";\n"
" " << ACT() << " = 0;\n";
}
out << " }\n";
}
string FsmCodeGen::DATA_PREFIX()
{
if ( dataPrefix )
return FSM_NAME() + "_";
return "";
}
/* Emit the alphabet data type. */
string FsmCodeGen::ALPH_TYPE()
{
string ret = keyOps->alphType->data1;
if ( keyOps->alphType->data2 != 0 ) {
ret += " ";
ret += + keyOps->alphType->data2;
}
return ret;
}
/* Emit the alphabet data type. */
string FsmCodeGen::WIDE_ALPH_TYPE()
{
string ret;
if ( redFsm->maxKey <= keyOps->maxKey )
ret = ALPH_TYPE();
else {
long long maxKeyVal = redFsm->maxKey.getLongLong();
HostType *wideType = keyOps->typeSubsumes( keyOps->isSigned, maxKeyVal );
assert( wideType != 0 );
ret = wideType->data1;
if ( wideType->data2 != 0 ) {
ret += " ";
ret += wideType->data2;
}
}
return ret;
}
void FsmCodeGen::STATE_IDS()
{
if ( redFsm->startState != 0 )
STATIC_VAR( "int", START() ) << " = " << START_STATE_ID() << "};\n";
if ( writeFirstFinal )
STATIC_VAR( "int" , FIRST_FINAL() ) << " = " << FIRST_FINAL_STATE() << "};\n";
if ( writeErr )
STATIC_VAR( "int", ERROR() ) << " = " << ERROR_STATE() << "};\n";
out << "\n";
if ( entryPointNames.length() > 0 ) {
for ( EntryNameVect::Iter en = entryPointNames; en.lte(); en++ ) {
STATIC_VAR( "int", DATA_PREFIX() + "en_" + *en ) <<
" = " << entryPointIds[en.pos()] << "};\n";
}
out << "\n";
}
}
/*
* Language specific, but style independent code generators functions.
*/
string CCodeGen::PTR_CONST()
{
return "const ";
}
std::ostream &CCodeGen::OPEN_ARRAY( const string& type, const string& name )
{
out << "#if defined(__GNUC__)\n";
out << "static __attribute__((used)) const " << type << " " << name << "[] = {\n";
out << "#else\n";
out << "static const " << type << " " << name << "[] = {\n";
out << "#endif\n";
return out;
}
std::ostream &CCodeGen::CLOSE_ARRAY()
{
return out << "};\n";
}
std::ostream &CCodeGen::STATIC_VAR( const string& type, const string& name )
{
out << "enum {" << name;
return out;
}
string CCodeGen::UINT( )
{
return "unsigned int";
}
string CCodeGen::ARR_OFF( const string& ptr, const string& offset )
{
return ptr + " + " + offset;
}
string CCodeGen::CAST( const string& type )
{
return "(" + type + ")";
}
string CCodeGen::NULL_ITEM()
{
return "0";
}
string CCodeGen::POINTER()
{
return " *";
}
std::ostream &CCodeGen::SWITCH_DEFAULT()
{
return out;
}
string CCodeGen::CTRL_FLOW()
{
return "";
}
void CCodeGen::writeExports()
{
if ( exportList.length() > 0 ) {
for ( ExportList::Iter ex = exportList; ex.lte(); ex++ ) {
out << "#define " << DATA_PREFIX() << "ex_" << ex->name << " " <<
KEY(ex->key) << "\n";
}
out << "\n";
}
}
/*
* D Specific
*/
string DCodeGen::NULL_ITEM()
{
return "null";
}
string DCodeGen::POINTER()
{
// multiple items seperated by commas can also be pointer types.
return "* ";
}
string DCodeGen::PTR_CONST()
{
return "";
}
std::ostream &DCodeGen::OPEN_ARRAY( const string& type, const string& name )
{
out << "static const " << type << "[] " << name << " = [\n";
return out;
}
std::ostream &DCodeGen::CLOSE_ARRAY()
{
return out << "];\n";
}
std::ostream &DCodeGen::STATIC_VAR( const string& type, const string& name )
{
out << "static const " << type << " " << name;
return out;
}
string DCodeGen::ARR_OFF( const string& ptr, const string& offset )
{
return "&" + ptr + "[" + offset + "]";
}
string DCodeGen::CAST( const string& type )
{
return "cast(" + type + ")";
}
string DCodeGen::UINT( )
{
return "uint";
}
std::ostream &DCodeGen::SWITCH_DEFAULT()
{
out << " default: break;\n";
return out;
}
string DCodeGen::CTRL_FLOW()
{
return "if (true) ";
}
void DCodeGen::writeExports()
{
if ( exportList.length() > 0 ) {
for ( ExportList::Iter ex = exportList; ex.lte(); ex++ ) {
out << "static const " << ALPH_TYPE() << " " << DATA_PREFIX() <<
"ex_" << ex->name << " = " << KEY(ex->key) << ";\n";
}
out << "\n";
}
}
/*
* End D-specific code.
*/
void FsmCodeGen::finishRagelDef()
{
if ( codeStyle == GenGoto || codeStyle == GenFGoto ||
codeStyle == GenIpGoto || codeStyle == GenSplit )
{
/* For directly executable machines there is no required state
* ordering. Choose a depth-first ordering to increase the
* potential for fall-throughs. */
redFsm->depthFirstOrdering();
}
else {
/* The frontend will do this for us, but it may be a good idea to
* force it if the intermediate file is edited. */
redFsm->sortByStateId();
}
/* Choose default transitions and the single transition. */
redFsm->chooseDefaultSpan();
/* Maybe do flat expand, otherwise choose single. */
if ( codeStyle == GenFlat || codeStyle == GenFFlat )
redFsm->makeFlat();
else
redFsm->chooseSingle();
/* If any errors have occured in the input file then don't write anything. */
if ( gblErrorCount > 0 )
return;
if ( codeStyle == GenSplit )
redFsm->partitionFsm( numSplitPartitions );
if ( codeStyle == GenIpGoto || codeStyle == GenSplit )
redFsm->setInTrans();
/* Anlayze Machine will find the final action reference counts, among
* other things. We will use these in reporting the usage
* of fsm directives in action code. */
analyzeMachine();
/* Determine if we should use indicies. */
calcIndexSize();
}
ostream &FsmCodeGen::source_warning( const InputLoc &loc )
{
cerr << sourceFileName << ":" << loc.line << ":" << loc.col << ": warning: ";
return cerr;
}
ostream &FsmCodeGen::source_error( const InputLoc &loc )
{
gblErrorCount += 1;
assert( sourceFileName != 0 );
cerr << sourceFileName << ":" << loc.line << ":" << loc.col << ": ";
return cerr;
}
|