std::ostream &OCamlFGotoCodeGen::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| " << 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, 0, true );
// out << "\tbreak;\n";
}
}
genLineDirective( out );
return out;
}
/* Write out the function switch. This switch is keyed on the values
* of the func index. */
std::wostream &FGotoCodeGen::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 << L"\tcase " << redAct->actListId+1 << L":\n";
/* Write each action in the list of action items. */
for ( GenActionTable::Iter item = redAct->key; item.lte(); item++ )
ACTION( out, item->value, 0, false, false );
out << L"\tbreak;\n";
}
}
genLineDirective( out );
return out;
}
/* Write out the function switch. This switch is keyed on the values
* of the func index. */
std::ostream &GoFTabCodeGen::TO_STATE_ACTION_SWITCH( int level )
{
/* Loop the actions. */
for ( GenActionTableMap::Iter redAct = redFsm->actionMap; redAct.lte(); redAct++ ) {
if ( redAct->numToStateRefs > 0 ) {
/* Write the entry label. */
out << TABS(level) << "case " << redAct->actListId+1 << ":" << endl;
/* Write each action in the list of action items. */
for ( GenActionTable::Iter item = redAct->key; item.lte(); item++ )
ACTION( out, item->value, 0, false, false );
out << endl;
}
}
genLineDirective( out );
return out;
}
std::ostream &OCamlFGotoCodeGen::EXEC_ACTIONS()
{
/* Loop the actions. */
for ( GenActionTableMap::Iter redAct = redFsm->actionMap; redAct.lte(); redAct++ ) {
if ( redAct->numTransRefs > 0 ) {
/* We are at the start of a glob, write the case. */
out << "and f" << redAct->actListId << " () =\n";
out << "\tbegin try\n";
/* Write each action in the list of action items. */
for ( GenActionTable::Iter item = redAct->key; item.lte(); item++ )
ACTION( out, item->value, 0, false );
out << "\twith Goto_again -> () end;\n";
out << "\tdo_again ()\n";
}
}
return out;
}
/* Write out the function switch. This switch is keyed on the values
* of the func index. */
std::wostream &OCamlFFlatCodeGen::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 << L"\t| " << redAct->actListId+1 << L" ->\n";
/* Write each action in the list of action items. */
for ( GenActionTable::Iter item = redAct->key; item.lte(); item++ )
ACTION( out, item->value, 0, false );
out << L"\t()\n";
}
}
genLineDirective( out );
return out;
}
/* Write out the array of actions. */
std::ostream &GoCodeGen::ACTIONS_ARRAY()
{
out << " 0, ";
int totalActions = 1;
for ( GenActionTableMap::Iter act = redFsm->actionMap; act.lte(); act++ ) {
/* Write out the length, which will never be the last character. */
out << act->key.length() << ", ";
if ( totalActions++ % IALL == 0 )
out << endl << " ";
for ( GenActionTable::Iter item = act->key; item.lte(); item++ ) {
out << item->value->actionId << ", ";
if ( ! (act.last() && item.last()) ) {
if ( totalActions++ % IALL == 0 )
out << endl << " ";
}
}
}
out << endl;
return out;
}
void SplitCodeGen::setLabelsNeeded( RedStateAp *fromState, RedTransAp *trans )
{
/* In the split code gen we don't need labels for transitions across
* partitions. */
if ( fromState->partition == trans->targ->partition ) {
/* If there is no action with a next statement, then the label will be
* needed. */
trans->labelNeeded = true;
if ( trans->action == 0 || !trans->action->anyNextStmt() )
trans->targ->labelNeeded = true;
}
/* Need labels for states that have goto or calls in action code
* invoked on characters (ie, not from out action code). */
if ( trans->action != 0 ) {
/* Loop the actions. */
for ( GenActionTable::Iter act = trans->action->key; act.lte(); act++ ) {
/* Get the action and walk it's tree. */
setLabelsNeeded( fromState, act->value->inlineList );
}
}
}
/* Write out the array of actions. */
std::ostream &FsmCodeGen::ACTIONS_ARRAY()
{
out << "\t0, ";
int totalActions = 1;
for ( GenActionTableMap::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 ( GenActionTable::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;
}
void CodeGenData::setValueLimits()
{
redFsm->maxSingleLen = 0;
redFsm->maxRangeLen = 0;
redFsm->maxKeyOffset = 0;
redFsm->maxIndexOffset = 0;
redFsm->maxActListId = 0;
redFsm->maxActionLoc = 0;
redFsm->maxActArrItem = 0;
redFsm->maxSpan = 0;
redFsm->maxCondSpan = 0;
redFsm->maxFlatIndexOffset = 0;
redFsm->maxCondOffset = 0;
redFsm->maxCondLen = 0;
redFsm->maxCondSpaceId = 0;
redFsm->maxCondIndexOffset = 0;
/* In both of these cases the 0 index is reserved for no value, so the max
* is one more than it would be if they started at 0. */
redFsm->maxIndex = redFsm->transSet.length();
redFsm->maxCond = condSpaceList.length();
/* The nextStateId - 1 is the last state id assigned. */
redFsm->maxState = redFsm->nextStateId - 1;
for ( CondSpaceList::Iter csi = condSpaceList; csi.lte(); csi++ ) {
if ( csi->condSpaceId > redFsm->maxCondSpaceId )
redFsm->maxCondSpaceId = csi->condSpaceId;
}
for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
/* Maximum cond length. */
if ( st->stateCondList.length() > redFsm->maxCondLen )
redFsm->maxCondLen = st->stateCondList.length();
/* Maximum single length. */
if ( st->outSingle.length() > redFsm->maxSingleLen )
redFsm->maxSingleLen = st->outSingle.length();
/* Maximum range length. */
if ( st->outRange.length() > redFsm->maxRangeLen )
redFsm->maxRangeLen = st->outRange.length();
/* The key offset index offset for the state after last is not used, skip it.. */
if ( ! st.last() ) {
redFsm->maxCondOffset += st->stateCondList.length();
redFsm->maxKeyOffset += st->outSingle.length() + st->outRange.length()*2;
redFsm->maxIndexOffset += st->outSingle.length() + st->outRange.length() + 2;
}
/* Max cond span. */
if ( st->condList != 0 ) {
unsigned long long span = keyOps->span( st->condLowKey, st->condHighKey );
if ( span > redFsm->maxCondSpan )
redFsm->maxCondSpan = span;
}
/* Max key span. */
if ( st->transList != 0 ) {
unsigned long long span = keyOps->span( st->lowKey, st->highKey );
if ( span > redFsm->maxSpan )
redFsm->maxSpan = span;
}
/* Max cond index offset. */
if ( ! st.last() ) {
if ( st->condList != 0 )
redFsm->maxCondIndexOffset += keyOps->span( st->condLowKey, st->condHighKey );
}
/* Max flat index offset. */
if ( ! st.last() ) {
if ( st->transList != 0 )
redFsm->maxFlatIndexOffset += keyOps->span( st->lowKey, st->highKey );
redFsm->maxFlatIndexOffset += 1;
}
}
for ( GenActionTableMap::Iter at = redFsm->actionMap; at.lte(); at++ ) {
/* Maximum id of action lists. */
if ( at->actListId+1 > redFsm->maxActListId )
redFsm->maxActListId = at->actListId+1;
/* Maximum location of items in action array. */
if ( at->location+1 > redFsm->maxActionLoc )
redFsm->maxActionLoc = at->location+1;
/* Maximum values going into the action array. */
if ( at->key.length() > redFsm->maxActArrItem )
redFsm->maxActArrItem = at->key.length();
for ( GenActionTable::Iter item = at->key; item.lte(); item++ ) {
if ( item->value->actionId > redFsm->maxActArrItem )
redFsm->maxActArrItem = item->value->actionId;
}
}
}