diff options
author | Connor Abbott <[email protected]> | 2015-11-14 20:20:42 -0500 |
---|---|---|
committer | Connor Abbott <[email protected]> | 2016-02-02 14:42:32 -0500 |
commit | 8fc2f652a29c7c307b9a076bbda4a5fce5e93361 (patch) | |
tree | 5177e87a0d329564a343bed7e8b630eb2fbf76e1 /docs/relnotes/10.3.5.html | |
parent | bd97b62525e2d58870619b941d43c4545f922a2f (diff) |
util/set: don't compare against deleted entries
When we delete entries in the hash set, we mark them "deleted" by
setting their key to the deleted_key, which points to a dummy
deleted_key_value. When searching for an entry, we normally skip over
those, but set_add() had some code for searching for duplicate entries
which forgot to skip over deleted entries. This led to a segfault inside
the NIR vectorization pass, since its key comparison function
interpreted the memory where deleted_key_value resides as a pointer and
tried to dereference it.
v2:
- add better commit message (Timothy)
- use entry_is_deleted (Timothy)
Reviewed-by: Timothy Arceri <[email protected]>
Signed-off-by: Connor Abbott <[email protected]>
Diffstat (limited to 'docs/relnotes/10.3.5.html')
0 files changed, 0 insertions, 0 deletions