diff options
author | John Hodge <tpg@ucc.asn.au> | 2017-09-08 12:01:00 +0800 |
---|---|---|
committer | John Hodge <tpg@ucc.asn.au> | 2017-09-08 12:01:00 +0800 |
commit | a901b985312f70e55834445038c3158af16102b9 (patch) | |
tree | aa5883bdfccd7c0414ed8a3c54f3d8cf004500a8 | |
parent | fb18453b184e16be703e543847b233a614fb39de (diff) | |
download | mrust-a901b985312f70e55834445038c3158af16102b9.tar.gz |
Typecheck - Various tweaks from librustdoc
-rw-r--r-- | src/hir/hir.cpp | 30 | ||||
-rw-r--r-- | src/hir/path.hpp | 2 | ||||
-rw-r--r-- | src/hir/type.cpp | 9 | ||||
-rw-r--r-- | src/hir_conv/bind.cpp | 4 | ||||
-rw-r--r-- | src/hir_expand/erased_types.cpp | 2 | ||||
-rw-r--r-- | src/hir_typeck/expr_cs.cpp | 6 | ||||
-rw-r--r-- | src/hir_typeck/helpers.cpp | 95 | ||||
-rw-r--r-- | src/hir_typeck/static.cpp | 4 | ||||
-rw-r--r-- | src/mir/helpers.cpp | 2 |
9 files changed, 107 insertions, 47 deletions
diff --git a/src/hir/hir.cpp b/src/hir/hir.cpp index 5b43c1c9..b913c4e3 100644 --- a/src/hir/hir.cpp +++ b/src/hir/hir.cpp @@ -132,9 +132,10 @@ namespace { // TODO: What indicates what out of ty_res? - if( right.m_data.is_Infer() ) { + if( const auto* re = right.m_data.opt_Infer() ) + { //DEBUG("left = " << left << ", right = " << right); - switch(right.m_data.as_Infer().ty_class) + switch(re->ty_class) { case ::HIR::InferClass::None: case ::HIR::InferClass::Diverge: @@ -162,20 +163,30 @@ namespace { // A local generic could match anything, leave that up to the caller if( left.m_data.is_Generic() ) { + DEBUG("> Generic left, success"); return true; } // A local UfcsKnown can only be becuase it couldn't be expanded earlier, assume it could match if( left.m_data.is_Path() && left.m_data.as_Path().path.m_data.is_UfcsKnown() ) { // True? + //DEBUG("> UFCS Unknown left, success"); return true; } // If the RHS (provided) is generic, it can only match if it binds to a local type parameter if( right.m_data.is_Generic() ) { + // TODO: This is handled above? + //DEBUG("> Generic right, only if left generic"); return left.m_data.is_Generic(); } + // If the RHS (provided) is generic, it can only match if it binds to a local type parameter + if( TU_TEST1(right.m_data, Path, .binding.is_Unbound()) ) { + //DEBUG("> UFCS Unknown right, fuzzy"); + return true; + } if( left.m_data.tag() != right.m_data.tag() ) { + //DEBUG("> Tag mismatch, failure"); return false; } TU_MATCH(::HIR::TypeRef::Data, (left.m_data, right.m_data), (le, re), @@ -272,7 +283,9 @@ namespace { return false; } - if( left.m_params.m_types.size() > 0 || right.m_params.m_types.size() > 0 ) { + if( left.m_params.m_types.size() > 0 || right.m_params.m_types.size() > 0 ) + { + // Count mismatch. Allow due to defaults. if( left.m_params.m_types.size() != right.m_params.m_types.size() ) { return true; //TODO(Span(), "Match generic paths " << left << " and " << right << " - count mismatch"); @@ -318,21 +331,22 @@ namespace { bool ::HIR::TraitImpl::matches_type(const ::HIR::TypeRef& type, ::HIR::t_cb_resolve_type ty_res) const { // NOTE: Don't return any impls when the type is an unbouned ivar. Wouldn't be able to pick anything anyway - if( is_unbounded_infer(type) ) { + // TODO: For `Unbound`, it could be valid, if the target is a generic. + if( is_unbounded_infer(type) || TU_TEST1(type.m_data, Path, .binding.is_Unbound()) ) { return false; } return matches_type_int(m_params, m_type, type, ty_res, true); } bool ::HIR::TypeImpl::matches_type(const ::HIR::TypeRef& type, ::HIR::t_cb_resolve_type ty_res) const { - if( is_unbounded_infer(type) ) { + if( is_unbounded_infer(type) || TU_TEST1(type.m_data, Path, .binding.is_Unbound()) ) { return false; } return matches_type_int(m_params, m_type, type, ty_res, true); } bool ::HIR::MarkerImpl::matches_type(const ::HIR::TypeRef& type, ::HIR::t_cb_resolve_type ty_res) const { - if( is_unbounded_infer(type) ) { + if( is_unbounded_infer(type) || TU_TEST1(type.m_data, Path, .binding.is_Unbound()) ) { return false; } return matches_type_int(m_params, m_type, type, ty_res, true); @@ -807,7 +821,7 @@ bool ::HIR::TraitImpl::overlaps_with(const Crate& crate, const ::HIR::TraitImpl& auto cb_ident = [](const ::HIR::TypeRef& x)->const ::HIR::TypeRef& { return x; }; bool is_reversed = false; ::std::vector<const ::HIR::TypeRef*> impl_tys; - auto cb_match = [&](unsigned int idx, const ::HIR::TypeRef& x)->::HIR::Compare { + auto cb_match = [&](unsigned int idx, const auto& /*name*/, const ::HIR::TypeRef& x)->::HIR::Compare { assert(idx < impl_tys.size()); if( impl_tys.at(idx) ) { @@ -943,7 +957,7 @@ bool ::HIR::TraitImpl::overlaps_with(const Crate& crate, const ::HIR::TraitImpl& ::std::vector<const ::HIR::TypeRef*> impl_tys { ti.m_params.m_types.size() }; auto cb_ident = [](const ::HIR::TypeRef& x)->const ::HIR::TypeRef& { return x; }; - auto cb_match = [&](unsigned int idx, const ::HIR::TypeRef& x)->::HIR::Compare { + auto cb_match = [&](unsigned int idx, const auto& /*name*/, const ::HIR::TypeRef& x)->::HIR::Compare { assert(idx < impl_tys.size()); if( impl_tys.at(idx) ) { diff --git a/src/hir/path.hpp b/src/hir/path.hpp index 12e32dd1..7734b657 100644 --- a/src/hir/path.hpp +++ b/src/hir/path.hpp @@ -25,7 +25,7 @@ enum Compare { }; typedef ::std::function<const ::HIR::TypeRef&(const ::HIR::TypeRef&)> t_cb_resolve_type; -typedef ::std::function< ::HIR::Compare(unsigned int, const ::HIR::TypeRef&) > t_cb_match_generics; +typedef ::std::function< ::HIR::Compare(unsigned int, const ::std::string&, const ::HIR::TypeRef&) > t_cb_match_generics; static inline ::std::ostream& operator<<(::std::ostream& os, const Compare& x) { switch(x) diff --git a/src/hir/type.cpp b/src/hir/type.cpp index c672b3bd..36f09c9c 100644 --- a/src/hir/type.cpp +++ b/src/hir/type.cpp @@ -482,11 +482,12 @@ bool ::HIR::TypeRef::match_test_generics(const Span& sp, const ::HIR::TypeRef& x } ::HIR::Compare HIR::TypeRef::match_test_generics_fuzz(const Span& sp, const ::HIR::TypeRef& x_in, t_cb_resolve_type resolve_placeholder, t_cb_match_generics callback) const { - if( m_data.is_Generic() ) { - return callback(m_data.as_Generic().binding, x_in); + if( const auto* e = m_data.opt_Generic() ) { + return callback(e->binding, e->name, x_in); } const auto& v = (this->m_data.is_Infer() ? resolve_placeholder(*this) : *this); const auto& x = (x_in.m_data.is_Infer() || x_in.m_data.is_Generic() ? resolve_placeholder(x_in) : x_in); + TRACE_FUNCTION_F(*this << ", " << x_in << " -- " << v << ", " << x); // If `x` is an ivar - This can be a fuzzy match. TU_IFLET(::HIR::TypeRef::Data, x.m_data, Infer, xe, // - If type inferrence is active (i.e. this ivar has an index), AND both `v` and `x` refer to the same ivar slot @@ -714,7 +715,9 @@ bool ::HIR::TypeRef::match_test_generics(const Span& sp, const ::HIR::TypeRef& x return cmp; ), (ErasedType, - TODO(sp, "ErasedType - match_test_generics_fuzz - " << v << " -- " << x); + if( te.m_origin != xe.m_origin ) + return Compare::Unequal; + return Compare::Equal; ), (Array, if( te.size_val != xe.size_val ) { diff --git a/src/hir_conv/bind.cpp b/src/hir_conv/bind.cpp index beac3b84..364b3a76 100644 --- a/src/hir_conv/bind.cpp +++ b/src/hir_conv/bind.cpp @@ -517,7 +517,7 @@ namespace { (Bytes, ), (StaticString, ), // String (Const, - // TODO: Should this trigger anything? + upper_visitor.visit_path(ce.p, ::HIR::Visitor::PathContext::VALUE); ), (ItemAddr, upper_visitor.visit_path(ce, ::HIR::Visitor::PathContext::VALUE); @@ -548,7 +548,7 @@ namespace { (Bytes, ), (StaticString, ), // String (Const, - // TODO: Should this trigger anything? + this->visit_path(ce.p, ::HIR::Visitor::PathContext::VALUE); ), (ItemAddr, this->visit_path(ce, ::HIR::Visitor::PathContext::VALUE); diff --git a/src/hir_expand/erased_types.cpp b/src/hir_expand/erased_types.cpp index caf42a79..22c037f8 100644 --- a/src/hir_expand/erased_types.cpp +++ b/src/hir_expand/erased_types.cpp @@ -48,7 +48,7 @@ const ::HIR::Function& HIR_Expand_ErasedType_GetFunction(const Span& sp, const S // 2. Obtain monomorph_cb (including impl params) impl_params.m_types.resize(impl_ptr->m_params.m_types.size()); - impl_ptr->m_type .match_test_generics(sp, *pe.type, [](const auto& x)->const auto&{return x;}, [&](auto idx, const auto& ty) { + impl_ptr->m_type .match_test_generics(sp, *pe.type, [](const auto& x)->const auto&{return x;}, [&](auto idx, const auto& /*name*/, const auto& ty) { assert( idx < impl_params.m_types.size() ); impl_params.m_types[idx] = ty.clone(); return ::HIR::Compare::Equal; diff --git a/src/hir_typeck/expr_cs.cpp b/src/hir_typeck/expr_cs.cpp index 48888930..44a6c80c 100644 --- a/src/hir_typeck/expr_cs.cpp +++ b/src/hir_typeck/expr_cs.cpp @@ -417,7 +417,7 @@ namespace { // Default-construct entires in the `impl_params` array impl_params.m_types.resize( impl_ptr->m_params.m_types.size() ); - auto cmp = impl_ptr->m_type.match_test_generics_fuzz(sp, *e.type, context.m_ivars.callback_resolve_infer(), [&](auto idx, const auto& ty) { + auto cmp = impl_ptr->m_type.match_test_generics_fuzz(sp, *e.type, context.m_ivars.callback_resolve_infer(), [&](auto idx, const auto& /*name*/, const auto& ty) { assert( idx < impl_params.m_types.size() ); impl_params.m_types[idx] = ty.clone(); return ::HIR::Compare::Equal; @@ -1736,7 +1736,7 @@ namespace { { impl_params.m_types.resize( impl_ptr->m_params.m_types.size() ); // NOTE: Could be fuzzy. - bool r = impl_ptr->m_type.match_test_generics(sp, *e.type, this->context.m_ivars.callback_resolve_infer(), [&](auto idx, const auto& ty) { + bool r = impl_ptr->m_type.match_test_generics(sp, *e.type, this->context.m_ivars.callback_resolve_infer(), [&](auto idx, const auto& /*name*/, const auto& ty) { assert( idx < impl_params.m_types.size() ); impl_params.m_types[idx] = ty.clone(); return ::HIR::Compare::Equal; @@ -5376,6 +5376,8 @@ namespace { // > Ideally, there should be a match_test_generics to resolve the magic impls. DEBUG("> best_impl=" << best_impl); if( best_impl.has_magic_params() ) { + // TODO: Pick this impl, and evaluate it (expanding the magic params out) + DEBUG("> Magic params present, wait"); return false; } diff --git a/src/hir_typeck/helpers.cpp b/src/hir_typeck/helpers.cpp index 8c69c38d..6665bcd1 100644 --- a/src/hir_typeck/helpers.cpp +++ b/src/hir_typeck/helpers.cpp @@ -1044,8 +1044,10 @@ bool TraitResolution::iterate_bounds( ::std::function<bool(const ::HIR::GenericB } bool TraitResolution::iterate_aty_bounds(const Span& sp, const ::HIR::Path::Data::Data_UfcsKnown& pe, ::std::function<bool(const ::HIR::TraitPath&)> cb) const { - const auto& trait_ref = m_crate.get_trait_by_path(sp, pe.trait.m_path); - ASSERT_BUG(sp, trait_ref.m_types.count( pe.item ) != 0, "Trait " << pe.trait.m_path << " doesn't contain an associated type " << pe.item); + ::HIR::GenericPath trait_path; + if( !this->trait_contains_type(sp, pe.trait, this->m_crate.get_trait_by_path(sp, pe.trait.m_path), pe.item, trait_path) ) + BUG(sp, "Cannot find associated type " << pe.item << " anywhere in trait " << pe.trait); + const auto& trait_ref = m_crate.get_trait_by_path(sp, trait_path.m_path); const auto& aty_def = trait_ref.m_types.find(pe.item)->second; for(const auto& bound : aty_def.m_trait_bounds) @@ -1979,7 +1981,11 @@ void TraitResolution::expand_associated_types_inplace__UfcsKnown(const Span& sp, TU_IFLET(::HIR::Path::Data, te_inner.path.m_data, UfcsKnown, pe_inner, // TODO: Search for equality bounds on this associated type (pe_inner) that match the entire type (pe) // - Does simplification of complex associated types - const auto& trait_ptr = this->m_crate.get_trait_by_path(sp, pe_inner.trait.m_path); + // + ::HIR::GenericPath trait_path; + if( !this->trait_contains_type(sp, pe_inner.trait, this->m_crate.get_trait_by_path(sp, pe_inner.trait.m_path), pe_inner.item, trait_path) ) + BUG(sp, "Cannot find associated type " << pe_inner.item << " anywhere in trait " << pe_inner.trait); + const auto& trait_ptr = this->m_crate.get_trait_by_path(sp, trait_path.m_path); const auto& assoc_ty = trait_ptr.m_types.at(pe_inner.item); // Resolve where Self=pe_inner.type (i.e. for the trait this inner UFCS is on) @@ -2661,10 +2667,10 @@ bool TraitResolution::find_trait_impls_crate(const Span& sp, ) const { impl_params.resize( impl_params_def.m_types.size() ); - auto cb = [&](auto idx, const auto& ty)->::HIR::Compare{ - DEBUG("[ftic_check_params] Param " << idx << " = " << ty); + auto cb_get_impl_params = [&](auto idx, const auto&, const auto& ty)->::HIR::Compare{ assert( idx < impl_params.size() ); if( ! impl_params[idx] ) { + DEBUG("[ftic_check_params] Param " << idx << " = " << ty); impl_params[idx] = &ty; return ::HIR::Compare::Equal; } @@ -2682,27 +2688,16 @@ bool TraitResolution::find_trait_impls_crate(const Span& sp, } }; - //auto cb_res = [&](const auto& ty)->const ::HIR::TypeRef& { - // if( ty.m_data.is_Infer() ) { - // return this->m_ivars.get_type(ty); - // } - // //else if( ty.m_data.is_Generic() && ty.m_data.as_Generic().binding >> 8 == 2 ) { - // // return ::HIR::TypeRef(); - // //} - // else { - // return ty; - // } - // }; // NOTE: If this type references an associated type, the match will incorrectly fail. // - HACK: match_test_generics_fuzz has been changed to return Fuzzy if there's a tag mismatch and the LHS is an Opaque path auto match = ::HIR::Compare::Equal; - match &= impl_ty.match_test_generics_fuzz(sp, type , this->m_ivars.callback_resolve_infer(), cb); + match &= impl_ty.match_test_generics_fuzz(sp, type , this->m_ivars.callback_resolve_infer(), cb_get_impl_params); if( params_ptr ) { const auto& params = *params_ptr; ASSERT_BUG(sp, impl_trait_args.m_types.size() == params.m_types.size(), "Param count mismatch between `" << impl_trait_args << "` and `" << params << "` for " << trait ); for(unsigned int i = 0; i < impl_trait_args.m_types.size(); i ++) - match &= impl_trait_args.m_types[i] .match_test_generics_fuzz(sp, params.m_types[i], this->m_ivars.callback_resolve_infer(), cb); + match &= impl_trait_args.m_types[i] .match_test_generics_fuzz(sp, params.m_types[i], this->m_ivars.callback_resolve_infer(), cb_get_impl_params); if( match == ::HIR::Compare::Unequal ) { DEBUG("- Failed to match parameters - " << impl_trait_args << "+" << impl_ty << " != " << params << "+" << type); return ::HIR::Compare::Unequal; @@ -2719,11 +2714,14 @@ bool TraitResolution::find_trait_impls_crate(const Span& sp, // TODO: Some impl blocks have type params used as part of type bounds. // - A rough idea is to have monomorph return a third class of generic for params that are not yet bound. // - compare_with_placeholders gets called on both ivars and generics, so that can be used to replace it once known. + ::std::string placeholder_name = FMT("impl_?_" << &impl_params); for(unsigned int i = 0; i < impl_params.size(); i ++ ) { if( !impl_params[i] ) { if( placeholders.size() == 0 ) placeholders.resize(impl_params.size()); - placeholders[i] = ::HIR::TypeRef("impl_?", 2*256 + i); + // TODO: Tag placeholders to indicate this frame + placeholders[i] = ::HIR::TypeRef(placeholder_name, 2*256 + i); + DEBUG("Create placeholder for " << i << " = " << placeholders[i]); } } auto cb_infer = [&](const auto& ty)->const ::HIR::TypeRef& { @@ -2751,12 +2749,17 @@ bool TraitResolution::find_trait_impls_crate(const Span& sp, else return ty; }; - auto cb_match = [&](unsigned int idx, const auto& ty)->::HIR::Compare { - if( ty.m_data.is_Generic() && ty.m_data.as_Generic().binding == idx ) - return ::HIR::Compare::Equal; - if( idx >> 8 == 2 ) { + auto cb_match = [&](unsigned idx, const auto& name, const auto& ty)->::HIR::Compare { + if( const auto* e = ty.m_data.opt_Generic() ) + { + if( e->binding == idx && e->name == name ) + { + return ::HIR::Compare::Equal; + } + } + if( idx >> 8 == 2 && name == placeholder_name ) { auto i = idx % 256; - ASSERT_BUG(sp, !impl_params[i], "Placeholder to populated type returned"); + ASSERT_BUG(sp, !impl_params[i], "Placeholder to populated type returned - " << *impl_params[i] << " vs " << ty); auto& ph = placeholders[i]; if( ph.m_data.is_Generic() && ph.m_data.as_Generic().binding == idx ) { DEBUG("[ftic_check_params:cb_match] Bind placeholder " << i << " to " << ty); @@ -2764,10 +2767,19 @@ bool TraitResolution::find_trait_impls_crate(const Span& sp, return ::HIR::Compare::Equal; } else { - TODO(sp, "[ftic_check_params:cb_match] Compare placeholder " << i << " " << ph << " == " << ty); + DEBUG("[ftic_check_params:cb_match] Compare placeholder " << i << " " << ph << " == " << ty); + return ph.compare_with_placeholders(sp, ty, cb_infer); } } else { + if( idx >> 8 == 2 ) { + DEBUG("[ftic_check_params:cb_match] External impl param " << idx << " " << name); + return ::HIR::Compare::Fuzzy; + } + // If the RHS is a non-literal ivar, return fuzzy + if( ty.m_data.is_Infer() && !ty.m_data.as_Infer().is_lit() ) { + return ::HIR::Compare::Fuzzy; + } return ::HIR::Compare::Unequal; } }; @@ -2809,8 +2821,26 @@ bool TraitResolution::find_trait_impls_crate(const Span& sp, DEBUG("- Bounded type is unbound UFCS, assuming fuzzy match"); found_fuzzy_match = true; } + // TODO: Pass the `match_test_generics` callback? Or another one that handles the impl placeholders. auto rv = this->find_trait_impls(sp, real_trait_path.m_path, real_trait_path.m_params, real_type, [&](auto impl, auto impl_cmp) { + DEBUG("[ftic_check_params] impl_cmp = " << impl_cmp << ", impl = " << impl); auto cmp = impl_cmp; +#if 1 + if( cmp == ::HIR::Compare::Fuzzy ) + { + // If the match was fuzzy, try again filling in with `cb_match` + auto i_ty = impl.get_impl_type(); + this->expand_associated_types_inplace( sp, i_ty, {} ); + auto i_tp = impl.get_trait_params(); + for(auto& t : i_tp.m_types) + this->expand_associated_types_inplace( sp, t, {} ); + DEBUG(real_type << " ?= " << i_ty); + cmp &= real_type .match_test_generics_fuzz(sp, i_ty, cb_infer, cb_match); + DEBUG(real_trait_path.m_params << " ?= " << i_tp); + cmp &= real_trait_path.m_params .match_test_generics_fuzz(sp, i_tp, cb_infer, cb_match); + DEBUG("[ftic_check_params] - Re-check result: " << cmp); + } +#endif for(const auto& assoc_bound : real_trait.m_type_bounds) { ::HIR::TypeRef tmp; const ::HIR::TypeRef* ty_p; @@ -2849,6 +2879,7 @@ bool TraitResolution::find_trait_impls_crate(const Span& sp, continue ; } } + DEBUG("[ftic_check_params] impl_cmp = " << impl_cmp << ", cmp = " << cmp); if( cmp == ::HIR::Compare::Fuzzy ) { found_fuzzy_match = true; @@ -3618,6 +3649,7 @@ bool TraitResolution::find_method( /* Out -> */::HIR::Path& fcn_path) const { TRACE_FUNCTION_F("ty=" << ty << ", name=" << method_name << ", access=" << access); + auto cb_infer = m_ivars.callback_resolve_infer(); // 1. Search generic bounds for a match // - If there is a bound on the receiver, then that bound is usable no-matter what @@ -3638,13 +3670,14 @@ bool TraitResolution::find_method( DEBUG("- Method '" << method_name << "' missing"); continue ; } - DEBUG("- Found trait " << final_trait_path); + DEBUG("- Found trait " << final_trait_path << " (bound)"); // 2. Compare the receiver of the above to this type and the bound. if(const auto* self_ty = check_method_receiver(sp, receiver, ty, access)) { // TODO: Do a fuzzy match here? - if( *self_ty == e.type ) + auto cmp = self_ty->compare_with_placeholders(sp, e.type, cb_infer); + if( cmp == ::HIR::Compare::Equal ) { // TODO: Re-monomorphise final trait using `ty`? // - Could collide with legitimate uses of `Self` @@ -3658,6 +3691,10 @@ bool TraitResolution::find_method( }) ); return true; } + else if( cmp == ::HIR::Compare::Fuzzy ) + { + TODO(sp, "Fuzzy match checking bounded method - " << *self_ty << " != " << e.type); + } else { DEBUG("> Type mismatch - " << *self_ty << " != " << e.type); @@ -3944,6 +3981,10 @@ bool TraitResolution::find_method( return true; } } + else + { + DEBUG("> Incorrect receiver"); + } } return false; diff --git a/src/hir_typeck/static.cpp b/src/hir_typeck/static.cpp index 57a93dc3..83d287b9 100644 --- a/src/hir_typeck/static.cpp +++ b/src/hir_typeck/static.cpp @@ -524,7 +524,7 @@ bool StaticTraitResolve::find_impl__check_crate_raw( ::std::vector< const ::HIR::TypeRef*> impl_params; impl_params.resize( impl_params_def.m_types.size() ); - auto cb = [&impl_params,&sp,cb_ident](auto idx, const auto& ty) { + auto cb = [&impl_params,&sp,cb_ident](auto idx, const auto& /*name*/, const auto& ty) { assert( idx < impl_params.size() ); if( ! impl_params[idx] ) { impl_params[idx] = &ty; @@ -559,7 +559,7 @@ bool StaticTraitResolve::find_impl__check_crate_raw( } } // Callback that matches placeholders to concrete types - auto cb_match = [&](unsigned int idx, const auto& ty)->::HIR::Compare { + auto cb_match = [&](unsigned int idx, const auto& /*name*/, const auto& ty)->::HIR::Compare { if( ty.m_data.is_Generic() && ty.m_data.as_Generic().binding == idx ) return ::HIR::Compare::Equal; if( idx >> 8 == 2 ) { diff --git a/src/mir/helpers.cpp b/src/mir/helpers.cpp index 10c9c780..ddab9317 100644 --- a/src/mir/helpers.cpp +++ b/src/mir/helpers.cpp @@ -296,7 +296,7 @@ const ::HIR::TypeRef& MIR::TypeResolve::get_param_type(::HIR::TypeRef& tmp, cons return ty.clone(); } else { - MIR_BUG(*this, "get_const_type - Not a constant"); + MIR_BUG(*this, "get_const_type - Not a constant " << e.p); } ), (ItemAddr, |