maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Test commit 

Fix typos.

llvm-svn: 349644
This commit is contained in:
Anton Afanasyev 2018-12-19 17:18:40 +00:00
parent 171f3aa012
commit ce28791e20
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -2164,7 +2164,7 @@ int BoUpSLP::getEntryCost(TreeEntry *E) {
// extractelement/ext pair. // extractelement/ext pair.
DeadCost -= TTI->getExtractWithExtendCost( DeadCost -= TTI->getExtractWithExtendCost(
Ext->getOpcode(), Ext->getType(), VecTy, i); Ext->getOpcode(), Ext->getType(), VecTy, i);
// Add back the cost of s|zext which is subtracted seperately. // Add back the cost of s|zext which is subtracted separately.
DeadCost += TTI->getCastInstrCost( DeadCost += TTI->getCastInstrCost(
Ext->getOpcode(), Ext->getType(), E->getType(), Ext); Ext->getOpcode(), Ext->getType(), E->getType(), Ext);
continue; continue;
@ -2536,13 +2536,13 @@ int BoUpSLP::getTreeCost() {
// uses. However, we should not compute the cost of duplicate sequences. // uses. However, we should not compute the cost of duplicate sequences.
// For example, if we have a build vector (i.e., insertelement sequence) // For example, if we have a build vector (i.e., insertelement sequence)
// that is used by more than one vector instruction, we only need to // that is used by more than one vector instruction, we only need to
// compute the cost of the insertelement instructions once. The redundent // compute the cost of the insertelement instructions once. The redundant
// instructions will be eliminated by CSE. // instructions will be eliminated by CSE.
// //
// We should consider not creating duplicate tree entries for gather // We should consider not creating duplicate tree entries for gather
// sequences, and instead add additional edges to the tree representing // sequences, and instead add additional edges to the tree representing
// their uses. Since such an approach results in fewer total entries, // their uses. Since such an approach results in fewer total entries,
// existing heuristics based on tree size may yeild different results. // existing heuristics based on tree size may yield different results.
// //
if (TE.NeedToGather && if (TE.NeedToGather &&
std::any_of(std::next(VectorizableTree.begin(), I + 1), std::any_of(std::next(VectorizableTree.begin(), I + 1),
@ -4269,7 +4269,7 @@ unsigned BoUpSLP::getVectorElementSize(Value *V) {
Worklist.push_back(I); Worklist.push_back(I);
// Traverse the expression tree in bottom-up order looking for loads. If we // Traverse the expression tree in bottom-up order looking for loads. If we
// encounter an instruciton we don't yet handle, we give up. // encounter an instruction we don't yet handle, we give up.
auto MaxWidth = 0u; auto MaxWidth = 0u;
auto FoundUnknownInst = false; auto FoundUnknownInst = false;
while (!Worklist.empty() && !FoundUnknownInst) { while (!Worklist.empty() && !FoundUnknownInst) {