Fix some doc and comment typos

llvm-svn: 205899
This commit is contained in:
Alp Toker 2014-04-09 14:47:27 +00:00
parent 246b0b617d
commit 16f98b255d
20 changed files with 27 additions and 27 deletions

View File

@ -113,7 +113,7 @@ XCore
-----
* `The XMOS XS1 Architecture (ISA) <https://www.xmos.com/en/download/public/The-XMOS-XS1-Architecture%28X7879A%29.pdf>`_
* `Tools Developement Guide (includes ABI) <https://www.xmos.com/download/public/Tools-Development-Guide%28X9114A%29.pdf>`_
* `Tools Development Guide (includes ABI) <https://www.xmos.com/download/public/Tools-Development-Guide%28X9114A%29.pdf>`_
Other relevant lists
--------------------

View File

@ -6969,7 +6969,7 @@ Semantics:
On platforms with coherent instruction and data caches (e.g. x86), this
intrinsic is a nop. On platforms with non-coherent instruction and data
cache (e.g. ARM, MIPS), the intrinsic is lowered either to appropiate
cache (e.g. ARM, MIPS), the intrinsic is lowered either to appropriate
instructions or a system call, if cache flushing requires special
privileges.

View File

@ -29,12 +29,12 @@ namespace PBQP {
typedef unsigned NodeId;
typedef unsigned EdgeId;
/// \brief Returns a value representing an invalid (non-existant) node.
/// \brief Returns a value representing an invalid (non-existent) node.
static NodeId invalidNodeId() {
return std::numeric_limits<NodeId>::max();
}
/// \brief Returns a value representing an invalid (non-existant) edge.
/// \brief Returns a value representing an invalid (non-existent) edge.
static EdgeId invalidEdgeId() {
return std::numeric_limits<EdgeId>::max();
}

View File

@ -229,7 +229,7 @@ private:
/// Name of the input file associated with this diagnostic.
const char *FileName;
/// Line number where the diagnostic occured. If 0, no line number will
/// Line number where the diagnostic occurred. If 0, no line number will
/// be emitted in the message.
unsigned LineNum;

View File

@ -49,7 +49,7 @@ unsigned Use::getOperandNo() const {
return this - getUser()->op_begin();
}
// Sets up the waymarking algoritm's tags for a series of Uses. See the
// Sets up the waymarking algorithm's tags for a series of Uses. See the
// algorithm details here:
//
// http://www.llvm.org/docs/ProgrammersManual.html#UserLayout

View File

@ -59,7 +59,7 @@ def ReadFPALU : SchedRead;
// Floating Point MAC, Mul, Div, Sqrt
// Most processors will simply send all of these down a dedicated pipe, but
// they're explicitly seperated here for flexibility of modeling later. May
// they're explicitly separated here for flexibility of modeling later. May
// consider consolidating them into a single WriteFPXXXX type in the future.
def WriteFPMAC : SchedWrite;
def WriteFPMul : SchedWrite;

View File

@ -1675,7 +1675,7 @@ void ARMFrameLowering::adjustForSegmentedStacks(MachineFunction &MF) const {
if (MF.getFunction()->isVarArg())
report_fatal_error("Segmented stacks do not support vararg functions.");
if (!ST->isTargetAndroid() && !ST->isTargetLinux())
report_fatal_error("Segmented stacks not supported on this platfrom.");
report_fatal_error("Segmented stacks not supported on this platform.");
MachineBasicBlock &prologueMBB = MF.front();
MachineFrameInfo *MFI = MF.getFrameInfo();

View File

@ -14,7 +14,7 @@
//===----------------------------------------------------------------------===//
// TODO: Graph based predicate heuristics.
// Walking the instruction list linearly will get many, perhaps most, of
// the cases, but to do a truly throrough job of this, we need a more
// the cases, but to do a truly thorough job of this, we need a more
// wholistic approach.
//
// This optimization is very similar in spirit to the register allocator's
@ -74,7 +74,7 @@ private:
// instruction. "add Xd, Xn, Xm" ==> "add Dd, Da, Db", for example.
bool isProfitableToTransform(const MachineInstr *MI) const;
// tranformInstruction - Perform the transformation of an instruction
// transformInstruction - Perform the transformation of an instruction
// to its equivalant AdvSIMD scalar instruction. Update inputs and outputs
// to be the correct register class, minimizing cross-class copies.
void transformInstruction(MachineInstr *MI);
@ -252,7 +252,7 @@ bool ARM64AdvSIMDScalar::isProfitableToTransform(const MachineInstr *MI) const {
if (AllUsesAreCopies)
--NumNewCopies;
// If a tranform will not increase the number of cross-class copies required,
// If a transform will not increase the number of cross-class copies required,
// return true.
if (NumNewCopies <= NumRemovableCopies)
return true;
@ -273,7 +273,7 @@ static MachineInstr *insertCopy(const ARM64InstrInfo *TII, MachineInstr *MI,
return MIB;
}
// tranformInstruction - Perform the transformation of an instruction
// transformInstruction - Perform the transformation of an instruction
// to its equivalant AdvSIMD scalar instruction. Update inputs and outputs
// to be the correct register class, minimizing cross-class copies.
void ARM64AdvSIMDScalar::transformInstruction(MachineInstr *MI) {

View File

@ -459,14 +459,14 @@ static void finitReachingDef(BlockToSetOfInstrsPerColor &In,
delete[] IT->second;
}
/// Reaching definiton algorithm.
/// Reaching definition algorithm.
/// \param MF function on which the algorithm will operate.
/// \param[out] ColorOpToReachedUses will contain the result of the reaching
/// def algorithm.
/// \param ADRPMode specify whether the reaching def algorithm should be tuned
/// for ADRP optimization. \see initReachingDef for more details.
/// \param DummyOp if not NULL, the algorithm will work at
/// basic block scope and will set for every exposed defintion a use to
/// basic block scope and will set for every exposed definition a use to
/// @p DummyOp.
/// \pre ColorOpToReachedUses is an array of at least number of registers of
/// InstrToInstrs.
@ -584,7 +584,7 @@ static bool isCandidateStore(const MachineInstr *Instr) {
return false;
}
/// Given the result of a reaching defintion algorithm in ColorOpToReachedUses,
/// Given the result of a reaching definition algorithm in ColorOpToReachedUses,
/// Build the Use to Defs information and filter out obvious non-LOH candidates.
/// In ADRPMode, non-LOH candidates are "uses" with non-ADRP definitions.
/// In non-ADRPMode, non-LOH candidates are "uses" with several definition,

View File

@ -147,7 +147,7 @@ public:
/// else.
MachineBasicBlock *Head;
/// The block containing cmp+br.cond with a sucessor shared with Head.
/// The block containing cmp+br.cond with a successor shared with Head.
MachineBasicBlock *CmpBB;
/// The common successor for Head and CmpBB.
@ -420,7 +420,7 @@ bool SSACCmpConv::canSpeculateInstrs(MachineBasicBlock *MBB,
return false;
}
// Only CmpMI is alowed to clobber the flags.
// Only CmpMI is allowed to clobber the flags.
if (&*I != CmpMI && I->modifiesRegister(ARM64::CPSR, TRI)) {
DEBUG(dbgs() << "Clobbers flags: " << *I);
return false;

View File

@ -646,7 +646,7 @@ def simdimmtype10 : Operand<i32>,
//---
// Sytem management
// System management
//---
// Base encoding for system instruction operands.

View File

@ -76,7 +76,7 @@ ARM64RegisterInfo::getThisReturnPreservedMask(CallingConv::ID) const {
BitVector ARM64RegisterInfo::getReservedRegs(const MachineFunction &MF) const {
const TargetFrameLowering *TFI = MF.getTarget().getFrameLowering();
// FIXME: avoid re-calculating this everytime.
// FIXME: avoid re-calculating this every time.
BitVector Reserved(getNumRegs());
Reserved.set(ARM64::SP);
Reserved.set(ARM64::XZR);

View File

@ -164,7 +164,7 @@ def tcGPR64 : RegisterClass<"ARM64", [i64], 64, (sub GPR64common, X19, X20, X21,
X22, X23, X24, X25, X26,
X27, X28)>;
// GPR register classes for post increment ammount of vector load/store that
// GPR register classes for post increment amount of vector load/store that
// has alternate printing when Rm=31 and prints a constant immediate value
// equal to the total number of bytes transferred.
def GPR64pi1 : RegisterOperand<GPR64, "printPostIncOperand1">;

View File

@ -222,7 +222,7 @@ void ARM64MachObjectWriter::RecordRelocation(
"difference");
// ARM64 always uses external relocations. If there is no symbol to use as
// a base address (a local symbol with no preceeding non-local symbol),
// a base address (a local symbol with no preceding non-local symbol),
// error out.
//
// FIXME: We should probably just synthesize an external symbol and use

View File

@ -315,7 +315,7 @@ protected:
/// \brief Name of the profile file to load.
StringRef Filename;
/// \brief Flag indicating whether the profile input loaded succesfully.
/// \brief Flag indicating whether the profile input loaded successfully.
bool ProfileIsValid;
};
}

View File

@ -6,7 +6,7 @@
define i32 @fct(i32 %i1, i32 %i2) {
; CHECK: @fct
; Sign extension is used more than once, thus it should not be folded.
; CodeGenPrepare is not sharing sext accross uses, thus this is folded because
; CodeGenPrepare is not sharing sext across uses, thus this is folded because
; of that.
; _CHECK-NOT_: , sxtw]
entry:

View File

@ -6,7 +6,7 @@ define void @one_lane(i32* nocapture %out_int, i32 %skip0) nounwind {
; CHECK-LABEL: one_lane:
; CHECK: dup.16b v[[REG:[0-9]+]], wzr
; CHECK-NEXT: ins.b v[[REG]][0], w1
; v and q are aliases, and str is prefered against st.16b when possible
; v and q are aliases, and str is preferred against st.16b when possible
; rdar://11246289
; CHECK: str q[[REG]], [x0]
; CHECK: ret

View File

@ -14,7 +14,7 @@
; }
;
; Test that we generate valid debug info for optimized code,
; particularily variables that are described as constants and passed
; particularly variables that are described as constants and passed
; by reference.
; rdar://problem/14874886
;

View File

@ -1,6 +1,6 @@
; RUN: llvm-mc -triple arm64-apple-darwin -show-encoding < %s | FileCheck %s
; ARM64 uses a multi-character statment separator, "%%". Check that we lex
; ARM64 uses a multi-character statement separator, "%%". Check that we lex
; it properly and recognize the multiple assembly statements on the line.
; To make sure the output assembly correctly handled the instructions,

View File

@ -2,7 +2,7 @@
# RUN: -mattr=+micromips 2>&1 -filetype=obj > %t.o
# RUN: llvm-objdump %t.o -triple mipsel -mattr=+micromips -d | FileCheck %s
# Check that fixup data is writen in the microMIPS specific little endian
# Check that fixup data is written in the microMIPS specific little endian
# byte order.
.text