Lines Matching defs:e
79 for (unsigned i = 0, e = LegalTypes.size(); i != e; ++i) in FillWithPossibleTypes() local
100 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) in hasIntegerTypes() local
109 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) in hasFloatingPointTypes() local
118 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) in hasVectorTypes() local
130 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) { in getName() local
206 for (unsigned j = 0, e = InVT.TypeVec.size(); j != e; ++j) in MergeInTypeInfo() local
388 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) in EnforceSmallerThan() local
393 for (unsigned i = 1, e = TypeVec.size(); i != e; ++i) in EnforceSmallerThan() local
398 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) in EnforceSmallerThan() local
403 for (unsigned i = 1, e = TypeVec.size(); i != e; ++i) in EnforceSmallerThan() local
444 for (unsigned i = 0, e = Other.TypeVec.size(); i != e; ++i) in EnforceSmallerThan() local
449 for (unsigned i = 1, e = Other.TypeVec.size(); i != e; ++i) in EnforceSmallerThan() local
454 for (unsigned i = 0, e = Other.TypeVec.size(); i != e; ++i) in EnforceSmallerThan() local
459 for (unsigned i = 1, e = Other.TypeVec.size(); i != e; ++i) in EnforceSmallerThan() local
589 for (size_t i = 0, e = N->getNumChildren(); i != e; ++i) in FindDepVarsOf() local
612 e = DepVars.end(); i != e; ++i) { in DumpDepVars() local
713 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) { in getPatternSize() local
744 for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) { in getPredicateCheck() local
932 for (unsigned i = 0, e = PropList.size(); i != e; ++i) { in SDNodeInfo() local
978 for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i) { in getKnownType() local
1058 for (unsigned i = 0, e = Types.size(); i != e; ++i) in print() local
1065 for (unsigned i = 1, e = getNumChildren(); i != e; ++i) { in print() local
1073 for (unsigned i = 0, e = PredicateFns.size(); i != e; ++i) in print() local
1113 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in isIsomorphicTo() local
1128 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in clone() local
1141 for (unsigned i = 0, e = Types.size(); i != e; ++i) in RemoveAllTypes() local
1144 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in RemoveAllTypes() local
1155 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) { in SubstituteFormalArguments() local
1185 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) { in InlinePatternFragments() local
1217 for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i) in InlinePatternFragments() local
1224 for (unsigned i = 0, e = Types.size(); i != e; ++i) in InlinePatternFragments() local
1228 for (unsigned i = 0, e = getPredicateFns().size(); i != e; ++i) in InlinePatternFragments() local
1362 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in TreeHasProperty() local
1388 for (unsigned i = 0, e = Types.size(); i != e; ++i) in ApplyTypeConstraints() local
1485 for (unsigned i = 0, e = NumRetVTs; i != e; ++i) in ApplyTypeConstraints() local
1496 for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) { in ApplyTypeConstraints() local
1516 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in ApplyTypeConstraints() local
1576 for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i) { in ApplyTypeConstraints() local
1669 for (unsigned i = 0, e = getNumChildren(); i != e; ++i) in canPatternMatch() local
1689 for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i) in canPatternMatch() local
1707 for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i) in TreePattern() local
1729 for (unsigned i = 0, e = Trees.size(); i != e; ++i) in ComputeNamedNodes() local
1737 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) in ComputeNamedNodes() local
1844 for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i) in ParseTreePattern() local
1902 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) { in SimplifyTree() local
1923 for (unsigned i = 0, e = Trees.size(); i != e; ++i) { in InferAllTypes() local
1944 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) { in InferAllTypes() local
1968 for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) { in InferAllTypes() local
1981 for (unsigned i = 0, e = Trees.size(); i != e; ++i) in InferAllTypes() local
1990 for (unsigned i = 1, e = Args.size(); i != e; ++i) in print() local
1998 for (unsigned i = 0, e = Trees.size(); i != e; ++i) { in print() local
2099 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) { in ParsePatternFragments() local
2124 for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) { in ParsePatternFragments() local
2157 for (unsigned i = 0, e = Fragments.size(); i != e; ++i) { in ParsePatternFragments() local
2187 for (unsigned i = 0, e = DefaultOps[iter].size(); i != e; ++i) { in ParseDefaultOperands() local
2193 for (unsigned op = 0, e = DefaultInfo->getNumArgs(); op != e; ++op) in ParseDefaultOperands() local
2206 for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) { in ParseDefaultOperands() local
2293 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) { in FindPatternInputsAndOutputs() local
2309 for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) { in FindPatternInputsAndOutputs() local
2436 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) in AnalyzeNode() local
2528 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) { in ParseInstructions() local
2546 for (unsigned j = 0, e = InstInfo.Operands.size(); j < e; ++j) in ParseInstructions() local
2553 for (unsigned j = 1, e = InstInfo.Operands.size(); j < e; ++j) in ParseInstructions() local
2587 for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) { in ParseInstructions() local
2644 for (unsigned i = NumResults, e = CGI.Operands.size(); i != e; ++i) { in ParseInstructions() local
2769 for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) in FindNames() local
2820 for (unsigned i = 0, e = Instructions.size(); i != e; ++i) { in InferInstructionFlags() local
2849 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) in ForceArbitraryInstResultType() local
2858 for (unsigned i = 0, e = N->getNumTypes(); i != e; ++i) { in ForceArbitraryInstResultType() local
2873 for (unsigned i = 0, e = Patterns.size(); i != e; ++i) { in ParsePatterns() local
2913 for (unsigned i = 0, e = std::min(Result->getTree(0)->getNumTypes(), in ParsePatterns() local
2974 for (unsigned i = 0, e = Result->getOnlyTree()->getNumTypes(); i != e; ++i) in ParsePatterns() local
2999 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i) in CombineChildVariants() local
3019 for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i) in CombineChildVariants() local
3028 for (unsigned i = 0, e = Orig->getNumTypes(); i != e; ++i) in CombineChildVariants() local
3042 for (unsigned i = 0, e = OutVariants.size(); i != e; ++i) in CombineChildVariants() local
3177 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) in GenerateVariantsOf() local
3190 for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) { in GenerateVariantsOf() local
3235 for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) { in GenerateVariants() local
3255 for (unsigned v = 0, e = Variants.size(); v != e; ++v) { in GenerateVariants() local
3264 for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) { in GenerateVariants() local