Lines Matching refs:getChild
627 FindDepVarsOf(N->getChild(i), DepMap);
751 TreePatternNode *Child = P->getChild(i);
865 return N->getChild(OpNo);
1075 delete getChild(i);
1139 getChild(0)->print(OS);
1142 getChild(i)->print(OS);
1189 if (!getChild(i)->isIsomorphicTo(N->getChild(i), DepVars))
1204 CChildren.push_back(getChild(i)->clone());
1220 getChild(i)->RemoveAllTypes();
1231 TreePatternNode *Child = getChild(i);
1245 getChild(i)->SubstituteFormalArguments(ArgMap);
1265 TreePatternNode *Child = getChild(i);
1299 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
1437 unsigned IID = cast<IntInit>(getChild(0)->getLeafValue())->getValue();
1478 if (getChild(i)->TreeHasProperty(Property, CGP))
1548 TreePatternNode *SetVal = getChild(NC-1);
1552 TreePatternNode *Child = getChild(i);
1567 MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1589 MadeChange |= getChild(0)->UpdateNodeType(0, MVT::iPTR, TP);
1592 MadeChange |= getChild(i+1)->ApplyTypeConstraints(TP, NotRegisters);
1595 assert(getChild(i+1)->getNumTypes() == 1 && "Unhandled case");
1596 MadeChange |= getChild(i+1)->UpdateNodeType(0, OpVT, TP);
1614 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1649 assert(getChild(0)->getNumTypes() == 1 && "FIXME: Unhandled");
1650 MadeChange |= UpdateNodeType(0, getChild(0)->getExtType(0), TP);
1651 MadeChange |= getChild(0)->UpdateNodeType(0, getExtType(0), TP);
1672 TreePatternNode *Child = getChild(ChildNo++);
1696 Child = getChild(ChildNo++);
1719 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1732 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1739 if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
1740 bool MadeChange = UpdateNodeType(getChild(0)->getExtType(), TP);
1741 MadeChange |= getChild(0)->UpdateNodeType(getExtType(), TP);
1769 if (!getChild(i)->canPatternMatch(Reason, CDP))
1786 if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {
1789 if (OnlyOnRHSOfCommutative(getChild(i))) {
1840 ComputeNamedNodes(N->getChild(i));
2005 N->getExtType(0) == N->getChild(0)->getExtType(0) &&
2007 N = N->getChild(0);
2015 TreePatternNode *Child = N->getChild(i);
2313 TreePatternNode *TPN = T->getChild(op);
2395 TreePatternNode *Dest = Pat->getChild(i);
2411 if (Pat->getChild(i)->getNumTypes() == 0)
2413 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
2436 TreePatternNode *Dest = Pat->getChild(i);
2461 FindPatternInputsAndOutputs(I, Pat->getChild(NumDests),
2499 const TreePatternNode *N0 = N->getChild(0);
2503 const TreePatternNode *N1 = N->getChild(1);
2506 if (N1->getNumChildren() != 1 || !N1->getChild(0)->isLeaf())
2533 AnalyzeNode(N->getChild(i));
2659 getInstructionsInTree(Tree->getChild(i), Instrs);
2893 SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
2929 FindNames(P->getChild(i), Names, PatternTop);
3143 if (ForceArbitraryInstResultType(N->getChild(i), TP))
3257 TreePatternNode *OpNode = DstPattern->getChild(ii);
3393 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
3394 Children.push_back(N->getChild(0));
3396 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
3398 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
3399 Children.push_back(N->getChild(1));
3401 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
3476 GenerateVariantsOf(N->getChild(i), ChildVariants[i], CDP, DepVars);
3489 TreePatternNode *Child = N->getChild(i);
