aboutsummaryrefslogtreecommitdiff
path: root/test/Analysis/copypaste/macros.cpp
blob: db9b4c6ee2e412a85a17b87a5ed88c7527556a85 (plain) (blame)
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
56
57
58
59
60
61
62
63
64
65
66
67
// RUN: %clang_cc1 -analyze -std=c++11 -analyzer-checker=alpha.clone.CloneChecker -verify %s

// Tests that macros and non-macro clones aren't mixed into the same hash
// group. This is currently necessary as all clones in a hash group need
// to have the same complexity value. Macros have smaller complexity values
// and need to be in their own hash group.

int foo(int a) { // expected-warning{{Duplicate code detected}}
  a = a + 1;
  a = a + 1 / 1;
  a = a + 1 + 1 + 1;
  a = a + 1 - 1 + 1 + 1;
  a = a + 1 * 1 + 1 + 1 + 1;
  a = a + 1 / 1 + 1 + 1 + 1;
  return a;
}

int fooClone(int a) { // expected-note{{Similar code here}}
  a = a + 1;
  a = a + 1 / 1;
  a = a + 1 + 1 + 1;
  a = a + 1 - 1 + 1 + 1;
  a = a + 1 * 1 + 1 + 1 + 1;
  a = a + 1 / 1 + 1 + 1 + 1;
  return a;
}

// Below is the same AST as above but this time generated with macros. The
// clones below should land in their own hash group for the reasons given above.

#define ASSIGN(T, V) T = T + V

int macro(int a) { // expected-warning{{Duplicate code detected}}
  ASSIGN(a, 1);
  ASSIGN(a, 1 / 1);
  ASSIGN(a, 1 + 1 + 1);
  ASSIGN(a, 1 - 1 + 1 + 1);
  ASSIGN(a, 1 * 1 + 1 + 1 + 1);
  ASSIGN(a, 1 / 1 + 1 + 1 + 1);
  return a;
}

int macroClone(int a) { // expected-note{{Similar code here}}
  ASSIGN(a, 1);
  ASSIGN(a, 1 / 1);
  ASSIGN(a, 1 + 1 + 1);
  ASSIGN(a, 1 - 1 + 1 + 1);
  ASSIGN(a, 1 * 1 + 1 + 1 + 1);
  ASSIGN(a, 1 / 1 + 1 + 1 + 1);
  return a;
}

// FIXME: Macros with empty definitions in the AST are currently ignored.

#define EMPTY

int fooFalsePositiveClone(int a) { // expected-note{{Similar code here}}
  a = EMPTY a + 1;
  a = a + 1 / 1;
  a = a + 1 + 1 + 1;
  a = a + 1 - 1 + 1 + 1;
  a = a + 1 * 1 + 1 + 1 + 1;
  a = a + 1 / 1 + 1 + 1 + 1;
  return a;
}