RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-04-01 07:11:45 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

[SLPVectorizer] Swap the checking order of isCommutative and isConsecutiveAccess

Browse Source 
NFC

llvm-svn: 258909
This commit is contained in:
Haicheng Wu 2016-01-27 04:59:05 +00:00
parent f834c97f30
commit acc848df4e
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lib/Transforms/Vectorize/SLPVectorizer.cpp
View File

@ -1854,10 +1854,10 @@ void BoUpSLP::reorderAltShuffleOperands(ArrayRef<Value *> VL,
if (LoadInst *L1 = dyn_cast<LoadInst>(Right[j + 1])) {
Instruction *VL1 = cast<Instruction>(VL[j]);
Instruction *VL2 = cast<Instruction>(VL[j + 1]);
if (isConsecutiveAccess(L, L1, DL, *SE) && VL1->isCommutative()) {
if (VL1->isCommutative() && isConsecutiveAccess(L, L1, DL, *SE)) {
std::swap(Left[j], Right[j]);
continue;
} else if (isConsecutiveAccess(L, L1, DL, *SE) && VL2->isCommutative()) {
} else if (VL2->isCommutative() && isConsecutiveAccess(L, L1, DL, *SE)) {
std::swap(Left[j + 1], Right[j + 1]);
continue;
}
@ -1868,10 +1868,10 @@ void BoUpSLP::reorderAltShuffleOperands(ArrayRef<Value *> VL,
if (LoadInst *L1 = dyn_cast<LoadInst>(Left[j + 1])) {
Instruction *VL1 = cast<Instruction>(VL[j]);
Instruction *VL2 = cast<Instruction>(VL[j + 1]);
if (isConsecutiveAccess(L, L1, DL, *SE) && VL1->isCommutative()) {
if (VL1->isCommutative() && isConsecutiveAccess(L, L1, DL, *SE)) {
std::swap(Left[j], Right[j]);
continue;
} else if (isConsecutiveAccess(L, L1, DL, *SE) && VL2->isCommutative()) {
} else if (VL2->isCommutative() && isConsecutiveAccess(L, L1, DL, *SE)) {
std::swap(Left[j + 1], Right[j + 1]);
continue;
}