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