diff options
| author | Richard Biener <rguenther@suse.de> | 2024-07-23 14:05:47 +0200 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2024-07-25 08:37:36 +0200 |
| commit | 09de976f9bcab1d3018d5461ea2abb8a47f20528 (patch) | |
| tree | c594843bf5bea50cf96e2be227f9cb873daf5155 /include/gdb/gdb-index.h | |
| parent | bc00de070f0b9a25f68ffddbefe516543a44bd23 (diff) | |
| download | gcc-09de976f9bcab1d3018d5461ea2abb8a47f20528.zip gcc-09de976f9bcab1d3018d5461ea2abb8a47f20528.tar.gz gcc-09de976f9bcab1d3018d5461ea2abb8a47f20528.tar.bz2 | |
Maintain complex constraint vector order during PTA solving
There's a FIXME comment in the PTA constraint solver that the vector
of complex constraints can get unsorted which can lead to duplicate
entries piling up during node unification. The following fixes this
with the assumption that delayed updates to constraints are uncommon
(otherwise re-sorting the whole vector would be more efficient).
* tree-ssa-structalias.cc (constraint_equal): Take const
reference to constraints.
(constraint_vec_find): Similar.
(solve_graph): Keep constraint vector sorted and verify
sorting with checking.
Diffstat (limited to 'include/gdb/gdb-index.h')
0 files changed, 0 insertions, 0 deletions