RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 19:23:23 +01:00
Code Issues Projects Releases Wiki Activity

IR: Create the use-list order shuffle vector in-place

Browse Source 
Per David Blaikie's review of r214135, this is a more natural way to
initialize.

llvm-svn: 214184
This commit is contained in:
Duncan P. N. Exon Smith 2014-07-29 16:58:18 +00:00
parent 0e75ee1f72
commit 8013451450
1 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
lib/Bitcode/Writer/ValueEnumerator.cpp
View File

@ -136,11 +136,10 @@ static void predictValueUseListOrderImpl(const Value *V, const Function *F,
return;
// Store the shuffle.
UseListOrder O(V, F, List.size());
assert(List.size() == O.Shuffle.size() && "Wrong size");
Stack.emplace_back(V, F, List.size());
assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
for (size_t I = 0, E = List.size(); I != E; ++I)
O.Shuffle[I] = List[I].second;
Stack.emplace_back(std::move(O));
Stack.back().Shuffle[I] = List[I].second;
}
static void predictValueUseListOrder(const Value *V, const Function *F,