From da4231f134989af7dc6bd3408821ba573def27b2 Mon Sep 17 00:00:00 2001 From: Jim Grosbach Date: Thu, 26 Mar 2009 16:17:51 +0000 Subject: [PATCH] fix a few spelling errors and typos git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@67758 91177308-0d34-0410-b5e6-96231b3b80d8 --- utils/TableGen/ClangDiagnosticsEmitter.cpp | 2 +- utils/TableGen/CodeGenDAGPatterns.cpp | 16 ++++++++-------- utils/TableGen/CodeGenDAGPatterns.h | 2 +- utils/TableGen/CodeGenIntrinsics.h | 2 +- utils/TableGen/DAGISelEmitter.cpp | 2 +- utils/TableGen/IntrinsicEmitter.cpp | 2 +- utils/TableGen/SubtargetEmitter.cpp | 2 +- utils/TableGen/TGParser.cpp | 2 +- utils/TableGen/TGSourceMgr.cpp | 2 +- 9 files changed, 16 insertions(+), 16 deletions(-) diff --git a/utils/TableGen/ClangDiagnosticsEmitter.cpp b/utils/TableGen/ClangDiagnosticsEmitter.cpp index 38bbf8eee6c..3d353518e20 100644 --- a/utils/TableGen/ClangDiagnosticsEmitter.cpp +++ b/utils/TableGen/ClangDiagnosticsEmitter.cpp @@ -24,7 +24,7 @@ using namespace llvm; //===----------------------------------------------------------------------===// -// Generic routines for all Clang TableGen backens. +// Generic routines for all Clang TableGen backends. //===----------------------------------------------------------------------===// typedef std::vector RecordVector; diff --git a/utils/TableGen/CodeGenDAGPatterns.cpp b/utils/TableGen/CodeGenDAGPatterns.cpp index c5e6bdffcfc..9061d0f0491 100644 --- a/utils/TableGen/CodeGenDAGPatterns.cpp +++ b/utils/TableGen/CodeGenDAGPatterns.cpp @@ -352,7 +352,7 @@ bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N, 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 @@ static bool OnlyOnRHSOfCommutative(TreePatternNode *N) { /// 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 @@ TreePatternNode *TreePattern::ParseTreePattern(DagInit *Dag) { } /// 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 @@ void CodeGenDAGPatterns::ParseNodeInfo() { 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 @@ void CodeGenDAGPatterns::ParsePatternFragments() { DagInit *OpsList = Fragments[i]->getValueAsDag("Operands"); DefInit *OpsOp = dynamic_cast(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 @@ static void GenerateVariantsOf(TreePatternNode *N, // 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 MaximalChildren; GatherChildrenOfAssociativeOpcode(N, MaximalChildren); @@ -2366,7 +2366,7 @@ void CodeGenDAGPatterns::GenerateVariants() { // 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 diff --git a/utils/TableGen/CodeGenDAGPatterns.h b/utils/TableGen/CodeGenDAGPatterns.h index a3e0af6d611..615802beeb3 100644 --- a/utils/TableGen/CodeGenDAGPatterns.h +++ b/utils/TableGen/CodeGenDAGPatterns.h @@ -365,7 +365,7 @@ public: } /// 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(); diff --git a/utils/TableGen/CodeGenIntrinsics.h b/utils/TableGen/CodeGenIntrinsics.h index fea868b8c06..7e7bdf989ac 100644 --- a/utils/TableGen/CodeGenIntrinsics.h +++ b/utils/TableGen/CodeGenIntrinsics.h @@ -34,7 +34,7 @@ namespace llvm { /// 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 diff --git a/utils/TableGen/DAGISelEmitter.cpp b/utils/TableGen/DAGISelEmitter.cpp index 5b12f71602a..447e0517d9d 100644 --- a/utils/TableGen/DAGISelEmitter.cpp +++ b/utils/TableGen/DAGISelEmitter.cpp @@ -1610,7 +1610,7 @@ void DAGISelEmitter::EmitPatterns(std::vector, std::vector > RecPair; diff --git a/utils/TableGen/SubtargetEmitter.cpp b/utils/TableGen/SubtargetEmitter.cpp index b05b9968a2e..cb36a76f432 100644 --- a/utils/TableGen/SubtargetEmitter.cpp +++ b/utils/TableGen/SubtargetEmitter.cpp @@ -78,7 +78,7 @@ void SubtargetEmitter::FeatureKeyValues(std::ostream &OS) { if (CommandLineName.empty()) continue; - // Emit as { "feature", "decription", feactureEnum, i1 | i2 | ... | in } + // Emit as { "feature", "description", featureEnum, i1 | i2 | ... | in } OS << " { " << "\"" << CommandLineName << "\", " << "\"" << Desc << "\", " diff --git a/utils/TableGen/TGParser.cpp b/utils/TableGen/TGParser.cpp index 9d579c2ef7e..32ac719966c 100644 --- a/utils/TableGen/TGParser.cpp +++ b/utils/TableGen/TGParser.cpp @@ -527,7 +527,7 @@ Init *TGParser::ParseSimpleValue(Record *CurRec) { 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(); diff --git a/utils/TableGen/TGSourceMgr.cpp b/utils/TableGen/TGSourceMgr.cpp index e4d1c40dc6c..42bc75246c9 100644 --- a/utils/TableGen/TGSourceMgr.cpp +++ b/utils/TableGen/TGSourceMgr.cpp @@ -98,7 +98,7 @@ void TGSourceMgr::PrintError(TGLoc ErrorLoc, const std::string &Msg) const { ++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";