https://gcc.gnu.org/bugzilla/show_bug.cgi?id=82090
--- 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 which
> starts to touch on other ideas I've had. Namely that thread discovery and
>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=82090
--- Comment #6 from Jeffrey A. Law ---
I never explored the idea, but Bodik has a discussion of recording infeasible
paths in the CFG which would seem to address this issue. He was using the
concept in the context of coverage analysis -- the
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=82090
--- Comment #5 from Aldy Hernandez ---
[from the POC patch]
It seems that every missed thread (due to inability of the threader,
or due to cost restraints) is a potential false positive for the
uninit code. Perhaps what we need is a way to
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=82090
--- Comment #4 from Aldy Hernandez ---
Created attachment 51913
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=51913=edit
proof of concept to reduce uninit warnings with the path solver
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=82090
Aldy Hernandez changed:
What|Removed |Added
CC||aldyh at gcc dot gnu.org,
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=82090
Martin Sebor changed:
What|Removed |Added
Known to fail||10.2.0, 11.0, 7.3.0, 8.3.0,
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=82090
Richard Biener changed:
What|Removed |Added
Keywords||missed-optimization
