diff options
| author | David Malcolm <dmalcolm@redhat.com> | 2021-03-11 17:43:39 -0500 |
|---|---|---|
| committer | David Malcolm <dmalcolm@redhat.com> | 2021-03-11 17:43:39 -0500 |
| commit | 3f958348e78f38d91f0611618bb909182170c0f3 (patch) | |
| tree | 4825f1b0a8f3500fb176782a3474c3bf563bb310 /gcc/ada/gcc-interface/utils.c | |
| parent | c4f8e568aa66a8461ee39d5f85c2e2d41a833b7f (diff) | |
| download | gcc-3f958348e78f38d91f0611618bb909182170c0f3.zip gcc-3f958348e78f38d91f0611618bb909182170c0f3.tar.gz gcc-3f958348e78f38d91f0611618bb909182170c0f3.tar.bz2 | |
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.
Diffstat (limited to 'gcc/ada/gcc-interface/utils.c')
0 files changed, 0 insertions, 0 deletions