reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
386 return mi2iMap.count(&instr); 399 Mi2IndexMap::const_iterator itr = mi2iMap.find(&BundleNonDebug); 400 assert(itr != mi2iMap.end() && "Instruction not found in maps."); 433 Mi2IndexMap::const_iterator MapItr = mi2iMap.find(&*I); 434 if (MapItr != mi2iMap.end()) 450 Mi2IndexMap::const_iterator MapItr = mi2iMap.find(&*I); 451 if (MapItr != mi2iMap.end()) 541 assert(mi2iMap.find(&MI) == mi2iMap.end() && "Instr already indexed."); 541 assert(mi2iMap.find(&MI) == mi2iMap.end() && "Instr already indexed."); 574 mi2iMap.insert(std::make_pair(&MI, newIndex)); 592 Mi2IndexMap::iterator mi2iItr = mi2iMap.find(&MI); 593 if (mi2iItr == mi2iMap.end()) 600 mi2iMap.erase(mi2iItr); 601 mi2iMap.insert(std::make_pair(&NewMI, replaceBaseIndex));lib/CodeGen/SlotIndexes.cpp
32 mi2iMap.clear(); 60 assert(mi2iMap.empty() && 82 mi2iMap.insert(std::make_pair( 107 Mi2IndexMap::iterator mi2iItr = mi2iMap.find(&MI); 108 if (mi2iItr == mi2iMap.end()) 114 mi2iMap.erase(mi2iItr); 120 Mi2IndexMap::iterator mi2iItr = mi2iMap.find(&MI); 121 if (mi2iItr == mi2iMap.end()) 127 mi2iMap.erase(mi2iItr); 138 mi2iMap.insert(std::make_pair(&NextMI, MIIndex)); 215 } else if (MI && mi2iMap.find(MI) == mi2iMap.end()) { 215 } else if (MI && mi2iMap.find(MI) == mi2iMap.end()) { 232 if (!MI.isDebugInstr() && mi2iMap.find(&MI) == mi2iMap.end()) 232 if (!MI.isDebugInstr() && mi2iMap.find(&MI) == mi2iMap.end())