diff options
author | Zach van Rijn <me@zv.io> | 2023-05-12 14:56:42 -0500 |
---|---|---|
committer | Zach van Rijn <me@zv.io> | 2023-05-12 15:29:36 -0500 |
commit | d4cc0e8d5a0e29e9b66e7058c180a7aa9b2cdac7 (patch) | |
tree | ef6f0e994d734ce1b9b71811a33d8232692f9ba9 /user/llvm14 | |
parent | 55f95de5e74e22cfab0d73726fd323859924f6d7 (diff) | |
download | packages-d4cc0e8d5a0e29e9b66e7058c180a7aa9b2cdac7.tar.gz packages-d4cc0e8d5a0e29e9b66e7058c180a7aa9b2cdac7.tar.bz2 packages-d4cc0e8d5a0e29e9b66e7058c180a7aa9b2cdac7.tar.xz packages-d4cc0e8d5a0e29e9b66e7058c180a7aa9b2cdac7.zip |
remove erroneous files. fixes #828.
Diffstat (limited to 'user/llvm14')
-rw-r--r-- | user/llvm14/scc-insertion.patch | 33 |
1 files changed, 0 insertions, 33 deletions
diff --git a/user/llvm14/scc-insertion.patch b/user/llvm14/scc-insertion.patch deleted file mode 100644 index b2d7d511a..000000000 --- a/user/llvm14/scc-insertion.patch +++ /dev/null @@ -1,33 +0,0 @@ -From f7e9f4f4c50245d10ca9869a9f8f3d431dfb6948 Mon Sep 17 00:00:00 2001 -From: Warren Ristow <warren_ristow@playstation.sony.com> -Date: Tue, 14 Jan 2020 10:30:24 -0800 -Subject: [PATCH] SCC: Allow ReplaceNode to safely support insertion - -If scc_iterator::ReplaceNode is inserting a new entry in the map, -rather than replacing an existing entry, the possibility of growing -the map could cause a failure. This change safely implements the -insertion. - -Reviewed By: probinson - -Differential Revision: https://reviews.llvm.org/D72469 ---- - include/llvm/ADT/SCCIterator.h | 5 ++++- - 1 file changed, 4 insertions(+), 1 deletion(-) - -diff --git a/include/llvm/ADT/SCCIterator.h b/include/llvm/ADT/SCCIterator.h -index eb1a5d0938cf..1e642b9f75d3 100644 ---- a/include/llvm/ADT/SCCIterator.h -+++ b/include/llvm/ADT/SCCIterator.h -@@ -134,7 +134,10 @@ class scc_iterator : public iterator_facade_base< - /// has been deleted, and \c New is to be used in its place. - void ReplaceNode(NodeRef Old, NodeRef New) { - assert(nodeVisitNumbers.count(Old) && "Old not in scc_iterator?"); -- nodeVisitNumbers[New] = nodeVisitNumbers[Old]; -+ // Do the assignment in two steps, in case 'New' is not yet in the map, and -+ // inserting it causes the map to grow. -+ auto tempVal = nodeVisitNumbers[Old]; -+ nodeVisitNumbers[New] = tempVal; - nodeVisitNumbers.erase(Old); - } - }; |