2 * Copyright 2004-2006 Adrian Thurston <thurston@cs.queensu.ca>
3 * 2004 Erich Ocean <eric.ocean@ampede.com>
4 * 2005 Alan West <alan@alanz.com>
7 /* This file is part of Ragel.
9 * Ragel is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * Ragel is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with Ragel; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
25 #include "flatcodegen.h"
29 std::ostream
&FlatCodeGen::TO_STATE_ACTION( RedStateAp
*state
)
32 if ( state
->toStateAction
!= 0 )
33 act
= state
->toStateAction
->location
+1;
38 std::ostream
&FlatCodeGen::FROM_STATE_ACTION( RedStateAp
*state
)
41 if ( state
->fromStateAction
!= 0 )
42 act
= state
->fromStateAction
->location
+1;
47 std::ostream
&FlatCodeGen::EOF_ACTION( RedStateAp
*state
)
50 if ( state
->eofAction
!= 0 )
51 act
= state
->eofAction
->location
+1;
56 std::ostream
&FlatCodeGen::TRANS_ACTION( RedTransAp
*trans
)
58 /* If there are actions, emit them. Otherwise emit zero. */
60 if ( trans
->action
!= 0 )
61 act
= trans
->action
->location
+1;
66 std::ostream
&FlatCodeGen::TO_STATE_ACTION_SWITCH()
68 /* Walk the list of functions, printing the cases. */
69 for ( ActionList::Iter act
= actionList
; act
.lte(); act
++ ) {
70 /* Write out referenced actions. */
71 if ( act
->numToStateRefs
> 0 ) {
72 /* Write the case label, the action and the case break */
73 out
<< "\tcase " << act
->actionId
<< ":\n";
74 ACTION( out
, act
, 0, false, false );
79 genLineDirective( out
);
83 std::ostream
&FlatCodeGen::FROM_STATE_ACTION_SWITCH()
85 /* Walk the list of functions, printing the cases. */
86 for ( ActionList::Iter act
= actionList
; act
.lte(); act
++ ) {
87 /* Write out referenced actions. */
88 if ( act
->numFromStateRefs
> 0 ) {
89 /* Write the case label, the action and the case break */
90 out
<< "\tcase " << act
->actionId
<< ":\n";
91 ACTION( out
, act
, 0, false, false );
96 genLineDirective( out
);
100 std::ostream
&FlatCodeGen::EOF_ACTION_SWITCH()
102 /* Walk the list of functions, printing the cases. */
103 for ( ActionList::Iter act
= actionList
; act
.lte(); act
++ ) {
104 /* Write out referenced actions. */
105 if ( act
->numEofRefs
> 0 ) {
106 /* Write the case label, the action and the case break */
107 out
<< "\tcase " << act
->actionId
<< ":\n";
108 ACTION( out
, act
, 0, true, false );
113 genLineDirective( out
);
118 std::ostream
&FlatCodeGen::ACTION_SWITCH()
120 /* Walk the list of functions, printing the cases. */
121 for ( ActionList::Iter act
= actionList
; act
.lte(); act
++ ) {
122 /* Write out referenced actions. */
123 if ( act
->numTransRefs
> 0 ) {
124 /* Write the case label, the action and the case break */
125 out
<< "\tcase " << act
->actionId
<< ":\n";
126 ACTION( out
, act
, 0, false, false );
131 genLineDirective( out
);
136 std::ostream
&FlatCodeGen::FLAT_INDEX_OFFSET()
139 int totalStateNum
= 0, curIndOffset
= 0;
140 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
141 /* Write the index offset. */
145 if ( ++totalStateNum
% IALL
== 0 )
149 /* Move the index offset ahead. */
150 if ( st
->transList
!= 0 )
151 curIndOffset
+= keyOps
->span( st
->lowKey
, st
->highKey
);
153 if ( st
->defTrans
!= 0 )
160 std::ostream
&FlatCodeGen::KEY_SPANS()
163 int totalStateNum
= 0;
164 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
165 /* Write singles length. */
166 unsigned long long span
= 0;
167 if ( st
->transList
!= 0 )
168 span
= keyOps
->span( st
->lowKey
, st
->highKey
);
172 if ( ++totalStateNum
% IALL
== 0 )
180 std::ostream
&FlatCodeGen::TO_STATE_ACTIONS()
183 int totalStateNum
= 0;
184 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
185 /* Write any eof action. */
189 if ( ++totalStateNum
% IALL
== 0 )
197 std::ostream
&FlatCodeGen::FROM_STATE_ACTIONS()
200 int totalStateNum
= 0;
201 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
202 /* Write any eof action. */
203 FROM_STATE_ACTION(st
);
206 if ( ++totalStateNum
% IALL
== 0 )
214 std::ostream
&FlatCodeGen::EOF_ACTIONS()
217 int totalStateNum
= 0;
218 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
219 /* Write any eof action. */
223 if ( ++totalStateNum
% IALL
== 0 )
231 std::ostream
&FlatCodeGen::EOF_TRANS()
234 int totalStateNum
= 0;
235 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
236 /* Write any eof action. */
239 if ( st
->eofTrans
!= 0 ) {
240 assert( st
->eofTrans
->pos
>= 0 );
241 trans
= st
->eofTrans
->pos
+1;
247 if ( ++totalStateNum
% IALL
== 0 )
256 std::ostream
&FlatCodeGen::COND_KEYS()
260 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
261 /* Emit just cond low key and cond high key. */
262 out
<< KEY( st
->condLowKey
) << ", ";
263 out
<< KEY( st
->condHighKey
) << ", ";
264 if ( ++totalTrans
% IALL
== 0 )
268 /* Output one last number so we don't have to figure out when the last
269 * entry is and avoid writing a comma. */
274 std::ostream
&FlatCodeGen::COND_KEY_SPANS()
277 int totalStateNum
= 0;
278 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
279 /* Write singles length. */
280 unsigned long long span
= 0;
281 if ( st
->condList
!= 0 )
282 span
= keyOps
->span( st
->condLowKey
, st
->condHighKey
);
286 if ( ++totalStateNum
% IALL
== 0 )
294 std::ostream
&FlatCodeGen::CONDS()
298 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
299 if ( st
->condList
!= 0 ) {
300 /* Walk the singles. */
301 unsigned long long span
= keyOps
->span( st
->condLowKey
, st
->condHighKey
);
302 for ( unsigned long long pos
= 0; pos
< span
; pos
++ ) {
303 if ( st
->condList
[pos
] != 0 )
304 out
<< st
->condList
[pos
]->condSpaceId
+ 1 << ", ";
307 if ( ++totalTrans
% IALL
== 0 )
313 /* Output one last number so we don't have to figure out when the last
314 * entry is and avoid writing a comma. */
319 std::ostream
&FlatCodeGen::COND_INDEX_OFFSET()
322 int totalStateNum
= 0, curIndOffset
= 0;
323 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
324 /* Write the index offset. */
328 if ( ++totalStateNum
% IALL
== 0 )
332 /* Move the index offset ahead. */
333 if ( st
->condList
!= 0 )
334 curIndOffset
+= keyOps
->span( st
->condLowKey
, st
->condHighKey
);
341 std::ostream
&FlatCodeGen::KEYS()
345 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
346 /* Emit just low key and high key. */
347 out
<< KEY( st
->lowKey
) << ", ";
348 out
<< KEY( st
->highKey
) << ", ";
349 if ( ++totalTrans
% IALL
== 0 )
353 /* Output one last number so we don't have to figure out when the last
354 * entry is and avoid writing a comma. */
359 std::ostream
&FlatCodeGen::INDICIES()
363 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
364 if ( st
->transList
!= 0 ) {
365 /* Walk the singles. */
366 unsigned long long span
= keyOps
->span( st
->lowKey
, st
->highKey
);
367 for ( unsigned long long pos
= 0; pos
< span
; pos
++ ) {
368 out
<< st
->transList
[pos
]->id
<< ", ";
369 if ( ++totalTrans
% IALL
== 0 )
374 /* The state's default index goes next. */
375 if ( st
->defTrans
!= 0 )
376 out
<< st
->defTrans
->id
<< ", ";
378 if ( ++totalTrans
% IALL
== 0 )
382 /* Output one last number so we don't have to figure out when the last
383 * entry is and avoid writing a comma. */
388 std::ostream
&FlatCodeGen::TRANS_TARGS()
390 /* Transitions must be written ordered by their id. */
391 RedTransAp
**transPtrs
= new RedTransAp
*[redFsm
->transSet
.length()];
392 for ( TransApSet::Iter trans
= redFsm
->transSet
; trans
.lte(); trans
++ )
393 transPtrs
[trans
->id
] = trans
;
395 /* Keep a count of the num of items in the array written. */
398 for ( int t
= 0; t
< redFsm
->transSet
.length(); t
++ ) {
399 /* Save the position. Needed for eofTargs. */
400 RedTransAp
*trans
= transPtrs
[t
];
403 /* Write out the target state. */
404 out
<< trans
->targ
->id
;
405 if ( t
< redFsm
->transSet
.length()-1 ) {
407 if ( ++totalStates
% IALL
== 0 )
417 std::ostream
&FlatCodeGen::TRANS_ACTIONS()
419 /* Transitions must be written ordered by their id. */
420 RedTransAp
**transPtrs
= new RedTransAp
*[redFsm
->transSet
.length()];
421 for ( TransApSet::Iter trans
= redFsm
->transSet
; trans
.lte(); trans
++ )
422 transPtrs
[trans
->id
] = trans
;
424 /* Keep a count of the num of items in the array written. */
427 for ( int t
= 0; t
< redFsm
->transSet
.length(); t
++ ) {
428 /* Write the function for the transition. */
429 RedTransAp
*trans
= transPtrs
[t
];
430 TRANS_ACTION( trans
);
431 if ( t
< redFsm
->transSet
.length()-1 ) {
433 if ( ++totalAct
% IALL
== 0 )
442 void FlatCodeGen::LOCATE_TRANS()
445 " _keys = " << ARR_OFF( K(), "(" + CS() + "<<1)" ) << ";\n"
446 " _inds = " << ARR_OFF( I(), IO() + "[" + CS() + "]" ) << ";\n"
448 " _slen = " << SP() << "[" << CS() << "];\n"
449 " _trans = _inds[ _slen > 0 && _keys[0] <=" << GET_WIDE_KEY() << " &&\n"
450 " " << GET_WIDE_KEY() << " <= _keys[1] ?\n"
451 " " << GET_WIDE_KEY() << " - _keys[0] : _slen ];\n"
455 void FlatCodeGen::GOTO( ostream
&ret
, int gotoDest
, bool inFinish
)
457 ret
<< "{" << CS() << " = " << gotoDest
<< "; " <<
458 CTRL_FLOW() << "goto _again;}";
461 void FlatCodeGen::GOTO_EXPR( ostream
&ret
, InlineItem
*ilItem
, bool inFinish
)
463 ret
<< "{" << CS() << " = (";
464 INLINE_LIST( ret
, ilItem
->children
, 0, inFinish
, false );
465 ret
<< "); " << CTRL_FLOW() << "goto _again;}";
468 void FlatCodeGen::CURS( ostream
&ret
, bool inFinish
)
473 void FlatCodeGen::TARGS( ostream
&ret
, bool inFinish
, int targState
)
475 ret
<< "(" << CS() << ")";
478 void FlatCodeGen::NEXT( ostream
&ret
, int nextDest
, bool inFinish
)
480 ret
<< CS() << " = " << nextDest
<< ";";
483 void FlatCodeGen::NEXT_EXPR( ostream
&ret
, InlineItem
*ilItem
, bool inFinish
)
485 ret
<< CS() << " = (";
486 INLINE_LIST( ret
, ilItem
->children
, 0, inFinish
, false );
490 void FlatCodeGen::CALL( ostream
&ret
, int callDest
, int targState
, bool inFinish
)
492 if ( prePushExpr
!= 0 ) {
494 INLINE_LIST( ret
, prePushExpr
, 0, false, false );
497 ret
<< "{" << STACK() << "[" << TOP() << "++] = " << CS() << "; " << CS() << " = " <<
498 callDest
<< "; " << CTRL_FLOW() << "goto _again;}";
500 if ( prePushExpr
!= 0 )
505 void FlatCodeGen::CALL_EXPR( ostream
&ret
, InlineItem
*ilItem
, int targState
, bool inFinish
)
507 if ( prePushExpr
!= 0 ) {
509 INLINE_LIST( ret
, prePushExpr
, 0, false, false );
512 ret
<< "{" << STACK() << "[" << TOP() << "++] = " << CS() << "; " << CS() << " = (";
513 INLINE_LIST( ret
, ilItem
->children
, targState
, inFinish
, false );
514 ret
<< "); " << CTRL_FLOW() << "goto _again;}";
516 if ( prePushExpr
!= 0 )
521 void FlatCodeGen::RET( ostream
&ret
, bool inFinish
)
523 ret
<< "{" << CS() << " = " << STACK() << "[--" << TOP() << "];";
525 if ( postPopExpr
!= 0 ) {
527 INLINE_LIST( ret
, postPopExpr
, 0, false, false );
531 ret
<< CTRL_FLOW() << "goto _again;}";
534 void FlatCodeGen::BREAK( ostream
&ret
, int targState
, bool csForced
)
537 ret
<< "{" << P() << "++; " << CTRL_FLOW() << "goto _out; }";
540 void FlatCodeGen::writeData()
542 /* If there are any transtion functions then output the array. If there
543 * are none, don't bother emitting an empty array that won't be used. */
544 if ( redFsm
->anyActions() ) {
545 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActArrItem
), A() );
551 if ( redFsm
->anyConditions() ) {
552 OPEN_ARRAY( WIDE_ALPH_TYPE(), CK() );
557 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxCondSpan
), CSP() );
562 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxCond
), C() );
567 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxCondIndexOffset
), CO() );
573 OPEN_ARRAY( WIDE_ALPH_TYPE(), K() );
578 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxSpan
), SP() );
583 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxFlatIndexOffset
), IO() );
588 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxIndex
), I() );
593 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxState
), TT() );
598 if ( redFsm
->anyActions() ) {
599 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), TA() );
605 if ( redFsm
->anyToStateActions() ) {
606 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), TSA() );
612 if ( redFsm
->anyFromStateActions() ) {
613 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), FSA() );
614 FROM_STATE_ACTIONS();
619 if ( redFsm
->anyEofActions() ) {
620 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), EA() );
626 if ( redFsm
->anyEofTrans() ) {
627 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxIndexOffset
+1), ET() );
636 void FlatCodeGen::COND_TRANSLATE()
639 " _widec = " << GET_KEY() << ";\n";
642 " _keys = " << ARR_OFF( CK(), "(" + CS() + "<<1)" ) << ";\n"
643 " _conds = " << ARR_OFF( C(), CO() + "[" + CS() + "]" ) << ";\n"
645 " _slen = " << CSP() << "[" << CS() << "];\n"
646 " _cond = _slen > 0 && _keys[0] <=" << GET_WIDE_KEY() << " &&\n"
647 " " << GET_WIDE_KEY() << " <= _keys[1] ?\n"
648 " _conds[" << GET_WIDE_KEY() << " - _keys[0]] : 0;\n"
652 " switch ( _cond ) {\n";
653 for ( CondSpaceList::Iter csi
= condSpaceList
; csi
.lte(); csi
++ ) {
654 CondSpace
*condSpace
= csi
;
655 out
<< " case " << condSpace
->condSpaceId
+ 1 << ": {\n";
656 out
<< TABS(2) << "_widec = " << CAST(WIDE_ALPH_TYPE()) << "(" <<
657 KEY(condSpace
->baseKey
) << " + (" << GET_KEY() <<
658 " - " << KEY(keyOps
->minKey
) << "));\n";
660 for ( CondSet::Iter csi
= condSpace
->condSet
; csi
.lte(); csi
++ ) {
661 out
<< TABS(2) << "if ( ";
662 CONDITION( out
, *csi
);
663 Size condValOffset
= ((1 << csi
.pos()) * keyOps
->alphSize());
664 out
<< " ) _widec += " << condValOffset
<< ";\n";
677 void FlatCodeGen::writeExec()
680 outLabelUsed
= false;
686 if ( redFsm
->anyRegCurStateRef() )
693 if ( redFsm
->anyConditions() )
697 if ( redFsm
->anyToStateActions() ||
698 redFsm
->anyRegActions() || redFsm
->anyFromStateActions() )
701 " " << PTR_CONST() << ARRAY_TYPE(redFsm
->maxActArrItem
) << POINTER() << "_acts;\n"
702 " " << UINT() << " _nacts;\n";
706 " " << PTR_CONST() << WIDE_ALPH_TYPE() << POINTER() << "_keys;\n"
707 " " << PTR_CONST() << ARRAY_TYPE(redFsm
->maxIndex
) << POINTER() << "_inds;\n";
709 if ( redFsm
->anyConditions() ) {
711 " " << PTR_CONST() << ARRAY_TYPE(redFsm
->maxCond
) << POINTER() << "_conds;\n"
712 " " << WIDE_ALPH_TYPE() << " _widec;\n";
720 " if ( " << P() << " == " << PE() << " )\n"
721 " goto _test_eof;\n";
724 if ( redFsm
->errState
!= 0 ) {
727 " if ( " << CS() << " == " << redFsm
->errState
->id
<< " )\n"
733 if ( redFsm
->anyFromStateActions() ) {
735 " _acts = " << ARR_OFF( A(), FSA() + "[" + CS() + "]" ) << ";\n"
736 " _nacts = " << CAST(UINT()) << " *_acts++;\n"
737 " while ( _nacts-- > 0 ) {\n"
738 " switch ( *_acts++ ) {\n";
739 FROM_STATE_ACTION_SWITCH();
746 if ( redFsm
->anyConditions() )
751 if ( redFsm
->anyEofTrans() )
752 out
<< "_eof_trans:\n";
754 if ( redFsm
->anyRegCurStateRef() )
755 out
<< " _ps = " << CS() << ";\n";
758 " " << CS() << " = " << TT() << "[_trans];\n"
761 if ( redFsm
->anyRegActions() ) {
763 " if ( " << TA() << "[_trans] == 0 )\n"
766 " _acts = " << ARR_OFF( A(), TA() + "[_trans]" ) << ";\n"
767 " _nacts = " << CAST(UINT()) << " *_acts++;\n"
768 " while ( _nacts-- > 0 ) {\n"
769 " switch ( *(_acts++) )\n {\n";
777 if ( redFsm
->anyRegActions() || redFsm
->anyActionGotos() ||
778 redFsm
->anyActionCalls() || redFsm
->anyActionRets() )
781 if ( redFsm
->anyToStateActions() ) {
783 " _acts = " << ARR_OFF( A(), TSA() + "[" + CS() + "]" ) << ";\n"
784 " _nacts = " << CAST(UINT()) << " *_acts++;\n"
785 " while ( _nacts-- > 0 ) {\n"
786 " switch ( *_acts++ ) {\n";
787 TO_STATE_ACTION_SWITCH();
794 if ( redFsm
->errState
!= 0 ) {
797 " if ( " << CS() << " == " << redFsm
->errState
->id
<< " )\n"
803 " if ( ++" << P() << " != " << PE() << " )\n"
808 " " << P() << " += 1;\n"
813 out
<< " _test_eof: {}\n";
815 if ( redFsm
->anyEofTrans() || redFsm
->anyEofActions() ) {
817 " if ( " << P() << " == " << EOFV() << " )\n"
820 if ( redFsm
->anyEofTrans() ) {
822 " if ( " << ET() << "[" << CS() << "] > 0 ) {\n"
823 " _trans = " << ET() << "[" << CS() << "] - 1;\n"
824 " goto _eof_trans;\n"
828 if ( redFsm
->anyEofActions() ) {
830 " " << PTR_CONST() << ARRAY_TYPE(redFsm
->maxActArrItem
) <<
831 POINTER() << "__acts = " <<
832 ARR_OFF( A(), EA() + "[" + CS() + "]" ) << ";\n"
833 " " << UINT() << " __nacts = " << CAST(UINT()) << " *__acts++;\n"
834 " while ( __nacts-- > 0 ) {\n"
835 " switch ( *__acts++ ) {\n";
848 out
<< " _out: {}\n";