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
|
#include <ctype.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <gmp.h>
#include <llvm-c/Analysis.h>
#include <llvm-c/Core.h>
#include <llvm-c/ExecutionEngine.h>
#include "alloc.h"
#include "analyzer.h"
#include "common.h"
#include "errors.h"
#include "strview.h"
#define lengthof(xs) (sizeof(xs) / sizeof(*(xs)))
/* A context structure we can pass to all the codegen functions just so they
have easy access to everything */
struct cgctx {
arena_t a;
LLVMContextRef ctx;
LLVMModuleRef mod;
LLVMBuilderRef bob;
LLVMValueRef func;
strview_t namespace;
};
static LLVMTypeRef type2llvm(struct cgctx, type_t);
static void codegenast(struct cgctx, mpq_t *, type_t *, ast_t,
lexemes_t)
__attribute__((nonnull));
void
codegen(const char *file, mpq_t *folds, scope_t *scps, type_t *types,
ast_t ast, lexemes_t toks)
{
(void)scps;
char *triple = LLVMGetDefaultTargetTriple();
struct cgctx ctx;
ctx.a = NULL;
ctx.namespace.p = NULL;
ctx.ctx = LLVMContextCreate();
ctx.mod = LLVMModuleCreateWithNameInContext("oryx", ctx.ctx);
ctx.bob = LLVMCreateBuilderInContext(ctx.ctx);
LLVMSetSourceFileName(ctx.mod, file, strlen(file));
LLVMSetTarget(ctx.mod, triple);
LLVMDisposeMessage(triple);
codegenast(ctx, folds, types, ast, toks);
arena_free(&ctx.a);
LLVMDisposeBuilder(ctx.bob);
char *error = NULL;
if (LLVMVerifyModule(ctx.mod, LLVMReturnStatusAction, &error) == 1)
err("codegen: %s", error);
LLVMDisposeMessage(error);
LLVMDumpModule(ctx.mod);
LLVMDisposeModule(ctx.mod);
LLVMContextDispose(ctx.ctx);
}
static idx_t
codegendecl(struct cgctx ctx, mpq_t *folds, type_t *types, ast_t ast,
lexemes_t toks, idx_t i);
idx_t
codegentypedexpr(struct cgctx ctx, mpq_t *folds, type_t *types, ast_t ast,
lexemes_t toks, idx_t i, type_t type, LLVMValueRef *outv)
{
if ((*folds[i])._mp_den._mp_d != NULL) {
if (type.kind == TYPE_NUM) {
mpz_ptr num, den;
num = mpq_numref(folds[i]);
den = mpq_denref(folds[i]);
if (mpz_cmp_ui(den, 1) != 0)
err("Invalid integer");
int cmp;
if ((sizeof(unsigned long) >= 8 && type.size <= 8)
|| type.size <= 4)
{
unsigned long x = 1UL << (type.size * 8 - type.issigned);
cmp = mpz_cmp_ui(num, x - 1);
} else {
mpz_t x;
/* Compute ‘(1 << bits) - 1’ to get the maximum value for the
integer type */
mp_bitcnt_t bits = type.size * 8;
if (type.issigned)
bits--;
mpz_init_set_ui(x, 1);
mpz_mul_2exp(x, x, bits);
mpz_sub_ui(x, x, 1);
cmp = mpz_cmp(num, x);
mpz_clear(x);
}
if (cmp > 0)
err("Integer too large for datatype");
/* The max value of a u128 is length 39 */
char buf[40];
mpz_get_str(buf, 10, num);
*outv = LLVMConstIntOfString(type2llvm(ctx, type), buf, 10);
} else
err("not implemented 1");
return fwdnode(ast, i);
}
err("not implemented 2");
}
idx_t
codegenstmt(struct cgctx ctx, mpq_t *folds, type_t *types, ast_t ast,
lexemes_t toks, idx_t i)
{
switch (ast.kinds[i]) {
case ASTDECL:
case ASTCDECL:
return codegendecl(ctx, folds, types, ast, toks, i);
case ASTRET: {
idx_t expr = ast.kids[i].rhs;
if (expr == AST_EMPTY) {
LLVMBuildRetVoid(ctx.bob);
return fwdnode(ast, i);
}
LLVMValueRef v;
i = codegentypedexpr(ctx, folds, types, ast, toks, expr, types[i], &v);
(void)LLVMBuildRet(ctx.bob, v);
return i;
}
default:
__builtin_unreachable();
}
}
idx_t
codegenblk(struct cgctx ctx, mpq_t *folds, type_t *types, ast_t ast,
lexemes_t toks, idx_t i)
{
pair_t p = ast.kids[i];
for (i = p.lhs; i <= p.rhs;
i = codegenstmt(ctx, folds, types, ast, toks, i))
;
return i;
}
idx_t
codegenfunc(struct cgctx ctx, mpq_t *folds, type_t *types, ast_t ast,
lexemes_t toks, idx_t i, const char *name)
{
LLVMTypeRef ret = types[i].ret == NULL
? LLVMVoidTypeInContext(ctx.ctx)
: type2llvm(ctx, *types[i].ret);
LLVMTypeRef ft = LLVMFunctionType(ret, NULL, 0, false);
ctx.func = LLVMAddFunction(ctx.mod, name, ft);
LLVMBasicBlockRef entry = LLVMAppendBasicBlockInContext(ctx.ctx, ctx.func,
"entry");
LLVMPositionBuilderAtEnd(ctx.bob, entry);
pair_t p = ast.kids[i];
i = codegenblk(ctx, folds, types, ast, toks, p.rhs);
if (ast.kids[p.lhs].rhs == AST_EMPTY)
LLVMBuildRetVoid(ctx.bob);
return i;
}
idx_t
codegendecl(struct cgctx ctx, mpq_t *folds, type_t *types, ast_t ast,
lexemes_t toks, idx_t i)
{
pair_t p = ast.kids[i];
/* Constants are purely a compiler concept; they aren’t generated
into anything */
if (ast.kinds[i] == ASTCDECL && ast.kinds[p.rhs] != ASTFN)
return fwdnode(ast, i);
if (ast.kinds[p.rhs] == ASTFN) {
strview_t sv = toks.strs[ast.lexemes[i]];
/* TODO: Namespace the name */
/* TODO: Temporary allocator */
char *name = bufalloc(NULL, sv.len + 1, 1);
svtocstr(name, sv);
i = codegenfunc(ctx, folds, types, ast, toks, p.rhs, name);
free(name);
return i;
} else if (!types[i].isfloat) {
strview_t sv = toks.strs[ast.lexemes[i]];
/* TODO: Namespace the name */
/* TODO: Temporary allocator */
char *name = bufalloc(NULL, sv.len + 1, 1);
LLVMTypeRef t = type2llvm(ctx, types[i]);
LLVMValueRef globl = LLVMAddGlobal(ctx.mod, t, svtocstr(name, sv));
free(name);
LLVMValueRef v;
(void)codegentypedexpr(ctx, folds, types, ast, toks, ast.kids[i].rhs, types[i], &v);
LLVMSetInitializer(globl, v);
LLVMSetLinkage(globl, LLVMInternalLinkage);
return fwdnode(ast, i);
} else /* && types[i].isfloat */
err("%s():%d: TODO", __func__, __LINE__);
}
void
codegenast(struct cgctx ctx, mpq_t *folds, type_t *types, ast_t ast,
lexemes_t toks)
{
for (idx_t i = 0; i < ast.len;
i = codegendecl(ctx, folds, types, ast, toks, i))
;
}
LLVMTypeRef
type2llvm(struct cgctx ctx, type_t t)
{
switch (t.kind) {
case TYPE_FN:
err("codegen: %s: Not implemented for function types", __func__);
case TYPE_NUM:
if (t.isfloat) {
switch (t.size) {
case 2: return LLVMHalfTypeInContext(ctx.ctx);
case 4: return LLVMFloatTypeInContext(ctx.ctx);
case 0:
case 8: return LLVMDoubleTypeInContext(ctx.ctx);
case 16: return LLVMFP128TypeInContext(ctx.ctx);
default: __builtin_unreachable();
}
}
/* TODO: Arbitrary precision */
if (t.size == 0)
return LLVMInt64TypeInContext(ctx.ctx);
assert((unsigned)t.size * 8 <= UINT8_MAX);
return LLVMIntTypeInContext(ctx.ctx, t.size * 8);
default:
__builtin_unreachable();
}
}
|