Lines Matching refs:Entry
69 /// If the set becomes empty, remove Inst's entry.
216 // No dependence found. If this is the entry block of the function, it is
670 // No dependence found. If this is the entry block of the function, it is
683 // If the cached entry is non-dirty, just return it. Note that this depends
688 // Otherwise, if we have a dirty entry, we know we can start the scan at that
700 // No dependence found. If this is the entry block of the function, it is
760 // Okay, we have a cache entry. If we know it is not dirty, just return it
769 for (auto &Entry : Cache)
770 if (Entry.getResult().isDirty())
771 DirtyBlocks.push_back(Entry.getBB());
804 // Do a binary search to see if we already have an entry for this block in
807 NonLocalDepInfo::iterator Entry =
810 if (Entry != Cache.begin() && std::prev(Entry)->getBB() == DirtyBB)
811 --Entry;
814 if (Entry != Cache.begin() + NumSortedEntries &&
815 Entry->getBB() == DirtyBB) {
816 // If we already have an entry, and if it isn't already dirty, the block
818 if (!Entry->getResult().isDirty())
822 ExistingResult = &*Entry;
825 // If the dirty entry has a pointer, start scanning from it so we don't have
844 // No dependence found. If this is the entry block of the function, it is
851 // If we had a dirty entry for the block, update it. Otherwise, just add
852 // a new entry.
934 // Do a binary search to see if we already have an entry for this block in
936 NonLocalDepInfo::iterator Entry = std::upper_bound(
938 if (Entry != Cache->begin() && (Entry - 1)->getBB() == BB)
939 --Entry;
942 if (Entry != Cache->begin() + NumSortedEntries && Entry->getBB() == BB)
943 ExistingResult = &*Entry;
945 // If we have a cached entry, and it is non-dirty, use it as the value for
953 // entry, start scanning from its position, otherwise we scan from the end
962 // Eliminating the dirty entry from 'Cache', so update the reverse info.
973 // If we had a dirty entry for the block, update it. Otherwise, just add
974 // a new entry.
1010 MemoryDependenceResults::NonLocalDepInfo::iterator Entry =
1012 Cache.insert(Entry, Val);
1016 // One new entry, Just insert the new value at the appropriate position.
1020 MemoryDependenceResults::NonLocalDepInfo::iterator Entry =
1022 Cache.insert(Entry, Val);
1053 // Set up a temporary NLPI value. If the map doesn't yet have an entry for
1067 // If we already have a cache entry for this CacheKey, we may need to do some
1068 // work to reconcile the cache entry and the current query.
1075 for (auto &Entry : CacheInfo->NonLocalDeps)
1076 if (Instruction *Inst = Entry.getResult().getInst())
1094 for (auto &Entry : CacheInfo->NonLocalDeps)
1095 if (Instruction *Inst = Entry.getResult().getInst())
1117 for (auto &Entry : *Cache) {
1119 Visited.find(Entry.getBB());
1131 for (auto &Entry : *Cache) {
1132 Visited.insert(std::make_pair(Entry.getBB(), Addr));
1133 if (Entry.getResult().isNonLocal()) {
1137 if (DT.isReachableFromEntry(Entry.getBB())) {
1139 NonLocalDepResult(Entry.getBB(), Entry.getResult(), Addr));
1340 // Add the entry to the Result list.
1341 NonLocalDepResult Entry(Pred, MemDepResult::getUnknown(), PredPtrVal);
1342 Result.push_back(Entry);
1435 // Eliminating the dirty entry from 'Cache', so update the reverse info.
1463 for (auto &Entry : BlockMap)
1464 if (Instruction *Inst = Entry.getResult().getInst())
1497 // we need to replace its entry with a dirty version of the instruction after
1546 for (auto &Entry : INLD.first) {
1547 if (Entry.getResult().getInst() != RemInst)
1550 // Convert to a dirty entry for the subsequent instruction.
1551 Entry.setResult(NewDirtyVal);
1586 for (auto &Entry : NLPDI) {
1587 if (Entry.getResult().getInst() != RemInst)
1590 // Convert to a dirty entry for the subsequent instruction.
1591 Entry.setResult(NewDirtyVal);
1597 // Re-sort the NonLocalDepInfo. Changing the dirty entry to its
1628 for (const auto &Entry : DepKV.second.NonLocalDeps)
1629 assert(Entry.getResult().getInst() != D && "Inst occurs as NLPD value");
1635 for (const auto &Entry : INLD.first)
1636 assert(Entry.getResult().getInst() != D &&
