From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 8719D3858D20; Wed, 23 Feb 2022 08:27:17 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 8719D3858D20 From: "jakub at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/104644] [12 Regression] ICE: SIGSEGV (infinite recursion in fold_binary_loc / fold_build2_loc / generic_simplify_NE_EXPR) Date: Wed, 23 Feb 2022 08:27:17 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: tree-optimization X-Bugzilla-Version: 12.0 X-Bugzilla-Keywords: ice-on-valid-code X-Bugzilla-Severity: normal X-Bugzilla-Who: jakub at gcc dot gnu.org X-Bugzilla-Status: ASSIGNED X-Bugzilla-Resolution: X-Bugzilla-Priority: P1 X-Bugzilla-Assigned-To: jakub at gcc dot gnu.org X-Bugzilla-Target-Milestone: 12.0 X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: Message-ID: In-Reply-To: References: Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/ Auto-Submitted: auto-generated MIME-Version: 1.0 X-BeenThere: gcc-bugs@gcc.gnu.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Gcc-bugs mailing list List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 23 Feb 2022 08:27:17 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D104644 --- Comment #4 from Jakub Jelinek --- I think the FEs rely on such trees not being folded. It is done in fold-const-call.cc, 1186 static tree 1187 fold_const_call_1 (combined_fn fn, tree type, tree arg) 1188 { 1189 machine_mode mode =3D TYPE_MODE (type); 1190 machine_mode arg_mode =3D TYPE_MODE (TREE_TYPE (arg)); 1191=20=20=20=20 1192 if (integer_cst_p (arg)) 1193 { and integer_cst_p does: 35 /* Functions that test for certain constant types, abstracting away= the 36 decision about whether to check for overflow. */ 37=20=20=20=20=20=20 38 static inline bool 39 integer_cst_p (tree t) 40 { 41 return TREE_CODE (t) =3D=3D INTEGER_CST && !TREE_OVERFLOW (t); 42 }=