1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
|
/*
* MRustC - Rust Compiler
* - By John Hodge (Mutabah/thePowersGang)
*
* hir/hir.hpp
* - Processed module tree (High-level Intermediate Representation)
*
* Contains the expanded and desugared AST
*/
#pragma once
#include <target_version.hpp>
#include <cassert>
#include <unordered_map>
#include <vector>
#include <memory>
#include <tagged_union.hpp>
#include <macro_rules/macro_rules_ptr.hpp>
#include <hir/type.hpp>
#include <hir/path.hpp>
#include <hir/pattern.hpp>
#include <hir/expr_ptr.hpp>
#include <hir/generic_params.hpp>
#include <hir/crate_ptr.hpp>
#define ABI_RUST "Rust"
namespace HIR {
class Crate;
class Module;
class Function;
class Static;
class ValueItem;
class TypeItem;
class MacroItem;
class ItemPath;
class Publicity
{
static ::std::shared_ptr<::HIR::SimplePath> none_path;
::std::shared_ptr<::HIR::SimplePath> vis_path;
Publicity(::std::shared_ptr<::HIR::SimplePath> p)
:vis_path(p)
{
}
public:
static Publicity new_global() {
return Publicity({});
}
static Publicity new_none() {
return Publicity(none_path);
}
static Publicity new_priv(::HIR::SimplePath p) {
return Publicity(::std::make_shared<HIR::SimplePath>(::std::move(p)));
}
bool is_global() const {
return !vis_path;
}
bool is_visible(const ::HIR::SimplePath& p) const;
friend ::std::ostream& operator<<(::std::ostream& os, const Publicity& x);
};
enum class ConstEvalState
{
None,
Active,
Complete,
};
template<typename Ent>
struct VisEnt
{
Publicity publicity;
Ent ent;
};
/// Literal type used for constant evaluation
/// NOTE: Intentionally minimal, just covers the values (not the types)
TAGGED_UNION(Literal, Invalid,
(Invalid, struct {}),
(Defer, struct {}),
// List = Array, Tuple, struct literal
(List, ::std::vector<Literal>), // TODO: Have a variant for repetition lists
// Variant = Enum variant
(Variant, struct {
unsigned int idx;
::std::unique_ptr<Literal> val;
}),
// Literal values
(Integer, uint64_t),
(Float, double),
// Borrow of a path (existing item)
(BorrowPath, ::HIR::Path),
// Borrow of inline data
(BorrowData, ::std::unique_ptr<Literal>),
// String = &'static str or &[u8; N]
(String, ::std::string)
);
extern ::std::ostream& operator<<(::std::ostream& os, const Literal& v);
extern bool operator==(const Literal& l, const Literal& r);
static inline bool operator!=(const Literal& l, const Literal& r) { return !(l == r); }
// --------------------------------------------------------------------
// Value structures
// --------------------------------------------------------------------
struct Linkage
{
enum class Type
{
Auto, // Default
Weak, // Weak linkage (multiple definitions are allowed
External, // Force the symbol to be externally visible
};
// Linkage type
Type type = Type::Auto;
// External symbol name
::std::string name;
};
class Static
{
public:
Linkage m_linkage;
bool m_is_mut;
TypeRef m_type;
ExprPtr m_value;
Literal m_value_res;
};
class Constant
{
public:
// NOTE: The generics can't influence the value of this `const`
GenericParams m_params;
TypeRef m_type;
ExprPtr m_value;
Literal m_value_res;
// A cache of monomorphised versions when the `const` depends on generics for its value
mutable ::std::map< ::HIR::Path, Literal> m_monomorph_cache;
};
class Function
{
public:
enum class Receiver {
Free,
Value,
BorrowOwned,
BorrowUnique,
BorrowShared,
//PointerMut,
//PointerConst,
Box,
Custom,
};
typedef ::std::vector< ::std::pair< ::HIR::Pattern, ::HIR::TypeRef> > args_t;
bool m_save_code; // Filled by enumerate, defaults to false
Linkage m_linkage;
Receiver m_receiver;
::std::string m_abi;
bool m_unsafe;
bool m_const;
GenericParams m_params;
args_t m_args;
bool m_variadic;
TypeRef m_return;
ExprPtr m_code;
//::HIR::TypeRef make_ty(const Span& sp, const ::HIR::PathParams& params) const;
};
// --------------------------------------------------------------------
// Type structures
// --------------------------------------------------------------------
struct TypeAlias
{
GenericParams m_params;
::HIR::TypeRef m_type;
};
typedef ::std::vector< VisEnt<::HIR::TypeRef> > t_tuple_fields;
typedef ::std::vector< ::std::pair< RcString, VisEnt<::HIR::TypeRef> > > t_struct_fields;
/// Cache of the state of various language traits on an enum/struct
struct TraitMarkings
{
/// Indicates that there is at least one Deref impl
bool has_a_deref = false;
/// Indicates that there is a Drop impl
/// - If there is an impl, there must be an applicable impl to every instance.
bool has_drop_impl = false;
/// `true` if there is a Copy impl
bool is_copy = false;
struct AutoMarking {
// If present, this impl is conditionally true based on the listed type parameters
::std::vector< ::HIR::TypeRef> conditions;
// Implementation state
bool is_impled;
};
// General auto trait impls
mutable ::std::map< ::HIR::SimplePath, AutoMarking> auto_impls;
};
// Trait implementations relevant only to structs
struct StructMarkings
{
/// This type has a <T: ?Sized> parameter that is used directly
bool can_unsize = false;
/// Index of the parameter that is ?Sized
unsigned int unsized_param = ~0u;
// TODO: This would have to be changed for custom DSTs
enum class DstType {
None, // Sized
Possible, // A ?Sized parameter
Slice, // [T]
TraitObject, // (Trait)
} dst_type = DstType::None;
unsigned int unsized_field = ~0u;
enum class Coerce {
None, // No CoerceUnsized impl
Passthrough, // Is generic over T: CoerceUnsized
Pointer, // Contains a pointer to a ?Sized type
} coerce_unsized = Coerce::None;
// If populated, indicates the field that is the coercable pointer.
unsigned int coerce_unsized_index = ~0u;
// Index of the parameter that controls the CoerceUnsized (either a T: ?Sized, or a T: CoerceUnsized)
unsigned int coerce_param = ~0u;
};
class ExternType
{
public:
// TODO: do extern types need any associated data?
TraitMarkings m_markings;
};
class Enum
{
public:
struct DataVariant {
RcString name;
bool is_struct; // Indicates that the variant does not show up in the value namespace
::HIR::TypeRef type;
};
enum class Repr
{
Rust,
C,
Usize, U8, U16, U32, U64,
};
struct ValueVariant {
RcString name;
::HIR::ExprPtr expr;
// TODO: Signed.
uint64_t val;
};
TAGGED_UNION(Class, Data,
(Data, ::std::vector<DataVariant>),
(Value, struct {
Repr repr;
::std::vector<ValueVariant> variants;
})
);
GenericParams m_params;
Class m_data;
TraitMarkings m_markings;
size_t num_variants() const {
return (m_data.is_Data() ? m_data.as_Data().size() : m_data.as_Value().variants.size());
}
size_t find_variant(const RcString& ) const;
/// Returns true if this enum is a C-like enum (has values only)
bool is_value() const;
/// Returns the value for the given variant (onlu for value enums)
uint32_t get_value(size_t variant) const;
/// Get a type for the given repr value
static ::HIR::TypeRef get_repr_type(Repr r);
};
class Struct
{
public:
enum class Repr
{
Rust,
C,
Packed,
Simd,
Aligned, // Alignment stored elsewhere
Transparent,
};
TAGGED_UNION(Data, Unit,
(Unit, struct {}),
(Tuple, t_tuple_fields),
(Named, t_struct_fields)
);
Struct(GenericParams params, Repr repr, Data data)
:m_params(mv$(params))
,m_repr(mv$(repr))
,m_data(mv$(data))
{
}
Struct(GenericParams params, Repr repr, Data data, unsigned align, TraitMarkings tm, StructMarkings sm)
:m_params(mv$(params))
,m_repr(mv$(repr))
,m_data(mv$(data))
,m_forced_alignment(align)
,m_markings(mv$(tm))
,m_struct_markings(mv$(sm))
{
}
GenericParams m_params;
Repr m_repr;
Data m_data;
unsigned m_forced_alignment = 0;
TraitMarkings m_markings;
StructMarkings m_struct_markings;
ConstEvalState const_eval_state = ConstEvalState::None;
};
extern ::std::ostream& operator<<(::std::ostream& os, const Struct::Repr& x);
class Union
{
public:
enum class Repr
{
Rust,
C,
};
GenericParams m_params;
Repr m_repr;
t_struct_fields m_variants;
TraitMarkings m_markings;
};
struct AssociatedType
{
bool is_sized;
LifetimeRef m_lifetime_bound;
::std::vector< ::HIR::TraitPath> m_trait_bounds;
::HIR::TypeRef m_default;
};
TAGGED_UNION(TraitValueItem, Constant,
(Constant, Constant),
(Static, Static),
(Function, Function)
);
class Trait
{
public:
GenericParams m_params;
LifetimeRef m_lifetime;
::std::vector< ::HIR::TraitPath > m_parent_traits;
bool m_is_marker; // aka OIBIT
::std::unordered_map< RcString, AssociatedType > m_types;
::std::unordered_map< RcString, TraitValueItem > m_values;
// Indexes into the vtable for each present method and value
::std::unordered_multimap< RcString, ::std::pair<unsigned int,::HIR::GenericPath> > m_value_indexes;
// Indexes in the vtable parameter list for each associated type
::std::unordered_map< RcString, unsigned int > m_type_indexes;
// Flattend set of parent traits (monomorphised and associated types fixed)
::std::vector< ::HIR::TraitPath > m_all_parent_traits;
// VTable path
::HIR::SimplePath m_vtable_path;
Trait( GenericParams gps, LifetimeRef lifetime, ::std::vector< ::HIR::TraitPath> parents):
m_params( mv$(gps) ),
m_lifetime( mv$(lifetime) ),
m_parent_traits( mv$(parents) ),
m_is_marker( false )
{}
};
class ProcMacro
{
public:
// Name of the macro
RcString name;
// Path to the handler
::HIR::SimplePath path;
// A list of attributes to hand to the handler
::std::vector<::std::string> attributes;
};
class Module
{
public:
// List of in-scope traits in this module
::std::vector< ::HIR::SimplePath> m_traits;
// Contains all values and functions (including type constructors)
::std::unordered_map< RcString, ::std::unique_ptr<VisEnt<ValueItem>> > m_value_items;
// Contains types, traits, and modules
::std::unordered_map< RcString, ::std::unique_ptr<VisEnt<TypeItem>> > m_mod_items;
// Macros!
::std::unordered_map< RcString, ::std::unique_ptr<VisEnt<MacroItem>> > m_macro_items;
::std::vector< ::std::pair<RcString, Static> > m_inline_statics;
Module() {}
Module(const Module&) = delete;
Module(Module&& x) = default;
Module& operator=(const Module&) = delete;
Module& operator=(Module&&) = default;
};
// --------------------------------------------------------------------
TAGGED_UNION(TypeItem, Import,
(Import, struct { ::HIR::SimplePath path; bool is_variant; unsigned int idx; }),
(Module, Module),
(TypeAlias, TypeAlias), // NOTE: These don't introduce new values
(ExternType, ExternType),
(Enum, Enum),
(Struct, Struct),
(Union, Union),
(Trait, Trait)
);
TAGGED_UNION(ValueItem, Import,
(Import, struct { ::HIR::SimplePath path; bool is_variant; unsigned int idx; }),
(Constant, Constant),
(Static, Static),
(StructConstant, struct { ::HIR::SimplePath ty; }),
(Function, Function),
(StructConstructor, struct { ::HIR::SimplePath ty; })
);
TAGGED_UNION(MacroItem, Import,
(Import, struct { ::HIR::SimplePath path; }),
(MacroRules, MacroRulesPtr),
(ProcMacro, ProcMacro)
);
// --------------------------------------------------------------------
class TypeImpl
{
public:
template<typename T>
struct VisImplEnt {
Publicity publicity;
bool is_specialisable;
T data;
};
::HIR::GenericParams m_params;
::HIR::TypeRef m_type;
::std::map< RcString, VisImplEnt< ::HIR::Function> > m_methods;
::std::map< RcString, VisImplEnt< ::HIR::Constant> > m_constants;
::HIR::SimplePath m_src_module;
bool matches_type(const ::HIR::TypeRef& tr, t_cb_resolve_type ty_res) const;
bool matches_type(const ::HIR::TypeRef& tr) const {
return matches_type(tr, [](const auto& x)->const auto&{ return x; });
}
};
class TraitImpl
{
public:
template<typename T>
struct ImplEnt {
bool is_specialisable;
T data;
};
::HIR::GenericParams m_params;
::HIR::PathParams m_trait_args;
::HIR::TypeRef m_type;
::std::map< RcString, ImplEnt< ::HIR::Function> > m_methods;
::std::map< RcString, ImplEnt< ::HIR::Constant> > m_constants;
::std::map< RcString, ImplEnt< ::HIR::Static> > m_statics;
::std::map< RcString, ImplEnt< ::HIR::TypeRef> > m_types;
::HIR::SimplePath m_src_module;
//
//const TraitImpl* m_parent_spec_impl;
bool matches_type(const ::HIR::TypeRef& tr, t_cb_resolve_type ty_res) const;
bool matches_type(const ::HIR::TypeRef& tr) const {
return matches_type(tr, [](const auto& x)->const auto&{ return x; });
}
bool more_specific_than(const TraitImpl& x) const;
bool overlaps_with(const Crate& crate, const TraitImpl& other) const;
};
class MarkerImpl
{
public:
::HIR::GenericParams m_params;
::HIR::PathParams m_trait_args;
bool is_positive;
::HIR::TypeRef m_type;
::HIR::SimplePath m_src_module;
bool matches_type(const ::HIR::TypeRef& tr, t_cb_resolve_type ty_res) const;
bool matches_type(const ::HIR::TypeRef& tr) const {
return matches_type(tr, [](const auto& x)->const auto&{ return x; });
}
};
class ExternCrate
{
public:
::HIR::CratePtr m_data;
::std::string m_basename; // Just the filename (serialised)
::std::string m_path; // The path used to load this crate
};
class ExternLibrary
{
public:
::std::string name;
};
class Crate
{
public:
RcString m_crate_name;
Module m_root_module;
template<typename T>
struct ImplGroup
{
typedef ::std::vector<::std::unique_ptr<T>> list_t;
::std::map<::HIR::SimplePath, list_t> named;
list_t non_named; // TODO: use a map of HIR::TypeRef::Data::Tag
list_t generic;
const list_t* get_list_for_type(const ::HIR::TypeRef& ty) const {
static list_t empty;
if( const auto* p = ty.get_sort_path() ) {
auto it = named.find(*p);
if( it != named.end() )
return &it->second;
else
return nullptr;
}
else {
// TODO: Sort these by type tag, use the `Primitive` group if `ty` is Infer
return &non_named;
}
}
list_t& get_list_for_type_mut(const ::HIR::TypeRef& ty) {
if( const auto* p = ty.get_sort_path() ) {
return named[*p];
}
else {
// TODO: Ivars match with core types
return non_named;
}
}
};
/// Impl blocks on just a type, split into three groups
// - Named type (sorted on the path)
// - Primitive types
// - Unsorted (generics, and everything before outer type resolution)
ImplGroup<::HIR::TypeImpl> m_type_impls;
/// Impl blocks
::std::map< ::HIR::SimplePath, ImplGroup<::HIR::TraitImpl> > m_trait_impls;
::std::map< ::HIR::SimplePath, ImplGroup<::HIR::MarkerImpl> > m_marker_impls;
/// Macros exported by this crate
::std::unordered_map< RcString, ::MacroRulesPtr > m_exported_macros;
/// Macros re-exported by this crate
struct MacroImport {
::HIR::SimplePath path;
//bool is_proc_macro;
};
::std::unordered_map< RcString, MacroImport > m_proc_macro_reexports;
/// Procedural macros presented
::std::vector< ::HIR::ProcMacro> m_proc_macros;
/// Language items avaliable through this crate (includes ones from loaded externs)
::std::unordered_map< ::std::string, ::HIR::SimplePath> m_lang_items;
/// Referenced crates
::std::unordered_map< RcString, ExternCrate> m_ext_crates;
/// Referenced system libraries
::std::vector<ExternLibrary> m_ext_libs;
/// Extra paths for the linker
::std::vector<::std::string> m_link_paths;
/// Method called to populate runtime state after deserialisation
/// See hir/crate_post_load.cpp
void post_load_update(const RcString& loaded_name);
const ::HIR::SimplePath& get_lang_item_path(const Span& sp, const char* name) const;
const ::HIR::SimplePath& get_lang_item_path_opt(const char* name) const;
const ::HIR::TypeItem& get_typeitem_by_path(const Span& sp, const ::HIR::SimplePath& path, bool ignore_crate_name=false, bool ignore_last_node=false) const;
const ::HIR::Trait& get_trait_by_path(const Span& sp, const ::HIR::SimplePath& path) const;
const ::HIR::Struct& get_struct_by_path(const Span& sp, const ::HIR::SimplePath& path) const;
const ::HIR::Union& get_union_by_path(const Span& sp, const ::HIR::SimplePath& path) const;
const ::HIR::Enum& get_enum_by_path(const Span& sp, const ::HIR::SimplePath& path) const;
const ::HIR::Module& get_mod_by_path(const Span& sp, const ::HIR::SimplePath& path, bool ignore_last_node=false) const;
const ::HIR::ValueItem& get_valitem_by_path(const Span& sp, const ::HIR::SimplePath& path, bool ignore_crate_name=false) const;
const ::HIR::Function& get_function_by_path(const Span& sp, const ::HIR::SimplePath& path) const;
const ::HIR::Static& get_static_by_path(const Span& sp, const ::HIR::SimplePath& path) const {
const auto& ti = this->get_valitem_by_path(sp, path);
TU_IFLET(::HIR::ValueItem, ti, Static, e,
return e;
)
else {
BUG(sp, "`static` path " << path << " didn't point to an enum");
}
}
const ::HIR::Constant& get_constant_by_path(const Span& sp, const ::HIR::SimplePath& path) const {
const auto& ti = this->get_valitem_by_path(sp, path);
TU_IFLET(::HIR::ValueItem, ti, Constant, e,
return e;
)
else {
BUG(sp, "`const` path " << path << " didn't point to an enum");
}
}
bool find_trait_impls(const ::HIR::SimplePath& path, const ::HIR::TypeRef& type, t_cb_resolve_type ty_res, ::std::function<bool(const ::HIR::TraitImpl&)> callback) const;
bool find_auto_trait_impls(const ::HIR::SimplePath& path, const ::HIR::TypeRef& type, t_cb_resolve_type ty_res, ::std::function<bool(const ::HIR::MarkerImpl&)> callback) const;
bool find_type_impls(const ::HIR::TypeRef& type, t_cb_resolve_type ty_res, ::std::function<bool(const ::HIR::TypeImpl&)> callback) const;
const ::MIR::Function* get_or_gen_mir(const ::HIR::ItemPath& ip, const ::HIR::ExprPtr& ep, const ::HIR::Function::args_t& args, const ::HIR::TypeRef& ret_ty) const;
const ::MIR::Function* get_or_gen_mir(const ::HIR::ItemPath& ip, const ::HIR::Function& fcn) const {
return get_or_gen_mir(ip, fcn.m_code, fcn.m_args, fcn.m_return);
}
const ::MIR::Function* get_or_gen_mir(const ::HIR::ItemPath& ip, const ::HIR::ExprPtr& ep, const ::HIR::TypeRef& exp_ty) const {
static ::HIR::Function::args_t s_args;
return get_or_gen_mir(ip, ep, s_args, exp_ty);
}
};
} // namespace HIR
|