[llvm-commits] [llvm] r67758 - in /llvm/trunk/utils/TableGen: ClangDiagnosticsEmitter.cpp CodeGenDAGPatterns.cpp CodeGenDAGPatterns.h CodeGenIntrinsics.h DAGISelEmitter.cpp IntrinsicEmitter.cpp SubtargetEmitter.cpp TGParser.cpp TGSourceMgr.cpp
Jim Grosbach
grosbach at apple.com
Thu Mar 26 09:17:51 PDT 2009
Author: grosbach
Date: Thu Mar 26 11:17:51 2009
New Revision: 67758
URL: http://llvm.org/viewvc/llvm-project?rev=67758&view=rev
Log:
fix a few spelling errors and typos
Modified:
llvm/trunk/utils/TableGen/ClangDiagnosticsEmitter.cpp
llvm/trunk/utils/TableGen/CodeGenDAGPatterns.cpp
llvm/trunk/utils/TableGen/CodeGenDAGPatterns.h
llvm/trunk/utils/TableGen/CodeGenIntrinsics.h
llvm/trunk/utils/TableGen/DAGISelEmitter.cpp
llvm/trunk/utils/TableGen/IntrinsicEmitter.cpp
llvm/trunk/utils/TableGen/SubtargetEmitter.cpp
llvm/trunk/utils/TableGen/TGParser.cpp
llvm/trunk/utils/TableGen/TGSourceMgr.cpp
Modified: llvm/trunk/utils/TableGen/ClangDiagnosticsEmitter.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/ClangDiagnosticsEmitter.cpp?rev=67758&r1=67757&r2=67758&view=diff
==============================================================================
--- llvm/trunk/utils/TableGen/ClangDiagnosticsEmitter.cpp (original)
+++ llvm/trunk/utils/TableGen/ClangDiagnosticsEmitter.cpp Thu Mar 26 11:17:51 2009
@@ -24,7 +24,7 @@
using namespace llvm;
//===----------------------------------------------------------------------===//
-// Generic routines for all Clang TableGen backens.
+// Generic routines for all Clang TableGen backends.
//===----------------------------------------------------------------------===//
typedef std::vector<Record*> RecordVector;
Modified: llvm/trunk/utils/TableGen/CodeGenDAGPatterns.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/CodeGenDAGPatterns.cpp?rev=67758&r1=67757&r2=67758&view=diff
==============================================================================
--- llvm/trunk/utils/TableGen/CodeGenDAGPatterns.cpp (original)
+++ llvm/trunk/utils/TableGen/CodeGenDAGPatterns.cpp Thu Mar 26 11:17:51 2009
@@ -352,7 +352,7 @@
default: // Too many VT's to pick from.
case 0: break; // No info yet.
case 1:
- // Only one VT of this flavor. Cannot ever satisify the constraints.
+ // Only one VT of this flavor. Cannot ever satisfy the constraints.
return NodeToApply->UpdateNodeType(MVT::Other, TP); // throw
case 2:
// If we have exactly two possible types, the little operand must be the
@@ -1048,7 +1048,7 @@
/// canPatternMatch - If it is impossible for this pattern to match on this
/// target, fill in Reason and return false. Otherwise, return true. This is
-/// used as a santity check for .td files (to prevent people from writing stuff
+/// used as a sanity check for .td files (to prevent people from writing stuff
/// that can never possibly work), and to prevent the pattern permuter from
/// generating stuff that is useless.
bool TreePatternNode::canPatternMatch(std::string &Reason,
@@ -1261,7 +1261,7 @@
}
/// InferAllTypes - Infer/propagate as many types throughout the expression
-/// patterns as possible. Return true if all types are infered, false
+/// patterns as possible. Return true if all types are inferred, false
/// otherwise. Throw an exception if a type contradiction is found.
bool TreePattern::InferAllTypes() {
bool MadeChange = true;
@@ -1351,7 +1351,7 @@
Nodes.pop_back();
}
- // Get the buildin intrinsic nodes.
+ // Get the builtin intrinsic nodes.
intrinsic_void_sdnode = getSDNodeNamed("intrinsic_void");
intrinsic_w_chain_sdnode = getSDNodeNamed("intrinsic_w_chain");
intrinsic_wo_chain_sdnode = getSDNodeNamed("intrinsic_wo_chain");
@@ -1405,7 +1405,7 @@
DagInit *OpsList = Fragments[i]->getValueAsDag("Operands");
DefInit *OpsOp = dynamic_cast<DefInit*>(OpsList->getOperator());
// Special cases: ops == outs == ins. Different names are used to
- // improve readibility.
+ // improve readability.
if (!OpsOp ||
(OpsOp->getDef()->getName() != "ops" &&
OpsOp->getDef()->getName() != "outs" &&
@@ -2260,9 +2260,9 @@
// Look up interesting info about the node.
const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(N->getOperator());
- // If this node is associative, reassociate.
+ // If this node is associative, re-associate.
if (NodeInfo.hasProperty(SDNPAssociative)) {
- // Reassociate by pulling together all of the linked operators
+ // Re-associate by pulling together all of the linked operators
std::vector<TreePatternNode*> MaximalChildren;
GatherChildrenOfAssociativeOpcode(N, MaximalChildren);
@@ -2366,7 +2366,7 @@
// Loop over all of the patterns we've collected, checking to see if we can
// generate variants of the instruction, through the exploitation of
- // identities. This permits the target to provide agressive matching without
+ // identities. This permits the target to provide aggressive matching without
// the .td file having to contain tons of variants of instructions.
//
// Note that this loop adds new patterns to the PatternsToMatch list, but we
Modified: llvm/trunk/utils/TableGen/CodeGenDAGPatterns.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/CodeGenDAGPatterns.h?rev=67758&r1=67757&r2=67758&view=diff
==============================================================================
--- llvm/trunk/utils/TableGen/CodeGenDAGPatterns.h (original)
+++ llvm/trunk/utils/TableGen/CodeGenDAGPatterns.h Thu Mar 26 11:17:51 2009
@@ -365,7 +365,7 @@
}
/// InferAllTypes - Infer/propagate as many types throughout the expression
- /// patterns as possible. Return true if all types are infered, false
+ /// patterns as possible. Return true if all types are inferred, false
/// otherwise. Throw an exception if a type contradiction is found.
bool InferAllTypes();
Modified: llvm/trunk/utils/TableGen/CodeGenIntrinsics.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/CodeGenIntrinsics.h?rev=67758&r1=67757&r2=67758&view=diff
==============================================================================
--- llvm/trunk/utils/TableGen/CodeGenIntrinsics.h (original)
+++ llvm/trunk/utils/TableGen/CodeGenIntrinsics.h Thu Mar 26 11:17:51 2009
@@ -34,7 +34,7 @@
/// parameter values of an intrinsic. If the number of return values is > 1,
/// then the intrinsic implicitly returns a first-class aggregate. The
/// numbering of the types starts at 0 with the first return value and
- /// continues from there throug the parameter list. This is useful for
+ /// continues from there through the parameter list. This is useful for
/// "matching" types.
struct IntrinsicSignature {
/// RetVTs - The MVT::SimpleValueType for each return type. Note that this
Modified: llvm/trunk/utils/TableGen/DAGISelEmitter.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/DAGISelEmitter.cpp?rev=67758&r1=67757&r2=67758&view=diff
==============================================================================
--- llvm/trunk/utils/TableGen/DAGISelEmitter.cpp (original)
+++ llvm/trunk/utils/TableGen/DAGISelEmitter.cpp Thu Mar 26 11:17:51 2009
@@ -1610,7 +1610,7 @@
// in this group share the same next line, emit it inline now. Do this
// until we run out of common predicates.
while (!ErasedPatterns && Patterns.back().second.back().first == 1) {
- // Check that all of fhe patterns in Patterns end with the same predicate.
+ // Check that all of the patterns in Patterns end with the same predicate.
bool AllEndWithSamePredicate = true;
for (unsigned i = 0, e = Patterns.size(); i != e; ++i)
if (Patterns[i].second.back() != Patterns.back().second.back()) {
Modified: llvm/trunk/utils/TableGen/IntrinsicEmitter.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/IntrinsicEmitter.cpp?rev=67758&r1=67757&r2=67758&view=diff
==============================================================================
--- llvm/trunk/utils/TableGen/IntrinsicEmitter.cpp (original)
+++ llvm/trunk/utils/TableGen/IntrinsicEmitter.cpp Thu Mar 26 11:17:51 2009
@@ -236,7 +236,7 @@
}
}
-/// RecordListComparator - Provide a determinstic comparator for lists of
+/// RecordListComparator - Provide a deterministic comparator for lists of
/// records.
namespace {
typedef std::pair<std::vector<Record*>, std::vector<Record*> > RecPair;
Modified: llvm/trunk/utils/TableGen/SubtargetEmitter.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/SubtargetEmitter.cpp?rev=67758&r1=67757&r2=67758&view=diff
==============================================================================
--- llvm/trunk/utils/TableGen/SubtargetEmitter.cpp (original)
+++ llvm/trunk/utils/TableGen/SubtargetEmitter.cpp Thu Mar 26 11:17:51 2009
@@ -78,7 +78,7 @@
if (CommandLineName.empty()) continue;
- // Emit as { "feature", "decription", feactureEnum, i1 | i2 | ... | in }
+ // Emit as { "feature", "description", featureEnum, i1 | i2 | ... | in }
OS << " { "
<< "\"" << CommandLineName << "\", "
<< "\"" << Desc << "\", "
Modified: llvm/trunk/utils/TableGen/TGParser.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/TGParser.cpp?rev=67758&r1=67757&r2=67758&view=diff
==============================================================================
--- llvm/trunk/utils/TableGen/TGParser.cpp (original)
+++ llvm/trunk/utils/TableGen/TGParser.cpp Thu Mar 26 11:17:51 2009
@@ -527,7 +527,7 @@
std::string Val = Lex.getCurStrVal();
Lex.Lex();
- // Handle multiple consequtive concatenated strings.
+ // Handle multiple consecutive concatenated strings.
while (Lex.getCode() == tgtok::StrVal) {
Val += Lex.getCurStrVal();
Lex.Lex();
Modified: llvm/trunk/utils/TableGen/TGSourceMgr.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/utils/TableGen/TGSourceMgr.cpp?rev=67758&r1=67757&r2=67758&view=diff
==============================================================================
--- llvm/trunk/utils/TableGen/TGSourceMgr.cpp (original)
+++ llvm/trunk/utils/TableGen/TGSourceMgr.cpp Thu Mar 26 11:17:51 2009
@@ -98,7 +98,7 @@
++LineEnd;
// Print out the line.
OS << std::string(LineStart, LineEnd) << "\n";
- // Print out spaces before the carat.
+ // Print out spaces before the caret.
for (const char *Pos = LineStart; Pos != ErrorLoc.getPointer(); ++Pos)
OS << (*Pos == '\t' ? '\t' : ' ');
OS << "^\n";
More information about the llvm-commits
mailing list