-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathsinc.c
271 lines (211 loc) · 6.28 KB
/
sinc.c
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
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include <string.h>
#include <unistd.h>
#include <stdbool.h>
#include "sinc.h"
#include "sexpr.h"
#include "llvm_codegen.h"
#include "sinter_codegen.h"
#include "graphviz_codegen.h"
#include "parse.h"
#include "debug.h"
#include "error.h"
typedef unsigned int uint;
static char *input_filename;
static char *output_filename;
static format_t format;
extern FILE *yyin;
int yyparse(void);
int verbose;
sexpr *new_sexpr(int type, contents val, lloc_t lloc) {
/* FIXME: unchecked memory allocation! */
sexpr *ret = malloc(sizeof (*ret));
ret->type = type;
ret->contents = val;
ret->lloc = lloc;
return ret;
}
sexpr *new_int(int num, lloc_t lloc) {
contents c;
c.i = num;
return new_sexpr(INT, c, lloc);
}
sexpr *new_str(char *str, lloc_t lloc) {
contents c;
c.s = str;
return new_sexpr(STRING, c, lloc);
}
sexpr *new_float(double num, lloc_t lloc) {
contents c;
c.f = num;
return new_sexpr(FLOAT, c, lloc);
}
sexpr *new_id(char *id, lloc_t lloc) {
contents c;
c.s = id;
return new_sexpr(ID, c, lloc);
}
sexpr *new_node(sexpr *l, sexpr *r, lloc_t lloc) {
contents c;
c.n.l = l;
c.n.r = r;
return new_sexpr(BRANCH, c, lloc);
}
void prologue(optimisation_t *llvm_info) {
switch (format) {
case LLVM_INTERMEDIATE:
case BITCODE:
case INTERPRET:
llvm_codegen_prologue(input_filename, llvm_info);
break;
case GRAPHVIZ:
graphviz_codegen_prologue();
break;
case SINTER:
sinter_codegen_prologue();
break;
}
}
void handle(sexpr *se) {
switch (format) {
case LLVM_INTERMEDIATE:
case BITCODE:
case INTERPRET:
llvm_codegen(se);
break;
case GRAPHVIZ:
graphviz_codegen(se);
break;
case SINTER:
sinter_codegen(se);
break;
}
}
void epilogue(char *output_filename, format_t format) {
switch (format) {
case LLVM_INTERMEDIATE:
case BITCODE:
case INTERPRET:
llvm_codegen_epilogue(output_filename, format);
break;
case GRAPHVIZ:
graphviz_codegen_epilogue(output_filename);
break;
case SINTER:
sinter_codegen_epilogue(output_filename);
break;
}
}
int main(int argc, char **argv) {
int c;
output_filename = 0;
format = LLVM_INTERMEDIATE;
optimisation_t llvm_info = {
.boxing_rule = ALWAYS_BOX,
.default_bit_width = 0,
.tail_recursive_mod_cons = true,
.llvm_attributes = true
};
verbose = 0;
debug("\n");
while ((c = getopt(argc, argv, "bghilo:O:qsu:vw:")) != -1) {
switch (c) {
case 'b':
format = BITCODE;
break;
case 'g':
format = GRAPHVIZ;
break;
case 'h':
printf(
"usage: %s [options] <input_file>\n"
"-b Specify bitcode-format output\n"
"-g Output a Graphviz .dot file\n"
"-h Print this help message\n"
"-i Interpret mode\n"
"-l Specify human-readable output\n"
"-o <output> Specify output filename\n"
"-O <opt> Enable compiler optimisation\n"
"-q Quiet (default)\n"
"-s Output S-expression description\n"
"-u <rule> Set the boxing rule: always, never, or smart\n"
"-v Verbose\n"
"-w <width> Specify default width of integers in bits\n",
argv[0]);
exit(0);
case 'i':
format = INTERPRET;
break;
case 'l':
format = LLVM_INTERMEDIATE;
break;
case 'o':
output_filename = strdup(optarg);
break;
case 'O':
if (!strcmp(optarg, "tail-recursive-mod-cons")) {
llvm_info.tail_recursive_mod_cons = true;
} else if (!strcmp(optarg, "no-tail-recursive-mod-cons")) {
llvm_info.tail_recursive_mod_cons = false;
} else if (!strcmp(optarg, "llvm-attributes")) {
llvm_info.llvm_attributes = true;
} else if (!strcmp(optarg, "no-llvm-attributes")) {
llvm_info.llvm_attributes = false;
} else {
error(INVALID_ARGUMENTS,
"%s is not a recognised optimisation name\n",
optarg);
}
break;
case 'q':
verbose = 0;
break;
case 's':
format = SINTER;
break;
case 'u':
if (!strcmp(optarg, "always")) {
llvm_info.boxing_rule = ALWAYS_BOX;
} else if (!strcmp(optarg, "never")) {
llvm_info.boxing_rule = NEVER_BOX;
} else if (!strcmp(optarg, "smart")) {
llvm_info.boxing_rule = SMART_BOX;
} else {
error(INVALID_ARGUMENTS,
"%s is not a valid option for -u\n", optarg);
}
break;
case 'v':
verbose = 1;
break;
case 'w':
llvm_info.default_bit_width = atoi(optarg);
break;
case '?':
switch (optopt) {
case 'o':
case 'O':
error(INVALID_ARGUMENTS,
"-%c option requires an argument", optopt);
break;
default:
error(INVALID_ARGUMENTS, "unknown option %c", optopt);
}
break;
default:
error(INVALID_ARGUMENTS, "error parsing arguments");
}
}
if (argc - optind > 1) {
error(INVALID_ARGUMENTS, "too many arguments");
} else if (argc - optind == 1) {
input_filename = argv[argc - 1];
yyin = fopen(input_filename, "r");
}
prologue(&llvm_info);
yyparse();
epilogue(output_filename, format);
return 0;
}