From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id C477D3858436; Wed, 24 May 2023 14:18:51 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org C477D3858436 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1684937931; bh=qYZbtk1l6KUzSny78BIIXmNixJawVJvcpbVXMYO587A=; h=From:To:Subject:Date:In-Reply-To:References:From; b=JqbpoVX+1w0SzElGgCHl+rCeLjMJu3HAgVsM7izcaSjFZmobuoP363wva9Ln8Fwmd 6j32OKw98xeK4pMRmz3Fmj14p4pwON91DRwXPJBemCGTQZj6JHMMGmRXq3YRyEPGYc jALra0adthMBTsEpm4i0A/BWmLg0XVbVBuNPWLFM= From: "jakub at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug c/102989] Implement C2x's n2763 (_BitInt) Date: Wed, 24 May 2023 14:18:50 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: c X-Bugzilla-Version: 12.0 X-Bugzilla-Keywords: X-Bugzilla-Severity: enhancement X-Bugzilla-Who: jakub at gcc dot gnu.org X-Bugzilla-Status: NEW X-Bugzilla-Resolution: X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org X-Bugzilla-Target-Milestone: --- 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 List-Id: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D102989 --- Comment #47 from Jakub Jelinek --- But then the pass effectively has to do lifetime analysis of the _BitInt(N)= for N > 128 etc. SSA_NAMEs and perform the partitioning of those SSA_NAMEs into VAR_DECLs/PARM_DECLs/RESULT_DECLs, so that we don't blow away the local sta= ck; perhaps as you wrote with some local subgraphs turned into a loop which will handle multiple operations together instead of just one operation per loop. Or just use different VAR_DECLs but stick in clobbers where they will be de= ad and hope out of ssa can merge those. Anyway, more work than I hoped. Though, perhaps it can be also done incrementally, with bare minimum first = and improvements later.=