mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-02-23 14:03:14 +00:00
Fix typos in comments and doc
Committing http://reviews.llvm.org/D4798 for Robin Morisset (morisset@google.com) llvm-svn: 214934
This commit is contained in:
parent
fec0292411
commit
314c089ba3
@ -292,7 +292,7 @@ Despite being very generic, TableGen has some deficiencies that have been
|
||||
pointed out numerous times. The common theme is that, while TableGen allows
|
||||
you to build Domain-Specific-Languages, the final languages that you create
|
||||
lack the power of other DSLs, which in turn increase considerably the size
|
||||
and complecity of TableGen files.
|
||||
and complexity of TableGen files.
|
||||
|
||||
At the same time, TableGen allows you to create virtually any meaning of
|
||||
the basic concepts via custom-made back-ends, which can pervert the original
|
||||
|
@ -16960,7 +16960,7 @@ void X86TargetLowering::ReplaceNodeResults(SDNode *N,
|
||||
case ISD::ATOMIC_LOAD_UMIN:
|
||||
case ISD::ATOMIC_LOAD_UMAX:
|
||||
// Delegate to generic TypeLegalization. Situations we can really handle
|
||||
// should have already been dealt with by X86AtomicExpand.cpp.
|
||||
// should have already been dealt with by X86AtomicExpandPass.cpp.
|
||||
break;
|
||||
case ISD::ATOMIC_LOAD: {
|
||||
ReplaceATOMIC_LOAD(N, Results, DAG);
|
||||
|
@ -3145,7 +3145,7 @@ void X86InstrInfo::copyPhysReg(MachineBasicBlock &MBB,
|
||||
|
||||
// Moving EFLAGS to / from another register requires a push and a pop.
|
||||
// Notice that we have to adjust the stack if we don't want to clobber the
|
||||
// first frame index. See X86FrameLowering.cpp - colobbersTheStack.
|
||||
// first frame index. See X86FrameLowering.cpp - clobbersTheStack.
|
||||
if (SrcReg == X86::EFLAGS) {
|
||||
if (X86::GR64RegClass.contains(DestReg)) {
|
||||
BuildMI(MBB, MI, DL, get(X86::PUSHF64));
|
||||
|
@ -2817,7 +2817,7 @@ bool GVN::processFoldableCondBr(BranchInst *BI) {
|
||||
return true;
|
||||
}
|
||||
|
||||
// performPRE() will trigger assert if it come across an instruciton without
|
||||
// performPRE() will trigger assert if it comes across an instruction without
|
||||
// associated val-num. As it normally has far more live instructions than dead
|
||||
// instructions, it makes more sense just to "fabricate" a val-number for the
|
||||
// dead code than checking if instruction involved is dead or not.
|
||||
|
@ -184,7 +184,7 @@ static void RewriteUsesOfClonedInstructions(BasicBlock *OrigHeader,
|
||||
}
|
||||
}
|
||||
|
||||
/// Determine whether the instructions in this range my be safely and cheaply
|
||||
/// Determine whether the instructions in this range may be safely and cheaply
|
||||
/// speculated. This is not an important enough situation to develop complex
|
||||
/// heuristics. We handle a single arithmetic instruction along with any type
|
||||
/// conversions.
|
||||
@ -232,7 +232,7 @@ static bool shouldSpeculateInstrs(BasicBlock::iterator Begin,
|
||||
/// Fold the loop tail into the loop exit by speculating the loop tail
|
||||
/// instructions. Typically, this is a single post-increment. In the case of a
|
||||
/// simple 2-block loop, hoisting the increment can be much better than
|
||||
/// duplicating the entire loop header. In the cast of loops with early exits,
|
||||
/// duplicating the entire loop header. In the case of loops with early exits,
|
||||
/// rotation will not work anyway, but simplifyLoopLatch will put the loop in
|
||||
/// canonical form so downstream passes can handle it.
|
||||
///
|
||||
|
Loading…
x
Reference in New Issue
Block a user