MimIR 0.1
MimIR is my Intermediate Representation
Loading...
Searching...
No Matches
world.h
Go to the documentation of this file.
1#pragma once
2
3#include <string>
4#include <string_view>
5#include <type_traits>
6
7#include <absl/container/btree_map.h>
8#include <absl/container/btree_set.h>
9#include <fe/arena.h>
10
11#include "mim/axiom.h"
12#include "mim/check.h"
13#include "mim/flags.h"
14#include "mim/lam.h"
15#include "mim/lattice.h"
16#include "mim/tuple.h"
17
18#include "mim/util/dbg.h"
19#include "mim/util/log.h"
20
21namespace mim {
22class Driver;
23
24/// The World represents the whole program and manages creation of MimIR nodes (Def%s).
25/// Def%s are hashed into an internal HashSet.
26/// The World's factory methods just calculate a hash and lookup the Def, if it is already present, or create a new one
27/// otherwise. This corresponds to value numbering.
28///
29/// You can create several worlds.
30/// All worlds are completely independent from each other.
31///
32/// Note that types are also just Def%s and will be hashed as well.
33class World {
34public:
35 /// @name State
36 ///@{
37 struct State {
38 State() = default;
39
40 /// [Plain Old Data](https://en.cppreference.com/w/cpp/named_req/PODType)
41 struct POD {
44 Loc loc;
45 Sym name;
46 mutable bool frozen = false;
47 } pod;
48
49#ifdef MIM_ENABLE_CHECKS
50 absl::flat_hash_set<uint32_t> breakpoints;
51#endif
52 friend void swap(State& s1, State& s2) noexcept {
53 using std::swap;
54 assert((!s1.pod.loc || !s2.pod.loc) && "Why is get_loc() still set?");
55 swap(s1.pod, s2.pod);
56#ifdef MIM_ENABLE_CHECKS
57 swap(s1.breakpoints, s2.breakpoints);
58#endif
59 }
60 };
61
62 /// @name Construction & Destruction
63 ///@{
64 World& operator=(World) = delete;
65
66 explicit World(Driver*);
67 World(Driver*, const State&);
68 World(World&& other) noexcept
69 : World(&other.driver(), other.state()) {
70 swap(*this, other);
71 }
72 World inherit() { return World(&driver(), state()); } ///< Inherits the @p state into the new World.
73 ~World();
74 ///@}
75
76 /// @name Getters/Setters
77 ///@{
78 const State& state() const { return state_; }
79
80 const Driver& driver() const { return *driver_; }
81 Driver& driver() { return *driver_; }
82
83 Sym name() const { return state_.pod.name; }
84 void set(Sym name) { state_.pod.name = name; }
85 void set(std::string_view name) { state_.pod.name = sym(name); }
86
87 /// Manage global identifier - a unique number for each Def.
88 u32 curr_gid() const { return state_.pod.curr_gid; }
89 u32 next_gid() { return ++state_.pod.curr_gid; }
90 u32 next_run() { return ++data_.curr_run; }
91
92 /// Retrieve compile Flags.
93 Flags& flags();
94 ///@}
95
96 /// @name Loc
97 ///@{
98 struct ScopedLoc {
99 ScopedLoc(World& world, Loc old_loc)
100 : world_(world)
101 , old_loc_(old_loc) {}
102 ~ScopedLoc() { world_.set_loc(old_loc_); }
103
104 private:
105 World& world_;
106 Loc old_loc_;
107 };
108
109 Loc get_loc() const { return state_.pod.loc; }
110 void set_loc(Loc loc = {}) { state_.pod.loc = loc; }
111 ScopedLoc push(Loc loc) {
112 auto sl = ScopedLoc(*this, get_loc());
113 set_loc(loc);
114 return sl;
115 }
116 ///@}
117
118 /// @name Sym
119 ///@{
120 Sym sym(std::string_view);
121 Sym sym(const char*);
122 Sym sym(const std::string&);
123 /// Appends a @p suffix or an increasing number if the suffix already exists.
124 Sym append_suffix(Sym name, std::string suffix);
125 ///@}
126
127 /// @name Freeze
128 /// In frozen state the World does not create any nodes.
129 ///@{
130 bool is_frozen() const { return state_.pod.frozen; }
131
132 /// Yields old frozen state.
133 bool freeze(bool on = true) const {
134 bool old = state_.pod.frozen;
135 state_.pod.frozen = on;
136 return old;
137 }
138
139 /// Use to World::freeze and automatically unfreeze at the end of scope.
140 struct Freezer {
142 : world(world)
143 , old(world.freeze(true)) {}
144 ~Freezer() { world.freeze(old); }
145
146 const World& world;
147 bool old;
148 };
149 ///@}
150
151 /// @name Debugging Features
152 ///@{
153#ifdef MIM_ENABLE_CHECKS
154 const auto& breakpoints() { return state_.breakpoints; }
155
156 const Def* gid2def(u32 gid); ///< Lookup Def by @p gid.
157 void breakpoint(u32 gid); ///< Trigger breakpoint in your debugger when creating Def with Def::gid @p gid.
158
159 World& verify(); ///< Verifies that all externals() and annexes() are Def::is_closed(), if `MIM_ENABLE_CHECKS`.
160#else
161 World& verify() { return *this; }
162#endif
163 ///@}
164
165 /// @name Annexes
166 ///@{
167 const auto& flags2annex() const { return move_.flags2annex; }
168 auto annexes() const { return move_.flags2annex | std::views::values; }
169
170 /// Lookup annex by Axiom::id.
171 template<class Id> const Def* annex(Id id) {
172 auto flags = static_cast<flags_t>(id);
173 if (auto i = move_.flags2annex.find(flags); i != move_.flags2annex.end()) return i->second;
174 error("Axiom with ID '{x}' not found; demangled plugin name is '{}'", flags, Annex::demangle(driver(), flags));
175 }
176
177 /// Get Axiom from a plugin.
178 /// Can be used to get an Axiom without sub-tags.
179 /// E.g. use `w.annex<mem::M>();` to get the `%mem.M` Axiom.
180 template<annex_without_subs id> const Def* annex() { return annex(Annex::Base<id>); }
181
182 const Def* register_annex(flags_t f, const Def*);
183 const Def* register_annex(plugin_t p, tag_t t, sub_t s, const Def* def) {
184 return register_annex(p | (flags_t(t) << 8_u64) | flags_t(s), def);
185 }
186 ///@}
187
188 /// @name Externals
189 ///@{
190 const auto& sym2external() const { return move_.sym2external; }
191 Def* external(Sym name) { return mim::lookup(move_.sym2external, name); } ///< Lookup by @p name.
192 auto externals() const { return move_.sym2external | std::views::values; }
193 Vector<Def*> copy_externals() const { return {externals().begin(), externals().end()}; }
194 void make_external(Def*);
195 void make_internal(Def*);
196 ///@}
197
198 /// @name Univ, Type, Var, Proxy, Hole
199 ///@{
200 const Univ* univ() { return data_.univ; }
201 const Def* uinc(const Def* op, level_t offset = 1);
202 template<Sort = Sort::Univ> const Def* umax(Defs);
203 const Type* type(const Def* level);
204 const Type* type_infer_univ() { return type(mut_hole_univ()); }
205 template<level_t level = 0> const Type* type() {
206 if constexpr (level == 0)
207 return data_.type_0;
208 else if constexpr (level == 1)
209 return data_.type_1;
210 else
211 return type(lit_univ(level));
212 }
213 const Def* var(const Def* type, Def* mut);
214 const Proxy* proxy(const Def* type, Defs ops, u32 index, u32 tag) {
215 return unify<Proxy>(ops.size(), type, ops, index, tag);
216 }
217
218 Hole* mut_hole(const Def* type) { return insert<Hole>(1, type); }
219 Hole* mut_hole_univ() { return mut_hole(univ()); }
221
222 /// Either a value `?:?:Type ?` or a type `?:Type ?:Type ?`.
224 auto t = type_infer_univ();
225 auto res = mut_hole(mut_hole(t));
226 assert(this == &res->world());
227 return res;
228 }
229 ///@}
230
231 /// @name Axiom
232 ///@{
233 const Axiom* axiom(NormalizeFn n, u8 curry, u8 trip, const Def* type, plugin_t p, tag_t t, sub_t s) {
234 return unify<Axiom>(0, n, curry, trip, type, p, t, s);
235 }
236 const Axiom* axiom(const Def* type, plugin_t p, tag_t t, sub_t s) { return axiom(nullptr, 0, 0, type, p, t, s); }
237
238 /// Builds a fresh Axiom with descending Axiom::sub.
239 /// This is useful during testing to come up with some entity of a specific type.
240 /// It uses the plugin Axiom::Global_Plugin and starts with `0` for Axiom::sub and counts up from there.
241 /// The Axiom::tag is set to `0` and the Axiom::normalizer to `nullptr`.
242 const Axiom* axiom(NormalizeFn n, u8 curry, u8 trip, const Def* type) {
243 return axiom(n, curry, trip, type, Annex::Global_Plugin, 0, state_.pod.curr_sub++);
244 }
245 const Axiom* axiom(const Def* type) { return axiom(nullptr, 0, 0, type); } ///< See above.
246 ///@}
247
248 /// @name Pi
249 ///@{
250 // clang-format off
251 const Pi* pi(const Def* dom, const Def* codom, bool implicit = false) { return unify<Pi>(2, Pi::infer(dom, codom), dom, codom, implicit); }
252 const Pi* pi(Defs dom, const Def* codom, bool implicit = false) { return pi(sigma(dom), codom, implicit); }
253 const Pi* pi(const Def* dom, Defs codom, bool implicit = false) { return pi(dom, sigma(codom), implicit); }
254 const Pi* pi(Defs dom, Defs codom, bool implicit = false) { return pi(sigma(dom), sigma(codom), implicit); }
255 Pi* mut_pi(const Def* type, bool implicit = false) { return insert<Pi>(2, type, implicit); }
256 // clang-format on
257 ///@}
258
259 /// @name Cn
260 /// Pi with codom mim::Bot%tom
261 ///@{
262 // clang-format off
263 const Pi* cn( ) { return cn(sigma( ), false); }
264 const Pi* cn(const Def* dom, bool implicit = false) { return pi( dom , type_bot(), implicit); }
265 const Pi* cn(Defs dom, bool implicit = false) { return cn(sigma(dom), implicit); }
266 const Pi* fn(const Def* dom, const Def* codom, bool implicit = false) { return cn({ dom , cn(codom)}, implicit); }
267 const Pi* fn(Defs dom, const Def* codom, bool implicit = false) { return fn(sigma(dom), codom, implicit); }
268 const Pi* fn(const Def* dom, Defs codom, bool implicit = false) { return fn( dom , sigma(codom), implicit); }
269 const Pi* fn(Defs dom, Defs codom, bool implicit = false) { return fn(sigma(dom), sigma(codom), implicit); }
270 // clang-format on
271 ///@}
272
273 /// @name Lam
274 ///@{
276 if (auto b = std::get_if<bool>(&filter)) return lit_bool(*b);
277 return std::get<const Def*>(filter);
278 }
279 const Lam* lam(const Pi* pi, Lam::Filter f, const Def* body) { return unify<Lam>(2, pi, filter(f), body); }
280 Lam* mut_lam(const Pi* pi) { return insert<Lam>(2, pi); }
281 // clang-format off
282 const Lam* con(const Def* dom, Lam::Filter f, const Def* body) { return unify<Lam>(2, cn(dom ), filter(f), body); }
283 const Lam* con(Defs dom, Lam::Filter f, const Def* body) { return unify<Lam>(2, cn(dom ), filter(f), body); }
284 const Lam* lam(const Def* dom, const Def* codom, Lam::Filter f, const Def* body) { return unify<Lam>(2, pi(dom, codom), filter(f), body); }
285 const Lam* lam(Defs dom, const Def* codom, Lam::Filter f, const Def* body) { return unify<Lam>(2, pi(dom, codom), filter(f), body); }
286 const Lam* lam(const Def* dom, Defs codom, Lam::Filter f, const Def* body) { return unify<Lam>(2, pi(dom, codom), filter(f), body); }
287 const Lam* lam(Defs dom, Defs codom, Lam::Filter f, const Def* body) { return unify<Lam>(2, pi(dom, codom), filter(f), body); }
288 const Lam* fun(const Def* dom, const Def* codom, Lam::Filter f, const Def* body) { return unify<Lam>(2, fn(dom, codom), filter(f), body); }
289 const Lam* fun(Defs dom, const Def* codom, Lam::Filter f, const Def* body) { return unify<Lam>(2, fn(dom, codom), filter(f), body); }
290 const Lam* fun(const Def* dom, Defs codom, Lam::Filter f, const Def* body) { return unify<Lam>(2, fn(dom, codom), filter(f), body); }
291 const Lam* fun(Defs dom, Defs codom, Lam::Filter f, const Def* body) { return unify<Lam>(2, fn(dom, codom), filter(f), body); }
292 Lam* mut_con(const Def* dom ) { return insert<Lam>(2, cn(dom )); }
293 Lam* mut_con(Defs dom ) { return insert<Lam>(2, cn(dom )); }
294 Lam* mut_lam(const Def* dom, const Def* codom) { return insert<Lam>(2, pi(dom, codom)); }
295 Lam* mut_lam(Defs dom, const Def* codom) { return insert<Lam>(2, pi(dom, codom)); }
296 Lam* mut_lam(const Def* dom, Defs codom) { return insert<Lam>(2, pi(dom, codom)); }
297 Lam* mut_lam(Defs dom, Defs codom) { return insert<Lam>(2, pi(dom, codom)); }
298 Lam* mut_fun(const Def* dom, const Def* codom) { return insert<Lam>(2, fn(dom, codom)); }
299 Lam* mut_fun(Defs dom, const Def* codom) { return insert<Lam>(2, fn(dom, codom)); }
300 Lam* mut_fun(const Def* dom, Defs codom) { return insert<Lam>(2, fn(dom, codom)); }
301 Lam* mut_fun(Defs dom, Defs codom) { return insert<Lam>(2, fn(dom, codom)); }
302 // clang-format on
303 ///@}
304
305 /// @name App
306 ///@{
307 template<bool Normalize = true> const Def* app(const Def* callee, const Def* arg);
308 template<bool Normalize = true> const Def* app(const Def* callee, Defs args) {
309 return app<Normalize>(callee, tuple(args));
310 }
311 const Def* raw_app(const Axiom* axiom, u8 curry, u8 trip, const Def* type, const Def* callee, const Def* arg);
312 const Def* raw_app(const Def* type, const Def* callee, const Def* arg);
313 const Def* raw_app(const Def* type, const Def* callee, Defs args) { return raw_app(type, callee, tuple(args)); }
314 ///@}
315
316 /// @name Sigma
317 ///@{
318 Sigma* mut_sigma(const Def* type, size_t size) { return insert<Sigma>(size, type, size); }
319 /// A *mut*able Sigma of type @p level.
320 template<level_t level = 0> Sigma* mut_sigma(size_t size) { return mut_sigma(type<level>(), size); }
321 const Def* sigma(Defs ops);
322 const Sigma* sigma() { return data_.sigma; } ///< The unit type within Type 0.
323 ///@}
324
325 /// @name Arr
326 ///@{
327 Arr* mut_arr(const Def* type) { return insert<Arr>(2, type); }
328 template<level_t level = 0> Arr* mut_arr() { return mut_arr(type<level>()); }
329 const Def* arr(const Def* shape, const Def* body);
330 const Def* arr(Defs shape, const Def* body);
331 const Def* arr(u64 n, const Def* body) { return arr(lit_nat(n), body); }
332 const Def* arr(View<u64> shape, const Def* body) {
333 return arr(DefVec(shape.size(), [&](size_t i) { return lit_nat(shape[i]); }), body);
334 }
335 const Def* arr_unsafe(const Def* body) { return arr(top_nat(), body); }
336 ///@}
337
338 /// @name Tuple
339 ///@{
340 const Def* tuple(Defs ops);
341 /// Ascribes @p type to this tuple - needed for dependently typed and mutable Sigma%s.
342 const Def* tuple(const Def* type, Defs ops);
343 const Tuple* tuple() { return data_.tuple; } ///< the unit value of type `[]`
344 const Def* tuple(Sym sym); ///< Converts @p sym to a tuple of type '«n; I8»'.
345 ///@}
346
347 /// @name Pack
348 ///@{
349 Pack* mut_pack(const Def* type) { return insert<Pack>(1, type); }
350 const Def* pack(const Def* arity, const Def* body);
351 const Def* pack(Defs shape, const Def* body);
352 const Def* pack(u64 n, const Def* body) { return pack(lit_nat(n), body); }
353 const Def* pack(View<u64> shape, const Def* body) {
354 return pack(DefVec(shape.size(), [&](auto i) { return lit_nat(shape[i]); }), body);
355 }
356 ///@}
357
358 /// @name Extract
359 /// @see core::extract_unsafe
360 ///@{
361 const Def* extract(const Def* d, const Def* i);
362 const Def* extract(const Def* d, u64 a, u64 i) { return extract(d, lit_idx(a, i)); }
363 const Def* extract(const Def* d, u64 i) { return extract(d, d->as_lit_arity(), i); }
364
365 /// Builds `(f, t)#cond`.
366 /// @note Expects @p cond as first, @p t as second, and @p f as third argument.
367 const Def* select(const Def* cond, const Def* t, const Def* f) { return extract(tuple({f, t}), cond); }
368 ///@}
369
370 /// @name Insert
371 /// @see core::insert_unsafe
372 ///@{
373 const Def* insert(const Def* d, const Def* i, const Def* val);
374 const Def* insert(const Def* d, u64 a, u64 i, const Def* val) { return insert(d, lit_idx(a, i), val); }
375 const Def* insert(const Def* d, u64 i, const Def* val) { return insert(d, d->as_lit_arity(), i, val); }
376 ///@}
377
378 /// @name Lit
379 ///@{
380 const Lit* lit(const Def* type, u64 val);
381 const Lit* lit_univ(u64 level) { return lit(univ(), level); }
382 const Lit* lit_univ_0() { return data_.lit_univ_0; }
383 const Lit* lit_univ_1() { return data_.lit_univ_1; }
384 const Lit* lit_nat(nat_t a) { return lit(type_nat(), a); }
385 const Lit* lit_nat_0() { return data_.lit_nat_0; }
386 const Lit* lit_nat_1() { return data_.lit_nat_1; }
387 const Lit* lit_nat_max() { return data_.lit_nat_max; }
388 const Lit* lit_0_1() { return data_.lit_0_1; }
389 // clang-format off
390 const Lit* lit_i1() { return lit_nat(Idx::bitwidth2size( 1)); };
391 const Lit* lit_i8() { return lit_nat(Idx::bitwidth2size( 8)); };
392 const Lit* lit_i16() { return lit_nat(Idx::bitwidth2size(16)); };
393 const Lit* lit_i32() { return lit_nat(Idx::bitwidth2size(32)); };
394 const Lit* lit_i64() { return lit_nat(Idx::bitwidth2size(64)); };
395 /// Constructs a Lit of type Idx of size @p size.
396 /// @note `size = 0` means `2^64`.
397 const Lit* lit_idx(nat_t size, u64 val) { return lit(type_idx(size), val); }
398
399 template<class I> const Lit* lit_idx(I val) {
400 static_assert(std::is_integral<I>());
401 return lit_idx(Idx::bitwidth2size(sizeof(I) * 8), val);
402 }
403
404 /// Constructs a Lit @p of type Idx of size 2^width.
405 /// `val = 64` will be automatically converted to size `0` - the encoding for 2^64.
406 const Lit* lit_int(nat_t width, u64 val) { return lit_idx(Idx::bitwidth2size(width), val); }
407 const Lit* lit_i1 (bool val) { return lit_int( 1, u64(val)); }
408 const Lit* lit_i2 (u8 val) { return lit_int( 2, u64(val)); }
409 const Lit* lit_i4 (u8 val) { return lit_int( 4, u64(val)); }
410 const Lit* lit_i8 (u8 val) { return lit_int( 8, u64(val)); }
411 const Lit* lit_i16(u16 val) { return lit_int(16, u64(val)); }
412 const Lit* lit_i32(u32 val) { return lit_int(32, u64(val)); }
413 const Lit* lit_i64(u64 val) { return lit_int(64, u64(val)); }
414 // clang-format on
415
416 /// Constructs a Lit of type Idx of size @p mod.
417 /// The value @p val will be adjusted modulo @p mod.
418 /// @note `mod == 0` is the special case for 2^64 and no modulo will be performed on @p val.
419 const Lit* lit_idx_mod(nat_t mod, u64 val) { return lit_idx(mod, mod == 0 ? val : (val % mod)); }
420
421 const Lit* lit_bool(bool val) { return data_.lit_bool[size_t(val)]; }
422 const Lit* lit_ff() { return data_.lit_bool[0]; }
423 const Lit* lit_tt() { return data_.lit_bool[1]; }
424 // clang-format off
425 ///@}
426
427 /// @name Lattice
428 ///@{
429 template<bool Up>
430 const Def* ext(const Def* type);
431 const Def* bot(const Def* type) { return ext<false>(type); }
432 const Def* top(const Def* type) { return ext<true>(type); }
433 const Def* type_bot() { return data_.type_bot; }
434 const Def* type_top() { return data_.type_top; }
435 const Def* top_nat() { return data_.top_nat; }
436 template<bool Up> TBound<Up>* mut_bound(const Def* type, size_t size) { return insert<TBound<Up>>(size, type, size); }
437 /// A *mut*able Bound of Type @p l%evel.
438 template<bool Up, level_t l = 0> TBound<Up>* mut_bound(size_t size) { return mut_bound<Up>(type<l>(), size); }
439 template<bool Up> const Def* bound(Defs ops);
440 Join* mut_join(const Def* type, size_t size) { return mut_bound<true>(type, size); }
441 Meet* mut_meet(const Def* type, size_t size) { return mut_bound<false>(type, size); }
442 template<level_t l = 0> Join* mut_join(size_t size) { return mut_join(type<l>(), size); }
443 template<level_t l = 0> Meet* mut_meet(size_t size) { return mut_meet(type<l>(), size); }
444 const Def* join(Defs ops) { return bound<true>(ops); }
445 const Def* meet(Defs ops) { return bound<false>(ops); }
446 const Def* ac(const Def* type, Defs ops);
447 /// Infers the type using an *immutable* Meet.
448 const Def* ac(Defs ops);
449 const Def* vel(const Def* type, const Def* value);
450 const Def* pick(const Def* type, const Def* value);
451 const Def* test(const Def* value, const Def* probe, const Def* match, const Def* clash);
452 const Def* uniq(const Def* inhabitant);
453 ///@}
454
455 /// @name Globals
456 /// @deprecated Will be removed.
457 ///@{
458 Global* global(const Def* type, bool is_mutable = true) { return insert<Global>(1, type, is_mutable); }
459 ///@}
460 // clang-format on
461
462 /// @name Types
463 ///@{
464 const Nat* type_nat() { return data_.type_nat; }
465 const Idx* type_idx() { return data_.type_idx; }
466 /// @note `size = 0` means `2^64`.
467 const Def* type_idx(const Def* size) { return app(type_idx(), size); }
468 /// @note `size = 0` means `2^64`.
469 const Def* type_idx(nat_t size) { return type_idx(lit_nat(size)); }
470
471 /// Constructs a type Idx of size 2^width.
472 /// `width = 64` will be automatically converted to size `0` - the encoding for 2^64.
473 const Def* type_int(nat_t width) { return type_idx(lit_nat(Idx::bitwidth2size(width))); }
474 // clang-format off
475 const Def* type_bool() { return data_.type_bool; }
476 const Def* type_i1() { return data_.type_bool; }
477 const Def* type_i2() { return type_int( 2); };
478 const Def* type_i4() { return type_int( 4); };
479 const Def* type_i8() { return type_int( 8); };
480 const Def* type_i16() { return type_int(16); };
481 const Def* type_i32() { return type_int(32); };
482 const Def* type_i64() { return type_int(64); };
483 // clang-format on
484 ///@}
485
486 /// @name Cope with implicit Arguments
487 ///@{
488
489 /// Places Hole%s as demanded by Pi::is_implicit() and then apps @p arg.
490 template<bool Normalize = true> const Def* implicit_app(const Def* callee, const Def* arg);
491 template<bool Normalize = true> const Def* implicit_app(const Def* callee, Defs args) {
492 return implicit_app<Normalize>(callee, tuple(args));
493 }
494 template<bool Normalize = true> const Def* implicit_app(const Def* callee, nat_t arg) {
495 return implicit_app<Normalize>(callee, lit_nat(arg));
496 }
497 template<bool Normalize = true, class E>
498 const Def* implicit_app(const Def* callee, E arg)
499 requires std::is_enum_v<E> && std::is_same_v<std::underlying_type_t<E>, nat_t>
500 {
501 return implicit_app<Normalize>(callee, lit_nat((nat_t)arg));
502 }
503
504 /// Complete curried call of annexes obeying implicits.
505 // clang-format off
506 template<class Id, bool Normalize = true, class... Args> const Def* call(Id id, Args&&... args) { return call_<Normalize>(annex(id), std::forward<Args>(args)...); }
507 template<class Id, bool Normalize = true, class... Args> const Def* call( Args&&... args) { return call_<Normalize>(annex<Id>(), std::forward<Args>(args)...); }
508 // clang-format on
509 ///@}
510
511 /// @name Vars & Muts
512 /// Manges sets of Vars and Muts.
513 ///@{
514 [[nodiscard]] auto& vars() { return move_.vars; }
515 [[nodiscard]] auto& muts() { return move_.muts; }
516 [[nodiscard]] const auto& vars() const { return move_.vars; }
517 [[nodiscard]] const auto& muts() const { return move_.muts; }
518 ///@}
519
520 /// @name dump/log
521 ///@{
522 Log& log();
523 void dummy() {}
524 void dump(std::ostream& os); ///< Dump to @p os.
525 void dump(); ///< Dump to `std::cout`.
526 void debug_dump(); ///< Dump in Debug build if World::log::level is Log::Level::Debug.
527 void write(const char* file); ///< Write to a file named @p file.
528 void write(); ///< Same above but file name defaults to World::name.
529 ///@}
530
531 /// @name dot
532 /// GraphViz output.
533 ///@{
534
535 /// Dumps DOT to @p os.
536 /// @param os Output stream
537 /// @param annexes If `true`, include all annexes - even if unused.
538 /// @param types Follow type dependencies?
539 void dot(std::ostream& os, bool annexes = false, bool types = false) const;
540 /// Same as above but write to @p file or `std::cout` if @p file is `nullptr`.
541 void dot(const char* file = nullptr, bool annexes = false, bool types = false) const;
542 ///@}
543
544private:
545 /// @name call_
546 /// Helpers to unwind World::call with variadic templates.
547 ///@{
548 template<bool Normalize = true, class T, class... Args> const Def* call_(const Def* callee, T arg, Args&&... args) {
549 return call_<Normalize>(implicit_app(callee, arg), std::forward<Args>(args)...);
550 }
551 template<bool Normalize = true, class T> const Def* call_(const Def* callee, T arg) {
552 return implicit_app<Normalize>(callee, arg);
553 }
554 ///@}
555
556 /// @name Put into Sea of Nodes
557 ///@{
558 template<class T, class... Args> const T* unify(size_t num_ops, Args&&... args) {
559 auto state = move_.arena.state();
560 auto def = allocate<T>(num_ops, std::forward<Args&&>(args)...);
561 if (auto loc = get_loc()) def->set(loc);
562 assert(!def->isa_mut());
563#ifdef MIM_ENABLE_CHECKS
564 if (flags().trace_gids) outln("{}: {} - {}", def->node_name(), def->gid(), def->flags());
565 if (flags().reeval_breakpoints && breakpoints().contains(def->gid())) fe::breakpoint();
566#endif
567 if (is_frozen()) {
568 --state_.pod.curr_gid;
569 auto i = move_.defs.find(def);
570 deallocate<T>(state, def);
571 if (i != move_.defs.end()) return static_cast<const T*>(*i);
572 return nullptr;
573 }
574
575 if (auto [i, ins] = move_.defs.emplace(def); !ins) {
576 deallocate<T>(state, def);
577 return static_cast<const T*>(*i);
578 }
579#ifdef MIM_ENABLE_CHECKS
580 if (!flags().reeval_breakpoints && breakpoints().contains(def->gid())) fe::breakpoint();
581#endif
582 return def;
583 }
584
585 template<class T> void deallocate(fe::Arena::State state, const T* ptr) {
586 ptr->~T();
587 move_.arena.deallocate(state);
588 }
589
590 template<class T, class... Args> T* insert(size_t num_ops, Args&&... args) {
591 auto def = allocate<T>(num_ops, std::forward<Args&&>(args)...);
592 if (auto loc = get_loc()) def->set(loc);
593#ifdef MIM_ENABLE_CHECKS
594 if (flags().trace_gids) outln("{}: {} - {}", def->node_name(), def->gid(), def->flags());
595 if (breakpoints().contains(def->gid())) fe::breakpoint();
596#endif
597 assert_emplace(move_.defs, def);
598 return def;
599 }
600
601#if (!defined(_MSC_VER) && defined(NDEBUG))
602 struct Lock {
603 Lock() { assert((guard_ = !guard_) && "you are not allowed to recursively invoke allocate"); }
604 ~Lock() { guard_ = !guard_; }
605 static bool guard_;
606 };
607#else
608 struct Lock {
609 ~Lock() {}
610 };
611#endif
612
613 template<class T, class... Args> T* allocate(size_t num_ops, Args&&... args) {
614 static_assert(sizeof(Def) == sizeof(T),
615 "you are not allowed to introduce any additional data in subclasses of Def");
616 auto lock = Lock();
617 auto num_bytes = sizeof(Def) + sizeof(uintptr_t) * num_ops;
618 auto ptr = move_.arena.allocate(num_bytes, alignof(T));
619 auto res = new (ptr) T(std::forward<Args&&>(args)...);
620 assert(res->num_ops() == num_ops);
621 return res;
622 }
623 ///@}
624
625 Driver* driver_;
626 State state_;
627
628 struct SeaHash {
629 size_t operator()(const Def* def) const { return def->hash(); }
630 };
631
632 struct SeaEq {
633 bool operator()(const Def* d1, const Def* d2) const { return d1->equal(d2); }
634 };
635
636 struct Move {
637 absl::btree_map<flags_t, const Def*> flags2annex;
638 absl::btree_map<Sym, Def*> sym2external;
639 fe::Arena arena;
640 absl::flat_hash_set<const Def*, SeaHash, SeaEq> defs;
641 Sets<Def> muts;
642 Sets<const Var> vars;
643 DefDefMap<DefVec> cache;
644
645 friend void swap(Move& m1, Move& m2) noexcept {
646 using std::swap;
647 // clang-format off
648 swap(m1.flags2annex, m2.flags2annex);
649 swap(m1.sym2external, m2.sym2external);
650 swap(m1.arena, m2.arena);
651 swap(m1.defs, m2.defs);
652 swap(m1.vars, m2.vars);
653 swap(m1.muts, m2.muts);
654 swap(m1.cache, m2.cache);
655 // clang-format on
656 }
657 } move_;
658
659 struct {
660 const Univ* univ;
661 const Type* type_0;
662 const Type* type_1;
663 const Bot* type_bot;
664 const Top* type_top;
665 const Def* type_bool;
666 const Top* top_nat;
667 const Sigma* sigma;
668 const Tuple* tuple;
669 const Nat* type_nat;
670 const Idx* type_idx;
671 const Def* table_id;
672 const Def* table_not;
673 const Lit* lit_univ_0;
674 const Lit* lit_univ_1;
675 const Lit* lit_nat_0;
676 const Lit* lit_nat_1;
677 const Lit* lit_nat_max;
678 const Lit* lit_0_1;
679 std::array<const Lit*, 2> lit_bool;
680 u32 curr_run = 0;
681 } data_;
682
683 friend void swap(World& w1, World& w2) noexcept {
684 using std::swap;
685 // clang-format off
686 swap(w1.state_, w2.state_);
687 swap(w1.data_, w2.data_ );
688 swap(w1.move_, w2.move_ );
689 // clang-format on
690
691 swap(w1.data_.univ->world_, w2.data_.univ->world_);
692 assert(&w1.univ()->world() == &w1);
693 assert(&w2.univ()->world() == &w2);
694 }
695
696 friend DefVec Def::reduce(const Def*);
697};
698
699} // namespace mim
A (possibly paramterized) Array.
Definition tuple.h:68
Base class for all Defs.
Definition def.h:198
DefVec reduce(const Def *arg) const
Rewrites Def::ops by substituting this mutable's Var with arg.
Definition def.cpp:227
Some "global" variables needed all over the place.
Definition driver.h:17
This node is a hole in the IR that is inferred by its context later on.
Definition check.h:10
A built-in constant of type Nat -> *.
Definition def.h:760
static constexpr nat_t bitwidth2size(nat_t n)
Definition def.h:791
A function.
Definition lam.h:105
std::variant< bool, const Def * > Filter
Definition lam.h:113
Facility to log what you are doing.
Definition log.h:17
A (possibly paramterized) Tuple.
Definition tuple.h:115
A dependent function type.
Definition lam.h:11
static const Def * infer(const Def *dom, const Def *codom)
Definition check.cpp:292
A dependent tuple type.
Definition tuple.h:9
Specific Bound depending on Up.
Definition lattice.h:31
Data constructor for a Sigma.
Definition tuple.h:50
This is a thin wrapper for absl::InlinedVector<T, N, A> which is a drop-in replacement for std::vecto...
Definition vector.h:17
The World represents the whole program and manages creation of MimIR nodes (Defs).
Definition world.h:33
const Lit * lit_idx(nat_t size, u64 val)
Constructs a Lit of type Idx of size size.
Definition world.h:397
const Lit * lit_idx(I val)
Definition world.h:399
const Def * insert(const Def *d, const Def *i, const Def *val)
Definition world.cpp:363
const Def * type_i16()
Definition world.h:480
const Pi * fn(Defs dom, const Def *codom, bool implicit=false)
Definition world.h:267
const Def * meet(Defs ops)
Definition world.h:445
const auto & flags2annex() const
Definition world.h:167
const Lam * con(Defs dom, Lam::Filter f, const Def *body)
Definition world.h:283
const Def * uinc(const Def *op, level_t offset=1)
Definition world.cpp:112
const Def * raw_app(const Axiom *axiom, u8 curry, u8 trip, const Def *type, const Def *callee, const Def *arg)
Definition world.cpp:234
const Pi * cn()
Definition world.h:263
const Lit * lit(const Def *type, u64 val)
Definition world.cpp:464
TBound< Up > * mut_bound(const Def *type, size_t size)
Definition world.h:436
const Def * arr(u64 n, const Def *body)
Definition world.h:331
u32 next_run()
Definition world.h:90
friend void swap(World &w1, World &w2) noexcept
Definition world.h:683
Log & log()
Definition world.cpp:70
const Def * implicit_app(const Def *callee, nat_t arg)
Definition world.h:494
const Def * extract(const Def *d, u64 a, u64 i)
Definition world.h:362
auto & muts()
Definition world.h:515
const Def * type_i4()
Definition world.h:478
const Lit * lit_i8()
Definition world.h:391
Hole * mut_hole_infer_entity()
Either a value ?:?:Type ? or a type ?:Type ?:Type ?.
Definition world.h:223
const Pi * cn(const Def *dom, bool implicit=false)
Definition world.h:264
const Def * type_int(nat_t width)
Constructs a type Idx of size 2^width.
Definition world.h:473
World & operator=(World)=delete
const Lit * lit_i16(u16 val)
Definition world.h:411
const Lit * lit_i1(bool val)
Definition world.h:407
const Def * arr(View< u64 > shape, const Def *body)
Definition world.h:332
const Lit * lit_i32()
Definition world.h:393
Driver & driver()
Definition world.h:81
const Def * ac(const Def *type, Defs ops)
Definition world.cpp:511
Lam * mut_fun(const Def *dom, Defs codom)
Definition world.h:300
const Type * type(const Def *level)
Definition world.cpp:105
void make_external(Def *)
Definition world.cpp:87
const Driver & driver() const
Definition world.h:80
const Lam * lam(const Def *dom, const Def *codom, Lam::Filter f, const Def *body)
Definition world.h:284
Lam * mut_lam(const Def *dom, Defs codom)
Definition world.h:296
const Lit * lit_tt()
Definition world.h:423
const Def * filter(Lam::Filter filter)
Definition world.h:275
World(Driver *)
Definition world.cpp:59
const Def * sigma(Defs ops)
Definition world.cpp:238
const auto & sym2external() const
Definition world.h:190
const Def * type_idx(nat_t size)
Definition world.h:469
const Def * pack(const Def *arity, const Def *body)
Definition world.cpp:434
void set(std::string_view name)
Definition world.h:85
const Def * app(const Def *callee, const Def *arg)
Definition world.cpp:181
u32 curr_gid() const
Manage global identifier - a unique number for each Def.
Definition world.h:88
World inherit()
Inherits the state into the new World.
Definition world.h:72
const Def * type_bot()
Definition world.h:433
const Def * arr(const Def *shape, const Def *body)
Definition world.cpp:407
const Pi * pi(const Def *dom, const Def *codom, bool implicit=false)
Definition world.h:251
const Def * pack(u64 n, const Def *body)
Definition world.h:352
const Axiom * axiom(NormalizeFn n, u8 curry, u8 trip, const Def *type, plugin_t p, tag_t t, sub_t s)
Definition world.h:233
const Def * insert(const Def *d, u64 a, u64 i, const Def *val)
Definition world.h:374
const auto & muts() const
Definition world.h:517
const Univ * univ()
Definition world.h:200
const Lam * lam(Defs dom, const Def *codom, Lam::Filter f, const Def *body)
Definition world.h:285
const Lit * lit_0_1()
Definition world.h:388
const Lam * fun(Defs dom, const Def *codom, Lam::Filter f, const Def *body)
Definition world.h:289
const Def * type_i8()
Definition world.h:479
World & verify()
Verifies that all externals() and annexes() are Def::is_closed(), if MIM_ENABLE_CHECKS.
Definition world.cpp:580
const Def * bot(const Def *type)
Definition world.h:431
const Lit * lit_i64()
Definition world.h:394
Arr * mut_arr(const Def *type)
Definition world.h:327
const Lam * lam(const Def *dom, Defs codom, Lam::Filter f, const Def *body)
Definition world.h:286
const Lit * lit_idx_mod(nat_t mod, u64 val)
Constructs a Lit of type Idx of size mod.
Definition world.h:419
const Idx * type_idx()
Definition world.h:465
const Def * type_i1()
Definition world.h:476
Pi * mut_pi(const Def *type, bool implicit=false)
Definition world.h:255
const Lit * lit_univ_0()
Definition world.h:382
const Def * annex(Id id)
Lookup annex by Axiom::id.
Definition world.h:171
void set_loc(Loc loc={})
Definition world.h:110
const Def * implicit_app(const Def *callee, E arg)
Definition world.h:498
Join * mut_join(const Def *type, size_t size)
Definition world.h:440
Sym name() const
Definition world.h:83
const Pi * cn(Defs dom, bool implicit=false)
Definition world.h:265
void dump()
Dump to std::cout.
Definition dump.cpp:484
const Lam * fun(const Def *dom, Defs codom, Lam::Filter f, const Def *body)
Definition world.h:290
const Lit * lit_univ_1()
Definition world.h:383
void write()
Same above but file name defaults to World::name.
Definition dump.cpp:495
const Lam * lam(Defs dom, Defs codom, Lam::Filter f, const Def *body)
Definition world.h:287
const Def * register_annex(plugin_t p, tag_t t, sub_t s, const Def *def)
Definition world.h:183
Lam * mut_fun(Defs dom, const Def *codom)
Definition world.h:299
Lam * mut_fun(const Def *dom, const Def *codom)
Definition world.h:298
const Lit * lit_i1()
Definition world.h:390
const Nat * type_nat()
Definition world.h:464
const Pi * fn(const Def *dom, Defs codom, bool implicit=false)
Definition world.h:268
const Def * pick(const Def *type, const Def *value)
Definition world.cpp:528
Hole * mut_hole(const Def *type)
Definition world.h:218
const Lam * lam(const Pi *pi, Lam::Filter f, const Def *body)
Definition world.h:279
const Def * tuple(Defs ops)
Definition world.cpp:246
const Lam * fun(Defs dom, Defs codom, Lam::Filter f, const Def *body)
Definition world.h:291
Lam * mut_lam(const Def *dom, const Def *codom)
Definition world.h:294
const Def * gid2def(u32 gid)
Lookup Def by gid.
Definition world.cpp:574
Flags & flags()
Retrieve compile Flags.
Definition world.cpp:71
const Def * implicit_app(const Def *callee, const Def *arg)
Places Holes as demanded by Pi::is_implicit() and then apps arg.
Definition world.cpp:176
ScopedLoc push(Loc loc)
Definition world.h:111
const Def * implicit_app(const Def *callee, Defs args)
Definition world.h:491
const Axiom * axiom(NormalizeFn n, u8 curry, u8 trip, const Def *type)
Builds a fresh Axiom with descending Axiom::sub.
Definition world.h:242
void debug_dump()
Dump in Debug build if World::log::level is Log::Level::Debug.
Definition dump.cpp:486
u32 next_gid()
Definition world.h:89
const Def * extract(const Def *d, u64 i)
Definition world.h:363
const Lam * fun(const Def *dom, const Def *codom, Lam::Filter f, const Def *body)
Definition world.h:288
const Def * call(Args &&... args)
Definition world.h:507
const auto & breakpoints()
Definition world.h:154
const Type * type()
Definition world.h:205
const Def * var(const Def *type, Def *mut)
Definition world.cpp:167
void set(Sym name)
Definition world.h:84
const Def * app(const Def *callee, Defs args)
Definition world.h:308
const Def * pack(View< u64 > shape, const Def *body)
Definition world.h:353
Lam * mut_fun(Defs dom, Defs codom)
Definition world.h:301
const Lit * lit_i2(u8 val)
Definition world.h:408
const Def * extract(const Def *d, const Def *i)
Definition world.cpp:301
Pack * mut_pack(const Def *type)
Definition world.h:349
bool is_frozen() const
Definition world.h:130
Loc get_loc() const
Definition world.h:109
auto externals() const
Definition world.h:192
const Axiom * axiom(const Def *type, plugin_t p, tag_t t, sub_t s)
Definition world.h:236
const Lit * lit_nat_0()
Definition world.h:385
Sym sym(std::string_view)
Definition world.cpp:74
const Lit * lit_i16()
Definition world.h:392
Global * global(const Def *type, bool is_mutable=true)
Definition world.h:458
Lam * mut_lam(Defs dom, const Def *codom)
Definition world.h:295
const Lit * lit_ff()
Definition world.h:422
const Lit * lit_nat_max()
Definition world.h:387
const Def * raw_app(const Def *type, const Def *callee, Defs args)
Definition world.h:313
const Pi * pi(Defs dom, const Def *codom, bool implicit=false)
Definition world.h:252
Def * external(Sym name)
Lookup by name.
Definition world.h:191
const Def * bound(Defs ops)
Definition world.cpp:487
const Def * join(Defs ops)
Definition world.h:444
const Def * ext(const Def *type)
Definition world.cpp:480
Sym append_suffix(Sym name, std::string suffix)
Appends a suffix or an increasing number if the suffix already exists.
Definition world.cpp:546
void make_internal(Def *)
Definition world.cpp:94
Join * mut_join(size_t size)
Definition world.h:442
const Proxy * proxy(const Def *type, Defs ops, u32 index, u32 tag)
Definition world.h:214
const Lit * lit_i32(u32 val)
Definition world.h:412
const Lit * lit_i8(u8 val)
Definition world.h:410
Lam * mut_lam(Defs dom, Defs codom)
Definition world.h:297
const Def * type_top()
Definition world.h:434
Sigma * mut_sigma(size_t size)
A *mut*able Sigma of type level.
Definition world.h:320
const Lit * lit_univ(u64 level)
Definition world.h:381
const Pi * pi(Defs dom, Defs codom, bool implicit=false)
Definition world.h:254
const Tuple * tuple()
the unit value of type []
Definition world.h:343
const Type * type_infer_univ()
Definition world.h:204
const Def * call(Id id, Args &&... args)
Complete curried call of annexes obeying implicits.
Definition world.h:506
const Def * type_bool()
Definition world.h:475
const Def * vel(const Def *type, const Def *value)
Definition world.cpp:523
const Def * uniq(const Def *inhabitant)
Definition world.cpp:544
void dummy()
Definition world.h:523
const Def * umax(Defs)
Definition world.cpp:121
Vector< Def * > copy_externals() const
Definition world.h:193
const Lam * con(const Def *dom, Lam::Filter f, const Def *body)
Definition world.h:282
const Def * type_i2()
Definition world.h:477
Meet * mut_meet(const Def *type, size_t size)
Definition world.h:441
const Def * arr_unsafe(const Def *body)
Definition world.h:335
const Lit * lit_i64(u64 val)
Definition world.h:413
const Def * type_i64()
Definition world.h:482
const Sigma * sigma()
The unit type within Type 0.
Definition world.h:322
const Lit * lit_nat(nat_t a)
Definition world.h:384
const State & state() const
Definition world.h:78
Hole * mut_hole_type()
Definition world.h:220
const auto & vars() const
Definition world.h:516
TBound< Up > * mut_bound(size_t size)
A *mut*able Bound of Type level.
Definition world.h:438
const Def * register_annex(flags_t f, const Def *)
Definition world.cpp:77
const Def * top(const Def *type)
Definition world.h:432
const Def * type_idx(const Def *size)
Definition world.h:467
Lam * mut_con(const Def *dom)
Definition world.h:292
Arr * mut_arr()
Definition world.h:328
auto & vars()
Definition world.h:514
const Lit * lit_int(nat_t width, u64 val)
Constructs a Lit of type Idx of size 2^width.
Definition world.h:406
const Lit * lit_bool(bool val)
Definition world.h:421
void breakpoint(u32 gid)
Trigger breakpoint in your debugger when creating Def with Def::gid gid.
Definition world.cpp:572
Meet * mut_meet(size_t size)
Definition world.h:443
const Def * select(const Def *cond, const Def *t, const Def *f)
Builds (f, t)#cond.
Definition world.h:367
Sigma * mut_sigma(const Def *type, size_t size)
Definition world.h:318
Hole * mut_hole_univ()
Definition world.h:219
Lam * mut_con(Defs dom)
Definition world.h:293
const Def * top_nat()
Definition world.h:435
const Pi * fn(const Def *dom, const Def *codom, bool implicit=false)
Definition world.h:266
auto annexes() const
Definition world.h:168
World(World &&other) noexcept
Definition world.h:68
const Lit * lit_nat_1()
Definition world.h:386
const Pi * pi(const Def *dom, Defs codom, bool implicit=false)
Definition world.h:253
bool freeze(bool on=true) const
Yields old frozen state.
Definition world.h:133
const Def * type_i32()
Definition world.h:481
const Lit * lit_i4(u8 val)
Definition world.h:409
const Def * test(const Def *value, const Def *probe, const Def *match, const Def *clash)
Definition world.cpp:530
void dot(std::ostream &os, bool annexes=false, bool types=false) const
Dumps DOT to os.
Definition dot.cpp:147
const Def * insert(const Def *d, u64 i, const Def *val)
Definition world.h:375
const Pi * fn(Defs dom, Defs codom, bool implicit=false)
Definition world.h:269
const Axiom * axiom(const Def *type)
See above.
Definition world.h:245
Lam * mut_lam(const Pi *pi)
Definition world.h:280
const Def * annex()
Get Axiom from a plugin.
Definition world.h:180
Definition ast.h:14
View< const Def * > Defs
Definition def.h:49
u64 nat_t
Definition types.h:43
Vector< const Def * > DefVec
Definition def.h:50
absl::flat_hash_map< DefDef, To, DefDefHash, DefDefEq > DefDefMap
Definition def.h:613
u8 sub_t
Definition types.h:48
auto assert_emplace(C &container, Args &&... args)
Invokes emplace on container, asserts that insertion actually happened, and returns the iterator.
Definition util.h:104
u64 flags_t
Definition types.h:45
auto lookup(const C &container, const K &key)
Yields pointer to element (or the element itself if it is already a pointer), if found and nullptr ot...
Definition util.h:95
Span< const T, N > View
Definition span.h:88
TBound< true > Join
Definition lattice.h:180
void error(Loc loc, const char *f, Args &&... args)
Definition dbg.h:122
u64 level_t
Definition types.h:42
TExt< true > Top
Definition lattice.h:178
std::ostream & outln(const char *fmt, Args &&... args)
Definition print.h:190
auto match(const Def *def)
Definition axiom.h:112
const Def *(*)(const Def *, const Def *, const Def *) NormalizeFn
Definition def.h:71
u64 plugin_t
Definition types.h:46
uint32_t u32
Definition types.h:34
TExt< false > Bot
Definition lattice.h:177
uint64_t u64
Definition types.h:34
u8 tag_t
Definition types.h:47
uint8_t u8
Definition types.h:34
TBound< false > Meet
Definition lattice.h:179
@ Nat
Definition def.h:85
@ Univ
Definition def.h:85
@ Idx
Definition def.h:85
@ Sigma
Definition def.h:85
@ Type
Definition def.h:85
@ Tuple
Definition def.h:85
@ Lit
Definition def.h:85
uint16_t u16
Definition types.h:34
Compiler switches that must be saved and looked up in later phases of compilation.
Definition flags.h:11
static constexpr plugin_t Global_Plugin
Definition plugin.h:58
static Sym demangle(Driver &, plugin_t plugin)
Reverts an Axiom::mangled string to a Sym.
Definition plugin.cpp:37
static constexpr flags_t Base
Definition plugin.h:118
Freezer(const World &world)
Definition world.h:141
const World & world
Definition world.h:146
ScopedLoc(World &world, Loc old_loc)
Definition world.h:99
friend void swap(State &s1, State &s2) noexcept
Definition world.h:52
struct mim::World::State::POD pod
absl::flat_hash_set< uint32_t > breakpoints
Definition world.h:50
Plain Old Data
Definition world.h:41