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
|
/*
* Copyright 2001-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.
*/
#ifndef _ACTION_H
#define _ACTION_H
#include "fsmgraph.h"
struct NameInst;
struct NameRef;
struct FsmLongestMatch;
struct InlineList;
struct FsmLongestMatchPart;
struct Action;
struct CondSpace;
/*
* Inline code tree
*/
struct InlineItem
{
enum Type
{
Text, Goto, Call, Ncall, Next, GotoExpr, CallExpr, NcallExpr, NextExpr, Ret, Nret,
PChar, Char, Hold, Curs, Targs, Entry, Exec, Break, Nbreak,
LmSwitch, LmSetActId, LmSetTokEnd, LmOnLast, LmOnNext, LmOnLagBehind,
LmInitAct, LmInitTokStart, LmSetTokStart, LmNfaOnNext, LmNfaOnLast, LmNfaOnEof, Stmt, Subst,
NfaWrapAction, NfaWrapConds
};
InlineItem( const InputLoc &loc, std::string data, Type type ) :
loc(loc), data(data), nameRef(0), children(0), type(type) { }
InlineItem( const InputLoc &loc, NameRef *nameRef, Type type ) :
loc(loc), nameRef(nameRef), children(0), type(type) { }
InlineItem( const InputLoc &loc, FsmLongestMatch *longestMatch,
FsmLongestMatchPart *longestMatchPart, Type type ) : loc(loc),
nameRef(0), children(0), longestMatch(longestMatch),
longestMatchPart(longestMatchPart), type(type) { }
InlineItem( const InputLoc &loc, NameInst *nameTarg, Type type ) :
loc(loc), nameRef(0), nameTarg(nameTarg), children(0),
type(type) { }
InlineItem( const InputLoc &loc, Type type ) :
loc(loc), nameRef(0), children(0), type(type) { }
InlineItem( const InputLoc &loc, Action *wrappedAction, Type type )
:
loc(loc), nameRef(0), children(0), longestMatch(0),
longestMatchPart(0), wrappedAction(wrappedAction), type(type)
{}
InlineItem( const InputLoc &loc, CondSpace *condSpace,
const CondKeySet &condKeySet, Type type )
:
loc(loc), nameRef(0), children(0), longestMatch(0),
longestMatchPart(0), wrappedAction(0), condSpace(condSpace),
condKeySet(condKeySet), type(type)
{}
~InlineItem();
InputLoc loc;
std::string data;
NameRef *nameRef;
NameInst *nameTarg;
InlineList *children;
FsmLongestMatch *longestMatch;
FsmLongestMatchPart *longestMatchPart;
long substPos;
Action *wrappedAction;
CondSpace *condSpace;
CondKeySet condKeySet;
Type type;
InlineItem *prev, *next;
};
/* Normally this would be atypedef, but that would entail including DList from
* ptreetypes, which should be just typedef forwards. */
struct InlineList : public DList<InlineItem> { };
struct InlineBlock
{
InlineBlock( const InputLoc &loc, InlineList *inlineList )
: loc(loc), inlineList(inlineList) {}
~InlineBlock()
{
inlineList->empty();
delete inlineList;
}
InputLoc loc;
InlineList *inlineList;
};
#endif
|
