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
|
/*
*/
#include "hir.hpp"
namespace HIR {
::std::ostream& operator<<(::std::ostream& os, const ::HIR::Literal& v)
{
TU_MATCH(::HIR::Literal, (v), (e),
(Invalid,
os << "!";
),
(List,
os << "[";
for(const auto& val : e)
os << " " << val << ",";
os << " ]";
),
(Integer,
os << e;
),
(Float,
os << e;
),
(String,
os << "\"" << e << "\"";
)
)
return os;
}
}
namespace {
bool matches_type_int(const ::HIR::GenericParams& params, const ::HIR::TypeRef& left, const ::HIR::TypeRef& right)
{
assert(! left.m_data.is_Infer() );
if( right.m_data.is_Infer() ) {
return false;
}
if( left.m_data.is_Generic() ) {
// True?
return true;
}
if( left.m_data.tag() != right.m_data.tag() ) {
return false;
}
TU_MATCH(::HIR::TypeRef::Data, (left.m_data, right.m_data), (le, re),
(Infer, assert(!"infer");),
(Diverge, return true; ),
(Primitive, return le == re;),
(Path,
if( le.m_data.tag() != re.m_data.tag() )
return false;
TU_MATCH_DEF(::HIR::Path::Data, (le.m_data, re.m_data), (ple, pre),
(
return false;
),
(Generic,
if( ple.m_path.m_crate_name != pre.m_path.m_crate_name )
return false;
if( ple.m_path.m_components.size() != pre.m_path.m_components.size() )
return false;
for(unsigned int i = 0; i < ple.m_path.m_components.size(); i ++ )
{
if( ple.m_path.m_components[i] != pre.m_path.m_components[i] )
return false;
}
if( ple.m_params.m_types.size() > 0 || pre.m_params.m_types.size() > 0 ) {
TODO(Span(), "Match paths " << ple << " and " << pre);
}
return true;
)
)
),
(Generic,
throw "";
),
(TraitObject,
DEBUG("TODO: Compare " << left << " and " << right);
return false;
),
(Array,
if( ! matches_type_int(params, *le.inner, *re.inner) )
return false;
if( le.size_val != re.size_val )
return false;
return true;
),
(Slice,
return matches_type_int(params, *le.inner, *re.inner);
),
(Tuple,
if( le.size() != re.size() )
return false;
for( unsigned int i = 0; i < le.size(); i ++ )
if( !matches_type_int(params, le[i], re[i]) )
return false;
return true;
),
(Borrow,
if( le.type != re.type )
return false;
return matches_type_int(params, *le.inner, *re.inner);
),
(Pointer,
if( le.is_mut != re.is_mut )
return false;
return matches_type_int(params, *le.inner, *re.inner);
),
(Function,
DEBUG("TODO: Compare " << left << " and " << right);
return false;
)
)
return false;
}
}
bool ::HIR::TraitImpl::matches_type(const ::HIR::TypeRef& type) const
{
return matches_type_int(m_params, m_type, type);
}
bool ::HIR::TypeImpl::matches_type(const ::HIR::TypeRef& type) const
{
return matches_type_int(m_params, m_type, type);
}
bool ::HIR::MarkerImpl::matches_type(const ::HIR::TypeRef& type) const
{
return matches_type_int(m_params, m_type, type);
}
|
