File: recursive-lambda.cpp

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-11
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,418,840 kB
  • sloc: cpp: 5,290,826; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,898; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,913; xml: 953; cs: 573; fortran: 539
file content (38 lines) | stat: -rw-r--r-- 887 bytes parent folder | download | duplicates (18) 
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
 
// RUN: %clang_cc1 -std=c++17 -fsyntax-only -verify %s

// expected-no-diagnostics

// Check recursive instantiation of lambda does not cause assertion.
// lambda function `f` in `fun1` is instantiated twice: first
// as f(f, Number<1>), then as f(f, Number<0>). The
// LocalInstantiationScopes of these two instantiations both contain
// `f` and `i`. However, since they are not merged, clang should not
// assert for that.

template <unsigned v>
struct Number
{
   static constexpr unsigned value = v;
};

template <unsigned IBegin = 0,
          unsigned IEnd = 1>
constexpr auto fun1(Number<IBegin> = Number<0>{}, Number<IEnd>  = Number<1>{})
{
  constexpr unsigned a = 0;
  auto f = [&](auto fs, auto i) {
    if constexpr(i.value > 0)
    {
      (void)a;
      return fs(fs, Number<IBegin>{});
    }
    (void)a;
  };

  return f(f, Number<IEnd>{});
}


void fun2() {
  fun1();
}