Lines Matching defs:Tree
807 /// getOperandNum - Return the node corresponding to operand #OpNo in tree
999 #if 0 // FIXME: implement refcounted tree nodes!
1023 // Get the result tree.
1024 DagInit *Tree = Operator->getValueAsDag("Fragment");
1026 if (Tree && dynamic_cast<DefInit*>(Tree->getOperator()))
1027 Op = dynamic_cast<DefInit*>(Tree->getOperator())->getDef();
1119 /// clone - Make a copy of this tree and all of its children.
1139 /// RemoveAllTypes - Recursively strip all the types of this tree.
1149 /// SubstituteFormalArguments - Replace the formal arguments in this tree
1356 /// TreeHasProperty - Return true if any node in this tree has the specified
1379 /// this node and its children in the tree. This returns true if it makes a
1878 /// SimplifyTree - See if we can simplify this tree to eliminate something that
2099 DagInit *Tree = Fragments[i]->getValueAsDag("Fragment");
2100 TreePattern *P = new TreePattern(Fragments[i], Tree, true, *this);
2154 // Now that we've parsed all of the tree fragments, do a closure on them so
2199 assert(P.getNumTrees() == 1 && "This ctor can only produce one tree!");
2389 // FIXME: Assume only the first tree is the pattern. The others are clobber
2708 // Use a temporary tree pattern to infer all types and make sure that the
2728 // FIXME: Assume only the first tree is the pattern. The others are clobber
2868 DagInit *Tree = CurPattern->getValueAsDag("PatternToMatch");
2869 TreePattern *Pattern = new TreePattern(CurPattern, Tree, true, *this);
3130 // There are only two ways we can permute the tree:
