Lines Matching full:getchild
590 FindDepVarsOf(N->getChild(i), DepMap);
714 TreePatternNode *Child = P->getChild(i);
828 return N->getChild(OpNo);
1001 delete getChild(i);
1064 getChild(0)->print(OS);
1067 getChild(i)->print(OS);
1114 if (!getChild(i)->isIsomorphicTo(N->getChild(i), DepVars))
1129 CChildren.push_back(getChild(i)->clone());
1145 getChild(i)->RemoveAllTypes();
1156 TreePatternNode *Child = getChild(i);
1170 getChild(i)->SubstituteFormalArguments(ArgMap);
1186 TreePatternNode *Child = getChild(i);
1218 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
1322 dynamic_cast<IntInit*>(getChild(0)->getLeafValue())->getValue();
1363 if (getChild(i)->TreeHasProperty(Property, CGP))
1436 TreePatternNode *SetVal = getChild(NC-1);
1440 TreePatternNode *Child = getChild(i);
1455 MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1461 MadeChange |= getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1462 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
1464 assert(getChild(0)->getNumTypes() == 1 &&
1465 getChild(1)->getNumTypes() == 1 && "Unhandled case");
1470 if (!getChild(1)->hasTypeSet(0) &&
1471 !getChild(1)->getExtType(0).isCompletelyUnknown()) {
1472 MVT::SimpleValueType RCVT = getChild(1)->getExtType(0).getTypeList()[0];
1473 MadeChange |= getChild(1)->UpdateNodeType(0, RCVT, TP);
1494 MadeChange |= getChild(0)->UpdateNodeType(0, MVT::iPTR, TP);
1497 MadeChange |= getChild(i+1)->ApplyTypeConstraints(TP, NotRegisters);
1500 assert(getChild(i+1)->getNumTypes() == 1 && "Unhandled case");
1501 MadeChange |= getChild(i+1)->UpdateNodeType(0, OpVT, TP);
1517 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1570 assert(getChild(0)->getNumTypes() == 1 && "FIXME: Unhandled");
1571 MadeChange |= UpdateNodeType(0, getChild(0)->getExtType(0), TP);
1572 MadeChange |= getChild(0)->UpdateNodeType(0, getExtType(0), TP);
1593 TreePatternNode *Child = getChild(ChildNo++);
1633 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1640 if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
1641 bool MadeChange = UpdateNodeType(getChild(0)->getExtType(), TP);
1642 MadeChange |= getChild(0)->UpdateNodeType(getExtType(), TP);
1670 if (!getChild(i)->canPatternMatch(Reason, CDP))
1687 if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {
1690 if (OnlyOnRHSOfCommutative(getChild(i))) {
1738 ComputeNamedNodes(N->getChild(i));
1893 N->getExtType(0) == N->getChild(0)->getExtType(0) &&
1895 N = N->getChild(0);
1903 TreePatternNode *Child = N->getChild(i);
2207 TreePatternNode *TPN = T->getChild(op);
2294 TreePatternNode *Dest = Pat->getChild(i);
2310 if (Pat->getChild(i)->getNumTypes() == 0)
2312 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
2335 TreePatternNode *Dest = Pat->getChild(i);
2359 FindPatternInputsAndOutputs(I, Pat->getChild(NumDests),
2404 const TreePatternNode *N0 = N->getChild(0);
2408 const TreePatternNode *N1 = N->getChild(1);
2411 if (N1->getNumChildren() != 1 || !N1->getChild(0)->isLeaf())
2437 AnalyzeNode(N->getChild(i));
2734 SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
2770 FindNames(P->getChild(i), Names, PatternTop);
2850 if (ForceArbitraryInstResultType(N->getChild(i), TP))
2959 TreePatternNode *OpNode = DstPattern->getChild(ii);
3095 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
3096 Children.push_back(N->getChild(0));
3098 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
3100 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
3101 Children.push_back(N->getChild(1));
3103 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
3178 GenerateVariantsOf(N->getChild(i), ChildVariants[i], CDP, DepVars);
3191 TreePatternNode *Child = N->getChild(i);
