166   auto itr = recurrent_node_map_.find(inst);  in AnalyzeInstruction()  local
167   if (itr != recurrent_node_map_.end()) return itr->second;  in AnalyzeInstruction()
366   auto itr = node_cache_.find(prospective_node);  in GetCachedOrAdd()  local
367   if (itr != node_cache_.end()) {  in GetCachedOrAdd()
368     return (*itr).get();  in GetCachedOrAdd()
378   for (auto itr = node->graph_cbegin(); itr != node->graph_cend(); ++itr) {  in IsLoopInvariant()  local
379     if (const SERecurrentNode* rec = itr->AsSERecurrentNode()) {  in IsLoopInvariant()
387     } else if (const SEValueUnknown* unknown = itr->AsSEValueUnknown()) {  in IsLoopInvariant()
400   for (auto itr = node->graph_begin(); itr != node->graph_end(); ++itr) {  in GetCoefficientFromRecurrentTerm()  local
401     SERecurrentNode* rec = itr->AsSERecurrentNode();  in GetCoefficientFromRecurrentTerm()
449   for (auto itr : *node) {  in BuildGraphWithoutRecurrentTerm()
450     recurrent = itr->AsSERecurrentNode();  in BuildGraphWithoutRecurrentTerm()
454       new_children.push_back(itr);  in BuildGraphWithoutRecurrentTerm()
470   for (auto itr = node->graph_begin(); itr != node->graph_end(); ++itr) {  in GetRecurrentTerm()  local
471     SERecurrentNode* rec = itr->AsSERecurrentNode();  in GetRecurrentTerm()