Home | History | Annotate | Download | only in TableGen

Lines Matching defs:Tree

844 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
1073 #if 0 // FIXME: implement refcounted tree nodes!
1097 // Get the result tree.
1098 DagInit *Tree = Operator->getValueAsDag("Fragment");
1100 if (Tree)
1101 if (DefInit *DI = dyn_cast<DefInit>(Tree->getOperator()))
1194 /// clone - Make a copy of this tree and all of its children.
1214 /// RemoveAllTypes - Recursively strip all the types of this tree.
1224 /// SubstituteFormalArguments - Replace the formal arguments in this tree
1471 /// TreeHasProperty - Return true if any node in this tree has the specified
1494 /// this node and its children in the tree. This returns true if it makes a
1991 /// SimplifyTree - See if we can simplify this tree to eliminate something that
2215 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
2216 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
2269 // Now that we've parsed all of the tree fragments, do a closure on them so
2306 assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!");
2483 // Assume only the first tree is the pattern. The others are clobber nodes.
2651 /// Get all the instructions in a tree.
2653 getInstructionsInTree(TreePatternNode *Tree, SmallVectorImpl<Record*> &Instrs) {
2654 if (Tree->isLeaf())
2656 if (Tree->getOperator()->isSubClassOf("Instruction"))
2657 Instrs.push_back(Tree->getOperator());
2658 for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i)
2659 getInstructionsInTree(Tree->getChild(i), Instrs);
2868 // Use a temporary tree pattern to infer all types and make sure that the
2888 // FIXME: Assume only the first tree is the pattern. The others are clobber
3168 DagInit *Tree = CurPattern->getValueAsDag("PatternToMatch");
3171 if (hasNullFragReference(Tree))
3174 TreePattern *Pattern = new TreePattern(CurPattern, Tree, true, *this);
3435 // There are only two ways we can permute the tree: