Lines Matching refs:size
97 heap_values_for_(graph->GetBlocks().size(), in LSEVisitor()
166 size_t size = removed_loads_.size(); in FindSubstitute() local
167 for (size_t i = 0; i < size; i++) { in FindSubstitute()
205 size_t size = removed_loads_.size(); in RemoveInstructions() local
206 DCHECK_EQ(size, substitute_instructions_for_loads_.size()); in RemoveInstructions()
207 for (size_t i = 0; i < size; i++) { in RemoveInstructions()
324 for (size_t i = 0; i < heap_values.size(); i++) { in KeepStoresIfAliasedToLocation()
343 for (size_t i = 0; i < heap_values.size(); i++) { in HandleLoopSideEffects()
347 for (size_t i = 0; i < heap_values.size(); i++) { in HandleLoopSideEffects()
354 for (size_t i = 0; i < heap_values.size(); i++) { in HandleLoopSideEffects()
361 for (size_t i = 0; i < heap_values.size(); i++) { in HandleLoopSideEffects()
380 if (predecessors.size() == 0) { in MergePredecessorValues()
391 for (size_t i = 0; i < heap_values.size(); i++) { in MergePredecessorValues()
485 } else if (predecessors.size() == 1) { in MergePredecessorValues()
669 for (size_t i = 0; i < heap_values.size(); i++) { in VisitSetLocation()
770 for (size_t i = 0; i < heap_values.size(); i++) { in HandleExit()
795 for (size_t i = 0; i < heap_values.size(); i++) { in HandleInvoke()
854 for (size_t i = 0; i < heap_values.size(); i++) { in VisitNewInstance()
882 for (size_t i = 0; i < heap_values.size(); i++) { in VisitNewArray()