https://gcc.gnu.org/bugzilla/show_bug.cgi?id=124462
--- Comment #4 from GCC Commits <cvs-commit at gcc dot gnu.org> --- The master branch has been updated by Jorgen Kvalsvik <[email protected]>: https://gcc.gnu.org/g:a68d8098393b14a3a175105c201ff8484fbdf8fb commit r16-8078-ga68d8098393b14a3a175105c201ff8484fbdf8fb Author: Jørgen Kvalsvik <[email protected]> Date: Fri Mar 13 10:45:26 2026 +0100 Count non-complex incoming edges [PR124462] This is really a gcov/instrumentation bug, but it was filed under ipa. We did filter out incoming complex edges, but didn't account for the case where a block has multiple incoming edges without actually being a conditional outcome. We also need to check that we have >= 2 incoming edges after filtering out the complex ones to make sure it is a (short circuiting) before we try to compute the masking table. PR ipa/124462 gcc/ChangeLog: * tree-profile.cc (masking_vectors): Skip blocks with less than 2 non-complex incoming edges. gcc/testsuite/ChangeLog: * g++.dg/gcov/pr124462.C: New test.
