2 * Copyright 2001-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 "fgotocodegen.h"
30 std::ostream
&CSharpFGotoCodeGen::EXEC_ACTIONS()
32 /* Loop the actions. */
33 for ( ActionTableMap::Iter redAct
= redFsm
->actionMap
; redAct
.lte(); redAct
++ ) {
34 if ( redAct
->numTransRefs
> 0 ) {
35 /* We are at the start of a glob, write the case. */
36 out
<< "f" << redAct
->actListId
<< ":\n";
38 /* Write each action in the list of action items. */
39 for ( GenActionTable::Iter item
= redAct
->key
; item
.lte(); item
++ )
40 ACTION( out
, item
->value
, 0, false );
42 out
<< "\tgoto _again;\n";
48 /* Write out the function switch. This switch is keyed on the values
49 * of the func index. */
50 std::ostream
&CSharpFGotoCodeGen::TO_STATE_ACTION_SWITCH()
52 /* Loop the actions. */
53 for ( ActionTableMap::Iter redAct
= redFsm
->actionMap
; redAct
.lte(); redAct
++ ) {
54 if ( redAct
->numToStateRefs
> 0 ) {
55 /* Write the entry label. */
56 out
<< "\tcase " << redAct
->actListId
+1 << ":\n";
58 /* Write each action in the list of action items. */
59 for ( GenActionTable::Iter item
= redAct
->key
; item
.lte(); item
++ )
60 ACTION( out
, item
->value
, 0, false );
66 genLineDirective( out
);
70 /* Write out the function switch. This switch is keyed on the values
71 * of the func index. */
72 std::ostream
&CSharpFGotoCodeGen::FROM_STATE_ACTION_SWITCH()
74 /* Loop the actions. */
75 for ( ActionTableMap::Iter redAct
= redFsm
->actionMap
; redAct
.lte(); redAct
++ ) {
76 if ( redAct
->numFromStateRefs
> 0 ) {
77 /* Write the entry label. */
78 out
<< "\tcase " << redAct
->actListId
+1 << ":\n";
80 /* Write each action in the list of action items. */
81 for ( GenActionTable::Iter item
= redAct
->key
; item
.lte(); item
++ )
82 ACTION( out
, item
->value
, 0, false );
88 genLineDirective( out
);
92 std::ostream
&CSharpFGotoCodeGen::EOF_ACTION_SWITCH()
94 /* Loop the actions. */
95 for ( ActionTableMap::Iter redAct
= redFsm
->actionMap
; redAct
.lte(); redAct
++ ) {
96 if ( redAct
->numEofRefs
> 0 ) {
97 /* Write the entry label. */
98 out
<< "\tcase " << redAct
->actListId
+1 << ":\n";
100 /* Write each action in the list of action items. */
101 for ( GenActionTable::Iter item
= redAct
->key
; item
.lte(); item
++ )
102 ACTION( out
, item
->value
, 0, true );
108 genLineDirective( out
);
113 std::ostream
&CSharpFGotoCodeGen::FINISH_CASES()
115 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
116 /* States that are final and have an out action need a case. */
117 if ( st
->eofAction
!= 0 ) {
118 /* Write the case label. */
119 out
<< "\t\tcase " << st
->id
<< ": ";
121 /* Jump to the func. */
122 out
<< "goto f" << st
->eofAction
->actListId
<< ";\n";
129 unsigned int CSharpFGotoCodeGen::TO_STATE_ACTION( RedStateAp
*state
)
132 if ( state
->toStateAction
!= 0 )
133 act
= state
->toStateAction
->actListId
+1;
137 unsigned int CSharpFGotoCodeGen::FROM_STATE_ACTION( RedStateAp
*state
)
140 if ( state
->fromStateAction
!= 0 )
141 act
= state
->fromStateAction
->actListId
+1;
145 unsigned int CSharpFGotoCodeGen::EOF_ACTION( RedStateAp
*state
)
148 if ( state
->eofAction
!= 0 )
149 act
= state
->eofAction
->actListId
+1;
153 void CSharpFGotoCodeGen::writeData()
155 if ( redFsm
->anyToStateActions() ) {
156 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), TSA() );
162 if ( redFsm
->anyFromStateActions() ) {
163 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), FSA() );
164 FROM_STATE_ACTIONS();
169 if ( redFsm
->anyEofActions() ) {
170 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), EA() );
179 void CSharpFGotoCodeGen::writeExec()
182 outLabelUsed
= false;
186 if ( redFsm
->anyRegCurStateRef() )
187 out
<< " int _ps = 0;\n";
189 if ( redFsm
->anyConditions() )
190 out
<< " " << WIDE_ALPH_TYPE() << " _widec;\n";
195 " if ( " << P() << " == " << PE() << " )\n"
196 " goto _test_eof;\n";
199 if ( redFsm
->errState
!= 0 ) {
202 " if ( " << CS() << " == " << redFsm
->errState
->id
<< " )\n"
208 if ( redFsm
->anyFromStateActions() ) {
210 " switch ( " << FSA() << "[" << CS() << "] ) {\n";
211 FROM_STATE_ACTION_SWITCH();
218 " switch ( " << CS() << " ) {\n";
226 if ( redFsm
->anyRegActions() )
227 EXEC_ACTIONS() << "\n";
231 if ( redFsm
->anyToStateActions() ) {
233 " switch ( " << TSA() << "[" << CS() << "] ) {\n";
234 TO_STATE_ACTION_SWITCH();
240 if ( redFsm
->errState
!= 0 ) {
243 " if ( " << CS() << " == " << redFsm
->errState
->id
<< " )\n"
249 " if ( ++" << P() << " != " << PE() << " )\n"
254 " " << P() << " += 1;\n"
259 out
<< " _test_eof: {}\n";
261 if ( redFsm
->anyEofTrans() || redFsm
->anyEofActions() ) {
263 " if ( " << P() << " == " << EOFV() << " )\n"
266 if ( redFsm
->anyEofTrans() ) {
268 " switch ( " << CS() << " ) {\n";
270 for ( RedStateList::Iter st
= redFsm
->stateList
; st
.lte(); st
++ ) {
271 if ( st
->eofTrans
!= 0 )
272 out
<< " case " << st
->id
<< ": goto tr" << st
->eofTrans
->id
<< ";\n";
279 if ( redFsm
->anyEofActions() ) {
281 " switch ( " << EA() << "[" << CS() << "] ) {\n";
293 out
<< " _out: {}\n";