head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.4 netbsd-11-0-RC3:1.1.1.4 netbsd-11-0-RC2:1.1.1.4 netbsd-11-0-RC1:1.1.1.4 perseant-exfatfs-base-20250801:1.1.1.4 netbsd-11:1.1.1.4.0.10 netbsd-11-base:1.1.1.4 netbsd-10-1-RELEASE:1.1.1.4 perseant-exfatfs-base-20240630:1.1.1.4 perseant-exfatfs:1.1.1.4.0.8 perseant-exfatfs-base:1.1.1.4 netbsd-8-3-RELEASE:1.1.1.1 netbsd-9-4-RELEASE:1.1.1.3 netbsd-10-0-RELEASE:1.1.1.4 netbsd-10-0-RC6:1.1.1.4 netbsd-10-0-RC5:1.1.1.4 netbsd-10-0-RC4:1.1.1.4 netbsd-10-0-RC3:1.1.1.4 netbsd-10-0-RC2:1.1.1.4 netbsd-10-0-RC1:1.1.1.4 netbsd-10:1.1.1.4.0.6 netbsd-10-base:1.1.1.4 netbsd-9-3-RELEASE:1.1.1.3 cjep_sun2x:1.1.1.4.0.4 cjep_sun2x-base:1.1.1.4 cjep_staticlib_x-base1:1.1.1.4 netbsd-9-2-RELEASE:1.1.1.3 cjep_staticlib_x:1.1.1.4.0.2 cjep_staticlib_x-base:1.1.1.4 netbsd-9-1-RELEASE:1.1.1.3 phil-wifi-20200421:1.1.1.4 phil-wifi-20200411:1.1.1.4 phil-wifi-20200406:1.1.1.4 netbsd-8-2-RELEASE:1.1.1.1 netbsd-9-0-RELEASE:1.1.1.3 netbsd-9-0-RC2:1.1.1.3 netbsd-9-0-RC1:1.1.1.3 netbsd-9:1.1.1.3.0.2 netbsd-9-base:1.1.1.3 phil-wifi-20190609:1.1.1.3 netbsd-8-1-RELEASE:1.1.1.1 netbsd-8-1-RC1:1.1.1.1 pgoyette-compat-merge-20190127:1.1.1.2.2.1 pgoyette-compat-20190127:1.1.1.3 pgoyette-compat-20190118:1.1.1.3 pgoyette-compat-1226:1.1.1.3 pgoyette-compat-1126:1.1.1.3 pgoyette-compat-1020:1.1.1.3 pgoyette-compat-0930:1.1.1.3 pgoyette-compat-0906:1.1.1.3 pgoyette-compat-0728:1.1.1.3 clang-337282:1.1.1.3 netbsd-8-0-RELEASE:1.1.1.1 phil-wifi:1.1.1.2.0.4 phil-wifi-base:1.1.1.2 pgoyette-compat-0625:1.1.1.2 netbsd-8-0-RC2:1.1.1.1 pgoyette-compat-0521:1.1.1.2 pgoyette-compat-0502:1.1.1.2 pgoyette-compat-0422:1.1.1.2 netbsd-8-0-RC1:1.1.1.1 pgoyette-compat-0415:1.1.1.2 pgoyette-compat-0407:1.1.1.2 pgoyette-compat-0330:1.1.1.2 pgoyette-compat-0322:1.1.1.2 pgoyette-compat-0315:1.1.1.2 pgoyette-compat:1.1.1.2.0.2 pgoyette-compat-base:1.1.1.2 clang-319952:1.1.1.2 matt-nb8-mediatek:1.1.1.1.0.12 matt-nb8-mediatek-base:1.1.1.1 clang-309604:1.1.1.2 perseant-stdc-iso10646:1.1.1.1.0.10 perseant-stdc-iso10646-base:1.1.1.1 netbsd-8:1.1.1.1.0.8 netbsd-8-base:1.1.1.1 prg-localcount2-base3:1.1.1.1 prg-localcount2-base2:1.1.1.1 prg-localcount2-base1:1.1.1.1 prg-localcount2:1.1.1.1.0.6 prg-localcount2-base:1.1.1.1 pgoyette-localcount-20170426:1.1.1.1 bouyer-socketcan-base1:1.1.1.1 pgoyette-localcount:1.1.1.1.0.4 pgoyette-localcount-20170320:1.1.1.1 clang-294123:1.1.1.1 bouyer-socketcan:1.1.1.1.0.2 bouyer-socketcan-base:1.1.1.1 clang-291444:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.1 date 2017.01.11.10.37.30; author joerg; state Exp; branches 1.1.1.1; next ; commitid CNnUNfII1jgNmxBz; 1.1.1.1 date 2017.01.11.10.37.30; author joerg; state Exp; branches 1.1.1.1.4.1; next 1.1.1.2; commitid CNnUNfII1jgNmxBz; 1.1.1.2 date 2017.08.01.19.34.41; author joerg; state Exp; branches 1.1.1.2.2.1 1.1.1.2.4.1; next 1.1.1.3; commitid pMuDy65V0VicSx1A; 1.1.1.3 date 2018.07.17.18.31.47; author joerg; state Exp; branches; next 1.1.1.4; commitid wDzL46ALjrCZgwKA; 1.1.1.4 date 2019.11.13.22.19.40; author joerg; state dead; branches; next ; commitid QD8YATxuNG34YJKB; 1.1.1.1.4.1 date 2017.01.11.10.37.30; author pgoyette; state dead; branches; next 1.1.1.1.4.2; commitid jjw7cAwgyKq7RfKz; 1.1.1.1.4.2 date 2017.03.20.06.52.48; author pgoyette; state Exp; branches; next ; commitid jjw7cAwgyKq7RfKz; 1.1.1.2.2.1 date 2018.07.28.04.33.30; author pgoyette; state Exp; branches; next ; commitid 1UP1xAIUxv1ZgRLA; 1.1.1.2.4.1 date 2019.06.10.21.45.36; author christos; state Exp; branches; next 1.1.1.2.4.2; commitid jtc8rnCzWiEEHGqB; 1.1.1.2.4.2 date 2020.04.13.07.46.52; author martin; state dead; branches; next ; commitid X01YhRUPVUDaec4C; desc @@ 1.1 log @Initial revision @ text @// 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. int manualMacro(int a, int b) { // expected-warning{{Duplicate code detected}} return a > b ? -a * a : -b * b; } int manualMacroClone(int a, int b) { // expected-note{{Similar code here}} 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) int nestedMacros() { // expected-warning{{Duplicate code detected}} return NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(1)))))))))); } int nestedMacrosClone() { // expected-note{{Similar code here}} return NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(1)))))))))); } @ 1.1.1.1 log @Import Clang pre-4.0.0 r291444. @ text @@ 1.1.1.2 log @Import clang r309604 from branches/release_50 @ text @d1 1 a1 1 // RUN: %clang_analyze_cc1 -std=c++11 -analyzer-checker=alpha.clone.CloneChecker -analyzer-config alpha.clone.CloneChecker:MinimumCloneComplexity=10 -verify %s @ 1.1.1.2.4.1 log @Sync with HEAD @ text @d4 1 a4 1 // the complexity value of a normal function call and the macro body doesn't d23 1 a23 1 // shouldn't be reported because the macros only slightly increase the complexity @ 1.1.1.2.4.2 log @Mostly merge changes from HEAD upto 20200411 @ text @@ 1.1.1.2.2.1 log @Sync with HEAD @ text @d4 1 a4 1 // the complexity value of a normal function call and the macro body doesn't d23 1 a23 1 // shouldn't be reported because the macros only slightly increase the complexity @ 1.1.1.3 log @Import clang r337282 from trunk @ text @d4 1 a4 1 // the complexity value of a normal function call and the macro body doesn't d23 1 a23 1 // shouldn't be reported because the macros only slightly increase the complexity @ 1.1.1.4 log @Mark old LLVM instance as dead. @ text @@ 1.1.1.1.4.1 log @file macro-complexity.cpp was added on branch pgoyette-localcount on 2017-03-20 06:52:48 +0000 @ text @d1 50 @ 1.1.1.1.4.2 log @Sync with HEAD @ text @a0 50 // 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. int manualMacro(int a, int b) { // expected-warning{{Duplicate code detected}} return a > b ? -a * a : -b * b; } int manualMacroClone(int a, int b) { // expected-note{{Similar code here}} 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) int nestedMacros() { // expected-warning{{Duplicate code detected}} return NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(1)))))))))); } int nestedMacrosClone() { // expected-note{{Similar code here}} return NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(NEG(1)))))))))); } @