Lines Matching defs:Itr

334   auto Itr = BinaryDataMap.begin();
337   while (Itr != End) {
338     auto Next = std::next(Itr);
340            Itr->second->getSection() == Next->second->getSection() &&
341            Itr->second->containsRange(Next->second->getAddress(),
343       if (Next->second->Parent != Itr->second) {
345                      << "BOLT-WARNING:  " << *Itr->second << "\n"
351     Itr = Next;
384   auto fixParents = [&](BinaryDataMapType::iterator Itr,
386     BinaryData *OldParent = Itr->second->Parent;
387     Itr->second->Parent = NewParent;
388     ++Itr;
389     while (Itr != BinaryDataMap.end() && OldParent &&
390            Itr->second->Parent == OldParent) {
391       Itr->second->Parent = NewParent;
392       ++Itr;
413     auto Itr = std::next(GAI);
415         Itr != BinaryDataMap.end() &&
416         BD->containsRange(Itr->second->getAddress(), Itr->second->getSize())) {
417       Itr->second->Parent = BD;
418       ++Itr;
806   auto Itr = BinaryDataMap.find(Address);
807   if (Itr != BinaryDataMap.end()) {
808     assert(Itr->second->getSize() == Size || !Size);
809     return Itr->second->getSymbol();
1172       auto Itr = llvm::find_if(BD.getSymbols(), [&](const MCSymbol *Symbol) {
1175       if (Itr != BD.getSymbols().end()) {
1176         size_t Idx = std::distance(BD.getSymbols().begin(), Itr);
1486     auto isNotHole = [&Section](const binary_data_iterator &Itr) {
1487       BinaryData *BD = Itr->second;
1497     auto Itr = FilteredBinaryDataIterator(isNotHole, BDStart, BDEnd);
1502     while (Itr != End) {
1503       if (Itr->second->getAddress() > EndAddress) {
1504         uint64_t Gap = Itr->second->getAddress() - EndAddress;
1507       EndAddress = Itr->second->getEndAddress();
1508       ++Itr;
2167   auto Itr = Sections.find(SectionPtr);
2168   if (Itr != Sections.end()) {
2179     Sections.erase(Itr);
2188   auto Itr = Sections.find(&Section);
2189   assert(Itr != Sections.end() && "Section must exist to be renamed.");
2190   Sections.erase(Itr);