1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417
|
/*
* Copyright 2001-2006 Adrian Thurston <thurston@cs.queensu.ca>
* 2004 Eric Ocean <eric.ocean@ampede.com>
* 2005 Alan West <alan@alanz.com>
*/
/* 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 "rlcodegen.h"
#include "ipgotocodegen.h"
#include "redfsm.h"
#include "gendata.h"
#include "bstmap.h"
void IpGotoCodeGen::GOTO( ostream &ret, int gotoDest, bool inFinish )
{
ret << "{goto st" << gotoDest << ";}";
}
void IpGotoCodeGen::CALL( ostream &ret, int callDest, int targState, bool inFinish )
{
ret << "{" << STACK() << "[" << TOP() << "++] = " << targState <<
"; goto st" << callDest << ";}";
}
void IpGotoCodeGen::RET( ostream &ret, bool inFinish )
{
ret << "{" << CS() << " = " << STACK() << "[--" << TOP() << "]; goto _again;}";
}
void IpGotoCodeGen::GOTO_EXPR( ostream &ret, InlineItem *ilItem, bool inFinish )
{
ret << "{" << CS() << " = (";
INLINE_LIST( ret, ilItem->children, 0, inFinish );
ret << "); goto _again;}";
}
void IpGotoCodeGen::CALL_EXPR( ostream &ret, InlineItem *ilItem, int targState, bool inFinish )
{
ret << "{" << STACK() << "[" << TOP() << "++] = " << targState << "; " << CS() << " = (";
INLINE_LIST( ret, ilItem->children, 0, inFinish );
ret << "); goto _again;}";
}
void IpGotoCodeGen::NEXT( ostream &ret, int nextDest, bool inFinish )
{
ret << CS() << " = " << nextDest << ";";
}
void IpGotoCodeGen::NEXT_EXPR( ostream &ret, InlineItem *ilItem, bool inFinish )
{
ret << CS() << " = (";
INLINE_LIST( ret, ilItem->children, 0, inFinish );
ret << ");";
}
void IpGotoCodeGen::CURS( ostream &ret, bool inFinish )
{
ret << "(_ps)";
}
void IpGotoCodeGen::TARGS( ostream &ret, bool inFinish, int targState )
{
ret << targState;
}
void IpGotoCodeGen::BREAK( ostream &ret, int targState )
{
ret << "goto _out" << targState << ";";
}
bool IpGotoCodeGen::IN_TRANS_ACTIONS( RedStateAp *state )
{
bool anyWritten = false;
/* Emit any transitions that have actions and that go to this state. */
for ( int it = 0; it < state->numInTrans; it++ ) {
RedTransAp *trans = state->inTrans[it];
if ( trans->action != 0 && trans->labelNeeded ) {
/* Remember that we wrote an action so we know to write the
* line directive for going back to the output. */
anyWritten = true;
/* Write the label for the transition so it can be jumped to. */
out << "tr" << trans->id << ":\n";
/* If the action contains a next, then we must preload the current
* state since the action may or may not set it. */
if ( trans->action->anyNextStmt() )
out << " " << CS() << " = " << trans->targ->id << ";\n";
/* Write each action in the list. */
for ( ActionTable::Iter item = trans->action->key; item.lte(); item++ )
ACTION( out, item->value, trans->targ->id, false );
/* If the action contains a next then we need to reload, otherwise
* jump directly to the target state. */
if ( trans->action->anyNextStmt() )
out << "\tgoto _again;\n";
else
out << "\tgoto st" << trans->targ->id << ";\n";
}
}
return anyWritten;
}
/* Called from GotoCodeGen::STATE_GOTOS just before writing the gotos for each
* state. */
void IpGotoCodeGen::GOTO_HEADER( RedStateAp *state )
{
bool anyWritten = IN_TRANS_ACTIONS( state );
if ( state->labelNeeded )
out << "st" << state->id << ":\n";
if ( state->toStateAction != 0 ) {
/* Remember that we wrote an action. Write every action in the list. */
anyWritten = true;
for ( ActionTable::Iter item = state->toStateAction->key; item.lte(); item++ )
ACTION( out, item->value, state->id, false );
}
/* Advance and test buffer pos. */
if ( state->labelNeeded ) {
if ( cgd->hasEnd ) {
out <<
" if ( ++" << P() << " == " << PE() << " )\n"
" goto _out" << state->id << ";\n";
}
else {
out <<
" " << P() << " += 1;\n";
}
}
/* Give the state a switch case. */
out << "case " << state->id << ":\n";
if ( state->fromStateAction != 0 ) {
/* Remember that we wrote an action. Write every action in the list. */
anyWritten = true;
for ( ActionTable::Iter item = state->fromStateAction->key; item.lte(); item++ )
ACTION( out, item->value, state->id, false );
}
if ( anyWritten )
genLineDirective( out );
/* Record the prev state if necessary. */
if ( state->anyRegCurStateRef() )
out << " _ps = " << state->id << ";\n";
}
void IpGotoCodeGen::STATE_GOTO_ERROR()
{
/* In the error state we need to emit some stuff that usually goes into
* the header. */
RedStateAp *state = redFsm->errState;
bool anyWritten = IN_TRANS_ACTIONS( state );
/* No case label needed since we don't switch on the error state. */
if ( anyWritten )
genLineDirective( out );
if ( state->labelNeeded )
out << "st" << state->id << ":\n";
/* Break out here. */
out << " goto _out" << state->id << ";\n";
}
/* Emit the goto to take for a given transition. */
std::ostream &IpGotoCodeGen::TRANS_GOTO( RedTransAp *trans, int level )
{
if ( trans->action != 0 ) {
/* Go to the transition which will go to the state. */
out << TABS(level) << "goto tr" << trans->id << ";";
}
else {
/* Go directly to the target state. */
out << TABS(level) << "goto st" << trans->targ->id << ";";
}
return out;
}
std::ostream &IpGotoCodeGen::EXIT_STATES()
{
for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
if ( st->outNeeded ) {
outLabelUsed = true;
out << " _out" << st->id << ": " << CS() << " = " <<
st->id << "; goto _out; \n";
}
}
return out;
}
std::ostream &IpGotoCodeGen::AGAIN_CASES()
{
for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
out <<
" case " << st->id << ": goto st" << st->id << ";\n";
}
return out;
}
std::ostream &IpGotoCodeGen::FINISH_CASES()
{
bool anyWritten = false;
for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
if ( st->eofAction != 0 ) {
if ( st->eofAction->eofRefs == 0 )
st->eofAction->eofRefs = new IntSet;
st->eofAction->eofRefs->insert( st->id );
}
}
for ( ActionTableMap::Iter act = redFsm->actionMap; act.lte(); act++ ) {
if ( act->eofRefs != 0 ) {
for ( IntSet::Iter pst = *act->eofRefs; pst.lte(); pst++ )
out << " case " << *pst << ": \n";
/* Remember that we wrote a trans so we know to write the
* line directive for going back to the output. */
anyWritten = true;
/* Write each action in the eof action list. */
for ( ActionTable::Iter item = act->key; item.lte(); item++ )
ACTION( out, item->value, STATE_ERR_STATE, true );
out << "\tbreak;\n";
}
}
if ( anyWritten )
genLineDirective( out );
return out;
}
void IpGotoCodeGen::setLabelsNeeded( InlineList *inlineList )
{
for ( InlineList::Iter item = *inlineList; item.lte(); item++ ) {
switch ( item->type ) {
case InlineItem::Goto: case InlineItem::Call: {
/* Mark the target as needing a label. */
item->targState->labelNeeded = true;
break;
}
default: break;
}
if ( item->children != 0 )
setLabelsNeeded( item->children );
}
}
/* Set up labelNeeded flag for each state. */
void IpGotoCodeGen::setLabelsNeeded()
{
/* If we use the _again label, then we the _again switch, which uses all
* labels. */
if ( useAgainLabel() ) {
for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ )
st->labelNeeded = true;
}
else {
/* Do not use all labels by default, init all labelNeeded vars to false. */
for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ )
st->labelNeeded = false;
if ( redFsm->errState != 0 && anyLmSwitchError() )
redFsm->errState->labelNeeded = true;
/* Walk all transitions and set only those that have targs. */
for ( TransApSet::Iter trans = redFsm->transSet; trans.lte(); trans++ ) {
/* If there is no action with a next statement, then the label will be
* needed. */
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 ( ActionTable::Iter act = trans->action->key; act.lte(); act++ ) {
/* Get the action and walk it's tree. */
setLabelsNeeded( act->value->inlineList );
}
}
}
}
if ( cgd->hasEnd ) {
for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ )
st->outNeeded = st->labelNeeded;
}
else {
if ( redFsm->errState != 0 )
redFsm->errState->outNeeded = true;
for ( TransApSet::Iter trans = redFsm->transSet; trans.lte(); trans++ ) {
/* Any state with a transition in that has a break will need an
* out label. */
if ( trans->action != 0 && trans->action->anyBreakStmt() )
trans->targ->outNeeded = true;
}
}
}
void IpGotoCodeGen::writeOutData()
{
out <<
"static const int " << START() << " = " << START_STATE_ID() << ";\n"
"\n";
if ( cgd->writeFirstFinal ) {
out <<
"static const int " << FIRST_FINAL() << " = " << FIRST_FINAL_STATE() << ";\n"
"\n";
}
if ( cgd->writeErr ) {
out <<
"static const int " << ERROR() << " = " << ERROR_STATE() << ";\n"
"\n";
}
}
void IpGotoCodeGen::writeOutExec()
{
outLabelUsed = false;
out << " {\n";
if ( anyRegCurStateRef() )
out << " int _ps = 0;\n";
if ( anyConditions() )
out << " " << WIDE_ALPH_TYPE() << " _widec;\n";
if ( cgd->hasEnd ) {
outLabelUsed = true;
out <<
" if ( " << P() << " == " << PE() << " )\n"
" goto _out;\n";
}
if ( useAgainLabel() ) {
out <<
" goto _resume;\n"
"\n"
"_again:\n"
" switch ( " << CS() << " ) {\n";
AGAIN_CASES() <<
" default: break;\n"
" }\n"
"\n";
if ( cgd->hasEnd ) {
outLabelUsed = true;
out <<
" if ( ++" << P() << " == " << PE() << " )\n"
" goto _out;\n";
}
else {
out <<
" " << P() << " += 1;\n";
}
out << "_resume:\n";
}
out <<
" switch ( " << CS() << " )\n {\n";
STATE_GOTOS();
SWITCH_DEFAULT() <<
" }\n";
EXIT_STATES() <<
"\n";
if ( outLabelUsed )
out << " _out: {}\n";
out <<
" }\n";
}
void IpGotoCodeGen::writeOutEOF()
{
if ( anyEofActions() ) {
out <<
" {\n"
" switch ( " << CS() << " ) {\n";
FINISH_CASES();
SWITCH_DEFAULT() <<
" }\n"
" }\n"
"\n";
}
}
|