Lines Matching defs:Children
715 // Count children in the count if they are also nodes.
1121 /// clone - Make a copy of this tree and all of its children.
1129 CChildren.reserve(Children.size());
1186 // Just recursively inline children nodes.
1205 if (Frag->getNumArgs() != Children.size())
1381 /// this node and its children in the tree. This returns true if it makes a
1842 std::vector<TreePatternNode*> Children;
1846 Children.push_back(ParseTreePattern(Dag->getArg(i), Dag->getArgName(i)));
1849 // (intrinsic_* <number>, ..children..). Pick the right intrinsic node, and
1866 Children.insert(Children.begin(), IIDNode);
1870 TreePatternNode *Result = new TreePatternNode(Operator, Children, NumResults);
1901 // Walk all children.
2266 assert(Slot->getNumChildren() == 0 && "can't be a use with children!");
2308 // If this is not a set, verify that the children nodes are not void typed,
2317 // If this is a non-leaf node with no children, treat it basically as if
2436 // Analyze children.
2686 Children;
2687 Children.push_back(OpNode);
2688 OpNode = new TreePatternNode(Xform, Children, OpNode->getNumTypes());
2849 // Analyze children.
2963 std::vector<TreePatternNode*> Children;
2964 Children.push_back(OpNode);
2965 OpNode = new TreePatternNode(Xform, Children, OpNode->getNumTypes());
3085 std::vector<TreePatternNode *> &Children) {
3086 assert(N->getNumChildren()==2 &&"Associative but doesn't have 2 children!");
3092 Children.push_back(N);
3097 Children.push_back(N->getChild(0));
3099 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
3102 Children.push_back(N->getChild(1));
3104 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
3132 // Find the variants of all of our maximal children.
3175 // Compute permutations of all children.
3181 // Build all permutations based on how the children were formed.
3188 "Commutative but doesn't have 2 children!");
3189 // Don't count children which are actually register references.
