File: gcov-complex-line.c

package info (click to toggle)
swiftlang 6.1.3-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 2,791,532 kB
  • sloc: cpp: 9,901,743; ansic: 2,201,431; asm: 1,091,827; python: 308,252; objc: 82,166; f90: 80,126; lisp: 38,358; pascal: 25,559; sh: 20,429; ml: 5,058; perl: 4,745; makefile: 4,484; awk: 3,535; javascript: 3,018; xml: 918; fortran: 664; cs: 573; ruby: 396
file content (55 lines) | stat: -rw-r--r-- 1,241 bytes parent folder | download | duplicates (19) 
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
 
// This test checks that the cycle detection algorithm in llvm-cov is able to
// handle complex block graphs by skipping zero count cycles.
//
// RUN: mkdir -p %t.dir && cd %t.dir
// RUN: %clang --coverage %s -o %t -dumpdir ./
// RUN: rm -f gcov-complex-line.gcda && %run %t
// RUN: llvm-cov gcov -t gcov-complex-line.c | FileCheck %s

#define M_0     \
  do {          \
    if (x == 0) \
      x = 0;    \
    else        \
      x = 1;    \
  } while (0)
#define M_1 \
  do {      \
    M_0;    \
    M_0;    \
    M_0;    \
    M_0;    \
  } while (0)
#define M_2 \
  do {      \
    M_1;    \
    M_1;    \
    M_1;    \
    M_1;    \
  } while (0)
#define M_3 \
  do {      \
    M_2;    \
    M_2;    \
    M_2;    \
    M_2;    \
  } while (0)
#define M_4 \
  do {      \
    M_3;    \
    M_3;    \
    M_3;    \
    M_3;    \
  } while (0)
#define COMPLEX_LINE              \
  do {                            \
    for (int i = 0; i < 100; ++i) \
      M_4;                        \
  } while (0)

int main() {
  volatile int x = 0;
  // In the following line, the number of cycles in the block graph is at least
  // 2^256, where 256 is the number of expansions of M_0.
  COMPLEX_LINE; // CHECK: 101: [[#@LINE]]: COMPLEX_LINE;
}