the thunk template for a generic lambda. */
if (CALL_FROM_THUNK_P (t))
{
+ /* Now that we've expanded any packs, the number of call args
+ might be different. */
+ unsigned int cargs = call_args->length ();
tree thisarg = NULL_TREE;
if (TREE_CODE (function) == COMPONENT_REF)
{
/* We aren't going to do normal overload resolution, so force the
template-id to resolve. */
function = resolve_nondeduced_context (function, complain);
- for (unsigned i = 0; i < nargs; ++i)
+ for (unsigned i = 0; i < cargs; ++i)
{
/* In a thunk, pass through args directly, without any
conversions. */
}
if (thisarg)
{
- /* Shift the other args over to make room. */
- tree last = (*call_args)[nargs - 1];
- vec_safe_push (call_args, last);
- for (int i = nargs-1; i > 0; --i)
- (*call_args)[i] = (*call_args)[i-1];
- (*call_args)[0] = thisarg;
+ /* If there are no other args, just push 'this'. */
+ if (cargs == 0)
+ vec_safe_push (call_args, thisarg);
+ else
+ {
+ /* Otherwise, shift the other args over to make room. */
+ tree last = (*call_args)[cargs - 1];
+ vec_safe_push (call_args, last);
+ for (int i = cargs - 1; i > 0; --i)
+ (*call_args)[i] = (*call_args)[i - 1];
+ (*call_args)[0] = thisarg;
+ }
}
ret = build_call_a (function, call_args->length (),
call_args->address ());
--- /dev/null
+// PR c++/90548
+// { dg-do compile { target c++14 } }
+
+struct S { S (void ()); };
+S foo([] (auto...) { });
+S foo2{[] (auto...) {}};
+S foo3 = {[] (auto...) {}};
+
+struct W { W(void (int)); };
+W bar([](auto...) { });
+W bar2{[](auto...) { }};
+W bar3 = {[](auto...) { }};
+
+struct T { T(void (int, int)); };
+T qux([](auto...) { });
+T qux2{[](auto...) { }};
+T qux3 = {[](auto...) { }};
+
+struct R { R(void (int, int, int, int, int, int, int, int, int, int)); };
+R baz([](auto...) { });
+R baz2{[](auto...) { }};
+R baz3 = {[](auto...) { }};