We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 33ceb2d commit 144314eCopy full SHA for 144314e
llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp
@@ -5854,13 +5854,8 @@ void BoUpSLP::reorderBottomToTop(bool IgnoreReorder) {
5854
}
5855
// Build a map between user nodes and their operands order to speedup
5856
// search. The graph currently does not provide this dependency directly.
5857
- for (EdgeInfo &EI : TE->UserTreeIndices) {
5858
- TreeEntry *UserTE = EI.UserTE;
5859
- auto It = Users.find(UserTE);
5860
- if (It == Users.end())
5861
- It = Users.insert({UserTE, {}}).first;
5862
- It->second.emplace_back(EI.EdgeIdx, TE);
5863
- }
+ for (EdgeInfo &EI : TE->UserTreeIndices)
+ Users[EI.UserTE].emplace_back(EI.EdgeIdx, TE);
5864
5865
// Erase filtered entries.
5866
for (TreeEntry *TE : Filtered)
0 commit comments