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 "tabcodegen.h"
29 /* Determine if we should use indicies or not. */
30 void CSharpTabCodeGen::calcIndexSize()
32 int sizeWithInds = 0, sizeWithoutInds = 0;
34 /* Calculate cost of using with indicies. */
35 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
36 int totalIndex = st->outSingle.length() + st->outRange.length() +
37 (st->defTrans == 0 ? 0 : 1);
38 sizeWithInds += arrayTypeSize(redFsm->maxIndex) * totalIndex;
40 sizeWithInds += arrayTypeSize(redFsm->maxState) * redFsm->transSet.length();
41 if ( redFsm->anyActions() )
42 sizeWithInds += arrayTypeSize(redFsm->maxActionLoc) * redFsm->transSet.length();
44 /* Calculate the cost of not using indicies. */
45 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
46 int totalIndex = st->outSingle.length() + st->outRange.length() +
47 (st->defTrans == 0 ? 0 : 1);
48 sizeWithoutInds += arrayTypeSize(redFsm->maxState) * totalIndex;
49 if ( redFsm->anyActions() )
50 sizeWithoutInds += arrayTypeSize(redFsm->maxActionLoc) * totalIndex;
53 /* If using indicies reduces the size, use them. */
54 useIndicies = sizeWithInds < sizeWithoutInds;
57 std::ostream &CSharpTabCodeGen::TO_STATE_ACTION( RedStateAp *state )
60 if ( state->toStateAction != 0 )
61 act = state->toStateAction->location+1;
66 std::ostream &CSharpTabCodeGen::FROM_STATE_ACTION( RedStateAp *state )
69 if ( state->fromStateAction != 0 )
70 act = state->fromStateAction->location+1;
75 std::ostream &CSharpTabCodeGen::EOF_ACTION( RedStateAp *state )
78 if ( state->eofAction != 0 )
79 act = state->eofAction->location+1;
85 std::ostream &CSharpTabCodeGen::TRANS_ACTION( RedTransAp *trans )
87 /* If there are actions, emit them. Otherwise emit zero. */
89 if ( trans->action != 0 )
90 act = trans->action->location+1;
95 std::ostream &CSharpTabCodeGen::TO_STATE_ACTION_SWITCH()
97 /* Walk the list of functions, printing the cases. */
98 for ( ActionList::Iter act = actionList; act.lte(); act++ ) {
99 /* Write out referenced actions. */
100 if ( act->numToStateRefs > 0 ) {
101 /* Write the case label, the action and the case break. */
102 out << "\tcase " << act->actionId << ":\n";
103 ACTION( out, act, 0, false );
108 genLineDirective( out );
112 std::ostream &CSharpTabCodeGen::FROM_STATE_ACTION_SWITCH()
114 /* Walk the list of functions, printing the cases. */
115 for ( ActionList::Iter act = actionList; act.lte(); act++ ) {
116 /* Write out referenced actions. */
117 if ( act->numFromStateRefs > 0 ) {
118 /* Write the case label, the action and the case break. */
119 out << "\tcase " << act->actionId << ":\n";
120 ACTION( out, act, 0, false );
125 genLineDirective( out );
129 std::ostream &CSharpTabCodeGen::EOF_ACTION_SWITCH()
131 /* Walk the list of functions, printing the cases. */
132 for ( ActionList::Iter act = actionList; act.lte(); act++ ) {
133 /* Write out referenced actions. */
134 if ( act->numEofRefs > 0 ) {
135 /* Write the case label, the action and the case break. */
136 out << "\tcase " << act->actionId << ":\n";
137 ACTION( out, act, 0, true );
142 genLineDirective( out );
147 std::ostream &CSharpTabCodeGen::ACTION_SWITCH()
149 /* Walk the list of functions, printing the cases. */
150 for ( ActionList::Iter act = actionList; act.lte(); act++ ) {
151 /* Write out referenced actions. */
152 if ( act->numTransRefs > 0 ) {
153 /* Write the case label, the action and the case break. */
154 out << "\tcase " << act->actionId << ":\n";
155 ACTION( out, act, 0, false );
160 genLineDirective( out );
164 std::ostream &CSharpTabCodeGen::COND_OFFSETS()
167 int totalStateNum = 0, curKeyOffset = 0;
168 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
169 /* Write the key offset. */
173 if ( ++totalStateNum % IALL == 0 )
177 /* Move the key offset ahead. */
178 curKeyOffset += st->stateCondList.length();
184 std::ostream &CSharpTabCodeGen::KEY_OFFSETS()
187 int totalStateNum = 0, curKeyOffset = 0;
188 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
189 /* Write the key offset. */
193 if ( ++totalStateNum % IALL == 0 )
197 /* Move the key offset ahead. */
198 curKeyOffset += st->outSingle.length() + st->outRange.length()*2;
205 std::ostream &CSharpTabCodeGen::INDEX_OFFSETS()
208 int totalStateNum = 0, curIndOffset = 0;
209 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
210 /* Write the index offset. */
214 if ( ++totalStateNum % IALL == 0 )
218 /* Move the index offset ahead. */
219 curIndOffset += st->outSingle.length() + st->outRange.length();
220 if ( st->defTrans != 0 )
227 std::ostream &CSharpTabCodeGen::COND_LENS()
230 int totalStateNum = 0;
231 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
232 /* Write singles length. */
233 out << st->stateCondList.length();
236 if ( ++totalStateNum % IALL == 0 )
245 std::ostream &CSharpTabCodeGen::SINGLE_LENS()
248 int totalStateNum = 0;
249 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
250 /* Write singles length. */
251 out << st->outSingle.length();
254 if ( ++totalStateNum % IALL == 0 )
262 std::ostream &CSharpTabCodeGen::RANGE_LENS()
265 int totalStateNum = 0;
266 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
267 /* Emit length of range index. */
268 out << st->outRange.length();
271 if ( ++totalStateNum % IALL == 0 )
279 std::ostream &CSharpTabCodeGen::TO_STATE_ACTIONS()
282 int totalStateNum = 0;
283 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
284 /* Write any eof action. */
288 if ( ++totalStateNum % IALL == 0 )
296 std::ostream &CSharpTabCodeGen::FROM_STATE_ACTIONS()
299 int totalStateNum = 0;
300 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
301 /* Write any eof action. */
302 FROM_STATE_ACTION(st);
305 if ( ++totalStateNum % IALL == 0 )
313 std::ostream &CSharpTabCodeGen::EOF_ACTIONS()
316 int totalStateNum = 0;
317 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
318 /* Write any eof action. */
322 if ( ++totalStateNum % IALL == 0 )
330 std::ostream &CSharpTabCodeGen::EOF_TRANS()
333 int totalStateNum = 0;
334 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
335 /* Write any eof action. */
337 if ( st->eofTrans != 0 )
338 trans = st->eofTrans->id+1;
343 if ( ++totalStateNum % IALL == 0 )
352 std::ostream &CSharpTabCodeGen::COND_KEYS()
356 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
357 /* Loop the state's transitions. */
358 for ( StateCondList::Iter sc = st->stateCondList; sc.lte(); sc++ ) {
360 out << ALPHA_KEY( sc->lowKey ) << ", ";
361 if ( ++totalTrans % IALL == 0 )
365 out << ALPHA_KEY( sc->highKey ) << ", ";
366 if ( ++totalTrans % IALL == 0 )
371 /* Output one last number so we don't have to figure out when the last
372 * entry is and avoid writing a comma. */
377 std::ostream &CSharpTabCodeGen::COND_SPACES()
381 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
382 /* Loop the state's transitions. */
383 for ( StateCondList::Iter sc = st->stateCondList; sc.lte(); sc++ ) {
385 out << sc->condSpace->condSpaceId << ", ";
386 if ( ++totalTrans % IALL == 0 )
391 /* Output one last number so we don't have to figure out when the last
392 * entry is and avoid writing a comma. */
397 std::ostream &CSharpTabCodeGen::KEYS()
401 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
402 /* Loop the singles. */
403 for ( RedTransList::Iter stel = st->outSingle; stel.lte(); stel++ ) {
404 out << ALPHA_KEY( stel->lowKey ) << ", ";
405 if ( ++totalTrans % IALL == 0 )
409 /* Loop the state's transitions. */
410 for ( RedTransList::Iter rtel = st->outRange; rtel.lte(); rtel++ ) {
412 out << ALPHA_KEY( rtel->lowKey ) << ", ";
413 if ( ++totalTrans % IALL == 0 )
417 out << ALPHA_KEY( rtel->highKey ) << ", ";
418 if ( ++totalTrans % IALL == 0 )
423 /* Output one last number so we don't have to figure out when the last
424 * entry is and avoid writing a comma. */
425 out << "(char) " << 0 << "\n";
429 std::ostream &CSharpTabCodeGen::INDICIES()
433 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
434 /* Walk the singles. */
435 for ( RedTransList::Iter stel = st->outSingle; stel.lte(); stel++ ) {
436 out << stel->value->id << ", ";
437 if ( ++totalTrans % IALL == 0 )
441 /* Walk the ranges. */
442 for ( RedTransList::Iter rtel = st->outRange; rtel.lte(); rtel++ ) {
443 out << rtel->value->id << ", ";
444 if ( ++totalTrans % IALL == 0 )
448 /* The state's default index goes next. */
449 if ( st->defTrans != 0 ) {
450 out << st->defTrans->id << ", ";
451 if ( ++totalTrans % IALL == 0 )
456 /* Output one last number so we don't have to figure out when the last
457 * entry is and avoid writing a comma. */
462 std::ostream &CSharpTabCodeGen::TRANS_TARGS()
466 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
467 /* Walk the singles. */
468 for ( RedTransList::Iter stel = st->outSingle; stel.lte(); stel++ ) {
469 RedTransAp *trans = stel->value;
470 out << trans->targ->id << ", ";
471 if ( ++totalTrans % IALL == 0 )
475 /* Walk the ranges. */
476 for ( RedTransList::Iter rtel = st->outRange; rtel.lte(); rtel++ ) {
477 RedTransAp *trans = rtel->value;
478 out << trans->targ->id << ", ";
479 if ( ++totalTrans % IALL == 0 )
483 /* The state's default target state. */
484 if ( st->defTrans != 0 ) {
485 RedTransAp *trans = st->defTrans;
486 out << trans->targ->id << ", ";
487 if ( ++totalTrans % IALL == 0 )
492 /* Output one last number so we don't have to figure out when the last
493 * entry is and avoid writing a comma. */
499 std::ostream &CSharpTabCodeGen::TRANS_ACTIONS()
503 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
504 /* Walk the singles. */
505 for ( RedTransList::Iter stel = st->outSingle; stel.lte(); stel++ ) {
506 RedTransAp *trans = stel->value;
507 TRANS_ACTION( trans ) << ", ";
508 if ( ++totalTrans % IALL == 0 )
512 /* Walk the ranges. */
513 for ( RedTransList::Iter rtel = st->outRange; rtel.lte(); rtel++ ) {
514 RedTransAp *trans = rtel->value;
515 TRANS_ACTION( trans ) << ", ";
516 if ( ++totalTrans % IALL == 0 )
520 /* The state's default index goes next. */
521 if ( st->defTrans != 0 ) {
522 RedTransAp *trans = st->defTrans;
523 TRANS_ACTION( trans ) << ", ";
524 if ( ++totalTrans % IALL == 0 )
529 /* Output one last number so we don't have to figure out when the last
530 * entry is and avoid writing a comma. */
535 std::ostream &CSharpTabCodeGen::TRANS_TARGS_WI()
537 /* Transitions must be written ordered by their id. */
538 RedTransAp **transPtrs = new RedTransAp*[redFsm->transSet.length()];
539 for ( TransApSet::Iter trans = redFsm->transSet; trans.lte(); trans++ )
540 transPtrs[trans->id] = trans;
542 /* Keep a count of the num of items in the array written. */
545 for ( int t = 0; t < redFsm->transSet.length(); t++ ) {
546 /* Write out the target state. */
547 RedTransAp *trans = transPtrs[t];
548 out << trans->targ->id;
549 if ( t < redFsm->transSet.length()-1 ) {
551 if ( ++totalStates % IALL == 0 )
561 std::ostream &CSharpTabCodeGen::TRANS_ACTIONS_WI()
563 /* Transitions must be written ordered by their id. */
564 RedTransAp **transPtrs = new RedTransAp*[redFsm->transSet.length()];
565 for ( TransApSet::Iter trans = redFsm->transSet; trans.lte(); trans++ )
566 transPtrs[trans->id] = trans;
568 /* Keep a count of the num of items in the array written. */
571 for ( int t = 0; t < redFsm->transSet.length(); t++ ) {
572 /* Write the function for the transition. */
573 RedTransAp *trans = transPtrs[t];
574 TRANS_ACTION( trans );
575 if ( t < redFsm->transSet.length()-1 ) {
577 if ( ++totalAct % IALL == 0 )
586 void CSharpTabCodeGen::GOTO( ostream &ret, int gotoDest, bool inFinish )
588 ret << "{" << CS() << " = " << gotoDest << "; " <<
589 CTRL_FLOW() << "goto _again;}";
592 void CSharpTabCodeGen::GOTO_EXPR( ostream &ret, InlineItem *ilItem, bool inFinish )
594 ret << "{" << CS() << " = (";
595 INLINE_LIST( ret, ilItem->children, 0, inFinish );
596 ret << "); " << CTRL_FLOW() << "goto _again;}";
599 void CSharpTabCodeGen::CURS( ostream &ret, bool inFinish )
604 void CSharpTabCodeGen::TARGS( ostream &ret, bool inFinish, int targState )
606 ret << "(" << CS() << ")";
609 void CSharpTabCodeGen::NEXT( ostream &ret, int nextDest, bool inFinish )
611 ret << CS() << " = " << nextDest << ";";
614 void CSharpTabCodeGen::NEXT_EXPR( ostream &ret, InlineItem *ilItem, bool inFinish )
616 ret << CS() << " = (";
617 INLINE_LIST( ret, ilItem->children, 0, inFinish );
621 void CSharpTabCodeGen::CALL( ostream &ret, int callDest, int targState, bool inFinish )
623 if ( prePushExpr != 0 ) {
625 INLINE_LIST( ret, prePushExpr, 0, false );
628 ret << "{" << STACK() << "[" << TOP() << "++] = " << CS() << "; " << CS() << " = " <<
629 callDest << "; " << CTRL_FLOW() << "goto _again;}";
631 if ( prePushExpr != 0 )
635 void CSharpTabCodeGen::CALL_EXPR( ostream &ret, InlineItem *ilItem, int targState, bool inFinish )
637 if ( prePushExpr != 0 ) {
639 INLINE_LIST( ret, prePushExpr, 0, false );
642 ret << "{" << STACK() << "[" << TOP() << "++] = " << CS() << "; " << CS() << " = (";
643 INLINE_LIST( ret, ilItem->children, targState, inFinish );
644 ret << "); " << CTRL_FLOW() << "goto _again;}";
646 if ( prePushExpr != 0 )
650 void CSharpTabCodeGen::RET( ostream &ret, bool inFinish )
652 ret << "{" << CS() << " = " << STACK() << "[--" <<
655 if ( postPopExpr != 0 ) {
657 INLINE_LIST( ret, postPopExpr, 0, false );
661 ret << CTRL_FLOW() << "goto _again;}";
664 void CSharpTabCodeGen::BREAK( ostream &ret, int targState )
667 ret << "{" << P() << "++; " << CTRL_FLOW() << "goto _out; }";
670 void CSharpTabCodeGen::writeData()
672 /* If there are any transtion functions then output the array. If there
673 * are none, don't bother emitting an empty array that won't be used. */
674 if ( redFsm->anyActions() ) {
675 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActArrItem), A() );
681 if ( redFsm->anyConditions() ) {
682 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxCondOffset), CO() );
687 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxCondLen), CL() );
692 OPEN_ARRAY( WIDE_ALPH_TYPE(), CK() );
697 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxCondSpaceId), C() );
703 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxKeyOffset), KO() );
708 OPEN_ARRAY( WIDE_ALPH_TYPE(), K() );
713 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxSingleLen), SL() );
718 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxRangeLen), RL() );
723 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxIndexOffset), IO() );
729 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxIndex), I() );
734 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxState), TT() );
739 if ( redFsm->anyActions() ) {
740 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), TA() );
747 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxState), TT() );
752 if ( redFsm->anyActions() ) {
753 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), TA() );
760 if ( redFsm->anyToStateActions() ) {
761 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), TSA() );
767 if ( redFsm->anyFromStateActions() ) {
768 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), FSA() );
769 FROM_STATE_ACTIONS();
774 if ( redFsm->anyEofActions() ) {
775 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), EA() );
781 if ( redFsm->anyEofTrans() ) {
782 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxIndex+1), ET() );
791 void CSharpTabCodeGen::LOCATE_TRANS()
794 " _keys = " << KO() + "[" + CS() + "]" << ";\n"
795 " _trans = " << CAST(transType) << IO() << "[" << CS() << "];\n"
797 " _klen = " << SL() << "[" << CS() << "];\n"
798 " if ( _klen > 0 ) {\n"
799 " " << signedKeysType << " _lower = _keys;\n"
800 " " << signedKeysType << " _mid;\n"
801 " " << signedKeysType << " _upper = " << CAST(signedKeysType) <<
802 " (_keys + _klen - 1);\n"
804 " if ( _upper < _lower )\n"
807 " _mid = " << CAST(signedKeysType) <<
808 " (_lower + ((_upper-_lower) >> 1));\n"
809 " if ( " << GET_WIDE_KEY() << " < " << K() << "[_mid] )\n"
810 " _upper = " << CAST(signedKeysType) << " (_mid - 1);\n"
811 " else if ( " << GET_WIDE_KEY() << " > " << K() << "[_mid] )\n"
812 " _lower = " << CAST(signedKeysType) << " (_mid + 1);\n"
814 " _trans += " << CAST(transType) << " (_mid - _keys);\n"
818 " _keys += " << CAST(keysType) << " _klen;\n"
819 " _trans += " << CAST(transType) << " _klen;\n"
822 " _klen = " << RL() << "[" << CS() << "];\n"
823 " if ( _klen > 0 ) {\n"
824 " " << signedKeysType << " _lower = _keys;\n"
825 " " << signedKeysType << " _mid;\n"
826 " " << signedKeysType << " _upper = " << CAST(signedKeysType) <<
827 " (_keys + (_klen<<1) - 2);\n"
829 " if ( _upper < _lower )\n"
832 " _mid = " << CAST(signedKeysType) <<
833 " (_lower + (((_upper-_lower) >> 1) & ~1));\n"
834 " if ( " << GET_WIDE_KEY() << " < " << K() << "[_mid] )\n"
835 " _upper = " << CAST(signedKeysType) << " (_mid - 2);\n"
836 " else if ( " << GET_WIDE_KEY() << " > " << K() << "[_mid+1] )\n"
837 " _lower = " << CAST(signedKeysType) << " (_mid + 2);\n"
839 " _trans += " << CAST(transType) << "((_mid - _keys)>>1);\n"
843 " _trans += " << CAST(transType) << " _klen;\n"
848 void CSharpTabCodeGen::COND_TRANSLATE()
851 " _widec = " << GET_KEY() << ";\n"
852 " _klen = " << CL() << "[" << CS() << "];\n"
853 " _keys = " << CAST(keysType) << " ("<< CO() << "[" << CS() << "]*2);\n"
854 " if ( _klen > 0 ) {\n"
855 " " << signedKeysType << " _lower = _keys;\n"
856 " " << signedKeysType << " _mid;\n"
857 " " << signedKeysType << " _upper = " << CAST(signedKeysType) <<
858 " (_keys + (_klen<<1) - 2);\n"
860 " if ( _upper < _lower )\n"
863 " _mid = " << CAST(signedKeysType) <<
864 " (_lower + (((_upper-_lower) >> 1) & ~1));\n"
865 " if ( " << GET_WIDE_KEY() << " < " << CK() << "[_mid] )\n"
866 " _upper = " << CAST(signedKeysType) << " (_mid - 2);\n"
867 " else if ( " << GET_WIDE_KEY() << " > " << CK() << "[_mid+1] )\n"
868 " _lower = " << CAST(signedKeysType) << " (_mid + 2);\n"
870 " switch ( " << C() << "[" << CO() << "[" << CS() << "]"
871 " + ((_mid - _keys)>>1)] ) {\n";
873 for ( CondSpaceList::Iter csi = condSpaceList; csi.lte(); csi++ ) {
874 CondSpace *condSpace = csi;
875 out << " case " << condSpace->condSpaceId << ": {\n";
876 out << TABS(2) << "_widec = " << CAST(WIDE_ALPH_TYPE()) << "(" <<
877 KEY(condSpace->baseKey) << " + (" << GET_KEY() <<
878 " - " << KEY(keyOps->minKey) << "));\n";
880 for ( CondSet::Iter csi = condSpace->condSet; csi.lte(); csi++ ) {
881 out << TABS(2) << "if ( ";
882 CONDITION( out, *csi );
883 Size condValOffset = ((1 << csi.pos()) * keyOps->alphSize());
884 out << " ) _widec += " << condValOffset << ";\n";
903 void CSharpTabCodeGen::writeExec()
906 outLabelUsed = false;
911 " " << klenType << " _klen";
913 if ( redFsm->anyRegCurStateRef() )
918 " " << transType << " _trans;\n";
920 if ( redFsm->anyConditions() )
921 out << " " << WIDE_ALPH_TYPE() << " _widec;\n";
923 if ( redFsm->anyToStateActions() || redFsm->anyRegActions()
924 || redFsm->anyFromStateActions() )
927 " " << actsType << " _acts;\n"
928 " " << nactsType << " _nacts;\n";
932 " " << keysType << " _keys;\n"
934 // " " << PTR_CONST() << WIDE_ALPH_TYPE() << POINTER() << "_keys;\n"
939 " if ( " << P() << " == " << PE() << " )\n"
940 " goto _test_eof;\n";
943 if ( redFsm->errState != 0 ) {
946 " if ( " << CS() << " == " << redFsm->errState->id << " )\n"
952 if ( redFsm->anyFromStateActions() ) {
954 " _acts = " << FSA() << "[" + CS() + "]" << ";\n"
955 " _nacts = " << A() << "[_acts++];\n"
956 " while ( _nacts-- > 0 ) {\n"
957 " switch ( " << A() << "[_acts++] ) {\n";
958 FROM_STATE_ACTION_SWITCH();
965 if ( redFsm->anyConditions() )
973 out << " _trans = " << CAST(transType) << I() << "[_trans];\n";
975 if ( redFsm->anyEofTrans() )
976 out << "_eof_trans:\n";
978 if ( redFsm->anyRegCurStateRef() )
979 out << " _ps = " << CS() << ";\n";
982 " " << CS() << " = " << TT() << "[_trans];\n"
985 if ( redFsm->anyRegActions() ) {
987 " if ( " << TA() << "[_trans] == 0 )\n"
990 " _acts = " << TA() << "[_trans]" << ";\n"
991 " _nacts = " << A() << "[_acts++];\n"
992 " while ( _nacts-- > 0 )\n {\n"
993 " switch ( " << A() << "[_acts++] )\n {\n";
1001 if ( redFsm->anyRegActions() || redFsm->anyActionGotos() ||
1002 redFsm->anyActionCalls() || redFsm->anyActionRets() )
1005 if ( redFsm->anyToStateActions() ) {
1007 " _acts = " << TSA() << "[" << CS() << "]" << ";\n"
1008 " _nacts = " << A() << "[_acts++];\n"
1009 " while ( _nacts-- > 0 ) {\n"
1010 " switch ( " << A() << "[_acts++] ) {\n";
1011 TO_STATE_ACTION_SWITCH();
1018 if ( redFsm->errState != 0 ) {
1019 outLabelUsed = true;
1021 " if ( " << CS() << " == " << redFsm->errState->id << " )\n"
1027 " if ( ++" << P() << " != " << PE() << " )\n"
1032 " " << P() << " += 1;\n"
1037 out << " _test_eof: {}\n";
1039 if ( redFsm->anyEofTrans() || redFsm->anyEofActions() ) {
1041 " if ( " << P() << " == " << EOFV() << " )\n"
1044 if ( redFsm->anyEofTrans() ) {
1046 " if ( " << ET() << "[" << CS() << "] > 0 ) {\n"
1047 " _trans = " << CAST(transType) << " (" << ET() <<
1048 "[" << CS() << "] - 1);\n"
1049 " goto _eof_trans;\n"
1053 if ( redFsm->anyEofActions() ) {
1055 " " << actsType << " __acts = " <<
1056 EA() << "[" << CS() << "]" << ";\n"
1057 " " << nactsType << " __nacts = " <<
1058 A() << "[__acts++];\n"
1059 " while ( __nacts-- > 0 ) {\n"
1060 " switch ( " << A() << "[__acts++] ) {\n";
1061 EOF_ACTION_SWITCH();
1073 out << " _out: {}\n";
1078 void CSharpTabCodeGen::initVarTypes()
1080 int klenMax = MAX(MAX(redFsm->maxCondLen, redFsm->maxRangeLen),
1081 redFsm->maxSingleLen);
1082 int keysMax = MAX(MAX(redFsm->maxKeyOffset, klenMax),
1083 redFsm->maxCondOffset);
1084 int transMax = MAX(MAX(redFsm->maxIndex+1, redFsm->maxIndexOffset), keysMax);
1085 transMax = MAX(transMax, klenMax);
1086 transType = ARRAY_TYPE(transMax);
1087 klenType = ARRAY_TYPE(klenMax);
1088 keysType = ARRAY_TYPE(keysMax);
1089 signedKeysType = ARRAY_TYPE(keysMax, true);
1090 actsType = ARRAY_TYPE(redFsm->maxActionLoc);
1091 nactsType = ARRAY_TYPE(redFsm->maxActArrItem);