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
24 #include "rlgen-csharp.h"
25 #include "flatcodegen.h"
29 std::ostream
&CSharpFlatCodeGen::TO_STATE_ACTION( RedStateAp
*state
)
32 if ( state
->toStateAction
!= 0 )
33 act
= state
->toStateAction
->location
+1;
38 std::ostream
&CSharpFlatCodeGen::FROM_STATE_ACTION( RedStateAp
*state
)
41 if ( state
->fromStateAction
!= 0 )
42 act
= state
->fromStateAction
->location
+1;
47 std::ostream
&CSharpFlatCodeGen::EOF_ACTION( RedStateAp
*state
)
50 if ( state
->eofAction
!= 0 )
51 act
= state
->eofAction
->location
+1;
56 std::ostream
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::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 );
79 genLineDirective( out
);
83 std::ostream
&CSharpFlatCodeGen::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 );
96 genLineDirective( out
);
100 std::ostream
&CSharpFlatCodeGen::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 );
113 genLineDirective( out
);
118 std::ostream
&CSharpFlatCodeGen::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 );
131 genLineDirective( out
);
136 std::ostream
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::COND_KEYS()
260 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
261 /* Emit just cond low key and cond high key. */
262 out
<< ALPHA_KEY( st
->condLowKey
) << ", ";
263 out
<< ALPHA_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. */
270 out
<< "(char) " << 0 << "\n";
274 std::ostream
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::KEYS()
345 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
346 /* Emit just low key and high key. */
347 out
<< ALPHA_KEY( st
->lowKey
) << ", ";
348 out
<< ALPHA_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. */
355 out
<< "(char) " << 0 << "\n";
359 std::ostream
&CSharpFlatCodeGen::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
&CSharpFlatCodeGen::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 /* Record the position, need this for eofTrans. */
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
&CSharpFlatCodeGen::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 CSharpFlatCodeGen::LOCATE_TRANS()
445 " _keys = " << CS() << "<<1;\n"
446 " _inds = " << IO() << "[" << CS() << "];\n"
448 " _slen = " << SP() << "[" << CS() << "];\n"
449 " _trans = " << I() << "[_inds + (\n"
450 " _slen > 0 && " << K() << "[_keys] <=" << GET_WIDE_KEY() << " &&\n"
451 " " << GET_WIDE_KEY() << " <= " << K() <<"[_keys+1] ?\n"
452 " " << GET_WIDE_KEY() << " - " << K() << "[_keys] : _slen ) ];\n"
456 void CSharpFlatCodeGen::GOTO( ostream
&ret
, int gotoDest
, bool inFinish
)
458 ret
<< "{" << CS() << " = " << gotoDest
<< "; " <<
459 CTRL_FLOW() << "goto _again;}";
462 void CSharpFlatCodeGen::GOTO_EXPR( ostream
&ret
, GenInlineItem
*ilItem
, bool inFinish
)
464 ret
<< "{" << CS() << " = (";
465 INLINE_LIST( ret
, ilItem
->children
, 0, inFinish
);
466 ret
<< "); " << CTRL_FLOW() << "goto _again;}";
469 void CSharpFlatCodeGen::CURS( ostream
&ret
, bool inFinish
)
474 void CSharpFlatCodeGen::TARGS( ostream
&ret
, bool inFinish
, int targState
)
476 ret
<< "(" << CS() << ")";
479 void CSharpFlatCodeGen::NEXT( ostream
&ret
, int nextDest
, bool inFinish
)
481 ret
<< CS() << " = " << nextDest
<< ";";
484 void CSharpFlatCodeGen::NEXT_EXPR( ostream
&ret
, GenInlineItem
*ilItem
, bool inFinish
)
486 ret
<< CS() << " = (";
487 INLINE_LIST( ret
, ilItem
->children
, 0, inFinish
);
491 void CSharpFlatCodeGen::CALL( ostream
&ret
, int callDest
, int targState
, bool inFinish
)
493 if ( prePushExpr
!= 0 ) {
495 INLINE_LIST( ret
, prePushExpr
, 0, false );
498 ret
<< "{" << STACK() << "[" << TOP() << "++] = " << CS() << "; " << CS() << " = " <<
499 callDest
<< "; " << CTRL_FLOW() << "goto _again;}";
501 if ( prePushExpr
!= 0 )
506 void CSharpFlatCodeGen::CALL_EXPR( ostream
&ret
, GenInlineItem
*ilItem
, int targState
, bool inFinish
)
508 if ( prePushExpr
!= 0 ) {
510 INLINE_LIST( ret
, prePushExpr
, 0, false );
513 ret
<< "{" << STACK() << "[" << TOP() << "++] = " << CS() << "; " << CS() << " = (";
514 INLINE_LIST( ret
, ilItem
->children
, targState
, inFinish
);
515 ret
<< "); " << CTRL_FLOW() << "goto _again;}";
517 if ( prePushExpr
!= 0 )
522 void CSharpFlatCodeGen::RET( ostream
&ret
, bool inFinish
)
524 ret
<< "{" << CS() << " = " << STACK() << "[--" << TOP() << "];";
526 if ( postPopExpr
!= 0 ) {
528 INLINE_LIST( ret
, postPopExpr
, 0, false );
532 ret
<< CTRL_FLOW() << "goto _again;}";
535 void CSharpFlatCodeGen::BREAK( ostream
&ret
, int targState
)
538 ret
<< "{" << P() << "++; " << CTRL_FLOW() << "goto _out; }";
541 void CSharpFlatCodeGen::writeData()
543 /* If there are any transtion functions then output the array. If there
544 * are none, don't bother emitting an empty array that won't be used. */
545 if ( redFsm
->anyActions() ) {
546 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActArrItem
), A() );
552 if ( redFsm
->anyConditions() ) {
553 OPEN_ARRAY( WIDE_ALPH_TYPE(), CK() );
558 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxCondSpan
), CSP() );
563 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxCond
), C() );
568 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxCondIndexOffset
), CO() );
574 OPEN_ARRAY( WIDE_ALPH_TYPE(), K() );
579 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxSpan
), SP() );
584 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxFlatIndexOffset
), IO() );
589 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxIndex
), I() );
594 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxState
), TT() );
599 if ( redFsm
->anyActions() ) {
600 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), TA() );
606 if ( redFsm
->anyToStateActions() ) {
607 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), TSA() );
613 if ( redFsm
->anyFromStateActions() ) {
614 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), FSA() );
615 FROM_STATE_ACTIONS();
620 if ( redFsm
->anyEofActions() ) {
621 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), EA() );
627 if ( redFsm
->anyEofTrans() ) {
628 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxIndexOffset
+1), ET() );
637 void CSharpFlatCodeGen::COND_TRANSLATE()
640 " _widec = " << GET_KEY() << ";\n";
643 " _keys = " << CS() << "<<1;\n"
644 " _conds = " << CO() << "[" << CS() << "];\n"
645 // " _keys = " << ARR_OFF( CK(), "(" + CS() + "<<1)" ) << ";\n"
646 // " _conds = " << ARR_OFF( C(), CO() + "[" + CS() + "]" ) << ";\n"
648 " _slen = " << CSP() << "[" << CS() << "];\n"
649 " if (_slen > 0 && " << CK() << "[_keys] <="
650 << GET_WIDE_KEY() << " &&\n"
651 " " << GET_WIDE_KEY() << " <= " << CK() << "[_keys+1])\n"
652 " _cond = " << C() << "[_conds+" << GET_WIDE_KEY() << " - " <<
653 CK() << "[_keys]];\n"
657 /* XXX This version of the code doesn't work because Mono is weird. Works
658 * fine in Microsoft's csc, even though the bug report filed claimed it
660 " _slen = " << CSP() << "[" << CS() << "];\n"
661 " _cond = _slen > 0 && " << CK() << "[_keys] <="
662 << GET_WIDE_KEY() << " &&\n"
663 " " << GET_WIDE_KEY() << " <= " << CK() << "[_keys+1] ?\n"
664 " " << C() << "[_conds+" << GET_WIDE_KEY() << " - " << CK()
669 " switch ( _cond ) {\n";
670 for ( CondSpaceList::Iter csi
= condSpaceList
; csi
.lte(); csi
++ ) {
671 CondSpace
*condSpace
= csi
;
672 out
<< " case " << condSpace
->condSpaceId
+ 1 << ": {\n";
673 out
<< TABS(2) << "_widec = " << CAST(WIDE_ALPH_TYPE()) << "(" <<
674 KEY(condSpace
->baseKey
) << " + (" << GET_KEY() <<
675 " - " << KEY(keyOps
->minKey
) << "));\n";
677 for ( CondSet::Iter csi
= condSpace
->condSet
; csi
.lte(); csi
++ ) {
678 out
<< TABS(2) << "if ( ";
679 CONDITION( out
, *csi
);
680 Size condValOffset
= ((1 << csi
.pos()) * keyOps
->alphSize());
681 out
<< " ) _widec += " << condValOffset
<< ";\n";
694 void CSharpFlatCodeGen::writeExec()
697 outLabelUsed
= false;
702 " " << slenType
<< " _slen";
704 if ( redFsm
->anyRegCurStateRef() )
709 " " << transType
<< " _trans";
711 if ( redFsm
->anyConditions() )
715 if ( redFsm
->anyToStateActions() ||
716 redFsm
->anyRegActions() || redFsm
->anyFromStateActions() )
719 " " << actsType
<< " _acts;\n"
720 " " << nactsType
<< " _nacts;\n";
724 " " << "int _keys;\n"
725 " " << indsType
<< " _inds;\n";
727 " " << PTR_CONST() << WIDE_ALPH_TYPE() << POINTER() << "_keys;\n"
728 " " << PTR_CONST() << ARRAY_TYPE(redFsm->maxIndex) << POINTER() << "_inds;\n";*/
730 if ( redFsm
->anyConditions() ) {
732 " " << condsType
<< " _conds;\n"
733 " " << WIDE_ALPH_TYPE() << " _widec;\n";
741 " if ( " << P() << " == " << PE() << " )\n"
742 " goto _test_eof;\n";
745 if ( redFsm
->errState
!= 0 ) {
748 " if ( " << CS() << " == " << redFsm
->errState
->id
<< " )\n"
754 if ( redFsm
->anyFromStateActions() ) {
756 " _acts = " << FSA() << "[" << CS() << "];\n"
757 " _nacts = " << A() << "[_acts++];\n"
758 " while ( _nacts-- > 0 ) {\n"
759 " switch ( " << A() << "[_acts++] ) {\n";
760 FROM_STATE_ACTION_SWITCH();
767 if ( redFsm
->anyConditions() )
772 if ( redFsm
->anyEofTrans() )
773 out
<< "_eof_trans:\n";
775 if ( redFsm
->anyRegCurStateRef() )
776 out
<< " _ps = " << CS() << ";\n";
779 " " << CS() << " = " << TT() << "[_trans];\n"
782 if ( redFsm
->anyRegActions() ) {
784 " if ( " << TA() << "[_trans] == 0 )\n"
787 " _acts = " << TA() << "[_trans];\n"
788 " _nacts = " << A() << "[_acts++];\n"
789 " while ( _nacts-- > 0 ) {\n"
790 " switch ( " << A() << "[_acts++] )\n {\n";
798 if ( redFsm
->anyRegActions() || redFsm
->anyActionGotos() ||
799 redFsm
->anyActionCalls() || redFsm
->anyActionRets() )
802 if ( redFsm
->anyToStateActions() ) {
804 " _acts = " << TSA() << "[" << CS() << "];\n"
805 " _nacts = " << A() << "[_acts++];\n"
806 " while ( _nacts-- > 0 ) {\n"
807 " switch ( " << A() << "[_acts++] ) {\n";
808 TO_STATE_ACTION_SWITCH();
815 if ( redFsm
->errState
!= 0 ) {
818 " if ( " << CS() << " == " << redFsm
->errState
->id
<< " )\n"
824 " if ( ++" << P() << " != " << PE() << " )\n"
829 " " << P() << " += 1;\n"
834 out
<< " _test_eof: {}\n";
836 if ( redFsm
->anyEofTrans() || redFsm
->anyEofActions() ) {
838 " if ( " << P() << " == " << EOFV() << " )\n"
841 if ( redFsm
->anyEofTrans() ) {
843 " if ( " << ET() << "[" << CS() << "] > 0 ) {\n"
844 " _trans = " << CAST(transType
) << " (" << ET() <<
845 "[" << CS() << "] - 1);\n"
846 " goto _eof_trans;\n"
850 if ( redFsm
->anyEofActions() ) {
852 " " << PTR_CONST() << ARRAY_TYPE(redFsm
->maxActArrItem
) <<
853 POINTER() << "__acts = " <<
854 EA() << "[" << CS() << "];\n"
855 " " << UINT() << " __nacts = " << CAST(UINT()) << " " <<
856 A() << "[__acts++];\n"
857 " while ( __nacts-- > 0 ) {\n"
858 " switch ( " << A() << "[__acts++] ) {\n";
871 out
<< " _out: {}\n";
876 void CSharpFlatCodeGen::initVarTypes()
878 slenType
= ARRAY_TYPE(MAX(redFsm
->maxSpan
, redFsm
->maxCondSpan
));
879 transType
= ARRAY_TYPE(redFsm
->maxIndex
+1);
880 actsType
= ARRAY_TYPE(redFsm
->maxActionLoc
);
881 nactsType
= ARRAY_TYPE(redFsm
->maxActArrItem
);
882 indsType
= ARRAY_TYPE(redFsm
->maxFlatIndexOffset
);
883 condsType
= ARRAY_TYPE(redFsm
->maxCondIndexOffset
);