[Bug analyzer/96374] Analyzer erroneously rejects certain diagnostics due to path-feasibility being used on shortest path

[cvs-commit at gcc dot gnu.org via Gcc-bugs]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96374

--- Comment #6 from CVS Commits <cvs-commit at gcc dot gnu.org> ---
The master branch has been updated by David Malcolm <dmalc...@gcc.gnu.org>:

https://gcc.gnu.org/g:3f958348e78f38d91f0611618bb909182170c0f3

commit r11-7638-g3f958348e78f38d91f0611618bb909182170c0f3
Author: David Malcolm <dmalc...@redhat.com>
Date:   Thu Mar 11 17:43:39 2021 -0500

    analyzer: gracefully handle impossible paths in shortest-paths.h

    This bulletproofs the shortest_paths code against unreachable nodes,
    gracefully handling them, rather than failing an assertion.

    I've marked this as "analyzer" as this is the only code using
    shortest-paths.h.

    This patch is required by followup work to fix PR analyzer/96374.

    gcc/ChangeLog:
            * digraph.cc (selftest::test_shortest_paths): Add test coverage
            for paths from B and C.
            * shortest-paths.h (shortest_paths::shortest_paths): Handle
            unreachable nodes, rather than asserting.