RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-02 08:46:37 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Switch SROA to pop Uses off the back of its visitors' queues.

Browse Source 
This will more closely match the behavior of the new PtrUseVisitor that
I am adding. Hopefully this will not change the actual behavior in any
way, but by making the processing order more similar help in debugging.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@169697 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chandler Carruth 2012-12-09 11:56:01 +00:00
parent f81093a826
commit 0da9175d90
1 changed files with 8 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
lib/Transforms/Scalar/SROA.cpp
View File

@ -522,11 +522,10 @@ public:
/// \brief Run the builder over the allocation.
bool operator()() {
// Note that we have to re-evaluate size on each trip through the loop as
// the queue grows at the tail.
for (unsigned Idx = 0; Idx < Queue.size(); ++Idx) {
U = Queue[Idx].U;
Offset = Queue[Idx].Offset;
while (!Queue.empty()) {
U = Queue.back().U;
Offset = Queue.back().Offset;
Queue.pop_back();
if (!visit(cast<Instruction>(U->getUser())))
return false;
}
@ -851,11 +850,10 @@ public:
/// \brief Run the builder over the allocation.
void operator()() {
// Note that we have to re-evaluate size on each trip through the loop as
// the queue grows at the tail.
for (unsigned Idx = 0; Idx < Queue.size(); ++Idx) {
U = Queue[Idx].U;
Offset = Queue[Idx].Offset;
while (!Queue.empty()) {
U = Queue.back().U;
Offset = Queue.back().Offset;
Queue.pop_back();
this->visit(cast<Instruction>(U->getUser()));
}
}