rename the child field to 'next'. This is not a parent/child
relationship, this is a linear list relationship.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@96561 91177308-0d34-0410-b5e6-96231b3b80d8
diff --git a/utils/TableGen/DAGISelMatcherGen.cpp b/utils/TableGen/DAGISelMatcherGen.cpp
index abe0d2a..53f248e 100644
--- a/utils/TableGen/DAGISelMatcherGen.cpp
+++ b/utils/TableGen/DAGISelMatcherGen.cpp
@@ -38,7 +38,7 @@
MatcherNode *Matcher;
/// CurPredicate - As we emit matcher nodes, this points to the latest check
- /// which should have future checks stuck into its child position.
+ /// which should have future checks stuck into its Next position.
MatcherNode *CurPredicate;
public:
MatcherGen(const PatternToMatch &pattern, const CodeGenDAGPatterns &cgp);
@@ -109,7 +109,7 @@
/// AddMatcherNode - Add a matcher node to the current graph we're building.
void MatcherGen::AddMatcherNode(MatcherNode *NewNode) {
if (CurPredicate != 0)
- CurPredicate->setChild(NewNode);
+ CurPredicate->setNext(NewNode);
else
Matcher = NewNode;
CurPredicate = NewNode;
@@ -389,7 +389,7 @@
// Link it into the pattern.
if (MatcherNode *Pred = Gen.GetCurPredicate()) {
- Pred->setChild(Result);
+ Pred->setNext(Result);
return Gen.GetMatcher();
}