MimIR 0.1
MimIR is my Intermediate Representation
Loading...
Searching...
No Matches
ll.cpp
Go to the documentation of this file.
2
3#include <deque>
4#include <fstream>
5#include <iomanip>
6#include <ranges>
7
8#include <absl/container/btree_set.h>
9
10#include <mim/plug/clos/clos.h>
11#include <mim/plug/math/math.h>
12#include <mim/plug/mem/mem.h>
13
14#include "mim/be/emitter.h"
15#include "mim/util/print.h"
16#include "mim/util/sys.h"
17
18#include "mim/plug/core/core.h"
19
20// Lessons learned:
21// * **Always** follow all ops - even if you actually want to ignore one.
22// Otherwise, you might end up with an incorrect schedule.
23// This was the case for an Extract of type Mem.
24// While we want to ignore the value obtained from that, since there is no Mem value in LLVM,
25// we still want to **first** recursively emit code for its operands and **then** ignore the Extract itself.
26// * i1 has a different meaning in LLVM then in Mim:
27// * Mim: {0, 1} = i1
28// * LLVM: {0, -1} = i1
29// This is a problem when, e.g., using an index of type i1 as LLVM thinks like this:
30// getelementptr ..., i1 1 == getelementptr .., i1 -1
31using namespace std::string_literals;
32
33namespace mim::ll {
34
35namespace clos = mim::plug::clos;
36namespace core = mim::plug::core;
37namespace math = mim::plug::math;
38namespace mem = mim::plug::mem;
39
40namespace {
41bool is_const(const Def* def) {
42 if (def->isa<Bot>()) return true;
43 if (def->isa<Lit>()) return true;
44 if (auto pack = def->isa_imm<Pack>()) return is_const(pack->arity()) && is_const(pack->body());
45
46 if (auto tuple = def->isa<Tuple>()) {
47 auto ops = tuple->ops();
48 return std::ranges::all_of(ops, [](auto def) { return is_const(def); });
49 }
50
51 return false;
52}
53
54const char* math_suffix(const Def* type) {
55 if (auto w = math::isa_f(type)) {
56 switch (*w) {
57 case 32: return "f";
58 case 64: return "";
59 }
60 }
61 error("unsupported foating point type '{}'", type);
62}
63
64const char* llvm_suffix(const Def* type) {
65 if (auto w = math::isa_f(type)) {
66 switch (*w) {
67 case 16: return ".f16";
68 case 32: return ".f32";
69 case 64: return ".f64";
70 }
71 }
72 error("unsupported foating point type '{}'", type);
73}
74
75// [%mem.M 0, T] => T
76// TODO there may be more instances where we have to deal with this trickery
77const Def* isa_mem_sigma_2(const Def* type) {
78 if (auto sigma = type->isa<Sigma>())
79 if (sigma->num_ops() == 2 && Axm::isa<mem::M>(sigma->op(0))) return sigma->op(1);
80 return {};
81}
82} // namespace
83
84struct BB {
85 BB() = default;
86 BB(const BB&) = delete;
87 BB(BB&& other) noexcept = default;
88 BB& operator=(BB other) noexcept { return swap(*this, other), *this; }
89
90 std::deque<std::ostringstream>& head() { return parts[0]; }
91 std::deque<std::ostringstream>& body() { return parts[1]; }
92 std::deque<std::ostringstream>& tail() { return parts[2]; }
93
94 template<class... Args>
95 std::string assign(std::string_view name, const char* s, Args&&... args) {
96 print(print(body().emplace_back(), "{} = ", name), s, std::forward<Args>(args)...);
97 return std::string(name);
98 }
99
100 template<class... Args>
101 void tail(const char* s, Args&&... args) {
102 print(tail().emplace_back(), s, std::forward<Args>(args)...);
103 }
104
105 friend void swap(BB& a, BB& b) noexcept {
106 using std::swap;
107 swap(a.phis, b.phis);
108 swap(a.parts, b.parts);
109 }
110
112 std::array<std::deque<std::ostringstream>, 3> parts;
113};
114
115class Emitter : public mim::Emitter<std::string, std::string, BB, Emitter> {
116public:
118
119 Emitter(World& world, std::ostream& ostream)
120 : Super(world, "llvm_emitter", ostream) {}
121
122 bool is_valid(std::string_view s) { return !s.empty(); }
123 void start() override;
124 void emit_imported(Lam*);
125 void emit_epilogue(Lam*);
126 std::string emit_bb(BB&, const Def*);
127 std::string prepare();
128 void finalize();
129
130 template<class... Args>
131 void declare(const char* s, Args&&... args) {
132 std::ostringstream decl;
133 print(decl << "declare ", s, std::forward<Args>(args)...);
134 decls_.emplace(decl.str());
135 }
136
137private:
138 std::string id(const Def*, bool force_bb = false) const;
139 std::string convert(const Def*);
140 std::string convert_ret_pi(const Pi*);
141
142 absl::btree_set<std::string> decls_;
143 std::ostringstream type_decls_;
144 std::ostringstream vars_decls_;
145 std::ostringstream func_decls_;
146 std::ostringstream func_impls_;
147};
148
149/*
150 * convert
151 */
152
153std::string Emitter::id(const Def* def, bool force_bb /*= false*/) const {
154 if (auto global = def->isa<Global>()) return "@" + global->unique_name();
155
156 if (auto lam = def->isa_mut<Lam>(); lam && !force_bb) {
157 if (lam->type()->ret_pi()) {
158 if (lam->is_external() || !lam->is_set())
159 return "@"s + lam->sym().str(); // TODO or use is_internal or sth like that?
160 return "@"s + lam->unique_name();
161 }
162 }
163
164 return "%"s + def->unique_name();
165}
166
167std::string Emitter::convert(const Def* type) {
168 if (auto i = types_.find(type); i != types_.end()) return i->second;
169
170 assert(!Axm::isa<mem::M>(type));
171 std::ostringstream s;
172 std::string name;
173
174 if (type->isa<Nat>()) {
175 return types_[type] = "i64";
176 } else if (auto size = Idx::isa(type)) {
177 return types_[type] = "i" + std::to_string(*Idx::size2bitwidth(size));
178 } else if (auto w = math::isa_f(type)) {
179 switch (*w) {
180 case 16: return types_[type] = "half";
181 case 32: return types_[type] = "float";
182 case 64: return types_[type] = "double";
183 default: fe::unreachable();
184 }
185 } else if (auto ptr = Axm::isa<mem::Ptr>(type)) {
186 auto [pointee, addr_space] = ptr->args<2>();
187 // TODO addr_space
188 print(s, "{}*", convert(pointee));
189 } else if (auto arr = type->isa<Arr>()) {
190 auto t_elem = convert(arr->body());
191 u64 size = 0;
192 if (auto arity = Lit::isa(arr->arity())) size = *arity;
193 print(s, "[{} x {}]", size, t_elem);
194 } else if (auto pi = type->isa<Pi>()) {
195 assert(Pi::isa_returning(pi) && "should never have to convert type of BB");
196 print(s, "{} (", convert_ret_pi(pi->ret_pi()));
197
198 if (auto t = isa_mem_sigma_2(pi->dom()))
199 s << convert(t);
200 else {
201 auto doms = pi->doms();
202 for (auto sep = ""; auto dom : doms.view().rsubspan(1)) {
203 if (Axm::isa<mem::M>(dom)) continue;
204 s << sep << convert(dom);
205 sep = ", ";
206 }
207 }
208 s << ")*";
209 } else if (auto t = isa_mem_sigma_2(type)) {
210 return convert(t);
211 } else if (auto sigma = type->isa<Sigma>()) {
212 if (sigma->isa_mut()) {
213 name = id(sigma);
214 types_[sigma] = name;
215 print(s, "{} = type", name);
216 }
217
218 print(s, "{{");
219 for (auto sep = ""; auto t : sigma->ops()) {
220 if (Axm::isa<mem::M>(t)) continue;
221 s << sep << convert(t);
222 sep = ", ";
223 }
224 print(s, "}}");
225 } else {
226 fe::unreachable();
227 }
228
229 if (name.empty()) return types_[type] = s.str();
230
231 assert(!s.str().empty());
232 type_decls_ << s.str() << '\n';
233 return types_[type] = name;
234}
235
236std::string Emitter::convert_ret_pi(const Pi* pi) {
237 auto dom = mem::strip_mem_ty(pi->dom());
238 if (dom == world().sigma()) return "void";
239 return convert(dom);
240}
241
242/*
243 * emit
244 */
245
247 Super::start();
248
249 ostream() << type_decls_.str() << '\n';
250 for (auto&& decl : decls_)
251 ostream() << decl << '\n';
252 ostream() << func_decls_.str() << '\n';
253 ostream() << vars_decls_.str() << '\n';
254 ostream() << func_impls_.str() << '\n';
255}
256
258 // TODO merge with declare method
259 print(func_decls_, "declare {} {}(", convert_ret_pi(lam->type()->ret_pi()), id(lam));
260
261 auto doms = lam->doms();
262 for (auto sep = ""; auto dom : doms.view().rsubspan(1)) {
263 if (Axm::isa<mem::M>(dom)) continue;
264 print(func_decls_, "{}{}", sep, convert(dom));
265 sep = ", ";
266 }
267
268 print(func_decls_, ")\n");
269}
270
271std::string Emitter::prepare() {
272 print(func_impls_, "define {} {}(", convert_ret_pi(root()->type()->ret_pi()), id(root()));
273
274 auto vars = root()->vars();
275 for (auto sep = ""; auto var : vars.view().rsubspan(1)) {
276 if (Axm::isa<mem::M>(var->type())) continue;
277 auto name = id(var);
278 locals_[var] = name;
279 print(func_impls_, "{}{} {}", sep, convert(var->type()), name);
280 sep = ", ";
281 }
282
283 print(func_impls_, ") {{\n");
284 return root()->unique_name();
285}
286
288 for (auto& [lam, bb] : lam2bb_) {
289 for (const auto& [phi, args] : bb.phis) {
290 print(bb.head().emplace_back(), "{} = phi {} ", id(phi), convert(phi->type()));
291 for (auto sep = ""; const auto& [arg, pred] : args) {
292 print(bb.head().back(), "{}[ {}, {} ]", sep, arg, pred);
293 sep = ", ";
294 }
295 }
296 }
297
298 for (auto mut : Scheduler::schedule(nest())) {
299 if (auto lam = mut->isa_mut<Lam>()) {
300 assert(lam2bb_.contains(lam));
301 auto& bb = lam2bb_[lam];
302 print(func_impls_, "{}:\n", lam->unique_name());
303
304 ++tab;
305 for (const auto& part : bb.parts)
306 for (const auto& line : part)
307 tab.print(func_impls_, "{}\n", line.str());
308 --tab;
309 func_impls_ << std::endl;
310 }
311 }
312
313 print(func_impls_, "}}\n\n");
314}
315
317 auto app = lam->body()->as<App>();
318 auto& bb = lam2bb_[lam];
319
320 if (app->callee() == root()->ret_var()) { // return
321 std::vector<std::string> values;
322 std::vector<const Def*> types;
323
324 for (auto arg : app->args()) {
325 if (auto val = emit_unsafe(arg); !val.empty()) {
326 values.emplace_back(val);
327 types.emplace_back(arg->type());
328 }
329 }
330
331 switch (values.size()) {
332 case 0: return bb.tail("ret void");
333 case 1: return bb.tail("ret {} {}", convert(types[0]), values[0]);
334 default: {
335 std::string prev = "undef";
336 auto type = convert(world().sigma(types));
337 for (size_t i = 0, n = values.size(); i != n; ++i) {
338 auto v_elem = values[i];
339 auto t_elem = convert(types[i]);
340 auto namei = "%ret_val." + std::to_string(i);
341 bb.tail("{} = insertvalue {} {}, {} {}, {}", namei, type, prev, t_elem, v_elem, i);
342 prev = namei;
343 }
344
345 bb.tail("ret {} {}", type, prev);
346 }
347 }
348 } else if (auto dispatch = Dispatch(app)) {
349 for (auto callee : dispatch.tuple()->projs([](const Def* def) { return def->isa_mut<Lam>(); })) {
350 size_t n = callee->num_tvars();
351 for (size_t i = 0; i != n; ++i) {
352 if (auto arg = emit_unsafe(app->arg(n, i)); !arg.empty()) {
353 auto phi = callee->var(n, i);
354 assert(!Axm::isa<mem::M>(phi->type()));
355 lam2bb_[callee].phis[phi].emplace_back(arg, id(lam, true));
356 locals_[phi] = id(phi);
357 }
358 }
359 }
360
361 auto v_index = emit(dispatch.index());
362 size_t n = dispatch.num_targets();
363 auto bbs = absl::FixedArray<std::string>(n);
364 for (size_t i = 0; i != n; ++i)
365 bbs[i] = emit(dispatch.target(i));
366
367 if (auto branch = Branch(app)) return bb.tail("br i1 {}, label {}, label {}", v_index, bbs[1], bbs[0]);
368
369 auto t_index = convert(dispatch.index()->type());
370 bb.tail("switch {} {}, label {} [ ", t_index, v_index, bbs[0]);
371 for (size_t i = 1; i != n; ++i)
372 print(bb.tail().back(), "{} {}, label {} ", t_index, std::to_string(i), bbs[i]);
373 print(bb.tail().back(), "]");
374 } else if (app->callee()->isa<Bot>()) {
375 return bb.tail("ret ; bottom: unreachable");
376 } else if (auto callee = Lam::isa_mut_basicblock(app->callee())) { // ordinary jump
377 size_t n = callee->num_tvars();
378 for (size_t i = 0; i != n; ++i) {
379 if (auto arg = emit_unsafe(app->arg(n, i)); !arg.empty()) {
380 auto phi = callee->var(n, i);
381 assert(!Axm::isa<mem::M>(phi->type()));
382 lam2bb_[callee].phis[phi].emplace_back(arg, id(lam, true));
383 locals_[phi] = id(phi);
384 }
385 }
386 return bb.tail("br label {}", id(callee));
387 } else if (auto longjmp = Axm::isa<clos::longjmp>(app)) {
388 declare("void @longjmp(i8*, i32) noreturn");
389
390 auto [mem, jbuf, tag] = app->args<3>();
391 emit_unsafe(mem);
392 auto v_jb = emit(jbuf);
393 auto v_tag = emit(tag);
394 bb.tail("call void @longjmp(i8* {}, i32 {})", v_jb, v_tag);
395 return bb.tail("unreachable");
396 } else if (Pi::isa_returning(app->callee_type())) { // function call
397 auto v_callee = emit(app->callee());
398
399 std::vector<std::string> args;
400 auto app_args = app->args();
401 for (auto arg : app_args.view().rsubspan(1))
402 if (auto v_arg = emit_unsafe(arg); !v_arg.empty()) args.emplace_back(convert(arg->type()) + " " + v_arg);
403
404 if (app->args().back()->isa<Bot>()) {
405 // TODO: Perhaps it'd be better to simply η-wrap this prior to the BE...
406 assert(convert_ret_pi(app->callee_type()->ret_pi()) == "void");
407 bb.tail("call void {}({, })", v_callee, args);
408 return bb.tail("unreachable");
409 }
410
411 auto ret_lam = app->args().back()->as_mut<Lam>();
412 size_t num_vars = ret_lam->num_vars();
413 size_t n = 0;
414 DefVec values(num_vars);
415 DefVec types(num_vars);
416 for (auto var : ret_lam->vars()) {
417 if (Axm::isa<mem::M>(var->type())) continue;
418 values[n] = var;
419 types[n] = var->type();
420 ++n;
421 }
422
423 if (n == 0) {
424 bb.tail("call void {}({, })", v_callee, args);
425 } else {
426 auto name = "%" + app->unique_name() + "ret";
427 auto t_ret = convert_ret_pi(ret_lam->type());
428 bb.tail("{} = call {} {}({, })", name, t_ret, v_callee, args);
429
430 for (size_t i = 0, e = ret_lam->num_vars(); i != e; ++i) {
431 auto phi = ret_lam->var(i);
432 if (Axm::isa<mem::M>(phi->type())) continue;
433
434 auto namei = name;
435 if (e > 2) {
436 namei += '.' + std::to_string(i - 1);
437 bb.tail("{} = extractvalue {} {}, {}", namei, t_ret, name, i - 1);
438 }
439 assert(!Axm::isa<mem::M>(phi->type()));
440 lam2bb_[ret_lam].phis[phi].emplace_back(namei, id(lam, true));
441 locals_[phi] = id(phi);
442 }
443 }
444
445 return bb.tail("br label {}", id(ret_lam));
446 }
447}
448
449std::string Emitter::emit_bb(BB& bb, const Def* def) {
450 if (auto lam = def->isa<Lam>()) return id(lam);
451
452 auto name = id(def);
453 std::string op;
454
455 auto emit_tuple = [&](const Def* tuple) {
456 if (isa_mem_sigma_2(tuple->type())) {
457 emit_unsafe(tuple->proj(2, 0));
458 return emit(tuple->proj(2, 1));
459 }
460
461 if (is_const(tuple)) {
462 bool is_array = tuple->type()->isa<Arr>();
463
464 std::string s;
465 s += is_array ? "[" : "{";
466 auto sep = "";
467 for (size_t i = 0, n = tuple->num_projs(); i != n; ++i) {
468 auto e = tuple->proj(n, i);
469 if (auto v_elem = emit_unsafe(e); !v_elem.empty()) {
470 auto t_elem = convert(e->type());
471 s += sep + t_elem + " " + v_elem;
472 sep = ", ";
473 }
474 }
475
476 return s += is_array ? "]" : "}";
477 }
478
479 std::string prev = "undef";
480 auto t = convert(tuple->type());
481 for (size_t src = 0, dst = 0, n = tuple->num_projs(); src != n; ++src) {
482 auto e = tuple->proj(n, src);
483 if (auto elem = emit_unsafe(e); !elem.empty()) {
484 auto elem_t = convert(e->type());
485 // TODO: check dst vs src
486 auto namei = name + "." + std::to_string(dst);
487 prev = bb.assign(namei, "insertvalue {} {}, {} {}, {}", t, prev, elem_t, elem, dst);
488 dst++;
489 }
490 }
491 return prev;
492 };
493
494 if (def->isa<Var>()) {
495 auto ts = def->type()->projs();
496 if (std::ranges::any_of(ts, [](auto t) { return Axm::isa<mem::M>(t); })) return {};
497 return emit_tuple(def);
498 }
499
500 auto emit_gep_index = [&](const Def* index) {
501 auto v_i = emit(index);
502 auto t_i = convert(index->type());
503
504 if (auto size = Idx::isa(index->type())) {
505 if (auto w = Idx::size2bitwidth(size); w && *w < 64) {
506 v_i = bb.assign(name + ".zext",
507 "zext {} {} to i{} ; add one more bit for gep index as it is treated as signed value",
508 t_i, v_i, *w + 1);
509 t_i = "i" + std::to_string(*w + 1);
510 }
511 }
512
513 return std::pair(v_i, t_i);
514 };
515
516 if (auto lit = def->isa<Lit>()) {
517 if (lit->type()->isa<Nat>() || Idx::isa(lit->type())) {
518 return std::to_string(lit->get());
519 } else if (auto w = math::isa_f(lit->type())) {
520 std::stringstream s;
521 u64 hex;
522
523 switch (*w) {
524 case 16:
525 s << "0xH" << std::setfill('0') << std::setw(4) << std::right << std::hex << lit->get<u16>();
526 return s.str();
527 case 32: {
528 hex = std::bit_cast<u64>(f64(lit->get<f32>()));
529 break;
530 }
531 case 64: hex = lit->get<u64>(); break;
532 default: fe::unreachable();
533 }
534
535 s << "0x" << std::setfill('0') << std::setw(16) << std::right << std::hex << hex;
536 return s.str();
537 }
538 fe::unreachable();
539 } else if (def->isa<Bot>()) {
540 return "undef";
541 } else if (auto top = def->isa<Top>()) {
542 if (Axm::isa<mem::M>(top->type())) return {};
543 // bail out to error below
544 } else if (auto tuple = def->isa<Tuple>()) {
545 return emit_tuple(tuple);
546 } else if (auto pack = def->isa<Pack>()) {
547 if (auto lit = Lit::isa(pack->body()); lit && *lit == 0) return "zeroinitializer";
548 return emit_tuple(pack);
549 } else if (auto sel = Select(def)) {
550 auto t = convert(sel.extract()->type());
551 auto [elem_a, elem_b] = sel.pair()->projs<2>([&](auto e) { return emit_unsafe(e); });
552 auto cond_t = convert(sel.cond()->type());
553 auto cond = emit(sel.cond());
554 return bb.assign(name, "select {} {}, {} {}, {} {}", cond_t, cond, t, elem_b, t, elem_a);
555 } else if (auto extract = def->isa<Extract>()) {
556 auto tuple = extract->tuple();
557 auto index = extract->index();
558 auto v_tup = emit_unsafe(tuple);
559
560 // this exact location is important: after emitting the tuple -> ordering of mem ops
561 // before emitting the index, as it might be a weird value for mem vars.
562 if (Axm::isa<mem::M>(extract->type())) return {};
563
564 auto t_tup = convert(tuple->type());
565 if (auto li = Lit::isa(index)) {
566 if (isa_mem_sigma_2(tuple->type())) return v_tup;
567 // Adjust index, if mem is present.
568 auto v_i = Axm::isa<mem::M>(tuple->proj(0)->type()) ? std::to_string(*li - 1) : std::to_string(*li);
569 return bb.assign(name, "extractvalue {} {}, {}", t_tup, v_tup, v_i);
570 }
571
572 auto t_elem = convert(extract->type());
573 auto [v_i, t_i] = emit_gep_index(index);
574
575 print(lam2bb_[root()].body().emplace_front(),
576 "{}.alloca = alloca {} ; copy to alloca to emulate extract with store + gep + load", name, t_tup);
577 print(bb.body().emplace_back(), "store {} {}, {}* {}.alloca", t_tup, v_tup, t_tup, name);
578 print(bb.body().emplace_back(), "{}.gep = getelementptr inbounds {}, {}* {}.alloca, i64 0, {} {}", name, t_tup,
579 t_tup, name, t_i, v_i);
580 return bb.assign(name, "load {}, {}* {}.gep", t_elem, t_elem, name);
581 } else if (auto insert = def->isa<Insert>()) {
582 assert(!Axm::isa<mem::M>(insert->tuple()->proj(0)->type()));
583 auto t_tup = convert(insert->tuple()->type());
584 auto t_val = convert(insert->value()->type());
585 auto v_tup = emit(insert->tuple());
586 auto v_val = emit(insert->value());
587 if (auto idx = Lit::isa(insert->index())) {
588 auto v_idx = emit(insert->index());
589 return bb.assign(name, "insertvalue {} {}, {} {}, {}", t_tup, v_tup, t_val, v_val, v_idx);
590 } else {
591 auto t_elem = convert(insert->value()->type());
592 auto [v_i, t_i] = emit_gep_index(insert->index());
593 print(lam2bb_[root()].body().emplace_front(),
594 "{}.alloca = alloca {} ; copy to alloca to emulate insert with store + gep + load", name, t_tup);
595 print(bb.body().emplace_back(), "store {} {}, {}* {}.alloca", t_tup, v_tup, t_tup, name);
596 print(bb.body().emplace_back(), "{}.gep = getelementptr inbounds {}, {}* {}.alloca, i64 0, {} {}", name,
597 t_tup, t_tup, name, t_i, v_i);
598 print(bb.body().emplace_back(), "store {} {}, {}* {}.gep", t_val, v_val, t_val, name);
599 return bb.assign(name, "load {}, {}* {}.alloca", t_tup, t_tup, name);
600 }
601 } else if (auto global = def->isa<Global>()) {
602 auto v_init = emit(global->init());
603 auto [pointee, addr_space] = Axm::as<mem::Ptr>(global->type())->args<2>();
604 print(vars_decls_, "{} = global {} {}\n", name, convert(pointee), v_init);
605 return globals_[global] = name;
606 } else if (auto nat = Axm::isa<core::nat>(def)) {
607 auto [a, b] = nat->args<2>([this](auto def) { return emit(def); });
608
609 switch (nat.id()) {
610 case core::nat::add: op = "add"; break;
611 case core::nat::sub: op = "sub"; break;
612 case core::nat::mul: op = "mul"; break;
613 }
614
615 return bb.assign(name, "{} nsw nuw i64 {}, {}", op, a, b);
616 } else if (auto ncmp = Axm::isa<core::ncmp>(def)) {
617 auto [a, b] = ncmp->args<2>([this](auto def) { return emit(def); });
618 op = "icmp ";
619
620 switch (ncmp.id()) {
621 // clang-format off
622 case core::ncmp::e: op += "eq" ; break;
623 case core::ncmp::ne: op += "ne" ; break;
624 case core::ncmp::g: op += "ugt"; break;
625 case core::ncmp::ge: op += "uge"; break;
626 case core::ncmp::l: op += "ult"; break;
627 case core::ncmp::le: op += "ule"; break;
628 // clang-format on
629 default: fe::unreachable();
630 }
631
632 return bb.assign(name, "{} i64 {}, {}", op, a, b);
633 } else if (auto idx = Axm::isa<core::idx>(def)) {
634 auto x = emit(idx->arg());
635 auto s = *Idx::size2bitwidth(Idx::isa(idx->type()));
636 auto t = convert(idx->type());
637 if (s < 64) return bb.assign(name, "trunc i64 {} to {}", x, t);
638 return x;
639 } else if (auto bit1 = Axm::isa<core::bit1>(def)) {
640 assert(bit1.id() == core::bit1::neg);
641 auto x = emit(bit1->arg());
642 auto t = convert(bit1->type());
643 return bb.assign(name, "xor {} -1, {}", t, x);
644 } else if (auto bit2 = Axm::isa<core::bit2>(def)) {
645 auto [a, b] = bit2->args<2>([this](auto def) { return emit(def); });
646 auto t = convert(bit2->type());
647
648 auto neg = [&](std::string_view x) { return bb.assign(name + ".neg", "xor {} -1, {}", t, x); };
649
650 switch (bit2.id()) {
651 // clang-format off
652 case core::bit2::and_: return bb.assign(name, "and {} {}, {}", t, a, b);
653 case core::bit2:: or_: return bb.assign(name, "or {} {}, {}", t, a, b);
654 case core::bit2::xor_: return bb.assign(name, "xor {} {}, {}", t, a, b);
655 case core::bit2::nand: return neg(bb.assign(name, "and {} {}, {}", t, a, b));
656 case core::bit2:: nor: return neg(bb.assign(name, "or {} {}, {}", t, a, b));
657 case core::bit2::nxor: return neg(bb.assign(name, "xor {} {}, {}", t, a, b));
658 case core::bit2:: iff: return bb.assign(name, "and {} {}, {}", neg(a), b);
659 case core::bit2::niff: return bb.assign(name, "or {} {}, {}", neg(a), b);
660 // clang-format on
661 default: fe::unreachable();
662 }
663 } else if (auto shr = Axm::isa<core::shr>(def)) {
664 auto [a, b] = shr->args<2>([this](auto def) { return emit(def); });
665 auto t = convert(shr->type());
666
667 switch (shr.id()) {
668 case core::shr::a: op = "ashr"; break;
669 case core::shr::l: op = "lshr"; break;
670 }
671
672 return bb.assign(name, "{} {} {}, {}", op, t, a, b);
673 } else if (auto wrap = Axm::isa<core::wrap>(def)) {
674 auto [mode, ab] = wrap->uncurry_args<2>();
675 auto [a, b] = ab->projs<2>([this](auto def) { return emit(def); });
676 auto t = convert(wrap->type());
677 auto lmode = Lit::as(mode);
678
679 switch (wrap.id()) {
680 case core::wrap::add: op = "add"; break;
681 case core::wrap::sub: op = "sub"; break;
682 case core::wrap::mul: op = "mul"; break;
683 case core::wrap::shl: op = "shl"; break;
684 }
685
686 if (lmode & core::Mode::nuw) op += " nuw";
687 if (lmode & core::Mode::nsw) op += " nsw";
688
689 return bb.assign(name, "{} {} {}, {}", op, t, a, b);
690 } else if (auto div = Axm::isa<core::div>(def)) {
691 auto [m, xy] = div->args<2>();
692 auto [x, y] = xy->projs<2>();
693 auto t = convert(x->type());
694 emit_unsafe(m);
695 auto a = emit(x);
696 auto b = emit(y);
697
698 switch (div.id()) {
699 case core::div::sdiv: op = "sdiv"; break;
700 case core::div::udiv: op = "udiv"; break;
701 case core::div::srem: op = "srem"; break;
702 case core::div::urem: op = "urem"; break;
703 }
704
705 return bb.assign(name, "{} {} {}, {}", op, t, a, b);
706 } else if (auto icmp = Axm::isa<core::icmp>(def)) {
707 auto [a, b] = icmp->args<2>([this](auto def) { return emit(def); });
708 auto t = convert(icmp->arg(0)->type());
709 op = "icmp ";
710
711 switch (icmp.id()) {
712 // clang-format off
713 case core::icmp::e: op += "eq" ; break;
714 case core::icmp::ne: op += "ne" ; break;
715 case core::icmp::sg: op += "sgt"; break;
716 case core::icmp::sge: op += "sge"; break;
717 case core::icmp::sl: op += "slt"; break;
718 case core::icmp::sle: op += "sle"; break;
719 case core::icmp::ug: op += "ugt"; break;
720 case core::icmp::uge: op += "uge"; break;
721 case core::icmp::ul: op += "ult"; break;
722 case core::icmp::ule: op += "ule"; break;
723 // clang-format on
724 default: fe::unreachable();
725 }
726
727 return bb.assign(name, "{} {} {}, {}", op, t, a, b);
728 } else if (auto extr = Axm::isa<core::extrema>(def)) {
729 auto [x, y] = extr->args<2>();
730 auto t = convert(x->type());
731 auto a = emit(x);
732 auto b = emit(y);
733 std::string f = "llvm.";
734 switch (extr.id()) {
735 case core::extrema::Sm: f += "smin."; break;
736 case core::extrema::SM: f += "smax."; break;
737 case core::extrema::sm: f += "umin."; break;
738 case core::extrema::sM: f += "umax."; break;
739 }
740 f += t;
741 declare("{} @{}({}, {})", t, f, t, t);
742 return bb.assign(name, "tail call {} @{}({} {}, {} {})", t, f, t, a, t, b);
743 } else if (auto abs = Axm::isa<core::abs>(def)) {
744 auto [m, x] = abs->args<2>();
745 auto t = convert(x->type());
746 auto a = emit(x);
747 std::string f = "llvm.abs." + t;
748 declare("{} @{}({}, {})", t, f, t, "i1");
749 return bb.assign(name, "tail call {} @{}({} {}, {} {})", t, f, t, a, "i1", "1");
750 } else if (auto conv = Axm::isa<core::conv>(def)) {
751 auto v_src = emit(conv->arg());
752 auto t_src = convert(conv->arg()->type());
753 auto t_dst = convert(conv->type());
754
755 nat_t w_src = *Idx::size2bitwidth(Idx::isa(conv->arg()->type()));
756 nat_t w_dst = *Idx::size2bitwidth(Idx::isa(conv->type()));
757
758 if (w_src == w_dst) return v_src;
759
760 switch (conv.id()) {
761 case core::conv::s: op = w_src < w_dst ? "sext" : "trunc"; break;
762 case core::conv::u: op = w_src < w_dst ? "zext" : "trunc"; break;
763 }
764
765 return bb.assign(name, "{} {} {} to {}", op, t_src, v_src, t_dst);
766 } else if (auto bitcast = Axm::isa<core::bitcast>(def)) {
767 auto dst_type_ptr = Axm::isa<mem::Ptr>(bitcast->type());
768 auto src_type_ptr = Axm::isa<mem::Ptr>(bitcast->arg()->type());
769 auto v_src = emit(bitcast->arg());
770 auto t_src = convert(bitcast->arg()->type());
771 auto t_dst = convert(bitcast->type());
772
773 if (auto lit = Lit::isa(bitcast->arg()); lit && *lit == 0) return "zeroinitializer";
774 // clang-format off
775 if (src_type_ptr && dst_type_ptr) return bb.assign(name, "bitcast {} {} to {}", t_src, v_src, t_dst);
776 if (src_type_ptr) return bb.assign(name, "ptrtoint {} {} to {}", t_src, v_src, t_dst);
777 if (dst_type_ptr) return bb.assign(name, "inttoptr {} {} to {}", t_src, v_src, t_dst);
778 // clang-format on
779
780 auto size2width = [&](const Def* type) {
781 if (type->isa<Nat>()) return 64_n;
782 if (auto size = Idx::isa(type)) return *Idx::size2bitwidth(size);
783 return 0_n;
784 };
785
786 auto src_size = size2width(bitcast->arg()->type());
787 auto dst_size = size2width(bitcast->type());
788
789 op = "bitcast";
790 if (src_size && dst_size) {
791 if (src_size == dst_size) return v_src;
792 op = (src_size < dst_size) ? "zext" : "trunc";
793 }
794 return bb.assign(name, "{} {} {} to {}", op, t_src, v_src, t_dst);
795 } else if (auto lea = Axm::isa<mem::lea>(def)) {
796 auto [ptr, i] = lea->args<2>();
797 auto pointee = Axm::as<mem::Ptr>(ptr->type())->arg(0);
798 auto v_ptr = emit(ptr);
799 auto t_pointee = convert(pointee);
800 auto t_ptr = convert(ptr->type());
801 if (pointee->isa<Sigma>())
802 return bb.assign(name, "getelementptr inbounds {}, {} {}, i64 0, i32 {}", t_pointee, t_ptr, v_ptr,
803 Lit::as(i));
804
805 assert(pointee->isa<Arr>());
806 auto [v_i, t_i] = emit_gep_index(i);
807
808 return bb.assign(name, "getelementptr inbounds {}, {} {}, i64 0, {} {}", t_pointee, t_ptr, v_ptr, t_i, v_i);
809 } else if (auto malloc = Axm::isa<mem::malloc>(def)) {
810 declare("i8* @malloc(i64)");
811
812 emit_unsafe(malloc->arg(0));
813 auto size = emit(malloc->arg(1));
814 auto ptr_t = convert(Axm::as<mem::Ptr>(def->proj(1)->type()));
815 bb.assign(name + "i8", "call i8* @malloc(i64 {})", size);
816 return bb.assign(name, "bitcast i8* {} to {}", name + "i8", ptr_t);
817 } else if (auto free = Axm::isa<mem::free>(def)) {
818 declare("void @free(i8*)");
819 emit_unsafe(free->arg(0));
820 auto ptr = emit(free->arg(1));
821 auto ptr_t = convert(Axm::as<mem::Ptr>(free->arg(1)->type()));
822
823 bb.assign(name + "i8", "bitcast {} {} to i8*", ptr_t, ptr);
824 bb.tail("call void @free(i8* {})", name + "i8");
825 return {};
826 } else if (auto mslot = Axm::isa<mem::mslot>(def)) {
827 auto [Ta, msi] = mslot->uncurry_args<2>();
828 auto [pointee, addr_space] = Ta->projs<2>();
829 auto [mem, _, __] = msi->projs<3>();
830 emit_unsafe(mslot->arg(0));
831 // TODO array with size
832 // auto v_size = emit(mslot->arg(1));
833 print(bb.body().emplace_back(), "{} = alloca {}", name, convert(pointee));
834 return name;
835 } else if (auto free = Axm::isa<mem::free>(def)) {
836 declare("void @free(i8*)");
837
838 emit_unsafe(free->arg(0));
839 auto v_ptr = emit(free->arg(1));
840 auto t_ptr = convert(Axm::as<mem::Ptr>(free->arg(1)->type()));
841
842 bb.assign(name + "i8", "bitcast {} {} to i8*", t_ptr, v_ptr);
843 bb.tail("call void @free(i8* {})", name + "i8");
844 return {};
845 } else if (auto load = Axm::isa<mem::load>(def)) {
846 emit_unsafe(load->arg(0));
847 auto v_ptr = emit(load->arg(1));
848 auto t_ptr = convert(load->arg(1)->type());
849 auto t_pointee = convert(Axm::as<mem::Ptr>(load->arg(1)->type())->arg(0));
850 return bb.assign(name, "load {}, {} {}", t_pointee, t_ptr, v_ptr);
851 } else if (auto store = Axm::isa<mem::store>(def)) {
852 emit_unsafe(store->arg(0));
853 auto v_ptr = emit(store->arg(1));
854 auto v_val = emit(store->arg(2));
855 auto t_ptr = convert(store->arg(1)->type());
856 auto t_val = convert(store->arg(2)->type());
857 print(bb.body().emplace_back(), "store {} {}, {} {}", t_val, v_val, t_ptr, v_ptr);
858 return {};
859 } else if (auto q = Axm::isa<clos::alloc_jmpbuf>(def)) {
860 declare("i64 @jmpbuf_size()");
861
862 emit_unsafe(q->arg());
863 auto size = name + ".size";
864 bb.assign(size, "call i64 @jmpbuf_size()");
865 return bb.assign(name, "alloca i8, i64 {}", size);
866 } else if (auto setjmp = Axm::isa<clos::setjmp>(def)) {
867 declare("i32 @_setjmp(i8*) returns_twice");
868
869 auto [mem, jmpbuf] = setjmp->arg()->projs<2>();
870 emit_unsafe(mem);
871 auto v_jb = emit(jmpbuf);
872 return bb.assign(name, "call i32 @_setjmp(i8* {})", v_jb);
873 } else if (auto arith = Axm::isa<math::arith>(def)) {
874 auto [mode, ab] = arith->uncurry_args<2>();
875 auto [a, b] = ab->projs<2>([this](auto def) { return emit(def); });
876 auto t = convert(arith->type());
877 auto lmode = Lit::as(mode);
878
879 switch (arith.id()) {
880 case math::arith::add: op = "fadd"; break;
881 case math::arith::sub: op = "fsub"; break;
882 case math::arith::mul: op = "fmul"; break;
883 case math::arith::div: op = "fdiv"; break;
884 case math::arith::rem: op = "frem"; break;
885 }
886
887 if (lmode == math::Mode::fast)
888 op += " fast";
889 else {
890 // clang-format off
891 if (lmode & math::Mode::nnan ) op += " nnan";
892 if (lmode & math::Mode::ninf ) op += " ninf";
893 if (lmode & math::Mode::nsz ) op += " nsz";
894 if (lmode & math::Mode::arcp ) op += " arcp";
895 if (lmode & math::Mode::contract) op += " contract";
896 if (lmode & math::Mode::afn ) op += " afn";
897 if (lmode & math::Mode::reassoc ) op += " reassoc";
898 // clang-format on
899 }
900
901 return bb.assign(name, "{} {} {}, {}", op, t, a, b);
902 } else if (auto tri = Axm::isa<math::tri>(def)) {
903 auto a = emit(tri->arg());
904 auto t = convert(tri->type());
905
906 std::string f;
907
908 if (tri.id() == math::tri::sin) {
909 f = "llvm.sin"s + llvm_suffix(tri->type());
910 } else if (tri.id() == math::tri::cos) {
911 f = "llvm.cos"s + llvm_suffix(tri->type());
912 } else {
913 if (tri.sub() & sub_t(math::tri::a)) f += "a";
914
915 switch (math::tri((tri.id() & 0x3) | Annex::base<math::tri>())) {
916 case math::tri::sin: f += "sin"; break;
917 case math::tri::cos: f += "cos"; break;
918 case math::tri::tan: f += "tan"; break;
919 case math::tri::ahFF: error("this axm is supposed to be unused");
920 default: fe::unreachable();
921 }
922
923 if (tri.sub() & sub_t(math::tri::h)) f += "h";
924 f += math_suffix(tri->type());
925 }
926
927 declare("{} @{}({})", t, f, t);
928 return bb.assign(name, "tail call {} @{}({} {})", t, f, t, a);
929 } else if (auto extrema = Axm::isa<math::extrema>(def)) {
930 auto [a, b] = extrema->args<2>([this](auto def) { return emit(def); });
931 auto t = convert(extrema->type());
932 std::string f = "llvm.";
933 switch (extrema.id()) {
934 case math::extrema::fmin: f += "minnum"; break;
935 case math::extrema::fmax: f += "maxnum"; break;
936 case math::extrema::ieee754min: f += "minimum"; break;
937 case math::extrema::ieee754max: f += "maximum"; break;
938 }
939 f += llvm_suffix(extrema->type());
940
941 declare("{} @{}({}, {})", t, f, t, t);
942 return bb.assign(name, "tail call {} @{}({} {}, {} {})", t, f, t, a, t, b);
943 } else if (auto pow = Axm::isa<math::pow>(def)) {
944 auto [a, b] = pow->args<2>([this](auto def) { return emit(def); });
945 auto t = convert(pow->type());
946 std::string f = "llvm.pow";
947 f += llvm_suffix(pow->type());
948 declare("{} @{}({}, {})", t, f, t, t);
949 return bb.assign(name, "tail call {} @{}({} {}, {} {})", t, f, t, a, t, b);
950 } else if (auto rt = Axm::isa<math::rt>(def)) {
951 auto a = emit(rt->arg());
952 auto t = convert(rt->type());
953 std::string f;
954 if (rt.id() == math::rt::sq)
955 f = "llvm.sqrt"s + llvm_suffix(rt->type());
956 else
957 f = "cbrt"s += math_suffix(rt->type());
958 declare("{} @{}({})", t, f, t);
959 return bb.assign(name, "tail call {} @{}({} {})", t, f, t, a);
960 } else if (auto exp = Axm::isa<math::exp>(def)) {
961 auto a = emit(exp->arg());
962 auto t = convert(exp->type());
963 std::string f = "llvm.";
964 f += (exp.sub() & sub_t(math::exp::log)) ? "log" : "exp";
965 f += (exp.sub() & sub_t(math::exp::bin)) ? "2" : (exp.sub() & sub_t(math::exp::dec)) ? "10" : "";
966 f += llvm_suffix(exp->type());
967 // TODO doesn't work for exp10"
968 declare("{} @{}({})", t, f, t);
969 return bb.assign(name, "tail call {} @{}({} {})", t, f, t, a);
970 } else if (auto er = Axm::isa<math::er>(def)) {
971 auto a = emit(er->arg());
972 auto t = convert(er->type());
973 auto f = er.id() == math::er::f ? "erf"s : "erfc"s;
974 f += math_suffix(er->type());
975 declare("{} @{}({})", t, f, t);
976 return bb.assign(name, "tail call {} @{}({} {})", t, f, t, a);
977 } else if (auto gamma = Axm::isa<math::gamma>(def)) {
978 auto a = emit(gamma->arg());
979 auto t = convert(gamma->type());
980 std::string f = gamma.id() == math::gamma::t ? "tgamma" : "lgamma";
981 f += math_suffix(gamma->type());
982 declare("{} @{}({})", t, f, t);
983 return bb.assign(name, "tail call {} @{}({} {})", t, f, t, a);
984 } else if (auto cmp = Axm::isa<math::cmp>(def)) {
985 auto [a, b] = cmp->args<2>([this](auto def) { return emit(def); });
986 auto t = convert(cmp->arg(0)->type());
987 op = "fcmp ";
988
989 switch (cmp.id()) {
990 // clang-format off
991 case math::cmp:: e: op += "oeq"; break;
992 case math::cmp:: l: op += "olt"; break;
993 case math::cmp:: le: op += "ole"; break;
994 case math::cmp:: g: op += "ogt"; break;
995 case math::cmp:: ge: op += "oge"; break;
996 case math::cmp:: ne: op += "one"; break;
997 case math::cmp:: o: op += "ord"; break;
998 case math::cmp:: u: op += "uno"; break;
999 case math::cmp:: ue: op += "ueq"; break;
1000 case math::cmp:: ul: op += "ult"; break;
1001 case math::cmp::ule: op += "ule"; break;
1002 case math::cmp:: ug: op += "ugt"; break;
1003 case math::cmp::uge: op += "uge"; break;
1004 case math::cmp::une: op += "une"; break;
1005 // clang-format on
1006 default: fe::unreachable();
1007 }
1008
1009 return bb.assign(name, "{} {} {}, {}", op, t, a, b);
1010 } else if (auto conv = Axm::isa<math::conv>(def)) {
1011 auto v_src = emit(conv->arg());
1012 auto t_src = convert(conv->arg()->type());
1013 auto t_dst = convert(conv->type());
1014
1015 auto s_src = math::isa_f(conv->arg()->type());
1016 auto s_dst = math::isa_f(conv->type());
1017
1018 switch (conv.id()) {
1019 case math::conv::f2f: op = s_src < s_dst ? "fpext" : "fptrunc"; break;
1020 case math::conv::s2f: op = "sitofp"; break;
1021 case math::conv::u2f: op = "uitofp"; break;
1022 case math::conv::f2s: op = "fptosi"; break;
1023 case math::conv::f2u: op = "fptoui"; break;
1024 }
1025
1026 return bb.assign(name, "{} {} {} to {}", op, t_src, v_src, t_dst);
1027 } else if (auto abs = Axm::isa<math::abs>(def)) {
1028 auto a = emit(abs->arg());
1029 auto t = convert(abs->type());
1030 std::string f = "llvm.fabs";
1031 f += llvm_suffix(abs->type());
1032 declare("{} @{}({})", t, f, t);
1033 return bb.assign(name, "tail call {} @{}({} {})", t, f, t, a);
1034 } else if (auto round = Axm::isa<math::round>(def)) {
1035 auto a = emit(round->arg());
1036 auto t = convert(round->type());
1037 std::string f = "llvm.";
1038 switch (round.id()) {
1039 case math::round::f: f += "floor"; break;
1040 case math::round::c: f += "ceil"; break;
1041 case math::round::r: f += "round"; break;
1042 case math::round::t: f += "trunc"; break;
1043 }
1044 f += llvm_suffix(round->type());
1045 declare("{} @{}({})", t, f, t);
1046 return bb.assign(name, "tail call {} @{}({} {})", t, f, t, a);
1047 }
1048 error("unhandled def in LLVM backend: {} : {}", def, def->type());
1049}
1050
1051void emit(World& world, std::ostream& ostream) {
1052 Emitter emitter(world, ostream);
1053 emitter.run();
1054}
1055
1056int compile(World& world, std::string name) {
1057#ifdef _WIN32
1058 auto exe = name + ".exe"s;
1059#else
1060 auto exe = name;
1061#endif
1062 return compile(world, name + ".ll"s, exe);
1063}
1064
1065int compile(World& world, std::string ll, std::string out) {
1066 std::ofstream ofs(ll);
1067 emit(world, ofs);
1068 ofs.close();
1069 auto cmd = fmt("clang \"{}\" -o \"{}\" -Wno-override-module", ll, out);
1070 return sys::system(cmd);
1071}
1072
1073int compile_and_run(World& world, std::string name, std::string args) {
1074 if (compile(world, name) == 0) return sys::run(name, args);
1075 error("compilation failed");
1076}
1077
1078} // namespace mim::ll
A (possibly paramterized) Array.
Definition tuple.h:117
static auto isa(const Def *def)
Definition axm.h:107
static auto as(const Def *def)
Definition axm.h:129
Matches (ff, tt)#cond arg where cond is not a Literal.
Definition tuple.h:279
Lam * root() const
Definition phase.h:301
Base class for all Defs.
Definition def.h:251
const Def * proj(nat_t a, nat_t i) const
Similar to World::extract while assuming an arity of a, but also works on Sigmas and Arrays.
Definition def.cpp:587
T * isa_mut() const
If this is mutable, it will cast constness away and perform a dynamic_cast to T.
Definition def.h:486
auto projs(F f) const
Splits this Def via Def::projections into an Array (if A == std::dynamic_extent) or std::array (other...
Definition def.h:390
nat_t num_vars() noexcept
Definition def.h:429
const Def * type() const noexcept
Yields the "raw" type of this Def (maybe nullptr).
Definition def.cpp:446
auto vars(F f) noexcept
Definition def.h:429
std::string unique_name() const
name + "_" + Def::gid
Definition def.cpp:578
Matches a dispatch through a jump table of the form: (target_0, target_1, ...)#index arg where index ...
Definition tuple.h:304
Extracts from a Sigma or Array-typed Extract::tuple the element at position Extract::index.
Definition tuple.h:206
static constexpr nat_t size2bitwidth(nat_t n)
Definition def.h:893
static const Def * isa(const Def *def)
Checks if def is a Idx s and returns s or nullptr otherwise.
Definition def.cpp:610
Creates a new Tuple / Pack by inserting Insert::value at position Insert::index into Insert::tuple.
Definition tuple.h:233
A function.
Definition lam.h:110
static Lam * isa_mut_basicblock(const Def *d)
Only for mutables.
Definition lam.h:145
const Pi * type() const
Definition lam.h:130
const Def * body() const
Definition lam.h:123
static std::optional< T > isa(const Def *def)
Definition def.h:826
static T as(const Def *def)
Definition def.h:832
const Nest & nest() const
Definition phase.h:317
A (possibly paramterized) Tuple.
Definition tuple.h:166
virtual void run()
Entry point and generates some debug output; invokes Phase::start.
Definition phase.cpp:13
virtual void start()=0
Actual entry.
A dependent function type.
Definition lam.h:14
const Pi * ret_pi() const
Yields the last Pi::dom, if Pi::isa_basicblock.
Definition lam.cpp:13
static const Pi * isa_returning(const Def *d)
Is this a continuation (Pi::isa_cn) which has a Pi::ret_pi?
Definition lam.h:49
static Schedule schedule(const Nest &)
Definition schedule.cpp:118
Matches (ff, tt)#cond - where cond is not a Literal.
Definition tuple.h:261
A dependent tuple type.
Definition tuple.h:20
World & world()
Definition pass.h:64
std::string_view name() const
Definition pass.h:67
Data constructor for a Sigma.
Definition tuple.h:68
A variable introduced by a binder (mutable).
Definition def.h:702
The World represents the whole program and manages creation of MimIR nodes (Defs).
Definition world.h:31
void emit_imported(Lam *)
Definition ll.cpp:257
Emitter(World &world, std::ostream &ostream)
Definition ll.cpp:119
std::string prepare()
Definition ll.cpp:271
void finalize()
Definition ll.cpp:287
void start() override
Actual entry.
Definition ll.cpp:246
std::string emit_bb(BB &, const Def *)
Definition ll.cpp:449
bool is_valid(std::string_view s)
Definition ll.cpp:122
mim::Emitter< std::string, std::string, BB, Emitter > Super
Definition ll.cpp:117
void emit_epilogue(Lam *)
Definition ll.cpp:316
void declare(const char *s, Args &&... args)
Definition ll.cpp:131
Definition ll.h:9
int compile_and_run(World &, std::string name, std::string args={})
Definition ll.cpp:1073
void emit(World &, std::ostream &)
Definition ll.cpp:1051
int compile(World &, std::string name)
Definition ll.cpp:1056
The clos Plugin
Definition clos.h:7
The core Plugin
Definition core.h:8
The math Plugin
Definition math.h:8
The mem Plugin
Definition mem.h:11
int run(std::string cmd, std::string args={})
Wraps sys::system and puts .exe at the back (Windows) and ./ at the front (otherwise) of cmd.
Definition sys.cpp:77
int system(std::string)
Wraps std::system and makes the return value usable.
Definition sys.cpp:71
u64 nat_t
Definition types.h:43
Vector< const Def * > DefVec
Definition def.h:77
u8 sub_t
Definition types.h:48
D bitcast(const S &src)
A bitcast from src of type S to D.
Definition util.h:23
std::ostream & print(std::ostream &os, const char *s)
Base case.
Definition print.cpp:5
double f64
Definition types.h:41
std::string fmt(const char *s, Args &&... args)
Wraps mim::print to output a formatted std:string.
Definition print.h:163
void error(Loc loc, const char *f, Args &&... args)
Definition dbg.h:125
float f32
Definition types.h:40
GIDMap< const Def *, To > DefMap
Definition def.h:73
TExt< true > Top
Definition lattice.h:172
TExt< false > Bot
Definition lattice.h:171
uint64_t u64
Definition types.h:34
@ Nat
Definition def.h:114
@ Pi
Definition def.h:114
@ Arr
Definition def.h:114
@ Sigma
Definition def.h:114
uint16_t u16
Definition types.h:34
static consteval flags_t base()
Definition plugin.h:119
std::deque< std::ostringstream > & tail()
Definition ll.cpp:92
void tail(const char *s, Args &&... args)
Definition ll.cpp:101
DefMap< std::deque< std::pair< std::string, std::string > > > phis
Definition ll.cpp:111
BB(const BB &)=delete
BB()=default
std::deque< std::ostringstream > & body()
Definition ll.cpp:91
BB(BB &&other) noexcept=default
friend void swap(BB &a, BB &b) noexcept
Definition ll.cpp:105
std::array< std::deque< std::ostringstream >, 3 > parts
Definition ll.cpp:112
std::deque< std::ostringstream > & head()
Definition ll.cpp:90
BB & operator=(BB other) noexcept
Definition ll.cpp:88
std::string assign(std::string_view name, const char *s, Args &&... args)
Definition ll.cpp:95