RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-02-10 22:43:46 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Attempt to fix builds broken by r259595.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@259599 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
George Burgess IV 2016-02-02 23:15:26 +00:00
parent 02e0bb6dc6
commit e1e04cba57
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/llvm/Transforms/Utils/MemorySSA.h
View File

@ -840,7 +840,7 @@ public:
return DefIterator == Other.DefIterator;
}
typename BaseT::iterator::reference operator*() const {
BaseT::iterator::reference operator*() const {
assert(DefIterator != OriginalAccess->defs_end() &&
"Tried to access past the end of our iterator");
return CurrentPair;

2
lib/Transforms/Utils/MemorySSA.cpp
View File

@ -379,7 +379,7 @@ bool MemorySSA::dominatesUse(const MemoryAccess *Replacer,
// Since we may occur multiple times in the phi node, we have to check each
// operand to ensure Replacer dominates each operand where Replacee occurs.
for (const Use &Arg : MP->operands()) {
if (Arg != Replacee &&
if (Arg.get() != Replacee &&
!DT->dominates(Replacer->getBlock(), MP->getIncomingBlock(Arg)))
return false;
}