Lines Matching refs:Child
720 /// Find dependent variables within child patterns
843 TreePatternNode *Child = P->getChild(i);
844 if (!Child->isLeaf() && Child->getNumTypes() &&
845 Child->getType(0) != MVT::Other)
846 Size += getPatternSize(Child, CGP);
847 else if (Child->isLeaf()) {
848 if (isa<IntInit>(Child->getLeafValue()))
850 else if (Child->getComplexPatternInfo(CGP))
851 Size += getPatternSize(Child, CGP);
852 else if (!Child->getPredicateFns().empty())
1379 TreePatternNode *Child = getChild(i);
1380 if (Child->isLeaf()) {
1381 Init *Val = Child->getLeafValue();
1387 TreePatternNode *NewChild = ArgMap[Child->getName()];
1389 assert((Child->getPredicateFns().empty() ||
1390 NewChild->getPredicateFns() == Child->getPredicateFns()) &&
1391 "Non-empty child predicate clobbered!");
1415 TreePatternNode *Child = getChild(i);
1416 TreePatternNode *NewChild = Child->InlinePatternFragments(TP);
1418 assert((Child->getPredicateFns().empty() ||
1419 NewChild->getPredicateFns() == Child->getPredicateFns()) &&
1420 "Non-empty child predicate clobbered!");
1755 TreePatternNode *Child = getChild(i);
1756 MadeChange |= Child->ApplyTypeConstraints(TP, NotRegisters);
1759 MadeChange |= Child->UpdateNodeType(0, SetVal->getExtType(i), TP);
1760 MadeChange |= SetVal->UpdateNodeType(i, Child->getExtType(0), TP);
1902 TreePatternNode *Child = getChild(ChildNo++);
1906 // child patterns, so attempt to match each sub-operand separately.
1913 if (Child->getNumMIResults(CDP) < NumArgs) {
1914 // Match first sub-operand against the child we already have.
1917 Child->UpdateNodeTypeFromInst(ChildResNo, SubRec, TP);
1926 Child = getChild(ChildNo++);
1930 Child->UpdateNodeTypeFromInst(ChildResNo, SubRec, TP);
1939 MadeChange |= Child->UpdateNodeTypeFromInst(ChildResNo, OperandNode, TP);
2226 TreePatternNode *Child = Children[i];
2228 if (Child->getName().empty())
2235 auto PrevOp = ComplexPatternOperands.find(Child->getName());
2241 ComplexPatternOperands[Child->getName()] = OperandId;
2280 TreePatternNode *Child
2281 MadeChange |= SimplifyTree(Child);
2282 N->setChild(i, Child);
3551 /// CombineChildVariants - Given a bunch of permutations of each child of the
3678 // Only handle child sizes of 3. Otherwise we'll end up trying too many
3741 TreePatternNode *Child = N->getChild(i);
3742 if (Child->isLeaf())
3743 if (DefInit *DI = dyn_cast<DefInit>(Child->getLeafValue())) {
