2016-08-20 18:06:59 +08:00
|
|
|
// RUN: %clang_cc1 -analyze -std=c++11 -analyzer-checker=alpha.clone.CloneChecker -analyzer-config alpha.clone.CloneChecker:MinimumCloneComplexity=10 -verify %s
|
|
|
|
|
|
|
|
// Tests that the complexity value of a macro expansion is about the same as
|
|
|
|
// the complexity value of a normal function call and the the macro body doesn't
|
|
|
|
// influence the complexity. See the CloneSignature class in CloneDetection.h
|
|
|
|
// for more information about complexity values of clones.
|
|
|
|
|
|
|
|
#define MACRO_FOO(a, b) a > b ? -a * a : -b * b;
|
|
|
|
|
|
|
|
// First, manually apply MACRO_FOO and see if the code gets detected as a clone.
|
|
|
|
// This confirms that with the current configuration the macro body would be
|
|
|
|
// considered large enough to pass the MinimumCloneComplexity constraint.
|
|
|
|
|
2016-10-04 10:40:35 +08:00
|
|
|
int manualMacro(int a, int b) { // expected-warning{{Detected code clone.}}
|
2016-08-20 18:06:59 +08:00
|
|
|
return a > b ? -a * a : -b * b;
|
|
|
|
}
|
|
|
|
|
2016-10-04 10:40:35 +08:00
|
|
|
int manualMacroClone(int a, int b) { // expected-note{{Related code clone is here.}}
|
2016-08-20 18:06:59 +08:00
|
|
|
return a > b ? -a * a : -b * b;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now we actually use the macro to generate the same AST as above. They
|
|
|
|
// shouldn't be reported because the macros only slighly increase the complexity
|
|
|
|
// value and the resulting code will never pass the MinimumCloneComplexity
|
|
|
|
// constraint.
|
|
|
|
|
|
|
|
int macro(int a, int b) {
|
|
|
|
return MACRO_FOO(a, b);
|
|
|
|
}
|
|
|
|
|
|
|
|
int macroClone(int a, int b) {
|
|
|
|
return MACRO_FOO(a, b);
|
|
|
|
}
|
|
|
|
|
|
|
|
// So far we only tested that macros increase the complexity by a lesser amount
|
|
|
|
// than normal code. We also need to be sure this amount is not zero because
|
|
|
|
// we otherwise macro code would be 'invisible' for the CloneDetector.
|
|
|
|
// This tests that it is possible to increase the reach the minimum complexity
|
|
|
|
// by only using macros. This is only possible if the complexity value is bigger
|
|
|
|
// than zero.
|
|
|
|
|
|
|
|
#define NEG(A) -(A)
|
|
|
|
|
2016-10-04 10:40:35 +08:00
|
|
|
int nestedMacros() { // expected-warning{{Detected code clone.}}
|
2016-08-20 18:06:59 +08:00
|
|
|
return NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(1))))))))));
|
|
|
|
}
|
|
|
|
|
2016-10-04 10:40:35 +08:00
|
|
|
int nestedMacrosClone() { // expected-note{{Related code clone is here.}}
|
2016-08-20 18:06:59 +08:00
|
|
|
return NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(1))))))))));
|
|
|
|
}
|