|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
examples/Kaleidoscope/BuildingAJIT/Chapter1/toy.cpp 721 return FI->second->codegen();
995 ExprAST *Init = VarNames[i].second.get();
examples/Kaleidoscope/BuildingAJIT/Chapter2/toy.cpp 721 return FI->second->codegen();
995 ExprAST *Init = VarNames[i].second.get();
examples/Kaleidoscope/BuildingAJIT/Chapter3/toy.cpp 720 return FI->second->codegen();
994 ExprAST *Init = VarNames[i].second.get();
examples/Kaleidoscope/BuildingAJIT/Chapter4/toy.cpp 706 return FI->second->codegen();
980 ExprAST *Init = VarNames[i].second.get();
examples/Kaleidoscope/BuildingAJIT/Chapter5/toy.cpp 730 return FI->second->codegen();
1004 ExprAST *Init = VarNames[i].second.get();
examples/Kaleidoscope/Chapter4/toy.cpp 434 return FI->second->codegen();
examples/Kaleidoscope/Chapter5/toy.cpp 561 return FI->second->codegen();
examples/Kaleidoscope/Chapter6/toy.cpp 653 return FI->second->codegen();
examples/Kaleidoscope/Chapter7/toy.cpp 726 return FI->second->codegen();
1000 ExprAST *Init = VarNames[i].second.get();
examples/Kaleidoscope/Chapter8/toy.cpp 725 return FI->second->codegen();
999 ExprAST *Init = VarNames[i].second.get();
examples/Kaleidoscope/Chapter9/toy.cpp 348 NamedVar.second->dump(indent(out, ind) << NamedVar.first << ':', ind + 1);
878 return FI->second->codegen();
1164 ExprAST *Init = VarNames[i].second.get();
gen/lib/Target/AArch64/AArch64GenAsmMatcher.inc27439 std::distance(MnemonicRange.first, MnemonicRange.second) <<
27443 if (MnemonicRange.first == MnemonicRange.second)
27446 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
40867 if (MnemonicRange.first == MnemonicRange.second)
40871 *ie = MnemonicRange.second; it != ie; ++it) {
gen/lib/Target/AArch64/AArch64GenGICombiner.inc 56 if (!RangePair.second.empty()) {
58 const auto Last = getRuleIdxForIdentifier(RangePair.second);
gen/lib/Target/AMDGPU/AMDGPUGenAsmMatcher.inc23964 std::distance(MnemonicRange.first, MnemonicRange.second) <<
23968 if (MnemonicRange.first == MnemonicRange.second)
23971 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
80419 if (MnemonicRange.first == MnemonicRange.second)
80423 *ie = MnemonicRange.second; it != ie; ++it) {
gen/lib/Target/ARM/ARMGenAsmMatcher.inc15097 std::distance(MnemonicRange.first, MnemonicRange.second) <<
15101 if (MnemonicRange.first == MnemonicRange.second)
15104 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
16353 if (MnemonicRange.first == MnemonicRange.second)
16357 *ie = MnemonicRange.second; it != ie; ++it) {
gen/lib/Target/AVR/AVRGenAsmMatcher.inc 1292 std::distance(MnemonicRange.first, MnemonicRange.second) <<
1296 if (MnemonicRange.first == MnemonicRange.second)
1299 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
1512 if (MnemonicRange.first == MnemonicRange.second)
1516 *ie = MnemonicRange.second; it != ie; ++it) {
gen/lib/Target/BPF/BPFGenAsmMatcher.inc 937 std::distance(MnemonicRange.first, MnemonicRange.second) <<
941 if (MnemonicRange.first == MnemonicRange.second)
944 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
gen/lib/Target/Hexagon/HexagonGenAsmMatcher.inc10283 std::distance(MnemonicRange.first, MnemonicRange.second) <<
10287 if (MnemonicRange.first == MnemonicRange.second)
10290 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
gen/lib/Target/Lanai/LanaiGenAsmMatcher.inc 1076 std::distance(MnemonicRange.first, MnemonicRange.second) <<
1080 if (MnemonicRange.first == MnemonicRange.second)
1083 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
1320 if (MnemonicRange.first == MnemonicRange.second)
1324 *ie = MnemonicRange.second; it != ie; ++it) {
gen/lib/Target/MSP430/MSP430GenAsmMatcher.inc 1134 std::distance(MnemonicRange.first, MnemonicRange.second) <<
1138 if (MnemonicRange.first == MnemonicRange.second)
1141 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
gen/lib/Target/Mips/MipsGenAsmMatcher.inc 8110 std::distance(MnemonicRange.first, MnemonicRange.second) <<
8114 if (MnemonicRange.first == MnemonicRange.second)
8117 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
11692 if (MnemonicRange.first == MnemonicRange.second)
11696 *ie = MnemonicRange.second; it != ie; ++it) {
gen/lib/Target/PowerPC/PPCGenAsmMatcher.inc 7039 std::distance(MnemonicRange.first, MnemonicRange.second) <<
7043 if (MnemonicRange.first == MnemonicRange.second)
7046 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
gen/lib/Target/RISCV/RISCVGenAsmMatcher.inc 2428 std::distance(MnemonicRange.first, MnemonicRange.second) <<
2432 if (MnemonicRange.first == MnemonicRange.second)
2435 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
2789 if (MnemonicRange.first == MnemonicRange.second)
2793 *ie = MnemonicRange.second; it != ie; ++it) {
gen/lib/Target/Sparc/SparcGenAsmMatcher.inc 4172 std::distance(MnemonicRange.first, MnemonicRange.second) <<
4176 if (MnemonicRange.first == MnemonicRange.second)
4179 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
4497 if (MnemonicRange.first == MnemonicRange.second)
4501 *ie = MnemonicRange.second; it != ie; ++it) {
gen/lib/Target/SystemZ/SystemZGenAsmMatcher.inc 5367 std::distance(MnemonicRange.first, MnemonicRange.second) <<
5371 if (MnemonicRange.first == MnemonicRange.second)
5374 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
9215 if (MnemonicRange.first == MnemonicRange.second)
9219 *ie = MnemonicRange.second; it != ie; ++it) {
gen/lib/Target/WebAssembly/WebAssemblyGenAsmMatcher.inc 1136 std::distance(MnemonicRange.first, MnemonicRange.second) <<
1140 if (MnemonicRange.first == MnemonicRange.second)
1143 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
gen/lib/Target/X86/X86GenAsmMatcher.inc36967 std::distance(MnemonicRange.first, MnemonicRange.second) <<
36971 if (MnemonicRange.first == MnemonicRange.second)
36974 for (const MatchEntry *it = MnemonicRange.first, *ie = MnemonicRange.second;
gen/tools/clang/include/clang/AST/Attrs.inc13794 Ret.Architecture = Feature.split("=").second.trim();
13796 Ret.Features.push_back("-" + Feature.split("-").second.str());
include/llvm/ADT/BreadthFirstIterator.h 81 Optional<ChildItTy> &ChildIt = H.second;
89 if (this->Visited.insert(Next).second)
include/llvm/ADT/DenseMap.h 45 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; }
46 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; }
196 return try_emplace(KV.first, KV.second);
203 return try_emplace(std::move(KV.first), std::move(KV.second));
259 std::move(KV.second), Val);
300 return FindAndConstruct(Key).second;
312 return FindAndConstruct(std::move(Key)).second;
663 if (I == RHS.end() || I->second != KV.second)
663 if (I == RHS.end() || I->second != KV.second)
include/llvm/ADT/DenseMapInfo.h 202 | (uint64_t)SecondInfo::getHashValue(PairVal.second);
216 SecondInfo::isEqual(LHS.second, RHS.second);
216 SecondInfo::isEqual(LHS.second, RHS.second);
include/llvm/ADT/DepthFirstIterator.h 110 if (this->Visited.insert(Node).second)
122 Optional<ChildItTy> &Opt = VisitStack.back().second;
133 if (this->Visited.insert(Next).second) {
include/llvm/ADT/FoldingSet.h 755 ID.Add(P.second);
include/llvm/ADT/Hashing.h 647 return hash_combine(arg.first, arg.second);
include/llvm/ADT/ImmutableMap.h 40 return V.second;
56 ImutContainerInfo<S>::Profile(ID, V.second);
217 data_type_ref getData() const { return (*this)->second; }
226 if (T) return &T->getValue().second;
377 data_type_ref getData() const { return (*this)->second; }
386 if (T) return &T->getValue().second;
include/llvm/ADT/IntervalMap.h 566 const KeyT &stop(unsigned i) const { return this->first[i].second; }
570 KeyT &stop(unsigned i) { return this->first[i].second; }
2037 P.offset(Level) = NewOffset.second;
include/llvm/ADT/MapVector.h 101 auto &I = Result.first->second;
102 if (Result.second) {
106 return Vector[I].second;
114 return Pos == Map.end()? ValueT() : Vector[Pos->second].second;
114 return Pos == Map.end()? ValueT() : Vector[Pos->second].second;
120 auto &I = Result.first->second;
121 if (Result.second) {
122 Vector.push_back(std::make_pair(KV.first, KV.second));
133 auto &I = Result.first->second;
134 if (Result.second) {
150 (Vector.begin() + Pos->second);
156 (Vector.begin() + Pos->second);
182 assert(I.second != Index && "Index was already erased!");
183 if (I.second > Index)
184 --I.second;
include/llvm/ADT/PostOrderIterator.h 64 return Visited.insert(To).second;
84 return Visited.insert(To).second;
127 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
128 NodeRef BB = *VisitStack.back().second++;
include/llvm/ADT/PriorityWorklist.h 94 if (InsertResult.second) {
100 auto &Index = InsertResult.first->second;
126 if (InsertResult.second)
131 ptrdiff_t &Index = InsertResult.first->second;
168 assert(V[I->second] == X && "Value not actually at index in map!");
169 if (I->second == (ptrdiff_t)(V.size() - 1)) {
174 V[I->second] = T();
include/llvm/ADT/SCCIterator.h 168 unsigned childNum = Visited->second;
include/llvm/ADT/STLExtras.h 739 end_iterators(std::forward<Iters>(ts.second)...) {}
971 return lhs.second < rhs.second;
971 return lhs.second < rhs.second;
1139 delete V.second;
1376 return std::hash<First>()(P.first) * 31 + std::hash<Second>()(P.second);
include/llvm/ADT/ScopedHashTable.h 189 return I->second->getValue();
include/llvm/ADT/SetOperations.h 27 if (S1.insert(*SI).second)
include/llvm/ADT/SetVector.h 142 bool result = set_.insert(X).second;
152 if (set_.insert(*Start).second)
include/llvm/ADT/SmallPtrSet.h 372 return std::make_pair(makeIterator(p.first), p.second);
include/llvm/ADT/SmallSet.h 182 return std::make_pair(None, Set.insert(V).second);
include/llvm/ADT/StringMap.h 414 return try_emplace(KV.first, std::move(KV.second));
422 if (!Ret.second)
include/llvm/ADT/UniqueVector.h 62 if (MI != Map.end()) return MI->second;
include/llvm/ADT/iterator.h 359 NR.second = *this->I;
include/llvm/ADT/iterator_range.h 59 return iterator_range<T>(std::move(p.first), std::move(p.second));
include/llvm/Analysis/AssumptionCache.h 146 return AVI->second;
include/llvm/Analysis/BlockFrequencyInfoImpl.h 675 IrrNode &Irr = *L->second;
1097 LoopData *Parent = Q.front().second;
include/llvm/Analysis/CGSCCPassManager.h 592 .first->second;
671 auto &CallCountNew = Pair.second;
674 const auto &CallCountOld = CountIt->second;
include/llvm/Analysis/CallGraph.h 124 return I->second.get();
131 return I->second.get();
203 return CalledFunctions[i].second;
219 CalledFunctions.back().second->DropRef();
241 I->second->DropRef();
412 static CallGraphNode *CGNGetValue(CGNPairTy P) { return P.second; }
432 static const CallGraphNode *CGNGetValue(CGNPairTy P) { return P.second; }
451 static NodeRef edge_dest(EdgeRef E) { return E.second; }
464 return P.second.get();
491 return P.second.get();
include/llvm/Analysis/DominanceFrontierImpl.h 53 I->second.erase(BB);
61 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
62 I->second.erase(Node);
69 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
70 I->second.erase(Node);
105 tmpFrontiers.insert(std::make_pair(I->first, I->second));
115 if (compareDomSet(I->second, DFI->second))
115 if (compareDomSet(I->second, DFI->second))
138 const std::set<BlockT *> &BBs = I->second;
182 if (visited.insert(currentBB).second) {
include/llvm/Analysis/IntervalIterator.h 144 Interval::succ_iterator &SuccIt = IntStack.back().second,
178 if (!Visited.insert(Header).second)
include/llvm/Analysis/IntervalPartition.h 81 return I != IntervalMap.end() ? I->second : nullptr;
include/llvm/Analysis/IteratedDominanceFrontier.h 81 Ret.emplace_back(SnapShotBBPair.second);
include/llvm/Analysis/LazyCallGraph.h 264 auto &E = Edges[EdgeIndexMap.find(&N)->second];
273 auto &E = Edges[EI->second];
627 return SCCs.begin() + SCCIndices.find(&C)->second;
924 RC = getRC(*G, G->RefSCCIndices.find(RC)->second + 1);
1111 if (Visited.insert(cast<Constant>(Op)).second)
1205 assert(PostOrderRefSCCs[IndexIt->second] == &RC &&
1207 return IndexIt->second;
include/llvm/Analysis/LoopCacheAnalysis.h 203 return (IT != LoopCosts.end()) ? (*IT).second : -1;
240 return A.second > B.second;
240 return A.second > B.second;
include/llvm/Analysis/LoopInfo.h 990 for (LoopT *L = I->second; L; L = L->getParentLoop())
include/llvm/Analysis/LoopInfoImpl.h 110 if (Visited.insert(Successor).second)
693 LoopT *L = Entry.second;
729 dbgs() << "Found new loop: " << *HeaderAndLoop.second << "\n";
include/llvm/Analysis/LoopIterator.h 67 return N.second != L->getHeader() && L->contains(N.second);
67 return N.second != L->getHeader() && L->contains(N.second);
78 {succ_begin(Node.second), Node.first},
79 {succ_end(Node.second), Node.first}),
86 {succ_begin(Node.second), Node.first},
87 {succ_end(Node.second), Node.first}),
148 return I != PostNumbers.end() && I->second;
155 assert(I->second && "block not finished by DFS");
156 return I->second;
235 return DFS.PostNumbers.insert(std::make_pair(BB, 0)).second;
include/llvm/Analysis/MemoryBuiltins.h 251 return SizeOffset.second.getBitWidth() > 1;
319 return SizeOffset.second;
include/llvm/Analysis/MemorySSA.h 805 return It == PerBlockAccesses.end() ? nullptr : It->second.get();
811 return It == PerBlockDefs.end() ? nullptr : It->second.get();
1187 : DefIterator(Info.first), Location(Info.second),
1230 CurrentPair.second = Location.getWithNewPtr(Translator.getAddr());
1234 CurrentPair.second = Location;
include/llvm/Analysis/RegionInfoImpl.h 371 return at->second.get();
583 DST *entrySuccs = &DF->find(entry)->second;
598 DST *exitSuccs = &DF->find(exit)->second;
633 BlockT *BB = e->second;
646 return PDT->getNode(e->second)->getIDom();
761 RegionT *newRegion = it->second;
821 return I != BBtoRegion.end() ? I->second : nullptr;
include/llvm/Analysis/ScalarEvolution.h 1436 if (!Pair.second)
1437 Pair.first->second = std::move(CR);
1438 return Pair.first->second;
include/llvm/Analysis/ScalarEvolutionExpressions.h 567 if (Visited.insert(S).second && Visitor.follow(S))
665 return It->second;
668 assert(Result.second && "Should insert a new entry");
669 return Result.first->second;
include/llvm/Analysis/SparsePropagation.h 152 return I != ValueState.end() ? I->second : LatticeFunc->getUntrackedVal();
231 return I->second; // Common case, in the map
247 if (I != ValueState.end() && I->second == LV)
260 if (!BBExecutable.insert(BB).second)
269 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
405 if (ChangedValue.second != LatticeFunc->getUntrackedVal())
407 std::move(ChangedValue.second));
460 if (ChangedValue.second != LatticeFunc->getUntrackedVal())
461 UpdateState(ChangedValue.first, ChangedValue.second);
include/llvm/Analysis/TargetLibraryInfo.h 300 return Impl->CustomNames.find(F)->second;
include/llvm/Analysis/VectorUtils.h 453 return Member->second;
460 if (I.second == Instr)
548 DelSet.insert(I.second);
567 return InterleaveGroupMap.find(Instr)->second;
699 auto SrcDes = A->second;
703 auto SinkDes = B->second;
include/llvm/CodeGen/BasicTTIImpl.h 584 if (!isa<Constant>(A) && UniqueOperands.insert(A).second) {
640 if (TLI->isOperationLegalOrPromote(ISD, LT.second)) {
646 if (!TLI->isOperationExpand(ISD, LT.second)) {
697 SrcLT.second.getSizeInBits() == DstLT.second.getSizeInBits()) {
697 SrcLT.second.getSizeInBits() == DstLT.second.getSizeInBits()) {
705 TLI->isTruncateFree(SrcLT.second, DstLT.second))
705 TLI->isTruncateFree(SrcLT.second, DstLT.second))
709 TLI->isZExtFree(SrcLT.second, DstLT.second))
709 TLI->isZExtFree(SrcLT.second, DstLT.second))
731 TLI->isOperationLegalOrPromote(ISD, DstLT.second))
742 if (!TLI->isOperationExpand(ISD, DstLT.second))
753 SrcLT.second.getSizeInBits() == DstLT.second.getSizeInBits()) {
753 SrcLT.second.getSizeInBits() == DstLT.second.getSizeInBits()) {
766 if (!TLI->isOperationExpand(ISD, DstLT.second))
839 if (!(ValTy->isVectorTy() && !LT.second.isVector()) &&
840 !TLI->isOperationExpand(ISD, LT.second)) {
882 Src->getPrimitiveSizeInBits() < LT.second.getSizeInBits()) {
889 LA = getTLI()->getTruncStoreAction(LT.second, MemVT);
891 LA = getTLI()->getLoadExtAction(ISD::EXTLOAD, LT.second, MemVT);
930 MVT VecTyLT = getTLI()->getTypeLegalizationCost(DL, VecTy).second;
1466 if (TLI->isOperationLegalOrPromote(ISD, LT.second)) {
1467 if (IID == Intrinsic::fabs && LT.second.isFloatingPoint() &&
1468 TLI->isFAbsFree(LT.second)) {
1480 } else if (!TLI->isOperationExpand(ISD, LT.second)) {
1608 LT.second.isVector() ? LT.second.getVectorNumElements() : 1;
1608 LT.second.isVector() ? LT.second.getVectorNumElements() : 1;
1667 LT.second.isVector() ? LT.second.getVectorNumElements() : 1;
1667 LT.second.isVector() ? LT.second.getVectorNumElements() : 1;
include/llvm/CodeGen/FunctionLoweringInfo.h 114 V = DuplIt->second;
264 unsigned Reg = It->second;
include/llvm/CodeGen/GlobalISel/GISelWorkList.h 70 if (!WorklistMap.try_emplace(Worklist[i], i).second)
80 if (WorklistMap.try_emplace(I, Worklist.size()).second)
92 Worklist[It->second] = nullptr;
include/llvm/CodeGen/GlobalISel/IRTranslator.h 87 return It->second;
95 return It->second;
602 return RemappedEdge->second;
include/llvm/CodeGen/GlobalISel/InstructionSelectorImpl.h 213 const int64_t TypeID = TyI->second;
include/llvm/CodeGen/GlobalISel/LegalizerInfo.h 1200 AddrSpace2PointerActions[OpcodeIdx].find(AddressSpace)->second;
1229 NumElements2Actions[OpcodeIdx].find(ElementSize)->second;
1254 switch (v[i].second) {
include/llvm/CodeGen/LexicalScopes.h 182 return I != AbstractScopeMap.end() ? &I->second : nullptr;
188 return I != InlinedLexicalScopeMap.end() ? &I->second : nullptr;
194 return I != LexicalScopeMap.end() ? &I->second : nullptr;
include/llvm/CodeGen/LiveIntervals.h 357 return getRegMaskSlots().slice(P.first, P.second);
368 return getRegMaskBits().slice(P.first, P.second);
include/llvm/CodeGen/LiveRegUnits.h 96 LaneBitmask UnitMask = (*Unit).second;
include/llvm/CodeGen/LiveStacks.h 67 return I->second;
74 return I->second;
85 return I->second;
include/llvm/CodeGen/MachineDominators.h 245 bool Inserted = NewBBs.insert(NewBB).second;
include/llvm/CodeGen/MachinePipeliner.h 273 return It->second.first;
557 return (it->second - FirstCycle) / InitiationInterval;
565 return (it->second - FirstCycle) % InitiationInterval;
include/llvm/CodeGen/MachineRegisterInfo.h 112 return VRegInfo[RegNo.id()].second;
118 return VRegInfo[RegNo.id()].second;
765 RegAllocHints[VReg].second.clear();
766 RegAllocHints[VReg].second.push_back(PrefReg);
773 RegAllocHints[VReg].second.push_back(PrefReg);
785 RegAllocHints[VReg].second.clear();
794 unsigned BestHint = (RegAllocHints[VReg.id()].second.size() ?
795 RegAllocHints[VReg.id()].second[0] : 0);
805 return Hint.first ? 0 : Hint.second;
include/llvm/CodeGen/ModuloSchedule.h 113 NumStages = std::max(NumStages, KV.second);
135 return I == Stage.end() ? -1 : I->second;
141 return I == Cycle.end() ? -1 : I->second;
231 Stages.second)
244 if (Stages.second)
include/llvm/CodeGen/PBQP/Solution.h 48 return sItr->second;
include/llvm/CodeGen/RegAllocPBQP.h 154 return VRegItr->second;
include/llvm/CodeGen/RegisterPressure.h 308 if (!InsertRes.second) {
include/llvm/CodeGen/ScheduleDAGInstrs.h 399 return I->second;
include/llvm/CodeGen/SelectionDAG.h 193 return I->second;
1698 return std::move(I->second).CSInfo;
1711 return It->second.HeapAllocSite;
include/llvm/CodeGen/SelectionDAGNodes.h 915 if (Visited.insert(Op).second)
include/llvm/CodeGen/SlotIndexes.h 401 return itr->second;
435 return MapItr->second;
452 return MapItr->second;
480 return getMBBRange(Num).second;
485 return getMBBRange(mbb).second;
528 index < getMBBEndIdx(J->second) &&
530 return J->second;
595 SlotIndex replaceBaseIndex = mi2iItr->second;
630 MBBRanges[prevMBB->getNumber()].second = startIdx;
include/llvm/CodeGen/TargetLowering.h 788 return getTypeConversion(Context, VT).second;
1218 if (PTTI != PromoteToType.end()) return PTTI->second;
include/llvm/DebugInfo/CodeView/GlobalTypeTableBuilder.h 76 if (LLVM_UNLIKELY(Result.second /*inserted*/ ||
77 Result.first->second.isSimple())) {
87 if (Result.first->second.isSimple()) {
88 assert(Result.first->second.getIndex() ==
94 Result.first->second = nextTypeIndex();
100 return Result.first->second;
include/llvm/DebugInfo/DWARF/DWARFListTable.h 255 for (const auto &Entry : List.second.getEntries())
263 for (const auto &Entry : List.second.getEntries())
274 return Entry->second;
include/llvm/DebugInfo/PDB/Native/HashTable.h 150 Buckets[P].second = *Value;
199 if (auto EC = Writer.writeObject(Entry.second))
261 return (*Iter).second;
283 Buckets[Entry.index()].second = V;
291 B.second = V;
319 NewMap.set_as_internal(LookupKey, Buckets[I].second, Traits,
include/llvm/DebugInfo/PDB/Native/SymbolCache.h 121 if (Result.second)
125 SymId = Result.first->second;
include/llvm/Demangle/ItaniumDemangle.h 533 const Node *SN = SoFar.second->getSyntaxNode(S);
537 SoFar.second = RT->Pointee;
559 Collapsed.second->printLeft(s);
560 if (Collapsed.second->hasArray(s))
562 if (Collapsed.second->hasArray(s) || Collapsed.second->hasFunction(s))
562 if (Collapsed.second->hasArray(s) || Collapsed.second->hasFunction(s))
572 if (Collapsed.second->hasArray(s) || Collapsed.second->hasFunction(s))
572 if (Collapsed.second->hasArray(s) || Collapsed.second->hasFunction(s))
574 Collapsed.second->printRight(s);
include/llvm/ExecutionEngine/Orc/CompileOnDemandLayer.h 313 return addLogicalModule(I->second, std::move(M));
328 auto Err = I->second.removeModulesFromBaseLayer(BaseLayer);
339 if (auto Sym = KV.second.StubsMgr->findStub(Name, ExportedSymbolsOnly))
include/llvm/ExecutionEngine/Orc/GlobalMappingLayer.h 79 return JITSymbol(I->second, JITSymbolFlags::Exported);
include/llvm/ExecutionEngine/Orc/IndirectionUtils.h 313 Entry.second.second);
324 void *StubAddr = IndirectStubsInfos[Key.first].getStub(Key.second);
328 auto StubSymbol = JITEvaluatedSymbol(StubTargetAddr, I->second.second);
340 void *PtrAddr = IndirectStubsInfos[Key.first].getPtr(Key.second);
344 return JITEvaluatedSymbol(PtrTargetAddr, I->second.second);
355 IndirectStubsInfos[Key.first].getPtr(Key.second));
381 *IndirectStubsInfos[Key.first].getPtr(Key.second) =
include/llvm/ExecutionEngine/Orc/LazyEmittingLayer.h 237 if (auto Symbol = KV.second->find(Name, ExportedSymbolsOnly, BaseLayer))
include/llvm/ExecutionEngine/Orc/OrcRemoteTargetClient.h 357 Entry.second.second))
368 auto Flags = I->second.second;
380 auto Flags = I->second.second;
435 K.second * Client.getIndirectStubSize();
442 K.second * Client.getPointerSize();
include/llvm/ExecutionEngine/Orc/OrcRemoteTargetServer.h 118 sys::Memory::releaseMappedMemory(Alloc.second);
139 sys::Memory::protectMappedMemory(I->second, Flags));
276 auto &BlockList = StubOwnerItr->second;
382 auto &Allocator = I->second;
403 auto &Allocator = I->second;
include/llvm/ExecutionEngine/Orc/RPCSerialization.h 385 return (SI->second)(C, EIB);
404 return (DI->second)(C, Err);
536 return SerializationTraits<ChannelT, T2, T4>::serialize(C, V.second);
543 return SerializationTraits<ChannelT, T2, T4>::deserialize(C, V.second);
641 auto Added = S.insert(Val).second;
664 SerializationTraits<ChannelT, V, V2>::serialize(C, E.second))
686 SerializationTraits<ChannelT, V, V2>::deserialize(C, Val.second))
689 auto Added = M.insert(Val).second;
include/llvm/ExecutionEngine/Orc/RPCUtils.h 1089 return I->second(C, SeqNo);
1127 KV.second->abandon();
1139 auto HandlerItr = Handlers.find(IdItr->second);
1196 PRHandler = std::move(I->second);
1223 return I->second;
1236 if (I->second != getInvalidFunctionId())
1237 return I->second;
include/llvm/ExecutionEngine/Orc/RTDyldObjectLinkingLayer.h 249 SymbolTable[KV.first] = KV.second;
428 if (auto Sym = KV.second->getSymbol(Name, ExportedSymbolsOnly))
include/llvm/ExecutionEngine/Orc/RemoteObjectLayer.h 218 RemoteSym.second);
256 auto AddrOrErr = SI->second.getAddress();
374 return this->jitSymbolToRemote(RI->second->findSymbol(Name));
384 RI->second->findSymbolInLogicalDylib(Name));
492 if (auto Err = BaseLayer.removeObject(HI->second))
512 if (auto Sym = BaseLayer.findSymbolIn(HI->second, Name, ExportedSymbolsOnly))
524 if (auto Err = BaseLayer.emitAndFinalize(HI->second))
include/llvm/ExecutionEngine/Orc/Speculation.h 98 JITDylib *ImplJD = ImplSymbol.getPointer()->second;
106 for (auto &N : I.second)
114 LookupPair.second, SymbolState::Ready,
143 auto Likely = SymPair.second;
190 for (auto &TargetNames : NamePair.second)
include/llvm/IR/CFGDiff.h 124 auto &EdgesForBB = It->second;
135 return make_range(It->second.begin(), It->second.end());
135 return make_range(It->second.begin(), It->second.end());
168 return !N.first->ignoreChild(BB, N.second, false);
182 auto InsertVec = N.first->getAddedChildren(N.second, false);
185 make_range<ExistingChildIterator>({succ_begin(N.second), N.first},
186 {succ_end(N.second), N.first}),
187 DeletedEdgesFilter(N.second));
197 auto InsertVec = N.first->getAddedChildren(N.second, false);
200 make_range<ExistingChildIterator>({succ_end(N.second), N.first},
201 {succ_end(N.second), N.first}),
202 DeletedEdgesFilter(N.second));
222 return !N.first->ignoreChild(BB, N.second, true);
236 auto InsertVec = N.first->getAddedChildren(N.second, true);
239 make_range<ExistingChildIterator>({pred_begin(N.second), N.first},
240 {pred_end(N.second), N.first}),
241 DeletedEdgesFilter(N.second));
251 auto InsertVec = N.first->getAddedChildren(N.second, true);
254 make_range<ExistingChildIterator>({pred_end(N.second), N.first},
255 {pred_end(N.second), N.first}),
256 DeletedEdgesFilter(N.second));
include/llvm/IR/Dominators.h 85 : Start(Pair.first), End(Pair.second) {}
88 : Start(Pair.first), End(Pair.second) {}
include/llvm/IR/ModuleSummaryIndex.h 180 return getRef()->second.U.GV;
184 return getRef()->second.SummaryList;
188 return haveGVs() ? getRef()->second.U.GV->getName()
189 : getRef()->second.U.Name;
1009 if (!S.second)
1021 if (!S.second && S.first->second)
1021 if (!S.second && S.first->second)
1024 if (S.second)
1027 S.first->second = true;
1040 if (!S.second.SummaryList.size() ||
1041 !isa<FunctionSummary>(S.second.SummaryList.front().get()))
1049 if (P.second)
1115 VP->second.U.Name = Name;
1123 VP->second.U.GV = GV;
1130 return I == OidGuidMap.end() ? 0 : I->second;
1159 ->second.SummaryList.push_back(std::move(Summary));
1230 return It->second.second;
1280 for (auto It = TidIter.first; It != TidIter.second; ++It)
1281 if (It->second.first == TypeId)
1282 return It->second.second;
1282 return It->second.second;
1285 return It->second.second;
1285 return It->second.second;
1292 for (auto It = TidIter.first; It != TidIter.second; ++It)
1293 if (It->second.first == TypeId)
1294 return &It->second.second;
1294 return &It->second.second;
1324 return I->second;
1339 for (auto &Summary : GlobalList.second.SummaryList) {
include/llvm/IR/ModuleSummaryIndexYAML.h 70 while (!P.second.empty()) {
71 P = P.second.split(',');
91 io.mapRequired(Key.c_str(), P.second);
126 io.mapRequired(llvm::utostr(P.first).c_str(), P.second);
215 auto &Elem = V.find(KeyInt)->second;
238 for (auto &Sum : P.second.SummaryList) {
269 io.mapRequired(TidIter->second.first.c_str(), TidIter->second.second);
269 io.mapRequired(TidIter->second.first.c_str(), TidIter->second.second);
269 io.mapRequired(TidIter->second.first.c_str(), TidIter->second.second);
include/llvm/IR/PassManager.h 695 return IMapI->second;
704 auto &Result = static_cast<ResultT &>(*RI->second->second);
704 auto &Result = static_cast<ResultT &>(*RI->second->second);
716 return IMapI->second;
755 for (auto &IDAndResult : ResultsListI->second)
879 auto &Result = *AnalysisResultPair.second;
893 .second;
927 return *PI->second;
935 return *PI->second;
970 RI->second = std::prev(ResultList.end());
973 return *RI->second->second;
973 return *RI->second->second;
980 return RI == AnalysisResults.end() ? nullptr : &*RI->second->second;
980 return RI == AnalysisResults.end() ? nullptr : &*RI->second->second;
993 AnalysisResultLists[&IR].erase(RI->second);
1181 auto &InnerIDs = KeyValuePair.second;
include/llvm/IR/PredIteratorCache.h 60 return Result->second;
include/llvm/IR/ValueMap.h 129 return Where->second.get();
167 return I != Map.end() ? I->second : ValueT();
174 auto MapResult = Map.insert(std::make_pair(Wrap(KV.first), KV.second));
175 return std::make_pair(iterator(MapResult.first), MapResult.second);
180 Map.insert(std::make_pair(Wrap(KV.first), std::move(KV.second)));
181 return std::make_pair(iterator(MapResult.first), MapResult.second);
289 ValueT Target(std::move(I->second));
354 ValueTypeProxy Result = {I->first.Unwrap(), I->second};
406 ValueTypeProxy Result = {I->first.Unwrap(), I->second};
include/llvm/LTO/LTO.h 183 return {Symbols.data() + Indices.first, Symbols.data() + Indices.second};
include/llvm/MC/MCContext.h 565 return I->second;
include/llvm/MC/MCStreamer.h 356 return SectionStack.back().second;
392 ChangeSection(NewSection.first, NewSection.second);
419 SectionStack.back().second = curSection;
include/llvm/MCA/CodeEmitter.h 65 return StringRef(&Code[EI.first], EI.second);
include/llvm/MCA/HardwareUnits/LSUnit.h 280 return *Groups.find(Index)->second;
285 return *Groups.find(Index)->second;
include/llvm/MCA/Instruction.h 576 Instruction *getInstruction() { return Data.second; }
577 const Instruction *getInstruction() const { return Data.second; }
580 explicit operator bool() const { return Data.second != nullptr; }
583 void invalidate() { Data.second = nullptr; }
611 const WriteState *getWriteState() const { return Data.second; }
612 WriteState *getWriteState() { return Data.second; }
613 void invalidate() { Data.second = nullptr; }
628 bool isValid() const { return Data.second && Data.first != INVALID_IID; }
include/llvm/Object/TapiUniversal.h 51 return Result.second;
include/llvm/Option/ArgList.h 208 auto E = Args.begin() + Range.second;
218 auto B = Args.rend() - Range.second;
include/llvm/PassAnalysisSupport.h 159 ResultPass = AnalysisImpl.second;
include/llvm/ProfileData/InstrProf.h 471 if (Ins.second) {
564 return Result->second;
575 return Result->second;
include/llvm/ProfileData/SampleProf.h 211 if (LHS.second != RHS.second)
211 if (LHS.second != RHS.second)
212 return LHS.second > RHS.second;
212 return LHS.second > RHS.second;
346 return ret->second.getSamples();
357 return ret->second.getCallTargets();
371 return &iter->second;
386 auto FS = iter->second.find(CalleeName);
387 if (FS != iter->second.end())
388 return &FS->second;
393 for (const auto &NameFS : iter->second)
394 if (NameFS.second.getTotalSamples() >= MaxTotalSamples) {
395 MaxTotalSamples = NameFS.second.getTotalSamples();
396 R = &NameFS.second;
421 return BodySamples.begin()->second.getSamples();
426 for (const auto &N_FS : CallsiteSamples.begin()->second)
427 T += N_FS.second.getEntrySamples();
450 const SampleRecord &Rec = I.second;
456 for (const auto &Rec : I.second)
457 MergeResult(Result, FSMap[Rec.first].merge(Rec.second, Weight));
474 for (const auto &TS : BS.second.getCallTargets())
482 for (const auto &NameFS : CS.second)
483 NameFS.second.findInlinedFunctions(S, M, Threshold);
539 return iter->second;
include/llvm/Support/ARMAttributeParser.h 134 return Attributes.find(Tag)->second;
include/llvm/Support/Allocator.h 310 size_t Size = CustomSizedSlabs[Idx].second;
350 TotalMemory += PtrAndSize.second;
429 size_t Size = PtrAndSize.second;
487 size_t Size = PtrAndSize.second;
include/llvm/Support/Automaton.h 230 Transcriber->transition(I->second.second);
230 Transcriber->transition(I->second.second);
231 State = I->second.first;
include/llvm/Support/CFGUpdate.h 86 const int NumInsertions = Op.second;
92 Result.push_back({UK, Op.first.first, Op.first.second});
include/llvm/Support/DebugCounter.h 80 auto &CounterInfo = Result->second;
110 return Result->second.Count;
include/llvm/Support/FileCollector.h 49 bool markAsSeen(StringRef Path) { return Seen.insert(Path).second; }
include/llvm/Support/FormattedStream.h 112 unsigned getLine() { return Position.second; }
include/llvm/Support/GenericDomTree.h 312 DomTreeNodeBase<NodeT> &MyNd = *DomTreeNode.second;
313 DomTreeNodeBase<NodeT> &OtherNd = *OI->second;
331 return I->second.get();
707 const auto ChildIt = WorkStack.back().second;
717 ++WorkStack.back().second;
include/llvm/Support/GenericDomTreeConstruction.h 141 for (auto ChildAndKind : FCIt->second) {
173 return InfoIt->second.IDom;
241 if (SIT != NodeToInfo.end() && SIT->second.DFSNum != 0) {
242 if (Succ != BB) SIT->second.ReverseChildren.push_back(BB);
815 if (SuccLevel <= NCDLevel + 1 || !II.Visited.insert(SuccTN).second)
887 << BlockNamePrinter(Edge.second) << "\n");
888 InsertReachable(DT, BUI, DT.getNode(Edge.first), Edge.second);
1308 const TreeNodePtr TN = NodeToTN.second.get();
1341 const TreeNodePtr TN = NodeToTN.second.get();
1396 const TreeNodePtr Node = NodeToTN.second.get();
1509 const TreeNodePtr TN = NodeToTN.second.get();
1542 const TreeNodePtr TN = NodeToTN.second.get();
include/llvm/Support/GenericIteratedDominanceFrontier.h 160 unsigned RootLevel = RootPair.second.first;
183 if (!VisitedPQ.insert(SuccNode).second)
200 if (VisitedWorklist.insert(DomChild).second)
include/llvm/Support/JSON.h 551 if (R.second)
623 if (!fromJSON(KV.second, Out[llvm::StringRef(KV.first)]))
include/llvm/Support/OnDiskHashTable.h 199 InfoObj.EmitData(Out, I->Key, I->Data, Len.second);
203 assert(offset_type(End - DataStart) == Len.second &&
378 offset_type ItemLen = L.first + L.second;
397 return iterator(X, Items + L.first, L.second, InfoPtr);
422 NumBucketsAndEntries.second,
477 Ptr += L.first + L.second;
576 return InfoObj->ReadData(Key, LocalPtr + L.first, L.second);
609 NumBucketsAndEntries.first, NumBucketsAndEntries.second,
include/llvm/Support/ScaledNumber.h 224 return Lg.first - (Lg.second > 0);
234 return Lg.first + (Lg.second < 0);
517 : Digits(X.first), Scale(X.second) {}
661 return joinSigned(scale(Unsigned.first), Unsigned.second);
665 return joinSigned(scaleByInverse(Unsigned.first), Unsigned.second);
include/llvm/Support/YAMLTraits.h 1944 io.mapRequired(p.first.c_str(), p.second);
include/llvm/TableGen/Record.h 1709 return I == Classes.end() ? nullptr : I->second.get();
1714 return I == Defs.end() ? nullptr : I->second.get();
1721 return It == ExtraGlobals.end() ? nullptr : It->second;
1726 std::move(R))).second;
1733 std::move(R))).second;
1739 bool Ins = ExtraGlobals.insert(std::make_pair(Name, I)).second;
1836 if (int Res = LHSPart.second.compare(RHSPart.second))
1836 if (int Res = LHSPart.second.compare(RHSPart.second))
1845 if (LHSPart.second.size() != RHSPart.second.size())
1845 if (LHSPart.second.size() != RHSPart.second.size())
1846 return LHSPart.second.size() < RHSPart.second.size();
1846 return LHSPart.second.size() < RHSPart.second.size();
1850 bool LHSFailed = LHSPart.second.getAsInteger(10, LHSVal); (void)LHSFailed;
1852 bool RHSFailed = RHSPart.second.getAsInteger(10, RHSVal); (void)RHSFailed;
include/llvm/TableGen/StringToOffsetTable.h 34 if (IterBool.second) {
include/llvm/TextAPI/MachO/InterfaceFile.h 350 reference operator*() const { return I->second; }
351 pointer operator->() const { return I->second; }
include/llvm/Transforms/IPO/WholeProgramDevirt.h 60 assert(!DataUsed.second[I]);
61 DataUsed.second[I] = 0xff;
72 assert(!DataUsed.second[Size - I - 1]);
73 DataUsed.second[Size - I - 1] = 0xff;
82 assert(!(*DataUsed.second & (1 << Pos % 8)));
83 *DataUsed.second |= 1 << (Pos % 8);
include/llvm/Transforms/InstCombine/InstCombineWorklist.h 41 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
74 Worklist[It->second] = nullptr;
include/llvm/Transforms/Instrumentation/AddressSanitizer.h 56 return (Pos != Entries.end()) ? Pos->second : Entry();
include/llvm/Transforms/Scalar/ConstantHoisting.h 137 MapEntry.second.clear();
141 MapEntry.second.clear();
include/llvm/Transforms/Utils/SSAUpdaterImpl.h 143 if (BBMapBucket.second) {
144 Info->Preds[p] = BBMapBucket.second;
151 BBMapBucket.second = PredInfo;
include/llvm/XRay/Graph.h 216 return iterator(It->second.begin(), &M, A);
223 return const_iterator(It->second.begin(), &M, A);
232 return iterator(It->second.end(), &M, A);
238 return const_iterator(It->second.end(), &M, A);
248 return I->second.size();
382 return Vertices.FindAndConstruct(I).second;
391 Vertices.FindAndConstruct(I.second);
392 InNeighbors[I.second].insert(I.first);
393 OutNeighbors[I.first].insert(I.second);
394 return P.second;
404 return It->second;
413 return It->second;
423 return It->second;
432 return It->second;
481 if (p.second) {
483 Vertices.FindAndConstruct(EI.second);
484 InNeighbors[EI.second].insert(EI.first);
485 OutNeighbors[EI.first].insert(EI.second);
lib/Analysis/AliasSetTracker.cpp 292 I->second->eraseFromList();
564 AliasSet::PointerRec *PtrValEnt = I->second;
591 assert(I->second->hasAliasSet() && "Dead entry?");
599 AliasSet *AS = I->second->getAliasSet(*this);
600 AS->addPointer(*this, Entry, I->second->getSize(), I->second->getAAInfo(),
600 AS->addPointer(*this, Entry, I->second->getSize(), I->second->getAAInfo(),
lib/Analysis/AssumptionCache.cpp 49 return AVI->second;
53 return AVIP.first->second;
152 for (auto &A : AVI->second)
218 assert(AssumptionSet.insert(VH).second &&
254 return *I->second;
260 assert(IP.second && "Scanning function already in the map?");
261 return *IP.first->second;
267 return I->second.get();
281 for (auto &VH : I.second->assumptions())
lib/Analysis/BasicAliasAnalysis.cpp 128 return CacheIt->second;
140 CacheIt->second = Ret;
154 CacheIt->second = Ret;
662 if (!Visited.insert(V).second) {
850 return CacheIt->second;
854 return CacheIt->second;
1598 std::swap(Locs.first, Locs.second);
1613 OrigAliasResult = CacheIt->second;
1614 CacheIt->second = NoAlias;
1631 assert(!Pair.second && "Entry must have existed");
1632 Pair.first->second = OrigAliasResult;
1690 if (UniqueSrc.insert(PV1).second)
1828 std::swap(Locs.first, Locs.second);
1831 if (!Pair.second)
1832 return Pair.first->second;
1847 assert(!ItInsPair.second && "Entry must have existed");
1848 ItInsPair.first->second = Result;
1864 assert(!Pair.second && "Entry must have existed");
1865 return Pair.first->second = Result;
1880 assert(!Pair.second && "Entry must have existed");
1881 return Pair.first->second = Result;
1892 assert(!Pair.second && "Entry must have existed");
1893 return Pair.first->second = PartialAlias;
1899 AliasResult Result = getBestAAResults().alias(Locs.first, Locs.second, AAQI);
1901 assert(!Pair.second && "Entry must have existed");
1902 return Pair.first->second = Result;
lib/Analysis/BlockFrequencyInfoImpl.cpp 193 Weights.push_back(I.second);
357 I.second.getMass()))
658 IrrNode &SuccIrr = *L->second;
701 I->second = true;
719 if (I.second)
lib/Analysis/BranchProbabilityInfo.cpp 438 return SccIt->second;
459 HeaderMapIt->second = IsHeader;
462 return HeaderMapIt->second;
539 if (VisitedInsts.insert(PN).second)
887 return I->second;
910 Prob += MapI->second;
lib/Analysis/CFG.cpp 43 succ_const_iterator &I = Top.second;
48 if (Visited.insert(BB).second) {
163 if (!Visited.insert(BB).second)
lib/Analysis/CFLAndersAliasAnalysis.cpp 189 return make_range<const_valuestate_iterator>(Itr->second.begin(),
190 Itr->second.end());
213 return MemMap[LHS].insert(RHS).second;
220 return &Itr->second;
246 Attr = Itr->second;
378 Attr |= Mapping.second;
392 for (const auto &InnerMapping : OuterMapping.second) {
433 for (const auto &InnerMapping : OuterMapping.second) {
440 if (hasReadOnlyState(InnerMapping.second))
446 if (hasReadOnlyState(InnerMapping.second))
449 if (hasWriteOnlyState(InnerMapping.second))
458 for (const auto &FromRecord : Mapping.second.FromRecords) {
459 for (const auto &ToRecord : Mapping.second.ToRecords) {
493 auto Attr = getExternallyVisibleAttrs(Mapping.second);
515 return Itr->second;
556 auto RangePair = std::equal_range(Itr->second.begin(), Itr->second.end(),
556 auto RangePair = std::equal_range(Itr->second.begin(), Itr->second.end(),
559 if (RangePair.first != RangePair.second) {
610 auto &ValueInfo = Mapping.second;
662 if (Mapping.second.test(static_cast<size_t>(FromState)))
743 auto &ValueInfo = Mapping.second;
814 assert(InsertPair.second &&
834 assert(Iter->second.hasValue());
836 return Iter->second;
lib/Analysis/CFLGraph.h 104 if (Itr == ValueImpls.end() || Itr->second.getNumLevels() <= N.DerefLevel)
106 return &Itr->second.getNodeInfoAtLevel(N.DerefLevel);
138 if (Itr == ValueImpls.end() || Itr->second.getNumLevels() <= N.DerefLevel)
140 return &Itr->second.getNodeInfoAtLevel(N.DerefLevel);
lib/Analysis/CFLSteensAliasAnalysis.cpp 141 if (CurrValue != Itr->second)
143 ExternalRelation{CurrValue, Itr->second, UnknownOffset});
194 auto &ValueInfo = Mapping.second;
214 auto &ValueInfo = Mapping.second;
229 assert(InsertPair.second &&
252 assert(Iter->second.hasValue());
254 return Iter->second;
lib/Analysis/CGSCCPassManager.cpp 177 const auto &InnerAnalysisIDs = OuterInvalidationPair.second;
281 const auto &InnerAnalysisIDs = OuterInvalidationPair.second;
344 const auto &InnerAnalysisIDs = OuterInvalidationPair.second;
453 if (Visited.insert(Callee).second && !Callee->isDeclaration()) {
464 bool Inserted = RetainedEdges.insert(&CalleeN).second;
475 if (Visited.insert(C).second)
486 bool Inserted = RetainedEdges.insert(&RefereeN).second;
lib/Analysis/CallGraph.cpp 55 I.second->allReferencesDropped();
96 Nodes.push_back(I.second.get());
139 I->second->F = const_cast<Function*>(To);
140 FunctionMap[To] = std::move(I->second);
171 if (Function *FI = I.second->getFunction())
190 I->second->DropRef();
203 if (CalledFunctions[i].second == Callee) {
217 if (CR.second == Callee && CR.first == nullptr) {
234 I->second->DropRef();
236 I->second = NewNode;
lib/Analysis/CallGraphSCCPass.cpp 251 if (!I->second->getFunction())
277 Calls.insert(std::make_pair(I->first, I->second));
300 CallGraphNode *ExistingNode = ExistingIt->second;
lib/Analysis/CaptureTracking.cpp 240 if (!Visited.insert(&U).second)
lib/Analysis/CodeMetrics.cpp 36 if (Visited.insert(Operand).second)
87 if (EphValues.insert(I).second)
107 if (EphValues.insert(I).second)
lib/Analysis/ConstantFolding.cpp 1098 NewC = It->second;
lib/Analysis/DemandedBits.cpp 330 if (AliveBits.try_emplace(&I, T->getScalarSizeInBits(), 0).second)
407 if (Res.second || (AB |= Res.first->second) != Res.first->second) {
407 if (Res.second || (AB |= Res.first->second) != Res.first->second) {
407 if (Res.second || (AB |= Res.first->second) != Res.first->second) {
408 Res.first->second = std::move(AB);
412 } else if (I && Visited.insert(I).second) {
424 return Found->second;
456 if (Found != AliveBits.end() && Found->second.isNullValue())
466 OS << "DemandedBits: 0x" << Twine::utohexstr(KV.second.getLimitedValue())
lib/Analysis/DependenceGraphBuilder.cpp 94 DstNode = IMap.find(UI)->second;
117 if (VisitedTargets.insert(DstNode).second) {
lib/Analysis/DivergenceAnalysis.cpp 245 if (!Visited.insert(SuccBlock).second) {
318 if (!DivergentLoops.insert(BranchLoop).second) {
356 if (!DivergentLoops.insert(BranchLoop).second) {
lib/Analysis/GlobalsModRef.cpp 165 GlobalMRI = unionModRef(GlobalMRI, I->second);
180 addModRefInfoForGlobal(*G.first, G.second);
223 if (I->second == GV)
230 FIPair.second.eraseModRefInfoForGlobal(*GV);
278 return &I->second;
310 if (TrackedFunctions.insert(Reader).second) {
319 if (TrackedFunctions.insert(Writer).second) {
538 if (Function *Callee = CI->second->getFunction()) {
662 if (Visited.insert(LHS).second)
664 if (Visited.insert(RHS).second)
671 if (Visited.insert(Op).second)
779 if (Visited.insert(LHS).second)
781 if (Visited.insert(RHS).second)
788 if (Visited.insert(Op).second)
lib/Analysis/IVDescriptors.cpp 371 if (VisitedInsts.insert(UI).second) {
lib/Analysis/IVUsers.cpp 173 if (!Processed.insert(I).second)
208 if (!UniqueUsers.insert(User).second)
lib/Analysis/InlineCost.cpp 342 Arg = ArgIt->second;
354 addCost(CostIt->second);
355 SROACostSavings -= CostIt->second;
356 SROACostSavingsLost += CostIt->second;
372 CostIt->second += InstructionCost;
573 if (!accumulateGEPOffset(cast<GEPOperator>(I), BaseAndOffset.second))
1141 !LoadAddrSet.insert(I.getPointerOperand()).second && I.isUnordered()) {
1677 } while (Visited.insert(V).second);
lib/Analysis/InstructionPrecedenceTracking.cpp 85 assert(It->second == &Insn &&
90 assert(It->second == nullptr &&
lib/Analysis/LazyCallGraph.cpp 49 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK);
57 Edges[IndexMapI->second] = Edge();
65 if (!EdgeIndexMap.insert({&N, Edges.size()}).second)
105 if (Callees.insert(Callee).second) {
113 if (Visited.insert(C).second)
194 if (Visited.insert(GV.getInitializer()).second)
288 if (Visited.insert(CalleeC).second)
317 bool Inserted = SCCSet.insert(C).second;
327 int i = SCCIndexPair.second;
342 assert(SCCIndices.find(&TargetSCC)->second <= i &&
384 if (!ChildRC || !Visited.insert(ChildRC).second)
480 SCCIndices.find(SCCs[i])->second = i;
515 SCCIndices.find(SCCs[i])->second = i;
611 if (SCCIndices.find(&EdgeC)->second <= SourceIdx)
615 if (ConnectedSet.insert(&EdgeC).second)
1031 if (Set.insert(&EdgeRC).second)
1401 if (!InsertResult.second) {
1403 Edge &E = SourceN->Edges[InsertResult.first->second];
1434 if (!InsertResult.second)
1508 Node &N = *NI->second;
1526 SCC &C = *CI->second;
1537 int RCIndex = RCIndexI->second;
1564 FunctionNodePair.second->G = this;
1731 RefSCCIndices.insert({NewRC, PostOrderRefSCCs.size()}).second;
lib/Analysis/LazyValueInfo.cpp 195 It->second->BlockVals[BB] = Result;
205 return ODI->second.count(V);
216 return I->second->BlockVals.count(BB);
226 auto BBI = I->second->BlockVals.find(BB);
227 if (BBI == I->second->BlockVals.end())
229 return BBI->second;
260 SmallPtrSetImpl<Value *> &ValueSet = Iter->second;
287 I.second->BlockVals.erase(BB);
308 SmallVector<Value *, 4> ValsToClear(I->second.begin(), I->second.end());
308 SmallVector<Value *, 4> ValsToClear(I->second.begin(), I->second.end());
325 SmallPtrSetImpl<Value *> &ValueSet = OI->second;
392 if (!BlockValueSet.insert(BV).second)
395 LLVM_DEBUG(dbgs() << "PUSH: " << *BV.second << " in "
530 TheCache.insertResult(e.second, e.first,
541 if (solveBlockValue(e.second, e.first)) {
544 assert(TheCache.hasCachedValueInfo(e.second, e.first) &&
548 dbgs() << "POP " << *e.second << " in " << e.first->getName() << " = "
549 << TheCache.getCachedValueInfo(e.second, e.first) << "\n");
1317 return I->second;
2011 if (!BlocksContainingLVI.insert(BB).second)
lib/Analysis/LegacyDivergenceAnalysis.cpp 173 if (!cast<PHINode>(I)->hasConstantOrUndefValue() && DV.insert(&*I).second)
221 if (DV.insert(UserInst).second)
234 if (Succ != End && InfluenceRegion.insert(Succ).second)
260 if (!TTI.isAlwaysUniform(U) && DV.insert(U).second)
lib/Analysis/Lint.cpp 665 if (!Visited.insert(V).second)
679 if (!VisitedBlocks.insert(BB).second)
lib/Analysis/Loads.cpp 57 if (!Visited.insert(V).second)
lib/Analysis/LoopAccessAnalysis.cpp 154 Value *StrideVal = SI->second;
457 const auto &First = Check.first->Members, &Second = Check.second->Members;
465 OS.indent(Depth + 2) << "Against group (" << Check.second << "):\n";
924 DepCands.unionSets(Access, Prev->second);
1138 if (!Offsets.insert(Offset).second)
1680 isDependent(*A.first, A.second, *B.first, B.second, Strides);
1680 isDependent(*A.first, A.second, *B.first, B.second, Strides);
1689 Dependences.push_back(Dependence(A.second, B.second, Type));
1689 Dependences.push_back(Dependence(A.second, B.second, Type));
1714 auto &IndexVector = Accesses.find(Access)->second;
1933 !UniformStores.insert(Ptr).second;
1937 if (Seen.insert(Ptr).second) {
1970 if (Seen.insert(Ptr).second ||
2196 Second = expandBounds(Check.second, L, Loc, Exp, SE, PtrRtChecking);
2220 const PointerBounds &A = Check.first, &B = Check.second;
lib/Analysis/LoopAnalysisManager.cpp 104 const auto &InnerAnalysisIDs = OuterInvalidationPair.second;
lib/Analysis/LoopCacheAnalysis.cpp 446 OS << "Loop '" << L->getName() << "' has cost = " << LC.second << "\n";
589 TripCountsProduct *= TC.second;
lib/Analysis/LoopInfo.cpp 797 NearLoop = SubloopParents.insert({Subloop, &Unloop}).first->second;
lib/Analysis/LoopUnrollAnalyzer.cpp 100 ConstantInt *SimplifiedAddrOp = AddressIt->second.Offset;
102 auto *GV = dyn_cast<GlobalVariable>(AddressIt->second.Base);
182 SimplifiedAddress &LHSAddr = SimplifiedLHS->second;
183 SimplifiedAddress &RHSAddr = SimplifiedRHS->second;
lib/Analysis/MemDepPrinter.cpp 141 const DepSet &InstDeps = DI->second;
146 const BasicBlock *DepBB = I.second;
lib/Analysis/MemoryBuiltins.cpp 151 const AllocFnsTy *FnData = &Iter->second;
223 Result.SndParam = Args.second.getValueOr(-1);
482 if (Data.second.isNegative() || Data.first.ult(Data.second))
482 if (Data.second.isNegative() || Data.first.ult(Data.second))
484 return Data.first - Data.second;
544 Builder.CreateSub(SizeOffsetPair.first, SizeOffsetPair.second);
546 Builder.CreateICmpULT(SizeOffsetPair.first, SizeOffsetPair.second);
586 if (!SeenInsts.insert(I).second)
753 return std::make_pair(PtrData.first, PtrData.second + Offset);
849 if (CacheIt != CacheMap.end() && anyKnown(CacheIt->second))
870 ConstantInt::get(Context, Const.second));
877 return CacheIt->second;
891 if (!SeenVals.insert(V).second) {
976 Offset = Builder.CreateAdd(PtrData.second, Offset);
1012 OffsetPHI->addIncoming(EdgeData.second, PHI.getIncomingBlock(i));
1042 Value *Offset = Builder.CreateSelect(I.getCondition(), TrueSide.second,
1043 FalseSide.second);
lib/Analysis/MemoryDependenceAnalysis.cpp 104 bool Found = InstIt->second.erase(Val);
107 if (InstIt->second.empty())
800 if (!CacheP.second) {
839 if (!Visited.insert(DirtyBB).second)
928 Result.push_back(NonLocalDefIt->second);
929 ReverseNonLocalDefsCache[NonLocalDefIt->second.getResult().getInst()]
1112 NonLocalPointerInfo *CacheInfo = &Pair.first->second;
1116 if (!Pair.second) {
1182 if (VI == Visited.end() || VI->second == Pointer.getAddr())
1286 if (InsertRes.second) {
1295 if (InsertRes.first->second != Pointer.getAddr()) {
1338 PHITransAddr &PredPointer = PredList.back().second;
1350 if (!InsertRes.second) {
1356 if (InsertRes.first->second == PredPtrVal)
1379 PHITransAddr &PredPointer = PredList[i].second;
1489 it->second.getResult().getInst(), P.getPointer());
1496 for (const auto &entry : toRemoveIt->second)
1509 NonLocalDepInfo &PInfo = It->second.NonLocalDeps;
1546 NonLocalDepInfo &BlockMap = NLDI->second.first;
1557 if (Instruction *Inst = LocalDepEntry->second.getInst())
1591 assert(!ReverseDepIt->second.empty() && !RemInst->isTerminator() &&
1594 for (Instruction *InstDependingOnRemInst : ReverseDepIt->second) {
1614 ReverseDepsToAdd.back().second);
1621 for (Instruction *I : ReverseDepIt->second) {
1626 INLD.second = true;
1645 ReverseDepsToAdd.back().second);
1658 for (ValueIsLoadPair P : ReversePtrDepIt->second) {
1688 ReversePtrDepsToAdd.back().second);
1708 assert(DepKV.second.getInst() != D && "Inst occurs in data structures");
1713 for (const auto &Entry : DepKV.second.NonLocalDeps)
1719 const PerInstNLInfo &INLD = DepKV.second;
1727 for (Instruction *Inst : DepKV.second)
1733 for (Instruction *Inst : DepKV.second)
1740 for (ValueIsLoadPair P : DepKV.second)
lib/Analysis/MemorySSA.cpp 421 if (!VisitedPhis.insert(MAP).second)
435 instructionClobbersQuery(MD, MAP.second, Query.Inst, AA);
453 assert(!instructionClobbersQuery(MD, MAP.second, Query.Inst, AA)
468 upward_defs_begin({const_cast<MemoryAccess *>(MA), MAP.second}),
601 Paths.emplace_back(P.second, P.first, PriorNode);
652 if (!VisitedPhis.insert({Node.Last, Node.Loc}).second)
1092 if (It == PerBlockAccesses.end() || !isa<MemoryPhi>(It->second->front()))
1094 AccessList *Accesses = It->second.get();
1118 AccessList *Accesses = It->second.get();
1146 bool AlreadyVisited = !Visited.insert(Root->getBlock()).second;
1167 AlreadyVisited = !Visited.insert(BB).second;
1200 if (It == PerBlockAccesses.end() || !isa<MemoryPhi>(It->second->front()))
1202 AccessList *Accesses = It->second.get();
1211 auto &Accesses = It->second;
1244 for (MemoryAccess &MA : *Pair.second)
1251 if (Res.second)
1252 Res.first->second = std::make_unique<AccessList>();
1253 return Res.first->second.get();
1259 if (Res.second)
1260 Res.first->second = std::make_unique<DefsList>();
1261 return Res.first->second.get();
1682 bool Inserted = ValueToMemoryAccess.insert({BB, What}).second;
1824 if (VMA->second == MA)
1840 std::unique_ptr<DefsList> &Defs = DefsIt->second;
1849 std::unique_ptr<AccessList> &Accesses = AccessIt->second;
1948 unsigned long ThisNumber = ThisNumberIter->second;
lib/Analysis/MemorySSAUpdater.cpp 48 return Cached->second;
71 if (VisitedBlocks.insert(BB).second) {
513 if (!Seen.insert(S).second)
834 Pred = Pair.second;
925 const auto &AddedBlockSet = BBPredPair.second.Added;
926 auto &PrevBlockSet = BBPredPair.second.Prev;
928 BasicBlock *Pi = Pair.second;
969 const auto &PrevBlockSet = BBPredPair.second.Prev;
970 const auto &AddedBlockSet = BBPredPair.second.Added;
1006 if (DefP1 != LastDefPredPair.second) {
1080 BasicBlock *Pi = Pair.second;
lib/Analysis/ModuleSummaryAnalysis.cpp 98 if (!Visited.insert(U).second)
784 if (GlobalList.second.SummaryList.empty())
787 assert(GlobalList.second.SummaryList.size() == 1 &&
789 auto &Summary = GlobalList.second.SummaryList[0];
lib/Analysis/MustExecute.cpp 182 if (Predecessors.insert(PredPred).second)
219 if (CheckedSuccessors.insert(Succ).second &&
513 if (Next && !Visited.insert(Next).second)
lib/Analysis/OrderedBasicBlock.cpp 80 return NAI->second < NBI->second;
80 return NAI->second < NBI->second;
107 NumberedInsts.insert({New, OI->second});
lib/Analysis/OrderedInstructions.cpp 25 return OBB->second->dominates(InstA, InstB);
lib/Analysis/PhiValues.cpp 96 Reachable.insert(It->second.begin(), It->second.end());
96 Reachable.insert(It->second.begin(), It->second.end());
127 if (Pair.second.count(V))
161 else if (It->second.empty())
164 for (Value *V : It->second)
lib/Analysis/ProfileSummaryInfo.cpp 266 return iter->second;
lib/Analysis/PtrUseVisitor.cpp 23 if (VisitedUses.insert(&U).second) {
lib/Analysis/ScalarEvolution.cpp 2306 if (Pair.second) {
2309 Pair.first->second += NewScale;
2319 if (Pair.second) {
2322 Pair.first->second += Scale;
2590 MulOpLists[M.find(NewOp)->second].push_back(NewOp);
2599 getAddExpr(MulOp.second, SCEV::FlagAnyWrap, Depth + 1),
3814 return I->second;
3849 for (const auto &VE : SI->second)
3853 return &SI->second;
3862 const SCEV *S = I->second;
3910 if (Pair.second && !SCEVLostPoisonFlags(S, V)) {
3936 const SCEV *S = I->second;
4199 if (!Visited.insert(I).second)
4204 const SCEV *Old = It->second;
4905 I->second;
4912 assert(!(Rewrite.second).empty() && "Expected to find Predicates");
5516 return I->second;
5520 assert(InsertPair.second && "Should insert a new key");
5521 return InsertPair.first->second;
5549 return I->second;
5731 if (PendingPhiRanges.insert(Phi).second) {
6085 if (Pushed.insert(cast<Instruction>(PoisonUser)).second)
6127 assert(InsertPair.second && "We just checked!");
6131 return Itr->second;
6653 if (!Pair.second)
6654 return Pair.first->second;
6659 return PredicatedBackedgeTakenCounts.find(L)->second = std::move(Result);
6671 if (!Pair.second)
6672 return Pair.first->second;
6713 const SCEV *Old = It->second;
6751 Discovered.insert(I).second)
6762 return BackedgeTakenCounts.find(L)->second = std::move(Result);
6793 BTCPos->second.clear();
6813 if (Entry.second == CurrL)
6821 for (auto *S : LoopUsersItr->second)
6831 if (!Visited.insert(I).second)
6838 forgetMemoizedResults(It->second);
6870 if (!Visited.insert(I).second)
6877 forgetMemoizedResults(It->second);
7036 const ExitLimit &EL = EEI.second;
7191 return Itr->second;
7204 assert(InsertResult.second && "Expected successful insertion!");
7880 return I->second;
7933 PHIsToCompute.emplace_back(PHI, I.second);
7944 if (NextPHI != I.second)
8030 return LS.second ? LS.second : V;
8030 return LS.second ? LS.second : V;
8038 LS.second = C;
8657 if (!SL.second || !SU.second)
8657 if (!SL.second || !SU.second)
9153 assert (SplitLHS.second != getCouldNotCompute() && "Unexpected CNC");
9159 assert (SplitRHS.second != getCouldNotCompute() && "Unexpected CNC");
9168 isLoopBackedgeGuardedByCond(MDL, Pred, SplitLHS.second,
9169 SplitRHS.second);
9653 LoopEntryPredicate->getSuccessor(0) != Pair.second))
9676 if (!PendingLoopPredicates.insert(FoundCondValue).second)
10026 if (!PendingMerges.insert(Phi).second)
10040 if (!PendingMerges.insert(Phi).second)
11379 if (!Visited.insert(U).second)
11466 BTCI.second.clear();
11468 BTCI.second.clear();
11878 BackedgeTakenInfo &BEInfo = I->second;
12196 for (auto *P : PredicatedRewrite->second){
12335 return I->second;
12346 auto &SCEVPreds = ScevPredsIt->second;
12386 if (Entry.second && Generation == Entry.first)
12387 return Entry.second;
12391 if (Entry.second)
12392 Expr = Entry.second;
12424 const SCEV *Rewritten = II.second.second;
12424 const SCEV *Rewritten = II.second.second;
12425 II.second = {Generation, SE.rewriteUsingPredicate(Rewritten, &L, Preds)};
12442 if (!II.second)
12500 if (II->second.second == Expr)
12500 if (II->second.second == Expr)
12505 OS.indent(Depth + 2) << "--> " << *II->second.second << "\n";
12505 OS.indent(Depth + 2) << "--> " << *II->second.second << "\n";
lib/Analysis/ScalarEvolutionExpander.cpp 621 if (!Pair.second)
622 return Pair.first->second;
629 return Pair.first->second = SE.LI.getLoopFor(I->getParent());
664 if (LHS.second->getType()->isPointerTy() !=
665 RHS.second->getType()->isPointerTy())
666 return LHS.second->getType()->isPointerTy();
675 if (LHS.second->isNonConstantNegative()) {
676 if (!RHS.second->isNonConstantNegative())
678 } else if (RHS.second->isNonConstantNegative())
709 const SCEV *Op = I->second;
721 const SCEV *X = I->second;
736 NewOps.push_back(I->second);
799 Value *P = expandCodeFor(I->second, Ty);
822 } else if (I->second->isAllOnesValue()) {
1573 if (!PredSeen.insert(HP).second) {
1792 ConstantInt *Offset = VOPair.second;
1870 return I->second;
1881 else if (VO.second) {
1884 int64_t Offset = VO.second->getSExtValue();
1888 ConstantInt::getSigned(VO.second->getType(), -(Offset * 8) / ESize);
1892 ConstantInt::getSigned(VO.second->getType(), -Offset);
1900 V = Builder.CreateSub(V, VO.second);
2088 if (VO && VO.getValue().second == nullptr)
2156 if (!Processed.insert(S).second)
lib/Analysis/StackSafetyAnalysis.cpp 357 if (Visited.insert(I).second)
411 updateOneNode(Callee, Functions.find(Callee)->second);
415 updateOneNode(F.first, F.second);
449 const StackSafetyInfo::FunctionInfo &FS = IT->second;
507 StackSafetyInfo::FunctionInfo &FS = F.second;
545 SSI.emplace(F.first, std::move(F.second));
553 SSI.find(&F)->second.print(O);
558 SSI.find(&A)->second.print(O);
lib/Analysis/StratifiedSets.h 98 return Iter->second;
284 Link.Above = Iter->second;
291 Link.Below = Iter->second;
296 auto &Info = Pair.second;
300 Info.Index = Iter->second;
319 if (!Visited.insert(CurrentIndex).second)
400 if (Pair.second)
404 auto &IterSet = linksAt(Iter->second.Index);
551 return &Result->second;
558 return &Result->second;
lib/Analysis/SyncDependenceAnalysis.cpp 159 bool WasAdded = DefMap.emplace(&Block, &DefBlock).second;
172 const auto *DefBlock = It->second;
199 if (ItLastDef->second != &DefBlock) {
201 if (!JoinBlocks->insert(&SuccBlock).second)
269 const auto *DefBlock = ItDef->second;
314 const auto *HeaderDefBlock = (ItHeaderDef == DefMap.end()) ? nullptr : ItHeaderDef->second;
323 if (ItExitDef->second != HeaderDefBlock) {
344 return *ItCached->second;
353 assert(ItInserted.second);
354 return *ItInserted.first->second;
367 return *ItCached->second;
376 assert(ItInserted.second);
377 return *ItInserted.first->second;
lib/Analysis/SyntheticCountsUtils.cpp 57 auto OptProfCount = GetProfCount(E.first, E.second);
60 auto Callee = CGT::edge_dest(E.second);
66 AddCount(Entry.first, Entry.second);
70 auto OptProfCount = GetProfCount(E.first, E.second);
73 auto Callee = CGT::edge_dest(E.second);
lib/Analysis/ValueTracking.cpp 477 if (!Visited.insert(V).second)
1938 if (Visited.insert(CmpU).second)
1952 if (Visited.insert(BOU).second)
3600 if (!PHIs.insert(PN).second)
3774 if (!Visited.insert(P).second)
3848 if (!Visited.insert(V).second)
4429 if (Visited.insert(NextBB).second) {
lib/Analysis/VectorUtils.cpp 918 StrideDescriptor DesB = BI->second;
940 StrideDescriptor DesA = AI->second;
1132 InterleaveGroup<Instruction> *Group = I.second;
1158 [](std::pair<int, Instruction *> p) { return p.second; });
lib/AsmParser/LLParser.cpp 116 std::make_pair(I.first, std::make_pair(I.second, LocTy())));
127 const std::vector<unsigned> &Attrs = RAG.second;
190 if (NT.second.second.isValid())
190 if (NT.second.second.isValid())
191 return Error(NT.second.second,
191 return Error(NT.second.second,
196 if (I->second.second.isValid())
197 return Error(I->second.second,
201 return Error(ForwardRefComdats.begin()->second,
206 return Error(ForwardRefVals.begin()->second.second,
206 return Error(ForwardRefVals.begin()->second.second,
211 return Error(ForwardRefValIDs.begin()->second.second,
211 return Error(ForwardRefValIDs.begin()->second.second,
216 return Error(ForwardRefMDNodes.begin()->second.second,
216 return Error(ForwardRefMDNodes.begin()->second.second,
222 if (N.second && !N.second->isResolved())
222 if (N.second && !N.second->isResolved())
223 N.second->resolveCycles();
265 Slots->Types.insert(std::make_pair(I.first, I.second.first));
276 return Error(ForwardRefValueInfos.begin()->second.front().second,
276 return Error(ForwardRefValueInfos.begin()->second.front().second,
281 return Error(ForwardRefAliasees.begin()->second.front().second,
281 return Error(ForwardRefAliasees.begin()->second.front().second,
286 return Error(ForwardRefTypeIds.begin()->second.front().second,
286 return Error(ForwardRefTypeIds.begin()->second.front().second,
447 Entry.second = SMLoc();
473 Entry.second = SMLoc();
498 F->addMetadata(MD.first, *MD.second);
757 FI->second.first->replaceAllUsesWith(Init);
948 GVal = I->second.first;
1074 GVal = I->second.first;
1418 Val = I->second.first;
1447 Val = I->second.first;
2355 Entry.second = Lex.getLoc();
2370 Entry.second = Lex.getLoc();
2687 if (Entry.first && !Entry.second.isValid())
2694 Entry.second = SMLoc();
2720 Entry.second = SMLoc();
2843 if (isa<BasicBlock>(P.second.first))
2845 P.second.first->replaceAllUsesWith(
2846 UndefValue::get(P.second.first->getType()));
2847 P.second.first->deleteValue();
2851 if (isa<BasicBlock>(P.second.first))
2853 P.second.first->replaceAllUsesWith(
2854 UndefValue::get(P.second.first->getType()));
2855 P.second.first->deleteValue();
2861 return P.Error(ForwardRefVals.begin()->second.second,
2861 return P.Error(ForwardRefVals.begin()->second.second,
2865 return P.Error(ForwardRefValIDs.begin()->second.second,
2865 return P.Error(ForwardRefValIDs.begin()->second.second,
2884 Val = I->second.first;
2919 Val = I->second.first;
2968 Value *Sentinel = FI->second.first;
2971 getTypeString(FI->second.first->getType()) + "'");
2985 Value *Sentinel = FI->second.first;
2988 getTypeString(FI->second.first->getType()) + "'");
3271 .first->second.insert(std::make_pair(std::move(Label), nullptr))
3272 .first->second;
5447 return Error(FRVI->second.second, "invalid forward reference to "
5447 return Error(FRVI->second.second, "invalid forward reference to "
5450 return Error(FRVI->second.second, "invalid forward reference to "
5450 return Error(FRVI->second.second, "invalid forward reference to "
5468 Fn = cast<Function>(I->second.first);
5553 for (const auto &I : Blocks->second) {
5555 GlobalValue *GV = I.second;
5978 if (!SeenCases.insert(Constant).second)
5990 SI->addCase(Table[i].first, Table[i].second);
6696 PN->addIncoming(PHIVals[i].first, PHIVals[i].second);
7511 for (auto TIDRef : FwdRefTIDs->second) {
7600 for (auto P : I.second) {
7605 FwdRef.first->second.push_back(
7606 std::make_pair(&TI[P.first].VTableVI, P.second));
7618 for (auto TIDRef : FwdRefTIDs->second) {
7941 for (auto VIRef : FwdRefVIs->second) {
7952 for (auto AliaseeRef : FwdRefAliasees->second) {
8220 FwdRef.first->second.push_back(std::make_pair(AS.get(), Loc));
8353 for (auto P : I.second) {
8358 FwdRef.first->second.push_back(
8359 std::make_pair(&Calls[P.first].first, P.second));
8440 for (auto P : I.second) {
8445 FwdRef.first->second.push_back(
8446 std::make_pair(&VTableFuncs[P.first].FuncVI, P.second));
8501 for (auto P : I.second) {
8506 FwdRef.first->second.push_back(std::make_pair(&Refs[P.first], P.second));
8506 FwdRef.first->second.push_back(std::make_pair(&Refs[P.first], P.second));
8596 for (auto P : I.second) {
8601 FwdRef.first->second.push_back(
8602 std::make_pair(&TypeTests[P.first], P.second));
8637 for (auto P : I.second) {
8642 FwdRef.first->second.push_back(
8643 std::make_pair(&VFuncIdList[P.first].GUID, P.second));
8676 for (auto P : I.second) {
8681 FwdRef.first->second.push_back(
8682 std::make_pair(&ConstVCallList[P.first].VFunc.GUID, P.second));
8853 ModulePath = I->second;
lib/BinaryFormat/AMDGPUMetadataVerifier.cpp 72 return verifyNode(Entry->second);
lib/BinaryFormat/MsgPackDocument.cpp 45 if (ItAndInserted.second) {
47 ItAndInserted.first->second = getDocument()->getNode();
49 return ItAndInserted.first->second;
235 Node = Stack.back().MapIt->second;
lib/BinaryFormat/MsgPackDocumentYAML.cpp 218 IO.mapRequired(I.first.toString().c_str(), I.second);
lib/Bitcode/Reader/BitcodeAnalyzer.cpp 112 return Info->RecordNames[i].second.c_str();
655 const PerBlockIDStats &Stats = I->second;
695 const PerRecordStats &RecStats = Stats.CodeFreq[FreqPairs[i].second];
714 FreqPairs[i].second, I->first, BlockInfo, CurStreamType))
717 O.OS << "UnknownCode" << FreqPairs[i].second << "\n";
lib/Bitcode/Reader/BitcodeReader.cpp 2244 unsigned ValID = GlobalInitWorklist.back().second;
2258 unsigned ValID = IndirectSymbolInitWorklist.back().second;
2274 unsigned ValID = FunctionPrefixWorklist.back().second;
2287 unsigned ValID = FunctionPrologueWorklist.back().second;
2300 unsigned ValID = FunctionPersonalityFnWorklist.back().second;
2987 TheModule->getGlobalList().push_back(Pair.second);
3804 auto &BBRefs = BBFRI->second;
5195 while (DeferredFunctionInfoIterator->second == 0) {
5231 if (DFII->second == 0)
5240 if (Error JumpFailed = Stream.JumpToBit(DFII->second))
5256 UpgradeIntrinsicCall(CI, I.second);
5265 CallSite(*UI++).setCalledFunction(I.second);
5321 UpgradeIntrinsicCall(CI, I.second);
5324 I.first->replaceAllUsesWith(I.second);
5330 I.first->replaceAllUsesWith(I.second);
5453 auto Linkage = VLI->second;
5467 auto Linkage = VLI->second;
5582 auto &Hash = getThisModule()->second.second;
5915 FS->setOriginalName(VIAndOriginalGUID.second);
5942 AS->setOriginalName(GUID.second);
5964 FS->setOriginalName(GUID.second);
5992 VS->setOriginalName(GUID.second);
6235 LastSeenModule->second.second[Pos++] = Val;
lib/Bitcode/Reader/MetadataLoader.cpp 273 Array.second->replaceAllUsesWith(resolveTypeRefArray(Array.first.get()));
281 Ref.second->replaceAllUsesWith(CT);
283 Ref.second->replaceAllUsesWith(Ref.first);
343 return OldTypeRefs.Arrays.back().second.get();
486 if (auto *SPs = dyn_cast_or_null<MDTuple>(CU_SP.second))
1971 GO.addMetadata(K->second, *MD);
2030 if (I->second == LLVMContext::MD_tbaa && StripTBAA)
2051 if (HasSeenOldLoopTags && I->second == LLVMContext::MD_loop)
2054 if (I->second == LLVMContext::MD_tbaa) {
2058 Inst->setMetadata(I->second, MD);
2076 if (!MDKindMap.insert(std::make_pair(Kind, NewKind)).second)
lib/Bitcode/Reader/ValueList.cpp 161 Value *RealVal = operator[](ResolveConstants.back().second);
197 NewOp = operator[](It->second);
lib/Bitcode/Writer/BitcodeWriter.cpp 194 for (auto &Summary : GUIDSummaryLists.second.SummaryList)
230 return VMI->second;
444 for (auto &Summary : M.second) {
454 for (auto &Summary : Summaries.second.SummaryList)
493 return VMI->second;
747 AttributeSet AS = Pair.second;
2151 Record.push_back(VE.getMetadataID(I.second));
2181 Record.push_back(VE.getMetadataID(MDs[i].second));
3496 const auto &Hash = Value.second;
3601 writeWholeProgramDevirtResolutionByArg(NameVals, A.first, A.second);
3620 W.second);
3652 NameVals.push_back(SpecialRefCnts.second); // worefcnt
3662 NameVals.push_back(static_cast<uint8_t>(ECI.second.Hotness));
3664 NameVals.push_back(ECI.second.RelBlockFreq);
3757 ArrayRef<uint64_t>{GVI.second, GVI.first});
3876 S.second, VE);
3906 ArrayRef<uint64_t>{GVI.second, GVI.first});
3987 GlobalValueSummary *S = I.second;
4065 EI.second.getHotness() != CalleeInfo::HotnessType::Unknown;
4102 NameVals.push_back(static_cast<uint8_t>(EI.second.Hotness));
4166 for (auto It = TidIter.first; It != TidIter.second; ++It) {
4167 writeTypeIdSummaryRecord(NameVals, StrtabBuilder, It->second.first,
4168 It->second.second);
4168 It->second.second);
lib/Bitcode/Writer/ValueEnumerator.cpp 228 [](const Entry &L, const Entry &R) { return L.second < R.second; }))
228 [](const Entry &L, const Entry &R) { return L.second < R.second; }))
236 Stack.back().Shuffle[I] = List[I].second;
243 if (IDPair.second)
248 IDPair.second = true;
387 EnumerateMetadata(nullptr, I.second);
399 EnumerateMetadata(F.isDeclaration() ? nullptr : &F, I.second);
424 EnumerateMetadata(&F, MDs[i].second);
444 return I->second;
463 return I->second-1;
509 OS << "Metadata: slot = " << I->second.ID << "\n";
510 OS << "Metadata: function = " << I->second.F << "\n";
532 return LHS.second > RHS.second;
532 return LHS.second > RHS.second;
583 auto &Entry = MD.second;
628 Worklist.back().second, N->op_end(),
632 Worklist.back().second = ++I;
666 MDIndex &Entry = Insertion.first->second;
667 if (!Insertion.second) {
812 Values[ValueID-1].second++;
lib/Bitcode/Writer/ValueEnumerator.h 170 return I->second-1;
180 return I->second;
184 if (!Group.second.hasAttributes())
188 return I->second;
lib/CodeGen/AggressiveAntiDepBreaker.cpp 270 if (RegSet.insert(P->getReg()).second)
533 const TargetRegisterClass *RC = Q.second.RC;
705 MachineInstr *UseMI = Q.second.Operand->getParent();
720 if (!Q.second.Operand->isDef() || !Q.second.Operand->isEarlyClobber())
720 if (!Q.second.Operand->isDef() || !Q.second.Operand->isEarlyClobber())
723 MachineInstr *DefMI = Q.second.Operand->getParent();
967 unsigned NewReg = S->second;
976 Q.second.Operand->setReg(NewReg);
980 const SUnit *SU = MISUnitMap[Q.second.Operand->getParent()];
982 UpdateDbgValues(DbgValues, Q.second.Operand->getParent(),
lib/CodeGen/Analysis.cpp 711 if (!P.second) {
712 assert(P.first->second == EHScope && "MBB is part of two scopes!");
785 collectEHScopeMembers(EHScopeMembership, CatchRetPair.second,
lib/CodeGen/AntiDepBreaker.h 73 MachineInstr *PrevMI = DV.second;
lib/CodeGen/AsmPrinter/AccelTable.cpp 463 for (const auto &AttrEnc : Abbrev.second) {
482 for (const auto &AttrEnc : AbbrevIt->second) {
lib/CodeGen/AsmPrinter/AddressPool.cpp 23 return IterBool.first->second.Number;
67 Entries[I.second.Number] =
68 I.second.TLS
lib/CodeGen/AsmPrinter/AsmPrinter.cpp 1290 const GlobalVariable *GV = I.second.first;
1291 unsigned Cnt = I.second.second;
1291 unsigned Cnt = I.second.second;
1436 OutStreamer->EmitSymbolValue(Stub.second.getPointer(),
1463 OutStreamer->EmitSymbolValue(Stub.second.getPointer(),
1504 if (!AliasVisited.insert(Cur).second)
1830 if (!EmittedSets.insert(MBB).second)
2656 int NumUses = (int)Result.second;
3060 return GCPI->second.get();
3071 return IterBool.first->second.get();
lib/CodeGen/AsmPrinter/CodeViewDebug.cpp 242 if (Insertion.second) {
262 return Insertion.first->second;
269 InlineSite *Site = &SiteInsertion.first->second;
270 if (SiteInsertion.second) {
365 return I->second;
380 return I->second;
448 return I->second;
467 assert(InsertResult.second && "DINode was already assigned a type index");
581 emitDebugInfoForFunction(P.first, *P.second);
914 emitInlinedCallSite(FI, ChildSite, I->second);
937 if (ComdatDebugSections.insert(DebugSec).second)
1081 emitInlinedCallSite(FI, InlinedAt, I->second);
1086 MDTuple *Strs = cast<MDTuple>(Annot.second);
1186 const MCSymbol *End = getLabelAfterInsn(Range.second);
1287 if (!R.empty() && R.back().second == Begin)
1288 R.back().second = End;
1306 const DILocation *InlinedAt = IV.second;
1309 const auto &Entries = I.second;
1334 assert(Insertion.second && "function already has info");
1335 CurFn = Insertion.first->second.get();
2216 if (I != CompleteTypeIndices.end() && I->second == TypeIndex())
2401 for (const DISubprogram *SP : MethodItr.second) {
2468 return I->second;
2494 return I->second;
2556 if (!InsertResult.second)
2557 return InsertResult.first->second;
2757 LI != ScopeVariables.end() ? &LI->second : nullptr;
2760 GI != ScopeGlobals.end() ? GI->second.get() : nullptr;
2783 if (Ranges.size() != 1 || !getLabelAfterInsn(Ranges.front().second))
2806 if (!BlockInsertion.second)
2812 assert(Range.first && Range.second);
2813 LexicalBlock &Block = BlockInsertion.first->second;
2815 Block.End = getLabelAfterInsn(Range.second);
2969 const DIType *T = UDT.second;
3014 if (Insertion.second)
3015 Insertion.first->second = std::make_unique<GlobalVariableList>();
3016 VariableList = Insertion.first->second.get();
lib/CodeGen/AsmPrinter/DbgEntityHistoryCalculator.cpp 116 auto &VarSet = I->second;
195 if (!I.second)
214 for (const auto &Var : I->second)
317 if (Pair.second.empty())
324 for (EntryIndex Idx : Pair.second) {
342 const Entries &Entries = VarRangePair.second;
345 const DILocation *Location = Var.second;
lib/CodeGen/AsmPrinter/DebugHandlerBase.cpp 108 assert(R.second && "InsnRange does not have second instruction!");
110 requestLabelAfterInsn(R.second);
213 const auto &Entries = I.second;
270 const MachineInstr *MI = I.second;
295 if (I->second)
302 I->second = PrevLabel;
326 if (I->second)
334 I->second = PrevLabel;
lib/CodeGen/AsmPrinter/DwarfCompileUnit.cpp 479 auto &List = *IndexAndList.second;
517 {DD->getLabelBeforeInsn(R.first), DD->getLabelAfterInsn(R.second)});
758 if (!Res.second) {
783 Children.push_back(constructVariableDIE(*DV.second, *Scope, ObjectPointer));
1071 return I->second.get();
lib/CodeGen/AsmPrinter/DwarfDebug.cpp 499 return !getLabelAfterInsn(Ranges.front().second);
560 for (auto ArgReg : CallFwdRegsInfo->second) {
561 bool InsertedReg = ForwardedRegWorklist.insert(ArgReg.Reg).second;
610 FwdReg = EntryValReg->second;
650 DbgValueLoc DbgLocVal(ParamValue->second, Val);
658 DbgValueLoc DbgLocVal(ParamValue->second,
679 FwdReg = EntryValReg->second;
1007 if (Processed.insert(GV).second)
1069 auto &TheCU = *P.second;
1172 auto &CU = *P.second;
1283 cast<DILocalVariable>(Var.first), Var.second);
1338 const MachineInstr *LScopeEnd = LSRange.back().second;
1463 Values.push_back(R.second);
1520 const auto &HistoryMapEntries = I.second;
1526 if (const DILocation *IA = IV.second)
1536 *Scope, LocalVar, IV.second));
1590 const MachineInstr *MI = I.second;
1600 if (const DILocation *IA = IL.second)
1613 createConcreteEntity(TheCU, *Scope, Label, IL.second, Sym);
1618 if (!Processed.insert(InlinedEntity(DN, nullptr)).second)
1858 if (!Processed.insert(InlinedEntity(DN, nullptr)).second)
2045 DwarfCompileUnit *TheU = NU.second;
2352 const MCSymbol *Begin = P.second.front()->Begin;
2360 } else if (NewBase != Begin || P.second.size() > 1) {
2378 for (const auto *RS : P.second) {
2508 SmallVector<SymbolCU, 8> &List = I.second;
2673 return Pair.second->getCUNode()->isDebugDirectivesOnly();
2703 return Pair.second->getCUNode()->isDebugDirectivesOnly();
2754 return Pair.second->getCUNode()->isDebugDirectivesOnly();
2763 auto &TheCU = *P.second;
2886 if (!Ins.second) {
2887 CU.addDIETypeSignature(RefDie, Ins.first->second);
2905 Ins.first->second = Signature;
2942 TypeSignatures.erase(TU.second);
3037 return SectionLabels.find(S)->second;
lib/CodeGen/AsmPrinter/DwarfFile.cpp 112 Cached->second->addMMIEntry(*Var);
lib/CodeGen/AsmPrinter/DwarfStringPool.cpp 30 if (I.second) {
lib/CodeGen/AsmPrinter/DwarfUnit.cpp 1438 const DINode *D = CI->second;
lib/CodeGen/AsmPrinter/EHStreamer.cpp 262 const PadRange &P = L->second;
lib/CodeGen/AsmPrinter/WinException.cpp 484 auto &StateAndEnd = InvokeMapIter->second;
492 CurrentEndLabel = StateAndEnd.second;
500 CurrentEndLabel = StateAndEnd.second;
879 OS.EmitIntValue(IPStatePair.second, 4);
914 BaseState = FuncInfo.FuncletBaseStateMap.find(FuncletPad)->second;
1193 if (HandlerStack.back().second == CurrentState)
lib/CodeGen/BranchFolding.cpp 486 auto n = EHScopeI->second;
560 return I->second;
651 if (EHScope1->second != EHScope2->second)
651 if (EHScope1->second != EHScope2->second)
1158 if (!UniquePreds.insert(PBB).second)
1405 SameEHScope = MBBEHScope->second == FallThroughEHScope->second;
1405 SameEHScope = MBBEHScope->second == FallThroughEHScope->second;
lib/CodeGen/BreakFalseDeps.cpp 230 unsigned OpIdx = UndefReads.back().second;
245 OpIdx = UndefReads.back().second;
lib/CodeGen/CalcSpillWeights.cpp 220 if (!visited.insert(mi).second)
265 if (TargetHint.first == 0 && TargetHint.second)
270 if (!HintedRegs.insert(Hint.Reg).second ||
271 (TargetHint.first != 0 && Hint.Reg == TargetHint.second))
lib/CodeGen/CodeGenPrepare.cpp 894 if (Key.first == Key.second)
898 GCRelocateInst *I = Item.second;
908 RelocateInstMap[MaybeBase->second].push_back(I);
1067 MadeChange = simplifyRelocatesOffABase(Item.first, Item.second);
1897 auto GEPs = std::move(it->second);
2030 if (!VisitedBBs.insert(*PI).second)
2884 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) {
2943 if (it != NodeMap.end() && it->second == CurrentIndex)
2996 V = SV->second;
3006 if (!Visited.insert(P).second)
3270 auto *Result = ST.Get(Map.find(Original)->second);
3291 if (!Visited.insert(Item).second)
3300 Value *SecondValue = Item.second->getIncomingValueForBlock(B);
3321 if (MatchedPHIs.insert(FirstPhi).second)
3365 ST.ReplacePhi(MV.first, MV.second);
3596 if (It->second.getInt() == ExtTy)
3616 if (It != PromotedInsts.end() && It->second.getInt() == ExtTy)
3617 return It->second.getPointer();
4425 if (!ConsideredInsts.insert(I).second)
4590 unsigned OpNo = MemoryUses[i].second;
4691 if (!Visited.insert(V).second)
5210 SExts &Insts = Entry.second;
5286 &LargeOffsetGEPs = Entry.second;
5292 if (LHS.second != RHS.second)
5292 if (LHS.second != RHS.second)
5293 return LHS.second < RHS.second;
5293 return LHS.second < RHS.second;
5302 if (LargeOffsetGEPs.front().second == LargeOffsetGEPs.back().second)
5302 if (LargeOffsetGEPs.front().second == LargeOffsetGEPs.back().second)
5305 int64_t BaseOffset = LargeOffsetGEPs.begin()->second;
5311 int64_t Offset = LargeOffsetGEP->second;
5527 if (AlreadySeen->second != nullptr)
5528 UnhandledExts.insert(AlreadySeen->second);
5728 if (!Visited.insert(I).second)
lib/CodeGen/CriticalAntiDepBreaker.cpp 351 MachineOperand *RefOper = I->second;
644 if (unsigned NewReg = findSuitableFreeRegister(Range.first, Range.second,
656 Q = Range.first, QE = Range.second; Q != QE; ++Q) {
657 Q->second->setReg(NewReg);
661 const SUnit *SU = MISUnitMap[Q->second->getParent()];
663 UpdateDbgValues(DbgValues, Q->second->getParent(),
lib/CodeGen/EarlyIfConversion.cpp 274 if (InsertAfter.insert(DefMI).second)
lib/CodeGen/ExecutionDomainFix.cpp 226 if (DomP.second)
227 visitSoftInstr(MI, DomP.second);
lib/CodeGen/FaultMaps.cpp 77 emitFunctionInfo(FFI.first, FFI.second);
lib/CodeGen/FuncletLayout.cpp 56 return FuncletX->second < FuncletY->second;
56 return FuncletX->second < FuncletY->second;
lib/CodeGen/GCMetadata.cpp 72 return *I->second;
lib/CodeGen/GlobalISel/CSEInfo.cpp 261 dbgs() << "CSEInfo::CSE Hit for Opc " << It.first << " : " << It.second
lib/CodeGen/GlobalISel/IRTranslator.cpp 176 return *VRegsIt->second;
656 SwitchCG::JumpTable *JT = &SL->JTCases[I->JTCasesIndex].second;
2055 ArrayRef<MachineInstr *> ComponentPHIs = Phi.second;
2177 emitJumpTableHeader(JTCase.second, JTCase.first, JTCase.first.HeaderBB);
2179 emitJumpTable(JTCase.second, JTCase.second.MBB);
2179 emitJumpTable(JTCase.second, JTCase.second.MBB);
lib/CodeGen/GlobalISel/LegalizerInfo.cpp 111 return Q.Types[Mutation.first] != Mutation.second;
127 const LLT NewTy = Mutation.second;
192 << Mutation.first << ", " << Mutation.second << "\n");
196 return {Rule.getAction(), Mutation.first, Mutation.second};
301 const LegalizeAction Action = LLT2Action.second;
329 llvm::sort(PointerSpecifiedActions.second);
330 checkPartialSizeAndActionsVector(PointerSpecifiedActions.second);
335 unsupportedForDifferentSizes(PointerSpecifiedActions.second));
341 llvm::sort(VectorSpecifiedActions.second);
344 checkPartialSizeAndActionsVector(VectorSpecifiedActions.second);
350 for (SizeAndAction BitsizeAndAction : VectorSpecifiedActions.second) {
353 NumElementsActions.push_back({NumElements, BitsizeAndAction.second});
466 << Action.first << ", " << Action.second << "\n");
467 return {Action.first, i, Action.second};
573 LegalizeAction Action = Vec[VecIdx].second;
595 if (!needsLegalizingToDifferentSize(Vec[i].second) &&
596 Vec[i].second != Unsupported)
604 if (!needsLegalizingToDifferentSize(Vec[i].second) &&
605 Vec[i].second != Unsupported)
633 ->second
641 return {SizeAndAction.second,
666 if (ElementSizeAndAction.second != Legal)
667 return {ElementSizeAndAction.second, IntermediateType};
674 const SizeAndActionsVec &NumElementsVec = (*i).second[TypeIdx];
677 return {NumElementsAndAction.second,
lib/CodeGen/GlobalISel/Localizer.cpp 161 LLVM_DEBUG(dbgs() << "Update use with: " << printReg(NewVRegIt->second)
164 MOUse.setReg(NewVRegIt->second);
lib/CodeGen/GlobalISel/RegisterBankInfo.cpp 103 return *RegRCIt->second;
281 return *It->second;
315 return *It->second;
389 return *It->second;
lib/CodeGen/GlobalISel/Utils.cpp 278 Val = Val.trunc(OpcodeAndSize.second);
281 Val = Val.sext(OpcodeAndSize.second);
284 Val = Val.zext(OpcodeAndSize.second);
lib/CodeGen/GlobalMerge.cpp 651 if (P.second.size() > 1)
652 Changed |= doMerge(P.second, M, false, P.first.first);
655 if (P.second.size() > 1)
656 Changed |= doMerge(P.second, M, false, P.first.first);
660 if (P.second.size() > 1)
661 Changed |= doMerge(P.second, M, true, P.first.first);
lib/CodeGen/IfConversion.cpp 1493 MachineOperand &Op = const_cast<MachineOperand&>(*Clobber.second);
lib/CodeGen/InlineSpiller.cpp 495 if (!UsedValues.insert(VNI).second)
623 MachineOperand &MO = OpPair.first->getOperand(OpPair.second);
812 unsigned Idx = OpPair.second;
895 else if (Ops.front().second == 0) {
1043 MachineOperand &MO = OpPair.first->getOperand(OpPair.second);
1046 if (!OpPair.first->isRegTiedToDefOperand(OpPair.second))
1166 VNInfo *OrigVNI = It->second->getVNInfoAt(Idx.getRegSlot());
1359 SpillsInSubTreeMap[*RIt].second = MBFI.getBlockFreq(Block);
1378 BlockFrequency &SubTreeCost = SpillsInSubTreeMap[*RIt].second;
1379 SubTreeCost += SpillsInSubTreeMap[Child].second;
1388 BlockFrequency &SubTreeCost = SpillsInSubTreeMap[*RIt].second;
1434 if (Ent.second)
1435 SpillsToIns[Ent.first->getBlock()] = Ent.second;
1470 VNInfo *OrigVNI = Ent.first.second;
1471 SmallPtrSet<MachineInstr *, 16> &EqValSpills = Ent.second;
1472 if (Ent.second.empty())
1509 unsigned LiveReg = Insert.second;
lib/CodeGen/InterleavedAccessPass.cpp 407 auto *Vector = Replacement.second.first;
408 auto Index = Replacement.second.second;
408 auto Index = Replacement.second.second;
lib/CodeGen/InterleavedLoadCombinePass.cpp 600 OS << b.second << ") ";
lib/CodeGen/LexicalScopes.cpp 134 return I != InlinedLexicalScopeMap.end() ? &I->second : nullptr;
165 return &I->second;
179 CurrentFnLexicalScope = &I->second;
182 return &I->second;
194 return &I->second;
206 return &I->second;
216 return &I->second;
228 AbstractScopesList.push_back(&I->second);
229 return &I->second;
268 S->extendInsnRange(R.second);
lib/CodeGen/LiveDebugValues.cpp 599 unsigned ID = It->second;
616 for (auto Fragment : MapIt->second) {
1089 if (!IsInOLapMap.second)
1092 auto &ThisFragmentsOverlaps = IsInOLapMap.first->second;
1093 auto &AllSeenFragments = SeenIt->second;
1109 ASeenFragmentsOverlaps->second.push_back(ThisFragment);
1163 InLocsT = OL->second;
1165 InLocsT &= OL->second;
1237 VarLocSet &Pending = Iter.second;
1371 MBBJoined |= Visited.insert(MBB).second;
1392 if (OnPending.insert(s).second) {
lib/CodeGen/LiveDebugVariables.cpp 813 const VNInfo *DstVNI = CopyValues[j].second;
846 DbgValueLocation Loc = Defs[i].second;
904 SlotIndex REnd = LIS.getInstructionIndex(*Range.second);
1212 std::tie(Spilled, SpillOffset) = Pair.second;
1350 unsigned SpillOffset = Spilled ? SpillIt->second : 0;
lib/CodeGen/LiveInterval.cpp 536 if (!Seen.insert(VNI).second)
lib/CodeGen/LiveIntervals.cpp 245 RMB.second = RegMaskSlots.size() - RMB.first;
387 VNInfo *VNI = WorkList.back().second;
398 !UsedPHIs.insert(VNI).second)
402 if (!LiveOut.insert(Pred).second)
418 if (!LiveOut.insert(Pred).second)
737 LiveRange::const_iterator &I = RUP.second;
765 LiveRange::const_iterator &I = SRP.second;
1022 if (!Updated.insert(&LR).second)
lib/CodeGen/LivePhysRegs.cpp 110 if (Reg.second->isReg() && Reg.second->isDead())
110 if (Reg.second->isReg() && Reg.second->isDead())
112 if (Reg.second->isRegMask() &&
113 MachineOperand::clobbersPhysReg(Reg.second->getRegMask(), Reg.first))
lib/CodeGen/LiveRangeCalc.cpp 252 if (EP.first != nullptr || EP.second)
404 FoundUndef |= EP.second;
405 setLiveOutValue(Pred, EP.second ? &UndefVNI : VNI);
411 if (VNI || EP.second)
458 Entry->second.first.resize(N);
459 Entry->second.second.resize(N);
459 Entry->second.second.resize(N);
461 BitVector &DefOnEntry = Entry->second.first;
462 BitVector &UndefOnEntry = Entry->second.second;
462 BitVector &UndefOnEntry = Entry->second.second;
513 !IDomValue.second) {
514 Map[IDom->getBlock()].second = IDomValue.second =
514 Map[IDom->getBlock()].second = IDomValue.second =
528 if (!Value.second)
529 Value.second =
535 if (DomTree->dominates(IDom, Value.second)) {
lib/CodeGen/LiveRangeEdit.cpp 226 if (UseMI->readsWritesVirtualRegister(LI->reg, &Ops).second)
lib/CodeGen/LiveRangeShrink.cpp 84 unsigned OrderOld = M.find(Old)->second;
85 unsigned OrderNew = NewIter->second;
90 for (MachineInstr *I = Old->getNextNode(); M.find(I)->second == OrderNew;
150 BarrierMI = UseMap[MO.getReg()].second;
lib/CodeGen/LiveRegMatrix.cpp 85 LaneBitmask Mask = (*Units).second;
lib/CodeGen/LiveStacks.cpp 72 return I->second;
80 I->second.print(OS);
lib/CodeGen/MIRCanonicalizerPass.cpp 127 II.second->dump();
133 MBB->splice(getPos(), MBB, II.second);
284 [&](MachineInstr &MI) -> bool { return &MI == E.second; });
292 MultiUsers[E.second], MBB,
lib/CodeGen/MIRParser/MIParser.cpp 117 .second;
197 Names2TargetIndices.insert(std::make_pair(StringRef(I.second), I.first));
218 std::make_pair(StringRef(I.second), I.first));
240 std::make_pair(StringRef(I.second), I.first));
261 Names2MMOTargetFlags.insert(std::make_pair(StringRef(I.second), I.first));
325 if (I.second) {
329 I.first->second = Info;
331 return *I.first->second;
338 if (I.second) {
639 bool WasInserted = MBBSlots.insert(std::make_pair(ID, MBB)).second;
1389 MI.tieOperands(TiedPair.first, TiedPair.second);
1662 MBB = MBBInfo->second;
1691 MF.getFrameInfo().getObjectAllocation(ObjectInfo->second))
1697 FI = ObjectInfo->second;
1719 FI = ObjectInfo->second;
1792 Dest = MachineOperand::CreateJTI(JumpTableEntryInfo->second);
1841 Node = NodeInfo->second.get();
2980 return BlockInfo->second;
3025 return ValueInfo->second;
lib/CodeGen/MIRParser/MIRParser.cpp 608 const VRegInfo &Info = *P.second;
680 .second)
718 .second)
830 .second)
851 .second)
lib/CodeGen/MIRPrinter.cpp 309 if (LI.second)
310 printRegMIR(LI.second, LiveIn.VirtualRegister, TRI);
420 const FrameIndexOperand &StackObject = StackObjectInfo->second;
437 const FrameIndexOperand &StackObject = StackObjectInfo->second;
439 YMF.StackObjects[StackObject.ID].LocalOffset = LocalObject.second;
456 const FrameIndexOperand &StackObject = StackObjectInfo->second;
483 for (auto ArgReg : CSInfo.second) {
562 if (RP.second)
813 const FrameIndexOperand &Operand = ObjectInfo->second;
862 OS << StringRef(TRI->getRegMaskNames()[RegMaskInfo->second]).lower();
lib/CodeGen/MIRVRegNamerUtils.cpp 232 auto Rename = I->second;
lib/CodeGen/MachineBasicBlock.cpp 1273 if (!SeenMBBs.insert(MBB).second ||
lib/CodeGen/MachineBlockPlacement.cpp 921 if (!SeenPreds.insert(SuccPred).second)
1218 TriangleChain Chain = std::move(Found->second);
1224 assert(InsertResult.second && "Block seen twice.");
1233 TriangleChain &Chain = ChainPair.second;
1247 assert(InsertResult.second && "Block seen twice.");
1488 MachineBasicBlock *Succ = FoundEdge->second.BB;
1493 return FoundEdge->second;
1674 if (!UpdatedPreds.insert(&Chain).second)
2373 Cost += ExitWithFreq.second;
lib/CodeGen/MachineCSE.cpp 321 for (MCRegAliasIterator AI(PhysDefs[i].second, TRI, true); AI.isValid();
344 if (MRI->isAllocatable(PhysDefs[i].second) ||
345 MRI->isReserved(PhysDefs[i].second))
506 delete SI->second;
644 unsigned NewReg = CSEPair.second;
690 if (!MBB->isLiveIn(LiveIn.second))
691 MBB->addLiveIn(LiveIn.second);
lib/CodeGen/MachineCombiner.cpp 181 assert(II->second < InstrDepth.size() && "Bad Index");
182 MachineInstr *DefInstr = InsInstrs[II->second];
185 DepthOp = InstrDepth[II->second];
lib/CodeGen/MachineCopyPropagation.cpp 95 CI->second.Avail = false;
107 markRegsUnavailable(I->second.DefRegs, TRI);
110 if (MachineInstr *MI = I->second.MI)
133 auto &Copy = I.first->second;
148 if (MustBeAvailable && !CI->second.Avail)
150 return CI->second.MI;
lib/CodeGen/MachineFunction.cpp 504 if (I->second)
505 OS << " in " << printReg(I->second, TRI);
834 CallSiteInfo CSInfo = std::move(CSIt->second);
854 CallSiteInfo CSInfo = CSIt->second;
lib/CodeGen/MachineInstrBundle.cpp 167 if (ExternUseSet.insert(Reg).second) {
184 if (LocalDefSet.insert(Reg).second) {
200 if (LocalDefSet.insert(SubReg).second)
212 if (Added.insert(Reg).second) {
lib/CodeGen/MachineLICM.cpp 831 if (static_cast<int>(RegPressure[Class]) < -RPIdAndCost.second)
834 RegPressure[Class] += RPIdAndCost.second;
859 bool isNew = ConsiderSeen ? RegSeen.insert(Reg).second : false;
1152 if (RPIdAndCost.second <= 0)
1164 if (static_cast<int>(RP[Class]) + RPIdAndCost.second >= Limit)
1183 RP[RPIdAndCost.first] += RPIdAndCost.second;
1369 if (const MachineInstr *Dup = LookForDuplicate(MI, CI->second)) {
1429 return LookForDuplicate(MI, CI->second) != nullptr;
1491 CI->second.push_back(MI);
lib/CodeGen/MachineModuleInfo.cpp 133 std::swap(Result, I->second);
267 return I != MachineFunctions.end() ? I->second.get() : nullptr;
280 if (I.second) {
285 I.first->second.reset(MF);
287 MF = I.first->second.get();
lib/CodeGen/MachineOperand.cpp 411 return Found->second;
419 return I.second;
505 return I.second;
547 const bool HasBitmaskFlags = Flags.second;
563 unsigned BitMask = Flags.second;
571 OS << Mask.second;
lib/CodeGen/MachineOutliner.cpp 325 assert(ChildPair.second && "Node had a null child!");
326 setSuffixIndices(*ChildPair.second,
327 CurrNodeLen + ChildPair.second->size());
535 if (!ChildPair.second->isLeaf())
536 ToVisit.push_back(ChildPair.second);
541 LeafChildren.push_back(ChildPair.second);
669 unsigned MINumber = ResultIt->second;
lib/CodeGen/MachinePipeliner.cpp 543 Cycles[KV.first] = Cycles[KV.second];
544 Stages[KV.first] = Stages[KV.second];
572 MF.DeleteMachineInstr(KV.second);
687 for (auto Load : I->second) {
1129 SDep &D = I->second;
1156 BackEdge = Dep->second;
1189 if (!Added.test(OD.second)) {
1190 AdjK[OD.first].push_back(OD.second);
1191 Added.set(OD.second);
1519 if (!Visited.insert(Cur).second)
2155 std::pair<unsigned, int64_t> RegAndOffset = It->second;
2174 MI->getOperand(OffsetPos).getImm() + RegAndOffset.second * OffsetDiff;
2190 if (!Visited.insert(Def).second)
2352 EarlyCycle = std::min(EarlyCycle, it->second);
2375 LateCycle = std::max(LateCycle, it->second);
2781 MI->getOperand(OffsetPos).getImm() - It->second.second;
2781 MI->getOperand(OffsetPos).getImm() - It->second.second;
2875 for (SUnit *CI : cycleInstrs->second) {
lib/CodeGen/MachineRegisterInfo.cpp 206 if (!VRegInfo[Reg].second)
214 I.second = 0;
444 if (I->first == Reg || I->second == Reg)
453 if (I->second == VReg)
463 return I->second;
475 if (LiveIns[i].second) {
476 if (use_nodbg_empty(LiveIns[i].second)) {
487 TII.get(TargetOpcode::COPY), LiveIns[i].second)
lib/CodeGen/MachineSSAUpdater.cpp 94 AVals[PredValues[i].first] = PredValues[i].second;
194 InsertedPHI.addReg(PredValues[i].second).addMBB(PredValues[i].first);
lib/CodeGen/MachineScheduler.cpp 897 MachineBasicBlock::iterator OrigPrevMI = P.second;
1619 if (Result.second)
1621 StoreChainDependents[Result.first->second].push_back(&SU);
lib/CodeGen/MachineSink.cpp 329 auto NewSucc = Pair.first->SplitCriticalEdge(Pair.second, *this);
334 << printMBBReference(*Pair.second) << '\n');
425 if (!CEBCandidates.insert(std::make_pair(From, To)).second)
588 return Succs->second;
621 return it.first->second;
lib/CodeGen/MachineTraceMetrics.cpp 470 return LB.Visited.insert(To).second;
969 if (I->second < UseHeight)
970 I->second = UseHeight;
1100 Cycle = HeightI->second;
lib/CodeGen/MachineVerifier.cpp 166 return vregsPassed.insert(Reg).second;
185 return vregsRequired.insert(Reg).second;
lib/CodeGen/ModuloSchedule.cpp 1004 std::pair<unsigned, int64_t> RegAndOffset = It->second;
1011 NewOffset += RegAndOffset.second * (CurStageNum - InstStageNum);
1062 if (!Visited.insert(Def).second)
1159 MachineInstr *OrigMI = OrigInstr->second;
1454 return I->second;
1458 return KV.second;
1466 Register R = I->second;
1753 Sub.first->substituteRegister(DefMO.getReg(), Sub.second, /*SubIdx=*/0,
1886 if (OldAndNew.first == OldAndNew.second)
1893 OldAndNew.second.print(errs());
1971 getToken(StageAndCycle.second, "-");
1979 StageTokenAndValue.second.drop_front().getAsInteger(10, Stage);
1980 CycleTokenAndValue.second.drop_front().getAsInteger(10, Cycle);
lib/CodeGen/OptimizePHIs.cpp 103 if (!PHIsInCycle.insert(MI).second)
149 if (!PHIsInCycle.insert(MI).second)
lib/CodeGen/PHIElimination.cpp 390 if (!MBBsInsertedInto.insert(&opBlock).second)
lib/CodeGen/PeepholeOptimizer.cpp 1368 if (TII->FoldImmediate(MI, *II->second, Reg, MRI)) {
1403 if (CopySrcRegs.insert(SrcReg).second) {
1409 MachineInstr *PrevCopy = CopyMIs.find(SrcReg)->second;
1468 Register PrevDstReg = PrevCopy->second->getOperand(0).getReg();
1584 (*CP).second);
lib/CodeGen/PostRASchedulerList.cpp 697 MachineBasicBlock::iterator OrigPrivMI = P.second;
lib/CodeGen/PrologEpilogInserter.cpp 259 I.first->insert(I.first->begin(), I.second.begin(), I.second.end());
259 I.first->insert(I.first->begin(), I.second.begin(), I.second.end());
499 if (Visited.insert(SuccBB).second)
911 int64_t FIOffset = (StackGrowsDown ? -Offset : Offset) + Entry.second;
lib/CodeGen/RegAllocFast.cpp 897 if (ThroughRegs.insert(Reg).second)
lib/CodeGen/RegAllocGreedy.cpp 325 Evictees[Evictee].second = PhysReg;
752 LiveInterval *LI = &LIS->getInterval(~CurQueue.top().second);
1489 unsigned PhysReg = VregEvictorInfo.second;
2980 if (Visited.insert(HI.Reg).second)
lib/CodeGen/RegAllocPBQP.cpp 409 G.addEdgeBypassingCostAllocator(NId, MId, I->second);
658 auto &VRegAllowed = KV.second;
lib/CodeGen/RegisterCoalescer.cpp 948 ShrinkB |= P.second;
968 ShrinkB |= P.second;
1681 if (SrcReg == DstReg && !Visited.insert(UseMI).second)
2892 TaintedLanes = TaintExtent[TaintNum].second;
lib/CodeGen/RegisterScavenging.cpp 593 MachineBasicBlock::iterator SpillBefore = P.second;
lib/CodeGen/RegisterUsageInfo.cpp 68 return makeArrayRef<uint32_t>(It->second);
96 if (MachineOperand::clobbersPhysReg(&(FPRMPair->second[0]), PReg))
lib/CodeGen/SafeStack.cpp 359 if (Visited.insert(I).second)
lib/CodeGen/SafeStackColoring.cpp 44 return LiveRanges[IT->second];
176 LocalLiveIn |= I->second.LiveOut;
228 bool IsStart = It.second.IsStart;
229 unsigned AllocaNo = It.second.AllocaNo;
267 dbgs() << " BB [" << BlockRange.first << ", " << BlockRange.second
lib/CodeGen/ScheduleDAG.cpp 532 AddPred(U.first, U.second);
lib/CodeGen/ScheduleDAGInstrs.cpp 347 Reg2SUnitsMap::iterator I = P.second;
632 assert(NumNodes >= Itr->second.size());
633 NumNodes -= Itr->second.size();
635 Itr->second.clear();
651 NumNodes += I.second.size();
664 addChainDependencies(SU, I.second,
673 addChainDependencies(SU, Itr->second,
681 SUList &sus = I.second;
694 SUList &sus = CurrItr->second;
715 return (mapEntry.second.empty()); });
1036 dumpSUList(Itr.second);
1049 for (auto *SU : I.second)
1052 for (auto *SU : I.second)
1341 unsigned SuccTree = SubtreeClasses[P.second->NodeNum];
1413 void advance() { ++DFSStack.back().second; }
1417 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second);
1422 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; }
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 248 if (WorklistMap.insert(std::make_pair(N, Worklist.size())).second)
263 Worklist[It->second] = nullptr;
1769 if (SeenOps.insert(Op.getNode()).second)
1814 if (Worklist[i].second == OrigOpNumber) {
1815 Worklist[i].second = OpNumber;
1823 if (SeenChains.insert(Op).second) {
1834 auto CurOpNumber = Worklist[i].second;
14766 Result.second = NotMaskTZ/8;
14778 unsigned ByteShift = MaskInfo.second;
15097 if (Visited.insert(StoreNodes[i].MemNode->getChain().getNode()).second)
15364 RootCount->second.first == RootNode &&
15365 RootCount->second.second > StoreMergeDependenceLimit)
15365 RootCount->second.second > StoreMergeDependenceLimit)
15439 if (!Visited.insert(N).second)
15476 RootCount.second++;
18546 if (!IsSplat && !DuplicateOps.insert(Op).second)
20667 if (!Visited.insert(Chain.getNode()).second)
lib/CodeGen/SelectionDAG/FastISel.cpp 161 FuncInfo.ValueMap[&*I] = VI->second;
223 if (P.second == DefReg)
284 unsigned UseOrder = I->second;
482 return I->second;
734 bool IdxNIsKill = Pair.second;
777 Ops.push_back(MachineOperand::CreateFI(SI->second));
1772 ResultReg = I->second;
2267 if (!SuccsHandled.insert(SuccMBB).second)
lib/CodeGen/SelectionDAG/FunctionLoweringInfo.cpp 118 CatchObjects.insert({AI, {}}).first->second.push_back(
165 for (int *CatchObjPtr : Iter->second)
322 const auto *Dst = KV.second.get<const BasicBlock *>();
513 return I->second;
522 unsigned &VReg = I.first->second;
523 if (I.second)
537 unsigned Reg = P.second;
lib/CodeGen/SelectionDAG/InstrEmitter.cpp 94 bool isNew = VRBaseMap.insert(std::make_pair(Op, SrcReg)).second;
184 bool isNew = VRBaseMap.insert(std::make_pair(Op, VRBase)).second;
257 bool isNew = VRBaseMap.insert(std::make_pair(Op, VRBase)).second;
283 return I->second;
598 bool isNew = VRBaseMap.insert(std::make_pair(Op, VRBase)).second;
621 bool isNew = VRBaseMap.insert(std::make_pair(Op, NewVReg)).second;
669 bool isNew = VRBaseMap.insert(std::make_pair(Op, NewVReg)).second;
lib/CodeGen/SelectionDAG/LegalizeDAG.cpp 1838 FinalIndices.reserve(IntermedVals[i].second.size() +
1839 IntermedVals[i+1].second.size());
1842 for (unsigned j = 0, f = IntermedVals[i].second.size(); j != f;
1845 FinalIndices.push_back(IntermedVals[i].second[j]);
1847 for (unsigned j = 0, f = IntermedVals[i+1].second.size(); j != f;
1850 FinalIndices.push_back(IntermedVals[i+1].second[j]);
1882 for (unsigned i = 0, e = IntermedVals[0].second.size(); i != e; ++i)
1883 ShuffleVec[IntermedVals[0].second[i]] = i;
1884 for (unsigned i = 0, e = IntermedVals[1].second.size(); i != e; ++i)
1885 ShuffleVec[IntermedVals[1].second[i]] = NumElems + i;
2070 if (!CallInfo.second.getNode()) {
2241 DAG.getLoad(RetVT, dl, CallInfo.second, FIPtr, MachinePointerInfo());
2338 DAG.getLoad(RetVT, dl, CallInfo.second, SinPtr, MachinePointerInfo()));
2340 DAG.getLoad(RetVT, dl, CallInfo.second, CosPtr, MachinePointerInfo()));
3773 Results.push_back(CallResult.second);
3798 Results.push_back(Tmp.second);
3813 Results.push_back(CallResult.second);
4616 if (LegalizedNodes.insert(N).second) {
lib/CodeGen/SelectionDAG/LegalizeIntegerTypes.cpp 1731 ReplaceValueWith(SDValue(N, 1), Tmp.second);
3466 DAG.getLoad(PtrVT, dl, CallInfo.second, Temp, MachinePointerInfo());
lib/CodeGen/SelectionDAG/LegalizeTypes.cpp 103 NewValId = I->second;
561 assert(Id != I->second && "Id is mapped to itself.");
564 RemapId(I->second);
565 Id = I->second;
739 Hi = getSDValue(Entry.second);
768 Entry.second = getTableId(Hi);
776 Hi = getSDValue(Entry.second);
792 Entry.second = getTableId(Hi);
799 Hi = getSDValue(Entry.second);
820 Entry.second = getTableId(Hi);
lib/CodeGen/SelectionDAG/LegalizeTypes.h 142 RemapId(I->second);
143 assert(I->second && "All Ids should be nonzero");
144 return I->second;
481 SDValue SoftenedOp = getSDValue(Iter->second);
lib/CodeGen/SelectionDAG/LegalizeVectorOps.cpp 233 if (I != LegalizedNodes.end()) return I->second;
lib/CodeGen/SelectionDAG/ScheduleDAGFast.cpp 372 RemovePred(DelDeps[i].first, DelDeps[i].second);
407 RemovePred(DelDeps[i].first, DelDeps[i].second);
454 if (RegAdded.insert(*AI).second) {
694 if (DI != GluedMap.end() && DI->second != N)
696 OpN = DI->second;
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 1211 RemovePred(DelDep.first, DelDep.second);
1255 RemovePred(DelDep.first, DelDep.second);
1311 if (RegAdded.insert(*AliasI).second) {
1328 if (RegAdded.insert(i).second)
1403 RegAdded.insert(CallResource).second)
1440 SmallVectorImpl<unsigned> &LRegs = LRegsPos->second;
1476 if (LRegsPair.second) {
1483 LRegsPair.first->second = LRegs;
lib/CodeGen/SelectionDAG/ScheduleDAGSDNodes.cpp 238 if (User == Node || !Visited.insert(User).second)
248 if (O2SMap.insert(std::make_pair(Offset1, Base)).second)
351 if (Visited.insert(Op.getNode()).second)
807 .addReg(VRI->second);
812 bool isNew = VRBaseMap.insert(std::make_pair(SU, VRBase)).second;
952 MachineInstr *MI = Orders[i].second;
998 MachineInstr *MI = InstrOrder.second;
lib/CodeGen/SelectionDAG/SelectionDAG.cpp 766 for (auto &Val: I->second)
4744 if (!Folded.second)
6231 return CallResult.second;
6272 return CallResult.second;
6335 return CallResult.second;
6376 return CallResult.second;
6437 return CallResult.second;
6477 return CallResult.second;
9608 if (!Visited.insert(N).second) {
lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp 1145 DanglingDebugInfoVector &DDIV = DDIMI.second;
1165 DanglingDebugInfoVector &DDIV = DanglingDbgInfoIt->second;
1286 DAG.getFrameIndexDbgValue(Var, Expr, SI->second,
1320 unsigned Reg = VMI->second;
1333 unsigned RegisterSize = RegAndSize.second;
1363 for (auto &DDI : Pair.second)
1375 unsigned InReg = It->second;
1561 return DAG.getFrameIndex(SI->second,
1750 addSuccessorWithProb(FuncInfo.MBB, UnwindDest.first, UnwindDest.second);
1939 CopyValueToVirtualRegister(V, VMI->second);
2551 DAG.setRoot(Result.second);
2606 None, CallOptions, getCurSDLoc()).second;
2816 addSuccessorWithProb(InvokeMBB, UnwindDest.first, UnwindDest.second);
2927 bool Inserted = Done.insert(BB).second;
3034 if (!Visited.insert(User).second)
5538 Expr, Offset, RegAndSize.second);
5545 Offset += RegAndSize.second;
5554 RegsForValue RFV(V->getContext(), TLI, DAG.getDataLayout(), VMI->second,
5561 Op = MachineOperand::CreateReg(VMI->second, false);
5831 FI = I->second;
6510 DAG.setRoot(Result.second);
6593 const int FrameIndex = SI->second;
7056 assert((CLI.IsTailCall || Result.second.getNode()) &&
7058 assert((Result.second.getNode() || !Result.first.getNode()) &&
7061 if (!Result.second.getNode()) {
7070 DAG.setRoot(Result.second);
7193 SDValue CopyNode = CLI.DAG.getCopyToReg(Result.second, CLI.DL, VReg, Src);
7277 PendingLoads.push_back(Res.second);
7364 PendingLoads.push_back(Res.second);
7427 DAG.setRoot(Res.second);
7450 PendingLoads.push_back(Res.second);
7471 PendingLoads.push_back(Res.second);
7493 PendingLoads.push_back(Res.second);
7823 (MatchRC.second != InputRC.second)) {
7823 (MatchRC.second != InputRC.second)) {
8793 SDNode *CallEnd = Result.second.getNode();
9438 return &Iter.first->second;
9529 const AllocaInst *AI = ArgCopyIter->second.first;
9567 const StoreInst *SI = ArgCopyIter->second.second;
9567 const StoreInst *SI = ArgCopyIter->second.second;
9912 VI.Slot = I->second;
9941 if (!SuccsHandled.insert(SuccMBB).second)
9972 Reg = I->second;
10162 SwitchCG::JumpTable *JT = &SL->JTCases[I->JTCasesIndex].second;
lib/CodeGen/SelectionDAG/SelectionDAGDumper.cpp 873 if (!once.insert(N).second) // If we've been here before, return now.
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 518 unsigned To = I->second;
525 To = J->second;
566 if (LI.second)
593 MachineInstr *Def = RegInfo->getVRegDef(LDI->second);
606 IsIndirect, LDI->second, Variable, Expr);
613 UI = RegInfo->use_instr_begin(LDI->second),
665 unsigned To = I->second;
671 To = J->second;
749 if (!VisitedNodes.insert(N).second)
1320 FI = SI->second;
1702 << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n");
1712 PHI.addReg(FuncInfo->PHINodesToUpdate[i].second).addMBB(FuncInfo->MBB);
1840 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second).addMBB(BTB.Parent);
1842 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second)
1851 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second).addMBB(cBB);
1867 SDB->visitJumpTableHeader(SDB->SL->JTCases[i].second,
1875 FuncInfo->MBB = SDB->SL->JTCases[i].second.MBB;
1878 SDB->visitJumpTable(SDB->SL->JTCases[i].second);
1891 if (PHIBB == SDB->SL->JTCases[i].second.Default)
1892 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second)
1896 PHI.addReg(FuncInfo->PHINodesToUpdate[pi].second).addMBB(FuncInfo->MBB);
1943 PHI.addReg(FuncInfo->PHINodesToUpdate[pn].second).addMBB(ThisBB);
2120 if (!Visited.insert(N).second)
2132 if (!Visited.insert(N).second)
2360 if (!Visited.insert(V.getNode()).second)
3047 if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo].second,
3247 RecordedNodes.push_back(std::make_pair(Imm, RecordedNodes[RecNo].second));
lib/CodeGen/SelectionDAG/SelectionDAGPrinter.cpp 199 return I->second;
lib/CodeGen/SelectionDAG/StatepointLowering.cpp 160 return It->second;
297 SSM.DuplicateMap[Ptrs[i]] = SeenIt->second;
1010 Optional<int> DerivedPtrLocation = SlotIt->second;
lib/CodeGen/SelectionDAG/StatepointLowering.h 56 return I->second;
lib/CodeGen/SelectionDAG/TargetLowering.cpp 4147 if (!R.second)
4351 (MatchRC.second != InputRC.second)) {
4351 (MatchRC.second != InputRC.second)) {
lib/CodeGen/ShadowStackGCLowering.cpp 160 EltTys.push_back(Roots[I].second->getAllocatedType());
328 AllocaInst *OriginalAlloca = Roots[I].second;
367 Roots[I].second->eraseFromParent();
lib/CodeGen/SjLjEHPrepare.cpp 123 if (!LiveBBs.insert(BB).second)
lib/CodeGen/SlotIndexes.cpp 90 MBBRanges[MBB.getNumber()].second = SlotIndex(&indexList.back(),
111 SlotIndex MIIndex = mi2iItr->second;
124 SlotIndex MIIndex = mi2iItr->second;
252 << MBBRanges[i].second << ")\n";
lib/CodeGen/SpillPlacement.cpp 128 if (I->second == b) {
160 if (nodes[I->second].Value == -1)
162 else if (nodes[I->second].Value == 1)
187 unsigned n = Elt.second;
lib/CodeGen/SplitKit.cpp 100 LIP.second = LIP.first;
105 LIP.second = LIS.getInstructionIndex(*I);
113 if (!LIP.second)
130 if (!SlotIndex::isEarlierInstr(VNI->def, LIP.second) && VNI->def < MBBEnd)
135 return LIP.second;
476 if (!Force && InsP.second)
480 if (VNInfo *OldVNI = InsP.first->second.getPointer()) {
485 InsP.first->second = ValueForcePair(nullptr, Force);
1054 if (!Dom.second.isValid() || VNI->def < Dom.second)
1054 if (!Dom.second.isValid() || VNI->def < Dom.second)
1055 Dom.second = VNI->def;
1072 << printMBBReference(*Dom.first) << ' ' << Dom.second
1079 if (!Dom.first || Dom.second.isValid())
1092 Dom.second =
1105 if (!Dom.first || Dom.second == VNI->def ||
1464 if (Visited.insert(PredVNI).second)
lib/CodeGen/SplitKit.h 71 !LastInsertPoint[Num].second.isValid())
lib/CodeGen/StackColoring.cpp 542 const BlockLifetimeInfo &BlockInfo = BI->second;
648 BetweenStartEnd |= I->second;
771 BlockLifetimeInfo &BlockInfo = BI->second;
782 LocalLiveIn |= I->second.LiveOut;
911 const AllocaInst *To = MFI->getObjectAllocation(SI.second);
937 MachineFrameInfo::SSPLayoutKind ToKind = MFI->getObjectSSPLayout(SI.second);
942 MFI->setObjectSSPLayout(SI.second, FromKind);
lib/CodeGen/StackMaps.cpp 358 CurrentIt->second.RecordCount++;
443 << " frame size: " << FR.second.StackSize
444 << " callsite count: " << FR.second.RecordCount << '\n');
446 OS.EmitIntValue(FR.second.StackSize, 8);
447 OS.EmitIntValue(FR.second.RecordCount, 8);
458 LLVM_DEBUG(dbgs() << WSMP << ConstEntry.second << '\n');
459 OS.EmitIntValue(ConstEntry.second, 8);
lib/CodeGen/StackProtector.cpp 198 if (VisitedPHIs.insert(PN).second)
564 MFI.setObjectSSPLayout(I, LI->second);
lib/CodeGen/StackSlotColoring.cpp 222 LiveInterval &li = I->second;
lib/CodeGen/SwiftErrorValueTracking.cpp 42 return It->second;
55 return It->second;
70 return It->second;
165 Register UUseVReg = UpwardsUse ? UUseIt->second : Register();
184 if (!Visited.insert(Pred).second)
197 UUseVReg = UUseIt->second;
208 -> bool { return V.second != VRegs[0].second; }) !=
208 -> bool { return V.second != VRegs[0].second; }) !=
217 setCurrentVReg(MBB, SwiftErrorVal, VRegs[0].second);
234 .addReg(VRegs[0].second);
248 PHI.addReg(BBRegPair.second).addMBB(BBRegPair.first);
lib/CodeGen/TailDuplicator.cpp 202 for (unsigned j = 0, ee = LI->second.size(); j != ee; ++j) {
203 MachineBasicBlock *SrcBB = LI->second[j].first;
204 unsigned SrcReg = LI->second[j].second;
204 unsigned SrcReg = LI->second[j].second;
327 LI->second.push_back(std::make_pair(BB, NewReg));
404 auto *MappedRC = MRI->getRegClass(VI->second.Reg);
406 if (VI->second.SubReg != 0) {
408 VI->second.SubReg);
413 MRI->setRegClass(VI->second.Reg, ConstrRC);
418 ConstrRC = MRI->constrainRegClass(VI->second.Reg, OrigRC);
424 MO.setReg(VI->second.Reg);
428 VI->second.SubReg));
439 .addReg(VI->second.Reg, 0, VI->second.SubReg);
439 .addReg(VI->second.Reg, 0, VI->second.SubReg);
502 for (unsigned j = 0, ee = LI->second.size(); j != ee; ++j) {
503 MachineBasicBlock *SrcBB = LI->second[j].first;
511 unsigned SrcReg = LI->second[j].second;
511 unsigned SrcReg = LI->second[j].second;
985 .addReg(CI.second.Reg, 0, CI.second.SubReg);
985 .addReg(CI.second.Reg, 0, CI.second.SubReg);
lib/CodeGen/TargetLoweringBase.cpp 1669 if (MTy == LK.second)
1673 MTy = LK.second;
lib/CodeGen/TargetPassConfig.cpp 503 return I->second;
lib/CodeGen/TargetRegisterInfo.cpp 396 for (auto Reg : Hints_MRI.second) {
409 if (!HintedRegs.insert(Phys).second)
lib/CodeGen/TwoAddressInstructionPass.cpp 395 if (MO.isUse() && DI->second < LastUse)
396 LastUse = DI->second;
397 if (MO.isDef() && DI->second > LastDef)
398 LastDef = DI->second;
552 Reg = SI->second;
781 if (IsCopy && !Processed.insert(UseMI).second)
793 bool isNew = SrcRegMap.insert(std::make_pair(NewReg, Reg)).second;
806 bool isNew = DstRegMap.insert(std::make_pair(FromReg, ToReg)).second;
811 bool isNew = DstRegMap.insert(std::make_pair(DstReg, ToReg)).second;
841 bool isNew = SrcRegMap.insert(std::make_pair(DstReg, SrcReg)).second;
1034 unsigned DefDist = DDI->second;
1099 if (isDefTooClose(MOReg, DI->second, MI))
1507 const MachineOperand &DstMO = MI->getOperand(TiedPairs[tpi].second);
1519 unsigned DstIdx = TiedPairs[tpi].second;
1738 = TiedOperands.begin()->second;
1741 unsigned DstIdx = TiedPairs[0].second;
1757 processTiedPairs(&*mi, TO.second, Dist);
lib/CodeGen/VirtRegMap.cpp 112 if (Register::isPhysicalRegister(Hint.second))
114 if (Register::isVirtualRegister(Hint.second))
115 return hasPhys(Hint.second);
295 LiveInterval::const_iterator &SRI = RangeIterPair.second;
305 MachineBasicBlock *MBB = MBBI->second;
335 MachineBasicBlock *MBB = I->second;
lib/CodeGen/WinEHPrepare.cpp 203 BaseState = BaseStateI->second;
728 std::vector<BasicBlock *> &BlocksInFunclet = Funclets.second;
771 BasicBlock *NewBlock = BBMapping.second;
810 BasicBlock *NewBlock = BBMapping.second;
853 BasicBlock *NewBlock = BBMapping.second;
866 BasicBlock *NewBlock = BBMapping.second;
899 auto *NewI = cast<Instruction>(VT.second);
935 std::vector<BasicBlock *> &BlocksInFunclet = Funclet.second;
lib/DebugInfo/CodeView/DebugChecksumsSubsection.cpp 114 return Iter->second;
lib/DebugInfo/CodeView/DebugCrossExSubsection.cpp 48 if (auto EC = Writer.writeInteger(M.second))
lib/DebugInfo/CodeView/DebugCrossImpSubsection.cpp 59 if (!Result.second)
lib/DebugInfo/CodeView/DebugStringTableSubsection.cpp 52 if (P.second) {
106 return Iter->second;
lib/DebugInfo/CodeView/MergingTypeTableBuilder.cpp 98 if (Result.second) {
105 TypeIndex ActualTI = Result.first->second;
lib/DebugInfo/DWARF/DWARFAcceleratorTable.cpp 97 DWARFFormValue FormValue(Atom.second);
121 DWARFFormValue FormValue(Atom.second);
220 W.startLine() << "Form: " << formatv("{0}", Atom.second) << '\n';
221 AtomForms.push_back(DWARFFormValue(Atom.second));
264 Values.push_back(DWARFFormValue(Atom.second));
516 if (!Abbrevs.insert(std::move(*AbbrevOr)).second)
lib/DebugInfo/DWARF/DWARFContext.cpp 1302 return CacheIt->second;
1337 CacheIt->second = Ret;
1675 if (!I.second) {
1709 return AI->second;
1751 F(P.second);
1756 F(P.second);
1805 F(P.second);
1810 F(P.second);
lib/DebugInfo/DWARF/DWARFDebugAbbrev.cpp 109 I.second.dump(OS);
117 return &(PrevAbbrOffsetPos->second);
123 return &(Pos->second);
134 return &PrevAbbrOffsetPos->second;
lib/DebugInfo/DWARF/DWARFDebugAranges.cpp 55 if (ParsedCUOffsets.insert(CUOffset).second) {
lib/DebugInfo/DWARF/DWARFDebugLine.cpp 507 return &Pos->second;
521 LineTable *LT = &Pos.first->second;
522 if (Pos.second) {
1162 U = It->second;
lib/DebugInfo/DWARF/DWARFDie.cpp 411 if (Seen.insert(D).second)
415 if (Seen.insert(D).second)
lib/DebugInfo/DWARF/DWARFGdbIndex.cpp 92 for (uint32_t Val : V.second)
188 Vec.second.push_back(Data.getU32(&Offset));
lib/DebugInfo/DWARF/DWARFUnit.cpp 611 if (B != AddrDieMap.begin() && R.LowPC < (--B)->second.first) {
614 if (R.HighPC < B->second.first)
615 AddrDieMap[R.HighPC] = B->second;
642 if (Address >= R->second.first)
644 return R->second.second;
644 return R->second.second;
lib/DebugInfo/DWARF/DWARFVerifier.cpp 248 if (!Result.second) {
650 for (auto Offset : Pair.second)
688 << format("0x%08" PRIx64, Iter->second.getOffset()) << " and "
691 dump(Iter->second);
944 if (Iter->second != NotIndexed) {
947 NI.getUnitOffset(), Offset, Iter->second);
950 Iter->second = NI.getUnitOffset();
955 if (KV.second == NotIndexed)
1151 if (!Attributes.insert(AttrEnc.Index).second) {
lib/DebugInfo/GSYM/GsymCreator.cpp 38 if (R.second)
40 return R.first->second;
lib/DebugInfo/MSF/MSFBuilder.cpp 206 auto &CurrentBlocks = StreamData[Idx].second;
213 auto CurrentBlocks = ArrayRef<uint32_t>(StreamData[Idx].second);
217 StreamData[Idx].second = CurrentBlocks.drop_back(RemovedBlocks);
231 return StreamData[StreamIdx].second;
243 assert(ExpectedNumBlocks == D.second.size() &&
300 Allocator.Allocate<ulittle32_t>(StreamData[I].second.size());
301 std::uninitialized_copy_n(StreamData[I].second.begin(),
302 StreamData[I].second.size(), BlockList);
304 ArrayRef<ulittle32_t>(BlockList, StreamData[I].second.size());
lib/DebugInfo/MSF/MappedBlockStream.cpp 42 std::min(I1.second, I2.second));
42 std::min(I1.second, I2.second));
100 for (auto &Entry : CacheIter->second) {
124 if (CacheItem.second.empty())
127 auto CachedAlloc = CacheItem.second.back();
132 if (RequestExtent.first >= CachedExtent.first + CachedExtent.second)
156 CacheIter->second.emplace_back(WriteBuffer, Size);
285 for (const auto &Alloc : MapEntry.second) {
298 assert(Intersection.first <= Intersection.second);
300 uint32_t Length = Intersection.second - Intersection.first;
lib/DebugInfo/PDB/Native/GSIStreamBuilder.cpp 71 if (!Iter.second)
181 HashRecords.push_back(Entry.second);
235 if (LS.second->Segment != RS.second->Segment)
235 if (LS.second->Segment != RS.second->Segment)
236 return LS.second->Segment < RS.second->Segment;
236 return LS.second->Segment < RS.second->Segment;
237 if (LS.second->Offset != RS.second->Offset)
237 if (LS.second->Offset != RS.second->Offset)
238 return LS.second->Offset < RS.second->Offset;
238 return LS.second->Offset < RS.second->Offset;
240 return LS.second->Name < RS.second->Name;
240 return LS.second->Name < RS.second->Name;
lib/DebugInfo/PDB/Native/InjectedSourceStream.cpp 43 if (Entry.second.Size != sizeof(SrcHeaderBlockEntry))
46 if (Entry.second.Version !=
52 auto Name = Strings.getStringForID(Entry.second.FileNI);
55 auto ObjName = Strings.getStringForID(Entry.second.ObjNI);
58 auto VName = Strings.getStringForID(Entry.second.VFileNI);
lib/DebugInfo/PDB/Native/NamedStreamMap.cpp 104 StreamNo = (*Iter).second;
112 Result.try_emplace(Stream, Entry.second);
lib/DebugInfo/PDB/Native/NativeEnumInjectedSources.cpp 108 return std::make_unique<NativeInjectedSource>(std::next(Stream.begin(), N)->second,
115 return std::make_unique<NativeInjectedSource>((Cur++)->second, File, Strings);
lib/DebugInfo/PDB/Native/PDBFileBuilder.cpp 287 if (NSE.second.empty())
293 if (auto EC = NSW.writeBytes(arrayRefFromStringRef(NSE.second)))
lib/DebugInfo/PDB/Native/PDBStringTableBuilder.cpp 129 return Entry->second;
lib/DebugInfo/PDB/Native/SymbolCache.cpp 146 return Entry->second;
261 return Iter->second;
lib/DebugInfo/PDB/PDBExtras.cpp 390 OS << Tag.first << ":" << Tag.second << " ";
lib/DebugInfo/PDB/PDBSymbol.cpp 134 outs() << Stat.first << ": " << Stat.second << "\n";
lib/DebugInfo/Symbolize/SymbolizableObjectFile.cpp 75 res->addSymbol(P.first, P.second, OpdExtractor.get(), OpdAddress);
236 Name = SymbolIterator->second.str();
lib/DebugInfo/Symbolize/Symbolize.cpp 67 return symbolizeCodeCommon(I->second.get(), ModuleOffset);
343 return I->second;
372 if (!Pair.second) {
373 Bin = Pair.first->second.getBinary();
378 Pair.first->second = std::move(BinOrErr.get());
379 Bin = Pair.first->second.getBinary();
388 return I->second.get();
419 assert(InsertResult.second);
422 return InsertResult.first->second.get();
429 return I->second.get();
471 DWARFContext::create(*Objects.second, nullptr,
lib/ExecutionEngine/ExecutionEngine.cpp 319 StringRef Name = I->second;
lib/ExecutionEngine/GDBRegistrationListener.cpp 193 jit_code_entry*& JITCodeEntry = I->second.Entry;
lib/ExecutionEngine/Interpreter/ExternalFunctions.cpp 267 : FI->second) {
lib/ExecutionEngine/JITLink/BasicGOTAndStubsBuilder.h 52 return *GOTEntryI->second;
66 return *StubI->second;
lib/ExecutionEngine/JITLink/EHFrameSupport.cpp 292 auto &CIEInfo = CIEInfoItr->second;
lib/ExecutionEngine/JITLink/JITLinkGeneric.cpp 159 auto &SegLists = KV.second;
169 auto &SL = KV.second;
173 dbgs() << " " << SIEntry.second << ":\n";
190 auto &SegLists = KV.second;
241 auto &SL = KV.second;
lib/ExecutionEngine/JITLink/JITLinkGeneric.h 153 auto &SegLayout = KV.second;
lib/ExecutionEngine/JITLink/JITLinkMemoryManager.cpp 43 void *SlabStart = SegBlocks.begin()->second.base();
46 SlabStart = std::min(SlabStart, KV.second.base());
47 SlabEnd = std::max(SlabEnd, (char *)(KV.second.base()) +
48 KV.second.allocatedSize());
63 auto &Block = KV.second;
88 const auto &Seg = KV.second;
111 const auto &Seg = KV.second;
lib/ExecutionEngine/JITLink/MachOLinkGraphBuilder.cpp 172 Sections.push_back(&KV.second);
307 auto &NSym = *KV.second;
361 auto &NSec = KV.second;
523 auto &NSec = KV.second;
lib/ExecutionEngine/JITLink/MachOLinkGraphBuilder.h 171 return I->second;
182 return I->second;
204 return std::prev(I)->second;
lib/ExecutionEngine/Orc/CompileOnDemandLayer.cpp 180 NewSearchOrder.front().second == true &&
190 return I->second;
lib/ExecutionEngine/Orc/Core.cpp 121 return flagsMatchCLOpts(KV.second);
127 return flagsMatchCLOpts(KV.second.getFlags());
177 return OS << "(\"" << KV.first << "\", " << KV.second << ")";
181 return OS << "(\"" << KV.first << "\": " << KV.second << ")";
194 return OS << "(" << KV.first << ", " << KV.second << ")";
213 << (JDs.front().second ? "true" : "false") << ")";
217 << (KV.second ? "true" : "false") << ")";
227 OS << " " << *KV.first << ": " << KV.second.Aliasee << " "
228 << KV.second.AliasFlags;
310 assert(I->second.getAddress() == 0 && "Redundantly resolving symbol Name");
311 I->second = std::move(Sym);
336 bool Added = QueryRegistrations[&JD].insert(std::move(Name)).second;
346 assert(QRI->second.count(Name) && "No dependency on Name in JD");
347 QRI->second.erase(Name);
348 if (QRI->second.empty())
356 KV.first->detachQueryHelper(*this, KV.second);
385 assert((KV.second.getFlags() & ~WeakFlags) == (I->second & ~WeakFlags) &&
385 assert((KV.second.getFlags() & ~WeakFlags) == (I->second & ~WeakFlags) &&
462 DelegatedFlags[Name] = std::move(I->second);
509 Flags[KV.first] = KV.second.getFlags();
540 RequestedAliases[Name] = std::move(I->second);
585 if (&SrcJD == &TgtJD && (QueryAliases.count(KV.second.Aliasee) ||
586 RequestedAliases.count(KV.second.Aliasee)))
590 QuerySymbols.insert(KV.second.Aliasee);
591 QueryAliases[KV.first] = std::move(KV.second);
609 auto QueryInfo = std::move(QueryInfos.back().second);
623 auto &SrcJDDeps = Deps.find(&SrcJD)->second;
628 if (SrcJDDeps.count(KV.second.Aliasee)) {
629 PerAliasDeps = {KV.second.Aliasee};
639 assert(Result->count(KV.second.Aliasee) &&
642 (*Result)[KV.second.Aliasee].getAddress(), KV.second.AliasFlags);
642 (*Result)[KV.second.Aliasee].getAddress(), KV.second.AliasFlags);
677 SymbolFlags[KV.first] = KV.second.AliasFlags;
724 AliasMap[KV.first] = SymbolAliasMapEntry(KV.first, KV.second);
756 Symbols.insert(std::make_pair(KV.first, SymbolTableEntry(KV.second)));
760 EntryItr->second.setState(SymbolState::Materializing);
785 assert(SymI->second.isInMaterializationPhase() &&
787 assert(!SymI->second.hasMaterializerAttached() &&
799 if (MII->second.hasQueriesPending())
808 assert(SymI->second.getState() == SymbolState::Materializing &&
810 assert(!SymI->second.hasMaterializerAttached() &&
814 SymI->second.setAddress(SymI->second.getAddress());
814 SymI->second.setAddress(SymI->second.getAddress());
815 SymI->second.setMaterializerAttached(true);
833 assert(Symbols.find(KV.first)->second.isInMaterializationPhase() &&
840 if (I->second.hasQueriesPending())
871 for (auto &OtherSymbol : KV.second) {
880 (OtherSymI->second.getState() != SymbolState::Ready &&
884 auto &OtherSymEntry = OtherSymI->second;
933 assert(!KV.second.getFlags().hasError() &&
939 assert(!SymI->second.hasMaterializerAttached() &&
941 assert(SymI->second.getState() == SymbolState::Materializing &&
943 assert(SymI->second.getAddress() == 0 &&
946 if (SymI->second.getFlags().hasError())
949 auto Flags = KV.second.getFlags();
951 assert(Flags == (SymI->second.getFlags() &
956 {SymI, JITEvaluatedSymbol(KV.second.getAddress(), Flags)});
973 SymI->second.setAddress(ResolvedSym.getAddress());
974 SymI->second.setFlags(ResolvedFlags);
975 SymI->second.setState(SymbolState::Resolved);
1020 if (SymI->second.getFlags().hasError())
1036 auto &SymEntry = SymI->second;
1046 auto &MI = MII->second;
1053 for (auto &DependantName : KV.second) {
1059 auto &DependantMI = DependantMII->second;
1079 auto &DependantSymEntry = DependantSymI->second;
1095 DependantName, DependantSymI->second.getSymbol());
1108 SymI->second.setState(SymbolState::Ready);
1110 Q->notifySymbolMetRequiredState(Name, SymI->second.getSymbol());
1153 auto Name = std::move(Worklist.back().second);
1174 auto &MI = MII->second;
1179 for (auto &DependantName : KV.second) {
1193 assert(UnemittedDepI->second.count(Name) &&
1195 UnemittedDepI->second.erase(Name);
1196 if (UnemittedDepI->second.empty())
1214 for (auto &UnemittedDepName : KV.second) {
1219 assert(UnemittedDepMII->second.Dependants.count(&JD) &&
1221 assert(UnemittedDepMII->second.Dependants[&JD].count(Name) &&
1223 UnemittedDepMII->second.Dependants[&JD].erase(Name);
1224 if (UnemittedDepMII->second.Dependants[&JD].empty())
1225 UnemittedDepMII->second.Dependants.erase(&JD);
1231 for (auto &Q : MII->second.pendingQueries()) {
1312 if (I->second.isInMaterializationPhase()) {
1317 auto UMII = I->second.hasMaterializerAttached()
1333 auto UMII = SymbolMaterializerItrPair.second;
1337 UMII->second->MU->doDiscard(*this, UMII->first);
1392 Flags[Name] = I->second.getFlags();
1455 if (!SymI->second.getFlags().isExported() && !MatchNonExported)
1464 if (SymI->second.getFlags().hasError()) {
1472 if (SymI->second.getState() >= Q->getRequiredState()) {
1473 Q->notifySymbolMetRequiredState(Name, SymI->second.getSymbol());
1479 if (SymI->second.hasMaterializerAttached()) {
1480 assert(SymI->second.getAddress() == 0 &&
1485 auto MU = std::move(UMII->second->MU);
1492 SymK->second.setMaterializerAttached(false);
1493 SymK->second.setState(SymbolState::Materializing);
1502 assert(SymI->second.isInMaterializationPhase() &&
1595 if (SymI->second.getState() >= Q->getRequiredState()) {
1596 Q->notifySymbolMetRequiredState(Name, SymI->second.getSymbol());
1603 if (SymI->second.hasMaterializerAttached()) {
1604 assert(SymI->second.getAddress() == 0 &&
1609 auto MU = std::move(UMII->second->MU);
1617 SymK->second.setState(SymbolState::Materializing);
1618 SymK->second.setMaterializerAttached(false);
1627 assert(SymI->second.isInMaterializationPhase() &&
1648 << (KV.second ? "all" : "exported only") << ")";
1654 if (auto Addr = KV.second.getAddress())
1655 OS << format("0x%016" PRIx64, Addr) << ", " << KV.second.getFlags()
1660 OS << KV.second.getState();
1662 if (KV.second.hasMaterializerAttached()) {
1667 OS << I->second->MU.get() << ")\n";
1676 << " " << KV.second.pendingQueries().size()
1678 for (const auto &Q : KV.second.pendingQueries())
1681 for (auto &KV2 : KV.second.Dependants)
1682 OS << " " << KV2.first->getName() << ": " << KV2.second << "\n";
1684 for (auto &KV2 : KV.second.UnemittedDependencies)
1685 OS << " " << KV2.first->getName() << ": " << KV2.second << "\n";
1742 if (KV.second.isStrong()) {
1743 if (I->second.getFlags().isStrong() ||
1744 I->second.getState() > SymbolState::NeverSearched)
1747 assert(I->second.getState() == SymbolState::NeverSearched &&
1771 UMII->second->MU->doDiscard(*this, S);
1777 SymEntry.setFlags(KV.second);
1802 for (auto &DependencyName : KV.second) {
1965 auto MatchNonExported = KV.second;
1985 for (auto &MU : KV.second)
2018 for (auto &MU : KV.second)
2088 return std::move(ResultMap->begin()->second);
2131 assert(JITDylibAndMU.second && "JITDylib, but no MU?");
2133 std::move(JITDylibAndMU.second));
lib/ExecutionEngine/Orc/ExecutionUtils.cpp 124 for (auto &Name : KV.second) {
125 auto Added = Names.insert(Name).second;
135 for (auto &Name : KV.second) {
151 P.first(P.second);
277 ChildBufferInfo.second);
lib/ExecutionEngine/Orc/IndirectionUtils.cpp 101 Name = I->second;
lib/ExecutionEngine/Orc/Layer.cpp 68 assert(!I->second->isDeclaration() &&
70 I->second->setLinkage(GlobalValue::AvailableExternallyLinkage);
lib/ExecutionEngine/Orc/LazyReexports.cpp 50 SourceJD = I->second.first;
51 SymbolName = I->second.second;
51 SymbolName = I->second.second;
68 NotifyResolved = I->second;
148 RequestedAliases[I->first] = std::move(I->second);
160 SourceJD, Alias.second.Aliasee, NotifyResolved);
170 std::make_pair(*CallThroughTrampoline, Alias.second.AliasFlags);
202 assert(KV.second.AliasFlags.isCallable() &&
204 SymbolFlags[KV.first] = KV.second.AliasFlags;
lib/ExecutionEngine/Orc/Legacy.cpp 35 Result[*KV.first] = std::move(KV.second);
lib/ExecutionEngine/Orc/ObjectLinkingLayer.cpp 72 LR[*KV.first] = KV.second;
220 for (auto &S : I->second)
280 for (const auto &S : I->second)
281 Changed |= SymNamedDeps.insert(S).second;
292 auto &NameDeps = NamedDepsEntry.second;
297 const SymbolNameSet &Symbols = QueryDepsEntry.second;
376 Alloc = std::move(AllocItr->second);
398 Allocs.push_back(std::move(KV.second));
435 auto EHFrameRange = EHFrameRangeItr->second;
453 auto EHFrameRange = EHFrameRangeItr->second;
468 EHFrameRanges.push_back(KV.second);
lib/ExecutionEngine/Orc/OrcCBindingsStack.h 220 auto Resolver = std::move(ResolverI->second);
477 return ResolverI->second;
lib/ExecutionEngine/Orc/OrcMCJITReplacement.cpp 131 AcknowledgeORCv1Deprecation, std::move(KV.second), KV.first)
lib/ExecutionEngine/Orc/OrcMCJITReplacement.h 341 if (P.second.count(LocalAddress))
lib/ExecutionEngine/Orc/RTDyldObjectLinkingLayer.cpp 40 Result[*KV.first] = std::move(KV.second);
164 auto Flags = KV.second.getFlags();
172 Flags = I->second;
177 Symbols[InternedName] = JITEvaluatedSymbol(KV.second.getAddress(), Flags);
lib/ExecutionEngine/Orc/SpeculateAnalyses.cpp 112 return BBF.second > BBS.second ? true : false;
112 return BBF.second > BBS.second ? true : false;
156 if (!Itr->second.Upward)
158 Itr->second.Upward = false;
181 if (I.second == AtBB)
199 if (!Itr->second.Downward)
201 Itr->second.Downward = false;
223 SuccSkipNodes.insert(I.second);
254 return Bbf.second > Bbs.second;
254 return Bbf.second > Bbs.second;
277 if (I.second.CallerBlock)
lib/ExecutionEngine/Orc/Speculation.cpp 32 auto It = Maps.insert({I.first, {I.second.Aliasee, SrcJD}});
34 assert(It.second && "ImplSymbols are already tracked for this Symbol?");
lib/ExecutionEngine/RuntimeDyld/RuntimeDyld.cpp 153 resolveRelocationList(it->second, Addr);
390 uint64_t StubAddr = KV.second;
898 SectionID = i->second;
1209 Resolved[KV.first] = KV.second;
1247 return RTDyld.Sections[I->second].getLoadAddress();
lib/ExecutionEngine/RuntimeDyld/RuntimeDyldELF.cpp 1067 (uint64_t)Section.getAddressWithOffset(i->second),
1234 reinterpret_cast<uint64_t>(Section.getAddressWithOffset(i->second)),
1287 RelocationEntry RE(SectionID, Offset, RelType, i->second);
1327 RelocationEntry &Reloc = I->second;
1382 RelocationEntry RE(SectionID, Offset, RelType, i->second);
1493 Section.getAddressWithOffset(i->second)),
1622 StubAddress = uintptr_t(Section.getAddressWithOffset(i->second));
1676 StubAddress = uintptr_t(Section.getAddress()) + i->second;
1820 if (E.second) {
1831 E.first->second = GOTOffset;
1834 return E.first->second;
1887 SectionToGOTMap[i->second] = GOTSectionID;
1907 UnregisteredEHFrameSections.push_back(i->second);
lib/ExecutionEngine/RuntimeDyld/RuntimeDyldMachO.cpp 264 if (auto Err = impl().finalizeSection(Obj, I->second, Section))
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldCOFFX86_64.h 168 StubOffset = Stub->second;
295 UnregisteredEHFrameSections.push_back(SectionPair.second);
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldMachOAArch64.h 451 Offset = static_cast<int64_t>(i->second);
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldMachOARM.h 314 Addr = Section.getAddressWithOffset(i->second);
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldMachOX86_64.h 138 Addr = Section.getAddressWithOffset(i->second);
lib/FuzzMutate/FuzzerCLI.cpp 42 if (NameAndArgs.second.empty())
46 NameAndArgs.second.split(Opts, '-');
79 if (NameAndArgs.second.empty())
83 NameAndArgs.second.split(Opts, '-');
lib/IR/AsmWriter.cpp 233 [](const Entry &L, const Entry &R) { return L.second < R.second; }))
233 [](const Entry &L, const Entry &R) { return L.second < R.second; }))
241 Stack.back().Shuffle[I] = List[I].second;
248 if (IDPair.second)
253 IDPair.second = true;
515 assert(P.second < NumberedTypes.size() && "Didn't get a dense numbering?");
516 assert(!NumberedTypes[P.second] && "Didn't get a unique numbering?");
517 NumberedTypes[P.second] = P.first;
603 OS << '%' << I->second;
1030 CreateModulePathSlot(ModPair.second);
1043 CreateTypeIdSlot(TidIter->second.first);
1055 CreateMetadataSlot(MD.second);
1080 CreateMetadataSlot(MD.second);
1101 return MI == mMap.end() ? -1 : (int)MI->second;
1111 return MI == mdnMap.end() ? -1 : (int)MI->second;
1122 return FI == fMap.end() ? -1 : (int)FI->second;
1131 return AI == asMap.end() ? -1 : (int)AI->second;
1149 return I == GUIDMap.end() ? -1 : (int)I->second;
1200 if (!mdnMap.insert(std::make_pair(N, DestSlot)).second)
2687 ModPath.second.second);
2696 for (auto Hash : ModPair.second)
2705 for (auto &Summary : GlobalList.second.SummaryList)
2719 Out << "^" << Machine.getTypeIdSlot(TidIter->second.first)
2720 << " = typeid: (name: \"" << TidIter->second.first << "\"";
2721 printTypeIdSummary(TidIter->second.second);
2721 printTypeIdSummary(TidIter->second.second);
2730 printTypeIdCompatibleVtableSummary(TId.second);
2807 printWPDRes(WPDRes.second);
2852 Out << getWholeProgDevirtResByArgKindName(ResByArg.second.TheKind);
2853 if (ResByArg.second.TheKind ==
2855 ResByArg.second.TheKind ==
2857 Out << ", info: " << ResByArg.second.Info;
2861 if (ResByArg.second.Byte || ResByArg.second.Bit)
2861 if (ResByArg.second.Byte || ResByArg.second.Bit)
2862 Out << ", byte: " << ResByArg.second.Byte
2863 << ", bit: " << ResByArg.second.Bit;
2970 if (Call.second.getHotness() != CalleeInfo::HotnessType::Unknown)
2971 Out << ", hotness: " << getHotnessName(Call.second.getHotness());
2972 else if (Call.second.RelBlockFreq)
2973 Out << ", relbf: " << Call.second.RelBlockFreq;
2993 if (TidIter.first == TidIter.second) {
2999 for (auto It = TidIter.first; It != TidIter.second; ++It) {
3001 auto Slot = Machine.getTypeIdSlot(It->second.first);
3031 if (TidIter.first == TidIter.second) {
3040 for (auto It = TidIter.first; It != TidIter.second; ++It) {
3043 auto Slot = Machine.getTypeIdSlot(It->second.first);
4093 MDs[0].second->getContext().getMDKindNames(MDNames);
4104 WriteAsOperandInternal(Out, I.second, &TypePrinter, &Machine, TheModule);
4119 Nodes[I->second] = cast<MDNode>(I->first);
4136 asVec[I->second] = *I;
4139 Out << "attributes #" << I.second << " = { "
lib/IR/Attributes.cpp 799 Attr = Attribute::getWithAllocSizeArgs(C, A.first, A.second);
810 Attrs.emplace_back(Attribute::get(C, TDA.first, TDA.second));
985 return Pair.second.hasAttribute(Attribute::None);
997 AttrVec.push_back(I->second);
1022 return !Pair.second.hasAttributes();
1034 AttrVec[attrIdxToArrayIdx(Pair.first)] = Pair.second;
1605 TargetDepAttrs[I.first] = I.second;
lib/IR/AutoUpgrade.cpp 3977 UpgradeToIntrinsic(I.first, I.second);
lib/IR/Constants.cpp 437 if (NonTrappingOps.insert(Op).second && canTrapImpl(Op, NonTrappingOps))
480 if (Visited.insert(ConstOp).second)
lib/IR/ConstantsContext.h 601 return hash_combine(Val.first, Val.second.getHash());
613 return LHS.second == RHS;
617 return isEqual(LHS.second, RHS);
lib/IR/Core.cpp 909 Result[i].Metadata = wrap(ModuleFlag.second);
lib/IR/DIBuilder.cpp 57 RetainedNodes.append(PV->second.begin(), PV->second.end());
57 RetainedNodes.append(PV->second.begin(), PV->second.end());
61 RetainedNodes.append(PL->second.begin(), PL->second.end());
61 RetainedNodes.append(PL->second.begin(), PL->second.end());
84 if (RetainSet.insert(AllRetainTypes[I]).second)
108 CUNode->replaceMacros(MDTuple::get(VMContext, I.second.getArrayRef()));
115 getOrCreateMacroArray(I.second.getArrayRef()));
lib/IR/DataLayout.cpp 201 if (Split.second.empty() && Split.first != Str)
203 if (!Split.second.empty() && Split.first.empty())
236 Desc = Split.second;
243 StringRef &Rest = Split.second; // The rest of the string.
248 Rest = Split.second;
588 StructLayout *Value = I.second;
lib/IR/DebugInfo.cpp 207 if (!NodesSeen.insert(DV).second)
222 if (!NodesSeen.insert(DV).second)
232 if (!NodesSeen.insert(DT).second)
242 if (!NodesSeen.insert(CU).second)
250 if (!NodesSeen.insert(DIG).second)
261 if (!NodesSeen.insert(SP).second)
275 if (!NodesSeen.insert(Scope).second)
414 return Replacement->second;
461 if (OrigLinkage->second == OldLinkageName)
575 if (!Opened.insert(N).second) {
655 if (auto *T = dyn_cast_or_null<MDTuple>(Attachment.second))
lib/IR/Function.cpp 1360 if (matchIntrinsicType(Check.first, Check.second, ArgTys, DeferredChecks,
lib/IR/Globals.cpp 439 if (Aliases.insert(GA).second)
lib/IR/Instruction.cpp 723 setMetadata(MD.first, MD.second);
lib/IR/LLVMContext.cpp 45 unsigned ID = getMDKindID(MDKind.second);
287 It->second = std::move(GCName);
lib/IR/LLVMContextImpl.cpp 69 Pair.second->dropUsers();
71 Pair.second->dropUse();
133 MDVs.push_back(Pair.second);
141 delete Pair.second;
lib/IR/LegacyPassManager.cpp 195 It->second.second = FnSize;
461 FunctionPassManagerImpl *FPP = OnTheFlyManager.second;
508 I->second->dumpPassStructure(Offset + 2);
643 if (LU.second == AP)
659 SmallPtrSet<Pass *, 8> &LU = DMI->second;
670 AnUsage = DMI->second;
899 SmallPtrSet<Pass *, 8> &L = InversedLastUser[LU.second];
978 if (Info->second->getAsImmutablePass() == nullptr &&
982 Pass *S = Info->second;
1001 if (Info->second->getAsImmutablePass() == nullptr &&
1005 Pass *S = Info->second;
1060 if (Pos != AvailableAnalysis.end() && Pos->second == P)
1193 return I->second;
1721 FunctionPassManagerImpl *FPP = OnTheFlyManager.second;
1782 FunctionPassManagerImpl *FPP = OnTheFlyManager.second;
lib/IR/MDBuilder.cpp 221 Ops[i * 2 + 2] = createConstant(ConstantInt::get(Int64, Fields[i].second));
lib/IR/Metadata.cpp 200 .second;
218 auto OwnerAndIndex = I->second;
220 bool WasInserted = UseMap.insert(std::make_pair(New, OwnerAndIndex)).second;
240 return L.second.second < R.second.second;
240 return L.second.second < R.second.second;
240 return L.second.second < R.second.second;
240 return L.second.second < R.second.second;
248 OwnerTy Owner = Pair.second.first;
293 return L.second.second < R.second.second;
293 return L.second.second < R.second.second;
293 return L.second.second < R.second.second;
293 return L.second.second < R.second.second;
297 auto Owner = Pair.second.first;
381 ValueAsMetadata *MD = I->second;
408 ValueAsMetadata *MD = I->second;
457 if (!I.second)
1105 I.second.reset(&MD);
1136 return I.second;
1295 const auto &Info = getContext().pImpl->InstructionMetadata.find(this)->second;
1306 const auto &Info = getContext().pImpl->InstructionMetadata.find(this)->second;
1457 cast<ConstantAsMetadata>(MD.second->getOperand(0))->getValue());
1458 Metadata *TypeId = MD.second->getOperand(1);
1468 auto *Attachment = MD.second;
lib/IR/ModuleSummaryIndex.cpp 70 for (auto &GlobSummary : GlobalList.second.SummaryList) {
159 for (auto &S : P.second.SummaryList) {
185 if (P.second.SummaryList.size())
187 P.second.SummaryList[0]->getBaseObject()))
417 auto &GVSMap = ModIt.second;
428 auto Flags = SummaryIt.second->flags();
430 if (isa<FunctionSummary>(SummaryIt.second)) {
432 } else if (isa<AliasSummary>(SummaryIt.second)) {
437 if (Flags.Live && hasReadOnlyFlag(SummaryIt.second))
439 if (Flags.Live && hasWriteOnlyFlag(SummaryIt.second))
448 A.add("label", getNodeLabel(VI, SummaryIt.second));
460 auto *GVS = SummaryIt.second;
465 if (auto *AS = dyn_cast_or_null<AliasSummary>(SummaryIt.second)) {
470 if (auto *FS = dyn_cast_or_null<FunctionSummary>(SummaryIt.second))
473 static_cast<int>(CGEdge.second.Hotness));
lib/IR/PassManager.cpp 66 const auto &InnerAnalysisIDs = OuterInvalidationPair.second;
lib/IR/PassRegistry.cpp 44 return I != PassInfoMap.end() ? I->second : nullptr;
60 PassInfoMap.insert(std::make_pair(PI.getTypeInfo(), &PI)).second;
76 L->passEnumerate(PassInfoPair.second);
lib/IR/PassTimingInfo.cpp 180 assert(Pair.second && "should always create a new timer");
181 return *(Pair.first->second.get());
201 const Timer *MyTimer = I.second.get();
204 << I.first.second << ")\n";
208 const Timer *MyTimer = I.second.get();
211 << I.first.second << ")\n";
lib/IR/SafepointIRVerifier.cpp 337 if (!Visited.insert(V).second)
551 gatherDominatingDefs(BBI.first, BBI.second->AvailableIn, DT);
552 transferBlock(BBI.first, *BBI.second, true);
563 return it != BlockMap.end() ? it->second : nullptr;
lib/IR/Type.cpp 312 if (Insertion.second) {
358 if (Insertion.second) {
417 if (!IterBool.second) {
429 } while (!IterBool.second);
486 if (Visited && !Visited->insert(const_cast<StructType*>(this)).second)
lib/IR/TypeFinder.cpp 74 incorporateMDNode(MD.second);
94 if (!VisitedTypes.insert(Ty).second)
111 if (VisitedTypes.insert(*I).second)
132 if (!VisitedConstants.insert(V).second)
152 if (!VisitedMetadata.insert(V).second)
lib/IR/Value.cpp 194 return I->second;
366 if (!Cache.insert(Expr).second)
523 } while (Visited.insert(V).second);
599 } while (Visited.insert(V).second);
838 assert(I->second && I->first == I->second->getValPtr() &&
838 assert(I->second && I->first == I->second->getValPtr() &&
840 I->second->setPrevPtr(&I->second);
840 I->second->setPrevPtr(&I->second);
lib/IR/ValueSymbolTable.cpp 65 if (IterBool.second)
104 if (IterBool.second) {
lib/IR/Verifier.cpp 557 if (!Visited.insert(User).second)
729 Assert(Visited.insert(GA2).second, "Aliases cannot form a cycle", &GA);
791 if (!MDNodes.insert(&MD).second)
861 if (!MDNodes.insert(MD).second)
1458 bool Inserted = SeenIDs.insert(std::make_pair(ID, Op)).second;
1842 if (Args.second && !CheckParam("number of elements", *Args.second))
1842 if (Args.second && !CheckParam("number of elements", *Args.second))
1851 MDNode *MD = Pair.second;
1878 if (!ConstantExprVisited.insert(EntryC).second)
1904 if (!ConstantExprVisited.insert(OpC).second)
2069 unsigned EscapedObjectCount = Counts.second.first;
2070 unsigned MaxRecoveredIndex = Counts.second.second;
2070 unsigned MaxRecoveredIndex = Counts.second.second;
2098 Instruction *Terminator = Pair.second;
2116 if (!Visited.insert(SuccPad).second)
2123 Terminator = TermI->second;
2247 MDs.empty() ? nullptr : MDs.front().second);
2252 !cast<DISubprogram>(I.second)->isDistinct(),
2259 visitMDNode(*I.second);
2289 "function must have a single !dbg attachment", &F, I.second);
2290 AssertDI(isa<DISubprogram>(I.second),
2291 "function !dbg attachment must be a subprogram", &F, I.second);
2292 auto *SP = cast<DISubprogram>(I.second);
2302 "function must have a single !prof attachment", &F, I.second);
2307 visitMDNode(*I.second);
2338 if (!Seen.insert(DL).second)
2346 if (Scope && !Seen.insert(Scope).second)
2353 if (SP && ((Scope != SP) && !Seen.insert(SP).second))
2412 Values[i].second == Values[i - 1].second,
2412 Values[i].second == Values[i - 1].second,
2415 &PN, Values[i].first, Values[i].second, Values[i - 1].second);
2415 &PN, Values[i].first, Values[i].second, Values[i - 1].second);
2475 Assert(Constants.insert(Case.getCaseValue()).second,
3653 Assert(Seen.insert(FromPad).second,
3772 Assert(Seen.insert(CurrentPad).second,
4461 Entry.second = unsigned(
4462 std::max(uint64_t(Entry.second), IdxArg->getLimitedValue(~0U) + 1));
5214 return Itr->second;
5219 assert(InsertResult.second && "We just checked!");
5353 return Parent && Visited.insert(Parent).second &&
5360 return ResultIt->second;
5366 assert(InsertResult.second && "Just checked!");
5497 if (!StructPath.insert(BaseNode).second) {
lib/LTO/LTO.cpp 169 Hasher.update(ArrayRef<uint8_t>((const uint8_t *)&Entry.second,
221 GlobalValue::LinkageTypes Linkage = GS.second->linkage();
225 AddUsedThings(GS.second);
254 AddUnsigned(WPD.second.TheKind);
255 AddString(WPD.second.SingleImplName);
257 AddUint64(WPD.second.ResByArg.size());
258 for (auto &ByArg : WPD.second.ResByArg) {
262 AddUnsigned(ByArg.second.TheKind);
263 AddUint64(ByArg.second.Info);
264 AddUnsigned(ByArg.second.Byte);
265 AddUnsigned(ByArg.second.Bit);
273 for (auto It = TidIter.first; It != TidIter.second; ++It)
274 AddTypeIdSummary(It->second.first, It->second.second);
274 AddTypeIdSummary(It->second.first, It->second.second);
274 AddTypeIdSummary(It->second.first, It->second.second);
367 for (auto &S : I.second.SummaryList)
422 thinLTOInternalizeAndPromoteGUID(I.second.SummaryList, I.first, isExported,
845 if (!ThinLTO.ModuleMap.insert({BM.getModuleIdentifier(), BM}).second)
880 for (auto &S : P.second.SummaryList) {
921 return It->second;
958 if (!I.second.Prevailing)
962 if (OldGV && DL.getTypeAllocSize(OldGV->getValueType()) == I.second.Size) {
965 OldGV->setAlignment(I.second.Align);
969 ArrayType::get(Type::getInt8Ty(RegularLTO.Ctx), I.second.Size);
973 GV->setAlignment(I.second.Align);
1368 if (Error E = BackendProc->start(Task, Mod.second, ImportLists[Mod.first],
lib/LTO/LTOBackend.cpp 529 return I->second.getLazyModule(Mod.getContext(),
lib/LTO/LTOCodeGenerator.cpp 629 o = getToken(o.second))
lib/LTO/LTOModule.cpp 273 if (IterBool.second) {
310 if (!IterBool.second)
329 if (!IterBool.second)
480 if (!IterBool.second)
523 if (!IterBool.second)
548 if (!IterBool.second)
lib/LTO/SummaryBasedOptimizations.cpp 51 return Scaled64(Edge.second.RelBlockFreq, -CalleeInfo::ScaleShift);
lib/LTO/ThinLTOCodeGenerator.cpp 136 if (HasMultipleCopies(I.second.SummaryList))
138 getFirstDefinitionForLinker(I.second.SummaryList);
476 return Prevailing->second == S;
611 return Prevailing->second == S;
lib/LTO/UpdateCompilerUsed.cpp 77 if (Lowering && TLSet.insert(Lowering).second)
lib/Linker/IRMover.cpp 148 if (!DstResolvedOpaqueTypes.insert(cast<StructType>(DstTy)).second)
254 assert(!(Pair.first != Ty && Pair.second == Ty) &&
259 if (!Visited.insert(STy).second) {
408 if (ValuesToLink.insert(GV).second)
lib/MC/ConstantPools.cpp 46 return Itr->second;
71 return &CP->second;
91 ConstantPool &CP = CPI.second;
lib/MC/ELFObjectWriter.cpp 1080 SectionOffsets.find(Section)->second;
1085 Size = Offsets.second - Offsets.first;
1282 const auto &Symbol = cast<MCSymbolELF>(*P.second);
lib/MC/MCAsmStreamer.cpp 1436 Range.second->print(OS, MAI);
2018 if (auto *Label = Tables.begin()->second.getLabel()) {
lib/MC/MCCodePadder.cpp 29 return CodePaddingPolicies.insert(Policy).second;
150 return JurisdictionLocation->second;
178 assert(InsertionResult.second &&
180 return InsertionResult.first->second;
187 return MaxFragmentSizeLocation->second;
202 assert(InsertionResult.second &&
204 return InsertionResult.first->second;
lib/MC/MCCodeView.cpp 65 unsigned Offset = FilenameOffset.second;
154 if (Insertion.second) {
269 if (!I.second)
270 I.first->second.second = Offset + 1;
270 I.first->second.second = Offset + 1;
280 for (size_t Idx = I->second.first, End = I->second.second; Idx != End;
280 for (size_t Idx = I->second.first, End = I->second.second; Idx != End;
280 for (size_t Idx = I->second.first, End = I->second.second; Idx != End;
291 MCCVFunctionInfo::LineInfo &IA = I->second;
315 return I->second;
473 LocEnd = std::max(LocEnd, Extent.second);
530 CurSourceLoc = I->second;
623 unsigned RangeSize = computeLabelDiff(Layout, Range.first, Range.second);
625 LastLabel = Range.second;
633 unsigned RangeSize = GapAndRangeSizes[I].second;
636 unsigned GapAndRangeSize = GapAndRangeSizes[J].first + GapAndRangeSizes[J].second;
686 unsigned GapStartOffset = GapAndRangeSizes[I].second;
lib/MC/MCContext.cpp 198 if (NameEntry.second || !NameEntry.first->second) {
409 if (!IterBool.second)
410 return Entry.second;
424 Entry.second = Result;
451 if (!IterBool.second)
452 return Iter->second;
462 Iter->second = Result;
518 if (!IterBool.second)
519 return Entry.second;
528 Entry.second = Result;
548 if (!IterBool.second)
549 return Entry.second;
560 Entry.second = Result;
587 (Twine(Entry.second) + Path.substr(Entry.first.size())).str();
599 for (auto &Dir : CUIDTablePair.second.getMCDwarfDirs())
lib/MC/MCDwarf.cpp 253 CUIDTablePair.second.EmitCU(MCOS, Params, LineStr);
266 MCOS.EmitLabel(Header.Emit(&MCOS, Params, None, NoLineStr).second);
526 MCSymbol *LineEndSym = Header.Emit(MCOS, Params, LineStr).second;
530 EmitDwarfLineTable(MCOS, LineSec.first, LineSec.second);
584 if (!IterBool.second)
lib/MC/MCELFStreamer.cpp 314 SwitchSection(P.first, P.second);
lib/MC/MCFragment.cpp 458 OS << " RangeEnd:" << RangeStartEnd.second;
lib/MC/MCObjectFileInfo.cpp 871 unsigned UniqueID = It.first->second;
lib/MC/MCParser/AsmParser.cpp 951 for (const auto &File : LineTables.begin()->second.getMCDwarfFiles()) {
1149 if (!Split.second.empty()) {
1150 Variant = MCSymbolRefExpr::getVariantKindForName(Split.second);
1156 return Error(SMLoc::getFromPointer(Split.second.begin()),
1157 "invalid variant '" + Split.second + "'");
1199 Variant = MCSymbolRefExpr::getVariantKindForName(Split.second);
1201 return TokError("invalid variant '" + Split.second + "'");
1929 return (*Handler.second)(Handler.first, IDVal, IDLoc);
3989 getStreamer().EmitIntValue(Insertion.second, 4);
lib/MC/MCParser/DarwinAsmParser.cpp 757 getStreamer().SwitchSection(PreviousSection.first, PreviousSection.second);
lib/MC/MCParser/ELFAsmParser.cpp 662 getStreamer().SwitchSection(PreviousSection.first, PreviousSection.second);
lib/MC/MCRegisterInfo.cpp 112 return I->second;
123 return I->second;
lib/MC/MCSection.cpp 76 IP = MI->second->getIterator();
lib/MC/MCStreamer.cpp 789 TextSecCOFF->getSectionName().split('$').second)
1104 SectionStack.back().second = curSection;
lib/MC/MCWin64EH.cpp 471 const auto &Instrs = InstrsIter->second;
553 auto &EpilogInstrs = I.second;
606 uint32_t EpilogIndex = I.second;
626 auto &EpilogInstrs = I.second;
lib/MC/StringTableBuilder.cpp 69 memcpy(Buf + P.second, Data.data(), Data.size());
149 P->second = Pos;
155 P->second = Size;
184 return I->second;
193 if (P.second) {
195 P.first->second = Start;
198 return P.first->second;
lib/MC/WasmObjectWriter.cpp 418 if (!Pair.second)
485 SectionSymbol = SectionFunctions.find(&SecA)->second;
990 encodeULEB128(StartFunc.second, W.OS); // function index
1001 encodeULEB128(C.second.size(), W.OS);
1002 for (const WasmComdatEntry &Entry : C.second) {
1056 if (Pair.second)
1058 TypeIndices[&Symbol] = Pair.first->second;
1061 << " new:" << Pair.second << "\n");
1062 LLVM_DEBUG(dbgs() << " -> type index: " << Pair.first->second << "\n");
1077 if (Pair.second)
1079 TypeIndices[&Symbol] = Pair.first->second;
1081 LLVM_DEBUG(dbgs() << "registerEventType: " << Symbol << " new:" << Pair.second
1083 LLVM_DEBUG(dbgs() << " -> type index: " << Pair.first->second << "\n");
1329 Index = WasmIndices.find(&WS)->second;
1373 << WasmIndices.find(&WS)->second << "\n");
1390 LLVM_DEBUG(dbgs() << " -> event index: " << WasmIndices.find(&WS)->second
1416 uint32_t WasmIndex = WasmIndices.find(ResolvedSym)->second;
1423 DataLocations.find(ResolvedSym)->second;
1464 Info.ElementIndex = WasmIndices.find(&WS)->second;
1467 Info.DataRef = DataLocations.find(&WS)->second;
1483 uint32_t FunctionIndex = WasmIndices.find(&WS)->second;
1485 if (TableIndices.try_emplace(&WS, TableIndex).second) {
lib/MCA/CodeEmitter.cpp 21 if (EI.second)
32 EI.second = Code.size() - EI.first;
lib/MCA/HardwareUnits/LSUnit.cpp 46 G.second->cycleEvent();
57 const MemoryGroup &Group = *GroupIt.second;
166 It->second->onInstructionExecuted();
167 if (It->second->isExecuted())
lib/MCA/HardwareUnits/RegisterFile.cpp 90 RegisterRenamingInfo &Entry = RegisterMappings[Reg].second;
105 RegisterRenamingInfo &OtherEntry = RegisterMappings[*I].second;
120 unsigned Cost = Entry.IndexPlusCost.second;
135 unsigned Cost = Entry.IndexPlusCost.second;
174 const RegisterRenamingInfo &RRI = RegisterMappings[RegID].second;
214 RegisterMappings[RegID].second.AliasRegID = 0U;
217 RegisterMappings[*I].second.AliasRegID = 0U;
224 allocatePhysRegs(RegisterMappings[RegID].second, UsedPhysRegs);
233 RegisterMappings[*I].second.AliasRegID = 0U;
258 MCPhysReg RenameAs = RegisterMappings[RegID].second.RenameAs;
269 freePhysRegs(RegisterMappings[RegID].second, FreedPhysRegs);
296 const RegisterRenamingInfo &RRIFrom = RMFrom.second;
297 const RegisterRenamingInfo &RRITo = RMTo.second;
318 if (!RegisterMappings[RRITo.RenameAs].second.AllowMoveElimination)
338 const RegisterRenamingInfo &RMAlias = RegisterMappings[AliasedReg].second;
342 RegisterMappings[AliasReg].second.AliasRegID = AliasedReg;
344 RegisterMappings[*I].second.AliasRegID = AliasedReg;
364 const RegisterRenamingInfo &RRI = RegisterMappings[RegID].second;
401 const RegisterRenamingInfo &RRI = RegisterMappings[RegID].second;
432 const RegisterRenamingInfo &RRI = RegisterMappings[RegID].second;
435 NumPhysRegs[Entry.first] += Entry.second;
436 NumPhysRegs[0] += Entry.second;
478 const RegisterRenamingInfo &RRI = RM.second;
482 << ", Cost=" << RRI.IndexPlusCost.second
lib/MCA/HardwareUnits/ResourceManager.cpp 198 RS.markSubResourceAsUsed(RR.second);
202 Strategies[RSID]->used(RR.second);
228 RS.releaseSubResource(RR.second);
285 unsigned NumUnits = E.second.isReserved() ? 0U : E.second.NumUnits;
285 unsigned NumUnits = E.second.isReserved() ? 0U : E.second.NumUnits;
301 const CycleSegment &CS = R.second.CS;
308 if (!R.second.isReserved()) {
317 assert(R.second.isReserved());
326 if (BR.second)
327 BR.second--;
328 if (!BR.second) {
lib/MCA/InstrBuilder.cpp 116 if (!A.second.size()) {
135 B.second.CS.subtract(A.second.size() - SuperResources[A.first]);
135 B.second.CS.subtract(A.second.size() - SuperResources[A.first]);
137 B.second.NumUnits++;
160 if (countPopulation(RPC.first) > 1 && !RPC.second.isReserved()) {
164 RPC.second.setReserved();
188 << "Reserved=" << R.second.isReserved() << ", "
189 << "#Units=" << R.second.NumUnits << ", "
190 << "cy=" << R.second.size() << '\n';
lib/MCA/Instruction.cpp 62 unsigned ReadCycles = std::max(0, CyclesLeft - User.second);
lib/MCA/Stages/EntryStage.cpp 36 std::unique_ptr<Instruction> Inst = std::make_unique<Instruction>(SR.second);
lib/MCA/Stages/ExecuteStage.cpp 247 << RR.second << "]\n");
258 assert(Resource.second.getDenominator() == 1 && "Invalid cycles!");
260 << Resource.first.second << "], ";
261 dbgs() << "cycles: " << Resource.second.getNumerator() << '\n';
lib/MCA/Stages/InstructionTables.cpp 29 if (!Resource.second.size())
31 unsigned Cycles = Resource.second.size();
lib/Object/ArchiveWriter.cpp 226 if (Insertion.second) {
453 Entry.second = Entry.second > 1 ? 1 : 0;
453 Entry.second = Entry.second > 1 ? 1 : 0;
538 auto ToI = FromTo.second;
lib/Object/COFFObjectFile.cpp 1797 if (RelocsForOffset.first != RelocsForOffset.second) {
lib/Object/ELFObjectFile.cpp 80 if (Ident.second == ELF::ELFDATA2LSB)
82 else if (Ident.second == ELF::ELFDATA2MSB)
87 if (Ident.second == ELF::ELFDATA2LSB)
89 else if (Ident.second == ELF::ELFDATA2MSB)
437 GotToPlt.insert(std::make_pair(Entry.second, Entry.first));
447 Relocation.getSymbol()->getRawDataRefImpl(), PltEntryIter->second));
lib/Object/IRSymtab.cpp 168 if (P.second) {
178 P.first->second = -1;
192 return P.first->second;
lib/Object/Minidump.cpp 21 return getRawStream(Streams[It->second]);
149 if (!StreamMap.try_emplace(Type, StreamDescriptor.index()).second)
lib/Object/ModuleSymbolTable.cpp 166 for (auto &Alias : KV.second)
186 return S.get<AsmSymbol *>()->second;
lib/Object/RecordStreamer.cpp 210 for (auto AliasName : Symver.second) {
213 if (!Split.second.empty() && !Split.second.startswith("@")) {
213 if (!Split.second.empty() && !Split.second.startswith("@")) {
218 (Split.first + Separator + Split.second).toStringRef(NewName);
lib/Object/WasmObjectFile.cpp 360 if (!Seen.insert(Index).second)
619 !SymbolNames.insert(Info.Name).second)
637 if (Name.empty() || !ComdatSet.insert(Name).second)
684 if (!FieldsSeen.insert(FieldName).second)
706 if (!ProducersSeen.insert(Name).second) {
736 if (!FeaturesSeen.insert(Feature.Name).second)
lib/Object/WindowsResource.cpp 269 TreeNode *TypeNode = TypeIt->second.get();
275 TreeNode *NameNode = NameIt->second.get();
283 LangZeroIt->second->IsDataNode) {
284 uint32_t RemovedIndex = LangZeroIt->second->DataIndex;
297 TreeNode *FirstNode = FirstIt->second.get();
300 TreeNode *LastNode = LastIt->second.get();
519 Result = ElementInserted.first->second.get();
520 return ElementInserted.second;
532 return *(Child->second);
548 return *(Child->second);
555 Child.second->print(Writer, Child.first);
558 Child.second->print(Writer, to_string(Child.first));
580 Size += Child.second->getTreeSize();
583 Size += Child.second->getTreeSize();
595 Child.second->shiftDataIndexDown(Index);
597 Child.second->shiftDataIndexDown(Index);
902 StringTableOffsets[Child.second->getStringIndex()]);
903 if (Child.second->checkIsDataNode()) {
906 DataEntriesTreeOrder.push_back(Child.second.get());
910 (Child.second->getStringChildren().size() +
911 Child.second->getIDChildren().size()) *
913 Queue.push(Child.second.get());
922 if (Child.second->checkIsDataNode()) {
925 DataEntriesTreeOrder.push_back(Child.second.get());
929 (Child.second->getStringChildren().size() +
930 Child.second->getIDChildren().size()) *
932 Queue.push(Child.second.get());
lib/ObjectYAML/ELFEmitter.cpp 70 return Map.insert({Name, Ndx}).second;
lib/ObjectYAML/ELFYAML.cpp 877 uint8_t FlagValue = P.second;
899 return It->second;
lib/ObjectYAML/MachOEmitter.cpp 425 (this->*writeOp.second)(OS);
lib/ObjectYAML/WasmEmitter.cpp 284 if (Field.second->empty())
287 encodeULEB128(Field.second->size(), OS);
288 for (auto &Entry : *Field.second) {
lib/Option/ArgList.cpp 40 OptRanges.insert(std::make_pair(O.getID(), emptyRange())).first->second;
42 R.second = Args.size();
63 R.first = std::min(R.first, I->second.first);
64 R.second = std::max(R.second, I->second.second);
64 R.second = std::max(R.second, I->second.second);
64 R.second = std::max(R.second, I->second.second);
64 R.second = std::max(R.second, I->second.second);
lib/Option/OptTable.cpp 579 PrintHelpOptionList(OS, OptionGroup.first, OptionGroup.second);
lib/Passes/StandardInstrumentations.cpp 109 printIR(UnwrappedModule->first, Banner, UnwrappedModule->second);
lib/ProfileData/Coverage/CoverageMapping.cpp 50 return Counter::getExpression(It->second);
203 return RecordIt->second;
257 if (!RecordProvenance[FilenamesHash].insert(hash_value(OrigFuncName)).second)
391 Segments.emplace_back(StartLoc.first, StartLoc.second,
395 Segments.emplace_back(StartLoc.first, StartLoc.second, IsRegionEntry);
692 InstantiationSet.first.second,
693 std::move(InstantiationSet.second)};
lib/ProfileData/Coverage/CoverageMappingReader.cpp 431 if (InsertResult.second) {
442 size_t OldRecordIndex = InsertResult.first->second;
lib/ProfileData/Coverage/CoverageMappingWriter.cpp 33 assert(NameSet.insert(Name).second && "Duplicate filename");
lib/ProfileData/GCOV.cpp 745 printFunctionSummary(CovOS, FuncsIt->second);
754 const BlockVector &Blocks = BlocksIt->second;
777 GCOVCoverage &FuncCoverage = FuncCoverages.find(Function)->second;
876 GCOVCoverage &FuncCoverage = FuncCoverages.find(Function)->second;
922 const GCOVCoverage &Coverage = FC.second;
933 const GCOVCoverage &Coverage = FC.second;
lib/ProfileData/InstrProf.cpp 374 return (uint64_t)It->second;
lib/ProfileData/InstrProfReader.cpp 231 READ_NUM(VD.second, TakenCount);
648 Parts = Parts.second.split(':');
651 if (Parts.second.empty())
lib/ProfileData/InstrProfWriter.cpp 123 const InstrProfRecord &ProfRecord = ProfileData.second;
129 M += ValueProfData::getSize(ProfileData.second);
145 const InstrProfRecord &ProfRecord = ProfileData.second;
158 ValueProfData::serializeFrom(ProfileData.second);
214 InstrProfRecord &Dest = Where->second;
233 InstrProfRecord &Dest = Where->second;
256 addRecord(I.getKey(), Func.first, std::move(Func.second), 1, Warn);
263 const InstrProfRecord &IPR = Func.second;
460 return std::tie(A.first, A.second.first) <
461 std::tie(B.first, B.second.first);
466 const FuncPair &Func = record.second;
467 writeRecordInText(Name, Func.first, Func.second, Symtab, OS);
lib/ProfileData/ProfileSummaryBuilder.cpp 54 addCount(I.second.getSamples());
56 for (const auto &CS : I.second)
57 addRecord(CS.second, true);
83 uint32_t Freq = Iter->second;
lib/ProfileData/SampleProf.cpp 112 OS << " " << I.first << ":" << I.second;
138 OS << SI->first << ": " << SI->second;
152 for (const auto &FS : CS->second) {
154 OS << CS->first << ": inlined callee: " << FS.second.getName() << ": ";
155 FS.second.print(OS, Indent + 4);
192 FS = FS->findFunctionSamplesAt(S[i].first, S[i].second);
lib/ProfileData/SampleProfReader.cpp 260 name_count.second));
554 const uint8_t *FuncProfileAddr = Start + NameOffset.second;
650 OffsetsToUse.push_back(FuncEntry.second);
659 OffsetsToUse.push_back(iter->second);
lib/ProfileData/SampleProfWriter.cpp 53 if (A.second->getTotalSamples() == B.second->getTotalSamples())
53 if (A.second->getTotalSamples() == B.second->getTotalSamples())
55 return A.second->getTotalSamples() > B.second->getTotalSamples();
55 return A.second->getTotalSamples() > B.second->getTotalSamples();
59 if (std::error_code EC = writeSample(*I.second))
164 encodeULEB128(entry.second, OS);
241 const SampleRecord &Sample = I->second;
251 OS << " " << J.first << ":" << J.second;
259 for (const auto &FS : I->second) {
261 const FunctionSamples &CalleeSamples = FS.second;
279 encodeULEB128(ret->second, *OutputStream);
290 const SampleRecord &Sample = I.second;
297 for (const auto &FS : J.second) {
298 const FunctionSamples &CalleeSamples = FS.second;
346 encodeULEB128(entry.second, OS);
508 const SampleRecord &Sample = I.second;
515 uint64_t CalleeSamples = J.second;
525 NumCallsites += J.second.size();
528 for (const auto &FS : J.second) {
530 const FunctionSamples &CalleeSamples = FS.second;
lib/Remarks/RemarkParser.cpp 32 InBuffer = Split.second;
lib/Remarks/RemarkStringTable.cpp 35 if (KV.second)
42 auto Impl = [&](StringRef &S) { S = add(S).second; };
lib/Support/CachePruning.cpp 80 while (!P.second.empty()) {
81 P = P.second.split(':');
lib/Support/CommandLine.cpp 167 if (!SC->OptionsMap.insert(std::make_pair(Name, &Opt)).second) {
202 if (!SC->OptionsMap.insert(std::make_pair(O->ArgStr, O)).second) {
318 if (!Sub.OptionsMap.insert(std::make_pair(NewName, O)).second) {
572 StringRef &RHS = SplitArg.second;
1500 PositionalVals[ValNo].second);
1519 PositionalVals[ValNo].second);
1535 PositionalVals[ValNo].second);
1547 PositionalVals[ValNo].second);
1556 PositionalVals[ValNo].second);
1657 while (!Split.second.empty()) {
1658 Split = Split.second.split('\n');
2028 if (!OptionSet.insert(I->second).second)
2062 Opts[i].second->printOptionInfo(MaxArgLen);
2068 if (!S.second->getDescription().empty()) {
2070 outs() << " - " << S.second->getDescription();
2149 MaxArgLen = std::max(MaxArgLen, Opts[i].second->getOptionWidth());
2206 Option *Opt = Opts[I].second;
2356 MaxArgLen = std::max(MaxArgLen, Opts[i].second->getOptionWidth());
2359 Opts[i].second->printOptionValue(MaxArgLen, PrintAllOptions);
lib/Support/DAGDeltaAlgorithm.cpp 190 Predecessors[it->second].push_back(it->first);
191 Successors[it->first].push_back(it->second);
lib/Support/DebugCounter.cpp 40 outs().indent(NumSpaces) << " - " << Info.second << '\n';
73 if (CounterPair.second.empty()) {
80 if (CounterPair.second.getAsInteger(0, CounterVal)) {
81 errs() << "DebugCounter Error: " << CounterPair.second
lib/Support/FileCheck.cpp 674 assert(VariableDef.second < MatchInfo.size() && "Internal paren error");
676 MatchInfo[VariableDef.second];
936 InputStartCol = Start.second;
938 InputEndCol = End.second;
941 CheckCol = Start.second;
1739 if (!PrefixSet.insert(Prefix).second)
1819 CmdlineDefIndices.second);
lib/Support/FormattedStream.cpp 25 unsigned &Line = Position.second;
lib/Support/Host.cpp 1255 auto Val = Data.second.trim();
lib/Support/IntervalMap.cpp 21 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second));
lib/Support/ItaniumManglingCanonicalizer.cpp 160 if (Result.second) {
lib/Support/JSON.cpp 27 return &I->second;
33 return &I->second;
85 if (R == RHS.end() || L.second != R->second)
85 if (R == RHS.end() || L.second != R->second)
623 attribute(E->first, E->second);
lib/Support/LockFileManager.cpp 69 if (processStillExecuting(Owner.first, Owner.second))
327 if (!processStillExecuting((*Owner).first, (*Owner).second))
lib/Support/Options.cpp 21 delete IT->second;
lib/Support/Regex.cpp 153 if (Split.second.empty()) {
161 Repl = Split.second;
lib/Support/SourceMgr.cpp 221 LineAndCol.second-1, Kind, Msg.str(),
432 &CaretLine[std::min((size_t)R.second, CaretLine.size())],
lib/Support/SpecialCaseList.cpp 68 return RegExKV.second;
165 if (SplitLine.second.empty()) {
172 std::pair<StringRef, StringRef> SplitRegexp = SplitLine.second.split("=");
174 StringRef Category = SplitRegexp.second;
193 SplitLine.second + "': " + REError).str();
lib/Support/StringExtras.cpp 56 S = getToken(S.second, Delimiters);
lib/Support/StringSaver.cpp 23 if (R.second) // cache miss, need to actually save the string
lib/Support/TarWriter.cpp 178 if (!Files.insert(Fullpath).second)
lib/Support/TargetRegistry.cpp 130 << Targets[i].second->getShortDescription() << '\n';
lib/Support/TimeProfiler.cpp 100 CountAndTotal.second += Duration;
141 return A.second.second > B.second.second;
141 return A.second.second > B.second.second;
141 return A.second.second > B.second.second;
141 return A.second.second > B.second.second;
144 auto DurUs = duration_cast<microseconds>(E.second.second).count();
144 auto DurUs = duration_cast<microseconds>(E.second.second).count();
lib/Support/Timer.cpp 206 Timer &T = GroupEntry.second[Name];
lib/Support/TrigramIndex.cpp 101 for (size_t J : II->second) {
lib/Support/Triple.cpp 994 StringRef Tmp = StringRef(Data).split('-').second; // Strip first component
999 StringRef Tmp = StringRef(Data).split('-').second; // Strip first component
1000 Tmp = Tmp.split('-').second; // Strip second component
1005 StringRef Tmp = StringRef(Data).split('-').second; // Strip first component
1006 Tmp = Tmp.split('-').second; // Strip second component
1007 return Tmp.split('-').second; // Strip third component
1011 StringRef Tmp = StringRef(Data).split('-').second; // Strip first component
1012 return Tmp.split('-').second; // Strip second component
lib/Support/VirtualFileSystem.cpp 496 if (SeenNames.insert(Name).second)
1206 if (I.second.Required && !I.second.Seen) {
1206 if (I.second.Required && !I.second.Seen) {
2098 if (SeenNames.insert(Name).second)
lib/Support/YAMLParser.cpp 721 if (UnicodeScalarValue.second == 0) {
739 EscapedInput += StringRef(i, UnicodeScalarValue.second);
749 i += UnicodeScalarValue.second - 1;
835 if ( u8d.second != 0
844 return Position + u8d.second;
1079 T.Range = StringRef(Current, EI.second);
1081 Current += EI.second;
1813 Ret = Doc->getTagMap().find("!")->second;
1817 Ret = Doc->getTagMap().find("!!")->second;
1825 Ret = It->second;
lib/TableGen/JSONBackend.cpp 135 auto &Name = C.second->getNameInitAsString();
141 auto &Name = D.second->getNameInitAsString();
142 auto &Def = *D.second;
178 instanceof[kv.first] = std::move(kv.second);
lib/TableGen/Record.cpp 1646 NewRec->addSuperClass(SCPair.first, SCPair.second);
1923 Names.push_back(Arg.second);
2343 OS << "class " << *C.second;
2347 OS << "def " << *D.second;
2365 if (D.second->isSubClassOf(Class))
2366 Defs.push_back(D.second.get());
2376 Init *I = It->second.V;
2378 if (!It->second.Resolved && Map.size() > 1) {
lib/TableGen/SetTheory.cpp 312 return &I->second;
lib/TableGen/StringMatcher.cpp 61 StringRef Code = Matches[0]->second;
66 Code = Split.second;
70 Code = Split.second;
117 << LI->second.size() << " string";
118 if (LI->second.size() != 1) OS << 's';
120 if (EmitStringMatcherForChar(LI->second, CharNo + 1, IndentCount + 1,
149 << LI->second.size()
150 << " string" << (LI->second.size() == 1 ? "" : "s") << " to match.\n";
151 if (EmitStringMatcherForChar(LI->second, 0, Indent, IgnoreDuplicates))
lib/TableGen/TGLexer.cpp 386 SrcMgr.PrintMessage(Found->second, SourceMgr::DK_Note,
786 if (!DefinedMacros.insert(MacroName).second)
lib/TableGen/TGParser.cpp 281 CurRec->addSuperClass(SCPair.first, SCPair.second);
376 R.set(S.first, S.second);
422 R.set(S.first, S.second);
1786 SmallVector<Init*, 16> Bits(BinaryVal.second);
1787 for (unsigned i = 0, e = BinaryVal.second; i != e; ++i)
2968 if (!Result.second)
2971 CurMultiClass = Result.first->second.get();
lib/Target/AArch64/AArch64A57FPLoadBalancing.cpp 704 I->second->setKill(MI, Idx, /*Immutable=*/true);
lib/Target/AArch64/AArch64AsmPrinter.cpp 288 MCSymbol *Sym = P.second;
473 MCArgs.push_back(LabelIt->second);
lib/Target/AArch64/AArch64ExpandImm.cpp 58 const unsigned Count = Chunk->second;
lib/Target/AArch64/AArch64FalkorHWPFFix.cpp 692 auto Size = P.second.size();
694 for (auto *MI : P.second) {
lib/Target/AArch64/AArch64FastISel.cpp 371 .addFrameIndex(SI->second)
675 Addr.setFI(SI->second);
5055 bool IdxNIsKill = Pair.second;
lib/Target/AArch64/AArch64ISelLowering.cpp 3926 ->second;
4017 RegToPass.second, InFlag);
4075 RegToPass.second.getValueType()));
4219 ->second;
4229 Chain = DAG.getCopyToReg(Chain, DL, RetVal.first, RetVal.second, Flag);
4232 DAG.getRegister(RetVal.first, RetVal.second.getValueType()));
6032 if (!Res.second) {
6044 Res.second = &AArch64::FPR64RegClass;
6047 Res.second = &AArch64::FPR128RegClass;
6053 if (Res.second && !Subtarget->hasFPARMv8() &&
6054 !AArch64::GPR32allRegClass.hasSubClassEq(Res.second) &&
6055 !AArch64::GPR64allRegClass.hasSubClassEq(Res.second))
12040 SDValue Ops[] = {N->getOperand(1), Desired.first, Desired.second,
12041 New.first, New.second, N->getOperand(0)};
lib/Target/AArch64/AArch64MachineFunctionInfo.h 250 return It->second.first;
254 return JumpTableEntryInfo.find(Idx)->second.second;
254 return JumpTableEntryInfo.find(Idx)->second.second;
lib/Target/AArch64/AArch64PromoteConstant.cpp 211 IPI->second.emplace_back(User, OpNo);
217 Uses OldUses = std::move(IPI->second);
351 if (Converted.second)
352 Converted.first->second.ShouldConvert = shouldConvertImpl(&C);
353 return Converted.first->second.ShouldConvert;
385 IPI.second.emplace_back(User, OpNo);
504 for (auto Use : IPI.second) {
507 findInsertionPoint(*Use.first, Use.second)) &&
511 dbgs() << "Use to update " << Use.second << ":";
515 Use.first->setOperand(Use.second, LoadedCst);
lib/Target/AArch64/AArch64SelectionDAGInfo.cpp 51 return CallResult.second;
lib/Target/AArch64/AArch64SpeculationHardening.cpp 331 assert(MI_Reg.second != 0);
335 << printReg(MI_Reg.second, TRI)
337 insertRegToSPTaintPropagation(MBB, MI_Reg.first, MI_Reg.second);
342 assert(MI_Reg.second != 0);
345 << printReg(MI_Reg.second, TRI)
351 insertRegToSPTaintPropagation(MBB, MI_Reg.first, MI_Reg.second);
lib/Target/AArch64/AArch64StackOffset.h 59 int64_t OffsetInBytes = Other.first * (Other.second.getSizeInBits() / 8);
60 if (Other.second.isScalableVector())
lib/Target/AArch64/AArch64StackTagging.cpp 204 : I1->second;
206 : I2->second;
440 const AllocaInfo &Info = I.second;
570 AllocaInfo &Info = I.second;
614 const AllocaInfo &Info = I.second;
lib/Target/AArch64/AArch64TargetTransformInfo.cpp 241 unsigned DstElTySize = DstTyL.second.getScalarSizeInBits();
242 if (!DstTyL.second.isVector() || DstElTySize != DstTy->getScalarSizeInBits())
249 unsigned SrcElTySize = SrcTyL.second.getScalarSizeInBits();
250 if (!SrcTyL.second.isVector() || SrcElTySize != SrcTy->getScalarSizeInBits())
254 unsigned NumDstEls = DstTyL.first * DstTyL.second.getVectorNumElements();
255 unsigned NumSrcEls = SrcTyL.first * SrcTyL.second.getVectorNumElements();
425 if (!VecLT.second.isVector() || !TLI->isTypeLegal(DstVT))
462 if (!LT.second.isVector())
466 unsigned Width = LT.second.getVectorNumElements();
640 LT.second.is128BitVector() && (!Alignment || *Alignment < Align(16))) {
927 MVT MTy = LT.second;
994 if (const auto *Entry = CostTableLookup(ShuffleTbl, Kind, LT.second))
lib/Target/AArch64/AsmParser/AArch64AsmParser.cpp 858 if (!(IsByte && ShiftedImm->second) &&
860 << ShiftedImm->second))
876 if (!(IsByte && ShiftedImm->second) &&
878 << ShiftedImm->second))
1541 Inst.addOperand(MCOperand::createImm(ShiftedVal->second));
1556 Inst.addOperand(MCOperand::createImm(ShiftedVal->second));
2287 RegNum = Entry->getValue().second;
3083 unsigned ElementWidth = KindRes->second;
3174 unsigned ElementWidth = KindRes->second;
5682 unsigned ElementWidth = KindRes->second;
lib/Target/AMDGPU/AMDGPUAlwaysInlinePass.cpp 68 if (!Visited.insert(U).second)
lib/Target/AMDGPU/AMDGPUAnnotateKernelFeatures.cpp 109 if (!ConstantExprVisited.insert(EntryC).second)
130 if (!ConstantExprVisited.insert(OpC).second)
lib/Target/AMDGPU/AMDGPUArgumentUsageInfo.cpp 58 << " PrivateSegmentBuffer: " << FI.second.PrivateSegmentBuffer
59 << " DispatchPtr: " << FI.second.DispatchPtr
60 << " QueuePtr: " << FI.second.QueuePtr
61 << " KernargSegmentPtr: " << FI.second.KernargSegmentPtr
62 << " DispatchID: " << FI.second.DispatchID
63 << " FlatScratchInit: " << FI.second.FlatScratchInit
64 << " PrivateSegmentSize: " << FI.second.PrivateSegmentSize
65 << " WorkGroupIDX: " << FI.second.WorkGroupIDX
66 << " WorkGroupIDY: " << FI.second.WorkGroupIDY
67 << " WorkGroupIDZ: " << FI.second.WorkGroupIDZ
68 << " WorkGroupInfo: " << FI.second.WorkGroupInfo
70 << FI.second.PrivateSegmentWaveByteOffset
71 << " ImplicitBufferPtr: " << FI.second.ImplicitBufferPtr
72 << " ImplicitArgPtr: " << FI.second.ImplicitArgPtr
73 << " WorkItemIDX " << FI.second.WorkItemIDX
74 << " WorkItemIDY " << FI.second.WorkItemIDY
75 << " WorkItemIDZ " << FI.second.WorkItemIDZ
lib/Target/AMDGPU/AMDGPUArgumentUsageInfo.h 185 return I->second;
lib/Target/AMDGPU/AMDGPUAsmPrinter.cpp 445 SIFunctionResourceInfo &Info = I.first->second;
446 assert(I.second && "should only be called once per function");
892 MaxSGPR = std::max(I->second.NumExplicitSGPR - 1, MaxSGPR);
893 MaxVGPR = std::max(I->second.NumVGPR - 1, MaxVGPR);
894 MaxAGPR = std::max(I->second.NumAGPR - 1, MaxAGPR);
896 = std::max(I->second.PrivateSegmentSize, CalleeFrameSize);
897 Info.UsesVCC |= I->second.UsesVCC;
898 Info.UsesFlatScratch |= I->second.UsesFlatScratch;
899 Info.HasDynamicallySizedStack |= I->second.HasDynamicallySizedStack;
900 Info.HasRecursion |= I->second.HasRecursion;
lib/Target/AMDGPU/AMDGPUCodeGenPrepare.cpp 630 return getMul64(Builder, LHS, RHS).second;
lib/Target/AMDGPU/AMDGPUInline.cpp 140 if (!AI->isStaticAlloca() || !AIVisited.insert(AI).second)
lib/Target/AMDGPU/AMDGPULibFunc.cpp 549 mangledName = P.second;
lib/Target/AMDGPU/AMDGPULowerKernelAttributes.cpp 251 if (HandledUses.insert(CI).second) {
lib/Target/AMDGPU/AMDGPUMachineCFGStructurizer.cpp 152 assert((SI.second != SourceMBB || SourceReg == SI.first));
166 (SI.second == nullptr || SI.second == SourceMBB)) {
166 (SI.second == nullptr || SI.second == SourceMBB)) {
167 ElimiatedSources.push_back(PHISourceT(SI.first, SI.second));
192 (SI.second == nullptr || SI.second == SourceMBB)) {
192 (SI.second == nullptr || SI.second == SourceMBB)) {
205 if (SI.second == SourceMBB) {
273 dbgs() << printReg(SI.first, TRI) << '(' << printMBBReference(*SI.second)
1826 << " -> " << printMBBReference(*Edge.second) << "\n");
1827 Edge.first->removeSuccessor(Edge.second);
2120 MachineBasicBlock *SourceMBB = Source.second;
2169 if (CurrentRegion->contains((*SRI).second)) {
2184 BackedgePHI.addMBB((*SRI).second);
2192 << printMBBReference(*(*SRI).second));
2196 MIB.addMBB((*SRI).second);
2198 << printMBBReference(*(*SRI).second) << ", ");
lib/Target/AMDGPU/AMDGPUMachineFunction.cpp 47 if (!Entry.second)
48 return Entry.first->second;
59 Entry.first->second = Offset;
lib/Target/AMDGPU/AMDGPUOpenCLEnqueuedBlockLowering.cpp 84 if (Callers.insert(Caller).second)
95 if (Funcs.insert(F).second)
lib/Target/AMDGPU/AMDGPUPerfHintAnalysis.cpp 156 if (!Visited.insert(V).second)
lib/Target/AMDGPU/AMDGPUPromoteAlloca.cpp 309 return I == GEPIdx.end() ? nullptr : I->second;
684 unsigned OccupancyHint = ST.getWavesPerEU(F).second;
758 unsigned WorkGroupSize = ST.getFlatWorkGroupSizes(ContainingFunction).second;
lib/Target/AMDGPU/AMDGPUPropagateAttributes.cpp 251 R.first->setCalledFunction(R.second);
lib/Target/AMDGPU/AMDGPURewriteOutArguments.cpp 324 Value *ReplVal = Store.second->getValueOperand();
339 Store.second->eraseFromParent();
396 for (std::pair<Argument *, Value *> ReturnPoint : Replacement.second) {
398 Value *Val = ReturnPoint.second;
lib/Target/AMDGPU/AMDGPUSubtarget.cpp 315 unsigned WorkGroupSize = getFlatWorkGroupSizes(F).second;
325 unsigned WorkGroupSize = getFlatWorkGroupSizes(F).second;
375 if (Requested.first > Requested.second)
381 if (Requested.second > getMaxFlatWorkGroupSize())
400 getMaxWavesPerEU(FlatWorkGroupSizes.second);
413 if (Requested.second && Requested.first > Requested.second)
413 if (Requested.second && Requested.first > Requested.second)
420 if (Requested.second > getMaxWavesPerEU())
435 unsigned MaxSize = getFlatWorkGroupSizes(*Kernel).second;
671 if (WavesPerEU.second &&
672 Requested && Requested < getMinNumSGPRs(WavesPerEU.second))
705 if (WavesPerEU.second &&
706 Requested && Requested < getMinNumVGPRs(WavesPerEU.second))
818 if (!Visited.insert(SU).second)
lib/Target/AMDGPU/AMDGPUTargetTransformInfo.cpp 356 unsigned NElts = LT.second.isVector() ?
357 LT.second.getVectorNumElements() : 1;
359 MVT::SimpleValueType SLT = LT.second.getScalarType().SimpleTy;
lib/Target/AMDGPU/AMDGPUUnifyDivergentExitNodes.cpp 111 if (Visited.insert(Pred).second)
lib/Target/AMDGPU/AMDILCFGStructurizer.cpp 348 return (*It).second->SccNum;
356 return (*It).second;
371 return (*It).second->IsRetired;
858 if ((*It).second && (*It).second->IsRetired) {
858 if ((*It).second && (*It).second->IsRetired) {
863 delete (*It).second;
lib/Target/AMDGPU/AsmParser/AMDGPUAsmParser.cpp 4646 unsigned Idx = i->second;
lib/Target/AMDGPU/GCNDPPCombine.cpp 546 while (!S.second.empty())
547 S.first->getOperand(S.second.pop_back_val()).setIsUndef(true);
573 for (auto M : { Split.first, Split.second }) {
lib/Target/AMDGPU/GCNHazardRecognizer.cpp 387 if (!Visited.insert(Pred).second)
lib/Target/AMDGPU/GCNIterativeScheduler.cpp 348 return P.second == SU->getInstr();
lib/Target/AMDGPU/GCNMinRegStrategy.cpp 203 Set.insert(P.getSUnit()).second)
lib/Target/AMDGPU/GCNNSAReassign.cpp 259 if (C.second)
265 C.second = true;
314 if (I->second && CheckNSA(*I->first, true) < NSA_Status::CONTIGUOUS) {
332 C.second = true;
lib/Target/AMDGPU/GCNRegBankReassign.cpp 578 if (!Visited.insert(&MI).second)
lib/Target/AMDGPU/GCNRegPressure.cpp 75 if (I == S2.end() || I->second != P.second)
75 if (I == S2.end() || I->second != P.second)
338 auto &LiveMask = I->second;
383 auto PrevMask = It.second;
384 It.second &= ~S.LaneMask;
385 CurPressure.inc(It.first, PrevMask, It.second, *MRI);
389 auto PrevMask = It.second;
390 It.second = LaneBitmask::getNone();
391 CurPressure.inc(It.first, PrevMask, It.second, *MRI);
393 if (It.second.none())
451 << ":L" << PrintLaneMask(P.second)
454 else if (I->second != P.second) {
454 else if (I->second != P.second) {
457 << PrintLaneMask(I->second)
459 << PrintLaneMask(P.second)
467 << ":L" << PrintLaneMask(P.second)
503 if (It != LiveRegs.end() && It->second.any())
505 << PrintLaneMask(It->second);
lib/Target/AMDGPU/GCNRegPressure.h 257 Res.inc(RM.first, LaneBitmask::getNone(), RM.second, MRI);
lib/Target/AMDGPU/GCNSchedStrategy.cpp 463 auto LiveIn = std::move(LiveInIt->second);
469 auto *NonDbgMI = &*skipDebugInstructionsForward(Rgn.first, Rgn.second);
483 if (Regions[CurRegion].second == I) {
511 auto *MI = &*skipDebugInstructionsForward(I->first, I->second);
554 RegionEnd = Region.second;
lib/Target/AMDGPU/R600ControlFlowFinalizer.cpp 371 int64_t Imm = Src.second;
474 for (unsigned i = 0, e = Clause.second.size(); i < e; ++i) {
475 BB->splice(InsertPos, BB, Clause.second[i]);
477 CfCount += 2 * Clause.second.size();
486 for (unsigned i = 0, e = Clause.second.size(); i < e; ++i) {
487 BB->splice(InsertPos, BB, Clause.second[i]);
489 CfCount += Clause.second.size();
576 Pair.second.insert(MIb);
587 CounterPropagateAddr(Pair.second, CfCount);
647 LoopStack.back().second.insert(MIb);
655 LoopStack.back().second.insert(MIb);
lib/Target/AMDGPU/R600EmitClauseMarkers.cpp 145 unsigned Sel = Consts[i].second;
179 R600::R600_KC0RegClass.getRegister(UsedKCache[j].second));
183 R600::R600_KC1RegClass.getRegister(UsedKCache[j].second));
302 .addImm(KCacheBanks.empty()?0:KCacheBanks[0].second) // KLINE0
303 .addImm((KCacheBanks.size() < 2)?0:KCacheBanks[1].second) // KLINE1
lib/Target/AMDGPU/R600InstrInfo.cpp 453 if (Vector[Src.second][j] < 0)
454 Vector[Src.second][j] = Src.first;
455 if (Vector[Src.second][j] != Src.first)
467 if (Vector[Src.second][Cycle] < 0)
468 Vector[Src.second][Cycle] = Src.first;
469 if (Vector[Src.second][Cycle] != Src.first)
619 Literals.insert(Src.second);
623 Consts.push_back(Src.second);
lib/Target/AMDGPU/R600OptimizeVectorRegisters.cpp 174 ((*It).second, (*PosInUntouched).second));
174 ((*It).second, (*PosInUntouched).second));
180 ((*It).second, Untouched->UndefReg[CurrentUndexIdx++]));
192 return RemapChan[j].second;
212 unsigned Swizzle = (*It).second;
254 std::vector<MachineInstr *> &MIs = (*It).second;
259 std::vector<MachineInstr *> &MIs = (*It).second;
275 MI.getOperand(i + Offset).setImm(RemapChan[j].second - 1);
lib/Target/AMDGPU/R600Packetizer.cpp 142 MI.getOperand(OperandIdx).setReg(It->second);
lib/Target/AMDGPU/SIAnnotateControlFlow.cpp 174 return Stack.pop_back_val().second;
lib/Target/AMDGPU/SIFixSGPRCopies.cpp 370 if (!Visited.insert(MBB).second)
453 auto &Defs = Init.second;
490 llvm::any_of(C.second, interferes);
545 auto &Defs = Init.second;
558 auto &Defs = Init.second;
779 if (Visited.insert(UseMI).second)
lib/Target/AMDGPU/SIFoldOperands.cpp 755 B.addImm(Defs[I].second);
lib/Target/AMDGPU/SIFormMemoryClauses.cpp 234 if ((Conflict->second.second & Mask).any())
234 if ((Conflict->second.second & Mask).any())
282 Loc->second.first |= State;
283 Loc->second.second |= Mask;
283 Loc->second.second |= Mask;
375 forAllLanes(R.first, R.second.second, [&R, &B](unsigned SubReg) {
375 forAllLanes(R.first, R.second.second, [&R, &B](unsigned SubReg) {
376 unsigned S = R.second.first | RegState::EarlyClobber;
384 forAllLanes(R.first, R.second.second, [&R, &B](unsigned SubReg) {
384 forAllLanes(R.first, R.second.second, [&R, &B](unsigned SubReg) {
385 B.addUse(R.first, R.second.first & ~RegState::Kill, SubReg);
lib/Target/AMDGPU/SIISelLowering.cpp 2887 RegToPass.second, InFlag);
2941 RegToPass.second.getValueType()));
6296 Offsets.second, // offset
6316 Offsets.second, // offset
6367 Offsets.second, // offset
6391 Offsets.second, // offset
6497 Offsets.second, // offset
6571 Offsets.second, // offset
6664 Offsets.second, // offset
6685 Offsets.second, // offset
6824 unsigned WGSize = ST.getFlatWorkGroupSizes(MF.getFunction()).second;
6875 Offsets.second, // offset
6900 Offsets.second, // offset
6979 Offsets.second, // offset
7024 Offsets.second, // offset
10952 if (!Visited.insert(V).second)
lib/Target/AMDGPU/SIInsertWaitcnts.cpp 496 Result.second = Result.first + (Size / 32);
511 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) {
652 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) {
953 RegNo < CallAddrOpInterval.second; ++RegNo)
964 RegNo < RtnAddrOpInterval.second; ++RegNo)
992 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) {
1028 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) {
lib/Target/AMDGPU/SILoadStoreOptimizer.cpp 1648 AM.BaseOffs = P.second - AnchorAddr.Offset;
1651 LLVM_DEBUG(dbgs() << " Promote Offset(" << P.second;
1653 updateBaseAndOffset(*P.first, Base, P.second - AnchorAddr.Offset);
lib/Target/AMDGPU/SILowerControlFlow.cpp 168 if (MBB == EMBB || !Visited.insert(MBB).second)
lib/Target/AMDGPU/SILowerI1Copies.cpp 148 return ReachableMap.find(&MBB)->second;
195 if (!ReachableMap.try_emplace(MBB, false).second)
347 if (DomIt != Visited.end() && DomIt->second <= LoopLevel)
397 if (Visited.try_emplace(Succ, ~0u).second) {
lib/Target/AMDGPU/SIMachineFunctionInfo.cpp 404 if (R.second.FullyAllocated)
lib/Target/AMDGPU/SIMachineFunctionInfo.h 489 ArrayRef<SpilledReg>() : makeArrayRef(I->second);
507 : I->second.Lanes[Lane];
835 return FlatWorkGroupSizes.second;
851 return WavesPerEU.second;
880 return PSV.first->second.get();
889 return PSV.first->second.get();
lib/Target/AMDGPU/SIMachineScheduler.cpp 520 HasLowLatencyNonWaitedParent[I->second] = 1;
562 if (S.second == SIScheduleBlockLinkKind::NoData &&
564 S.second = Kind;
592 if (S.second == SIScheduleBlockLinkKind::Data)
648 return B->second;
845 CurrentTopDownReservedDependencyColoring[SU->NodeNum] = Pos->second;
887 CurrentBottomUpReservedDependencyColoring[SU->NodeNum] = Pos->second;
913 SUColors.second = CurrentBottomUpReservedDependencyColoring[SU->NodeNum];
918 CurrentColoring[SU->NodeNum] = Pos->second;
1720 Block.second == SIScheduleBlockLinkKind::Data)
1736 LiveRegsConsumers[RegP.first] += RegP.second;
1990 Temp = Scheduler.scheduleVariant(v.first, v.second);
2011 Temp = Scheduler.scheduleVariant(v.first, v.second);
lib/Target/AMDGPU/SIPeepholeSDWA.cpp 763 MachineOperand *OrOtherDef = Res->second;
1225 const auto &Operand = OperandPair.second;
1238 const auto &Operand = OperandPair.second;
1247 convertToSDWA(PotentialMI, PotentialPair.second);
lib/Target/AMDGPU/SIRegisterInfo.cpp 800 VGPRDefined = !SGPRSpillVGPRDefinedSet.insert(Spill.VGPR).second;
lib/Target/AMDGPU/SIWholeQuadMode.cpp 232 << " InNeeds = " << PrintState(BII.second.InNeeds)
233 << ", Needs = " << PrintState(BII.second.Needs)
234 << ", OutNeeds = " << PrintState(BII.second.OutNeeds) << "\n\n";
241 dbgs() << " " << MI << " Needs = " << PrintState(III->second.Needs)
242 << ", OutNeeds = " << PrintState(III->second.OutNeeds) << '\n';
696 const BlockInfo &BI = BII->second;
745 if (III->second.Needs & StateWWM)
747 else if (III->second.Needs & StateWQM)
750 Needs &= ~III->second.Disabled;
751 OutNeeds = III->second.OutNeeds;
lib/Target/AMDGPU/Utils/AMDGPUBaseInfo.cpp 591 if (Strs.second.trim().getAsInteger(0, Ints.second)) {
591 if (Strs.second.trim().getAsInteger(0, Ints.second)) {
592 if (!OnlyFirstRequired || !Strs.second.trim().empty()) {
lib/Target/AMDGPU/Utils/AMDGPUPALMetadata.cpp 165 auto N = It->second;
560 unsigned Val = I->second.getUInt();
582 RegsObj.getMap()[Key] = I.second;
613 EW.write(uint32_t(I.second.getUInt()));
648 Registers.getMap()[Key] = I.second;
lib/Target/ARC/ARCISelLowering.cpp 316 RegsToPass[i].second, Glue);
341 RegsToPass[i].second.getValueType()));
399 unsigned Index = ResultMemLocs[i].second;
lib/Target/ARM/ARMAsmPrinter.cpp 173 OutStreamer->EmitLabel(TIP.second);
532 emitNonLazySymbolPointer(*OutStreamer, Stub.first, Stub.second);
545 emitNonLazySymbolPointer(*OutStreamer, Stub.first, Stub.second);
1333 TRegSym = TIP.second;
lib/Target/ARM/ARMBaseInstrInfo.cpp 113 if (!MLxEntryMap.insert(std::make_pair(ARM_MLxTable[i].MLxOpc, i)).second)
3176 OperandsToUpdate[i].first->setImm(OperandsToUpdate[i].second);
4809 const ARM_MLxEntry &Entry = ARM_MLxTable[I->second];
lib/Target/ARM/ARMBaseRegisterInfo.cpp 326 unsigned Paired = Hint.second;
361 Register::isVirtualRegister(Hint.second)) {
366 unsigned OtherReg = Hint.second;
369 if (Hint.second == Reg) {
876 << It->second << "\n");
888 if (It->second < NewRCWeight.WeightLimit * SizeMultiplier) {
889 It->second += NewRCWeight.RegWeight;
lib/Target/ARM/ARMFastISel.cpp 681 .addFrameIndex(SI->second)
806 Addr.Base.FI = SI->second;
lib/Target/ARM/ARMFrameLowering.cpp 1029 MIB.addReg(Regs[i].first, getKillRegState(Regs[i].second));
1032 .addReg(Regs[0].first, getKillRegState(Regs[0].second))
2302 if (BeforePrologueRegion.insert(PredBB).second)
lib/Target/ARM/ARMISelDAGToDAG.cpp 2891 if (Range->second == 0) {
2897 NewN = EmitShift(ARM::tLSRri, X, Range->second);
2899 } else if (Range->first == Range->second) {
2911 Range->second + (31 - Range->first));
4598 StringRef Flags = Fields.second;
lib/Target/ARM/ARMISelLowering.cpp 2261 RegsToPass[i].second, InFlag);
2399 RegsToPass[i].second.getValueType()));
8787 DAG.getLoad(ArgVT, dl, CallResult.second, SRet, MachinePointerInfo());
9145 return !CI.second.getNode() ? DAG.getRoot() : CI.first;
9807 if (SeenMBBs.insert(CurMBB).second)
lib/Target/ARM/ARMInstructionSelector.cpp 552 if (ARMConds.second == ARMCC::AL) {
563 if (!insertComparison(Helper, I, ResReg, ARMConds.second, LHSReg, RHSReg,
lib/Target/ARM/ARMLoadStoreOptimizer.cpp 818 MIB.addReg(R.first, getDefRegState(isDef) | getKillRegState(R.second));
842 MIB.addReg(Regs[0].first, getKillRegState(Regs[0].second))
843 .addReg(Regs[1].first, getKillRegState(Regs[1].second));
2428 for (unsigned i = 0, e = BI->second.size(); i != e; ++i) {
2429 if (Offset == getMemoryOpOffset(*BI->second[i])) {
2435 BI->second.push_back(&MI);
lib/Target/ARM/ARMMachineFunctionInfo.h 217 if (!CPEClones.insert(std::make_pair(CPCloneIdx, CPIdx)).second)
224 return I->second;
lib/Target/ARM/ARMParallelDSP.cpp 429 << *MapIt.second << "\n");
717 MulCandidate *RHSMul = Pair.second;
lib/Target/ARM/ARMSelectionDAGInfo.cpp 124 return CallResult.second;
lib/Target/ARM/ARMTargetTransformInfo.cpp 164 if (const auto *Entry = CostTableLookup(NEONFltDblTbl, ISD, LT.second))
570 CostTableLookup(NEONDupTbl, ISD::VECTOR_SHUFFLE, LT.second))
592 CostTableLookup(NEONShuffleTbl, ISD::VECTOR_SHUFFLE, LT.second))
616 ISD::VECTOR_SHUFFLE, LT.second))
633 LT.second))
695 if (const auto *Entry = CostTableLookup(CostTbl, ISDOpcode, LT.second))
708 if (LT.second == MVT::v2i64 &&
723 if (TLI->isOperationLegalOrCustomOrPromote(ISDOpcode, LT.second))
lib/Target/ARM/AsmParser/ARMAsmParser.cpp 3540 Regs.front().second)) {
3541 if (Regs.back().second == ARM::VPR)
3546 Regs.front().second)) {
3547 if (Regs.back().second == ARM::VPR)
3553 if (Kind == k_RegisterList && Regs.back().second == ARM::APSR)
3561 Op->Registers.push_back(P.second);
11575 if (std::any_of(PrevReports.first, PrevReports.second,
11578 if (DupCheckMatchClass == ~0U || Pair.second == ~0U)
11579 return Pair.second == DupCheckMatchClass;
11582 (MatchClassKind)Pair.second);
lib/Target/ARM/MCTargetDesc/ARMAsmBackend.cpp 1224 int RegOffset = Offset->second;
1265 } else if (Offset->second != CurOffset - 8) {
1269 << " saved at " << Offset->second
lib/Target/ARM/MCTargetDesc/ARMELFStreamer.cpp 478 LastEMSInfo = std::move(LastMappingSymbol->second);
lib/Target/ARM/MVETailPredication.cpp 405 Instruction *NewPred = Pair.second;
lib/Target/ARM/Thumb2SizeReduction.cpp 249 if (!ReduceOpcodeMap.insert(std::make_pair(FromOpc, i)).second)
1010 const ReduceEntry &Entry = ReduceTable[OPI->second];
lib/Target/AVR/AVRISelLowering.cpp 1264 Chain = DAG.getCopyToReg(Chain, DL, Reg.first, Reg.second, InFlag);
1277 Ops.push_back(DAG.getRegister(Reg.first, Reg.second.getValueType()));
lib/Target/BPF/BPFAbstractMemberAccess.cpp 684 if (StackElem.second.Kind == BPFPreserveFieldInfoAI)
705 CInfo = AIChain[Call].second;
725 CInfo = StackElem.second;
803 CInfo = StackElem.second;
813 CallInfo CInfo2 = StackElem2.second;
920 Transformed = transformGEPChain(M, C.first, C.second) || Transformed;
lib/Target/BPF/BPFISelDAGToDAG.cpp 353 TmpVal = it->second;
lib/Target/BPF/BPFISelLowering.cpp 360 Chain = DAG.getCopyToReg(Chain, CLI.DL, Reg.first, Reg.second, InFlag);
386 Ops.push_back(DAG.getRegister(Reg.first, Reg.second.getValueType()));
lib/Target/BPF/BTFDebug.cpp 370 if (Table[OffsetM.second] == S)
572 Fixup.second.push_back(TypeEntry.get());
774 FuncLen += FuncSec.second.size() * BTF::BPFFuncInfoSize;
778 LineLen += LineSec.second.size() * BTF::BPFLineInfoSize;
782 FieldRelocLen += FieldRelocSec.second.size() * BTF::BPFFieldRelocSize;
802 OS.EmitIntValue(FuncSec.second.size(), 4);
803 for (const auto &FuncInfo : FuncSec.second) {
816 OS.EmitIntValue(LineSec.second.size(), 4);
817 for (const auto &LineInfo : LineSec.second) {
835 OS.EmitIntValue(FieldRelocSec.second.size(), 4);
836 for (const auto &FieldRelocInfo : FieldRelocSec.second) {
1152 addType(std::move(DataSec.second));
1157 bool IsUnion = Fixup.second.first;
1173 for (auto &DType : Fixup.second.second) {
1173 for (auto &DType : Fixup.second.second) {
lib/Target/Hexagon/AsmParser/HexagonAsmParser.cpp 855 if (!HeadTail.second.empty())
858 String = HeadTail.second;
992 if (DotSplit.second.empty()) {
lib/Target/Hexagon/BitTracker.cpp 184 dbgs() << printReg(P.first, &ME.TRI) << " -> " << P.second << "\n";
367 return F->second;
369 return F->second.extract(M);
785 return F->second;
1009 RegisterCell &RC = P.second;
1061 ReachedBB.insert(Edge.second);
1063 const MachineBasicBlock &B = *MF.getBlockNumbered(Edge.second);
1075 if (BlockScanned[Edge.second])
1077 BlockScanned[Edge.second] = true;
lib/Target/Hexagon/BitTracker.h 87 if (Set.insert(MI).second)
359 return F->second;
lib/Target/Hexagon/HexagonAsmPrinter.cpp 333 OutStreamer->SwitchSection(Current.first, Current.second);
349 OutStreamer->SwitchSection(Current.first, Current.second);
lib/Target/Hexagon/HexagonBitTracker.cpp 1229 uint16_t EW = F->second.Width;
1238 if (F->second.Type == ExtType::SExt)
1240 else if (F->second.Type == ExtType::ZExt)
1289 return P.second;
lib/Target/Hexagon/HexagonBlockRanges.cpp 173 return (F != Map.end()) ? F->second : nullptr;
179 if (I.second == MI)
209 if (I.second != OldMI)
212 I.second = NewMI;
408 if (I.second != IndexType::None)
411 if (I.second != IndexType::None)
418 P.second.unionize();
437 if (F == LiveMap.end() || F->second.empty()) {
442 RangeList &RL = F->second;
532 const HexagonBlockRanges::RangeList &RL = I.second;
lib/Target/Hexagon/HexagonBlockRanges.h 85 IndexType end() const { return second; }
100 void setEnd(const IndexType &E) { second = E; }
lib/Target/Hexagon/HexagonCommonGEP.cpp 88 return F1->second < F2->second;
88 return F1->second < F2->second;
291 const UseSet &Us = I->second;
357 N->Parent = F->second;
459 Work.insert(Work.end(), CF->second.begin(), CF->second.end());
459 Work.insert(Work.end(), CF->second.begin(), CF->second.end());
460 Nodes.insert(CF->second.begin(), CF->second.end());
460 Nodes.insert(CF->second.begin(), CF->second.end());
553 NodeSet &S = I->second;
573 assert(Ins.second && "Cannot add a class");
581 dbgs() << "{ " << I->first << ", " << I->second << " }\n";
604 assert(Ins.second && "Cannot add minimal element");
641 GepNode *Rep = F->second;
657 if (N == F->second)
772 UseSet &Us = UF->second;
787 NodeVect &Cs = CF->second;
796 Bs.push_back(LF->second);
828 NodeVect &Cs = CF->second;
918 NodeVect &Cs = CF->second;
939 BasicBlock *B = cast<BasicBlock>(I->second);
981 UseSet &Us = UF->second;
1018 UseSet &Us = UF->second;
1049 UseSet &Us = I->second;
1150 UseSet &Us = UF->second;
1156 NodeVect &Cs = CF->second;
1195 LastCN = (CF != NCM.end()) ? CF->second.size() : 0;
1198 GepNode *Child = CF->second.front();
1235 UseSet &Us = UF->second;
lib/Target/Hexagon/HexagonConstExtenders.cpp 486 << PrintExpr(P.ExtI.second, P.HRI) << ']';
559 for (unsigned I : Q.second)
1316 for (unsigned I : P.second)
1360 CandSet.insert(adjustUp(R.Min, P0.first, P0.second));
1364 CandSet.insert(adjustDown(R.Max, P1.first, P1.second));
1391 return A.second < B.second ||
1391 return A.second < B.second ||
1392 (A.second == B.second && A < B);
1392 (A.second == B.second && A < B);
1414 if (P.first.second.trivial())
1459 bool IsStack = any_of(F->second, [this](unsigned I) {
1467 if (all_of(P.second, SameValue)) {
1468 F->second.insert(P.second.begin(), P.second.end());
1468 F->second.insert(P.second.begin(), P.second.end());
1468 F->second.insert(P.second.begin(), P.second.end());
1469 P.second.clear();
1503 Register Rs = ExtI.second.Rs; // Only one reg allowed now.
1535 const ExtExpr &Ex = ExtI.second;
1751 const ExtExpr &Ex = ExtI.second; (void)Ex;
1835 const ExtExpr &DefEx = ExtI.second;
1874 unsigned J = P.second;
1898 const IndexList &Idxs = P.second;
1907 for (unsigned I : Q.second)
lib/Target/Hexagon/HexagonConstPropagation.cpp 222 return F->second;
615 dbgs() << " " << printReg(I.first, &TRI) << " -> " << I.second << '\n';
685 dbgs() << ' ' << I.second;
879 << printMBBReference(*MF.getBlockNumbered(Edge.second)) << '\n');
884 MachineBasicBlock *SB = MF.getBlockNumbered(Edge.second);
lib/Target/Hexagon/HexagonExpandCondsets.cpp 300 F->second |= Mask;
309 if (Mask & F->second)
431 if (P.first != nullptr || P.second)
475 if (P.second && Seg.end.isDead()) {
521 DefI->tieOperands(P.second, DefI->getNumOperands()-1);
1170 NewVN = F->second;
lib/Target/Hexagon/HexagonFrameLowering.cpp 1988 for (auto &DR : F->second)
2059 auto &IndexMap = P.first->second;
2148 IndexType LL = I.second;
2160 IndexType LS = I.second;
2174 if (P.second.RC != nullptr)
2175 dbgs() << HRI.getRegClassName(P.second.RC) << '\n';
2178 for (auto &R : P.second.Map)
2179 dbgs() << " " << printMBBReference(*R.first) << " { " << R.second
2196 auto F = P.second.Map.find(&B);
2198 if (F == P.second.Map.end() || F->second.empty())
2198 if (F == P.second.Map.end() || F->second.empty())
2200 HexagonBlockRanges::IndexRange &IR = F->second.front();
2210 auto &FIs = P.second;
2231 HexagonBlockRanges::InstrIndexMap &IM = F->second;
lib/Target/Hexagon/HexagonGenInsert.cpp 214 return F->second;
585 const IFListType &LL = I->second;
588 << PrintRegSet(LL[i].second, HRI) << '\n';
758 return F->second;
865 const RSListType &LL = I->second;
868 << LL[i].second << ')';
897 RSListType &LL = F->second;
899 uint16_t S = LL[i].second;
1041 IFListType &LL = I->second;
1043 findRemovableRegisters(I->first, LL[i].first, LL[i].second);
1053 if (I->second.empty())
1063 IFListType &LL = F->second;
1076 if (LL[i].second.empty())
1085 return IR.second.empty();
1131 const RegisterSet &RMi = LL[i].second;
1134 if (j != i && LL[j].second.includes(RMi))
1151 IFListType &LL = F->second;
1172 IFListType &LL = F->second;
1241 stats(A.second, SizeA, ZeroA, SumA);
1242 stats(B.second, SizeB, ZeroB, SumB);
1270 unsigned UC = F->second;
1290 const IFListType &LL = I->second;
1293 TT.insert(LL[i].second);
1327 IFListType &LL = I->second;
1379 const IFListType &LL = I->second;
1381 AllRMs.insert(LL[0].second);
1384 IFListType &LL = I->second;
1417 IFRecord IF = I->second[0].first;
1541 unsigned VR = I->first, Pos = I->second;
lib/Target/Hexagon/HexagonGenMux.cpp 256 if (F != CM.end() && F->second.PredR != PR) {
263 F->second.PredR = PR;
265 CondsetInfo &CI = F->second;
lib/Target/Hexagon/HexagonGenPredicate.cpp 251 return F->second;
lib/Target/Hexagon/HexagonHardwareLoops.cpp 499 Reg = F->second.first;
500 IVBump = F->second.second;
500 IVBump = F->second.second;
1757 const RegisterBump &RB = I->second;
1790 nonIndI->getOperand(2).getImm() == - RB.second) {
1812 int64_t V = RB.second;
lib/Target/Hexagon/HexagonISelDAGToDAG.cpp 207 MachineSDNode *Res = CurDAG->getMachineNode(FLC->second, dl, RTys,
342 FLI->second, dl, RTys,
400 MachineSDNode *Res = CurDAG->getMachineNode(FLI->second, DL, RTys, Ops);
435 MachineSDNode *Res = CurDAG->getMachineNode(FSI->second, DL, RTys, Ops);
lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp 139 return F != Colors.end() ? F->second : ColorKind::None;
209 Colors[N] = other(P.second);
217 auto P = getUniqueColor(E.second);
220 Colors[N] = other(P.second);
237 Colors[N] = other(P.second);
288 for (auto N : E.second)
308 dbgs() << " " << C.first << " -> " << ColorKindToName(C.second) << "\n";
1355 *F->second = nullptr;
1474 assert(F->second > 0);
1475 if (!--F->second)
1510 if (Strip.second != 1 && Strip.second != 2)
1510 if (Strip.second != 1 && Strip.second != 2)
1526 int NextInMask = SM.Mask[Strip.second];
1533 if (Strip.first == 0 && Strip.second == 1 && NextInMask == 4) {
1555 int L = Strip.second;
1567 if (S.second != unsigned(L))
1576 Res.Opc = Strip.second == 1 // Number of bytes.
1587 int L = Strip.second;
1592 if (S.second != PrevS.second)
1592 if (S.second != PrevS.second)
1606 Res.Opc = Strip.second == 1 // Number of bytes.
1642 if (Strip.second != 1 && Strip.second != 2)
1642 if (Strip.second != 1 && Strip.second != 2)
1646 int L = Strip.second;
1651 if (S.second != unsigned(L))
1659 if (S.first != -1 || S.second != unsigned(L))
1663 unsigned Opc = Strip.second == 1 ? Hexagon::V6_vunpackub
lib/Target/Hexagon/HexagonISelLowering.cpp 461 RegsToPass[i].second, Glue);
478 RegsToPass[i].second, Glue);
507 RegsToPass[i].second.getValueType()));
2022 return getInstr(Hexagon::S2_packhl, dl, VecTy, {P.second, P.first}, DAG);
2690 return DAG.getMergeValues({P.first, P.second}, dl);
2705 if (BaseOpc == HexagonISD::VALIGNADDR && BO.second % LoadLen == 0)
2708 if (BO.second % LoadLen != 0) {
2710 DAG.getConstant(BO.second % LoadLen, dl, MVT::i32));
2711 BO.second -= BO.second % LoadLen;
2711 BO.second -= BO.second % LoadLen;
2717 SDValue Base0 = DAG.getMemBasePlusOffset(BaseNoOff, BO.second, dl);
2718 SDValue Base1 = DAG.getMemBasePlusOffset(BaseNoOff, BO.second+LoadLen, dl);
lib/Target/Hexagon/HexagonISelLowering.h 380 Ops.second.getValueType().getSimpleVT() };
lib/Target/Hexagon/HexagonISelLoweringHVX.cpp 212 assert(Tys.first.getVectorElementType() == Tys.second.getVectorElementType());
216 Tys.second.getVectorNumElements());
255 Ops.second, Ops.first);
264 return DAG.SplitVector(Vec, dl, Tys.first, Tys.second);
1294 SDValue BS = getByteShuffle(dl, P.first, P.second, ShuffMask, DAG);
1352 SDValue BS = getByteShuffle(dl, P.first, P.second, ShuffMask, DAG);
1463 OpsH.push_back(P.second);
1510 SDValue Store1 = DAG.getStore(Chain, dl, Vals.second, Base1, MOp1);
lib/Target/Hexagon/HexagonInstrInfo.cpp 162 if (!Visited.insert(PB).second)
lib/Target/Hexagon/HexagonLoopIdiomRecognition.cpp 333 Instruction *U = cast<Instruction>(P.second);
337 U->setOperand(i, F->second);
343 Root = R->second;
1385 return H->second;
1416 Value *W = (F != ShiftMap.end()) ? F->second : nullptr;
lib/Target/Hexagon/HexagonMachineFunctionInfo.h 57 (PacketInfo.find(MI)->second & Hexagon::StartPacket));
61 (PacketInfo.find(MI)->second & Hexagon::EndPacket));
lib/Target/Hexagon/HexagonOptAddrMode.cpp 218 if (!P.second) {
270 auto phiUseSet = I.second;
lib/Target/Hexagon/HexagonPeephole.cpp 224 std::pair<unsigned,unsigned> PeepholeSrc = DI->second;
229 false /*isEarlyClobber*/, PeepholeSrc.second));
lib/Target/Hexagon/HexagonSelectionDAGInfo.cpp 62 return CallResult.second;
lib/Target/Hexagon/HexagonSplitDouble.cpp 147 const USet &Rs = I.second;
305 P2Rs[I.second].insert(I.first);
616 const UUPair &P = F->second;
617 R = (SubR == Hexagon::isub_lo) ? P.first : P.second;
650 const UUPair &P = F->second;
655 HighI = BuildMI(B, MI, DL, TII->get(Hexagon::L2_loadri_io), P.second)
659 const UUPair &P = F->second;
668 .addReg(P.second);
711 const UUPair &P = F->second;
723 BuildMI(B, MI, DL, TII->get(Hexagon::A2_tfrsi), P.second)
738 const UUPair &P = F->second;
741 BuildMI(B, MI, DL, TII->get(Hexagon::A2_tfrsi), P.second)
744 BuildMI(B, MI, DL, TII->get(TargetOpcode::COPY), P.second)
767 const UUPair &P = F->second;
772 BuildMI(B, MI, DL, TII->get(Hexagon::S2_asr_i_r), P.second)
791 const UUPair &P = F->second;
793 Register HiR = P.second;
916 const UUPair &P = F->second;
918 unsigned HiR = P.second;
1086 const UUPair &P = F->second;
1092 Op.setReg(P.second);
1115 const UUPair &Pr = F->second;
1120 .addReg(Pr.second)
1211 dump_partition(dbgs(), I->second, *TRI);
1224 USet &Part = I->second;
lib/Target/Hexagon/HexagonSubtarget.cpp 105 HexagonArchVersion = FoundIt->second;
lib/Target/Hexagon/HexagonTargetTransformInfo.cpp 245 if (LT.second.isFloatingPoint())
lib/Target/Hexagon/HexagonVExtract.cpp 121 if (P.second.size() <= VExtractThreshold)
140 for (MachineInstr *ExtI : P.second) {
lib/Target/Hexagon/HexagonVLIWPacketizer.cpp 665 SUnit *PacketSU = MIToSUnit.find(I)->second;
751 SUnit *TempSU = MIToSUnit.find(I)->second;
913 SUnit *PacketSUDep = MIToSUnit.find(&MI)->second;
921 SUnit *PacketSU = MIToSUnit.find(I)->second;
987 SUnit *PacketSU = MIToSUnit.find(I)->second;
lib/Target/Hexagon/MCTargetDesc/HexagonMCChecker.cpp 611 P.second = !P.second;
611 P.second = !P.second;
lib/Target/Hexagon/MCTargetDesc/HexagonMCCodeEmitter.cpp 507 return Hexagon::Fixups(F->second);
543 return Hexagon::Fixups(F->second);
550 return Hexagon::Fixups(F->second);
699 FixupKind = FindVK->second[FixupWidth];
lib/Target/Hexagon/MCTargetDesc/HexagonMCDuplexInfo.cpp 605 subinstOpcodeMap.find(SubInst0.getOpcode())->second;
607 subinstOpcodeMap.find(SubInst1.getOpcode())->second;
lib/Target/Hexagon/MCTargetDesc/HexagonMCELFStreamer.cpp 122 SwitchSection(P.first, P.second);
lib/Target/Hexagon/MCTargetDesc/HexagonMCTargetDesc.cpp 158 if (!Duplex.second.empty()) {
160 InstTxt = Duplex.second;
166 HeadTail = HeadTail.second.split('\n');
170 OS << "\n\t} :mem_noshuf" << PacketBundle.second;
172 OS << "\t}" << PacketBundle.second;
329 Result.second = selectHexagonFS(Result.first, FS);
389 StringRef ArchFS = Features.second;
419 return F->second;
lib/Target/Hexagon/MCTargetDesc/HexagonShuffler.cpp 154 setLanes((*TUL)[T].second);
674 SM->PrintMessage(I.first, SourceMgr::DK_Note, I.second);
lib/Target/Hexagon/RDFCopy.cpp 111 << Print<RegisterRef>(J.second, DFG);
143 EqualityMap &EM = FS->second;
149 RegisterRef SR = FR->second;
200 auto &M = FC->second;
202 if (J.second != DR)
204 J.second = SR;
lib/Target/Hexagon/RDFGraph.cpp 1001 I->second.start_block(B);
1010 I->second.clear_block(B);
1016 if (I->second.empty())
1104 if (!Defined.insert(RR.Reg).second) {
1224 if (Loc.second.Id != 0 || !Create)
1225 return Loc.second;
1243 return locateNextRef(IA, RA, IsShadow).second;
1391 if (DFLoc == MDF.end() || DFLoc->second.empty())
1405 const MachineDominanceFrontier::DomSetType &DF = DFLoc->second;
1410 IDF.insert(F->second.begin(), F->second.end());
1410 IDF.insert(F->second.begin(), F->second.end());
1428 if (HasDF == PhiM.end() || HasDF->second.empty())
1443 for (RegisterRef I : HasDF->second)
1444 MaxDF.insert(MaxCoverIn(I, HasDF->second));
1631 DefStack &DS = F->second;
lib/Target/Hexagon/RDFLiveness.cpp 64 for (auto J = I.second.begin(), E = I.second.end(); J != E; ) {
64 for (auto J = I.second.begin(), E = I.second.end(); J != E; ) {
65 OS << Print<NodeId>(J->first, P.G) << PrintLaneMaskOpt(J->second);
311 if (!T.second)
516 NodeRefSet Uses = UI->second;
517 UI->second.clear();
522 RegisterRef R(UI->first, I.second);
534 UI->second.insert({I.first, S.Mask});
537 UI = UI->second.empty() ? RealUses.erase(UI) : std::next(UI);
571 F->second.insert(DefRRs);
585 for (auto R : I.second)
587 << Print<RegisterAggr>(R.second, DFG);
625 const RegisterAggr &MidDefs = P.second;
648 for (std::pair<NodeId,LaneBitmask> V : T.second) {
649 LaneBitmask M = R.Mask & V.second;
654 Changed |= RS.insert({V.first,SS.Mask}).second;
677 dbgs() << " -> " << Print<RefMap>(I.second, DFG) << '\n';
703 SetVector<MachineBasicBlock*> IDFB(F1->second.begin(), F1->second.end());
703 SetVector<MachineBasicBlock*> IDFB(F1->second.begin(), F1->second.end());
707 IDFB.insert(F2->second.begin(), F2->second.end());
707 IDFB.insert(F2->second.begin(), F2->second.end());
715 for (auto S : I.second)
729 LON[S.first].insert(S.second.begin(), S.second.end());
729 LON[S.first].insert(S.second.begin(), S.second.end());
736 << Print<RefMap>(I.second, DFG) << '\n';
751 if (!SeenUses.insert(U.Id).second)
773 for (std::pair<NodeId,LaneBitmask> P : RS.second) {
777 RegisterRef S(RS.first, P.second);
799 << Print<RefMap>(I.second, DFG) << '\n';
924 return F->second;
960 LiveIn[S.first].insert(S.second.begin(), S.second.end());
960 LiveIn[S.first].insert(S.second.begin(), S.second.end());
976 LiveIn[S.first].insert(S.second.begin(), S.second.end());
976 LiveIn[S.first].insert(S.second.begin(), S.second.end());
997 const NodeRefSet &OldDefs = LE.second;
1016 LRef.Mask = OR.second;
1095 for (auto P : R.second)
1096 M |= P.second;
1109 for (auto R : S.second)
1111 LiveC.insert(RegisterRef(S.first, R.second));
1117 I = I->second.empty() ? M.erase(I) : std::next(I);
lib/Target/Hexagon/RDFLiveness.h 41 return Map.emplace(B, Empty).first->second;
88 return F == RealUseMap.end() ? Empty : F->second;
lib/Target/Hexagon/RDFRegisters.cpp 63 if (P.second.any()) {
64 UI.Mask = P.second;
141 if (PA.second.any() && (PA.second & RA.Mask).none()) {
141 if (PA.second.any() && (PA.second & RA.Mask).none()) {
147 if (PB.second.any() && (PB.second & RB.Mask).none()) {
147 if (PB.second.any() && (PB.second & RB.Mask).none()) {
246 if (P.second.none() || (P.second & RR.Mask).any())
246 if (P.second.none() || (P.second & RR.Mask).any())
261 if (P.second.none() || (P.second & RR.Mask).any())
261 if (P.second.none() || (P.second & RR.Mask).any())
276 if (P.second.none() || (P.second & RR.Mask).any())
276 if (P.second.none() || (P.second & RR.Mask).any())
359 M |= P.second.none() ? LaneBitmask::getAll() : P.second;
359 M |= P.second.none() ? LaneBitmask::getAll() : P.second;
lib/Target/Hexagon/RDFRegisters.h 197 return RegisterRef(Pos->first, Pos->second);
lib/Target/Lanai/LanaiISelLowering.cpp 716 RegsToPass[I].second, InFlag);
749 RegsToPass[I].second.getValueType()));
lib/Target/MSP430/MSP430ISelLowering.cpp 876 RegsToPass[i].second, InFlag);
898 RegsToPass[i].second.getValueType()));
lib/Target/Mips/AsmParser/MipsAsmParser.cpp 8536 return MnemonicRange.first != MnemonicRange.second;
lib/Target/Mips/MicroMipsSizeReduction.cpp 428 if (Range.first == Range.second)
432 Entry != Range.second; ++Entry) {
lib/Target/Mips/Mips16ISelDAGToDAG.cpp 204 ReplaceUses(SDValue(Node, 1), SDValue(LoHi.second, 0));
214 ReplaceNode(Node, LoHi.second);
lib/Target/Mips/MipsAsmPrinter.cpp 89 const Mips16HardFloatInfo::FuncSignature *Signature = it->second;
1128 const Mips16HardFloatInfo::FuncSignature *Signature = it->second;
lib/Target/Mips/MipsBranchExpansion.cpp 751 LastInstInFunction |= Res.second;
lib/Target/Mips/MipsDelaySlotFiller.cpp 316 if (I->second) {
317 MIBundleBuilder(I->second).append(MF->CloneMachineInstr(&*Filler));
516 return !Defs.insert(V).second || Uses.count(V) || SeenNoObjStore ||
904 BrMap[&Pred] = P.second;
lib/Target/Mips/MipsFastISel.cpp 348 .addFrameIndex(SI->second)
536 Addr.setFI(SI->second);
lib/Target/Mips/MipsISelLowering.cpp 2935 RegsToPass[i].second, InFlag);
2943 RegsToPass[i].second.getValueType()));
3890 if (R.second)
3900 if (R.second)
3921 if (!R.second)
4012 if (R.second)
lib/Target/Mips/MipsOptimizePICCall.cpp 308 unsigned Reg = ScopedHT.lookup(Entry).second;
lib/Target/Mips/MipsSEFrameLowering.cpp 251 return expandCopyACC(MBB, I, Opcodes.first, Opcodes.second);
lib/Target/NVPTX/NVPTXAsmPrinter.cpp 125 if (!Visiting.insert(GV).second)
586 const DenseMap<unsigned, unsigned> &RegMap = I->second;
590 unsigned MappedVR = VI->second;
lib/Target/NVPTX/NVPTXPrologEpilogPass.cpp 191 int64_t FIOffset = (StackGrowsDown ? -Offset : Offset) + Entry.second;
lib/Target/NVPTX/NVPTXTargetTransformInfo.cpp 134 if (LT.second.SimpleTy == MVT::i64)
lib/Target/PowerPC/PPCAsmPrinter.cpp 1428 OutStreamer->SwitchSection(Current.first, Current.second);
1452 MCSymbol *const TOCEntryLabel = TOCMapPair.second;
1691 MachineModuleInfoImpl::StubValueTy &MCSym = Stubs[i].second;
1806 OutStreamer->SwitchSection(Current.first, Current.second);
lib/Target/PowerPC/PPCBoolRetToInt.cpp 85 if (Defs.insert(Op).second)
253 auto *Second = dyn_cast<User>(Pair.second);
lib/Target/PowerPC/PPCBranchSelector.cpp 131 BS.second = AlignExtra;
159 BS.first -= BS.second;
160 Offset -= BS.second;
165 BS.second = AlignExtra;
lib/Target/PowerPC/PPCExpandISEL.cpp 174 for (const auto &VI : I.second)
199 BlockISELList &CurrentISELList = BlockList.second;
lib/Target/PowerPC/PPCFastISel.cpp 396 Addr.Base.FI = SI->second;
2278 ResultReg).addFrameIndex(SI->second).addImm(0);
lib/Target/PowerPC/PPCISelDAGToDAG.cpp 1219 return std::make_pair(ValueEntry->first, &ValueEntry->second);
1222 SmallVector<ValueBit, 64> &Bits = ValueEntry->second;
1231 const auto &LHSBits = *getValueBits(V.getOperand(0), NumBits).second;
1243 const auto &LHSBits = *getValueBits(V.getOperand(0), NumBits).second;
1258 const auto &LHSBits = *getValueBits(V.getOperand(0), NumBits).second;
1296 const auto &LHSBits = *getValueBits(V.getOperand(0), NumBits).second;
1297 const auto &RHSBits = *getValueBits(V.getOperand(1), NumBits).second;
1546 ValueRotsVec.push_back(I.second);
2411 Bits = std::move(*Result.second);
lib/Target/PowerPC/PPCISelLowering.cpp 3177 return CallResult.second;
5134 RegsToPass[i].second.getValueType()));
5621 RegsToPass[i].second, InFlag);
6312 RegsToPass[i].second, InFlag);
6693 RegsToPass[i].second, InFlag);
6862 Chain = DAG.getCopyToReg(Chain, dl, Reg.first, Reg.second, InFlag);
11887 if (!Visited.insert(ChainNext).second)
11918 if (!Visited.insert(LoadRoot).second)
12124 if (!Visited.insert(BinOp.getNode()).second)
12340 if (!Visited.insert(BinOp.getNode()).second)
12546 Ops[0] = DAG.getNode(ISD::TRUNCATE, dl, SI0->second, Ops[0]);
12549 Ops[1] = DAG.getNode(ISD::TRUNCATE, dl, SI1->second, Ops[1]);
14382 if (!R.second && StringRef("{cc}").equals_lower(Constraint)) {
14384 R.second = &PPC::CRRCRegClass;
lib/Target/PowerPC/PPCInstrInfo.cpp 1999 PredsToUpdate[i].first->setImm(PredsToUpdate[i].second);
2002 SubRegsToUpdate[i].first->setSubReg(SubRegsToUpdate[i].second);
lib/Target/PowerPC/PPCMIPeephole.cpp 238 TOCSave.second = false;
249 if (It->second && MDT->dominates(MI, CurrInst))
250 It->second = false;
1038 if (!TOCSave.second) {
lib/Target/PowerPC/PPCMachineFunctionInfo.cpp 49 return LiveIn.second.isSExt();
56 return LiveIn.second.isZExt();
lib/Target/PowerPC/PPCReduceCRLogicals.cpp 448 TrueDefs.second->dump();
454 if (CopyDefs.second) {
456 CopyDefs.second->dump();
482 Ret.CopyDefs.second);
486 MRI->hasOneNonDBGUse(Ret.CopyDefs.second->getOperand(0).getReg());
491 Ret.CopyDefs.second = nullptr;
517 (MIParam.getParent() == Ret.TrueDefs.second->getParent());
613 if (CRI.CopyDefs.first == CRI.CopyDefs.second) {
618 if (CRI.TrueDefs.first->isCopy() || CRI.TrueDefs.second->isCopy() ||
619 CRI.TrueDefs.first->isPHI() || CRI.TrueDefs.second->isPHI()) {
639 MachineBasicBlock::iterator Def2It = CRI.TrueDefs.second;
666 UsingDef1 ? CRI.TrueDefs.first : CRI.TrueDefs.second;
668 UsingDef1 ? CRI.CopyDefs.first : CRI.CopyDefs.second;
685 UsingDef1 ? CRI.CopyDefs.second : CRI.CopyDefs.first;
693 UsingDef1 ? CRI.CopyDefs.first : CRI.CopyDefs.second };
701 CRI.TrueDefs.second && isCRLogical(*CRI.TrueDefs.second);
701 CRI.TrueDefs.second && isCRLogical(*CRI.TrueDefs.second);
705 AllCRLogicalOps.push_back(createCRLogicalOpInfo(*CRI.TrueDefs.second));
lib/Target/PowerPC/PPCRegisterInfo.cpp 1123 unsigned NewOpcode = ImmToIdxMap.find(OpC)->second;
lib/Target/PowerPC/PPCRegisterInfo.h 70 return ImmToIdxMap.find(ImmOpcode)->second;
lib/Target/PowerPC/PPCTargetTransformInfo.cpp 707 if (LT1.first != 1 || !LT1.second.isVector())
711 if (TLI->isOperationExpand(ISD, LT1.second))
716 if (LT2.first != 1 || !LT2.second.isVector())
848 (LT.second == MVT::v16i8 || LT.second == MVT::v8i16 ||
848 (LT.second == MVT::v16i8 || LT.second == MVT::v8i16 ||
849 LT.second == MVT::v4i32 || LT.second == MVT::v4f32);
849 LT.second == MVT::v4i32 || LT.second == MVT::v4f32);
851 (LT.second == MVT::v2f64 || LT.second == MVT::v2i64);
851 (LT.second == MVT::v2f64 || LT.second == MVT::v2i64);
853 (LT.second == MVT::v4f64 || LT.second == MVT::v4f32);
853 (LT.second == MVT::v4f64 || LT.second == MVT::v4f32);
865 unsigned SrcBytes = LT.second.getStoreSize();
878 Alignment >= LT.second.getScalarType().getStoreSize())
889 if (TLI->allowsMisalignedMemoryAccesses(LT.second, 0))
lib/Target/RISCV/RISCVISelLowering.cpp 2254 Chain = DAG.getCopyToReg(Chain, DL, Reg.first, Reg.second, Glue);
2297 Ops.push_back(DAG.getRegister(Reg.first, Reg.second.getValueType()));
2661 ? std::make_pair(FReg.second, &RISCV::FPR64RegClass)
lib/Target/Sparc/SparcISelLowering.cpp 935 Chain = DAG.getCopyToReg(Chain, dl, Reg, RegsToPass[i].second, InFlag);
959 RegsToPass[i].second.getValueType()));
1238 RegsToPass[i].first, RegsToPass[i].second, InGlue);
1259 RegsToPass[i].second.getValueType()));
2192 Chain = CallInfo.second;
lib/Target/SystemZ/AsmParser/SystemZAsmParser.cpp 1043 if (EntryRange.first == EntryRange.second)
lib/Target/SystemZ/SystemZISelLowering.cpp 1575 RegsToPass[I].second, Glue);
1588 RegsToPass[I].second.getValueType()));
6603 FalseReg = RegRewriteTable[FalseReg].second;
lib/Target/SystemZ/SystemZMachineScheduler.cpp 141 SystemZHazardRecognizer *hazrec = I.second;
lib/Target/SystemZ/SystemZRegisterInfo.cpp 96 if (!DoneRegs.insert(Reg).second)
lib/Target/SystemZ/SystemZTDC.cpp 352 std::tie(V, Mask, Worthy) = It.second;
lib/Target/WebAssembly/AsmParser/WebAssemblyAsmParser.cpp 257 nestingString(Top).second + ", instead got: " + Ins);
lib/Target/WebAssembly/MCTargetDesc/WebAssemblyInstPrinter.cpp 169 if (!Printed.insert(Depth).second)
176 (Pair.second ? "up" : "down") + " to label" +
lib/Target/WebAssembly/MCTargetDesc/WebAssemblyTargetStreamer.cpp 107 ++Grouped.back().second;
112 Streamer.EmitULEB128IntValue(Pair.second);
lib/Target/WebAssembly/WebAssemblyAddMissingPrototypes.cpp 134 Function *NewF = Pair.second;
lib/Target/WebAssembly/WebAssemblyAsmPrinter.cpp 177 if (SeenLanguages.insert(Language).second)
189 StringRef Version = Field.second.trim();
190 if (SeenTools.insert(Name).second)
204 if (Producers.second->empty())
208 OutStreamer->EmitULEB128IntValue(Producers.second->size());
209 for (auto &Producer : *Producers.second) {
212 OutStreamer->EmitULEB128IntValue(Producer.second.size());
213 OutStreamer->EmitBytes(Producer.second);
lib/Target/WebAssembly/WebAssemblyCFGStackify.cpp 999 NumUnwindMismatches += P.second.size();
1105 auto &TryRanges = P.second;
lib/Target/WebAssembly/WebAssemblyExceptionInfo.cpp 120 for (auto &Frontier : MDF.find(SubE->getEHPad())->second)
lib/Target/WebAssembly/WebAssemblyExplicitLocals.cpp 76 if (P.second)
78 return P.first->second;
374 if (RL == Reg2Local.end() || RL->second < MFI.getParams().size())
377 MFI.setLocal(RL->second - MFI.getParams().size(),
lib/Target/WebAssembly/WebAssemblyFastISel.cpp 327 Addr.setFI(SI->second);
608 .addFrameIndex(SI->second);
lib/Target/WebAssembly/WebAssemblyFixFunctionBitcasts.cpp 87 if (!C.second)
278 Function *F = UseFunc.second;
289 if (Pair.second)
290 Pair.first->second = createWrapper(F, Ty);
292 Function *Wrapper = Pair.first->second;
lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp 94 return I->second.count(To);
109 return I->second;
148 if (Reachable[Pred].insert(Succ).second) {
211 if (Blocks.insert(MBB).second) {
370 assert(Pair.second);
373 Pair.first->second = Index;
lib/Target/WebAssembly/WebAssemblyLowerGlobalDtors.cpp 134 for (auto &AssociatedAndMore : PriorityAndMore.second) {
149 for (auto Dtor : AssociatedAndMore.second)
lib/Target/WebAssembly/WebAssemblyRuntimeLibcallSignatures.cpp 501 RuntimeLibcallSignatures->Table[NameLibcall.second] != unsupported) {
504 Map[NameLibcall.first] = NameLibcall.second;
lib/Target/X86/AsmParser/X86AsmParser.cpp 155 return Op.second;
240 OperandStack.push_back(std::make_pair(IC_IMM, -Operand.second));
243 OperandStack.push_back(std::make_pair(IC_IMM, ~Operand.second));
256 Val = Op1.second + Op2.second;
256 Val = Op1.second + Op2.second;
260 Val = Op1.second - Op2.second;
260 Val = Op1.second - Op2.second;
266 Val = Op1.second * Op2.second;
266 Val = Op1.second * Op2.second;
272 assert (Op2.second != 0 && "Division by zero!");
273 Val = Op1.second / Op2.second;
273 Val = Op1.second / Op2.second;
279 Val = Op1.second % Op2.second;
279 Val = Op1.second % Op2.second;
285 Val = Op1.second | Op2.second;
285 Val = Op1.second | Op2.second;
291 Val = Op1.second ^ Op2.second;
291 Val = Op1.second ^ Op2.second;
297 Val = Op1.second & Op2.second;
297 Val = Op1.second & Op2.second;
303 Val = Op1.second << Op2.second;
303 Val = Op1.second << Op2.second;
309 Val = Op1.second >> Op2.second;
309 Val = Op1.second >> Op2.second;
316 return OperandStack.pop_back_val().second;
1343 Warning(WarningMsg.first, WarningMsg.second);
1726 if (SemaCallback->LookupInlineAsmField(BaseMember.first, BaseMember.second,
lib/Target/X86/MCTargetDesc/X86WinCOFFTargetStreamer.cpp 357 unsigned FrameFuncStrTabOff = CVCtx.addToStringTable(FuncOS.str()).second;
395 const FPOData *FPO = I->second.get();
lib/Target/X86/X86AsmPrinter.cpp 672 emitNonLazySymbolPointer(OutStreamer, Stub.first, Stub.second);
lib/Target/X86/X86AvoidStoreForwardingBlocks.cpp 589 Size2 = DispSizePair.second;
655 unsigned CurrSize = DispSizePair.second;
658 unsigned PrevSize = DispSizeStack.back().second;
718 MachineInstr *StoreInst = LoadStoreInstPair.second;
lib/Target/X86/X86CmovConversion.cpp 720 FalseReg = FRIt->second;
788 MOp.setReg(It->second);
825 Op1Reg = Op1Itr->second.first;
829 Op2Reg = Op2Itr->second.second;
829 Op2Reg = Op2Itr->second.second;
lib/Target/X86/X86DiscriminateMemOps.cpp 142 if (!TryInsert.second || !HasDebug) {
169 assert(MustInsert.second && "New discriminator shouldn't be present in set");
lib/Target/X86/X86DomainReassignment.cpp 336 return Edges.insert(Reg).second;
459 if (I->second != C.getID())
lib/Target/X86/X86ExpandPseudo.cpp 171 .add(JTInst->getOperand(3 + 2 * P.second));
lib/Target/X86/X86FastISel.cpp 765 if (I != LocalValueMap.end() && I->second != 0) {
766 LoadReg = I->second;
879 AM.Base.FrameIndex = SI->second;
lib/Target/X86/X86FixupBWInsts.cpp 441 MachineInstr *NewMI = MIReplacements.back().second;
lib/Target/X86/X86FlagsCopyLowering.cpp 447 if (!Visited.insert(PredMBB).second)
646 VisitedBlocks.insert(SuccMBB).second) {
lib/Target/X86/X86FloatingPoint.cpp 379 if (Processed.insert(&BB).second)
lib/Target/X86/X86FrameLowering.cpp 1865 return alignTo(MFI.getMaxCallFrameSize(), getStackAlignment()) + it->second;
lib/Target/X86/X86ISelDAGToDAG.cpp 1324 CurDAG->setRoot(Result.second);
lib/Target/X86/X86ISelLowering.cpp 2589 Chain = DAG.getCopyToReg(Chain, dl, Reg.first, Reg.second, Flag);
2591 RetOps.push_back(DAG.getRegister(Reg.first, Reg.second.getValueType()));
3989 RegsToPass[i].second, InFlag);
4033 RegsToPass[i].second.getValueType()));
11322 Range1.second = std::max(Range1.second, M);
11322 Range1.second = std::max(Range1.second, M);
11329 Range2.second = std::max(Range2.second, M);
11329 Range2.second = std::max(Range2.second, M);
11337 if (!(0 <= Range1.first && Range1.second < NumEltsPerLane) ||
11338 !(0 <= Range2.first && Range2.second < NumEltsPerLane))
11367 if (Range2.second < Range1.first)
11369 if (Range1.second < Range2.first)
13473 (M1 < 0 || isUndefOrEqual(DWordPair.second, M1))) {
13475 DWordPair.second = (M1 >= 0 ? M1 : DWordPair.second);
13475 DWordPair.second = (M1 >= 0 ? M1 : DWordPair.second);
13489 int PSHUFHalfMask[4] = {DWordPairs[0].first, DWordPairs[0].second,
13490 DWordPairs[1].first, DWordPairs[1].second};
19942 if (M->second[CIdx])
19944 M->second.setBit(CIdx);
19951 if (!I->second.isAllOnesValue())
29698 Op2Reg = RegRewriteTable[Op2Reg].second;
31105 if (SeenMBBs.insert(LP).second)
45976 if (!Res.second) {
46012 (isFRClass(*Res.second) || isGRClass(*Res.second)) &&
46012 (isFRClass(*Res.second) || isGRClass(*Res.second)) &&
46019 if (!Subtarget.hasAVX512() && isFRClass(*Res.second) &&
46029 if (TRI->isTypeLegalForClass(*Res.second, VT) || VT == MVT::Other)
46035 const TargetRegisterClass *Class = Res.second;
46088 Res.second = &X86::FR32XRegClass;
46090 Res.second = &X86::FR64XRegClass;
46092 Res.second = &X86::VR128XRegClass;
46094 Res.second = &X86::VR256XRegClass;
46096 Res.second = &X86::VR512RegClass;
46100 Res.second = nullptr;
46104 Res.second = &X86::VK1RegClass;
46106 Res.second = &X86::VK8RegClass;
46108 Res.second = &X86::VK16RegClass;
46110 Res.second = &X86::VK32RegClass;
46112 Res.second = &X86::VK64RegClass;
46116 Res.second = nullptr;
lib/Target/X86/X86InsertPrefetch.cpp 133 IID = HintType.second;
lib/Target/X86/X86InstrInfo.cpp 3824 .setImm(Op.second);
lib/Target/X86/X86OptimizeLEAs.cpp 494 MachineBasicBlock *MBB = (*LEAs.begin()->second.begin())->getParent();
523 if (!chooseBestLEA(Insns->second, MI, DefMI, AddrDispShift, Dist))
593 auto &List = E.second;
lib/Target/X86/X86PadShortFunction.cpp 119 unsigned Cycles = I->second;
174 VisitedBBInfo BBInfo = it->second;
lib/Target/X86/X86SelectionDAGInfo.cpp 96 return CallResult.second;
lib/Target/X86/X86SpeculativeLoadHardening.cpp 340 if (!Preds.insert(MI.getOperand(OpIdx + 1).getMBB()).second)
2012 Op->setReg(It->second);
lib/Target/X86/X86TargetTransformInfo.cpp 193 LT.second))
221 if (Args.size() == 2 && ISD == ISD::MUL && LT.second == MVT::v4i32) {
242 LT.second)) {
298 LT.second))
311 LT.second))
326 LT.second))
344 CostTableLookup(SSE2UniformConstCostTable, ISD, LT.second))
363 CostTableLookup(AVX512BWConstCostTable, ISD, LT.second))
378 CostTableLookup(AVX512ConstCostTable, ISD, LT.second))
400 if (const auto *Entry = CostTableLookup(AVX2ConstCostTable, ISD, LT.second))
435 if (ISD == ISD::SDIV && LT.second == MVT::v8i32 && ST->hasAVX())
437 if (ISD == ISD::SREM && LT.second == MVT::v8i32 && ST->hasAVX())
439 if (ISD == ISD::SDIV && LT.second == MVT::v4i32 && ST->hasSSE41())
441 if (ISD == ISD::SREM && LT.second == MVT::v4i32 && ST->hasSSE41())
444 if (const auto *Entry = CostTableLookup(SSE2ConstCostTable, ISD, LT.second))
459 CostTableLookup(AVX2UniformCostTable, ISD, LT.second))
481 CostTableLookup(SSE2UniformCostTable, ISD, LT.second))
493 if (const auto *Entry = CostTableLookup(AVX512DQCostTable, ISD, LT.second))
520 if (const auto *Entry = CostTableLookup(AVX512BWCostTable, ISD, LT.second))
552 if (const auto *Entry = CostTableLookup(AVX512CostTable, ISD, LT.second))
572 if (ISD == ISD::SHL && LT.second == MVT::v16i16 &&
581 if (const auto *Entry = CostTableLookup(AVX2ShiftCostTable, ISD, LT.second))
624 CostTableLookup(XOPShiftCostTable, ShiftISD, LT.second))
649 if (ISD == ISD::SRA && LT.second == MVT::v4i64 && ST->hasAVX2())
653 CostTableLookup(SSE2UniformShiftCostTable, ISD, LT.second))
659 MVT VT = LT.second;
711 if (const auto *Entry = CostTableLookup(AVX2CostTable, ISD, LT.second))
747 if (const auto *Entry = CostTableLookup(AVX1CostTable, ISD, LT.second))
773 if (const auto *Entry = CostTableLookup(SSE42CostTable, ISD, LT.second))
802 if (const auto *Entry = CostTableLookup(SSE41CostTable, ISD, LT.second))
844 if (const auto *Entry = CostTableLookup(SSE2CostTable, ISD, LT.second))
867 if (const auto *Entry = CostTableLookup(SSE1CostTable, ISD, LT.second))
876 if (LT.second.isVector() && (ISD == ISD::SDIV || ISD == ISD::SREM ||
881 return 20 * LT.first * LT.second.getVectorNumElements() * ScalarCost;
906 if (Kind == TTI::SK_ExtractSubvector && LT.second.isVector()) {
907 int NumElts = LT.second.getVectorNumElements();
911 if (SubLT.second.isVector()) {
912 int NumSubElts = SubLT.second.getVectorNumElements();
924 LT.second.getVectorElementType() ==
925 SubLT.second.getVectorElementType() &&
926 LT.second.getVectorElementType().getSizeInBits() ==
931 LT.second.getVectorNumElements());
933 SubLT.second.getVectorNumElements());
955 MVT LegalVT = LT.second;
1001 CostTableLookup(AVX512VBMIShuffleTbl, Kind, LT.second))
1028 CostTableLookup(AVX512BWShuffleTbl, Kind, LT.second))
1071 if (const auto *Entry = CostTableLookup(AVX512ShuffleTbl, Kind, LT.second))
1112 if (const auto *Entry = CostTableLookup(AVX2ShuffleTbl, Kind, LT.second))
1134 if (const auto *Entry = CostTableLookup(XOPShuffleTbl, Kind, LT.second))
1181 if (const auto *Entry = CostTableLookup(AVX1ShuffleTbl, Kind, LT.second))
1194 if (const auto *Entry = CostTableLookup(SSE41ShuffleTbl, Kind, LT.second))
1215 if (const auto *Entry = CostTableLookup(SSSE3ShuffleTbl, Kind, LT.second))
1254 if (const auto *Entry = CostTableLookup(SSE2ShuffleTbl, Kind, LT.second))
1266 if (const auto *Entry = CostTableLookup(SSE1ShuffleTbl, Kind, LT.second))
1632 LTDest.second, LTSrc.second))
1632 LTDest.second, LTSrc.second))
1699 MVT MTy = LT.second;
2199 MVT MTy = LT.second;
2354 MVT MTy = LT.second;
2386 if (!LT.second.isVector())
2390 unsigned Width = LT.second.getVectorNumElements();
2445 if (LT.second.getStoreSize() == 32 && ST->isUnalignedMem32Slow())
2486 if (VT.isSimple() && LT.second != VT.getSimpleVT() &&
2487 LT.second.getVectorNumElements() == NumElem)
2492 else if (LT.second.getVectorNumElements() > NumElem) {
2494 LT.second.getVectorNumElements());
2618 MVT MTy = LT.second;
2687 MVT MTy = LT.second;
3503 MVT LegalVT = getTLI()->getTypeLegalizationCost(DL, VecTy).second;
3616 MVT LegalVT = getTLI()->getTypeLegalizationCost(DL, VecTy).second;
lib/Target/X86/X86WinAllocaExpander.cpp 298 lower(P.first, P.second);
lib/Target/X86/X86WinEHState.cpp 527 BaseState = BaseStateI->second;
573 int PredState = PredEndState->second;
609 int SuccState = SuccStartState->second;
759 if (EndState->second != PrevState)
760 insertStateNumberStore(BB->getTerminator(), EndState->second);
lib/Target/XCore/XCoreFrameLowering.cpp 318 const CalleeSavedInfo &CSI = SpillLabel.second;
lib/Target/XCore/XCoreISelLowering.cpp 481 SDValue Ops[] = { CallResult.first, CallResult.second };
535 return CallResult.second;
1086 unsigned index = ResultMemLocs[i].second;
1188 RegsToPass[i].second, InFlag);
1213 RegsToPass[i].second.getValueType()));
lib/Target/XCore/XCoreSelectionDAGInfo.cpp 45 return CallResult.second;
lib/Testing/Support/Annotations.cpp 49 R.Begin = OpenRanges.back().second;
lib/TextAPI/MachO/InterfaceFile.cpp 66 Iter->second = Parent;
80 Iter->second = UUID;
115 if (result.second)
116 result.first->second = new (Allocator) Symbol{Kind, Name, Targets, Flags};
119 result.first->second->addTarget(Target);
lib/TextAPI/MachO/Target.cpp 24 auto PlatformStr = Result.second;
lib/TextAPI/MachO/TextStub.cpp 454 ParentUmbrella = Iter.second;
485 if (SymArch.second != Architectures)
545 if (SymArch.second != Architectures)
621 File->addUUID(ID.first, ID.second);
811 UUIDs.emplace_back(IT.first, IT.second);
830 valueToTargetList[it.second].emplace_back(it.first);
835 it.second.begin(), it.second.end());
835 it.second.begin(), it.second.end());
863 if (IT.second != TargetIDs)
1009 if (it.second != targets)
lib/TextAPI/MachO/TextStubCommon.cpp 207 OS << Value.first << ": " << Value.second;
212 auto UUID = Split.second.trim();
215 Value.second = UUID;
lib/ToolDrivers/llvm-lib/LibDriver.cpp 338 if (!Seen.insert(Path).second)
lib/Transforms/AggressiveInstCombine/TruncInstCombine.cpp 303 TruncInstCombine::Info &NodeInfo = Itr.second;
lib/Transforms/Coroutines/CoroFrame.cpp 766 auto *G = GetFramePointer(P.second, A);
786 auto *G = GetFramePointer(P.second, A);
1025 if (!VisitedOrFreeBBs.insert(From).second)
lib/Transforms/Coroutines/CoroSplit.cpp 898 V = VI->second;
928 V = it->second;
lib/Transforms/IPO/ArgumentPromotion.cpp 200 ArgIndex.second));
205 if (ArgIndices.size() == 1 && ArgIndices.begin()->second.empty())
282 OriginalLoads[std::make_pair(&*I, ArgIndex.second)];
283 if (!ArgIndex.second.empty()) {
284 Ops.reserve(ArgIndex.second.size());
286 for (auto II : ArgIndex.second) {
430 assert(ArgIndices.begin()->second.empty() &&
451 It->second != Operands; ++It, ++TheArg) {
829 if (PtrValues.insert(V).second)
lib/Transforms/IPO/Attributor.cpp 181 if (!Visited.insert(V).second)
1071 if (!Pred(*RV, It.second))
1131 << " by #" << It.second.size() << " RIs\n");
1203 RVState RVS({NewRVsMap, Unused, RetValAAIt.second});
1212 NewRVsMap[RetVal].insert(It.second.begin(), It.second.end());
1212 NewRVsMap[RetVal].insert(It.second.begin(), It.second.end());
1221 assert(!It.second.empty() && "Entry does not add anything.");
1223 for (ReturnInst *RI : It.second)
2282 if (!AssumedLiveBlocks.insert(&BB).second)
3644 if (!Visited.insert(U).second)
4532 if (!Visited.insert(ChangedAA).second)
4713 if (!VisitedFunctions.insert(&F).second)
lib/Transforms/IPO/BlockExtractor.cpp 182 for (const auto &BBInfo : BInfo.second) {
lib/Transforms/IPO/ConstantMerge.cpp 219 GlobalVariable *Slot = Found->second;
237 GlobalVariable *New = SameContentReplacements[i].second;
lib/Transforms/IPO/DeadArgumentElimination.cpp 245 NF->addMetadata(MD.first, *MD.second);
700 if (!LiveValues.insert(RA).second)
718 MarkLive(I->second);
1076 NF->addMetadata(MD.first, *MD.second);
lib/Transforms/IPO/ForceFunctionAttrs.cpp 77 auto Kind = parseAttrKind(KV.second);
79 LLVM_DEBUG(dbgs() << "ForcedAttribute: " << KV.second
lib/Transforms/IPO/FunctionAttrs.cpp 474 if (Visited.insert(&UU).second)
488 if (Visited.insert(&UU).second)
lib/Transforms/IPO/FunctionImport.cpp 312 if (ILI.second)
388 Threshold * GetBonusMultiplier(Edge.second.getHotness());
392 bool PreviouslyVisited = !IT.second;
393 auto &ProcessedThreshold = std::get<0>(IT.first->second);
394 auto &CalleeSummary = std::get<1>(IT.first->second);
395 auto &FailureInfo = std::get<2>(IT.first->second);
398 Edge.second.getHotness() == CalleeInfo::HotnessType::Hot;
400 Edge.second.getHotness() == CalleeInfo::HotnessType::Critical;
448 std::max(FailureInfo->MaxHotness, Edge.second.getHotness());
454 VI, Edge.second.getHotness(), Reason, 1);
472 bool PreviouslyImported = !ILI.second;
542 if (!Index.isGlobalValueLive(GVSummary.second)) {
547 dyn_cast<FunctionSummary>(GVSummary.second->getBaseObject());
573 auto &ProcessedThreshold = std::get<0>(I.second);
574 auto &CalleeSummary = std::get<1>(I.second);
575 auto &FailureInfo = std::get<2>(I.second);
714 if (GlobalList.second.SummaryList.empty())
718 assert(GlobalList.second.SummaryList.size() == 1 &&
720 auto &Summary = GlobalList.second.SummaryList[0];
757 for (auto &S : Entry.second.SummaryList)
861 for (auto &S : P.second.SummaryList)
888 SummariesForIndex[GI] = DS->second;
951 auto NewLinkage = GS->second->linkage();
981 GS->second->canAutoHide()) {
1039 return !GlobalValue::isLocalLinkage(GS->second->linkage());
1240 for (auto &S : I.second.SummaryList) {
lib/Transforms/IPO/GlobalDCE.cpp 111 auto const &K = Where->second;
145 if (!Ret.second)
152 MarkLive(*CM.second, Updates); // Recursion depth is only two because only
207 uint64_t VTableOffset = VTableInfo.second;
lib/Transforms/IPO/GlobalOpt.cpp 254 Dead[i].second->eraseFromParent();
647 if (PHIs.insert(PN).second && !AllUsesOfValueWillTrapIfNull(PN, PHIs))
991 if (PHIs.insert(PN).second)
1082 if (!LoadUsingPHIsPerLoad.insert(PN).second)
1086 if (!LoadUsingPHIs.insert(PN).second)
1246 std::vector<Value *>())).second)
1426 unsigned FieldNo = PHIsToRewrite.back().second;
2492 GVs.push_back(std::make_pair(GV, I.second));
2497 ComplexCEs.push_back(std::make_pair(GEP, I.second));
2499 SimpleCEs.push_back(std::make_pair(GEP, I.second));
2506 CommitValueTo(ComplexCE.second, ComplexCE.first);
2510 GVPair.first->setInitializer(GVPair.second);
2556 Constant *Val = CEPair.second;
2669 bool usedInsert(GlobalValue *GV) { return Used.insert(GV).second; }
2672 return CompilerUsed.insert(GV).second;
lib/Transforms/IPO/HotColdSplitting.cpp 509 unsigned Score = Block.second;
596 return !ColdBlocks.insert(Block.first).second;
lib/Transforms/IPO/IPConstantPropagation.cpp 82 if (ArgumentConstants[i].second)
104 ArgumentConstants[i].second = true;
119 ArgumentConstants[i].second = true;
130 if (ArgumentConstants[i].second || AI->use_empty() ||
lib/Transforms/IPO/Inliner.cpp 214 if (!UsedAllocas.insert(AvailableAlloca).second)
490 InlineHistoryID = InlineHistory[InlineHistoryID].second;
640 InlineHistoryID = CallSites[CSi].second;
805 CallGraphNode *CGN = I.second.get();
lib/Transforms/IPO/LowerTypeTests.cpp 375 ConstantExpr::getBitCast(P.second, P.first->getType()));
567 BSB.addOffset(GlobalAndOffset.second + Offset);
1606 TypeMembers[I->second].insert(GlobalIndex);
1845 for (auto &GVS : I.second.SummaryList)
1881 if (!P.second && P.first->second.Linkage != CFL_Definition)
1881 if (!P.second && P.first->second.Linkage != CFL_Definition)
1882 P.first->second = {Linkage, FuncMD};
1887 CfiFunctionLinkage Linkage = P.second.Linkage;
1888 MDNode *FuncMD = P.second.FuncMD;
1984 if (Ins.second) {
1995 return Ins.first->second;
2057 for (auto &S : P.second.SummaryList) {
2094 return S1.second < S2.second;
2094 return S1.second < S2.second;
lib/Transforms/IPO/MergeFunctions.cpp 412 Deferred.push_back(WeakTrackingVH(I->second));
873 FnTreeType::iterator IterToFNInFnTree = I->second;
906 if (Result.second) {
938 FnTree.erase(I->second);
lib/Transforms/IPO/PartialInlining.cpp 722 BasicBlock *OutliningCallBB = Cloner.OutlinedFunctions.back().second;
895 BasicBlock* OutliningCallBB = FuncBBPair.second;
1479 if (Result.second)
1480 Worklist.push_back(Result.second);
lib/Transforms/IPO/PassManagerBuilder.cpp 211 Ext.second(*this, PM);
216 Extensions[i].second(*this, PM);
lib/Transforms/IPO/SampleProfile.cpp 256 const FunctionSamplesMap &FSMap = ICS.second;
258 FunctionSamples &FS = const_cast<FunctionSamples &>(IFS.second);
533 unsigned Count = (I != SampleCoverage.end()) ? I->second.size() : 0;
539 for (const auto &J : I.second) {
540 const FunctionSamples *CalleeSamples = &J.second;
558 for (const auto &J : I.second) {
559 const FunctionSamples *CalleeSamples = &J.second;
575 Total += I.second.getSamples();
579 for (const auto &J : I.second) {
580 const FunctionSamples *CalleeSamples = &J.second;
621 OS << "weight[" << E.first->getName() << "->" << E.second->getName()
643 uint64_t W = (I == BlockWeights.end() ? 0 : I->second);
819 Sum += NameFS.second.getEntrySamples();
820 R.push_back(&NameFS.second);
848 if (it.second)
849 it.first->second = Samples->findFunctionSamples(DIL);
850 return it.first->second;
1012 pair.first->second.entryCount += FS->getEntrySamples();
1191 if (E.first == E.second)
1264 OtherEC = EquivalenceClass[UnknownEdge.second];
1326 if (Visited.insert(B2).second)
1336 if (Visited.insert(B2).second)
1347 R.emplace_back(InstrProfValueData{FunctionSamples::getGUID(I.first), I.second});
1742 if (!r.second)
1757 updateProfileCallee(pair.first, pair.second.entryCount);
lib/Transforms/IPO/StripSymbols.cpp 341 if (!VisitedSet.insert(DIG).second)
lib/Transforms/IPO/SyntheticCountsPropagation.cpp 142 Entry.second.template toInt<uint64_t>(), Function::PCT_Synthetic));
lib/Transforms/IPO/ThinLTOBitcodeWriter.cpp 77 GO.setComdat(Replacement->second);
133 *MDNode::get(M.getContext(), {MD->getOperand(0), I->second}));
lib/Transforms/IPO/WholeProgramDevirt.cpp 724 for (auto &SlotSummary : T.second) {
729 WPDRes->second.SingleImplName = ModuleSummaryIndex::getGlobalNameForLocal(
730 WPDRes->second.SingleImplName,
887 Apply(P.second);
914 AddCalls(P.second);
1042 if (!P.second.AllCallSitesDevirted) {
1158 Apply(P.second);
1428 if (tryUniformRetValOpt(TargetsForSlot, CSByConstantArg.second, ResByArg))
1431 if (tryUniqueRetValOpt(BitWidth, TargetsForSlot, CSByConstantArg.second,
1473 if (CSByConstantArg.second.isExported()) {
1484 applyVirtualConstProp(CSByConstantArg.second,
1583 if (SeenCallSites.insert(Call.CS).second)
1689 const WholeProgramDevirtResolution &Res = ResI->second;
1710 auto &ResByArg = I->second;
1717 applyUniformRetValOpt(CSByConstantArg.second, "", ResByArg.Info);
1722 applyUniqueRetValOpt(CSByConstantArg.second, "", ResByArg.Info,
1731 applyVirtualConstProp(CSByConstantArg.second, "", Byte, Bit);
1755 if (U.second == 0) {
1794 importResolution(S.first, S.second);
1820 for (auto &S : P.second.SummaryList) {
1872 if (!trySingleImplDevirt(ExportSummary, TargetsForSlot, S.second, Res)) {
1874 tryVirtualConstProp(TargetsForSlot, S.second, Res, S.first);
1876 tryICallBranchFunnel(TargetsForSlot, S.second, Res, S.first);
1893 for (auto FS : S.second.CSInfo.SummaryTypeCheckedLoadUsers)
1895 for (auto &CCS : S.second.ConstCSInfo)
1896 for (auto FS : CCS.second.SummaryTypeCheckedLoadUsers)
1904 Function *F = DT.second;
1941 for (auto &S : P.second.SummaryList) {
1990 if (!trySingleImplDevirt(TargetsForSlot, S.first, S.second, Res,
lib/Transforms/InstCombine/InstCombineAndOrXor.cpp 617 unsigned RHSMask = MaskPair->second;
lib/Transforms/InstCombine/InstCombineCompares.cpp 2666 RHS2 = FlippedStrictness->second;
5223 return new ICmpInst(FlippedStrictness->first, Op0, FlippedStrictness->second);
lib/Transforms/InstCombine/InstCombineLoadStoreAlloca.cpp 69 const bool IsOffset = ValuePair.second;
290 return Loc->second;
490 MDNode *N = MDPair.second;
766 if (!Visited.insert(P).second)
lib/Transforms/InstCombine/InstCombinePHI.cpp 838 if (!PotentiallyDeadPHIs.insert(PN).second)
857 if (!ValueEqualPHIs.insert(PN).second)
990 if (PHIsInspected.insert(UserPN).second)
lib/Transforms/InstCombine/InstCombineSelect.cpp 1365 if (!MatchesSelectValue(FlippedStrictness->second))
1373 Value *NewCmp = Builder.CreateICmp(Pred, X, FlippedStrictness->second,
lib/Transforms/InstCombine/InstCombineVectorOps.cpp 641 assert(LR.second == nullptr || LR.second == RHS);
641 assert(LR.second == nullptr || LR.second == RHS);
1087 if (LR.first != &IE && LR.second != &IE) {
1089 if (LR.second == nullptr)
1090 LR.second = UndefValue::get(LR.first->getType());
1091 return new ShuffleVectorInst(LR.first, LR.second,
lib/Transforms/InstCombine/InstructionCombining.cpp 1210 for (;; Op = Parent.first->getOperand(Parent.second)) { // Drill down
1360 assert(Op != Parent.first->getOperand(Parent.second) &&
1362 Parent.first->setOperand(Parent.second, Op);
2828 if (AlreadyCaught.insert(TypeInfo).second) {
2924 if (SeenInFilter.insert(TypeInfo).second)
3385 if (!Visited.insert(BB).second)
lib/Transforms/Instrumentation/AddressSanitizer.cpp 2670 if (!TempsToInstrument.insert(Addr).second)
3330 int64_t Offset = SizeOffset.second.getSExtValue();
lib/Transforms/Instrumentation/BoundsChecking.cpp 72 Value *Offset = SizeOffset.second;
202 insertBoundsCheck(Entry.second, IRB, GetTrapBB);
lib/Transforms/Instrumentation/CFGMST.h 83 assert(It->second.get() != nullptr);
84 return *It->second.get();
92 return It->second.get();
241 << BI.second->infoString() << "\n";
260 Iter->second = std::move(std::make_unique<BBInfo>(Index));
266 Iter->second = std::move(std::make_unique<BBInfo>(Index));
lib/Transforms/Instrumentation/CGProfile.cpp 91 ValueAsMetadata::get(E.first.second),
93 Type::getInt64Ty(Context), E.second))};
lib/Transforms/Instrumentation/ControlHeightReduction.cpp 1376 for (Instruction *I : pair.second) {
1456 DenseSet<Instruction *> &HoistStops = IT->second;
lib/Transforms/Instrumentation/DataFlowSanitizer.cpp 965 i->second->setIncomingValue(
1095 if (std::includes(V1Elems->second.begin(), V1Elems->second.end(),
1095 if (std::includes(V1Elems->second.begin(), V1Elems->second.end(),
1096 V2Elems->second.begin(), V2Elems->second.end())) {
1096 V2Elems->second.begin(), V2Elems->second.end())) {
1098 } else if (std::includes(V2Elems->second.begin(), V2Elems->second.end(),
1098 } else if (std::includes(V2Elems->second.begin(), V2Elems->second.end(),
1099 V1Elems->second.begin(), V1Elems->second.end())) {
1099 V1Elems->second.begin(), V1Elems->second.end())) {
1103 if (V1Elems->second.count(V2))
1106 if (V2Elems->second.count(V1))
1112 std::swap(Key.first, Key.second);
1148 UnionElems = V1Elems->second;
1153 UnionElems.insert(V2Elems->second.begin(), V2Elems->second.end());
1153 UnionElems.insert(V2Elems->second.begin(), V2Elems->second.end());
1189 return IRB.CreateLoad(DFS.ShadowTy, i->second);
1333 IRB.CreateStore(Shadow, i->second);
1552 Function *F = i->second;
lib/Transforms/Instrumentation/GCOVProfiling.cpp 368 return Blocks.find(BB)->second;
468 RegexesStr = HeadTail.second;
821 const unsigned Edge = It->second;
837 const unsigned Edge = It->second;
1005 auto *SP = cast_or_null<DISubprogram>(CountersBySP[j].second);
lib/Transforms/Instrumentation/HWAddressSanitizer.cpp 1493 for (Function *F : P.second)
lib/Transforms/Instrumentation/InstrProfiling.cpp 249 if (BlockSet.insert(ExitBlock).second) {
285 PGOCounterPromoterHelper Promoter(Cand.first, Cand.second, SSA, InitVal,
288 Promoter.run(SmallVector<Instruction *, 2>({Cand.first, Cand.second}));
457 auto *CounterStore = LoadStore.second;
592 } else if (It->second.NumValueSites[ValueKind] <= Index)
593 It->second.NumValueSites[ValueKind] = Index + 1;
599 assert(It != ProfileDataMap.end() && It->second.DataVar &&
602 GlobalVariable *DataVar = It->second.DataVar;
606 Index += It->second.NumValueSites[Kind];
738 if (It->second.RegionCounters)
739 return It->second.RegionCounters;
740 PD = It->second;
876 TotalNS += PD.second.NumValueSites[Kind];
lib/Transforms/Instrumentation/MemorySanitizer.cpp 1308 instrumentAlloca(*Item.second, Item.first);
1309 AllocaSet.erase(Item.second);
lib/Transforms/Instrumentation/PGOInstrumentation.cpp 662 if (dyn_cast<GlobalAlias>(CM.second))
664 Function *FM = dyn_cast<Function>(CM.second);
703 if (GlobalAlias *GA = dyn_cast<GlobalAlias>(CM.second)) {
712 Function *CF = dyn_cast<Function>(CM.second);
lib/Transforms/Instrumentation/PoisonChecking.cpp 226 return Itr->second;
lib/Transforms/Instrumentation/SanitizerCoverage.cpp 331 auto SecEnd = SecStartEnd.second;
469 IRBCtor.CreateCall(InitFunction, {SecStartEnd.first, SecStartEnd.second});
lib/Transforms/ObjCARC/BlotMapVector.h 58 if (Pair.second) {
60 Pair.first->second = Num;
62 return Vector[Num].second;
64 return Vector[Pair.first->second].second;
64 return Vector[Pair.first->second].second;
70 if (Pair.second) {
72 Pair.first->second = Num;
76 return std::make_pair(Vector.begin() + Pair.first->second, false);
83 return Vector.begin() + It->second;
90 return Vector.begin() + It->second;
100 Vector[It->second].first = KeyT();
lib/Transforms/ObjCARC/DependencyAnalysis.cpp 233 BasicBlock::iterator LocalStartPos = Pair.second;
245 if (Visited.insert(PredBB).second)
lib/Transforms/ObjCARC/ObjCARCContract.cpp 325 const ColorVector &CV = BlockColors.find(InsertBefore->getParent())->second;
591 BBSize = I->second;
lib/Transforms/ObjCARC/ObjCARCOpts.cpp 379 Pair.first->second.Merge(Pair.second ? TopDownPtrState() : MI->second,
379 Pair.first->second.Merge(Pair.second ? TopDownPtrState() : MI->second,
379 Pair.first->second.Merge(Pair.second ? TopDownPtrState() : MI->second,
387 MI->second.Merge(TopDownPtrState(), /*TopDown=*/true);
422 Pair.first->second.Merge(Pair.second ? BottomUpPtrState() : MI->second,
422 Pair.first->second.Merge(Pair.second ? BottomUpPtrState() : MI->second,
422 Pair.first->second.Merge(Pair.second ? BottomUpPtrState() : MI->second,
431 MI->second.Merge(BottomUpPtrState(), /*TopDown=*/false);
442 const PtrState &P = I->second;
462 const PtrState &P = I->second;
732 const ColorVector &CV = BlockColors.find(&BB)->second;
943 Arg = Pair.second;
1114 TopDownPtrState &S = I->second;
1115 const Sequence Seq = I->second.GetSeq();
1137 const BottomUpPtrState &SuccS = BBI->second.getPtrBottomUpState(Arg);
1253 BottomUpPtrState &S = MI->second;
1280 MyStates.InitFromSucc(I->second);
1286 MyStates.MergeSucc(I->second);
1389 TopDownPtrState &S = MI->second;
1415 MyStates.InitFromPred(I->second);
1421 MyStates.MergePred(I->second);
1477 while (SuccStack.back().second != SE) {
1478 BasicBlock *SuccBB = *SuccStack.back().second++;
1479 if (Visited.insert(SuccBB).second) {
1517 while (PredStack.back().second != PE) {
1518 BasicBlock *BB = *PredStack.back().second++;
1519 if (Visited.insert(BB).second) {
1649 const RRInfo &NewRetainRRI = It->second;
1656 const RRInfo &NewRetainReleaseRRI = Jt->second;
1666 if (ReleasesToMove.Calls.insert(NewRetainRelease).second) {
1697 if (ReleasesToMove.ReverseInsertPts.insert(RIP).second) {
1721 const RRInfo &NewReleaseRRI = It->second;
1728 const RRInfo &NewReleaseRetainRRI = Jt->second;
1738 if (RetainsToMove.Calls.insert(NewReleaseRetain).second) {
1754 if (RetainsToMove.ReverseInsertPts.insert(RIP).second) {
lib/Transforms/ObjCARC/ProvenanceAnalysis.cpp 74 if (UniqueSrc.insert(PV1).second && related(PV1, B, DL))
106 if (Visited.insert(Ur).second)
178 if (!Pair.second)
179 return Pair.first->second;
lib/Transforms/ObjCARC/PtrState.cpp 119 Partial |= ReverseInsertPts.insert(Inst).second;
lib/Transforms/Scalar/ADCE.cpp 235 for (Instruction &I : *BBInfo.second.BB)
236 InstInfo[&I].Block = &BBInfo.second;
241 BBInfo.second.TerminatorLiveInfo = &InstInfo[BBInfo.second.Terminator];
241 BBInfo.second.TerminatorLiveInfo = &InstInfo[BBInfo.second.Terminator];
271 return Iter != end() && Iter->second;
321 if (!BBInfo.second.terminatorIsLive())
322 BlocksWithDeadTerminators.insert(BBInfo.second.BB);
420 if (!AliveScopes.insert(&LS).second)
433 if (!AliveScopes.insert(&DL).second)
lib/Transforms/Scalar/BDCE.cpp 81 if (K && Visited.insert(K).second && K->getType()->isIntOrIntVectorTy() &&
lib/Transforms/Scalar/CallSiteSplitting.cpp 170 if (Cond.second == ICmpInst::ICMP_EQ)
173 assert(Cond.second == ICmpInst::ICMP_NE);
338 addConditions(NewCS, Preds[i].second);
485 return P.second.empty();
lib/Transforms/Scalar/ConstantHoisting.cpp 270 BlockFrequency &InsertPtsFreq = InsertPtsMap[Node].second;
287 BlockFrequency &ParentPtsFreq = InsertPtsMap[Parent].second;
378 Itr->second = ConstIntCandVec.size() - 1;
380 ConstIntCandVec[Itr->second].addUser(Inst, Idx, Cost);
428 Itr->second = ExprCandVec.size() - 1;
430 ExprCandVec[Itr->second].addUser(Inst, Idx, Cost);
943 if (!MapEntry.second.empty())
952 if (!MapEntry.second.empty())
lib/Transforms/Scalar/ConstantProp.cpp 101 if (WorkList.insert(cast<Instruction>(U)).second)
lib/Transforms/Scalar/CorrelatedValuePropagation.cpp 191 BasicBlock *IncomingBB = P->getIncomingBlock(IncomingConstant.second);
lib/Transforms/Scalar/DeadStoreElimination.cpp 444 if (ILI != IM.end() && ILI->second <= LaterIntEnd) {
448 LaterIntStart = std::min(LaterIntStart, ILI->second);
458 while (ILI != IM.end() && ILI->second <= LaterIntEnd) {
459 assert(ILI->second > LaterIntStart && "Unexpected interval");
468 if (ILI->second <= EarlierOff &&
473 << ") Composite Later [" << ILI->second << ", "
629 if (!Visited.insert(*PredI).second)
966 int64_t LaterStart = OII->second;
987 int64_t LaterStart = OII->second;
1015 OverlapIntervalsTy &IntervalMap = OI.second;
lib/Transforms/Scalar/DivRemPairs.cpp 156 Instruction *RemInst = RemPair.second;
lib/Transforms/Scalar/EarlyCSE.cpp 856 if (SimpleValue::canHandle(OPI) && Visited.insert(OPI).second)
1129 isSameMemGeneration(InVal.second, CurrentGeneration, InVal.first,
lib/Transforms/Scalar/Float2Int.cpp 153 IT->second = std::move(R);
228 if (SeenInsts.find(I)->second != badRange())
242 if (It.second != unknownRange())
302 OpRanges.push_back(SeenInsts.find(OI)->second);
369 R = R.unionWith(SeenI->second);
lib/Transforms/Scalar/GVN.cpp 384 if (ValNum.second) {
484 return VI->second;
561 return VI->second;
563 return (VI != valueNumbering.end()) ? VI->second : 0;
641 I->second->dump();
669 if (!IV.second) {
672 if (IV.first->second == 2)
673 IV.first->second = 3;
674 return IV.first->second != 0;
1200 PredLoad.second = LoadPtr;
1242 Value *LoadPtr = PredLoad.second;
1597 return FindRes->second;
1763 << *it->second << " in instruction " << *Instr << '\n');
1764 Instr->setOperand(OpNum, it->second);
1787 LHS = Item.first; RHS = Item.second;
2390 Phi->addIncoming(V, predMap[i].second);
2465 SplitCriticalEdge(Edge.first, Edge.second,
2508 const LeaderTableEntry *Node = &I->second;
lib/Transforms/Scalar/GVNHoist.cpp 285 if (HoistStat.first + HoistStat.second == 0)
288 if (HoistStat.second > 0)
349 return It->second;
622 for (std::pair<VNType, Instruction *> &VI : reverse(it1->second)) {
624 LLVM_DEBUG(dbgs() << "\nPushing on stack: " << *VI.second);
625 RenameStack[VI.first].push_back(VI.second);
641 auto &VCHI = P->second;
649 if (si != RenameStack.end() && si->second.size() &&
650 DT->properlyDominates(Pred, si->second.back()->getParent())) {
652 C.I = si->second.pop_back_val(); // Assign the argument
655 << ", VN: " << C.VN.first << ", " << C.VN.second);
701 SmallVectorImpl<CHIArg> &CHIs = A.second;
724 SmallVecInsn &V = HPL.back().second;
1013 const SmallVecInsn &InstructionsToHoist = HP.second;
lib/Transforms/Scalar/GVNSink.cpp 244 Values.push_back(P.second);
426 return VI->second;
499 e = I->second;
515 return VI->second;
650 return I.second < J.second;
650 return I.second < J.second;
lib/Transforms/Scalar/GuardWidening.cpp 382 const auto &GuardsInCurBB = GuardsInBlock.find(CurBB)->second;
618 if (!Visited.insert(CheckCond).second)
lib/Transforms/Scalar/IndVarSimplify.cpp 567 if (Visited.insert(UI).second)
1011 : Optional<ConstantRange>(It->second);
1023 It->second = R.intersectWith(It->second);
1023 It->second = R.intersectWith(It->second);
1234 return It->second;
1631 assert((WideAddRec.first == nullptr) == (WideAddRec.second == Unknown));
1687 ExtendKindMap[DU.NarrowUse] = WideAddRec.second;
1702 if (!Widened.insert(NarrowUser).second)
1916 if (!Visited.insert(NarrowUser).second)
2150 if (KnownPoison.insert(I).second)
2183 if (!Visited.insert(Op).second)
2791 if (!DominatingExitCounts.insert(ExitCount).second) {
lib/Transforms/Scalar/InductiveRangeCheckElimination.cpp 340 if (!Visited.insert(Condition).second)
lib/Transforms/Scalar/InferAddressSpaces.cpp 316 if (isAddressExpression(*CE) && Visited.insert(CE).second)
324 if (Visited.insert(V).second) {
330 if (isAddressExpression(*CE) && Visited.insert(CE).second)
394 if (PostorderStack.back().second) {
401 PostorderStack.back().second = true;
686 if (Pos->second == FlatAddrSpace)
709 I->second : Src0->getType()->getPointerAddressSpace();
713 J->second : Src1->getType()->getPointerAddressSpace();
735 I->second : PtrOperand->getType()->getPointerAddressSpace();
lib/Transforms/Scalar/JumpThreading.cpp 282 if (PredBr->getSuccessor(0) == PredOutEdge.second) {
565 LoopHeaders.insert(Edge.second);
602 if (!RecursionSet.insert(std::make_pair(V, BB)).second)
715 Result.emplace_back(InterestingVal, LHSVal.second);
716 LHSKnownBBs.insert(LHSVal.second);
722 if (!LHSKnownBBs.count(RHSVal.second))
723 Result.emplace_back(InterestingVal, RHSVal.second);
760 Result.push_back(std::make_pair(KC, LHSVal.second));
904 Result.push_back(std::make_pair(KC, LHSVal.second));
938 Result.push_back(std::make_pair(Val, C.second));
1365 if (!PredsScanned.insert(PredBB).second)
1509 Value *&PredV = I->second;
1542 if (PredToDest.second)
1543 DestPopularity[PredToDest.second]++;
1551 unsigned Popularity = DPI->second;
1557 if (DPI->second < Popularity)
1559 else if (DPI->second == Popularity) {
1566 Popularity = DPI->second;
1611 << " for pred '" << PredValue.second->getName() << "'.\n";
1627 BasicBlock *Pred = PredValue.second;
1628 if (!SeenPreds.insert(Pred).second)
1730 return LoopHeaders.count(PredToDest.second) != 0;
1743 if (PredToDest.second == MostPopularDest) {
1873 BlocksToFoldInto.push_back(XorOpValue.second);
1916 IV = I->second;
2020 New->setOperand(i, I->second);
2333 New->setOperand(i, I->second);
lib/Transforms/Scalar/LICM.cpp 664 if (Pair.second == BB) {
694 return BB != Pair.second && (Pair.first->getSuccessor(0) == BB ||
773 if (Pair.second == InitialPreheader && Pair.first != BI->getParent())
774 Pair.second = HoistCommonSucc;
1343 BlockColors.find(const_cast<BasicBlock *>(BB))->second.size() != 1)
1379 const ColorVector &CV = BlockColors.find(&ExitBlock)->second;
1465 New = It->second;
2170 std::unique_ptr<AliasSetTracker> InnerAST = std::move(MapI->second);
2215 ASTIt->second->copyValue(From, To);
2225 ASTIt->second->deleteValue(V);
lib/Transforms/Scalar/LoopDataPrefetch.cpp 287 const SCEV *PtrDiff = SE->getMinusSCEV(LSCEVAddRec, PrefLoad.second);
lib/Transforms/Scalar/LoopDistribute.cpp 174 if (I && OrigLoop->contains(I->getParent()) && Set.insert(I).second)
378 << "partitions: " << PartI << ", " << LoadToPart->second
386 } while (&*PartJ != LoadToPart->second);
426 Iter->second = -1;
915 for (unsigned PtrIdx2 : Check.second->Members)
lib/Transforms/Scalar/LoopFuse.cpp 820 assert(InsertPos.second &&
lib/Transforms/Scalar/LoopIdiomRecognize.cpp 633 MadeChange |= processLoopStores(SL.second, BECount, ForMemset::Yes);
636 MadeChange |= processLoopStores(SL.second, BECount, ForMemset::No);
2345 auto *SuccessorBB = const_cast<BasicBlock *>(Edge.second);
lib/Transforms/Scalar/LoopLoadElimination.cpp 235 return I->second;
272 const StoreToLoadForwardingCandidate *&OtherCand = Iter->second;
398 for (auto PtrIdx2 : Check.second->Members)
lib/Transforms/Scalar/LoopPredication.cpp 742 if (!Visited.insert(Condition).second)
944 BPI->getEdgeProbability(ExitEdge.first, ExitEdge.second);
lib/Transforms/Scalar/LoopRerollPass.cpp 301 if (J2I != PossibleRedIdx.end() && J1I->second == J2I->second)
301 if (J2I != PossibleRedIdx.end() && J1I->second == J2I->second)
690 if (!Users.insert(I).second)
836 NumBaseUses = Roots.begin()->second->getNumUses();
842 if (!KV.second->hasNUses(NumBaseUses)) {
845 << ", #Root=" << KV.second->getNumUses() << "\n");
937 DRS.BaseInst = KV.second;
940 DRS.Roots.push_back(KV.second);
942 DRS.Roots.push_back(KV.second);
950 DRS.BaseInst = KV.second;
1081 while (I != In.end() && (I->second.test(Val) == 0 ||
1195 if (KV.second.count() != 1 && !isIgnorableInst(KV.first)) {
1198 << *KV.first << " (#uses=" << KV.second.count() << ")\n");
1205 dbgs() << "LRR: " << KV.second.find_first() << "\t" << *KV.first << "\n";
1284 if (LastRootIt->second.find_first() < (int)Iter)
1301 if (RootIt->second.count() > 1) {
1361 Op2 = BMI->second;
1498 if (KV.second.find_first() == 0)
lib/Transforms/Scalar/LoopSimplifyCFG.cpp 267 UniqueDeadExits.insert(ExitBlock).second)
lib/Transforms/Scalar/LoopSink.cpp 218 return LoopBlockNumber.find(A)->second < LoopBlockNumber.find(B)->second;
218 return LoopBlockNumber.find(A)->second < LoopBlockNumber.find(B)->second;
225 assert(LoopBlockNumber.find(N)->second >
226 LoopBlockNumber.find(MoveBB)->second &&
lib/Transforms/Scalar/LoopStrengthReduce.cpp 265 RegSortData &RSD = Pair.first->second;
266 if (Pair.second)
276 RegSortData &RSD = It->second;
288 SmallBitVector &UsedByIndices = Pair.second.UsedByIndices;
301 const SmallBitVector &UsedByIndices = I->second.UsedByIndices;
311 return I->second.UsedByIndices;
922 if (!Processed.insert(S).second)
1315 if (Regs.insert(Reg).second) {
1544 if (!Uniquifier.insert(Key).second)
2579 if (!P.second) {
2581 size_t LUIdx = P.first->second;
2590 P.first->second = LUIdx;
3073 if (UniqueOperands.insert(IVOpInst).second)
3309 int64_t Offset = P.second;
3397 if (!Visited.insert(S).second)
3461 int64_t Offset = P.second;
4112 if (Pair.second)
4114 Pair.first->second.insert(std::make_pair(Imm, Use));
4124 const ImmMapTy &Imms = Map.find(Reg)->second;
4139 const SCEV *OrigReg = J->second;
4172 if (UniqueItems.insert(std::make_pair(LUIdx, Imm)).second)
4369 if (P.second)
4372 Formula &Best = LU.Formulae[P.first->second];
4643 if (P.second)
4646 Formula &Best = LU.Formulae[P.first->second];
5358 if (!Pair.second)
5359 PN->setIncomingValue(i, Pair.first->second);
5374 Pair.first->second = FullV;
lib/Transforms/Scalar/LoopUnrollPass.cpp 530 /*IsCounted*/ false}).second;
lib/Transforms/Scalar/LoopUnswitch.cpp 281 LoopProperties &Props = PropsIt->second;
327 LoopProperties &Props = LIt->second;
427 return CacheIt->second;
836 if (!Visited.insert(BB).second) {
1083 if (!currentLoop->contains(CurrentBB) || !Visited.insert(CurrentBB).second)
lib/Transforms/Scalar/MergeICmps.cpp 128 if (Insertion.second)
130 return Insertion.first->second;
lib/Transforms/Scalar/NaryReassociate.cpp 530 auto &Candidates = Pos->second;
lib/Transforms/Scalar/NewGVN.cpp 322 if (LeaderPair.second < NextLeader.second)
322 if (LeaderPair.second < NextLeader.second)
964 return BlockInstRange.lookup(P1.second).first <
965 BlockInstRange.lookup(P2.second).first;
995 auto *BB = P.second;
1674 auto *OldClass = LookupResult->second;
1696 LookupResult->second = NewClass;
2059 for (const typename Map::mapped_type::value_type Mapped : Result->second)
2137 if (DFSNum < MinDFS.second)
2351 if (lookupResult.second) {
2354 place->second = NewClass;
2381 EClass = lookupResult.first->second;
2433 if (ReachableEdges.insert({From, To}).second) {
2435 if (ReachableBlocks.insert(To).second) {
2439 TouchedInstructions.set(InstRange.first, InstRange.second);
2591 return OISIt->second;
2612 if (!OISIt->second) {
2618 if (!Visited.insert(Op).second)
2692 if (!Visited.insert(I).second)
2835 ValuePHI->addIncoming(PHIOp.first, PHIOp.second);
2841 ValuePHI->setIncomingBlock(i, PHIOp.second);
3220 auto *SecondMUD = dyn_cast<MemoryUseOrDef>(KV.second->getMemoryLeader());
3275 BeforeIteration.insert({KV.first, *KV.second});
3290 auto *BeforeCC = &BeforeIteration.find(KV.first)->second;
3291 auto *AfterCC = KV.second;
3320 {SE->getOperand(0), std::make_tuple(SE->getMemoryLeader(), KV.second,
3322 bool Okay = Res.second;
3327 Okay = (std::get<1>(Res.first->second) == KV.second) &&
3327 Okay = (std::get<1>(Res.first->second) == KV.second) &&
3328 (lookupOperandLeader(std::get<2>(Res.first->second)) ==
3377 TouchedInstructions.reset(CurrInstRange.first, CurrInstRange.second);
3447 ICount += BlockRange.second - BlockRange.first;
3459 TouchedInstructions.set(InstRange.first, InstRange.second);
3738 return DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second;
3748 !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second)) {
3858 for (auto InstNum : BBPair.second) {
3966 << EliminationStack.dfs_back().second << ")\n");
lib/Transforms/Scalar/PlaceSafepoints.cpp 284 if (Seen.insert(Succ).second) {
lib/Transforms/Scalar/Reassociate.cpp 503 APInt Weight = P.second; // Number of paths to this operand.
510 assert(Visited.insert(Op).second && "Not first visit!");
520 assert(Visited.insert(Op).second && "Not first visit!");
537 IncorporateWeight(It->second, Weight, Opcode);
564 Weight = It->second;
611 APInt Weight = It->second;
616 It->second = 0;
1052 Factors.append(E.second.getZExtValue(),
1546 if (!Duplicates.insert(Factor).second)
1561 if (!Duplicates.insert(Factor).second)
1574 if (!Duplicates.insert(Factor).second)
1926 Visited.insert(Op).second)
2205 Ops.append(E.second.getZExtValue(),
2299 if (it->second.isValid())
2300 Score += it->second.Score;
2312 auto Op1 = Ops[BestPair.second];
2313 Ops.erase(&Ops[BestPair.second]);
2368 if (!Visited.insert({Op0, Op1}).second)
2371 if (!res.second) {
2376 assert(res.first->second.isValid() && "WeakVH invalidated");
2377 ++res.first->second.Score;
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 629 return Found->second;
822 if (States.insert(std::make_pair(Base, BDVState())).second)
849 LLVM_DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
860 return I->second;
924 LLVM_DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
932 BDVState State = Pair.second;
1029 BDVState State = Pair.second;
1119 Value *Base = Pair.second.getBaseValue();
1187 Pair.second->printAsOperand(errs(), false);
1614 Value *Base = PointerToBase.find(L)->second;
1670 Value *OriginalValue = RematerializedValuePair.second;
1723 Value *OriginalValue = RematerializedValuePair.second;
1769 AllocaInst *Alloca = Pair.second;
1801 AllocaInst *Alloca = Pair.second;
1884 Vec.erase(remove_if(Vec, [&](const T &V) { return !Seen.insert(V).second; }),
2008 BasicBlock *CurrentIncomingBB = CIVI->second;
2255 Bases.push_back(Pair.second);
2272 Pair.second->printAsOperand(errs(), false);
2288 if (isa<Constant>(BasePair.second))
2818 if (Info.PointerToBase.insert({V, V}).second) {
lib/Transforms/Scalar/SCCP.cpp 262 return A->second.PredInfo->getPredicateInfoFor(I);
268 return {A->second.DT, A->second.PDT, DomTreeUpdater::UpdateStrategy::Lazy};
268 return {A->second.DT, A->second.PDT, DomTreeUpdater::UpdateStrategy::Lazy};
280 if (!BBExecutable.insert(BB).second)
361 StructValues.push_back(I->second);
372 return I->second;
415 LatticeVal LV = It->second;
494 LatticeVal &LV = I.first->second;
496 if (!I.second)
514 ValueLatticeElement &LV = PI.first->second;
515 if (PI.second)
532 LatticeVal &LV = I.first->second;
534 if (!I.second)
555 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
586 Iter.first->second.insert(U);
597 for (User *U : Iter->second)
845 mergeInValue(TFRVI->second, F, getValueState(ResultOp));
1074 ? V1Param->second
1079 ? V2Param->second
1139 if (I == TrackedGlobals.end() || I->second.isOverdefined()) return;
1142 mergeInValue(I->second, GV, getValueState(SI.getOperand(0)));
1143 if (I->second.isOverdefined())
1180 mergeInValue(IV, &I, It->second);
1361 mergeInValue(I, TFRVI->second);
2194 if (I.second.isOverdefined() || F->getReturnType()->isVoidTy())
2219 assert(!I->second.isOverdefined() &&
lib/Transforms/Scalar/SROA.cpp 669 if (VisitedDeadInsts.insert(&I).second)
879 AS.Slices[MTPI->second].kill();
902 unsigned PrevIdx = MTPI->second;
984 if (Visited.insert(cast<Instruction>(U)).second)
1614 if (!Visited.insert(Ptr).second)
1654 } while (Visited.insert(Ptr).second);
3140 if (Visited.insert(cast<Instruction>(U)).second)
3251 if (Visited.insert(U.getUser()).second)
3731 auto &Offsets = SplitOffsetsMapI->second;
3765 auto &LoadOffsets = LoadOffsetsI->second;
3982 SplitLoads = &SplitLoadsMapI->second;
lib/Transforms/Scalar/Scalarizer.cpp 408 New->setMetadata(MD.first, MD.second);
831 ValueVector &CV = *GMI.second;
lib/Transforms/Scalar/SeparateConstOffsetFromGEP.cpp 1148 auto &Candidates = Pos->second;
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 133 if (Visited.insert(OpI).second)
713 if (UnswitchedExitBBs.insert(ExitBB).second)
814 DTUpdates.push_back({DT.Insert, OldPH, SplitUnswitchedPair.second});
941 } while (L.contains(CurrentBB) && Visited.insert(CurrentBB).second);
998 return It != DominatingSucc.end() && It->second != UnswitchedSuccBB;
1127 if (SuccSet.insert(SuccBB).second)
1262 if (BlocksInClonedLoop.insert(Pred).second && Pred != ClonedHeader)
1284 BlocksInClonedLoop.insert(Pred).second)
1399 bool Inserted = ExitLoopMap.insert({PredBB, ExitL}).second;
1423 auto *OuterL = BBAndL.second;
1589 if (LoopBlockSet.insert(Pred).second && Pred != Header)
1620 if (!LoopBlockSet.insert(InnerPH).second)
1649 if (L.contains(Pred) && LoopBlockSet.insert(Pred).second)
1798 bool Inserted = NewExitLoopBlocks.insert(PredBB).second;
1894 assert(Visited.insert(ChildN).second &&
2049 BasicBlock *ClonedPH = ClonedPHs.begin()->second;
2064 Case.setSuccessor(ClonedPHs.find(Case.getCaseSuccessor())->second);
2071 {DominatorTree::Insert, SplitBB, ClonedPHs.find(SuccBB)->second});
2138 BasicBlock *ClonedPH = ClonedPHs.begin()->second;
2201 BasicBlock *ClonedPH = ClonedPHs.begin()->second;
2339 return DTCostIt->second;
2344 N.begin(), N.end(), BBCostIt->second, [&](int Sum, DomTreeNode *ChildN) {
2347 bool Inserted = DTCostMap.insert({&N, Cost}).second;
2389 if (Successors.insert(Succ).second)
2679 if (!Visited.insert(SuccBB).second)
2731 ArrayRef<Value *> Invariants = TerminatorAndInvariants.second;
lib/Transforms/Scalar/SimplifyCFGPass.cpp 156 LoopHeaders.insert(const_cast<BasicBlock *>(Edges[i].second));
lib/Transforms/Scalar/SpeculateAroundPHIs.cpp 149 if (!Visited.insert(OpI).second)
224 if (!IncomingConstantBlocks.insert(PN.getIncomingBlock(i)).second)
229 ++InsertResult.first->second.Count;
231 if (!InsertResult.second)
234 int &MatCost = InsertResult.first->second.MatCost;
283 int MatCost = IncomingConstantAndCostsAndCount.second.MatCost;
284 int &FoldedCost = IncomingConstantAndCostsAndCount.second.FoldedCost;
313 int MatCost = IncomingConstantAndCostsAndCount.second.MatCost;
314 int FoldedCost = IncomingConstantAndCostsAndCount.second.FoldedCost;
315 int Count = IncomingConstantAndCostsAndCount.second.Count;
439 UserToPNMap.insert({UI, {}}).first->second.push_back(PN);
466 Cost += CostMapIt->second;
469 bool Inserted = SpecCostMap.insert({I, Cost}).second;
478 auto &UserPNs = UserPNsIt->second;
481 int &PNUserCount = PNUserCountMap.find(UserPN)->second;
496 SpecCostMap.find(cast<Instruction>(U.getUser()))->second;
501 int CostSavings = CostSavingsMap.find(PN)->second;
519 if (CostMapIt->second == 0)
522 CostMapIt->second = 0;
531 assert(SpecCostMap.find(SpecI)->second == 0 &&
540 if (CostMapIt == SpecCostMap.end() || CostMapIt->second == 0)
542 CostMapIt->second = 0;
633 if (!InsertResult.second)
636 auto &SpeculatedVals = InsertResult.first->second;
648 SpeculatedVals.push_back(IncomingValueMap.find(PredBB)->second);
672 const auto &SpeculatedVals = MapIt->second;
707 auto &SpeculatedVals = SpeculatedValueMap.find(OrigI)->second;
lib/Transforms/Scalar/StructurizeCFG.cpp 560 Value *Pred = BBAndPred.second;
608 const BBVector &From = AddedPhi.second;
623 for (const auto &VI : PI.second) {
624 Updater.AddAvailableValue(VI.first, VI.second);
789 Value *V = Pred.second;
lib/Transforms/Scalar/TailRecursionElimination.cpp 113 if (!Visited.insert(&U).second)
lib/Transforms/Utils/AddDiscriminators.cpp 210 unsigned Discriminator = R.second ? ++LDM[L] : LDM[L];
246 if (!CallLocations.insert(L).second) {
lib/Transforms/Utils/BasicBlockUtils.cpp 64 if (Updates && UniqueSuccessors.insert(Succ).second)
290 if (!R.second)
lib/Transforms/Utils/BypassSlowDivision.cpp 137 IntegerType *BT = IntegerType::get(I->getContext(), BI->second);
171 QuotRemPair &Value = CacheI->second;
474 for (Value *V : {KV.second.Quotient, KV.second.Remainder})
474 for (Value *V : {KV.second.Quotient, KV.second.Remainder})
lib/Transforms/Utils/CloneFunction.cpp 148 *MapMetadata(MD.second, VMap,
225 if (Visited.insert(Unit).second)
576 for (unsigned NumToRemove = PCI.second; NumToRemove; --NumToRemove)
lib/Transforms/Utils/CloneModule.cpp 136 *MapMetadata(MD.second, VMap, RF_MoveDistinctMDs));
197 if (Visited.insert(MappedOperand).second)
lib/Transforms/Utils/CodeExtractor.cpp 102 if (!Visited.insert(Curr).second)
367 return It->second.count(Addr);
lib/Transforms/Utils/Evaluator.cpp 120 if (!SimpleConstants.insert(C).second)
218 return I != MutatedMemory.end() ? I->second : nullptr;
717 if (!ExecutedBlocks.insert(NextBB).second)
lib/Transforms/Utils/FunctionComparator.cpp 758 return cmpNumbers(LeftSN.first->second, RightSN.first->second);
758 return cmpNumbers(LeftSN.first->second, RightSN.first->second);
874 if (!VisitedBBs.insert(TermL->getSuccessor(i)).second)
942 if (!VisitedBBs.insert(Term->getSuccessor(i)).second)
lib/Transforms/Utils/FunctionImportUtils.cpp 306 GO.setComdat(Replacement->second);
lib/Transforms/Utils/GlobalStatus.cpp 150 if (VisitedUsers.insert(I).second)
lib/Transforms/Utils/InlineFunction.cpp 272 Value *ChildUnwindDestToken = Memo->second;
310 ChildUnwindDestToken = Memo->second;
390 return Memo->second;
428 UnwindDestToken = AncestorMemo->second;
456 if (Memo != MemoMap.end() && Memo->second) {
464 assert(getParentPad(Memo->second) == getParentPad(UselessPad));
1230 if (!I->second->getFunction())
1238 CallerNode->addCalledFunction(NewCall, I->second);
1462 if (!ClonedBBs.insert(ClonedBB).second) {
1729 HandleByValArgumentInit(Init.first, Init.second, Caller->getParent(),
lib/Transforms/Utils/Local.cpp 533 if (!Visited.insert(I).second) {
835 IncomingValues.find(BB)->second == OldVal) &&
843 if (It != IncomingValues.end()) return It->second;
883 PN->setIncomingValue(i, It->second);
1114 if (!Inserted.second) {
2158 if (!HandlerSet.insert({CatchPad, Empty}).second) {
2169 if (Reachable.insert(Successor).second)
2290 MDNode *KMD = MD.second;
2384 MDNode *N = MDPair.second;
2681 return I->second;
2964 return I->second;
lib/Transforms/Utils/LoopSimplify.cpp 170 if (Blocks.insert(BB).second && BB != StopBlock)
lib/Transforms/Utils/LoopUnrollPeel.cpp 134 return I->second;
555 for (PHINode &PHI : Edge.second->phis()) {
615 if (ExitIDom.count(Edge.second))
618 DT->getNode(Edge.second)->getIDom()->getBlock(), Latch);
620 ExitIDom[Edge.second] = BB;
709 cast<BasicBlock>(LVMap[Exit.second]));
lib/Transforms/Utils/LoopUtils.cpp 110 if (!Visited.insert(SuccBB).second)
lib/Transforms/Utils/LoopVersioning.cpp 200 GroupToNonAliasingScopes[Check.first].push_back(GroupToScope[Check.second]);
206 GroupToNonAliasingScopeList[Pair.first] = MDNode::get(Context, Pair.second);
239 MDNode::get(Context, GroupToScope[Group->second])));
242 auto NonAliasingScopeList = GroupToNonAliasingScopeList.find(Group->second);
248 NonAliasingScopeList->second));
lib/Transforms/Utils/ModuleUtils.cpp 79 if (InitAsSet.insert(C).second)
88 if (InitAsSet.insert(C).second)
208 if (CI->second > 0) {
209 CI->second -= 1;
lib/Transforms/Utils/PredicateInfo.cpp 647 auto *DomNode = DT.getNode(BlockEdge.second);
728 assert(InsertResult.second && "Value info number already existed?");
729 return ValueInfos[InsertResult.first->second];
731 return ValueInfos[OIN->second];
lib/Transforms/Utils/PromoteMemoryToRegister.cpp 204 return It->second;
217 return It->second;
492 Value *ReplVal = std::prev(I)->second->getOperand(0);
621 return BBNumbers.find(A)->second < BBNumbers.find(B)->second;
621 return BBNumbers.find(A)->second < BBNumbers.find(B)->second;
691 PHINode *PN = I->second;
716 PHINode *SomePHI = I->second;
734 return BBNumbers.find(A)->second < BBNumbers.find(B)->second;
734 return BBNumbers.find(A)->second < BBNumbers.find(B)->second;
822 if (!LiveInBlocks.insert(BB).second)
929 if (!Visited.insert(BB).second)
944 Value *V = IncomingVals[AI->second];
968 unsigned AllocaNo = ai->second;
973 for (DbgVariableIntrinsic *DII : AllocaDbgDeclares[ai->second])
994 if (VisitedSuccs.insert(*I).second)
lib/Transforms/Utils/SSAUpdater.cpp 68 return (AVI != getAvailableVals(AV).end()) ? AVI->second : nullptr;
166 InsertedPHI->addIncoming(PredValue.second, PredValue.first);
477 NewVal = RLI->second;
lib/Transforms/Utils/SSAUpdaterBulk.cpp 109 if (!LiveInBlocks.insert(BB).second)
177 if (!ProcessedUses.insert(U).second)
lib/Transforms/Utils/SimplifyCFG.cpp 651 if (Visited.insert(I->getOperand(1)).second)
653 if (Visited.insert(I->getOperand(0)).second)
2036 if (I->first->hasNUses(I->second)) {
2250 *i = PI->second;
4591 SmallVectorImpl<int> &Indexes = ForwardingNode.second;
4754 I.second.push_back(CaseVal);
4755 return I.second.size();
4788 MapCaseToResult(CaseVal, UniqueResults, Results.begin()->second);
4812 DefaultResults.size() == 1 ? DefaultResults.begin()->second : nullptr;
4838 if (ResultVector[0].second.size() == 1 &&
4839 ResultVector[1].second.size() == 1) {
4840 ConstantInt *const FirstCase = ResultVector[0].second[0];
4841 ConstantInt *const SecondCase = ResultVector[1].second[0];
4983 SingleValue = Values.begin()->second;
4985 Type *ValueType = Values.begin()->second->getType();
4991 Constant *CaseRes = Values[I].second;
5174 Type *Ty = I.second;
5256 ValuePair.second, CmpOp1, true);
5348 Constant *Value = I.second;
5357 ResultTypes[PHI] = ResultLists[PHI][0].second->getType();
5383 Constant *Result = I.second;
5483 Constant *DV = NeedMask ? ResultLists[PHI][0].second : DefaultResults[PHI];
5692 if (!Dest->hasAddressTaken() || !Succs.insert(Dest).second) {
lib/Transforms/Utils/SimplifyIndVar.cpp 812 if (!Simplified.insert(UI).second)
889 Instruction *IVOperand = UseOper.second;
lib/Transforms/Utils/SplitModule.cpp 155 if (a.second || b.second)
155 if (a.second || b.second)
156 return a.second > b.second;
156 return a.second > b.second;
185 return a.second->getData()->getName() > b.second->getData()->getName();
185 return a.second->getData()->getName() > b.second->getData()->getName();
192 unsigned CurrentClusterSize = BalancinQueue.top().second;
196 << I.first << ") ----> " << I.second->getData()->getName()
200 GVtoClusterMap.findLeader(I.second);
202 if (!Visited.insert(*MI).second)
lib/Transforms/Utils/ValueMapper.cpp 586 auto &OpD = Where->second;
688 return Where != Info.end() && Where->second.HasChanged;
881 MDNode *Old = MI.second;
932 GO.addMetadata(I.first, *cast<MDNode>(mapMetadata(I.second)));
997 assert(AlreadyScheduled.insert(&GV).second && "Should not reschedule");
1013 assert(AlreadyScheduled.insert(&GV).second && "Should not reschedule");
1029 assert(AlreadyScheduled.insert(&GIS).second && "Should not reschedule");
1041 assert(AlreadyScheduled.insert(&F).second && "Should not reschedule");
lib/Transforms/Vectorize/LoadStoreVectorizer.cpp 852 unsigned Size = Chain.second.size();
861 ArrayRef<Instruction *> Chunk(&Chain.second[CI], Len);
1025 vectorizeStoreChain(Chains.second, InstructionsProcessed);
1038 vectorizeStoreChain(Chains.second, InstructionsProcessed);
1168 vectorizeLoadChain(Chains.second, InstructionsProcessed);
1178 vectorizeLoadChain(Chains.second, InstructionsProcessed);
lib/Transforms/Vectorize/LoopVectorizationLegality.cpp 1201 ReductionLiveOuts.insert(Reduction.second.getLoopExitInstr());
lib/Transforms/Vectorize/LoopVectorize.cpp 1044 return Scalars->second.find(I) != Scalars->second.end();
1044 return Scalars->second.find(I) != Scalars->second.end();
1060 return UniformsPerVF->second.find(I) != UniformsPerVF->second.end();
1060 return UniformsPerVF->second.find(I) != UniformsPerVF->second.end();
1076 return ScalarsPerVF->second.find(I) != ScalarsPerVF->second.end();
1076 return ScalarsPerVF->second.find(I) != ScalarsPerVF->second.end();
1137 return Itr->second.first;
1147 return WideningDecisions[InstOnVF].second;
1801 auto ID = II->second;
3004 InductionDescriptor II = InductionEntry.second;
3162 PHI->addIncoming(I.second, MiddleBlock);
3306 IntegerType::get(OriginalTy->getContext(), KV.second);
3445 fixupIVUsers(Entry.first, Entry.second,
4463 if (Induction.second.getKind() != InductionDescriptor::IK_PtrInduction)
4477 for (auto *I : ForcedScalar->second)
4512 if (Induction.second.getKind() == InductionDescriptor::IK_PtrInduction)
4998 if (pair.second > TargetNumRegisters)
5040 if (!C.second && !ForceVectorization) {
5157 pair.second = std::max(pair.second, 1U);
5157 pair.second = std::max(pair.second, 1U);
5185 unsigned MaxLocalUsers = pair.second;
5366 TransposeEnds[Interval.second].push_back(Interval.first);
5444 MaxUsages[j][pair.first] = std::max(MaxUsages[j][pair.first], pair.second);
5446 MaxUsages[j][pair.first] = pair.second;
5475 << TTI.getRegisterClassName(pair.first) << ", " << pair.second
5482 << TTI.getRegisterClassName(pair.first) << ", " << pair.second
5671 BlockCost.second |= C.second;
5671 BlockCost.second |= C.second;
5687 Cost.second |= BlockCost.second;
5687 Cost.second |= BlockCost.second;
5895 auto InstSet = ForcedScalar->second;
6060 AddrDefs.insert(InstOp).second)
6366 RecurrenceDescriptor &RedDes = Reduction.second;
6373 InductionDescriptor &IndDes = Induction.second;
6553 InductionDescriptor &IndDes = Induction.second;
6649 return ECEntryIt->second;
6678 return BCEntryIt->second;
7069 NeedDef.insert(Reduction.second.getLoopExitInstr());
7147 Ingredients.push_back(SinkCandidate->second);
7157 << *SAIt->second
7159 SinkAfterInverse[SAIt->second] = Instr;
7169 Ingredients.push_back(SAInvIt->second);
7205 VPValue *Red = Plan->getVPValue(Reduction.second.getLoopExitInstr());
7688 IntDiagMsg.second +=
7712 << VecDiagMsg.second;
7717 << IntDiagMsg.second;
7725 << VecDiagMsg.second;
7733 << IntDiagMsg.second;
lib/Transforms/Vectorize/SLPVectorizer.cpp 565 BlockScheduling *BS = Iter.second.get();
582 return D1.second < D2.second;
582 return D1.second < D2.second;
1442 return I->second;
1449 return I->second;
1717 ScheduleData *SD = I->second[Key];
1801 for (auto &P : I->second)
1802 if (P.second->SchedulingRegionID == SchedulingRegionID)
1803 Action(P.second);
2276 ReuseShuffleIndicies.emplace_back(Res.first->second);
2277 if (Res.second)
3463 if (!ExtractCostCalculated.insert(EU.Scalar).second)
3480 MinBWs[ScalarRoot].second ? Instruction::SExt : Instruction::ZExt;
3533 if (!UniqueElements.insert(VL[Idx]).second)
3665 if (UsedIdxs.insert(Idx).second)
3687 ReuseShuffleIndicies.emplace_back(Res.first->second);
3688 if (Res.second || isa<Constant>(V))
3776 if (!VisitedBBs.insert(IBB).second) {
4243 scheduleBlock(BSIter.second.get());
4271 if (MinBWs[ScalarRoot].second)
6126 ParentStackElem.second = ParentStackElem.first->getNumOperands();
6284 unsigned EdgeToVist = Stack.back().second++;
6294 if (I != ExtraArgs.end() && !I->second) {
6401 ExternallyUsedValues[Pair.second].push_back(Pair.first);
6487 for (auto *I : Pair.second) {
6799 if (VisitedInstrs.insert(Op).second)
6954 if (!VisitedInstrs.insert(&*it).second) {
7026 if (Entry.second.size() < 2)
7030 << Entry.second.size() << ".\n");
7035 unsigned EltSize = R.getVectorElementSize(Entry.second[0]);
7040 for (unsigned BI = 0, BE = Entry.second.size(); BI < BE; BI += MaxElts) {
7042 auto GEPList = makeArrayRef(&Entry.second[BI], Len);
7115 if (it->second.size() < 2)
7119 << it->second.size() << ".\n");
7125 for (unsigned CI = 0, CE = it->second.size(); CI < CE; CI += 16) {
7127 Changed |= vectorizeStores(makeArrayRef(&it->second[CI], Len), R);
lib/Transforms/Vectorize/VPlan.cpp 385 State->VPValue2Value[Entry.second] = Entry.first;
515 OS << "\\n" << *Entry.second;
lib/Transforms/Vectorize/VPlan.h 140 const VectorParts &Entry = VectorMapStorage.find(Key)->second;
156 const ScalarParts &Entry = ScalarMapStorage.find(Key)->second;
1192 if (MapEntry.second != BackedgeTakenCount)
1193 delete MapEntry.second;
1578 DelSet.insert(I.second);
1589 return InterleaveGroupMap.find(Instr)->second;
1677 delete KV.second;
lib/Transforms/Vectorize/VPlanHCFGBuilder.cpp 113 return BlockIt->second;
170 return VPValIt->second;
lib/Transforms/Vectorize/VPlanSLP.cpp 71 assert(Res.second &&
308 FinalOrder.push_back({Operands.first, {Operands.second[0]}});
309 if (cast<VPInstruction>(Operands.second[0])->getOpcode() ==
316 for (unsigned Lane = 1, E = MultiNodeOps[0].second.size(); Lane < E; ++Lane) {
322 dbgs() << *cast<VPInstruction>(Ops.second[Lane])->getUnderlyingInstr()
324 Candidates.insert(Ops.second[Lane]);
333 VPValue *Last = FinalOrder[Op].second[Lane - 1];
336 if (Res.second)
337 FinalOrder[Op].second.push_back(Res.second);
337 FinalOrder[Op].second.push_back(Res.second);
340 FinalOrder[Op].second.push_back(markFailed());
379 return I->second;
426 VPInstruction *NewOp = buildGraph(Ops.second);
lib/XRay/BlockIndexer.cpp 86 It->second.push_back({CurrentBlock.ProcessID, CurrentBlock.ThreadID,
lib/XRay/InstrumentationMap.cpp 39 return I->second;
46 return I->second;
127 return R->second;
lib/XRay/Profile.cpp 33 PathData.second});
138 for (auto Node = It->second; Node; Node = Node->Caller)
208 auto &Data = PathAndData.second;
213 std::tie(PathDataIt, Inserted) = It->second->insert({NewPathID, Data});
215 auto &ExistingData = PathDataIt->second;
224 PathAndData.reserve(IndexedThreadBlock.second->size());
225 copy(*IndexedThreadBlock.second, std::back_inserter(PathAndData));
241 auto &Data = PathAndData.second;
248 auto &ExistingData = PathDataIt->second;
390 const auto &PathsData = ThreadPaths.second;
lib/XRay/Trace.cpp 310 auto &Blocks = PTB.second;
329 auto &Blocks = PTB.second;
projects/openmp/libomptarget/src/omptarget.cpp 74 TranslationTable *TransTable = &ii->second;
160 if (!lib.second.PendingCtors.empty()) {
162 for (auto &entry : lib.second.PendingCtors) {
173 lib.second.PendingCtors.clear();
451 *ShadowHstPtrAddr = it->second.HstPtrVal;
526 *ShadowHstPtrAddr = it->second.HstPtrVal;
553 rt = Device.data_submit(it->second.TgtPtrAddr,
554 &it->second.TgtPtrVal, sizeof(void *));
598 TranslationTable *TransTable = &ii->second;
617 TM = &TableMapIt->second;
766 ltc = I->second;
tools/bugpoint/CrashDebugger.cpp 522 Value *V = F->getValueSymbolTable()->lookup(BI.second);
629 Value *V = F->getValueSymbolTable()->lookup(BI.second);
721 Value *V = F->getValueSymbolTable()->lookup(BI.second);
tools/bugpoint/ExtractFunction.cpp 235 Constant *Elts[] = {ConstantInt::get(Int32Ty, TorList[i].second),
tools/clang/examples/PrintFunctionNames/PrintFunctionNames.cpp 72 *sema.LateParsedTemplateMap.find(FD)->second;
tools/clang/include/clang/AST/ASTContext.h 994 return MergedIt->second;
tools/clang/include/clang/AST/ASTImporter.h 190 return Pos != Aux.end() && Pos->second > 1;
395 auto *FromD = dyn_cast<DeclT>(FromI->second);
tools/clang/include/clang/AST/ASTImporterSharedState.h 70 return Pos->second;
tools/clang/include/clang/AST/DeclLookups.h 45 reference operator*() const { return It->second.getLookupResult(); }
46 pointer operator->() const { return It->second.getLookupResult(); }
tools/clang/include/clang/AST/DeclTemplate.h 1423 return TypesAndInfos[I].second;
tools/clang/include/clang/AST/Mangle.h 82 return Result.first->second;
88 return Result.first->second;
tools/clang/include/clang/AST/OpenMPClause.h 4488 auto CL = M.second;
tools/clang/include/clang/AST/VTableBuilder.h 273 return AddressPoints.find(Base)->second;
341 return &I->second;
tools/clang/include/clang/ASTMatchers/ASTMatchersInternal.h 165 return It->second.get<T>();
173 return It->second;
197 if (!IDAndNode.second.getMemoizationData())
tools/clang/include/clang/Analysis/Analyses/Dominators.h 247 return It->second;
tools/clang/include/clang/Analysis/CallGraph.h 213 return P.second.get();
239 return P.second.get();
tools/clang/include/clang/Analysis/RetainSummaryManager.h 402 return I->second;
422 const RetainSummary *Summ = I->second;
435 return I == M.end() ? nullptr : I->second;
tools/clang/include/clang/Basic/PlistSupport.h 31 return I->second;
47 return I->second;
tools/clang/include/clang/Basic/SourceManager.h 1292 return getDecomposedLoc(SpellingLoc).second;
tools/clang/include/clang/Driver/Compilation.h 166 assert(TCs.first != TCs.second &&
168 assert(std::next(TCs.first) == TCs.second &&
170 return TCs.first->second;
tools/clang/include/clang/Frontend/CommandLineSourceLoc.h 39 if (!ColSplit.second.getAsInteger(10, PSL.Column) &&
40 !LineSplit.second.getAsInteger(10, PSL.Line)) {
76 if (!RangeSplit.second.empty()) {
77 std::pair<StringRef, StringRef> Split = RangeSplit.second.rsplit(':');
79 Split.second.getAsInteger(10, EndColumn)) {
tools/clang/include/clang/Frontend/Utils.h 170 virtual bool insertSeen(StringRef Filename) { return Seen.insert(Filename).second; }
tools/clang/include/clang/Lex/ModuleMap.h 600 return &I->second;
tools/clang/include/clang/Lex/Preprocessor.h 1028 auto J = I->second.Macros.find(II);
1029 if (J == I->second.Macros.end())
1031 auto *MD = J->second.getLatest();
1123 return I->second;
1645 SkipMainFilePreamble.second = StartOfLine;
tools/clang/include/clang/Lex/PreprocessorOptions.h 218 PrecompiledPreambleBytes.second = false;
tools/clang/include/clang/Rewrite/Core/Rewriter.h 201 return I == RewriteBuffers.end() ? nullptr : &I->second;
tools/clang/include/clang/Sema/DeclSpec.h 221 unsigned location_size() const { return Builder.getBuffer().second; }
tools/clang/include/clang/Sema/Lookup.h 805 return P.second;
tools/clang/include/clang/Sema/Overload.h 1022 return Functions.insert(Key).second;
tools/clang/include/clang/Sema/ScopeInfo.h 485 CoroutineSuspends.second = Final;
705 return Captures[Known->second - 1];
tools/clang/include/clang/Sema/Sema.h10833 Diag.S.DeviceDeferredDiags[Diag.Fn][*Diag.PartialDiagId].second
tools/clang/include/clang/Sema/SemaInternal.h 126 return CorrectionResults.begin()->second[Name];
255 Inner(!IsAtEnd ? Outer->second.begin() : OuterBack->second.end()) {
255 Inner(!IsAtEnd ? Outer->second.begin() : OuterBack->second.end()) {
261 if (Inner == Outer->second.end() && Outer != OuterBack) {
263 Inner = Outer->second.begin();
tools/clang/include/clang/Sema/Template.h 344 if (I->second.is<Decl *>()) {
345 Stored = I->second.get<Decl *>();
347 DeclArgumentPack *OldPack = I->second.get<DeclArgumentPack *>();
tools/clang/include/clang/Sema/TemplateDeduction.h 95 PD.second.swap(SuppressedDiagnostics.front().second);
95 PD.second.swap(SuppressedDiagnostics.front().second);
tools/clang/include/clang/Serialization/ASTReader.h 1238 if (I == KeyDecls.end() || I->second.empty())
1240 return GetExistingDecl(I->second[0]);
1255 for (auto ID : It->second)
2207 int Remap = ModuleFile.SLocRemap.find(Loc.getOffset())->second;
tools/clang/include/clang/Serialization/ASTWriter.h 623 I->second >= serialization::NUM_PREDEF_DECL_IDS);
tools/clang/include/clang/Serialization/ContinuousRangeMap.h 78 I->second = Val.second;
78 I->second = Val.second;
tools/clang/include/clang/StaticAnalyzer/Core/BugReporter/BugReporter.h 508 return TrackedConditions.insert(Cond).second;
527 return I->second->getMessage(N);
tools/clang/include/clang/StaticAnalyzer/Core/CheckerManager.h 569 const EventInfo &info = I->second;
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/AnalysisManager.h 137 return llvm::StringSwitch<bool>(SM.getFilename(SL).rsplit('.').second)
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/CallEvent.h 1135 return &I.second;
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/Environment.h 41 const LocationContext *getLocationContext() const { return second; }
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/FunctionSummary.h 75 I->second.InlineChecked = 1;
76 I->second.MayInline = 1;
81 I->second.InlineChecked = 1;
82 I->second.MayInline = 0;
91 if (I != Map.end() && I->second.InlineChecked)
92 return I->second.MayInline;
98 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks;
102 I->second.TotalBasicBlocks = TotalIDs;
110 return I->second.VisitedBasicBlocks.count();
117 return I->second.TimesInlined;
123 I->second.TimesInlined++;
130 return ((I->second.VisitedBasicBlocks.count() * 100) /
131 I->second.TotalBasicBlocks);
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/RangedConstraintManager.h 34 return *first <= v && v <= *second;
37 const llvm::APSInt &To() const { return *second; }
56 (!(*rhs.first < *lhs.first) && *lhs.second < *rhs.second);
56 (!(*rhs.first < *lhs.first) && *lhs.second < *rhs.second);
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/SMTConstraintManager.h 228 I->second->print(Out);
316 llvm::SMTExprRef Constraint = I++->second;
318 Constraint = Solver->mkAnd(Constraint, I++->second);
337 return I->second;
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/SVals.h 439 return D->second;
tools/clang/include/clang/Tooling/DependencyScanning/DependencyScanningFilesystem.h 161 bool IsInserted = Cache.try_emplace(Filename, Entry).second;
tools/clang/lib/ARCMigrate/ARCMT.cpp 598 RewriteBuffer &buf = I->second;
tools/clang/lib/ARCMigrate/FileRemapper.cpp 33 resetTarget(I->second);
104 remap(pairs[i].first, pairs[i].second);
137 if (const FileEntry *FE = I->second.dyn_cast<const FileEntry *>()) {
151 llvm::MemoryBuffer *mem = I->second.get<llvm::MemoryBuffer *>();
174 assert(I->second.is<llvm::MemoryBuffer *>());
184 llvm::MemoryBuffer *mem = I->second.get<llvm::MemoryBuffer *>();
196 if (const FileEntry *FE = I->second.dyn_cast<const FileEntry *>()) {
199 llvm::MemoryBuffer *mem = I->second.get<llvm::MemoryBuffer *>();
237 file = I->second;
tools/clang/lib/ARCMigrate/ObjCMT.cpp 1817 assert(Begin.second <= End.second);
1817 assert(Begin.second <= End.second);
1818 unsigned Length = End.second - Begin.second;
1818 unsigned Length = End.second - Begin.second;
1974 RewriteBuffer &buf = I->second;
2264 if (!Insert.second)
2273 std::string TempFile = applyEditsToTemp(I->first, I->second,
tools/clang/lib/ARCMigrate/TransAutoreleasePool.cpp 89 PoolVarInfo &info = I->second;
tools/clang/lib/ARCMigrate/TransGCAttrs.cpp 292 ATLs[i].second->getLocation());
318 IndivPropsTy &IndProps = I->second;
tools/clang/lib/ARCMigrate/TransProperties.cpp 121 PropsTy &props = findAtLoc->second;
134 PropsTy &props = I->second;
tools/clang/lib/ARCMigrate/TransRetainReleaseDealloc.cpp 241 return getPreviousAndNextStmt(E).second;
tools/clang/lib/ARCMigrate/TransZeroOutPropsInDealloc.cpp 177 ObjCPropertyImplDecl *PropImpDecl = P->second;
tools/clang/lib/ARCMigrate/TransformActions.cpp 434 return file.substr(locInfo.second).startswith(text);
562 TI = I->second.begin(), TE = I->second.end(); TI != TE; ++TI) {
562 TI = I->second.begin(), TE = I->second.end(); TI != TE; ++TI) {
571 receiver.increaseIndentation(range, I->second);
tools/clang/lib/ARCMigrate/Transforms.cpp 148 const char *tokenBegin = file.data() + locInfo.second;
396 const char *tokenBegin = file.data() + locInfo.second;
477 const char *tokenBegin = file.data() + locInfo.second;
tools/clang/lib/AST/ASTContext.cpp 213 CommentsInTheFile.lower_bound(DeclLocDecomp.second);
217 RawComment *CommentBehindDecl = OffsetCommentBehindDecl->second;
226 if (SourceMgr.getLineNumber(DeclLocDecomp.first, DeclLocDecomp.second) ==
240 RawComment *CommentBeforeDecl = OffsetCommentBeforeDecl->second;
261 DeclLocDecomp.second - CommentEndOffset);
382 return DeclComment->second;
395 *OriginalDecl = RedeclComment->second;
396 auto CommentAtRedecl = DeclRawComments.find(RedeclComment->second);
399 return CommentAtRedecl->second;
408 return LookupRes->second;
473 CommentsInThisFile->rbegin()->second->isAttached())
541 comments::FullComment *FC = Pos->second;
545 return Pos->second;
855 (Pair.first)(Pair.second);
863 if (auto *R = const_cast<ASTRecordLayout *>((I++)->second))
869 if (auto *R = const_cast<ASTRecordLayout *>((I++)->second))
876 A->second->~AttrVec();
880 MTVPair.second->~APValue();
883 Value.second->~PerModuleInitializers();
928 if (const auto *V = I->second.template dyn_cast<ParentVector *>()) {
931 return getSingleDynTypedNodeFromParentMap(I->second);
938 if (Entry.second.is<ast_type_traits::DynTypedNode *>()) {
939 delete Entry.second.get<ast_type_traits::DynTypedNode *>();
940 } else if (Entry.second.is<ParentVector *>()) {
941 delete Entry.second.get<ParentVector *>();
945 if (Entry.second.is<ast_type_traits::DynTypedNode *>()) {
946 delete Entry.second.get<ast_type_traits::DynTypedNode *>();
947 } else if (Entry.second.is<ParentVector *>()) {
948 delete Entry.second.get<ParentVector *>();
1049 auto &Merged = It->second;
1052 if (!Found.insert(M).second)
1085 auto &Imported = *It->second;
1113 auto *Inits = It->second;
1408 Pos->second->~AttrVec();
1428 return Pos->second;
1455 return Pos->second;
1479 return Pos->second;
1495 return Pos->second;
1530 return overridden_method_range(Pos->second.begin(), Pos->second.end());
1530 return overridden_method_range(Pos->second.begin(), Pos->second.end());
1727 unsigned Align = EltInfo.second.getQuantity();
1784 return I->second;
2216 return I->second;
2394 const_cast<ObjCProtocolDecl *>(OP->getCanonicalDecl())).second)
2462 int64_t BaseSize = Base.second;
2604 return cast<ObjCImplementationDecl>(I->second);
2614 return cast<ObjCCategoryImplDecl>(I->second);
2664 return I->second;
7238 NamedDecl *dcl = CurLayObj->second;
8455 LHS = KnownLHS->second;
10247 return I != MangleNumbers.end() ? I->second : 1;
10257 return I != StaticLocalNumbers.end() ? I->second : 1;
10324 return I->second;
tools/clang/lib/AST/ASTDiagnostic.cpp 275 void *Ptr = (void*)PrevArgs[i].second;
tools/clang/lib/AST/ASTImporter.cpp 7877 return ToContext.getQualifiedType(Pos->second, FromT.getLocalQualifiers());
7920 return Pos->second;
7929 return FromDPos->second->getTranslationUnitDecl();
7973 auto *ToD = Pos->second;
8006 SharedState->setImportDeclError(Pos->second, ErrOut);
8017 SharedState->setImportDeclError(Ii->second, ErrOut);
8132 return Pos->second;
8399 return ToSM.getComposedLoc(*ToFileIDOrErr, Decomposed.second);
8415 return Pos->second;
8564 return Pos->second;
8763 assert((Pos == ImportedDecls.end() || Pos->second == To) &&
8766 return Pos->second;
8779 return Pos->second;
8789 assert(InsertRes.second || InsertRes.first->second.Error == Error.Error);
8789 assert(InsertRes.second || InsertRes.first->second.Error == Error.Error);
tools/clang/lib/AST/ASTImporterLookupTable.cpp 108 const auto &FoundNameMap = DCI->second;
113 return NamesI->second;
120 const auto &FoundNameMap = DCI->second;
125 const DeclList& List = Entry.second;
tools/clang/lib/AST/ASTStructuralEquivalence.cpp 1589 bool Inserted = Context.VisitedDecls.insert(P).second;
1889 Decl *D2 = P.second;
tools/clang/lib/AST/CXXInheritance.cpp 563 for (overriding_const_iterator M = I->second.begin(),
564 MEnd = I->second.end();
573 I->second.clear();
574 I->second.push_back(Overriding);
652 Overriders[CanonOM].add(OM->second);
727 delete VO->second;
739 for (auto &SO : OM.second) {
740 SmallVectorImpl<UniqueVirtualMethod> &Overriding = SO.second;
tools/clang/lib/AST/CommentLexer.cpp 862 const char *Begin = File.data() + LocInfo.second;
tools/clang/lib/AST/ComparisonCategories.cpp 94 return &It->second;
98 return &Data.try_emplace((char)Kind, Ctx, RD, Kind).first->second;
114 const ComparisonCategoryInfo &Info = KV.second;
132 return &Data.try_emplace((char)Kind, Ctx, RD, Kind).first->second;
tools/clang/lib/AST/DeclBase.cpp 1282 Lookup.second.setHasExternalDecls();
1487 StoredDeclsList::DeclsTy *Vec = Pos->second.getAsVector();
1488 if ((Vec && is_contained(*Vec, ND)) || Pos->second.getAsDecl() == ND)
1489 Pos->second.remove(ND);
1644 if (!R.second && !R.first->second.hasExternalDecls())
1644 if (!R.second && !R.first->second.hasExternalDecls())
1645 return R.first->second.getLookupResult();
1647 if (Source->FindExternalVisibleDeclsByName(this, Name) || !R.second) {
1651 return I->second.getLookupResult();
1670 return I->second.getLookupResult();
1689 return I != Map->end() ? I->second.getLookupResult()
1726 Pos->second.getLookupResult().begin(),
1727 Pos->second.getLookupResult().end());
tools/clang/lib/AST/DeclCXX.cpp 176 if (!SeenBaseTypes.insert(B).second)
285 if (SeenVBaseTypes.insert(C.getCanonicalType(VBase.getType())).second) {
305 if (SeenVBaseTypes.insert(C.getCanonicalType(BaseType)).second)
610 if (M.insert(RD).second)
1881 for (OverridingMethods::iterator SO = M->second.begin(),
1882 SOEnd = M->second.end();
1884 assert(SO->second.size() > 0 &&
1891 if (SO->second.front().Method->isPure()) {
tools/clang/lib/AST/DeclObjC.cpp 1943 if (!PS.insert(PDecl).second)
tools/clang/lib/AST/DeclTemplate.cpp 576 TypesAndInfos[I].second = ExpandedTInfos[I];
tools/clang/lib/AST/Expr.cpp 1256 const char *StrData = Buffer.data()+LocInfo.second;
tools/clang/lib/AST/ExprConstant.cpp 559 return &LB->second;
572 return &std::prev(UB)->second;
580 return std::prev(UB)->first.second;
821 .second;
839 .second;
993 Result = &It->second;
1797 assert(Result.second && "reused a heap alloc index?");
1798 Result.first->second.AllocExpr = E;
1799 return &Result.first->second.Value;
2066 if (CheckedTemps.insert(MTE).second) {
2265 Info.CCEDiag(Info.HeapAllocs.begin()->second.AllocExpr,
5403 StartLifetimeOfUnionMemberHandler StartLifetime{LengthAndField.second};
8403 uint64_t RemainingSrcSize = Src.Designator.validIndexAdjustments().second;
8404 uint64_t RemainingDestSize = Dest.Designator.validIndexAdjustments().second;
tools/clang/lib/AST/ExternalASTMerger.cpp 192 return It->second;
442 if (&S.getASTContext() == Origin.second.AST) {
511 ASTImporter *Importer = C.second;
tools/clang/lib/AST/Interp/ByteCodeEmitter.cpp 92 for (unsigned Reloc : It->second) {
111 return It->second - Position;
tools/clang/lib/AST/Interp/ByteCodeExprGen.cpp 288 unsigned Idx = It->second;
330 const auto &L = It->second;
tools/clang/lib/AST/Interp/Disasm.cpp 64 Func.second->dump();
tools/clang/lib/AST/Interp/EvalEmitter.cpp 202 S.Stk.push<Pointer>(reinterpret_cast<Block *>(It->second.get()));
215 auto *B = reinterpret_cast<Block *>(It->second.get());
229 auto *B = reinterpret_cast<Block *>(It->second.get());
241 S.deallocate(reinterpret_cast<Block *>(It->second.get()));
tools/clang/lib/AST/Interp/Function.cpp 31 return It->second;
41 return It->second;
tools/clang/lib/AST/Interp/InterpFrame.cpp 42 S.deallocate(reinterpret_cast<Block *>(Param.second.get()));
165 return Pointer(reinterpret_cast<Block *>(Pt->second.get()));
170 size_t BlockSize = sizeof(Block) + Desc.second->getAllocSize();
172 auto *B = new (Memory.get()) Block(Desc.second);
tools/clang/lib/AST/Interp/InterpFrame.h 84 return Pointer(reinterpret_cast<Block *>(Pt->second.get())).deref<T>();
tools/clang/lib/AST/Interp/Program.cpp 90 return It->second;
97 Index = It->second;
132 return It->second;
191 return It == Funcs.end() ? nullptr : It->second.get();
216 return It->second;
tools/clang/lib/AST/Interp/Record.cpp 33 return It->second;
39 return It->second;
45 return It->second;
tools/clang/lib/AST/Interp/State.cpp 83 return getEvalStatus().Diag->back().second;
109 return OptionalDiagnostic(&(*EvalStatus.Diag)[0].second);
tools/clang/lib/AST/ItaniumMangle.cpp 917 if (It->second < 10)
918 Out << '_' << static_cast<char>('0' + It->second);
920 Out << 'W' << (It->second - 10) << '_';
927 if (Parts.second.empty())
928 Parts.second = Parts.first;
932 Out << Parts.second.size() << Parts.second;
932 Out << Parts.second.size() << Parts.second;
4708 unsigned SeqID = I->second;
tools/clang/lib/AST/JSONNodeDumper.cpp 206 JOS.attribute("offset", SM.getDecomposedLoc(Loc).second);
tools/clang/lib/AST/Linkage.h 98 return Iter->second;
tools/clang/lib/AST/MicrosoftMangle.cpp 240 return Result.first->second;
849 Out << Found->second << '@'; // Outputs a StringRef.
852 Out << Found->second; // Outputs a back reference (an int).
1789 Out << Found->second;
1812 Out << Found->second;
tools/clang/lib/AST/ODRHash.cpp 49 ID.AddInteger(Result.first->second);
50 if (!Result.second) {
tools/clang/lib/AST/ParentMap.cpp 137 return I == M->end() ? nullptr : I->second;
tools/clang/lib/AST/RawCommentList.cpp 140 IsTrailingComment |= K.second;
240 assert(Loc1Info.second <= Loc2Info.second && "Loc1 after Loc2!");
240 assert(Loc1Info.second <= Loc2Info.second && "Loc1 after Loc2!");
242 for (unsigned I = Loc1Info.second; I != Loc2Info.second; ++I) {
242 for (unsigned I = Loc1Info.second; I != Loc2Info.second; ++I) {
261 if (I + 1 != Loc2Info.second &&
286 const unsigned CommentOffset = Loc.second;
296 const RawComment &C1 = *OrderedComments[CommentFile].rbegin()->second;
319 *OrderedComments[CommentFile].rbegin()->second =
333 return &CommentsInFile->second;
342 return Cached->second;
351 return Cached->second;
353 SourceMgr.getDecomposedLoc(C->getSourceRange().getEnd()).second;
tools/clang/lib/AST/RecordLayoutBuilder.cpp 89 BaseOffset = Known->second;
97 BaseOffset = Known->second;
241 const ClassVectorTy &Classes = I->second;
1145 if (!VisitedVirtualBases.insert(BaseDecl).second)
1780 FieldAlign = FieldInfo.second;
2810 if (Base.second >= InjectionSite)
2811 Base.second += Offset;
2842 Base.second += Offset;
2975 if (bi.second.hasVtorDisp())
3151 LazyDeclPtr Ptr = I->second;
3397 if (VtorDisps.find(VBase)->second.hasVtorDisp()) {
tools/clang/lib/AST/VTTBuilder.cpp 111 if (!VBases.insert(BaseDecl).second)
163 if (!VBases.insert(BaseDecl).second)
tools/clang/lib/AST/VTableBuilder.cpp 181 const OverridingMethods &Methods = Overrider.second;
192 assert(M.second.size() == 1 && "Final overrider is not unique!");
193 const UniqueVirtualMethod &Method = M.second.front();
391 if (!VisitedVirtualBases.insert(BaseDecl).second) {
525 return OffsetPair.second;
748 if (B.isVirtual() && VisitedVirtualBases.insert(BaseDecl).second) {
1096 return OverriddenMethods.insert(MD).second;
1106 const MethodInfo &MethodInfo = MI.second;
1154 const ThunkInfo &Thunk = TI.second;
1670 const MethodInfo &MI = I.second;
1816 if (!VBases.insert(BaseDecl).second)
1846 VBases.insert(BaseDecl).second) {
1896 VTableIndices[AP.second.VTableIndex] + AP.second.AddressPointIndex;
1896 VTableIndices[AP.second.VTableIndex] + AP.second.AddressPointIndex;
2034 AddressPointsByIndex.find(NextIndex)->second;
2042 AddressPointsByIndex.lower_bound(NextIndex)->second.getBaseOffset();
2048 assert(I.second.getBaseOffset() == BaseOffset &&
2050 const CXXRecordDecl *RD = I.second.getBase();
2074 CharUnits OffsetOffset = I.second;
2085 Out << " " << I.first << " | " << I.second.getQuantity() << '\n';
2105 const CXXMethodDecl *MD = I.second;
2186 const std::string &MethodName = I.second;
2210 assert((LHS.first != RHS.first || LHS.second == RHS.second) &&
2210 assert((LHS.first != RHS.first || LHS.second == RHS.second) &&
2227 return I->second;
2235 return I->second;
2246 return I->second;
2257 VirtualBaseClassOffsetOffsets.insert(std::make_pair(ClassPair, I.second));
2263 return I->second;
2310 VirtualBaseClassOffsetOffsets.insert(std::make_pair(ClassPair, I.second));
2503 const MethodInfo &MI = I.second;
2635 return VisitedOverriddenMethods.insert(OverriddenMD).second;
2825 if (!VBaseMapEntry->second.hasVtorDisp() ||
2831 CharUnits OffsetOfVBaseWithVFPtr = VBaseMapEntry->second.VBaseOffset;
2878 Groups[J->second].push_back(MD->getCanonicalDecl());
2972 MethodInfo &OverriddenMethodInfo = OverriddenMDIterator->second;
3188 const CXXMethodDecl *MD = MethodNameAndDecl.second;
3587 if (!Insert.second) {
3588 const MethodVFTableLocation &NewLoc = Loc.second;
3589 MethodVFTableLocation &OldLoc = Insert.first->second;
3618 IndicesMap[I.second] = MethodName + " [scalar deleting]";
3620 IndicesMap[I.second] = MethodName;
3623 if (!I.second.VFPtrOffset.isZero() || I.second.VBTableIndex != 0)
3623 if (!I.second.VFPtrOffset.isZero() || I.second.VBTableIndex != 0)
3652 const std::string &MethodName = I.second;
3704 return VBInfo.VBTableIndices.find(VBase)->second;
3741 return I->second;
3749 return I->second;
tools/clang/lib/ASTMatchers/ASTMatchFinder.cpp 410 *Builder = I->second.Nodes;
411 return I->second.ResultOfMatch;
553 Timer.setBucket(&TimeByBucket[MP.second->getID()]);
556 MatchVisitor Visitor(ActiveASTContext, MP.second);
566 it != MatcherFiltersMap.end() ? it->second : getFilterForKind(Kind);
577 Timer.setBucket(&TimeByBucket[MP.second->getID()]);
580 MatchVisitor Visitor(ActiveASTContext, MP.second);
658 *Builder = I->second.Nodes;
659 return I->second.ResultOfMatch;
730 if (Visited.insert(Parent.getMemoizationData()).second)
767 for (const TypedefNameDecl *Alias : Aliases->second) {
784 for (const ObjCCompatibleAliasDecl *Alias : Aliases->second) {
tools/clang/lib/ASTMatchers/Dynamic/Diagnostics.cpp 137 if (Pieces.second.empty()) break;
139 const char Next = Pieces.second.front();
140 FormatString = Pieces.second.drop_front();
tools/clang/lib/ASTMatchers/Dynamic/Parser.cpp 328 ++P->ContextStack.back().second;
tools/clang/lib/ASTMatchers/Dynamic/Registry.cpp 572 unsigned ArgNumber = CtxEntry.second;
tools/clang/lib/Analysis/AnalysisDeclContext.cpp 197 return itr->second;
209 PM.setParent(I->first, PM.getParent(I->second));
602 if (Visited.insert(VD).second)
tools/clang/lib/Analysis/CFG.cpp 792 cachedEntry->second = B;
812 cachedEntry->second = B;
842 cachedEntry->second = B;
1188 return I->second; // already in map;
1556 JumpTarget JT = LI->second;
1574 JumpTarget JT = LI->second;
1595 addSuccessor(B, LI->second.block);
3252 JumpTarget JT = I->second;
4916 if (!IteratorAndFlag.second) {
5143 if (currentBlock >= 0 && I->second.first == (unsigned) currentBlock
5144 && I->second.second == currStmt) {
5144 && I->second.second == currStmt) {
5148 OS << "[B" << I->second.first << "." << I->second.second << "]";
5148 OS << "[B" << I->second.first << "." << I->second.second << "]";
5148 OS << "[B" << I->second.first << "." << I->second.second << "]";
5158 if (currentBlock >= 0 && I->second.first == (unsigned) currentBlock
5159 && I->second.second == currStmt) {
5159 && I->second.second == currStmt) {
5163 OS << "[B" << I->second.first << "." << I->second.second << "]";
5163 OS << "[B" << I->second.first << "." << I->second.second << "]";
5163 OS << "[B" << I->second.first << "." << I->second.second << "]";
tools/clang/lib/Analysis/CFGStmtMap.cpp 35 CFGBlock *B = I->second;
tools/clang/lib/Analysis/CallGraph.cpp 196 return I->second.get();
tools/clang/lib/Analysis/CloneDetection.cpp 398 NewGroup.push_back(StmtsByHash[i].second);
tools/clang/lib/Analysis/Consumed.cpp 523 return Entry->second;
539 insertInfo(To, Entry->second);
548 PropagationInfo& PInfo = Entry->second;
561 PropagationInfo& PInfo = Entry->second;
571 PropagationInfo& PInfo = Entry->second;
628 if (Entry == PropagationMap.end() || Entry->second.isTest())
630 PropagationInfo PInfo = Entry->second;
643 if (!(Entry->second.isVar() || Entry->second.isTmp()))
643 if (!(Entry->second.isVar() || Entry->second.isTmp()))
663 PropagationInfo PInfo = Entry->second;
710 if (LEntry != PropagationMap.end() && LEntry->second.isVarTest()) {
711 LTest = LEntry->second.getVarTest();
717 if (REntry != PropagationMap.end() && REntry->second.isVarTest()) {
718 RTest = REntry->second.getVarTest();
765 if (Entry != PropagationMap.end() && !Entry->second.isTest()) {
766 StateMap->setState(Temp, Entry->second.getAsState(StateMap));
883 ConsumedState RetState = Entry->second.getAsState(StateMap);
902 PropagationMap.insert(PairType(UOp, Entry->second));
906 if (Entry->second.isTest())
907 PropagationMap.insert(PairType(UOp, Entry->second.invertTest()));
921 PropagationInfo PInfo = VIT->second;
1101 if (DM.second != ExpectedState)
1104 stateToString(DM.second));
1117 return Entry->second;
1127 return Entry->second;
1146 if (LocalState != DM.second)
1164 if (LocalState != DM.second) {
1193 if (this->getState(DM.first) != DM.second)
tools/clang/lib/Analysis/ExprMutationAnalyzer.cpp 126 return Memoized->second;
456 return Memoized->second;
tools/clang/lib/Analysis/PostOrderCFGView.cpp 46 unsigned b1V = (b1It == POV.BlockOrder.end()) ? 0 : b1It->second;
47 unsigned b2V = (b2It == POV.BlockOrder.end()) ? 0 : b2It->second;
tools/clang/lib/Analysis/ReachableCode.cpp 476 if (p1->second->getBeginLoc() < p2->second->getBeginLoc())
476 if (p1->second->getBeginLoc() < p2->second->getBeginLoc())
478 if (p2->second->getBeginLoc() < p1->second->getBeginLoc())
478 if (p2->second->getBeginLoc() < p1->second->getBeginLoc())
537 reportDeadCode(Block, I->second, CB);
tools/clang/lib/Analysis/RetainSummaryManager.cpp 539 return I->second;
592 ArgEffect Translated = getStopTrackingHardEquivalent(I->second);
tools/clang/lib/Analysis/ThreadSafety.cpp 463 Context Result = SavedContexts[CtxIndex].second;
658 else if (*i2 != P.second) // variable exists, but has different definition
670 Result = addReference(P.first, P.second, Result);
679 unsigned i1 = P.second;
1132 Info = It->second.get();
tools/clang/lib/Analysis/ThreadSafetyCommon.cpp 74 return It->second;
652 assert(CurrentLVarMap[It->second].first == VD);
653 return CurrentLVarMap[It->second].second;
653 return CurrentLVarMap[It->second].second;
687 CurrentLVarMap.elem(It->second).second = E;
687 CurrentLVarMap.elem(It->second).second = E;
698 til::SExpr *CurrE = CurrentLVarMap[i].second;
729 CurrentLVarMap.elem(i).second = Ph;
757 if (CurrentLVarMap[i].second != Map[i].second)
757 if (CurrentLVarMap[i].second != Map[i].second)
758 makePhiNodeVar(i, NPreds, Map[i].second);
tools/clang/lib/Analysis/UninitializedValues.cpp 92 return I->second;
361 return I->second;
tools/clang/lib/Basic/Diagnostic.cpp 48 string = nullability.second ? "'nonnull'" : "'_Nonnull'";
52 string = nullability.second ? "'nullable'" : "'_Nullable'";
56 string = nullability.second ? "'null_unspecified'" : "'_Null_unspecified'";
176 unsigned Offset = Decomp.second;
203 return F->lookup(Decomp.second);
221 if (Range.first != Range.second)
222 return &Range.first->second;
223 auto &F = Files.insert(Range.first, std::make_pair(ID, File()))->second;
230 F.ParentOffset = Decomp.second;
231 F.StateTransitions.push_back({F.Parent->lookup(Decomp.second), 0});
253 File &File = F.second;
262 if (F.second.Parent) {
265 assert(File.ParentOffset == Decomp.second);
269 .getLocWithOffset(Decomp.second)
311 switch (Mapping.second.getSeverity()) {
319 if (!Mapping.second.isUser())
321 if (Mapping.second.isPragma())
323 if (Mapping.second.hasNoWarningAsError())
325 if (Mapping.second.hasNoErrorAsFatal())
327 if (Mapping.second.wasUpgradedFromWarning())
tools/clang/lib/Basic/DiagnosticIDs.cpp 218 if (Result.second)
219 Result.first->second = GetDefaultDiagMapping(Diag);
221 return Result.first->second;
280 return DiagInfo[DiagID-DIAG_UPPER_LIMIT].second;
296 return I->second;
tools/clang/lib/Basic/FileManager.cpp 142 if (!SeenDirInsertResult.second) {
209 if (!SeenFileInsertResult.second) {
551 return Known->second;
tools/clang/lib/Basic/Module.cpp 149 Current->Requirements[I].second) {
414 if (VisibleModulesCache.insert(CurrModule).second)
444 if (!Requirements[I].second)
tools/clang/lib/Basic/SourceLocation.cpp 184 ImportLoc.second);
tools/clang/lib/Basic/SourceManager.cpp 232 if (IterBool.second)
334 LineTable->AddLineNote(LocInfo.first, LocInfo.second, LineNo, FilenameID,
367 if (I->second) {
368 I->second->~ContentCache();
369 ContentCacheAlloc.Deallocate(I->second);
416 Slot = CloneContentCache(FileInfo.second);
443 : overI->second,
444 overI->second);
930 Loc = Loc.getLocWithOffset(LocInfo.second);
990 return Loc.getLocWithOffset(LocInfo.second);
1054 if (DecompLoc.second > 0)
1146 return Buffer->getBufferStart() + (CharDataInvalid? 0 : LocInfo.second);
1210 return getColumnNumber(LocInfo.first, LocInfo.second, Invalid);
1217 return getColumnNumber(LocInfo.first, LocInfo.second, Invalid);
1380 return getLineNumber(LocInfo.first, LocInfo.second);
1386 return getLineNumber(LocInfo.first, LocInfo.second);
1422 LineTable->FindNearestLineEntry(LocInfo.first, LocInfo.second);
1473 unsigned LineNo = getLineNumber(LocInfo.first, LocInfo.second, &Invalid);
1476 unsigned ColNo = getColumnNumber(LocInfo.first, LocInfo.second, &Invalid);
1488 LineTable->FindNearestLineEntry(LocInfo.first, LocInfo.second)) {
1540 LineTable->FindNearestLineEntry(LocInfo.first, LocInfo.second))
1826 SourceLocation EndOffsMappedLoc = I->second;
1862 SourceLocation MacroArgExpandedLoc = I->second;
1878 DecompTy &DecompLoc = InsertOp.first->second;
1879 if (!InsertOp.second)
1932 return I->second;
1958 return InSameTU.second;
1990 return LOffs.second < ROffs.second;
1990 return LOffs.second < ROffs.second;
2000 return std::make_pair(true, LOffs.second < ROffs.second);
2000 return std::make_pair(true, LOffs.second < ROffs.second);
2011 true, IsBeforeInTUCache.getCachedResult(LOffs.second, ROffs.second));
2011 true, IsBeforeInTUCache.getCachedResult(LOffs.second, ROffs.second));
2040 IsBeforeInTUCache.setCommonLoc(LOffs.first, LOffs.second, ROffs.second);
2040 IsBeforeInTUCache.setCommonLoc(LOffs.first, LOffs.second, ROffs.second);
2042 true, IsBeforeInTUCache.getCachedResult(LOffs.second, ROffs.second));
2042 true, IsBeforeInTUCache.getCachedResult(LOffs.second, ROffs.second));
2065 NumLineNumsComputed += I->second->SourceLineCache != nullptr;
2066 NumFileBytesMapped += I->second->getSizeBytesMapped();
tools/clang/lib/CodeGen/BackendUtil.cpp 1383 if (GlobalList.second.SummaryList.empty())
1387 for (auto &Summary : GlobalList.second.SummaryList) {
tools/clang/lib/CodeGen/CGAtomic.cpp 1678 Res.second);
1793 CGF.Builder.CreateCondBr(Res.second, ExitBB, ContBB);
1873 CGF.Builder.CreateCondBr(Res.second, ExitBB, ContBB);
tools/clang/lib/CodeGen/CGBlocks.cpp 561 maxFieldAlign = std::max(maxFieldAlign, tinfo.second);
563 layout.push_back(BlockLayoutChunk(tinfo.second, tinfo.first,
1022 I.second);
1072 src = I->second;
1323 if (capture.isConstant()) return LocalDeclMap.find(variable)->second;
1354 bool Ok = EmittedGlobalBlocks.insert(std::make_pair(BE, Addr)).second;
1534 setAddrOfLocalVar(var, i->second);
1662 auto addr = LocalDeclMap.find(variable)->second;
1766 CopyInfo.second, DisposeInfo.second, CI,
1766 CopyInfo.second, DisposeInfo.second, CI,
2733 return it->second;
2812 assert(pair.second && "info was inserted recursively?");
2813 return pair.first->second;
tools/clang/lib/CodeGen/CGBlocks.h 277 return it->second;
tools/clang/lib/CodeGen/CGBuiltin.cpp 588 const ImplicitParamDecl *D = Iter->second;
592 return EmitLoadOfScalar(DIter->second, /*Volatile=*/false,
1491 if (!Seen.insert(Record).second)
1828 Value *Imag = ComplexVal.second;
1892 return RValue::get(ComplexVal.second);
tools/clang/lib/CodeGen/CGCall.cpp 763 bool inserted = FunctionsBeingProcessed.insert(FI).second;
1095 IRCallArgs[IRCallArgPos++] = CV.second;
1543 bool Inserted = FunctionsBeingProcessed.insert(&FI).second;
2130 getLLVMContext(), info.second.getAsAlign()));
tools/clang/lib/CodeGen/CGClass.cpp 2549 if (!VBases.insert(BaseDecl).second)
tools/clang/lib/CodeGen/CGCleanup.cpp 53 llvm::StructType::get(V.first->getType(), V.second->getType());
56 CGF.Builder.CreateStore(V.second, CGF.Builder.CreateStructGEP(addr, 1));
346 if (!CasesAdded.insert(Fixup.Destination).second)
403 if (!ModifiedOptimisticBlocks.insert(BranchBB).second)
tools/clang/lib/CodeGen/CGCleanup.h 375 if (ExtInfo.Branches.insert(Block).second)
391 return ExtInfo->BranchAfters[I].second;
410 return getExtInfo().Branches.insert(Block).second;
tools/clang/lib/CodeGen/CGCoroutine.cpp 365 SavedLocals.insert({ PD, it->second });
369 it->second = copyIt->getSecond();
374 LocalDeclMap.insert({SavedLocal.first, SavedLocal.second});
tools/clang/lib/CodeGen/CGDebugInfo.cpp 70 DebugPrefixMap[KV.first] = KV.second;
212 llvm::Metadata *V = I->second;
423 if (llvm::Metadata *V = It->second)
482 return (Twine(Entry.second) + Path.substr(Entry.first.size())).str();
554 MainFile->getName().rsplit('.').second)
1440 assert(MI->second &&
1442 elements.push_back(MI->second);
1678 : static_cast<llvm::Metadata *>(MI->second));
1707 if (!SeenTypes.insert(Base).second)
2070 if (I == TypeCache.end() || !cast<llvm::DIType>(I->second)->isForwardDecl())
2145 if (I != TypeCache.end() && !cast<llvm::DIType>(I->second)->isForwardDecl())
2376 return cast<llvm::DIModule>(ModRef->second);
2389 bool Undef = M.second;
2512 if (!PropertySet.insert(PD->getIdentifier()).second)
2921 if (llvm::Metadata *V = It->second)
3412 auto N = I->second;
3447 auto *SP = dyn_cast_or_null<llvm::DISubprogram>(MI->second);
3455 auto *SP = dyn_cast_or_null<llvm::DISubprogram>(MI->second);
3560 auto *SP = dyn_cast_or_null<llvm::DISubprogram>(FI->second);
3640 cast<llvm::DICompositeType>(It->second);
3737 SP = dyn_cast_or_null<llvm::DISubprogram>(FI->second);
4345 assert(MI->second && "Static data member declaration should still exist");
4346 return MI->second;
4392 cast<llvm::DIGlobalVariableExpression>(Cached->second));
4625 return cast<llvm::DINamespace>(I->second);
4657 auto *DIParm = cast<llvm::DILocalVariable>(I->second);
4677 if (P.second.empty())
4685 cast<llvm::DICompositeType>(It->second);
4690 for (auto &MD : P.second)
4698 assert(P.second);
4699 auto *Ty = cast<llvm::DIType>(P.second);
4704 assert(It->second);
4707 cast<llvm::DIType>(It->second));
4711 assert(P.second);
4712 llvm::TempMDNode FwdDecl(cast<llvm::MDNode>(P.second));
4720 Repl = P.second;
4722 Repl = It->second;
tools/clang/lib/CodeGen/CGDecl.cpp 439 LocalDeclMap.find(&D)->second = Address(castedAddr, alignment);
tools/clang/lib/CodeGen/CGDeclCXX.cpp 451 if (I != DelayedCXXInitPosition.end() && I->second == ~0U)
514 } else if (I->second != ~0U) {
515 assert(I->second < CXXGlobalInits.size() &&
516 CXXGlobalInits[I->second] == nullptr);
517 CXXGlobalInits[I->second] = Fn;
570 LocalCXXGlobalInits.push_back(I->second);
tools/clang/lib/CodeGen/CGException.cpp 846 if (catchTypes.insert(handler.Type.RTTI).second)
1721 int FrameEscapeIdx = InsertPair.first->second;
1816 Address ParentVar = I->second;
tools/clang/lib/CodeGen/CGExpr.cpp 915 const ImplicitParamDecl *PassedSizeDecl = PassedSizeIt->second;
917 Address AddrOfSize = LocalDeclMap.find(PassedSizeDecl)->second;
1010 ComplexPairTy IncVal(NextVal, InVal.second);
2572 return EmitLoadOfReferenceLValue(I->second, VD->getType(),
2574 return MakeAddrLValue(I->second, T);
2614 addr = iter->second;
3022 CGM.getCodeGenOpts().SanitizeTrap.has(Checked[i].second)
3024 : CGM.getCodeGenOpts().SanitizeRecover.has(Checked[i].second)
3042 CheckRecoverableKind RecoverKind = getRecoverableKind(Checked[0].second);
3043 assert(SanOpts.has(Checked[0].second));
3046 assert(RecoverKind == getRecoverableKind(Checked[i].second) &&
3048 assert(SanOpts.has(Checked[i].second));
3255 SanitizerMask Mask = CheckKindMaskPair.second;
4464 return it->second;
4478 return it->second;
tools/clang/lib/CodeGen/CGExprAgg.cpp 1014 Value *CmpImag = EmitCompare(Builder, CGF, E, LHSValues.second,
1015 RHSValues.second, K, ".i");
tools/clang/lib/CodeGen/CGExprCXX.cpp 505 CharUnits LastStoreSize = LastStore.second;
542 CharUnits StoreSize = Store.second;
556 CharUnits StoreSize = Store.second;
tools/clang/lib/CodeGen/CGExprComplex.cpp 229 Scope.ForceCleanup({&Vals.first, &Vals.second});
382 Builder.CreateStore(Val.second, ImagPtr, lvalue.isVolatileQualified());
434 Val.second = CGF.EmitScalarConversion(Val.second, SrcType, DestType, Loc);
434 Val.second = CGF.EmitScalarConversion(Val.second, SrcType, DestType, Loc);
554 ResI = Builder.CreateFNeg(Op.second, "neg.i");
557 ResI = Builder.CreateNeg(Op.second, "neg.i");
568 if (Op.second->getType()->isFloatingPointTy())
569 ResI = Builder.CreateFNeg(Op.second, "conj.i");
571 ResI = Builder.CreateNeg(Op.second, "conj.i");
581 if (Op.LHS.second && Op.RHS.second)
581 if (Op.LHS.second && Op.RHS.second)
582 ResI = Builder.CreateFAdd(Op.LHS.second, Op.RHS.second, "add.i");
582 ResI = Builder.CreateFAdd(Op.LHS.second, Op.RHS.second, "add.i");
584 ResI = Op.LHS.second ? Op.LHS.second : Op.RHS.second;
584 ResI = Op.LHS.second ? Op.LHS.second : Op.RHS.second;
584 ResI = Op.LHS.second ? Op.LHS.second : Op.RHS.second;
588 assert(Op.LHS.second && Op.RHS.second &&
588 assert(Op.LHS.second && Op.RHS.second &&
590 ResI = Builder.CreateAdd(Op.LHS.second, Op.RHS.second, "add.i");
590 ResI = Builder.CreateAdd(Op.LHS.second, Op.RHS.second, "add.i");
599 if (Op.LHS.second && Op.RHS.second)
599 if (Op.LHS.second && Op.RHS.second)
600 ResI = Builder.CreateFSub(Op.LHS.second, Op.RHS.second, "sub.i");
600 ResI = Builder.CreateFSub(Op.LHS.second, Op.RHS.second, "sub.i");
602 ResI = Op.LHS.second ? Op.LHS.second
602 ResI = Op.LHS.second ? Op.LHS.second
603 : Builder.CreateFNeg(Op.RHS.second, "sub.i");
607 assert(Op.LHS.second && Op.RHS.second &&
607 assert(Op.LHS.second && Op.RHS.second &&
609 ResI = Builder.CreateSub(Op.LHS.second, Op.RHS.second, "sub.i");
609 ResI = Builder.CreateSub(Op.LHS.second, Op.RHS.second, "sub.i");
620 Args.add(RValue::get(Op.LHS.second),
624 Args.add(RValue::get(Op.RHS.second),
690 if (Op.LHS.second && Op.RHS.second) {
690 if (Op.LHS.second && Op.RHS.second) {
702 Value *BD = Builder.CreateFMul(Op.LHS.second, Op.RHS.second, "mul_bd");
702 Value *BD = Builder.CreateFMul(Op.LHS.second, Op.RHS.second, "mul_bd");
703 Value *AD = Builder.CreateFMul(Op.LHS.first, Op.RHS.second, "mul_ad");
704 Value *BC = Builder.CreateFMul(Op.LHS.second, Op.RHS.first, "mul_bc");
751 assert((Op.LHS.second || Op.RHS.second) &&
751 assert((Op.LHS.second || Op.RHS.second) &&
759 ResI = Op.LHS.second
760 ? Builder.CreateFMul(Op.LHS.second, Op.RHS.first, "mul.il")
761 : Builder.CreateFMul(Op.LHS.first, Op.RHS.second, "mul.ir");
763 assert(Op.LHS.second && Op.RHS.second &&
763 assert(Op.LHS.second && Op.RHS.second &&
766 Value *ResRr = Builder.CreateMul(Op.LHS.second, Op.RHS.second, "mul.rr");
766 Value *ResRr = Builder.CreateMul(Op.LHS.second, Op.RHS.second, "mul.rr");
769 Value *ResIl = Builder.CreateMul(Op.LHS.second, Op.RHS.first, "mul.il");
770 Value *ResIr = Builder.CreateMul(Op.LHS.first, Op.RHS.second, "mul.ir");
779 llvm::Value *LHSr = Op.LHS.first, *LHSi = Op.LHS.second;
780 llvm::Value *RHSr = Op.RHS.first, *RHSi = Op.RHS.second;
795 LibCallOp.LHS.second = llvm::Constant::getNullValue(LHSr->getType());
839 assert(Op.LHS.second && Op.RHS.second &&
839 assert(Op.LHS.second && Op.RHS.second &&
1050 ImagPN->addIncoming(LHS.second, LHSBlock);
1051 ImagPN->addIncoming(RHS.second, RHSBlock);
tools/clang/lib/CodeGen/CGExprConstant.cpp 1435 assert(PlaceholderAddresses.back().second == placeholder);
1491 entry.first->replaceAllUsesWith(entry.second);
1516 setLocation(it->second);
2160 bool Ok = EmittedCompoundLiterals.insert(std::make_pair(CLE, GV)).second;
tools/clang/lib/CodeGen/CGExprScalar.cpp 1016 if (!CGF.SanOpts.has(Check.second.second))
1016 if (!CGF.SanOpts.has(Check.second.second))
1023 CGF.EmitCheck(Check.second, SanitizerHandler::ImplicitConversion, StaticArgs,
1145 Checks.emplace_back(Check.second);
1155 Checks.emplace_back(Check.second);
1513 Src.second = EmitScalarConversion(Src.second, SrcTy, DstTy, Loc);
1513 Src.second = EmitScalarConversion(Src.second, SrcTy, DstTy, Loc);
1514 return Builder.CreateOr(Src.first, Src.second, "tobool");
2565 llvm::Value *success = Pair.second;
2796 return CGF.EmitComplexExpr(Op, true, false).second;
2921 llvm::Value *success = Pair.second;
3863 LHS.second = llvm::Constant::getNullValue(LHS.first->getType());
3874 RHS.second = llvm::Constant::getNullValue(RHS.first->getType());
3882 ResultI = Builder.CreateFCmp(FCmpOpc, LHS.second, RHS.second, "cmp.i");
3882 ResultI = Builder.CreateFCmp(FCmpOpc, LHS.second, RHS.second, "cmp.i");
3887 ResultI = Builder.CreateICmp(UICmpOpc, LHS.second, RHS.second, "cmp.i");
3887 ResultI = Builder.CreateICmp(UICmpOpc, LHS.second, RHS.second, "cmp.i");
tools/clang/lib/CodeGen/CGObjCGNU.cpp 1539 InitStructBuilder.add(bounds.second);
1596 clsAlias.second, { MakeConstantString(clsAlias.second),
1596 clsAlias.second, { MakeConstantString(clsAlias.second),
1646 b.CreateStructGEP(lateInit.second.first, lateInit.second.second), CGM.getPointerAlign().getQuantity());
1646 b.CreateStructGEP(lateInit.second.first, lateInit.second.second), CGM.getPointerAlign().getQuantity());
1646 b.CreateStructGEP(lateInit.second.first, lateInit.second.second), CGM.getPointerAlign().getQuantity());
2324 SelValue = i->second;
2753 llvm::PHINode *phi2 = Builder.CreatePHI(v.second->getType(), 2);
2754 phi2->addIncoming(v.second, messageBB);
2755 phi2->addIncoming(llvm::Constant::getNullValue(v.second->getType()),
3298 if (!PropertySet.insert(PD->getIdentifier()).second)
3322 if (!PropertySet.insert(PD->getIdentifier()).second)
3685 selectorAliases.push_back(sel.second);
3839 {TheClass, MakeConstantString(iter->second)});
tools/clang/lib/CodeGen/CGObjCMac.cpp 1816 imag->addIncoming(callResult.second, callBB);
3224 if (!PropertySet.insert(PD->getIdentifier()).second)
3273 if (!PropertySet.insert(PD->getIdentifier()).second)
5152 return I->second;
5562 llvm::GlobalVariable *global = entry.second;
tools/clang/lib/CodeGen/CGOpenMPRuntime.cpp 824 RValue Func = RValue::get(Reduction.second);
1014 Size = CGF.Builder.CreatePtrDiff(SharedAddresses[N].second.getPointer(),
1039 assert(!Size && !Sizes[N].second &&
1328 StringRef MangledName = CGM.getMangledName(Pair.second.second);
1328 StringRef MangledName = CGM.getMangledName(Pair.second.second);
1331 (void)tryEmitDeclareVariant(Pair.second.first, Pair.second.second, Addr,
1331 (void)tryEmitDeclareVariant(Pair.second.first, Pair.second.second, Addr,
1331 (void)tryEmitDeclareVariant(Pair.second.first, Pair.second.second, Addr,
1426 Decls.second.push_back(D);
1434 return I->second;
1603 assert(!Elem.second.ServiceInsertPt && "Insert point is set already.");
1607 Elem.second.ServiceInsertPt = new llvm::BitCastInst(
1610 Elem.second.ServiceInsertPt =
1612 Elem.second.ServiceInsertPt->insertAfter(CGF.AllocaInsertPt);
1618 if (Elem.second.ServiceInsertPt) {
1619 llvm::Instruction *Ptr = Elem.second.ServiceInsertPt;
1620 Elem.second.ServiceInsertPt = nullptr;
1640 LocValue = Address(I->second.DebugLoc, Align);
1648 Elem.second.DebugLoc = AI.getPointer();
1651 if (!Elem.second.ServiceInsertPt)
1654 CGF.Builder.SetInsertPoint(Elem.second.ServiceInsertPt);
1695 ThreadID = I->second.ThreadID;
1718 Elem.second.ThreadID = ThreadID;
1730 if (!Elem.second.ServiceInsertPt)
1733 CGF.Builder.SetInsertPoint(Elem.second.ServiceInsertPt);
1738 Elem.second.ThreadID = Call;
1755 for(auto *D : I->second)
2762 if (VD && ThreadPrivateWithDefinition.insert(CGM.getMangledName(VD)).second) {
2887 if (VD && !DeclareTargetWithDefinition.insert(CGM.getMangledName(VD)).second)
3932 auto PerFile = PerDevice->second.find(FileID);
3933 if (PerFile == PerDevice->second.end())
3935 auto PerParentName = PerFile->second.find(ParentName);
3936 if (PerParentName == PerFile->second.end())
3942 if (PerLine->second.getAddress() || PerLine->second.getID())
3942 if (PerLine->second.getAddress() || PerLine->second.getID())
3951 for (const auto &F : D.second)
3952 for (const auto &P : F.second)
3954 Action(D.first, F.first, P.first(), L.first, L.second);
4404 const VarDecl *VD = Pair.second.Original;
4734 const VarDecl *VD = Args[PrivateVarsPos[Privates[Counter].second.Original]];
4778 const VarDecl *VD = Pair.second.PrivateCopy;
4783 if (const VarDecl *Elem = Pair.second.PrivateElemInit) {
4784 const VarDecl *OriginalVD = Pair.second.Original;
4856 const VarDecl *VD = Pair.second.PrivateCopy;
5228 const Expr *E = Data.Dependences[I].second;
6024 if (RCG.getSizes(N).second) {
6098 if (RCG.getSizes(N).second) {
6171 if (RCG.getSizes(N).second) {
6298 if (Sizes.second) {
6299 llvm::Value *SizeVal = CGF.Builder.CreateIntCast(Sizes.second, CGM.SizeTy,
7869 DevPointersMap[L.first].push_back(L.second);
7886 llvm::Value *LB = PartialStruct.LowestElem.second.getPointer();
7889 llvm::Value *HB = PartialStruct.HighestElem.second.getPointer();
7942 InfoGen(L.first, L.second, C->getMapType(), C->getMapTypeModifiers(),
7947 InfoGen(L.first, L.second, OMPC_MAP_to, llvm::None,
7952 InfoGen(L.first, L.second, OMPC_MAP_from, llvm::None,
7968 assert(!L.second.empty() && "Not expecting empty list of components!");
7969 const ValueDecl *VD = L.second.back().getAssociatedDeclaration();
7971 const Expr *IE = L.second.back().getAssociatedExpression();
7981 It->second.begin(), It->second.end(), [VD](const MapInfo &MI) {
7981 It->second.begin(), It->second.end(), [VD](const MapInfo &MI) {
7986 if (CI != It->second.end()) {
8003 InfoGen(nullptr, L.second, OMPC_MAP_unknown, llvm::None,
8029 for (const MapInfo &L : M.second) {
8061 for (const DeferredDevicePtrEntryTy &L : CI->second) {
8121 InfoGen(L.first, L.second, MC->getMapType(), MC->getMapTypeModifiers(),
8138 for (const MapInfo &L : M.second) {
8201 LValue VarLVal = CGF.EmitLValueForFieldInitialization(VDLVal, It->second);
8203 LValue VarLValVal = CGF.EmitLValueForField(VDLVal, It->second);
8292 assert(!L.second.empty() &&
8294 DeclComponentLists.emplace_back(L.second, C->getMapType(),
8455 C->getMapType(), C->getMapTypeModifiers(), L.second, BasePointers,
9077 Decls.second.push_back(D);
9851 return !AlreadyEmittedTargetFunctions.insert(Name).second;
tools/clang/lib/CodeGen/CGOpenMPRuntimeNVPTX.cpp 260 const ValueDecl *VD = Pair.second;
2055 std::swap(TeamAndReductions.second, LastPrivatesReductions);
2310 LValue VarAddr = CGF.EmitLValueForField(Base, Rec.second.FD);
2313 if (Rec.second.IsOnePerTeam) {
2314 VarTy = Rec.second.FD->getType();
2320 Rec.second.FD->getType()->castAsArrayTypeUnsafe()->getElementType();
2325 Rec.second.PrivateAddr = VarAddr.getAddress();
2332 assert(SecIt->second.IsOnePerTeam &&
2334 LValue SecVarAddr = CGF.EmitLValueForField(SecBase, SecIt->second.FD);
2339 Rec.second.PrivateAddr = VarAddr.getAddress();
2341 Address GlobalPtr = Rec.second.PrivateAddr;
2342 Address LocalAddr = CGF.CreateMemTemp(VarTy, Rec.second.FD->getName());
2343 Rec.second.PrivateAddr = Address(
4681 CheckVarsEscapingDeclContext VarChecker(CGF, TeamAndReductions.second);
4686 TeamAndReductions.second.clear();
4797 return VDI->second.PrivateAddr;
4806 return VDI->second.PrivateAddr;
4886 LValue VarLVal = CGF.EmitLValueForFieldInitialization(VDLVal, It->second);
5008 Data.second = CGM.getLangOpts().OpenMPCUDABlocksPerSM;
5009 if (Data.first && Data.second)
5143 llvm::APInt Size1(32, SMsBlockPerSM.second);
tools/clang/lib/CodeGen/CGRecordLayout.h 209 return it->second;
tools/clang/lib/CodeGen/CGRecordLayoutBuilder.cpp 548 if (Layout.getVBaseOffsetsMap().find(BaseDecl)->second.hasVtorDisp())
670 Members.push_back(StorageInfo(Pad->first, getByteArrayType(Pad->second)));
879 BFIs.push_back(std::make_pair(Index, &it->second));
884 BFIs[i].second->print(OS);
tools/clang/lib/CodeGen/CGStmt.cpp 578 JumpDest &dest = CGF.LabelMap.find(*i)->second;
tools/clang/lib/CodeGen/CGStmtOpenMP.cpp 134 if (EmittedAsPrivate.insert(OrigVD->getCanonicalDecl()).second) {
580 if (LocalAddrPair.second.first) {
581 LocalScope.addPrivate(LocalAddrPair.second.first, [&LocalAddrPair]() {
582 return LocalAddrPair.second.second;
582 return LocalAddrPair.second.second;
588 VLASizeMap[VLASizePair.second.first] = VLASizePair.second.second;
588 VLASizeMap[VLASizePair.second.first] = VLASizePair.second.second;
588 VLASizeMap[VLASizePair.second.first] = VLASizePair.second.second;
613 I->second.second,
613 I->second.second,
614 I->second.first ? I->second.first->getType() : Arg->getType(),
614 I->second.first ? I->second.first->getType() : Arg->getType(),
620 CallArg = EI->second.second;
620 CallArg = EI->second.second;
788 if (EmittedAsFirstprivate.insert(OrigVD->getCanonicalDecl()).second) {
884 if (EmittedAsPrivate.insert(OrigVD->getCanonicalDecl()).second) {
916 if (CopiedVars.insert(VD->getCanonicalDecl()).second) {
996 if (AlreadyEmittedVars.insert(OrigVD->getCanonicalDecl()).second) {
1070 if (AlreadyEmittedVars.insert(CanonicalVD).second) {
2044 llvm::Value *UBVal = DispatchBounds.second;
2369 LValue UB = Bounds.second;
2914 if (EmittedAsPrivate.insert(OrigVD->getCanonicalDecl()).second) {
2928 if (EmittedAsPrivate.insert(OrigVD->getCanonicalDecl()).second) {
2944 if (EmittedAsPrivate.insert(OrigVD->getCanonicalDecl()).second) {
3024 const auto *OrigVD = cast<VarDecl>(Pair.second->getDecl());
3028 Pair.second->getType(), VK_LValue,
3029 Pair.second->getExprLoc());
3035 Address Replacement(CGF.Builder.CreateLoad(Pair.second),
3247 Address Replacement(CGF.Builder.CreateLoad(Pair.second),
3673 ComplexVal.second = CGF.EmitScalarConversion(
3674 Val.getComplexVal().second, SrcElementType, DestElementType, Loc);
3912 return RValue::getComplex(Res.first, Res.second);
3965 NewVVal = Res.second;
3970 CodeGenFunction::OpaqueValueMapping MapX(CGF, XRValExpr, Res.second);
3989 NewVVal = IsPostfixUpdate ? Res.second : ExprRValue;
4674 Address InitAddr = Builder.CreateBitCast(InitAddrIt->second, AddrTy);
tools/clang/lib/CodeGen/CGVTT.cpp 135 return I->second;
145 SubVTTIndicies.insert(std::make_pair(ClassSubobjectPair, I->second));
151 return I->second;
161 return I->second;
172 SecondaryVirtualPointerIndices.insert(std::make_pair(Pair, I->second));
178 return I->second;
tools/clang/lib/CodeGen/CGVTables.cpp 707 auto &thunkInfo = layout.vtable_thunks()[nextVTableThunkIndex].second;
1079 AP.first.getBase(), VTLayout.getVTableOffset(AP.second.VTableIndex) +
1080 AP.second.AddressPointIndex));
1105 return AP1.second < AP2.second;
1105 return AP1.second < AP2.second;
1111 AddVTableTypeMetadata(VTable, PointerWidth * AP.second, AP.first);
tools/clang/lib/CodeGen/CGValue.h 101 return getComplex(C.first, C.second);
tools/clang/lib/CodeGen/CodeGenAction.cpp 470 Loc.getLocWithOffset(Range.second - Column));
tools/clang/lib/CodeGen/CodeGenFunction.cpp 378 EscapeArgs[Pair.second] = Pair.first;
405 EmitIfUsed(*this, FuncletAndParent.second);
414 I->first->replaceAllUsesWith(I->second);
tools/clang/lib/CodeGen/CodeGenFunction.h 847 SavedLocals.try_emplace(LocalVD, it->second);
885 if (!Pair.second.isValid()) {
892 I->second = Pair.second;
892 I->second = Pair.second;
2365 return it->second;
tools/clang/lib/CodeGen/CodeGenModule.cpp 267 llvm::Constant *C = I.second;
288 if (!Visited.insert(GIS2).second)
1089 return FoundName->second;
1960 if (Mod->Parent && Visited.insert(Mod->Parent).second) {
1966 if (Visited.insert(Mod->Imports[I - 1]).second)
2024 if (Visited.insert(M).second)
2042 if (Visited.insert(SM).second) {
2061 if (Visited.insert(M).second)
3141 DiagnosedConflictingDefinitions.insert(GD).second) {
3228 addDeferredDeclToEmit(DDI->second);
3441 DiagnosedConflictingDefinitions.insert(D).second) {
3488 addDeferredDeclToEmit(DDI->second);
3815 if (!R.second)
3816 R.first->second = nullptr;
4532 DiagnosedConflictingDefinitions.insert(GD).second) {
5417 if (!EmittedModuleInitializers.insert(Mod).second)
5432 if (Visited.insert(*Sub).second)
5509 I->second = false;
5518 if (!Entry.second)
5585 llvm::GlobalValue *Val = I.second;
5611 llvm::GlobalValue *Addr = getModule().getNamedValue(I.second);
5633 llvm::Value *Addr = I.second.getPointer();
5676 llvm::GlobalValue *GV = GetGlobalValue(Val.second);
tools/clang/lib/CodeGen/CodeGenPGO.h 68 return I->second;
tools/clang/lib/CodeGen/CodeGenTypes.cpp 104 return I != RecordDeclTypes.end() && !I->second->isOpaque();
120 if (!AlreadyChecked.insert(RD).second)
339 if (!RecordsBeingLaidOut.insert(Ty).second) {
394 return TCI->second;
739 bool InsertResult = RecordsBeingLaidOut.insert(Key).second;
tools/clang/lib/CodeGen/CoverageMappingGen.cpp 233 if (!Visited.insert(File).second)
266 return Mapping->second.first;
282 FileLineRanges[R.FileID].second =
283 std::max(FileLineRanges[R.FileID].second, R.LineEnd);
302 Region.LineEnd <= FileLineRanges[*CovFileID].second)
356 SourceLocation ExpandedLoc = FM.second.second;
356 SourceLocation ExpandedLoc = FM.second.second;
540 if (LastTerminatedRegion->second != RegionStack.size())
646 RegionStack.size() < LastTerminatedRegion->second)
746 if (StartLocs.insert(Loc).second)
761 if (StartLocs.insert(FileStart).second) {
1359 auto I = Entry.second;
1383 auto I = Entry.second;
1465 return It->second;
tools/clang/lib/CodeGen/ItaniumCXXABI.cpp 2411 const llvm::TinyPtrVector<llvm::Function *> &Dtors = I.second;
2611 llvm::Function *Wrapper = VDAndWrapper.second;
3607 if (!Bases.VirtualBases.insert(BaseDecl).second) {
3617 if (!Bases.NonVirtualBases.insert(BaseDecl).second) {
tools/clang/lib/CodeGen/MicrosoftCXXABI.cpp 1181 if (!I->second.hasVtorDisp())
1186 uint64_t ConstantVBaseOffset = I->second.VBaseOffset.getQuantity();
1643 Offset = VBI->second.VBaseOffset;
1730 return I->second;
1732 llvm::GlobalVariable *&VTable = I->second;
1737 if (DeferredVFTables.insert(RD).second) {
1749 if (!ObservedMangledNames.insert(Name.str()).second)
1946 VBTableGlobals &VBGlobals = Entry->second;
3546 !VirtualBases.insert(Class->RD).second) {
3550 if (!UniqueBases.insert(Class->RD).second)
3717 ->second.hasVtorDisp())
tools/clang/lib/CodeGen/SwiftCallingConv.cpp 240 auto numElts = split.second;
389 auto numElts = split.second;
793 return ABIArgInfo::getCoerceAndExpand(types.first, types.second);
tools/clang/lib/CodeGen/TargetInfo.cpp 352 DirectAlign = ValueInfo.second;
366 Addr = Address(CGF.Builder.CreateLoad(Addr), ValueInfo.second);
628 CharUnits TyAlignForABI = TyInfo.second;
1945 TypeInfo.second = CharUnits::fromQuantity(
1946 getTypeStackAlignInBytes(Ty, TypeInfo.second.getQuantity()));
3834 CharUnits TyAlign = SizeAlign.second;
4185 TI.second = getParamTypeAlignment(Ty);
4861 TypeInfo.second = getParamTypeAlignment(Ty);
5440 std::max(TyAlign, BaseTyInfo.second));
6706 DirectAlign = TyInfo.second;
6727 TyInfo.second);
6824 TyInfo.second);
7268 TyInfo.second =
7269 std::min(TyInfo.second, CharUnits::fromQuantity(StackAlignInBytes));
8392 TypeInfo.second);
8396 return Address(llvm::UndefValue::get(ArgPtrTy), TypeInfo.second);
8789 Entry &E = I->second;
8840 Entry &E = I->second;
tools/clang/lib/CodeGen/VarBypassDetector.cpp 139 unsigned from = S.second;
161 Bypasses.insert(ScopeTo.second);
tools/clang/lib/CrossTU/CrossTranslationUnit.cpp 555 return *I->second;
579 FileID FromID = I->second.first;
580 clang::ASTUnit *Unit = I->second.second;
580 clang::ASTUnit *Unit = I->second.second;
582 Unit->getSourceManager().getComposedLoc(FromID, DecToLoc.second);
tools/clang/lib/Driver/Compilation.cpp 57 if (Arg.second != TranslatedArgs)
58 delete Arg.second;
146 Success &= CleanupFile(File.second, IssueErrors);
208 if (A == &(CI.second->getSource()))
tools/clang/lib/Driver/Distro.cpp 124 std::pair<StringRef, StringRef> SplitVer = SplitLine.second.trim().split('.');
tools/clang/lib/Driver/Driver.cpp 948 CompilerPath = Split.second;
1287 } else if (!strcmp(it->second->getValue(), "-")) {
1476 const Command *FailingCommand = CmdPair.second;
1946 if (ArchNames.insert(A->getValue()).second)
2937 for (auto TI = OpenMPTCRange.first, TE = OpenMPTCRange.second; TI != TE;
2939 ToolChains.push_back(TI->second);
3193 ActiveOffloadKinds |= I.second;
3259 const Arg *InputArg = I.second;
3392 const Arg *InputArg = I.second;
3502 I.second->claim();
4037 return CachedResult->second;
tools/clang/lib/Driver/SanitizerArgs.cpp 439 if ((Default & Group) && (Kinds & G.second))
489 if (SanitizerMask Incompatible = Kinds & G.second) {
918 CmdArgs.push_back(F.second);
tools/clang/lib/Driver/ToolChains/AMDGPU.h 52 return opt->second;
tools/clang/lib/Driver/ToolChains/Arch/AArch64.cpp 94 if (Split.second.size() && !DecodeAArch64Features(D, Split.second, Features))
94 if (Split.second.size() && !DecodeAArch64Features(D, Split.second, Features))
110 (Split.second.size() && !DecodeAArch64Features(D, Split.second, Features)))
110 (Split.second.size() && !DecodeAArch64Features(D, Split.second, Features)))
tools/clang/lib/Driver/ToolChains/Arch/ARM.cpp 110 (Split.second.size() && !DecodeARMFeatures(
111 D, Split.second, CPUName, ArchKind, Features)))
126 (Split.second.size() && !DecodeARMFeatures(
127 D, Split.second, CPU, ArchKind, Features)))
tools/clang/lib/Driver/ToolChains/Clang.cpp 143 for (auto II = TCs.first, IE = TCs.second; II != IE; ++II)
144 Work(*II->second);
2180 auto SVal = Pair.second;
tools/clang/lib/Driver/ToolChains/Cuda.cpp 41 auto Second = First.second.split('.');
tools/clang/lib/Driver/ToolChains/Gnu.cpp 1691 std::pair<StringRef, StringRef> Second = First.second.split('.');
1697 if (First.second.empty())
1700 if (Second.second.empty()) {
1721 StringRef PatchText = Second.second;
2393 if (!CandidateGCCInstallPaths.insert(LI->path()).second)
2477 + ActiveVersion.second.str();
2488 Version = GCCVersion::Parse(ActiveVersion.second);
tools/clang/lib/Driver/ToolChains/MSVC.cpp 1350 StringRef ObjFmt = Triple.getEnvironmentName().split('-').second;
tools/clang/lib/Edit/Commit.cpp 245 offs = FileOffset(locInfo.first, locInfo.second);
279 offs = FileOffset(locInfo.first, locInfo.second);
315 beginInfo.second > endInfo.second)
315 beginInfo.second > endInfo.second)
318 Offs = FileOffset(beginInfo.first, beginInfo.second);
319 Len = endInfo.second - beginInfo.second;
319 Len = endInfo.second - beginInfo.second;
tools/clang/lib/Edit/EditedSource.cpp 87 find_if(I->second, [&](const MacroArgUse &U) {
91 }) != I->second.end()) {
156 FileEdit &FA = I->second;
173 FileEdit &FA = I->second;
210 FileEdit &FA = I->second;
224 NewI->second.RemoveLen = Len;
228 FileEdit &FA = I->second;
236 TopFA = &NewI->second;
241 TopFA = &I->second;
253 FileEdit &FA = I->second;
420 StrVec = I->second.Text;
421 CurLen = I->second.RemoveLen;
427 FileEdit act = I->second;
473 FileEdit &FA = I->second;
tools/clang/lib/Format/BreakableToken.cpp 208 return RemainingTokenColumns + 1 - Split.second;
258 Tok, Prefix.size() + TailOffset + Split.first, Split.second, Postfix,
293 unsigned CharsToRemove = Split.second;
578 Text.size() == Split.first + Split.second) {
588 unsigned CharsToRemove = Split.second;
834 unsigned CharsToRemove = Split.second;
tools/clang/lib/Format/ContinuationIndenter.cpp 1647 return Fixes.second + PrefixExcessCharacters * Style.PenaltyExcessCharacter;
1949 LineIndex, TailOffset + Split.first + Split.second, ColumnLimit,
1960 Split.first + Split.second + NextSplit.first, ContentStartColumn);
2000 TailOffset += Split.first + Split.second;
2018 LineIndex, TailOffset + Split.first + Split.second,
2026 LineIndex, TailOffset + Split.first + Split.second,
2040 << ", " << Split.second << "\n");
2046 TailOffset += Split.first + Split.second;
2084 << SplitBeforeNext.second << "\n");
2085 TailOffset = SplitBeforeNext.first + SplitBeforeNext.second;
2184 TailOffset + SplitAfterLastLine.first + SplitAfterLastLine.second,
tools/clang/lib/Format/Format.cpp 1219 FormatStyle Style = It->second;
2428 Penalty += PassFixes.second;
tools/clang/lib/Format/FormatTokenLexer.cpp 816 FormatTok->Type = it->second;
tools/clang/lib/Format/TokenAnalyzer.cpp 100 Penalty += RunResult.second;
tools/clang/lib/Format/UnwrappedLineFormatter.cpp 960 StateNode *Node = Queue.top().second;
973 if (!Seen.insert(&Node->State).second)
993 reconstructPath(InitialState, Queue.top().second);
1065 return CacheIt->second;
tools/clang/lib/Frontend/ASTUnit.cpp 180 BufferOwner = valueOrNull(VFS->getBufferForFile(RF.second, -1, true, isVolatile));
197 Buffer = const_cast<llvm::MemoryBuffer *>(RB.second);
265 delete RB.second;
796 AST->PPOpts->addRemappedFile(RemappedFile.first, RemappedFile.second);
1761 RemappedFile.second);
1844 delete RB.second;
1849 RemappedFile.second);
2228 PreprocessorOpts.addRemappedFile(RemappedFile.first, RemappedFile.second);
2229 OwnedBuffers.push_back(RemappedFile.second);
2279 PreprocessorOpts.PrecompiledPreambleBytes.second = false;
2390 SourceLocation EL = FileLoc.getLocWithOffset(Range.second);
2401 SourceLocation EL = FileLoc.getLocWithOffset(FixIt.RemoveRange.second);
2467 LocDeclsTy &LocDecls = *I->second;
2482 BeginIt->second->isTopLevelDeclInObjCContainer())
2492 Decls.push_back(DIt->second);
tools/clang/lib/Frontend/CompilerInstance.cpp 337 FileMgr.getVirtualFile(RB.first, RB.second->getBufferSize(), 0);
341 delete RB.second;
347 SourceMgr.overrideFileContents(FromFile, RB.second,
354 auto ToFile = FileMgr.getFile(RF.second);
356 Diags.Report(diag::err_fe_remap_missing_to_file) << RF.first << RF.second;
664 llvm::sys::fs::remove(Module.second);
1625 SourceLocation ModuleNameLoc = Path[0].second;
1645 Module = Known->second;
1676 ModuleFileName = BuiltModuleIt->second;
1874 PrivPath.push_back(std::make_pair(&II, Path[0].second));
1884 getDiagnostics().Report(Path[I].second,
1887 << SourceRange(Path[0].second, Path[I].second)
1887 << SourceRange(Path[0].second, Path[I].second)
1888 << FixItHint::CreateReplacement(SourceRange(Path[0].second),
1919 getDiagnostics().Report(Path[I].second,
1922 << SourceRange(Path[0].second, Path[I-1].second)
1922 << SourceRange(Path[0].second, Path[I-1].second)
1923 << FixItHint::CreateReplacement(SourceRange(Path[I].second),
1933 getDiagnostics().Report(Path[I].second, diag::err_no_submodule)
1935 << SourceRange(Path[0].second, Path[I-1].second);
1935 << SourceRange(Path[0].second, Path[I-1].second);
1955 << SourceRange(Path.front().second, Path.back().second);
1955 << SourceRange(Path.front().second, Path.back().second);
1964 << SourceRange(Path.front().second, Path.back().second);
1964 << SourceRange(Path.front().second, Path.back().second);
tools/clang/lib/Frontend/CompilerInvocation.cpp 2011 StringRef(Inputs[i]).rsplit('.').second);
3204 (Major == 3 ? VerParts.second.size() == 1 &&
3205 !VerParts.second.getAsInteger(10, Minor)
3207 VerParts.second == "0")) {
3302 Opts.PrecompiledPreambleBytes.second = (EndOfLine != 0);
3337 if (Split.second.empty()) {
3342 Opts.addRemappedFile(Split.first, Split.second);
3599 code = hash_combine(code, I.first, I.second);
3644 code = hash_combine(code, KeyValue.first, KeyValue.second);
tools/clang/lib/Frontend/DependencyFile.cpp 148 if (Seen.insert(Filename).second) {
tools/clang/lib/Frontend/DependencyGraph.cpp 130 for (unsigned I = 0, N = F->second.size(); I != N; ++I) {
134 writeNodeReference(OS, F->second[I]);
tools/clang/lib/Frontend/DiagnosticRenderer.cpp 204 if (!Imported.second.empty()) {
206 emitImportStackRecursively(Imported.first, Imported.second);
226 emitImportStackRecursively(NextImportLoc.first, NextImportLoc.second);
241 emitImportStackRecursively(NextImportLoc.first, NextImportLoc.second);
252 emitBuildingModuleLocation(I.second, I.second.getPresumedLoc(
252 emitBuildingModuleLocation(I.second, I.second.getPresumedLoc(
tools/clang/lib/Frontend/FrontendAction.cpp 433 Offset = CI.getSourceManager().getDecomposedLoc(EndOfLineMarker).second;
tools/clang/lib/Frontend/FrontendActions.cpp 615 if (I->second)
tools/clang/lib/Frontend/InitHeaderSearch.cpp 482 if (SeenDirs.insert(CurEntry.getDir()).second)
486 if (SeenFrameworkDirs.insert(CurEntry.getFrameworkDir()).second)
491 if (SeenHeaderMaps.insert(CurEntry.getHeaderMap()).second)
561 SearchList.push_back(Include.second);
569 SearchList.push_back(Include.second);
581 SearchList.push_back(Include.second);
585 SearchList.push_back(Include.second);
tools/clang/lib/Frontend/InitPreprocessor.cpp 43 StringRef MacroBody = MacroPair.second;
1163 if (InitOpts.Macros[i].second) // isUndef
1192 InitOpts.PrecompiledPreambleBytes.second);
tools/clang/lib/Frontend/InterfaceStubFunctionsConsumer.cpp 243 *S.LateParsedTemplateMap.find(cast<FunctionDecl>(FD))->second;
264 const MangledSymbol &Symbol = E.second;
tools/clang/lib/Frontend/PrecompiledPreamble.cpp 115 auto IsInserted = Files.insert(File).second;
275 PreprocessorOpts.PrecompiledPreambleBytes.second = false;
449 if (!moveOnNoError(VFS->status(R.second), Status)) {
463 PreambleFileHash::createForMemoryBuffer(RB.second);
494 if (Overridden->second != F.second)
717 PreprocessorOpts.PrecompiledPreambleBytes.second =
tools/clang/lib/Frontend/PrintPreprocessedOutput.cpp 840 auto *MD = I->second.getLatest();
847 MacroInfo &MI = *MacrosByID[i].second;
tools/clang/lib/Frontend/Rewrite/FixItRewriter.cpp 111 RewriteBuffer &RewriteBuf = I->second;
tools/clang/lib/Frontend/Rewrite/FrontendActions.cpp 219 if (!Rewritten.insert(*File).second)
tools/clang/lib/Frontend/Rewrite/InclusionRewriter.cpp 170 assert(P.second && "Unexpected revisitation of the same include directive");
205 assert(P.second && "Unexpected revisitation of the same include directive");
215 assert(P.second && "Unexpected revisitation of the same if directive");
224 assert(P.second && "Unexpected revisitation of the same elif directive");
233 return &I->second;
243 return I->second;
253 return I->second;
260 return I->second;
tools/clang/lib/Frontend/Rewrite/RewriteModernObjC.cpp 3945 if (!ObjCSynthesizedStructs.insert(CDecl).second)
6981 if (!ObjCSynthesizedProtocols.insert(PDecl->getCanonicalDecl()).second)
tools/clang/lib/Frontend/Rewrite/RewriteObjC.cpp 3211 if (!ObjCSynthesizedStructs.insert(CDecl).second)
5213 if (!ObjCSynthesizedProtocols.insert(PDecl->getCanonicalDecl()).second)
tools/clang/lib/Frontend/SerializedDiagnosticPrinter.cpp 524 if (!State->Categories.insert(category).second)
556 entry.second = FlagName;
tools/clang/lib/Frontend/TextDiagnostic.cpp 955 unsigned Slack = MaxRange - (A.second - A.first + 1);
961 unsigned Max = std::max(A.second, B.second);
961 unsigned Max = std::max(A.second, B.second);
968 (B.second < A.second && A.second - B.second + 1 > MaxRange))
968 (B.second < A.second && A.second - B.second + 1 > MaxRange))
968 (B.second < A.second && A.second - B.second + 1 > MaxRange))
968 (B.second < A.second && A.second - B.second + 1 > MaxRange))
977 A.second = std::min(A.second + (Slack + 1) / 2, Max);
977 A.second = std::min(A.second + (Slack + 1) / 2, Max);
978 Slack = MaxRange - (A.second - A.first + 1);
980 A.second = std::min(A.first + MaxRange - 1, Max);
1086 LineNo == SM.getLineNumber(HintLocInfo.first, HintLocInfo.second) &&
1094 = SM.getColumnNumber(HintLocInfo.first, HintLocInfo.second) - 1;
1184 for (unsigned LineNo = Lines.first; LineNo != Lines.second + 1; ++LineNo) {
1191 SM.getDecomposedLoc(SM.translateLineCol(FID, LineNo, 1)).second;
1297 bool was_printable = res.second;
1346 EInfo.second += Lexer::MeasureTokenLength(ELoc, SM, LangOpts);
1356 OS << "\":{" << SM.getLineNumber(BInfo.first, BInfo.second)
1357 << ':' << SM.getColumnNumber(BInfo.first, BInfo.second)
1358 << '-' << SM.getLineNumber(EInfo.first, EInfo.second)
1359 << ':' << SM.getColumnNumber(EInfo.first, EInfo.second)
tools/clang/lib/Frontend/TextDiagnosticBuffer.cpp 60 Diag << Notes[I.second].second;
60 Diag << Notes[I.second].second;
63 Diag << Warnings[I.second].second;
63 Diag << Warnings[I.second].second;
66 Diag << Remarks[I.second].second;
66 Diag << Remarks[I.second].second;
70 Diag << Errors[I.second].second;
70 Diag << Errors[I.second].second;
tools/clang/lib/Frontend/VerifyDiagnosticConsumer.cpp 347 if (!InsertResult.second) {
861 OS << ": " << I->second;
944 const std::string &RightText = II->second;
1054 if (const FileEntry *FE = I.second)
1059 const UnparsedFileStatus &Status = I.second;
tools/clang/lib/Index/CommentToXML.cpp 881 unsigned FileOffset = LocInfo.second;
tools/clang/lib/Index/IndexingAction.cpp 153 if (MacroDirective *MD = M.second.getLatest())
tools/clang/lib/Index/USRGeneration.cpp 43 OS << '@' << Decomposed.second;
772 Out << 'S' << Substitution->second << '_';
tools/clang/lib/Lex/HeaderSearch.cpp 121 return HeaderMaps[i].second.get();
126 return HeaderMaps.back().second.get();
150 return i->second;
783 TmpDir = IncluderAndDir.second->getName();
798 TmpDir, IncludeLoc, IncluderAndDir.second, IncluderIsSystemHeader,
822 StringRef SearchPathRef(IncluderAndDir.second->getName());
832 IncluderAndDir.second->getName(), Filename,
938 HFI.DirInfo = SystemHeaderPrefixes[j-1].second ? SrcMgr::C_System
965 Diags, IncludeLoc, Includers.front().second->getName(), Filename,
1532 if (!AddResult.second)
1533 return AddResult.first->second ? LMM_AlreadyLoaded : LMM_InvalidModuleMap;
1612 return KnownDir->second ? LMM_AlreadyLoaded : LMM_InvalidModuleMap;
tools/clang/lib/Lex/Lexer.cpp 340 const char *tokenBegin = file.data() + locInfo.second;
474 const char *StrData = Buffer.data()+LocInfo.second;
521 const char *StrData = Buffer.data() + LocInfo.second;
522 const char *LexStart = findBeginningOfLine(Buffer, LocInfo.second);
527 SourceLocation LexerStartLoc = Loc.getLocWithOffset(-LocInfo.second);
569 FileLocInfo.second >= BeginFileLocInfo.second);
569 FileLocInfo.second >= BeginFileLocInfo.second);
570 return Loc.getLocWithOffset(BeginFileLocInfo.second - FileLocInfo.second);
570 return Loc.getLocWithOffset(BeginFileLocInfo.second - FileLocInfo.second);
958 beginInfo.second > EndOffs) {
972 return file.substr(beginInfo.second, EndOffs - beginInfo.second);
972 return file.substr(beginInfo.second, EndOffs - beginInfo.second);
1019 return ExpansionBuffer.substr(ExpansionInfo.second, MacroTokenLength);
1044 return ExpansionBuffer.substr(ExpansionInfo.second, MacroTokenLength);
1082 const char *Line = findBeginningOfLine(Buffer, LocInfo.second);
1255 const char *TokenBegin = File.data() + LocInfo.second;
tools/clang/lib/Lex/MacroInfo.cpp 60 assert(startInfo.second <= endInfo.second);
60 assert(startInfo.second <= endInfo.second);
61 DefinitionLength = endInfo.second - startInfo.second;
61 DefinitionLength = endInfo.second - startInfo.second;
tools/clang/lib/Lex/ModuleMap.cpp 131 Diags.Report(Id[0].second, diag::err_mmap_missing_module_unqualified)
142 Diags.Report(Id[I].second, diag::err_mmap_missing_module_qualified)
144 << SourceRange(Id[0].second, Id[I-1].second);
144 << SourceRange(Id[0].second, Id[I-1].second);
423 return KnownHeader(KnownDir->second, NormalHeader);
489 for (const KnownHeader &Header : Known->second) {
576 for (KnownHeader &H : Known->second) {
667 return It->second;
681 I = Known->second.begin(),
682 E = Known->second.end();
716 Module *Found = KnownDir->second;
967 if (inferred->second.InferModules) {
971 canInfer = std::find(inferred->second.ExcludedModules.begin(),
972 inferred->second.ExcludedModules.end(),
973 Name) == inferred->second.ExcludedModules.end();
975 Attrs.IsSystem |= inferred->second.Attrs.IsSystem;
976 Attrs.IsExternC |= inferred->second.Attrs.IsExternC;
977 Attrs.IsExhaustive |= inferred->second.Attrs.IsExhaustive;
979 inferred->second.Attrs.NoUndeclaredIncludes;
980 ModuleMapFile = inferred->second.ModuleMapFile;
1162 for (auto *M : BySize->second)
1169 for (auto *M : ByModTime->second)
1235 return InferredModuleAllowedBy.find(M)->second;
1256 for (SmallVectorImpl<KnownHeader>::const_iterator I = H->second.begin(),
1257 E = H->second.end();
1259 if (I != H->second.begin())
1850 Diags.Report(Id.front().second, diag::err_mmap_nested_submodule_id)
1851 << SourceRange(Id.front().second, Id.back().second);
1851 << SourceRange(Id.front().second, Id.back().second);
1879 Diags.Report(Id[I].second, diag::err_mmap_missing_module_qualified)
1883 Diags.Report(Id[I].second, diag::err_mmap_expected_module_name);
1898 SourceLocation ModuleNameLoc = Id.back().second;
2972 return Known->second;
3002 *Offset = Loc.second;
tools/clang/lib/Lex/PPDirectives.cpp 389 auto MappingIt = SkippedRanges.find(HashFileOffset.second);
395 assert(CurLexerBufferOffset >= HashFileOffset.second &&
399 unsigned LengthDiff = CurLexerBufferOffset - HashFileOffset.second;
1665 << M->getFullModuleName() << Requirement.second << Requirement.first;
1876 if (PragmaARCCFCodeAuditedInfo.second.isValid()) {
1878 Diag(PragmaARCCFCodeAuditedInfo.second, diag::note_pragma_entered_here);
tools/clang/lib/Lex/PPLexerChange.cpp 379 if (PragmaARCCFCodeAuditedInfo.second.isValid() && !isEndOfMacro &&
381 Diag(PragmaARCCFCodeAuditedInfo.second,
667 auto &State = R.first->second;
668 bool FirstTime = R.second;
682 if (!Macro.second.getLatest() &&
683 Macro.second.getOverriddenMacros().empty())
686 MacroState MS(Macro.second.getLatest());
687 MS.setOverriddenMacros(*this, Macro.second.getOverriddenMacros());
753 if (!VisitedMacros.insert(II).second)
759 auto &Macro = MacroIt->second;
774 OldMD = OldMacroIt->second.getLatest();
tools/clang/lib/Lex/PPMacroExpansion.cpp 65 : Pos->second.getLatest();
202 for (auto *LeafMM : Leaf->second) {
261 Leaf = LeafIt->second;
265 State = &Pos->second;
309 if (Visited.insert(O).second)
1051 size_t tokIndex = MacroExpandingLexersStack.back().second;
tools/clang/lib/Lex/Pragma.cpp 643 MacroInfo *MacroToReInstall = iter->second.back();
650 iter->second.pop_back();
651 if (iter->second.empty())
1100 PP.Diag(IIAndLoc.second, diag::warn_pragma_debug_unknown_module)
1563 PP.EnterAnnotationToken(SourceRange(ImportLoc, ModuleName.back().second),
1595 PP.Diag(ModuleName.front().second, diag::err_pp_module_begin_wrong_module)
1606 PP.Diag(ModuleName.front().second,
1613 PP.Diag(ModuleName[I].second, diag::err_pp_module_begin_no_submodule)
1630 PP.EnterAnnotationToken(SourceRange(BeginLoc, ModuleName.back().second),
1740 SourceLocation BeginLoc = PP.getPragmaARCCFCodeAuditedInfo().second;
tools/clang/lib/Lex/PreprocessingRecord.cpp 65 iterator(this, CachedRangeQuery.Result.second));
74 iterator(this, Res.second));
146 return std::make_pair(Local.first, Local.second);
152 if (Loaded.first == Loaded.second)
153 return std::make_pair(Local.first, Local.second);
158 if (Local.first == Local.second)
160 int(Loaded.second)-TotalLoaded);
163 return std::make_pair(int(Loaded.first)-TotalLoaded, Local.second);
389 return Pos->second;
tools/clang/lib/Lex/Preprocessor.cpp 358 Def = I->second.findDirectiveAtLoc(Loc, SourceMgr);
514 ScratchBuf->getToken(Buffer.data() + LocInfo.second, Length, DestPtr);
548 SkipMainFilePreamble.second);
756 Diag(Identifier,it->second) << Identifier.getIdentifierInfo();
1260 SourceLocation FirstPathLoc = ModuleImportPath[0].second;
tools/clang/lib/Parse/ParseDecl.cpp 6518 if (!ParamsSoFar.insert(ParmII).second) {
tools/clang/lib/Parse/ParseDeclCXX.cpp 4118 !SeenAttrs.insert(std::make_pair(AttrName, AttrLoc)).second)
tools/clang/lib/Parse/ParseExpr.cpp 951 Tok.setKind(Known->second);
3132 bool Inserted = Platforms.insert(Spec.getPlatform()).second;
tools/clang/lib/Parse/ParseObjc.cpp 338 protocolLocs.push_back(pair.second);
437 index++, pair.first, pair.second, SourceLocation(), nullptr);
tools/clang/lib/Parse/ParseOpenMP.cpp 842 if (!Res.second) {
927 if (!Res.second) {
1048 DeclVarData.getValue().first, DeclVarData.getValue().second,
tools/clang/lib/Parse/ParsePragma.cpp 687 auto State = Data->second;
747 PP.EnterTokenStream(std::move(TheTokens->first), TheTokens->second, true,
1245 .second)
1273 auto SubRuleOrNone = Rule.second(SubRuleName, /*IsUnless=*/true);
1285 auto SubRuleOrNone = Rule.second(SubRuleName, /*IsUnless=*/false);
1300 .second) {
1376 if (!I.second)
2179 Info->second = State;
tools/clang/lib/Parse/ParseStmtAsm.cpp 421 LineNo = SrcMgr.getLineNumber(FID, ExpAsmLoc.second);
449 LineNo = SrcMgr.getLineNumber(FID, ExpSemiLoc.second);
457 SrcMgr.getLineNumber(ExpLoc.first, ExpLoc.second) != LineNo) {
472 LineNo = SrcMgr.getLineNumber(ExpLoc.first, ExpLoc.second);
478 LineNo = SrcMgr.getLineNumber(FID, ExpLoc.second);
656 if (OpExprs[i].second)
tools/clang/lib/Parse/Parser.cpp 2264 << SourceRange(ColonLoc, Partition.back().second);
2324 << SourceRange(ColonLoc, Path.back().second);
tools/clang/lib/Rewrite/Rewriter.cpp 162 const RewriteBuffer &RB = I->second;
213 const RewriteBuffer &RB = I->second;
236 return V.second;
244 return I->second;
248 I->second.Initialize(MB.begin(), MB.end());
250 return I->second;
473 I->second.write(File.getStream());
tools/clang/lib/Rewrite/TokenRewriter.cpp 66 return MapIt->second;
76 Where)).second;
tools/clang/lib/Sema/AnalysisBasedWarnings.cpp 233 if (!Visited.insert(SuccBlock).second)
1066 if (L && isa<SwitchCase>(L) && ReachableBlocks.insert(B).second)
1076 if (*I && ReachableBlocks.insert(*I).second)
1361 const WeakUseVector &Uses = I->second;
1441 const WeakObjectProfileTy &Key = P.second->first;
1442 const WeakUseVector &Uses = P.second->second;
1442 const WeakUseVector &Uses = P.second->second;
1533 const MappedType &V = P.second;
1676 S.Diag(Diag.first.first, Diag.first.second);
1677 for (const auto &Note : Diag.second)
1678 S.Diag(Note.first, Note.second);
1896 S.Diag(Diag.first.first, Diag.first.second);
1897 for (const auto &Note : Diag.second)
1898 S.Diag(Note.first, Note.second);
tools/clang/lib/Sema/CodeCompleteConsumer.cpp 582 EInfo.second += Lexer::MeasureTokenLength(ELoc, SM, SemaRef.LangOpts);
585 << " {" << SM.getLineNumber(BInfo.first, BInfo.second) << ':'
586 << SM.getColumnNumber(BInfo.first, BInfo.second) << '-'
587 << SM.getLineNumber(EInfo.first, EInfo.second) << ':'
588 << SM.getColumnNumber(EInfo.first, EInfo.second) << "}"
tools/clang/lib/Sema/JumpDiagnostics.cpp 225 if (Diags.first || Diags.second) {
226 Scopes.push_back(GotoScope(ParentScope, Diags.first, Diags.second,
274 Diags.first, Diags.second, Loc));
730 LabelDecl *TargetLabel = TI->second;
785 DiagnoseIndirectOrAsmJump(I->second, I->first, TargetLabel, TargetScope);
tools/clang/lib/Sema/Scope.cpp 175 OS << Info.second;
tools/clang/lib/Sema/ScopeInfo.cpp 48 CoroutineSuspends.second = nullptr;
212 llvm::find(llvm::reverse(Uses->second), WeakUseTy(E, true));
213 if (ThisUse == Uses->second.rend())
tools/clang/lib/Sema/Sema.cpp 704 Undefined.push_back(std::make_pair(ND, UndefinedUse.second));
720 SourceLocation UseLoc = Undef.second;
782 return Cache->second;
825 return Cache->second;
942 Typo.second.DiagHandler(TypoCorrection());
1017 if (WeakID.second.getUsed())
1024 Diag(WeakID.second.getLocation(), diag::warn_attribute_wrong_decl_type)
1027 Diag(WeakID.second.getLocation(), diag::warn_weak_identifier_undeclared)
1114 if (!VD || VD->isInvalidDecl() || !Seen.insert(VD).second)
1229 for (const auto &DeleteExprLoc : DeletedFieldInfo.second) {
1231 DeleteExprLoc.second);
1402 S.Diags.Report(FnIt->second.Loc, diag::note_called_by));
1403 Builder << FnIt->second.FD;
1406 FnIt = S.DeviceKnownEmittedFns.find(FnIt->second.FD);
1417 for (PartialDiagnosticAt &PDAt : It->second) {
1419 const PartialDiagnostic &PD = PDAt.second;
1554 CGIt->second) {
1556 SourceLocation CallLoc = FDLoc.second;
2236 for (auto const& I : Loc->second) {
2249 for (auto &I : Loc->second) {
2265 for (auto &I : Loc->second) {
tools/clang/lib/Sema/SemaAttr.cpp 682 Diag(Rule.second.getBegin(),
685 << attr::getSubjectMatchRuleSpelling(*ParentRule) << It->second
687 replacementRangeForListElement(*this, Rule.second));
705 It->second != Rule) {
708 It->second.second.getBegin(),
708 It->second.second.getBegin(),
712 attr::SubjectMatchRule(It->second.first))
713 << attr::getSubjectMatchRuleSpelling(MatchRule) << Rule.second
715 replacementRangeForListElement(*this, It->second.second));
715 replacementRangeForListElement(*this, It->second.second));
737 if (Rule.second)
751 replacementRangeForListElement(*this, Rule.second));
894 SourceLocation loc = Stack->back().second;
976 Diag(Back->second, diag::err_pragma_push_visibility_mismatch);
987 Diag(Back->second, diag::note_surrounding_namespace_starts_here);
tools/clang/lib/Sema/SemaCUDA.cpp 223 return IdentifyCUDAPreference(Caller, Match.second);
720 if (!LocsWithCUDACallDiags.insert({Caller, Loc}).second)
tools/clang/lib/Sema/SemaCast.cpp 1475 if (DisplayedPaths.insert(Path.back().SubobjectNumber).second) {
tools/clang/lib/Sema/SemaChecking.cpp12610 SideEffectUsage = M.second;
14500 TypeInfo = I->second;
tools/clang/lib/Sema/SemaCodeComplete.cpp 1089 I = NamePos->second.begin();
1090 IEnd = NamePos->second.end();
1095 unsigned Index = I->second;
1114 I = NamePos->second.begin();
1115 IEnd = NamePos->second.end();
1139 if (!AllDeclsFound.insert(CanonDecl).second)
1259 if (!AllDeclsFound.insert(R.Declaration->getCanonicalDecl()).second)
1325 Result &Incumbent = Results[Entry.second];
4490 if (!AddedProperties.insert(P->getIdentifier()).second)
4583 if (!AddedProperties.insert(Name).second)
5499 CodeCompletionResult(NS->second, Results.getBasePriority(NS->second),
5499 CodeCompletionResult(NS->second, Results.getBasePriority(NS->second),
5661 .second) {
5676 .second) {
5691 .second) {
5745 if (Known.insert(Var->getIdentifier()).second)
6209 if (!Selectors.insert(M->getSelector()).second)
6786 for (ObjCMethodList *MethList = &M->second.second;
6786 for (ObjCMethodList *MethList = &M->second.second;
6958 for (ObjCMethodList *MethList = &M->second.first;
6963 if (!Selectors.insert(MethList->getMethod()->getSelector()).second)
7099 if (ObjCProtocolDecl *Protocol = LookupProtocol(Pair.first, Pair.second))
7237 if (CategoryNames.insert(Category->getIdentifier()).second)
7274 CategoryNames.insert(Cat->getIdentifier()).second)
7590 KnownSelectors.insert(Selectors.getNullarySelector(PropName)).second &&
7611 .second) {
7629 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
7681 .second) {
7702 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
7729 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
7752 if (KnownSelectors.insert(Selectors.getSelector(2, SelectorIds)).second) {
7784 if (KnownSelectors.insert(Selectors.getSelector(2, SelectorIds)).second) {
7814 if (KnownSelectors.insert(Selectors.getSelector(2, SelectorIds)).second) {
7842 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
7863 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
7887 if (KnownSelectors.insert(Selectors.getSelector(2, SelectorIds)).second) {
7918 if (KnownSelectors.insert(Selectors.getSelector(2, SelectorIds)).second) {
7953 .second) {
7971 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
8001 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
8023 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
8045 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
8067 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
8088 if (KnownSelectors.insert(Selectors.getUnarySelector(SelectorId)).second) {
8118 .second) {
8139 .second) {
8204 ObjCMethodDecl *Method = M->second.getPointer();
8286 if (!M->second.getInt())
8355 for (ObjCMethodList *MethList = IsInstanceMethod ? &M->second.first
8356 : &M->second.second;
8356 : &M->second.second;
8661 if (R.second) { // New completion
tools/clang/lib/Sema/SemaConcept.cpp 118 Diag(PDiag.first, PDiag.second);
tools/clang/lib/Sema/SemaCoroutine.cpp 533 cast<VarDecl>(cast<DeclStmt>(Move->second)->getSingleDecl());
1002 this->ParamMovesVector.push_back(KV.second);
1046 this->FinalSuspend = cast<Expr>(Fn.CoroutineSuspends.second);
tools/clang/lib/Sema/SemaDecl.cpp 1912 if (const auto *FD = dyn_cast<FieldDecl>(ShadowI->second)) {
4232 if (FNew == FOld && FNewDecLoc.second == FOldDecLoc.second) {
4232 if (FNew == FOld && FNewDecLoc.second == FOldDecLoc.second) {
7027 NewVD->addAttr(I->second);
7407 const NamedDecl *ShadowedDecl = I->second;
8089 if (unsigned Idx = NearMatch->second) {
8932 NewFD->addAttr(I->second);
9747 Diag(NoteCausedDiagIDAt.first, NoteCausedDiagIDAt.second);
9756 return Diag(NoSupportDiagIDAt.first, NoSupportDiagIDAt.second)
9761 return Diag(NoSupportDiagIDAt.first, NoSupportDiagIDAt.second)
9765 return Diag(NoSupportDiagIDAt.first, NoSupportDiagIDAt.second)
9769 return Diag(NoSupportDiagIDAt.first, NoSupportDiagIDAt.second)
9774 return Diag(NoSupportDiagIDAt.first, NoSupportDiagIDAt.second)
9778 return Diag(NoSupportDiagIDAt.first, NoSupportDiagIDAt.second)
9782 return Diag(NoSupportDiagIDAt.first, NoSupportDiagIDAt.second)
9790 return Diag(NoSupportDiagIDAt.first, NoSupportDiagIDAt.second)
9801 return Diag(DiffDiagIDAt.first, DiffDiagIDAt.second) << CallingConv;
9806 return Diag(DiffDiagIDAt.first, DiffDiagIDAt.second) << ReturnType;
9809 return Diag(DiffDiagIDAt.first, DiffDiagIDAt.second) << ConstexprSpec;
9812 return Diag(DiffDiagIDAt.first, DiffDiagIDAt.second) << InlineSpec;
9815 return Diag(DiffDiagIDAt.first, DiffDiagIDAt.second) << StorageClass;
9818 return Diag(DiffDiagIDAt.first, DiffDiagIDAt.second) << Linkage;
12493 if (Notes.size() == 1 && Notes[0].second.getDiagID() ==
12501 Diag(Notes[I].first, Notes[I].second);
12528 Diag(it.first, it.second);
13752 if (IsOrNestedInEscapingBlock(P.second))
16680 for (OverridingMethods::iterator SO = M->second.begin(),
16681 SOEnd = M->second.end();
16683 assert(SO->second.size() > 0 &&
16685 if (SO->second.size() == 1)
16697 OM = SO->second.begin(),
16698 OMEnd = SO->second.end();
17271 DeclOrVector& Entry = Iter->second;
17324 llvm::APInt &FlagBits = R.first->second;
17326 if (R.second) {
tools/clang/lib/Sema/SemaDeclAttr.cpp 985 S.Diag(PDiag.first, PDiag.second);
7417 WeakInfo W = I->second;
tools/clang/lib/Sema/SemaDeclCXX.cpp 216 if (ExceptionsSeen.insert(Self->Context.getCanonicalType(E)).second)
285 for (unsigned I = 0, N = InstPos->second.size(); I != N; ++I)
286 InstPos->second[I]->setUninstantiatedDefaultArg(Arg);
2304 SemaRef.Diag(Diags[I].first, Diags[I].second);
2611 if (Set.insert(Base).second)
2931 if (DisplayedPaths.insert(Path->back().SubobjectNumber).second) {
3129 auto BaseField = It->second;
5280 S.Diag(En.second->getSourceLocation(), diag::note_previous_initializer)
5281 << 0 << En.second->getSourceRange();
5286 En.second = Init;
5557 for (OverridingMethods::iterator SO = M->second.begin(),
5558 SOEnd = M->second.end();
5566 if (SO->second.size() != 1)
5569 if (!SO->second.front().Method->isPure())
5572 if (!SeenPureMethods.insert(SO->second.front().Method).second)
5572 if (!SeenPureMethods.insert(SO->second.front().Method).second)
5575 Diag(SO->second.front().Method->getLocation(),
5577 << SO->second.front().Method->getDeclName() << RD->getDeclName();
6633 if (It->second)
6635 S.findInheritingConstructor(UseLoc, Ctor, It->second),
6636 It->second->constructsVirtualBase());
7172 CheckOverridingFunctionExceptionSpec(Check.first, Check.second);
7177 CheckEquivalentExceptionSpec(Check.second, Check.first);
11363 WasAlreadyBeingDeclared = !S.SpecialMembersBeingDeclared.insert(D).second;
11684 InitLoc, B.getType(), BaseCtor.first, VBase, BaseCtor.second);
12777 .first->second;
13614 Diag(Notes[I].first, Notes[I].second);
15576 if (!Pos->second && VTables[I].DefinitionRequired)
15577 Pos->second = true;
15610 if (!Pos.second) {
15614 if (DefinitionRequired && !Pos.first->second) {
15615 Pos.first->second = true;
15667 SourceLocation Loc = VTableUses[I].second;
15760 for (OverridingMethods::const_iterator OI = I->second.begin(),
15761 OE = I->second.end();
15763 assert(OI->second.size() > 0 && "no final overrider");
15764 CXXMethodDecl *Overrider = OI->second.front().Method;
15865 if (!Current.insert(Canonical).second)
tools/clang/lib/Sema/SemaDeclObjC.cpp 789 << SourceRange(known->second->getLocation());
1297 ObjCProtocolDecl *PDecl = LookupProtocol(Pair.first, Pair.second);
1301 DeclarationNameInfo(Pair.first, Pair.second), LookupObjCProtocolName,
1309 Diag(Pair.second, diag::err_undeclared_protocol) << Pair.first;
1319 (void)DiagnoseUseOfDecl(PDecl, Pair.second);
1329 Diag(Pair.second, diag::warn_undef_protocolref) << Pair.first;
1775 ObjCProtocolDecl *PrevDecl = LookupProtocol(Ident, IdentPair.second,
1779 IdentPair.second, AtProtocolLoc,
2816 if (!InsMapSeen.insert(I->getSelector()).second)
2843 if (!ClsMapSeen.insert(I->getSelector()).second)
3413 ObjCMethodList &Entry = instance ? Pos->second.first : Pos->second.second;
3413 ObjCMethodList &Entry = instance ? Pos->second.first : Pos->second.second;
3413 ObjCMethodList &Entry = instance ? Pos->second.first : Pos->second.second;
3483 ObjCMethodList &MethList = InstanceFirst ? Pos->second.first :
3484 Pos->second.second;
3484 Pos->second.second;
3499 ObjCMethodList &MethList2 = InstanceFirst ? Pos->second.second :
3499 ObjCMethodList &MethList2 = InstanceFirst ? Pos->second.second :
3500 Pos->second.first;
3531 BestMethod->isInstanceMethod() ? Pos->second.first : Pos->second.second;
3531 BestMethod->isInstanceMethod() ? Pos->second.first : Pos->second.second;
3531 BestMethod->isInstanceMethod() ? Pos->second.first : Pos->second.second;
3546 ObjCMethodList &MethList = instance ? Pos->second.first : Pos->second.second;
3546 ObjCMethodList &MethList = instance ? Pos->second.first : Pos->second.second;
3546 ObjCMethodList &MethList = instance ? Pos->second.first : Pos->second.second;
3614 GlobalMethods &Methods = Pos->second;
3622 for (const ObjCMethodList *Method = &Methods.second; Method;
3689 for (ObjCMethodList *M = &b->second.first; M; M=M->getNext())
3701 for (ObjCMethodList *M = &b->second.second; M; M=M->getNext())
3701 for (ObjCMethodList *M = &b->second.second; M; M=M->getNext())
4194 method->isInstanceMethod() ? it->second.first : it->second.second;
4194 method->isInstanceMethod() ? it->second.first : it->second.second;
4194 method->isInstanceMethod() ? it->second.first : it->second.second;
4349 ObjCMethod->isInstanceMethod()? It->second.first: It->second.second;
4349 ObjCMethod->isInstanceMethod()? It->second.first: It->second.second;
4349 ObjCMethod->isInstanceMethod()? It->second.first: It->second.second;
4971 ReferencedSelectors[Sels[I].first] = Sels[I].second;
4982 SourceLocation Loc = SelectorAndLocation.second;
tools/clang/lib/Sema/SemaExpr.cpp 222 for (const PartialDiagnosticAt &Suppressed : Pos->second)
223 Diag(Suppressed.first, Suppressed.second);
229 Pos->second.clear();
14986 if (Notes.size() == 1 && Notes[0].second.getDiagID() ==
14996 Diag(Note.first, Note.second);
15004 Diag(Note.first, Note.second);
tools/clang/lib/Sema/SemaExprCXX.cpp 824 NewSubobject = VBases.insert(BaseDecl).second;
2586 OperatorDelete = Matches[0].second;
2634 Diag(Match.second->getLocation(),
6082 if (Found.insert(S.Context.getCanonicalType(E)).second)
6287 if (Classes.first && Classes.second) {
6292 Context.getQualifiedType(Composite2, Quals), Classes.second);
6788 if (!CTypes.insert(CBaseType).second) {
tools/clang/lib/Sema/SemaExprObjC.cpp 1164 ObjCMethodList &InstMethList = b->second.first;
1170 ObjCMethodList &ClsMethList = b->second.second;
1170 ObjCMethodList &ClsMethList = b->second.second;
3203 if (Pos != S.ReferencedSelectors.end() && Pos->second == Loc)
tools/clang/lib/Sema/SemaLambda.cpp 1161 if (!CaptureNames.insert(C->Id).second) {
tools/clang/lib/Sema/SemaLookup.cpp 134 if (!visited.insert(DC).second)
145 if (!visited.insert(NS).second)
160 if (SemaRef.isVisible(UD) && visited.insert(NS).second) {
532 if (!UniqueResult.second) {
534 ExistingI = UniqueResult.first->second;
542 if (!UniqueResult.second) {
544 ExistingI = UniqueResult.first->second;
854 Index.second);
1553 if (M && !LookupModulesCache.insert(M).second)
1715 auto Index = getDepthAndIndex(D).second;
2067 if (S.isVisible(I) && Visited.insert(ND).second)
2115 if (S.isVisible(I) && Visited.insert(Nom).second)
2570 if (DeclsPrinted.insert(D).second)
3629 return !VisitedContexts.insert(Ctx).second;
3676 for (auto *D : Pos->second) {
4324 if (DI->second.empty()) {
4329 auto RI = DI->second.begin();
4331 DI->second.erase(RI);
4835 locs->second.count(TypoName.getLoc()))
5363 if (UniqueModuleSet.insert(M).second)
5494 return Entry->second;
tools/clang/lib/Sema/SemaModule.cpp 174 Diag(Path.front().second, diag::err_current_module_name_mismatch)
175 << SourceRange(Path.front().second, Path.back().second)
175 << SourceRange(Path.front().second, Path.back().second)
189 Diag(Path[0].second, diag::err_module_redefinition) << ModuleName;
208 PP.getIdentifierInfo(ModuleName), Path[0].second);
322 ModuleNameLoc = {PP.getIdentifierInfo(ModuleName), Path[0].second};
375 IdentifierLocs.push_back(Path[I].second);
566 if (!DeferredExportedNamespaces.insert(ND).second)
tools/clang/lib/Sema/SemaObjCProperty.cpp 113 if (!Known.insert(Proto).second)
325 const char *tokenBegin = file.data() + locInfo.second;
2065 ObjCPropertyDecl *Prop = P->second;
2125 const ObjCPropertyDecl *Property = I->second;
tools/clang/lib/Sema/SemaOpenMP.cpp 202 Stack.back().second != CurrentNonCapturingFunctionScope ||
313 Stack.back().second != CurrentNonCapturingFunctionScope)
392 if (!Stack.empty() && Stack.back().second == OldFSI) {
753 MI->second.Components)
754 if (Check(L, MI->second.Kind))
775 MI->second.Components)
776 if (Check(L, MI->second.Kind))
1022 assert(It->second && "Unexpected nullptr expr in the aligned map");
1023 return It->second;
1041 return It->second;
1052 return It->second;
1062 if (Pair.second.first == I)
1955 return VD ? VD : Info.second;
2107 Diag(Callee.second, diag::err_omp_wrong_device_function_call)
2119 Diag(Callee.second, diag::err_omp_wrong_device_function_call)
2808 if (DVar.RefExpr || !ImplicitDeclarations.insert(VD).second)
2919 if (DVar.RefExpr || !ImplicitDeclarations.insert(FD).second)
4678 Diag(P.second->getExprLoc(), diag::err_omp_no_dsa_for_variable)
4679 << P.first << P.second->getSourceRange();
5937 return buildCapture(SemaRef, Capture, I->second);
6680 if (DSA.getOrderedRegionParam().second->getNumForLoops()) {
6682 DSA.getOrderedRegionParam().second->getLoopNumIterations().size()) {
6683 DSA.getOrderedRegionParam().second->setLoopNumIterations(
6686 DSA.getOrderedRegionParam().second->setLoopCounter(
6697 Pair.second.size() <= CurrentNestedLoopCount) {
6713 Pair.second[CurrentNestedLoopCount].first,
6714 Pair.second[CurrentNestedLoopCount].second);
6714 Pair.second[CurrentNestedLoopCount].second);
6867 PreInits.push_back(Pair.second->getDecl());
7887 if (llvm::APSInt::compareValues(Hint, Pair.second) != 0) {
12023 if (Res.second) {
12189 if (Res.second) {
12465 if (Res.second) {
12621 if (Res.second) {
13165 if (Res.second) {
13811 if (Res.second) {
13953 if (Res.second || !D) {
14042 if (Res.second) {
14214 if (Res.second) {
14412 if (Res.second) {
15620 if (!PrevData.second) {
15639 Diag(TyData.second, diag::err_omp_declare_reduction_redefinition)
15641 Diag(I->second, diag::note_previous_definition);
15644 PreviousRedeclTypes[TyData.first.getCanonicalType()] = TyData.second;
15645 auto *DRD = OMPDeclareReductionDecl::Create(Context, DC, TyData.second,
15872 if (!PrevData.second) {
15892 Diag(I->second, diag::note_previous_definition);
16396 if (Res.second) {
16478 if (Res.second) {
16588 if (Res.second) {
tools/clang/lib/Sema/SemaOverload.cpp 5610 Notes[0].second.getDiagID() == diag::note_invalid_subexpr_in_const_expr)
5616 S.Diag(Notes[I].first, Notes[I].second);
8215 if (!AddedTypes.insert(S.Context.getCanonicalType(*MemPtr)).second)
8224 if (AddedTypes.insert(NullPtrTy).second) {
8305 if (!AddedTypes.insert(S.Context.getCanonicalType(*Ptr)).second)
8319 if (!AddedTypes.insert(CanonType).second ||
8371 if (!AddedTypes.insert(S.Context.getCanonicalType(*Ptr)).second)
8520 if (!AddedTypes.insert(S.Context.getCanonicalType(*Enum)).second)
8530 if (!AddedTypes.insert(S.Context.getCanonicalType(*MemPtr)).second)
8613 if (!AddedTypes.insert(S.Context.getCanonicalType(*Ptr)).second)
8888 if (!AddedTypes.insert(S.Context.getCanonicalType(*Ptr)).second)
8899 if (!AddedTypes.insert(S.Context.getCanonicalType(*MemPtr)).second)
8914 if (!AddedTypes.insert(S.Context.getCanonicalType(*Enum)).second)
9274 return (*FirstDiff.first)->getName() < (*FirstDiff.second)->getName();
9859 << (unsigned)KSPair.first << (unsigned)KSPair.second
9909 S.NoteOverloadCandidate(I->first, I->second);
9950 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
9979 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
9988 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
9998 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
10008 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
10020 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
10025 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
10037 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
10053 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
10094 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
10104 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
10117 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second
10131 FDiag << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
10212 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second
10216 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second
10375 if (PDiag && PDiag->second.getDiagID() ==
10385 if (PDiag && PDiag->second.getDiagID() ==
10389 << PDiag->second.getStringArg(0) << TemplateArgString;
10401 PDiag->second.EmitToString(S.getDiagnostics(), SFINAEArgString);
10628 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
11093 S.Diag(PD.first, PD.second);
11397 if (isBetterCandidate(I->second, Best->second))
11397 if (isBetterCandidate(I->second, Best->second))
11400 const FunctionDecl *BestFn = Best->second;
11403 return BestFn == Pair.second || isBetterCandidate(BestFn, Pair.second);
11403 return BestFn == Pair.second || isBetterCandidate(BestFn, Pair.second);
11569 MatchesCopy.addDecl(Matches[I].second, Matches[I].first.getAccess());
11577 << Matches[0].second->getDeclName(),
11585 Matches[0].second = cast<FunctionDecl>(*Result);
11595 if (Matches[I].second->getPrimaryTemplate() == nullptr)
11675 return Matches[0].second;
tools/clang/lib/Sema/SemaStmt.cpp 575 Expr *CondExpr = Cond.get().second;
596 if (IsConstexpr || isa<ObjCAvailabilityCheckExpr>(Cond.get().second))
600 Cond.get().second, thenStmt, ElseLoc, elseStmt);
628 lhs.second->getCaseLoc().getRawEncoding()
629 < rhs.second->getCaseLoc().getRawEncoding())
728 Expr *CondExpr = Cond.get().second;
991 Expr *PrevCase = CaseVals[i-1].second->getLHS()->IgnoreParenCasts();
992 Expr *CurrCase = CaseVals[i].second->getLHS()->IgnoreParenCasts();
1003 Diag(CaseVals[i].second->getLHS()->getBeginLoc(),
1007 Diag(CaseVals[i].second->getLHS()->getBeginLoc(),
1013 Diag(CaseVals[i - 1].second->getLHS()->getBeginLoc(),
1033 CaseStmt *CR = CaseRanges[i].second;
1072 CaseStmt *CR = CaseRanges[i].second;
1085 OverlapStmt = I->second;
1092 OverlapStmt = (I-1)->second;
1099 OverlapStmt = CaseRanges[i-1].second;
1152 Expr *CaseExpr = CI->second->getLHS();
1163 Expr *CaseExpr = RI->second->getLHS();
1170 RI->second->getRHS()->EvaluateKnownConstInt(Context);
1173 CaseExpr = RI->second->getRHS();
1189 switch (EI->second->getAvailability()) {
1202 if (EI->second->hasAttr<UnusedAttr>())
1215 RI->second->getRHS()->EvaluateKnownConstInt(Context);
1223 UnhandledNames.push_back(EI->second->getDeclName());
1322 CheckBreakContinueBinding(CondVal.second);
1324 if (CondVal.second &&
1325 !Diags.isIgnored(diag::warn_comma_operator, CondVal.second->getExprLoc()))
1326 CommaVisitor(*this).Visit(CondVal.second);
1331 return WhileStmt::Create(Context, CondVal.first, CondVal.second, Body,
1787 CheckBreakContinueBinding(Second.get().second);
1791 CheckForLoopConditionalStatement(*this, Second.get().second, third.get(),
1795 if (Second.get().second &&
1797 Second.get().second->getExprLoc()))
1798 CommaVisitor(*this).Visit(Second.get().second);
1805 ForStmt(Context, First, Second.get().second, Second.get().first, Third,
4044 FoundHandler = I->second;
4136 if (!R.second) {
4137 const CXXCatchStmt *Problem = R.first->second;
4361 if (I->second.isNull()) {
4377 ImplicitParamDecl::Create(Context, DC, Loc, ParamName, I->second,
tools/clang/lib/Sema/SemaStmtAsm.cpp 686 Diag((Found + 1)->second->getBeginLoc(),
689 Diag(Found->second->getBeginLoc(), diag::note_duplicate_asm_operand_name)
tools/clang/lib/Sema/SemaTemplate.cpp 3269 (*DeductionInfo)->peekSFINAEDiagnostic().second.getDiagID() ==
3742 Diag.second.EmitToString(S.getDiagnostics(), SFINAEArgString);
5798 if (Notes.size() == 1 && Notes[0].second.getDiagID() ==
5807 S.Diag(Notes[I].first, Notes[I].second);
8360 Diag(P.second->getLocation(),
tools/clang/lib/Sema/SemaTemplateDeduction.cpp 1803 if (!Visited.insert(NextT).second)
tools/clang/lib/Sema/SemaTemplateInstantiate.cpp 250 .second;
2272 P->first, P->second)) {
2285 P->first, P->second)) {
3005 return &Found->second;
tools/clang/lib/Sema/SemaTemplateInstantiateDecl.cpp 206 S.Diag(P.first, P.second);
408 DeclVarData.getValue().second,
4281 LateTemplateParser(OpaqueParser, *LPTIter->second);
5615 InstantiateFunctionDefinition(/*FIXME:*/ Inst.second, CurFD, true,
5621 InstantiateFunctionDefinition(/*FIXME:*/ Inst.second, Function, true,
5668 InstantiateVariableDefinition(/*FIXME:*/ Inst.second, Var, true,
tools/clang/lib/Sema/SemaTemplateVariadic.cpp 364 if (Name && NamesKnown.insert(Name).second)
367 if (Unexpanded[I].second.isValid())
368 Locations.push_back(Unexpanded[I].second);
725 PartiallySubstitutedPackLoc = i->second;
736 FirstPack.second = i->second;
736 FirstPack.second = i->second;
748 << SourceRange(FirstPack.second) << SourceRange(i->second);
748 << SourceRange(FirstPack.second) << SourceRange(i->second);
752 << SourceRange(i->second);
tools/clang/lib/Sema/SemaType.cpp 292 if (It->second) {
293 const Attr *Result = It->second;
294 It->second = nullptr;
307 return FoundLoc->second;
791 S.Diag(Qual.second, DiagID)
793 << FixItHint::CreateRemoval(Qual.second);
tools/clang/lib/Sema/TreeTransform.h 431 return Known->second;
7186 ScopeInfo->CoroutineSuspends.second == nullptr &&
11579 QualType InitQualType = Info.second;
tools/clang/lib/Serialization/ASTReader.cpp 586 bool IsUndef = PPOpts.Macros[I].second;
590 StringRef MacroBody = MacroPair.second;
650 if (Existing.second) {
666 if (Existing.second != Known->second.second) {
666 if (Existing.second != Known->second.second) {
669 << MacroName << Known->second.second;
676 if (Existing.second || Existing.first == Known->second.first)
1466 ModuleFile *F = GlobalSLocEntryMap.find(-ID)->second;
1598 ModuleFile *M = GlobalSLocEntryMap.find(-ID)->second;
1807 return LocalID + I->second;
3972 ObjCMethodList &Start = Method->isInstanceMethod()? Known->second.first
3973 : Known->second.second;
3973 : Known->second.second;
4035 makeNamesVisible(HiddenNames.second, HiddenNames.first);
4046 if (Visited.insert(Exported).second)
4084 if (llvm::Error Err = std::move(Result.second)) {
5842 ModuleFile *M = I->second;
5869 ModuleFile *M = I->second;
5883 unsigned LocalIndex = PPInfo.second;
5991 ModuleFile &M = *SLocMapI->second;
6040 if (SLocMapI->second->NumPreprocessedEntities == 0)
6043 ModuleFile &M = *SLocMapI->second;
6106 unsigned LocalIndex = PPInfo.second;
6258 assert(IDAndOffset.second == 0 && "not a start location for a FileID");
6305 ModuleFile *M = I->second;
7532 unsigned GlobalIndex = LocalIndex + I->second;
7741 return LocalID + I->second;
7759 return I->second;
7890 ModuleFile *Owner = I->second;
7897 return GlobalID - Owner->BaseDeclID + Pos->second;
7965 Visit(Lexical.first, Lexical.second);
7969 Visit(I->second.first, I->second.second);
7969 Visit(I->second.first, I->second.second);
7969 Visit(I->second.first, I->second.second);
8017 FileDeclsInfo &DInfo = I->second;
8065 for (DeclID ID : It->second.Table.find(Name)) {
8086 for (DeclID ID : It->second.Table.findAll()) {
8094 SetExternalVisibleDeclsForName(DC, I->first, I->second);
8102 return I == Lookups.end() ? nullptr : &I->second;
8243 llvm::errs() << " " << I->first << " -> " << I->second->FileName
8618 Pos->second.first.setBits(Visitor.getInstanceBits());
8619 Pos->second.first.setHasMoreThanOneDecl(Visitor.instanceHasMoreThanOneDecl());
8620 Pos->second.second.setBits(Visitor.getFactoryBits());
8620 Pos->second.second.setBits(Visitor.getFactoryBits());
8621 Pos->second.second.setHasMoreThanOneDecl(Visitor.factoryHasMoreThanOneDecl());
8621 Pos->second.second.setHasMoreThanOneDecl(Visitor.factoryHasMoreThanOneDecl());
8626 addMethodsToPool(S, Visitor.getInstanceMethods(), Pos->second.first);
8627 addMethodsToPool(S, Visitor.getFactoryMethods(), Pos->second.second);
8627 addMethodsToPool(S, Visitor.getFactoryMethods(), Pos->second.second);
8886 ModuleFile *M = I->second;
8924 return LocalID + I->second;
8941 ModuleFile *M = I->second;
8964 return LocalID + I->second;
8980 return LocalID + I->second;
9010 return I == GlobalSubmoduleMap.end() ? nullptr : I->second;
9058 return I->second ? EK_Never : EK_Always;
9078 ModuleFile &M = *I->second;
9112 return LocalID + I->second;
9750 serialization::ModuleFile &F = *I->second;
9806 Context.Comments.OrderedComments[Loc.first].emplace(Loc.second, C);
9867 std::move(PendingIdentifierInfos.back().second);
9877 FD->setType(GetType(PendingFunctionTypes[I].second));
9898 PendingDeclChains[I].second);
9905 for (unsigned I = 0, N = TLD->second.size(); I != N; ++I) {
9906 pushExternalDeclIntoScope(cast<NamedDecl>(TLD->second[I]), II);
9914 GlobalIDs.swap(PendingMacroIDs.begin()[I].second);
10028 FD->setLazyBody(PB->second);
10052 MD->setLazyBody(PB->second);
10079 for (auto &RecordPair : Merge.second) {
10094 for (auto &FD : Merge.second) {
10106 for (auto &Enum : Merge.second) {
10241 if (!DiagnosedOdrMergeFailures.insert(Merge.first).second)
10247 for (auto &RecordPair : Merge.second) {
10257 auto *SecondDD = RecordPair.second;
10405 if (FirstIt->second == SecondIt->second)
10405 if (FirstIt->second == SecondIt->second)
10642 FirstIt->second == SecondIt->second) {
10642 FirstIt->second == SecondIt->second) {
11802 for (auto &SecondFunction : Merge.second) {
11957 if (!DiagnosedOdrMergeFailures.insert(Merge.first).second)
11980 for (auto &SecondEnum : Merge.second) {
12075 if (FirstHashes[I].second == SecondHashes[I].second)
12075 if (FirstHashes[I].second == SecondHashes[I].second)
12158 auto *FPT = Update.second->getType()->castAs<FunctionProtoType>();
12161 Listener->ResolvedExceptionSpec(cast<FunctionDecl>(Update.second));
12162 for (auto *Redecl : Update.second->redecls())
12172 Update.second);
12193 for (auto *ND : It->second)
12198 It->second.clear();
tools/clang/lib/Serialization/ASTReaderDecl.cpp 1740 PFDI->second == ASTReader::PendingFakeDefinitionKind::Fake) {
1744 PFDI->second = ASTReader::PendingFakeDefinitionKind::FakeLoaded;
2304 TypesAndInfos[I].second = GetTypeSourceInfo();
2795 ModuleFile *M = I->second;
2806 return RecordLocation(I->second, GlobalOffset - I->second->GlobalBitOffset);
2806 return RecordLocation(I->second, GlobalOffset - I->second->GlobalBitOffset);
3305 if (isSameEntity(It->second, D))
3306 return FindExistingResult(Reader, D, It->second, AnonymousDeclNumber,
3373 MergedDCIt->second == D->getDeclContext())
3907 if (Offsets.second &&
3908 ReadVisibleDeclContextStorage(*Loc.F, DeclsCursor, Offsets.second, ID))
3972 auto UpdateOffsets = std::move(UpdI->second);
3983 uint64_t Offset = FileAndOffset.second;
4035 auto VisibleUpdates = std::move(I->second);
tools/clang/lib/Serialization/ASTReaderInternals.h 76 if (Found.insert(ID).second)
tools/clang/lib/Serialization/ASTWriter.cpp 1696 Record.push_back(PPOpts.Macros[I].second);
2339 Record.push_back(FDI->second->FirstDeclIndex);
2340 Record.push_back(FDI->second->DeclIDs.size());
2436 for (auto &LE : L.second) {
2438 FilenameMap.size() - 1)).second)
2454 Record.push_back(L.second.size());
2455 for (const auto &LE : L.second) {
2822 return Known->second;
2986 RecordData::value_type Record[] = {SUBMODULE_REQUIRES, R.second};
3138 if (I.second.isPragma() || IncludeNonPragmaStates) {
3140 Record.push_back(I.second.serialize());
3158 !FileIDAndFile.second.HasLocalTransitions)
3166 Record.push_back(FileIDAndFile.second.StateTransitions.size());
3167 for (auto &StatePoint : FileIDAndFile.second.StateTransitions) {
3288 DeclIDInFileInfo &Info = *FileDeclEntry.second;
3291 FileGroupedDeclIDs.push_back(LocDeclEntry.second);
3311 for (const auto &OC : FO.second) {
3312 const RawComment *I = OC.second;
3461 SelectorID ID = SelectorAndID.second;
3469 Data.Instance = F->second.first;
3470 Data.Factory = F->second.second;
3470 Data.Factory = F->second.second;
3558 SourceLocation Loc = SelectorAndLocation.second;
3801 IdentID ID = IdentIDPair.second;
3947 unsigned DataLen = 4 * (Lookup.second - Lookup.first);
3992 for (unsigned I = Lookup.first, N = Lookup.second; I != N; ++I)
4042 auto &Result = Lookup.second;
4066 if (Lookup.second.getLookupResult().empty())
4223 std::make_pair(Entry.first, Entry.second.getLookupResult()));
4229 DeclContext::lookup_result Result = NameAndResult.second;
4345 getTypeID(I.first->getCanonicalTypeInternal()), &I.second);
4355 const std::set<std::string> *ExtSet = E.second;
4377 StableOpenCLDeclExtMap.emplace_back(getDeclID(I.first), &I.second);
4387 const std::set<std::string> *ExtSet = E.second;
4464 LateParsedTemplate &LPT = *LPTMapEntry.second;
4809 WeakInfo &WI = WeakUndeclaredIdentifier.second;
4825 AddSourceLocation(SemaRef.VTableUses[I].second, VTableUses);
4839 AddSourceLocation(I.second, PendingInstantiations);
4860 if (!I.second)
4871 AddSourceLocation(I.second, UndefinedButUsed);
4882 DeleteExprsToAnalyze.push_back(DeleteExprsInfo.second.size());
4883 for (const auto &DeleteLoc : DeleteExprsInfo.second) {
4885 DeleteExprsToAnalyze.push_back(DeleteLoc.second);
4951 Number.second));
4955 Number.second));
5265 for (auto &Update : DeclUpdate.second) {
5669 return I->second;
5821 return It->second;
tools/clang/lib/Serialization/ASTWriterDecl.cpp 183 Record.AddDeclRef(F.second);
tools/clang/lib/Serialization/ASTWriterStmt.cpp 2406 Record.push_back(I->second);
tools/clang/lib/Serialization/GlobalModuleIndex.cpp 303 ArrayRef<unsigned> StoredDependencies = Modules[Known->second].Dependencies;
445 return Known->second;
697 if (Ident.second)
761 ImportedModuleFileInfo &Info = MapEntry.second;
797 Record.push_back(M->second.ID);
807 Record.push_back(M->second.Dependencies.size());
808 Record.append(M->second.Dependencies.begin(), M->second.Dependencies.end());
808 Record.append(M->second.Dependencies.begin(), M->second.Dependencies.end());
tools/clang/lib/Serialization/InMemoryModuleCache.cpp 28 assert(Insertion.second && "Already has a PCM");
tools/clang/lib/Serialization/Module.cpp 43 llvm::errs() << " " << I->first << " -> " << I->second << "\n";
tools/clang/lib/Serialization/ModuleManager.cpp 66 return Known->second;
tools/clang/lib/Serialization/MultiOnDiskHashTable.h 163 InfoObj.ReadDataInto(Key, LocalPtr + L.first, L.second,
222 NumBucketsAndEntries.second,
243 Result = It->second;
270 Info::MergeDataInto(KV.second, ResultBuilder);
282 InfoObj.ReadDataInto(Key, LocalPtr + L.first, L.second, ResultBuilder);
328 Gen.insert(KV.first, Info.ImportData(KV.second), Info);
tools/clang/lib/StaticAnalyzer/Checkers/ArrayBoundCheckerV2.cpp 152 *NV = simplifiedOffsets.second;
191 extentVal = simplifiedOffsets.second;
tools/clang/lib/StaticAnalyzer/Checkers/BasicObjCFoundationChecks.cpp 258 Arg = I->second;
tools/clang/lib/StaticAnalyzer/Checkers/CastValueChecker.cpp 392 CallKind Kind = Lookup->second;
tools/clang/lib/StaticAnalyzer/Checkers/CheckObjCInstMethSignature.cpp 108 if (MI == IMeths.end() || MI->second == nullptr)
112 ObjCMethodDecl *MethDerived = MI->second;
113 MI->second = nullptr;
tools/clang/lib/StaticAnalyzer/Checkers/CheckSecuritySyntaxOnly.cpp 611 if (ArgSuffix.second >= 0) {
612 const Expr *suffixEx = CE->getArg((unsigned)ArgSuffix.second);
tools/clang/lib/StaticAnalyzer/Checkers/DirectIvarAssignment.cpp 178 const ObjCPropertyDecl *PD = I->second;
tools/clang/lib/StaticAnalyzer/Checkers/ExprInspectionChecker.cpp 289 unsigned NumTimesReached = Item.second.NumTimesReached;
290 ExplodedNode *N = Item.second.ExampleNode;
tools/clang/lib/StaticAnalyzer/Checkers/GenericTaintChecker.cpp 291 IO.mapRequired("Args", NameArg.second);
331 std::move(F.second));
335 GenericTaintChecker::CustomSinks.try_emplace(S.first, std::move(S.second));
tools/clang/lib/StaticAnalyzer/Checkers/InnerPointerChecker.cpp 66 if (Entry.second.contains(Sym))
247 for (const auto Symbol : Entry.second) {
270 if (Entry.second.contains(Sym)) {
tools/clang/lib/StaticAnalyzer/Checkers/IteratorChecker.cpp 783 const auto Offset = Reg.second.getOffset();
791 const auto Offset = Sym.second.getOffset();
799 const auto CData = Cont.second;
2071 if (Reg.second.getContainer() == Cont)
2077 if (Sym.second.getContainer() == Cont)
2087 if (const auto LCVal = Binding.second.getAs<nonloc::LazyCompoundVal>()) {
2144 if (Cond(Reg.second)) {
2145 RegionMap = RegionMapFactory.add(RegionMap, Reg.first, Proc(Reg.second));
2157 if (Cond(Sym.second)) {
2158 SymbolMap = SymbolMapFactory.add(SymbolMap, Sym.first, Proc(Sym.second));
tools/clang/lib/StaticAnalyzer/Checkers/IvarInvalidationChecker.cpp 387 const ObjCPropertyDecl *PD = I->second;
584 if (!InvalidationMethod || I->second.hasMethod(InvalidationMethod))
611 markInvalidated(IvI->second);
624 markInvalidated(IvI->second);
635 markInvalidated(IvI->second);
707 markInvalidated(IvI->second);
tools/clang/lib/StaticAnalyzer/Checkers/LocalizationChecker.cpp 1148 BF->getBufferStart() + SLInfo.second, BF->getBufferEnd());
tools/clang/lib/StaticAnalyzer/Checkers/MIGChecker.cpp 206 unsigned ArgIdx = I->second;
tools/clang/lib/StaticAnalyzer/Checkers/MPI-Checker/MPIChecker.cpp 113 if (Req.second.CurrentState == Request::State::Nonblocking) {
119 BReporter.reportMissingWait(Req.second, Req.first, ErrorNode,
tools/clang/lib/StaticAnalyzer/Checkers/MacOSKeychainAPIChecker.cpp 125 R->markInteresting(AP.second->Region);
238 FunctionsToTrack[AP.second->AllocatorIdx].DeallocatorIdx;
475 const ADFunctionInfo &FI = FunctionsToTrack[AP.second->AllocatorIdx];
534 if (ReturnSymbol == I->second.Region)
561 Errors.push_back(std::make_pair(I->first, &I->second));
tools/clang/lib/StaticAnalyzer/Checkers/MallocChecker.cpp 2628 if (I->second.isAllocated() || I->second.isAllocatedOfSizeZero())
2628 if (I->second.isAllocated() || I->second.isAllocatedOfSizeZero())
2648 SymReaper.isDead(I->second.ReallocatedSym)) {
2657 SymReaper.isDead(I->second)) {
tools/clang/lib/StaticAnalyzer/Checkers/MallocSizeofChecker.cpp 61 if (AllocCall.second && AllocCall.second != S)
61 if (AllocCall.second && AllocCall.second != S)
63 AllocCall.second));
78 Visit(E->getSubExpr()).second);
tools/clang/lib/StaticAnalyzer/Checkers/MoveChecker.cpp 257 if (Region->isSubRegionOf(E.first) && E.second.isReported())
745 if (I.second.isMoved())
tools/clang/lib/StaticAnalyzer/Checkers/NullabilityChecker.cpp 1187 I->second.print(Out);
tools/clang/lib/StaticAnalyzer/Checkers/ObjCContainersChecker.cpp 182 OS << I.first << " : " << I.second << NL;
tools/clang/lib/StaticAnalyzer/Checkers/ObjCSelfInitChecker.cpp 367 if (I->second == SelfFlag_None)
370 if (I->second & SelfFlag_Self)
373 if (I->second & SelfFlag_InitRes) {
374 if (I->second != SelfFlag_InitRes)
tools/clang/lib/StaticAnalyzer/Checkers/ObjCUnusedIVarsChecker.cpp 40 I->second = Used;
74 I->second = Used;
138 if (I->second == Unused) {
156 if (I->second == Unused) {
tools/clang/lib/StaticAnalyzer/Checkers/PthreadLockChecker.cpp 190 if (I.second.isLocked())
192 else if (I.second.isUnlocked())
194 else if (I.second.isDestroyed())
196 else if (I.second.isUntouchedAndPossiblyDestroyed())
198 else if (I.second.isUnlockedAndPossiblyDestroyed())
472 const SymbolRef Sym = I->second;
tools/clang/lib/StaticAnalyzer/Checkers/RetainCountChecker/RetainCountChecker.cpp 532 if (P.second.getKind() == RetainedOutParameterOnNonZero ||
533 P.second.getKind() == RetainedOutParameterOnZero)
1388 I.first, I.second);
1404 state = handleSymbolDeath(state, I.first, I.second, Leaked);
1421 const RefVal &V = I.second;
1467 I.second.print(Out);
tools/clang/lib/StaticAnalyzer/Checkers/SimpleStreamChecker.cpp 185 if (isLeaked(Sym, I->second, IsSymDead, State))
tools/clang/lib/StaticAnalyzer/Checkers/StackAddrEscapeChecker.cpp 345 SourceRange Range = genName(Out, P.second, Ctx.getASTContext());
tools/clang/lib/StaticAnalyzer/Checkers/StdLibraryFunctionsChecker.cpp 124 return static_cast<ArgNoTy>(Args[0].second);
254 const llvm::APSInt &Max = BVF.getValue(R[I].second, T);
295 const llvm::APSInt &Right = BVF.getValue(R[E - 1].second + 1ULL, T);
304 const llvm::APSInt &Min = BVF.getValue(R[I - 1].second + 1ULL, T);
tools/clang/lib/StaticAnalyzer/Checkers/StreamChecker.cpp 396 const StreamState &SS = I.second;
tools/clang/lib/StaticAnalyzer/Checkers/Taint.cpp 37 Out << I.first << " : " << I.second << NL;
185 if (Kind == I.second && R->isSubRegionOf(I.first))
tools/clang/lib/StaticAnalyzer/Checkers/TrustNonnullChecker.cpp 150 if (!SymReaper.isLive(P.first) || !SymReaper.isLive(P.second))
tools/clang/lib/StaticAnalyzer/Checkers/UninitializedObject/UninitializedObjectChecker.cpp 166 const UninitFieldMap &UninitFields = UninitInfo.second;
191 *BT_uninitField, Pair.second, Node, LocUsedForUniqueing,
209 Report->addNote(Pair.second,
273 return UninitFields.insert({FR, std::move(NoteMsgBuf)}).second;
tools/clang/lib/StaticAnalyzer/Checkers/UninitializedObject/UninitializedPointee.cpp 253 if (!VisitedRegions.insert(R).second)
tools/clang/lib/StaticAnalyzer/Core/AnalyzerOptions.cpp 50 FOut << EntryDescPair.second;
54 for (char C : EntryDescPair.second) {
tools/clang/lib/StaticAnalyzer/Core/BasicValueFactory.cpp 59 ID.AddPointer( (void*) X.second);
66 X.second.Profile(ID);
tools/clang/lib/StaticAnalyzer/Core/BugReporter.cpp 723 const ExplodedNode *N = I.second;
2005 assert(!EndNotes->second.empty());
2006 LastPiece = EndNotes->second[0];
2028 for (const PathDiagnosticPieceRef &Note : VisitorNotes->second) {
2031 if (!DeduplicationSet.insert(ID).second)
2181 if (Result.second)
2466 return Descending ? LI->second > RI->second
2466 return Descending ? LI->second > RI->second
2467 : LI->second < RI->second;
2467 : LI->second < RI->second;
2472 return (*this)(LHS.second, RHS.second);
2472 return (*this)(LHS.second, RHS.second);
2533 assert(PriorityEntry->second <= Priority);
2636 if (!MacroStack.empty() && InstantiationLoc == MacroStack.back().second) {
2651 if (InstantiationLoc == MacroStack.back().second) {
2656 if (ParentInstantiationLoc == MacroStack.back().second) {
2664 if (!MacroGroup || ParentInstantiationLoc == MacroStack.back().second) {
3000 std::unique_ptr<PathDiagnostic> &PD = P.second;
3228 resetDiagnosticLocationToMainFile(*P.second);
tools/clang/lib/StaticAnalyzer/Core/BugReporterVisitors.cpp 639 if (!p.second)
1796 if (!VisitedBlocks.insert(NB).second)
2170 if (PreviousNodeTag == Tags.first || PreviousNodeTag == Tags.second)
2180 if (CurrentNodeTag != Tags.first && CurrentNodeTag != Tags.second)
2832 auto RangeIt = I.second.begin();
2837 while ((++RangeIt) != I.second.end()) {
2867 Constraints = CF.add(Constraints, Sym, C.second);
tools/clang/lib/StaticAnalyzer/Core/CheckerManager.cpp 58 assert(Event.second.HasDispatcher &&
84 checkers = &(CCI->second);
729 CT.second->printState(TempOut, State, /*NL=*/NewLine.c_str(), /*Sep=*/"");
745 CT.second->printState(TempOut, State, /*NL=*/NewLine.c_str(), /*Sep=*/"");
751 << "{ \"checker\": \"" << CT.second->getCheckerName().getName()
896 return CCI->second;
tools/clang/lib/StaticAnalyzer/Core/ConstraintManager.cpp 38 if (P.first && !P.second)
40 if (!P.first && P.second)
tools/clang/lib/StaticAnalyzer/Core/DynamicType.cpp 154 const DynamicTypeInfo &DTI = I->second;
190 const CastSet &Set = I->second;
tools/clang/lib/StaticAnalyzer/Core/Environment.cpp 270 I->second.printJson(Out, /*AddQuotes=*/true);
tools/clang/lib/StaticAnalyzer/Core/ExplodedGraph.cpp 468 if (!Pass1.insert(N).second)
520 NewN->addPredecessor(const_cast<ExplodedNode *>(PI->second), *G);
531 const_cast<ExplodedNode *>(PI->second)->addPredecessor(NewN, *G);
tools/clang/lib/StaticAnalyzer/Core/ExprEngine.cpp 139 const LocationContext *getLocationContext() const { return Impl.second; }
178 ID.AddPointer(Impl.second);
581 SVal Value = I.second;
720 if (SymbolRef Sym = I.second.getAsSymbol())
722 if (const MemRegion *MR = I.second.getAsRegion())
2460 bool IsReference = VInfo->second->isReferenceType();
2958 Bldr.generateNode(Ex, Pred, StateFalse, tags.second);
tools/clang/lib/StaticAnalyzer/Core/FunctionSummary.cpp 21 Total += I.second.TotalBasicBlocks;
28 Total += I.second.VisitedBasicBlocks.count();
tools/clang/lib/StaticAnalyzer/Core/HTMLDiagnostics.cpp 358 for (unsigned LineNo : I->second) {
359 if (LineNo != *(I->second.begin()))
758 unsigned ColNo = SM.getColumnNumber(LPosInfo.first, LPosInfo.second);
888 const char* MacroName = LocInfo.second + BufferInfo.data();
tools/clang/lib/StaticAnalyzer/Core/MemRegion.cpp 1603 return I->second & IK;
1618 return I->second & IK;
tools/clang/lib/StaticAnalyzer/Core/PlistDiagnostics.cpp 510 for (unsigned LineNo : I->second) {
776 o << " <string>" << CI->second << "</string>\n";
932 PPToUse = &LocAndUnit->second->getPreprocessor();
1006 for (MacroInfo::tokens_iterator ArgIt = ArgMapIt->second.begin(),
1007 ArgEnd = ArgMapIt->second.end();
1061 const char *MacroNameTokenPos = MB->getBufferStart() + LocInfo.second;
1216 ExpArgTokens &CurrExpArgTokens = Pair.second;
tools/clang/lib/StaticAnalyzer/Core/ProgramState.cpp 91 I->second.second(I->second.first);
91 I->second.second(I->second.first);
91 I->second.second(I->second.first);
500 p.second = DeleteContext;
531 bool wasVisited = !visited.insert(val.getCVData()).second;
555 bool wasVisited = !visited.insert(*SI).second;
593 bool wasVisited = !visited.insert(R).second;
tools/clang/lib/StaticAnalyzer/Core/RegionStore.cpp 765 if (C && !Visited.insert(C).second)
1643 if (Result.second)
1644 Result.second = MRMgr.getElementRegionWithSuper(ER, Result.second);
1644 Result.second = MRMgr.getElementRegionWithSuper(ER, Result.second);
1650 if (Result.second)
1651 Result.second = MRMgr.getFieldRegionWithSuper(FR, Result.second);
1651 Result.second = MRMgr.getFieldRegionWithSuper(FR, Result.second);
1660 if (Result.second)
1661 Result.second = MRMgr.getCXXBaseObjectRegionWithSuper(BaseReg,
1662 Result.second);
2055 return I->second;
2075 SVal V = I->second;
tools/clang/lib/StaticAnalyzer/Core/SarifDiagnostics.cpp 304 if (P.second) {
tools/clang/lib/StaticAnalyzer/Core/SimpleSValBuilder.cpp 1276 return I->second;
1308 return I->second;
tools/clang/lib/StaticAnalyzer/Core/Store.cpp 55 Store = Bind(Store.getStore(), I.first.castAs<Loc>(), I.second);
tools/clang/lib/StaticAnalyzer/Core/SymbolManager.cpp 371 dependencies = I->second;
381 return I->second;
388 if (LI->second == HaveMarkedDependents)
390 LI->second = HaveMarkedDependents;
tools/clang/lib/StaticAnalyzer/Core/WorkList.cpp 163 if (InsertInfo.second) {
210 return LHS.second < RHS.second;
210 return LHS.second < RHS.second;
272 return LHS.second < RHS.second;
272 return LHS.second < RHS.second;
tools/clang/lib/StaticAnalyzer/Frontend/CheckerRegistry.cpp 213 checker.State = Opt.second ? StateFromCmdLine::State_Enabled
295 auto DependencyIt = binaryFind(Checkers, Entry.second);
297 DependencyIt->FullName == Entry.second &&
323 if (It.second)
379 CheckerOptEntry.second, AnOpts, Diags);
386 PackageOptEntry.second, AnOpts, Diags);
595 const CmdLineOption &Option = Entry.second;
tools/clang/lib/Tooling/ASTDiff/ASTDiff.cpp 792 NodeId Dst = Tuple.second;
tools/clang/lib/Tooling/AllTUsExecution.cpp 130 Tool.appendArgumentsAdjuster(Action.second);
tools/clang/lib/Tooling/Core/Replacement.cpp 127 this->ReplacementRange = Range(DecomposedLocation.second, Length);
143 End.second += Lexer::MeasureTokenLength(SpellingEnd, Sources, LangOpts);
144 return End.second - Start.second;
144 return End.second - Start.second;
620 else if (ProcessedFileEntries.insert(*FE).second)
621 Result[Entry.first] = std::move(Entry.second);
tools/clang/lib/Tooling/Execution.cpp 34 Callback(KV.first, KV.second);
tools/clang/lib/Tooling/Inclusions/HeaderIncludes.cpp 324 unsigned InsertOffset = CatOffset->second; // Fall back offset
327 for (const auto *Inc : Iter->second) {
tools/clang/lib/Tooling/InterpolatingCompilationDatabase.cpp 362 << " score=" << Best.second << "\n");
396 Candidates[Entry.second] += Points;
430 S.Points = Candidate.second;
454 return {longestMatch(Filename, Paths).second, 0};
466 return {Range.first, Range.second};
tools/clang/lib/Tooling/Refactoring.cpp 61 Result = tooling::applyAllReplacements(Entry.second, Rewrite) && Result;
79 auto &CurReplaces = FileAndReplaces.second;
tools/clang/lib/Tooling/Refactoring/AtomicChange.cpp 204 Key = FilePath + ":" + std::to_string(FileIDAndOffset.second);
tools/clang/lib/Tooling/RefactoringCallbacks.cpp 216 CharSourceRange::getTokenRange(NodeIter->second.getSourceRange());
tools/clang/lib/Tooling/StandaloneExecution.cpp 64 Tool.appendArgumentsAdjuster(Action.second);
tools/clang/lib/Tooling/Syntax/BuildTree.cpp 120 It->second.Role = Role;
142 Node->prependChildLowLevel(std::prev(It)->second.Node,
143 std::prev(It)->second.Role);
152 auto *Root = Trees.begin()->second.Node;
166 It->second.Node->kind(),
168 R += It->second.Node->dump(A);
tools/clang/lib/Tooling/Syntax/Tokens.cpp 132 const MarkedFile &File = FileIt->second;
160 return It->second.SpelledTokens;
192 const MarkedFile &File = Files.find(FID)->second;
216 auto &File = FileIt->second;
239 auto &File = FileIt->second;
443 TokenBuffer::MarkedFile &File = It.first->second;
446 if (!It.second)
529 return Mapping->second; // found a mapping before the offset.
537 if (F.second.SpelledTokens.empty())
539 fillGapUntil(F.second, F.second.SpelledTokens.back().endLocation(),
539 fillGapUntil(F.second, F.second.SpelledTokens.back().endLocation(),
540 F.second.EndExpanded);
605 const MarkedFile &File = Files.find(ID)->second;
tools/clang/lib/Tooling/Syntax/Tree.cpp 29 assert(It.second && "duplicate FileID");
30 return {FID, It.first->second};
tools/clang/lib/Tooling/Tooling.cpp 218 llvm::MemoryBuffer::getMemBuffer(FilenameWithContent.second));
455 if (SeenWorkingDirectories.insert("/").second)
460 llvm::MemoryBuffer::getMemBuffer(MappedFile.second));
521 if (SeenWorkingDirectories.insert(CompileCommand.Directory).second)
526 llvm::MemoryBuffer::getMemBuffer(MappedFile.second));
tools/clang/lib/Tooling/Transformer/RangeSelector.cpp 61 return It->second;
tools/clang/lib/Tooling/Transformer/RewriteRule.cpp 95 DynTypedMatcher BoundMatcher(Case.second.Matcher);
132 taggedMatchers("Tag", Bucket.second));
151 CharSourceRange::getTokenRange(Root->second.getSourceRange()),
158 Root->second.getSourceRange().getBegin());
tools/clang/lib/Tooling/Transformer/SourceCode.cpp 61 BeginInfo.second > EndInfo.second)
61 BeginInfo.second > EndInfo.second)
tools/clang/lib/Tooling/Transformer/Stencil.cpp 41 return It->second;
tools/clang/lib/Tooling/Transformer/Transformer.cpp 61 switch (I.second) {
tools/clang/tools/arcmt-test/arcmt-test.cpp 146 OS << RB.second->getBuffer();
275 if (!sys::fs::exists(It->second)) {
276 errs() << "error: '" << It->second << "' does not exist\n";
284 if (!filesCompareEqual(It->second, inputResultFname)) {
285 errs() << "error: '" << It->second << "' is different than "
296 errs() << "error: '" << I->second << "' was not verified!\n";
tools/clang/tools/clang-diff/ClangDiff.cpp 351 OS << R"(,"end":)" << Offsets.second;
tools/clang/tools/clang-format/ClangFormat.cpp 180 LineRange.second.getAsInteger(0, ToLine);
tools/clang/tools/clang-offload-bundler/ClangOffloadBundler.cpp 112 Triple = KindTriplePair.second;
tools/clang/tools/clang-refactor/ClangRefactor.cpp 128 SM.translateLineCol(FID, Range.Begin.first, Range.Begin.second));
130 SM.translateLineCol(FID, Range.End.first, Range.End.second));
133 << Range.Begin.first << ':' << Range.Begin.second << '-'
134 << Range.End.first << ':' << Range.End.second
178 return *It->second;
228 if (Visited.insert(&Opt).second)
235 if (!OptionNames.insert(Opt.getName()).second)
326 getDiags().Report(Diag->first, Diag->second.getDiagID()));
327 Diag->second.Emit(DB);
355 if (!CommandNames.insert(Action->getCommand()).second) {
tools/clang/tools/clang-refactor/TestSupport.cpp 192 Diag.second.EmitToString(getDiags(), DiagText);
222 << LineColumn.first << ':' << LineColumn.second << " in group '"
375 if (!It.second)
376 It.first->second.push_back(Range);
386 TestRanges.GroupedRanges.push_back({Group.first, std::move(Group.second)});
tools/clang/tools/clang-rename/ClangRename.cpp 201 TUR.Replacements.insert(TUR.Replacements.end(), Entry.second.begin(),
202 Entry.second.end());
tools/clang/tools/clang-scan-deps/ClangScanDeps.cpp 238 CWD = Compilation.second;
tools/clang/tools/driver/cc1as_main.cpp 414 Ctx.addDebugPrefixMapEntry(KV.first, KV.second);
513 auto Val = Pair.second;
tools/clang/tools/driver/driver.cpp 121 StringRef ReplPattern = Edit.substr(2).split('/').second;
478 const Command *FailingCommand = P.second;
tools/clang/tools/extra/clang-apply-replacements/lib/Tooling/ApplyReplacements.cpp 157 if (!Replaces.insert(R).second)
161 } else if (Warned.insert(R.getFilePath()).second) {
182 llvm::sort(FileAndReplacements.second.begin(),
183 FileAndReplacements.second.end());
202 for (const auto &R : FileAndReplacements.second) {
tools/clang/tools/extra/clang-apply-replacements/tool/ClangApplyReplacementsMain.cpp 147 applyChanges(FileName, FileChange.second, Spec, Diagnostics);
tools/clang/tools/extra/clang-change-namespace/ChangeNamespace.cpp 110 const char *TokBegin = File.data() + LocInfo.second;
968 auto &NsMoves = FileAndNsMoves.second;
1038 Entry.second.clear();
tools/clang/tools/extra/clang-doc/BitcodeWriter.cpp 125 BlockIdNameMap[Init.first] = Init.second;
191 RecordIdNameMap[Init.first] = Init.second;
192 assert((Init.second.Name.size() + 1) <= BitCodeConstants::RecordSize);
383 assert(Block.second.size() < (1U << BitCodeConstants::SubblockIDSize));
384 emitBlockInfo(Block.first, Block.second);
440 emitRecord(L.first, L.second);
tools/clang/tools/extra/clang-doc/HTMLGenerator.cpp 194 OS << " " << A.first << "=\"" << A.second << "\"";
tools/clang/tools/extra/clang-doc/Mapper.cpp 51 if (I.second)
52 CDCtx.ECtx->reportResult(llvm::toHex(llvm::toStringRef(I.second->USR)),
53 serialize::serialize(I.second));
tools/clang/tools/extra/clang-include-fixer/FuzzySymbolIndex.cpp 35 Results.push_back(E.second);
tools/clang/tools/extra/clang-include-fixer/InMemorySymbolIndex.cpp 26 return I->second;
tools/clang/tools/extra/clang-include-fixer/IncludeFixer.cpp 259 return tooling::Range(SM.getDecomposedLoc(BeginLoc).second,
tools/clang/tools/extra/clang-include-fixer/SymbolIndexManager.cpp 111 if (SymbolContext->second == *IdentiferContext) {
tools/clang/tools/extra/clang-include-fixer/find-all-symbols/HeaderMapCollector.cpp 21 Entry.second);
38 return Entry.second;
tools/clang/tools/extra/clang-include-fixer/find-all-symbols/SymbolInfo.cpp 63 io.mapRequired("ContextName", Context.second);
93 QualifiedName = Context.second + "::" + QualifiedName;
122 SymbolAndSignals S{Symbol.first, Symbol.second};
tools/clang/tools/extra/clang-include-fixer/tool/ClangIncludeFixer.cpp 178 Split.second.split(CommaSplits, ",");
tools/clang/tools/extra/clang-move/HelperDeclRefGraph.cpp 23 const CallGraphNode *N = (I->second).get();
68 return I == DeclMap.end() ? nullptr : I->second.get();
tools/clang/tools/extra/clang-move/Move.cpp 292 const char *TokBegin = File.data() + LocInfo.second;
771 auto Err = FileAndReplacements.second.add(
tools/clang/tools/extra/clang-query/Query.cpp 114 clang::SourceRange R = BI->second.getSourceRange();
126 BI->second.print(OS, AST->getASTContext().getPrintingPolicy());
131 BI->second.dump(OS, AST->getSourceManager());
tools/clang/tools/extra/clang-tidy/ClangTidy.cpp 178 Diags.Report(Fix.first, Fix.second ? diag::note_fixit_applied
333 AnalyzerOptions->Config[OptName.substr(AnalyzerPrefix.size())] = Opt.second;
tools/clang/tools/extra/clang-tidy/ClangTidyCheck.cpp 41 return Iter->second;
50 return Iter->second;
54 return Iter->second;
tools/clang/tools/extra/clang-tidy/ClangTidyDiagnosticConsumer.cpp 233 return I->second;
456 if (Range.first <= LineNumber && LineNumber <= Range.second)
470 DiagLevelAndFormatString.first, DiagLevelAndFormatString.second);
646 for (const auto &FileAndReplaces : *ErrorAndFix.second) {
656 for (const auto &FileAndReplace : *ErrorFixes[I].second) {
673 std::vector<Event> &Events = FileAndEvents.second;
692 ErrorFixes[I].second->clear();
tools/clang/tools/extra/clang-tidy/ClangTidyModule.cpp 28 Checks.emplace_back(Factory.second(Factory.first, Context));
tools/clang/tools/extra/clang-tidy/ClangTidyOptions.cpp 36 return Range.first == 0 ? 0 : Range.second == 0 ? 1 : 2;
41 return Index == 0 ? Range.first : Range.second;
54 if (Range.first <= 0 || Range.second <= 0)
64 IO.mapRequired("value", KeyValue.second);
75 Map[KeyValue.first] = KeyValue.second;
155 Result.CheckOptions[KeyValue.first] = KeyValue.second;
307 ConfigHandler.second((*Text)->getBuffer());
tools/clang/tools/extra/clang-tidy/abseil/DurationConversionCastCheck.cpp 55 llvm::StringRef NewFuncName = getDurationInverseForScale(*Scale).second;
tools/clang/tools/extra/clang-tidy/abseil/DurationFactoryScaleCheck.cpp 38 return ScaleIter->second;
tools/clang/tools/extra/clang-tidy/abseil/DurationRewriter.cpp 78 InverseFunctions.first, InverseFunctions.second))),
tools/clang/tools/extra/clang-tidy/abseil/TimeSubtractionCheck.cpp 189 getDurationInverseForScale(*Scale).second.str().substr(2)) +
tools/clang/tools/extra/clang-tidy/bugprone/ArgumentCommentCheck.cpp 78 const char *StrData = Buffer.data() + BeginLoc.second;
97 StringRef(Buffer.begin() + CommentLoc.second, Tok.getLength()));
295 if (IdentRE.match(Comment.second, &Matches) &&
tools/clang/tools/extra/clang-tidy/bugprone/SuspiciousEnumUsageCheck.cpp 48 MaxVal = MinMaxVal.second->getInitVal();
tools/clang/tools/extra/clang-tidy/bugprone/VirtualNearMissCheck.cpp 186 return Iter->second;
201 return Iter->second;
tools/clang/tools/extra/clang-tidy/cppcoreguidelines/ProTypeMemberInitCheck.cpp 464 if (!F->getParent()->isUnion() || UnionsSeen.insert(F->getParent()).second)
tools/clang/tools/extra/clang-tidy/cppcoreguidelines/SpecialMemberFunctionsCheck.cpp 129 StoreMember(KV.second);
135 checkForMissingMembers(C.first, C.second);
184 << ID.second << cppcoreguidelines::join(DefinedMembers, " and ")
tools/clang/tools/extra/clang-tidy/cppcoreguidelines/SpecialMemberFunctionsCheck.h 90 return Val.first.getRawEncoding() + SecondHash(Val.second);
tools/clang/tools/extra/clang-tidy/fuchsia/RestrictSystemIncludesCheck.cpp 78 const FileIncludes &FileDirectives = Bucket.second;
tools/clang/tools/extra/clang-tidy/google/AvoidNSObjectNewCheck.cpp 81 StringRef FactorySelector = FoundClassFactory->second;
tools/clang/tools/extra/clang-tidy/google/UpgradeGoogletestCaseCheck.cpp 35 return Mapping.second;
221 return Mapping.second;
tools/clang/tools/extra/clang-tidy/llvm/IncludeOrderCheck.cpp 107 auto &FileDirectives = Bucket.second;
tools/clang/tools/extra/clang-tidy/misc/NewDeleteOverloadsCheck.cpp 174 for (const auto *Overload : RP.second) {
176 std::find_if(RP.second.begin(), RP.second.end(),
176 std::find_if(RP.second.begin(), RP.second.end(),
193 if (Match == RP.second.end()) {
tools/clang/tools/extra/clang-tidy/misc/UnusedAliasDeclsCheck.cpp 54 if (!FoundDecl.second.isValid())
57 << FoundDecl.first << FixItHint::CreateRemoval(FoundDecl.second);
tools/clang/tools/extra/clang-tidy/modernize/AvoidBindCheck.cpp 112 if (!PlaceHolderIndices.insert(B.PlaceHolderIndex).second)
tools/clang/tools/extra/clang-tidy/modernize/LoopConvertUtils.cpp 95 if (I.second == V) {
107 if (I != GeneratedDecls->end() && I->second == Name) {
239 if (ID == I.second)
488 if (UsageLocations.insert(Begin).second)
891 if (I != GeneratedDecls->end() && I->second == Symbol)
tools/clang/tools/extra/clang-tidy/modernize/UseNullptrCheck.cpp 333 ArgLoc = Expansion.getSpellingLoc().getLocWithOffset(LocInfo.second);
392 Loc = Expansion.getSpellingLoc().getLocWithOffset(LocInfo.second);
tools/clang/tools/extra/clang-tidy/modernize/UseOverrideCheck.cpp 53 const char *TokenBegin = File.data() + LocInfo.second;
tools/clang/tools/extra/clang-tidy/modernize/UseTrailingReturnTypeCheck.cpp 134 const char *TokenBegin = File.data() + Loc.second;
214 const char *TokenBegin = File.data() + Loc.second;
338 SM.getDecomposedLoc(ReturnTypeCVRange.getBegin()).second;
352 unsigned int TOffset = SM.getDecomposedLoc(CT.T.getLocation()).second;
tools/clang/tools/extra/clang-tidy/modernize/UseUsingCheck.cpp 37 const char *TokenBegin = File.data() + LocInfo.second;
tools/clang/tools/extra/clang-tidy/mpi/TypeMismatchCheck.cpp 34 while (ItPair.first != ItPair.second) {
35 if (ItPair.first->second == MPIDatatype)
tools/clang/tools/extra/clang-tidy/performance/UnnecessaryValueParamCheck.cpp 101 .first->second;
tools/clang/tools/extra/clang-tidy/readability/AvoidConstParamsInDecls.cpp 56 const char *TokenBegin = File.data() + LocInfo.second;
tools/clang/tools/extra/clang-tidy/readability/IdentifierNamingCheck.cpp 50 return Val.first.getRawEncoding() + SecondHash(Val.second);
691 if (!Failure.RawUsageLocs.insert(FixLocation.getRawEncoding()).second)
933 const NamingCheckFailure &Failure = Pair.second;
940 << Failure.KindName << Decl.second;
tools/clang/tools/extra/clang-tidy/readability/NamedParameterCheck.cpp 87 UnnamedParams.front().first->getParamDecl(UnnamedParams.front().second);
100 (*M->begin_overridden_methods())->getParamDecl(P.second);
108 const ParmVarDecl *DefParm = Definition->getParamDecl(P.second);
117 const ParmVarDecl *Parm = P.first->getParamDecl(P.second);
tools/clang/tools/extra/clang-tidy/readability/NonConstParameterCheck.cpp 120 It->second.IsReferenced = true;
130 const ParmInfo &ParamInfo = It.second;
215 It->second.CanBeConst = false;
tools/clang/tools/extra/clang-tidy/readability/SimplifyBooleanExprCheck.cpp 94 return BinOp->getOpcodeStr(NegatableOp.second);
95 if (Opcode == NegatableOp.second)
108 return Name.second;
123 return getOperatorName(NegatableOp.second);
124 if (Opcode == NegatableOp.second)
tools/clang/tools/extra/clang-tidy/tool/ClangTidyMain.cpp 381 llvm::outs() << "'" << Check << "' is enabled in the " << It->second
tools/clang/tools/extra/clang-tidy/utils/ExprSequence.cpp 69 SyntheticStmtSourceMap[SyntheticStmt.first] = SyntheticStmt.second;
tools/clang/tools/extra/clang-tidy/utils/HeaderGuard.cpp 74 const MacroInfo *MI = MacroEntry.second;
93 Ifndefs[MacroEntry.first.getIdentifierInfo()].second;
tools/clang/tools/extra/clang-tidy/utils/IncludeInserter.cpp 53 if (!InsertedHeaders[FileID].insert(Header).second)
tools/clang/tools/extra/clang-tidy/utils/IncludeSorter.cpp 70 Parts.first.str() + "/internal/" + Parts.second.str();
72 Parts.first.str() + "/proto/" + Parts.second.str();
231 Edits[LineNumber].second.append(SourceText.data(), SourceText.size());
248 SourceRange EditRange = LineEdit.second.first;
253 CurrentText += LineEdit.second.second;
253 CurrentText += LineEdit.second.second;
262 CurrentRange = LineEdit.second.first;
263 CurrentText = LineEdit.second.second;
263 CurrentText = LineEdit.second.second;
tools/clang/tools/extra/clang-tidy/utils/LexerUtils.cpp 101 File.begin(), File.data() + LocInfo.second, File.end());
tools/clang/tools/extra/clang-tidy/utils/NamespaceAliaser.cpp 87 if (FunctionAliases->second.count(Namespace) != 0) {
88 return FunctionAliases->second.find(Namespace)->getValue();
tools/clang/tools/extra/clang-tidy/utils/TransformerClangTidyCheck.cpp 105 /*IsAngled=*/I.second == tooling::IncludeFormat::Angled)) {
tools/clang/tools/extra/clangd/ClangdLSPServer.cpp 210 ReplyHandler = std::move(ReplyCallbacks[Index].second);
278 OldestCB->second(llvm::createStringError(
413 RequestCancelers[StrID] = {std::move(Task.second), Cookie};
421 if (It != RequestCancelers.end() && It->second.second == Cookie)
1119 tooling::CompileCommand(std::move(Entry.second.workingDirectory), File,
1120 std::move(Entry.second.compilationCommand),
1263 return FixItsIter->second;
tools/clang/tools/extra/clangd/CodeComplete.cpp 235 if (L.second.Total != R.second.Total)
235 if (L.second.Total != R.second.Total)
236 return L.second.Total > R.second.Total;
236 return L.second.Total > R.second.Total;
343 if (ToInclude->second && ShouldInsert)
905 SS.Signature.documentation = IndexDocIt->second;
1465 Output.Completions.back().Score = C.second;
1542 if (Ret.second)
1544 Bundles[Ret.first->second].push_back(std::move(C));
tools/clang/tools/extra/clangd/Diagnostics.cpp 445 return !SeenDiags.emplace(D.Range, D.Message).second;
648 IncludeLinesWithErrors.insert(LastDiag->Range.start.line).second)) {
tools/clang/tools/extra/clangd/FileDistance.cpp 85 if (!R.second) {
86 if (Cost < R.first->second) {
87 R.first->second = Cost;
133 Cost = It->second;
151 if (!R.second)
155 R.first->second = forScheme(U->scheme()).distance(U->body());
159 return R.first->second;
208 Param.MaxUpTraversals = std::max(Path.second - 1, 0);
tools/clang/tools/extra/clangd/FindSymbols.cpp 36 return L.second.name < R.second.name; // Earlier name is better.
36 return L.second.name < R.second.name; // Earlier name is better.
76 Req.Query = Names.second;
126 Result.push_back(std::move(R.second));
tools/clang/tools/extra/clangd/FindTarget.cpp 369 if (!(Entry.second & ~Mask))
399 if (D.second & ~Mask)
401 if (D.second & DeclRelation::TemplatePattern) {
405 if (D.second & DeclRelation::TemplateInstantiation)
tools/clang/tools/extra/clangd/Format.cpp 338 Final = Final.merge(*Pass.second);
339 FinalCursor = Pass.second->getShiftedCodePosition(FinalCursor);
342 cantFail(tooling::applyAllReplacements(FinalCode, *Pass.second));
tools/clang/tools/extra/clangd/Function.h 57 return P.second == ListenerID;
tools/clang/tools/extra/clangd/GlobalCompilationDatabase.cpp 148 if (R.second) { // Cache miss, try to load CDB.
224 if (!It.second)
tools/clang/tools/extra/clangd/Headers.cpp 130 if (R.second)
155 if (Seen.insert(Child).second) {
tools/clang/tools/extra/clangd/IncludeFixer.cpp 171 if (ToInclude->second) {
173 if (!I.second)
298 Result.Name = Split.second;
433 return &I->second;
452 return &E.first->second;
tools/clang/tools/extra/clangd/Protocol.cpp 654 FileChanges[Change.first] = llvm::json::Array(Change.second);
855 llvm::json::Array({PI.labelOffsets->first, PI.labelOffsets->second});
tools/clang/tools/extra/clangd/Quality.cpp 447 Score.first, Score.second);
tools/clang/tools/extra/clangd/QueryDriverDatabase.cpp 248 SystemIncludes = It->second;
251 extractSystemIncludes(Key.first, Key.second, QueryDriverRegex);
tools/clang/tools/extra/clangd/Selection.cpp 326 if (B.second < SelEnd && E.second >= SelBeginTokenStart)
326 if (B.second < SelEnd && E.second >= SelBeginTokenStart)
404 Claimed.claim(B.second, E.second, Result);
404 Claimed.claim(B.second, E.second, Result);
407 SourceRange(SM.getComposedLoc(B.first, B.second),
408 SM.getComposedLoc(E.first, E.second))
tools/clang/tools/extra/clangd/SourceCode.cpp 485 if (SM.getFileOffset(It->second) > SM.getFileOffset(End))
487 return {It->second, End};
998 .getLocWithOffset(DecLoc.second - 1));
tools/clang/tools/extra/clangd/TUScheduler.cpp 98 if (It == LRU.end() || !It->second)
100 return It->second->getUsedBytes();
113 std::unique_ptr<ParsedAST> ForCleanup = std::move(LRU.back().second);
128 std::unique_ptr<ParsedAST> V = std::move(Existing->second);
tools/clang/tools/extra/clangd/Trace.cpp 156 Out.attribute(KV.first, KV.second);
164 if (ThreadsWithMD.insert(TID).second) {
tools/clang/tools/extra/clangd/XRefs.cpp 1138 if (!RPSet.insert(Pattern).second) {
tools/clang/tools/extra/clangd/index/Background.cpp 71 if (I.second) {
269 for (const auto &R : SymRefs.second) {
282 FileIt->second->Relations.insert(&Rel);
329 if (!DigestIt.second && SV.Digest == Hash && SV.HadErrors && !HadErrors)
tools/clang/tools/extra/clangd/index/BackgroundIndexLoader.cpp 58 if (!It.second)
105 for (PathRef Edge : ShardAndEdges.second) {
107 if (It.second)
tools/clang/tools/extra/clangd/index/FileIndex.cpp 146 if (!I.second)
147 I.first->second = mergeSymbol(I.first->second, Sym);
147 I.first->second = mergeSymbol(I.first->second, Sym);
156 It->getSecond().References += Sym.second.size();
160 SymsStorage.push_back(std::move(Sym.second));
171 if (AddedSymbols.insert(Sym.ID).second)
185 MergedRefs[Sym.first].append(Sym.second.begin(), Sym.second.end());
185 MergedRefs[Sym.first].append(Sym.second.begin(), Sym.second.end());
186 Count += Sym.second.size();
191 auto &SymRefs = Sym.second;
tools/clang/tools/extra/clangd/index/IndexAction.cpp 114 assert(!I.second && "File inserted for the first time on skip.");
tools/clang/tools/extra/clangd/index/MemIndex.cpp 24 return std::make_unique<MemIndex>(Data.first, Data.second, Relations,
40 const Symbol *Sym = Pair.second;
56 Callback(*Item.second);
66 Callback(*I->second);
79 for (const auto &O : SymRefs->second) {
98 for (const auto &Obj : It->second) {
tools/clang/tools/extra/clangd/index/MemIndex.h 28 this->Refs.try_emplace(R.first, R.second.begin(), R.second.end());
28 this->Refs.try_emplace(R.first, R.second.begin(), R.second.end());
tools/clang/tools/extra/clangd/index/Ref.cpp 52 std::vector<Ref> SymRefs(Sym.second.begin(), Sym.second.end());
52 std::vector<Ref> SymRefs(Sym.second.begin(), Sym.second.end());
tools/clang/tools/extra/clangd/index/Relation.cpp 24 return {IterPair.first, IterPair.second};
tools/clang/tools/extra/clangd/index/Serialization.cpp 189 return Index.find({S.data(), S.size()})->second;
358 Result.second.resize(Data.consumeVar());
359 for (auto &Ref : Result.second) {
479 for (const auto &Ref : RefsBundle.second) // FIXME: bulk insert?
550 for (auto &Ref : Refs.back().second) {
597 writeRefs(Sym.first, Sym.second, Strings, RefsOS);
tools/clang/tools/extra/clangd/index/Symbol.cpp 59 SortedSymbols.push_back(std::move(Entry.second));
tools/clang/tools/extra/clangd/index/Symbol.h 213 return I == Symbols.end() ? nullptr : &I->second;
tools/clang/tools/extra/clangd/index/SymbolCollector.cpp 164 Result.End = Range.second;
270 D = CanonicalDecls.try_emplace(D, ASTNode.OrigD).first->second;
496 if (auto Header = getIncludeHeader(QName, Entry.second)) {
518 return Found->second;
524 for (const auto &LocAndRole : It.second) {
533 R.Location.End = Range.second;
535 R.Kind = toRefKind(LocAndRole.second);
693 if (R.second)
694 R.first->second = Compute();
695 return R.first->second;
733 if (I.second)
734 I.first->second = Opts.FileFilter(ASTCtx->getSourceManager(), FID);
735 return I.first->second;
tools/clang/tools/extra/clangd/index/YAMLSerialization.cpp 262 IO.mapRequired("References", Refs.second);
374 for (const auto &Ref : Variant.Refs->second)
400 RefBundle Refs = {Data.first, Data.second};
tools/clang/tools/extra/clangd/index/dex/Dex.cpp 32 return std::make_unique<Dex>(Data.first, Data.second, Rels, std::move(Data),
86 Symbols[I] = ScoredSymbols[I].second;
100 {TokenToPostingList.first, PostingList(TokenToPostingList.second)});
106 : It->second.iterator(&It->first);
215 return LHS.second > RHS.second;
215 return LHS.second > RHS.second;
228 (*Score) * SymbolQuality[SymbolDocID] * IDAndScore.second;
248 Callback(*I->second);
277 for (const auto &Object : It->second) {
294 Bytes += TokenToPostingList.second.bytes();
tools/clang/tools/extra/clangd/index/dex/Dex.h 51 this->Refs.try_emplace(Ref.first, Ref.second);
tools/clang/tools/extra/clangd/index/dex/dexp/Dexp.cpp 64 Request.Query = Names.second;
tools/clang/tools/extra/clangd/indexer/IndexerMain.cpp 61 for (const auto &Ref : Sym.second)
tools/clang/tools/extra/clangd/refactor/Tweak.cpp 42 assert(Seen.try_emplace(E.getName()).second && "duplicate check id");
111 E.ApplyEdits.try_emplace(PathAndEdit->first, PathAndEdit->second);
tools/clang/tools/extra/clangd/refactor/tweaks/DefineInline.cpp 374 if (auto Err = Edits.front().second.Replacements.add(DeleteFuncBody))
380 E.ApplyEdits.try_emplace(std::move(Pair.first), std::move(Pair.second));
tools/clang/tools/extra/clangd/refactor/tweaks/ExtractFunction.cpp 390 return &InsertionResult.first->second;
399 return &Iter->second;
532 const auto &DeclInfo = KeyVal.second;
tools/clang/tools/extra/clangd/unittests/BackgroundIndexTests.cpp 227 EXPECT_THAT(Ref.second,
235 EXPECT_THAT(Ref.second,
tools/clang/tools/extra/clangd/unittests/CancellationTests.cpp 19 Task.second();
29 Task.second();
40 Task.second();
44 Task.second();
57 Task.second();
tools/clang/tools/extra/clangd/unittests/ClangdTests.cpp 149 FS.Files[testPath(FileWithContents.first)] = FileWithContents.second;
tools/clang/tools/extra/clangd/unittests/CodeCompleteTests.cpp 1058 P.Offsets.second = lspLength(llvm::StringRef(Label).substr(1, Range.End));
tools/clang/tools/extra/clangd/unittests/ExpectedTypeTest.cpp 58 Elements.push_back(Field(&MapEntry::second, Cls));
tools/clang/tools/extra/clangd/unittests/FindTargetTests.cpp 91 ActualDecls.emplace_back(Entry.first, Entry.second);
889 llvm::StringRef ExpectedRefs = C.second;
tools/clang/tools/extra/clangd/unittests/SemanticHighlightingTests.cpp 63 Test.ranges(KindString.second), KindString.first);
113 TU.AdditionalFiles.insert({File.first, File.second});
139 It->second.push_back(Token);
143 {LineTokens.first, LineTokens.second});
tools/clang/tools/extra/clangd/unittests/SerializationTests.cpp 148 auto Ref1 = ParsedYAML->Refs->begin()->second.front();
tools/clang/tools/extra/clangd/unittests/SourceCodeTests.cpp 48 range.start = position(p1.first, p1.second);
49 range.end = position(p2.first, p2.second);
472 EXPECT_EQ(Case.second,
tools/clang/tools/extra/clangd/unittests/SymbolInfoTests.cpp 332 ElementsAreArray(T.second))
tools/clang/tools/extra/clangd/unittests/TUSchedulerTests.cpp 318 return std::move(T.second);
337 return std::move(T.second);
tools/clang/tools/extra/clangd/unittests/TraceTests.cpp 58 if (VS != I->second) {
59 ADD_FAILURE() << KS << " expected " << I->second << " but actual " << VS;
65 ADD_FAILURE() << P.first << " missing, expected " << P.second;
tools/clang/tools/extra/clangd/unittests/TweakTesting.cpp 40 return (Wrapping.first + Inner + Wrapping.second).str();
47 if (Outer.startswith(Wrapping.first) && Outer.endswith(Wrapping.second) &&
48 Outer.size() >= Wrapping.first.size() + Wrapping.second.size())
49 return Outer.drop_front(Wrapping.first.size()).drop_back(Wrapping.second.size());
77 Tweak::Selection S(Index, AST, Selection.first, Selection.second);
99 Tweak::Selection S(Index.get(), AST, Selection.first, Selection.second);
tools/clang/tools/extra/clangd/unittests/TweakTests.cpp 437 EXPECT_EQ(IO.second, apply(IO.first)) << IO.first;
885 EXPECT_EQ(C.second, apply(C.first)) << C.first;
1381 EXPECT_EQ(apply(Case.first), Case.second) << Case.first;
1531 EXPECT_EQ(apply(Case.first), Case.second) << Case.first;
1589 EXPECT_EQ(apply(Case.first), Case.second) << Case.first;
tools/clang/tools/extra/modularize/CoverageChecker.cpp 417 if (ModuleMapHeadersSet.insert(*I).second) {
tools/clang/tools/extra/modularize/Modularize.cpp 399 Line = SM.getLineNumber(Decomposed.first, Decomposed.second);
400 Column = SM.getColumnNumber(Decomposed.first, Decomposed.second);
512 std::sort(H->second.begin(), H->second.end());
512 std::sort(H->second.begin(), H->second.end());
524 if (H->second == KnownH->second)
524 if (H->second == KnownH->second)
529 H->second.begin(), H->second.end(), KnownH->second.begin(),
529 H->second.begin(), H->second.end(), KnownH->second.begin(),
529 H->second.begin(), H->second.end(), KnownH->second.begin(),
530 KnownH->second.end(),
679 Location Loc(SM, M->second.getLatest()->getLocation());
977 if (H->second.empty()) {
986 for (unsigned I = 0, N = H->second.size(); I != N; ++I) {
987 errs() << "note: '" << H->second[I].Name << "' in "
988 << H->second[I].Loc.File->getName() << " at "
989 << H->second[I].Loc.Line << ":" << H->second[I].Loc.Column
989 << H->second[I].Loc.Line << ":" << H->second[I].Loc.Column
tools/clang/tools/extra/modularize/ModularizeUtilities.cpp 180 TargetAndDependents.second.split(DependentsList, " ", -1, false);
tools/clang/tools/extra/modularize/PreprocessorTracker.cpp 905 InNestedHeader = !HeadersInThisCompile.insert(H).second;
1072 MacroExpansionTracker &CondTracker = I->second;
1116 ConditionalTracker &CondTracker = I->second;
1139 MacroExpansionTracker &MacroExpTracker = I->second;
1198 ConditionalTracker &CondTracker = I->second;
tools/clang/tools/extra/pp-trace/PPCallbacksTracker.cpp 420 if (R.second) {
424 R.first->second = Filter.second;
546 << "Loc: " << getSourceLocationString(PP, Value[I].second) << "}";
tools/clang/tools/extra/unittests/clang-doc/SerializeTest.cpp 43 if (I.second)
44 EmittedInfos.emplace_back(std::move(I.second));
tools/clang/tools/extra/unittests/clang-include-fixer/find-all-symbols/FindAllSymbolsTests.cpp 41 Symbols[Entry.first] += Entry.second;
46 return it == Symbols.end() ? 0 : it->second.Seen;
51 return it == Symbols.end() ? 0 : it->second.Used;
tools/clang/tools/extra/unittests/clang-tidy/ClangTidyOptionsTest.cpp 44 EXPECT_EQ(15u, Options.LineFilter[0].LineRanges[0].second);
46 EXPECT_EQ(30u, Options.LineFilter[0].LineRanges[1].second);
48 EXPECT_EQ(42u, Options.LineFilter[0].LineRanges[2].second);
54 EXPECT_EQ(1000u, Options.LineFilter[2].LineRanges[0].second);
tools/clang/tools/extra/unittests/clang-tidy/ClangTidyTest.h 129 llvm::MemoryBuffer::getMemBuffer(FileContent.second));
tools/clang/tools/libclang/ARCMigrate.cpp 68 llvm::errs() << I->second << '\n';
112 llvm::errs() << I->second << '\n';
133 static_cast<Remap *>(map)->Vec[index].second);
tools/clang/tools/libclang/CIndex.cpp 267 End.second = SM.getFileIDSize(Begin.first);
271 if (Begin.second > End.second)
271 if (Begin.second > End.second)
275 unsigned Offset = Begin.second;
276 unsigned Length = End.second - Begin.second;
276 unsigned Length = End.second - Begin.second;
5814 return cxloc::translateSourceLocation(P.first->getASTContext(), P.second);
5820 return cxloc::translateSourceLocation(P.first->getASTContext(), P.second);
5826 return cxloc::translateSourceLocation(P.first->getASTContext(), P.second);
5831 return cxloc::translateSourceLocation(P.first->getASTContext(), P.second);
5837 return cxloc::translateSourceLocation(P.first->getASTContext(), P.second);
5842 return cxloc::translateSourceLocation(P.first->getASTContext(), P.second);
5847 return cxloc::translateSourceLocation(P.first->getASTContext(), P.second);
5852 return cxloc::translateSourceLocation(P.first->getASTContext(), P.second);
5870 return cxloc::translateSourceLocation(getCursorContext(C), P.second);
5875 getCursorOverloadedDeclRef(C).second);
5978 return getCursorObjCSuperClassRef(C).second;
5981 return getCursorObjCProtocolRef(C).second;
5984 return getCursorObjCClassRef(C).second;
5987 return getCursorTypeRef(C).second;
5990 return getCursorTemplateRef(C).second;
5993 return getCursorNamespaceRef(C).second;
5996 return getCursorMemberRef(C).second;
6002 return getCursorLabelRef(C).second;
6005 return getCursorOverloadedDeclRef(C).second;
6008 return getCursorVariableRef(C).second;
6670 return cxstring::createDup(Buffer.substr(LocInfo.second, CXTok.int_data[2]));
6722 Buffer.begin(), Buffer.data() + BeginLocInfo.second, Buffer.end());
6726 const char *EffectiveBufferEnd = Buffer.data() + EndLocInfo.second;
6792 DecomposedEnd.second += Lexer::MeasureTokenLength(Begin, SM, CXXUnit->getLangOpts());
6794 SourceLocation End = SM.getComposedLoc(DecomposedEnd.first, DecomposedEnd.second);
7461 Buffer.begin(), Buffer.data() + BeginLocInfo.second,
tools/clang/tools/libclang/CXCursor.h 266 return getSelectorIdentifierIndexAndLoc(cursor).second;
tools/clang/tools/libclang/CXIndexDataConsumer.cpp 956 I->second = container;
967 return I->second;
1028 return !res.second; // already in map
1078 return I->second;
1087 return FI->second;
1114 unsigned FileOffset = LocInfo.second;
tools/clang/tools/libclang/CXLoadedDiagnostic.cpp 145 return cxstring::createRef(FixIts[FixIt].second);
tools/clang/tools/libclang/CXSourceLocation.cpp 259 *offset = SM.getDecomposedLoc(ExpansionLoc).second;
324 unsigned FileOffset = LocInfo.second;
360 unsigned FileOffset = LocInfo.second;
tools/clang/unittests/AST/ASTImporterTest.cpp 4026 StoredDeclsList &L = I->second;
tools/clang/unittests/AST/MatchVerifier.h 170 verify(Result, I->second);
tools/clang/unittests/AST/StructuralEquivalenceTest.cpp 1313 EXPECT_FALSE(Ctx.IsEquivalent(X.first, X.second));
1351 EXPECT_FALSE(Ctx.IsEquivalent(C.first, C.second));
1390 EXPECT_TRUE(Ctx.IsEquivalent(C.first, C.second));
tools/clang/unittests/ASTMatchers/ASTMatchersTest.h 433 EXPECT_EQ(Nodes->getNodeAs<T>(Id), I->second.get<T>());
438 M.find(Id)->second.template get<T>() == nullptr);
tools/clang/unittests/ASTMatchers/ASTMatchersTraversalTest.cpp 2293 if (!Parents.insert(Parent.getMemoizationData()).second) {
tools/clang/unittests/ASTMatchers/Dynamic/ParserTest.cpp 32 return M.getID().second;
59 return VariantMatcher::SingleMatcher(Matcher->second);
159 EXPECT_EQ(ExpectedFoo, getSingleMatcher(Sema.Values[0])->getID().second);
178 EXPECT_EQ(ExpectedBar, getSingleMatcher(Foo.Args[0].Value)->getID().second);
179 EXPECT_EQ(ExpectedBaz, getSingleMatcher(Foo.Args[1].Value)->getID().second);
tools/clang/unittests/Basic/DiagnosticTest.cpp 88 EXPECT_EQ(ErrDiag->second.getDiagID(), diag::err_cannot_open_file);
tools/clang/unittests/CodeGen/IRMatchers.h 274 C.push(Item.second);
tools/clang/unittests/CrossTU/CrossTranslationUnitTest.cpp 94 ASTUnit *OrigUnit = (*SLocResult).second;
tools/clang/unittests/Format/CleanupTest.cpp 335 return DecomposedLocation.second;
tools/clang/unittests/Frontend/PCHPreambleTest.cpp 44 return it == ReadCounts.end() ? 0 : it->second;
tools/clang/unittests/Frontend/ParsedSourceLocationTest.cpp 24 EXPECT_EQ(PSR->Begin.second, BeginColumn);
26 EXPECT_EQ(PSR->End.second, EndColumn);
tools/clang/unittests/Lex/LexerTest.cpp 474 EXPECT_EQ(FoundLocation.second, OriginalLocation.second);
474 EXPECT_EQ(FoundLocation.second, OriginalLocation.second);
tools/clang/unittests/StaticAnalyzer/CallDescriptionTest.cpp 31 return Pair.second == true;
tools/clang/unittests/Tooling/ASTSelectionTest.cpp 51 SelectionRange->second.translate(SM));
tools/clang/unittests/Tooling/CompilationDatabaseTest.cpp 393 EXPECT_EQ(Case.second, llvm::join(FoundCommand.CommandLine, " "))
tools/clang/unittests/Tooling/ExecutionTest.cpp 222 EXPECT_EQ("::/1", KVs[0].second);
284 Executor.mapVirtualFile(FileAndContent.first, FileAndContent.second);
tools/clang/unittests/Tooling/RefactoringActionRulesTest.cpp 76 Selection.first.getBegin().getLocWithOffset(Selection.second);
141 DiagID = Error.getDiagnostic().second.getDiagID();
tools/clang/unittests/Tooling/Syntax/TokensTest.cpp 84 arg.endLocation() == SourceRng.second;
171 Ls.second = SourceMgr->getLocForStartOfFile(SourceMgr->getMainFileID())
318 EXPECT_EQ(collectAndDump(Test.first), Test.second)
475 EXPECT_EQ(Test.second, collectAndDump(Test.first))
tools/clang/unittests/Tooling/Syntax/TreeTest.cpp 154 std::string Expected = llvm::StringRef(T.second).trim().str();
tools/clang/unittests/Tooling/TransformerTest.cpp 78 void appendToHeader(StringRef S) { FileContents[0].second += S; }
tools/clang/unittests/libclang/TestUtils.h 73 it.first->second->c_str(), // contents
74 it.first->second->size() // length
tools/clang/utils/TableGen/ClangASTNodesEmitter.cpp 96 Record *R = i->second;
117 if (Result.second)
118 Last = Result.second;
tools/clang/utils/TableGen/ClangAttrEmitter.cpp 796 if (unique_set.insert(i).second)
912 if (Uniques.insert(enums[I]).second)
1020 if (Uniques.insert(enums[I]).second)
1653 OS << " case " << I.first << ": return " << I.second << ";\n";
1836 .second;
1866 if (!It->second.isRule() || It->second.getRule().isSubRule())
1866 if (!It->second.isRule() || It->second.getRule().isSubRule())
1868 Rules.push_back(It->second.getRule());
1876 .second;
2021 for (const auto &Rule : SubMatchRule.second) {
2029 for (const auto &Rule : SubMatchRule.second) {
2072 for (const auto &Rule : SubMatchRule.second) {
2095 if (Seen.insert(S.name()).second)
2128 const Record &Attr = *I.second;
2305 return &R == P.second;
3071 GenerateHasAttrSpellingStringSwitch(I->second, OS, Spelling, I->first);
3093 const Record &R = *I.second;
3579 I.second->getValueAsDef("Target")->getValueAsListOfStrings(
3684 emitArgInfo(*I->second, SS);
3685 SS << ", " << I->second->getValueAsBit("HasCustomParsing");
3686 SS << ", " << I->second->isSubClassOf("TargetSpecificAttr");
3688 << (I->second->isSubClassOf("TypeAttr") ||
3689 I->second->isSubClassOf("DeclOrTypeAttr"));
3690 SS << ", " << I->second->isSubClassOf("StmtAttr");
3691 SS << ", " << IsKnownToGCC(*I->second);
3692 SS << ", " << PragmaAttributeSupport.isAttributedSupported(*I->second);
3693 SS << ", " << GenerateAppertainsTo(*I->second, OS);
3694 SS << ", " << GenerateLangOptRequirements(*I->second, OS);
3695 SS << ", " << GenerateTargetRequirements(*I->second, Dupes, OS);
3696 SS << ", " << GenerateSpellingIndexToSemanticSpelling(*I->second, OS);
3698 << PragmaAttributeSupport.generateStrictConformsTo(*I->second, OS);
3953 SupportedSpellings(std::move(HeadingAndSpellings.second)) {}
4108 llvm::sort(I.second,
4115 for (const auto &Doc : I.second)
4126 if (!Support.isAttributedSupported(*I.second))
4129 if (I.second->isValueUnset("Subjects")) {
4133 const Record *SubjectObj = I.second->getValueAsDef("Subjects");
tools/clang/utils/TableGen/ClangDataCollectorsEmitter.cpp 10 Record &R = *Entry.second;
tools/clang/utils/TableGen/ClangDiagnosticsEmitter.cpp 202 I->second.IDNo = IDNo;
346 if (!V.second.hasValue()) {
348 V.second = GI.SubGroups.size() + GI.DiagsInGroup.size();
357 return V.first != 0 && V.first == V.second.getValue();
842 Visitor.ModifierMappings = NodePair.second;
1262 OS << ", " << I->second.IDNo;
1267 OS << ", " << I->second.IDNo;
1326 const std::vector<std::string> &SubGroups = I.second.SubGroups;
1328 OS << " /* DiagSubGroup" << I.second.IDNo << " */ ";
1333 OS << RI->second.IDNo << ", ";
1342 OS << RI->second.IDNo << ", ";
1377 const std::vector<const Record *> &V = I.second.DiagsInGroup;
1379 OS << " /* DiagArray" << I.second.IDNo << " */ ";
1478 const std::vector<const Record *> &V = I.second.DiagsInGroup;
1482 OS << "/* DiagArray" << I.second.IDNo << " */ " << DiagArrayIndex
1492 const std::vector<std::string> &SubGroups = I.second.SubGroups;
1496 OS << "/* DiagSubGroup" << I.second.IDNo << " */ " << SubGroupIndex;
1617 auto &GroupInfo = DiagsInGroup.find(GroupName)->second;
1642 auto &GroupInfo = DiagsInGroup.find(GroupName)->second;
tools/clang/utils/TableGen/ClangOpenCLBuiltinEmitter.cpp 358 SignIndex = it->second;
374 OS << " // " << T.second << "\n"
392 OS << " // " << P.second << "\n ";
394 OS << TypeMap.find(R)->second << ", ";
409 for (const auto &Overload : FOM.second) {
410 OS << " { " << Overload.second << ", "
426 auto &Ov = i.second;
499 Entry->second.push_back(IT);
512 for (const auto &Image : ITE.second) {
tools/clang/utils/TableGen/ClangOptionDocEmitter.cpp 239 Separator = Separators.second;
tools/clang/utils/TableGen/MveEmitter.cpp 736 OS << " " << kv.first << " = " << kv.second << ";\n";
770 const ImmediateArg &IA = kv.second;
976 const ScalarType *RT = kv.second.get();
1061 return it->second;
1266 const ScalarType *ST = kv.second.get();
1287 const ACLEIntrinsic &Int = *kv.second;
1435 const ACLEIntrinsic &Int = *kv.second;
1443 const ACLEIntrinsic &Int = *kv.second;
1458 const ACLEIntrinsic &Int = *kv.second;
1465 for (StringRef Name : kv.second)
1524 const ACLEIntrinsic &Int = *kv.second;
1554 const OutputIntrinsic &OI_first = *kv.second.begin();
1555 bool Constant = all_of(kv.second, [&](const OutputIntrinsic &OI) {
1575 for (const auto &OI : kv.second)
1581 ParamNumbers.push_back(Found->second);
1594 for (const auto &OI_prelim : kv.second) {
1620 for (const auto &OI : kv.second) {
1639 for (const auto &OI : kv.second) {
1657 const ACLEIntrinsic &Int = *kv.second;
tools/clang/utils/TableGen/NeonEmitter.cpp 1214 S.replace(Pos, End - Pos, Variables.find(VarName)->second.getName());
1503 Lines.push_back(DE.emitDag(DI).second + ";");
1562 return std::make_pair(R.first, Op + R.second);
1570 return std::make_pair(R1.first, R1.second + " " + Op + " " + R2.second);
1570 return std::make_pair(R1.first, R1.second + " " + Op + " " + R2.second);
1581 Values.push_back(R.second);
1589 N = emitDagArg(DI->getArg(0), "").second;
1666 << R.second << ";";
1672 S = "(" + castToType.str() + ")(" + R.second + ")";
1762 std::string S = "__builtin_shufflevector(" + Arg1.second + ", " + Arg2.second;
1762 std::string S = "__builtin_shufflevector(" + Arg1.second + ", " + Arg2.second;
1800 S += A.second;
1822 S += B.second;
1839 std::string S = "__builtin_shufflevector(" + A.second + ", " + A.second;
1839 std::string S = "__builtin_shufflevector(" + A.second + ", " + A.second;
1841 S += ", " + B.second;
1865 A.first.str() + " " + Intr.Variables[N].getName() + " = " + A.second;
1998 auto &V = IntrinsicMap.find(Name.str())->second;
2089 Entry.emplace_back(R, Name, Proto, I.first, I.second, CK, Body, *this,
2212 OverloadInfo &OI = I.second;
tools/dsymutil/DebugMap.cpp 51 if (ObjectAddress && InsertResult.second)
53 return InsertResult.second;
69 if (Sym.second.ObjectAddress)
70 OS << format("\t%016" PRIx64, uint64_t(*Sym.second.ObjectAddress));
74 uint64_t(Sym.second.BinaryAddress), uint32_t(Sym.second.Size),
74 uint64_t(Sym.second.BinaryAddress), uint32_t(Sym.second.Size),
166 io.mapOptional("objAddr", s.second.ObjectAddress);
167 io.mapRequired("binAddr", s.second.BinaryAddress);
168 io.mapOptional("size", s.second.Size);
272 auto &Mapping = Entry.second;
tools/dsymutil/DwarfLinker.cpp 212 if (!Split.second.empty())
1886 Range->second.HighPC >= Row.Address.Address) {
1887 StopAddress = Row.Address.Address + Range->second.Offset;
2050 Range->second.HighPC <= Loc) {
2067 if (IteratorInserted.second ||
2083 Loc + Range->second.Offset,
2520 StringRef InterfaceFile = I.second;
tools/dsymutil/DwarfStreamer.cpp 357 while ((Range + 1) != End && Range->second == (Range + 1)->first)
359 MS->EmitIntValue(Range->second - RangeStart, AddressSize);
377 while (Range + 1 != End && Range->second == (Range + 1)->first)
379 MS->EmitIntValue(Range->second + PcOffset, AddressSize);
419 int64_t LocPcOffset = Attr.second + UnitPcOffset;
433 Asm->OutStreamer->EmitIntValue(High + Attr.second, AddressSize);
tools/dsymutil/NonRelocatableStringpool.cpp 22 if (I.second || !Entry.isIndexed()) {
tools/gold/gold-plugin.cpp 556 cf.leader_handle = LeaderHandle->second;
1021 assert(ObjFilename.second);
1046 Files[Task].second = !SaveTemps;
1099 recordFile(F.first.str(), F.second);
tools/lld/COFF/DLL.cpp 150 std::vector<DefinedImportData *> &syms = kv.second;
tools/lld/COFF/DebugTypes.cpp 188 std::pair<std::string, TypeServerSource *> &pdb = it->second;
190 if (!pdb.second)
194 pdb::PDBFile &pdbFile = (pdb.second)->session->getPDBFile();
205 return pdb.second;
227 if (!it.second)
tools/lld/COFF/Driver.cpp 100 if (ret.second.empty())
234 if (mbOrErr.second) {
236 "could not open '" + pathStr + "': " + mbOrErr.second.message();
309 if (mbOrErr.second)
310 reportBufferError(errorCodeToError(mbOrErr.second), childName);
344 if (!directivesExports.insert(e).second)
438 bool seen = !visitedFiles.insert(*id).second;
480 if (!visitedLibs.insert(filename.lower()).second)
488 if (!visitedFiles.insert(*id).second)
1804 StringRef to = pair.second;
1922 uint32_t alignment = pair.second;
tools/lld/COFF/DriverUtils.cpp 144 if (it != config->alternateNames.end() && it->second != to)
161 bool inserted = pair.second;
163 StringRef existing = pair.first->second;
627 if (!ords.insert(e.ordinal).second)
653 bool inserted = pair.second;
658 Export *existing = pair.first->second;
693 existing.second ? toString(existing.second) : "cmd-line";
693 existing.second ? toString(existing.second) : "cmd-line";
tools/lld/COFF/InputFiles.cpp 116 if (!seen.insert(c.getChildOffset()).second)
375 readAssociativeDefinition(sym, def, parentSym->second);
462 uint32_t idx = kv.second;
807 return std::make_pair(saver.save(ret->first), ret->second);
924 else if (comdat[comdatIndex].second)
955 StringRef repl = config->thinLTOObjectSuffixReplace.second;
tools/lld/COFF/LTO.cpp 60 config->thinLTOPrefixReplace.second);
102 config->thinLTOPrefixReplace.first, config->thinLTOPrefixReplace.second,
tools/lld/COFF/MapFile.cpp 66 SmallVectorImpl<DefinedRegular *> &v = it.second;
tools/lld/COFF/PDB.cpp 357 if (r.second)
428 CVIndexMap &indexMap = it.first->second;
429 if (!it.second)
534 CVIndexMap &indexMap = insertion.first->second;
535 if (!insertion.second)
549 if (r.second)
1769 uint32_t offsetInC = i->second + linesTmp.header()->RelocOffset;
tools/lld/COFF/SymbolTable.cpp 171 os << loc.fileLine.first << ":" << loc.fileLine.second
226 Symbol *sym = i.second;
345 undefDiags[it->second].files.push_back({file, symIndex});
370 Symbol *sym = i.second;
399 Symbol *sym = i.second;
542 os << fileLine->first << ":" << fileLine->second << "\n>>> ";
738 syms.push_back(pair.second);
tools/lld/COFF/SymbolTable.h 116 callback(pair.second);
tools/lld/COFF/Writer.cpp 460 uint32_t &thunkSymbolIndex = insertion.first->second;
461 if (insertion.second)
488 newRelocs[i].SymbolTableIndex = nextReplacement->second;
660 PartialSection *pSec = it.second;
695 PartialSection *pSec = it.second;
854 sortBySectionOrder(it.second->chunks);
864 PartialSection *pSec = it.second;
1186 StringRef toName = p.second;
1191 if (!names.insert(toName).second)
1196 toName = i->second;
1733 uint32_t perm = p.second;
1940 return it->second;
tools/lld/Common/Args.cpp 57 if (!to_integer(kv.second, result))
58 error("invalid " + key + ": " + kv.second);
tools/lld/Common/DWARF.cpp 81 if (!it->second.lt->getFileNameByIndex(
82 it->second.file, {},
86 return std::make_pair(fileName, it->second.line);
tools/lld/ELF/AArch64ErrataFix.cpp 460 std::vector<const Defined *> &mapSyms = kv.second;
tools/lld/ELF/ARMErrataFix.cpp 335 std::vector<const Defined *> &mapSyms = kv.second;
tools/lld/ELF/CallGraphSort.cpp 109 if (res.second) {
113 return res.first->second;
119 const auto *toSB = cast<InputSectionBase>(c.first.second->repl);
120 uint64_t weight = c.second;
tools/lld/ELF/Driver.cpp 151 return std::make_tuple(ret.first, ret.second, osabi);
210 files.push_back(createObjectFile(p.first, path, p.second));
233 files.push_back(make<LazyObjFile>(p.first, path, p.second));
789 if (ret.second.empty())
1612 if (!seen.insert(name).second)
tools/lld/ELF/InputFiles.cpp 242 return createFileLineMsg(fileLine->first, fileLine->second);
562 .second;
1087 if (!seen.insert(c.getChildOffset()).second)
1227 it->second->isNeeded |= isNeeded;
1434 symtab->comdatGroups.try_emplace(CachedHashStringRef(s), this).second);
1560 StringRef repl = config->thinLTOObjectSuffixReplace.second;
tools/lld/ELF/InputSection.cpp 593 for (auto it = range.first; it != range.second; ++it)
tools/lld/ELF/LTO.cpp 64 config->thinLTOPrefixReplace.second);
138 config->thinLTOPrefixReplace.first, config->thinLTOPrefixReplace.second,
tools/lld/ELF/LinkerScript.cpp 242 if (std::make_pair(sym->section, sym->value) != it.second &&
270 if (!p.second.empty())
785 MemoryRegion *m = pair.second;
1072 MemoryRegion *mr = mri.second;
tools/lld/ELF/MapFile.cpp 75 llvm::stable_sort(it.second, [](Defined *a, Defined *b) {
253 SetVector<InputFile *> &files = kv.second;
tools/lld/ELF/OutputSections.cpp 226 in[i] = v[i].second;
tools/lld/ELF/Relocations.cpp 1559 if (ts.second == pass)
1826 addressesChanged |= p.second->assignOffsets();
tools/lld/ELF/ScriptParser.cpp 344 if (!seen.insert(tok).second) {
1480 if (!script->memoryRegions.insert({tok, mr}).second)
tools/lld/ELF/SymbolTable.cpp 64 int &symIndex = p.first->second;
65 bool isNew = p.second;
100 Symbol *sym = symVector[it->second];
tools/lld/ELF/SyntheticSections.cpp 707 num += p.second.count;
866 p.second.count = getMipsPageCount(secSize);
914 p.second.firstIndex = index;
915 index += p.second.count;
918 p.second = index++;
920 p.second = index++;
922 p.second = index++;
924 p.second = index++;
926 p.second = index;
934 p.first->gotIndex = p.second;
936 p.first->gotIndex = p.second;
943 uint64_t offset = p.second * config->wordsize;
949 uint64_t offset = p.second * config->wordsize;
978 uint64_t offset = p.second * config->wordsize;
986 size_t pageCount = l.second.count;
988 uint64_t offset = (l.second.firstIndex + pi) * config->wordsize;
994 uint64_t offset = p.second * config->wordsize;
996 p.first.first, p.first.second});
1043 size_t pageCount = l.second.count;
1046 write(l.second.firstIndex + pi, nullptr, firstPageAddr + pi * 0x10000);
1054 write(p.second, p.first.first, p.first.second);
1054 write(p.second, p.first.first, p.first.second);
1059 write(p.second, p.first, 0);
1061 write(p.second, p.first, 0);
1063 write(p.second, p.first, p.first->isPreemptible ? 0 : -0x7000);
1066 write(p.second, nullptr, 1);
1072 write(p.second, nullptr, 1);
1073 write(p.second + 1, p.first, -0x8000);
1168 if (!r.second)
1169 return r.first->second;
1504 p->d_un.d_val = kv.second();
2050 for (SymbolTableEntry &entry : p.second)
tools/lld/ELF/Writer.cpp 1226 SymbolOrderEntry &ent = it->second;
1253 if (!orderEntry.second.present)
1274 orderedSections.push_back({isec, i->second});
1803 if (reloc.sym && !reloc.useSymVA && syms.insert(reloc.sym).second)
tools/lld/lib/Core/Resolver.cpp 322 if (!exists.second)
330 const Atom *target = p.second;
tools/lld/lib/Core/SymbolTable.cpp 260 return pos->second;
270 atom = pos->second;
281 const Atom *atom = it.second;
tools/lld/lib/Driver/DarwinLdDriver.cpp 186 buffer = lineAndRest.second;
211 buffer = lineAndRest.second;
222 if (!prefixAndSym.second.empty()) {
223 sym = prefixAndSym.second;
257 StringRef dirName = opt.second;
289 buffer = lineAndRest.second;
tools/lld/lib/ReaderWriter/FileArchive.cpp 54 Archive::Child c = member->second;
tools/lld/lib/ReaderWriter/MachO/CompactUnwindPass.cpp 499 usedDwarfWorklist.push_back(cast<DefinedAtom>(entry.second));
537 entry = unwindLoc->second;
547 entry.ehFrame = dwarfFrame->second;
tools/lld/lib/ReaderWriter/MachO/File.h 146 const auto &vec = pos->second;
178 for (auto &offAndAtom : sectAndAtoms.second) {
191 auto vec = pos->second;
353 assert(!entry->second.atom && "Duplicate shared library export");
354 bool weakDef = entry->second.weakDef;
358 entry->second.atom = atom;
tools/lld/lib/ReaderWriter/MachO/GOTPass.cpp 128 entries.push_back(it.second);
168 return pos->second;
tools/lld/lib/ReaderWriter/MachO/LayoutPass.cpp 121 const DefinedAtom *ap = i->second;
155 roots.insert(ai.second);
163 checkReachabilityFromRoot(_followOnRoots, ai.second);
278 atom = targetFollowOnAtomsIter->second;
301 atom = targetFollowOnAtomsIter->second;
315 targetAtom = targetFollowOnAtomsIter->second;
368 if (iter->second == targetAtom) {
413 for (const DefinedAtom *nextAtom = start->second; nextAtom;
428 const auto *root = (ri == _followOnRoots.end()) ? atom.get() : ri->second;
429 uint64_t override = (oi == _ordinalOverrideMap.end()) ? 0 : oi->second;
tools/lld/lib/ReaderWriter/MachO/MachOLinkingContext.cpp 701 StringRef leafName = split.second;
943 if (!dirAndLeaf.second.empty())
944 objName = dirAndLeaf.second;
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileFromAtoms.cpp 242 if (sect.second->sectionName.equals(sectionName) &&
243 sect.second->segmentName.equals(segmentName)) {
244 return sect.second;
327 if (sect.second->sectionName.equals(p.sectionName) &&
328 sect.second->segmentName.equals(p.segmentName)) {
329 return sect.second;
349 return pos->second;
660 return pos->second;
1300 return pos->second;
1312 return pos->second;
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileToAtoms.cpp 1271 const CIEInfo &cieInfo = cieInfos.find(cie)->second;
tools/lld/lib/ReaderWriter/MachO/ShimPass.cpp 74 shims.push_back(element.second);
103 assert(pos->second != nullptr);
104 return pos->second;
tools/lld/lib/ReaderWriter/MachO/TLVPass.cpp 100 entries.push_back(it.second);
116 return pos->second;
tools/lld/lib/ReaderWriter/YAML/ReaderWriterYAML.cpp 157 return _refNames.find(atom)->second;
tools/lld/wasm/Driver.cpp 596 if (!seen.insert(name).second)
tools/lld/wasm/InputFiles.cpp 490 if (!seen.insert(c.getChildOffset()).second)
tools/lld/wasm/SymbolTable.cpp 85 if (it == symMap.end() || it->second == -1)
87 return symVector[it->second];
92 symVector[it->second] = sym;
98 int &symIndex = p.first->second;
99 bool isNew = p.second;
556 return comdatGroups.insert(CachedHashStringRef(name)).second;
686 std::vector<Symbol *> &variants = pair.second;
tools/lld/wasm/SyntheticSections.cpp 72 if (pair.second) {
76 return pair.first->second;
85 return it->second;
480 writeUleb128(sub.os, c.second.size(), "num entries");
481 for (const ComdatEntry &entry : c.second) {
537 if (producers.second->end() ==
538 llvm::find_if(*producers.second,
542 producers.second->push_back(producer);
551 if (field.second.empty())
554 writeUleb128(os, field.second.size(), "number of entries");
555 for (auto &entry : field.second) {
557 writeStr(os, entry.second, "producer version");
tools/lldb/include/lldb/Core/ThreadSafeSTLMap.h 56 value = pos->second;
tools/lldb/include/lldb/Core/ValueObject.h 803 return ((iter == m_children.end()) ? nullptr : iter->second);
tools/lldb/include/lldb/DataFormatters/FormattersContainer.h 111 entry = pos.second;
122 if (!callback(type, pos.second))
134 return m_map[index].second;
292 value = pos.second;
305 value = pos.second;
tools/lldb/include/lldb/Interpreter/CommandObject.h 47 descriptions->AppendString(iter->second->GetHelp());
tools/lldb/include/lldb/Symbol/ClangASTImporter.h 204 context_md = context_md_iter->second;
357 return context_md_iter->second;
365 return context_md_iter->second;
383 return delegate_iter->second;
tools/lldb/include/lldb/Target/ProcessStructReader.h 86 auto size = iter->second.size;
89 lldb::offset_t offset = iter->second.offset;
99 return iter->second.offset;
tools/lldb/include/lldb/Target/Target.h 1228 return (*pos).second;
tools/lldb/include/lldb/Utility/Broadcaster.h 163 input.second == m_listener_sp);
179 if (input.second == m_listener_sp)
197 if (input.second.get() == m_listener)
481 return pos->second.c_str();
tools/lldb/include/lldb/Utility/Iterable.h 18 return iter->second;
tools/lldb/include/lldb/Utility/Reproducer.h 262 return static_cast<T *>(it->second.get());
tools/lldb/include/lldb/Utility/StructuredData.h 363 if (!callback(pair.first, pair.second.get()))
385 value_sp = iter->second;
tools/lldb/source/API/SBValue.cpp 403 if (validation.second.empty())
406 cstr = validation.second.c_str();
tools/lldb/source/Breakpoint/Breakpoint.cpp 747 SymbolContext &old_sc = old_sc_map.begin()->second;
757 if (SymbolContextsMightBeEquivalent(old_sc, tmp_iter->second))
765 if (SymbolContextsMightBeEquivalent(old_sc, tmp_iter->second))
tools/lldb/source/Breakpoint/BreakpointLocationList.cpp 117 bp_loc_sp = pos->second;
tools/lldb/source/Breakpoint/BreakpointSiteList.cpp 88 return m_break_id == val_pair.second->GetID();
116 stop_sp = pos->second;
127 stop_sp = pos->second;
137 found_sp = iter->second;
146 return pos->second->IsBreakpointAtThisSite(bp_id);
160 pos->second->Dump(s);
168 callback(pair.second.get());
189 const BreakpointSiteSP &prev_bp = (*prev_pos).second;
197 bp_site_list.Add((*pos).second);
tools/lldb/source/Commands/CommandObjectCommands.cpp 137 if (start_idx.first && start_idx.second == UINT64_MAX) {
139 start_idx.second = history.GetSize() - count.second;
139 start_idx.second = history.GetSize() - count.second;
140 stop_idx.second = history.GetSize() - 1;
142 start_idx.second = stop_idx.second;
142 start_idx.second = stop_idx.second;
143 stop_idx.second = history.GetSize() - 1;
145 start_idx.second = 0;
146 stop_idx.second = history.GetSize() - 1;
150 start_idx.second = 0;
151 stop_idx.second = history.GetSize() - 1;
154 stop_idx.second = start_idx.second + count.second - 1;
154 stop_idx.second = start_idx.second + count.second - 1;
154 stop_idx.second = start_idx.second + count.second - 1;
156 stop_idx.second = history.GetSize() - 1;
160 if (stop_idx.second >= count.second)
160 if (stop_idx.second >= count.second)
161 start_idx.second = stop_idx.second - count.second + 1;
161 start_idx.second = stop_idx.second - count.second + 1;
161 start_idx.second = stop_idx.second - count.second + 1;
163 start_idx.second = 0;
167 start_idx.second = 0;
168 stop_idx.second = count.second - 1;
168 stop_idx.second = count.second - 1;
171 history.Dump(result.GetOutputStream(), start_idx.second,
172 stop_idx.second);
tools/lldb/source/Commands/CommandObjectExpression.cpp 327 code = llvm::getToken(code).second.ltrim();
tools/lldb/source/Commands/CommandObjectMultiword.cpp 41 return_cmd_sp = pos->second;
56 return_cmd_sp = pos->second;
168 if (pos->second->WantsRawCommandString()) {
169 std::string help_text(pos->second->GetHelp());
177 pos->second->GetHelp(), max_len);
242 CommandObject *sub_cmd_obj = pos->second.get();
tools/lldb/source/Commands/CommandObjectSettings.cpp 208 var_value = var_value.split(var_name).second.ltrim();
645 var_value = var_value.split(var_name).second.trim();
741 var_value = var_value.split(var_name).second.trim();
843 var_value = var_value.split(var_name).second.trim();
942 var_value = var_value.split(var_name).second.trim();
1032 var_value = var_value.split(var_name).second.trim();
tools/lldb/source/Commands/CommandObjectTarget.cpp 3105 uint32_t width = m_options.m_format_array[i].second;
tools/lldb/source/Core/Disassembler.cpp 336 source_lines_seen_pos->second.insert(line.line);
578 if (pos->second.count(line) == 1) {
591 pos->second.insert(previous_line.line);
606 if (pos->second.count(next_line.line) == 1)
608 pos->second.insert(next_line.line);
tools/lldb/source/Core/FormatEntity.cpp 1969 if (p.second.empty()) {
1977 return FindEntry(p.second, entry_def, remainder);
1979 remainder = p.second;
tools/lldb/source/Core/Mangled.cpp 63 return g_most_recent_mangled_to_name_sans_args.second;
89 g_most_recent_mangled_to_name_sans_args.second = result;
90 return g_most_recent_mangled_to_name_sans_args.second;
tools/lldb/source/Core/Module.cpp 894 sc_list[pos->second].symbol = sc.symbol;
tools/lldb/source/Core/PluginManager.cpp 192 if (pos->second.library.isValid()) {
193 if (pos->second.plugin_term_callback)
194 pos->second.plugin_term_callback();
tools/lldb/source/Core/SourceManager.cpp 689 if (file_sp != pos->second)
699 file_sp = pos->second;
tools/lldb/source/Core/ValueObject.cpp 519 root = root->GetChildAtIndex(idx.first, idx.second);
553 root = root->GetChildMemberWithName(name.first, name.second);
1309 options.SetIsTruncated(read_string.second);
1683 synthetic_child_sp = pos->second->GetSP();
tools/lldb/source/DataFormatters/FormatCache.cpp 115 return i->second;
tools/lldb/source/DataFormatters/FormatClasses.cpp 31 if (!m_formatters_match_vector.second) {
32 m_formatters_match_vector.second = true;
tools/lldb/source/DataFormatters/FormatManager.cpp 121 if (iter.second)
122 iter.second->GetFormatCache().Clear();
162 if (iter.second)
163 iter.second->Enable();
171 if (iter.second)
172 iter.second->Disable();
416 if (auto category_sp = entry.second->GetCategory()) {
610 return iter->second.get();
tools/lldb/source/DataFormatters/TypeCategoryMap.cpp 100 if (iter->second->IsEnabled())
102 auto pos = iter->second->GetLastEnabledPosition();
109 sorted_categories.at(pos) = iter->second;
139 entry = iter->second;
153 entry = iter->second;
165 if (pos->second->AnyMatches(type_name, items, only_enabled,
350 if (pos->second->IsEnabled())
352 if (!callback(pos->second))
366 return pos->second;
tools/lldb/source/DataFormatters/TypeFormat.cpp 180 valobj_enum_type = iter->second;
tools/lldb/source/DataFormatters/ValueObjectPrinter.cpp 328 if (!m_summary_formatter.second) {
336 m_summary_formatter.second = true;
819 if (m_validation.second.empty())
820 m_validation.second.assign("unknown error");
822 m_stream->Printf(" ! validation error: %s", m_validation.second.c_str());
tools/lldb/source/Expression/ExpressionVariable.cpp 37 return si->second;
tools/lldb/source/Expression/IRExecutionUnit.cpp 134 if (func_range.first == 0 && func_range.second == 0) {
142 func_range.first, func_range.second);
151 lldb::DataBufferSP buffer_sp(new DataBufferHeap(func_range.second, 0));
429 m_function_end_load_addr = func_range.first + func_range.second;
tools/lldb/source/Expression/IRInterpreter.cpp 142 lldb::addr_t addr = i->second;
413 return i->second;
tools/lldb/source/Expression/IRMemoryMap.cpp 37 if (iter->second.m_leak)
90 size_t alloc_size = back->second.m_size;
157 size_t alloc_size = back->second.m_size;
177 if (iter->first <= addr && iter->first + iter->second.m_size >= addr + size)
197 if (AllocationsIntersect(addr, size, iter->second.m_process_start,
198 iter->second.m_size))
204 if (AllocationsIntersect(addr, size, iter->second.m_process_start,
205 iter->second.m_size))
441 Allocation &allocation = iter->second;
457 Allocation &allocation = iter->second;
484 (uint64_t)process_address, iter->second.m_process_start,
485 iter->second.m_process_start + iter->second.m_size);
485 iter->second.m_process_start + iter->second.m_size);
496 Allocation &al = iter->second;
534 Allocation &allocation = iter->second;
652 Allocation &allocation = iter->second;
797 Allocation &allocation = iter->second;
tools/lldb/source/Host/common/Editline.cpp 218 history_sp = pos->second.lock();
tools/lldb/source/Host/common/FileCache.cpp 53 FileUP &file_up = pos->second;
75 FileUP &file_up = pos->second;
101 FileUP &file_up = pos->second;
tools/lldb/source/Host/common/MainLoop.cpp 286 m_read_fds.insert({object_sp->GetWaitableHandle(), callback}).second;
359 sigaction(signo, &it->second.old_action, nullptr);
364 int ret = pthread_sigmask(it->second.was_blocked ? SIG_BLOCK : SIG_UNBLOCK,
401 it->second.callback(*this); // Do the work
407 it->second(*this); // Do the work
tools/lldb/source/Host/common/NativeProcessProtocol.cpp 366 ++it->second.ref_count;
383 assert(it->second.ref_count > 0);
384 if (--it->second.ref_count > 0)
392 it->second.breakpoint_opcodes.size(), 0);
403 const auto &saved = it->second.saved_opcodes;
405 if (makeArrayRef(curr_break_op) != it->second.breakpoint_opcodes) {
406 if (curr_break_op != it->second.saved_opcodes)
650 auto saved_opcodes = makeArrayRef(pair.second.saved_opcodes);
tools/lldb/source/Interpreter/CommandAlias.cpp 211 options->insert(options->begin(), desugared.second->begin(),
212 desugared.second->end());
tools/lldb/source/Interpreter/CommandInterpreter.cpp 857 command_sp = pos->second;
863 command_sp = alias_pos->second;
869 command_sp = pos->second;
898 real_match_sp = pos->second;
910 alias_match_sp = alias_pos->second;
924 user_match_sp = pos->second;
960 if (!can_replace || !name_iter->second->IsRemovable())
962 name_iter->second = cmd_sp;
1149 if (pos->second->IsRemovable()) {
1187 pos->second->GetHelp(), max_len);
1204 alias_pos->second->GetHelp(), max_len);
1216 pos->second->GetHelp(), max_len);
1381 OptionArgVectorSP option_arg_vector_sp = desugared.second;
1853 return (CommandAlias *)pos->second.get();
2586 CommandObject *cmd_obj = pos->second.get();
tools/lldb/source/Interpreter/OptionValueDictionary.cpp 41 OptionValue *option_value = pos->second.get();
90 pos->second->DumpValue(nullptr, strm, eDumpOptionValue | eDumpOptionRaw);
283 value_sp = pos->second;
321 copied_dict->SetValueForKey(pos->first, pos->second->DeepCopy(), true);
tools/lldb/source/Interpreter/Options.cpp 231 (int)i, defs[i].long_option, short_opt, pos->second,
232 m_getopt_table[pos->second].definition->long_option,
239 (int)i, defs[i].long_option, short_opt, pos->second,
240 m_getopt_table[pos->second].definition->long_option,
567 i = pos.second;
tools/lldb/source/Plugins/Disassembler/llvm/DisassemblerLLVMC.cpp 557 osi = offset_and_iterator.second;
569 osi = base_and_iterator.second;
582 osi = index_and_iterator.second;
595 osi = index_and_iterator.second;
640 osi = offset_and_iterator.second;
652 osi = base_and_iterator.second;
693 osi = base_and_iterator.second;
706 osi = offset_and_iterator.second;
738 osi = base_and_iterator.second;
827 osi = found_and_iter.second;
tools/lldb/source/Plugins/DynamicLoader/Darwin-Kernel/DynamicLoaderDarwinKernel.cpp 1350 if (ku.second.IsValid())
1351 uuid = ku.second.GetAsString();
tools/lldb/source/Plugins/DynamicLoader/Hexagon-DYLD/DynamicLoaderHexagonDYLD.cpp 571 addr_t link_map = it->second;
tools/lldb/source/Plugins/DynamicLoader/MacOSX-DYLD/DynamicLoaderDarwin.cpp 1068 auto tls_pos = tid_pos->second.find(pthread_key);
1069 if (tls_pos != tid_pos->second.end()) {
1070 return tls_pos->second + tls_offset;
tools/lldb/source/Plugins/DynamicLoader/POSIX-DYLD/DynamicLoaderPOSIXDYLD.cpp 663 addr_t link_map = it->second;
tools/lldb/source/Plugins/DynamicLoader/Windows-DYLD/DynamicLoaderWindowsDYLD.cpp 103 if (it != m_loaded_modules.end() && it->second != LLDB_INVALID_ADDRESS)
104 return it->second;
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangASTSource.cpp 330 current_id, i->second.GetName().AsCString(),
337 i->first->FindTypesInNamespace(name, &i->second, UINT32_MAX, types);
756 current_id, i->second.GetName().AsCString(),
759 FindExternalVisibleDecls(context, i->first, i->second, current_id);
1673 return lhs.second < rhs.second;
1673 return lhs.second < rhs.second;
1682 std::pair<const D *, O>(parser_decl.decl, item.second));
1880 parent_map->begin()->second.GetName().AsCString());
1896 CompilerDeclContext module_parent_namespace_decl = i->second;
1957 const CompilerDeclContext &namespace_decl = namespace_decls->begin()->second;
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangExpressionDeclMap.cpp 756 current_id, i->second.GetName().AsCString(),
759 FindExternalVisibleDecls(context, i->first, i->second, current_id);
1332 if (q->second->m_decl_lvl > fdi.m_decl_lvl)
1335 else if (q->second->m_decl_lvl < fdi.m_decl_lvl)
1345 sc_func_list.Append(q.second->m_sym_ctx);
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangExpressionVariable.h 157 return &i->second;
191 return &i->second;
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangModulesDeclVendor.cpp 141 error_stream.PutCString(diag.second);
221 ReportModuleExports(*exported_modules, mi->second);
446 if (pi != module_priorities.end() && pi->second > found_priority) {
448 found_priority = pi->second;
458 if ((pi != module_priorities.end()) && pi->second > found_priority) {
460 found_priority = pi->second;
568 return m_compiler_instance->loadModule(path.front().second, path, visibility,
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangPersistentVariables.cpp 104 return i->second;
tools/lldb/source/Plugins/Instruction/ARM/EmulationStateARM.cpp 136 ret_val = pos->second;
tools/lldb/source/Plugins/InstrumentationRuntime/TSan/TSanRuntime.cpp 299 return IT->second;
tools/lldb/source/Plugins/JITLoader/GDB/JITLoaderGDB.cpp 372 module_sp = it->second;
tools/lldb/source/Plugins/Language/CPlusPlus/LibCxxList.cpp 235 current = cached_iterator->second;
tools/lldb/source/Plugins/Language/CPlusPlus/LibCxxMap.cpp 348 iterator = cached_iterator->second;
tools/lldb/source/Plugins/Language/CPlusPlus/LibCxxVector.cpp 194 return iter->second;
tools/lldb/source/Plugins/Language/ObjC/NSArray.cpp 440 return iter->second(valobj, stream, options);
868 return iter->second(synth, valobj_sp);
tools/lldb/source/Plugins/Language/ObjC/NSDictionary.cpp 414 return candidate.second(valobj, stream, options);
490 return candidate.second(synth, valobj_sp);
tools/lldb/source/Plugins/Language/ObjC/NSIndexPath.cpp 185 if (!value.second)
tools/lldb/source/Plugins/Language/ObjC/NSSet.cpp 279 return iter->second(valobj, stream, options);
350 return iter->second(synth, valobj_sp);
tools/lldb/source/Plugins/Language/ObjC/NSString.cpp 96 return iter->second(valobj, stream, summary_options);
tools/lldb/source/Plugins/LanguageRuntime/CPlusPlus/ItaniumABI/ItaniumABILanguageRuntime.cpp 603 return pos->second;
tools/lldb/source/Plugins/LanguageRuntime/ObjC/AppleObjCRuntime/AppleObjCDeclVendor.cpp 173 return iter->second;
tools/lldb/source/Plugins/LanguageRuntime/ObjC/AppleObjCRuntime/AppleObjCRuntimeV2.cpp 608 for (; iterator != iterators_pair.second; iterator++) {
609 if (iterator->second) {
611 iterator->second->GetClassName().AsCString("<unknown>");
618 iterator->second->GetInstanceSize());
620 (uintptr_t)iterator->second->GetNumIVars());
621 if (auto superclass = iterator->second->GetSuperclass()) {
627 for (size_t i = 0; i < iterator->second->GetNumIVars(); i++) {
628 auto ivar = iterator->second->GetIVarAtIndex(i);
636 iterator->second->Describe(
1819 if (ISAIsCached(elt.second))
1823 new ClassDescriptorV2(*this, elt.second, elt.first.AsCString()));
1829 elt.second, elt.first.AsCString());
1831 AddClass(elt.second, descriptor_sp, elt.first.AsCString());
2041 if (class_and_ivar.first.size() && class_and_ivar.second.size()) {
2047 const ConstString ivar_name_cs(class_and_ivar.second);
2365 actual_class_descriptor_sp = iterator->second;
2453 actual_class_descriptor_sp = iterator->second;
2504 return cache_iter->second;
2664 cf_true = m_CFBoolean_values->second;
tools/lldb/source/Plugins/LanguageRuntime/ObjC/AppleObjCRuntime/AppleObjCTrampolineHandler.cpp 859 this_dispatch = g_dispatch_functions[(*pos).second];
tools/lldb/source/Plugins/LanguageRuntime/ObjC/ObjCLanguageRuntime.cpp 81 return (*pos).second;
92 TypeSP complete_type_sp(complete_class_iter->second.lock());
180 if (pos->second->GetClassName() == name)
189 for (HashToISAIterator range_pos = range.first; range_pos != range.second;
192 m_isa_to_descriptor.find(range_pos->second);
194 if (pos->second->GetClassName() == name)
238 return pos->second;
287 return pos->second;
tools/lldb/source/Plugins/LanguageRuntime/RenderScript/RenderScriptRuntime/RenderScriptRuntime.cpp 855 if (!(m_kernel_types & kernel.second))
2861 m_pragmas[kv_pair.first.trim().str()] = kv_pair.second.trim().str();
2929 m_slang_version = kv_pair.second.str();
2931 m_bcc_version = kv_pair.second.str();
2947 m_kernels.push_back(RSKernelDescriptor(this, kv_pair.second, slot));
3023 const auto val = kv_pair.second.trim();
3087 strm.Indent(b.second->defn->name);
3119 cRef.first, cRef.second);
3925 strm.Printf("%s: %s", key_val.first.c_str(), key_val.second.c_str());
tools/lldb/source/Plugins/ObjectContainer/BSD-Archive/ObjectContainerBSDArchive.cpp 209 !pos->second->GetArchitecture().IsCompatibleMatch(arch))
212 pos->second->GetFileOffset() != file_offset)
215 if (pos->second->GetModificationTime() == time) {
216 return pos->second;
tools/lldb/source/Plugins/ObjectFile/ELF/ObjectFileELF.cpp 729 return ub->second;
2206 if (section_it->second)
2207 symbol_section_sp = section_it->second;
tools/lldb/source/Plugins/ObjectFile/Mach-O/ObjectFileMachO.cpp 4356 if (range.first != range.second) {
4358 pos != range.second; ++pos) {
4361 sym[pos->second].GetMangled().GetName(
4363 m_nlist_idx_to_sym_idx[nlist_idx] = pos->second;
4367 sym[pos->second].SetExternal(sym[sym_idx].IsExternal());
4368 sym[pos->second].SetFlags(nlist.n_type << 16 | nlist.n_desc);
4371 sym[pos->second].SetType(eSymbolTypeResolver);
4392 if (range.first != range.second) {
4394 pos != range.second; ++pos) {
4397 sym[pos->second].GetMangled().GetName(
4399 m_nlist_idx_to_sym_idx[nlist_idx] = pos->second;
4403 sym[pos->second].SetExternal(sym[sym_idx].IsExternal());
4404 sym[pos->second].SetFlags(nlist.n_type << 16 | nlist.n_desc);
4420 const uint32_t GSYM_sym_idx = pos->second;
4488 const auto undef_pos = undefined_name_to_desc.find(pos.second);
4491 llvm::MachO::GET_LIBRARY_ORDINAL(undef_pos->second);
4611 stub_symbol = symtab->SymbolAtIndex(index_pos->second);
tools/lldb/source/Plugins/Platform/Android/PlatformAndroidRemoteGDBServer.cpp 80 DeleteForwardPortWithAdb(it.second, m_device_id);
160 const auto port = it->second;
tools/lldb/source/Plugins/Platform/gdb-server/PlatformRemoteGDBServer.cpp 848 gdbserver.second.empty() ? nullptr : gdbserver.second.c_str();
848 gdbserver.second.empty() ? nullptr : gdbserver.second.c_str();
tools/lldb/source/Plugins/Process/Linux/NativeProcessLinux.cpp 326 if (it->second == false) {
360 it->second = true;
896 reg_value = it->second;
979 next_pc = pc_it->second.GetAsUInt64();
982 next_flags = flags_it->second.GetAsUInt64();
1624 if (it.second.GetFilename() == module_file_spec.GetFilename()) {
1625 file_spec = it.second;
1642 if (it.second == file) {
1730 Status error = RemoveBreakpoint(thread_info.second);
1833 if (traceid == iter.second->GetTraceID() &&
1835 return *(iter.second);
1984 if (iter->second->GetTraceID() == m_pt_proces_trace_id) {
2036 if (iter.second->GetTraceID() == traceid) {
2042 LLDB_LOG(log, "Trace ID {0}", iter.second->GetTraceID());
2058 if (iter->second->GetTraceID() != traceid) {
tools/lldb/source/Plugins/Process/Linux/NativeThreadLinux.cpp 167 uint32_t wp_index = wp->second;
197 uint32_t bp_index = bp->second;
222 const auto &wp = pair.second;
234 const auto &bp = pair.second;
tools/lldb/source/Plugins/Process/Utility/AuxVector.cpp 36 return it->second;
48 entry.second);
tools/lldb/source/Plugins/Process/Utility/DynamicRegisterInfo.cpp 456 if (pos->second.size() > 1) {
457 llvm::sort(pos->second.begin(), pos->second.end());
457 llvm::sort(pos->second.begin(), pos->second.end());
459 std::unique(pos->second.begin(), pos->second.end());
459 std::unique(pos->second.begin(), pos->second.end());
460 if (unique_end != pos->second.end())
461 pos->second.erase(unique_end, pos->second.end());
461 pos->second.erase(unique_end, pos->second.end());
463 assert(!pos->second.empty());
464 if (pos->second.back() != LLDB_INVALID_REGNUM)
465 pos->second.push_back(LLDB_INVALID_REGNUM);
485 for (const uint32_t invalidate_reg_num : pos->second) {
490 invalidate_pos->second) {
496 pos->second.insert(pos->second.end(), extra_invalid_regs.begin(),
496 pos->second.insert(pos->second.end(), extra_invalid_regs.begin(),
506 if (pos->second.size() > 1) {
507 llvm::sort(pos->second.begin(), pos->second.end());
507 llvm::sort(pos->second.begin(), pos->second.end());
509 std::unique(pos->second.begin(), pos->second.end());
509 std::unique(pos->second.begin(), pos->second.end());
510 if (unique_end != pos->second.end())
511 pos->second.erase(unique_end, pos->second.end());
511 pos->second.erase(unique_end, pos->second.end());
513 assert(!pos->second.empty());
514 if (pos->second.back() != LLDB_INVALID_REGNUM)
515 pos->second.push_back(LLDB_INVALID_REGNUM);
tools/lldb/source/Plugins/Process/Utility/RegisterContextLLDB.cpp 1154 regloc = iterator->second;
tools/lldb/source/Plugins/Process/gdb-remote/GDBRemoteCommunicationServer.cpp 70 packet_result = handler_it->second(packet, error, interrupt, quit);
tools/lldb/source/Plugins/Process/gdb-remote/GDBRemoteCommunicationServerLLGS.cpp 2959 register_data_sp = it->second;
3122 response.Printf("num:%d;", hw_debug_cap->second);
tools/lldb/source/Plugins/Process/gdb-remote/GDBRemoteCommunicationServerPlatform.cpp 471 if (pair.second == LLDB_INVALID_PROCESS_ID) {
472 pair.second = ~(lldb::pid_t)LLDB_INVALID_PROCESS_ID;
483 pos->second = pid;
492 pos->second = LLDB_INVALID_PROCESS_ID;
501 if (pair.second == pid) {
502 pair.second = LLDB_INVALID_PROCESS_ID;
tools/lldb/source/Plugins/Process/gdb-remote/ProcessGDBRemote.cpp 418 value_pair.second = comma_separated_regiter_numbers;
420 value_pair = value_pair.second.split(',');
427 } while (!value_pair.second.empty());
1332 continue_packet.Printf(";C%2.2x:%4.4" PRIx64, s_pos->second,
1355 continue_packet.Printf(";S%2.2x:%4.4" PRIx64, s_pos->second,
1394 const int continue_signo = m_continue_C_tids.front().second;
1404 if (m_continue_C_tids[i].second != continue_signo)
1448 const int step_signo = m_continue_S_tids.front().second;
1453 if (m_continue_S_tids[i].second != step_signo)
1466 continue_packet.Printf("S%2.2x", m_continue_S_tids.front().second);
1793 StringExtractor reg_value_extractor(pair.second);
3069 InferiorCallMunmap(this, addr, pos->second))
4246 module_spec = cached->second;
4406 set_name = pos->second.name;
tools/lldb/source/Plugins/Process/gdb-remote/ProcessGDBRemote.h 440 return llvm::hash_combine(key.first, key.second);
tools/lldb/source/Plugins/StructuredData/DarwinLog/StructuredDataDarwinLog.cpp 85 return find_it->second;
97 find_it->second = options_sp;
206 return find_it->second(match_accepts, attribute, op_arg, error);
tools/lldb/source/Plugins/SymbolFile/Breakpad/SymbolFileBreakpad.cpp 140 return m_map.try_emplace(file, m_map.size() + 1).first->second;
160 result[KV.second] = all_files[KV.first];
358 symtab.AddSymbol(std::move(KV.second));
441 postfix::Node *rhs = postfix::ParseOneExpression(rule->second, node_alloc);
443 LLDB_LOG(log, "Could not parse `{0}` as unwind rhs.", rule->second);
461 LLDB_LOG(log, "Resolving symbols in `{0}` failed.", rule->second);
577 return rule.second;
587 auto *symbol = llvm::dyn_cast<postfix::SymbolNode>(it->second);
592 if (!postfix::ResolveSymbols(it->second, symbol_resolver)) {
597 llvm::ArrayRef<uint8_t> saved = SaveAsDWARF(*it->second);
604 it->second = postfix::MakeNode<postfix::InitialValueNode>(node_alloc);
614 if (!postfix::ResolveSymbols(it->second, symbol_resolver)) {
620 llvm::ArrayRef<uint8_t> saved = SaveAsDWARF(*it->second);
tools/lldb/source/Plugins/SymbolFile/DWARF/DWARFASTParserClang.cpp 162 if (!name_module.second)
164 name_module.second->GetSymbolFile()->FindTypes(decl_context,
2126 static_cast<uint32_t>(pos->second),
2141 (uint32_t)base_pos->second.getQuantity(),
2155 static_cast<uint32_t>(vbase_pos->second.getQuantity()),
2195 for (DWARFDIE decl = it->second.GetFirstChild(); decl;
3327 return cache_pos->second;
3606 return pos->second;
tools/lldb/source/Plugins/SymbolFile/DWARF/DWARFDIE.cpp 47 if (m_seen.insert(die.GetID()).second)
tools/lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugAbbrev.cpp 130 return &(m_prev_abbr_offset_pos->second);
137 return &(pos->second);
145 pair.second.GetUnsupportedForms(invalid_forms);
tools/lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugInfo.cpp 170 return llvm::cast<DWARFTypeUnit>(GetUnitAtIndex(pos->second));
tools/lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugRanges.cpp 115 range_list = pos->second;
212 for (const RngListEntry &E : pos->second) {
tools/lldb/source/Plugins/SymbolFile/DWARF/DebugNamesDWARFIndex.cpp 238 if (seen.insert(die.GetDIE()).second)
tools/lldb/source/Plugins/SymbolFile/DWARF/SymbolFileDWARF.cpp 854 ModuleSP module = p.second;
892 FileSpecList &list = iter_bool.first->second;
893 if (iter_bool.second) {
1035 return iter->second;
1514 return pos->second;
2284 if (resolved_dies.insert(die.GetDIE()).second)
2331 if (resolved_dies.insert(die.GetDIE()).second)
2429 if (ModuleSP external_module_sp = pair.second)
tools/lldb/source/Plugins/SymbolFile/DWARF/SymbolFileDWARFDebugMap.cpp 407 comp_unit_info->oso_sp = pos->second;
tools/lldb/source/Plugins/SymbolFile/DWARF/SymbolFileDWARFDwp.cpp 102 it->second->getOffset(lldbSectTypeToLlvmSectionKind(sect_type));
117 if (it->second.GetByteSize() == 0)
120 data = it->second;
tools/lldb/source/Plugins/SymbolFile/DWARF/UniqueDWARFASTType.h 92 return pos->second.Find(die, decl, byte_size, entry);
tools/lldb/source/Plugins/SymbolFile/NativePDB/CompileUnitIndex.cpp 117 if (!result.second)
118 return *result.first->second;
129 std::unique_ptr<CompilandIndexItem>& cci = result.first->second;
179 return iter->second.get();
186 return iter->second.get();
tools/lldb/source/Plugins/SymbolFile/NativePDB/PdbAstBuilder.cpp 265 clang::QualType parent_qt = GetOrCreateType(parent_iter->second);
358 TypeIndex value = entry.second;
362 entry.second = iter->second;
362 entry.second = iter->second;
596 return GetOrCreateDeclContextForUid(PdbTypeSymId(iter->second));
650 DeclStatus &status = status_iter->second;
802 return iter->second;
954 return iter->second;
1309 PdbCompilandSymId block_id = PdbSymUid(iter->second.uid).asCompilandSym();
tools/lldb/source/Plugins/SymbolFile/NativePDB/PdbFPOProgramToDWARFExpression.cpp 65 ResolveSymbols(it->second, [&](SymbolNode &symbol) -> Node * {
68 return pair.second;
84 return it->second;
tools/lldb/source/Plugins/SymbolFile/NativePDB/PdbIndex.cpp 169 PdbCompilandSymId cu_sym_id = iter->second.asCompilandSym();
181 result.push_back({std::move(sym), iter->second});
tools/lldb/source/Plugins/SymbolFile/NativePDB/SymbolFileNativePDB.cpp 702 TypeSP result = full_iter->second;
735 return iter->second;
849 if (emplace_result.second)
850 emplace_result.first->second = CreateGlobalVariable(var_id);
852 return emplace_result.first->second;
862 if (emplace_result.second)
863 emplace_result.first->second = CreateFunction(func_id, comp_unit);
865 return emplace_result.first->second;
873 if (emplace_result.second)
874 emplace_result.first->second = CreateCompileUnit(cci);
876 lldbassert(emplace_result.first->second);
877 return emplace_result.first->second;
883 return *iter->second;
1192 switch (result.second.kind()) {
1223 if (match.second.kind() != S_PROCREF && match.second.kind() != S_LPROCREF)
1223 if (match.second.kind() != S_PROCREF && match.second.kind() != S_LPROCREF)
1225 ProcRefSym proc(match.second.kind());
1226 cantFail(SymbolDeserializer::deserializeAs<ProcRefSym>(match.second, proc));
1369 return iter->second;
1395 return iter->second;
1542 return &*iter->second;
tools/lldb/source/Plugins/SymbolFile/NativePDB/UdtRecordCompleter.cpp 224 bases.push_back(std::move(ib.second));
tools/lldb/source/Plugins/SymbolFile/PDB/PDBASTParser.cpp 820 return it->second;
1110 set = &pit->second;
tools/lldb/source/Plugins/SymbolFile/PDB/SymbolFilePDB.cpp 555 return find_result->second.get();
920 return result->second;
1042 variable_list->AddVariableIfUnique(result->second);
1510 types.Insert(iter->second);
1560 types.Insert(iter->second);
1728 return found_cu->second;
tools/lldb/source/Plugins/UnwindAssembly/InstEmulation/UnwindAssemblyInstEmulation.cpp 163 if (it->second.first->GetOffset() != m_curr_row->GetOffset()) {
165 *newrow = *it->second.first;
167 m_register_values = it->second.second;
167 m_register_values = it->second.second;
197 m_register_values = saved_state.second;
351 reg_value = pos->second;
tools/lldb/source/Plugins/UnwindAssembly/x86/x86AssemblyInspectionEngine.cpp 131 const RegisterInfo *ri = reg_ctx->GetRegisterInfoByName(it->second.name);
133 it->second.lldb_regnum = ri->kinds[eRegisterKindLLDB];
237 if (::strcmp(reg_info[i].name, it->second.name) == 0) {
238 it->second.lldb_regnum = reg_info[i].lldb_regnum;
909 lldb_regno = it->second.lldb_regnum;
tools/lldb/source/Symbol/ArmUnwindInfo.cpp 331 row->SetRegisterLocationToAtCFAPlusOffset(offset.first, offset.second - vsp,
tools/lldb/source/Symbol/ClangASTContext.cpp 2205 AddFieldToRecordType(type, field.first, field.second, lldb::eAccessPublic,
9451 s->PutCString(val.second);
9988 if (!searched.insert(it->second).second)
9988 if (!searched.insert(it->second).second)
9991 CompilerDeclContext(this, it->second));
9993 for (clang::Decl *child : it->second->decls()) {
10093 if (searched.find(it->second) != searched.end())
10101 if (llvm::isa<clang::TranslationUnitDecl>(it->second))
10104 searched.insert(it->second);
10106 CompilerDeclContext(this, it->second));
10108 for (clang::Decl *child : it->second->decls()) {
tools/lldb/source/Symbol/ClangASTImporter.cpp 247 backup.first->setDeclContext(backup.second.decl_context);
248 backup.first->setLexicalDeclContext(backup.second.lexical_decl_context);
584 bit_size = pos->second.bit_size;
585 alignment = pos->second.alignment;
586 field_offsets.swap(pos->second.field_offsets);
587 base_offsets.swap(pos->second.base_offsets);
588 vbase_offsets.swap(pos->second.vbase_offsets);
819 return iter->second;
833 iter->second.decl = original_decl;
834 iter->second.ctx = &original_decl->getASTContext();
856 return iter->second;
915 if (iter->second.ctx == src_ast)
1088 if (origin_iter->second.ctx != &to->getASTContext())
1089 to_context_md->m_origins[to] = origin_iter->second;
1093 m_master.GetDelegate(&to->getASTContext(), origin_iter->second.ctx);
1096 direct_completer->ASTImporter::Imported(origin_iter->second.decl, to);
1102 static_cast<void *>(origin_iter->second.decl),
1103 static_cast<void *>(origin_iter->second.ctx),
1133 namespace_map_iter->second;
1210 return const_cast<clang::Decl *>(iter->second.decl);
tools/lldb/source/Symbol/ClangExternalASTSourceCommon.cpp 39 return iter->second;
tools/lldb/source/Symbol/CompileUnit.cpp 73 sorted_functions.push_back(p.second);
126 return it->second;
tools/lldb/source/Symbol/DWARFCallFrameInfo.cpp 235 if (pos->second == nullptr)
236 pos->second = ParseCIE(cie_offset);
238 return pos->second.get();
tools/lldb/source/Symbol/Symtab.cpp 124 pos->second->Dump(s, target, pos->second - &m_symbols[0]);
124 pos->second->Dump(s, target, pos->second - &m_symbols[0]);
330 RegisterBacklogEntry(record.first, record.second, class_contexts);
tools/lldb/source/Symbol/TypeMap.cpp 40 pos != end && pos->second->GetID() == type_uid; ++pos) {
41 if (pos->second.get() == type_sp.get())
88 return pos->second;
97 if (!callback(pos->second))
105 if (!callback(pos->second))
115 if (pos->second == type_sp) {
126 pos->second->Dump(s, show_context);
156 Type *the_type = pos->second.get();
230 Type *the_type = pos->second.get();
tools/lldb/source/Symbol/TypeSystem.cpp 191 TypeSystem *type_system = pair.second.get();
211 TypeSystem *type_system = pair.second.get();
233 auto *type_system = pos->second.get();
247 if (pair.second && pair.second->SupportsLanguage(language)) {
247 if (pair.second && pair.second->SupportsLanguage(language)) {
250 m_map[language] = pair.second;
251 if (pair.second.get()) {
253 return *pair.second.get();
302 auto *type_system = pos->second.get();
316 if (pair.second && pair.second->SupportsLanguage(language)) {
316 if (pair.second && pair.second->SupportsLanguage(language)) {
319 m_map[language] = pair.second;
320 if (pair.second.get()) {
322 return *pair.second.get();
tools/lldb/source/Symbol/UnwindPlan.cpp 83 order_and_width->second);
85 order_and_width->second,
244 idx->second.Dump(s, unwind_plan, this, thread, verbose);
258 register_location = pos->second;
309 if (can_replace_only_if_unspecified && !pos->second.IsUnspecified())
tools/lldb/source/Symbol/UnwindTable.cpp 128 pos->second->GetFunctionStartAddress() != addr))
131 if (pos->second->ContainsAddress(addr))
132 return pos->second;
tools/lldb/source/Target/Language.cpp 59 return iter->second.get();
115 if (!callback(entry.second.get()))
tools/lldb/source/Target/Memory.cpp 66 AddrRange chunk_range(pos->first, pos->second->GetByteSize());
143 AddrRange chunk_range(pos->first, pos->second->GetByteSize());
145 memcpy(dst, pos->second->GetBytes() + (addr - chunk_range.GetRangeBase()),
190 pos->second->GetBytes() + cache_offset, curr_read_size);
204 curr_read_size = pos->second->GetByteSize();
208 memcpy(dst_buf + dst_len - bytes_left, pos->second->GetBytes(),
217 if (pos->second->GetByteSize() != cache_line_byte_size)
334 m_process.DoDeallocateMemory(pos->second->GetBaseAddress());
375 for (PermissionsToBlockMap::iterator pos = range.first; pos != range.second;
377 addr = (*pos).second->ReserveBlock(byte_size);
403 if (pos->second->Contains(addr)) {
404 success = pos->second->FreeBlock(addr);
tools/lldb/source/Target/ModuleCache.cpp 220 cached_module_sp = (*find_it).second.lock();
tools/lldb/source/Target/PathMappingList.cpp 131 m_pairs[index].second.GetCString());
135 m_pairs[pair_index].second.GetCString());
179 FileSpec remapped(it.second.GetStringRef());
191 if (!path_ref.consume_front(it.second.GetStringRef()))
234 new_spec.SetFile(entry.second.GetCString(), FileSpec::Style::native);
250 m_pairs[idx].second = new_path;
300 new_path = m_pairs[idx].second;
tools/lldb/source/Target/Process.cpp 1293 result = iterator->second;
1520 if (pos == m_language_runtimes.end() || (retry_if_null && !pos->second)) {
1527 runtime = pos->second.get();
4223 return find_it->second;
5601 function_addr = (*iter).second;
5632 InstrumentationRuntimeSP runtime = pos->second;
5649 LanguageRuntimeSP language_runtime_sp = pair.second;
5662 if (pair.second)
5663 pair.second->ModulesDidLoad(*this, module_list);
5684 if (it->second.find(repeat_key) != it->second.end()) {
5684 if (it->second.find(repeat_key) != it->second.end()) {
5687 it->second.insert(repeat_key);
5744 return (*pos).second;
5960 find_it->second->HandleArrivalOfStructuredData(*this, type_name, object_sp);
tools/lldb/source/Target/RegisterNumber.cpp 53 m_kind_regnum_map[it.first] = it.second;
91 return iter->second;
tools/lldb/source/Target/SectionLoadHistory.cpp 49 return rpos->second.get();
55 return pos->second.get();
58 return pos->second.get();
74 return pos->second.get();
83 new SectionLoadList(*rpos->second));
161 pos->second->Dump(s, target);
tools/lldb/source/Target/SectionLoadList.cpp 58 section_load_addr = pos->second;
82 if (load_addr == sta_pos->second)
85 sta_pos->second = load_addr;
102 if (warn_multiple && section != ats_pos->second) {
105 ModuleSP curr_module_sp(ats_pos->second->GetModule());
113 ats_pos->second->GetName().GetCString());
117 ats_pos->second = section;
160 addr_t load_addr = sta_pos->second;
221 if (offset < pos->second->GetByteSize() + (allow_section_end ? 1 : 0)) {
224 return pos->second->ResolveContainedAddress(offset, so_addr,
236 rpos->second->GetByteSize() + (allow_section_end ? 1 : 0)) {
239 return rpos->second->ResolveContainedAddress(offset, so_addr,
255 static_cast<void *>(pos->second.get()));
256 pos->second->Dump(&s, target, 0);
tools/lldb/source/Target/StackFrame.cpp 1278 base_and_offset.second -= immediate_child->m_immediate;
1280 base_and_offset.second += immediate_child->m_immediate;
1365 base_and_offset.second,
1388 base_and_offset.second);
tools/lldb/source/Target/StackFrameList.cpp 309 if (!visited_nodes.insert(&callee).second) {
tools/lldb/source/Target/StopInfo.cpp 420 if (!result.second)
tools/lldb/source/Target/Target.cpp 141 BreakpointName *new_bp_name = new BreakpointName(*bp_name_entry.second);
227 return pos->second;
703 return (iter->second);
1035 if (!insert_result.second)
2522 found_hook = (*specified_hook_iter).second;
2533 (*specified_hook_iter).second->SetIsActive(active_state);
2540 (*pos).second->SetIsActive(active_state);
2571 if (hook.second->IsActive()) {
2573 auto_continue |= hook.second->GetAutoContinue();
2613 StopHookSP cur_hook_sp = (*pos).second;
tools/lldb/source/Target/ThreadPlanStepUntil.cpp 92 target_sp->RemoveBreakpointByID((*pos).second);
111 (*m_until_points.begin()).second);
118 (*pos).second);
139 if (!LLDB_BREAK_ID_IS_VALID((*pos).second))
197 if (this_site->IsBreakpointAtThisSite((*pos).second)) {
293 target_sp->GetBreakpointByID((*pos).second).get();
315 Breakpoint *until_bp = target_sp->GetBreakpointByID((*pos).second).get();
tools/lldb/source/Target/UnixSignals.cpp 140 return pos->second.m_name.GetCString();
160 if ((const_name == pos->second.m_name) ||
161 (const_name == pos->second.m_alias) ||
162 (const_name == GetShortName(pos->second.m_name)) ||
163 (const_name == GetShortName(pos->second.m_alias)))
202 const Signal &signal = pos->second;
213 return pos->second.m_suppress;
220 pos->second.m_suppress = value;
237 return pos->second.m_stop;
244 pos->second.m_stop = value;
261 return pos->second.m_notify;
268 pos->second.m_notify = value;
tools/lldb/source/Utility/Broadcaster.cpp 62 if (curr_listener_sp && it->second) {
63 listeners.emplace_back(std::move(curr_listener_sp), it->second);
104 s.PutCString(pos->second);
131 pair.second |= event_mask;
158 if (pair.second & event_type)
172 pair.second &= ~event_mask;
232 if (!(pair.second & event_type))
402 return (*iter).second;
454 (*iter).second->StartListeningForEvents(&broadcaster,
tools/lldb/source/Utility/CompletionRequest.cpp 67 if (m_added_values.insert(r.GetUniqueKey()).second)
tools/lldb/source/Utility/Listener.cpp 66 broadcaster_sp->RemoveListener(this, pos->second.event_mask);
414 BroadcasterInfo info = pos->second;
tools/lldb/source/Utility/Log.cpp 190 assert(iter.second == true);
tools/lldb/source/Utility/Reproducer.cpp 166 provider.second->Keep();
176 provider.second->Discard();
195 files.emplace_back(provider.second->GetFile());
tools/lldb/source/Utility/ReproducerInstrumentation.cpp 76 unsigned id = m_replayers[addr].second;
83 return m_ids[id].second.ToString();
tools/lldb/source/Utility/SelectHelper.cpp 64 return pos->second.read_is_set;
72 return pos->second.write_is_set;
80 return pos->second.error_is_set;
108 pair.second.PrepareForSelect();
117 if (pair.second.read_set)
119 if (pair.second.write_set)
121 if (pair.second.error_set)
181 if (pair.second.read_set)
184 if (pair.second.write_set)
187 if (pair.second.error_set)
237 if (pair.second.read_set) {
239 pair.second.read_is_set = true;
241 if (pair.second.write_set) {
243 pair.second.write_is_set = true;
245 if (pair.second.error_set) {
247 pair.second.error_is_set = true;
tools/lldb/source/Utility/StructuredData.cpp 81 json::Value value = KV.second;
106 if (match.second.empty()) {
109 return value->GetObjectForDotSeparatedPath(match.second);
117 if (match.second.empty()) {
121 uint64_t val = strtoul(match.second.str().c_str(), nullptr, 10);
164 pair.second->Serialize(s);
tools/lldb/source/Utility/UserIDResolver.cpp 22 if (iter_bool.second)
23 iter_bool.first->second = (this->*do_get)(id);
24 if (iter_bool.first->second)
25 return llvm::StringRef(*iter_bool.first->second);
tools/lldb/tools/lldb-vscode/JSONUtils.cpp 493 object.try_emplace("sourceReference", addr_srcref->second);
494 disasm_line = g_vsc.GetLineForPC(addr_srcref->second, pc);
506 object.try_emplace("sourceReference", addr_srcref->second);
507 disasm_line = g_vsc.GetLineForPC(addr_srcref->second, pc);
tools/lldb/tools/lldb-vscode/SourceReference.h 25 return addr_line->second;
tools/lldb/tools/lldb-vscode/VSCode.cpp 60 return pos->second.GetLineForPC(pc);
tools/lldb/tools/lldb-vscode/lldb-vscode.cpp 1606 g_vsc.target.BreakpointDelete(pair.second.bp.GetID());
1609 pair.second.UpdateBreakpoint(request_pos->second);
1609 pair.second.UpdateBreakpoint(request_pos->second);
1614 AppendBreakpoint(pair.second.bp, response_breakpoints);
1626 pair.second.SetBreakpoint(path.data());
1628 AppendBreakpoint(pair.second.bp, response_breakpoints);
1629 old_src_bp_pos->second[pair.first] = std::move(pair.second);
1636 pair.second.SetBreakpoint(path.data());
1638 AppendBreakpoint(pair.second.bp, response_breakpoints);
1926 EmplaceSafeString(body, "content", pos->second.content);
2654 handler_pos->second(*object);
tools/lldb/unittests/Host/FileSystemTest.cpp 54 return I->second;
76 if (I->second.isSymlink()) {
105 vfs::directory_entry(I->second.getName(), I->second.getType());
105 vfs::directory_entry(I->second.getName(), I->second.getType());
115 vfs::directory_entry(I->second.getName(), I->second.getType());
115 vfs::directory_entry(I->second.getName(), I->second.getType());
tools/lldb/unittests/Process/POSIX/NativeProcessELFTest.cpp 43 offset = encoder.PutAddress(offset, pair.second);
tools/lldb/unittests/Symbol/PostfixExpressionTest.cpp 113 result.emplace_back(p.first, ASTPrinter::Print(p.second));
tools/lldb/unittests/Utility/FileSpecTest.cpp 157 FileSpec two(test.second, FileSpec::Style::windows);
173 FileSpec two(test.second, FileSpec::Style::posix);
187 FileSpec two(test.second, FileSpec::Style::posix);
233 EXPECT_EQ(test.second,
265 EXPECT_EQ(test.second,
tools/lldb/unittests/Utility/StringLexerTest.cpp 127 EXPECT_EQ('f', r.second);
133 EXPECT_EQ('o', r.second);
139 EXPECT_EQ('o', r.second);
tools/lldb/unittests/Utility/StructuredDataTest.cpp 30 EXPECT_EQ(P.second, S.GetString());
tools/lldb/unittests/tools/lldb-server/tests/MessageObjects.cpp 360 pairs[pair.first].push_back(pair.second);
tools/lldb/unittests/tools/lldb-server/tests/ThreadIdsInJstopinfoTest.cpp 51 Pointee(Eq(stop_reply_pc.second)));
tools/lldb/utils/TableGen/LLDBOptionDefEmitter.cpp 183 emitOptions(CommandRecordPair.first, CommandRecordPair.second, OS);
tools/lldb/utils/TableGen/LLDBPropertyDefEmitter.cpp 167 emityProperties(PropertyRecordPair.first, PropertyRecordPair.second, OS);
178 emitPropertyEnum(PropertyRecordPair.first, PropertyRecordPair.second, OS);
tools/lli/lli.cpp 831 auto &JD = *JDItr->second;
841 auto &JD = *JDItr->second;
tools/llvm-c-test/echo.cpp 393 return i->second;
436 auto I = i->second;
782 return i->second;
tools/llvm-cfi-verify/lib/FileAnalysis.cpp 128 if (!(--KV)->second.Valid)
131 return &KV->second;
141 if (!KV->second.Valid)
144 return &KV->second;
160 return &InstrKV->second;
166 return InstrKV->second;
242 for (uint64_t SourceInstrAddress : TargetRefsKV->second) {
252 CFCrossReferences.insert(&SourceInstrKV->second);
538 if (!KV.second) {
574 TrapOnFailFunctionAddresses.insert(Addr.second);
tools/llvm-cfi-verify/lib/GraphBuilder.cpp 65 Addresses.push_back(It->second);
66 It = IntermediateNodes.find(It->second);
86 printPairToDOT(Analysis, OS, KV.first, KV.second);
tools/llvm-cfi-verify/llvm-cfi-verify.cpp 241 << KV.second << " indirect CF instructions.\n";
tools/llvm-config/llvm-config.cpp 97 if (!VisitedComponents.insert(AC).second) {
tools/llvm-cov/CodeCoverage.cpp 241 return *Files.second;
248 return *LoadedSourceFiles.back().second;
370 << " with hash = 0x" << Twine::utohexstr(HashMismatch.second)
400 std::string RemapTo = nativeWithTrailing(PathRemapping->second);
689 if (!(EquivPair.first.empty() && EquivPair.second.empty()))
911 const auto &Functions = FileFunc.second;
tools/llvm-cov/SourceCoverageViewHTML.cpp 570 if (Range.second == 0)
573 errs() << Range.second;
tools/llvm-cov/SourceCoverageViewText.cpp 141 << " -> " << Range.second << '\n';
tools/llvm-cxxdump/llvm-cxxdump.cpp 193 uint64_t SymSize = P.second;
345 uint64_t Offset = VFTableEntry.first.second;
346 StringRef SymName = VFTableEntry.second;
352 for (little32_t Offset : VBTable.second) {
359 const CompleteObjectLocator &COL = COLPair.second;
369 const ClassHierarchyDescriptor &CHD = CHDPair.second;
377 uint64_t Offset = BCAEntry.first.second;
378 StringRef SymName = BCAEntry.second;
383 const BaseClassDescriptor &BCD = BCDPair.second;
395 const TypeDescriptor &TD = TDPair.second;
405 const ThrowInfo &TI = TIPair.second;
413 outs() << (Entry == TIEntries.end() ? "null" : Entry->second) << '\n';
424 const CatchableTypeArray &CTA = CTAPair.second;
432 outs() << CTAName << '[' << Idx++ << "]: " << I->second << '\n';
436 const CatchableType &CT = CTPair.second;
459 uint64_t VTTOffset = VTTPair.first.second;
460 StringRef VTTEntry = VTTPair.second;
465 outs() << TIName << ": " << TIPair.second << '\n';
478 uint64_t Offset = VTableSymI->first.second;
479 StringRef VTableEntry = VTableSymI->second;
488 uint64_t Offset = VTableDataI->first.second;
489 int64_t VTableEntry = VTableDataI->second;
tools/llvm-cxxfilt/llvm-cxxfilt.cpp 128 Result += demangle(OS, Word.first) + Word.second.str();
tools/llvm-cxxmap/llvm-cxxmap.cpp 99 if (WarnAmbiguous && !ItAndIsNew.second &&
100 ItAndIsNew.first->second != Symbol) {
102 ItAndIsNew.first->second,
tools/llvm-diff/DiffLog.cpp 46 return (Diff[I].first ? (Diff[I].second ? DC_match : DC_left)
50 Instruction *DiffLogBuilder::getRight(unsigned I) const { return Diff[I].second; }
tools/llvm-diff/DifferenceEngine.cpp 186 diff(Pair.first, Pair.second);
730 diff(I->first, I->second);
tools/llvm-dwp/DWPStringPool.h 45 if (Pair.second) {
51 return Pair.first->second;
tools/llvm-dwp/llvm-dwp.cpp 226 if (!P.second)
228 auto &Entry = P.first->second;
272 if (!P.second)
286 for (size_t i = 0; i != array_lengthof(E.second.Contributions); ++i)
288 Out.EmitIntValue(E.second.Contributions[i].*Field, 4);
428 if (DWARFSectionKind Kind = SectionPair->second.second) {
471 buildDWODescription(PrevE.second.Name, PrevE.second.DWPName,
471 buildDWODescription(PrevE.second.Name, PrevE.second.DWPName,
472 PrevE.second.DWOName) +
575 if (!P.second)
577 P.first->second.Name = ID.Name;
578 P.first->second.DWOName = ID.DWOName;
602 if (!P.second)
604 auto &NewEntry = P.first->second;
tools/llvm-exegesis/lib/Analysis.cpp 241 Entries[IndexIt->second].PointIds.push_back(PointId);
420 writeMeasurementValue<kEscapeHtml>(OS, Pressure.second);
tools/llvm-exegesis/lib/Clustering.cpp 265 const SmallSet<ClusterId, 1> &ClusterIDs = OpcodeConfigToClusterID.second;
tools/llvm-exegesis/lib/SchedClassResolution.cpp 294 : ProcResPressureIt->second;
tools/llvm-extract/llvm-extract.cpp 270 BBInfo.second.split(BBNames, ';', /*MaxSplit=*/-1,
278 << " doesn't contain a basic block named '" << BBInfo.second
tools/llvm-ifs/llvm-ifs.cpp 477 assert(Symbol.Name == SI->second.Name && "Symbol Names Must Match.");
480 if (Symbol.Type != SI->second.Type) {
483 << "\nType Values: " << getTypeName(SI->second.Type)
488 if (Symbol.Size != SI->second.Size) {
491 << "\nSize Values: " << SI->second.Size << " "
496 if (Symbol.Weak != SI->second.Weak) {
500 << "\nWeak Values: " << SI->second.Weak << " "
520 Stub.Symbols.insert(Entry.second);
tools/llvm-jitlink/llvm-jitlink.cpp 264 if (auto EC = sys::Memory::releaseMappedMemory(KV.second))
273 auto &Block = KV.second;
289 auto &Seg = KV.second;
624 auto &JD = *std::prev(IdxToJLD.lower_bound(InputFileArgIdx))->second;
638 auto &JD = *std::prev(IdxToJLD.lower_bound(AbsDefArgIdx))->second;
tools/llvm-link/llvm-link.cpp 309 for (auto &S : I.second.SummaryList) {
tools/llvm-lipo/llvm-lipo.cpp 343 if (!Entry.second)
590 if (!Entry.second)
591 reportError(Entry.first->second->getFileName() + " and " +
756 if (!Entry.second)
tools/llvm-lto/llvm-lto.cpp 341 for (auto &Summary : Summaries.second.SummaryList) {
438 NewPrefix = Split.second.str();
tools/llvm-lto2/llvm-lto2.cpp 307 Res.push_back(I->second.front());
308 I->second.pop_front();
309 if (I->second.empty())
325 << UnusedRes.first.first << ',' << UnusedRes.first.second
tools/llvm-mc/Disassembler.cpp 53 SM.PrintMessage(SMLoc::getFromPointer(Bytes.second[Index]),
66 SM.PrintMessage(SMLoc::getFromPointer(Bytes.second[Index]),
121 ByteArray.second.clear();
126 ByteArray.second.push_back(Value.data());
171 ByteArray.second.clear();
tools/llvm-mc/llvm-mc.cpp 263 auto Val = Pair.second;
402 Ctx.addDebugPrefixMapEntry(KV.first, KV.second);
tools/llvm-mca/Views/BottleneckAnalysis.cpp 56 if (U.second && IPI.find(U.first) != IPI.end())
75 Index += countTrailingZeros(RR.second);
76 ResourceUsers[Index] = std::make_pair(IID, Use.second.getNumerator());
521 addResourceDep(U.first % Source.size(), To, Current, U.second + Cycles);
tools/llvm-mca/Views/BottleneckAnalysis.h 148 const InstructionPressureInfo &Info = IPI.find(IID)->second;
154 const InstructionPressureInfo &Info = IPI.find(IID)->second;
160 const InstructionPressureInfo &Info = IPI.find(IID)->second;
tools/llvm-mca/Views/DispatchStatistics.cpp 41 double Percentage = ((double)Entry.second / NumCycles) * 100.0;
42 TempStream << " " << Entry.first << ", " << Entry.second
tools/llvm-mca/Views/ResourcePressureView.cpp 61 R2VIndex += countTrailingZeros(RR.second);
62 ResourceUsage[R2VIndex + NumResourceUnits * SourceIdx] += Use.second;
63 ResourceUsage[R2VIndex + NumResourceUnits * Source.size()] += Use.second;
tools/llvm-mca/Views/RetireControlUnitStatistics.cpp 68 TempStream << Entry.second << " ("
69 << format("%.1f", ((double)Entry.second / NumCycles) * 100.0)
tools/llvm-mca/Views/SchedulerStatistics.cpp 115 unsigned IPC = Entry.second;
tools/llvm-mca/Views/SummaryView.cpp 58 if (RU.second.size()) {
60 ProcResourceUsage[ProcResID] += RU.second.size();
tools/llvm-mca/Views/TimelineView.cpp 50 if (!BufferInfo.first || BufferInfo.second > MCDesc.BufferSize) {
52 BufferInfo.second = MCDesc.BufferSize;
154 int BufferSize = PrintingTotals ? 0 : UsedBuffer[SourceIndex].second;
tools/llvm-objcopy/COFF/Object.cpp 37 return It->second;
57 It->second->Referenced = true;
84 return It->second;
tools/llvm-objcopy/CopyConfig.cpp 144 Old2New.second.split(NameAndFlags, ',');
170 if (Split.second.getAsInteger(0, NewAlign))
173 Split.second.str().c_str());
190 Section2Flags.second.split(SectionFlags, ',');
339 StringRef NewName = Pair.second.trim();
527 if (!Config.SymbolsToRename.insert(Old2New).second)
543 if (!Config.SectionsToRename.try_emplace(SR->OriginalName, *SR).second)
553 Config.SetSectionAlignment[NameAndAlign->first] = NameAndAlign->second;
560 if (!Config.SetSectionFlags.try_emplace(SFU->Name, *SFU).second)
601 if (ArgValue.split("=").second.empty())
tools/llvm-objcopy/ELF/ELFObjcopy.cpp 694 StringRef File = SecPair.second;
712 StringRef File = SecPair.second;
tools/llvm-objcopy/MachO/MachOWriter.cpp 473 (this->*WriteOp.second)();
tools/llvm-objdump/MachODump.cpp 296 i.second.getLength(Length);
416 DTI->second.getLength(Length);
418 DTI->second.getKind(Kind);
1515 symbol_iterator RelocSym = Reloc->second;
1665 symbol_iterator RelocSym = Reloc->second;
1742 if (!DumpSegSectName.second.empty()) {
1744 DumpSectName = DumpSegSectName.second;
7846 unwrapOrError(Sym->second.getSection(), Obj->getFileName());
7849 Name = unwrapOrError(Sym->second.getName(), Obj->getFileName());
tools/llvm-objdump/llvm-objdump.cpp 582 if (MissingSources.insert(LineInfo.FileName).second)
644 if (LineInfo.Line > LineBuffer->second.size()) {
653 OS << Delimiter << LineBuffer->second[LineInfo.Line - 1] << '\n';
781 if (!Duplex.second.empty()) {
784 Inst = Duplex.second;
789 HeadTail = HeadTail.second.split('\n');
791 OS << " } " << PacketBundle.second;
969 PltEntry.second, Saver.save((Name + "@plt").str()), SymbolType);
1043 return (It - 1)->second;
1191 AllSymbols[Sec->second].emplace_back(VA, Name, ELF::STT_NOTYPE);
1201 array_pod_sort(SecSyms.second.begin(), SecSyms.second.end());
1201 array_pod_sort(SecSyms.second.begin(), SecSyms.second.end());
1450 TargetSectionSymbols = &AllSymbols[It->second];
1637 for (SectionRef Section : P.second) {
tools/llvm-opt-report/OptReport.cpp 260 const auto &FileInfo = FI.second;
281 for (auto &FI : FLI.second)
282 for (auto &LI : FI.second)
283 MaxLI |= LI.second;
312 const auto &LineInfo = LII->second;
314 for (auto &CI : LineInfo.find(*FuncNameSet.begin())->second) {
316 ColsInfo[Col] = CI.second;
317 InlinedCols += CI.second.Inlined.Analyzed;
318 UnrolledCols += CI.second.Unrolled.Analyzed;
319 VectorizedCols += CI.second.Vectorized.Analyzed;
320 LLI |= CI.second;
402 if ((J.second.Inlined.Transformed && InlinedCols > 1) ||
403 (J.second.Unrolled.Transformed && UnrolledCols > 1) ||
404 (J.second.Vectorized.Transformed && VectorizedCols > 1)) {
406 OS << (J.second.Inlined.Transformed &&
408 OS << (J.second.Unrolled.Transformed &&
409 UnrolledCols > 1 ? "U" + UStr(J.second) :
411 OS << (J.second.Vectorized.Transformed &&
412 VectorizedCols > 1 ? "V" + VStr(J.second) :
430 const auto &FuncLineInfo = LII->second;
432 UniqueLIs[FLII.second].insert(FLII.first);
434 for (const auto &OI : FLII.second)
435 AllLI |= OI.second;
445 PrintLine(true, FSLI.second);
448 PrintLine(false, UniqueLIs.begin()->second);
tools/llvm-pdbutil/DumpOutputStyle.cpp 324 return LHS.second.Size > RHS.second.Size;
324 return LHS.second.Size > RHS.second.Size;
342 K.second.Count, K.second.Size);
342 K.second.Count, K.second.Size);
720 formatTypeLeafKind(TypeLeafKind(K.first)), K.second.Count,
721 K.second.Size, (double)K.second.Size / K.second.Count);
721 K.second.Size, (double)K.second.Size / K.second.Count);
721 K.second.Size, (double)K.second.Size / K.second.Count);
876 fmt_align(Stat.second.Count, AlignStyle::Right, CD),
877 fmt_align(Stat.second.Size, AlignStyle::Right, SD));
1351 if (auto EC = codeview::visitTypeRecord(Dep.second, Dep.first, V))
1516 TypeIndex TI(A.second);
1719 if (auto E = Visitor.visitSymbolRecord(Result.second, Result.first))
tools/llvm-pdbutil/DumpOutputStyle.h 57 if (!Iter.second)
58 Iter.first->second.update(RecordSize);
tools/llvm-pdbutil/StreamUtil.cpp 174 moduleStream(ModIter->second.Descriptor.getModuleName(), StreamIdx,
175 ModIter->second.Modi);
178 stream(StreamPurpose::NamedStream, NSIter->second, StreamIdx);
tools/llvm-profdata/llvm-profdata.cpp 156 if (Parts.first.empty() || Parts.second.empty() ||
157 Parts.second.count(' ')) {
268 bool firstTime = WC->WriterErrorCodes.insert(IPE).second;
287 bool firstTime = Dst->WriterErrorCodes.insert(IPE).second;
358 warn(toString(std::move(ErrorPair.first)), ErrorPair.second);
391 BodySample.second.getSamples());
392 for (const auto &Target : BodySample.second.getCallTargets()) {
401 for (const auto &Callsite : CallsiteSamples.second) {
403 remapSamples(Callsite.second, Remapper, Error);
838 return v1.second > v2.second;
838 return v1.second > v2.second;
896 if (HottestFuncs.top().second < FuncMax) {
977 OS << " " << hotfunc.first << ", max count = " << hotfunc.second << "\n";
tools/llvm-rc/ResourceFileWriter.cpp 491 assert(EmplaceResult.second && "Could not create a bundle");
496 insertStringIntoBundle(Iter->second, String.first, String.second));
496 insertStringIntoBundle(Iter->second, String.first, String.second));
1285 ObjectData = Iter->second.DeclTimeInfo;
1287 BundleResource Res(Iter->second);
tools/llvm-rc/ResourceScriptCppFilter.cpp 92 StringRef Ext = Line.rsplit('.').second;
tools/llvm-rc/ResourceScriptStmt.cpp 122 OS << " " << String.first << " => " << String.second << "\n";
tools/llvm-readobj/ELFDumper.cpp 380 if (Warnings.insert(Msg.str()).second)
4922 const SectionRef &RelocSec = StackSizeMapEntry.second;
tools/llvm-readobj/MachODumper.cpp 885 Data = Split.second;
tools/llvm-readobj/ObjDumper.cpp 59 NameIt->second = true;
62 IndexIt->second = true;
69 if (!S.second)
75 if (!S.second)
tools/llvm-reduce/deltas/ReduceMetadata.cpp 31 SeenNodes.insert(MD.second);
34 NodesToKeep.insert(MD.second);
48 if (!NodesToKeep.count(MDs[I].second))
110 UnnamedNodes.insert(MD.second);
tools/llvm-rtdyld/llvm-rtdyld.cpp 228 return JITSymbol(I->second, JITSymbolFlags::Exported);
447 uint64_t Size = P.second;
475 << D.second.FileName << ", line:" << D.second.Line << "\n";
475 << D.second.FileName << ", line:" << D.second.Line << "\n";
700 NextSectionAddr = Alloc.first + Alloc.second + TargetSectionSep;
830 SymInfo.setTargetAddress(I->second.getAddress());
tools/llvm-xray/func-id-helper.cpp 23 return CacheIt->second;
33 ModuleAddress.Address = It->second;
40 F << "@(" << std::hex << It->second << ")";
45 F << "@(" << std::hex << It->second << ")";
60 ModuleAddress.Address = It->second;
tools/llvm-xray/trie-node.h 76 mergeTrieNodes(*(iter->second), *Callee, Node, NodeStore, MergeFn));
85 Node->Callees.push_back(MapPairIter.second);
tools/llvm-xray/xray-account.cpp 126 if (MM.first == 0 || MM.second == 0)
129 MM = std::make_pair(std::min(MM.first, V), std::max(MM.second, V));
164 recordLatency(Top.first, diff(Top.second, Record.TSC));
211 recordLatency(E.first, diff(E.second, Record.TSC));
242 R.Max = *MinMax.second;
277 auto &Timings = FT.second;
455 if (ThreadStack.second.empty()) {
459 auto Level = ThreadStack.second.size();
460 for (const auto &Entry : llvm::reverse(ThreadStack.second))
tools/llvm-xray/xray-converter.cpp 192 for (auto node_iter : map_iter.second) {
354 (Symbolize ? FuncIdHelper.SymbolOrNumber(map_iter.second->FuncId)
355 : llvm::to_string(map_iter.second->FuncId)));
356 if (map_iter.second->Parent != nullptr)
358 map_iter.second->Parent->ExtraData.id);
tools/llvm-xray/xray-fdr-dump.cpp 105 auto &Blocks = ProcessThreadBlocks.second;
tools/llvm-xray/xray-graph-diff.cpp 232 const auto &VAttr = V.second;
237 auto &EdgeHeadID = E.first.second;
266 auto &EdgeAttr = E.second;
275 const auto &LeftStat = EdgeAttr.CorrEdgePtr[0]->second.S;
276 const auto &RightStat = EdgeAttr.CorrEdgePtr[1]->second.S;
287 auto &VertexAttr = V.second;
296 const auto &LeftStat = VertexAttr.CorrVertexPtr[0]->second.S;
297 const auto &RightStat = VertexAttr.CorrVertexPtr[1]->second.S;
318 auto &EdgeAttr = E.second;
326 const auto &LeftStat = EdgeAttr.CorrEdgePtr[0]->second.S;
327 const auto &RightStat = EdgeAttr.CorrEdgePtr[1]->second.S;
337 const auto &VertexAttr = V.second;
345 const auto &LeftStat = VertexAttr.CorrVertexPtr[0]->second.S;
346 const auto &RightStat = VertexAttr.CorrVertexPtr[1]->second.S;
356 auto &EdgeAttr = E.second;
364 const auto &LeftStat = EdgeAttr.CorrEdgePtr[0]->second.S;
365 const auto &RightStat = EdgeAttr.CorrEdgePtr[1]->second.S;
393 const auto &TailId = E.first.second;
tools/llvm-xray/xray-graph.cpp 285 auto &A = E.second;
297 auto &A = E.second;
320 auto &S = E.second.S;
324 auto &S = V.second.S;
392 const auto &S = E.second.S;
394 << "F" << E.first.second << " [label=\"" << S.getString(ET) << "\"";
404 const auto &VA = V.second;
453 auto Level = ThreadStack.second.size();
454 for (const auto &Entry : llvm::reverse(ThreadStack.second))
tools/llvm-xray/xray-registry.cpp 36 return It->second;
tools/llvm-xray/xray-stacks.cpp 433 std::max(E.second, R.TSC) - std::min(E.second, R.TSC));
433 std::max(E.second, R.TSC) - std::min(E.second, R.TSC));
437 std::max(Deepest.second, R.TSC) - std::min(Deepest.second, R.TSC));
437 std::max(Deepest.second, R.TSC) - std::min(Deepest.second, R.TSC));
440 std::max(Deepest.second, R.TSC) - std::min(Deepest.second, R.TSC));
440 std::max(Deepest.second, R.TSC) - std::min(Deepest.second, R.TSC));
485 print(OS, FN, iter.second);
496 RootVector &perThreadRoots = iter.second;
510 auto MapValueFn = [](const RootsType &Value) { return Value.second; };
527 const auto &RootNodeVector = MapIter.second;
617 return A.second > B.second;
617 return A.second > B.second;
662 OS << "Sum: " << P.second << "\n";
668 OS << "Count: " << P.second << "\n";
tools/obj2yaml/dwarf2yaml.cpp 30 for (auto AbbrvDecl : AbbrvDeclSet.second) {
54 RemainingTable = SymbolPair.second;
tools/obj2yaml/elf2yaml.cpp 108 if (!It.second)
109 Ret = (Name + " [" + Twine(++It.first->second) + "]").str();
139 if (!It.second)
141 (Name + " [" + Twine(++It.first->second) + "]").str();
tools/obj2yaml/macho2yaml.cpp 494 RemainingTable = SymbolPair.second;
tools/obj2yaml/wasm2yaml.cpp 142 Producer.Version = E.second;
148 Producer.Version = E.second;
154 Producer.Version = E.second;
tools/opt/BreakpointPrinter.cpp 54 if (!Name.empty() && Processed.insert(Name).second) {
tools/opt/Debugify.cpp 411 DebugifyStatistics Stats = Entry.second;
tools/polly/include/polly/ScopInfo.h 888 return Incoming[0].second;
1415 if (It->second.empty())
1417 return &It->second;
2397 MinMaxAliasGroups.back().second = MinMaxAccessesReadOnly;
2526 ScopArrayInfoSet.remove(It->second.get());
2830 return MapIt->second.get();
tools/polly/include/polly/ScopPass.h 219 if (S.second)
tools/polly/lib/Analysis/DependenceInfo.cpp 656 StmtScat = Lookup->second;
773 isl_map_free(ReductionDeps.second);
914 if (It->second) {
915 if (It->second->getDependenceLevel() == Level)
916 return *It->second.get();
926 return *Inserted.first->second;
932 assert(It.second && "Invalid SCoP object!");
933 recomputeDependences(It.second.get(), Dependences::AL_Access);
940 assert((It.first && It.second) && "Invalid Scop or Dependence object!\n");
941 It.second->print(OS);
tools/polly/lib/Analysis/PolyhedralInfo.cpp 105 return It.second.get();
tools/polly/lib/Analysis/ScopBuilder.cpp 348 InvalidDomainMap[BB] = InvalidDomainMap[BB].unite(PWAC.second);
790 HeaderBBDom = Parts.second;
1549 Param = extractConstantFactor(Param, SE).second;
1698 Sizes.insert(Sizes.end(), AccItr->second.Shape->DelinearizedSizes.begin(),
1699 AccItr->second.Shape->DelinearizedSizes.end());
1720 true, AccItr->second.DelinearizedSubscripts, Sizes, Val);
2157 std::vector<Instruction *> &InstList = Instructions.second;
2701 isl::map StoreAccs = CandidatePair.second->getAccessRelation();
2714 if (MA == CandidatePair.first || MA == CandidatePair.second)
2738 CandidatePair.second->markAsReductionLike(RT);
3653 Instruction *GlobalRead = GlobalReadPair.second;
3783 ORE.emit(OptimizationRemarkAnalysis(DEBUG_TYPE, "ScopEnd", End, P.second)
tools/polly/lib/Analysis/ScopDetection.cpp 411 DetectionContext &Context = It.first->second;
510 if (PtrVals.insert(BasePtrVal).second) {
857 SCEVRemoveMax::rewrite(Pair.second, SE, &MaxTerms);
870 if (auto *AF = dyn_cast<SCEVAddExpr>(Pair.second)) {
896 SE.collectParametricTerms(Pair.second, Terms);
946 const SCEV *AF = Pair.second;
974 auto *AF = Pair.second;
978 MemAcc *Acc = &TempMemoryAccesses.find(Insn)->second;
982 if (isAffine(Pair.second, Scope, Context))
983 Acc->DelinearizedSubscripts.push_back(Pair.second);
1004 invalid<ReportNonAffineAccess>(Context, /*Assert=*/true, Pair.second,
1043 auto *Scope = Pair.second;
1399 DetectionContext &Context = It.first->second;
1468 DetectionContext &Context = It.first->second;
1738 AdjacentBlockIndex = DFSStack.top().second;
1828 return &DCMIt->second;
tools/polly/lib/Analysis/ScopDetectionDiagnostic.cpp 118 if (BB == P.second)
120 if (!Seen.insert(BB).second)
156 if (P.second)
158 OptimizationRemarkMissed(DEBUG_TYPE, "InvalidScopEnd", End, P.second)
tools/polly/lib/Analysis/ScopInfo.cpp 982 isl::set NewInvalidDom = StmtDom.intersect(PWAC.second);
1350 It->second.remove(MA);
1351 if (It->second.empty())
1530 Parameter = extractConstantFactor(Parameter, *SE).second;
1729 StmtMapIt->second.erase(std::remove(StmtMapIt->second.begin(),
1729 StmtMapIt->second.erase(std::remove(StmtMapIt->second.begin(),
1730 StmtMapIt->second.end(), &Stmt),
1731 StmtMapIt->second.end());
2151 if (Pair.second.size() == 0)
2154 noOfGroups += Pair.second.size();
2166 if (Pair.second.empty()) {
2169 OS << " <" << MMANonReadOnly.first << ", " << MMANonReadOnly.second
2175 for (const MinMaxAccessTy &MMAReadOnly : Pair.second) {
2177 OS << " <" << MMAReadOnly.first << ", " << MMAReadOnly.second << ">";
2179 OS << " <" << MMANonReadOnly.first << ", " << MMANonReadOnly.second
2425 return StmtMapIt->second;
2526 return It->second;
2544 return It->second;
2744 bool Inserted = RegionToScopMap.insert({R, std::move(S)}).second;
2785 if (It.second)
2786 It.second->print(Stream, PollyPrintInstructions);
2821 if (It.second)
2822 It.second->print(OS, PollyPrintInstructions);
tools/polly/lib/Analysis/ScopPass.cpp 104 if (auto *scop = S.second.get())
119 auto *scop = S.second.get();
127 const auto &InnerAnalysisIDs = InvPair.second;
tools/polly/lib/CodeGen/BlockGenerators.cpp 407 if (Pair.second == NewInst) {
785 Val = MA->getIncoming()[0].second;
875 const auto &EscapeMappingValue = EscapeMapping.second;
876 const EscapeUserVectorTy &EscapeUsers = EscapeMappingValue.second;
992 const EscapeUserVectorTy &EscapeUsers = EscapeMapping.second.second;
992 const EscapeUserVectorTy &EscapeUsers = EscapeMapping.second.second;
1244 Value *NewVector = VecOp->second;
1516 ValueMapT &RegionMap = Inserted.first->second;
1528 addOperandToPHI(Stmt, PHINodePair.first, PHINodePair.second, BB, LTS);
1653 Value *OrigIncomingValue = Pair.second;
1676 Value *OldVal = Incoming[0].second;
tools/polly/lib/CodeGen/IRBuilder.cpp 89 Metadata *Args = {AliasScopePair.second};
tools/polly/lib/CodeGen/IslAst.cpp 164 str += " : " + ReductionClause.second.substr(2) + ")";
242 if (!MaRedPair.second)
244 RedDeps = isl_union_map_from_map(isl_map_copy(MaRedPair.second));
353 isl::pw_multi_aff ASecond = It0->second;
355 isl::pw_multi_aff BSecond = It1->second;
432 auto &MinMaxReadOnly = MinMaxAccessPair.second;
tools/polly/lib/CodeGen/IslNodeBuilder.cpp 316 Values.insert(I.second);
320 Values.insert(cast<SCEVUnknown>(I.second)->getValue());
365 IDToValue[I.first] = NewValues[I.second];
366 Inserted.insert(I.second);
373 ValueMap[I.first] = I.second;
381 return It->second;
711 NewValuesReverse[P.second] = P.first;
1339 if (!PreloadedPtrs.insert(PtrId).second)
tools/polly/lib/Exchange/JSONExporter.cpp 617 return It->second;
tools/polly/lib/Support/SCEVAffinator.cpp 71 PWAC0.second = PWAC0.second.unite(PWAC1.second);
71 PWAC0.second = PWAC0.second.unite(PWAC1.second);
71 PWAC0.second = PWAC0.second.unite(PWAC1.second);
101 PWAC.second =
102 isl::manage(isl_set_union(PWAC.second.release(), isl_set_copy(NegDom)));
140 PWAC.second = PWAC.second.unite(NotEqualSet).coalesce();
140 PWAC.second = PWAC.second.unite(NotEqualSet).coalesce();
199 Expr = ConstantAndLeftOverPair.second;
284 OpPWAC.second = OpPWAC.second.unite(isl::manage_copy(OutOfBoundsDom));
284 OpPWAC.second = OpPWAC.second.unite(isl::manage_copy(OutOfBoundsDom));
tools/polly/lib/Support/SCEVValidator.cpp 725 SE.getAddRecExpr(StartExpr, StepPair.second, AddRec->getLoop(),
738 LeftOvers.push_back(SE.getNegativeSCEV(Op0Pair.second));
740 LeftOvers.push_back(Op0Pair.second);
747 LeftOvers.push_back(OpUPair.second);
749 LeftOvers.push_back(SE.getNegativeSCEV(OpUPair.second));
tools/polly/lib/Support/VirtualInstruction.cpp 326 if (!Inserted.second)
358 S, Stmt, LI->getLoopFor(Incoming.first), Incoming.second, true);
381 if (!InsertResult.second)
tools/polly/lib/Transform/DeLICM.cpp 815 ValInst = makeValInst(Incoming[0].second, WriteStmt,
1098 PHIWriteStmt->lookupInputAccessOf(Incoming.second);
tools/polly/lib/Transform/ZoneAlgo.cpp 542 return It->second;
1042 Value *IncomingVal = Incoming[0].second;
tools/sancov/sancov.cpp 312 for (auto PointPtr : P.second) {
325 for (const CoveragePoint *Point : P.second) {
434 CoveragePoint *CoveragePoint = &Points.find(PointId)->second;
445 Coverage->Points.push_back(KV.second);
966 if (I == Result.end() || I->second > P) {
976 OS << stripPathPrefix(P.first.FileName) << ":" << P.second.first << " "
1099 CoverageByObjFile[Iter->second].push_back(FileName);
1103 auto FileName = Pair.second;
1118 for (const std::string &CoverageFile : Pair.second) {
tools/verify-uselistorder/verify-uselistorder.cpp 385 if (!Seen.insert(V).second)
427 if (!Seen.insert(V).second)
unittests/ADT/APIntTest.cpp 2601 APInt B(64, X.second);
2607 APInt B(64, X.second);
unittests/ADT/BitVectorTest.cpp 822 V.set(R.first, R.second);
unittests/ADT/DenseMapTest.cpp 40 EXPECT_TRUE(Constructed.insert(this).second);
43 EXPECT_TRUE(Constructed.insert(this).second);
46 EXPECT_TRUE(Constructed.insert(this).second);
146 EXPECT_EQ(this->getValue(), it->second);
538 EXPECT_EQ(1u, map.find(0)->second);
539 EXPECT_EQ(2u, map.find(1)->second);
540 EXPECT_EQ(3u, map.find(2)->second);
544 EXPECT_EQ(1u, map.find_as("a")->second);
545 EXPECT_EQ(2u, map.find_as("b")->second);
546 EXPECT_EQ(3u, map.find_as("c")->second);
587 EXPECT_TRUE(Try1.second);
589 EXPECT_FALSE(Try2.second);
unittests/ADT/FallibleIteratorTest.cpp 52 if (C[Idx].second == ValidLink) {
63 if (C[Idx].second == ValidLink)
unittests/ADT/HashingTest.cpp 180 EXPECT_EQ(Idx, I->second);
188 EXPECT_EQ(Idx, I->second);
196 EXPECT_EQ(Idx, I->second);
204 EXPECT_EQ(Idx, I->second);
unittests/ADT/MapVectorTest.cpp 23 EXPECT_EQ(R.first->second, 2);
24 EXPECT_TRUE(R.second);
38 EXPECT_EQ(I->second, 2);
48 EXPECT_EQ(R.first->second, 2);
49 EXPECT_TRUE(R.second);
54 EXPECT_EQ(R.first->second, 2);
55 EXPECT_FALSE(R.second);
60 EXPECT_EQ(R.first->second, 5);
61 EXPECT_TRUE(R.second);
74 EXPECT_EQ(R.first->second, 7);
75 EXPECT_TRUE(R.second);
116 MV.remove_if([](const std::pair<int, int> &Val) { return Val.second % 2; });
156 ASSERT_EQ(*MV.find(2)->second, 2);
179 EXPECT_EQ(R.first->second, 2);
180 EXPECT_TRUE(R.second);
186 EXPECT_EQ(R.first->second, 2);
187 EXPECT_FALSE(R.second);
205 EXPECT_EQ(R.first->second, 2);
206 EXPECT_TRUE(R.second);
211 EXPECT_EQ(R.first->second, 2);
212 EXPECT_FALSE(R.second);
217 EXPECT_EQ(R.first->second, 5);
218 EXPECT_TRUE(R.second);
231 EXPECT_EQ(R.first->second, 7);
232 EXPECT_TRUE(R.second);
273 MV.remove_if([](const std::pair<int, int> &Val) { return Val.second % 2; });
313 ASSERT_EQ(*MV.find(2)->second, 2);
323 EXPECT_EQ(R.first->second, 2);
324 EXPECT_TRUE(R.second);
329 EXPECT_EQ(R.first->second, 2);
330 EXPECT_FALSE(R.second);
335 EXPECT_EQ(R.first->second, 5);
336 EXPECT_TRUE(R.second);
349 EXPECT_EQ(R.first->second, 7);
350 EXPECT_TRUE(R.second);
391 MV.remove_if([](const std::pair<int, int> &Val) { return Val.second % 2; });
unittests/ADT/SparseMultiSetTest.cpp 174 USet::iterator E = RangePair.second;
unittests/ADT/SparseSetTest.cpp 46 EXPECT_TRUE(IP.second);
62 EXPECT_FALSE(IP.second);
106 EXPECT_FALSE(IP.second);
203 ASSERT_TRUE(Set.insert(i).second);
unittests/ADT/StatisticTest.cpp 114 EXPECT_EQ(S1->second, 2u);
117 EXPECT_EQ(S2->second, 1u);
159 EXPECT_EQ(S1->second, 1u);
162 EXPECT_EQ(S2->second, 1u);
unittests/ADT/StringMapTest.cpp 290 EXPECT_TRUE(try1.second);
295 EXPECT_FALSE(try2.second);
unittests/ADT/StringRefTest.cpp 28 OS << "(" << P.first << ", " << P.second << ")";
unittests/ADT/TestGraph.h 119 Nodes[FromIdx].second.AddNode(ToIdx);
152 Reachable = Reachable.Join(Nodes[i].second);
225 return ChildIterator(Parent - Parent->first, Parent->second);
unittests/Analysis/DivergenceAnalysisTest.cpp 297 auto ItDivJoins = ItCase.second.begin();
304 if (ItDivJoins != ItCase.second.end() && &BB == *ItDivJoins) {
unittests/Analysis/UnrollAnalyzerTest.cpp 108 EXPECT_EQ(cast<ConstantInt>((*I1).second)->getZExtValue(), 1U);
113 EXPECT_FALSE(cast<ConstantInt>((*I2).second)->getZExtValue());
119 EXPECT_EQ(cast<ConstantInt>((*I1).second)->getZExtValue(), TripCount);
124 EXPECT_TRUE(cast<ConstantInt>((*I2).second)->getZExtValue());
217 EXPECT_EQ(cast<ConstantInt>((*I1).second)->getZExtValue(), 5U);
220 EXPECT_EQ(cast<ConstantInt>((*I2).second)->getZExtValue(), 1U);
262 EXPECT_EQ(cast<ConstantInt>((*I1).second)->getZExtValue(), 0U);
312 EXPECT_EQ(cast<ConstantInt>((*I1).second)->getZExtValue(), 259U);
315 EXPECT_EQ(cast<ConstantInt>((*I2).second)->getZExtValue(), 259U);
318 EXPECT_EQ(cast<ConstantInt>((*I3).second)->getZExtValue(), 3U);
unittests/Analysis/ValueTrackingTest.cpp 940 auto M = parseModule(std::string("@test = global ") + GetParam().second);
unittests/CodeGen/GlobalISel/GISelMITest.h 144 MF = getMFFromMMI(ModuleMMIPair.first.get(), ModuleMMIPair.second.get());
unittests/DebugInfo/DWARF/DWARFDebugInfoTest.cpp 1854 for (auto it = Val1Range.first; it != Val1Range.second; ++it)
1855 EXPECT_EQ(it->second, AbbrevPtrVal1);
1856 EXPECT_EQ(DIEs.find(Val2)->second, AbbrevPtrVal2);
unittests/DebugInfo/GSYM/GSYMTest.cpp 67 EXPECT_TRUE(R.second);
68 EXPECT_EQ(R.first->second, Index1);
70 EXPECT_FALSE(R.second);
71 EXPECT_EQ(R.first->second, Index1);
73 EXPECT_TRUE(R.second);
74 EXPECT_EQ(R.first->second, Index2);
76 EXPECT_FALSE(R.second);
77 EXPECT_EQ(R.first->second, Index2);
unittests/DebugInfo/PDB/PDBApiTest.cpp 449 EXPECT_EQ(item->first == Tag, llvm::isa<ExpectedType>(*item->second));
459 EXPECT_EQ(should_match, llvm::isa<PDBSymbolUnknown>(*item->second));
unittests/ExecutionEngine/Orc/CoreAPIsTest.cpp 33 EXPECT_EQ(I->second.getAddress(), FooAddr)
865 EXPECT_EQ(I->second.getAddress(), FooSym.getAddress())
1007 EXPECT_EQ(F.getSymbols().find(&JD)->second, Names)
unittests/ExecutionEngine/Orc/LegacyAPIInteropTest.cpp 30 if (!KV.second.isStrong())
unittests/ExecutionEngine/Orc/LegacyRTDyldObjectLinkingLayerTest.cpp 138 auto R = std::move(I->second);
unittests/ExecutionEngine/Orc/RPCUtilsTest.cpp 179 DummyRPCEndpoint Server(*Channels.second);
227 EXPECT_EQ(Channels.second->SendCalls, 2U)
234 DummyRPCEndpoint Server(*Channels.second);
279 DummyRPCEndpoint Server(*Channels.second);
324 DummyRPCEndpoint Server(*Channels.second);
370 DummyRPCEndpoint Server(*Channels.second);
421 DummyRPCEndpoint Server(*Channels.second);
461 DummyRPCEndpoint Server(*Channels.second);
533 DummyRPCEndpoint Server(*Channels.second);
576 DummyRPCEndpoint Server(*Channels.second);
621 DummyRPCEndpoint Server(*Channels.second);
650 DummyRPCEndpoint Server(*Channels.second);
685 DummyRPCEndpoint Server(*Channels.second);
717 DummyRPCEndpoint Server(*Channels.second);
753 DummyRPCEndpoint Server(*Channels.second);
835 DummyRPCEndpoint Server(*Channels.second);
872 DummyRPCEndpoint Server(*Channels.second);
885 DummyRPCEndpoint Server(*Channels.second);
unittests/ExecutionEngine/Orc/RemoteObjectLayerTest.cpp 56 if (auto Sym = KV.second(Name, ExportedSymbolsOnly))
68 return LI->second(Name, ExportedSymbolsOnly);
133 RPCEndpoint ServerEP(*Channels.second, true);
187 RPCEndpoint ServerEP(*Channels.second, true);
239 RPCEndpoint ServerEP(*Channels.second, true);
289 RPCEndpoint ServerEP(*Channels.second, true);
345 RPCEndpoint ServerEP(*Channels.second, true);
427 RPCEndpoint ServerEP(*Channels.second, true);
502 RPCEndpoint ServerEP(*Channels.second, true);
553 RPCEndpoint ServerEP(*Channels.second, true);
unittests/IR/MetadataTest.cpp 2718 EXPECT_EQ(SP, MDs[0].second);
2719 EXPECT_EQ(P, MDs[1].second);
2720 EXPECT_EQ(T1, MDs[2].second);
2721 EXPECT_EQ(T2, MDs[3].second);
unittests/IR/ValueMapTest.cpp 91 EXPECT_TRUE(InsertResult1.second);
97 EXPECT_FALSE(InsertResult2.second);
unittests/ProfileData/CoverageMappingTest.cpp 142 UseMultipleReaders = GetParam().second;
164 return R->second;
194 FileIDs[E.second] = E.first;
unittests/Remarks/RemarksAPITest.cpp 112 EXPECT_EQ(StrTab.add(R.PassName).second.data(), R2.PassName.data());
113 EXPECT_EQ(StrTab.add(R.RemarkName).second.data(), R2.RemarkName.data());
114 EXPECT_EQ(StrTab.add(R.FunctionName).second.data(), R2.FunctionName.data());
115 EXPECT_EQ(StrTab.add(R.Loc->SourceFilePath).second.data(),
117 EXPECT_EQ(StrTab.add(R.Args.back().Key).second.data(),
119 EXPECT_EQ(StrTab.add(R.Args.back().Val).second.data(),
121 EXPECT_EQ(StrTab.add(R.Args.back().Loc->SourceFilePath).second.data(),
unittests/Support/BinaryStreamTest.cpp 450 ASSERT_EQ(Pairs[0].second, Iter->second);
450 ASSERT_EQ(Pairs[0].second, Iter->second);
453 ASSERT_EQ(Pairs[1].second, Iter->second);
453 ASSERT_EQ(Pairs[1].second, Iter->second);
unittests/Support/ItaniumManglingCanonicalizerTest.cpp 317 EXPECT_TRUE(Found.insert({ClassKey, *Class.begin()}).second)
unittests/Support/JSONTest.cpp 217 EXPECT_EQ(fixUTF8(Invalid.first), Invalid.second);
unittests/Support/Path.cpp 288 StringRef LastComponent = *path::rbegin(Path.first, Path.second);
301 StringRef LastComponent = *path::rbegin(Path.first, Path.second);
303 EXPECT_TRUE(path::is_separator(LastComponent[0], Path.second));
unittests/Support/ReverseIterationTest.cpp 103 ASSERT_EQ(std::get<0>(Tuple).second, std::get<1>(Tuple)->value);
108 ASSERT_EQ(iter->second, Keys[i]->value);
unittests/Support/ScaledNumberTest.cpp 21 ScaledPair(const std::pair<UIntT, int16_t> &F) : D(F.first), S(F.second) {}
unittests/Support/TargetParserTest.cpp 597 std::find(std::begin(Features), std::end(Features), E.second.at(0));
604 Found = std::find(std::begin(Features), std::end(Features), E.second.at(1));
unittests/Support/VirtualFileSystemTest.cpp 60 return I->second;
82 if (I->second.isSymlink()) {
111 vfs::directory_entry(I->second.getName(), I->second.getType());
111 vfs::directory_entry(I->second.getName(), I->second.getType());
121 vfs::directory_entry(I->second.getName(), I->second.getType());
121 vfs::directory_entry(I->second.getName(), I->second.getType());
unittests/TextAPI/TextStubV4Tests.cpp 214 File.addUUID(uuids[0].first, uuids[0].second);
215 File.addUUID(uuids[1].first, uuids[1].second);
unittests/XRay/FDRBlockIndexerTest.cpp 69 EXPECT_THAT(T1Blocks->second,
74 EXPECT_THAT(T2Blocks->second, ElementsAre(Field(&BlockIndexer::Block::Records,
unittests/XRay/FDRBlockVerifierTest.cpp 62 auto &Blocks = ProcessThreadBlocks.second;
unittests/XRay/FDRRecordsTest.cpp 71 ASSERT_THAT(T1Blocks->second.size(), Eq(2u));
74 ASSERT_THAT(T2Blocks->second.size(), Eq(1u));
138 auto &Blocks = ProcessThreadBlocks.second;
153 auto &Blocks = ProcessThreadBlocks.second;
unittests/XRay/GraphTest.cpp 83 EXPECT_EQ(VA[VVT.first], VVT.second.VA);
100 EXPECT_EQ(VA[u.first] * VA[u.second] * ((u.first > u.second) ? 2 : 1),
100 EXPECT_EQ(VA[u.first] * VA[u.second] * ((u.first > u.second) ? 2 : 1),
110 EXPECT_EQ(VA[EV.first.first] * VA[EV.first.second] *
111 ((EV.first.first > EV.first.second) ? 2 : 1),
112 EV.second.EA);
113 const auto &IE = G.inEdges(EV.first.second);
121 G.inEdges(EV.first.second).begin(), G.inEdges(EV.first.second).end(),
121 G.inEdges(EV.first.second).begin(), G.inEdges(EV.first.second).end(),
123 EXPECT_NE(G.inEdges(EV.first.second).end(), It);
133 std::find_if(G.outEdges(EV.first.second).begin(),
134 G.outEdges(EV.first.second).end(),
136 EXPECT_EQ(G.outEdges(EV.first.second).end(), It);
217 EXPECT_EQ(1u, G.vertices().begin()->second.VA);
246 EXPECT_EQ(2u, G.edges().begin()->second.EA);
251 EXPECT_EQ(2u, G.outEdges(0u).begin()->second.EA);
257 EXPECT_EQ(2u, G.inEdges(0u).begin()->second.EA);
usr/include/c++/7.4.0/bits/hashtable.h 1718 _M_rehash(__do_rehash.second, __saved_state);
1756 _M_rehash(__do_rehash.second, __saved_state);
usr/include/c++/7.4.0/bits/hashtable_policy.h 728 return __h->_M_insert_unique_node(__n, __code, __p)->second;
731 return __p->_M_v().second;
753 return __h->_M_insert_unique_node(__n, __code, __p)->second;
756 return __p->_M_v().second;
893 __h._M_rehash(__do_rehash.second, __saved_state);
usr/include/c++/7.4.0/bits/regex.h 900 ? string_type(this->first, this->second)
usr/include/c++/7.4.0/bits/regex.tcc 88 __it.first = __it.second = __e;
95 __pre.second = __s;
98 __suf.second = __e;
103 __pre.second = __res[0].first;
104 __pre.matched = (__pre.first != __pre.second);
105 __suf.first = __res[0].second;
106 __suf.second = __e;
107 __suf.matched = (__suf.first != __suf.second);
116 __it.first = __it.second = __e;
320 && ((__it.second
323 return __it.second;
usr/include/c++/7.4.0/bits/regex_automaton.tcc 220 auto __v = __it.second;
usr/include/c++/7.4.0/bits/regex_compiler.tcc 433 __last_char.second = _M_value[0];
438 __last_char.second = '-';
443 __matcher._M_add_char(__last_char.second);
463 __matcher._M_add_char(__last_char.second);
466 __last_char.second = __ch;
472 __matcher._M_add_char(__last_char.second);
530 __matcher._M_make_range(__last_char.second, _M_value[0]);
535 __matcher._M_make_range(__last_char.second, '-');
622 if (_M_translator._M_match_range(__it.first, __it.second, __s))
usr/include/c++/7.4.0/bits/regex_executor.tcc 129 _M_cur_results = std::move(__task.second);
179 if (__rep_count.second == 0 || __rep_count.first != _M_current)
183 __rep_count.second = 1;
189 if (__rep_count.second < 2)
191 __rep_count.second++;
193 __rep_count.second--;
267 __res.second = _M_current;
355 __last != _M_end && __tmp != __submatch.second;
359 __submatch.second)
usr/include/c++/7.4.0/bits/regex_scanner.h 120 return &__it->second;
usr/include/c++/7.4.0/bits/regex_scanner.tcc 186 _M_token = __it->second;
usr/include/c++/7.4.0/bits/stl_algo.h 3845 std::iter_swap(__i++, __first + __pospos.second);
usr/include/c++/7.4.0/bits/stl_map.h 499 return (*__i).second;
515 return (*__i).second;
534 return (*__i).second;
543 return (*__i).second;
usr/include/c++/7.4.0/bits/stl_pair.h 292 : first(__p.first), second(__p.second) { }
362 second(std::forward<_U2>(__p.second)) { }
384 second = __p.second;
384 second = __p.second;
397 second = std::forward<second_type>(__p.second);
397 second = std::forward<second_type>(__p.second);
408 second = __p.second;
408 second = __p.second;
419 second = std::forward<_U2>(__p.second);
419 second = std::forward<_U2>(__p.second);
430 swap(second, __p.second);
430 swap(second, __p.second);
449 { return __x.first == __y.first && __x.second == __y.second; }
449 { return __x.first == __y.first && __x.second == __y.second; }
456 || (!(__y.first < __x.first) && __x.second < __y.second); }
456 || (!(__y.first < __x.first) && __x.second < __y.second); }
usr/include/c++/7.4.0/bits/stl_set.h 503 return std::pair<iterator, bool>(__p.first, __p.second);
512 return std::pair<iterator, bool>(__p.first, __p.second);
usr/include/c++/7.4.0/bits/stl_tempbuf.h 253 _M_len = __p.second;
usr/include/c++/7.4.0/bits/stl_tree.h 2093 if (__res.second)
2096 return _Res(_M_insert_(__res.first, __res.second,
2120 return _M_insert_(__res.first, __res.second,
2203 if (__res.second)
2204 return _M_insert_(__res.first, __res.second,
2285 if (__res.second)
2286 return _M_insert_(__res.first, __res.second,
2357 if (__res.second)
2358 return _Res(_M_insert_node(__res.first, __res.second, __z), true);
2382 return _M_insert_node(__res.first, __res.second, __z);
2404 if (__res.second)
2405 return _M_insert_node(__res.first, __res.second, __z);
2430 if (__res.second)
2431 return _M_insert_node(__res.first, __res.second, __z);
2502 _M_erase_aux(__p.first, __p.second);
2549 const size_type __n = std::distance(__p.first, __p.second);
usr/include/c++/7.4.0/tuple 1051 std::forward<_U2>(__in.second)) { }
1244 this->_M_tail(*this)._M_head(*this) = __in.second;
1253 this->_M_tail(*this)._M_head(*this) = std::forward<_U2>(__in.second);
usr/include/c++/7.4.0/utility 210 { return __pair.second; }
220 { return __pair.second; }
utils/TableGen/AsmMatcherEmitter.cpp 283 if (Visited.insert(Super).second)
784 return I == SubtargetFeatures.end() ? nullptr : &I->second;
818 if (Ops.second == "")
828 start = Ops.second.find_first_of('$');
831 Ops.second = Ops.second.slice(start + 1, std::string::npos);
831 Ops.second = Ops.second.slice(start + 1, std::string::npos);
832 end = Ops.second.find_last_of(" \t");
844 int DstAsmOperand = findAsmOperandNamed(Ops.second);
852 Ops.second + "'.");
1088 Tok[0] == '$' && !OperandNames.insert(Tok).second) {
1330 RegisterClasses[it->first] = RegisterSetClasses[it->second];
1461 unsigned OpMask = OCM.second;
1477 LLVM_DEBUG(Pair.second.dump());
1724 Op->SubOpIdx = Idx.second;
1744 Op.SubOpIdx = CGA.ResultInstOperandIndex[i].second;
1842 SrcOp2 = findAsmOperandNamed(Name, Insert.first->second);
1847 Insert.first->second = SrcOp2;
1861 int SubIdx = CGA.ResultInstOperandIndex[AliasOpNo].second;
1876 int SubIdx = CGA.ResultInstOperandIndex[AliasOpNo].second;
1914 if (T.second != -1 && findAsmOperandNamed(T.first, T.second) != -1)
1914 if (T.second != -1 && findAsmOperandNamed(T.first, T.second) != -1)
2271 OS << " " << KV.second << ",\n";
2277 OS << " /* " << KV.second << " */ { "
2330 OS << TiedOpndEnum->second << ", ";
2497 << RC.first->getName() << ": OpKind = " << RC.second->Name
2656 if (!OpClassEntry.second->DiagnosticType.empty())
2657 Types.insert(OpClassEntry.second->DiagnosticType);
2660 if (!OpClassEntry.second->DiagnosticType.empty())
2661 Types.insert(OpClassEntry.second->DiagnosticType);
2681 const SubtargetFeatureInfo &SFI = SF.second;
2741 const std::vector<Record*> &ToVec = AliasEntry.second;
3379 OS << I->second.getEnumBitName() << ", ";
utils/TableGen/AsmWriterEmitter.cpp 84 AsmWriterOperand TheOp = OpsToPrint.back().second;
90 if (OpsToPrint[i-1].second == TheOp) {
746 if (LHS.second == RHS.second) {
746 if (LHS.second == RHS.second) {
753 return LHS.second > RHS.second;
753 return LHS.second > RHS.second;
802 for (auto &Alias : Aliases.second) {
995 std::vector<IAPrinter> &IAPs = Entry.second;
utils/TableGen/CTagsEmitter.cpp 71 Tags.push_back(Tag(C.first, locate(C.second.get())));
73 Tags.push_back(Tag(D.first, locate(D.second.get())));
utils/TableGen/CodeEmitterGen.cpp 147 if (SO.second == 0) {
277 Case += getInstructionCaseForEncoding(R, KV.second, Target);
413 BitsInit *BI = KV.second->getValueAsBitsInit("Inst");
503 std::vector<std::string> &InstList = IE->second;
556 FeatureBitsets.back().push_back(I->second.TheDef);
596 o << I->second.getEnumBitName() << ", ";
618 o << '_' << I->second.TheDef->getName();
utils/TableGen/CodeGenDAGPatterns.cpp 78 if (I.second.size() > 1)
80 if (!AllowEmpty && I.second.empty())
93 MVT T = I.second.empty() ? MVT::Other : *I.second.begin();
93 MVT T = I.second.empty() ? MVT::Other : *I.second.begin();
103 if (!I.second.empty())
118 Changed |= getOrCreate(M).insert(P.second).second;
118 Changed |= getOrCreate(M).insert(P.second).second;
122 DT = P.second;
131 Changed |= I.second.insert(DT).second;
131 Changed |= I.second.insert(DT).second;
151 SetType &S = I.second;
153 Changed |= intersect(I.second, VTS.get(M));
166 Changed |= berase_if(I.second, [&P](MVT VT) { return !P(VT); });
175 for (auto J : I.second)
335 AllEmpty &= I.second.empty();
369 TypeSetByHwMode::SetType &S = I.second;
748 expandOverloads(I.second, LegalTypes);
812 LegalTypes.insert(I.second);
1425 if (P.second == MVT::isVoid)
1457 MVT T = P.second;
2358 MVT::SimpleValueType VT = P.second.SimpleTy;
3160 if (!getSDNodeTransform(Transform).second.empty()) // not noop xform?
3660 return P.second;
3671 if (InstResultIter == InstResults.end() || !InstResultIter->second)
3674 TreePatternNodePtr RNode = InstResultIter->second;
3691 InstResultIter->second = nullptr;
3827 DAGInstruction &TheInst = Entry.second;
3847 if (Rec.second++ == 0)
3911 SrcNames[Entry.first].second == 1)
4646 const MultipleUseVarSet &DepVars = it.second.first;
4647 const std::vector<TreePatternNodePtr> &Variants = it.second.second;
4647 const std::vector<TreePatternNodePtr> &Variants = it.second.second;
utils/TableGen/CodeGenDAGPatterns.h 206 return Map.insert({Mode,SetType()}).first->second;
214 return isDefaultOnly() && Map.begin()->second.size() == 1;
220 return *Map.begin()->second.begin();
1187 return F->second;
1195 return F->second;
1207 return F->second;
1237 return F->second;
1244 return F->second.get();
1250 return F->second.get();
1274 return F->second;
utils/TableGen/CodeGenHwModes.cpp 50 dbgs() << " (" << P.first << ',' << P.second->getName() << ')';
74 assert(P.second);
90 return F->second;
110 P.second.dump();
utils/TableGen/CodeGenInstruction.cpp 127 if (!OperandNames.insert(ArgName).second)
245 if (!Ops[Op.first].Constraints[Op.second].isNone())
249 Ops[Op.first].Constraints[Op.second] =
300 if (!Ops[SrcOp.first].Constraints[SrcOp.second].isNone())
318 Ops[SrcOp.first].Constraints[SrcOp.second] = NewConstraint;
343 DisableEncoding = P.second;
350 if (Op.second >= OperandList[Op.first].DoNotEncode.size())
351 OperandList[Op.first].DoNotEncode.resize(Op.second+1);
352 OperandList[Op.first].DoNotEncode[Op.second] = true;
496 Selection = Selection.split('|').second;
utils/TableGen/CodeGenInstruction.h 189 return OperandList[Op.first].MIOperandNo + Op.second;
207 if (OperandList[Op.first].DoNotEncode.size() > Op.second)
208 return OperandList[Op.first].DoNotEncode[Op.second];
utils/TableGen/CodeGenMapTable.cpp 541 std::vector<Init*> FieldValues = Entry.second;
utils/TableGen/CodeGenRegisters.cpp 116 M |= C.second->computeLaneMask();
258 CodeGenRegister *SR = SubReg.second;
281 if (!SubRegs.insert(std::make_pair(Idx, SR)).second)
299 if (!SubRegs.insert(SR).second)
300 Orphans.insert(SR.second);
324 if (SubRegs.count(I->second) || !Orphans.erase(SRI->second))
324 if (SubRegs.count(I->second) || !Orphans.erase(SRI->second))
327 SubRegs.insert(std::make_pair(I->second, SRI->second));
327 SubRegs.insert(std::make_pair(I->second, SRI->second));
328 Indices.push_back(I->second);
353 if (Orphans.erase(SubReg.second))
354 SubRegs[RegBank.getCompositeSubRegIndex(Idx, SubReg.first)] = SubReg.second;
359 if (SubReg.second == this) {
373 SubReg2Idx.insert(std::make_pair(SubReg.second, SubReg.first)).first;
374 if (Ins->second == SubReg.first)
381 SubReg.second->getName() + " available as " +
382 SubReg.first->getName() + " and " + Ins->second->getName());
521 if (!SubRegs.insert(NewSubReg).second)
534 CodeGenRegister *NewSubReg = NewSubRegs[i].second;
537 CodeGenSubRegIndex *SubIdx = getSubRegIndex(SI->second);
540 SI->second->getName() + " in " + getName());
556 I->second->computeSuperRegs(RegBank);
566 Id.push_back(I->second->TopoSig);
569 if (!I->second->SuperRegs.empty() && I->second->SuperRegs.back() == this)
569 if (!I->second->SuperRegs.empty() && I->second->SuperRegs.back() == this)
571 I->second->SuperRegs.push_back(this);
588 OSet.insert(I->second);
680 NewReg->addSuperClass(SuperPair.first, SuperPair.second);
1040 const BitVector &SuperRegClassBV = SuperRegClassPair.second;
1073 for (CodeGenRegisterClass *RC : FindI->second)
1176 const CodeGenRegister *SR = P.second;
1254 return FoundI->second;
1331 SubRegAction[P.first].insert({&R, P.second});
1342 auto F = Img2.find(P.second);
1344 C.insert({P.first, F->second});
1358 if (F == Map2.end() || P.second != F->second)
1358 if (F == Map2.end() || P.second != F->second)
1385 CodeGenRegister *Reg2 = i1->second;
1394 CodeGenRegister *Reg3 = i2->second;
1484 const CodeGenSubRegIndex *Composite = C->second;
1716 if (SRI->second == Reg)
1719 Changed |= normalizeWeight(SRI->second, UberSets, RegSets,
2052 CodeGenRegister *SubReg = S->second;
2058 const CodeGenRegister *SubRegister = S->second;
2188 sortAndUniqueRegisters(I.second);
2200 if (I->second.size() == RC->getMembers().size()) {
2206 getOrCreateSubClass(RC, &I->second,
2237 const CodeGenRegister *Sub = Super->getSubRegs().find(&SubIdx)->second;
2259 if (SubRC.contains(SSPairs[i].second))
2410 if (!Set.count(I->second)) {
utils/TableGen/CodeGenRegisters.h 103 return I == Composed.end() ? nullptr : I->second;
122 return (Ins.second || Ins.first->second == B) ? nullptr
122 return (Ins.second || Ins.first->second == B) ? nullptr
123 : Ins.first->second;
662 return TopoSigs.insert(std::make_pair(Id, TopoSigs.size())).first->second;
utils/TableGen/CodeGenSchedule.cpp 155 std::for_each(Range1.first, Range1.second, HandleNonGeneric);
156 std::for_each(Range2.first, Range2.second, HandleNonGeneric);
251 PrintNote(It->second->getLoc(), "Previous declaration was here.");
333 unsigned ProcIndex = ProcModelMap.find(SchedModel)->second;
357 OpcodeMasks[OpcodeIdx].second |= PredMask;
358 OpcodeInfo &OI = OpcodeMappings[OpcodeIdx].second;
385 if (LhsMasks.second != RhsMasks.second)
385 if (LhsMasks.second != RhsMasks.second)
386 return LessThan(LhsMasks.second, RhsMasks.second);
386 return LessThan(LhsMasks.second, RhsMasks.second);
397 Fn.addOpcode(Info.first, std::move(Info.second));
418 STIPredicateFunction &PreviousDef = STIPredicates[It->second];
546 if (!ProcModelMap.insert(std::make_pair(ModelKey, ProcModels.size())).second)
567 if (!RWSet.insert(RWDef).second)
1058 unsigned SCIdx = Pos->second;
1065 ArrayRef<Record*> InstDefs = Entry.second;
1209 ProcModels[I->second].ItinRWDefs.push_back(RWDef);
utils/TableGen/CodeGenSchedule.h 483 return ProcModels[I->second];
489 return ProcModels[I->second];
utils/TableGen/CodeGenTarget.cpp 419 return I->second.get();
446 const CodeGenInstruction *CGI = I.second.get();
utils/TableGen/CodeGenTarget.h 151 return *I->second;
utils/TableGen/DAGISelMatcher.cpp 87 delete C.second;
92 delete C.second;
175 C.second->print(OS, indent+2);
190 C.second->print(OS, indent+2);
utils/TableGen/DAGISelMatcher.h 481 Matcher *getCaseMatcher(unsigned i) { return Cases[i].second; }
482 const Matcher *getCaseMatcher(unsigned i) const { return Cases[i].second; }
531 Matcher *getCaseMatcher(unsigned i) { return Cases[i].second; }
532 const Matcher *getCaseMatcher(unsigned i) const { return Cases[i].second; }
utils/TableGen/DAGISelMatcherEmitter.cpp 78 return It->second;
956 const std::string &Code = Entry.second;
utils/TableGen/DAGISelMatcherGen.cpp 176 TreePattern &TP = *CGP.pf_begin()->second;
601 unsigned RecNodeEntry = MatchedComplexPatterns[i].second;
873 AddMatcher(new EmitCopyToRegMatcher(PhysRegInputs[i].second,
utils/TableGen/DAGISelMatcherOpt.cpp 397 assert(Opcodes.insert(COM->getOpcode().getEnumName()).second &&
423 Matcher *PrevMatcher = Cases[Entry-1].second;
431 Cases[Entry-1].second = new ScopeMatcher(Entries);
441 if (ScopeMatcher *SM = dyn_cast<ScopeMatcher>(M.second)) {
444 M.second = Scope.release();
445 assert(M.second && "null matcher");
454 MatcherPtr->setNext(Cases[0].second);
utils/TableGen/DFAEmitter.cpp 69 for (state_type &ToState : I->second) {
120 Table.add(T.second.second);
120 Table.add(T.second.second);
127 OS << "{" << P.first << ", " << P.second << "}";
150 dfa_state_type To = KV.second.first;
151 action_type A = KV.first.second;
152 unsigned InfoIdx = Table.get(KV.second.second);
152 unsigned InfoIdx = Table.get(KV.second.second);
297 if (SeenStates.emplace(NewState).second)
utils/TableGen/DFAPacketizerEmitter.cpp 411 emitForItineraries(OS, KV.second, KV.first);
523 if (SeenStates.emplace(NewState).second)
utils/TableGen/ExegesisEmitter.cpp 46 return It->second;
83 if (!Seen.insert(ResourceName).second)
93 NameAndIndex.second = Index++;
149 OS << " \"" << NameAndIndex.first << "\", // " << NameAndIndex.second
utils/TableGen/FastISelEmitter.cpp 643 const InstructionMemo &Memo = PI->second;
701 const OpcodeTypeRetPredMap &OTM = OI->second;
706 const TypeRetPredMap &TM = I->second;
715 const RetPredMap &RM = TI->second;
720 const PredMap &PM = RI->second;
772 const PredMap &PM = RM.begin()->second;
831 llvm::sort(MI->second);
832 MI->second.erase(std::unique(MI->second.begin(), MI->second.end()),
832 MI->second.erase(std::unique(MI->second.begin(), MI->second.end()),
832 MI->second.erase(std::unique(MI->second.begin(), MI->second.end()),
833 MI->second.end());
838 for (unsigned i = 0, e = MI->second.size(); i != e; ++i) {
840 MI->second[i].emitImmediatePredicate(OS, ImmediatePredicates);
842 MI->second[i].PrintManglingSuffix(OS, ImmediatePredicates);
844 if (!MI->second[i].empty())
846 MI->second[i].PrintArguments(OS);
utils/TableGen/FixedLenDecoderEmitter.cpp 308 return *(FilterChooserMap.find((unsigned)-1)->second);
633 Owner->AllInstructions, Inst.second,
706 Filter.second->emitTableEntries(TableInfo);
1143 for (const auto &Op : Operands.find(Opc)->second) {
1214 while (!pairs.second.empty()) {
1217 pairs = pairs.second.split(',');
1843 TiedNames[InOutOperands[i].second] = InOutOperands[SO.first].second;
1843 TiedNames[InOutOperands[i].second] = InOutOperands[SO.first].second;
1844 TiedNames[InOutOperands[SO.first].second] = InOutOperands[i].second;
1844 TiedNames[InOutOperands[SO.first].second] = InOutOperands[i].second;
1930 << ": " << Name << "(" << SO.first << ", " << SO.second
1946 getArg(SO.second);
1993 if (!NumberedInsnOperands[Op.second].empty()) {
1995 NumberedInsnOperands[Op.second].begin(),
1996 NumberedInsnOperands[Op.second].end());
1999 if (!NumberedInsnOperands[TiedNames[Op.second]].empty()) {
2000 if (!NumberedInsnOperandsNoTie.count(TiedNames[Op.second])) {
2002 unsigned i = CGI.Operands.getOperandNamed(TiedNames[Op.second]);
2005 i = CGI.Operands.getOperandNamed(Op.second);
2013 InsnOperands.push_back(NumberedInsnOperands[TiedNames[Op.second]]
2014 [SO.second]);
2039 if (const RecordVal *EncodedValue = EncodingDef.getValue(Op.second))
2068 if (Var->getName() != Op.second &&
2069 Var->getName() != TiedNames[Op.second]) {
2420 NumberedEncodings.emplace_back(KV.second, NumberedInstruction,
2469 i, IndexOfInstruction.find(Def)->second);
2480 FilterChooser FC(NumberedEncodingsRef, Opc.second, Operands,
2481 8 * Opc.first.second, this);
utils/TableGen/GlobalISel/CodeExpansions.h 27 bool Inserted = Expansions.try_emplace(Name, Expansion).second;
utils/TableGen/GlobalISelEmitter.cpp 569 return I->second;
1204 return MatchTable::NamedValue(getTy().getCxxEnumValue(), VI->second);
1673 VI->second);
2871 MergeInsnIDs.push_back(IDMatcherPair.second);
2997 return I->second;
3037 return *I->second;
3090 InsnIDs.push_back(Pair.second);
3764 OM.addPredicate<ComplexPatternOperandMatcher>(OM, *ComplexPattern->second);
3947 DstMIBuilder.addRenderer<CustomRenderer>(*I->second, Child->getName());
4062 *ComplexPattern->second, DstChild->getName(),
4168 assert(SrcRCDstRCPair->second && "Couldn't find a matching subclass");
4170 InsertPt, DstMIBuilder.getInsnID(), 0, *SrcRCDstRCPair->second);
4260 assert(SrcRCDstRCPair->second && "Couldn't find a matching subclass");
4745 assert(SrcRCDstRCPair->second && "Couldn't find a matching subclass");
4746 M.addAction<ConstrainOperandToRegClassAction>(0, 0, *SrcRCDstRCPair->second);
5120 return !X.second.mustRecomputePerFunction();
5126 return X.second.mustRecomputePerFunction();
5200 OS << I->second.getEnumBitName() << ", ";
utils/TableGen/InfoByHwMode.cpp 35 auto I = Map.insert({P.first, MVT(llvm::getValueType(P.second))});
36 assert(I.second && "Duplicate entry?");
66 return F->second;
71 return Map.insert(std::make_pair(Mode, D->second)).first->second;
71 return Map.insert(std::make_pair(Mode, D->second)).first->second;
73 return Map.insert(std::make_pair(Mode, Type)).first->second;
97 << ':' << getMVTName(P->second).str() << ')';
148 auto I = Map.insert({P.first, RegSizeInfo(P.second, CGH)});
149 assert(I.second && "Duplicate entry?");
188 OS << '(' << getModeName(P->first) << ':' << P->second << ')';
198 assert(P.second && P.second->isSubClassOf("InstructionEncoding") &&
198 assert(P.second && P.second->isSubClassOf("InstructionEncoding") &&
200 auto I = Map.insert({P.first, P.second});
201 assert(I.second && "Duplicate entry?");
utils/TableGen/InfoByHwMode.h 98 return F->second;
108 return Map.begin()->second;
utils/TableGen/InstrInfoEmitter.cpp 239 OpList[I->second] = Info.MIOperandNo;
276 OS << " " << Op.first << " = " << Op.second << ",\n";
300 OS << (OpList.count(i) == 0 ? -1 : (int)OpList.find(i)->second) << ", ";
309 for (const std::string &Name : Entry.second)
741 OS << "OperandInfo" << OpInfo.find(OperandInfo)->second;
utils/TableGen/IntrinsicEmitter.cpp 637 OS << " case " << I->second << ": {\n";
655 switch (intrinsic.ArgumentAttributes[ai].second) {
864 if (!BIM.insert(std::make_pair(BuiltinName, Ints[i].EnumName)).second)
926 for (const auto &P : I->second) {
927 OS << " {Intrinsic::" << P.second << ", "
utils/TableGen/OptParserEmitter.cpp 130 Twine(NewPrefix)).str())).second)
145 OS << I->second;
utils/TableGen/PseudoLoweringEmitter.cpp 281 if (D.second->isSubClassOf(ExpansionClass) &&
282 D.second->isSubClassOf(InstructionClass))
283 Insts.push_back(D.second.get());
utils/TableGen/RISCVCompressInstEmitter.cpp 780 if (D.second->isSubClassOf(CompressClass))
781 Insts.push_back(D.second.get());
utils/TableGen/RegisterInfoEmitter.cpp 392 for (unsigned i = I->second.size(), e = maxLength; i != e; ++i)
393 I->second.push_back(-1);
414 int DwarfRegNo = I->second[i];
422 OS << " { " << I->first << "U, " << getQualifiedName(I->second)
465 RegIter->second = AliasIter->second;
465 RegIter->second = AliasIter->second;
480 int RegNo = I->second[i];
677 if (Entry && Entry != I.second)
684 assert((!Entry || Entry == I.second) &&
686 Entry = I.second;
1670 << " = " << P.second->getName() << '\n';
utils/TableGen/SearchableTableEmitter.cpp 200 return Index.Fields[0].Enum->EntryMap[EnumEntry]->second;
250 int64_t LHSv = Field.Enum->EntryMap[LHSr]->second;
251 int64_t RHSv = Field.Enum->EntryMap[RHSr]->second;
287 OS << " " << Entry->first << " = " << Entry->second << ",\n";
349 OS << ", " << Entry.second << " },\n";
592 Enum.Entries[i]->second = i;
714 GenericTable &Table = *It->second;
723 Record *Class = NameRec.second.get();
utils/TableGen/SequenceToOffsetTable.h 96 I->second = Entries;
108 return I->second + (I->first.size() - Seq.size());
119 OS << " /* " << I->second << " */ ";
utils/TableGen/SubtargetEmitter.cpp 387 if (!ItinsDefSet.insert(ProcModel.ItinsDef).second)
566 if (!ItinsDefSet.insert(ItinsDef).second)
utils/TableGen/SubtargetFeatureInfo.cpp 58 const SubtargetFeatureInfo &SFI = SF.second;
71 if (IndexUB <= SF.second.Index)
72 IndexUB = SF.second.Index+1;
78 Names[SF.second.Index] = SF.second.getEnumName();
78 Names[SF.second.Index] = SF.second.getEnumName();
101 const SubtargetFeatureInfo &SFI = SF.second;
119 const SubtargetFeatureInfo &SFI = SF.second;
143 if (Comma.second.empty())
147 Comma = Comma.second.split(',');
utils/TableGen/WebAssemblyDisassemblerEmitter.cpp 55 if (CGIP.second) {
60 auto IsCanonicalExisting = CGIP.second->TheDef->getValue("IsCanonical")
74 if (CGIP.second->AsmString.size() <= CGI.AsmString.size())
97 if (PrefixPair.second.empty())
102 auto InstIt = PrefixPair.second.find(I);
103 if (InstIt != PrefixPair.second.end()) {
105 assert(InstIt->second.second);
105 assert(InstIt->second.second);
106 auto &CGI = *InstIt->second.second;
106 auto &CGI = *InstIt->second.second;
110 OS << " { " << InstIt->second.first << ", ET_Instruction, ";
163 if (PrefixPair.second.empty() || !PrefixPair.first)
utils/TableGen/X86DisassemblerTables.cpp 853 const char *Type = stringForOperandType(OperandList[i].second);
utils/TableGen/X86EVEX2VEXTablesEmitter.cpp 64 << ", X86::" << Pair.second->TheDef->getName() << " },\n";
utils/TableGen/X86FoldTablesEmitter.cpp 628 RegInsts.find(Opc)->second;
utils/benchmark/src/benchmark_register.cc 284 AddRange(&arglists[i], ranges[i].first, ranges[i].second,
utils/benchmark/src/console_reporter.cc 153 auto const& s = HumanReadableNumber(c.second.value, 1000);
155 if (c.second.flags & Counter::kIsRate) {
161 const char* unit = (c.second.flags & Counter::kIsRate) ? "/s" : "";
utils/benchmark/src/counter.cc 33 c.second.value = Finish(c.second, cpu_time, num_threads);
33 c.second.value = Finish(c.second, cpu_time, num_threads);
42 c.second.value = c.second + it->second;
42 c.second.value = c.second + it->second;
42 c.second.value = c.second + it->second;
49 (*l)[tc.first] = tc.second;
utils/benchmark/src/csv_reporter.cc 143 Out << "," << it->second;
utils/benchmark/src/json_reporter.cc 197 << FormatKV(c.first, c.second);
utils/benchmark/src/statistics.cc 116 counter_stats.insert({cnt.first, {cnt.second, std::vector<double>{}}});
118 it->second.s.reserve(reports.size());
120 CHECK_EQ(counter_stats[cnt.first].c.flags, cnt.second.flags);
138 it->second.s.emplace_back(cnt.second);
138 it->second.s.emplace_back(cnt.second);
167 const auto uc_stat = Stat.compute_(kv.second.s);
utils/unittest/googlemock/include/gmock/gmock-matchers.h 1601 SafeMatcherCast<T>(matchers.second)));
3044 second_matcher_.Matches(a_pair.second);
3054 if (!second_matcher_.MatchAndExplain(a_pair.second,
utils/unittest/googlemock/src/gmock-matchers.cc 321 << "matcher #" << it->second << ")";
351 << " is matched by matcher #" << matches[mi].second;
utils/unittest/googlemock/src/gmock-spec-builders.cc 560 if (it->second.leakable) // The user said it's fine to leak this object.
566 const MockObjectState& state = it->second;
751 FunctionMockers& mockers = it->second.function_mockers;
utils/unittest/googletest/include/gtest/gtest-printers.h 683 UniversalPrinter<T2>::Print(value.second, os);
utils/unittest/googletest/include/gtest/internal/gtest-internal.h 576 return it->second;
utils/unittest/googletest/src/gtest.cc 1092 if (it != ids_.end()) return it->second;
1159 *os << it->first << it->second << "\n";