lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
Open Source and information security mailing list archives
| ||
|
Message-Id: <20210221225650.33134-1-linux@roeck-us.net> Date: Sun, 21 Feb 2021 14:56:50 -0800 From: Guenter Roeck <linux@...ck-us.net> To: Kees Cook <keescook@...omium.org> Cc: Heiko Carstens <hca@...ux.ibm.com>, linux-hardening@...r.kernel.org, linux-kernel@...r.kernel.org, Guenter Roeck <linux@...ck-us.net>, Arnd Bergmann <arnd@...nel.org> Subject: [PATCH] gcc-plugins: Disable GCC_PLUGIN_CYC_COMPLEXITY for s390 Commit 334ef6ed06fa ("init/Kconfig: make COMPILE_TEST depend on !S390") disabled COMPILE_TEST for s390. At the same time, "make allmodconfig/allyesconfig" for s390 is still supported. However, it generates thousands of compiler messages such as the following, making it highly impractical to run. Cyclomatic Complexity 1 scripts/mod/devicetable-offsets.c:main Cyclomatic Complexity 1 scripts/mod/devicetable-offsets.c:_GLOBAL__sub_I_00100_0_main Since GCC_PLUGIN_CYC_COMPLEXITY is primarily used for testing, disable it when building s390 images. Cc: Arnd Bergmann <arnd@...nel.org> Cc: Heiko Carstens <hca@...ux.ibm.com> Fixes: 334ef6ed06fa ("init/Kconfig: make COMPILE_TEST depend on !S390") Signed-off-by: Guenter Roeck <linux@...ck-us.net> --- scripts/gcc-plugins/Kconfig | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/scripts/gcc-plugins/Kconfig b/scripts/gcc-plugins/Kconfig index ab9eb4cbe33a..5e9bb500f443 100644 --- a/scripts/gcc-plugins/Kconfig +++ b/scripts/gcc-plugins/Kconfig @@ -21,7 +21,7 @@ if GCC_PLUGINS config GCC_PLUGIN_CYC_COMPLEXITY bool "Compute the cyclomatic complexity of a function" if EXPERT - depends on !COMPILE_TEST # too noisy + depends on !COMPILE_TEST && !S390 # too noisy help The complexity M of a function's control flow graph is defined as: M = E - N + 2P -- 2.17.1
Powered by blists - more mailing lists