Lines Matching refs:getChild
593 FindDepVarsOf(N->getChild(i), DepMap);
717 TreePatternNode *Child = P->getChild(i);
831 return N->getChild(OpNo);
1003 delete getChild(i);
1066 getChild(0)->print(OS);
1069 getChild(i)->print(OS);
1116 if (!getChild(i)->isIsomorphicTo(N->getChild(i), DepVars))
1131 CChildren.push_back(getChild(i)->clone());
1147 getChild(i)->RemoveAllTypes();
1158 TreePatternNode *Child = getChild(i);
1172 getChild(i)->SubstituteFormalArguments(ArgMap);
1188 TreePatternNode *Child = getChild(i);
1220 ArgMap[Frag->getArgName(i)] = getChild(i)->InlinePatternFragments(TP);
1324 dynamic_cast<IntInit*>(getChild(0)->getLeafValue())->getValue();
1365 if (getChild(i)->TreeHasProperty(Property, CGP))
1432 TreePatternNode *SetVal = getChild(NC-1);
1436 TreePatternNode *Child = getChild(i);
1451 MadeChange = getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1457 MadeChange |= getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1458 MadeChange |= getChild(1)->ApplyTypeConstraints(TP, NotRegisters);
1460 assert(getChild(0)->getNumTypes() == 1 &&
1461 getChild(1)->getNumTypes() == 1 && "Unhandled case");
1466 if (!getChild(1)->hasTypeSet(0) &&
1467 !getChild(1)->getExtType(0).isCompletelyUnknown()) {
1468 MVT::SimpleValueType RCVT = getChild(1)->getExtType(0).getTypeList()[0];
1469 MadeChange |= getChild(1)->UpdateNodeType(0, RCVT, TP);
1490 MadeChange |= getChild(0)->UpdateNodeType(0, MVT::iPTR, TP);
1493 MadeChange |= getChild(i+1)->ApplyTypeConstraints(TP, NotRegisters);
1496 assert(getChild(i+1)->getNumTypes() == 1 && "Unhandled case");
1497 MadeChange |= getChild(i+1)->UpdateNodeType(0, OpVT, TP);
1513 MadeChange |= getChild(i)->ApplyTypeConstraints(TP, NotRegisters);
1566 assert(getChild(0)->getNumTypes() == 1 && "FIXME: Unhandled");
1567 MadeChange |= UpdateNodeType(0, getChild(0)->getExtType(0), TP);
1568 MadeChange |= getChild(0)->UpdateNodeType(0, getExtType(0), TP);
1588 TreePatternNode *Child = getChild(ChildNo++);
1627 bool MadeChange = getChild(0)->ApplyTypeConstraints(TP, NotRegisters);
1634 if (!hasTypeSet() || !getChild(0)->hasTypeSet()) {
1635 bool MadeChange = UpdateNodeType(getChild(0)->getExtType(), TP);
1636 MadeChange |= getChild(0)->UpdateNodeType(getExtType(), TP);
1664 if (!getChild(i)->canPatternMatch(Reason, CDP))
1681 if (!OnlyOnRHSOfCommutative(getChild(getNumChildren()-1))) {
1684 if (OnlyOnRHSOfCommutative(getChild(i))) {
1732 ComputeNamedNodes(N->getChild(i));
1887 N->getExtType(0) == N->getChild(0)->getExtType(0) &&
1889 N = N->getChild(0);
1897 TreePatternNode *Child = N->getChild(i);
2202 TreePatternNode *TPN = T->getChild(op);
2284 TreePatternNode *Dest = Pat->getChild(i);
2300 if (Pat->getChild(i)->getNumTypes() == 0)
2302 FindPatternInputsAndOutputs(I, Pat->getChild(i), InstInputs, InstResults,
2325 TreePatternNode *Dest = Pat->getChild(i);
2349 FindPatternInputsAndOutputs(I, Pat->getChild(NumDests),
2387 const TreePatternNode *N0 = N->getChild(0);
2391 const TreePatternNode *N1 = N->getChild(1);
2394 if (N1->getNumChildren() != 1 || !N1->getChild(0)->isLeaf())
2421 AnalyzeNode(N->getChild(i));
2547 getInstructionsInTree(Tree->getChild(i), Instrs);
2763 SrcPattern = Pattern->getChild(Pattern->getNumChildren()-1)->clone();
2799 FindNames(P->getChild(i), Names, PatternTop);
3010 if (ForceArbitraryInstResultType(N->getChild(i), TP))
3124 TreePatternNode *OpNode = DstPattern->getChild(ii);
3260 if (N->getChild(0)->isLeaf() || N->getChild(0)->getOperator() != Operator)
3261 Children.push_back(N->getChild(0));
3263 GatherChildrenOfAssociativeOpcode(N->getChild(0), Children);
3265 if (N->getChild(1)->isLeaf() || N->getChild(1)->getOperator() != Operator)
3266 Children.push_back(N->getChild(1));
3268 GatherChildrenOfAssociativeOpcode(N->getChild(1), Children);
3343 GenerateVariantsOf(N->getChild(i), ChildVariants[i], CDP, DepVars);
3356 TreePatternNode *Child = N->getChild(i);
