2 * Copyright 2006-2007 Adrian Thurston <thurston@cs.queensu.ca>
3 * 2007 Colin Fleming <colin.fleming@caverock.com>
6 /* This file is part of Ragel.
8 * Ragel is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * Ragel is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with Ragel; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 #include "rlgen-java.h"
24 #include "javacodegen.h"
30 /* Integer array line length. */
33 /* Static array initialization item count
34 * (should be multiple of IALL). */
45 using std::ostringstream;
49 void lineDirective( ostream &out, char *fileName, int line )
51 /* Write the preprocessor line info for to the input file. */
52 out << "// line " << line << " \"";
53 for ( char *pc = fileName; *pc != 0; pc++ ) {
62 void genLineDirective( ostream &out )
64 std::streambuf *sbuf = out.rdbuf();
65 output_filter *filter = static_cast<output_filter*>(sbuf);
66 lineDirective( out, filter->fileName, filter->line + 1 );
69 void JavaTabCodeGen::GOTO( ostream &ret, int gotoDest, bool inFinish )
71 ret << "{" << CS() << " = " << gotoDest << "; _goto_targ = " << _again << "; " <<
72 CTRL_FLOW() << "continue _goto;}";
75 void JavaTabCodeGen::GOTO_EXPR( ostream &ret, InlineItem *ilItem, bool inFinish )
77 ret << "{" << CS() << " = (";
78 INLINE_LIST( ret, ilItem->children, 0, inFinish );
79 ret << "); _goto_targ = " << _again << "; " << CTRL_FLOW() << "continue _goto;}";
82 void JavaTabCodeGen::CALL( ostream &ret, int callDest, int targState, bool inFinish )
84 if ( prePushExpr != 0 ) {
86 INLINE_LIST( ret, prePushExpr, 0, false );
89 ret << "{" << STACK() << "[" << TOP() << "++] = " << CS() << "; " << CS() << " = " <<
90 callDest << "; _goto_targ = " << _again << "; " << CTRL_FLOW() << "continue _goto;}";
92 if ( prePushExpr != 0 )
96 void JavaTabCodeGen::CALL_EXPR( ostream &ret, InlineItem *ilItem, int targState, bool inFinish )
98 if ( prePushExpr != 0 ) {
100 INLINE_LIST( ret, prePushExpr, 0, false );
103 ret << "{" << STACK() << "[" << TOP() << "++] = " << CS() << "; " << CS() << " = (";
104 INLINE_LIST( ret, ilItem->children, targState, inFinish );
105 ret << "); _goto_targ = " << _again << "; " << CTRL_FLOW() << "continue _goto;}";
107 if ( prePushExpr != 0 )
111 void JavaTabCodeGen::RET( ostream &ret, bool inFinish )
113 ret << "{" << CS() << " = " << STACK() << "[--" << TOP() << "];";
115 if ( postPopExpr != 0 ) {
117 INLINE_LIST( ret, postPopExpr, 0, false );
121 ret << "_goto_targ = " << _again << "; " << CTRL_FLOW() << "continue _goto;}";
124 void JavaTabCodeGen::BREAK( ostream &ret, int targState )
126 ret << "{ " << P() << " += 1; _goto_targ = " << _out << "; " <<
127 CTRL_FLOW() << " continue _goto;}";
130 void JavaTabCodeGen::NEXT( ostream &ret, int nextDest, bool inFinish )
132 ret << CS() << " = " << nextDest << ";";
135 void JavaTabCodeGen::NEXT_EXPR( ostream &ret, InlineItem *ilItem, bool inFinish )
137 ret << CS() << " = (";
138 INLINE_LIST( ret, ilItem->children, 0, inFinish );
142 void JavaTabCodeGen::EXEC( ostream &ret, InlineItem *item, int targState, int inFinish )
144 /* The parser gives fexec two children. The double brackets are for D
145 * code. If the inline list is a single word it will get interpreted as a
146 * C-style cast by the D compiler. */
147 ret << "{" << P() << " = ((";
148 INLINE_LIST( ret, item->children, targState, inFinish );
152 /* Write out an inline tree structure. Walks the list and possibly calls out
153 * to virtual functions than handle language specific items in the tree. */
154 void JavaTabCodeGen::INLINE_LIST( ostream &ret, InlineList *inlineList,
155 int targState, bool inFinish )
157 for ( InlineList::Iter item = *inlineList; item.lte(); item++ ) {
158 switch ( item->type ) {
159 case InlineItem::Text:
162 case InlineItem::Goto:
163 GOTO( ret, item->targState->id, inFinish );
165 case InlineItem::Call:
166 CALL( ret, item->targState->id, targState, inFinish );
168 case InlineItem::Next:
169 NEXT( ret, item->targState->id, inFinish );
171 case InlineItem::Ret:
172 RET( ret, inFinish );
174 case InlineItem::PChar:
177 case InlineItem::Char:
180 case InlineItem::Hold:
183 case InlineItem::Exec:
184 EXEC( ret, item, targState, inFinish );
186 case InlineItem::Curs:
189 case InlineItem::Targs:
190 ret << "(" << CS() << ")";
192 case InlineItem::Entry:
193 ret << item->targState->id;
195 case InlineItem::GotoExpr:
196 GOTO_EXPR( ret, item, inFinish );
198 case InlineItem::CallExpr:
199 CALL_EXPR( ret, item, targState, inFinish );
201 case InlineItem::NextExpr:
202 NEXT_EXPR( ret, item, inFinish );
204 case InlineItem::LmSwitch:
205 LM_SWITCH( ret, item, targState, inFinish );
207 case InlineItem::LmSetActId:
208 SET_ACT( ret, item );
210 case InlineItem::LmSetTokEnd:
211 SET_TOKEND( ret, item );
213 case InlineItem::LmGetTokEnd:
214 GET_TOKEND( ret, item );
216 case InlineItem::LmInitTokStart:
217 INIT_TOKSTART( ret, item );
219 case InlineItem::LmInitAct:
220 INIT_ACT( ret, item );
222 case InlineItem::LmSetTokStart:
223 SET_TOKSTART( ret, item );
225 case InlineItem::SubAction:
226 SUB_ACTION( ret, item, targState, inFinish );
228 case InlineItem::Break:
229 BREAK( ret, targState );
235 string JavaTabCodeGen::DATA_PREFIX()
238 return FSM_NAME() + "_";
242 /* Emit the alphabet data type. */
243 string JavaTabCodeGen::ALPH_TYPE()
245 string ret = keyOps->alphType->data1;
246 if ( keyOps->alphType->data2 != 0 ) {
248 ret += + keyOps->alphType->data2;
253 /* Emit the alphabet data type. */
254 string JavaTabCodeGen::WIDE_ALPH_TYPE()
257 if ( redFsm->maxKey <= keyOps->maxKey )
260 long long maxKeyVal = redFsm->maxKey.getLongLong();
261 HostType *wideType = keyOps->typeSubsumes( keyOps->isSigned, maxKeyVal );
262 assert( wideType != 0 );
264 ret = wideType->data1;
265 if ( wideType->data2 != 0 ) {
267 ret += wideType->data2;
275 void JavaTabCodeGen::COND_TRANSLATE()
278 " _widec = " << GET_KEY() << ";\n"
279 " _keys = " << CO() << "[" << CS() << "]*2\n;"
280 " _klen = " << CL() << "[" << CS() << "];\n"
281 " if ( _klen > 0 ) {\n"
282 " int _lower = _keys\n;"
284 " int _upper = _keys + (_klen<<1) - 2;\n"
286 " if ( _upper < _lower )\n"
289 " _mid = _lower + (((_upper-_lower) >> 1) & ~1);\n"
290 " if ( " << GET_WIDE_KEY() << " < " << CK() << "[_mid] )\n"
291 " _upper = _mid - 2;\n"
292 " else if ( " << GET_WIDE_KEY() << " > " << CK() << "[_mid+1] )\n"
293 " _lower = _mid + 2;\n"
295 " switch ( " << C() << "[" << CO() << "[" << CS() << "]"
296 " + ((_mid - _keys)>>1)] ) {\n"
299 for ( CondSpaceList::Iter csi = condSpaceList; csi.lte(); csi++ ) {
300 CondSpace *condSpace = csi;
301 out << " case " << condSpace->condSpaceId << ": {\n";
302 out << TABS(2) << "_widec = " << KEY(condSpace->baseKey) <<
303 " + (" << GET_KEY() << " - " << KEY(keyOps->minKey) << ");\n";
305 for ( CondSet::Iter csi = condSpace->condSet; csi.lte(); csi++ ) {
306 out << TABS(2) << "if ( ";
307 CONDITION( out, *csi );
308 Size condValOffset = ((1 << csi.pos()) * keyOps->alphSize());
309 out << " ) _widec += " << condValOffset << ";\n";
327 void JavaTabCodeGen::LOCATE_TRANS()
331 " _keys = " << KO() << "[" << CS() << "]" << ";\n"
332 " _trans = " << IO() << "[" << CS() << "];\n"
333 " _klen = " << SL() << "[" << CS() << "];\n"
334 " if ( _klen > 0 ) {\n"
335 " int _lower = _keys;\n"
337 " int _upper = _keys + _klen - 1;\n"
339 " if ( _upper < _lower )\n"
342 " _mid = _lower + ((_upper-_lower) >> 1);\n"
343 " if ( " << GET_WIDE_KEY() << " < " << K() << "[_mid] )\n"
344 " _upper = _mid - 1;\n"
345 " else if ( " << GET_WIDE_KEY() << " > " << K() << "[_mid] )\n"
346 " _lower = _mid + 1;\n"
348 " _trans += (_mid - _keys);\n"
353 " _trans += _klen;\n"
356 " _klen = " << RL() << "[" << CS() << "];\n"
357 " if ( _klen > 0 ) {\n"
358 " int _lower = _keys;\n"
360 " int _upper = _keys + (_klen<<1) - 2;\n"
362 " if ( _upper < _lower )\n"
365 " _mid = _lower + (((_upper-_lower) >> 1) & ~1);\n"
366 " if ( " << GET_WIDE_KEY() << " < " << K() << "[_mid] )\n"
367 " _upper = _mid - 2;\n"
368 " else if ( " << GET_WIDE_KEY() << " > " << K() << "[_mid+1] )\n"
369 " _lower = _mid + 2;\n"
371 " _trans += ((_mid - _keys)>>1);\n"
375 " _trans += _klen;\n"
377 " } while (false);\n"
381 /* Determine if we should use indicies or not. */
382 void JavaTabCodeGen::calcIndexSize()
384 int sizeWithInds = 0, sizeWithoutInds = 0;
386 /* Calculate cost of using with indicies. */
387 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
388 int totalIndex = st->outSingle.length() + st->outRange.length() +
389 (st->defTrans == 0 ? 0 : 1);
390 sizeWithInds += arrayTypeSize(redFsm->maxIndex) * totalIndex;
392 sizeWithInds += arrayTypeSize(redFsm->maxState) * redFsm->transSet.length();
393 if ( redFsm->anyActions() )
394 sizeWithInds += arrayTypeSize(redFsm->maxActionLoc) * redFsm->transSet.length();
396 /* Calculate the cost of not using indicies. */
397 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
398 int totalIndex = st->outSingle.length() + st->outRange.length() +
399 (st->defTrans == 0 ? 0 : 1);
400 sizeWithoutInds += arrayTypeSize(redFsm->maxState) * totalIndex;
401 if ( redFsm->anyActions() )
402 sizeWithoutInds += arrayTypeSize(redFsm->maxActionLoc) * totalIndex;
405 /* If using indicies reduces the size, use them. */
406 useIndicies = sizeWithInds < sizeWithoutInds;
409 int JavaTabCodeGen::TO_STATE_ACTION( RedStateAp *state )
412 if ( state->toStateAction != 0 )
413 act = state->toStateAction->location+1;
417 int JavaTabCodeGen::FROM_STATE_ACTION( RedStateAp *state )
420 if ( state->fromStateAction != 0 )
421 act = state->fromStateAction->location+1;
425 int JavaTabCodeGen::EOF_ACTION( RedStateAp *state )
428 if ( state->eofAction != 0 )
429 act = state->eofAction->location+1;
434 int JavaTabCodeGen::TRANS_ACTION( RedTransAp *trans )
436 /* If there are actions, emit them. Otherwise emit zero. */
438 if ( trans->action != 0 )
439 act = trans->action->location+1;
443 std::ostream &JavaTabCodeGen::TO_STATE_ACTION_SWITCH()
445 /* Walk the list of functions, printing the cases. */
446 for ( ActionList::Iter act = actionList; act.lte(); act++ ) {
447 /* Write out referenced actions. */
448 if ( act->numToStateRefs > 0 ) {
449 /* Write the case label, the action and the case break. */
450 out << "\tcase " << act->actionId << ":\n";
451 ACTION( out, act, 0, false );
456 genLineDirective( out );
460 std::ostream &JavaTabCodeGen::FROM_STATE_ACTION_SWITCH()
462 /* Walk the list of functions, printing the cases. */
463 for ( ActionList::Iter act = actionList; act.lte(); act++ ) {
464 /* Write out referenced actions. */
465 if ( act->numFromStateRefs > 0 ) {
466 /* Write the case label, the action and the case break. */
467 out << "\tcase " << act->actionId << ":\n";
468 ACTION( out, act, 0, false );
473 genLineDirective( out );
477 std::ostream &JavaTabCodeGen::EOF_ACTION_SWITCH()
479 /* Walk the list of functions, printing the cases. */
480 for ( ActionList::Iter act = actionList; act.lte(); act++ ) {
481 /* Write out referenced actions. */
482 if ( act->numEofRefs > 0 ) {
483 /* Write the case label, the action and the case break. */
484 out << "\tcase " << act->actionId << ":\n";
485 ACTION( out, act, 0, true );
490 genLineDirective( out );
495 std::ostream &JavaTabCodeGen::ACTION_SWITCH()
497 /* Walk the list of functions, printing the cases. */
498 for ( ActionList::Iter act = actionList; act.lte(); act++ ) {
499 /* Write out referenced actions. */
500 if ( act->numTransRefs > 0 ) {
501 /* Write the case label, the action and the case break. */
502 out << "\tcase " << act->actionId << ":\n";
503 ACTION( out, act, 0, false );
508 genLineDirective( out );
512 std::ostream &JavaTabCodeGen::COND_OFFSETS()
514 int curKeyOffset = 0;
515 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
516 /* Write the key offset. */
517 ARRAY_ITEM( INT(curKeyOffset), st.last() );
519 /* Move the key offset ahead. */
520 curKeyOffset += st->stateCondList.length();
525 std::ostream &JavaTabCodeGen::KEY_OFFSETS()
527 int curKeyOffset = 0;
528 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
529 /* Write the key offset. */
530 ARRAY_ITEM( INT(curKeyOffset), st.last() );
532 /* Move the key offset ahead. */
533 curKeyOffset += st->outSingle.length() + st->outRange.length()*2;
539 std::ostream &JavaTabCodeGen::INDEX_OFFSETS()
541 int curIndOffset = 0;
542 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
543 /* Write the index offset. */
544 ARRAY_ITEM( INT(curIndOffset), st.last() );
546 /* Move the index offset ahead. */
547 curIndOffset += st->outSingle.length() + st->outRange.length();
548 if ( st->defTrans != 0 )
554 std::ostream &JavaTabCodeGen::COND_LENS()
556 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
557 /* Write singles length. */
558 ARRAY_ITEM( INT(st->stateCondList.length()), st.last() );
564 std::ostream &JavaTabCodeGen::SINGLE_LENS()
566 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
567 /* Write singles length. */
568 ARRAY_ITEM( INT(st->outSingle.length()), st.last() );
573 std::ostream &JavaTabCodeGen::RANGE_LENS()
575 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
576 /* Emit length of range index. */
577 ARRAY_ITEM( INT(st->outRange.length()), st.last() );
582 std::ostream &JavaTabCodeGen::TO_STATE_ACTIONS()
584 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
585 /* Write any eof action. */
586 ARRAY_ITEM( INT(TO_STATE_ACTION(st)), st.last() );
591 std::ostream &JavaTabCodeGen::FROM_STATE_ACTIONS()
593 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
594 /* Write any eof action. */
595 ARRAY_ITEM( INT(FROM_STATE_ACTION(st)), st.last() );
600 std::ostream &JavaTabCodeGen::EOF_ACTIONS()
602 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
603 /* Write any eof action. */
604 ARRAY_ITEM( INT(EOF_ACTION(st)), st.last() );
609 std::ostream &JavaTabCodeGen::EOF_TRANS()
611 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
612 /* Write any eof action. */
614 if ( st->eofTrans != 0 )
615 trans = st->eofTrans->id+1;
617 /* Write any eof action. */
618 ARRAY_ITEM( INT(trans), st.last() );
624 std::ostream &JavaTabCodeGen::COND_KEYS()
626 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
627 /* Loop the state's transitions. */
628 for ( StateCondList::Iter sc = st->stateCondList; sc.lte(); sc++ ) {
630 ARRAY_ITEM( KEY( sc->lowKey ), false );
631 ARRAY_ITEM( KEY( sc->highKey ), false );
635 /* Output one last number so we don't have to figure out when the last
636 * entry is and avoid writing a comma. */
637 ARRAY_ITEM( INT(0), true );
641 std::ostream &JavaTabCodeGen::COND_SPACES()
643 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
644 /* Loop the state's transitions. */
645 for ( StateCondList::Iter sc = st->stateCondList; sc.lte(); sc++ ) {
647 ARRAY_ITEM( KEY( sc->condSpace->condSpaceId ), false );
651 /* Output one last number so we don't have to figure out when the last
652 * entry is and avoid writing a comma. */
653 ARRAY_ITEM( INT(0), true );
657 std::ostream &JavaTabCodeGen::KEYS()
659 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
660 /* Loop the singles. */
661 for ( RedTransList::Iter stel = st->outSingle; stel.lte(); stel++ ) {
662 ARRAY_ITEM( KEY( stel->lowKey ), false );
665 /* Loop the state's transitions. */
666 for ( RedTransList::Iter rtel = st->outRange; rtel.lte(); rtel++ ) {
668 ARRAY_ITEM( KEY( rtel->lowKey ), false );
671 ARRAY_ITEM( KEY( rtel->highKey ), false );
675 /* Output one last number so we don't have to figure out when the last
676 * entry is and avoid writing a comma. */
677 ARRAY_ITEM( INT(0), true );
681 std::ostream &JavaTabCodeGen::INDICIES()
683 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
684 /* Walk the singles. */
685 for ( RedTransList::Iter stel = st->outSingle; stel.lte(); stel++ ) {
686 ARRAY_ITEM( KEY( stel->value->id ), false );
689 /* Walk the ranges. */
690 for ( RedTransList::Iter rtel = st->outRange; rtel.lte(); rtel++ ) {
691 ARRAY_ITEM( KEY( rtel->value->id ), false );
694 /* The state's default index goes next. */
695 if ( st->defTrans != 0 ) {
696 ARRAY_ITEM( KEY( st->defTrans->id ), false );
700 /* Output one last number so we don't have to figure out when the last
701 * entry is and avoid writing a comma. */
702 ARRAY_ITEM( INT(0), true );
706 std::ostream &JavaTabCodeGen::TRANS_TARGS()
708 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
709 /* Walk the singles. */
710 for ( RedTransList::Iter stel = st->outSingle; stel.lte(); stel++ ) {
711 RedTransAp *trans = stel->value;
712 ARRAY_ITEM( KEY( trans->targ->id ), false );
715 /* Walk the ranges. */
716 for ( RedTransList::Iter rtel = st->outRange; rtel.lte(); rtel++ ) {
717 RedTransAp *trans = rtel->value;
718 ARRAY_ITEM( KEY( trans->targ->id ), false );
721 /* The state's default target state. */
722 if ( st->defTrans != 0 ) {
723 RedTransAp *trans = st->defTrans;
724 ARRAY_ITEM( KEY( trans->targ->id ), false );
728 /* Output one last number so we don't have to figure out when the last
729 * entry is and avoid writing a comma. */
730 ARRAY_ITEM( INT(0), true );
735 std::ostream &JavaTabCodeGen::TRANS_ACTIONS()
737 for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
738 /* Walk the singles. */
739 for ( RedTransList::Iter stel = st->outSingle; stel.lte(); stel++ ) {
740 RedTransAp *trans = stel->value;
741 ARRAY_ITEM( INT(TRANS_ACTION( trans )), false );
744 /* Walk the ranges. */
745 for ( RedTransList::Iter rtel = st->outRange; rtel.lte(); rtel++ ) {
746 RedTransAp *trans = rtel->value;
747 ARRAY_ITEM( INT(TRANS_ACTION( trans )), false );
750 /* The state's default index goes next. */
751 if ( st->defTrans != 0 ) {
752 RedTransAp *trans = st->defTrans;
753 ARRAY_ITEM( INT(TRANS_ACTION( trans )), false );
757 /* Output one last number so we don't have to figure out when the last
758 * entry is and avoid writing a comma. */
759 ARRAY_ITEM( INT(0), true );
763 std::ostream &JavaTabCodeGen::TRANS_TARGS_WI()
765 /* Transitions must be written ordered by their id. */
766 RedTransAp **transPtrs = new RedTransAp*[redFsm->transSet.length()];
767 for ( TransApSet::Iter trans = redFsm->transSet; trans.lte(); trans++ )
768 transPtrs[trans->id] = trans;
770 /* Keep a count of the num of items in the array written. */
771 for ( int t = 0; t < redFsm->transSet.length(); t++ ) {
772 /* Write out the target state. */
773 RedTransAp *trans = transPtrs[t];
774 ARRAY_ITEM( INT(trans->targ->id), ( t >= redFsm->transSet.length()-1 ) );
781 std::ostream &JavaTabCodeGen::TRANS_ACTIONS_WI()
783 /* Transitions must be written ordered by their id. */
784 RedTransAp **transPtrs = new RedTransAp*[redFsm->transSet.length()];
785 for ( TransApSet::Iter trans = redFsm->transSet; trans.lte(); trans++ )
786 transPtrs[trans->id] = trans;
788 /* Keep a count of the num of items in the array written. */
789 for ( int t = 0; t < redFsm->transSet.length(); t++ ) {
790 /* Write the function for the transition. */
791 RedTransAp *trans = transPtrs[t];
792 ARRAY_ITEM( INT(TRANS_ACTION( trans )), ( t >= redFsm->transSet.length()-1 ) );
798 void JavaTabCodeGen::writeExports()
800 if ( exportList.length() > 0 ) {
801 for ( ExportList::Iter ex = exportList; ex.lte(); ex++ ) {
802 STATIC_VAR( ALPH_TYPE(), DATA_PREFIX() + "ex_" + ex->name )
803 << " = " << KEY(ex->key) << ";\n";
809 void JavaTabCodeGen::writeData()
811 /* If there are any transtion functions then output the array. If there
812 * are none, don't bother emitting an empty array that won't be used. */
813 if ( redFsm->anyActions() ) {
814 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActArrItem), A() );
820 if ( redFsm->anyConditions() ) {
821 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxCondOffset), CO() );
826 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxCondLen), CL() );
831 OPEN_ARRAY( WIDE_ALPH_TYPE(), CK() );
836 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxCondSpaceId), C() );
842 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxKeyOffset), KO() );
847 OPEN_ARRAY( WIDE_ALPH_TYPE(), K() );
852 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxSingleLen), SL() );
857 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxRangeLen), RL() );
862 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxIndexOffset), IO() );
868 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxIndex), I() );
873 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxState), TT() );
878 if ( redFsm->anyActions() ) {
879 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), TA() );
886 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxState), TT() );
891 if ( redFsm->anyActions() ) {
892 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), TA() );
899 if ( redFsm->anyToStateActions() ) {
900 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), TSA() );
906 if ( redFsm->anyFromStateActions() ) {
907 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), FSA() );
908 FROM_STATE_ACTIONS();
913 if ( redFsm->anyEofActions() ) {
914 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxActionLoc), EA() );
920 if ( redFsm->anyEofTrans() ) {
921 OPEN_ARRAY( ARRAY_TYPE(redFsm->maxIndex+1), ET() );
927 if ( redFsm->startState != 0 )
928 STATIC_VAR( "int", START() ) << " = " << START_STATE_ID() << ";\n";
930 if ( writeFirstFinal )
931 STATIC_VAR( "int" , FIRST_FINAL() ) << " = " << FIRST_FINAL_STATE() << ";\n";
934 STATIC_VAR( "int", ERROR() ) << " = " << ERROR_STATE() << ";\n";
938 if ( entryPointNames.length() > 0 ) {
939 for ( EntryNameVect::Iter en = entryPointNames; en.lte(); en++ ) {
940 STATIC_VAR( "int", DATA_PREFIX() + "en_" + *en ) <<
941 " = " << entryPointIds[en.pos()] << ";\n";
947 void JavaTabCodeGen::writeExec()
953 if ( redFsm->anyRegCurStateRef() )
958 " int _trans = 0;\n";
960 if ( redFsm->anyConditions() )
961 out << " int _widec;\n";
963 if ( redFsm->anyToStateActions() || redFsm->anyRegActions() ||
964 redFsm->anyFromStateActions() )
973 " int _goto_targ = 0;\n"
977 " _goto: while (true) {\n"
978 " switch ( _goto_targ ) {\n"
983 " if ( " << P() << " == " << PE() << " ) {\n"
984 " _goto_targ = " << _test_eof << ";\n"
989 if ( redFsm->errState != 0 ) {
991 " if ( " << CS() << " == " << redFsm->errState->id << " ) {\n"
992 " _goto_targ = " << _out << ";\n"
997 out << "case " << _resume << ":\n";
999 if ( redFsm->anyFromStateActions() ) {
1001 " _acts = " << FSA() << "[" << CS() << "]" << ";\n"
1002 " _nacts = " << CAST("int") << " " << A() << "[_acts++];\n"
1003 " while ( _nacts-- > 0 ) {\n"
1004 " switch ( " << A() << "[_acts++] ) {\n";
1005 FROM_STATE_ACTION_SWITCH() <<
1011 if ( redFsm->anyConditions() )
1017 out << " _trans = " << I() << "[_trans];\n";
1019 if ( redFsm->anyEofTrans() )
1020 out << "case " << _eof_trans << ":\n";
1022 if ( redFsm->anyRegCurStateRef() )
1023 out << " _ps = " << CS() << ";\n";
1026 " " << CS() << " = " << TT() << "[_trans];\n"
1029 if ( redFsm->anyRegActions() ) {
1031 " if ( " << TA() << "[_trans] != 0 ) {\n"
1032 " _acts = " << TA() << "[_trans]" << ";\n"
1033 " _nacts = " << CAST("int") << " " << A() << "[_acts++];\n"
1034 " while ( _nacts-- > 0 )\n {\n"
1035 " switch ( " << A() << "[_acts++] )\n"
1044 out << "case " << _again << ":\n";
1046 if ( redFsm->anyToStateActions() ) {
1048 " _acts = " << TSA() << "[" << CS() << "]" << ";\n"
1049 " _nacts = " << CAST("int") << " " << A() << "[_acts++];\n"
1050 " while ( _nacts-- > 0 ) {\n"
1051 " switch ( " << A() << "[_acts++] ) {\n";
1052 TO_STATE_ACTION_SWITCH() <<
1058 if ( redFsm->errState != 0 ) {
1060 " if ( " << CS() << " == " << redFsm->errState->id << " ) {\n"
1061 " _goto_targ = " << _out << ";\n"
1062 " continue _goto;\n"
1068 " if ( ++" << P() << " != " << PE() << " ) {\n"
1069 " _goto_targ = " << _resume << ";\n"
1070 " continue _goto;\n"
1075 " " << P() << " += 1;\n"
1076 " _goto_targ = " << _resume << ";\n"
1077 " continue _goto;\n";
1080 out << "case " << _test_eof << ":\n";
1082 if ( redFsm->anyEofTrans() || redFsm->anyEofActions() ) {
1084 " if ( " << P() << " == " << EOFV() << " )\n"
1087 if ( redFsm->anyEofTrans() ) {
1089 " if ( " << ET() << "[" << CS() << "] > 0 ) {\n"
1090 " _trans = " << ET() << "[" << CS() << "] - 1;\n"
1091 " _goto_targ = " << _eof_trans << ";\n"
1092 " continue _goto;\n"
1096 if ( redFsm->anyEofActions() ) {
1098 " int __acts = " << EA() << "[" << CS() << "]" << ";\n"
1099 " int __nacts = " << CAST("int") << " " << A() << "[__acts++];\n"
1100 " while ( __nacts-- > 0 ) {\n"
1101 " switch ( " << A() << "[__acts++] ) {\n";
1102 EOF_ACTION_SWITCH() <<
1112 out << "case " << _out << ":\n";
1114 /* The switch and goto loop. */
1116 out << " break; }\n";
1118 /* The execute block. */
1122 std::ostream &JavaTabCodeGen::OPEN_ARRAY( string type, string name )
1129 out << "private static " << type << "[] init_" << name << "_0()\n"
1131 "return new " << type << " [] {\n\t";
1135 std::ostream &JavaTabCodeGen::ARRAY_ITEM( string item, bool last )
1139 out << setw(5) << setiosflags(ios::right) << item;
1142 if ( item_count % SAIIC == 0 ) {
1143 out << "\n\t};\n};\n"
1144 "private static "<< array_type << "[] init_" <<
1145 array_name << "_" << div_count << "()\n"
1147 "return new " << array_type << " [] {\n\t";
1149 } else if (item_count % IALL == 0) {
1158 std::ostream &JavaTabCodeGen::CLOSE_ARRAY()
1160 out << "\n\t};\n}\n\n";
1162 if (item_count < SAIIC) {
1163 out << "private static final " << array_type << " " << array_name <<
1164 "[] = init_" << array_name << "_0();\n\n";
1166 out << "private static final " << array_type << " [] combine_" << array_name
1168 << array_type << " [] combined = new " << array_type <<
1169 " [ " << item_count << " ];\n\t";
1171 int full_blocks = item_count / SAIIC;
1172 for (;block < full_blocks; ++block) {
1173 out << "System.arraycopy ( init_" << array_name << "_" << block <<
1174 "(), 0, combined, " << SAIIC * block << ", " << SAIIC << " );\n\t";
1176 if ( (item_count % SAIIC) > 0 ) {
1177 out << "System.arraycopy ( init_" << array_name << "_" << block <<
1178 "(), 0, combined, " << SAIIC * block << ", " <<
1179 (item_count % SAIIC) << " );\n\t";
1181 out << "return combined;\n}\n";
1182 out << "private static final " << array_type << " [] " << array_name <<
1183 " = combine_" << array_name << "();";
1189 std::ostream &JavaTabCodeGen::STATIC_VAR( string type, string name )
1191 out << "static final " << type << " " << name;
1195 string JavaTabCodeGen::ARR_OFF( string ptr, string offset )
1197 return ptr + " + " + offset;
1200 string JavaTabCodeGen::CAST( string type )
1202 return "(" + type + ")";
1205 string JavaTabCodeGen::NULL_ITEM()
1207 /* In java we use integers instead of pointers. */
1211 string JavaTabCodeGen::GET_KEY()
1214 if ( getKeyExpr != 0 ) {
1215 /* Emit the user supplied method of retrieving the key. */
1217 INLINE_LIST( ret, getKeyExpr, 0, false );
1221 /* Expression for retrieving the key, use simple dereference. */
1222 ret << DATA() << "[" << P() << "]";
1227 string JavaTabCodeGen::CTRL_FLOW()
1229 return "if (true) ";
1232 unsigned int JavaTabCodeGen::arrayTypeSize( unsigned long maxVal )
1234 long long maxValLL = (long long) maxVal;
1235 HostType *arrayType = keyOps->typeSubsumes( maxValLL );
1236 assert( arrayType != 0 );
1237 return arrayType->size;
1240 string JavaTabCodeGen::ARRAY_TYPE( unsigned long maxVal )
1242 long long maxValLL = (long long) maxVal;
1243 HostType *arrayType = keyOps->typeSubsumes( maxValLL );
1244 assert( arrayType != 0 );
1246 string ret = arrayType->data1;
1247 if ( arrayType->data2 != 0 ) {
1249 ret += arrayType->data2;
1255 /* Write out the fsm name. */
1256 string JavaTabCodeGen::FSM_NAME()
1261 /* Emit the offset of the start state as a decimal integer. */
1262 string JavaTabCodeGen::START_STATE_ID()
1265 ret << redFsm->startState->id;
1269 /* Write out the array of actions. */
1270 std::ostream &JavaTabCodeGen::ACTIONS_ARRAY()
1272 ARRAY_ITEM( INT(0), false );
1273 for ( ActionTableMap::Iter act = redFsm->actionMap; act.lte(); act++ ) {
1274 /* Write out the length, which will never be the last character. */
1275 ARRAY_ITEM( INT(act->key.length()), false );
1277 for ( ActionTable::Iter item = act->key; item.lte(); item++ )
1278 ARRAY_ITEM( INT(item->value->actionId), (act.last() && item.last()) );
1284 string JavaTabCodeGen::ACCESS()
1287 if ( accessExpr != 0 )
1288 INLINE_LIST( ret, accessExpr, 0, false );
1292 string JavaTabCodeGen::P()
1299 INLINE_LIST( ret, pExpr, 0, false );
1305 string JavaTabCodeGen::PE()
1312 INLINE_LIST( ret, peExpr, 0, false );
1318 string JavaTabCodeGen::EOFV()
1325 INLINE_LIST( ret, eofExpr, 0, false );
1331 string JavaTabCodeGen::CS()
1335 ret << ACCESS() << "cs";
1337 /* Emit the user supplied method of retrieving the key. */
1339 INLINE_LIST( ret, csExpr, 0, false );
1345 string JavaTabCodeGen::TOP()
1349 ret << ACCESS() + "top";
1352 INLINE_LIST( ret, topExpr, 0, false );
1358 string JavaTabCodeGen::STACK()
1361 if ( stackExpr == 0 )
1362 ret << ACCESS() + "stack";
1365 INLINE_LIST( ret, stackExpr, 0, false );
1371 string JavaTabCodeGen::ACT()
1375 ret << ACCESS() + "act";
1378 INLINE_LIST( ret, actExpr, 0, false );
1384 string JavaTabCodeGen::TOKSTART()
1387 if ( tokstartExpr == 0 )
1388 ret << ACCESS() + "ts";
1391 INLINE_LIST( ret, tokstartExpr, 0, false );
1397 string JavaTabCodeGen::TOKEND()
1400 if ( tokendExpr == 0 )
1401 ret << ACCESS() + "te";
1404 INLINE_LIST( ret, tokendExpr, 0, false );
1410 string JavaTabCodeGen::DATA()
1413 if ( dataExpr == 0 )
1414 ret << ACCESS() + "data";
1417 INLINE_LIST( ret, dataExpr, 0, false );
1424 string JavaTabCodeGen::GET_WIDE_KEY()
1426 if ( redFsm->anyConditions() )
1432 string JavaTabCodeGen::GET_WIDE_KEY( RedStateAp *state )
1434 if ( state->stateCondList.length() > 0 )
1440 /* Write out level number of tabs. Makes the nested binary search nice
1442 string JavaTabCodeGen::TABS( int level )
1445 while ( level-- > 0 )
1450 string JavaTabCodeGen::KEY( Key key )
1453 if ( keyOps->isSigned || !hostLang->explicitUnsigned )
1454 ret << key.getVal();
1456 ret << (unsigned long) key.getVal();
1460 string JavaTabCodeGen::INT( int i )
1467 void JavaTabCodeGen::LM_SWITCH( ostream &ret, InlineItem *item,
1468 int targState, int inFinish )
1471 " switch( " << ACT() << " ) {\n";
1473 for ( InlineList::Iter lma = *item->children; lma.lte(); lma++ ) {
1474 /* Write the case label, the action and the case break. */
1475 ret << " case " << lma->lmId << ":\n";
1477 /* Write the block and close it off. */
1479 INLINE_LIST( ret, lma->children, targState, inFinish );
1484 /* Default required for D code. */
1486 " default: break;\n"
1491 void JavaTabCodeGen::SET_ACT( ostream &ret, InlineItem *item )
1493 ret << ACT() << " = " << item->lmId << ";";
1496 void JavaTabCodeGen::SET_TOKEND( ostream &ret, InlineItem *item )
1498 /* The tokend action sets tokend. */
1499 ret << TOKEND() << " = " << P();
1500 if ( item->offset != 0 )
1501 out << "+" << item->offset;
1505 void JavaTabCodeGen::GET_TOKEND( ostream &ret, InlineItem *item )
1510 void JavaTabCodeGen::INIT_TOKSTART( ostream &ret, InlineItem *item )
1512 ret << TOKSTART() << " = " << NULL_ITEM() << ";";
1515 void JavaTabCodeGen::INIT_ACT( ostream &ret, InlineItem *item )
1517 ret << ACT() << " = 0;";
1520 void JavaTabCodeGen::SET_TOKSTART( ostream &ret, InlineItem *item )
1522 ret << TOKSTART() << " = " << P() << ";";
1525 void JavaTabCodeGen::SUB_ACTION( ostream &ret, InlineItem *item,
1526 int targState, bool inFinish )
1528 if ( item->children->length() > 0 ) {
1529 /* Write the block and close it off. */
1531 INLINE_LIST( ret, item->children, targState, inFinish );
1536 void JavaTabCodeGen::ACTION( ostream &ret, Action *action, int targState, bool inFinish )
1538 /* Write the preprocessor line info for going into the source file. */
1539 lineDirective( ret, sourceFileName, action->loc.line );
1541 /* Write the block and close it off. */
1543 INLINE_LIST( ret, action->inlineList, targState, inFinish );
1547 void JavaTabCodeGen::CONDITION( ostream &ret, Action *condition )
1550 lineDirective( ret, sourceFileName, condition->loc.line );
1551 INLINE_LIST( ret, condition->inlineList, 0, false );
1554 string JavaTabCodeGen::ERROR_STATE()
1557 if ( redFsm->errState != 0 )
1558 ret << redFsm->errState->id;
1564 string JavaTabCodeGen::FIRST_FINAL_STATE()
1567 if ( redFsm->firstFinState != 0 )
1568 ret << redFsm->firstFinState->id;
1570 ret << redFsm->nextStateId;
1574 void JavaTabCodeGen::writeInit()
1579 out << "\t" << CS() << " = " << START() << ";\n";
1581 /* If there are any calls, then the stack top needs initialization. */
1582 if ( redFsm->anyActionCalls() || redFsm->anyActionRets() )
1583 out << "\t" << TOP() << " = 0;\n";
1585 if ( hasLongestMatch ) {
1587 " " << TOKSTART() << " = " << NULL_ITEM() << ";\n"
1588 " " << TOKEND() << " = " << NULL_ITEM() << ";\n"
1589 " " << ACT() << " = 0;\n";
1594 void JavaTabCodeGen::finishRagelDef()
1596 /* The frontend will do this for us, but it may be a good idea to force it
1597 * if the intermediate file is edited. */
1598 redFsm->sortByStateId();
1600 /* Choose default transitions and the single transition. */
1601 redFsm->chooseDefaultSpan();
1603 /* Maybe do flat expand, otherwise choose single. */
1604 redFsm->chooseSingle();
1606 /* If any errors have occured in the input file then don't write anything. */
1607 if ( gblErrorCount > 0 )
1610 /* Anlayze Machine will find the final action reference counts, among
1611 * other things. We will use these in reporting the usage
1612 * of fsm directives in action code. */
1615 /* Determine if we should use indicies. */
1619 ostream &JavaTabCodeGen::source_warning( const InputLoc &loc )
1621 cerr << sourceFileName << ":" << loc.line << ":" << loc.col << ": warning: ";
1625 ostream &JavaTabCodeGen::source_error( const InputLoc &loc )
1628 assert( sourceFileName != 0 );
1629 cerr << sourceFileName << ":" << loc.line << ":" << loc.col << ": ";