forked from OSchip/llvm-project
Switch SROA to pop Uses off the back of its visitors' queues.
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. llvm-svn: 169697
This commit is contained in:
parent
6bb5c06e17
commit
93ff2447ec
|
@ -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()));
|
||||
}
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue