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
|
/*
* Copyright 2007-2010 Adrian Thurston <thurston@complang.org>
*/
/* This file is part of Colm.
*
* Colm 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.
*
* Colm 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 Colm; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef _BYTECODE_H
#define _BYTECODE_H
#include "rtvector.h"
#include "config.h"
#include "pool.h"
#include "pdarun.h"
#include "map.h"
#include <iostream>
using std::cerr;
using std::endl;
using std::ostream;
#include "bytecode2.h"
typedef struct _Kid Kid;
typedef struct _Tree Tree;
typedef struct _ParseTree ParseTree;
typedef struct _ListEl ListEl;
typedef struct _MapEl MapEl;
typedef struct _List List;
typedef struct _Map Map;
typedef struct _Ref Ref;
typedef struct _Pointer Pointer;
typedef struct _Str Str;
typedef struct _Int Int;
typedef struct _PdaRun PdaRun;
struct TreePair
{
TreePair() : key(0), val(0) {}
Tree *key;
Tree *val;
};
void rcodeDownref( Program *prg, Tree **sp, Code *instr );
bool matchPattern( Tree **bindings, Program *prg, long pat, Kid *kid, bool checkNext );
#include "tree.h"
Tree *copyRealTree( Program *prg, Tree *tree, Kid *oldNextDown, Kid *&newNextDown, bool parsed );
void printTree( ostream &out, Tree **&sp, Program *prg, Tree *tree );
void printXmlTree( Tree **&sp, Program *prg, Tree *tree, bool commAttr );
void printXmlKid( Tree **&sp, Program *prg, Kid *kid, bool commAttr, int depth );
void listAppend( Program *prg, List *list, Tree *val );
Tree *listRemoveEnd( Program *prg, List *list );
Tree *getListMem( List *list, Word field );
Tree *getListMemSplit( Program *prg, List *list, Word field );
Tree *setListMem( List *list, Half field, Tree *value );
Tree *mapFind( Program *prg, Map *map, Tree *key );
long mapLength( Map *map );
bool mapInsert( Program *prg, Map *map, Tree *key, Tree *element );
void mapUnremove( Program *prg, Map *map, Tree *key, Tree *element );
Tree *mapUninsert( Program *prg, Map *map, Tree *key );
Tree *mapStore( Program *prg, Map *map, Tree *key, Tree *element );
Tree *mapUnstore( Program *prg, Map *map, Tree *key, Tree *existing );
TreePair mapRemove( Program *prg, Map *map, Tree *key );
Tree *getPtrVal( Pointer *ptr );
Tree *getPtrValSplit( Program *prg, Pointer *ptr );
Tree *getField( Tree *tree, Word field );
Tree *getFieldSplit( Program *prg, Tree *tree, Word field );
Tree *getRhsEl( Program *prg, Tree *lhs, long position );
void setField( Program *prg, Tree *tree, long field, Tree *value );
/* For making references of attributes. */
Kid *getFieldKid( Tree *tree, Word field );
Tree *treeIterAdvance( Program *prg, Tree **&sp, TreeIter *iter );
Tree *treeIterNextChild( Program *prg, Tree **&sp, TreeIter *iter );
Tree *treeRevIterPrevChild( Program *prg, Tree **&sp, RevTreeIter *iter );
Tree *treeIterNextRepeat( Program *prg, Tree **&sp, TreeIter *iter );
Tree *treeIterPrevRepeat( Program *prg, Tree **&sp, TreeIter *iter );
Tree *treeIterDerefCur( TreeIter *iter );
void setTriterCur( TreeIter *iter, Tree *tree );
void splitIterCur( Tree **&sp, Program *prg, TreeIter *iter );
void refSetValue( Ref *ref, Tree *v );
Tree *treeSearch( Program *prg, Kid *kid, long id );
Tree *treeSearch( Program *prg, Tree *tree, long id );
void splitRef( Tree **&sp, Program *prg, Ref *fromRef );
Tree **stackAlloc();
/*
* Runtime environment
*/
void initProgram( Program *program, int argc, char **argv,
bool ctxDepParsing, RuntimeData *rtd );
void clearProgram( Program *prg, Tree **vm_stack, Tree **sp );
void runProgram( Program *prg );
void allocGlobal( Program *prg );
void executeCode( Execution *exec, Tree **sp, Code *instr );
#endif
|
