Lines Matching full:getchild
716 FindDepVarsOf(N->getChild(i), DepMap);
843 TreePatternNode *Child = P->getChild(i);
981 return N->getChild(OpNo);
1210 delete getChild(i);
1287 getChild(0)->print(OS);
1290 getChild(i)->print(OS);
1337 if (!getChild(i)->isIsomorphicTo(N->getChild(i), DepVars))
1352 CChildren.push_back(getChild(i)->clone());
1368 getChild(i)->RemoveAllTypes();
1379 TreePatternNode *Child = getChild(i);
1395 getChild(i)->SubstituteFormalArguments(ArgMap);
1415 TreePatternNode *Child = getChild(i);
1449 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
1590 unsigned IID = cast<IntInit>(getChild(0)->getLeafValue())->getValue();
1656 if (getChild(i)->TreeHasProperty(Property, CGP))
1751 TreePatternNode *SetVal = getChild(NC-1);
1755 TreePatternNode *Child = getChild(i);
1770 MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1792 MadeChange |= getChild(0)->UpdateNodeType(0, MVT::iPTR, TP);
1795 MadeChange |= getChild(i+1)->ApplyTypeConstraints(TP, NotRegisters);
1798 assert(getChild(i+1)->getNumTypes() == 1 && "Unhandled case");
1799 MadeChange |= getChild(i+1)->UpdateNodeType(0, OpVT, TP);
1817 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1852 assert(getChild(0)->getNumTypes() == 1 && "FIXME: Unhandled");
1853 MadeChange |= UpdateNodeType(0, getChild(0)->getExtType(0), TP);
1854 MadeChange |= getChild(0)->UpdateNodeType(0, getExtType(0), TP);
1870 if (!isOperandClass(getChild(0), "RegisterClass")) {
1876 TreePatternNode *SubIdxChild = getChild(I + 1);
1902 TreePatternNode *Child = getChild(ChildNo++);
1926 Child = getChild(ChildNo++);
1949 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1957 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1971 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1978 if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
1979 bool MadeChange = UpdateNodeType(getChild(0)->getExtType(), TP);
1980 MadeChange |= getChild(0)->UpdateNodeType(getExtType(), TP);
2008 if (!getChild(i)->canPatternMatch(Reason, CDP))
2028 if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {
2031 if (OnlyOnRHSOfCommutative(getChild(i))) {
2082 ComputeNamedNodes(N->getChild(i));
2270 N->getExtType(0) == N->getChild(0)->getExtType(0) &&
2272 N = N->getChild(0);
2280 TreePatternNode *Child = N->getChild
2580 TreePatternNode *TPN = T->getChild(op);
2663 TreePatternNode *Dest = Pat->getChild(i);
2679 if (Pat->getChild(i)->getNumTypes() == 0)
2681 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
2704 TreePatternNode *Dest = Pat->getChild(i);
2731 FindPatternInputsAndOutputs(I, Pat->getChild(NumDests),
2769 const TreePatternNode *N0 = N->getChild(0);
2773 const TreePatternNode *N1 = N->getChild(1);
2776 if (N1->getNumChildren() != 1 || !N1->getChild(0)->isLeaf())
2803 AnalyzeNode(N->getChild(i));
2926 getInstructionsInTree(Tree->getChild(i), Instrs);
3173 SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
3209 FindNames(P->getChild(i), Names, PatternTop);
3413 if (ForceArbitraryInstResultType(N->getChild(i), TP))
3526 TreePatternNode *OpNode = DstPattern->getChild(ii);
3652 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
3653 Children.push_back(N->getChild(0));
3655 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
3657 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
3658 Children.push_back(N->getChild(1));
3660 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
3735 GenerateVariantsOf(N->getChild(i), ChildVariants[i], CDP, DepVars);
3748 TreePatternNode *Child = N->getChild(i);
