diff options
Diffstat (limited to 'src/libfsm/actexp.cc')
| -rw-r--r-- | src/libfsm/actexp.cc | 218 |
1 files changed, 218 insertions, 0 deletions
diff --git a/src/libfsm/actexp.cc b/src/libfsm/actexp.cc new file mode 100644 index 00000000..771d4623 --- /dev/null +++ b/src/libfsm/actexp.cc @@ -0,0 +1,218 @@ +/* + * Copyright 2018-2018 Adrian Thurston <thurston@colm.net> + * + * Permission is hereby granted, free of charge, to any person obtaining a copy + * of this software and associated documentation files (the "Software"), to + * deal in the Software without restriction, including without limitation the + * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or + * sell copies of the Software, and to permit persons to whom the Software is + * furnished to do so, subject to the following conditions: + * + * The above copyright notice and this permission notice shall be included in all + * copies or substantial portions of the Software. + * + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR + * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, + * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE + * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER + * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE + * SOFTWARE. + */ + +#include "actexp.h" +#include "redfsm.h" +#include "gendata.h" + +void ActExp::FROM_STATE_ACTION( RedStateAp *state ) +{ + int act = 0; + if ( state->fromStateAction != 0 ) + act = state->fromStateAction->actListId + 1; + fromStateActions.value( act ); +} + +void ActExp::COND_ACTION( RedCondPair *cond ) +{ + int action = 0; + if ( cond->action != 0 ) + action = cond->action->actListId + 1; + condActions.value( action ); +} + +void ActExp::TO_STATE_ACTION( RedStateAp *state ) +{ + int act = 0; + if ( state->toStateAction != 0 ) + act = state->toStateAction->actListId + 1; + toStateActions.value( act ); +} + +void ActExp::EOF_ACTION( RedStateAp *state ) +{ + int act = 0; + if ( state->eofAction != 0 ) + act = state->eofAction->actListId + 1; + eofActions.value( act ); +} + +void ActExp::NFA_PUSH_ACTION( RedNfaTarg *targ ) +{ + int act = 0; + if ( targ->push != 0 ) + act = targ->push->actListId+1; + nfaPushActions.value( act ); +} + +void ActExp::NFA_POP_TEST( RedNfaTarg *targ ) +{ + int act = 0; + if ( targ->popTest != 0 ) + act = targ->popTest->actListId+1; + nfaPopTrans.value( act ); +} + + +/* Write out the function switch. This switch is keyed on the values + * of the func index. */ +std::ostream &ActExp::FROM_STATE_ACTION_SWITCH() +{ + /* Loop the actions. */ + for ( GenActionTableMap::Iter redAct = redFsm->actionMap; redAct.lte(); redAct++ ) { + if ( redAct->numFromStateRefs > 0 ) { + /* Write the entry label. */ + out << "\t " << CASE( STR( redAct->actListId+1 ) ) << " {\n"; + + /* Write each action in the list of action items. */ + for ( GenActionTable::Iter item = redAct->key; item.lte(); item++ ) { + ACTION( out, item->value, IlOpts( 0, false, false ) ); + out << "\n\t"; + } + + out << "\n\t" << CEND() << "\n}\n"; + } + } + + return out; +} + +/* Write out the function switch. This switch is keyed on the values + * of the func index. */ +std::ostream &ActExp::ACTION_SWITCH() +{ + /* Loop the actions. */ + for ( GenActionTableMap::Iter redAct = redFsm->actionMap; redAct.lte(); redAct++ ) { + if ( redAct->numTransRefs > 0 ) { + /* Write the entry label. */ + out << "\t " << CASE( STR( redAct->actListId+1 ) ) << " {\n"; + + /* Write each action in the list of action items. */ + for ( GenActionTable::Iter item = redAct->key; item.lte(); item++ ) { + ACTION( out, item->value, IlOpts( 0, false, false ) ); + out << "\n\t"; + } + + out << "\n\t" << CEND() << "\n}\n"; + } + } + + return out; +} + +/* Write out the function switch. This switch is keyed on the values + * of the func index. */ +std::ostream &ActExp::TO_STATE_ACTION_SWITCH() +{ + /* Loop the actions. */ + for ( GenActionTableMap::Iter redAct = redFsm->actionMap; redAct.lte(); redAct++ ) { + if ( redAct->numToStateRefs > 0 ) { + /* Write the entry label. */ + out << "\t " << CASE( STR( redAct->actListId+1 ) ) << " {\n"; + + /* Write each action in the list of action items. */ + for ( GenActionTable::Iter item = redAct->key; item.lte(); item++ ) { + ACTION( out, item->value, IlOpts( 0, false, false ) ); + out << "\n\t"; + } + + out << "\n\t" << CEND() << "\n}\n"; + } + } + + return out; +} + +std::ostream &ActExp::EOF_ACTION_SWITCH() +{ + /* Loop the actions. */ + for ( GenActionTableMap::Iter redAct = redFsm->actionMap; redAct.lte(); redAct++ ) { + if ( redAct->numEofRefs > 0 ) { + /* Write the entry label. */ + out << "\t " << CASE( STR( redAct->actListId+1 ) ) << " {\n"; + + /* Write each action in the list of action items. */ + for ( GenActionTable::Iter item = redAct->key; item.lte(); item++ ) { + ACTION( out, item->value, IlOpts( 0, true, false ) ); + out << "\n\t"; + } + + out << "\n\t" << CEND() << "\n}\n"; + } + } + + return out; +} + + +void ActExp::FROM_STATE_ACTIONS() +{ + if ( redFsm->anyFromStateActions() ) { + out << + " switch ( " << ARR_REF( fromStateActions ) << "[" << vCS() << "] ) {\n"; + FROM_STATE_ACTION_SWITCH() << + " }\n" + "\n"; + } +} + +void ActExp::REG_ACTIONS( std::string cond ) +{ + out << + " switch ( " << ARR_REF( condActions ) << "[" << cond << "] ) {\n"; + ACTION_SWITCH() << + " }\n" + "\n"; +} +void ActExp::TO_STATE_ACTIONS() +{ + if ( redFsm->anyToStateActions() ) { + out << + " switch ( " << ARR_REF( toStateActions ) << "[" << vCS() << "] ) {\n"; + TO_STATE_ACTION_SWITCH() << + " }\n" + "\n"; + } +} + + +void ActExp::EOF_ACTIONS() +{ + if ( redFsm->anyEofActions() ) { + out << + " switch ( " << ARR_REF( eofActions ) << "[" << vCS() << "] ) {\n"; + EOF_ACTION_SWITCH() << + " }\n"; + } +} + +void ActExp::NFA_FROM_STATE_ACTION_EXEC() +{ + if ( redFsm->anyFromStateActions() ) { + out << + " switch ( " << ARR_REF( fromStateActions ) << "[nfa_bp[nfa_len].state] ) {\n"; + FROM_STATE_ACTION_SWITCH() << + " }\n" + "\n"; + } +} + |