From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 02BCB385AC12; Thu, 2 Dec 2021 18:22:16 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 02BCB385AC12 From: "aldyh at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: =?UTF-8?B?W0J1ZyB0cmVlLW9wdGltaXphdGlvbi84MjA5MF0gQm9ndXMgd2Fy?= =?UTF-8?B?bmluZzog4oCYbWFnaWNfcOKAmSBtYXkgYmUgdXNlZCB1bmluaXRpYWxpemVk?= =?UTF-8?B?IGluIHRoaXMgZnVuY3Rpb24gWy1XbWF5YmUtdW5pbml0aWFsaXplZF0=?= Date: Thu, 02 Dec 2021 18:22:16 +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: 7.2.1 X-Bugzilla-Keywords: diagnostic, missed-optimization X-Bugzilla-Severity: normal X-Bugzilla-Who: aldyh 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 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: Thu, 02 Dec 2021 18:22:17 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D82090 --- Comment #7 from Aldy Hernandez --- (In reply to Jeffrey A. Law from comment #6) > The other is to introduce the solver into the predicate analysis pass whi= ch > starts to touch on other ideas I've had. Namely that thread discovery and > predicate analysis are closely related. ie, we could be using predicate > analysis to discover more threading opportunities and we could be using t= he > path solver to prune out infeasible paths for the uninit (and other) pass= es > by integrating path solving into predicate analysis. What you've done is > the first step in this direction. It looks like compute_control_dep_chain builds a vectors of edges indicating paths from DEF to USE. We may be able to feed a variant of this to the path solver to determine if the path is reachable. That is, without having to search for the path :). Hmm, there may be something here.=