+2019-04-17 Jason Merrill <jason@redhat.com>
+
+ PR c++/90047 - ICE with enable_if alias template.
+ * pt.c (tsubst_decl) [TYPE_DECL]: Don't put an erroneous decl in the
+ hash table when we're in SFINAE context.
+
2019-04-17 Marek Polacek <polacek@redhat.com>
PR c++/90124 - bogus error with incomplete type in decltype.
DECL_TEMPLATE_INFO (r) = build_template_info (tmpl, argvec);
SET_DECL_IMPLICIT_INSTANTIATION (r);
- register_specialization (r, gen_tmpl, argvec, false, hash);
+ if (!error_operand_p (r) || (complain & tf_error))
+ register_specialization (r, gen_tmpl, argvec, false, hash);
}
else
{
--- /dev/null
+// PR c++/90047
+// { dg-do compile { target c++11 } }
+
+template <int a> struct b { static constexpr int c = a; };
+template <typename> struct aa;
+template <typename...> struct d;
+template <typename e, typename f, typename g, typename... h>
+struct d<e, f, g, h...> : aa<e>::i {};
+template <typename> struct j;
+template <typename k, long l> struct j<k[l]> : b<true> {};
+struct m {
+ typedef b<0> i;
+};
+template <typename> struct n : m::i {};
+template <bool> struct o;
+template <typename p> struct aa { typedef p i; };
+template <bool ab> using ac = typename o<ab>::i; // { dg-error "incomplete" }
+class q {
+ template <typename k, typename> using ad = ac<d<n<k>, int, int>::c>;
+ template <typename k, typename = ad<k, void>> q(k &);
+};
+template <typename r> struct s {
+ s(r) { t; }
+ template <ac<!j<r>::c> *> void t();
+};
+class I {
+ friend char operator<<(char p1, I p2) { return p1 << p2; }
+ q ag;
+};
+int main() { s<char[10]> a = (char *)""; }
sort( a.begin(), a.end(),
pointer_to_binary_function<const Expr<int>, const Expr<int>, bool>(compare<>) );
}
+
+// { dg-prune-output "enable_if" }
s / x; // { dg-error "no match" }
s % x; // { dg-error "no match" }
}
+
+// { dg-prune-output "enable_if" }
std::from_chars(first, last, c32); // { dg-error "no matching" }
std::from_chars(first, last, c32, 10); // { dg-error "no matching" }
}
+
+// { dg-prune-output "enable_if" }
std::from_chars(first, last, c32); // { dg-error "no matching" }
std::from_chars(first, last, c32, 10); // { dg-error "no matching" }
}
+
+// { dg-prune-output "enable_if" }
}
// { dg-prune-output "cannot convert" }
+// { dg-prune-output "enable_if" }
std::shared_ptr<B> b;
a = b; // { dg-error "no match" }
}
+
+// { dg-prune-output "enable_if" }
return 0;
}
// { dg-prune-output "initializing argument" }
+// { dg-prune-output "enable_if" }
std::to_chars(first, last, U'\x1'); // { dg-error "no matching" }
std::to_chars(first, last, U'\x1', 10); // { dg-error "no matching" }
}
+
+// { dg-prune-output "enable_if" }
std::get<6>(const_cast<const test_type&>(t)); // { dg-error "no match" }
std::get<6>(static_cast<test_type&&>(t)); // { dg-error "no match" }
}
+
+// { dg-prune-output "no type named .type" }
test02();
return 0;
}
+
+// { dg-prune-output "enable_if" }
std::unique_ptr<const volatile A[]> cvA3;
cvA3.reset(p); // { dg-error "no matching function" }
}
+
+// { dg-prune-output "enable_if" }
std::deque<A> d;
d.assign(10, 1); // { dg-error "no match|here" }
}
+
+// { dg-prune-output "iterator_traits" }
{
std::deque<std::deque<int> > d(10, 1); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
{
std::deque<std::deque<std::pair<char, char> > > d('a', 'b'); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
std::deque<A> d;
d.insert(d.begin(), 10, 1); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
test_type l;
l.assign(10, 1); // { dg-error "no matching" }
}
+
+// { dg-prune-output "iterator_traits" }
typedef std::forward_list<std::forward_list<int> > test_type;
test_type l(10, 1); // { dg-error "no matching" }
}
+
+// { dg-prune-output "iterator_traits" }
typedef std::forward_list<std::forward_list<std::pair<char, char> > > test_type;
test_type l('a', 'b'); // { dg-error "no matching" }
}
+
+// { dg-prune-output "iterator_traits" }
test_type l;
l.insert_after(l.begin(), 10, 1); // { dg-error "no matching" }
}
+
+// { dg-prune-output "iterator_traits" }
list_type l;
l.assign(10, 1); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
typedef std::list<std::list<int> > list_type;
list_type l(10, 1); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
typedef std::list<std::list<std::pair<char, char> > > list_type;
list_type l('a', 'b'); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
list_type l;
l.insert(l.begin(), 10, 1); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
std::vector<A> v;
v.assign(10, 1); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
{
std::vector<std::vector<int> > v(10, 1); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
{
std::vector<std::vector<std::pair<char, char> > > v('a', 'b'); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
std::vector<A> v;
v.insert(v.begin(), 10, 1); // { dg-error "here|no match" }
}
+
+// { dg-prune-output "iterator_traits" }
test02();
return 0;
}
+
+// { dg-prune-output "enable_if" }
B * const b = nullptr;
std::experimental::shared_ptr<A[]> p(b); // { dg-error "no match" }
}
+
+// { dg-prune-output "enable_if" }
p1.reset(new constA[5]); // { dg-error "no matching function" }
p1.reset(new constA[5], D()); // { dg-error "no matching function" }
}
+
+// { dg-prune-output "enable_if" }
projects / gcc.git / commitdiff