87   for (unsigned i = 0, e = LegalTypes.size(); i != e; ++i)  in FillWithPossibleTypes()  local
110   for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)  in hasIntegerTypes()  local
119   for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)  in hasFloatingPointTypes()  local
127   for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)  in hasScalarTypes()  local
136   for (unsigned i = 0, e = TypeVec.size(); i != e; ++i)  in hasVectorTypes()  local
148   for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) {  in getName()  local
224     for (unsigned j = 0, e = InVT.TypeVec.size(); j != e; ++j)  in MergeInTypeInfo()  local
686     for (size_t i = 0, e = N->getNumChildren(); i != e; ++i)  in FindDepVarsOf()  local
709          e = DepVars.end(); i != e; ++i) {  in DumpDepVars()  local
814   for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i) {  in getPatternSize()  local
845   for (unsigned i = 0, e = Predicates->getSize(); i != e; ++i) {  in getPredicateCheck()  local
1095   for (unsigned i = 0, e = PropList.size(); i != e; ++i) {  in SDNodeInfo()  local
1141   for (unsigned i = 0, e = TypeConstraints.size(); i != e; ++i) {  in getKnownType()  local
1236   for (unsigned i = 0, e = Types.size(); i != e; ++i)  in print()  local
1243       for (unsigned i = 1, e = getNumChildren(); i != e; ++i) {  in print()  local
1251   for (unsigned i = 0, e = PredicateFns.size(); i != e; ++i)  in print()  local
1291   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in isIsomorphicTo()  local
1306     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in clone()  local
1319   for (unsigned i = 0, e = Types.size(); i != e; ++i)  in RemoveAllTypes()  local
1322   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in RemoveAllTypes()  local
1333   for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in SubstituteFormalArguments()  local
1369     for (unsigned i = 0, e = getNumChildren(); i != e; ++i) {  in InlinePatternFragments()  local
1403     for (unsigned i = 0, e = Frag->getNumArgs(); i != e; ++i)  in InlinePatternFragments()  local
1410   for (unsigned i = 0, e = Types.size(); i != e; ++i)  in InlinePatternFragments()  local
1414   for (unsigned i = 0, e = getPredicateFns().size(); i != e; ++i)  in InlinePatternFragments()  local
1610   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in TreeHasProperty()  local
1663       for (unsigned i = 0, e = Types.size(); i != e; ++i)  in ApplyTypeConstraints()  local
1736     for (unsigned i = 0, e = NumRetVTs; i != e; ++i)  in ApplyTypeConstraints()  local
1749     for (unsigned i = 0, e = getNumChildren()-1; i != e; ++i) {  in ApplyTypeConstraints()  local
1771     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()  local
1841     for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i) {  in ApplyTypeConstraints()  local
1903     for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in ApplyTypeConstraints()  local
1962   for (unsigned i = 0, e = getNumChildren(); i != e; ++i)  in canPatternMatch()  local
1985       for (unsigned i = Skip, e = getNumChildren()-1; i != e; ++i)  in canPatternMatch()  local
2003   for (unsigned i = 0, e = RawPat->getSize(); i != e; ++i)  in TreePattern()  local
2028   for (unsigned i = 0, e = Trees.size(); i != e; ++i)  in ComputeNamedNodes()  local
2036   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ComputeNamedNodes()  local
2154   for (unsigned i = 0, e = Dag->getNumArgs(); i != e; ++i)  in ParseTreePattern()  local
2233   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in SimplifyTree()  local
2254     for (unsigned i = 0, e = Trees.size(); i != e; ++i) {  in InferAllTypes()  local
2277         for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {  in InferAllTypes()  local
2301         for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) {  in InferAllTypes()  local
2314   for (unsigned i = 0, e = Trees.size(); i != e; ++i)  in InferAllTypes()  local
2323     for (unsigned i = 1, e = Args.size(); i != e; ++i)  in print()  local
2331   for (unsigned i = 0, e = Trees.size(); i != e; ++i) {  in print()  local
2429   for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {  in ParsePatternFragments()  local
2459     for (unsigned j = 0, e = OpsList->getNumArgs(); j != e; ++j) {  in ParsePatternFragments()  local
2491   for (unsigned i = 0, e = Fragments.size(); i != e; ++i) {  in ParsePatternFragments()  local
2516   for (unsigned i = 0, e = DefaultOps.size(); i != e; ++i) {  in ParseDefaultOperands()  local
2522     for (unsigned op = 0, e = DefaultInfo->getNumArgs(); op != e; ++op)  in ParseDefaultOperands()  local
2535     for (unsigned op = 0, e = T->getNumChildren(); op != e; ++op) {  in ParseDefaultOperands()  local
2618     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()  local
2634     for (unsigned i = 0, e = Pat->getNumChildren(); i != e; ++i) {  in FindPatternInputsAndOutputs()  local
2758     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in AnalyzeNode()  local
2853   for (unsigned i = 0, e = DI->getNumArgs(); i != e; ++i) {  in hasNullFragReference()  local
2865   for (unsigned i = 0, e = LI->getSize(); i != e; ++i) {  in hasNullFragReference()  local
2881   for (unsigned i = 0, e = Tree->getNumChildren(); i != e; ++i)  in getInstructionsInTree()  local
2931   for (unsigned j = 0, e = I->getNumTrees(); j != e; ++j) {  in parseInstructionPattern()  local
2987   for (unsigned i = NumResults, e = CGI.Operands.size(); i != e; ++i) {  in parseInstructionPattern()  local
3069   for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {  in ParseInstructions()  local
3088         for (unsigned j = 0, e = InstInfo.Operands.NumDefs; j < e; ++j)  in ParseInstructions()  local
3093                e = InstInfo.Operands.size(); j < e; ++j)  in ParseInstructions()  local
3159     for (unsigned i = 0, e = P->getNumChildren(); i != e; ++i)  in FindNames()  local
3217   for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {  in InferInstructionFlags()  local
3262     for (unsigned i = 0, e = Revisit.size(); i != e; ++i) {  in InferInstructionFlags()  local
3275   for (unsigned i = 0, e = Revisit.size(); i != e; ++i) {  in InferInstructionFlags()  local
3306     for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {  in VerifyInstructionFlags()  local
3339     for (unsigned i = 0, e = Msgs.size(); i != e; ++i)  in VerifyInstructionFlags()  local
3344     for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {  in VerifyInstructionFlags()  local
3366   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in ForceArbitraryInstResultType()  local
3375   for (unsigned i = 0, e = N->getNumTypes(); i != e; ++i) {  in ForceArbitraryInstResultType()  local
3390   for (unsigned i = 0, e = Patterns.size(); i != e; ++i) {  in ParsePatterns()  local
3435       for (unsigned i = 0, e = std::min(Result.getTree(0)->getNumTypes(),  in ParsePatterns()  local
3496     for (unsigned i = 0, e = Result.getOnlyTree()->getNumTypes(); i != e; ++i)  in ParsePatterns()  local
3521   for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)  in CombineChildVariants()  local
3541     for (unsigned i = 0, e = ChildVariants.size(); i != e; ++i)  in CombineChildVariants()  local
3550     for (unsigned i = 0, e = Orig->getNumTypes(); i != e; ++i)  in CombineChildVariants()  local
3564       for (unsigned i = 0, e = OutVariants.size(); i != e; ++i)  in CombineChildVariants()  local
3699   for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i)  in GenerateVariantsOf()  local
3712     for (unsigned i = 0, e = N->getNumChildren(); i != e; ++i) {  in GenerateVariantsOf()  local
3757   for (unsigned i = 0, e = PatternsToMatch.size(); i != e; ++i) {  in GenerateVariants()  local
3777     for (unsigned v = 0, e = Variants.size(); v != e; ++v) {  in GenerateVariants()  local
3786       for (unsigned p = 0, e = PatternsToMatch.size(); p != e; ++p) {  in GenerateVariants()  local