diff options
author | Sanjay Patel <spatel@rotateright.com> | 2018-10-03 15:20:58 +0000 |
---|---|---|
committer | Sanjay Patel <spatel@rotateright.com> | 2018-10-03 15:20:58 +0000 |
commit | 79dceb2903f8b6ad049b763922843dca26c6aa05 (patch) | |
tree | e31aec97effa736845d820b797c42429f1a2da75 /llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp | |
parent | 207e0217f9a4bc1593c8851a62bd42852e78abe9 (diff) | |
download | bcm5719-llvm-79dceb2903f8b6ad049b763922843dca26c6aa05.tar.gz bcm5719-llvm-79dceb2903f8b6ad049b763922843dca26c6aa05.zip |
[InstCombine] name change: foldShuffledBinop -> foldVectorBinop; NFC
This function will deal with more than shuffles with D50992, and I
have another potential per-element fold that could live here.
llvm-svn: 343692
Diffstat (limited to 'llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp')
-rw-r--r-- | llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp b/llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp index 898063871ac..a6280ec95a9 100644 --- a/llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp +++ b/llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp @@ -1535,7 +1535,7 @@ Instruction *InstCombiner::visitAnd(BinaryOperator &I) { if (SimplifyAssociativeOrCommutative(I)) return &I; - if (Instruction *X = foldShuffledBinop(I)) + if (Instruction *X = foldVectorBinop(I)) return X; // See if we can simplify any instructions used by the instruction whose sole @@ -2134,7 +2134,7 @@ Instruction *InstCombiner::visitOr(BinaryOperator &I) { if (SimplifyAssociativeOrCommutative(I)) return &I; - if (Instruction *X = foldShuffledBinop(I)) + if (Instruction *X = foldVectorBinop(I)) return X; // See if we can simplify any instructions used by the instruction whose sole @@ -2602,7 +2602,7 @@ Instruction *InstCombiner::visitXor(BinaryOperator &I) { if (SimplifyAssociativeOrCommutative(I)) return &I; - if (Instruction *X = foldShuffledBinop(I)) + if (Instruction *X = foldVectorBinop(I)) return X; if (Instruction *NewXor = foldXorToXor(I, Builder)) |