blob: 2f20bea46f350167dbf36417d9c0c189f6b67610 (
plain) (
blame)
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
|
// Configurations ---------------------------------------------------
#ifndef CONFIG_H_
#define CONFIG_H_
// ------------------------------------------------
// Number of Agent Ports
// ------------------------------------------------
// MAX_PORT defines a number of ports of agents.
// Default is 5 and should be 2 or more.
#define MAX_PORT 5
// ------------------------------------------------
// AST Heap
// ------------------------------------------------
// MAX_AST_HEAP defines the heap size of AST.
// Increase this value if the parser runs out of heap space.
// Default: 100000
#define MAX_AST_HEAP 100000
// ------------------------------------------------
// VMCode Sequence
// ------------------------------------------------
// MAX_VMCODE_SEQUENCE defines the maximum number of VM codes
// for each rule. This value limits the code size stored in the RuleTable.
// Default: 1024.
#define MAX_VMCODE_SEQUENCE 1024
// MAX_EXEC_VMCODE_SEQUENCE defines the maximum number of VM codes
// for the top-level execution.
// This buffer for this is dynamically allocated
// at the start of the top-level execution
// and de-allocated immediately after the compilation and execution finish.
// Default: 1000000.
#define MAX_EXEC_VMCODE_SEQUENCE 1000000
// ------------------------------------------------
// IMCode Sequence
// ------------------------------------------------
// MAX_IMCODE_SEQUENCE defines the maximum line number of intermediate codes.
// This buffer is statically allocated.
// Increase this value if the compiler runs out of heap space.
// Default: 1024.
//#define MAX_IMCODE_SEQUENCE 1024
#define MAX_IMCODE_SEQUENCE 1024
// ------------------------------------------------
// Heaps
// ------------------------------------------------
// There are three methods for agents and names heaps:
// - Fixed-size ring buffers
// The size is specified by an execution option -c
//
// - Expandable ring buffers
// Automatically new buffers are inserted when all are run up.
//
// - Ring buffers whose Initial size and newly inserted size
// are flexibly changed. (DEFAULT)
// The initial size and the expansion magnification are
// specified by execution options -Xms, -Xmt, respectively.
//
// Choose one among the following three definitions with uncomment.
//#define FIXED_HEAP
//#define EXPANDABLE_HEAP
#define FLEX_EXPANDABLE_HEAP
//
// For the expandable ring buffer, the unit size HOOP_SIZE can be changed.
// We note that HOOP_SIZE must be two to power.
//
#ifdef EXPANDABLE_HEAP
//#define HOOP_SIZE (1 << 12) // good for small heaps such as fib
#define HOOP_SIZE (1 << 18) // good for large heaps such as msort-80000
#endif
// ------------------------------------------------
// RuleTable
// ------------------------------------------------
// There are two implementation for the rule table:
// - Hashed linear table (default)
// - Simple array table
// To use the hashed one, comment out the following RULETABLE_SIMPLE definition.
//#define RULETABLE_SIMPLE
// ------------------------------------------------
// Optimisation
// ------------------------------------------------
// Comment out definitions if not needed.
//
// Optimisation of the intermediate codes
//
//
// - Assign registers as little as possible with expecting cache works.
// - Copy propagation and Dead code elimination for LOAD are performed.
// - Reg0 is used as a special one that stores results of comparison.
// - Some combinations are rewritten.
// For instance, `SUBI src $1 dest' becomes `DEC src dest'.
//
#define OPTIMISE_IMCODE
#ifdef OPTIMISE_IMCODE
// Furthermore optimisations on virtual machine codes:
// the following can work when the OPTIMISE_IMCODE is defined:
//
// Generate virtual machine codes with two-address notation
//
#define OPTIMISE_TWO_ADDRESS
#ifdef OPTIMISE_TWO_ADDRESS
//#define OPTIMISE_TWO_ADDRESS_UNARY // For Unary operator like INC, DEC
// (Unfinished)
#endif
#endif
// -------------------------------------------------
// ------------------------------------------------
// For developers
// ------------------------------------------------
//#define DEBUG // Show the computation process.
//#define DEBUG_MKRULE // Show compiled codes for rules.
//#define DEBUG_NETS // Show compiled codes for nets.
//#define DEBUG_EXPR_COMPILE_ERROR // Show AST of an expression
// comes with compile errors.
//#define VERBOSE_NODE_USE // Put memory usage of agents and names.
//#define VERBOSE_HOOP_EXPANSION // Put messages when hoops are expanded.
//#define VERBOSE_EQSTACK_EXPANSION // Put messages when Eqstacks are expanded.
//#define VERBOSE_TCO // Put message when TCO is enable.
#define COUNT_INTERACTION // Count the amount of interactions.
#endif
|
