RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-11-28 06:00:28 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

fixed typos

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@215451 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Sanjay Patel 2014-08-12 16:00:06 +00:00
parent 8b14a499f9
commit 01c6ad07d2
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
lib/Target/X86/X86ISelLowering.cpp
View File

@ -13200,7 +13200,7 @@ static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
// correctly legalized. We do this late to allow the canonical form of // correctly legalized. We do this late to allow the canonical form of
// sextload to persist throughout the rest of the DAG combiner -- it wants // sextload to persist throughout the rest of the DAG combiner -- it wants
// to fold together any extensions it can, and so will fuse a sign_extend // to fold together any extensions it can, and so will fuse a sign_extend
// of an sextload into an sextload targeting a wider value. // of an sextload into a sextload targeting a wider value.
SDValue Load; SDValue Load;
if (MemSz == 128) { if (MemSz == 128) {
// Just switch this to a normal load. // Just switch this to a normal load.
@ -13316,7 +13316,7 @@ static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
unsigned SizeRatio = RegSz / MemSz; unsigned SizeRatio = RegSz / MemSz;
if (Ext == ISD::SEXTLOAD) { if (Ext == ISD::SEXTLOAD) {
// If we have SSE4.1 we can directly emit a VSEXT node. // If we have SSE4.1, we can directly emit a VSEXT node.
if (Subtarget->hasSSE41()) { if (Subtarget->hasSSE41()) {
SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec); SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF); DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
@ -13327,7 +13327,7 @@ static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
// larger type and perform an arithmetic shift. If the shift is not legal // larger type and perform an arithmetic shift. If the shift is not legal
// it's better to scalarize. // it's better to scalarize.
assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) && assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) &&
"We can't implement an sext load without a arithmetic right shift!"); "We can't implement a sext load without an arithmetic right shift!");
// Redistribute the loaded elements into the different locations. // Redistribute the loaded elements into the different locations.
SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1); SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
@ -13668,7 +13668,7 @@ SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
} }
// Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets. // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
// Calls to _alloca is needed to probe the stack when allocating more than 4k // Calls to _alloca are needed to probe the stack when allocating more than 4k
// bytes in one go. Touching the stack at 4K increments is necessary to ensure // bytes in one go. Touching the stack at 4K increments is necessary to ensure
// that the guard pages used by the OS virtual memory manager are allocated in // that the guard pages used by the OS virtual memory manager are allocated in
// correct sequence. // correct sequence.
@ -19137,7 +19137,7 @@ static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
/// \brief Fully generic combining of x86 shuffle instructions. /// \brief Fully generic combining of x86 shuffle instructions.
/// ///
/// This should be the last combine run over the x86 shuffle instructions. Once /// This should be the last combine run over the x86 shuffle instructions. Once
/// they have been fully optimized, this will recursively consdier all chains /// they have been fully optimized, this will recursively consider all chains
/// of single-use shuffle instructions, build a generic model of the cumulative /// of single-use shuffle instructions, build a generic model of the cumulative
/// shuffle operation, and check for simpler instructions which implement this /// shuffle operation, and check for simpler instructions which implement this
/// operation. We use this primarily for two purposes: /// operation. We use this primarily for two purposes: