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
|
/*
* Copyright 2006-2012 Adrian Thurston <thurston@complang.org>
*/
#ifndef _FSMREDUCE_H
#define _FSMREDUCE_H
#include <iostream>
#include "avltree.h"
#include "fsmgraph.h"
#include "compiler.h"
/* Forwards. */
struct FsmTrans;
struct FsmGraph;
struct Compiler;
struct FsmCodeGen;
struct RedFsm;
struct GenCondSpace;
struct Condition;
struct RedActionTable
:
public AvlTreeEl<RedActionTable>
{
RedActionTable( const ActionTable &key )
:
key(key),
id(0)
{ }
const ActionTable &getKey()
{ return key; }
ActionTable key;
int id;
};
typedef AvlTree<RedActionTable, ActionTable, CmpActionTable> ActionTableMap;
struct NextRedTrans
{
Key lowKey, highKey;
FsmTrans *trans;
FsmTrans *next;
void load() {
if ( trans != 0 ) {
next = trans->next;
lowKey = trans->lowKey;
highKey = trans->highKey;
}
}
NextRedTrans( FsmTrans *t ) {
trans = t;
load();
}
void increment() {
trans = next;
load();
}
};
class RedFsmBuild
{
public:
RedFsmBuild( Compiler *pd, FsmGraph *fsm );
RedFsm *reduceMachine( );
private:
void appendTrans( TransListVect &outList, Key lowKey, Key highKey, FsmTrans *trans );
void makeStateActions( FsmState *state );
void makeStateList();
void makeStateConditions( FsmState *state );
void initActionList( unsigned long length );
void newAction( int anum, char *name, int line, int col, Action *action );
void initActionTableList( unsigned long length );
void initCondSpaceList( ulong length );
void condSpaceItem( int cnum, long condActionId );
void newCondSpace( int cnum, int condSpaceId, Key baseKey );
void initStateCondList( int snum, ulong length );
void addStateCond( int snum, Key lowKey, Key highKey, long condNum );
void initStateList( unsigned long length );
void addRegionToEntry( int regionId, int entryId );
void addEntryPoint( int entryId, unsigned long entryState );
void setId( int snum, int id );
void initTransList( int snum, unsigned long length );
void newTrans( int snum, int tnum, Key lowKey, Key highKey,
long targ, long act );
void finishTransList( int snum );
void setFinal( int snum );
void setEofTrans( int snum, int eofTarget, int actId );
void setStateActions( int snum, long toStateAction,
long fromStateAction, long eofAction );
void setForcedErrorState();
void closeMachine();
Key findMaxKey();
void makeEntryPoints();
void makeGetKeyExpr();
void makeAccessExpr();
void makeCurStateExpr();
void makeConditions();
void makeInlineList( InlineList *inlineList, InlineItem *context );
void makeActionList();
void makeActionTableList();
void reduceTrans( FsmTrans *trans );
void reduceActionTables();
void makeTransList( FsmState *state );
void makeTrans( Key lowKey, Key highKey, FsmTrans *defTrans );
void makeAction( Action *action );
void makeLmSwitch( InlineItem *item );
void makeMachine();
void makeActionExec( InlineItem *item );
void makeActionExecTE( InlineItem *item );
Compiler *pd;
FsmGraph *fsm;
ActionTableMap actionTableMap;
int nextActionTableId;
int startState;
int errState;
public:
RedFsm *redFsm;
private:
int curAction;
int curActionTable;
int curTrans;
int curState;
int curCondSpace;
int curStateCond;
};
#endif /* _FSMREDUCE_H */
|
