2 * Copyright 2004-2006 Adrian Thurston <thurston@complang.org>
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
29 std::ostream
&OCamlFFlatCodeGen::TO_STATE_ACTION( RedStateAp
*state
)
32 if ( state
->toStateAction
!= 0 )
33 act
= state
->toStateAction
->actListId
+1;
38 std::ostream
&OCamlFFlatCodeGen::FROM_STATE_ACTION( RedStateAp
*state
)
41 if ( state
->fromStateAction
!= 0 )
42 act
= state
->fromStateAction
->actListId
+1;
47 std::ostream
&OCamlFFlatCodeGen::EOF_ACTION( RedStateAp
*state
)
50 if ( state
->eofAction
!= 0 )
51 act
= state
->eofAction
->actListId
+1;
56 /* Write out the function for a transition. */
57 std::ostream
&OCamlFFlatCodeGen::TRANS_ACTION( RedTransAp
*trans
)
60 if ( trans
->action
!= 0 )
61 action
= trans
->action
->actListId
+1;
66 /* Write out the function switch. This switch is keyed on the values
67 * of the func index. */
68 std::ostream
&OCamlFFlatCodeGen::TO_STATE_ACTION_SWITCH()
70 /* Loop the actions. */
71 for ( GenActionTableMap::Iter redAct
= redFsm
->actionMap
; redAct
.lte(); redAct
++ ) {
72 if ( redAct
->numToStateRefs
> 0 ) {
73 /* Write the entry label. */
74 out
<< "\t| " << redAct
->actListId
+1 << " ->\n";
76 /* Write each action in the list of action items. */
77 for ( GenActionTable::Iter item
= redAct
->key
; item
.lte(); item
++ )
78 ACTION( out
, item
->value
, 0, false );
84 genLineDirective( out
);
88 /* Write out the function switch. This switch is keyed on the values
89 * of the func index. */
90 std::ostream
&OCamlFFlatCodeGen::FROM_STATE_ACTION_SWITCH()
92 /* Loop the actions. */
93 for ( GenActionTableMap::Iter redAct
= redFsm
->actionMap
; redAct
.lte(); redAct
++ ) {
94 if ( redAct
->numFromStateRefs
> 0 ) {
95 /* Write the entry label. */
96 out
<< "\t| " << redAct
->actListId
+1 << " ->\n";
98 /* Write each action in the list of action items. */
99 for ( GenActionTable::Iter item
= redAct
->key
; item
.lte(); item
++ )
100 ACTION( out
, item
->value
, 0, false );
106 genLineDirective( out
);
110 std::ostream
&OCamlFFlatCodeGen::EOF_ACTION_SWITCH()
112 /* Loop the actions. */
113 for ( GenActionTableMap::Iter redAct
= redFsm
->actionMap
; redAct
.lte(); redAct
++ ) {
114 if ( redAct
->numEofRefs
> 0 ) {
115 /* Write the entry label. */
116 out
<< "\t| " << redAct
->actListId
+1 << " ->\n";
118 /* Write each action in the list of action items. */
119 for ( GenActionTable::Iter item
= redAct
->key
; item
.lte(); item
++ )
120 ACTION( out
, item
->value
, 0, true );
126 genLineDirective( out
);
130 /* Write out the function switch. This switch is keyed on the values
131 * of the func index. */
132 std::ostream
&OCamlFFlatCodeGen::ACTION_SWITCH()
134 /* Loop the actions. */
135 for ( GenActionTableMap::Iter redAct
= redFsm
->actionMap
; redAct
.lte(); redAct
++ ) {
136 if ( redAct
->numTransRefs
> 0 ) {
137 /* Write the entry label. */
138 out
<< "\t| " << redAct
->actListId
+1 << " ->\n";
140 /* Write each action in the list of action items. */
141 for ( GenActionTable::Iter item
= redAct
->key
; item
.lte(); item
++ )
142 ACTION( out
, item
->value
, 0, false );
148 genLineDirective( out
);
152 void OCamlFFlatCodeGen::writeData()
154 if ( redFsm
->anyConditions() ) {
155 OPEN_ARRAY( WIDE_ALPH_TYPE(), CK() );
160 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxCondSpan
), CSP() );
165 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxCond
), C() );
170 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxCondIndexOffset
), CO() );
176 OPEN_ARRAY( WIDE_ALPH_TYPE(), K() );
181 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxSpan
), SP() );
186 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxFlatIndexOffset
), IO() );
191 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxIndex
), I() );
196 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxState
), TT() );
201 if ( redFsm
->anyActions() ) {
202 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActListId
), TA() );
208 if ( redFsm
->anyToStateActions() ) {
209 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), TSA() );
215 if ( redFsm
->anyFromStateActions() ) {
216 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActionLoc
), FSA() );
217 FROM_STATE_ACTIONS();
222 if ( redFsm
->anyEofActions() ) {
223 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxActListId
), EA() );
229 if ( redFsm
->anyEofTrans() ) {
230 OPEN_ARRAY( ARRAY_TYPE(redFsm
->maxIndexOffset
+1), ET() );
238 out
<< "type state = { mutable keys : int; mutable trans : int; }"
241 out
<< "exception Goto_match" << TOP_SEP();
242 out
<< "exception Goto_again" << TOP_SEP();
243 out
<< "exception Goto_eof_trans" << TOP_SEP();
246 void OCamlFFlatCodeGen::writeExec()
249 outLabelUsed
= false;
254 // " " << slenType << " _slen";
256 // if ( redFsm->anyRegCurStateRef() )
260 // out << " " << transType << " _trans";
262 // if ( redFsm->anyConditions() )
268 // " " << "int _keys;\n"
269 // " " << indsType << " _inds;\n";
271 " " << PTR_CONST() << WIDE_ALPH_TYPE() << POINTER() << "_keys;\n"
272 " " << PTR_CONST() << ARRAY_TYPE(redFsm->maxIndex) << POINTER() << "_inds;\n";*/
275 " let state = { keys = 0; trans = 0; } in\n"
276 " let rec do_start () =\n";
278 // if ( redFsm->anyConditions() ) {
280 // " " << condsType << " _conds;\n"
281 // " " << WIDE_ALPH_TYPE() << " _widec;\n";
287 " if " << P() << " = " << PE() << " then\n"
292 if ( redFsm
->errState
!= 0 ) {
295 " if " << vCS() << " = " << redFsm
->errState
->id
<< " then\n"
299 out
<< "\tdo_resume ()\n";
301 out
<< "and do_resume () =\n";
303 if ( redFsm
->anyFromStateActions() ) {
305 " begin match " << AT( FSA(), vCS() ) << " with\n";
306 FROM_STATE_ACTION_SWITCH();
312 if ( redFsm
->anyConditions() )
315 out
<< "\tbegin try\n";
317 out
<< "\twith Goto_match -> () end;\n";
319 out
<< "\tdo_eof_trans ()\n";
321 // if ( redFsm->anyEofTrans() )
322 out
<< "and do_eof_trans () =\n";
324 if ( redFsm
->anyRegCurStateRef() )
325 out
<< " let ps = " << vCS() << " in\n";
328 " " << vCS() << " <- " << AT( TT() ,"state.trans" ) << ";\n"
331 if ( redFsm
->anyRegActions() ) {
333 " begin try if " << AT( TA() , "state.trans" ) << " = 0 then\n"
334 " raise Goto_again;\n"
336 " match " << AT( TA(), "state.trans" ) << " with\n";
339 " with Goto_again -> () end;\n"
342 out
<< "\tdo_again ()\n";
344 // if ( redFsm->anyRegActions() || redFsm->anyActionGotos() ||
345 // redFsm->anyActionCalls() || redFsm->anyActionRets() )
346 out
<< "\tand do_again () =\n";
348 if ( redFsm
->anyToStateActions() ) {
350 " begin match " << AT( TSA(), vCS() ) << " with\n";
351 TO_STATE_ACTION_SWITCH();
357 if ( redFsm
->errState
!= 0 ) {
360 " match " << vCS() << " with\n"
361 "\t| " << redFsm
->errState
->id
<< " -> do_out ()\n"
365 out
<< "\t" << P() << " <- " << P() << " + 1;\n";
369 " if " << P() << " <> " << PE() << " then\n"
371 "\telse do_test_eof ()\n";
378 // if ( testEofUsed )
379 out
<< "and do_test_eof () =\n";
381 if ( redFsm
->anyEofTrans() || redFsm
->anyEofActions() ) {
383 " if " << P() << " = " << vEOF() << " then\n"
386 if ( redFsm
->anyEofTrans() ) {
388 " if " << AT( ET(), vCS() ) << " > 0 then\n"
390 " state.trans <- " << CAST(transType
) << "(" << AT( ET(), vCS() ) << " - 1);\n"
391 " raise Goto_eof_trans;\n"
395 if ( redFsm
->anyEofActions() ) {
397 " begin match " << AT( EA(), vCS() ) << " with\n";
404 " with Goto_again -> do_again ()\n"
405 " | Goto_eof_trans -> do_eof_trans () end\n"
414 out
<< " and do_out () = ()\n";
416 out
<< "\tin do_start ()\n";