Lines Matching refs:Children
832 // We don't want to count any children twice, so return early.
841 // Count children in the count if they are also nodes.
1342 /// clone - Make a copy of this tree and all of its children.
1350 CChildren.reserve(Children.size());
1413 // Just recursively inline children nodes.
1432 if (Frag->getNumArgs() != Children.size()) {
1697 /// this node and its children in the tree. This returns true if it makes a
1919 // And the remaining sub-operands against subsequent children.
2197 std::vector<TreePatternNode*> Children;
2201 Children.push_back(ParseTreePattern(Dag->getArg(i), Dag->getArgName(i)));
2204 // (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and
2221 Children.insert(Children.begin(), IIDNode);
2225 for (unsigned i = 0; i < Children.size(); ++i) {
2226 TreePatternNode *Child = Children[i];
2246 TreePatternNode *Result = new TreePatternNode(Operator, Children, NumResults);
2277 // Walk all children.
2634 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
2676 // If this is not a set, verify that the children nodes are not void typed,
2685 // If this is a non-leaf node with no children, treat it basically as if
2801 // Analyze children.
3069 std::vector<TreePatternNode*> Children;
3070 Children.push_back(OpNode);
3071 OpNode = new TreePatternNode(Xform, Children, OpNode->getNumTypes());
3404 // Analyze children.
3522 std::vector<TreePatternNode*> Children;
3523 Children.push_back(OpNode);
3524 OpNode = new TreePatternNode(Xform, Children, OpNode->getNumTypes());
3634 std::vector<TreePatternNode *> &Children) {
3635 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
3641 Children.push_back(N);
3646 Children.push_back(N->getChild(0));
3648 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
3651 Children.push_back(N->getChild(1));
3653 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
3681 // Find the variants of all of our maximal children.
3724 // Compute permutations of all children.
3730 // Build all permutations based on how the children were formed.
3737 "Commutative but doesn't have 2 children!");
3738 // Don't count children which are actually register references.
3756 "Commutative intrinsic should have at least 3 children!");
