/* * Copyright 2001-2006 Adrian Thurston * 2004 Erich Ocean * 2005 Alan West */ /* This file is part of Ragel. * * Ragel is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * Ragel is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with Ragel; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include "rlgen-cd.h" #include "fsmcodegen.h" #include "redfsm.h" #include "gendata.h" #include #include #include #include using std::ostream; using std::ostringstream; using std::string; using std::cerr; using std::endl; void lineDirective( ostream &out, char *fileName, int line ) { if ( noLineDirectives ) out << "/* "; /* Write the preprocessor line info for to the input file. */ out << "#line " << line << " \""; for ( char *pc = fileName; *pc != 0; pc++ ) { if ( *pc == '\\' ) out << "\\\\"; else out << *pc; } out << '"'; if ( noLineDirectives ) out << " */"; out << '\n'; } void genLineDirective( ostream &out ) { std::streambuf *sbuf = out.rdbuf(); output_filter *filter = static_cast(sbuf); lineDirective( out, filter->fileName, filter->line + 1 ); } /* Init code gen with in parameters. */ FsmCodeGen::FsmCodeGen( ostream &out ) : CodeGenData(out) { } unsigned int FsmCodeGen::arrayTypeSize( unsigned long maxVal ) { long long maxValLL = (long long) maxVal; HostType *arrayType = keyOps->typeSubsumes( maxValLL ); assert( arrayType != 0 ); return arrayType->size; } string FsmCodeGen::ARRAY_TYPE( unsigned long maxVal ) { long long maxValLL = (long long) maxVal; HostType *arrayType = keyOps->typeSubsumes( maxValLL ); assert( arrayType != 0 ); string ret = arrayType->data1; if ( arrayType->data2 != 0 ) { ret += " "; ret += arrayType->data2; } return ret; } /* Write out the fsm name. */ string FsmCodeGen::FSM_NAME() { return fsmName; } /* Emit the offset of the start state as a decimal integer. */ string FsmCodeGen::START_STATE_ID() { ostringstream ret; ret << redFsm->startState->id; return ret.str(); }; /* Write out the array of actions. */ std::ostream &FsmCodeGen::ACTIONS_ARRAY() { out << "\t0, "; int totalActions = 1; for ( ActionTableMap::Iter act = redFsm->actionMap; act.lte(); act++ ) { /* Write out the length, which will never be the last character. */ out << act->key.length() << ", "; /* Put in a line break every 8 */ if ( totalActions++ % 8 == 7 ) out << "\n\t"; for ( ActionTable::Iter item = act->key; item.lte(); item++ ) { out << item->value->actionId; if ( ! (act.last() && item.last()) ) out << ", "; /* Put in a line break every 8 */ if ( totalActions++ % 8 == 7 ) out << "\n\t"; } } out << "\n"; return out; } string FsmCodeGen::ACCESS() { ostringstream ret; if ( accessExpr != 0 ) INLINE_LIST( ret, accessExpr, 0, false ); return ret.str(); } string FsmCodeGen::P() { ostringstream ret; if ( pExpr == 0 ) ret << "p"; else { ret << "("; INLINE_LIST( ret, pExpr, 0, false ); ret << ")"; } return ret.str(); } string FsmCodeGen::PE() { ostringstream ret; if ( peExpr == 0 ) ret << "pe"; else { ret << "("; INLINE_LIST( ret, peExpr, 0, false ); ret << ")"; } return ret.str(); } string FsmCodeGen::CS() { ostringstream ret; if ( csExpr == 0 ) ret << ACCESS() << "cs"; else { /* Emit the user supplied method of retrieving the key. */ ret << "("; INLINE_LIST( ret, csExpr, 0, false ); ret << ")"; } return ret.str(); } string FsmCodeGen::TOP() { ostringstream ret; if ( topExpr == 0 ) ret << ACCESS() + "top"; else { ret << "("; INLINE_LIST( ret, topExpr, 0, false ); ret << ")"; } return ret.str(); } string FsmCodeGen::STACK() { ostringstream ret; if ( stackExpr == 0 ) ret << ACCESS() + "stack"; else { ret << "("; INLINE_LIST( ret, stackExpr, 0, false ); ret << ")"; } return ret.str(); } string FsmCodeGen::ACT() { ostringstream ret; if ( actExpr == 0 ) ret << ACCESS() + "act"; else { ret << "("; INLINE_LIST( ret, actExpr, 0, false ); ret << ")"; } return ret.str(); } string FsmCodeGen::TOKSTART() { ostringstream ret; if ( tokstartExpr == 0 ) ret << ACCESS() + "tokstart"; else { ret << "("; INLINE_LIST( ret, tokstartExpr, 0, false ); ret << ")"; } return ret.str(); } string FsmCodeGen::TOKEND() { ostringstream ret; if ( tokendExpr == 0 ) ret << ACCESS() + "tokend"; else { ret << "("; INLINE_LIST( ret, tokendExpr, 0, false ); ret << ")"; } return ret.str(); } string FsmCodeGen::GET_WIDE_KEY() { if ( redFsm->anyConditions() ) return "_widec"; else return GET_KEY(); } string FsmCodeGen::GET_WIDE_KEY( RedStateAp *state ) { if ( state->stateCondList.length() > 0 ) return "_widec"; else return GET_KEY(); } string FsmCodeGen::GET_KEY() { ostringstream ret; if ( getKeyExpr != 0 ) { /* Emit the user supplied method of retrieving the key. */ ret << "("; INLINE_LIST( ret, getKeyExpr, 0, false ); ret << ")"; } else { /* Expression for retrieving the key, use simple dereference. */ ret << "(*" << P() << ")"; } return ret.str(); } /* Write out level number of tabs. Makes the nested binary search nice * looking. */ string FsmCodeGen::TABS( int level ) { string result; while ( level-- > 0 ) result += "\t"; return result; } /* Write out a key from the fsm code gen. Depends on wether or not the key is * signed. */ string FsmCodeGen::KEY( Key key ) { ostringstream ret; if ( keyOps->isSigned || !hostLang->explicitUnsigned ) ret << key.getVal(); else ret << (unsigned long) key.getVal() << 'u'; return ret.str(); } void FsmCodeGen::EXEC( ostream &ret, InlineItem *item, int targState, int inFinish ) { /* The parser gives fexec two children. The double brackets are for D * code. If the inline list is a single word it will get interpreted as a * C-style cast by the D compiler. */ ret << "{" << P() << " = (("; INLINE_LIST( ret, item->children, targState, inFinish ); ret << "))-1;}"; } void FsmCodeGen::LM_SWITCH( ostream &ret, InlineItem *item, int targState, int inFinish ) { ret << " switch( " << ACT() << " ) {\n"; for ( InlineList::Iter lma = *item->children; lma.lte(); lma++ ) { /* Write the case label, the action and the case break. */ ret << " case " << lma->lmId << ":\n"; /* Write the block and close it off. */ ret << " {"; INLINE_LIST( ret, lma->children, targState, inFinish ); ret << "}\n"; ret << " break;\n"; } /* Default required for D code. */ ret << " default: break;\n" " }\n" "\t"; } void FsmCodeGen::SET_ACT( ostream &ret, InlineItem *item ) { ret << ACT() << " = " << item->lmId << ";"; } void FsmCodeGen::SET_TOKEND( ostream &ret, InlineItem *item ) { /* The tokend action sets tokend. */ ret << TOKEND() << " = " << P(); if ( item->offset != 0 ) out << "+" << item->offset; out << ";"; } void FsmCodeGen::GET_TOKEND( ostream &ret, InlineItem *item ) { ret << TOKEND(); } void FsmCodeGen::INIT_TOKSTART( ostream &ret, InlineItem *item ) { ret << TOKSTART() << " = " << NULL_ITEM() << ";"; } void FsmCodeGen::INIT_ACT( ostream &ret, InlineItem *item ) { ret << ACT() << " = 0;"; } void FsmCodeGen::SET_TOKSTART( ostream &ret, InlineItem *item ) { ret << TOKSTART() << " = " << P() << ";"; } void FsmCodeGen::SUB_ACTION( ostream &ret, InlineItem *item, int targState, bool inFinish ) { if ( item->children->length() > 0 ) { /* Write the block and close it off. */ ret << "{"; INLINE_LIST( ret, item->children, targState, inFinish ); ret << "}"; } } /* Write out an inline tree structure. Walks the list and possibly calls out * to virtual functions than handle language specific items in the tree. */ void FsmCodeGen::INLINE_LIST( ostream &ret, InlineList *inlineList, int targState, bool inFinish ) { for ( InlineList::Iter item = *inlineList; item.lte(); item++ ) { switch ( item->type ) { case InlineItem::Text: ret << item->data; break; case InlineItem::Goto: GOTO( ret, item->targState->id, inFinish ); break; case InlineItem::Call: CALL( ret, item->targState->id, targState, inFinish ); break; case InlineItem::Next: NEXT( ret, item->targState->id, inFinish ); break; case InlineItem::Ret: RET( ret, inFinish ); break; case InlineItem::PChar: ret << P(); break; case InlineItem::Char: ret << GET_KEY(); break; case InlineItem::Hold: ret << P() << "--;"; break; case InlineItem::Exec: EXEC( ret, item, targState, inFinish ); break; case InlineItem::Curs: CURS( ret, inFinish ); break; case InlineItem::Targs: TARGS( ret, inFinish, targState ); break; case InlineItem::Entry: ret << item->targState->id; break; case InlineItem::GotoExpr: GOTO_EXPR( ret, item, inFinish ); break; case InlineItem::CallExpr: CALL_EXPR( ret, item, targState, inFinish ); break; case InlineItem::NextExpr: NEXT_EXPR( ret, item, inFinish ); break; case InlineItem::LmSwitch: LM_SWITCH( ret, item, targState, inFinish ); break; case InlineItem::LmSetActId: SET_ACT( ret, item ); break; case InlineItem::LmSetTokEnd: SET_TOKEND( ret, item ); break; case InlineItem::LmGetTokEnd: GET_TOKEND( ret, item ); break; case InlineItem::LmInitTokStart: INIT_TOKSTART( ret, item ); break; case InlineItem::LmInitAct: INIT_ACT( ret, item ); break; case InlineItem::LmSetTokStart: SET_TOKSTART( ret, item ); break; case InlineItem::SubAction: SUB_ACTION( ret, item, targState, inFinish ); break; case InlineItem::Break: BREAK( ret, targState ); break; } } } /* Write out paths in line directives. Escapes any special characters. */ string FsmCodeGen::LDIR_PATH( char *path ) { ostringstream ret; for ( char *pc = path; *pc != 0; pc++ ) { if ( *pc == '\\' ) ret << "\\\\"; else ret << *pc; } return ret.str(); } void FsmCodeGen::ACTION( ostream &ret, Action *action, int targState, bool inFinish ) { /* Write the preprocessor line info for going into the source file. */ lineDirective( ret, sourceFileName, action->loc.line ); /* Write the block and close it off. */ ret << "\t{"; INLINE_LIST( ret, action->inlineList, targState, inFinish ); ret << "}\n"; } void FsmCodeGen::CONDITION( ostream &ret, Action *condition ) { ret << "\n"; lineDirective( ret, sourceFileName, condition->loc.line ); INLINE_LIST( ret, condition->inlineList, 0, false ); } string FsmCodeGen::ERROR_STATE() { ostringstream ret; if ( redFsm->errState != 0 ) ret << redFsm->errState->id; else ret << "-1"; return ret.str(); } string FsmCodeGen::FIRST_FINAL_STATE() { ostringstream ret; if ( redFsm->firstFinState != 0 ) ret << redFsm->firstFinState->id; else ret << redFsm->nextStateId; return ret.str(); } void FsmCodeGen::writeInit() { out << " {\n"; if ( writeCS ) out << "\t" << CS() << " = " << START() << ";\n"; /* If there are any calls, then the stack top needs initialization. */ if ( redFsm->anyActionCalls() || redFsm->anyActionRets() ) out << "\t" << TOP() << " = 0;\n"; if ( hasLongestMatch ) { out << " " << TOKSTART() << " = " << NULL_ITEM() << ";\n" " " << TOKEND() << " = " << NULL_ITEM() << ";\n" " " << ACT() << " = 0;\n"; } out << " }\n"; } string FsmCodeGen::DATA_PREFIX() { if ( dataPrefix ) return FSM_NAME() + "_"; return ""; } /* Emit the alphabet data type. */ string FsmCodeGen::ALPH_TYPE() { string ret = keyOps->alphType->data1; if ( keyOps->alphType->data2 != 0 ) { ret += " "; ret += + keyOps->alphType->data2; } return ret; } /* Emit the alphabet data type. */ string FsmCodeGen::WIDE_ALPH_TYPE() { string ret; if ( redFsm->maxKey <= keyOps->maxKey ) ret = ALPH_TYPE(); else { long long maxKeyVal = redFsm->maxKey.getLongLong(); HostType *wideType = keyOps->typeSubsumes( keyOps->isSigned, maxKeyVal ); assert( wideType != 0 ); ret = wideType->data1; if ( wideType->data2 != 0 ) { ret += " "; ret += wideType->data2; } } return ret; } void FsmCodeGen::STATE_IDS() { if ( redFsm->startState != 0 ) STATIC_VAR( "int", START() ) << " = " << START_STATE_ID() << ";\n"; if ( writeFirstFinal ) STATIC_VAR( "int" , FIRST_FINAL() ) << " = " << FIRST_FINAL_STATE() << ";\n"; if ( writeErr ) STATIC_VAR( "int", ERROR() ) << " = " << ERROR_STATE() << ";\n"; out << "\n"; if ( entryPointNames.length() > 0 ) { for ( EntryNameVect::Iter en = entryPointNames; en.lte(); en++ ) { STATIC_VAR( "int", DATA_PREFIX() + "en_" + *en ) << " = " << entryPointIds[en.pos()] << ";\n"; } out << "\n"; } } /* * Language specific, but style independent code generators functions. */ string CCodeGen::PTR_CONST() { return "const "; } std::ostream &CCodeGen::OPEN_ARRAY( string type, string name ) { out << "static const " << type << " " << name << "[] = {\n"; return out; } std::ostream &CCodeGen::CLOSE_ARRAY() { return out << "};\n"; } std::ostream &CCodeGen::STATIC_VAR( string type, string name ) { out << "static const " << type << " " << name; return out; } string CCodeGen::UINT( ) { return "unsigned int"; } string CCodeGen::ARR_OFF( string ptr, string offset ) { return ptr + " + " + offset; } string CCodeGen::CAST( string type ) { return "(" + type + ")"; } string CCodeGen::NULL_ITEM() { return "0"; } string CCodeGen::POINTER() { return " *"; } std::ostream &CCodeGen::SWITCH_DEFAULT() { return out; } string CCodeGen::CTRL_FLOW() { return ""; } void CCodeGen::writeExports() { if ( exportList.length() > 0 ) { for ( ExportList::Iter ex = exportList; ex.lte(); ex++ ) { out << "#define " << DATA_PREFIX() << "ex_" << ex->name << " " << KEY(ex->key) << "\n"; } out << "\n"; } } /* * D Specific */ string DCodeGen::NULL_ITEM() { return "null"; } string DCodeGen::POINTER() { // multiple items seperated by commas can also be pointer types. return "* "; } string DCodeGen::PTR_CONST() { return ""; } std::ostream &DCodeGen::OPEN_ARRAY( string type, string name ) { out << "static const " << type << "[] " << name << " = [\n"; return out; } std::ostream &DCodeGen::CLOSE_ARRAY() { return out << "];\n"; } std::ostream &DCodeGen::STATIC_VAR( string type, string name ) { out << "static const " << type << " " << name; return out; } string DCodeGen::ARR_OFF( string ptr, string offset ) { return "&" + ptr + "[" + offset + "]"; } string DCodeGen::CAST( string type ) { return "cast(" + type + ")"; } string DCodeGen::UINT( ) { return "uint"; } std::ostream &DCodeGen::SWITCH_DEFAULT() { out << " default: break;\n"; return out; } string DCodeGen::CTRL_FLOW() { return "if (true) "; } void DCodeGen::writeExports() { if ( exportList.length() > 0 ) { for ( ExportList::Iter ex = exportList; ex.lte(); ex++ ) { out << "static const " << ALPH_TYPE() << " " << DATA_PREFIX() << "ex_" << ex->name << " = " << KEY(ex->key) << ";\n"; } out << "\n"; } } /* * End D-specific code. */ void FsmCodeGen::finishRagelDef() { if ( codeStyle == GenGoto || codeStyle == GenFGoto || codeStyle == GenIpGoto || codeStyle == GenSplit ) { /* For directly executable machines there is no required state * ordering. Choose a depth-first ordering to increase the * potential for fall-throughs. */ redFsm->depthFirstOrdering(); } else { /* The frontend will do this for us, but it may be a good idea to * force it if the intermediate file is edited. */ redFsm->sortByStateId(); } /* Choose default transitions and the single transition. */ redFsm->chooseDefaultSpan(); /* Maybe do flat expand, otherwise choose single. */ if ( codeStyle == GenFlat || codeStyle == GenFFlat ) redFsm->makeFlat(); else redFsm->chooseSingle(); /* If any errors have occured in the input file then don't write anything. */ if ( gblErrorCount > 0 ) return; if ( codeStyle == GenSplit ) redFsm->partitionFsm( numSplitPartitions ); if ( codeStyle == GenIpGoto || codeStyle == GenSplit ) redFsm->setInTrans(); /* Anlayze Machine will find the final action reference counts, among * other things. We will use these in reporting the usage * of fsm directives in action code. */ analyzeMachine(); /* Determine if we should use indicies. */ calcIndexSize(); } ostream &FsmCodeGen::source_warning( const InputLoc &loc ) { cerr << sourceFileName << ":" << loc.line << ":" << loc.col << ": warning: "; return cerr; } ostream &FsmCodeGen::source_error( const InputLoc &loc ) { gblErrorCount += 1; assert( sourceFileName != 0 ); cerr << sourceFileName << ":" << loc.line << ":" << loc.col << ": "; return cerr; }