|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
examples/Kaleidoscope/BuildingAJIT/Chapter1/toy.cpp 994 const std::string &VarName = VarNames[i].first;
1029 NamedValues[VarNames[i].first] = OldBindings[i];
examples/Kaleidoscope/BuildingAJIT/Chapter2/toy.cpp 994 const std::string &VarName = VarNames[i].first;
1029 NamedValues[VarNames[i].first] = OldBindings[i];
examples/Kaleidoscope/BuildingAJIT/Chapter3/toy.cpp 993 const std::string &VarName = VarNames[i].first;
1028 NamedValues[VarNames[i].first] = OldBindings[i];
examples/Kaleidoscope/BuildingAJIT/Chapter4/toy.cpp 979 const std::string &VarName = VarNames[i].first;
1014 NamedValues[VarNames[i].first] = OldBindings[i];
examples/Kaleidoscope/BuildingAJIT/Chapter5/toy.cpp 1003 const std::string &VarName = VarNames[i].first;
1038 NamedValues[VarNames[i].first] = OldBindings[i];
examples/Kaleidoscope/Chapter7/toy.cpp 999 const std::string &VarName = VarNames[i].first;
1034 NamedValues[VarNames[i].first] = OldBindings[i];
examples/Kaleidoscope/Chapter8/toy.cpp 998 const std::string &VarName = VarNames[i].first;
1033 NamedValues[VarNames[i].first] = OldBindings[i];
examples/Kaleidoscope/Chapter9/toy.cpp 348 NamedVar.second->dump(indent(out, ind) << NamedVar.first << ':', ind + 1);
1163 const std::string &VarName = VarNames[i].first;
1200 NamedValues[VarNames[i].first] = OldBindings[i];
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;
27506 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
40867 if (MnemonicRange.first == MnemonicRange.second)
40870 for (const OperandMatchEntry *it = MnemonicRange.first,
gen/lib/Target/AArch64/AArch64GenDAGISel.inc115495 return SelectArithImmed(N, Result[NextRes+0].first, Result[NextRes+1].first);
115495 return SelectArithImmed(N, Result[NextRes+0].first, Result[NextRes+1].first);
115498 return SelectArithImmed(N, Result[NextRes+0].first, Result[NextRes+1].first);
115498 return SelectArithImmed(N, Result[NextRes+0].first, Result[NextRes+1].first);
115501 return SelectArithExtendedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115501 return SelectArithExtendedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115504 return SelectNegArithImmed(N, Result[NextRes+0].first, Result[NextRes+1].first);
115504 return SelectNegArithImmed(N, Result[NextRes+0].first, Result[NextRes+1].first);
115507 return SelectArithShiftedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115507 return SelectArithShiftedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115510 return SelectArithExtendedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115510 return SelectArithExtendedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115513 return SelectNegArithImmed(N, Result[NextRes+0].first, Result[NextRes+1].first);
115513 return SelectNegArithImmed(N, Result[NextRes+0].first, Result[NextRes+1].first);
115516 return SelectArithShiftedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115516 return SelectArithShiftedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115519 return SelectAddrModeWRO<16>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115519 return SelectAddrModeWRO<16>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115519 return SelectAddrModeWRO<16>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115519 return SelectAddrModeWRO<16>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115522 return SelectAddrModeXRO<16>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115522 return SelectAddrModeXRO<16>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115522 return SelectAddrModeXRO<16>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115522 return SelectAddrModeXRO<16>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115525 return SelectAddrModeIndexed16(N, Result[NextRes+0].first, Result[NextRes+1].first);
115525 return SelectAddrModeIndexed16(N, Result[NextRes+0].first, Result[NextRes+1].first);
115528 return SelectAddrModeUnscaled128(N, Result[NextRes+0].first, Result[NextRes+1].first);
115528 return SelectAddrModeUnscaled128(N, Result[NextRes+0].first, Result[NextRes+1].first);
115531 return SelectAddrModeWRO<32>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115531 return SelectAddrModeWRO<32>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115531 return SelectAddrModeWRO<32>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115531 return SelectAddrModeWRO<32>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115534 return SelectAddrModeXRO<32>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115534 return SelectAddrModeXRO<32>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115534 return SelectAddrModeXRO<32>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115534 return SelectAddrModeXRO<32>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115537 return SelectAddrModeIndexed32(N, Result[NextRes+0].first, Result[NextRes+1].first);
115537 return SelectAddrModeIndexed32(N, Result[NextRes+0].first, Result[NextRes+1].first);
115540 return SelectAddrModeWRO<64>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115540 return SelectAddrModeWRO<64>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115540 return SelectAddrModeWRO<64>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115540 return SelectAddrModeWRO<64>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115543 return SelectAddrModeXRO<64>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115543 return SelectAddrModeXRO<64>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115543 return SelectAddrModeXRO<64>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115543 return SelectAddrModeXRO<64>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115546 return SelectAddrModeIndexed64(N, Result[NextRes+0].first, Result[NextRes+1].first);
115546 return SelectAddrModeIndexed64(N, Result[NextRes+0].first, Result[NextRes+1].first);
115549 return SelectAddrModeWRO<8>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115549 return SelectAddrModeWRO<8>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115549 return SelectAddrModeWRO<8>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115549 return SelectAddrModeWRO<8>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115552 return SelectAddrModeXRO<8>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115552 return SelectAddrModeXRO<8>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115552 return SelectAddrModeXRO<8>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115552 return SelectAddrModeXRO<8>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115555 return SelectAddrModeIndexed8(N, Result[NextRes+0].first, Result[NextRes+1].first);
115555 return SelectAddrModeIndexed8(N, Result[NextRes+0].first, Result[NextRes+1].first);
115558 return SelectAddrModeIndexed7S32(N, Result[NextRes+0].first, Result[NextRes+1].first);
115558 return SelectAddrModeIndexed7S32(N, Result[NextRes+0].first, Result[NextRes+1].first);
115561 return SelectAddrModeWRO<128>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115561 return SelectAddrModeWRO<128>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115561 return SelectAddrModeWRO<128>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115561 return SelectAddrModeWRO<128>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115564 return SelectAddrModeXRO<128>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115564 return SelectAddrModeXRO<128>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115564 return SelectAddrModeXRO<128>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115564 return SelectAddrModeXRO<128>(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
115567 return SelectAddrModeIndexed128(N, Result[NextRes+0].first, Result[NextRes+1].first);
115567 return SelectAddrModeIndexed128(N, Result[NextRes+0].first, Result[NextRes+1].first);
115570 return SelectAddrModeUnscaled64(N, Result[NextRes+0].first, Result[NextRes+1].first);
115570 return SelectAddrModeUnscaled64(N, Result[NextRes+0].first, Result[NextRes+1].first);
115573 return SelectAddrModeIndexed7S64(N, Result[NextRes+0].first, Result[NextRes+1].first);
115573 return SelectAddrModeIndexed7S64(N, Result[NextRes+0].first, Result[NextRes+1].first);
115576 return SelectAddrModeUnscaled32(N, Result[NextRes+0].first, Result[NextRes+1].first);
115576 return SelectAddrModeUnscaled32(N, Result[NextRes+0].first, Result[NextRes+1].first);
115579 return SelectAddrModeUnscaled16(N, Result[NextRes+0].first, Result[NextRes+1].first);
115579 return SelectAddrModeUnscaled16(N, Result[NextRes+0].first, Result[NextRes+1].first);
115582 return SelectAddrModeUnscaled8(N, Result[NextRes+0].first, Result[NextRes+1].first);
115582 return SelectAddrModeUnscaled8(N, Result[NextRes+0].first, Result[NextRes+1].first);
115585 return SelectAddrModeIndexedU6S128(N, Result[NextRes+0].first, Result[NextRes+1].first);
115585 return SelectAddrModeIndexedU6S128(N, Result[NextRes+0].first, Result[NextRes+1].first);
115588 return SelectCVTFixedPosOperand<32>(N, Result[NextRes+0].first);
115591 return SelectCVTFixedPosOperand<64>(N, Result[NextRes+0].first);
115594 return SelectCVTFixedPosOperand<32>(N, Result[NextRes+0].first);
115597 return SelectCVTFixedPosOperand<64>(N, Result[NextRes+0].first);
115600 return SelectCVTFixedPosOperand<32>(N, Result[NextRes+0].first);
115603 return SelectCVTFixedPosOperand<64>(N, Result[NextRes+0].first);
115606 return SelectLogicalShiftedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115606 return SelectLogicalShiftedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115609 return SelectLogicalShiftedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115609 return SelectLogicalShiftedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115612 return SelectAddrModeIndexedS9S128(N, Result[NextRes+0].first, Result[NextRes+1].first);
115612 return SelectAddrModeIndexedS9S128(N, Result[NextRes+0].first, Result[NextRes+1].first);
115615 return SelectAddrModeIndexed7S128(N, Result[NextRes+0].first, Result[NextRes+1].first);
115615 return SelectAddrModeIndexed7S128(N, Result[NextRes+0].first, Result[NextRes+1].first);
115618 return SelectArithExtendedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
115618 return SelectArithExtendedRegister(N, Result[NextRes+0].first, Result[NextRes+1].first);
gen/lib/Target/AArch64/AArch64GenGICombiner.inc 57 const auto First = getRuleIdxForIdentifier(RangePair.first);
67 const auto I = getRuleIdxForIdentifier(RangePair.first);
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;
24034 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
80419 if (MnemonicRange.first == MnemonicRange.second)
80422 for (const OperandMatchEntry *it = MnemonicRange.first,
gen/lib/Target/AMDGPU/AMDGPUGenDAGISel.inc79673 return SelectVOP3PMods0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79673 return SelectVOP3PMods0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79673 return SelectVOP3PMods0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79676 return SelectVOP3PMods(N, Result[NextRes+0].first, Result[NextRes+1].first);
79676 return SelectVOP3PMods(N, Result[NextRes+0].first, Result[NextRes+1].first);
79679 return SelectSMRDImm(N, Result[NextRes+0].first, Result[NextRes+1].first);
79679 return SelectSMRDImm(N, Result[NextRes+0].first, Result[NextRes+1].first);
79682 return SelectSMRDImm32(N, Result[NextRes+0].first, Result[NextRes+1].first);
79682 return SelectSMRDImm32(N, Result[NextRes+0].first, Result[NextRes+1].first);
79685 return SelectSMRDSgpr(N, Result[NextRes+0].first, Result[NextRes+1].first);
79685 return SelectSMRDSgpr(N, Result[NextRes+0].first, Result[NextRes+1].first);
79688 return SelectDS1Addr1Offset(N, Result[NextRes+0].first, Result[NextRes+1].first);
79688 return SelectDS1Addr1Offset(N, Result[NextRes+0].first, Result[NextRes+1].first);
79691 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first, Result[NextRes+8].first);
79691 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first, Result[NextRes+8].first);
79691 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first, Result[NextRes+8].first);
79691 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first, Result[NextRes+8].first);
79691 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first, Result[NextRes+8].first);
79691 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first, Result[NextRes+8].first);
79691 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first, Result[NextRes+8].first);
79691 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first, Result[NextRes+8].first);
79691 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first, Result[NextRes+8].first);
79694 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first);
79694 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first);
79694 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first);
79694 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first);
79694 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first);
79694 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first);
79694 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first);
79694 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first, Result[NextRes+6].first, Result[NextRes+7].first);
79697 return SelectMUBUFScratchOffset(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79697 return SelectMUBUFScratchOffset(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79697 return SelectMUBUFScratchOffset(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79700 return SelectMUBUFScratchOffen(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79700 return SelectMUBUFScratchOffen(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79700 return SelectMUBUFScratchOffen(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79700 return SelectMUBUFScratchOffen(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79703 return SelectFlatOffset<true>(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79703 return SelectFlatOffset<true>(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79703 return SelectFlatOffset<true>(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79706 return SelectFlatOffset<false>(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79706 return SelectFlatOffset<false>(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79706 return SelectFlatOffset<false>(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79709 return SelectDS64Bit4ByteAligned(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79709 return SelectDS64Bit4ByteAligned(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79709 return SelectDS64Bit4ByteAligned(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79712 return SelectSMRDBufferImm(N, Result[NextRes+0].first);
79715 return SelectSMRDBufferImm32(N, Result[NextRes+0].first);
79718 return SelectVOP3Mods0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79718 return SelectVOP3Mods0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79718 return SelectVOP3Mods0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79718 return SelectVOP3Mods0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79721 return SelectVOP3Mods(N, Result[NextRes+0].first, Result[NextRes+1].first);
79721 return SelectVOP3Mods(N, Result[NextRes+0].first, Result[NextRes+1].first);
79724 return SelectVOP3Mods0Clamp0OMod(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79724 return SelectVOP3Mods0Clamp0OMod(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79724 return SelectVOP3Mods0Clamp0OMod(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79724 return SelectVOP3Mods0Clamp0OMod(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79727 return SelectVOP3OpSelMods0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79727 return SelectVOP3OpSelMods0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79727 return SelectVOP3OpSelMods0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79730 return SelectVOP3OpSelMods(N, Result[NextRes+0].first, Result[NextRes+1].first);
79730 return SelectVOP3OpSelMods(N, Result[NextRes+0].first, Result[NextRes+1].first);
79733 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79733 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79733 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79736 return SelectFlatAtomic(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79736 return SelectFlatAtomic(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79736 return SelectFlatAtomic(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79739 return SelectFlatAtomicSigned(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79739 return SelectFlatAtomicSigned(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79739 return SelectFlatAtomicSigned(Root, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79742 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
79742 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
79742 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
79742 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
79742 return SelectMUBUFAddr64(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
79745 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79745 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79745 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79745 return SelectMUBUFOffset(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first);
79748 return SelectVOP3Mods_f32(N, Result[NextRes+0].first, Result[NextRes+1].first);
79748 return SelectVOP3Mods_f32(N, Result[NextRes+0].first, Result[NextRes+1].first);
79751 return SelectMOVRELOffset(N, Result[NextRes+0].first, Result[NextRes+1].first);
79751 return SelectMOVRELOffset(N, Result[NextRes+0].first, Result[NextRes+1].first);
79754 return SelectVOP3OpSel0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79754 return SelectVOP3OpSel0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79754 return SelectVOP3OpSel0(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79757 return SelectVOP3OpSel(N, Result[NextRes+0].first, Result[NextRes+1].first);
79757 return SelectVOP3OpSel(N, Result[NextRes+0].first, Result[NextRes+1].first);
79760 return SelectVOP3Mods_NNaN(N, Result[NextRes+0].first, Result[NextRes+1].first);
79760 return SelectVOP3Mods_NNaN(N, Result[NextRes+0].first, Result[NextRes+1].first);
79763 return SelectVOP3NoMods(N, Result[NextRes+0].first);
79766 return SelectVOP3PMadMixMods(N, Result[NextRes+0].first, Result[NextRes+1].first);
79766 return SelectVOP3PMadMixMods(N, Result[NextRes+0].first, Result[NextRes+1].first);
79769 return SelectVOP3OMods(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79769 return SelectVOP3OMods(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
79769 return SelectVOP3OMods(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
gen/lib/Target/AMDGPU/R600GenDAGISel.inc12594 return SelectADDRIndirect(N, Result[NextRes+0].first, Result[NextRes+1].first);
12594 return SelectADDRIndirect(N, Result[NextRes+0].first, Result[NextRes+1].first);
12597 return SelectADDRVTX_READ(N, Result[NextRes+0].first, Result[NextRes+1].first);
12597 return SelectADDRVTX_READ(N, Result[NextRes+0].first, Result[NextRes+1].first);
12600 return SelectGlobalValueConstantOffset(N, Result[NextRes+0].first);
12603 return SelectGlobalValueVariableOffset(N, Result[NextRes+0].first, Result[NextRes+1].first);
12603 return SelectGlobalValueVariableOffset(N, Result[NextRes+0].first, Result[NextRes+1].first);
gen/lib/Target/ARC/ARCGenDAGISel.inc 1230 return SelectAddrModeFar(N, Result[NextRes+0].first, Result[NextRes+1].first);
1230 return SelectAddrModeFar(N, Result[NextRes+0].first, Result[NextRes+1].first);
1233 return SelectAddrModeS9(N, Result[NextRes+0].first, Result[NextRes+1].first);
1233 return SelectAddrModeS9(N, Result[NextRes+0].first, Result[NextRes+1].first);
1236 return SelectAddrModeImm(N, Result[NextRes+0].first, Result[NextRes+1].first);
1236 return SelectAddrModeImm(N, Result[NextRes+0].first, Result[NextRes+1].first);
1239 return SelectCMOVPred(N, Result[NextRes+0].first, Result[NextRes+1].first);
1239 return SelectCMOVPred(N, Result[NextRes+0].first, Result[NextRes+1].first);
1242 return SelectFrameADDR_ri(N, Result[NextRes+0].first, Result[NextRes+1].first);
1242 return SelectFrameADDR_ri(N, Result[NextRes+0].first, Result[NextRes+1].first);
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)
16356 for (const OperandMatchEntry *it = MnemonicRange.first,
gen/lib/Target/ARM/ARMGenDAGISel.inc54880 return SelectShiftImmShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first);
54880 return SelectShiftImmShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first);
54883 return SelectRegShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54883 return SelectRegShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54883 return SelectRegShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54886 return SelectAddLikeOr(Parent, N, Result[NextRes+0].first);
54889 return SelectImmShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first);
54889 return SelectImmShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first);
54892 return SelectAddrOffsetNone(N, Result[NextRes+0].first);
54895 return SelectAddrMode3(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54895 return SelectAddrMode3(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54895 return SelectAddrMode3(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54898 return SelectThumbAddrModeImm5S2(N, Result[NextRes+0].first, Result[NextRes+1].first);
54898 return SelectThumbAddrModeImm5S2(N, Result[NextRes+0].first, Result[NextRes+1].first);
54901 return SelectThumbAddrModeRR(N, Result[NextRes+0].first, Result[NextRes+1].first);
54901 return SelectThumbAddrModeRR(N, Result[NextRes+0].first, Result[NextRes+1].first);
54904 return SelectShiftRegShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54904 return SelectShiftRegShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54904 return SelectShiftRegShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54907 return SelectShiftImmShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first);
54907 return SelectShiftImmShifterOperand(N, Result[NextRes+0].first, Result[NextRes+1].first);
54910 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
54910 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
54913 return SelectAddrMode6Offset(Root, N, Result[NextRes+0].first);
54916 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
54916 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
54919 return SelectAddrModePC(N, Result[NextRes+0].first, Result[NextRes+1].first);
54919 return SelectAddrModePC(N, Result[NextRes+0].first, Result[NextRes+1].first);
54922 return SelectAddrMode2OffsetReg(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
54922 return SelectAddrMode2OffsetReg(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
54925 return SelectAddrMode2OffsetImm(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
54925 return SelectAddrMode2OffsetImm(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
54928 return SelectAddrMode3Offset(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
54928 return SelectAddrMode3Offset(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
54931 return SelectLdStSOReg(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54931 return SelectLdStSOReg(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54931 return SelectLdStSOReg(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54934 return SelectT2AddrModeSoReg(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54934 return SelectT2AddrModeSoReg(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54934 return SelectT2AddrModeSoReg(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
54937 return SelectT2AddrModeImm8Offset(Root, N, Result[NextRes+0].first);
54940 return SelectAddrMode5(N, Result[NextRes+0].first, Result[NextRes+1].first);
54940 return SelectAddrMode5(N, Result[NextRes+0].first, Result[NextRes+1].first);
54943 return SelectAddrModeImm12(N, Result[NextRes+0].first, Result[NextRes+1].first);
54943 return SelectAddrModeImm12(N, Result[NextRes+0].first, Result[NextRes+1].first);
54946 return SelectThumbAddrModeSP(N, Result[NextRes+0].first, Result[NextRes+1].first);
54946 return SelectThumbAddrModeSP(N, Result[NextRes+0].first, Result[NextRes+1].first);
54949 return SelectThumbAddrModeImm5S4(N, Result[NextRes+0].first, Result[NextRes+1].first);
54949 return SelectThumbAddrModeImm5S4(N, Result[NextRes+0].first, Result[NextRes+1].first);
54952 return SelectThumbAddrModeImm5S1(N, Result[NextRes+0].first, Result[NextRes+1].first);
54952 return SelectThumbAddrModeImm5S1(N, Result[NextRes+0].first, Result[NextRes+1].first);
54955 return SelectT2AddrModeImm12(N, Result[NextRes+0].first, Result[NextRes+1].first);
54955 return SelectT2AddrModeImm12(N, Result[NextRes+0].first, Result[NextRes+1].first);
54958 return SelectT2AddrModeImm8(N, Result[NextRes+0].first, Result[NextRes+1].first);
54958 return SelectT2AddrModeImm8(N, Result[NextRes+0].first, Result[NextRes+1].first);
54961 return SelectAddrMode5FP16(N, Result[NextRes+0].first, Result[NextRes+1].first);
54961 return SelectAddrMode5FP16(N, Result[NextRes+0].first, Result[NextRes+1].first);
54964 return SelectT2AddrModeImm7<0>(N, Result[NextRes+0].first, Result[NextRes+1].first);
54964 return SelectT2AddrModeImm7<0>(N, Result[NextRes+0].first, Result[NextRes+1].first);
54967 return SelectT2AddrModeImm7<1>(N, Result[NextRes+0].first, Result[NextRes+1].first);
54967 return SelectT2AddrModeImm7<1>(N, Result[NextRes+0].first, Result[NextRes+1].first);
54970 return SelectT2AddrModeImm7<2>(N, Result[NextRes+0].first, Result[NextRes+1].first);
54970 return SelectT2AddrModeImm7<2>(N, Result[NextRes+0].first, Result[NextRes+1].first);
54973 return SelectT2AddrModeImm7Offset<0>(Root, N, Result[NextRes+0].first);
54976 return SelectT2AddrModeImm7Offset<1>(Root, N, Result[NextRes+0].first);
54979 return SelectT2AddrModeImm7Offset<2>(Root, N, Result[NextRes+0].first);
54982 return SelectTAddrModeImm7<0>(N, Result[NextRes+0].first, Result[NextRes+1].first);
54982 return SelectTAddrModeImm7<0>(N, Result[NextRes+0].first, Result[NextRes+1].first);
54985 return SelectTAddrModeImm7<1>(N, Result[NextRes+0].first, Result[NextRes+1].first);
54985 return SelectTAddrModeImm7<1>(N, Result[NextRes+0].first, Result[NextRes+1].first);
54988 return SelectCMOVPred(N, Result[NextRes+0].first, Result[NextRes+1].first);
54988 return SelectCMOVPred(N, Result[NextRes+0].first, Result[NextRes+1].first);
54991 return SelectThumbAddrModeRRSext(N, Result[NextRes+0].first, Result[NextRes+1].first);
54991 return SelectThumbAddrModeRRSext(N, Result[NextRes+0].first, Result[NextRes+1].first);
54994 return SelectT2AddrModeExclusive(N, Result[NextRes+0].first, Result[NextRes+1].first);
54994 return SelectT2AddrModeExclusive(N, Result[NextRes+0].first, Result[NextRes+1].first);
54997 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
54997 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
55000 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
55000 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
55003 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
55003 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
55006 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
55006 return SelectAddrMode6(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first);
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;
1359 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
1512 if (MnemonicRange.first == MnemonicRange.second)
1515 for (const OperandMatchEntry *it = MnemonicRange.first,
gen/lib/Target/AVR/AVRGenDAGISel.inc 1735 return SelectAddr(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
1735 return SelectAddr(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
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;
1002 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
gen/lib/Target/BPF/BPFGenDAGISel.inc 2115 return SelectAddr(N, Result[NextRes+0].first, Result[NextRes+1].first);
2115 return SelectAddr(N, Result[NextRes+0].first, Result[NextRes+1].first);
2118 return SelectFIAddr(N, Result[NextRes+0].first, Result[NextRes+1].first);
2118 return SelectFIAddr(N, Result[NextRes+0].first, Result[NextRes+1].first);
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;
10348 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
gen/lib/Target/Hexagon/HexagonGenDAGISel.inc72912 return SelectAddrFI(N, Result[NextRes+0].first);
72915 return SelectAddrGP(N, Result[NextRes+0].first);
72918 return SelectAnyImm3(N, Result[NextRes+0].first);
72921 return SelectAnyImm0(N, Result[NextRes+0].first);
72924 return SelectAnyImm1(N, Result[NextRes+0].first);
72927 return SelectAnyImm2(N, Result[NextRes+0].first);
72930 return SelectAnyImm(N, Result[NextRes+0].first);
72933 return SelectAnyInt(N, Result[NextRes+0].first);
72936 return DetectUseSxtw(N, Result[NextRes+0].first);
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;
1143 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
1320 if (MnemonicRange.first == MnemonicRange.second)
1323 for (const OperandMatchEntry *it = MnemonicRange.first,
gen/lib/Target/Lanai/LanaiGenDAGISel.inc 1523 return selectAddrRi(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
1523 return selectAddrRi(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
1523 return selectAddrRi(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
1526 return selectAddrRr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
1526 return selectAddrRr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
1526 return selectAddrRr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
1529 return selectAddrSpls(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
1529 return selectAddrSpls(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
1529 return selectAddrSpls(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
1532 return selectAddrSls(N, Result[NextRes+0].first);
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;
1201 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
gen/lib/Target/MSP430/MSP430GenDAGISel.inc 4896 return SelectAddr(N, Result[NextRes+0].first, Result[NextRes+1].first);
4896 return SelectAddr(N, Result[NextRes+0].first, Result[NextRes+1].first);
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;
8177 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
11692 if (MnemonicRange.first == MnemonicRange.second)
11695 for (const OperandMatchEntry *it = MnemonicRange.first,
gen/lib/Target/Mips/MipsGenDAGISel.inc30490 return selectAddrRegImm(N, Result[NextRes+0].first, Result[NextRes+1].first);
30490 return selectAddrRegImm(N, Result[NextRes+0].first, Result[NextRes+1].first);
30493 return selectIntAddr(N, Result[NextRes+0].first, Result[NextRes+1].first);
30493 return selectIntAddr(N, Result[NextRes+0].first, Result[NextRes+1].first);
30496 return selectAddrDefault(N, Result[NextRes+0].first, Result[NextRes+1].first);
30496 return selectAddrDefault(N, Result[NextRes+0].first, Result[NextRes+1].first);
30499 return selectAddr16(N, Result[NextRes+0].first, Result[NextRes+1].first);
30499 return selectAddr16(N, Result[NextRes+0].first, Result[NextRes+1].first);
30502 return selectAddr16SP(N, Result[NextRes+0].first, Result[NextRes+1].first);
30502 return selectAddr16SP(N, Result[NextRes+0].first, Result[NextRes+1].first);
30505 return selectIntAddrLSL2MM(N, Result[NextRes+0].first, Result[NextRes+1].first);
30505 return selectIntAddrLSL2MM(N, Result[NextRes+0].first, Result[NextRes+1].first);
30508 return selectIntAddr11MM(N, Result[NextRes+0].first, Result[NextRes+1].first);
30508 return selectIntAddr11MM(N, Result[NextRes+0].first, Result[NextRes+1].first);
30511 return selectIntAddr16MM(N, Result[NextRes+0].first, Result[NextRes+1].first);
30511 return selectIntAddr16MM(N, Result[NextRes+0].first, Result[NextRes+1].first);
30514 return selectIntAddrSImm10(N, Result[NextRes+0].first, Result[NextRes+1].first);
30514 return selectIntAddrSImm10(N, Result[NextRes+0].first, Result[NextRes+1].first);
30517 return selectIntAddrSImm10Lsl1(N, Result[NextRes+0].first, Result[NextRes+1].first);
30517 return selectIntAddrSImm10Lsl1(N, Result[NextRes+0].first, Result[NextRes+1].first);
30520 return selectIntAddrSImm10Lsl2(N, Result[NextRes+0].first, Result[NextRes+1].first);
30520 return selectIntAddrSImm10Lsl2(N, Result[NextRes+0].first, Result[NextRes+1].first);
30523 return selectIntAddrSImm10Lsl3(N, Result[NextRes+0].first, Result[NextRes+1].first);
30523 return selectIntAddrSImm10Lsl3(N, Result[NextRes+0].first, Result[NextRes+1].first);
30526 return selectIntAddr12MM(N, Result[NextRes+0].first, Result[NextRes+1].first);
30526 return selectIntAddr12MM(N, Result[NextRes+0].first, Result[NextRes+1].first);
30529 return selectVSplatUimmPow2(N, Result[NextRes+0].first);
30532 return selectVSplatUimm8(N, Result[NextRes+0].first);
30535 return selectVSplatUimmInvPow2(N, Result[NextRes+0].first);
30538 return selectVSplatUimm5(N, Result[NextRes+0].first);
30541 return selectVSplatUimm5(N, Result[NextRes+0].first);
30544 return selectVSplatUimm5(N, Result[NextRes+0].first);
30547 return selectVSplatUimm5(N, Result[NextRes+0].first);
30550 return selectVSplatSimm5(N, Result[NextRes+0].first);
30553 return selectVSplatSimm5(N, Result[NextRes+0].first);
30556 return selectVSplatSimm5(N, Result[NextRes+0].first);
30559 return selectVSplatSimm5(N, Result[NextRes+0].first);
30562 return selectVSplatUimm3(N, Result[NextRes+0].first);
30565 return selectVSplatUimm4(N, Result[NextRes+0].first);
30568 return selectVSplatUimm6(N, Result[NextRes+0].first);
30571 return selectVSplatUimm4(N, Result[NextRes+0].first);
30574 return selectVSplatUimm3(N, Result[NextRes+0].first);
30577 return selectVSplatUimm2(N, Result[NextRes+0].first);
30580 return selectVSplatUimm1(N, Result[NextRes+0].first);
30583 return selectVSplatMaskL(N, Result[NextRes+0].first);
30586 return selectVSplatMaskL(N, Result[NextRes+0].first);
30589 return selectVSplatMaskL(N, Result[NextRes+0].first);
30592 return selectVSplatMaskL(N, Result[NextRes+0].first);
30595 return selectVSplatMaskR(N, Result[NextRes+0].first);
30598 return selectVSplatMaskR(N, Result[NextRes+0].first);
30601 return selectVSplatMaskR(N, Result[NextRes+0].first);
30604 return selectVSplatMaskR(N, Result[NextRes+0].first);
gen/lib/Target/NVPTX/NVPTXGenDAGISel.inc72330 return SelectADDRri(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
72330 return SelectADDRri(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
72333 return SelectADDRri64(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
72333 return SelectADDRri64(Root, N, Result[NextRes+0].first, Result[NextRes+1].first);
72336 return SelectDirectAddr(N, Result[NextRes+0].first);
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;
7106 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
gen/lib/Target/PowerPC/PPCGenDAGISel.inc44838 return SelectAddrIdxOnly(N, Result[NextRes+0].first, Result[NextRes+1].first);
44838 return SelectAddrIdxOnly(N, Result[NextRes+0].first, Result[NextRes+1].first);
44841 return SelectAddrImmX4(N, Result[NextRes+0].first, Result[NextRes+1].first);
44841 return SelectAddrImmX4(N, Result[NextRes+0].first, Result[NextRes+1].first);
44844 return SelectAddrIdxX4(N, Result[NextRes+0].first, Result[NextRes+1].first);
44844 return SelectAddrIdxX4(N, Result[NextRes+0].first, Result[NextRes+1].first);
44847 return SelectAddrIdxX16(N, Result[NextRes+0].first, Result[NextRes+1].first);
44847 return SelectAddrIdxX16(N, Result[NextRes+0].first, Result[NextRes+1].first);
44850 return SelectAddrImmX16(N, Result[NextRes+0].first, Result[NextRes+1].first);
44850 return SelectAddrImmX16(N, Result[NextRes+0].first, Result[NextRes+1].first);
44853 return SelectAddrImm(N, Result[NextRes+0].first, Result[NextRes+1].first);
44853 return SelectAddrImm(N, Result[NextRes+0].first, Result[NextRes+1].first);
44856 return SelectAddrIdx(N, Result[NextRes+0].first, Result[NextRes+1].first);
44856 return SelectAddrIdx(N, Result[NextRes+0].first, Result[NextRes+1].first);
44859 return SelectAddrImmOffs(N, Result[NextRes+0].first);
44862 return SelectAddr(N, Result[NextRes+0].first);
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;
2495 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
2789 if (MnemonicRange.first == MnemonicRange.second)
2792 for (const OperandMatchEntry *it = MnemonicRange.first,
gen/lib/Target/RISCV/RISCVGenDAGISel.inc14170 return SelectAddrFI(N, Result[NextRes+0].first);
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;
4239 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
4497 if (MnemonicRange.first == MnemonicRange.second)
4500 for (const OperandMatchEntry *it = MnemonicRange.first,
gen/lib/Target/Sparc/SparcGenDAGISel.inc 3613 return SelectADDRrr(N, Result[NextRes+0].first, Result[NextRes+1].first);
3613 return SelectADDRrr(N, Result[NextRes+0].first, Result[NextRes+1].first);
3616 return SelectADDRri(N, Result[NextRes+0].first, Result[NextRes+1].first);
3616 return SelectADDRri(N, Result[NextRes+0].first, Result[NextRes+1].first);
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;
5434 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
9215 if (MnemonicRange.first == MnemonicRange.second)
9218 for (const OperandMatchEntry *it = MnemonicRange.first,
gen/lib/Target/SystemZ/SystemZGenDAGISel.inc30446 return selectBDXAddr20Only(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30446 return selectBDXAddr20Only(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30446 return selectBDXAddr20Only(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30449 return selectBDAddr12Only(N, Result[NextRes+0].first, Result[NextRes+1].first);
30449 return selectBDAddr12Only(N, Result[NextRes+0].first, Result[NextRes+1].first);
30452 return selectBDAddr12Pair(N, Result[NextRes+0].first, Result[NextRes+1].first);
30452 return selectBDAddr12Pair(N, Result[NextRes+0].first, Result[NextRes+1].first);
30455 return selectBDAddr20Pair(N, Result[NextRes+0].first, Result[NextRes+1].first);
30455 return selectBDAddr20Pair(N, Result[NextRes+0].first, Result[NextRes+1].first);
30458 return selectBDAddr20Only(N, Result[NextRes+0].first, Result[NextRes+1].first);
30458 return selectBDAddr20Only(N, Result[NextRes+0].first, Result[NextRes+1].first);
30461 return selectBDXAddr12Only(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30461 return selectBDXAddr12Only(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30461 return selectBDXAddr12Only(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30464 return selectPCRelAddress(N, Result[NextRes+0].first);
30467 return selectMVIAddr12Pair(N, Result[NextRes+0].first, Result[NextRes+1].first);
30467 return selectMVIAddr12Pair(N, Result[NextRes+0].first, Result[NextRes+1].first);
30470 return selectBDXAddr12Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30470 return selectBDXAddr12Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30470 return selectBDXAddr12Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30473 return selectBDXAddr20Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30473 return selectBDXAddr20Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30473 return selectBDXAddr20Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30476 return selectBDXAddr20Only128(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30476 return selectBDXAddr20Only128(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30476 return selectBDXAddr20Only128(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30479 return selectMVIAddr20Pair(N, Result[NextRes+0].first, Result[NextRes+1].first);
30479 return selectMVIAddr20Pair(N, Result[NextRes+0].first, Result[NextRes+1].first);
30482 return selectDynAlloc12Only(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30482 return selectDynAlloc12Only(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30482 return selectDynAlloc12Only(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30485 return selectLAAddr12Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30485 return selectLAAddr12Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30485 return selectLAAddr12Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30488 return selectLAAddr20Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30488 return selectLAAddr20Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30488 return selectLAAddr20Pair(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first);
30491 return selectBDAddr12Only(N, Result[NextRes+0].first, Result[NextRes+1].first);
30491 return selectBDAddr12Only(N, Result[NextRes+0].first, Result[NextRes+1].first);
30494 return selectBDAddr20Only(N, Result[NextRes+0].first, Result[NextRes+1].first);
30494 return selectBDAddr20Only(N, Result[NextRes+0].first, Result[NextRes+1].first);
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;
1203 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
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;
37034 (it == MnemonicRange.first || ErrorInfo <= ActualIdx)) {
gen/lib/Target/X86/X86GenDAGISel.inc254678 return selectAddr(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254678 return selectAddr(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254678 return selectAddr(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254678 return selectAddr(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254678 return selectAddr(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254681 return selectRelocImm(N, Result[NextRes+0].first);
254684 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254684 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254684 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254684 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254684 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254684 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254687 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254687 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254687 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254687 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254687 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254687 return selectScalarSSELoad(Root, Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first, Result[NextRes+5].first);
254690 return selectLEAAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254690 return selectLEAAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254690 return selectLEAAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254690 return selectLEAAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254690 return selectLEAAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254693 return selectLEA64_32Addr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254693 return selectLEA64_32Addr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254693 return selectLEA64_32Addr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254693 return selectLEA64_32Addr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254693 return selectLEA64_32Addr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254696 return selectLEAAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254696 return selectLEAAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254696 return selectLEAAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254696 return selectLEAAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254696 return selectLEAAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254699 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254699 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254699 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254699 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254699 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254702 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254702 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254702 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254702 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254702 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254705 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254705 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254705 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254705 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254705 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254708 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254708 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254708 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254708 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254708 return selectTLSADDRAddr(N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254711 return selectMOV64Imm32(N, Result[NextRes+0].first);
254714 return selectVectorAddr(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254714 return selectVectorAddr(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254714 return selectVectorAddr(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254714 return selectVectorAddr(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
254714 return selectVectorAddr(Parent, N, Result[NextRes+0].first, Result[NextRes+1].first, Result[NextRes+2].first, Result[NextRes+3].first, Result[NextRes+4].first);
gen/lib/Target/XCore/XCoreGenDAGISel.inc 2457 return SelectADDRspii(N, Result[NextRes+0].first, Result[NextRes+1].first);
2457 return SelectADDRspii(N, Result[NextRes+0].first, Result[NextRes+1].first);
include/llvm/ADT/BreadthFirstIterator.h 80 NodeRef Node = H.first;
125 const NodeRef &operator*() const { return VisitQueue.front()->first; }
include/llvm/ADT/DenseMap.h 43 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; }
44 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; }
196 return try_emplace(KV.first, KV.second);
203 return try_emplace(std::move(KV.first), std::move(KV.second));
258 TheBucket = InsertIntoBucketWithLookup(TheBucket, std::move(KV.first),
662 auto I = RHS.find(KV.first);
include/llvm/ADT/DenseMapInfo.h 201 uint64_t key = (uint64_t)FirstInfo::getHashValue(PairVal.first) << 32
215 return FirstInfo::isEqual(LHS.first, RHS.first) &&
215 return FirstInfo::isEqual(LHS.first, RHS.first) &&
include/llvm/ADT/DepthFirstIterator.h 121 NodeRef Node = VisitStack.back().first;
166 const NodeRef &operator*() const { return VisitStack.back().first; }
210 NodeRef getPath(unsigned n) const { return VisitStack[n].first; }
include/llvm/ADT/EquivalenceClasses.h 200 return TheMapping.insert(ECValue(Data)).first;
include/llvm/ADT/FoldingSet.h 754 ID.Add(P.first);
include/llvm/ADT/Hashing.h 647 return hash_combine(arg.first, arg.second);
include/llvm/ADT/ImmutableMap.h 36 return V.first;
55 ImutContainerInfo<T>::Profile(ID, V.first);
216 key_type_ref getKey() const { return (*this)->first; }
376 key_type_ref getKey() const { return (*this)->first; }
include/llvm/ADT/IntervalMap.h 565 const KeyT &start(unsigned i) const { return this->first[i].first; }
569 KeyT &start(unsigned i) { return this->first[i].first; }
2033 while(Pos != NewOffset.first) {
include/llvm/ADT/MapVector.h 101 auto &I = Result.first->second;
118 std::pair<KeyT, typename MapType::mapped_type> Pair = std::make_pair(KV.first, 0);
120 auto &I = Result.first->second;
122 Vector.push_back(std::make_pair(KV.first, KV.second));
131 std::pair<KeyT, typename MapType::mapped_type> Pair = std::make_pair(KV.first, 0);
133 auto &I = Result.first->second;
161 typename MapType::iterator Pos = Map.find(Vector.back().first);
174 Map.erase(Iterator->first);
214 Map.erase(I->first);
221 Map[O->first] = O - Vector.begin();
include/llvm/ADT/PostOrderIterator.h 127 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
129 if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
155 const NodeRef &operator*() const { return VisitStack.back().first; }
164 this->finishPostorder(VisitStack.back().first);
include/llvm/ADT/PriorityWorklist.h 100 auto &Index = InsertResult.first->second;
131 ptrdiff_t &Index = InsertResult.first->second;
include/llvm/ADT/STLExtras.h 738 : iterators(std::forward<Iters>(ts.first)...),
963 return lhs.first < rhs.first;
963 return lhs.first < rhs.first;
983 -> decltype(func(lhs.first, rhs.first)) {
983 -> decltype(func(lhs.first, rhs.first)) {
984 return func(lhs.first, rhs.first);
984 return func(lhs.first, rhs.first);
1376 return std::hash<First>()(P.first) * 31 + std::hash<Second>()(P.second);
include/llvm/ADT/SmallPtrSet.h 372 return std::make_pair(makeIterator(p.first), p.second);
include/llvm/ADT/SparseSet.h 263 return *insert(ValueT(Key)).first;
include/llvm/ADT/StringMap.h 378 ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; }
414 return try_emplace(KV.first, std::move(KV.second));
423 Ret.first->second = std::forward<V>(Val);
include/llvm/ADT/iterator.h 355 NR.first = DR;
include/llvm/ADT/iterator_range.h 59 return iterator_range<T>(std::move(p.first), std::move(p.second));
include/llvm/Analysis/BlockFrequencyInfoImpl.h 680 addEdge(Irr, I.first, OuterLoop);
1096 const LoopT *Loop = Q.front().first;
include/llvm/Analysis/CGSCCPassManager.h 592 .first->second;
672 auto CountIt = CallCounts.find(Pair.first);
include/llvm/Analysis/DominanceFrontier.h 89 return Frontiers.insert(std::make_pair(BB, frontier)).first;
include/llvm/Analysis/DominanceFrontierImpl.h 105 tmpFrontiers.insert(std::make_pair(I->first, I->second));
110 BlockT *Node = I->first;
132 if (I->first)
133 I->first->printAsOperand(OS, false);
include/llvm/Analysis/IntervalIterator.h 135 Interval *operator*() { return IntStack.back().first; }
145 EndIt = succ_end(IntStack.back().first);
153 if (IOwnMem) delete IntStack.back().first;
include/llvm/Analysis/LoopCacheAnalysis.h 202 [&L](const LoopCacheCostTy &LCC) { return LCC.first == &L; });
include/llvm/Analysis/LoopInfoImpl.h 692 const BlockT *BB = Entry.first;
include/llvm/Analysis/LoopIterator.h 66 const Loop *L = N.first;
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}),
include/llvm/Analysis/MemoryBuiltins.h 247 return SizeOffset.first.getBitWidth() > 1;
315 return SizeOffset.first;
include/llvm/Analysis/MemorySSA.h 1187 : DefIterator(Info.first), Location(Info.second),
1188 OriginalAccess(Info.first) {
1189 CurrentPair.first = nullptr;
1191 WalkingPhi = Info.first && isa<MemoryPhi>(Info.first);
1191 WalkingPhi = Info.first && isa<MemoryPhi>(Info.first);
1195 upward_defs_iterator() { CurrentPair.first = nullptr; }
1221 CurrentPair.first = *DefIterator;
include/llvm/Analysis/RegionInfoImpl.h 369 at = BBNodeMap.insert(std::move(V)).first;
include/llvm/Analysis/ScalarEvolution.h 1437 Pair.first->second = std::move(CR);
1438 return Pair.first->second;
include/llvm/Analysis/ScalarEvolutionExpressions.h 669 return Result.first->second;
include/llvm/Analysis/SparsePropagation.h 406 UpdateState(std::move(ChangedValue.first),
461 UpdateState(ChangedValue.first, ChangedValue.second);
include/llvm/Analysis/VectorUtils.h 461 return I.first - SmallestKey;
698 auto *Src = A->first;
702 auto *Sink = B->first;
include/llvm/CodeGen/AccelTable.h 211 auto Iter = Entries.try_emplace(Name.getString(), Name, Hash).first;
include/llvm/CodeGen/BasicTTIImpl.h 643 return LT.first * OpCost;
649 return LT.first * 2 * OpCost;
696 if (SrcLT.first == DstLT.first &&
696 if (SrcLT.first == DstLT.first &&
730 if (SrcLT.first == DstLT.first &&
730 if (SrcLT.first == DstLT.first &&
752 if (SrcLT.first == DstLT.first &&
752 if (SrcLT.first == DstLT.first &&
767 return SrcLT.first * 1;
843 return LT.first * 1;
869 return LT.first;
879 unsigned Cost = LT.first;
1476 if (LT.first > 1)
1477 LegalCost.push_back(LT.first * 2);
1479 LegalCost.push_back(LT.first * 1);
1483 CustomCost.push_back(LT.first * 2);
1552 return LT.first;
include/llvm/CodeGen/GlobalISel/IRTranslator.h 603 return SmallVector<MachineBasicBlock *, 4>(1, &getMBB(*Edge.first));
include/llvm/CodeGen/GlobalISel/LegalizerInfo.h 1241 assert(SizeAndAction.first > prev_size);
1242 prev_size = SizeAndAction.first;
1287 assert(v[0].first == 1);
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 98 Units.set((*Unit).first);
include/llvm/CodeGen/MachineInstr.h 1197 return readsWritesVirtualRegister(Reg).first;
include/llvm/CodeGen/MachinePipeliner.h 273 return It->second.first;
include/llvm/CodeGen/MachineRegisterInfo.h 632 assert(VRegInfo[Reg.id()].first.is<const TargetRegisterClass *>() &&
634 return VRegInfo[Reg.id()].first.get<const TargetRegisterClass *>();
649 const RegClassOrRegBank &Val = VRegInfo[Reg].first;
658 const RegClassOrRegBank &Val = VRegInfo[Reg].first;
666 return VRegInfo[Reg].first;
677 VRegInfo[Reg].first = RCOrRB;
764 RegAllocHints[VReg].first = Type;
783 assert (RegAllocHints[VReg].first == 0 &&
796 return std::pair<unsigned, unsigned>(RegAllocHints[VReg.id()].first,
805 return Hint.first ? 0 : Hint.second;
include/llvm/CodeGen/ModuloSchedule.h 230 if ((int)CurStage > Schedule.getNumStages() - 1 && Stages.first == 0 &&
233 return Stages.first;
245 return Stages.first;
246 return Stages.first - 1;
include/llvm/CodeGen/RegisterPressure.h 309 LaneBitmask PrevMask = InsertRes.first->LaneMask;
310 InsertRes.first->LaneMask |= Pair.LaneMask;
include/llvm/CodeGen/SlotIndexes.h 470 return getMBBRange(Num).first;
475 return getMBBRange(mbb).first;
497 [=](const IdxMBBPair &IM) { return IM.first < To; });
524 ((I != MBBIndexEnd() && I->first > index) ||
527 assert(J != MBBIndexEnd() && J->first <= index &&
include/llvm/CodeGen/TargetLowering.h 775 return getTypeConversion(Context, VT).first;
include/llvm/DebugInfo/CodeView/GlobalTypeTableBuilder.h 77 Result.first->second.isSimple())) {
84 Result.first->getSecond() = TypeIndex(SimpleTypeKind::NotTranslated);
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/PDB/Native/HashTable.h 145 if (auto EC = Stream.readInteger(Buckets[P].first))
197 if (auto EC = Writer.writeInteger(Entry.first))
227 if (Traits.storageKeyToLookupKey(Buckets[I].first) == K)
281 assert(Traits.storageKeyToLookupKey(Buckets[Entry.index()].first) == K);
290 B.first = InternalKey ? *InternalKey : Traits.lookupKeyToStorageKey(K);
318 auto LookupKey = Traits.storageKeyToLookupKey(Buckets[I].first);
320 Buckets[I].first);
include/llvm/DebugInfo/PDB/Native/SymbolCache.h 125 SymId = Result.first->second;
include/llvm/Demangle/ItaniumDemangle.h 538 SoFar.first = std::min(SoFar.first, RT->RK);
538 SoFar.first = std::min(SoFar.first, RT->RK);
565 s += (Collapsed.first == ReferenceKind::LValue ? "&" : "&&");
include/llvm/ExecutionEngine/Orc/CompileOnDemandLayer.h 301 consumeError(removeModule(LogicalDylibs.begin()->first));
341 if (auto Sym = findSymbolIn(KV.first, Name, ExportedSymbolsOnly))
include/llvm/ExecutionEngine/Orc/Core.h 968 UnmaterializedInfos[KV.first] = UMI;
985 UnmaterializedInfos[KV.first] = UMI;
include/llvm/ExecutionEngine/Orc/IndirectionUtils.h 312 createStubInternal(Entry.first(), Entry.second.first,
323 auto Key = I->second.first;
324 void *StubAddr = IndirectStubsInfos[Key.first].getStub(Key.second);
339 auto Key = I->second.first;
340 void *PtrAddr = IndirectStubsInfos[Key.first].getPtr(Key.second);
353 auto Key = I->second.first;
355 IndirectStubsInfos[Key.first].getPtr(Key.second));
381 *IndirectStubsInfos[Key.first].getPtr(Key.second) =
include/llvm/ExecutionEngine/Orc/OrcRemoteTargetClient.h 356 if (auto Err = createStubInternal(Entry.first(), Entry.second.first,
367 auto Key = I->second.first;
379 auto Key = I->second.first;
387 auto Key = I->second.first;
432 assert(RemoteIndirectStubsInfos[K.first].StubBase != 0 &&
434 return RemoteIndirectStubsInfos[K.first].StubBase +
439 assert(RemoteIndirectStubsInfos[K.first].PtrBase != 0 &&
441 return RemoteIndirectStubsInfos[K.first].PtrBase +
include/llvm/ExecutionEngine/Orc/RPCSerialization.h 356 KeyName = &I->first;
534 if (auto Err = SerializationTraits<ChannelT, T1, T3>::serialize(C, V.first))
541 SerializationTraits<ChannelT, T1, T3>::deserialize(C, V.first))
661 SerializationTraits<ChannelT, K, K2>::serialize(C, E.first))
682 SerializationTraits<ChannelT, K, K2>::deserialize(C, Val.first))
include/llvm/ExecutionEngine/Orc/RTDyldObjectLinkingLayer.h 249 SymbolTable[KV.first] = KV.second;
include/llvm/ExecutionEngine/Orc/RemoteObjectLayer.h 215 RemoteSymbolMaterializer RSM(*this, RemoteSym.first);
include/llvm/ExecutionEngine/Orc/Speculation.h 97 const auto &ImplSymbolName = ImplSymbol.getPointer()->first;
105 llvm::dbgs() << "\n In " << I.first->getName() << " JITDylib ";
113 ES.lookup(JITDylibSearchList({{LookupPair.first, true}}),
142 auto Target = SymPair.first;
193 InternedNames[Mangle(NamePair.first)] = std::move(TargetJITNames);
include/llvm/IR/CFGDiff.h 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}),
190 {InsertVec.begin(), N.first}, {InsertVec.end(), N.first});
190 {InsertVec.begin(), N.first}, {InsertVec.end(), N.first});
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}),
205 {InsertVec.end(), N.first}, {InsertVec.end(), N.first});
205 {InsertVec.end(), N.first}, {InsertVec.end(), N.first});
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}),
244 {InsertVec.begin(), N.first}, {InsertVec.end(), N.first});
244 {InsertVec.begin(), N.first}, {InsertVec.end(), N.first});
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}),
259 {InsertVec.end(), N.first}, {InsertVec.end(), N.first});
259 {InsertVec.end(), N.first}, {InsertVec.end(), N.first});
include/llvm/IR/Dominators.h 85 : Start(Pair.first), End(Pair.second) {}
88 : Start(Pair.first), End(Pair.second) {}
include/llvm/IR/ModuleSummaryIndex.h 177 GlobalValue::GUID getGUID() const { return getRef()->first; }
981 .first;
1018 auto S = FunctionHasParent.emplace(C.first, true);
1021 if (!S.second && S.first->second)
1025 discoverNodes(C.first, FunctionHasParent);
1027 S.first->second = true;
1051 Edges.push_back(std::make_pair(P.first, CalleeInfo{}));
1223 return ModulePathStringTable.lookup(ModPath).first;
1247 return Pair.first;
1256 return &*ModulePathStringTable.insert({ModPath, {ModId, Hash}}).first;
1280 for (auto It = TidIter.first; It != TidIter.second; ++It)
1281 if (It->second.first == TypeId)
1292 for (auto It = TidIter.first; It != TidIter.second; ++It)
1293 if (It->second.first == TypeId)
1338 auto GUID = GlobalList.first;
1367 return P.first;
1415 static NodeRef edge_dest(EdgeRef E) { return E.first; }
include/llvm/IR/ModuleSummaryIndexYAML.h 73 if (P.first.getAsInteger(0, Arg)) {
86 for (uint64_t Arg : P.first) {
126 io.mapRequired(llvm::utostr(P.first).c_str(), P.second);
256 io.mapRequired(llvm::utostr(P.first).c_str(), FSums);
269 io.mapRequired(TidIter->second.first.c_str(), TidIter->second.second);
include/llvm/IR/PassManager.h 756 AnalysisResults.erase({IDAndResult.first, &IR});
878 AnalysisKey *ID = AnalysisResultPair.first;
902 AnalysisKey *ID = I->first;
1180 AnalysisKey *OuterID = KeyValuePair.first;
include/llvm/IR/ValueMap.h 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);
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/MCStreamer.h 348 return SectionStack.back().first;
351 MCSection *getCurrentSectionOnly() const { return getCurrentSection().first; }
387 MCSectionSubPair OldSection = I->first;
389 MCSectionSubPair NewSection = I->first;
392 ChangeSection(NewSection.first, NewSection.second);
401 SwitchSection(SectionStack.back().first.first, Subsection);
401 SwitchSection(SectionStack.back().first.first, Subsection);
418 MCSectionSubPair curSection = SectionStack.back().first;
421 SectionStack.back().first = MCSectionSubPair(Section, Subsection);
include/llvm/MCA/CodeEmitter.h 65 return StringRef(&Code[EI.first], EI.second);
include/llvm/MCA/Instruction.h 572 return Data.first < Other.Data.first;
572 return Data.first < Other.Data.first;
575 unsigned getSourceIndex() const { return Data.first; }
610 unsigned getSourceIndex() const { return Data.first; }
628 bool isValid() const { return Data.second && Data.first != INVALID_IID; }
include/llvm/Object/TapiUniversal.h 45 return Result.first;
include/llvm/Option/ArgList.h 207 auto B = Args.begin() + Range.first;
219 auto E = Args.rend() - Range.first;
include/llvm/PassAnalysisSupport.h 158 if (AnalysisImpl.first == PI) {
include/llvm/ProfileData/GCOV.h 230 Str = Buffer->getBuffer().slice(Cursor, Cursor + Len).split('\0').first;
include/llvm/ProfileData/InstrProf.h 473 IndexedInstrProf::ComputeHash(FuncName), Ins.first->getKey()));
562 uint64_t RHS) { return LHS.first < RHS; });
563 if (Result != MD5NameMap.end() && Result->first == FuncMD5Hash)
573 uint64_t RHS) { return LHS.first < RHS; });
574 if (Result != MD5FuncMap.end() && Result->first == FuncMD5Hash)
include/llvm/ProfileData/SampleProf.h 214 return LHS.first < RHS.first;
214 return LHS.first < RHS.first;
420 BodySamples.begin()->first < CallsiteSamples.begin()->first))
420 BodySamples.begin()->first < CallsiteSamples.begin()->first))
449 const LineLocation &Loc = I.first;
454 const LineLocation &Loc = I.first;
457 MergeResult(Result, FSMap[Rec.first].merge(Rec.second, Weight));
504 return F.getName().split('.').first;
627 return A->first < B->first;
627 return A->first < B->first;
include/llvm/Support/Allocator.h 309 const char *S = static_cast<const char *>(CustomSizedSlabs[Idx].first);
428 void *Ptr = PtrAndSize.first;
486 void *Ptr = PtrAndSize.first;
include/llvm/Support/Automaton.h 231 State = I->second.first;
include/llvm/Support/CFGUpdate.h 92 Result.push_back({UK, Op.first.first, Op.first.second});
92 Result.push_back({UK, Op.first.first, Op.first.second});
92 Result.push_back({UK, Op.first.first, Op.first.second});
include/llvm/Support/FormattedStream.h 109 unsigned getColumn() { return Position.first; }
include/llvm/Support/GenericDomTree.h 306 NodeT *BB = DomTreeNode.first;
706 const DomTreeNodeBase<NodeT> *Node = WorkStack.back().first;
include/llvm/Support/GenericDomTreeConstruction.h 886 << BlockNamePrinter(Edge.first) << " -> "
888 InsertReachable(DT, BUI, DT.getNode(Edge.first), Edge.second);
include/llvm/Support/GenericIteratedDominanceFrontier.h 159 DomTreeNodeBase<NodeTy> *Root = RootPair.first;
160 unsigned RootLevel = RootPair.second.first;
include/llvm/Support/JSON.h 552 R.first->getSecond().moveFrom(std::move(P.V));
623 if (!fromJSON(KV.second, Out[llvm::StringRef(KV.first)]))
include/llvm/Support/OnDiskHashTable.h 197 InfoObj.EmitKey(Out, I->Key, Len.first);
201 assert(offset_type(DataStart - KeyStart) == Len.first &&
378 offset_type ItemLen = L.first + L.second;
388 InfoPtr->ReadKey((const unsigned char *const)Items, L.first);
397 return iterator(X, Items + L.first, L.second, InfoPtr);
421 return new OnDiskChainedHashTable<Info>(NumBucketsAndEntries.first,
477 Ptr += L.first + L.second;
529 return InfoObj->ReadKey(LocalPtr, L.first);
575 const internal_key_type &Key = InfoObj->ReadKey(LocalPtr, L.first);
576 return InfoObj->ReadData(Key, LocalPtr + L.first, L.second);
609 NumBucketsAndEntries.first, NumBucketsAndEntries.second,
include/llvm/Support/ScaledNumber.h 214 return getLgImpl(Digits, Scale).first;
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/SourceMgr.h 179 return getLineAndColumn(Loc, BufferID).first;
include/llvm/Support/YAMLTraits.h 1944 io.mapRequired(p.first.c_str(), p.second);
include/llvm/TableGen/Record.h 1565 if (SCPair.first == R)
1572 if (const auto *SI = dyn_cast<StringInit>(SCPair.first->getNameInit())) {
1575 } else if (SCPair.first->getNameInitAsString() == Name) {
1834 assert (LHSPart.first == false && RHSPart.first == false &&
1834 assert (LHSPart.first == false && RHSPart.first == false &&
1843 assert (LHSPart.first == true && RHSPart.first == true &&
1843 assert (LHSPart.first == true && RHSPart.first == true &&
include/llvm/TableGen/StringToOffsetTable.h 41 return IterBool.first->second;
include/llvm/Transforms/IPO/WholeProgramDevirt.h 59 DataUsed.first[I] = Val >> (I * 8);
71 DataUsed.first[Size - I - 1] = Val >> (I * 8);
81 *DataUsed.first |= 1 << (Pos % 8);
include/llvm/XRay/Graph.h 390 Vertices.FindAndConstruct(I.first);
392 InNeighbors[I.second].insert(I.first);
393 OutNeighbors[I.first].insert(I.second);
479 auto EI = Val.first;
482 Vertices.FindAndConstruct(EI.first);
484 InNeighbors[EI.second].insert(EI.first);
485 OutNeighbors[EI.first].insert(EI.second);
lib/Analysis/AssumptionCache.cpp 53 return AVIP.first->second;
261 return *IP.first->second;
285 for (const BasicBlock &B : cast<Function>(*I.first))
lib/Analysis/BasicAliasAnalysis.cpp 1598 std::swap(Locs.first, Locs.second);
1632 Pair.first->second = OrigAliasResult;
1828 std::swap(Locs.first, Locs.second);
1832 return Pair.first->second;
1848 ItInsPair.first->second = Result;
1865 return Pair.first->second = Result;
1881 return Pair.first->second = Result;
1893 return Pair.first->second = PartialAlias;
1899 AliasResult Result = getBestAAResults().alias(Locs.first, Locs.second, AAQI);
1902 return Pair.first->second = Result;
lib/Analysis/BlockFrequencyInfoImpl.cpp 356 if (!addToDist(Dist, OuterLoop, Loop.getHeader(), I.first,
695 auto &Irr = *I->first;
722 auto &Irr = *I.first;
lib/Analysis/BranchProbabilityInfo.cpp 943 auto Key = I->first;
944 if (Key.first == BB)
lib/Analysis/CFG.cpp 42 const BasicBlock *ParentBB = Top.first;
63 InStack.erase(VisitStack.pop_back_val().first);
lib/Analysis/CFLAndersAliasAnalysis.cpp 372 auto IVal = Mapping.first;
387 if (OuterMapping.first.DerefLevel > 0)
390 auto Val = OuterMapping.first.Val;
394 if (InnerMapping.first.DerefLevel == 0)
395 AliasList.push_back(OffsetValue{InnerMapping.first.Val, UnknownOffset});
432 if (auto Dst = getInterfaceValue(OuterMapping.first, RetVals)) {
435 if (auto Src = getInterfaceValue(InnerMapping.first, RetVals)) {
445 auto SrcIVal = InnerMapping.first;
492 if (auto IVal = getInterfaceValue(Mapping.first, RetVals)) {
559 if (RangePair.first != RangePair.second) {
609 auto Val = Mapping.first;
660 auto Src = Mapping.first;
742 auto Val = Mapping.first;
759 auto Src = Mapping.first;
lib/Analysis/CFLSteensAliasAnalysis.cpp 191 auto Val = Mapping.first;
211 auto Val = Mapping.first;
lib/Analysis/CGSCCPassManager.cpp 176 AnalysisKey *OuterAnalysisID = OuterInvalidationPair.first;
280 AnalysisKey *OuterAnalysisID = OuterInvalidationPair.first;
lib/Analysis/CallGraph.cpp 170 OS << " CS<" << I.first << "> calls ";
189 if (I->first == &Call) {
217 if (CR.second == Callee && CR.first == nullptr) {
233 if (I->first == &Call) {
235 I->first = &NewCall;
lib/Analysis/CallGraphSCCPass.cpp 232 auto *Call = dyn_cast_or_null<CallBase>(I->first);
233 if (!I->first ||
237 Calls.count(I->first) ||
270 assert(!Calls.count(I->first) &&
277 Calls.insert(std::make_pair(I->first, I->second));
lib/Analysis/DemandedBits.cpp 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);
467 << " for " << *KV.first << '\n';
lib/Analysis/GlobalsModRef.cpp 180 addModRefInfoForGlobal(*G.first, G.second);
lib/Analysis/InlineCost.cpp 507 if (!C && !BaseAndOffset.first)
548 if (FirstBaseAndOffset.first) {
568 if (!BaseAndOffset.first)
642 if (BaseAndOffset.first)
669 if (BaseAndOffset.first)
701 if (BaseAndOffset.first)
1381 if (TrueBaseAndOffset == FalseBaseAndOffset && TrueBaseAndOffset.first) {
1422 if (BaseAndOffset.first) {
lib/Analysis/InstructionPrecedenceTracking.cpp 98 validate(It.first);
117 OI.invalidateBlock(It.first);
lib/Analysis/LazyCallGraph.cpp 326 SCC *C = SCCIndexPair.first;
812 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first);
1403 Edge &E = SourceN->Edges[InsertResult.first->second];
lib/Analysis/LazyValueInfo.cpp 396 << BV.first->getName() << "\n");
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");
lib/Analysis/LoopAccessAnalysis.cpp 457 const auto &First = Check.first->Members, &Second = Check.second->Members;
461 OS.indent(Depth + 2) << "Comparing group (" << Check.first << "):\n";
1148 return OffValPairs[Left].first < OffValPairs[Right].first;
1148 return OffValPairs[Left].first < OffValPairs[Right].first;
1680 isDependent(*A.first, A.second, *B.first, B.second, Strides);
1680 isDependent(*A.first, A.second, *B.first, B.second, Strides);
2195 First = expandBounds(Check.first, L, Loc, Exp, SE, PtrRtChecking),
2220 const PointerBounds &A = Check.first, &B = Check.second;
lib/Analysis/LoopAnalysisManager.cpp 103 AnalysisKey *OuterAnalysisID = OuterInvalidationPair.first;
lib/Analysis/LoopCacheAnalysis.cpp 445 const Loop *L = LC.first;
500 return LCC.first == L;
587 if (TC.first == &L)
lib/Analysis/LoopInfo.cpp 797 NearLoop = SubloopParents.insert({Subloop, &Unloop}).first->second;
lib/Analysis/MemDepPrinter.cpp 144 const Instruction *DepInst = I.first.getPointer();
145 DepType type = I.first.getInt();
lib/Analysis/MemoryBuiltins.cpp 145 return P.first == TLIFn;
222 Result.FstParam = Args.first;
482 if (Data.second.isNegative() || Data.first.ult(Data.second))
483 return APInt(Data.first.getBitWidth(), 0);
484 return Data.first - Data.second;
544 Builder.CreateSub(SizeOffsetPair.first, SizeOffsetPair.second);
546 Builder.CreateICmpULT(SizeOffsetPair.first, SizeOffsetPair.second);
753 return std::make_pair(PtrData.first, PtrData.second + Offset);
869 return std::make_pair(ConstantInt::get(Context, Const.first),
977 return std::make_pair(PtrData.first, Offset);
1011 SizePHI->addIncoming(EdgeData.first, PHI.getIncomingBlock(i));
1040 Value *Size = Builder.CreateSelect(I.getCondition(), TrueSide.first,
1041 FalseSide.first);
lib/Analysis/MemoryDependenceAnalysis.cpp 790 NonLocalDepInfo &Cache = CacheP.first;
1112 NonLocalPointerInfo *CacheInfo = &Pair.first->second;
1295 if (InsertRes.first->second != Pointer.getAddr()) {
1356 if (InsertRes.first->second == PredPtrVal)
1366 Visited.erase(PredList[i].first);
1378 BasicBlock *Pred = PredList[i].first;
1546 NonLocalDepInfo &BlockMap = NLDI->second.first;
1613 ReverseLocalDeps[ReverseDepsToAdd.back().first].insert(
1628 for (auto &Entry : INLD.first) {
1644 ReverseNonLocalDeps[ReverseDepsToAdd.back().first].insert(
1687 ReverseNonLocalPtrDeps[ReversePtrDepsToAdd.back().first].insert(
1707 assert(DepKV.first != D && "Inst occurs in data structures");
1712 assert(DepKV.first.getPointer() != D && "Inst occurs in NLPD map key");
1718 assert(DepKV.first != D && "Inst occurs in data structures");
1720 for (const auto &Entry : INLD.first)
1726 assert(DepKV.first != D && "Inst occurs in data structures");
1732 assert(DepKV.first != D && "Inst occurs in data structures");
1738 assert(DepKV.first != D && "Inst occurs in rev NLPD map");
lib/Analysis/MemorySSA.cpp 424 for (const auto *MA : def_chain(MAP.first)) {
601 Paths.emplace_back(P.second, P.first, PriorNode);
1252 Res.first->second = std::make_unique<AccessList>();
1253 return Res.first->second.get();
1260 Res.first->second = std::make_unique<DefsList>();
1261 return Res.first->second.get();
lib/Analysis/MemorySSAUpdater.cpp 924 auto *BB = BBPredPair.first;
968 auto *BB = BBPredPair.first;
lib/Analysis/ModuleSummaryAnalysis.cpp 807 return !CantBePromoted.count(Edge.first.getGUID());
lib/Analysis/OrderedInstructions.cpp 24 OBB = OBBMap.insert({IBB, std::make_unique<OrderedBasicBlock>(IBB)}).first;
lib/Analysis/PhiValues.cpp 128 InvalidComponents.push_back(Pair.first);
lib/Analysis/ScalarEvolution.cpp 2307 NewOps.push_back(Pair.first->first);
2307 NewOps.push_back(Pair.first->first);
2309 Pair.first->second += NewScale;
2320 NewOps.push_back(Pair.first->first);
2320 NewOps.push_back(Pair.first->first);
2322 Pair.first->second += Scale;
2596 if (MulOp.first != 0)
2598 getConstant(MulOp.first),
3850 assert(ValueExprMap.count(VE.first));
4221 eraseValueFromMap(It->first);
4907 if (Rewrite.first == SymbolicPHI)
4911 assert(isa<SCEVAddRecExpr>(Rewrite.first) && "Expected an AddRec");
5521 return InsertPair.first->second;
6128 Itr = InsertPair.first;
6654 return Pair.first->second;
6672 return Pair.first->second;
6722 eraseValueFromMap(It->first);
6812 std::pair<const SCEV *, const Loop *> Entry = I->first;
6837 eraseValueFromMap(It->first);
6876 eraseValueFromMap(It->first);
7035 BasicBlock *ExitBB = EEI.first;
7931 PHINode *PHI = dyn_cast<PHINode>(I.first);
7938 PHINode *PHI = I.first;
8006 PHINode *PHI = dyn_cast<PHINode>(I.first);
8029 if (LS.first == L)
8037 if (LS.first == L) {
8698 return TruncIfPossible(MinOptional(SL.first, SU.first), BitWidth);
8698 return TruncIfPossible(MinOptional(SL.first, SU.first), BitWidth);
9151 if (SplitLHS.first == getCouldNotCompute())
9157 if (SplitRHS.first == getCouldNotCompute())
9163 if (!isAvailableAtLoopEntry(SplitLHS.first, MDL) ||
9164 !isAvailableAtLoopEntry(SplitRHS.first, MDL))
9167 return isLoopEntryGuardedByCond(MDL, Pred, SplitLHS.first, SplitRHS.first) &&
9167 return isLoopEntryGuardedByCond(MDL, Pred, SplitLHS.first, SplitRHS.first) &&
9640 Pair.first;
9641 Pair = getPredecessorWithUniqueSuccessorForBB(Pair.first)) {
9643 if (ProveViaGuard(Pair.first))
9647 dyn_cast<BranchInst>(Pair.first->getTerminator());
11868 std::pair<const SCEV *, const Loop *> Entry = I->first;
11869 if (Entry.first == S)
12206 return PredicatedRewrite->first;
12386 if (Entry.second && Generation == Entry.first)
12443 II.first->second = SCEVWrapPredicate::setFlags(Flags, II.first->second);
12443 II.first->second = SCEVWrapPredicate::setFlags(Flags, II.first->second);
lib/Analysis/ScalarEvolutionExpander.cpp 622 return Pair.first->second;
629 return Pair.first->second = SE.LI.getLoopFor(I->getParent());
669 if (LHS.first != RHS.first)
669 if (LHS.first != RHS.first)
670 return PickMostRelevantLoop(LHS.first, RHS.first, DT) != LHS.first;
670 return PickMostRelevantLoop(LHS.first, RHS.first, DT) != LHS.first;
670 return PickMostRelevantLoop(LHS.first, RHS.first, DT) != LHS.first;
708 const Loop *CurLoop = I->first;
718 for (; I != E && I->first == CurLoop; ++I) {
735 for (++I; I != E && I->first == CurLoop; ++I)
1791 Value *V = VOPair.first;
1877 Value *V = VO.first;
2089 return VO.getValue().first;
2121 if (VO.first)
lib/Analysis/StackSafetyAnalysis.cpp 415 updateOneNode(F.first, F.second);
519 Callers[Callee].push_back(F.first);
545 SSI.emplace(F.first, std::move(F.second));
lib/Analysis/StratifiedSets.h 403 auto &Iter = Pair.first;
lib/Analysis/SyncDependenceAnalysis.cpp 354 return *ItInserted.first->second;
377 return *ItInserted.first->second;
lib/Analysis/SyntheticCountsUtils.cpp 57 auto OptProfCount = GetProfCount(E.first, E.second);
66 AddCount(Entry.first, Entry.second);
70 auto OptProfCount = GetProfCount(E.first, E.second);
lib/Analysis/VectorUtils.cpp 467 for (auto *U : I.first->users())
469 DBits[ECs.getOrInsertLeaderValue(I.first)] |= ~0ULL;
917 Instruction *B = BI->first;
939 Instruction *A = AI->first;
lib/AsmParser/LLParser.cpp 116 std::make_pair(I.first, std::make_pair(I.second, LocTy())));
126 Value *V = RAG.first;
186 return Error(ForwardRefBlockAddresses.begin()->first.Loc,
192 "use of undefined type '%" + Twine(NT.first) + "'");
203 ForwardRefComdats.begin()->first + "'");
207 "use of undefined value '@" + ForwardRefVals.begin()->first +
213 Twine(ForwardRefValIDs.begin()->first) + "'");
218 Twine(ForwardRefMDNodes.begin()->first) + "'");
263 Slots->NamedTypes.insert(std::make_pair(I.getKey(), I.second.first));
265 Slots->Types.insert(std::make_pair(I.first, I.second.first));
265 Slots->Types.insert(std::make_pair(I.first, I.second.first));
278 Twine(ForwardRefValueInfos.begin()->first) + "'");
283 Twine(ForwardRefAliasees.begin()->first) + "'");
288 Twine(ForwardRefTypeIds.begin()->first) + "'");
444 if (Entry.first)
446 Entry.first = Result;
470 if (Entry.first)
472 Entry.first = Result;
498 F->addMetadata(MD.first, *MD.second);
692 Result = FwdRef.first.get();
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;
2353 if (!Entry.first) {
2354 Entry.first = StructType::create(Context, Lex.getStrVal());
2357 Result = Entry.first;
2368 if (!Entry.first) {
2369 Entry.first = StructType::create(Context);
2372 Result = Entry.first;
2687 if (Entry.first && !Entry.second.isValid())
2697 if (!Entry.first)
2698 Entry.first = StructType::create(Context, Name);
2699 ResultTy = Entry.first;
2710 if (Entry.first)
2723 if (!Entry.first)
2724 Entry.first = StructType::create(Context, Name);
2726 StructType *STy = cast<StructType>(Entry.first);
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();
2862 "use of undefined value '%" + ForwardRefVals.begin()->first +
2867 Twine(ForwardRefValIDs.begin()->first) + "'");
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;
5468 Fn = cast<Function>(I->second.first);
5534 return Error(Blocks->first.Loc,
5554 const ValID &BBID = I.first;
5990 SI->addCase(Table[i].first, Table[i].second);
6696 PN->addIncoming(PHIVals[i].first, PHIVals[i].second);
7512 assert(!*TIDRef.first &&
7514 *TIDRef.first = GlobalValue::getGUID(Name);
7601 assert(TI[P.first].VTableVI == EmptyVI &&
7604 I.first, std::vector<std::pair<ValueInfo *, LocTy>>()));
7605 FwdRef.first->second.push_back(
7606 std::make_pair(&TI[P.first].VTableVI, P.second));
7619 assert(!*TIDRef.first &&
7621 *TIDRef.first = GlobalValue::getGUID(Name);
7942 assert(VIRef.first->getRef() == FwdVIRef &&
7944 resolveFwdRef(VIRef.first, VI);
7953 assert(!AliaseeRef.first->hasAliasee() &&
7956 AliaseeRef.first->setAliasee(VI, Summary.get());
8220 FwdRef.first->second.push_back(std::make_pair(AS.get(), Loc));
8354 assert(Calls[P.first].first.getRef() == FwdVIRef &&
8354 assert(Calls[P.first].first.getRef() == FwdVIRef &&
8357 I.first, std::vector<std::pair<ValueInfo *, LocTy>>()));
8358 FwdRef.first->second.push_back(
8359 std::make_pair(&Calls[P.first].first, P.second));
8359 std::make_pair(&Calls[P.first].first, P.second));
8441 assert(VTableFuncs[P.first].FuncVI == EmptyVI &&
8444 I.first, std::vector<std::pair<ValueInfo *, LocTy>>()));
8445 FwdRef.first->second.push_back(
8446 std::make_pair(&VTableFuncs[P.first].FuncVI, P.second));
8502 assert(Refs[P.first].getRef() == FwdVIRef &&
8505 I.first, std::vector<std::pair<ValueInfo *, LocTy>>()));
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));
8597 assert(TypeTests[P.first] == 0 &&
8600 I.first, std::vector<std::pair<GlobalValue::GUID *, LocTy>>()));
8601 FwdRef.first->second.push_back(
8602 std::make_pair(&TypeTests[P.first], P.second));
8638 assert(VFuncIdList[P.first].GUID == 0 &&
8641 I.first, std::vector<std::pair<GlobalValue::GUID *, LocTy>>()));
8642 FwdRef.first->second.push_back(
8643 std::make_pair(&VFuncIdList[P.first].GUID, P.second));
8677 assert(ConstVCallList[P.first].VFunc.GUID == 0 &&
8680 I.first, std::vector<std::pair<GlobalValue::GUID *, LocTy>>()));
8681 FwdRef.first->second.push_back(
8682 std::make_pair(&ConstVCallList[P.first].VFunc.GUID, P.second));
lib/BinaryFormat/MsgPackDocument.cpp 47 ItAndInserted.first->second = getDocument()->getNode();
49 return ItAndInserted.first->second;
232 Node = Stack.back().MapIt->first;
lib/BinaryFormat/MsgPackDocumentYAML.cpp 218 IO.mapRequired(I.first.toString().c_str(), I.second);
lib/Bitcode/Reader/BitcodeAnalyzer.cpp 111 if (Info->RecordNames[i].first == CodeID)
649 O.OS << " Block ID #" << I->first;
651 GetBlockName(I->first, BlockInfo, CurStreamType))
714 FreqPairs[i].second, I->first, BlockInfo, CurStreamType))
lib/Bitcode/Reader/BitcodeReader.cpp 2250 GlobalInitWorklist.back().first->setInitializer(C);
2265 GlobalIndirectSymbol *GIS = IndirectSymbolInitWorklist.back().first;
2279 FunctionPrefixWorklist.back().first->setPrefixData(C);
2292 FunctionPrologueWorklist.back().first->setPrologueData(C);
2305 FunctionPersonalityFnWorklist.back().first->setPersonalityFn(C);
2986 Pair.first->eraseFromParent();
5251 for (auto UI = I.first->materialized_user_begin(), UE = I.first->user_end();
5251 for (auto UI = I.first->materialized_user_begin(), UE = I.first->user_end();
5262 for (auto UI = I.first->materialized_user_begin(), UE = I.first->user_end();
5262 for (auto UI = I.first->materialized_user_begin(), UE = I.first->user_end();
5319 for (auto *U : I.first->users()) {
5323 if (!I.first->use_empty())
5324 I.first->replaceAllUsesWith(I.second);
5325 I.first->eraseFromParent();
5330 I.first->replaceAllUsesWith(I.second);
5331 I.first->eraseFromParent();
5366 assert(VGI.first);
5633 Ret.push_back(getValueInfoFromValueId(RefValueId).first);
5646 ValueInfo Callee = getValueInfoFromValueId(Record[I]).first;
5714 ValueInfo Callee = getValueInfoFromValueId(Record[Slot++]).first;
5916 TheIndex.addGlobalValueSummary(VIAndOriginalGUID.first, std::move(FS));
5935 auto AliaseeVI = getValueInfoFromValueId(AliaseeID).first;
5943 TheIndex.addGlobalValueSummary(GUID.first, std::move(AS));
5965 TheIndex.addGlobalValueSummary(GUID.first, std::move(FS));
5983 ValueInfo Callee = getValueInfoFromValueId(Record[I]).first;
5993 TheIndex.addGlobalValueSummary(GUID.first, std::move(VS));
6044 ValueInfo VI = getValueInfoFromValueId(ValueID).first;
6077 auto AliaseeVI = getValueInfoFromValueId(AliaseeValueId).first;
6081 ValueInfo VI = getValueInfoFromValueId(ValueID).first;
6105 ValueInfo VI = getValueInfoFromValueId(ValueID).first;
lib/Bitcode/Reader/MetadataLoader.cpp 273 Array.second->replaceAllUsesWith(resolveTypeRefArray(Array.first.get()));
280 if (DICompositeType *CT = OldTypeRefs.Final.lookup(Ref.first))
283 Ref.second->replaceAllUsesWith(Ref.first);
489 SP->replaceUnit(CU_SP.first);
lib/Bitcode/Reader/ValueList.cpp 162 Constant *Placeholder = ResolveConstants.back().first;
196 assert(It != ResolveConstants.end() && It->first == *I);
lib/Bitcode/Writer/BitcodeWriter.cpp 201 if (!CallEdge.first.haveGVs() || !CallEdge.first.getValue())
201 if (!CallEdge.first.haveGVs() || !CallEdge.first.getValue())
202 assignValueId(CallEdge.first.getGUID());
430 GUIDToValueIdMap[I.first] = ++GlobalValueId;
455 Callback({Summaries.first, Summary.get()}, false);
466 const auto &MPI = Index.modulePaths().find(M.first);
746 unsigned AttrListIndex = Pair.first;
2150 Record.push_back(I.first);
2180 Record.push_back(MDs[i].first);
2310 const Value *V = Vals[i].first;
2540 if (!isa<GlobalValue>(Vals[i].first)) {
3489 Vals.push_back(Value.first);
3601 writeWholeProgramDevirtResolutionByArg(NameVals, A.first, A.second);
3619 writeWholeProgramDevirtResolution(NameVals, StrtabBuilder, W.first,
3651 NameVals.push_back(SpecialRefCnts.first); // rorefcnt
3660 NameVals.push_back(getValueId(ECI.first));
3757 ArrayRef<uint64_t>{GVI.second, GVI.first});
3875 writeTypeIdCompatibleVtableSummaryRecord(NameVals, StrtabBuilder, S.first,
3906 ArrayRef<uint64_t>{GVI.second, GVI.first});
3989 DefOrUseGUIDs.insert(I.first);
3993 auto ValueId = getValueId(I.first);
4073 GlobalValue::GUID GUID = EI.first.getGUID();
4166 for (auto It = TidIter.first; It != TidIter.second; ++It) {
4167 writeTypeIdSummaryRecord(NameVals, StrtabBuilder, It->second.first,
lib/Bitcode/Writer/ValueEnumerator.cpp 81 IDs[V].first = ID;
88 if (OM.lookup(V).first)
178 if (OM.lookup(U.getUser()).first)
187 const Use *LU = L.first;
188 const Use *RU = R.first;
192 auto LID = OM.lookup(LU->getUser()).first;
193 auto RID = OM.lookup(RU->getUser()).first;
242 assert(IDPair.first && "Unmapped value");
250 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack);
317 return V.first->getType()->isIntOrIntVectorTy();
481 const Value *V = I->first;
508 const Metadata *MD = I->first;
529 if (LHS.first->getType() != RHS.first->getType())
529 if (LHS.first->getType() != RHS.first->getType())
530 return getTypeID(LHS.first->getType()) < getTypeID(RHS.first->getType());
530 return getTypeID(LHS.first->getType()) < getTypeID(RHS.first->getType());
543 ValueMap[Values[CstStart].first] = CstStart+1;
595 if (auto *N = dyn_cast<MDNode>(MD.first))
623 const MDNode *N = Worklist.back().first;
649 if (Worklist.empty() || Worklist.back().first->isDistinct()) {
666 MDIndex &Entry = Insertion.first->second;
670 dropFunctionFromMetadata(*Insertion.first);
1008 ValueMap.erase(Values[i].first);
lib/CodeGen/AggressiveAntiDepBreaker.cpp 966 unsigned CurrReg = S->first;
lib/CodeGen/Analysis.cpp 712 assert(P.first->second == EHScope && "MBB is part of two scopes!");
786 CatchRetPair.first);
lib/CodeGen/AntiDepBreaker.h 75 MachineInstr *DbgMI = DV.first;
lib/CodeGen/AsmPrinter/AccelTable.cpp 459 assert(Abbrev.first != 0);
460 Asm->EmitULEB128(Abbrev.first);
461 Asm->OutStreamer->AddComment(dwarf::TagString(Abbrev.first));
462 Asm->EmitULEB128(Abbrev.first);
481 Asm->EmitULEB128(AbbrevIt->first, "Abbreviation code");
lib/CodeGen/AsmPrinter/AddressPool.cpp 23 return IterBool.first->second.Number;
69 ? Asm.getObjFileLowering().getDebugThreadLocalSymbol(I.first)
70 : MCSymbolRefExpr::create(I.first, Asm.OutContext);
lib/CodeGen/AsmPrinter/AsmPrinter.cpp 1290 const GlobalVariable *GV = I.second.first;
1435 OutStreamer->EmitLabel(Stub.first);
1453 SectionName += Stub.first->getName();
1458 SectionKind::getReadOnly(), Stub.first->getName(),
1461 OutStreamer->EmitSymbolAttribute(Stub.first, MCSA_Global);
1462 OutStreamer->EmitLabel(Stub.first);
2655 const GlobalVariable *GV = Result.first;
3071 return IterBool.first->second.get();
lib/CodeGen/AsmPrinter/CodeViewDebug.cpp 262 return Insertion.first->second;
269 InlineSite *Site = &SiteInsertion.first->second;
384 StringRef DisplayName = SP->getName().split('<').first;
580 if (!P.first->isDeclarationForLinker())
581 emitDebugInfoForFunction(P.first, *P.second);
1085 MCSymbol *Label = Annot.first;
1185 const MCSymbol *Begin = getLabelBeforeInsn(Range.first);
1302 InlinedEntity IV = I.first;
1305 const DILocalVariable *DIVar = cast<DILocalVariable>(IV.first);
1335 CurFn = Insertion.first->second.get();
2398 StringRef Name = MethodItr.first->getString();
2557 return InsertResult.first->second;
2812 assert(Range.first && Range.second);
2813 LexicalBlock &Block = BlockInsertion.first->second;
2814 Block.Begin = getLabelBeforeInsn(Range.first);
2975 emitNullTerminatedSymbolName(OS, UDT.first);
3015 Insertion.first->second = std::make_unique<GlobalVariableList>();
3016 VariableList = Insertion.first->second.get();
lib/CodeGen/AsmPrinter/DbgEntityHistoryCalculator.cpp 196 dropRegDescribedVar(RegVars, I.first, Var);
215 clobberRegEntries(Var, I->first, ClobberingInstr, LiveEntries, HistMap);
298 unsigned int Reg = It.first;
321 EntryIndex ClobIdx = DbgValues.startClobber(Pair.first, MBB.back());
325 DbgValueHistoryMap::Entry &Ent = DbgValues.getEntry(Pair.first, Idx);
341 const InlinedEntity &Var = VarRangePair.first;
344 const DILocalVariable *LocalVar = cast<DILocalVariable>(Var.first);
lib/CodeGen/AsmPrinter/DebugHandlerBase.cpp 107 assert(R.first && "InsnRange does not have first instruction!");
109 requestLabelBeforeInsn(R.first);
lib/CodeGen/AsmPrinter/DwarfCompileUnit.cpp 478 uint32_t Index = IndexAndList.first;
517 {DD->getLabelBeforeInsn(R.first), DD->getLabelAfterInsn(R.second)});
lib/CodeGen/AsmPrinter/DwarfDebug.cpp 648 if (ParamValue->first.isImm()) {
649 int64_t Val = ParamValue->first.getImm();
652 } else if (ParamValue->first.isReg()) {
653 Register RegLoc = ParamValue->first.getReg();
1147 auto *CUNode = cast<DICompileUnit>(P.first);
1281 ensureAbstractEntityIsCreatedIfScoped(TheCU, Var.first, Scope->getScopeNode());
1283 cast<DILocalVariable>(Var.first), Var.second);
1313 const MachineInstr *LScopeBegin = LSRange.front().first;
1400 remove_if(OpenRanges, [&](OpenRange &R) { return R.first <= Index; });
1515 InlinedEntity IV = I.first;
1525 const DILocalVariable *LocalVar = cast<DILocalVariable>(IV.first);
1589 InlinedEntity IL = I.first;
1595 const DILabel *Label = cast<DILabel>(IL.first);
2507 MCSection *Section = I.first;
2569 DwarfCompileUnit *CU = it.first;
2768 auto *CUNode = cast<DICompileUnit>(P.first);
2887 CU.addDIETypeSignature(RefDie, Ins.first->second);
2905 Ins.first->second = Signature;
2955 InfoHolder.computeSizeAndOffsetsForUnit(TU.first.get());
2956 InfoHolder.emitUnit(TU.first.get(), useSplitDwarf());
lib/CodeGen/AsmPrinter/DwarfStringPool.cpp 29 auto &Entry = I.first->second;
38 return *I.first;
lib/CodeGen/AsmPrinter/DwarfUnit.cpp 1437 DIE &SPDie = *CI->first;
lib/CodeGen/AsmPrinter/WinException.cpp 485 int NewState = StateAndEnd.first;
877 OS.EmitValue(IPStatePair.first, 4);
1194 CurrentStartLabel = HandlerStack.pop_back_val().first;
lib/CodeGen/BreakFalseDeps.cpp 229 MachineInstr *UndefMI = UndefReads.back().first;
244 UndefMI = UndefReads.back().first;
lib/CodeGen/CalcSpillWeights.cpp 265 if (TargetHint.first == 0 && TargetHint.second)
271 (TargetHint.first != 0 && Hint.Reg == TargetHint.second))
lib/CodeGen/CodeGenPrepare.cpp 893 std::pair<unsigned, unsigned> Key = Item.first;
894 if (Key.first == Key.second)
899 auto BaseKey = std::make_pair(Key.first, Key.first);
899 auto BaseKey = std::make_pair(Key.first, Key.first);
1067 MadeChange = simplifyRelocatesOffABase(Item.first, Item.second);
3298 for (auto B : Item.first->blocks()) {
3299 Value *FirstValue = Item.first->getIncomingValueForBlock(B);
3359 WillNotMatch.insert(M.first);
3365 ST.ReplacePhi(MV.first, MV.second);
4589 Instruction *User = MemoryUses[i].first;
4719 GetElementPtrInst *GEP = LargeOffsetGEP.first;
5214 Inst->getOperand(0) != Entry.first)
5284 Value *OldBase = Entry.first;
5290 if (LHS.first == RHS.first)
5290 if (LHS.first == RHS.first)
5294 return LargeOffsetGEPID[LHS.first] < LargeOffsetGEPID[RHS.first];
5294 return LargeOffsetGEPID[LHS.first] < LargeOffsetGEPID[RHS.first];
5304 GetElementPtrInst *BaseGEP = LargeOffsetGEPs.begin()->first;
5310 GetElementPtrInst *GEP = LargeOffsetGEP->first;
lib/CodeGen/CriticalAntiDepBreaker.cpp 644 if (unsigned NewReg = findSuitableFreeRegister(Range.first, Range.second,
656 Q = Range.first, QE = Range.second; Q != QE; ++Q) {
lib/CodeGen/ExecutionDomainFix.cpp 225 if (DomP.first) {
229 visitHardInstr(MI, DomP.first);
232 return !DomP.first;
lib/CodeGen/FaultMaps.cpp 77 emitFunctionInfo(FFI.first, FFI.second);
lib/CodeGen/GlobalISel/CSEInfo.cpp 261 dbgs() << "CSEInfo::CSE Hit for Opc " << It.first << " : " << It.second
lib/CodeGen/GlobalISel/IRTranslator.cpp 655 JumpTableHeader *JTH = &SL->JTCases[I->JTCasesIndex].first;
2054 const PHINode *PI = Phi.first;
2176 if (!JTCase.first.Emitted)
2177 emitJumpTableHeader(JTCase.second, JTCase.first, JTCase.first.HeaderBB);
2177 emitJumpTableHeader(JTCase.second, JTCase.first, JTCase.first.HeaderBB);
lib/CodeGen/GlobalISel/LegalizerHelper.cpp 2435 int NumParts = getNarrowTypeBreakDown(DstTy, NarrowTy0, LeftoverTy0).first;
lib/CodeGen/GlobalISel/LegalizerInfo.cpp 111 return Q.Types[Mutation.first] != Mutation.second;
125 const unsigned TypeIdx = Mutation.first;
192 << Mutation.first << ", " << Mutation.second << "\n");
196 return {Rule.getAction(), Mutation.first, Mutation.second};
300 const LLT Type = LLT2Action.first;
334 Opcode, TypeIdx, PointerSpecifiedActions.first,
342 const uint16_t ElementSize = VectorSpecifiedActions.first;
351 assert(BitsizeAndAction.first % ElementSize == 0);
352 const uint16_t NumElements = BitsizeAndAction.first / ElementSize;
464 if (Action.first != Legal) {
466 << Action.first << ", " << Action.second << "\n");
467 return {Action.first, i, Action.second};
532 if (v.size() >= 1 && v[0].first != 1)
536 LargestSizeSoFar = v[i].first;
537 if (i + 1 < v.size() && v[i + 1].first != v[i].first + 1) {
537 if (i + 1 < v.size() && v[i + 1].first != v[i].first + 1) {
539 LargestSizeSoFar = v[i].first + 1;
551 if (v.size() == 0 || v[0].first != 1)
555 if (i + 1 == v.size() || v[i + 1].first != v[i].first + 1) {
555 if (i + 1 == v.size() || v[i + 1].first != v[i].first + 1) {
556 result.push_back({v[i].first + 1, DecreaseAction});
569 Vec, [=](const SizeAndAction &A) { return A.first <= Size; });
597 return {Vec[i].first, Action};
606 return {Vec[i].first, Action};
642 Aspect.Type.isScalar() ? LLT::scalar(SizeAndAction.first)
644 SizeAndAction.first)};
665 LLT::vector(Aspect.Type.getNumElements(), ElementSizeAndAction.first);
678 LLT::vector(NumElementsAndAction.first,
lib/CodeGen/GlobalISel/Localizer.cpp 158 MBBWithLocalDef.insert(std::make_pair(MBBAndReg, NewReg)).first;
lib/CodeGen/GlobalISel/Utils.cpp 276 switch (OpcodeAndSize.first) {
lib/CodeGen/GlobalMerge.cpp 652 Changed |= doMerge(P.second, M, false, P.first.first);
652 Changed |= doMerge(P.second, M, false, P.first.first);
656 Changed |= doMerge(P.second, M, false, P.first.first);
656 Changed |= doMerge(P.second, M, false, P.first.first);
661 Changed |= doMerge(P.second, M, true, P.first.first);
661 Changed |= doMerge(P.second, M, true, P.first.first);
lib/CodeGen/IfConversion.cpp 1492 unsigned Reg = Clobber.first;
lib/CodeGen/InlineSpiller.cpp 623 MachineOperand &MO = OpPair.first->getOperand(OpPair.second);
794 MachineInstr *MI = Ops.front().first;
795 if (Ops.back().first != MI || MI->isBundled())
813 assert(MI == OpPair.first && "Instruction conflict during operand folding");
1043 MachineOperand &MO = OpPair.first->getOperand(OpPair.second);
1046 if (!OpPair.first->isRegTiedToDefOperand(OpPair.second))
1357 SpillsInSubTreeMap[*RIt].first.insert(*RIt);
1377 SpillsInSubTreeMap[*RIt].first;
1380 auto BI = SpillsInSubTreeMap[Child].first.begin();
1381 auto EI = SpillsInSubTreeMap[Child].first.end();
1387 SpillsInSubTreeMap[*RIt].first;
1435 SpillsToIns[Ent.first->getBlock()] = Ent.second;
1468 int Slot = Ent.first.first;
1468 int Slot = Ent.first.first;
1470 VNInfo *OrigVNI = Ent.first.second;
1493 dbgs() << Ispill.first->getNumber() << " ";
1508 MachineBasicBlock *BB = Insert.first;
lib/CodeGen/InterleavedAccessPass.cpp 406 auto *Extract = Replacement.first;
407 auto *Vector = Replacement.second.first;
lib/CodeGen/InterleavedLoadCombinePass.cpp 585 switch (b.first) {
lib/CodeGen/LexicalScopes.cpp 174 false)).first;
205 .first;
226 nullptr, true)).first;
263 LexicalScope *S = MI2ScopeMap.lookup(R.first);
267 S->openInsnRange(R.first);
296 MBBs.insert(R.first->getParent());
lib/CodeGen/LiveDebugValues.cpp 1092 auto &ThisFragmentsOverlaps = IsInOLapMap.first->second;
1236 auto &MBB = const_cast<MachineBasicBlock &>(*Iter.first);
lib/CodeGen/LiveDebugVariables.cpp 812 LiveInterval *DstLI = CopyValues[j].first;
845 SlotIndex Idx = Defs[i].first;
903 SlotIndex RStart = LIS.getInstructionIndex(*Range.first);
1202 unsigned NewLocNo = std::distance(NewLocations.begin(), InsertResult.first);
1213 locations.push_back(Pair.first);
lib/CodeGen/LiveIntervals.cpp 217 RMB.first = RegMaskSlots.size();
245 RMB.second = RegMaskSlots.size() - RMB.first;
386 SlotIndex Idx = WorkList.back().first;
736 const LiveRange &RURange = *RUP.first;
764 const LiveInterval::SubRange &SR = *SRP.first;
lib/CodeGen/LivePhysRegs.cpp 113 MachineOperand::clobbersPhysReg(Reg.second->getRegMask(), Reg.first))
115 addReg(Reg.first);
lib/CodeGen/LiveRangeCalc.cpp 252 if (EP.first != nullptr || EP.second)
304 if (LOB.first != nullptr && LOB.first != &UndefVNI)
304 if (LOB.first != nullptr && LOB.first != &UndefVNI)
389 if (VNInfo *VNI = Map[Pred].first) {
403 VNInfo *VNI = EP.first;
458 Entry->second.first.resize(N);
461 BitVector &DefOnEntry = Entry->second.first;
512 if (IDomValue.first && IDomValue.first != &UndefVNI &&
512 if (IDomValue.first && IDomValue.first != &UndefVNI &&
515 DomTree->getNode(Indexes->getMBBFromIndex(IDomValue.first->def));
520 if (!Value.first || Value.first == IDomValue.first)
520 if (!Value.first || Value.first == IDomValue.first)
520 if (!Value.first || Value.first == IDomValue.first)
522 if (Value.first == &UndefVNI) {
530 DomTree->getNode(Indexes->getMBBFromIndex(Value.first->def));
568 } else if (IDomValue.first && IDomValue.first != &UndefVNI) {
568 } else if (IDomValue.first && IDomValue.first != &UndefVNI) {
570 I.Value = IDomValue.first;
578 if (LOP.first == IDomValue.first)
578 if (LOP.first == IDomValue.first)
lib/CodeGen/LiveRangeShrink.cpp 148 if (Barrier < UseMap[MO.getReg()].first) {
149 Barrier = UseMap[MO.getReg()].first;
lib/CodeGen/LiveRegMatrix.cpp 84 unsigned Unit = (*Units).first;
lib/CodeGen/LiveStacks.cpp 65 .first;
81 int Slot = I->first;
lib/CodeGen/MIRCanonicalizerPass.cpp 120 return (a.first < b.first);
120 return (a.first < b.first);
lib/CodeGen/MIRParser/MIParser.cpp 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));
329 I.first->second = Info;
331 return *I.first->second;
341 I.first->second = Info;
343 return *I.first->second;
1379 if (TiedPair.first == DefIdx)
1389 MI.tieOperands(TiedPair.first, TiedPair.second);
lib/CodeGen/MIRParser/MIRParser.cpp 609 populateVRegInfo(Info, Twine(P.first));
891 unsigned Line = LineAndColumn.first + Error.getLineNo() - 1;
lib/CodeGen/MIRPrinter.cpp 308 printRegMIR(LI.first, LiveIn.Register, TRI);
434 auto StackObjectInfo = StackObjectOperandMapping.find(LocalObject.first);
476 MachineBasicBlock::const_instr_iterator CallI = CSInfo.first->getIterator();
lib/CodeGen/MIRVRegNamerUtils.cpp 231 auto VReg = I->first;
lib/CodeGen/MachineBlockPlacement.cpp 2372 if (TailBB != ExitWithFreq.first)
lib/CodeGen/MachineCSE.cpp 643 unsigned OldReg = CSEPair.first;
659 if (!MI->getOperand(PhysDef.first).isDead())
660 CSMI->getOperand(PhysDef.first).setIsDead(false);
lib/CodeGen/MachineCopyPropagation.cpp 133 auto &Copy = I.first->second;
lib/CodeGen/MachineFunction.cpp 503 OS << printReg(I->first, TRI);
lib/CodeGen/MachineLICM.cpp 830 unsigned Class = RPIdAndCost.first;
1155 unsigned Class = RPIdAndCost.first;
1183 RP[RPIdAndCost.first] += RPIdAndCost.second;
lib/CodeGen/MachineModuleInfo.cpp 285 I.first->second.reset(MF);
287 MF = I.first->second.get();
lib/CodeGen/MachineModuleInfoImpls.cpp 31 return LHS->first->getName().compare(RHS->first->getName());
31 return LHS->first->getName().compare(RHS->first->getName());
lib/CodeGen/MachineOperand.cpp 408 return I.first == Index;
418 if (I.first == TF) {
504 if (I.first == TMMOFlag) {
546 const bool HasDirectFlags = Flags.first;
553 if (const auto *Name = getTargetFlagName(TII, Flags.first))
567 if ((BitMask & Mask.first) == Mask.first) {
567 if ((BitMask & Mask.first) == Mask.first) {
573 BitMask &= ~(Mask.first);
lib/CodeGen/MachinePipeliner.cpp 543 Cycles[KV.first] = Cycles[KV.second];
544 Stages[KV.first] = Stages[KV.second];
545 NewInstrChanges[KV.first] = InstrChanges[getSUnit(KV.first)];
545 NewInstrChanges[KV.first] = InstrChanges[getSUnit(KV.first)];
1128 SUnit *SU = I->first;
1190 AdjK[OD.first].push_back(OD.second);
2169 NewMI->getOperand(BasePos).setReg(RegAndOffset.first);
lib/CodeGen/MachineRegisterInfo.cpp 60 VRegInfo[Reg].first = RC;
65 VRegInfo[Reg].first = &RegBank;
166 VRegInfo[Reg].first = RegClass;
175 VRegInfo[Reg].first = VRegInfo[VReg].first;
175 VRegInfo[Reg].first = VRegInfo[VReg].first;
192 VRegInfo[Reg].first = static_cast<RegisterBank *>(nullptr);
444 if (I->first == Reg || I->second == Reg)
454 return I->first;
462 if (I->first == PReg)
488 .addReg(LiveIns[i].first);
491 EntryMBB->addLiveIn(LiveIns[i].first);
495 EntryMBB->addLiveIn(LiveIns[i].first);
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 896 MachineInstr *DbgValue = P.first;
1621 StoreChainDependents[Result.first->second].push_back(&SU);
lib/CodeGen/MachineSink.cpp 329 auto NewSucc = Pair.first->SplitCriticalEdge(Pair.second, *this);
332 << printMBBReference(*Pair.first) << " -- "
621 return it.first->second;
lib/CodeGen/MachineVerifier.cpp 201 if (addRequired(I->first))
345 assert(!Last.isValid() || I->first > Last);
346 Last = I->first;
2308 if (!CSInfo.first->isCall())
lib/CodeGen/ModuloSchedule.cpp 1009 MachineInstr *LoopDef = findDefInLoop(RegAndOffset.first);
1457 if (KV.first.first == LoopReg)
1457 if (KV.first.first == LoopReg)
1753 Sub.first->substituteRegister(DefMO.getReg(), Sub.second, /*SubIdx=*/0,
1886 if (OldAndNew.first == OldAndNew.second)
1891 OldAndNew.first.print(errs());
1969 getToken(StageAndCycle.first, "-");
1972 if (StageTokenAndValue.first != "Stage" ||
1973 CycleTokenAndValue.first != "_Cycle") {
lib/CodeGen/PHIElimination.cpp 184 LIS->RemoveMachineInstrFromMaps(*I.first);
185 MF.DeleteMachineInstr(I.first);
lib/CodeGen/PeepholeOptimizer.cpp 1583 TII->commuteInstruction(*(RI.getMI()), false, (*CP).first,
1677 unsigned Def = RegMI.first;
lib/CodeGen/PostRASchedulerList.cpp 696 MachineInstr *DbgValue = P.first;
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());
912 LLVM_DEBUG(dbgs() << "alloc FI(" << Entry.first << ") at SP[" << FIOffset
914 MFI.setObjectOffset(Entry.first, FIOffset);
lib/CodeGen/RegAllocGreedy.cpp 324 Evictees[Evictee].first = Evictor;
1488 unsigned Evictor = VregEvictorInfo.first;
lib/CodeGen/RegAllocPBQP.cpp 649 auto VReg = KV.first;
lib/CodeGen/RegisterCoalescer.cpp 949 if (P.first)
2874 assert(!SlotIndex::isSameInstr(VNI->def, TaintExtent.front().first) &&
2877 Indexes->getInstructionFromIndex(TaintExtent.front().first);
2890 LastMI = Indexes->getInstructionFromIndex(TaintExtent[TaintNum].first);
lib/CodeGen/RegisterScavenging.cpp 592 MCPhysReg Reg = P.first;
lib/CodeGen/RegisterUsageInfo.cpp 85 return A->first->getName() < B->first->getName();
85 return A->first->getName() < B->first->getName();
89 OS << FPRMPair->first->getName() << " "
92 = TM->getSubtarget<TargetSubtargetInfo>(*(FPRMPair->first))
lib/CodeGen/SafeStackColoring.cpp 227 unsigned InstNo = It.first;
267 dbgs() << " BB [" << BlockRange.first << ", " << BlockRange.second
lib/CodeGen/ScheduleDAG.cpp 532 AddPred(U.first, U.second);
lib/CodeGen/ScheduleDAGInstrs.cpp 346 Reg2SUnitsMap::iterator B = P.first;
1023 if (Itr.first.is<const Value*>()) {
1024 const Value *V = Itr.first.get<const Value*>();
1030 else if (Itr.first.is<const PseudoSourceValue*>())
1031 dbgs() << Itr.first.get<const PseudoSourceValue*>();
1340 unsigned PredTree = SubtreeClasses[P.first->NodeNum];
1344 unsigned Depth = P.first->getDepth();
1420 const SUnit *getCurr() const { return DFSStack.back().first; }
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 1833 auto CurNode = Worklist[i].first;
9104 SplitDstVT = DAG.GetSplitDestVTs(SplitDstVT).first;
9105 SplitSrcVT = DAG.GetSplitDestVTs(SplitSrcVT).first;
14765 Result.first = MaskedBytes;
14777 unsigned NumBytes = MaskInfo.first;
14861 if (MaskedLoad.first)
14868 if (MaskedLoad.first)
15364 RootCount->second.first == RootNode &&
15475 if (RootCount.first == RootNode)
lib/CodeGen/SelectionDAG/FastISel.cpp 733 unsigned IdxN = Pair.first;
lib/CodeGen/SelectionDAG/FunctionLoweringInfo.cpp 118 CatchObjects.insert({AI, {}}).first->second.push_back(
194 if (PhysReg.first == SP)
321 const auto *Src = KV.first.get<const BasicBlock *>();
522 unsigned &VReg = I.first->second;
536 P.first->getType(), ValueVTs);
541 VirtReg2Value[Reg++] = P.first;
lib/CodeGen/SelectionDAG/LegalizeDAG.cpp 1855 Shuffle = DAG.getVectorShuffle(VT, dl, IntermedVals[i].first,
1856 IntermedVals[i+1].first,
1874 SDValue Vec1 = IntermedVals[0].first;
1877 Vec2 = IntermedVals[1].first;
2076 LLVM_DEBUG(dbgs() << "Created libcall: "; CallInfo.first.dump(&DAG));
2077 return CallInfo.first;
2242 Results.push_back(CallInfo.first);
3797 Results.push_back(Tmp.first);
lib/CodeGen/SelectionDAG/LegalizeFloatTypes.cpp 191 NVT, Ops, CallOptions, SDLoc(N)).first;
208 NVT, Ops, CallOptions, SDLoc(N)).first;
225 NVT, Ops, CallOptions, SDLoc(N)).first;
240 NVT, Op, CallOptions, SDLoc(N)).first;
255 NVT, Op, CallOptions, SDLoc(N)).first;
318 NVT, Op, CallOptions, SDLoc(N)).first;
335 NVT, Ops, CallOptions, SDLoc(N)).first;
350 NVT, Op, CallOptions, SDLoc(N)).first;
365 NVT, Op, CallOptions, SDLoc(N)).first;
380 NVT, Op, CallOptions, SDLoc(N)).first;
395 NVT, Op, CallOptions, SDLoc(N)).first;
410 NVT, Op, CallOptions, SDLoc(N)).first;
425 NVT, Op, CallOptions, SDLoc(N)).first;
444 NVT, Ops, CallOptions, SDLoc(N)).first;
461 NVT, Ops, CallOptions, SDLoc(N)).first;
476 NVT, Op, CallOptions, SDLoc(N)).first;
501 NVT, Ops, CallOptions, dl).first;
531 return TLI.makeLibCall(DAG, LC, NVT, Op, CallOptions, SDLoc(N)).first;
543 CallOptions, SDLoc(N)).first;
550 return TLI.makeLibCall(DAG, LC, NVT, Res32, CallOptions, SDLoc(N)).first;
567 return TLI.makeLibCall(DAG, LC, NVT, Op, CallOptions, SDLoc(N)).first;
584 NVT, Ops, CallOptions, SDLoc(N)).first;
602 NVT, Ops, CallOptions, SDLoc(N)).first;
619 NVT, Ops, CallOptions, SDLoc(N)).first;
634 NVT, Op, CallOptions, SDLoc(N)).first;
649 NVT, Op, CallOptions, SDLoc(N)).first;
664 NVT, Op, CallOptions, SDLoc(N)).first;
679 NVT, Op, CallOptions, SDLoc(N)).first;
696 NVT, Ops, CallOptions, SDLoc(N)).first;
714 NVT, Op, CallOptions, SDLoc(N)).first;
818 Op, CallOptions, dl).first;
891 return TLI.makeLibCall(DAG, LC, RVT, Op, CallOptions, SDLoc(N)).first;
911 return TLI.makeLibCall(DAG, LC, RVT, Op, CallOptions, SDLoc(N)).first;
964 SDValue Res = TLI.makeLibCall(DAG, LC, NVT, Op, CallOptions, dl).first;
1049 NVT, Op, CallOptions, SDLoc(N)).first;
1066 NVT, Op, CallOptions, SDLoc(N)).first;
1083 NVT, Op, CallOptions, SDLoc(N)).first;
1100 NVT, Op, CallOptions, SDLoc(N)).first;
1290 SDLoc(N)).first;
1365 SDLoc(N)).first;
1380 SDLoc(N)).first;
1496 SDLoc(N)).first;
1576 Hi = TLI.makeLibCall(DAG, LC, VT, Src, CallOptions, dl).first;
1754 return TLI.makeLibCall(DAG, LC, RVT, N->getOperand(0), CallOptions, dl).first;
1765 CallOptions, dl).first;
1837 RVT, N->getOperand(0), CallOptions, SDLoc(N)).first;
1850 RVT, N->getOperand(0), CallOptions, SDLoc(N)).first;
1863 RVT, N->getOperand(0), CallOptions, SDLoc(N)).first;
1876 RVT, N->getOperand(0), CallOptions, SDLoc(N)).first;
lib/CodeGen/SelectionDAG/LegalizeIntegerTypes.cpp 1730 SplitInteger(Tmp.first, Lo, Hi);
2567 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Op, CallOptions, dl).first,
2583 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Op, CallOptions, dl).first,
2611 SplitInteger(TLI.makeLibCall(DAG, LC, RetVT, Op, CallOptions, dl).first,
2639 SplitInteger(TLI.makeLibCall(DAG, LC, RetVT, Op, CallOptions, dl).first,
2844 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, CallOptions, dl).first,
3150 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, CallOptions, dl).first, Lo, Hi);
3251 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, CallOptions, dl).first, Lo, Hi);
3341 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, CallOptions, dl).first, Lo, Hi);
3464 SplitInteger(CallInfo.first, Lo, Hi);
3498 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, CallOptions, dl).first, Lo, Hi);
3525 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, CallOptions, dl).first, Lo, Hi);
3887 return TLI.makeLibCall(DAG, LC, DstVT, Op, CallOptions, SDLoc(N)).first;
4054 return TLI.makeLibCall(DAG, LC, DstVT, Op, CallOptions, dl).first;
lib/CodeGen/SelectionDAG/LegalizeTypes.cpp 737 assert((Entry.first != 0) && "Operand isn't expanded");
738 Lo = getSDValue(Entry.first);
766 assert((Entry.first == 0) && "Node already expanded");
767 Entry.first = getTableId(Lo);
774 assert((Entry.first != 0) && "Operand isn't expanded");
775 Lo = getSDValue(Entry.first);
790 assert((Entry.first == 0) && "Node already expanded");
791 Entry.first = getTableId(Lo);
798 Lo = getSDValue(Entry.first);
818 assert((Entry.first == 0) && "Node already split");
819 Entry.first = getTableId(Lo);
986 dl).first;
990 dl).first;
994 dl).first;
1000 return TLI.makeLibCall(DAG, LC, N->getValueType(0), Ops, CallOptions, dl).first;
lib/CodeGen/SelectionDAG/ScheduleDAGFast.cpp 372 RemovePred(DelDeps[i].first, DelDeps[i].second);
407 RemovePred(DelDeps[i].first, DelDeps[i].second);
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 1211 RemovePred(DelDep.first, DelDep.second);
1255 RemovePred(DelDep.first, DelDep.second);
1483 LRegsPair.first->second = LRegs;
lib/CodeGen/SelectionDAG/ScheduleDAGSDNodes.cpp 951 unsigned Order = Orders[i].first;
997 unsigned Order = InstrOrder.first;
lib/CodeGen/SelectionDAG/SelectionDAG.cpp 4746 return getConstant(Folded.first, DL, VT);
8877 return &(*EVTs->insert(VT).first);
lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp 1344 SDV = DAG.getVRegDbgValue(Var, *FragmentExpr, RegAndSize.first,
1659 UnwindDests.back().first->setIsEHScopeEntry();
1666 UnwindDests.back().first->setIsEHScopeEntry();
1713 UnwindDests.back().first->setIsEHScopeEntry();
1714 UnwindDests.back().first->setIsEHFuncletEntry();
1722 UnwindDests.back().first->setIsEHFuncletEntry();
1724 UnwindDests.back().first->setIsEHScopeEntry();
1749 UnwindDest.first->setIsEHPad();
1750 addSuccessorWithProb(FuncInfo.MBB, UnwindDest.first, UnwindDest.second);
2815 UnwindDest.first->setIsEHPad();
2816 addSuccessorWithProb(InvokeMBB, UnwindDest.first, UnwindDest.second);
2911 if (SL->JTCases[i].first.HeaderBB == First)
2912 SL->JTCases[i].first.HeaderBB = Last;
5508 Reg = ArgRegsAndSizes.front().first;
5544 RegAndSize.first, Variable, *FragmentExpr));
7058 assert((Result.second.getNode() || !Result.first.getNode()) &&
7179 if (Result.first.getNode()) {
7181 Result.first = lowerRangeToAssertZExt(DAG, *Inst, Result.first);
7181 Result.first = lowerRangeToAssertZExt(DAG, *Inst, Result.first);
7182 setValue(Inst, Result.first);
7275 if (Res.first.getNode()) {
7276 processIntegerCallValue(I, Res.first, true);
7362 if (Res.first.getNode()) {
7363 setValue(&I, Res.first);
7425 if (Res.first.getNode()) {
7426 setValue(&I, Res.first);
7448 if (Res.first.getNode()) {
7449 processIntegerCallValue(I, Res.first, true);
7469 if (Res.first.getNode()) {
7470 processIntegerCallValue(I, Res.first, false);
7491 if (Res.first.getNode()) {
7492 processIntegerCallValue(I, Res.first, false);
8880 setValue(CS.getInstruction(), Result.first);
9438 return &Iter.first->second;
9529 const AllocaInst *AI = ArgCopyIter->second.first;
10161 JumpTableHeader *JTH = &SL->JTCases[I->JTCasesIndex].first;
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 517 unsigned From = I->first;
664 unsigned From = I->first;
1701 << "Node " << i << " : (" << FuncInfo->PHINodesToUpdate[i].first
1707 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[i].first);
1833 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[pi].first);
1862 if (!SDB->SL->JTCases[i].first.Emitted) {
1864 FuncInfo->MBB = SDB->SL->JTCases[i].first.HeaderBB;
1868 SDB->SL->JTCases[i].first, FuncInfo->MBB);
1886 MachineInstrBuilder PHI(*MF, FuncInfo->PHINodesToUpdate[pi].first);
1893 .addMBB(SDB->SL->JTCases[i].first.HeaderBB);
1942 if (FuncInfo->PHINodesToUpdate[pn].first == PHI) {
2468 return N == RecordedNodes[RecNo].first;
2736 if (I.first.getNode() == N)
2737 I.first.setNode(E);
3028 Operands.push_back(RecordedNodes[MatcherTable[MatcherIndex++]].first);
3048 RecordedNodes[RecNo].first, CPNum,
3235 SDValue Imm = RecordedNodes[RecNo].first;
3263 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3268 !RecordedNodes[RecNo].first.hasOneUse()) {
3300 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3305 !RecordedNodes[RecNo].first.hasOneUse()) {
3336 DestPhysReg, RecordedNodes[RecNo].first,
3347 SDValue Res = RunSDNodeXForm(RecordedNodes[RecNo].first, XFormNo);
3410 Ops.push_back(RecordedNodes[RecNo].first);
3534 SDValue Res = RecordedNodes[ResSlot].first;
lib/CodeGen/SelectionDAG/TargetLowering.cpp 385 NewLHS = makeLibCall(DAG, LC1, RetVT, Ops, CallOptions, dl).first;
397 NewLHS = makeLibCall(DAG, LC2, RetVT, Ops, CallOptions, dl).first;
6854 return CallResult.first;
7276 Ret = makeLibCall(DAG, LC, WideVT, Args, CallOptions, dl).first;
7279 Ret = makeLibCall(DAG, LC, WideVT, Args, CallOptions, dl).first;
lib/CodeGen/ShadowStackGCLowering.cpp 109 Constant *C = cast<Constant>(Roots[I].first->getArgOperand(1));
366 Roots[I].first->eraseFromParent();
lib/CodeGen/SlotIndexes.cpp 89 MBBRanges[MBB.getNumber()].first = blockStartIndex;
251 dbgs() << "%bb." << i << "\t[" << MBBRanges[i].first << ';'
lib/CodeGen/SpillPlacement.cpp 129 I->first += w;
161 SumN += I->first;
163 SumP += I->first;
lib/CodeGen/SplitKit.cpp 89 if (!LIP.first.isValid()) {
92 LIP.first = MBBEnd;
94 LIP.first = LIS.getInstructionIndex(*FirstTerm);
98 return LIP.first;
100 LIP.second = LIP.first;
114 return LIP.first;
119 return LIP.first;
124 return LIP.first;
131 return LIP.first;
480 if (VNInfo *OldVNI = InsP.first->second.getPointer()) {
485 InsP.first->second = ValueForcePair(nullptr, Force);
1049 if (!Dom.first) {
1052 } else if (Dom.first == ValMBB) {
1059 MDT.findNearestCommonDominator(Dom.first, ValMBB);
1063 else if (Near != Dom.first)
1072 << printMBBReference(*Dom.first) << ' ' << Dom.second
1079 if (!Dom.first || Dom.second.isValid())
1085 Dom.first = findShallowDominator(Dom.first, DefMBB);
1085 Dom.first = findShallowDominator(Dom.first, DefMBB);
1087 MBFI.getBlockFreq(Dom.first) > Costs[ParentVNI->id]) {
1091 SlotIndex Last = LIS.getMBBEndIdx(Dom.first).getPrevSlot();
1093 defFromParent(0, ParentVNI, Last, *Dom.first,
1094 SA.getLastSplitPointIter(Dom.first))->def;
1105 if (!Dom.first || Dom.second == VNI->def ||
lib/CodeGen/SplitKit.h 70 if (LastInsertPoint[Num].first.isValid() &&
72 return LastInsertPoint[Num].first;
lib/CodeGen/StackColoring.cpp 910 const AllocaInst *From = MFI->getObjectAllocation(SI.first);
936 = MFI->getObjectSSPLayout(SI.first);
lib/CodeGen/StackMaps.cpp 336 Loc.Offset = Result.first - ConstPool.begin();
442 LLVM_DEBUG(dbgs() << WSMP << "function addr: " << FR.first
445 OS.EmitSymbolValue(FR.first, 8);
lib/CodeGen/StackSlotColoring.cpp 217 [](Pair *LHS, Pair *RHS) { return LHS->first < RHS->first; });
217 [](Pair *LHS, Pair *RHS) { return LHS->first < RHS->first; });
lib/CodeGen/SwiftErrorValueTracking.cpp 248 PHI.addReg(BBRegPair.second).addMBB(BBRegPair.first);
lib/CodeGen/TailDuplicator.cpp 203 MachineBasicBlock *SrcBB = LI->second[j].first;
503 MachineBasicBlock *SrcBB = LI->second[j].first;
984 auto C = BuildMI(*MBB, Loc, DebugLoc(), CopyD, CI.first)
lib/CodeGen/TargetLoweringBase.cpp 858 if (NextStep.first == TypePromoteInteger)
893 if (LK.first == TypeExpandInteger)
1662 if (LK.first == TypeLegal)
1665 if (LK.first == TypeSplitVector || LK.first == TypeExpandInteger)
1665 if (LK.first == TypeSplitVector || LK.first == TypeExpandInteger)
lib/CodeGen/TargetRegisterInfo.cpp 395 bool Skip = (Hints_MRI.first != 0);
lib/CodeGen/TwoAddressInstructionPass.cpp 1518 unsigned SrcIdx = TiedPairs[tpi].first;
1740 unsigned SrcIdx = TiedPairs[0].first;
lib/CodeGen/VirtRegMap.cpp 288 MBBI != Indexes->MBBIndexEnd() && MBBI->first <= Last; ++MBBI) {
289 SlotIndex MBBBegin = MBBI->first;
294 const LiveInterval::SubRange *SR = RangeIterPair.first;
334 for (; I != Indexes->MBBIndexEnd() && I->first < Seg.end; ++I) {
lib/CodeGen/WinEHPrepare.cpp 727 BasicBlock *FuncletPadBB = Funclets.first;
770 BasicBlock *OldBlock = BBMapping.first;
809 BasicBlock *OldBlock = BBMapping.first;
852 BasicBlock *OldBlock = BBMapping.first;
865 BasicBlock *OldBlock = BBMapping.first;
896 auto *OldI = dyn_cast<Instruction>(const_cast<Value *>(VT.first));
934 BasicBlock *FuncletPadBB = Funclet.first;
lib/DebugInfo/CodeView/DebugCrossExSubsection.cpp 46 if (auto EC = Writer.writeInteger(M.first))
lib/DebugInfo/CodeView/DebugCrossImpSubsection.cpp 60 Result.first->getValue().push_back(Targets[0]);
lib/DebugInfo/CodeView/DebugStringTableSubsection.cpp 53 IdToString.insert({P.first->getValue(), P.first->getKey()});
53 IdToString.insert({P.first->getValue(), P.first->getKey()});
57 return P.first->second;
92 Result.push_back(Entry.first);
lib/DebugInfo/CodeView/MergingTypeTableBuilder.cpp 100 Result.first->first.RecordData = RecordData;
100 Result.first->first.RecordData = RecordData;
105 TypeIndex ActualTI = Result.first->second;
lib/DebugInfo/CodeView/RecordName.cpp 336 return StringData.split('\0').first;
lib/DebugInfo/CodeView/RecordSerialization.cpp 33 return getBytesAsCharacters(LeafData).split('\0').first;
lib/DebugInfo/DWARF/DWARFAcceleratorTable.cpp 98 switch (Atom.first) {
123 switch (Atom.first) {
190 StringRef Str = dwarf::AtomValueString(HdrData.Atoms[i].first, *Val);
219 W.startLine() << "Type: " << formatAtom(Atom.first) << '\n';
281 if (std::get<0>(Tuple).first == Atom)
lib/DebugInfo/DWARF/DWARFContext.cpp 1676 RelocAddrEntry &entry = I.first->getSecond();
lib/DebugInfo/DWARF/DWARFDebugAbbrev.cpp 88 while (I != AbbrDeclSets.end() && I->first < Offset)
108 OS << format("Abbrev table for offset: 0x%8.8" PRIx64 "\n", I.first);
116 if (PrevAbbrOffsetPos != End && PrevAbbrOffsetPos->first == CUAbbrOffset) {
133 .first;
lib/DebugInfo/DWARF/DWARFDebugLine.cpp 521 LineTable *LT = &Pos.first->second;
lib/DebugInfo/DWARF/DWARFGdbIndex.cpp 77 return V.first == E.VecOffset;
91 OS << format("\n %d(0x%x): ", I++, V.first);
184 Vec.first = Offset - ConstantPoolOffset;
lib/DebugInfo/DWARF/DWARFUnit.cpp 611 if (B != AddrDieMap.begin() && R.LowPC < (--B)->second.first) {
614 if (R.HighPC < B->second.first)
616 if (R.LowPC > B->first)
617 AddrDieMap[B->first].first = R.LowPC;
617 AddrDieMap[B->first].first = R.LowPC;
642 if (Address >= R->second.first)
lib/DebugInfo/DWARF/DWARFVerifier.cpp 645 if (DCtx.getDIEForOffset(Pair.first))
648 error() << "invalid DIE reference " << format("0x%08" PRIx64, Pair.first)
956 warn() << formatv("CU @ {0:x} not covered by any Name Index\n", KV.first);
lib/DebugInfo/GSYM/GsymCreator.cpp 40 return R.first->second;
lib/DebugInfo/MSF/MSFBuilder.cpp 220 StreamData[Idx].first = Size;
227 return StreamData[StreamIdx].first;
242 uint32_t ExpectedNumBlocks = bytesToBlocks(D.first, BlockSize);
298 Sizes[I] = StreamData[I].first;
lib/DebugInfo/MSF/MappedBlockStream.cpp 41 return std::make_pair(std::max(I1.first, I2.first),
41 return std::make_pair(std::max(I1.first, I2.first),
115 if (CacheItem.first == Offset)
119 if (CacheItem.first >= Offset + Size)
131 std::make_pair(CacheItem.first, CacheItem.first + CachedAlloc.size());
131 std::make_pair(CacheItem.first, CacheItem.first + CachedAlloc.size());
132 if (RequestExtent.first >= CachedExtent.first + CachedExtent.second)
132 if (RequestExtent.first >= CachedExtent.first + CachedExtent.second)
142 AbsoluteDifference(CachedExtent.first, Intersection.first);
142 AbsoluteDifference(CachedExtent.first, Intersection.first);
283 if (Offset + Data.size() < MapEntry.first)
288 if (MapEntry.first + Alloc.size() < Offset)
294 std::make_pair(MapEntry.first, MapEntry.first + Alloc.size());
294 std::make_pair(MapEntry.first, MapEntry.first + Alloc.size());
298 assert(Intersection.first <= Intersection.second);
300 uint32_t Length = Intersection.second - Intersection.first;
302 AbsoluteDifference(WriteInterval.first, Intersection.first);
302 AbsoluteDifference(WriteInterval.first, Intersection.first);
304 AbsoluteDifference(CachedInterval.first, Intersection.first);
304 AbsoluteDifference(CachedInterval.first, Intersection.first);
lib/DebugInfo/PDB/Native/GSIStreamBuilder.cpp 177 return gsiRecordLess(Left.first, Right.first);
177 return gsiRecordLess(Left.first, Right.first);
271 ptrdiff_t Idx = std::distance(Records.data(), Sym.first);
lib/DebugInfo/PDB/Native/NamedStreamMap.cpp 111 StringRef Stream(NamesBuffer.data() + Entry.first);
lib/DebugInfo/PDB/Native/PDBFileBuilder.cpp 291 Layout, Buffer, NSE.first, Allocator);
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);
95 while (++I != E && OI->first.Addr == I->first.Addr) {
95 while (++I != E && OI->first.Addr == I->first.Addr) {
233 if (SymbolIterator->first.Size != 0 &&
234 SymbolIterator->first.Addr + SymbolIterator->first.Size <= Address)
234 SymbolIterator->first.Addr + SymbolIterator->first.Size <= Address)
237 Addr = SymbolIterator->first.Addr;
238 Size = SymbolIterator->first.Size;
lib/DebugInfo/Symbolize/Symbolize.cpp 373 Bin = Pair.first->second.getBinary();
378 Pair.first->second = std::move(BinOrErr.get());
379 Bin = Pair.first->second.getBinary();
422 return InsertResult.first->second.get();
453 if (auto CoffObject = dyn_cast<COFFObjectFile>(Objects.first)) {
461 Objects.first->getFileName(), Session)) {
473 return createModuleInfo(Objects.first, std::move(Context), ModuleName);
lib/Demangle/MicrosoftDemangle.cpp 875 VSN->Type->Quals = demangleQualifiers(MangledName).first;
1835 FTy->Quals = Qualifiers(FTy->Quals | demangleQualifiers(MangledName).first);
lib/ExecutionEngine/JITLink/BasicGOTAndStubsBuilder.h 48 GOTEntries.insert(std::make_pair(Target.getName(), &GOTEntry)).first;
62 StubI = Stubs.insert(std::make_pair(Target.getName(), &StubSymbol)).first;
lib/ExecutionEngine/JITLink/JITLinkGeneric.cpp 168 << static_cast<sys::Memory::ProtectionFlags>(KV.first) << ":\n";
174 for (auto *B : *SIEntry.first)
189 auto &Prot = KV.first;
232 auto Prot = static_cast<sys::Memory::ProtectionFlags>(KV.first);
240 auto &Prot = KV.first;
lib/ExecutionEngine/JITLink/JITLinkGeneric.h 152 auto &Prot = KV.first;
lib/ExecutionEngine/JITLink/JITLinkMemoryManager.cpp 62 auto &Prot = KV.first;
125 Blocks[KV.first] = std::move(SegMem);
lib/ExecutionEngine/JITLink/MachOLinkGraphBuilder.cpp 314 Twine(KV.first));
323 Twine(KV.first));
330 Twine(KV.first));
342 " at index " + Twine(KV.first));
347 " at index " + Twine(KV.first));
353 " at index " + Twine(KV.first));
360 auto SecIndex = KV.first;
lib/ExecutionEngine/Orc/CompileOnDemandLayer.cpp 179 NewSearchOrder.front().first == &TargetD &&
187 I = DylibResources.insert(std::make_pair(&TargetD, std::move(PDR))).first;
lib/ExecutionEngine/Orc/Core.cpp 177 return OS << "(\"" << KV.first << "\", " << KV.second << ")";
181 return OS << "(\"" << KV.first << "\": " << KV.second << ")";
194 return OS << "(" << KV.first << ", " << KV.second << ")";
211 assert(JDs.front().first && "JITDylibList entries must not be null");
212 OS << " (\"" << JDs.front().first->getName() << "\", "
215 assert(KV.first && "JITDylibList entries must not be null");
216 OS << ", (\"" << KV.first->getName() << "\", "
227 OS << " " << *KV.first << ": " << KV.second.Aliasee << " "
356 KV.first->detachQueryHelper(*this, KV.second);
382 auto I = SymbolFlags.find(KV.first);
428 Worklist.push_back(std::make_pair(&JD, KV.first));
437 SymbolFlags.erase(KV.first);
480 JD.addDependencies(KV.first, Dependencies);
509 Flags[KV.first] = KV.second.getFlags();
589 ResponsibilitySymbols.insert(KV.first);
591 QueryAliases[KV.first] = std::move(KV.second);
596 RequestedAliases.erase(KV.first);
608 auto QuerySymbols = std::move(QueryInfos.back().first);
630 QueryInfo->R.addDependencies(KV.first, PerAliasDepsMap);
641 ResolutionMap[KV.first] = JITEvaluatedSymbol(
677 SymbolFlags[KV.first] = KV.second.AliasFlags;
692 Unresolved.erase(KV.first);
722 if (Allow && !Allow(KV.first))
724 AliasMap[KV.first] = SymbolAliasMapEntry(KV.first, KV.second);
724 AliasMap[KV.first] = SymbolAliasMapEntry(KV.first, KV.second);
725 Added.insert(KV.first);
756 Symbols.insert(std::make_pair(KV.first, SymbolTableEntry(KV.second)));
767 return make_error<DuplicateDefinition>(*KV.first);
783 auto SymI = Symbols.find(KV.first);
789 assert(UnmaterializedInfos.count(KV.first) == 0 &&
797 auto MII = MaterializingInfos.find(KV.first);
807 auto SymI = Symbols.find(KV.first);
812 assert(UnmaterializedInfos.count(KV.first) == 0 &&
816 UnmaterializedInfos[KV.first] = UMI;
832 assert(Symbols.count(KV.first) && "JITDylib does not cover this symbol?");
833 assert(Symbols.find(KV.first)->second.isInMaterializationPhase() &&
836 auto I = MaterializingInfos.find(KV.first);
841 RequestedSymbols.insert(KV.first);
867 assert(KV.first && "Null JITDylib in dependency?");
868 auto &OtherJITDylib = *KV.first;
936 auto SymI = Symbols.find(KV.first);
947 SymbolsInErrorState.insert(KV.first);
969 auto &Name = SymI->first;
1015 auto &Name = KV.first;
1035 auto &Name = SymI->first;
1052 auto &DependantJD = *KV.first;
1147 auto &ES = Worklist.front().first->getExecutionSession();
1151 assert(Worklist.back().first && "Failed JITDylib can not be null");
1152 auto &JD = *Worklist.back().first;
1178 auto &DependantJD = *KV.first;
1213 auto &UnemittedDepJD = *KV.first;
1256 if (NewSearchOrder.empty() || NewSearchOrder.front().first != this)
1275 return KV.first == &OldJD;
1287 return KV.first == &JD;
1337 UMII->second->MU->doDiscard(*this, UMII->first);
1341 auto SymI = SymbolMaterializerItrPair.first;
1491 auto SymK = Symbols.find(KV.first);
1494 UnmaterializedInfos.erase(KV.first);
1615 auto SymK = Symbols.find(KV.first);
1619 UnmaterializedInfos.erase(KV.first);
1647 OS << " (\"" << KV.first->getName() << "\", "
1653 OS << " \"" << *KV.first << "\": ";
1664 auto I = UnmaterializedInfos.find(KV.first);
1675 OS << " \"" << *KV.first << "\":\n"
1682 OS << " " << KV2.first->getName() << ": " << KV2.second << "\n";
1685 OS << " " << KV2.first->getName() << ": " << KV2.second << "\n";
1739 auto I = Symbols.find(KV.first);
1745 Duplicates.insert(KV.first);
1750 ExistingDefsOverridden.push_back(KV.first);
1753 MUDefsOverridden.push_back(KV.first);
1776 auto &SymEntry = Symbols[KV.first];
1799 auto &DependencyJD = *KV.first;
1960 assert(KV.first && "JITDylibList entries must not be null");
1961 assert(!CollectedMUsMap.count(KV.first) &&
1964 auto &JD = *KV.first;
1986 KV.first->replace(std::move(MU));
2019 OutstandingMUs.push_back(std::make_pair(KV.first, std::move(MU)));
2130 if (JITDylibAndMU.first) {
2132 dispatchMaterialization(*JITDylibAndMU.first,
lib/ExecutionEngine/Orc/ExecutionUtils.cpp 151 P.first(P.second);
276 MemoryBufferRef ChildBufferRef(ChildBufferInfo.first,
lib/ExecutionEngine/Orc/LazyReexports.cpp 50 SourceJD = I->second.first;
148 RequestedAliases[I->first] = std::move(I->second);
169 StubInits[*Alias.first] =
184 Stubs[Alias.first] = ISManager.findStub(*Alias.first, false);
184 Stubs[Alias.first] = ISManager.findStub(*Alias.first, false);
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;
291 auto &Name = NamedDepsEntry.first;
296 JITDylib &SourceJD = *QueryDepsEntry.first;
lib/ExecutionEngine/Orc/OrcMCJITReplacement.cpp 131 AcknowledgeORCv1Deprecation, std::move(KV.second), KV.first)
lib/ExecutionEngine/Orc/OrcMCJITReplacement.h 342 ObjectLayer.mapSectionAddress(P.first, LocalAddress, TargetAddress);
lib/ExecutionEngine/Orc/RTDyldObjectLinkingLayer.cpp 40 Result[*KV.first] = std::move(KV.second);
60 if (Symbols.count(*KV.first))
61 Result.insert(*KV.first);
160 if (InternalSymbols.count(KV.first))
163 auto InternedName = getExecutionSession().intern(KV.first);
lib/ExecutionEngine/Orc/SpeculateAnalyses.cpp 119 findCalles(BBFreqs[i].first, Calles);
182 PredSkipNodes.insert(I.first);
222 if (I.first == AtBB)
269 traverseToEntryBlock(I.first, CallerBlocks, BackEdgesInfo, BPI,
271 traverseToExitBlock(I.first, CallerBlocks, BackEdgesInfo, BPI,
278 MinCallerBlocks.push_back(std::move(I.first));
lib/ExecutionEngine/Orc/Speculation.cpp 32 auto It = Maps.insert({I.first, {I.second.Aliasee, SrcJD}});
lib/ExecutionEngine/RuntimeDyld/RuntimeDyld.cpp 149 int Idx = it->first;
389 auto &VR = KV.first;
1179 assert(!ResolvedSymbols.count(RRKV.first) && "Redundant resolution?");
1181 ResolvedSymbols.insert(RRKV.first);
1209 Resolved[KV.first] = KV.second;
lib/ExecutionEngine/RuntimeDyld/RuntimeDyldELF.cpp 1326 const RelocationValueRef &MatchingValue = I->first;
1831 E.first->second = GOTOffset;
1834 return E.first->second;
1897 const SectionRef &Section = i->first;
lib/ExecutionEngine/RuntimeDyld/Targets/RuntimeDyldCOFFX86_64.h 286 const object::SectionRef &Section = SectionPair.first;
lib/FuzzMutate/FuzzerCLI.cpp 61 errs() << NameAndArgs.first << ": Injected args:";
125 errs() << NameAndArgs.first << ": Injected args:";
lib/IR/AsmWriter.cpp 113 IDs[V].first = ID;
120 if (OM.lookup(V).first)
189 if (OM.lookup(U.getUser()).first)
199 ID = OM.lookup(BA->getBasicBlock()).first;
201 const Use *LU = L.first;
202 const Use *RU = R.first;
206 auto LID = OM.lookup(LU->getUser()).first;
207 auto RID = OM.lookup(RU->getUser()).first;
247 assert(IDPair.first && "Unmapped value");
255 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack);
517 NumberedTypes[P.second] = P.first;
1028 ModuleIdToPathMap[ModPath.second.first] = ModPath.first();
1036 CreateGUIDSlot(GlobalList.first);
1043 CreateTypeIdSlot(TidIter->second.first);
1046 CreateGUIDSlot(GlobalValue::getGUID(TId.first));
2685 ModPath.second.first == -1u ? RegularLTOModuleName
2693 printEscapedString(ModPair.first, Out);
2704 auto GUID = GlobalList.first;
2711 auto GUID = GlobalList.first;
2719 Out << "^" << Machine.getTypeIdSlot(TidIter->second.first)
2720 << " = typeid: (name: \"" << TidIter->second.first << "\"";
2722 Out << ") ; guid = " << TidIter->first << "\n";
2727 auto GUID = GlobalValue::getGUID(TId.first);
2729 << " = typeidCompatibleVTable: (name: \"" << TId.first << "\"";
2806 Out << "(offset: " << WPDRes.first << ", ";
2850 printArgs(ResByArg.first);
2969 Out << "(callee: ^" << Machine.getGUIDSlot(Call.first.getGUID());
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);
4096 unsigned Kind = I.first;
4119 Nodes[I->second] = cast<MDNode>(I->first);
4140 << I.first.getAsString(true) << " }\n";
lib/IR/Attributes.cpp 799 Attr = Attribute::getWithAllocSizeArgs(C, A.first, A.second);
810 Attrs.emplace_back(Attribute::get(C, TDA.first, TDA.second));
981 return LHS.first < RHS.first;
981 return LHS.first < RHS.first;
994 unsigned Index = I->first;
996 while (I != E && I->first == Index) {
1017 return LHS.first < RHS.first;
1017 return LHS.first < RHS.first;
1026 unsigned MaxIndex = Attrs.back().first;
1030 MaxIndex = Attrs[Attrs.size() - 2].first;
1034 AttrVec[attrIdxToArrayIdx(Pair.first)] = Pair.second;
1605 TargetDepAttrs[I.first] = I.second;
1633 TargetDepAttrs.erase(I.first);
1645 if (B.contains(I.first))
1685 if (B.TargetDepAttrs.find(I->first) == B.TargetDepAttrs.end())
lib/IR/AutoUpgrade.cpp 3977 UpgradeToIntrinsic(I.first, I.second);
lib/IR/Constants.cpp 2497 .first;
lib/IR/ConstantsContext.h 601 return hash_combine(Val.first, Val.second.getHash());
605 return Val.first;
611 if (LHS.first != RHS->getType())
lib/IR/Core.cpp 908 Result[i].Kind = ModuleFlag.first;
lib/IR/DIBuilder.cpp 107 if (!I.first) {
112 auto *TMF = cast<DIMacroFile>(I.first);
lib/IR/DataLayout.cpp 201 if (Split.second.empty() && Split.first != Str)
203 if (!Split.second.empty() && Split.first.empty())
239 Split = split(Split.first, ':');
242 StringRef &Tok = Split.first; // Current token.
249 unsigned AS = getInt(Split.first);
lib/IR/Function.cpp 536 StringRef Target = Name.drop_front(5).split('.').first;
1360 if (matchIntrinsicType(Check.first, Check.second, ArgTys, DeferredChecks,
lib/IR/Instruction.cpp 722 if (WL.empty() || WLS.count(MD.first))
723 setMetadata(MD.first, MD.second);
lib/IR/LLVMContext.cpp 46 assert(ID == MDKind.first && "metadata kind id drifted");
252 .first->second;
lib/IR/LLVMContextImpl.cpp 53 Pair.first->dump();
201 return &*(BundleTagCache.insert(std::make_pair(Tag, NewIdx)).first);
220 return SSC.insert(std::make_pair(SSN, SyncScope::ID(NewSSID))).first->second;
lib/IR/LegacyPassManager.cpp 274 Change.first = FnCountAfter;
646 LastUser[LU.first] = P;
900 L.insert(LU.first);
979 !is_contained(PreservedSet, Info->first)) {
1002 !is_contained(PreservedSet, Info->first)) {
lib/IR/MDBuilder.cpp 220 Ops[i * 2 + 1] = Fields[i].first;
lib/IR/Metadata.cpp 226 assert((OwnerAndIndex.first || *static_cast<Metadata **>(Ref) == &MD) &&
228 assert((OwnerAndIndex.first || *static_cast<Metadata **>(New) == &MD) &&
245 if (!UseMap.count(Pair.first))
248 OwnerTy Owner = Pair.second.first;
251 Metadata *&Ref = *static_cast<Metadata **>(Pair.first);
255 UseMap.erase(Pair.first);
297 auto Owner = Pair.second.first;
456 auto &MapEntry = I.first->getValue();
459 MapEntry.Entry = &*I.first;
1104 if (I.first == ID) {
1117 if (Attachments.back().first == ID) {
1124 if (I->first == ID) {
1135 if (I.first == ID)
1212 return !KnownSet.count(I.first);
1455 if (Offset != 0 && MD.first == LLVMContext::MD_type) {
1469 if (Offset != 0 && MD.first == LLVMContext::MD_dbg) {
1487 addMetadata(MD.first, *Attachment);
lib/IR/Module.cpp 483 auto &Entry = *ComdatSymTab.insert(std::make_pair(Name, Comdat())).first;
lib/IR/ModuleSummaryIndex.cpp 69 auto GUID = GlobalList.first;
177 GUIDPreservedSymbols.count(P.first)) {
409 auto ModId = getModuleId(ModIt.first);
410 OS << " // Module: " << ModIt.first << "\n";
414 OS << " label = \"" << sys::path::filename(ModIt.first) << "\";\n";
427 NodeMap[SummaryIt.first].push_back(ModId);
447 auto VI = getValueInfo(SummaryIt.first);
454 OS << " " << NodeId(ModId, SummaryIt.first) << " " << A.getAsString()
462 Draw(SummaryIt.first, R.getGUID(),
466 Draw(SummaryIt.first, AS->getAliaseeGUID(), -4);
472 Draw(SummaryIt.first, CGEdge.first.getGUID(),
472 Draw(SummaryIt.first, CGEdge.first.getGUID(),
lib/IR/PassManager.cpp 65 AnalysisKey *OuterAnalysisID = OuterInvalidationPair.first;
lib/IR/PassTimingInfo.cpp 181 return *(Pair.first->second.get());
203 dbgs() << "\tTimer " << MyTimer << " for pass " << I.first.first << "("
203 dbgs() << "\tTimer " << MyTimer << " for pass " << I.first.first << "("
204 << I.first.second << ")\n";
210 dbgs() << "\tTimer " << MyTimer << " for pass " << I.first.first << "("
210 dbgs() << "\tTimer " << MyTimer << " for pass " << I.first.first << "("
211 << I.first.second << ")\n";
lib/IR/SafepointIRVerifier.cpp 551 gatherDominatingDefs(BBI.first, BBI.second->AvailableIn, DT);
552 transferBlock(BBI.first, *BBI.second, true);
610 Worklist.insert(BBI.first);
lib/IR/Type.cpp 319 *Insertion.first = FT;
322 FT = *Insertion.first;
364 *Insertion.first = ST;
367 ST = *Insertion.first;
435 SymbolTableEntry = &*IterBool.first;
lib/IR/Value.cpp 838 assert(I->second && I->first == I->second->getValPtr() &&
lib/IR/ValueSymbolTable.cpp 66 return &*IterBool.first;
107 return &*IterBool.first;
lib/IR/Verifier.cpp 1839 if (!CheckParam("element size", Args.first))
1850 if (Pair.first == LLVMContext::MD_prof) {
2068 Function *F = Counts.first;
2069 unsigned EscapedObjectCount = Counts.second.first;
2094 Instruction *PredPad = Pair.first;
2251 AssertDI(I.first != LLVMContext::MD_dbg ||
2255 Assert(I.first != LLVMContext::MD_prof,
2283 switch (I.first) {
2411 Assert(i == 0 || Values[i].first != Values[i - 1].first ||
2411 Assert(i == 0 || Values[i].first != Values[i - 1].first ||
2415 &PN, Values[i].first, Values[i].second, Values[i - 1].second);
2419 Assert(Values[i].first == Preds[i],
2421 Values[i].first, Preds[i]);
4448 FrameEscapeInfo[BB->getParent()].first = Call.getNumArgOperands();
lib/LTO/LTO.cpp 167 Hasher.update(ArrayRef<uint8_t>((const uint8_t *)&Entry.first,
212 AddUnsigned(ET.first.isDSOLocal());
213 AddUsedCfiGlobal(ET.first.getGUID());
224 AddUsedCfiGlobal(GS.first);
253 AddUnsigned(WPD.first);
259 AddUint64(ByArg.first.size());
260 for (uint64_t Arg : ByArg.first)
273 for (auto It = TidIter.first; It != TidIter.second; ++It)
274 AddTypeIdSummary(It->second.first, It->second.second);
422 thinLTOInternalizeAndPromoteGUID(I.second.SummaryList, I.first, isExported,
961 GlobalVariable *OldGV = RegularLTO.CombinedModule->getNamedGlobal(I.first);
979 GV->setName(I.first);
1282 if (!ModuleToDefinedGVSummaries.count(Mod.first))
1283 ModuleToDefinedGVSummaries.try_emplace(Mod.first);
1368 if (Error E = BackendProc->start(Task, Mod.second, ImportLists[Mod.first],
1369 ExportLists[Mod.first],
1370 ResolvedODR[Mod.first], ThinLTO.ModuleMap))
lib/LTO/LTOCodeGenerator.cpp 628 for (std::pair<StringRef, StringRef> o = getToken(Options); !o.first.empty();
630 CodegenOptions.push_back(o.first);
lib/LTO/LTOModule.cpp 274 NameAndAttributes &info = IterBool.first->second;
275 info.name = IterBool.first->first();
285 auto Iter = _defines.insert(className).first;
313 NameAndAttributes &info = IterBool.first->second;
314 info.name = IterBool.first->first();
332 NameAndAttributes &info = IterBool.first->second;
333 info.name = IterBool.first->first();
458 auto Iter = _defines.insert(Name).first;
483 NameAndAttributes &info = _undefines[IterBool.first->first()];
495 info.name = IterBool.first->first();
520 _asm_undefines.push_back(IterBool.first->first());
528 NameAndAttributes &info = IterBool.first->second;
529 info.name = IterBool.first->first();
551 NameAndAttributes &info = IterBool.first->second;
553 info.name = IterBool.first->first();
lib/LTO/SummaryBasedOptimizations.cpp 35 auto &V = C.first;
lib/LTO/ThinLTOCodeGenerator.cpp 137 PrevailingCopy[I.first] =
lib/Linker/IRMover.cpp 254 assert(!(Pair.first != Ty && Pair.second == Ty) &&
1259 Flags[ID].first = SrcOp;
1289 Flags[ID].first = Flag;
1360 MDNode *Op = Flags[Flag].first;
lib/MC/ConstantPools.cpp 90 MCSection *Section = CPI.first;
lib/MC/ELFObjectWriter.cpp 1085 Size = Offsets.second - Offsets.first;
1087 writeSection(SectionIndexMap, GroupSymbolIndex, Offsets.first, Size,
1281 StringRef AliasName = P.first;
lib/MC/MCAsmStreamer.cpp 1434 Range.first->print(OS, MAI);
lib/MC/MCCodePadder.cpp 180 return InsertionResult.first->second;
204 return InsertionResult.first->second;
lib/MC/MCCodeView.cpp 52 Filename = FilenameOffset.first;
64 Filename = FilenameOffset.first;
153 std::make_pair(Insertion.first->first(), Insertion.first->second);
153 std::make_pair(Insertion.first->first(), Insertion.first->second);
156 Contents.append(Ret.first.begin(), Ret.first.end() + 1);
156 Contents.append(Ret.first.begin(), Ret.first.end() + 1);
270 I.first->second.second = Offset + 1;
280 for (size_t Idx = I->second.first, End = I->second.second; Idx != End;
470 unsigned ChildId = KV.first;
472 LocBegin = std::min(LocBegin, Extent.first);
622 LastLabel ? computeLabelDiff(Layout, LastLabel, Range.first) : 0;
623 unsigned RangeSize = computeLabelDiff(Layout, Range.first, Range.second);
632 const MCSymbol *RangeBegin = Frag.getRanges()[I].first;
636 unsigned GapAndRangeSize = GapAndRangeSizes[J].first + GapAndRangeSizes[J].second;
lib/MC/MCContext.cpp 198 if (NameEntry.second || !NameEntry.first->second) {
201 NameEntry.first->second = true;
204 return createSymbolImpl(&*NameEntry.first, IsTemporary);
324 .first;
325 StringRef CachedName = I->first.SectionName;
345 auto NameIter = UsedNames.insert(std::make_pair(Section, false)).first;
408 auto &Entry = *IterBool.first;
412 StringRef CachedName = Entry.first.SectionName;
450 auto Iter = IterBool.first;
458 StringRef CachedName = Iter->first.SectionName;
517 auto &Entry = *IterBool.first;
521 StringRef CachedName = Entry.first.SectionName;
547 auto &Entry = *IterBool.first;
552 StringRef CachedName = Entry.first.SectionName;
585 if (StringRef(Path).startswith(Entry.first)) {
587 (Twine(Entry.second) + Path.substr(Entry.first.size())).str();
lib/MC/MCDwarf.cpp 530 EmitDwarfLineTable(MCOS, LineSec.first, LineSec.second);
585 return IterBool.first->second;
lib/MC/MCELFStreamer.cpp 314 SwitchSection(P.first, P.second);
lib/MC/MCFragment.cpp 457 OS << " RangeStart:" << RangeStartEnd.first;
lib/MC/MCObjectFileInfo.cpp 871 unsigned UniqueID = It.first->second;
lib/MC/MCParser/AsmParser.cpp 1152 SymbolName = Split.first;
1198 if (Split.first.size() != IDVal.size()) {
1202 IDVal = Split.first;
1928 if (Handler.first)
1929 return (*Handler.second)(Handler.first, IDVal, IDLoc);
lib/MC/MCParser/DarwinAsmParser.cpp 755 if (!PreviousSection.first)
757 getStreamer().SwitchSection(PreviousSection.first, PreviousSection.second);
lib/MC/MCParser/ELFAsmParser.cpp 629 cast_or_null<MCSectionELF>(CurrentSection.first))
660 if (PreviousSection.first == nullptr)
662 getStreamer().SwitchSection(PreviousSection.first, PreviousSection.second);
lib/MC/MCSection.cpp 68 ExactMatch = MI->first == Subsection;
lib/MC/MCStreamer.cpp 1103 MCSectionSubPair curSection = SectionStack.back().first;
1107 SectionStack.back().first = MCSectionSubPair(Section, Subsection);
lib/MC/MCWin64EH.cpp 552 MCSymbol *EpilogStart = I.first;
605 MCSymbol *EpilogStart = I.first;
lib/MC/StringTableBuilder.cpp 67 StringRef Data = P.first.val();
81 StringRef S = P->first.val();
145 StringRef S = P->first.val();
195 P.first->second = Start;
198 return P.first->second;
lib/MC/WasmObjectWriter.cpp 989 encodeULEB128(StartFunc.first, W.OS); // priority
999 writeString(C.first);
1058 TypeIndices[&Symbol] = Pair.first->second;
1062 LLVM_DEBUG(dbgs() << " -> type index: " << Pair.first->second << "\n");
1079 TypeIndices[&Symbol] = Pair.first->second;
1083 LLVM_DEBUG(dbgs() << " -> type index: " << Pair.first->second << "\n");
lib/MCA/CodeEmitter.cpp 30 EI.first = Code.size();
32 EI.second = Code.size() - EI.first;
lib/MCA/HardwareUnits/LSUnit.cpp 58 dbgs() << "[LSUnit] Group (" << GroupIt.first << "): "
lib/MCA/HardwareUnits/RegisterFile.cpp 92 if (IPC.first && IPC.first != RegisterFileIndex) {
92 if (IPC.first && IPC.first != RegisterFileIndex) {
106 if (!OtherEntry.IndexPlusCost.first &&
119 unsigned RegisterFileIndex = Entry.IndexPlusCost.first;
134 unsigned RegisterFileIndex = Entry.IndexPlusCost.first;
175 WS.setPRF(RRI.IndexPlusCost.first);
179 WriteRef &OtherWrite = RegisterMappings[RegID].first;
213 RegisterMappings[RegID].first = Write;
216 RegisterMappings[*I].first = Write;
232 RegisterMappings[*I].first = Write;
271 WriteRef &WR = RegisterMappings[RegID].first;
276 WriteRef &OtherWR = RegisterMappings[*I].first;
285 WriteRef &OtherWR = RegisterMappings[*I].first;
298 unsigned RegisterFileIndex = RRIFrom.IndexPlusCost.first;
299 if (RegisterFileIndex != RRITo.IndexPlusCost.first)
368 const WriteRef &WR = RegisterMappings[RegID].first;
374 const WriteRef &WR = RegisterMappings[*I].first;
402 RS.setPRF(RRI.IndexPlusCost.first);
434 if (Entry.first)
435 NumPhysRegs[Entry.first] += Entry.second;
481 << ", PRF=" << RRI.IndexPlusCost.first
485 RM.first.dump();
lib/MCA/HardwareUnits/ResourceManager.cpp 196 unsigned RSID = getResourceStateIndex(RR.first);
209 AvailableProcResUnits ^= RR.first;
217 CurrentUser.markSubResourceAsUsed(RR.first);
218 Strategies[GroupIndex]->used(RR.first);
225 unsigned RSID = getResourceStateIndex(RR.first);
232 AvailableProcResUnits ^= RR.first;
239 CurrentUser.releaseSubResource(RR.first);
286 unsigned Index = getResourceStateIndex(E.first);
288 BusyResourceMask |= E.first;
303 releaseResource(R.first);
309 ResourceRef Pipe = selectPipe(R.first);
315 assert((countPopulation(R.first) > 1) && "Expected a group!");
318 reserveResource(R.first);
319 BusyResources[ResourceRef(R.first, R.first)] += CS.size();
319 BusyResources[ResourceRef(R.first, R.first)] += CS.size();
330 const ResourceRef &RR = BR.first;
332 if (countPopulation(RR.first) == 1)
334 releaseResource(RR.first);
lib/MCA/InstrBuilder.cpp 101 unsigned popcntA = countPopulation(A.first);
102 unsigned popcntB = countPopulation(B.first);
107 return A.first < B.first;
107 return A.first < B.first;
117 assert(countPopulation(A.first) > 1 && "Expected a group!");
118 UsedResourceGroups |= PowerOf2Floor(A.first);
123 uint64_t NormalizedMask = A.first;
124 if (countPopulation(A.first) == 1) {
125 UsedResourceUnits |= A.first;
129 UsedResourceGroups |= (A.first ^ NormalizedMask);
134 if ((NormalizedMask & B.first) == NormalizedMask) {
135 B.second.CS.subtract(A.second.size() - SuperResources[A.first]);
136 if (countPopulation(B.first) > 1)
160 if (countPopulation(RPC.first) > 1 && !RPC.second.isReserved()) {
162 uint64_t Mask = RPC.first ^ PowerOf2Floor(RPC.first);
162 uint64_t Mask = RPC.first ^ PowerOf2Floor(RPC.first);
176 if (Mask != SR.first && ((Mask & SR.first) == SR.first))
176 if (Mask != SR.first && ((Mask & SR.first) == SR.first))
176 if (Mask != SR.first && ((Mask & SR.first) == SR.first))
187 dbgs() << "\t\tResource Mask=" << format_hex(R.first, 16) << ", "
lib/MCA/Instruction.cpp 61 ReadState *RS = User.first;
lib/MCA/Stages/EntryStage.cpp 37 CurrentInstruction = InstRef(SR.first, Inst.get());
lib/MCA/Stages/ExecuteStage.cpp 246 LLVM_DEBUG(dbgs() << "[E] Resource Available: [" << RR.first << '.'
259 dbgs() << "[E] Resource Used: [" << Resource.first.first << '.'
259 dbgs() << "[E] Resource Used: [" << Resource.first.first << '.'
260 << Resource.first.second << "], ";
267 Use.first.first = HWS.getResourceID(Use.first.first);
267 Use.first.first = HWS.getResourceID(Use.first.first);
267 Use.first.first = HWS.getResourceID(Use.first.first);
267 Use.first.first = HWS.getResourceID(Use.first.first);
lib/MCA/Stages/InstructionTables.cpp 33 Masks.begin(), std::find(Masks.begin(), Masks.end(), Resource.first));
lib/Object/ArchiveWriter.cpp 227 Insertion.first->second = StringTable.tell();
230 NamePos = Insertion.first->second;
537 auto FromI = FromTo.first;
lib/Object/COFFObjectFile.cpp 520 PDBFileName = PDBFileName.split('\0').first;
1797 if (RelocsForOffset.first != RelocsForOffset.second) {
1800 const coff_relocation &R = **RelocsForOffset.first;
lib/Object/ELFObjectFile.cpp 79 if (Ident.first == ELF::ELFCLASS32) {
86 } else if (Ident.first == ELF::ELFCLASS64) {
437 GotToPlt.insert(std::make_pair(Entry.second, Entry.first));
lib/Object/IRSymtab.cpp 178 P.first->second = -1;
192 return P.first->second;
lib/Object/ModuleSymbolTable.cpp 167 AsmSymver(KV.first->getName(), Alias);
173 OS << S.get<AsmSymbol *>()->first;
lib/Object/RecordStreamer.cpp 155 const MCSymbol *Aliasee = Symver.first;
218 (Split.first + Separator + Split.second).toStringRef(NewName);
lib/Object/WindowsResource.cpp 296 uint32_t FirstLang = FirstIt->first;
299 uint32_t LastLang = LastIt->first;
519 Result = ElementInserted.first->second.get();
555 Child.second->print(Writer, Child.first);
558 Child.second->print(Writer, to_string(Child.first));
921 Entry->Identifier.ID = Child.first;
lib/ObjectYAML/ELFYAML.cpp 881 Ret.push_back({P.first});
lib/ObjectYAML/MachOEmitter.cpp 420 return a.first < b.first;
420 return a.first < b.first;
424 ZeroToOffset(OS, writeOp.first);
lib/ObjectYAML/MinidumpEmitter.cpp 102 allocateNewObject<support::ulittle32_t>(2 * (WStr.size() - 1)).first;
lib/ObjectYAML/WasmEmitter.cpp 286 writeStringRef(Field.first, OS);
lib/Option/ArgList.cpp 40 OptRanges.insert(std::make_pair(O.getID(), emptyRange())).first->second;
41 R.first = std::min<unsigned>(R.first, Args.size() - 1);
41 R.first = std::min<unsigned>(R.first, Args.size() - 1);
63 R.first = std::min(R.first, I->second.first);
63 R.first = std::min(R.first, I->second.first);
63 R.first = std::min(R.first, I->second.first);
68 if (R.first == -1u)
69 R.first = 0;
lib/Option/OptTable.cpp 577 if (OptionGroup.first != GroupedOptionHelp.begin()->first)
577 if (OptionGroup.first != GroupedOptionHelp.begin()->first)
579 PrintHelpOptionList(OS, OptionGroup.first, OptionGroup.second);
lib/Passes/StandardInstrumentations.cpp 109 printIR(UnwrappedModule->first, Banner, UnwrappedModule->second);
lib/ProfileData/Coverage/CoverageMapping.cpp 391 Segments.emplace_back(StartLoc.first, StartLoc.second,
395 Segments.emplace_back(StartLoc.first, StartLoc.second, IsRegionEntry);
691 InstantiationGroup IG{InstantiationSet.first.first,
691 InstantiationGroup IG{InstantiationSet.first.first,
692 InstantiationSet.first.second,
lib/ProfileData/Coverage/CoverageMappingReader.cpp 442 size_t OldRecordIndex = InsertResult.first->second;
665 return IsCOFF ? N.split('$').first : N;
lib/ProfileData/GCOV.cpp 932 const std::string &Filename = FC.first;
lib/ProfileData/InstrProf.cpp 367 return A.first < Address;
373 if (It != AddrToMD5Map.end() && It->first == Address)
lib/ProfileData/InstrProfReader.cpp 221 if (InstrProfSymtab::isExternalSymbol(VD.first)) {
224 if (Error E = Symtab->addFuncName(VD.first))
226 Value = IndexedInstrProf::ComputeHash(VD.first);
229 READ_NUM(VD.first, Value);
649 if (Parts.first.startswith("_Z"))
650 return Parts.first;
lib/ProfileData/InstrProfWriter.cpp 146 if (NamedInstrProfRecord::hasCSFlagInHash(ProfileData.first))
151 LE.write<uint64_t>(ProfileData.first); // Function hash
256 addRecord(I.getKey(), Func.first, std::move(Func.second), 1, Warn);
460 return std::tie(A.first, A.second.first) <
460 return std::tie(A.first, A.second.first) <
461 std::tie(B.first, B.second.first);
461 std::tie(B.first, B.second.first);
465 const StringRef &Name = record.first;
467 writeRecordInText(Name, Func.first, Func.second, Symtab, OS);
lib/ProfileData/ProfileSummaryBuilder.cpp 82 Count = Iter->first;
lib/ProfileData/SampleProf.cpp 112 OS << " " << I.first << ":" << I.second;
138 OS << SI->first << ": " << SI->second;
154 OS << CS->first << ": inlined callee: " << FS.second.getName() << ": ";
192 FS = FS->findFunctionSamplesAt(S[i].first, S[i].second);
lib/ProfileData/SampleProfReader.cpp 259 LineOffset, Discriminator, name_count.first,
550 auto FuncName = NameOffset.first;
lib/ProfileData/SampleProfWriter.cpp 54 return A.first > B.first;
54 return A.first > B.first;
163 writeNameIdx(entry.first);
240 LineLocation Loc = I->first;
251 OS << " " << J.first << ":" << J.second;
260 LineLocation Loc = I->first;
307 V.insert(I.first);
345 writeNameIdx(entry.first);
507 LineLocation Loc = I.first;
514 StringRef Callee = J.first;
529 LineLocation Loc = J.first;
lib/Remarks/BitstreamRemarkSerializer.cpp 275 R.push_back(StrTab.add(Remark.RemarkName).first);
276 R.push_back(StrTab.add(Remark.PassName).first);
277 R.push_back(StrTab.add(Remark.FunctionName).first);
283 R.push_back(StrTab.add(Loc->SourceFilePath).first);
298 unsigned Key = StrTab.add(Arg.Key).first;
299 unsigned Val = StrTab.add(Arg.Val).first;
306 R.push_back(StrTab.add(Arg.Loc->SourceFilePath).first);
lib/Remarks/RemarkParser.cpp 31 Offsets.push_back(Split.first.data() - Buffer.data());
lib/Remarks/RemarkStringTable.cpp 36 SerializedSize += KV.first->first().size() + 1; // +1 for the '\0'
38 return {KV.first->second, KV.first->first()};
38 return {KV.first->second, KV.first->first()};
lib/Remarks/YAMLRemarkSerializer.cpp 64 unsigned PassID = StrTab.add(Remark->PassName).first;
65 unsigned NameID = StrTab.add(Remark->RemarkName).first;
66 unsigned FunctionID = StrTab.add(Remark->FunctionName).first;
89 unsigned FileID = StrTab.add(File).first;
144 auto ValueID = StrTab.add(A.Val).first;
lib/Support/CachePruning.cpp 84 std::tie(Key, Value) = P.first.split('=');
lib/Support/CommandLine.cpp 571 StringRef &LHS = SplitArg.first; // LHS == Arg when no '=' is present.
1499 ProvidePositionalOption(PositionalOpts[i], PositionalVals[ValNo].first,
1518 PositionalVals[ValNo].first,
1534 PositionalVals[ValNo].first,
1546 PositionalVals[ValNo].first,
1555 ProvidePositionalOption(ConsumeAfterOpt, PositionalVals[ValNo].first,
1656 << ArgHelpPrefix << Split.first << "\n";
1659 outs().indent(Indent) << Split.first << "\n";
2003 return strcmp(LHS->first, RHS->first);
2003 return strcmp(LHS->first, RHS->first);
2008 return strcmp(LHS->first, RHS->first);
2008 return strcmp(LHS->first, RHS->first);
2067 outs() << " " << S.first;
2069 outs().indent(MaxSubLen - strlen(S.first));
2133 MaxSubLen = std::max(MaxSubLen, strlen(Subs[i].first));
lib/Support/DAGDeltaAlgorithm.cpp 190 Predecessors[it->second].push_back(it->first);
191 Successors[it->first].push_back(it->second);
lib/Support/DebugCounter.cpp 38 size_t NumSpaces = GlobalWidth - Info.first.size() - 8;
39 outs() << " =" << Info.first;
87 if (CounterPair.first.endswith("-skip")) {
88 auto CounterName = CounterPair.first.drop_back(5);
100 } else if (CounterPair.first.endswith("-count")) {
101 auto CounterName = CounterPair.first.drop_back(6);
114 errs() << "DebugCounter Error: " << CounterPair.first
lib/Support/FileCheck.cpp 675 Context->GlobalVariableTable[VariableDef.first] =
717 BufferPrefix = BufferPrefix.split('\n').first;
935 InputStartLine = Start.first;
937 InputEndLine = End.first;
940 CheckLine = Start.first;
1818 StringRef CmdlineDef = CmdlineDefsDiagRef.substr(CmdlineDefIndices.first,
1862 StringRef CmdlineName = CmdlineNameVal.first;
lib/Support/FormattedStream.cpp 24 unsigned &Column = Position.first;
lib/Support/Host.cpp 1254 auto Name = Data.first.trim();
lib/Support/IntervalMap.cpp 20 path.front() = Entry(Root, Size, Offsets.first);
134 if (PosPair.first == Nodes && Sum > Position)
141 assert(PosPair.first < Nodes && "Bad algebra");
142 assert(NewSize[PosPair.first] && "Too few elements to need Grow");
143 --NewSize[PosPair.first];
lib/Support/ItaniumManglingCanonicalizer.cpp 162 MostRecentlyCreated = Result.first;
163 } else if (Result.first) {
165 if (auto *N = Remappings.lookup(Result.first)) {
166 Result.first = N;
167 assert(Remappings.find(Result.first) == Remappings.end() &&
170 if (Result.first == TrackedNode)
173 return Result.first;
lib/Support/JSON.cpp 18 return try_emplace(K, nullptr).first->getSecond();
21 return try_emplace(std::move(K), nullptr).first->getSecond();
84 auto R = RHS.find(L.first);
527 return L->first < R->first;
527 return L->first < R->first;
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/Regex.cpp 150 Res += Split.first;
154 if (Repl.size() != Split.first.size() &&
lib/Support/SourceMgr.cpp 220 return SMDiagnostic(*this, Loc, BufferID, LineAndCol.first,
431 std::fill(&CaretLine[R.first],
lib/Support/SpecialCaseList.cpp 67 if (RegExKV.first->match(Query))
164 StringRef Prefix = SplitLine.first;
168 SplitLine.first + "'").str();
173 std::string Regexp = SplitRegexp.first;
lib/Support/StringExtras.cpp 54 while (!S.first.empty()) {
55 OutFragments.push_back(S.first);
lib/Support/StringSaver.cpp 24 *R.first = Strings.save(S); // safe replacement with equal value
25 return *R.first;
lib/Support/TargetRegistry.cpp 114 return LHS->first.compare(RHS->first);
114 return LHS->first.compare(RHS->first);
122 Width = std::max(Width, Targets.back().first.size());
128 OS << " " << Targets[i].first;
129 OS.indent(Width - Targets[i].first.size()) << " - "
lib/Support/TimeProfiler.cpp 99 CountAndTotal.first++;
145 auto Count = CountAndTotalPerName[E.first].first;
145 auto Count = CountAndTotalPerName[E.first].first;
153 J.attribute("name", "Total " + E.first);
lib/Support/Timer.cpp 194 delete I->second.first;
203 if (!GroupEntry.first)
204 GroupEntry.first = new TimerGroup(GroupName, GroupDescription);
208 T.init(Name, Description, *GroupEntry.first);
lib/Support/Triple.cpp 990 return StringRef(Data).split('-').first; // Isolate first component
995 return Tmp.split('-').first; // Isolate second component
1001 return Tmp.split('-').first; // Isolate third component
lib/Support/VirtualFileSystem.cpp 645 .first->second.get();
1207 error(Obj, Twine("missing key '") + I.first + "'");
lib/Support/YAMLParser.cpp 729 if (UnicodeScalarValue.first == 0x85)
731 else if (UnicodeScalarValue.first == 0xA0)
733 else if (UnicodeScalarValue.first == 0x2028)
735 else if (UnicodeScalarValue.first == 0x2029)
738 sys::unicode::isPrintable(UnicodeScalarValue.first))
741 std::string HexStr = utohexstr(UnicodeScalarValue.first);
836 && u8d.first != 0xFEFF
837 && ( u8d.first == 0x85
838 || ( u8d.first >= 0xA0
839 && u8d.first <= 0xD7FF)
840 || ( u8d.first >= 0xE000
841 && u8d.first <= 0xFFFD)
842 || ( u8d.first >= 0x10000
843 && u8d.first <= 0x10FFFF)))
lib/TableGen/JSONBackend.cpp 160 superclasses.push_back(SuperPair.first->getNameInitAsString());
170 auto SuperName = SuperPair.first->getNameInitAsString();
178 instanceof[kv.first] = std::move(kv.second);
lib/TableGen/Main.cpp 76 DepOut.os() << ' ' << Dep.first;
lib/TableGen/Record.cpp 529 auto &Entry = *ThePool.insert(V).first;
536 auto &Entry = *ThePool.insert(std::make_pair(V, nullptr)).first;
1646 NewRec->addSuperClass(SCPair.first, SCPair.second);
1922 Args.push_back(Arg.first);
2075 Record *SC = SCs.back().first;
2147 OS << " " << SuperPair.first->getNameInitAsString();
lib/TableGen/SetTheory.cpp 318 if (!isa<StringInit>(SCPair.first->getNameInit()))
320 auto I = Expanders.find(SCPair.first->getName());
lib/TableGen/StringMatcher.cpp 31 for (unsigned i = 0, e = Matches[0]->first.size(); i != e; ++i) {
33 char Letter = Matches[0]->first[i];
36 if (Matches[str]->first[i] != Letter)
40 return Matches[0]->first.size();
56 if (CharNo == Matches[0]->first.size()) {
64 OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n";
64 OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n";
69 OS << Indent << Split.first << "\n";
79 MatchesByLetter[Matches[i]->first[CharNo]].push_back(Matches[i]);
93 << Matches[0]->first[CharNo] << "')\n";
99 << ", \"" << Matches[0]->first.substr(CharNo, NumChars) << "\", "
116 OS << Indent << "case '" << LI->first << "':\t // "
139 MatchesByLength[Matches[i].first.size()].push_back(&Matches[i]);
148 OS.indent(Indent*2+2) << "case " << LI->first << ":\t // "
lib/TableGen/TGParser.cpp 278 if (CurRec->isSubClassOf(SCPair.first))
280 "Already subclass of '" + SCPair.first->getName() + "'!\n");
281 CurRec->addSuperClass(SCPair.first, SCPair.second);
376 R.set(S.first, S.second);
422 R.set(S.first, S.second);
1788 Bits[i] = BitInit::get(BinaryVal.first & (1LL << i));
2971 CurMultiClass = Result.first->second.get();
lib/Target/AArch64/AArch64A57FPLoadBalancing.cpp 563 if (U.clobbersPhysReg(J.first))
564 ToErase.push_back(J.first);
701 if (MO.clobbersPhysReg(I->first)) {
703 << printReg(I->first, TRI) << "\n");
lib/Target/AArch64/AArch64AsmPrinter.cpp 283 unsigned Reg = std::get<0>(P.first);
284 bool IsShort = std::get<1>(P.first);
285 uint32_t AccessInfo = std::get<2>(P.first);
lib/Target/AArch64/AArch64ExpandImm.cpp 57 const uint64_t ChunkVal = Chunk->first;
lib/Target/AArch64/AArch64FastISel.cpp 5054 unsigned IdxN = Pair.first;
lib/Target/AArch64/AArch64ISelLowering.cpp 2220 return makeLibCall(DAG, Call, MVT::f128, Ops, CallOptions, SDLoc(Op)).first;
2431 SDLoc(Op)).first;
2501 return makeLibCall(DAG, LC, Op.getValueType(), Ops, CallOptions, SDLoc(Op)).first;
2596 return CallResult.first;
3924 return Elt.first == VA.getLocReg();
4016 Chain = DAG.getCopyToReg(Chain, DL, RegToPass.first,
4074 Ops.push_back(DAG.getRegister(RegToPass.first,
4217 return Elt.first == VA.getLocReg();
4229 Chain = DAG.getCopyToReg(Chain, DL, RetVal.first, RetVal.second, Flag);
4232 DAG.getRegister(RetVal.first, RetVal.second.getValueType()));
6043 Res.first = AArch64::FPR64RegClass.getRegister(RegNo);
6046 Res.first = AArch64::FPR128RegClass.getRegister(RegNo);
12040 SDValue Ops[] = {N->getOperand(1), Desired.first, Desired.second,
12041 New.first, New.second, N->getOperand(0)};
lib/Target/AArch64/AArch64InstructionSelector.cpp 3755 unsigned Opc = getInsertVecEltOpInfo(RB, EltSize).first;
lib/Target/AArch64/AArch64MachineFunctionInfo.h 250 return It->second.first;
lib/Target/AArch64/AArch64PromoteConstant.cpp 216 Instruction *OldInstr = IPI->first;
352 Converted.first->second.ShouldConvert = shouldConvertImpl(&C);
353 return Converted.first->second.ShouldConvert;
375 if (NewPt == IPI.first || DT.dominates(IPI.first, NewPt) ||
375 if (NewPt == IPI.first || DT.dominates(IPI.first, NewPt) ||
379 (IPI.first->getParent() != NewPt->getParent() &&
380 DT.dominates(IPI.first->getParent(), NewPt->getParent()))) {
383 LLVM_DEBUG(IPI.first->print(dbgs()));
405 BasicBlock *CurBB = IPI->first->getParent();
411 LLVM_DEBUG(IPI->first->print(dbgs()));
433 LLVM_DEBUG(IPI->first->print(dbgs()));
495 IRBuilder<> Builder(IPI.first);
507 findInsertionPoint(*Use.first, Use.second)) &&
512 Use.first->print(dbgs());
515 Use.first->setOperand(Use.second, LoadedCst);
lib/Target/AArch64/AArch64SpeculationHardening.cpp 336 << " on instruction: " << *MI_Reg.first);
337 insertRegToSPTaintPropagation(MBB, MI_Reg.first, MI_Reg.second);
346 << " around instruction: " << *MI_Reg.first);
349 MBB, std::next((MachineBasicBlock::iterator)MI_Reg.first));
351 insertRegToSPTaintPropagation(MBB, MI_Reg.first, MI_Reg.second);
lib/Target/AArch64/AArch64StackOffset.h 59 int64_t OffsetInBytes = Other.first * (Other.second.getSizeInBits() / 8);
lib/Target/AArch64/AArch64TargetTransformInfo.cpp 254 unsigned NumDstEls = DstTyL.first * DstTyL.second.getVectorNumElements();
255 unsigned NumSrcEls = SrcTyL.first * SrcTyL.second.getVectorNumElements();
568 return (Cost + 1) * LT.first;
648 return LT.first * 2 * AmortizationCost;
669 return LT.first;
943 return LT.first * Entry->Cost;
995 return LT.first * Entry->Cost;
lib/Target/AArch64/AsmParser/AArch64AsmParser.cpp 827 return ShiftedVal->first >= 0 && ShiftedVal->first <= 0xfff;
827 return ShiftedVal->first >= 0 && ShiftedVal->first <= 0xfff;
840 return ShiftedVal->first < 0 && -ShiftedVal->first <= 0xfff;
840 return ShiftedVal->first < 0 && -ShiftedVal->first <= 0xfff;
859 AArch64_AM::isSVECpyImm<T>(uint64_t(ShiftedImm->first)
877 AArch64_AM::isSVEAddSubImm<T>(ShiftedImm->first
1540 Inst.addOperand(MCOperand::createImm(ShiftedVal->first));
1555 Inst.addOperand(MCOperand::createImm(-ShiftedVal->first));
2286 if (Kind == Entry->getValue().first)
5433 if (RegisterReqs.insert(std::make_pair(Name, pair)).first->second != pair)
lib/Target/AArch64/MCTargetDesc/AArch64ELFStreamer.cpp 88 LastMappingSymbols[getPreviousSection().first] = LastEMS;
lib/Target/AMDGPU/AMDGPUArgumentUsageInfo.cpp 57 OS << "Arguments for " << FI.first->getName() << '\n'
lib/Target/AMDGPU/AMDGPUAsmPrinter.cpp 445 SIFunctionResourceInfo &Info = I.first->second;
lib/Target/AMDGPU/AMDGPULibFunc.cpp 543 StringSwitch<AMDGPULibFunc::ENamePrefix>(P.first)
lib/Target/AMDGPU/AMDGPUMachineCFGStructurizer.cpp 152 assert((SI.second != SourceMBB || SourceReg == SI.first));
165 if (SI.first == SourceReg &&
167 ElimiatedSources.push_back(PHISourceT(SI.first, SI.second));
191 if (SI.first == SourceReg &&
207 Sources.push_back(SI.first);
273 dbgs() << printReg(SI.first, TRI) << '(' << printMBBReference(*SI.second)
1825 LLVM_DEBUG(dbgs() << "Removing edge: " << printMBBReference(*Edge.first)
1827 Edge.first->removeSuccessor(Edge.second);
2107 unsigned SourceReg = (*SRI).first;
2119 unsigned SourceReg = Source.first;
2156 unsigned SourceReg = (*SRI).first;
2167 unsigned SourceReg = (*SRI).first;
2267 unsigned SourceReg = (*SRI).first;
lib/Target/AMDGPU/AMDGPUMachineFunction.cpp 48 return Entry.first->second;
59 Entry.first->second = Offset;
lib/Target/AMDGPU/AMDGPUPropagateAttributes.cpp 251 R.first->setCalledFunction(R.second);
lib/Target/AMDGPU/AMDGPURewriteOutArguments.cpp 326 auto &ValVec = Replacements[Store.first];
329 return Entry.first == OutArg;}) != ValVec.end()) {
385 ReturnInst *RI = Replacement.first;
397 Argument *Arg = ReturnPoint.first;
lib/Target/AMDGPU/AMDGPUSubtarget.cpp 375 if (Requested.first > Requested.second)
379 if (Requested.first < getMinFlatWorkGroupSize())
404 Default.first = MinImpliedByFlatWorkGroupSize;
413 if (Requested.second && Requested.first > Requested.second)
417 if (Requested.first < getMinWavesPerEU() ||
418 Requested.first > getMaxWavesPerEU())
426 Requested.first < MinImpliedByFlatWorkGroupSize)
643 unsigned MaxNumSGPRs = getMaxNumSGPRs(WavesPerEU.first, false);
644 unsigned MaxAddressableNumSGPRs = getMaxNumSGPRs(WavesPerEU.first, true);
669 if (Requested && Requested > getMaxNumSGPRs(WavesPerEU.first, false))
693 unsigned MaxNumVGPRs = getMaxNumVGPRs(WavesPerEU.first);
703 if (Requested && Requested > getMaxNumVGPRs(WavesPerEU.first))
lib/Target/AMDGPU/AMDGPUTargetTransformInfo.cpp 366 return get64BitInstrCost() * LT.first * NElts;
369 return getFullRateInstrCost() * LT.first * NElts;
377 return 2 * getFullRateInstrCost() * LT.first * NElts;
380 return LT.first * NElts * getFullRateInstrCost();
385 return (4 * QuarterRateCost + (2 * 2) * FullRateCost) * LT.first * NElts;
389 return QuarterRateCost * NElts * LT.first;
395 return LT.first * NElts * get64BitInstrCost();
398 return LT.first * NElts * getFullRateInstrCost();
410 return LT.first * Cost * NElts;
417 return LT.first * getQuarterRateInstrCost() * NElts;
428 return LT.first * Cost * NElts;
439 return LT.first * NElts * Cost;
473 return LT.first * getFullRateInstrCost();
489 return LT.first * getHalfRateInstrCost();
lib/Target/AMDGPU/AMDILCFGStructurizer.cpp 859 assert(((*It).first)->getNumber() != -1);
860 LLVM_DEBUG(dbgs() << "Erase BB" << ((*It).first)->getNumber() << "\n";);
861 (*It).first->eraseFromParent(); //Remove from the parent Function.
lib/Target/AMDGPU/GCNDPPCombine.cpp 542 if (MRI->use_nodbg_empty(S.first->getOperand(0).getReg())) {
543 S.first->eraseFromParent();
547 S.first->getOperand(S.second.pop_back_val()).setIsUndef(true);
573 for (auto M : { Split.first, Split.second }) {
lib/Target/AMDGPU/GCNIterativeScheduler.cpp 351 Res.push_back(D->first);
lib/Target/AMDGPU/GCNNSAReassign.cpp 262 const MachineInstr *MI = C.first;
310 return LIS->getInstructionIndex(*C.first) < I;
313 LIS->getInstructionIndex(*I->first) < MaxInd; ++I) {
314 if (I->second && CheckNSA(*I->first, true) < NSA_Status::CONTIGUOUS) {
316 LLVM_DEBUG(dbgs() << "\tNSA conversion conflict with " << *I->first);
lib/Target/AMDGPU/GCNRegPressure.cpp 74 auto I = S2.find(P.first);
379 const LiveInterval &LI = LIS.getInterval(It.first);
385 CurPressure.inc(It.first, PrevMask, It.second, *MRI);
391 CurPressure.inc(It.first, PrevMask, It.second, *MRI);
394 LiveRegs.erase(It.first);
448 auto I = LISLR.find(P.first);
450 dbgs() << " " << printReg(P.first, TRI)
455 dbgs() << " " << printReg(P.first, TRI)
464 auto I = TrackedLR.find(P.first);
466 dbgs() << " " << printReg(P.first, TRI)
lib/Target/AMDGPU/GCNRegPressure.h 257 Res.inc(RM.first, LaneBitmask::getNone(), RM.second, MRI);
lib/Target/AMDGPU/GCNSchedStrategy.cpp 456 if (Regions[CurRegion].first->getParent() != MBB)
468 I = Rgn.first;
469 auto *NonDbgMI = &*skipDebugInstructionsForward(Rgn.first, Rgn.second);
478 if (Regions[CurRegion].first == I) {
509 auto *BB = I->first->getParent();
511 auto *MI = &*skipDebugInstructionsForward(I->first, I->second);
515 } while (I != E && I->first->getParent() == BB);
553 RegionBegin = Region.first;
lib/Target/AMDGPU/R600ControlFlowFinalizer.cpp 369 if (Src.first->getReg() != R600::ALU_LITERAL_X)
384 Src.first->setReg(LiteralRegs[Index]);
388 Src.first->setReg(LiteralRegs[Lits.size()]);
471 CounterPropagateAddr(*Clause.first, CfCount);
472 MachineBasicBlock *BB = Clause.first->getParent();
482 Clause.first->getOperand(0).setImm(0);
483 CounterPropagateAddr(*Clause.first, CfCount);
484 MachineBasicBlock *BB = Clause.first->getParent();
589 .addImm(Pair.first + 1);
lib/Target/AMDGPU/R600EmitClauseMarkers.cpp 143 if (Consts[i].first->getReg() != R600::ALU_CONST)
174 if (Consts[i].first->getReg() != R600::ALU_CONST)
176 switch(UsedKCache[j].first) {
178 Consts[i].first->setReg(
182 Consts[i].first->setReg(
298 .addImm(KCacheBanks.empty()?0:KCacheBanks[0].first) // KB0
299 .addImm((KCacheBanks.size() < 2)?0:KCacheBanks[1].first) // KB1
lib/Target/AMDGPU/R600InstrInfo.cpp 350 Register Reg = Src.first->getReg();
377 Src[1].first = -1;
441 if (Src.first < 0 || Src.first == 255)
441 if (Src.first < 0 || Src.first == 255)
443 if (Src.first == GET_REG_INDEX(RI.getEncodingValue(R600::OQAP))) {
454 Vector[Src.second][j] = Src.first;
455 if (Vector[Src.second][j] != Src.first)
463 if (Src.first < 0)
465 if (Src.first == 255)
468 Vector[Src.second][Cycle] = Src.first;
469 if (Vector[Src.second][Cycle] != Src.first)
524 if (Src.first < 0)
618 if (Src.first->getReg() == R600::ALU_LITERAL_X)
622 if (Src.first->getReg() == R600::ALU_CONST)
624 if (R600::R600_KC0RegClass.contains(Src.first->getReg()) ||
625 R600::R600_KC1RegClass.contains(Src.first->getReg())) {
626 unsigned Index = RI.getEncodingValue(Src.first->getReg()) & 0xff;
627 unsigned Chan = RI.getHWRegChan(Src.first->getReg());
1194 unsigned Reg = LI.first;
lib/Target/AMDGPU/R600OptimizeVectorRegisters.cpp 171 Untouched->RegToChan.find((*It).first);
191 if (RemapChan[j].first == Chan)
211 unsigned SubReg = (*It).first;
274 if (RemapChan[j].first == Swizzle) {
327 PreviousRegSeqByReg[(*It).first].push_back(RSI.Instr);
lib/Target/AMDGPU/SIAnnotateControlFlow.cpp 169 return !Stack.empty() && Stack.back().first == BB;
294 assert(Stack.back().first == BB);
lib/Target/AMDGPU/SIFixSGPRCopies.cpp 489 return C.first != Init.first &&
489 return C.first != Init.first &&
lib/Target/AMDGPU/SIFoldOperands.cpp 520 const MachineOperand *Op = Defs[I].first;
537 appendFoldCandidate(FoldList, UseMI, UseOpIdx, Defs[0].first);
701 MachineOperand *Def = Defs[I].first;
lib/Target/AMDGPU/SIFormMemoryClauses.cpp 282 Loc->second.first |= State;
375 forAllLanes(R.first, R.second.second, [&R, &B](unsigned SubReg) {
376 unsigned S = R.second.first | RegState::EarlyClobber;
379 B.addDef(R.first, S, SubReg);
384 forAllLanes(R.first, R.second.second, [&R, &B](unsigned SubReg) {
385 B.addUse(R.first, R.second.first & ~RegState::Kill, SubReg);
385 B.addUse(R.first, R.second.first & ~RegState::Kill, SubReg);
390 unsigned Reg = R.first;
399 unsigned Reg = R.first;
lib/Target/AMDGPU/SIISelLowering.cpp 2521 = CallerArgInfo.getPreloadedValue(AMDGPUFunctionArgInfo::WORKITEM_ID_X).first;
2523 = CallerArgInfo.getPreloadedValue(AMDGPUFunctionArgInfo::WORKITEM_ID_Y).first;
2525 = CallerArgInfo.getPreloadedValue(AMDGPUFunctionArgInfo::WORKITEM_ID_Z).first;
2886 Chain = DAG.getCopyToReg(Chain, DL, RegToPass.first,
2940 Ops.push_back(DAG.getRegister(RegToPass.first,
6294 Offsets.first, // voffset
6314 Offsets.first, // voffset
6365 Offsets.first, // voffset
6389 Offsets.first, // voffset
6495 Offsets.first, // voffset
6569 Offsets.first, // voffset
6662 Offsets.first, // voffset
6683 Offsets.first, // voffset
6873 Offsets.first, // voffset
6898 Offsets.first, // voffset
6977 Offsets.first, // voffset
7022 Offsets.first, // voffset
lib/Target/AMDGPU/SIInsertWaitcnts.cpp 480 Result.first = Reg - RegisterEncoding.VGPR0;
481 assert(Result.first >= 0 && Result.first < SQ_MAX_PGM_VGPRS);
481 assert(Result.first >= 0 && Result.first < SQ_MAX_PGM_VGPRS);
484 Result.first = Reg - RegisterEncoding.SGPR0 + NUM_ALL_VGPRS;
485 assert(Result.first >= NUM_ALL_VGPRS &&
486 Result.first < SQ_MAX_PGM_SGPRS + NUM_ALL_VGPRS);
496 Result.second = Result.first + (Size / 32);
511 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) {
650 if (T == VM_CNT && Interval.first >= NUM_ALL_VGPRS)
652 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) {
952 for (signed RegNo = CallAddrOpInterval.first;
963 for (signed RegNo = RtnAddrOpInterval.first;
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 1652 dbgs() << ")"; P.first->dump());
1653 updateBaseAndOffset(*P.first, Base, P.second - AnchorAddr.Offset);
1654 LLVM_DEBUG(dbgs() << " After promotion: "; P.first->dump());
lib/Target/AMDGPU/SIMachineFunctionInfo.cpp 392 if (R.first != FramePointerSaveIndex)
393 MFI.RemoveStackObject(R.first);
405 MFI.RemoveStackObject(R.first);
lib/Target/AMDGPU/SIMachineFunctionInfo.h 668 auto Arg = ArgInfo.getPreloadedValue(Value).first;
830 return FlatWorkGroupSizes.first;
846 return WavesPerEU.first;
880 return PSV.first->second.get();
889 return PSV.first->second.get();
lib/Target/AMDGPU/SIMachineScheduler.cpp 550 return PredID == S.first->getID();
561 if (SuccID == S.first->getID()) {
594 S.first->printDebug(false);
912 SUColors.first = CurrentTopDownReservedDependencyColoring[SU->NodeNum];
1440 Height = std::max(Height, Succ.first->Height + Succ.first->getCost());
1440 Height = std::max(Height, Succ.first->Height + Succ.first->getCost());
1716 if (--BlockNumPredsLeft[Block.first->getID()] == 0)
1717 ReadyBlocks.push_back(Block.first);
1721 LastPosHighLatencyParentScheduled[Block.first->getID()] = NumBlockScheduled;
1734 assert(LiveRegsConsumers.find(RegP.first) == LiveRegsConsumers.end() ||
1735 LiveRegsConsumers[RegP.first] == 0);
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 762 MachineOperand *OrSDWADef = Res->first;
1246 MachineInstr &PotentialMI = *PotentialPair.first;
lib/Target/AMDGPU/SIWholeQuadMode.cpp 231 << printMBBReference(*BII.first) << ":\n"
236 for (const MachineInstr &MI : *BII.first) {
931 processBlock(*BII.first, LiveMaskReg, BII.first == &*MF.begin());
931 processBlock(*BII.first, LiveMaskReg, BII.first == &*MF.begin());
lib/Target/AMDGPU/Utils/AMDGPUBaseInfo.cpp 587 if (Strs.first.trim().getAsInteger(0, Ints.first)) {
587 if (Strs.first.trim().getAsInteger(0, Ints.first)) {
lib/Target/AMDGPU/Utils/AMDGPUPALMetadata.cpp 559 unsigned Reg = I->first.getUInt();
574 auto Key = I.first;
612 EW.write(uint32_t(I.first.getUInt()));
637 auto Key = I.first;
lib/Target/ARC/ARCBranchFinalize.cpp 170 if (isBRccPseudo(P.first))
171 isInt<9>(MaxSize) ? replaceWithBRcc(P.first) : replaceWithCmpBcc(P.first);
171 isInt<9>(MaxSize) ? replaceWithBRcc(P.first) : replaceWithCmpBcc(P.first);
lib/Target/ARC/ARCISelLowering.cpp 315 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
340 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
398 int Offset = ResultMemLocs[i].first;
lib/Target/ARM/ARMAsmPrinter.cpp 175 .addReg(TIP.first)
532 emitNonLazySymbolPointer(*OutStreamer, Stub.first, Stub.second);
545 emitNonLazySymbolPointer(*OutStreamer, Stub.first, Stub.second);
1332 if (TIP.first == TReg) {
lib/Target/ARM/ARMBaseInstrInfo.cpp 3176 OperandsToUpdate[i].first->setImm(OperandsToUpdate[i].second);
lib/Target/ARM/ARMBaseRegisterInfo.cpp 311 switch (Hint.first) {
359 if ((Hint.first == (unsigned)ARMRI::RegPairOdd ||
360 Hint.first == (unsigned)ARMRI::RegPairEven) &&
370 MRI->setRegAllocationHint(OtherReg, Hint.first, NewReg);
373 Hint.first == (unsigned)ARMRI::RegPairOdd ? ARMRI::RegPairEven
lib/Target/ARM/ARMFrameLowering.cpp 1020 return TRI.getEncodingValue(LHS.first) < TRI.getEncodingValue(RHS.first);
1020 return TRI.getEncodingValue(LHS.first) < TRI.getEncodingValue(RHS.first);
1029 MIB.addReg(Regs[i].first, getKillRegState(Regs[i].second));
1032 .addReg(Regs[0].first, getKillRegState(Regs[0].second))
lib/Target/ARM/ARMISelDAGToDAG.cpp 2893 NewN = EmitShift(ARM::tLSLri, X, 31 - Range->first);
2895 } else if (Range->first == 31) {
2899 } else if (Range->first == Range->second) {
2902 NewN = EmitShift(ARM::tLSLri, X, 31 - Range->first);
2909 NewN = EmitShift(ARM::tLSLri, X, 31 - Range->first);
2911 Range->second + (31 - Range->first));
4597 std::string Reg = Fields.first.str();
lib/Target/ARM/ARMISelLowering.cpp 2260 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
2398 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
3212 return CallResult.first;
5373 CallOptions, SDLoc(Op)).first;
5438 CallOptions, SDLoc(Op)).first;
7183 Value = ValueCounts.begin()->first;
8784 return CallResult.first;
8834 return LowerCallTo(CLI).first;
9145 return !CI.second.getNode() ? DAG.getRoot() : CI.first;
16012 return CallInfo.first;
16055 SDNode *ResNode = CallResult.first.getNode();
16131 makeLibCall(DAG, LC, MVT::f32, SrcVal, CallOptions, Loc).first;
16144 return makeLibCall(DAG, LC, MVT::f64, SrcVal, CallOptions, Loc).first;
16171 return makeLibCall(DAG, LC, DstVT, SrcVal, CallOptions, Loc).first;
lib/Target/ARM/ARMInstructionSelector.cpp 402 Preds.first = ARMCC::EQ;
406 Preds.first = ARMCC::GT;
410 Preds.first = ARMCC::GE;
414 Preds.first = ARMCC::HI;
417 Preds.first = ARMCC::MI;
421 Preds.first = ARMCC::LS;
424 Preds.first = ARMCC::VC;
427 Preds.first = ARMCC::VS;
430 Preds.first = ARMCC::PL;
434 Preds.first = ARMCC::LT;
438 Preds.first = ARMCC::LE;
442 Preds.first = ARMCC::NE;
445 Preds.first = ARMCC::HS;
448 Preds.first = ARMCC::LO;
453 assert(Preds.first != ARMCC::AL && "No comparisons needed?");
554 if (!insertComparison(Helper, I, ResReg, ARMConds.first, LHSReg, RHSReg,
560 if (!insertComparison(Helper, I, IntermediateRes, ARMConds.first, LHSReg,
lib/Target/ARM/ARMLegalizerInfo.cpp 41 if (i + 1 < v[i].first && i + 1 < v.size() &&
42 v[i + 1].first != v[i].first + 1)
42 v[i + 1].first != v[i].first + 1)
43 result.push_back({v[i].first + 1, Unsupported});
50 assert(v[0].first > 17);
57 auto Largest = result.back().first;
lib/Target/ARM/ARMLoadStoreOptimizer.cpp 615 if (R.first == Reg)
683 NewBase = Regs[NumRegs-1].first;
692 LiveRegs.addReg(R.first);
818 MIB.addReg(R.first, getDefRegState(isDef) | getKillRegState(R.second));
839 MIB.addReg(Regs[0].first, RegState::Define)
840 .addReg(Regs[1].first, RegState::Define);
842 MIB.addReg(Regs[0].first, getKillRegState(Regs[0].second))
843 .addReg(Regs[1].first, getKillRegState(Regs[1].second));
lib/Target/ARM/ARMMachineFunctionInfo.h 233 It = CoalescedWeights.insert(std::make_pair(MBB, 0)).first;
lib/Target/ARM/ARMParallelDSP.cpp 428 LLVM_DEBUG(dbgs() << *MapIt.first << ", "
716 MulCandidate *LHSMul = Pair.first;
lib/Target/ARM/ARMTargetTransformInfo.cpp 165 return LT.first * Entry->Cost;
464 return LT.first;
571 return LT.first * Entry->Cost;
593 return LT.first * Entry->Cost;
617 return LT.first * Entry->Cost;
634 return LT.first * Entry->Cost * ST->getMVEVectorCostFactor();
696 return LT.first * Entry->Cost;
724 return LT.first * BaseCost;
748 return LT.first * 4;
753 return BaseCost * LT.first;
lib/Target/ARM/AsmParser/ARMAsmParser.cpp 4269 if (J->first == Enc) {
4273 if (J->first < Enc)
10735 if (RegisterReqs.insert(std::make_pair(Name, Reg)).first->second != Reg)
11575 if (std::any_of(PrevReports.first, PrevReports.second,
lib/Target/ARM/MCTargetDesc/ARMELFStreamer.cpp 474 LastMappingSymbols[getCurrentSection().first] = std::move(LastEMSInfo);
lib/Target/ARM/MVETailPredication.cpp 404 Instruction *OldPred = Pair.first;
lib/Target/AVR/AVRISelLowering.cpp 395 return CallInfo.first;
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 706 Call = AIChain[Call].first;
724 Call = StackElem.first;
920 Transformed = transformGEPChain(M, C.first, C.second) || Transformed;
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 371 return OffsetM.first;
571 Fixup.first = CTag == dwarf::DW_TAG_union_type;
800 std::to_string(FuncSec.first));
801 OS.EmitIntValue(FuncSec.first, 4);
814 std::to_string(LineSec.first));
815 OS.EmitIntValue(LineSec.first, 4);
833 std::to_string(FieldRelocSec.first));
834 OS.EmitIntValue(FieldRelocSec.first, 4);
1156 StringRef TypeName = Fixup.first;
1157 bool IsUnion = Fixup.second.first;
lib/Target/Hexagon/AsmParser/HexagonAsmParser.cpp 852 if (!HeadTail.first.empty())
854 HexagonOperand::CreateToken(getContext(), HeadTail.first, Loc));
857 getContext(), String.substr(HeadTail.first.size(), 1), Loc));
944 if (!matchRegister(DotSplit.first.lower()))
990 unsigned DotReg = matchRegister(DotSplit.first.lower());
1010 unsigned ColonReg = matchRegister(ColonSplit.first.lower());
lib/Target/Hexagon/BitTracker.cpp 184 dbgs() << printReg(P.first, &ME.TRI) << " -> " << P.second << "\n";
864 RegisterRef RD(P.first);
865 dbgs() << " " << printReg(P.first, &ME.TRI) << " cell: "
lib/Target/Hexagon/HexagonAsmPrinter.cpp 333 OutStreamer->SwitchSection(Current.first, Current.second);
349 OutStreamer->SwitchSection(Current.first, Current.second);
lib/Target/Hexagon/HexagonBitTracker.cpp 1288 if (P.first == PReg)
lib/Target/Hexagon/HexagonBlockRanges.cpp 180 return I.first;
214 Map.erase(I.first);
409 Left.insert(I.first);
412 Left.insert(I.first);
485 if (Register::isVirtualRegister(P.first.Reg))
486 addDeadRanges(P.first);
533 OS << printReg(I.first.Reg, &P.TRI, I.first.Sub) << " -> " << RL << "\n";
533 OS << printReg(I.first.Reg, &P.TRI, I.first.Sub) << " -> " << RL << "\n";
lib/Target/Hexagon/HexagonBlockRanges.h 84 IndexType start() const { return first; }
99 void setStart(const IndexType &S) { first = S; }
lib/Target/Hexagon/HexagonCommonGEP.cpp 292 OS << I->first << " -> #" << Us.size() << '{';
581 dbgs() << "{ " << I->first << ", " << I->second << " }\n";
938 OS << I->first << " -> ";
1048 GepNode *N = I->first;
lib/Target/Hexagon/HexagonConstExtenders.cpp 485 OS << '[' << P.ExtI.first << ", "
558 OS << " " << PrintInit(Q.first, P.HRI) << " -> {";
1315 dbgs() << " " << P.first << " ->";
1359 if (R.Align < P0.first)
1360 CandSet.insert(adjustUp(R.Min, P0.first, P0.second));
1363 if (R.Align < P1.first)
1364 CandSet.insert(adjustDown(R.Max, P1.first, P1.second));
1394 int32_t Best = BestIt->first;
1414 if (P.first.second.trivial())
1418 const ExtValue &EV = P.first.first;
1418 const ExtValue &EV = P.first.first;
1532 const ExtValue &EV = ExtI.first;
1750 const ExtValue &EV = ExtI.first; (void)EV;
1833 const ExtValue &DefV = ExtI.first;
1875 assert(P.first->getNumOperands() > J+1 &&
1876 P.first->getOperand(J+1).isImm());
1877 MachineOperand &ImmOp = P.first->getOperand(J+1);
1903 calculatePlacement(P.first, Idxs, Defs);
1905 Register DefR = insertInitializer(Q.first, P.first);
1905 Register DefR = insertInitializer(Q.first, P.first);
1908 Changed |= replaceInstr(I, DefR, P.first);
lib/Target/Hexagon/HexagonConstPropagation.cpp 615 dbgs() << " " << printReg(I.first, &TRI) << " -> " << I.second << '\n';
878 << printMBBReference(*MF.getBlockNumbered(Edge.first)) << "->"
880 if (Edge.first != EntryNum)
lib/Target/Hexagon/HexagonExpandCondsets.cpp 431 if (P.first != nullptr || P.second)
477 } else if (P.first) {
519 RegisterRef R = P.first;
lib/Target/Hexagon/HexagonFrameLowering.cpp 2059 auto &IndexMap = P.first->second;
2151 auto &RL = FIRangeMap[I.first].Map[&B];
2152 IndexType &LS = LastStore[I.first];
2163 auto &RL = FIRangeMap[I.first].Map[&B];
2170 dbgs() << "fi#" << P.first;
2171 if (BadFIs.count(P.first))
2179 dbgs() << " " << printMBBReference(*R.first) << " { " << R.second
2193 if (BadFIs.count(P.first))
2202 LoxFIs.insert(P.first);
2203 BlockFIMap[&B].push_back(P.first);
2213 dbgs() << " " << printMBBReference(*P.first) << ": {";
lib/Target/Hexagon/HexagonGenInsert.cpp 584 dbgs() << " " << printReg(I->first, HRI) << ":\n";
587 dbgs() << " " << PrintIFR(LL[i].first, HRI) << ", "
633 VRs.push_back(I->first);
864 dbgs() << " L=" << I->first << ':';
867 dbgs() << " (" << printReg(LL[i].first, HRI) << ",@"
910 unsigned InsR = LL[i].first;
1043 findRemovableRegisters(I->first, LL[i].first, LL[i].second);
1043 findRemovableRegisters(I->first, LL[i].first, LL[i].second);
1096 IFRecord MaxIF = LL[0].first;
1099 const IFRecord &IF = LL[i].first;
1156 unsigned SR = LL[i-1].first.SrcR, IR = LL[i-1].first.InsR;
1156 unsigned SR = LL[i-1].first.SrcR, IR = LL[i-1].first.InsR;
1175 return IR.first.Wdh == 32 && (IR.first.Off == 0 || IR.first.Off == 32);
1175 return IR.first.Wdh == 32 && (IR.first.Off == 0 || IR.first.Off == 32);
1175 return IR.first.Wdh == 32 && (IR.first.Off == 0 || IR.first.Off == 32);
1188 pruneCoveredSets(I->first);
1202 pruneUsesTooFar(I->first, RPO, Memo);
1207 pruneRegCopies(I->first);
1254 unsigned OSA = BaseOrd[A.first.SrcR], OSB = BaseOrd[B.first.SrcR];
1254 unsigned OSA = BaseOrd[A.first.SrcR], OSB = BaseOrd[B.first.SrcR];
1257 unsigned OIA = BaseOrd[A.first.InsR], OIB = BaseOrd[B.first.InsR];
1257 unsigned OIA = BaseOrd[A.first.InsR], OIB = BaseOrd[B.first.InsR];
1260 if (A.first.Wdh != B.first.Wdh)
1260 if (A.first.Wdh != B.first.Wdh)
1261 return A.first.Wdh < B.first.Wdh;
1261 return A.first.Wdh < B.first.Wdh;
1262 return A.first.Off < B.first.Off;
1262 return A.first.Off < B.first.Off;
1346 const MachineInstr *DefI = MRI->getVRegDef(I->first);
1387 unsigned SR = LL[0].first.SrcR, IR = LL[0].first.InsR;
1387 unsigned SR = LL[0].first.SrcR, IR = LL[0].first.InsR;
1400 unsigned VR = I->first;
1410 MachineInstr *MI = MRI->getVRegDef(I->first);
1413 unsigned NewR = RegMap[I->first];
1417 IFRecord IF = I->second[0].first;
1444 MachineInstr *DefI = MRI->getVRegDef(I->first);
1445 MRI->replaceRegWith(I->first, RegMap[I->first]);
1445 MRI->replaceRegWith(I->first, RegMap[I->first]);
1541 unsigned VR = I->first, Pos = I->second;
1600 unsigned Idx = Register::virtReg2Index(I->first);
lib/Target/Hexagon/HexagonGenMux.cpp 262 F = It.first;
lib/Target/Hexagon/HexagonHardwareLoops.cpp 499 Reg = F->second.first;
501 IVOp = MRI->getVRegDef(F->first);
1751 if (CmpRegs.count(I->first))
1758 if (CmpRegs.count(RB.first)) {
1769 if (MO.isReg() && MO.getReg() == RB.first) {
1771 << ") = " << *(MRI->getVRegDef(I->first)));
1775 IndI = MRI->getVRegDef(I->first);
1793 IndMO->setReg(I->first);
1827 MachineInstr *BumpI = MRI->getVRegDef(I->first);
1836 if (MO.isReg() && MO.getReg() == RB.first) {
1837 MO.setReg(I->first);
lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp 207 if (!P.first)
214 Node N = E.first;
218 if (!P.first)
227 Node N = E.first;
236 if (P.first) {
287 dbgs() << " " << E.first << " -> {";
308 dbgs() << " " << C.first << " -> " << ColorKindToName(C.second) << "\n";
1476 TmpQ.insert(F->first);
1533 if (Strip.first == 0 && Strip.second == 1 && NextInMask == 4) {
1557 if (Strip.first != 0 && Strip.first != L)
1557 if (Strip.first != 0 && Strip.first != L)
1564 if (S.first - Strip.first != 2*I)
1564 if (S.first - Strip.first != 2*I)
1573 assert(Strip.first == 0 || Strip.first == L);
1573 assert(Strip.first == 0 || Strip.first == L);
1577 ? (Strip.first == 0 ? V6_vpackeb : V6_vpackob)
1578 : (Strip.first == 0 ? V6_vpackeh : V6_vpackoh);
1594 int Diff = Flip ? PrevS.first - S.first + 2*L
1594 int Diff = Flip ? PrevS.first - S.first + 2*L
1595 : S.first - PrevS.first;
1595 : S.first - PrevS.first;
1603 assert(Strip.first == 0 || Strip.first == L);
1603 assert(Strip.first == 0 || Strip.first == L);
1607 ? (Strip.first == 0 ? V6_vshuffeb : V6_vshuffob)
1608 : (Strip.first == 0 ? V6_vshufeh : V6_vshufoh);
1638 if (Strip.first != 0)
1653 if (2*S.first != I)
1659 if (S.first != -1 || S.second != unsigned(L))
lib/Target/Hexagon/HexagonISelLowering.cpp 460 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
477 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
506 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
2022 return getInstr(Hexagon::S2_packhl, dl, VecTy, {P.second, P.first}, DAG);
2690 return DAG.getMergeValues({P.first, P.second}, dl);
2704 unsigned BaseOpc = BO.first.getOpcode();
2709 BO.first = DAG.getNode(ISD::ADD, dl, MVT::i32, BO.first,
2709 BO.first = DAG.getNode(ISD::ADD, dl, MVT::i32, BO.first,
2714 ? DAG.getNode(HexagonISD::VALIGNADDR, dl, MVT::i32, BO.first,
2716 : BO.first;
3229 if (BO.first.getOpcode() == HexagonISD::CONST32_GP)
3231 if (GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(BO.first)) {
lib/Target/Hexagon/HexagonISelLowering.h 379 return { Ops.first.getValueType().getSimpleVT(),
lib/Target/Hexagon/HexagonISelLoweringHVX.cpp 212 assert(Tys.first.getVectorElementType() == Tys.second.getVectorElementType());
214 MVT ElemTy = Tys.first.getVectorElementType();
215 return MVT::getVectorVT(ElemTy, Tys.first.getVectorNumElements() +
255 Ops.second, Ops.first);
264 return DAG.SplitVector(Vec, dl, Tys.first, Tys.second);
780 VecTy = typeSplit(VecTy).first;
1034 MVT SingleTy = typeSplit(VecTy).first;
1104 MVT HalfTy = typeSplit(VecTy).first;
1294 SDValue BS = getByteShuffle(dl, P.first, P.second, ShuffMask, DAG);
1352 SDValue BS = getByteShuffle(dl, P.first, P.second, ShuffMask, DAG);
1448 MVT Ty = typeSplit(N->getVT().getSimpleVT()).first;
1462 OpsL.push_back(P.first);
1467 MVT HalfTy = typeSplit(ResTy).first;
1484 MVT SingleTy = typeSplit(MemTy).first;
1509 SDValue Store0 = DAG.getStore(Chain, dl, Vals.first, Base0, MOp0);
lib/Target/Hexagon/HexagonOptAddrMode.cpp 226 const auto &ReachingDefs = P.first;
268 if (!DFG->getPRI().alias(RegisterRef(I.first), DR))
272 NodeAddr<UseNode *> phiUA = DFG->addr<UseNode *>(phiUI.first);
lib/Target/Hexagon/HexagonPeephole.cpp 227 PeepholeSrc.first, false /*isDef*/, false /*isImp*/,
lib/Target/Hexagon/HexagonSplitDouble.cpp 305 P2Rs[I.second].insert(I.first);
617 R = (SubR == Hexagon::isub_lo) ? P.first : P.second;
652 LowI = BuildMI(B, MI, DL, TII->get(Hexagon::L2_loadri_io), P.first)
664 .addReg(P.first);
721 BuildMI(B, MI, DL, TII->get(Hexagon::A2_tfrsi), P.first)
749 BuildMI(B, MI, DL, TII->get(Hexagon::A2_tfrsi), P.first)
752 BuildMI(B, MI, DL, TII->get(TargetOpcode::COPY), P.first)
770 BuildMI(B, MI, DL, TII->get(TargetOpcode::COPY), P.first)
792 Register LoR = P.first;
917 unsigned LoR = P.first;
1089 Op.setReg(P.first);
1118 .addReg(Pr.first)
1210 dbgs() << '#' << I->first << " -> ";
1220 if (I->first == 0)
1225 LLVM_DEBUG(dbgs() << "Calculating profit for partition #" << I->first
lib/Target/Hexagon/HexagonTargetTransformInfo.cpp 143 return LT.first + 2;
234 return LT.first + FloatFactor * getTypeNumElements(ValTy);
246 return LT.first + FloatFactor * getTypeNumElements(Ty);
260 return std::max(SrcLT.first, DstLT.first) + FloatFactor * (SrcN + DstN);
260 return std::max(SrcLT.first, DstLT.first) + FloatFactor * (SrcN + DstN);
lib/Target/Hexagon/HexagonVExtract.cpp 120 unsigned VecR = P.first;
lib/Target/Hexagon/MCTargetDesc/HexagonMCChecker.cpp 568 unsigned R = I.first;
lib/Target/Hexagon/MCTargetDesc/HexagonMCELFStreamer.cpp 122 SwitchSection(P.first, P.second);
lib/Target/Hexagon/MCTargetDesc/HexagonMCTargetDesc.cpp 151 auto HeadTail = PacketBundle.first.split('\n');
155 while (!HeadTail.first.empty()) {
157 auto Duplex = HeadTail.first.split('\v');
159 OS << Indent << Duplex.first << Separator;
161 } else if (!HeadTail.first.trim().startswith("immext")) {
162 InstTxt = Duplex.first;
328 Result.first = Hexagon_MC::selectHexagonCPU(CPU);
329 Result.second = selectHexagonFS(Result.first, FS);
388 StringRef CPUName = Features.first;
lib/Target/Hexagon/MCTargetDesc/HexagonShuffler.cpp 153 setUnits((*TUL)[T].first);
674 SM->PrintMessage(I.first, SourceMgr::DK_Note, I.second);
lib/Target/Hexagon/RDFCopy.cpp 110 dbgs() << ' ' << Print<RegisterRef>(J.first, DFG) << '='
lib/Target/Hexagon/RDFGraph.cpp 898 LiveIns.insert(RegisterRef(P.first));
1230 IA.Addr->addMemberAfter(Loc.first, NA, *this);
lib/Target/Hexagon/RDFLiveness.cpp 63 OS << ' ' << printReg(I.first, &P.G.getTRI()) << '{';
65 OS << Print<NodeId>(J->first, P.G) << PrintLaneMaskOpt(J->second);
312 return { T.first, false };
313 Result.insert(T.first.begin(), T.first.end());
313 Result.insert(T.first.begin(), T.first.end());
519 auto UA = DFG.addr<UseNode*>(I.first);
522 RegisterRef R(UI->first, I.second);
533 RegisterRef S = PRI.mapTo(RC, UI->first);
534 UI->second.insert({I.first, S.Mask});
584 dbgs() << "phi " << Print<NodeId>(I.first, DFG) << " -> {";
586 dbgs() << ' ' << Print<NodeId>(R.first, DFG)
640 RegisterRef R(T.first);
644 const RegisterAggr &DRs = PhiDRs.at(P.first);
647 R = PRI.mapTo(DRs.intersectWith(R), T.first);
653 NodeRefSet &RS = RealUseMap[P.first][SS.Reg];
654 Changed |= RS.insert({V.first,SS.Mask}).second;
660 PhiUQ.push_back(P.first);
668 dbgs() << "phi " << Print<NodeId>(I.first, DFG);
669 NodeAddr<PhiNode*> PA = DFG.addr<PhiNode*>(I.first);
716 IIDF[S].insert(I.first);
729 LON[S.first].insert(S.second.begin(), S.second.end());
735 dbgs() << "block #" << I.first->getNumber() << " -> "
777 RegisterRef S(RS.first, P.second);
798 dbgs() << "block #" << I.first->getNumber() << " -> "
960 LiveIn[S.first].insert(S.second.begin(), S.second.end());
976 LiveIn[S.first].insert(S.second.begin(), S.second.end());
995 RegisterRef LRef(LE.first);
1000 auto DA = DFG.addr<DefNode*>(OR.first);
1097 Local.insert(RegisterRef(R.first,M));
1110 if (MDT.properlyDominates(getBlockWithRef(R.first), C))
1111 LiveC.insert(RegisterRef(S.first, R.second));
lib/Target/Hexagon/RDFLiveness.h 41 return Map.emplace(B, Empty).first->second;
lib/Target/Hexagon/RDFRegisters.cpp 61 UnitInfo &UI = UnitInfos[P.first];
152 if (PA.first == PB.first)
152 if (PA.first == PB.first)
154 if (PA.first < PB.first)
154 if (PA.first < PB.first)
156 else if (PB.first < PA.first)
156 else if (PB.first < PA.first)
247 if (Units.test(P.first))
262 if (!Units.test(P.first))
277 Units.set(P.first);
358 if (Units.test(P.first))
lib/Target/Hexagon/RDFRegisters.h 197 return RegisterRef(Pos->first, Pos->second);
lib/Target/Lanai/LanaiISelLowering.cpp 715 Chain = DAG.getCopyToReg(Chain, DL, RegsToPass[I].first,
748 Ops.push_back(DAG.getRegister(RegsToPass[I].first,
lib/Target/MSP430/MSP430ISelLowering.cpp 875 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
897 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
lib/Target/Mips/AsmParser/MipsAsmParser.cpp 8536 return MnemonicRange.first != MnemonicRange.second;
lib/Target/Mips/MicroMipsSizeReduction.cpp 428 if (Range.first == Range.second)
431 for (ReduceEntryVector::const_iterator Entry = Range.first;
lib/Target/Mips/Mips16ISelDAGToDAG.cpp 201 ReplaceUses(SDValue(Node, 0), SDValue(LoHi.first, 0));
lib/Target/Mips/MipsAsmPrinter.cpp 88 const char *Symbol = it->first;
1127 const char *Symbol = it->first;
lib/Target/Mips/MipsBranchExpansion.cpp 752 Inst = Res.first;
lib/Target/Mips/MipsDelaySlotFiller.cpp 320 I->first->insert(I->first->end(), MF->CloneMachineInstr(&*Filler));
320 I->first->insert(I->first->end(), MF->CloneMachineInstr(&*Filler));
895 if (P.first == MipsInstrInfo::BT_None)
898 if ((P.first != MipsInstrInfo::BT_Uncond) &&
899 (P.first != MipsInstrInfo::BT_NoBranch)) {
lib/Target/Mips/MipsISelLowering.cpp 2054 SDValue Ret = CallResult.first;
2934 Chain = CLI.DAG.getCopyToReg(Chain, CLI.DL, RegsToPass[i].first,
2942 Ops.push_back(CLI.DAG.getRegister(RegsToPass[i].first,
3885 if (!R.first)
lib/Target/Mips/MipsOptimizePICCall.cpp 304 return ScopedHT.lookup(Entry).first;
315 ScopedHT.insert(Entry, std::make_pair(P.first + 1, Reg));
lib/Target/Mips/MipsSEFrameLowering.cpp 248 if (!Opcodes.first)
251 return expandCopyACC(MBB, I, Opcodes.first, Opcodes.second);
lib/Target/NVPTX/NVPTXPrologEpilogPass.cpp 192 LLVM_DEBUG(dbgs() << "alloc FI(" << Entry.first << ") at SP[" << FIOffset
194 MFI.setObjectOffset(Entry.first, FIOffset);
lib/Target/NVPTX/NVPTXTargetTransformInfo.cpp 135 return 2 * LT.first;
lib/Target/PowerPC/PPCAsmPrinter.cpp 1428 OutStreamer->SwitchSection(Current.first, Current.second);
1451 const MCSymbol *const TOCEntryTarget = TOCMapPair.first;
1689 OutStreamer->EmitLabel(Stubs[i].first);
1806 OutStreamer->SwitchSection(Current.first, Current.second);
lib/Target/PowerPC/PPCBoolRetToInt.cpp 252 auto *First = dyn_cast<User>(Pair.first);
lib/Target/PowerPC/PPCBranchSelector.cpp 130 BS.first += AlignExtra;
143 BlockSizes[MBB->getNumber()].first = BlockSize;
159 BS.first -= BS.second;
164 BS.first += AlignExtra;
170 Offset += BlockSizes[MBB->getNumber()].first;
191 BranchSize += BlockSizes[DestBlock].first;
193 BranchSize += BlockSizes[i].first;
203 BranchSize = BlockSizes[StartBlock].first - BrOffset;
207 BranchSize += BlockSizes[i].first;
370 BlockSizes[MBB.getNumber()].first += 4;
lib/Target/PowerPC/PPCExpandISEL.cpp 172 LLVM_DEBUG(dbgs() << printMBBReference(*MF->getBlockNumbered(I.first))
197 << printMBBReference(*MF->getBlockNumbered(BlockList.first))
lib/Target/PowerPC/PPCFrameLowering.cpp 353 unsigned RegNo = TRI->getEncodingValue(LI.first);
354 if (VRRegNo[RegNo] == LI.first) // If this really is a vector reg.
lib/Target/PowerPC/PPCISelDAGToDAG.cpp 1219 return std::make_pair(ValueEntry->first, &ValueEntry->second);
1221 bool &Interesting = ValueEntry->first;
2409 if (!Result.first)
lib/Target/PowerPC/PPCISelLowering.cpp 5133 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
5620 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
6311 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
6692 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
6862 Chain = DAG.getCopyToReg(Chain, dl, Reg.first, Reg.second, InFlag);
14375 if (R.first && VT == MVT::i64 && Subtarget.isPPC64() &&
14376 PPC::GPRCRegClass.contains(R.first))
14377 return std::make_pair(TRI->getMatchingSuperReg(R.first,
14383 R.first = PPC::CR0;
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 246 MachineInstr *CurrInst = It->first;
1039 TOCSave.first->eraseFromParent();
lib/Target/PowerPC/PPCMachineFunctionInfo.cpp 48 if (LiveIn.first == VReg)
55 if (LiveIn.first == VReg)
lib/Target/PowerPC/PPCReduceCRLogicals.cpp 445 TrueDefs.first->dump();
450 if (CopyDefs.first) {
452 CopyDefs.first->dump();
472 Ret.SubregDef1, Ret.CopyDefs.first);
476 MRI->hasOneNonDBGUse(Ret.CopyDefs.first->getOperand(0).getReg());
514 (MIParam.getParent() == Ret.TrueDefs.first->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()) {
638 MachineBasicBlock::iterator Def1It = CRI.TrueDefs.first;
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 };
699 CRI.TrueDefs.first && isCRLogical(*CRI.TrueDefs.first);
699 CRI.TrueDefs.first && isCRLogical(*CRI.TrueDefs.first);
703 AllCRLogicalOps.push_back(createCRLogicalOpInfo(*CRI.TrueDefs.first));
lib/Target/PowerPC/PPCTargetTransformInfo.cpp 210 return LT.first * BaseT::getUserCost(U, Operands);
707 if (LT1.first != 1 || !LT1.second.isVector())
716 if (LT2.first != 1 || !LT2.second.isVector())
745 return vectorCostAdjustment(LT.first, Instruction::ShuffleVector, Tp,
879 return Cost + LT.first; // Add the cost of the permutations.
897 Cost += LT.first * ((SrcBytes / Alignment->value()) - 1);
936 Cost += Factor*(LT.first-1);
lib/Target/RISCV/RISCVISelLowering.cpp 573 return LowerCallTo(CLI).first;
2254 Chain = DAG.getCopyToReg(Chain, DL, Reg.first, Reg.second, Glue);
2297 Ops.push_back(DAG.getRegister(Reg.first, Reg.second.getValueType()));
2659 if (FReg.first != RISCV::NoRegister)
2662 : std::make_pair(FReg.first, &RISCV::FPR32RegClass);
lib/Target/Sparc/SparcISelLowering.cpp 934 unsigned Reg = toCallerWindow(RegsToPass[i].first);
958 Ops.push_back(DAG.getRegister(toCallerWindow(RegsToPass[i].first),
1238 RegsToPass[i].first, RegsToPass[i].second, InGlue);
1258 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
2188 return CallInfo.first;
2238 SDValue Result = CallInfo.first;
2958 Args, CallOptions, dl).first;
lib/Target/SystemZ/AsmParser/SystemZAsmParser.cpp 1043 if (EntryRange.first == EntryRange.second)
1046 struct InsnMatchEntry *Entry = EntryRange.first;
lib/Target/SystemZ/SystemZISelLowering.cpp 1574 Chain = DAG.getCopyToReg(Chain, DL, RegsToPass[I].first,
1587 Ops.push_back(DAG.getRegister(RegsToPass[I].first,
6600 TrueReg = RegRewriteTable[TrueReg].first;
lib/Target/SystemZ/SystemZTDC.cpp 348 Instruction *I = It.first;
lib/Target/WebAssembly/AsmParser/WebAssemblyAsmParser.cpp 266 nestingString(NestingStack.back()).first);
636 auto WS = cast<MCSectionWasm>(getStreamer().getCurrentSection().first);
840 auto CWS = cast<MCSectionWasm>(getStreamer().getCurrentSection().first);
lib/Target/WebAssembly/MCTargetDesc/WebAssemblyInstPrinter.cpp 114 OS, "label" + utostr(ControlFlowStack.pop_back_val().first) + ':');
124 OS, "label" + utostr(ControlFlowStack.pop_back_val().first) + ':');
177 utostr(Pair.first));
lib/Target/WebAssembly/MCTargetDesc/WebAssemblyTargetStreamer.cpp 104 if (Grouped.empty() || Grouped.back().first != Type)
113 emitValueType(Pair.first);
lib/Target/WebAssembly/WebAssemblyAddMissingPrototypes.cpp 133 Function *OldF = Pair.first;
lib/Target/WebAssembly/WebAssemblyAsmPrinter.cpp 188 StringRef Name = Field.first.trim();
206 OutStreamer->EmitULEB128IntValue(strlen(Producers.first));
207 OutStreamer->EmitBytes(Producers.first);
210 OutStreamer->EmitULEB128IntValue(Producer.first.size());
211 OutStreamer->EmitBytes(Producer.first);
lib/Target/WebAssembly/WebAssemblyCFGStackify.cpp 1003 if (!P.first)
1006 MachineBasicBlock *EHPad = P.first;
1104 MachineBasicBlock *BrDest = P.first;
1196 BrDests.push_back(P.first);
lib/Target/WebAssembly/WebAssemblyExplicitLocals.cpp 78 return P.first->second;
lib/Target/WebAssembly/WebAssemblyFixFunctionBitcasts.cpp 277 Use *U = UseFunc.first;
290 Pair.first->second = createWrapper(F, Ty);
292 Function *Wrapper = Pair.first->second;
lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp 373 Pair.first->second = Index;
lib/Target/WebAssembly/WebAssemblyISelLowering.cpp 1071 .first;
1375 if (SwizzleSrcs.first)
lib/Target/WebAssembly/WebAssemblyLowerGlobalDtors.cpp 133 uint16_t Priority = PriorityAndMore.first;
135 Constant *Associated = AssociatedAndMore.first;
lib/Target/WebAssembly/WebAssemblyRuntimeLibcallSignatures.cpp 500 if (NameLibcall.first != nullptr &&
502 assert(Map.find(NameLibcall.first) == Map.end() &&
504 Map[NameLibcall.first] = NameLibcall.second;
lib/Target/X86/AsmParser/X86AsmParser.cpp 153 if (!(Op.first == IC_IMM || Op.first == IC_REGISTER))
153 if (!(Op.first == IC_IMM || Op.first == IC_REGISTER))
228 if (Op.first == IC_IMM || Op.first == IC_REGISTER) {
228 if (Op.first == IC_IMM || Op.first == IC_REGISTER) {
230 } else if (isUnaryOperator(Op.first)) {
233 assert (Operand.first == IC_IMM &&
235 switch (Op.first) {
251 switch (Op.first) {
264 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
264 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
270 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
270 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
277 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
277 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
283 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
283 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
289 assert(Op1.first == IC_IMM && Op2.first == IC_IMM &&
289 assert(Op1.first == IC_IMM && Op2.first == IC_IMM &&
295 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
295 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
301 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
301 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
307 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
307 assert (Op1.first == IC_IMM && Op2.first == IC_IMM &&
1343 Warning(WarningMsg.first, WarningMsg.second);
1726 if (SemaCallback->LookupInlineAsmField(BaseMember.first, BaseMember.second,
lib/Target/X86/X86AsmPrinter.cpp 672 emitNonLazySymbolPointer(OutStreamer, Stub.first, Stub.second);
lib/Target/X86/X86AvoidStoreForwardingBlocks.cpp 587 LdDisp2 = DispSizePair.first;
588 StDisp2 = DispSizePair.first + LdStDelta;
654 int64_t CurrDisp = DispSizePair.first;
657 int64_t PrevDisp = DispSizeStack.back().first;
687 MachineInstr *LoadInst = LoadStoreInstPair.first;
lib/Target/X86/X86CmovConversion.cpp 825 Op1Reg = Op1Itr->second.first;
lib/Target/X86/X86ExpandPseudo.cpp 169 MF->insert(InsPt, P.first);
170 BuildMI(P.first, DL, TII->get(X86::TAILJMPd64))
lib/Target/X86/X86FastISel.cpp 940 IndexReg = getRegForGEPIndex(Op).first;
lib/Target/X86/X86FixupBWInsts.cpp 440 MachineInstr *MI = MIReplacements.back().first;
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()));
3531 MRI.disableCalleeSavedRegister(Pair.first);
3988 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
4032 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
4074 for (MCSubRegIterator SubRegs(RegPair.first, TRI, /*IncludeSelf=*/true);
11321 Range1.first = std::min(Range1.first, M);
11321 Range1.first = std::min(Range1.first, M);
11328 Range2.first = std::min(Range2.first, M);
11328 Range2.first = std::min(Range2.first, M);
11337 if (!(0 <= Range1.first && Range1.second < NumEltsPerLane) ||
11338 !(0 <= Range2.first && Range2.second < NumEltsPerLane))
11367 if (Range2.second < Range1.first)
11368 return RotateAndPermute(V1, V2, Range1.first, 0);
11369 if (Range1.second < Range2.first)
11370 return RotateAndPermute(V2, V1, Range2.first, NumElts);
13472 if ((M0 < 0 || isUndefOrEqual(DWordPair.first, M0)) &&
13474 DWordPair.first = (M0 >= 0 ? M0 : DWordPair.first);
13474 DWordPair.first = (M0 >= 0 ? M0 : DWordPair.first);
13489 int PSHUFHalfMask[4] = {DWordPairs[0].first, DWordPairs[0].second,
13490 DWordPairs[1].first, DWordPairs[1].second};
19529 return makeLibCall(DAG, LC, VT, Src, CallOptions, SDLoc(Op)).first;
19640 return makeLibCall(DAG, LC, VT, In, CallOptions, SDLoc(Op)).first;
19933 VT != SrcOpMap.begin()->first.getValueType())
19937 M = SrcOpMap.insert(std::make_pair(Src, EltCount)).first;
25436 return DAG.getBitcast(VT, CallInfo.first);
27322 return CallResult.first;
27326 CallResult.first, DAG.getIntPtrConstant(0, dl));
27328 CallResult.first, DAG.getIntPtrConstant(1, dl));
27656 return makeLibCall(DAG, Call, MVT::f128, Ops, CallOptions, SDLoc(Op)).first;
29695 Op1Reg = RegRewriteTable[Op1Reg].first;
46013 TRI->getEncodingValue(Res.first) >= 8) {
46020 TRI->getEncodingValue(Res.first) & 0x10) {
46043 unsigned DestReg = getX86SubSuperRegisterOrZero(Res.first, Size);
46099 Res.first = 0;
46115 Res.first = 0;
lib/Target/X86/X86InsertPrefetch.cpp 131 if (Name.startswith(HintType.first)) {
132 Name = Name.drop_front(HintType.first.size());
lib/Target/X86/X86InstrInfo.cpp 2474 MIB.addReg(C.first, RegState::Implicit);
2475 MIB.addReg(C.first, RegState::Implicit | RegState::Define);
3823 Op.first->getOperand(Op.first->getDesc().getNumOperands() - 1)
3823 Op.first->getOperand(Op.first->getDesc().getNumOperands() - 1)
lib/Target/X86/X86LegalizerInfo.cpp 40 if (i + 1 < v[i].first && i + 1 < v.size() &&
41 v[i + 1].first != v[i].first + 1)
41 v[i + 1].first != v[i].first + 1)
42 result.push_back({v[i].first + 1, Unsupported});
49 assert(v[0].first > 1);
53 auto Largest = result.back().first;
lib/Target/X86/X86PadShortFunction.cpp 118 MachineBasicBlock *MBB = I->first;
lib/Target/X86/X86TargetTransformInfo.cpp 194 return LT.first * Entry->Cost;
232 return LT.first * 3; // pmullw/sext
234 return LT.first * 3; // pmullw/zext
236 return LT.first * 5; // pmullw/pmulhw/pshuf
238 return LT.first * 5; // pmullw/pmulhw/pshuf
243 return LT.first * Entry->Cost;
299 return LT.first * Entry->Cost;
312 return LT.first * Entry->Cost;
327 return LT.first * Entry->Cost;
345 return LT.first * Entry->Cost;
364 return LT.first * Entry->Cost;
379 return LT.first * Entry->Cost;
401 return LT.first * Entry->Cost;
436 return LT.first * 32;
438 return LT.first * 38;
440 return LT.first * 15;
442 return LT.first * 20;
445 return LT.first * Entry->Cost;
460 return LT.first * Entry->Cost;
482 return LT.first * Entry->Cost;
494 return LT.first * Entry->Cost;
521 return LT.first * Entry->Cost;
553 return LT.first * Entry->Cost;
582 return LT.first * Entry->Cost;
625 return LT.first * Entry->Cost;
650 return LT.first * 4; // 2*psrad + shuffle.
654 return LT.first * Entry->Cost;
712 return LT.first * Entry->Cost;
748 return LT.first * Entry->Cost;
774 return LT.first * Entry->Cost;
803 return LT.first * Entry->Cost;
845 return LT.first * Entry->Cost;
868 return LT.first * Entry->Cost;
881 return 20 * LT.first * LT.second.getVectorNumElements() * ScalarCost;
902 LT.first = 1;
914 return SubLT.first;
954 if (Kind == TTI::SK_PermuteSingleSrc && LT.first != 1) {
966 unsigned NumOfDests = LT.first;
980 if (Kind == TTI::SK_PermuteTwoSrc && LT.first != 1) {
982 int NumOfDests = LT.first;
983 int NumOfShufflesPerDest = LT.first * 2 - 1;
984 LT.first = NumOfDests * NumOfShufflesPerDest;
1002 return LT.first * Entry->Cost;
1029 return LT.first * Entry->Cost;
1072 return LT.first * Entry->Cost;
1113 return LT.first * Entry->Cost;
1135 return LT.first * Entry->Cost;
1182 return LT.first * Entry->Cost;
1195 return LT.first * Entry->Cost;
1216 return LT.first * Entry->Cost;
1255 return LT.first * Entry->Cost;
1267 return LT.first * Entry->Cost;
1633 return LTSrc.first * Entry->Cost;
1838 return LT.first * (ExtraCost + Entry->Cost);
1842 return LT.first * (ExtraCost + Entry->Cost);
1846 return LT.first * (ExtraCost + Entry->Cost);
1850 return LT.first * (ExtraCost + Entry->Cost);
1854 return LT.first * (ExtraCost + Entry->Cost);
1858 return LT.first * (ExtraCost + Entry->Cost);
1862 return LT.first * (ExtraCost + Entry->Cost);
1866 return LT.first * (ExtraCost + Entry->Cost);
1870 return LT.first * (ExtraCost + Entry->Cost);
2204 return LT.first * Entry->Cost;
2208 return LT.first * Entry->Cost;
2212 return LT.first * Entry->Cost;
2216 return LT.first * Entry->Cost;
2220 return LT.first * Entry->Cost;
2224 return LT.first * Entry->Cost;
2228 return LT.first * Entry->Cost;
2232 return LT.first * Entry->Cost;
2236 return LT.first * Entry->Cost;
2240 return LT.first * Entry->Cost;
2244 return LT.first * Entry->Cost;
2248 return LT.first * Entry->Cost;
2253 return LT.first * Entry->Cost;
2256 return LT.first * Entry->Cost;
2262 return LT.first * Entry->Cost;
2265 return LT.first * Entry->Cost;
2272 return LT.first * Entry->Cost;
2275 return LT.first * Entry->Cost;
2359 return LT.first * Entry->Cost;
2363 return LT.first * Entry->Cost;
2367 return LT.first * Entry->Cost;
2370 return LT.first * Entry->Cost;
2441 int Cost = LT.first * 1;
2501 return Cost + LT.first * (IsLoad ? 2 : 8);
2504 return Cost + LT.first;
2623 return LT.first * Entry->Cost;
2627 return LT.first * Entry->Cost;
2631 return LT.first * Entry->Cost;
2635 return LT.first * Entry->Cost;
2671 return LT.first * Entry->Cost;
2674 return LT.first * Entry->Cost;
2677 return LT.first * Entry->Cost;
2854 return LT.first * Entry->Cost;
2858 return LT.first * Entry->Cost;
2862 return LT.first * Entry->Cost;
2866 return LT.first * Entry->Cost;
2870 return LT.first * Entry->Cost;
2874 return LT.first * Entry->Cost;
2878 return LT.first * Entry->Cost;
2883 return LT.first * Entry->Cost;
2887 return LT.first * Entry->Cost;
2891 return LT.first * Entry->Cost;
2895 return LT.first * Entry->Cost;
2899 return LT.first * Entry->Cost;
2903 return LT.first * Entry->Cost;
2907 return LT.first * Entry->Cost;
3154 int SplitFactor = std::max(IdxsLT.first, SrcLT.first);
3154 int SplitFactor = std::max(IdxsLT.first, SrcLT.first);
3662 getTLI()->getTypeLegalizationCost(DL, ResultTy).first *
lib/Target/X86/X86VZeroUpper.cpp 135 if (isYmmOrZmmReg(LI.first))
lib/Target/X86/X86WinAllocaExpander.cpp 298 lower(P.first, P.second);
lib/Target/XCore/XCoreFrameLowering.cpp 316 MachineBasicBlock::iterator Pos = SpillLabel.first;
lib/Target/XCore/XCoreISelLowering.cpp 481 SDValue Ops[] = { CallResult.first, CallResult.second };
1085 int offset = ResultMemLocs[i].first;
1187 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
1212 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
lib/Testing/Support/Annotations.cpp 51 Ranges[OpenRanges.back().first].push_back(R);
lib/TextAPI/MachO/InterfaceFile.cpp 63 Target RHS) { return LHS.first < RHS; });
65 if ((Iter != ParentUmbrellas.end()) && !(Target_ < Iter->first)) {
77 Target RHS) { return LHS.first < RHS; });
79 if ((Iter != UUIDs.end()) && !(Target_ < Iter->first)) {
116 result.first->second = new (Allocator) Symbol{Kind, Name, Targets, Flags};
119 result.first->second->addTarget(Target);
lib/TextAPI/MachO/Target.cpp 22 auto ArchitectureStr = Result.first;
lib/TextAPI/MachO/TextStub.cpp 488 const auto *Symbol = SymArch.first;
548 const auto *Symbol = SymArch.first;
621 File->addUUID(ID.first, ID.second);
811 UUIDs.emplace_back(IT.first, IT.second);
830 valueToTargetList[it.second].emplace_back(it.first);
836 CurrentSection.Umbrella = it.first;
866 const auto *Symbol = IT.first;
1012 CurrentSection.Values.emplace_back(it.first->getInstallName());
lib/TextAPI/MachO/TextStubCommon.cpp 207 OS << Value.first << ": " << Value.second;
211 auto Arch = Split.first.trim();
216 Value.first = Target{getArchitectureFromName(Arch), PlatformKind::unknown};
lib/Transforms/AggressiveInstCombine/TruncInstCombine.cpp 238 Instruction *I = Itr.first;
302 Instruction *I = Itr.first;
382 if (I->first->use_empty())
383 I->first->eraseFromParent();
lib/Transforms/Coroutines/CoroFrame.cpp 756 AllocaInst *const A = P.first;
780 AllocaInst *const A = P.first;
lib/Transforms/IPO/ArgumentPromotion.cpp 300 V = IRB.CreateGEP(ArgIndex.first, V, Ops, V->getName() + ".idx");
lib/Transforms/IPO/Attributor.cpp 1065 Value *RV = It.first;
1130 LLVM_DEBUG(dbgs() << "[AAReturnedValues] Returned value: " << *It.first
1132 CallBase *CB = dyn_cast<CallBase>(It.first);
1171 Value *RetVal = RetValAAIt.first;
1198 Value *RetVal = RetValAAIt.first;
1222 auto &ReturnInsts = ReturnedValues[It.first];
1226 << *It.first << " => " << *RI << "\n");
3184 if (isa<Constant>(It.first)) {
3188 } else if (!isa<Argument>(It.first) ||
3189 It.first == getAssociatedArgument())
lib/Transforms/IPO/BlockExtractor.cpp 179 Function *F = M.getFunction(BInfo.first);
lib/Transforms/IPO/ConstantMerge.cpp 73 if (V.first != LLVMContext::MD_dbg)
236 GlobalVariable *Old = SameContentReplacements[i].first;
lib/Transforms/IPO/DeadArgumentElimination.cpp 245 NF->addMetadata(MD.first, *MD.second);
717 for (I = Begin; I != E && I->first == RA; ++I)
1076 NF->addMetadata(MD.first, *MD.second);
lib/Transforms/IPO/ForceFunctionAttrs.cpp 74 if (KV.first != F.getName())
lib/Transforms/IPO/FunctionImport.cpp 358 ValueInfo VI = Edge.first;
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);
493 auto CalleeGUID = Edge.first.getGUID();
540 auto VI = Index.getValueInfo(GVSummary.first);
717 auto GUID = GlobalList.first;
836 visit(Call.first, false);
905 if (ILI.first != ModulePath)
906 ImportsOS << ILI.first << "\n";
lib/Transforms/IPO/GlobalDCE.cpp 206 GlobalVariable *VTable = VTableInfo.first;
254 VFESafeVTables.erase(VTableInfo.first);
lib/Transforms/IPO/GlobalOpt.cpp 253 if (IsSafeComputationToRemove(Dead[i].first, GetTLI)) {
255 Instruction *I = Dead[i].first;
1425 PHINode *PN = PHIsToRewrite.back().first;
1444 if (PHINode *PN = dyn_cast<PHINode>(I->first))
1446 else if (LoadInst *LI = dyn_cast<LoadInst>(I->first))
1454 if (PHINode *PN = dyn_cast<PHINode>(I->first))
1456 else if (LoadInst *LI = dyn_cast<LoadInst>(I->first))
2491 if (auto *GV = dyn_cast<GlobalVariable>(I.first)) {
2494 ConstantExpr *GEP = cast<ConstantExpr>(I.first);
2506 CommitValueTo(ComplexCE.second, ComplexCE.first);
2509 assert(GVPair.first->hasInitializer());
2510 GVPair.first->setInitializer(GVPair.second);
2555 ConstantExpr *GEP = CEPair.first;
lib/Transforms/IPO/HotColdSplitting.cpp 508 BasicBlock *BB = Block.first;
596 return !ColdBlocks.insert(Block.first).second;
lib/Transforms/IPO/IPConstantPropagation.cpp 108 if (C && ArgumentConstants[i].first == nullptr) {
109 ArgumentConstants[i].first = C; // First constant seen.
110 } else if (C && ArgumentConstants[i].first == C) {
134 Value *V = ArgumentConstants[i].first;
lib/Transforms/IPO/Inliner.cpp 488 if (InlineHistory[InlineHistoryID].first == F)
602 if (Function *F = CallSites[i].first.getCalledFunction())
619 CallSite CS = CallSites[CSi].first;
977 Function &F = *Calls[i].first.getCaller();
982 setInlineRemark(Calls[i].first, "optnone attribute");
1025 for (; i < (int)Calls.size() && Calls[i].first.getCaller() == &F; ++i) {
1123 return Call.first.getCaller() == &Callee;
lib/Transforms/IPO/LowerTypeTests.cpp 374 P.first->setIndirectSymbol(
375 ConstantExpr::getBitCast(P.second, P.first->getType()));
560 for (MDNode *Type : GlobalAndOffset.first->types()) {
1881 if (!P.second && P.first->second.Linkage != CFL_Definition)
1882 P.first->second = {Linkage, FuncMD};
1886 StringRef FunctionName = P.first;
1995 return Ins.first->second;
2051 if (auto *TypeId = dyn_cast<MDString>(P.first))
2104 GlobalClasses.member_begin(S.first);
lib/Transforms/IPO/MergeFunctions.cpp 410 if ((I != S && std::prev(I)->first == I->first) ||
410 if ((I != S && std::prev(I)->first == I->first) ||
411 (std::next(I) != IE && std::next(I)->first == I->first) ) {
411 (std::next(I) != IE && std::next(I)->first == I->first) ) {
908 FNodesInTree.insert({NewFunction, Result.first});
914 const FunctionNode &OldF = *Result.first;
919 replaceFunctionInTree(*Result.first, NewFunction);
lib/Transforms/IPO/PartialInlining.cpp 894 Function *OutlinedFunc = FuncBBPair.first;
1250 Function *Func = FuncBBPair.first;
1412 (Cloner.ClonedOI ? Cloner.OutlinedFunctions.back().first
1481 Changed |= Result.first;
lib/Transforms/IPO/PassManagerBuilder.cpp 210 if (Ext.first == ETy)
215 if (Extensions[i].first == ETy)
lib/Transforms/IPO/SampleProfile.cpp 621 OS << "weight[" << E.first->getName() << "->" << E.second->getName()
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)
1262 OtherEC = EquivalenceClass[UnknownEdge.first];
1289 } else if (SelfReferentialEdge.first && VisitedBlocks.count(EC)) {
1347 R.emplace_back(InstrProfValueData{FunctionSamples::getGUID(I.first), I.second});
1743 r.first->second = nullptr;
1757 updateProfileCallee(pair.first, pair.second.entryCount);
lib/Transforms/IPO/SyntheticCountsPropagation.cpp 111 if (!Edge.first)
113 assert(isa<Instruction>(Edge.first));
114 CallSite CS(cast<Instruction>(Edge.first));
141 Entry.first->setEntryCount(ProfileCount(
lib/Transforms/IPO/WholeProgramDevirt.cpp 715 auto &VI = T.first;
1421 if (!tryEvaluateFunctionsWithArgs(TargetsForSlot, CSByConstantArg.first))
1426 ResByArg = &Res->ResByArg[CSByConstantArg.first];
1432 ResByArg, Slot, CSByConstantArg.first))
1475 exportConstant(Slot, CSByConstantArg.first, "byte", OffsetByte,
1477 exportConstant(Slot, CSByConstantArg.first, "bit", 1ULL << OffsetBit,
1707 auto I = Res.ResByArg.find(CSByConstantArg.first);
1721 importGlobal(Slot, CSByConstantArg.first, "unique_member");
1727 Constant *Byte = importConstant(Slot, CSByConstantArg.first, "byte",
1729 Constant *Bit = importConstant(Slot, CSByConstantArg.first, "bit", Int8Ty,
1756 U.first->replaceAllUsesWith(True);
1757 U.first->eraseFromParent();
1794 importResolution(S.first, S.second);
1814 if (auto *TypeId = dyn_cast<MDString>(P.first))
1863 if (tryFindVirtualCallTargets(TargetsForSlot, TypeIdMap[S.first.TypeID],
1864 S.first.ByteOffset)) {
1866 if (ExportSummary && isa<MDString>(S.first.TypeID))
1869 cast<MDString>(S.first.TypeID)->getString())
1870 .WPDRes[S.first.ByteOffset];
1874 tryVirtualConstProp(TargetsForSlot, S.second, Res, S.first);
1876 tryICallBranchFunnel(TargetsForSlot, S.second, Res, S.first);
1890 if (ExportSummary && isa<MDString>(S.first.TypeID)) {
1892 GlobalValue::getGUID(cast<MDString>(S.first.TypeID)->getString());
1909 << NV("FunctionName", DT.first));
1936 NameByGUID[GlobalValue::getGUID(P.first)].push_back(P.first);
1936 NameByGUID[GlobalValue::getGUID(P.first)].push_back(P.first);
1982 auto TidSummary = ExportSummary.getTypeIdCompatibleVtableSummary(S.first.TypeID);
1985 S.first.ByteOffset)) {
1987 &ExportSummary.getOrInsertTypeIdSummary(S.first.TypeID)
1988 .WPDRes[S.first.ByteOffset];
1990 if (!trySingleImplDevirt(TargetsForSlot, S.first, S.second, Res,
lib/Transforms/InstCombine/InstCombineAndOrXor.cpp 616 unsigned LHSMask = MaskPair->first;
lib/Transforms/InstCombine/InstCombineCompares.cpp 2665 assert(FlippedStrictness->first == ICmpInst::ICMP_SGE && "Sanity check");
5223 return new ICmpInst(FlippedStrictness->first, Op0, FlippedStrictness->second);
lib/Transforms/InstCombine/InstCombineLoadStoreAlloca.cpp 70 for (auto &U : ValuePair.first->uses()) {
489 unsigned ID = MDPair.first;
lib/Transforms/InstCombine/InstCombineVectorOps.cpp 643 if (LR.first->getType() != RHS->getType()) {
659 return std::make_pair(LR.first, RHS);
1087 if (LR.first != &IE && LR.second != &IE) {
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
1354 if (!Parent.first)
1359 assert(Parent.first->hasOneUse() && "Drilled down when more than one use!");
1360 assert(Op != Parent.first->getOperand(Parent.second) &&
1362 Parent.first->setOperand(Parent.second, Op);
1363 Worklist.Add(Parent.first);
1371 Instruction *Ancestor = Parent.first;
lib/Transforms/Instrumentation/AddressSanitizer.cpp 3329 uint64_t Size = SizeOffset.first.getZExtValue();
lib/Transforms/Instrumentation/BoundsChecking.cpp 71 Value *Size = SizeOffset.first;
200 Instruction *Inst = Entry.first;
lib/Transforms/Instrumentation/CFGMST.h 239 const BasicBlock *BB = BI.first;
lib/Transforms/Instrumentation/CGProfile.cpp 90 Metadata *Vals[] = {ValueAsMetadata::get(E.first.first),
90 Metadata *Vals[] = {ValueAsMetadata::get(E.first.first),
91 ValueAsMetadata::get(E.first.second),
lib/Transforms/Instrumentation/ControlHeightReduction.cpp 1374 Region *R = pair.first;
lib/Transforms/Instrumentation/DataFlowSanitizer.cpp 963 for (unsigned val = 0, n = i->first->getNumIncomingValues(); val != n;
966 val, DFSF.getShadow(i->first->getIncomingValue(val)));
1112 std::swap(Key.first, Key.second);
lib/Transforms/Instrumentation/GCOVProfiling.cpp 287 return LinesByFile.try_emplace(Filename, Filename, os).first->second;
378 Function *F = Blocks.begin()->first->getParent();
421 Function *F = Blocks.begin()->first->getParent();
459 if (!HeadTail.first.empty()) {
460 Regex Re(HeadTail.first);
463 Ctx->emitError(Twine("Regex ") + HeadTail.first +
1017 GlobalVariable *GV = CountersBySP[j].first;
1214 GlobalVariable *GV = I.first;
lib/Transforms/Instrumentation/HWAddressSanitizer.cpp 1220 P.first->eraseFromParent();
1465 if (P.first)
1466 ThunkName += ("." + P.first->getName()).str();
1469 bool IsLocal = P.first && (!isa<GlobalValue>(P.first) ||
1469 bool IsLocal = P.first && (!isa<GlobalValue>(P.first) ||
1470 cast<GlobalValue>(P.first)->hasLocalLinkage());
1486 P.first ? IRB.CreateBitCast(P.first, Int8PtrTy)
1486 P.first ? IRB.CreateBitCast(P.first, Int8PtrTy)
lib/Transforms/Instrumentation/InstrProfiling.cpp 269 Value *InitVal = ConstantInt::get(Cand.first->getType(), 0);
273 auto *BB = Cand.first->getParent();
285 PGOCounterPromoterHelper Promoter(Cand.first, Cand.second, SSA, InitVal,
288 Promoter.run(SmallVector<Instruction *, 2>({Cand.first, Cand.second}));
456 auto *CounterLoad = LoadStore.first;
lib/Transforms/Instrumentation/MemorySanitizer.cpp 1308 instrumentAlloca(*Item.second, Item.first);
1630 .first;
1830 .first;
2877 .first;
3323 .first;
4338 .first;
4353 .first;
4368 .first;
lib/Transforms/Instrumentation/SanitizerCoverage.cpp 330 auto SecStart = SecStartEnd.first;
469 IRBCtor.CreateCall(InitFunction, {SecStartEnd.first, SecStartEnd.second});
lib/Transforms/ObjCARC/BlotMapVector.h 60 Pair.first->second = Num;
64 return Vector[Pair.first->second].second;
69 Map.insert(std::make_pair(InsertPair.first, size_t(0)));
72 Pair.first->second = Num;
76 return std::make_pair(Vector.begin() + Pair.first->second, false);
100 Vector[It->second].first = KeyT();
lib/Transforms/ObjCARC/DependencyAnalysis.cpp 232 BasicBlock *LocalStartBB = Pair.first;
lib/Transforms/ObjCARC/ObjCARCOpts.cpp 379 Pair.first->second.Merge(Pair.second ? TopDownPtrState() : MI->second,
386 if (Other.PerPtrTopDown.find(MI->first) == Other.PerPtrTopDown.end())
422 Pair.first->second.Merge(Pair.second ? BottomUpPtrState() : MI->second,
430 if (Other.PerPtrBottomUp.find(MI->first) == Other.PerPtrBottomUp.end())
443 OS << " Ptr: " << *I->first
463 OS << " Ptr: " << *I->first
942 Inst = Pair.first;
1126 const Value *Arg = I->first;
1250 const Value *Ptr = MI->first;
1386 const Value *Ptr = MI->first;
1474 BasicBlock *CurrBB = SuccStack.back().first;
1516 BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end();
1524 ReverseCFGPostOrder.push_back(PredStack.pop_back_val().first);
1833 Value *V = I->first;
lib/Transforms/ObjCARC/ProvenanceAnalysis.cpp 179 return Pair.first->second;
lib/Transforms/Scalar/CallSiteSplitting.cpp 168 Value *Arg = Cond.first->getOperand(0);
169 Constant *ConstVal = cast<Constant>(Cond.first->getOperand(1));
329 BasicBlock *PredBB = Preds[i].first;
lib/Transforms/Scalar/ConstantHoisting.cpp 269 auto &InsertPts = InsertPtsMap[Node].first;
286 auto &ParentInsertPts = InsertPtsMap[Parent].first;
920 if (I.first->use_empty())
921 I.first->eraseFromParent();
944 findBaseConstants(MapEntry.first);
953 MadeChange |= emitBaseConstants(MapEntry.first);
lib/Transforms/Scalar/CorrelatedValuePropagation.cpp 190 Constant *C = IncomingConstant.first;
lib/Transforms/Scalar/DeadStoreElimination.cpp 449 LaterIntEnd = std::max(LaterIntEnd, ILI->first);
460 LaterIntEnd = std::max(LaterIntEnd, ILI->first);
469 ILI->first >= int64_t(EarlierOff + EarlierSize)) {
474 << ILI->first << ")\n");
967 int64_t LaterSize = OII->first - LaterStart;
988 int64_t LaterSize = OII->first - LaterStart;
1007 Instruction *EarlierWrite = OI.first;
lib/Transforms/Scalar/DivRemPairs.cpp 150 Instruction *DivInst = DivMap[RemPair.first];
lib/Transforms/Scalar/EarlyCSE.cpp 1128 if (InVal.first != nullptr &&
1129 isSameMemGeneration(InVal.second, CurrentGeneration, InVal.first,
1132 << " to: " << *InVal.first << '\n');
1138 Inst->replaceAllUsesWith(InVal.first);
lib/Transforms/Scalar/Float2Int.cpp 245 Instruction *I = It.first;
513 I.first->eraseFromParent();
lib/Transforms/Scalar/GVN.cpp 378 uint32_t e = assignExpNewValueNum(exp).first;
385 valueNumbering[C] = ValNum.first;
386 return ValNum.first;
550 uint32_t e = assignExpNewValueNum(exp).first;
574 return assignExpNewValueNum(exp).first;
603 assert(I->first != V && "Inst still occurs in value numbering map!");
640 errs() << I->first << "\n";
672 if (IV.first->second == 2)
673 IV.first->second = 3;
674 return IV.first->second != 0;
1163 BasicBlock *UnavailablePred = PredLoad.first;
1241 BasicBlock *UnavailablePred = PredLoad.first;
1787 LHS = Item.first; RHS = Item.second;
2386 if (Value *V = predMap[i].first) {
2465 SplitCriticalEdge(Edge.first, Edge.second,
lib/Transforms/Scalar/GVNHoist.cpp 285 if (HoistStat.first + HoistStat.second == 0)
625 RenameStack[VI.first].push_back(VI.second);
655 << ", VN: " << C.VN.first << ", " << C.VN.second);
700 BasicBlock *BB = A.first;
744 Ranks.push_back(Entry.first);
1012 BasicBlock *DestBB = HP.first;
lib/Transforms/Scalar/GVNSink.cpp 243 Blocks.push_back(P.first);
652 ->first;
lib/Transforms/Scalar/IndVarSimplify.cpp 1628 if (!WideAddRec.first)
1631 assert((WideAddRec.first == nullptr) == (WideAddRec.second == Unknown));
1632 if (!WideAddRec.first) {
1662 if (WideAddRec.first == WideIncExpr &&
1666 WideUse = cloneIVUser(DU, WideAddRec.first);
1675 if (WideAddRec.first != SE->getSCEV(WideUse)) {
1677 << *SE->getSCEV(WideUse) << " != " << *WideAddRec.first
lib/Transforms/Scalar/InferAddressSpaces.cpp 391 Value *TopVal = PostorderStack.back().first;
lib/Transforms/Scalar/JumpThreading.cpp 260 if (!PredOutEdge.first)
263 BasicBlock *PredBB = PredOutEdge.first;
681 R.first = ConstantExpr::getCast(CI->getOpcode(), R.first, CI->getType());
681 R.first = ConstantExpr::getCast(CI->getOpcode(), R.first, CI->getType());
714 if (LHSVal.first == InterestingVal || isa<UndefValue>(LHSVal.first)) {
714 if (LHSVal.first == InterestingVal || isa<UndefValue>(LHSVal.first)) {
719 if (RHSVal.first == InterestingVal || isa<UndefValue>(RHSVal.first)) {
719 if (RHSVal.first == InterestingVal || isa<UndefValue>(RHSVal.first)) {
740 R.first = ConstantExpr::getNot(R.first);
740 R.first = ConstantExpr::getNot(R.first);
756 Constant *V = LHSVal.first;
901 Constant *V = LHSVal.first;
921 Constant *Cond = C.first;
1448 AvailablePredSet.insert(AvailablePred.first);
1502 assert(I != AvailablePreds.end() && I->first == P &&
1514 PN->addIncoming(PredV, I->first);
1550 BasicBlock *MostPopularDest = DPI->first;
1561 SamePopularity.push_back(DPI->first);
1565 MostPopularDest = DPI->first;
1610 << "': FOUND condition = " << *PredValue.first
1631 Constant *Val = PredValue.first;
1744 BasicBlock *Pred = PredToDest.first;
1850 if (isa<UndefValue>(XorOpValue.first))
1853 if (cast<ConstantInt>(XorOpValue.first)->isZero())
1870 if (XorOpValue.first != SplitVal && !isa<UndefValue>(XorOpValue.first))
1870 if (XorOpValue.first != SplitVal && !isa<UndefValue>(XorOpValue.first))
lib/Transforms/Scalar/LICM.cpp 254 return !KV.first->getParentLoop();
667 if (Pair.first->getSuccessor(0) == BB) {
668 PredecessorBlocks.erase(Pair.first->getParent());
669 PredecessorBlocks.erase(Pair.first->getSuccessor(1));
670 } else if (Pair.first->getSuccessor(1) == BB) {
671 PredecessorBlocks.erase(Pair.first->getParent());
672 PredecessorBlocks.erase(Pair.first->getSuccessor(0));
674 PredecessorBlocks.erase(Pair.first->getSuccessor(0));
675 PredecessorBlocks.erase(Pair.first->getSuccessor(1));
694 return BB != Pair.second && (Pair.first->getSuccessor(0) == BB ||
695 Pair.first->getSuccessor(1) == BB);
709 BranchInst *BI = It->first;
773 if (Pair.second == InitialPreheader && Pair.first != BI->getParent())
lib/Transforms/Scalar/LoopDistribute.cpp 914 for (unsigned PtrIdx1 : Check.first->Members)
lib/Transforms/Scalar/LoopFuse.cpp 826 FC0 = FC1 = InsertPos.first;
lib/Transforms/Scalar/LoopIdiomRecognize.cpp 2344 auto *OldLoopBB = const_cast<BasicBlock *>(Edge.first);
lib/Transforms/Scalar/LoopLoadElimination.cpp 397 for (auto PtrIdx1 : Check.first->Members)
lib/Transforms/Scalar/LoopPredication.cpp 944 BPI->getEdgeProbability(ExitEdge.first, ExitEdge.second);
lib/Transforms/Scalar/LoopRerollPass.cpp 840 if (KV.first == 0)
941 } else if (V.find(KV.first - 1) != V.end()) {
1082 Exclude.count(I->first) != 0))
1110 if (U == It->first)
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";
1225 Instruction *BaseInst = BaseIt->first;
1226 Instruction *RootInst = RootIt->first;
1257 !BaseInst->isSameOperationAs(TryIt->first) &&
1264 instrDependsOn(TryIt->first, RootIt, TryIt)) {
1271 RootInst = TryIt->first;
1283 Instruction *I = LastRootIt->first;
1499 KV.first->replaceUsesOfWith(Inst, NewIV);
lib/Transforms/Scalar/LoopStrengthReduce.cpp 265 RegSortData &RSD = Pair.first->second;
2581 size_t LUIdx = P.first->second;
2590 P.first->second = LUIdx;
3308 size_t LUIdx = P.first;
3460 size_t LUIdx = P.first;
4114 Pair.first->second.insert(std::make_pair(Imm, Use));
4133 << ' ' << Entry.first;
4141 int64_t JImm = J->first;
4153 int64_t First = Imms.begin()->first;
4154 int64_t Last = std::prev(Imms.end())->first;
4169 int64_t Imm = (uint64_t)JImm - M->first;
4372 Formula &Best = LU.Formulae[P.first->second];
4646 Formula &Best = LU.Formulae[P.first->second];
5359 PN->setIncomingValue(i, Pair.first->second);
5374 Pair.first->second = FullV;
lib/Transforms/Scalar/LoopUnswitch.cpp 377 const SwitchInst *OldInst = I->first;
700 .first;
742 .first;
816 .first;
1132 .first;
1167 .first;
lib/Transforms/Scalar/MergeICmps.cpp 130 return Insertion.first->second;
lib/Transforms/Scalar/NewGVN.cpp 964 return BlockInstRange.lookup(P1.second).first <
965 BlockInstRange.lookup(P2.second).first;
990 E->setType(PHIOperands.begin()->first->getType());
997 if (isCopyOfPHI(P.first, PHIOp))
1002 if (ValueToClass.lookup(P.first) == TOPClass)
1004 OriginalOpsConstant = OriginalOpsConstant && isa<Constant>(P.first);
1006 return lookupOperandLeader(P.first) != I;
1010 return lookupOperandLeader(P.first);
1285 if (CC->getNextLeader().first &&
1286 DT->dominates(cast<Instruction>(CC->getNextLeader().first), U))
2140 return MinDFS.first;
2152 if (auto *NL = dyn_cast_or_null<StoreInst>(CC->getNextLeader().first))
2178 } else if (CC->getNextLeader().first) {
2180 return CC->getNextLeader().first;
2242 if (I == OldClass->getNextLeader().first)
2353 auto place = lookupResult.first;
2381 EClass = lookupResult.first->second;
2439 TouchedInstructions.set(InstRange.first, InstRange.second);
2835 ValuePHI->addIncoming(PHIOp.first, PHIOp.second);
2840 ValuePHI->setIncomingValue(i, PHIOp.first);
3195 bool Result = ReachableBlocks.count(Pair.first->getBlock());
3196 if (!Result || MSSA->isLiveOnEntryDef(Pair.first) ||
3197 MemoryToDFSNum(Pair.first) == 0)
3199 if (auto *MemDef = dyn_cast<MemoryDef>(Pair.first))
3204 if (auto *MemPHI = dyn_cast<MemoryPhi>(Pair.first)) {
3219 if (auto *FirstMUD = dyn_cast<MemoryUseOrDef>(KV.first)) {
3230 } else if (auto *FirstMP = dyn_cast<MemoryPhi>(KV.first)) {
3271 if (auto *I = dyn_cast<Instruction>(KV.first))
3275 BeforeIteration.insert({KV.first, *KV.second});
3284 if (auto *I = dyn_cast<Instruction>(KV.first))
3290 auto *BeforeCC = &BeforeIteration.find(KV.first)->second;
3317 if (auto *SE = dyn_cast<StoreExpression>(KV.first)) {
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)) {
3864 auto *BB = BBPair.first;
3965 << EliminationStack.dfs_back().first << ","
lib/Transforms/Scalar/Reassociate.cpp 499 I = P.first; // We examine the operands of this binary operator.
1053 ValueEntry(getRank(E.first), E.first));
1053 ValueEntry(getRank(E.first), E.first));
2206 ValueEntry(getRank(E.first), E.first));
2206 ValueEntry(getRank(E.first), E.first));
2311 auto Op0 = Ops[BestPair.first];
2314 Ops.erase(&Ops[BestPair.first]);
2376 assert(res.first->second.isValid() && "WeakVH invalidated");
2377 ++res.first->second.Score;
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 849 LLVM_DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
874 Value *BDV = Pair.first;
924 LLVM_DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
931 Instruction *I = cast<Instruction>(Pair.first);
1028 Instruction *BDV = cast<Instruction>(Pair.first);
1118 auto *BDV = Pair.first;
1185 Pair.first->printAsOperand(errs(), false);
1669 Instruction *RematerializedValue = RematerializedValuePair.first;
1768 Value *Def = Pair.first;
1800 Value *Def = Pair.first;
2270 Pair.first->printAsOperand(errs(), false);
2289 Info.LiveSet.remove(BasePair.first);
2834 if (!Updated.count(KVPair.first))
2835 ToErase.insert(KVPair.first);
2842 assert(Updated.count(KVPair.first) && "record for non-live value");
lib/Transforms/Scalar/SCCP.cpp 494 LatticeVal &LV = I.first->second;
514 ValueLatticeElement &LV = PI.first->second;
532 LatticeVal &LV = I.first->second;
586 Iter.first->second.insert(U);
2193 Function *F = I.first;
2218 GlobalVariable *GV = I->first;
lib/Transforms/Scalar/Scalarizer.cpp 407 if (canTransferMetadata(MD.first))
408 New->setMetadata(MD.first, MD.second);
830 Instruction *Op = GMI.first;
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 813 DTUpdates.push_back({DT.Delete, ParentBB, SplitUnswitchedPair.first});
1422 auto *BB = BBAndL.first;
2478 Instruction *CI = Candidate.first;
2730 Instruction &TI = *TerminatorAndInvariants.first;
lib/Transforms/Scalar/SpeculateAroundPHIs.cpp 142 Instruction *I = StackPair.first;
229 ++InsertResult.first->second.Count;
234 int &MatCost = InsertResult.first->second.MatCost;
282 ConstantInt *IncomingC = IncomingConstantAndCostsAndCount.first;
439 UserToPNMap.insert({UI, {}}).first->second.push_back(PN);
636 auto &SpeculatedVals = InsertResult.first->second;
lib/Transforms/Scalar/StructurizeCFG.cpp 559 BasicBlock *BB = BBAndPred.first;
607 BasicBlock *To = AddedPhi.first;
615 PHINode *Phi = PI.first;
624 Updater.AddAvailableValue(VI.first, VI.second);
625 Dominator.addAndRememberBlock(VI.first);
774 return DT->dominates(BB, Pred.first);
788 BasicBlock *BB = Pred.first;
lib/Transforms/Utils/BypassSlowDivision.cpp 168 CacheI = Cache.insert({Key, *OptResult}).first;
lib/Transforms/Utils/CloneFunction.cpp 147 MD.first,
575 BasicBlock *Pred = PCI.first;
lib/Transforms/Utils/CloneModule.cpp 135 GV->addMetadata(MD.first,
lib/Transforms/Utils/FunctionComparator.cpp 758 return cmpNumbers(LeftSN.first->second, RightSN.first->second);
758 return cmpNumbers(LeftSN.first->second, RightSN.first->second);
lib/Transforms/Utils/InlineFunction.cpp 1202 const Value *OrigCall = I->first;
1729 HandleByValArgumentInit(Init.first, Init.second, Caller->getParent(),
lib/Transforms/Utils/Local.cpp 1116 PN->replaceAllUsesWith(*Inserted.first);
2288 unsigned Kind = MD.first;
2383 unsigned ID = MDPair.first;
lib/Transforms/Utils/LoopUnrollPeel.cpp 556 Value *LatchVal = PHI.getIncomingValueForBlock(Edge.first);
560 PHI.addIncoming(LatchVal, cast<BasicBlock>(VMap[Edge.first]));
708 DT->changeImmediateDominator(Exit.first,
lib/Transforms/Utils/LoopVersioning.cpp 200 GroupToNonAliasingScopes[Check.first].push_back(GroupToScope[Check.second]);
206 GroupToNonAliasingScopeList[Pair.first] = MDNode::get(Context, Pair.second);
lib/Transforms/Utils/PredicateInfo.cpp 634 auto *DomNode = DT.getNode(BlockEdge.first);
729 return ValueInfos[InsertResult.first->second];
lib/Transforms/Utils/SSAUpdater.cpp 166 InsertedPHI->addIncoming(PredValue.second, PredValue.first);
lib/Transforms/Utils/SSAUpdaterBulk.cpp 142 DefBlocks.insert(Def.first);
lib/Transforms/Utils/SimplifyCFG.cpp 2036 if (I->first->hasNUses(I->second)) {
4590 PHINode *Phi = ForwardingNode.first;
4753 if (I.first == Result) {
4800 PHI = Results[0].first;
4801 else if (PHI != Results[0].first)
4844 Value *SelectValue = ResultVector[1].first;
4848 SelectValue = Builder.CreateSelect(ValueCompare, ResultVector[1].first,
4853 return Builder.CreateSelect(ValueCompare, ResultVector[0].first,
4990 ConstantInt *CaseVal = Values[I].first;
5347 PHINode *PHI = I.first;
5382 PHINode *PHI = I.first;
5450 uint64_t Idx = (ResultList[I].first->getValue() - MinCaseVal->getValue())
lib/Transforms/Utils/SimplifyIndVar.cpp 870 Instruction *UseInst = UseOper.first;
lib/Transforms/Utils/SplitModule.cpp 158 return a.first > b.first;
158 return a.first > b.first;
184 if (a.first == b.first)
184 if (a.first == b.first)
187 return a.first > b.first;
187 return a.first > b.first;
191 unsigned CurrentClusterID = BalancinQueue.top().first;
196 << I.first << ") ----> " << I.second->getData()->getName()
lib/Transforms/Utils/ValueMapper.cpp 884 I->setMetadata(MI.first, New);
932 GO.addMetadata(I.first, *cast<MDNode>(mapMetadata(I.second)));
lib/Transforms/Vectorize/LoadStoreVectorizer.cpp 1024 return vectorizeStoreChain(Chains.first, InstructionsProcessed) |
1037 return vectorizeStoreChain(Chains.first, InstructionsProcessed) |
1167 return vectorizeLoadChain(Chains.first, InstructionsProcessed) |
1177 return vectorizeLoadChain(Chains.first, InstructionsProcessed) |
lib/Transforms/Vectorize/LoopVectorize.cpp 1137 return Itr->second.first;
3003 PHINode *OrigPhi = InductionEntry.first;
3155 PHINode *PHI = cast<PHINode>(I.first);
3297 if (!VectorLoopValueMap.hasAnyVectorValue(KV.first))
3300 Value *I = getOrCreateVectorValue(KV.first, Part);
3391 VectorLoopValueMap.resetVectorValue(KV.first, Part, Res);
3400 if (!VectorLoopValueMap.hasAnyVectorValue(KV.first))
3403 Value *I = getOrCreateVectorValue(KV.first, Part);
3408 VectorLoopValueMap.resetVectorValue(KV.first, Part, NewI);
3445 fixupIVUsers(Entry.first, Entry.second,
3447 IVEndValues[Entry.first], LoopMiddleBlock);
4461 auto *Ind = Induction.first;
4504 auto *Ind = Induction.first;
4786 auto *Ind = Induction.first;
4997 unsigned TargetNumRegisters = TTI.getNumberOfRegisters(pair.first);
5019 float Cost = expectedCost(1).first;
5037 float VectorCost = C.first / (float)i;
5174 unsigned TargetNumRegisters = TTI.getNumberOfRegisters(pair.first);
5177 << TTI.getRegisterClassName(pair.first) << " register class\n");
5187 if (R.LoopInvariantRegs.find(pair.first) != R.LoopInvariantRegs.end())
5188 LoopInvariantRegs = R.LoopInvariantRegs[pair.first];
5222 LoopCost = expectedCost(VF).first;
5366 TransposeEnds[Interval.second].push_back(Interval.first);
5443 if (MaxUsages[j].find(pair.first) != MaxUsages[j].end())
5444 MaxUsages[j][pair.first] = std::max(MaxUsages[j][pair.first], pair.second);
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
5606 unsigned VectorCost = getInstructionCost(I, VF).first;
5612 unsigned ScalarCost = VF * getInstructionCost(I, 1).first;
5668 C.first = ForceTargetInstructionCost;
5670 BlockCost.first += C.first;
5670 BlockCost.first += C.first;
5672 LLVM_DEBUG(dbgs() << "LV: Found an estimated cost of " << C.first
5684 BlockCost.first /= getReciprocalPredBlockProb();
5686 Cost.first += BlockCost.first;
5686 Cost.first += BlockCost.first;
5897 return VectorizationCostTy((getInstructionCost(I, 1).first * VF), false);
6537 PHINode *Ind = Induction.first;
7068 NeedDef.insert(Reduction.first);
7156 LLVM_DEBUG(dbgs() << "Sinking" << *SAIt->first << " after"
7204 VPValue *Phi = Plan->getVPValue(Reduction.first);
7687 IntDiagMsg.first = "InterleavingNotBeneficialAndDisabled";
7710 return OptimizationRemarkMissed(VAPassName, VecDiagMsg.first,
7715 return OptimizationRemarkMissed(LV_NAME, IntDiagMsg.first,
7723 return OptimizationRemarkAnalysis(VAPassName, VecDiagMsg.first,
7731 return OptimizationRemarkAnalysis(LV_NAME, IntDiagMsg.first,
lib/Transforms/Vectorize/SLPVectorizer.cpp 1511 auto It = DeletedInstructions.try_emplace(I, ReplaceOpsWithUndef).first;
2276 ReuseShuffleIndicies.emplace_back(Res.first->second);
2380 NumOpsWantToKeepOrder.try_emplace(CurrentOrder).first;
2461 auto I = NumOpsWantToKeepOrder.try_emplace(CurrentOrder).first;
2921 IntegerType::get(F->getContext(), MinBWs[VL[0]].first), VL.size());
3478 auto *MinTy = IntegerType::get(F->getContext(), MinBWs[ScalarRoot].first);
3687 ReuseShuffleIndicies.emplace_back(Res.first->second);
4257 auto *MinTy = IntegerType::get(F->getContext(), MinBWs[ScalarRoot].first);
6118 if (ExtraArgs.count(ParentStackElem.first)) {
6119 ExtraArgs[ParentStackElem.first] = nullptr;
6126 ParentStackElem.second = ParentStackElem.first->getNumOperands();
6130 ExtraArgs[ParentStackElem.first] = ExtraArg;
6283 Instruction *TreeN = Stack.back().first;
6400 assert(Pair.first && "DebugLoc must be set.");
6401 ExternallyUsedValues[Pair.second].push_back(Pair.first);
6490 VectorizedTree, Pair.first,
lib/Transforms/Vectorize/VPlan.cpp 385 State->VPValue2Value[Entry.second] = Entry.first;
517 Entry.first->printAsOperand(OS, false);
lib/Transforms/Vectorize/VPlanSLP.cpp 308 FinalOrder.push_back({Operands.first, {Operands.second[0]}});
427 Ops.first->replaceAllUsesWith(NewOp);
429 if (CombinedOperands[i] == Ops.first)
431 delete Ops.first;
432 Ops.first = NewOp;
lib/XRay/Profile.cpp 32 B.PathData.push_back({internPath(cantFail(O.expandPath(PathData.first))),
207 auto &PathID = PathAndData.first;
227 Merged.addBlock({IndexedThreadBlock.first, std::move(PathAndData)}));
240 auto &PathId = PathAndData.first;
389 const auto &TID = ThreadPaths.first;
projects/openmp/libomptarget/src/omptarget.cpp 435 void **ShadowHstPtrAddr = (void**) it->first;
518 void **ShadowHstPtrAddr = (void**) it->first;
545 void **ShadowHstPtrAddr = (void**) it->first;
tools/bugpoint/CrashDebugger.cpp 521 Function *F = cast<Function>(GST.lookup(BI.first));
628 auto *F = cast<Function>(GST.lookup(BI.first));
720 auto *F = cast<Function>(GST.lookup(BI.first));
tools/bugpoint/ExtractFunction.cpp 231 Type *Int32Ty = Type::getInt32Ty(TorList[0].first->getContext());
233 StructType *STy = StructType::get(Int32Ty, TorList[0].first->getType());
236 TorList[i].first};
tools/bugpoint/Miscompilation.cpp 401 Function *NewF = ToNotOptimize->getFunction(MisCompFunctions[i].first);
432 Function *NewF = ToNotOptimize->getFunction(MisCompFunctions[i].first);
598 Function *NewF = ProgClone->getFunction(MisCompFunctions[i].first);
tools/clang/include/clang/AST/DeclLookups.h 43 DeclarationName getLookupName() const { return It->first; }
55 It->first == DeclarationName::getUsingDirectiveName());
tools/clang/include/clang/AST/DeclTemplate.h 1414 return TypesAndInfos[I].first;
tools/clang/include/clang/AST/Mangle.h 82 return Result.first->second;
88 return Result.first->second;
tools/clang/include/clang/AST/OpenMPClause.h 4486 auto *D = M.first;
tools/clang/include/clang/Analysis/Analyses/Dominators.h 243 It = ControlDepenencyMap.insert({A, ControlDependencies}).first;
tools/clang/include/clang/Basic/IdentifierTable.h 519 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first;
556 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first;
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 36 ColSplit.first.rsplit(':');
41 PSL.FileName = LineSplit.first;
78 if (Split.first.getAsInteger(10, EndLine) ||
83 RangeSplit.first = Str;
87 auto Begin = ParsedSourceLocation::FromString(RangeSplit.first);
tools/clang/include/clang/Lex/Preprocessor.h 1644 SkipMainFilePreamble.first = Bytes;
tools/clang/include/clang/Lex/PreprocessorOptions.h 217 PrecompiledPreambleBytes.first = 0;
tools/clang/include/clang/Sema/DeclSpec.h 217 char *location_data() const { return Builder.getBuffer().first; }
tools/clang/include/clang/Sema/ScopeInfo.h 471 assert((!value || CoroutineSuspends.first == nullptr) &&
477 return !NeedsCoroutineSuspends && CoroutineSuspends.first == nullptr;
482 assert(CoroutineSuspends.first == nullptr && "suspend points already set");
484 CoroutineSuspends.first = Initial;
tools/clang/include/clang/Sema/SemaInternal.h 79 if (const auto *TTP = UPP.first.dyn_cast<const TemplateTypeParmType *>())
82 return getDepthAndIndex(UPP.first.get<NamedDecl *>());
135 unsigned BestED = CorrectionResults.begin()->first;
tools/clang/include/clang/Sema/Template.h 341 const Decl *D = I->first;
tools/clang/include/clang/Sema/TemplateDeduction.h 94 PD.first = SuppressedDiagnostics.front().first;
94 PD.first = SuppressedDiagnostics.front().first;
tools/clang/include/clang/Serialization/ContinuousRangeMap.h 55 return L < R.first;
61 return L.first < R.first;
61 return L.first < R.first;
70 assert((Rep.empty() || Rep.back().first < Val.first) &&
70 assert((Rep.empty() || Rep.back().first < Val.first) &&
77 if (I != Rep.end() && I->first == Val.first) {
77 if (I != Rep.end() && I->first == Val.first) {
125 assert((A == B || A.first != B.first) &&
125 assert((A == B || A.first != B.first) &&
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/CallEvent.h 1134 if (Call.isCalled(I.first))
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/Environment.h 40 const Stmt *getStmt() const { return first; }
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/FunctionSummary.h 68 I = Map.insert(KVPair(D, FunctionSummary())).first;
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/RangedConstraintManager.h 34 return *first <= v && v <= *second;
36 const llvm::APSInt &From() const { return *first; }
55 return *lhs.first < *rhs.first ||
55 return *lhs.first < *rhs.first ||
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 205 if (SymReaper.isDead(I->first))
227 << "{ \"symbol\": \"" << I->first << "\", \"range\": \"";
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/SVals.h 417 assert(data.first.getBaseKind() == LocKind &&
418 (data.first.getSubKind() == loc::MemRegionValKind ||
419 data.first.getSubKind() == loc::GotoLabelKind));
426 return D->first.castAs<Loc>();
432 const SVal& V = D->first;
tools/clang/lib/ARCMigrate/ARCMT.cpp 597 FileID FID = I->first;
tools/clang/lib/ARCMigrate/FileRemapper.cpp 104 remap(pairs[i].first, pairs[i].second);
131 const FileEntry *origFE = I->first;
173 const FileEntry *origFE = I->first;
197 PPOpts.addRemappedFile(I->first->getName(), FE->getName());
200 PPOpts.addRemappedFile(I->first->getName(), mem);
tools/clang/lib/ARCMigrate/ObjCMT.cpp 1816 assert(Begin.first == End.first);
1816 assert(Begin.first == End.first);
1973 FileID FID = I->first;
2273 std::string TempFile = applyEditsToTemp(I->first, I->second,
2280 remap.emplace_back(I->first->getName(), TempFile);
tools/clang/lib/ARCMigrate/TransAutoreleasePool.cpp 88 VarDecl *var = I->first;
tools/clang/lib/ARCMigrate/TransGCAttrs.cpp 284 SourceLocation Loc = ATLs[i].first.getAttr()->getLocation();
317 SourceLocation AtLoc = SourceLocation::getFromRawEncoding(I->first);
tools/clang/lib/ARCMigrate/TransProperties.cpp 133 SourceLocation atLoc = SourceLocation::getFromRawEncoding(I->first);
tools/clang/lib/ARCMigrate/TransZeroOutPropsInDealloc.cpp 60 ObjCPropertyDecl *PropDecl = P->first;
tools/clang/lib/ARCMigrate/TransformActions.cpp 430 StringRef file = SM.getBufferData(locInfo.first, &invalidTemp);
560 SourceLocation loc = I->first;
569 CharSourceRange range = CharSourceRange::getCharRange(I->first.Begin,
570 I->first.End);
585 return UniqueText.insert(std::make_pair(text, false)).first->first();
tools/clang/lib/ARCMigrate/Transforms.cpp 144 StringRef file = SM.getBufferData(locInfo.first, &invalidTemp);
151 Lexer lexer(SM.getLocForStartOfFile(locInfo.first),
392 StringRef file = SM.getBufferData(locInfo.first, &invalidTemp);
399 Lexer lexer(SM.getLocForStartOfFile(locInfo.first),
473 StringRef file = SM.getBufferData(locInfo.first, &invalidTemp);
480 Lexer lexer(SM.getLocForStartOfFile(locInfo.first),
tools/clang/lib/AST/ASTContext.cpp 226 if (SourceMgr.getLineNumber(DeclLocDecomp.first, DeclLocDecomp.second) ==
227 Comments.getCommentBeginLine(CommentBehindDecl, DeclLocDecomp.first,
228 OffsetCommentBehindDecl->first)) {
254 const char *Buffer = SourceMgr.getBufferData(DeclLocDecomp.first,
287 const FileID File = SourceMgr.getDecomposedLoc(DeclLoc).first;
470 SourceMgr.getDecomposedLoc((*Decls.begin())->getLocation()).first;
855 (Pair.first)(Pair.second);
1708 sizeAndAlign.first = layout.getDataSize();
1723 assert((Size == 0 || static_cast<uint64_t>(EltInfo.first.getQuantity()) <=
1726 uint64_t Width = EltInfo.first.getQuantity() * Size;
2258 return getTypeInfoInChars(T).first;
2261 return getTypeInfoInChars(T).first;
2455 return Layout.getBaseClassOffset(L.first->getAsCXXRecordDecl()) <
2456 Layout.getBaseClassOffset(R.first->getAsCXXRecordDecl());
2461 Layout.getBaseClassOffset(Base.first->getAsCXXRecordDecl()));
7201 (CurLayObj == FieldOrBaseOffsets.end() || CurLayObj->first != 0)) {
7224 assert(CurOffs <= CurLayObj->first);
7225 if (CurOffs < CurLayObj->first) {
7226 uint64_t padding = CurLayObj->first - CurOffs;
tools/clang/lib/AST/ASTDiagnostic.cpp 274 if (PrevArgs[i].first == DiagnosticsEngine::ak_qualtype) {
tools/clang/lib/AST/ASTImporter.cpp 8395 Expected<FileID> ToFileIDOrErr = Import(Decomposed.first, IsBuiltin);
8789 assert(InsertRes.second || InsertRes.first->second.Error == Error.Error);
tools/clang/lib/AST/ASTImporterLookupTable.cpp 122 DeclarationName Name = Entry.first;
134 DeclContext *DC = Entry.first;
tools/clang/lib/AST/ASTStructuralEquivalence.cpp 1888 Decl *D1 = P.first;
tools/clang/lib/AST/CXXInheritance.cpp 567 add(I->first, *M);
651 const CXXMethodDecl *CanonOM = OM->first->getCanonicalDecl();
tools/clang/lib/AST/CommentLexer.cpp 858 StringRef File = SourceMgr.getBufferData(LocInfo.first, &InvalidTemp);
tools/clang/lib/AST/ComparisonCategories.cpp 98 return &Data.try_emplace((char)Kind, Ctx, RD, Kind).first->second;
132 return &Data.try_emplace((char)Kind, Ctx, RD, Kind).first->second;
tools/clang/lib/AST/DeclBase.cpp 1644 if (!R.second && !R.first->second.hasExternalDecls())
1645 return R.first->second.getLookupResult();
tools/clang/lib/AST/DeclTemplate.cpp 575 new (&TypesAndInfos[I].first) QualType(ExpandedTypes[I]);
tools/clang/lib/AST/Expr.cpp 1247 StringRef Buffer = SM.getBufferData(LocInfo.first, &Invalid);
1259 Lexer TheLexer(SM.getLocForStartOfFile(LocInfo.first), Features,
tools/clang/lib/AST/ExprConstant.cpp 558 if (LB != Temporaries.end() && LB->first == KV)
562 assert((LB == Temporaries.end() || LB->first.first != Key) &&
562 assert((LB == Temporaries.end() || LB->first.first != Key) &&
563 (LB == Temporaries.begin() || std::prev(LB)->first.first != Key) &&
563 (LB == Temporaries.begin() || std::prev(LB)->first.first != Key) &&
571 if (UB != Temporaries.begin() && std::prev(UB)->first.first == Key)
571 if (UB != Temporaries.begin() && std::prev(UB)->first.first == Key)
579 if (UB != Temporaries.begin() && std::prev(UB)->first.first == Key)
579 if (UB != Temporaries.begin() && std::prev(UB)->first.first == Key)
580 return std::prev(UB)->first.second;
1798 Result.first->second.AllocExpr = E;
1799 return &Result.first->second.Value;
5401 D.truncate(Info.Ctx, LHS.Base, LengthAndField.first);
14315 if (Loc) *Loc = Diags[0].first;
tools/clang/lib/AST/ExternalASTMerger.cpp 248 if (isa<FunctionDecl>(C.first.get()))
251 return C.first.get()->getKind() == D.first.get()->getKind();
251 return C.first.get()->getKind() == D.first.get()->getKind();
510 Decl *LookupRes = C.first.get();
tools/clang/lib/AST/Interp/Function.cpp 38 [](Elem A, Elem B) { return A.first < B.first; });
38 [](Elem A, Elem B) { return A.first < B.first; });
39 if (It == SrcMap.end() || It->first != Offset)
tools/clang/lib/AST/Interp/InterpFrame.cpp 175 TYPE_SWITCH(Desc.first, new (B->data()) T(stackRef<T>(Off)));
tools/clang/lib/AST/ItaniumMangle.cpp 928 Parts.second = Parts.first;
930 mangleModuleNamePrefix(Parts.first);
tools/clang/lib/AST/MicrosoftMangle.cpp 240 return Result.first->second;
1798 auto Iter = PassObjectSizeArgs.insert({Type, Dynamic}).first;
tools/clang/lib/AST/ODRHash.cpp 49 ID.AddInteger(Result.first->second);
tools/clang/lib/AST/RawCommentList.cpp 124 if (CommentOpts.ParseAllComments && isOrdinaryKind(K.first)) {
139 Kind = K.first;
231 if (Loc1Info.first != Loc2Info.first)
231 if (Loc1Info.first != Loc2Info.first)
235 const char *Buffer = SM.getBufferData(Loc1Info.first, &Invalid).data();
285 const FileID CommentFile = Loc.first;
tools/clang/lib/AST/RecordLayoutBuilder.cpp 1779 EffectiveFieldSize = FieldSize = FieldInfo.first;
2976 HasVtordispSet.insert(bi.first);
tools/clang/lib/AST/VTableBuilder.cpp 180 const CXXMethodDecl *MD = Overrider.first;
184 unsigned SubobjectNumber = M.first;
512 if (MethodsCanShareVCallOffset(OffsetPair.first, MD))
524 if (MethodsCanShareVCallOffset(OffsetPair.first, MD))
1105 const CXXMethodDecl *MD = MI.first;
1153 const VTableComponent &Component = Components[TI.first];
1669 const CXXMethodDecl *MD = I.first;
1894 const BaseSubobject &Base = AP.first;
2073 std::string ClassName = I.first->getQualifiedNameAsString();
2085 Out << " " << I.first << " | " << I.second.getQuantity() << '\n';
2095 const CXXMethodDecl *MD = I.first;
2104 const std::string &MethodName = I.first;
2185 uint64_t VTableIndex = I.first;
2210 assert((LHS.first != RHS.first || LHS.second == RHS.second) &&
2210 assert((LHS.first != RHS.first || LHS.second == RHS.second) &&
2212 return LHS.first < RHS.first;
2212 return LHS.first < RHS.first;
2255 ClassPairTy ClassPair(RD, I.first);
2308 ClassPairTy ClassPair(RD, I.first);
2502 const CXXMethodDecl *MD = I.first;
3179 const CXXMethodDecl *MD = I.first;
3187 const std::string &MethodName = MethodNameAndDecl.first;
3589 MethodVFTableLocation &OldLoc = Insert.first->second;
3611 const CXXMethodDecl *MD = cast<const CXXMethodDecl>(I.first.getDecl());
3638 CharUnits VFPtrOffset = I.first.VFPtrOffset;
3639 uint64_t VBIndex = I.first.VBTableIndex;
3651 uint64_t VTableIndex = I.first.Index;
tools/clang/lib/ASTMatchers/ASTMatchFinder.cpp 555 if (MP.first.matches(Node, this, &Builder)) {
579 if (MP.first.matchesNoKindCheck(DynNode, this, &Builder)) {
592 if (Matchers[I].first.canMatchNodesOfKind(Kind)) {
tools/clang/lib/ASTMatchers/Dynamic/Diagnostics.cpp 136 OS << Pieces.first.str();
tools/clang/lib/ASTMatchers/Dynamic/Parser.cpp 542 if (!I->first)
tools/clang/lib/ASTMatchers/Dynamic/Registry.cpp 571 MatcherCtor Ctor = CtxEntry.first;
tools/clang/lib/Analysis/AnalysisDeclContext.cpp 209 PM.setParent(I->first, PM.getParent(I->second));
tools/clang/lib/Analysis/CFG.cpp 1300 assert(cachedEntry->first == stmt);
2386 ConfluenceBlock).first;
2750 return VisitLogicalOperator(Cond, C, LHSBlock, RHSBlock).first;
2998 LastBlock = VisitLogicalOperator(Cond, I, ThenBlock, ElseBlock).first;
5143 if (currentBlock >= 0 && I->second.first == (unsigned) currentBlock
5148 OS << "[B" << I->second.first << "." << I->second.second << "]";
5158 if (currentBlock >= 0 && I->second.first == (unsigned) currentBlock
5163 OS << "[B" << I->second.first << "." << I->second.second << "]";
tools/clang/lib/Analysis/CloneDetection.cpp 383 size_t PrototypeHash = Current.first;
387 if (PrototypeHash != StmtsByHash[i].first) {
tools/clang/lib/Analysis/Consumed.cpp 1093 if (isa<ParmVarDecl>(DM.first)) {
1094 const auto *Param = cast<ParmVarDecl>(DM.first);
1141 LocalState = this->getState(DM.first);
1147 VarMap[DM.first] = CS_Unknown;
1159 LocalState = this->getState(DM.first);
1165 VarMap[DM.first] = CS_Unknown;
1167 DM.first->getNameAsString());
1193 if (this->getState(DM.first) != DM.second)
tools/clang/lib/Analysis/LiveVariables.cpp 627 vec.push_back(it->first);
tools/clang/lib/Analysis/PathDiagnostic.cpp 333 if (InSameTU.first)
tools/clang/lib/Analysis/ReachableCode.cpp 534 const CFGBlock *Block = I->first;
tools/clang/lib/Analysis/RetainSummaryManager.cpp 594 ScratchArgs = AF.add(ScratchArgs, I->first, Translated);
tools/clang/lib/Analysis/ThreadSafety.cpp 461 if (SavedContexts[CtxIndex+1].first == S) {
654 const NamedDecl *Dec = P.first;
670 Result = addReference(P.first, P.second, Result);
683 const unsigned *i2 = C2.lookup(P.first);
tools/clang/lib/Analysis/ThreadSafetyCommon.cpp 652 assert(CurrentLVarMap[It->second].first == VD);
717 Ph->setClangDecl(CurrentLVarMap[i].first);
751 if (CurrentLVarMap[i].first != Map[i].first) {
751 if (CurrentLVarMap[i].first != Map[i].first) {
tools/clang/lib/Basic/Diagnostic.cpp 46 switch (nullability.first) {
177 for (File *F = getFile(SrcMgr, Decomp.first); F;
202 const File *F = getFile(SrcMgr, Decomp.first);
221 if (Range.first != Range.second)
222 return &Range.first->second;
223 auto &F = Files.insert(Range.first, std::make_pair(ID, File()))->second;
229 F.Parent = getFile(SrcMgr, Decomp.first);
252 FileID ID = F.first;
267 << Decomp.first.getHashValue() << "> ";
268 SrcMgr.getLocForStartOfFile(Decomp.first)
299 DiagnosticIDs::getWarningOptionForDiag(Mapping.first);
306 llvm::errs() << "<unknown " << Mapping.first << ">";
tools/clang/lib/Basic/DiagnosticIDs.cpp 219 Result.first->second = GetDefaultDiagMapping(Diag);
221 return Result.first->second;
287 return DiagInfo[DiagID-DIAG_UPPER_LIMIT].first;
295 if (I != DiagIDs.end() && I->first == D)
tools/clang/lib/Basic/FileManager.cpp 97 {DirName, std::errc::no_such_file_or_directory}).first;
143 if (SeenDirInsertResult.first->second)
144 return DirectoryEntryRef(&*SeenDirInsertResult.first);
145 return llvm::errorCodeToError(SeenDirInsertResult.first->second.getError());
150 auto &NamedDirEnt = *SeenDirInsertResult.first;
210 if (!SeenFileInsertResult.first->second)
212 SeenFileInsertResult.first->second.getError());
215 SeenFileEntryOrRedirect Value = *SeenFileInsertResult.first->second;
218 return FileEntryRef(SeenFileInsertResult.first->first(), *FE);
224 auto &NamedFileEnt = *SeenFileInsertResult.first;
277 *SeenFileEntries.insert({Status.getName(), &UFE}).first;
338 {Filename, std::errc::no_such_file_or_directory}).first;
tools/clang/lib/Basic/Module.cpp 148 if (hasFeature(Current->Requirements[I].first, LangOpts, Target) !=
185 return IdComponent.first;
446 OS << Requirements[I].first;
tools/clang/lib/Basic/SourceLocation.cpp 183 return std::make_pair(FullSourceLoc(ImportLoc.first, *SrcMgr),
tools/clang/lib/Basic/SourceManager.cpp 233 FilenamesByID.push_back(&*IterBool.first);
234 return IterBool.first->second;
317 const SLocEntry &Entry = getSLocEntry(LocInfo.first, &Invalid);
334 LineTable->AddLineNote(LocInfo.first, LocInfo.second, LineNo, FilenameID,
413 SrcMgr::ContentCache *&Slot = FileInfos[FileInfo.first];
929 Loc = getSLocEntry(LocInfo.first).getExpansion().getSpellingLoc();
989 Loc = getSLocEntry(LocInfo.first).getExpansion().getSpellingLoc();
1059 getSLocEntry(DecompLoc.first, &Invalid).getExpansion();
1068 FileID PrevFID = getPreviousFileID(DecompLoc.first);
1134 const SLocEntry &Entry = getSLocEntry(LocInfo.first, &CharDataInvalid);
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);
1408 const SLocEntry &SEntry = getSLocEntry(LocInfo.first, &Invalid);
1422 LineTable->FindNearestLineEntry(LocInfo.first, LocInfo.second);
1456 const SLocEntry &Entry = getSLocEntry(LocInfo.first, &Invalid);
1466 FileID FID = LocInfo.first;
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)) {
1501 unsigned MarkerLineNo = getLineNumber(LocInfo.first, Entry->FileOffset);
1508 IncludeLoc = getLocForStartOfFile(LocInfo.first);
1531 const SLocEntry &Entry = getSLocEntry(LocInfo.first, &Invalid);
1540 LineTable->FindNearestLineEntry(LocInfo.first, LocInfo.second))
1861 unsigned MacroArgBeginOffs = I->first;
1878 DecompTy &DecompLoc = InsertOp.first->second;
1904 std::pair<FileID, unsigned> UpperLoc = SM.getDecomposedIncludedLoc(Loc.first);
1905 if (UpperLoc.first.isInvalid())
1953 if (LOffs.first.isInvalid() || ROffs.first.isInvalid())
1953 if (LOffs.first.isInvalid() || ROffs.first.isInvalid())
1954 return LOffs.first.isInvalid() && !ROffs.first.isInvalid();
1954 return LOffs.first.isInvalid() && !ROffs.first.isInvalid();
1957 if (InSameTU.first)
1963 StringRef LB = getBuffer(LOffs.first)->getBufferIdentifier();
1964 StringRef RB = getBuffer(ROffs.first)->getBufferIdentifier();
1973 return LOffs.first < ROffs.first;
1973 return LOffs.first < ROffs.first;
1981 assert(LOffs.first == ROffs.first);
1981 assert(LOffs.first == ROffs.first);
1999 if (LOffs.first == ROffs.first)
1999 if (LOffs.first == ROffs.first)
2005 getInBeforeInTUCache(LOffs.first, ROffs.first);
2005 getInBeforeInTUCache(LOffs.first, ROffs.first);
2009 if (IsBeforeInTUCache.isCacheValid(LOffs.first, ROffs.first))
2009 if (IsBeforeInTUCache.isCacheValid(LOffs.first, ROffs.first))
2014 IsBeforeInTUCache.setQueryFIDs(LOffs.first, ROffs.first,
2014 IsBeforeInTUCache.setQueryFIDs(LOffs.first, ROffs.first,
2015 /*isLFIDBeforeRFID=*/LOffs.first.ID < ROffs.first.ID);
2015 /*isLFIDBeforeRFID=*/LOffs.first.ID < ROffs.first.ID);
2028 } while (LOffs.first != ROffs.first && !MoveUpIncludeHierarchy(LOffs, *this));
2028 } while (LOffs.first != ROffs.first && !MoveUpIncludeHierarchy(LOffs, *this));
2030 while((I = LChain.find(ROffs.first)) == LChain.end()) {
2039 if (LOffs.first == ROffs.first) {
2039 if (LOffs.first == ROffs.first) {
2040 IsBeforeInTUCache.setCommonLoc(LOffs.first, LOffs.second, ROffs.second);
tools/clang/lib/CodeGen/BackendUtil.cpp 1386 auto GUID = GlobalList.first;
tools/clang/lib/CodeGen/CGAtomic.cpp 1676 ConvertIntToValueOrAtomic(Res.first, AggValueSlot::ignored(),
1792 PHI->addIncoming(Res.first, CGF.Builder.GetInsertBlock());
1872 PHI->addIncoming(Res.first, CGF.Builder.GetInsertBlock());
tools/clang/lib/CodeGen/CGBlocks.cpp 563 layout.push_back(BlockLayoutChunk(tinfo.second, tinfo.first,
1019 I.first,
1021 CGM.getDataLayout().getTypeAllocSize(I.first->getType())),
1532 const auto *var = dyn_cast<VarDecl>(i->first);
1763 if (CopyInfo.first != BlockCaptureEntityKind::None ||
1764 DisposeInfo.first != BlockCaptureEntityKind::None)
1765 ManagedCaptures.emplace_back(CopyInfo.first, DisposeInfo.first,
1765 ManagedCaptures.emplace_back(CopyInfo.first, DisposeInfo.first,
2813 return pair.first->second;
tools/clang/lib/CodeGen/CGBuiltin.cpp 1827 Value *Real = ComplexVal.first;
1844 return RValue::get(ComplexVal.first);
tools/clang/lib/CodeGen/CGCall.cpp 1094 IRCallArgs[IRCallArgPos++] = CV.first;
2128 Attrs.addDereferenceableAttr(info.first.getQuantity());
tools/clang/lib/CodeGen/CGClass.cpp 784 CharUnits FieldSize = FieldInfo.first;
929 Ctx.getTypeInfoDataSizeInChars(LastField->getType()).first);
tools/clang/lib/CodeGen/CGCleanup.cpp 53 llvm::StructType::get(V.first->getType(), V.second->getType());
55 CGF.Builder.CreateStore(V.first, CGF.Builder.CreateStructGEP(addr, 0));
tools/clang/lib/CodeGen/CGCleanup.h 386 return ExtInfo->BranchAfters[I].first;
tools/clang/lib/CodeGen/CGCoroutine.cpp 374 LocalDeclMap.insert({SavedLocal.first, SavedLocal.second});
tools/clang/lib/CodeGen/CGDebugInfo.cpp 70 DebugPrefixMap[KV.first] = KV.second;
481 if (Path.startswith(Entry.first))
482 return (Twine(Entry.second) + Path.substr(Entry.first.size())).str();
2388 const std::string &Macro = M.first;
4647 auto *FD = SP.first;
4680 QualType QTy(P.first->getTypeForDecl(), 0);
4702 auto It = TypeCache.find(P.first);
4715 auto It = DeclCache.find(P.first);
tools/clang/lib/CodeGen/CGDeclCXX.cpp 560 unsigned Priority = I->first.priority;
tools/clang/lib/CodeGen/CGException.cpp 1721 int FrameEscapeIdx = InsertPair.first->second;
tools/clang/lib/CodeGen/CGExpr.cpp 993 if (isa<llvm::IntegerType>(InVal.first->getType())) {
995 NextVal = llvm::ConstantInt::get(InVal.first->getType(), AmountVal, true);
998 NextVal = Builder.CreateAdd(InVal.first, NextVal, isInc ? "inc" : "dec");
1007 NextVal = Builder.CreateFAdd(InVal.first, NextVal, isInc ? "inc" : "dec");
3019 llvm::Value *Check = Checked[i].first;
3254 int Kind = CheckKindMaskPair.first;
4628 return EmitARCStoreStrong(E, /*ignored*/ false).first;
4631 return EmitARCStoreAutoreleasing(E).first;
tools/clang/lib/CodeGen/CGExprAgg.cpp 1009 Value *Cmp = EmitCompare(Builder, CGF, E, LHSValues.first, RHSValues.first,
1009 Value *Cmp = EmitCompare(Builder, CGF, E, LHSValues.first, RHSValues.first,
1959 if (TypeInfo.first.isZero()) {
1966 assert(!TypeInfo.first.isZero());
1969 llvm::ConstantInt::get(SizeTy, TypeInfo.first.getQuantity()));
1973 SizeVal = llvm::ConstantInt::get(SizeTy, TypeInfo.first.getQuantity());
tools/clang/lib/CodeGen/CGExprCXX.cpp 504 CharUnits LastStoreOffset = LastStore.first;
541 CharUnits StoreOffset = Store.first;
555 CharUnits StoreOffset = Store.first;
tools/clang/lib/CodeGen/CGExprComplex.cpp 229 Scope.ForceCleanup({&Vals.first, &Vals.second});
381 Builder.CreateStore(Val.first, RealPtr, lvalue.isVolatileQualified());
433 Val.first = CGF.EmitScalarConversion(Val.first, SrcType, DestType, Loc);
433 Val.first = CGF.EmitScalarConversion(Val.first, SrcType, DestType, Loc);
552 if (Op.first->getType()->isFloatingPointTy()) {
553 ResR = Builder.CreateFNeg(Op.first, "neg.r");
556 ResR = Builder.CreateNeg(Op.first, "neg.r");
573 return ComplexPairTy(Op.first, ResI);
579 if (Op.LHS.first->getType()->isFloatingPointTy()) {
580 ResR = Builder.CreateFAdd(Op.LHS.first, Op.RHS.first, "add.r");
580 ResR = Builder.CreateFAdd(Op.LHS.first, Op.RHS.first, "add.r");
587 ResR = Builder.CreateAdd(Op.LHS.first, Op.RHS.first, "add.r");
587 ResR = Builder.CreateAdd(Op.LHS.first, Op.RHS.first, "add.r");
597 if (Op.LHS.first->getType()->isFloatingPointTy()) {
598 ResR = Builder.CreateFSub(Op.LHS.first, Op.RHS.first, "sub.r");
598 ResR = Builder.CreateFSub(Op.LHS.first, Op.RHS.first, "sub.r");
606 ResR = Builder.CreateSub(Op.LHS.first, Op.RHS.first, "sub.r");
606 ResR = Builder.CreateSub(Op.LHS.first, Op.RHS.first, "sub.r");
618 Args.add(RValue::get(Op.LHS.first),
622 Args.add(RValue::get(Op.RHS.first),
681 if (Op.LHS.first->getType()->isFloatingPointTy()) {
701 Value *AC = Builder.CreateFMul(Op.LHS.first, Op.RHS.first, "mul_ac");
701 Value *AC = Builder.CreateFMul(Op.LHS.first, Op.RHS.first, "mul_ac");
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");
735 getComplexMultiplyLibCallName(Op.LHS.first->getType()), Op);
757 ResR = Builder.CreateFMul(Op.LHS.first, Op.RHS.first, "mul.rl");
757 ResR = Builder.CreateFMul(Op.LHS.first, Op.RHS.first, "mul.rl");
760 ? Builder.CreateFMul(Op.LHS.second, Op.RHS.first, "mul.il")
761 : Builder.CreateFMul(Op.LHS.first, Op.RHS.second, "mul.ir");
765 Value *ResRl = Builder.CreateMul(Op.LHS.first, Op.RHS.first, "mul.rl");
765 Value *ResRl = Builder.CreateMul(Op.LHS.first, Op.RHS.first, "mul.rl");
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;
1044 llvm::PHINode *RealPN = Builder.CreatePHI(LHS.first->getType(), 2, "cond.r");
1045 RealPN->addIncoming(LHS.first, LHSBlock);
1046 RealPN->addIncoming(RHS.first, RHSBlock);
1049 llvm::PHINode *ImagPN = Builder.CreatePHI(LHS.first->getType(), 2, "cond.i");
tools/clang/lib/CodeGen/CGExprConstant.cpp 1434 assert(PlaceholderAddresses.back().first == nullptr);
1436 PlaceholderAddresses.back().first = signal;
1490 assert(entry.first->getParent() == nullptr && "not a placeholder!");
1491 entry.first->replaceAllUsesWith(entry.second);
1492 entry.first->eraseFromParent();
tools/clang/lib/CodeGen/CGExprScalar.cpp 1022 llvm::ConstantInt::get(Builder.getInt8Ty(), Check.first)};
1144 CheckKind = Check.first;
1512 Src.first = EmitScalarConversion(Src.first, SrcTy, DstTy, Loc);
1512 Src.first = EmitScalarConversion(Src.first, SrcTy, DstTy, Loc);
1514 return Builder.CreateOr(Src.first, Src.second, "tobool");
1521 return EmitScalarConversion(Src.first, SrcTy, DstTy, Loc);
2267 return CGF.EmitComplexExpr(E, false, true).first;
2564 llvm::Value *old = CGF.EmitToMemory(Pair.first.getScalarVal(), type);
2779 return CGF.EmitComplexExpr(Op, false, true).first;
2920 llvm::Value *old = CGF.EmitToMemory(Pair.first.getScalarVal(), LHSTy);
3862 LHS.first = Visit(E->getLHS());
3863 LHS.second = llvm::Constant::getNullValue(LHS.first->getType());
3873 RHS.first = Visit(E->getRHS());
3874 RHS.second = llvm::Constant::getNullValue(RHS.first->getType());
3881 ResultR = Builder.CreateFCmp(FCmpOpc, LHS.first, RHS.first, "cmp.r");
3881 ResultR = Builder.CreateFCmp(FCmpOpc, LHS.first, RHS.first, "cmp.r");
3886 ResultR = Builder.CreateICmp(UICmpOpc, LHS.first, RHS.first, "cmp.r");
3886 ResultR = Builder.CreateICmp(UICmpOpc, LHS.first, RHS.first, "cmp.r");
tools/clang/lib/CodeGen/CGObjCGNU.cpp 1538 InitStructBuilder.add(bounds.first);
1597 GetClassVar(clsAlias.first) }, sectionName<ClassAliasSection>());
1643 auto *global = TheModule.getGlobalVariable(lateInit.first);
1646 b.CreateStructGEP(lateInit.second.first, lateInit.second.second), CGM.getPointerAlign().getQuantity());
2323 if (i->first == TypeEncoding) {
2749 llvm::PHINode *phi = Builder.CreatePHI(v.first->getType(), 2);
2750 phi->addIncoming(v.first, messageBB);
2751 phi->addIncoming(llvm::Constant::getNullValue(v.first->getType()),
3666 allSelectors.push_back(entry.first);
3675 if (!sel.first.empty())
3677 MakeConstantString(sel.first, ".objc_sel_types");
3835 TheModule.getGlobalVariable("_OBJC_CLASS_" + iter->first, true);
tools/clang/lib/CodeGen/CGObjCMac.cpp 1808 llvm::Type *scalarTy = callResult.first->getType();
1813 real->addIncoming(callResult.first, callBB);
1945 return *Map.insert(std::make_pair(String, nullptr)).first;
5569 values.add(GetClassName(entry.first->getName()));
tools/clang/lib/CodeGen/CGOpenMPRuntime.cpp 1003 SharedAddresses[N].first.getType().getNonReferenceType()),
1010 cast<llvm::PointerType>(SharedAddresses[N].first.getPointer()->getType())
1015 SharedAddresses[N].first.getPointer());
1021 SharedAddresses[N].first.getType().getNonReferenceType());
1063 QualType SharedType = SharedAddresses[N].first.getType();
1067 SharedType, SharedAddresses[N].first.getBaseInfo(),
1068 CGF.CGM.getTBAAInfoForSubobject(SharedAddresses[N].first, SharedType));
1179 loadToBegin(CGF, OrigVD->getType(), SharedAddresses[N].first.getType(),
1182 BaseLValue.getPointer(), SharedAddresses[N].first.getPointer());
1186 SharedAddresses[N].first.getAddress().getType());
1189 SharedAddresses[N].first.getType(),
1331 (void)tryEmitDeclareVariant(Pair.second.first, Pair.second.second, Addr,
3139 auto &Elem = *InternalVars.try_emplace(RuntimeName, nullptr).first;
3954 Action(D.first, F.first, P.first(), L.first, L.second);
3954 Action(D.first, F.first, P.first(), L.first, L.second);
3954 Action(D.first, F.first, P.first(), L.first, L.second);
5000 return L.first > R.first;
5000 return L.first > R.first;
5260 switch (Data.Dependences[I].first) {
5550 RValue Func = RValue::get(Reduction.first);
7638 PartialStruct.HighestElem.first)>::max(),
7731 } else if (FieldIndex < PartialStruct.LowestElem.first) {
7733 } else if (FieldIndex > PartialStruct.HighestElem.first) {
7869 DevPointersMap[L.first].push_back(L.second);
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,
8059 auto CI = DeferredInfo.find(M.first);
8121 InfoGen(L.first, L.second, MC->getMapType(), MC->getMapTypeModifiers(),
8290 assert(L.first == VD &&
8443 if (!L.first)
8445 const auto *VD = dyn_cast<VarDecl>(L.first);
tools/clang/lib/CodeGen/CGOpenMPRuntime.h 186 LValue getSharedLValue(unsigned N) const { return SharedAddresses[N].first; }
tools/clang/lib/CodeGen/CGOpenMPRuntimeNVPTX.cpp 247 return L.first > R.first;
247 return L.first > R.first;
2052 assert(!TeamAndReductions.first &&
2054 TeamAndReductions.first = D.getCapturedStmt(OMPD_teams)->getCapturedDecl();
2076 auto I = Rt.FunctionGlobalizedDecls.try_emplace(CGF.CurFn).first;
2302 bool EscapedParam = I->getSecond().EscapedParameters.count(Rec.first);
2305 const auto *VD = cast<VarDecl>(Rec.first);
2322 Address(Ptr, CGM.getContext().getDeclAlign(Rec.first)), VarTy,
2349 const auto *VD = cast<VarDecl>(Rec.first);
4664 assert((!TeamAndReductions.first || TeamAndReductions.first == D) &&
4664 assert((!TeamAndReductions.first || TeamAndReductions.first == D) &&
4685 TeamAndReductions.first = nullptr;
4691 auto I = FunctionGlobalizedDecls.try_emplace(CGF.CurFn).first;
5006 Data.first = CGM.getLangOpts().OpenMPCUDANumSMs;
5009 if (Data.first && Data.second)
5147 llvm::APInt Size2(32, SMsBlockPerSM.first);
tools/clang/lib/CodeGen/CGRecordLayoutBuilder.cpp 605 Context.getTypeInfoDataSizeInChars(Prior->FD->getType()).first);
670 Members.push_back(StorageInfo(Pad->first, getByteArrayType(Pad->second)));
874 const RecordDecl *RD = it->first->getParent();
877 it2 = RD->field_begin(); *it2 != it->first; ++it2)
tools/clang/lib/CodeGen/CGStmtOpenMP.cpp 580 if (LocalAddrPair.second.first) {
581 LocalScope.addPrivate(LocalAddrPair.second.first, [&LocalAddrPair]() {
588 VLASizeMap[VLASizePair.second.first] = VLASizePair.second.second;
614 I->second.first ? I->second.first->getType() : Arg->getType(),
614 I->second.first ? I->second.first->getType() : Arg->getType(),
2043 llvm::Value *LBVal = DispatchBounds.first;
2368 LValue LB = Bounds.first;
3030 Scope.addPrivate(Pair.first, [&CGF, &DRE]() {
3036 CGF.getContext().getDeclAlign(Pair.first));
3037 Scope.addPrivate(Pair.first, [Replacement]() { return Replacement; });
3248 CGF.getContext().getDeclAlign(Pair.first));
3249 Scope.addPrivate(Pair.first, [Replacement]() { return Replacement; });
3671 ComplexVal.first = CGF.EmitScalarConversion(
3672 Val.getComplexVal().first, SrcElementType, DestElementType, Loc);
3852 if (!Res.first) {
3912 return RValue::getComplex(Res.first, Res.second);
3961 if (Res.first) {
3987 if (Res.first) {
tools/clang/lib/CodeGen/CGVTT.cpp 143 BaseSubobjectPairTy ClassSubobjectPair(RD, I->first);
170 std::make_pair(RD, I->first);
tools/clang/lib/CodeGen/CGVTables.cpp 706 layout.vtable_thunks()[nextVTableThunkIndex].first == idx) {
1079 AP.first.getBase(), VTLayout.getVTableOffset(AP.second.VTableIndex) +
1091 QualType(AP1.first->getTypeForDecl(), 0), O1);
1097 QualType(AP2.first->getTypeForDecl(), 0), O2);
1111 AddVTableTypeMetadata(VTable, PointerWidth * AP.second, AP.first);
1123 Context.getRecordType(AP.first).getTypePtr()));
tools/clang/lib/CodeGen/CGValue.h 101 return getComplex(C.first, C.second);
623 return mayOverlap() ? Ctx.getTypeInfoDataSizeInChars(Type).first
tools/clang/lib/CodeGen/CodeGenAction.cpp 469 B << SourceRange(Loc.getLocWithOffset(Range.first - Column),
tools/clang/lib/CodeGen/CodeGenFunction.cpp 378 EscapeArgs[Pair.second] = Pair.first;
414 I->first->replaceAllUsesWith(I->second);
415 I->first->eraseFromParent();
tools/clang/lib/CodeGen/CodeGenFunction.h 886 Dest.erase(Pair.first);
890 auto I = Dest.find(Pair.first);
tools/clang/lib/CodeGen/CodeGenModule.cpp 266 llvm::GlobalValue *GV = I.first;
1066 MangledDeclNames[OtherGD.getCanonicalDecl()] = Result.first->first();
1102 return MangledDeclNames[CanonicalGD] = Result.first->first();
1123 return Result.first->first();
3816 R.first->second = nullptr;
4591 return *Map.insert(std::make_pair(String, nullptr)).first;
4612 nullptr)).first;
5520 const Decl *D = Entry.first;
5584 IdentifierInfo *Name = I.first;
5615 EmitGlobalDeclMetadata(*this, GlobalMetadata, I.first, Addr);
5632 const Decl *D = I.first;
5675 const Decl *D = Val.first.getDecl()->getMostRecentDecl();
tools/clang/lib/CodeGen/CodeGenModule.h 453 return LHS.first.priority < RHS.first.priority;
453 return LHS.first.priority < RHS.first.priority;
tools/clang/lib/CodeGen/CoverageMappingGen.cpp 249 SourceLocation Loc = FL.first;
250 FileID SpellingFile = SM.getDecomposedSpellingLoc(Loc).first;
266 return Mapping->second.first;
280 FileLineRanges[R.FileID].first =
281 std::min(FileLineRanges[R.FileID].first, R.LineStart);
301 if (Region.LineStart >= FileLineRanges[*CovFileID].first &&
543 SourceLocation Start = LastTerminatedRegion->first;
1360 FilenameStrs[I] = normalizeFilename(Entry.first->getName());
1384 FilenameStrs[I] = normalizeFilename(Entry.first->getName());
tools/clang/lib/CodeGen/ItaniumCXXABI.cpp 2410 int Priority = I.first;
2608 const VarDecl *VD = VDAndWrapper.first;
tools/clang/lib/CodeGen/SwiftCallingConv.cpp 239 auto eltTy = split.first;
387 auto eltTy = split.first;
793 return ABIArgInfo::getCoerceAndExpand(types.first, types.second);
tools/clang/lib/CodeGen/TargetInfo.cpp 351 DirectSize = ValueInfo.first;
3833 uint64_t TySize = SizeAlign.first.getQuantity();
4295 Size = TypeInfo.first.alignTo(OverflowAreaAlign);
4872 CharUnits EltSize = TypeInfo.first / 2;
5445 BaseTyInfo.first.getQuantity() < 16)
5446 Offset = 16 - BaseTyInfo.first.getQuantity();
5569 if (TyInfo.first.getQuantity() > 16) {
6705 UnpaddedSize = TyInfo.first;
8376 CharUnits Offset = SlotSize - TypeInfo.first;
9649 bool IsIndirect = SizeAndAlign.first > 2 * SlotSize;
tools/clang/lib/CodeGen/VarBypassDetector.cpp 138 const Stmt *St = S.first;
158 assert(Scopes[To].first < To);
160 To = ScopeTo.first;
163 assert(Scopes[From].first < From);
164 From = Scopes[From].first;
tools/clang/lib/CrossTU/CrossTranslationUnit.cpp 575 auto I = ImportedFileIDs.find(DecToLoc.first);
579 FileID FromID = I->second.first;
tools/clang/lib/Driver/Compilation.cpp 144 if (JA && File.first != JA)
tools/clang/lib/Driver/Distro.cpp 83 if (!Data.split('.').first.getAsInteger(10, MajorVersion)) {
103 return llvm::StringSwitch<Distro::DistroType>(Data.split("\n").first)
129 if (!SplitVer.first.getAsInteger(10, Version) && Version > 10)
tools/clang/lib/Driver/Driver.cpp 608 return types::isCuda(I.first);
613 return types::isHIP(I.first);
947 PrefixDirs.push_back(Split.first);
1285 if (types::getPreprocessedType(it->first) == types::TY_INVALID) {
1475 int CommandRes = CmdPair.first;
2937 for (auto TI = OpenMPTCRange.first, TE = OpenMPTCRange.second; TI != TE;
3258 types::ID InputType = I.first;
3391 types::ID InputType = I.first;
4413 llvm::sys::path::append(CrashDirectory, Split.first);
4422 TmpName = GetTemporaryPath(Split.first, Suffix);
4533 Split.first, types::getTypeTempSuffix(JA.getType(), IsCLMode()));
tools/clang/lib/Driver/SanitizerArgs.cpp 438 SanitizerMask Group = G.first;
487 SanitizerMask Group = G.first;
917 if (CoverageFeatures & F.first)
tools/clang/lib/Driver/ToolChains/Arch/AArch64.cpp 37 CPU = Mcpu.split("+").first.lower();
77 CPU = Split.first;
107 llvm::AArch64::ArchKind ArchKind = llvm::AArch64::parseArch(Split.first);
tools/clang/lib/Driver/ToolChains/Arch/ARM.cpp 90 CPU = CPU.split("+").first;
615 MArch = StringRef(MArch).split("+").first.lower();
654 std::string MCPU = StringRef(CPU).split("+").first.lower();
tools/clang/lib/Driver/ToolChains/Clang.cpp 143 for (auto II = TCs.first, IE = TCs.second; II != IE; ++II)
2179 auto Sym = Pair.first;
tools/clang/lib/Driver/ToolChains/Cuda.cpp 42 if (First.first.getAsInteger(10, Major) ||
43 Second.first.getAsInteger(10, Minor))
tools/clang/lib/Driver/ToolChains/Gnu.cpp 1694 if (First.first.getAsInteger(10, GoodVersion.Major) || GoodVersion.Major < 0)
1696 GoodVersion.MajorStr = First.first.str();
1699 StringRef MinorStr = Second.first;
2476 std::string basePath = "/usr/lib/gcc/" + ActiveVersion.first.str() + "/"
2491 GCCTriple.setTriple(ActiveVersion.first);
tools/clang/lib/Edit/Commit.cpp 243 if (locInfo.first.isInvalid())
245 offs = FileOffset(locInfo.first, locInfo.second);
277 if (locInfo.first.isInvalid())
279 offs = FileOffset(locInfo.first, locInfo.second);
314 if (beginInfo.first != endInfo.first ||
314 if (beginInfo.first != endInfo.first ||
318 Offs = FileOffset(beginInfo.first, beginInfo.second);
tools/clang/lib/Edit/EditedSource.cpp 77 if (FA->first != Offs)
157 FileOffset B = I->first;
172 for (; I != FileEdits.end() && EndOffs > I->first; ++I) {
174 FileOffset B = I->first;
211 FileOffset B = I->first;
229 FileOffset B = I->first;
254 FileOffset B = I->first;
419 CurOffs = I->first;
426 FileOffset offs = I->first;
474 FileOffset B = I->first;
tools/clang/lib/Format/BreakableToken.cpp 258 Tok, Prefix.size() + TailOffset + Split.first, Split.second, Postfix,
292 Text.data() - tokenAt(LineIndex).TokenText.data() + Split.first;
578 Text.size() == Split.first + Split.second) {
587 Text.data() - tokenAt(LineIndex).TokenText.data() + Split.first;
833 Text.data() - tokenAt(LineIndex).TokenText.data() + Split.first;
tools/clang/lib/Format/ContinuationIndenter.cpp 1587 auto NewCode = applyAllReplacements(RawText, Fixes.first);
1620 for (const tooling::Replacement &Fix : Fixes.first) {
1699 .first;
1911 if (Split.first == StringRef::npos) {
1922 assert(Split.first != 0);
1945 LineIndex, TailOffset, Split.first, ContentStartColumn);
1949 LineIndex, TailOffset + Split.first + Split.second, ColumnLimit,
1954 if (NextSplit.first == StringRef::npos) {
1960 Split.first + Split.second + NextSplit.first, ContentStartColumn);
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,
2039 LLVM_DEBUG(llvm::dbgs() << " Breaking at: " << TailOffset + Split.first
2046 TailOffset += Split.first + Split.second;
2082 if (SplitBeforeNext.first != StringRef::npos) {
2083 LLVM_DEBUG(llvm::dbgs() << SplitBeforeNext.first << ", "
2085 TailOffset = SplitBeforeNext.first + SplitBeforeNext.second;
2105 if (Split.first == StringRef::npos) {
2113 NextLineIndex, TailOffset, Split.first, ContentStartColumn);
2169 if (SplitAfterLastLine.first != StringRef::npos) {
2184 TailOffset + SplitAfterLastLine.first + SplitAfterLastLine.second,
tools/clang/lib/Format/Format.cpp 2425 CurrentCode ? StringRef(*CurrentCode) : Code, PassFixes.first);
2427 Fixes = Fixes.merge(PassFixes.first);
2451 .first;
2460 return Cleaner(Environment(Code, FileName, Ranges), Style).process().first;
2479 .first;
2488 .first;
tools/clang/lib/Format/SortJavaScriptImports.cpp 447 .first;
tools/clang/lib/Format/TokenAnalyzer.cpp 90 for (tooling::Replacements::const_iterator I = RunResult.first.begin(),
91 E = RunResult.first.end();
101 for (const auto &R : RunResult.first) {
tools/clang/lib/Format/UnwrappedLineFormatter.cpp 959 Penalty = Queue.top().first.first;
959 Penalty = Queue.top().first.first;
tools/clang/lib/Frontend/ASTUnit.cpp 174 std::string MPath(RF.first);
190 std::string MPath(RB.first);
796 AST->PPOpts->addRemappedFile(RemappedFile.first, RemappedFile.second);
1760 CI->getPreprocessorOpts().addRemappedFile(RemappedFile.first,
1848 Invocation->getPreprocessorOpts().addRemappedFile(RemappedFile.first,
2228 PreprocessorOpts.addRemappedFile(RemappedFile.first, RemappedFile.second);
2278 PreprocessorOpts.PrecompiledPreambleBytes.first = 0;
2389 SourceLocation BL = FileLoc.getLocWithOffset(Range.first);
2400 SourceLocation BL = FileLoc.getLocWithOffset(FixIt.RemoveRange.first);
2441 if (Decls->empty() || Decls->back().first <= Offset) {
2473 return LD.first < Offset;
tools/clang/lib/Frontend/CompilerInstance.cpp 337 FileMgr.getVirtualFile(RB.first, RB.second->getBufferSize(), 0);
339 Diags.Report(diag::err_fe_remap_missing_from_file) << RB.first;
356 Diags.Report(diag::err_fe_remap_missing_to_file) << RF.first << RF.second;
362 FileMgr.getVirtualFile(RF.first, (*ToFile)->getSize(), 0);
364 Diags.Report(diag::err_fe_remap_missing_from_file) << RF.first;
496 bool Preamble = getPreprocessorOpts().PrecompiledPreambleBytes.first != 0;
1064 StringRef MacroDef = def.first;
1066 llvm::CachedHashString(MacroDef.split('=').first)) > 0;
1624 StringRef ModuleName = Path[0].first->getName();
1642 = KnownModules.find(Path[0].first);
1659 Known = KnownModules.insert(std::make_pair(Path[0].first, Module)).first;
1659 Known = KnownModules.insert(std::make_pair(Path[0].first, Module)).first;
1753 KnownModules[Path[0].first] = nullptr;
1767 KnownModules[Path[0].first] = nullptr;
1777 if (Pos->first == ModuleName)
1784 CyclePath += Pos->first;
1812 KnownModules[Path[0].first] = nullptr;
1835 KnownModules[Path[0].first] = nullptr;
1841 KnownModules[Path[0].first] = nullptr;
1847 Known = KnownModules.insert(std::make_pair(Path[0].first, Module)).first;
1847 Known = KnownModules.insert(std::make_pair(Path[0].first, Module)).first;
1859 StringRef Name = Path[I].first->getName();
1886 << Path[I].first << Module->getFullModuleName() << PrivateModule
1921 << Path[I].first << Module->getFullModuleName() << Best[0]
1934 << Path[I].first << Module->getFullModuleName()
tools/clang/lib/Frontend/CompilerInvocation.cpp 397 return Config.insert({OptionName, DefaultVal}).first->second;
2094 llvm::CachedHashString(MacroDef.split('=').first));
3201 if (!VerParts.first.startswith("0") &&
3202 !VerParts.first.getAsInteger(10, Major) &&
3206 : VerParts.first.size() == Ver.size() ||
3301 Opts.PrecompiledPreambleBytes.first = Bytes;
3342 Opts.addRemappedFile(Split.first, Split.second);
3593 StringRef MacroDef = I.first;
3595 llvm::CachedHashString(MacroDef.split('=').first)))
3599 code = hash_combine(code, I.first, I.second);
3644 code = hash_combine(code, KeyValue.first, KeyValue.second);
tools/clang/lib/Frontend/DependencyGraph.cpp 132 writeNodeReference(OS, F->first);
tools/clang/lib/Frontend/DiagnosticRenderer.cpp 206 emitImportStackRecursively(Imported.first, Imported.second);
226 emitImportStackRecursively(NextImportLoc.first, NextImportLoc.second);
241 emitImportStackRecursively(NextImportLoc.first, NextImportLoc.second);
254 I.first);
tools/clang/lib/Frontend/FrontendActions.cpp 332 bool Preamble = CI.getPreprocessorOpts().PrecompiledPreambleBytes.first != 0;
619 Out << I->first << "\n";
tools/clang/lib/Frontend/InitHeaderSearch.cpp 560 if (Include.first == Quoted)
568 if (Include.first == Angled || Include.first == IndexHeaderMap)
568 if (Include.first == Angled || Include.first == IndexHeaderMap)
575 if (Include.first == System || Include.first == ExternCSystem ||
575 if (Include.first == System || Include.first == ExternCSystem ||
576 (!Lang.ObjC && !Lang.CPlusPlus && Include.first == CSystem) ||
578 Include.first == CXXSystem) ||
579 (Lang.ObjC && !Lang.CPlusPlus && Include.first == ObjCSystem) ||
580 (Lang.ObjC && Lang.CPlusPlus && Include.first == ObjCXXSystem))
584 if (Include.first == After)
tools/clang/lib/Frontend/InitPreprocessor.cpp 42 StringRef MacroName = MacroPair.first;
1164 Builder.undefineMacro(InitOpts.Macros[i].first);
1166 DefineBuiltinMacro(Builder, InitOpts.Macros[i].first,
1191 PP.setSkipMainFilePreamble(InitOpts.PrecompiledPreambleBytes.first,
tools/clang/lib/Frontend/InterfaceStubFunctionsConsumer.cpp 279 auto VD = cast<ValueDecl>(E.first)->getType();
tools/clang/lib/Frontend/PrecompiledPreamble.cpp 274 PreprocessorOpts.PrecompiledPreambleBytes.first = 0;
465 if (moveOnNoError(VFS->status(RB.first), Status))
468 OverridenFileBuffers[RB.first] = PreambleHash;
716 PreprocessorOpts.PrecompiledPreambleBytes.first = Bounds.Size;
tools/clang/lib/Frontend/PrintPreprocessedOutput.cpp 822 return LHS->first->getName().compare(RHS->first->getName());
822 return LHS->first->getName().compare(RHS->first->getName());
842 MacrosByID.push_back(id_macro_pair(I->first, MD->getMacroInfo()));
851 PrintMacroDefinition(*MacrosByID[i].first, MI, PP, *OS);
tools/clang/lib/Frontend/Rewrite/FixItRewriter.cpp 96 const FileEntry *Entry = Rewrite.getSourceMgr().getFileEntryForID(I->first);
tools/clang/lib/Frontend/SerializedDiagnosticPrinter.cpp 554 if (entry.first == 0) {
555 entry.first = State->DiagFlags.size();
559 RecordData::value_type Record[] = {RECORD_DIAG_FLAG, entry.first,
565 return entry.first;
tools/clang/lib/Frontend/TextDiagnostic.cpp 171 SourceLine.replace(i, 1, res.first.c_str());
214 columns += llvm::sys::locale::columnWidth(res.first);
247 columns += llvm::sys::locale::columnWidth(res.first);
884 if (BInfo.first != CaretFileID || EInfo.first != CaretFileID)
884 if (BInfo.first != CaretFileID || EInfo.first != CaretFileID)
955 unsigned Slack = MaxRange - (A.second - A.first + 1);
960 unsigned Min = std::min(A.first, B.first);
960 unsigned Min = std::min(A.first, B.first);
967 if ((B.first > A.first && B.first - A.first + 1 > MaxRange) ||
967 if ((B.first > A.first && B.first - A.first + 1 > MaxRange) ||
967 if ((B.first > A.first && B.first - A.first + 1 > MaxRange) ||
967 if ((B.first > A.first && B.first - A.first + 1 > MaxRange) ||
978 Slack = MaxRange - (A.second - A.first + 1);
979 A.first = std::max(Min + Slack, A.first) - Slack;
979 A.first = std::max(Min + Slack, A.first) - Slack;
980 A.second = std::min(A.first + MaxRange - 1, Max);
1085 if (FID == HintLocInfo.first &&
1086 LineNo == SM.getLineNumber(HintLocInfo.first, HintLocInfo.second) &&
1094 = SM.getColumnNumber(HintLocInfo.first, HintLocInfo.second) - 1;
1158 FileID FID = LocInfo.first;
1184 for (unsigned LineNo = Lines.first; LineNo != Lines.second + 1; ++LineNo) {
1309 to_print += res.first.str();
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 55 auto Diag = Diags.Report(Diags.getCustomDiagID(I.first, "%0"));
56 switch (I.first) {
tools/clang/lib/Frontend/VerifyDiagnosticConsumer.cpp 346 Marker &M = InsertResult.first->second;
852 if (I->first.isInvalid() || !SourceMgr)
857 SourceMgr->getFileID(I->first)))
859 OS << " Line " << SourceMgr->getPresumedLineNumber(I->first);
935 unsigned LineNo2 = SourceMgr.getPresumedLineNumber(II->first);
941 !IsFromSameFile(SourceMgr, D.DiagnosticLoc, II->first))
tools/clang/lib/Index/CommentToXML.cpp 880 FileID FID = LocInfo.first;
tools/clang/lib/Index/IndexingAction.cpp 155 M.first, MD->getMacroInfo(),
tools/clang/lib/Index/USRGeneration.cpp 32 const FileEntry *FE = SM.getFileEntryForID(Decomposed.first);
tools/clang/lib/Lex/DependencyDirectivesSourceMinimizer.cpp 561 SplitIds.try_emplace(StringRef(Id.begin(), Id.size()), 0).first->first()};
tools/clang/lib/Lex/HeaderSearch.cpp 120 if (HeaderMaps[i].first == FE)
136 Names.push_back(HM.first->getName());
779 const FileEntry *Includer = IncluderAndDir.first;
937 if (Filename.startswith(SystemHeaderPrefixes[j-1].first)) {
977 if (!Includers.empty() && Includers.front().first && !isAngled &&
979 HeaderFileInfo &IncludingHFI = getFileInfo(Includers.front().first);
1057 FrameworkCacheEntry())).first;
1340 return FrameworkNames.insert(Framework).first->first();
1533 return AddResult.first->second ? LMM_AlreadyLoaded : LMM_InvalidModuleMap;
tools/clang/lib/Lex/Lexer.cpp 334 StringRef file = SM.getBufferData(locInfo.first, &invalidTemp);
343 Lexer lexer(SM.getLocForStartOfFile(locInfo.first), options,
470 StringRef Buffer = SM.getBufferData(LocInfo.first, &Invalid);
480 Lexer TheLexer(SM.getLocForStartOfFile(LocInfo.first), LangOpts,
511 if (LocInfo.first.isInvalid())
515 StringRef Buffer = SM.getBufferData(LocInfo.first, &Invalid);
568 assert(FileLocInfo.first == BeginFileLocInfo.first &&
568 assert(FileLocInfo.first == BeginFileLocInfo.first &&
951 if (beginInfo.first.isInvalid()) {
957 if (!SM.isInFileID(Range.getEnd(), beginInfo.first, &EndOffs) ||
965 StringRef file = SM.getBufferData(beginInfo.first, &invalidTemp);
1018 StringRef ExpansionBuffer = SM.getBufferData(ExpansionInfo.first);
1043 StringRef ExpansionBuffer = SM.getBufferData(ExpansionInfo.first);
1076 if (LocInfo.first.isInvalid())
1079 StringRef Buffer = SM.getBufferData(LocInfo.first, &Invalid);
1251 StringRef File = SM.getBufferData(LocInfo.first, &InvalidTemp);
1258 Lexer lexer(SM.getLocForStartOfFile(LocInfo.first), LangOpts, File.begin(),
tools/clang/lib/Lex/MacroInfo.cpp 58 assert(startInfo.first == endInfo.first &&
58 assert(startInfo.first == endInfo.first &&
tools/clang/lib/Lex/ModuleMap.cpp 128 Module *Context = lookupModuleUnqualified(Id[0].first, Mod);
132 << Id[0].first << Mod->getFullModuleName();
139 Module *Sub = lookupModuleQualified(Id[I].first, Context);
143 << Id[I].first << Context->getFullModuleName()
619 Explicit).first;
637 Explicit).first;
964 std::make_pair(*ParentDir, InferredDirectory())).first;
1255 llvm::errs() << " \"" << H->first->getName() << "\" -> ";
1871 if (Module *Next = Map.lookupModuleQualified(Id[I].first, ActiveModule)) {
1880 << Id[I].first
1897 StringRef ModuleName = Id.back().first;
1927 SourceMgr.getDecomposedLoc(ModuleNameLoc).first !=
1928 SourceMgr.getDecomposedLoc(Existing->DefinitionLoc).first;
1967 .first;
2647 OS << Id[I].first;
3001 assert(Loc.first == ID && "stopped in a different file?");
tools/clang/lib/Lex/PPDirectives.cpp 382 const llvm::MemoryBuffer *Buf = SourceMgr.getBuffer(HashFileOffset.first);
1250 SM.getDecomposedExpansionLoc(FlagTok.getLocation()).first;
1259 SM.getDecomposedExpansionLoc(IncLoc).first != CurFileID) {
1578 PathString += Path[I].first->getName();
1665 << M->getFullModuleName() << Requirement.second << Requirement.first;
tools/clang/lib/Lex/PPLexerChange.cpp 551 MacroExpandingLexersStack.back().first == CurTokenLexer.get())
667 auto &State = R.first->second;
688 State.Macros.insert(std::make_pair(Macro.first, std::move(MS)));
tools/clang/lib/Lex/Pragma.cpp 787 IdentifierInfo *ModuleName = ModuleNameLoc.first;
1098 M = MM.lookupModuleQualified(IIAndLoc.first->getName(), M);
1101 << IIAndLoc.first;
1594 if (ModuleName.front().first->getName() != Current) {
1596 << ModuleName.front().first << (ModuleName.size() > 1)
1611 auto *NewM = M->findOrInferSubmodule(ModuleName[I].first->getName());
1614 << M->getFullModuleName() << ModuleName[I].first;
tools/clang/lib/Lex/PreprocessingRecord.cpp 64 return llvm::make_range(iterator(this, CachedRangeQuery.Result.first),
73 return llvm::make_range(iterator(this, Res.first),
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)
159 return std::make_pair(int(Loaded.first)-TotalLoaded,
163 return std::make_pair(int(Loaded.first)-TotalLoaded, Local.second);
tools/clang/lib/Lex/Preprocessor.cpp 371 BestSpelling = I->first->getName();
421 if (SkipMainFilePreamble.first &&
423 if (Position - Buffer->getBufferStart() < SkipMainFilePreamble.first)
424 Position = Buffer->getBufferStart() + SkipMainFilePreamble.first;
507 StringRef Buffer = SM.getBufferData(LocInfo.first, &Invalid);
546 if (SkipMainFilePreamble.first > 0)
547 CurLexer->SetByteOffset(SkipMainFilePreamble.first,
1258 FlatModuleName += Piece.first->getName();
tools/clang/lib/Parse/ParseObjc.cpp 437 index++, pair.first, pair.second, SourceLocation(), nullptr);
tools/clang/lib/Parse/ParseOpenMP.cpp 847 P.Diag(Res.first->getValue(), diag::note_omp_declare_variant_ctx_used_here)
932 Diag(Res.first->getValue(),
1048 DeclVarData.getValue().first, DeclVarData.getValue().second,
tools/clang/lib/Parse/ParsePragma.cpp 688 auto Ident = Data->first;
747 PP.EnterTokenStream(std::move(TheTokens->first), TheTokens->second, true,
1230 if (!Rule.first) {
1234 attr::SubjectMatchRule PrimaryRule = *Rule.first;
1382 FixIt += attr::getSubjectMatchRuleSpelling(I.first);
2178 Info->first = Ext;
tools/clang/lib/Parse/ParseStmtAsm.cpp 420 FID = ExpAsmLoc.first;
448 FID = ExpSemiLoc.first;
456 if (ExpLoc.first != FID ||
457 SrcMgr.getLineNumber(ExpLoc.first, ExpLoc.second) != LineNo) {
472 LineNo = SrcMgr.getLineNumber(ExpLoc.first, ExpLoc.second);
477 FID = ExpLoc.first;
651 Expr *OpExpr = static_cast<Expr *>(OpExprs[i].first);
tools/clang/lib/Rewrite/Rewriter.cpp 235 FID = V.first;
243 if (I != RewriteBuffers.end() && I->first == FID)
469 getSourceMgr().getFileEntryForID(I->first);
tools/clang/lib/Sema/AnalysisBasedWarnings.cpp 1388 const WeakObjectProfileTy &Profile = I->first;
1413 return SM.isBeforeInTranslationUnit(LHS.first->getBeginLoc(),
1414 RHS.first->getBeginLoc());
1440 const Stmt *FirstRead = P.first;
1441 const WeakObjectProfileTy &Key = P.second->first;
1532 const VarDecl *vd = P.first;
1600 return SM.isBeforeInTranslationUnit(left.first.first, right.first.first);
1600 return SM.isBeforeInTranslationUnit(left.first.first, right.first.first);
1600 return SM.isBeforeInTranslationUnit(left.first.first, right.first.first);
1600 return SM.isBeforeInTranslationUnit(left.first.first, right.first.first);
1676 S.Diag(Diag.first.first, Diag.first.second);
1676 S.Diag(Diag.first.first, Diag.first.second);
1676 S.Diag(Diag.first.first, Diag.first.second);
1678 S.Diag(Note.first, Note.second);
1896 S.Diag(Diag.first.first, Diag.first.second);
1896 S.Diag(Diag.first.first, Diag.first.second);
1896 S.Diag(Diag.first.first, Diag.first.second);
1898 S.Diag(Note.first, Note.second);
tools/clang/lib/Sema/CodeCompleteConsumer.cpp 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));
729 unsigned TargetScope = TI->first;
754 unsigned Scope = I->first;
766 for (unsigned S = I->first; S != Scope; S = Scopes[S].ParentScope)
785 DiagnoseIndirectOrAsmJump(I->second, I->first, TargetLabel, TargetScope);
tools/clang/lib/Sema/Scope.cpp 174 if (Flags & Info.first) {
176 Flags &= ~Info.first;
tools/clang/lib/Sema/ScopeInfo.cpp 47 CoroutineSuspends.first = nullptr;
tools/clang/lib/Sema/Sema.cpp 660 NamedDecl *ND = UndefinedUse.first;
719 ValueDecl *VD = cast<ValueDecl>(Undef.first);
917 if (auto Func = dyn_cast<FunctionDecl>(PII.first))
1020 Decl *PrevDecl = LookupSingleName(TUScope, WeakID.first, SourceLocation(),
1028 << WeakID.first;
1230 AnalyzeDeleteExprMismatch(DeletedFieldInfo.first, DeleteExprLoc.first,
1230 AnalyzeDeleteExprMismatch(DeletedFieldInfo.first, DeleteExprLoc.first,
1418 const SourceLocation &Loc = PDAt.first;
1555 FunctionDecl *NewCallee = FDLoc.first;
tools/clang/lib/Sema/SemaAttr.cpp 674 attr::SubjectMatchRule MatchRule = attr::SubjectMatchRule(Rule.first);
698 attr::SubjectMatchRule MatchRule = attr::SubjectMatchRule(Rule.first);
712 attr::SubjectMatchRule(It->second.first))
724 SubjectMatchRules.push_back(attr::SubjectMatchRule(Rule.first));
727 if (!isNegatedAttrMatcherSubRule(attr::SubjectMatchRule(Rule.first)))
728 SubjectMatchRules.push_back(attr::SubjectMatchRule(Rule.first));
734 if (Rules.erase(Rule.first)) {
738 SubjectMatchRules.push_back(Rule.first);
749 ExtraRules.push_back(attr::SubjectMatchRule(Rule.first));
889 unsigned rawType = Stack->back().first;
974 bool StartsWithPragma = Back->first != NoVisibility;
983 StartsWithPragma = Back->first != NoVisibility;
tools/clang/lib/Sema/SemaChecking.cpp12607 UsageInfo &U = Self.UsageMap[M.first];
12609 Self.addUsage(U, M.first, SideEffectUsage.Use, UK_ModAsValue);
tools/clang/lib/Sema/SemaCodeComplete.cpp 1094 const NamedDecl *ND = I->first;
1119 if (I->first->hasTagIdentifierNamespace() &&
1125 if (((I->first->getIdentifierNamespace() & Decl::IDNS_ObjCProtocol) ||
1127 I->first->getIdentifierNamespace() != IDNS)
1131 if (CheckHiddenResult(R, CurContext, I->first))
3846 auto MD = PP.getMacroDefinition(M->first);
3853 Result(M->first, MI,
3854 getMacroUsagePriority(M->first->getName(), PP.getLangOpts(),
6958 for (ObjCMethodList *MethList = &M->second.first;
7034 Selector Sel = M->first;
7099 if (ObjCProtocolDecl *Protocol = LookupProtocol(Pair.first, Pair.second))
8301 KnownSelectors.insert(M->first);
8355 for (ObjCMethodList *MethList = IsInstanceMethod ? &M->second.first
8394 if (M.first->getName() != "NS_DESIGNATED_INITIALIZER")
8400 Builder.getAllocator().CopyString(M.first->getName()));
8588 Builder.getAllocator().CopyString(M->first->getName()));
8663 *R.first = InternedTyped; // Avoid dangling StringRef.
tools/clang/lib/Sema/SemaConcept.cpp 118 Diag(PDiag.first, PDiag.second);
tools/clang/lib/Sema/SemaCoroutine.cpp 1045 this->InitialSuspend = cast<Expr>(Fn.CoroutineSuspends.first);
tools/clang/lib/Sema/SemaDecl.cpp 4201 auto *FNew = SrcMgr.getFileEntryForID(FNewDecLoc.first);
4202 auto *FOld = SrcMgr.getFileEntryForID(FOldDecLoc.first);
4233 SourceLocation OldIncLoc = SrcMgr.getIncludeLoc(FOldDecLoc.first);
4234 SourceLocation NewIncLoc = SrcMgr.getIncludeLoc(FNewDecLoc.first);
8083 FunctionDecl *FD = NearMatch->first;
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;
12495 DiagLoc = Notes[0].first;
12501 Diag(Notes[I].first, Notes[I].second);
12528 Diag(it.first, it.second);
13753 S.Diag(P.first, diag::warn_implicitly_retains_self)
13754 << FixItHint::CreateInsertion(P.first, "self->");
16693 << (const NamedDecl *)M->first << Record;
16694 Diag(M->first->getLocation(),
16701 << (const NamedDecl *)M->first << OM->Method->getParent();
17324 llvm::APInt &FlagBits = R.first->second;
tools/clang/lib/Sema/SemaDeclAttr.cpp 985 S.Diag(PDiag.first, PDiag.second);
tools/clang/lib/Sema/SemaDeclCXX.cpp 2304 SemaRef.Diag(Diags[I].first, Diags[I].second);
5275 if (En.first && En.first != Child) {
5275 if (En.first && En.first != Child) {
5284 if (!En.first) {
5285 En.first = Child;
6656 Inherited->findConstructorForBase(ClassDecl, InheritedCtor).first;
7172 CheckOverridingFunctionExceptionSpec(Check.first, Check.second);
7177 CheckEquivalentExceptionSpec(Check.second, Check.first);
7241 if (auto *MD = ICI->findConstructorForBase(Class, BaseCtor).first)
11679 if (!BaseCtor.first)
11682 MarkFunctionReferenced(CurrentLocation, BaseCtor.first);
11684 InitLoc, B.getType(), BaseCtor.first, VBase, BaseCtor.second);
12777 .first->second;
13614 Diag(Notes[I].first, Notes[I].second);
15614 if (DefinitionRequired && !Pos.first->second) {
15615 Pos.first->second = true;
15661 CXXRecordDecl *Class = VTableUses[I].first->getDefinition();
tools/clang/lib/Sema/SemaDeclObjC.cpp 1297 ObjCProtocolDecl *PDecl = LookupProtocol(Pair.first, Pair.second);
1301 DeclarationNameInfo(Pair.first, Pair.second), LookupObjCProtocolName,
1305 << Pair.first);
1309 Diag(Pair.second, diag::err_undeclared_protocol) << Pair.first;
1329 Diag(Pair.second, diag::warn_undef_protocolref) << Pair.first;
1774 IdentifierInfo *Ident = IdentPair.first;
3409 GlobalMethods())).first;
3413 ObjCMethodList &Entry = instance ? Pos->second.first : Pos->second.second;
3483 ObjCMethodList &MethList = InstanceFirst ? Pos->second.first :
3500 Pos->second.first;
3531 BestMethod->isInstanceMethod() ? Pos->second.first : Pos->second.second;
3546 ObjCMethodList &MethList = instance ? Pos->second.first : Pos->second.second;
3615 for (const ObjCMethodList *Method = &Methods.first; Method;
3689 for (ObjCMethodList *M = &b->second.first; M; M=M->getNext())
4194 method->isInstanceMethod() ? it->second.first : it->second.second;
4349 ObjCMethod->isInstanceMethod()? It->second.first: It->second.second;
4971 ReferencedSelectors[Sels[I].first] = Sels[I].second;
4981 Selector Sel = SelectorAndLocation.first;
tools/clang/lib/Sema/SemaExpr.cpp 223 Diag(Suppressed.first, Suppressed.second);
14988 DiagLoc = Notes[0].first;
14996 Diag(Note.first, Note.second);
15004 Diag(Note.first, Note.second);
tools/clang/lib/Sema/SemaExprCXX.cpp 2625 Matches[0].first);
6287 if (Classes.first && Classes.second) {
6290 Context.getQualifiedType(Composite1, Quals), Classes.first);
tools/clang/lib/Sema/SemaExprObjC.cpp 1164 ObjCMethodList &InstMethList = b->second.first;
tools/clang/lib/Sema/SemaLookup.cpp 534 ExistingI = UniqueResult.first->second;
544 ExistingI = UniqueResult.first->second;
852 if (Index.first) {
853 InsertOCLBuiltinDeclarationsFromTable(*this, R, II, Index.first - 1,
3970 DeclContext *OuterCtx = findOuterContext(S).first; // FIXME
4292 Namespaces.addNameSpecifier(KNPair.first);
tools/clang/lib/Sema/SemaModule.cpp 167 ModuleName += Piece.first->getName();
320 ModuleName += Piece.first->getName();
tools/clang/lib/Sema/SemaObjCProperty.cpp 322 StringRef file = SM.getBufferData(locInfo.first, &invalidTemp);
328 Lexer lexer(SM.getLocForStartOfFile(locInfo.first),
tools/clang/lib/Sema/SemaOpenMP.cpp 184 : Stack.back().first.rbegin() + IgnoredStackElements;
187 return Stack.empty() ? const_iterator() : Stack.back().first.rend();
192 : Stack.back().first.rbegin() + IgnoredStackElements;
195 return Stack.empty() ? iterator() : Stack.back().first.rend();
203 Stack.back().first.size() <= IgnoredStackElements;
207 : Stack.back().first.size() - IgnoredStackElements;
214 return &Stack.back().first[Size - 1];
231 return &Stack.back().first[Size - 2];
245 return Stack.back().first[Level];
315 Stack.back().first.emplace_back(DKind, DirName, CurScope, Loc);
316 Stack.back().first.back().DefaultAttrLoc = Loc;
322 assert(!Stack.back().first.empty() &&
324 Stack.back().first.pop_back();
393 assert(Stack.back().first.empty());
1062 if (Pair.second.first == I)
1063 return Pair.first;
1080 (isLoopControlVariable(D).first && A == OMPC_private));
1324 !isLoopControlVariable(D).first) {
1951 if (Info.first ||
2006 DSAStack->isLoopControlVariable(D).first) &&
2099 const FunctionDecl *FD = Callee.first->getMostRecentDecl();
2833 !Stack->isLoopControlVariable(VD).first) {
2893 !Stack->isLoopControlVariable(VD).first) {
2923 !Stack->isLoopControlVariable(FD).first &&
2972 !Stack->isLoopControlVariable(FD).first) {
4192 DeclToCopy.try_emplace(Res.first,
4217 ValueDecl *VD = Res.first;
4679 << P.first << P.second->getSourceRange();
5558 if (Data.first && VD->getType()->isRecordType()) {
5569 if (Data.first &&
5583 if (Data.first) {
5585 BaseLoopId = Data.first;
5587 return Data.first;
6692 if (CurrentNestedLoopCount >= Pair.first->getNumLoops()) {
6696 if (Pair.first->getDependencyKind() == OMPC_DEPEND_sink &&
6699 Pair.first->setLoopData(CurrentNestedLoopCount, nullptr);
6703 if (Pair.first->getDependencyKind() == OMPC_DEPEND_source)
6707 Pair.first->getDependencyLoc());
6712 Pair.first->getDependencyLoc(),
6713 Pair.second[CurrentNestedLoopCount].first,
6715 Pair.first->setLoopData(CurrentNestedLoopCount, CntValue);
7886 if (Pair.first && DirName.getName() && !DependentHint) {
7894 if (const auto *C = Pair.first->getSingleClause<OMPHintClause>()) {
7900 Diag(Pair.first->getBeginLoc(), diag::note_omp_critical_no_hint) << 1;
7909 if (!Pair.first && DirName.getName() && !DependentHint)
8150 } else if (DependFound && !DSAStack->getParentOrderedRegionParam().first) {
8155 if (const Expr *Param = DSAStack->getParentOrderedRegionParam().first) {
12028 ValueDecl *D = Res.first;
12195 ValueDecl *D = Res.first;
12472 ValueDecl *D = Res.first;
12625 ValueDecl *D = Res.first;
13181 ValueDecl *D = Res.first;
13817 ValueDecl *D = Res.first;
13952 ValueDecl *D = Res.first;
13964 isOpenMPSimdDirective(Stack->getCurrentDirective()) && !Info.first) {
13987 if (!Info.first)
13998 if (!Info.first)
14016 if (!Info.first)
14046 ValueDecl *D = Res.first;
14221 ValueDecl *D = Res.first;
14350 DSAStack->getParentOrderedRegionParam().first) {
14366 if (DSAStack->getParentOrderedRegionParam().first &&
14416 ValueDecl *D = Res.first;
14431 DSAStack->getParentOrderedRegionParam().first &&
14432 DepCounter != DSAStack->isParentLoopControlVariable(D).first) {
14471 DSAStack->getParentOrderedRegionParam().first &&
15621 PrevDRD = PrevData.first;
15636 const auto I = PreviousRedeclTypes.find(TyData.first.getCanonicalType());
15640 << TyData.first;
15644 PreviousRedeclTypes[TyData.first.getCanonicalType()] = TyData.second;
15646 Name, TyData.first, PrevDRD);
15873 PrevDMD = PrevData.first;
16402 ValueDecl *D = Res.first;
16482 ValueDecl *D = Res.first;
16592 ValueDecl *D = Res.first;
tools/clang/lib/Sema/SemaOverload.cpp 5611 S.Diag(Notes[0].first, diag::err_expr_not_cce) << CCE;
5616 S.Diag(Notes[I].first, Notes[I].second);
9271 assert(FirstDiff.first != Cand1CPUSpec->cpus_end() &&
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
10379 S.Diag(PDiag->first, diag::note_ovl_candidate_disabled_by_enable_if)
10400 R = SourceRange(PDiag->first, PDiag->first);
10400 R = SourceRange(PDiag->first, PDiag->first);
10509 << (unsigned)FnKindPair.first << (unsigned)ocs_non_template
10520 switch (FnKindPair.first) {
10628 << (unsigned)FnKindPair.first << (unsigned)FnKindPair.second << FnDesc
11093 S.Diag(PD.first, PD.second);
11569 MatchesCopy.addDecl(Matches[I].second, Matches[I].first.getAccess());
11584 Matches[0].first = Matches[Result - MatchesCopy.begin()].first;
11584 Matches[0].first = Matches[Result - MatchesCopy.begin()].first;
11680 return &Matches[0].first;
tools/clang/lib/Sema/SemaStmt.cpp 599 return IfStmt::Create(Context, IfLoc, IsConstexpr, InitStmt, Cond.get().first,
607 return LHS.first < RHS;
611 return LHS.first < RHS.first;
611 return LHS.first < RHS.first;
615 return LHS < RHS.first;
624 if (lhs.first < rhs.first)
624 if (lhs.first < rhs.first)
627 if (lhs.first == rhs.first &&
627 if (lhs.first == rhs.first &&
639 return lhs.first < rhs.first;
639 return lhs.first < rhs.first;
647 return lhs.first == rhs.first;
647 return lhs.first == rhs.first;
749 auto *SS = SwitchStmt::Create(Context, InitStmt, Cond.get().first, CondExpr);
811 while (EI != EIEnd && EI->first < Val)
814 if (EI != EIEnd && EI->first == Val)
984 CaseVals[i].first == ConstantCondValue)
987 if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) {
987 if (i != 0 && CaseVals[i].first == CaseVals[i-1].first) {
1000 CaseVals[i-1].first.toString(CaseValStr);
1032 llvm::APSInt &LoVal = CaseRanges[i].first;
1070 llvm::APSInt &CRLo = CaseRanges[i].first;
1083 if (I != CaseVals.end() && I->first < CRHi) {
1084 OverlapVal = I->first; // Found overlap with scalar.
1090 if (I != CaseVals.begin() && (I-1)->first >= CRLo) {
1091 OverlapVal = (I-1)->first; // Found overlap with scalar.
1154 CI->first))
1165 RI->first))
1206 while (CI != CaseVals.end() && CI->first < EI->first)
1206 while (CI != CaseVals.end() && CI->first < EI->first)
1209 if (CI != CaseVals.end() && CI->first == EI->first)
1209 if (CI != CaseVals.end() && CI->first == EI->first)
1217 if (EI->first <= Hi)
1221 if (RI == CaseRanges.end() || EI->first < RI->first) {
1221 if (RI == CaseRanges.end() || EI->first < RI->first) {
1305 while (EI != EIend && EI->first < RhsVal)
1307 if (EI == EIend || EI->first != RhsVal) {
1331 return WhileStmt::Create(Context, CondVal.first, CondVal.second, Body,
1790 if (!Second.get().first)
1805 ForStmt(Context, First, Second.get().second, Second.get().first, Third,
4137 const CXXCatchStmt *Problem = R.first->second;
4375 IdentifierInfo *ParamName = &Context.Idents.get(I->first);
tools/clang/lib/Sema/SemaStmtAsm.cpp 677 return LHS.first < RHS.first;
677 return LHS.first < RHS.first;
683 return LHS.first == RHS.first;
683 return LHS.first == RHS.first;
688 << (Found + 1)->first;
690 << Found->first;
tools/clang/lib/Sema/SemaTemplate.cpp 3286 OldDiag.first,
3743 S.Diag(Diag.first,
5800 DiagLoc = Notes[0].first;
5807 S.Diag(Notes[I].first, Notes[I].second);
8362 << P.first;
tools/clang/lib/Sema/SemaTemplateInstantiate.cpp 2272 P->first, P->second)) {
2285 P->first, P->second)) {
tools/clang/lib/Sema/SemaTemplateInstantiateDecl.cpp 206 S.Diag(P.first, P.second);
407 S.ActOnOpenMPDeclareVariantDirective(DeclVarData.getValue().first,
5609 if (FunctionDecl *Function = dyn_cast<FunctionDecl>(Inst.first)) {
5630 VarDecl *Var = cast<VarDecl>(Inst.first);
tools/clang/lib/Sema/SemaTemplateVariadic.cpp 50 } else if (getDepthAndIndex(ND).first >= DepthLimit)
305 if (auto *TTPT = Pack.first.dyn_cast<const TemplateTypeParmType *>()) {
309 return declaresSameEntity(Pack.first.get<NamedDecl *>(), LocalPack);
359 = Unexpanded[I].first.dyn_cast<const TemplateTypeParmType *>())
362 Name = Unexpanded[I].first.get<NamedDecl *>()->getIdentifier();
666 = i->first.dyn_cast<const TemplateTypeParmType *>()) {
671 NamedDecl *ND = i->first.get<NamedDecl *>();
688 i->first.get<NamedDecl *>());
735 FirstPack.first = Name;
747 << FirstPack.first << Name << *NumExpansions << NewPackSize
795 = Unexpanded[I].first.dyn_cast<const TemplateTypeParmType *>()) {
799 NamedDecl *ND = Unexpanded[I].first.get<NamedDecl *>();
806 Unexpanded[I].first.get<NamedDecl *>());
tools/clang/lib/Sema/SemaType.cpp 271 if (A.first == AttrTy)
272 A.first = NewAttrTy;
290 [=](const TypeAttrPair &A) { return A.first < AT; });
291 It != AttrsForTypes.end() && It->first == AT; ++It) {
786 if (!(RemoveTQs & Qual.first))
790 if (TypeQuals & Qual.first)
792 << DeclSpec::getSpecifierName(Qual.first) << TypeSoFar
796 TypeQuals &= ~Qual.first;
tools/clang/lib/Sema/TreeTransform.h 7185 ScopeInfo->CoroutineSuspends.first == nullptr &&
11578 ExprResult Init = Info.first;
tools/clang/lib/Serialization/ASTReader.cpp 468 diag::kind DiagID = DiagIDMappingPair.first;
585 StringRef Macro = PPOpts.Macros[I].first;
589 StringRef MacroName = MacroPair.first;
658 SuggestedPredefines += Existing.first.str();
676 if (Existing.second || Existing.first == Known->second.first)
676 if (Existing.second || Existing.first == Known->second.first)
682 << MacroName << Known->second.first << Existing.first;
682 << MacroName << Known->second.first << Existing.first;
1183 if (!Lex.first) {
3972 ObjCMethodList &Start = Method->isInstanceMethod()? Known->second.first
4035 makeNamesVisible(HiddenNames.second, HiddenNames.first);
4085 assert(!Result.first);
4090 GlobalIndex.reset(Result.first);
4256 auto Key = Trait.ReadKey(Data, KeyDataLen.first);
4265 auto ID = Trait.ReadIdentifierID(Data + KeyDataLen.first);
4306 SelectorOutOfDate[Sel.first] = true;
5462 .first;
5882 ModuleFile &M = *PPInfo.first;
6105 ModuleFile &M = *PPInfo.first;
6257 assert(IDAndOffset.first.isValid() && "invalid FileID for transition");
6265 auto &F = Diag.DiagStatesByLoc.Files[IDAndOffset.first];
7965 Visit(Lexical.first, Lexical.second);
7969 Visit(I->second.first, I->second.second);
8094 SetExternalVisibleDeclsForName(DC, I->first, I->second);
8243 llvm::errs() << " " << I->first << " -> " << I->second->FileName
8616 = S.MethodPool.insert(std::make_pair(Sel, Sema::GlobalMethods())).first;
8618 Pos->second.first.setBits(Visitor.getInstanceBits());
8619 Pos->second.first.setHasMoreThanOneDecl(Visitor.instanceHasMoreThanOneDecl());
8626 addMethodsToPool(S, Visitor.getInstanceMethods(), Pos->second.first);
9749 BitstreamCursor &Cursor = I->first;
9805 if (Loc.first.isValid())
9806 Context.Comments.OrderedComments[Loc.first].emplace(Loc.second, C);
9865 IdentifierInfo *II = PendingIdentifierInfos.back().first;
9876 auto *FD = PendingFunctionTypes[I].first;
9897 loadPendingDeclChain(PendingDeclChains[I].first,
9904 IdentifierInfo *II = TLD->first;
9912 IdentifierInfo *II = PendingMacroIDs.begin()[I].first;
10010 if (FunctionDecl *FD = dyn_cast<FunctionDecl>(PB->first)) {
10050 ObjCMethodDecl *MD = cast<ObjCMethodDecl>(PB->first);
10075 Merge.first->buildLookup();
10076 Merge.first->decls_begin();
10077 Merge.first->bases_begin();
10078 Merge.first->vbases_begin();
10080 auto *RD = RecordPair.first;
10091 Merge.first->buildLookup();
10092 Merge.first->decls_begin();
10093 Merge.first->getBody();
10105 Merge.first->decls_begin();
10241 if (!DiagnosedOdrMergeFailures.insert(Merge.first).second)
10245 CXXRecordDecl *FirstRecord = Merge.first;
10248 CXXRecordDecl *SecondRecord = RecordPair.first;
10422 const NamedDecl* FirstDecl = cast<NamedDecl>(FirstIt->first);
10423 const NamedDecl* SecondDecl = cast<NamedDecl>(SecondIt->first);
10648 FirstDecl = FirstIt == FirstHashes.end() ? nullptr : FirstIt->first;
10649 SecondDecl = SecondIt == SecondHashes.end() ? nullptr : SecondIt->first;
10690 FirstLoc = FirstIt->first->getLocation();
10691 FirstRange = FirstIt->first->getSourceRange();
11781 Diag(Merge.first->getLocation(),
11783 << Merge.first;
11798 FunctionDecl *FirstFunction = Merge.first;
11957 if (!DiagnosedOdrMergeFailures.insert(Merge.first).second)
11960 EnumDecl *FirstEnum = Merge.first;
12077 const EnumConstantDecl *FirstEnumConstant = FirstHashes[I].first;
12078 const EnumConstantDecl *SecondEnumConstant = SecondHashes[I].first;
12171 getContext().adjustDeducedFunctionResultType(Update.first,
tools/clang/lib/Serialization/ASTReaderDecl.cpp 2303 new (&TypesAndInfos[I].first) QualType(Record.readType());
3904 if (Offsets.first &&
3905 ReadLexicalDeclContextStorage(*Loc.F, DeclsCursor, Offsets.first, DC))
3982 ModuleFile *F = FileAndOffset.first;
tools/clang/lib/Serialization/ASTWriter.cpp 1695 AddString(PPOpts.Macros[I].first, Record);
2434 if (L.first.ID < 0)
2447 if (L.first.ID < 0)
2451 Record.push_back(L.first.ID);
2987 Stream.EmitRecordWithBlob(RequiresAbbrev, Record, R.first);
3139 Record.push_back(I.first);
3157 if (!FileIDAndFile.first.isValid() ||
3162 SourceLocation Loc = Diag.SourceMgr->getComposedLoc(FileIDAndFile.first, 0);
3460 Selector S = SelectorAndID.first;
3469 Data.Instance = F->second.first;
3557 Selector Sel = SelectorAndLocation.first;
3800 auto *II = const_cast<IdentifierInfo *>(IdentIDPair.first);
3947 unsigned DataLen = 4 * (Lookup.second - Lookup.first);
3992 for (unsigned I = Lookup.first, N = Lookup.second; I != N; ++I)
4041 auto &Name = Lookup.first;
4069 switch (Lookup.first.getNameKind()) {
4071 Names.push_back(Lookup.first);
4223 std::make_pair(Entry.first, Entry.second.getLookupResult()));
4228 DeclarationName Name = NameAndResult.first;
4345 getTypeID(I.first->getCanonicalTypeInternal()), &I.second);
4348 return E1.first < E2.first;
4348 return E1.first < E2.first;
4354 Record.push_back(E.first); // TypeID
4377 StableOpenCLDeclExtMap.emplace_back(getDeclID(I.first), &I.second);
4380 return E1.first < E2.first;
4380 return E1.first < E2.first;
4386 Record.push_back(E.first); // DeclID
4463 const FunctionDecl *FD = LPTMapEntry.first;
4808 IdentifierInfo *II = WeakUndeclaredIdentifier.first;
4824 AddDeclRef(SemaRef.VTableUses[I].first, VTableUses);
4826 VTableUses.push_back(SemaRef.VTablesUsed[SemaRef.VTableUses[I].first]);
4838 AddDeclRef(I.first, PendingInstantiations);
4861 AddDeclRef(I.first, KnownNamespaces);
4870 AddDeclRef(I.first, UndefinedButUsed);
4881 AddDeclRef(DeleteExprsInfo.first, DeleteExprsToAnalyze);
4884 AddSourceLocation(DeleteLoc.first, DeleteExprsToAnalyze);
4949 if (!Number.first->isFromASTFile())
4950 DeclUpdates[Number.first].push_back(DeclUpdate(UPD_MANGLING_NUMBER,
4953 if (!Number.first->isFromASTFile())
4954 DeclUpdates[Number.first].push_back(DeclUpdate(UPD_STATIC_LOCAL_NUMBER,
4993 AllSelectors.push_back(SelectorAndID.first);
5260 const Decl *D = DeclUpdate.first;
5754 if (Decls.empty() || Decls.back().first <= Offset) {
tools/clang/lib/Serialization/GlobalModuleIndex.cpp 229 ModuleName = ModuleName.rsplit('-').first;
698 InterestingIdentifiers[Ident.first].push_back(ID);
700 (void)InterestingIdentifiers[Ident.first];
760 auto *File = MapEntry.first;
798 Record.push_back(M->first->getSize());
799 Record.push_back(M->first->getModificationTime());
802 StringRef Name(M->first->getName());
tools/clang/lib/Serialization/InMemoryModuleCache.cpp 29 return *Insertion.first->second.Buffer;
tools/clang/lib/Serialization/Module.cpp 43 llvm::errs() << " " << I->first << " -> " << I->second << "\n";
tools/clang/lib/Serialization/MultiOnDiskHashTable.h 161 const internal_key_type &Key = InfoObj.ReadKey(LocalPtr, L.first);
163 InfoObj.ReadDataInto(Key, LocalPtr + L.first, L.second,
221 Table NewTable = new OnDiskTable(File, NumBucketsAndEntries.first,
281 const internal_key_type &Key = InfoObj.ReadKey(LocalPtr, L.first);
282 InfoObj.ReadDataInto(Key, LocalPtr + L.first, L.second, ResultBuilder);
327 if (!Gen.contains(KV.first, Info))
328 Gen.insert(KV.first, Info.ImportData(KV.second), Info);
tools/clang/lib/StaticAnalyzer/Checkers/AnalyzerStatsChecker.cpp 122 const BlockEdge &BE = I->first;
tools/clang/lib/StaticAnalyzer/Checkers/ArrayBoundCheckerV2.cpp 151 rawOffsetVal = simplifiedOffsets.first;
190 rawOffsetVal = simplifiedOffsets.first;
tools/clang/lib/StaticAnalyzer/Checkers/BasicObjCFoundationChecks.cpp 1127 SymbolRef Sym = I->first;
tools/clang/lib/StaticAnalyzer/Checkers/CastValueChecker.cpp 391 const CastCheck &Check = Lookup->first;
tools/clang/lib/StaticAnalyzer/Checkers/CheckSecuritySyntaxOnly.cpp 587 assert(ArgSuffix.first >= 0 && "Unsupported function");
591 if ((signed) numArgs <= ArgSuffix.first)
595 dyn_cast<StringLiteral>(CE->getArg((unsigned)ArgSuffix.first)
tools/clang/lib/StaticAnalyzer/Checkers/DynamicTypePropagation.cpp 123 if (SR.isDead(I->first)) {
124 State = State->remove<MostSpecializedTypeArgsMap>(I->first);
tools/clang/lib/StaticAnalyzer/Checkers/ExprInspectionChecker.cpp 278 SymbolRef Sym = I.first;
tools/clang/lib/StaticAnalyzer/Checkers/GenericTaintChecker.cpp 290 IO.mapRequired("Name", NameArg.first);
330 GenericTaintChecker::CustomFilters.try_emplace(F.first,
335 GenericTaintChecker::CustomSinks.try_emplace(S.first, std::move(S.second));
tools/clang/lib/StaticAnalyzer/Checkers/InnerPointerChecker.cpp 240 if (!SymReaper.isLiveRegion(Entry.first)) {
243 State = State->remove<RawPtrMap>(Entry.first);
245 if (const PtrSet *OldSet = State->get<RawPtrMap>(Entry.first)) {
252 ? State->remove<RawPtrMap>(Entry.first)
253 : State->set<RawPtrMap>(Entry.first, CleanedUpSet);
271 return Entry.first;
tools/clang/lib/StaticAnalyzer/Checkers/IteratorChecker.cpp 820 if (!SR.isLiveRegion(Reg.first)) {
824 if (!isBoundThroughLazyCompoundVal(State->getEnvironment(), Reg.first)) {
825 State = State->remove<IteratorRegionMap>(Reg.first);
832 if (!SR.isLive(Sym.first)) {
833 State = State->remove<IteratorSymbolMap>(Sym.first);
839 if (!SR.isLiveRegion(Cont.first)) {
842 if (!hasLiveIterators(State, Cont.first)) {
843 State = State->remove<ContainerMap>(Cont.first);
2145 RegionMap = RegionMapFactory.add(RegionMap, Reg.first, Proc(Reg.second));
2158 SymbolMap = SymbolMapFactory.add(SymbolMap, Sym.first, Proc(Sym.second));
tools/clang/lib/StaticAnalyzer/Checkers/IvarInvalidationChecker.cpp 323 const ObjCIvarDecl *Iv = I->first;
507 reportIvarNeedsInvalidation(I->first, IvarToPopertyMap, D);
518 reportIvarNeedsInvalidation(I->first, IvarToPopertyMap, nullptr);
tools/clang/lib/StaticAnalyzer/Checkers/LocalizationChecker.cpp 1131 SrcMgr::SLocEntry SE = Mgr.getSourceManager().getSLocEntry(SLInfo.first);
1138 SE = Mgr.getSourceManager().getSLocEntry(SLInfo.first);
1143 Mgr.getSourceManager().getBuffer(SLInfo.first, SL, &Invalid);
tools/clang/lib/StaticAnalyzer/Checkers/MIGChecker.cpp 200 return Call.isCalled(Item.first);
tools/clang/lib/StaticAnalyzer/Checkers/MPI-Checker/MPIChecker.cpp 112 if (!SymReaper.isLiveRegion(Req.first)) {
119 BReporter.reportMissingWait(Req.second, Req.first, ErrorNode,
122 State = State->remove<RequestMap>(Req.first);
tools/clang/lib/StaticAnalyzer/Checkers/MacOSKeychainAPIChecker.cpp 124 R->markInteresting(AP.first);
229 State = State->remove<AllocatedData>(AP.first);
243 Report->addVisitor(std::make_unique<SecKeychainBugVisitor>(AP.first));
486 const ExplodedNode *AllocNode = getAllocationNode(N, AP.first, C);
498 Report->addVisitor(std::make_unique<SecKeychainBugVisitor>(AP.first));
535 State = State->remove<AllocatedData>(I->first);
551 if (!SR.isDead(I->first))
555 State = State->remove<AllocatedData>(I->first);
561 Errors.push_back(std::make_pair(I->first, &I->second));
591 SymbolRef Sym = I.first;
tools/clang/lib/StaticAnalyzer/Checkers/MallocChecker.cpp 2627 if (SymReaper.isDead(I->first)) {
2629 Errors.push_back(I->first);
2631 RS = F.remove(RS, I->first);
2647 if (SymReaper.isDead(I->first) ||
2649 state = state->remove<ReallocPairs>(I->first);
2656 if (SymReaper.isDead(I->first) ||
2658 state = state->remove<FreeReturnValue>(I->first);
3149 SymbolRef sym = Pair.first;
tools/clang/lib/StaticAnalyzer/Checkers/MallocSizeofChecker.cpp 62 Calls.push_back(CallRecord(Parent, cast<Expr>(S), AllocCall.first,
tools/clang/lib/StaticAnalyzer/Checkers/MoveChecker.cpp 248 if (E.first->isSubRegionOf(Region))
249 State = State->remove<TrackedRegionMap>(E.first);
257 if (Region->isSubRegionOf(E.first) && E.second.isReported())
689 const MemRegion *Region = E.first;
744 I.first->dumpToStream(Out);
tools/clang/lib/StaticAnalyzer/Checkers/NullabilityChecker.cpp 456 const auto *Region = I->first->getAs<SymbolicRegion>();
459 State = State->remove<NullabilityMap>(I->first);
1186 Out << I->first << " : ";
tools/clang/lib/StaticAnalyzer/Checkers/ObjCContainersChecker.cpp 182 OS << I.first << " : " << I.second << NL;
tools/clang/lib/StaticAnalyzer/Checkers/ObjCSelfInitChecker.cpp 365 Out << I->first << " : ";
tools/clang/lib/StaticAnalyzer/Checkers/ObjCUnusedIVarsChecker.cpp 159 os << "Instance variable '" << *I->first << "' in class '" << *ID
164 PathDiagnosticLocation::create(I->first, BR.getSourceManager());
tools/clang/lib/StaticAnalyzer/Checkers/PthreadLockChecker.cpp 189 I.first->dumpToStream(Out);
473 const MemRegion *lockR = I->first;
tools/clang/lib/StaticAnalyzer/Checkers/RetainCountChecker/RetainCountChecker.cpp 1170 ConditionTruthVal AllocFailed = CMgr.isNull(state, I.first);
1173 B = RefBFactory.remove(B, I.first);
1388 I.first, I.second);
1404 state = handleSymbolDeath(state, I.first, I.second, Leaked);
1418 SymbolRef Sym = I.first;
1466 Out << I.first << " : ";
tools/clang/lib/StaticAnalyzer/Checkers/SimpleStreamChecker.cpp 181 SymbolRef Sym = I->first;
tools/clang/lib/StaticAnalyzer/Checkers/StackAddrEscapeChecker.cpp 347 if (isa<StaticGlobalSpaceRegion>(P.first->getMemorySpace()))
352 const VarRegion *VR = cast<VarRegion>(P.first->getBaseRegion());
tools/clang/lib/StaticAnalyzer/Checkers/StdLibraryFunctionsChecker.cpp 115 static_cast<BinaryOperator::Opcode>(Args[0].first);
253 const llvm::APSInt &Min = BVF.getValue(R[I].first, T);
287 const llvm::APSInt &Left = BVF.getValue(R[0].first - 1ULL, T);
305 const llvm::APSInt &Max = BVF.getValue(R[I].first - 1ULL, T);
tools/clang/lib/StaticAnalyzer/Checkers/StreamChecker.cpp 395 SymbolRef Sym = I.first;
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))
151 State = State->remove<MapName>(P.first);
tools/clang/lib/StaticAnalyzer/Checkers/UninitializedObject/UninitializedObjectChecker.cpp 165 ProgramStateRef UpdatedState = UninitInfo.first;
210 PathDiagnosticLocation::create(Pair.first->getDecl(),
tools/clang/lib/StaticAnalyzer/Core/AnalyzerOptions.cpp 42 FOut.PadToColumn(InitialPad) << EntryDescPair.first;
tools/clang/lib/StaticAnalyzer/Core/BasicValueFactory.cpp 58 X.first.Profile(ID);
65 X.first.Profile(ID);
350 return &getPersistentSValWithData(X, 0).first;
tools/clang/lib/StaticAnalyzer/Core/BugReporter.cpp 722 PathDiagnosticCallPiece *CP = I.first;
1180 assert(C.CallStack.back().first == Call);
2192 Result.first->getSecond() = bugreporter::TrackingKind::Thorough;
2637 MacroStack.back().first->subPieces.push_back(piece);
2652 MacroGroup = MacroStack.back().first;
2657 MacroGroup = MacroStack.back().first;
2999 PathDiagnosticConsumer *Consumer = P.first;
tools/clang/lib/StaticAnalyzer/Core/BugReporterVisitors.cpp 257 SrcMgr::SLocEntry SE = SM.getSLocEntry(TLInfo.first);
2170 if (PreviousNodeTag == Tags.first || PreviousNodeTag == Tags.second)
2180 if (CurrentNodeTag != Tags.first && CurrentNodeTag != Tags.second)
2183 bool TookTrue = CurrentNodeTag == Tags.first;
2831 const SymbolRef Sym = I.first;
2865 const SymbolRef &Sym = C.first;
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 125 if (!SR.isLiveRegion(Elem.first))
126 State = State->remove<DynamicCastMap>(Elem.first);
153 const MemRegion *MR = I->first;
189 const MemRegion *MR = I->first;
tools/clang/lib/StaticAnalyzer/Core/Environment.cpp 219 const LocationContext *LC = I.first.getLocationContext();
244 if (I->first.getLocationContext() != LC)
252 const Stmt *S = I->first.getStmt();
261 if (I->first.getLocationContext() != LC)
264 const Stmt *S = I->first.getStmt();
tools/clang/lib/StaticAnalyzer/Core/ExprEngine.cpp 138 const ConstructionContextItem &getItem() const { return Impl.first; }
177 ID.Add(Impl.first);
522 if (I.first.getLocationContext() == LC)
567 const ConstructedObjectKey &Key = I.first;
580 const ConstructedObjectKey &Key = I.first;
2286 if (I.first.getLocationContext() == LC) {
2290 assert(I.first.getItem().getKind() ==
2292 I.first.getItem().getKind() ==
2294 State = State->remove<ObjectsUnderConstruction>(I.first);
2459 SVal V = VInfo->first;
2951 Bldr.generateNode(Ex, Pred, StateTrue, tags.first);
tools/clang/lib/StaticAnalyzer/Core/HTMLDiagnostics.cpp 357 os << "\"" << I->first.getHashValue() << "\": {";
750 if (LPosInfo.first != BugFileID)
753 const llvm::MemoryBuffer *Buf = SM.getBuffer(LPosInfo.first);
758 unsigned ColNo = SM.getColumnNumber(LPosInfo.first, LPosInfo.second);
889 Lexer rawLexer(SM.getLocForStartOfFile(LocInfo.first), PP.getLangOpts(),
944 SM.getLocForStartOfFile(LPosInfo.first).getLocWithOffset(DisplayPos);
956 HighlightRange(R, LPosInfo.first, Range);
tools/clang/lib/StaticAnalyzer/Core/PlistDiagnostics.cpp 506 unsigned FileKey = AddFID(FM, Fids, I->first);
767 StringRef newName = CI->first;
931 MacroLoc = LocAndUnit->first;
1060 const llvm::MemoryBuffer *MB = SM.getBuffer(LocInfo.first);
1063 Lexer RawLexer(SM.getLocForStartOfFile(LocInfo.first), LangOpts,
tools/clang/lib/StaticAnalyzer/Core/ProgramState.cpp 91 I->second.second(I->second.first);
498 if (!p.first) {
499 p.first = CreateContext(Alloc);
503 return p.first;
tools/clang/lib/StaticAnalyzer/Core/RegionStore.cpp 976 Result = Result.remove(I->first);
tools/clang/lib/StaticAnalyzer/Core/Store.cpp 55 Store = Bind(Store.getStore(), I.first.castAs<Loc>(), I.second);
tools/clang/lib/StaticAnalyzer/Core/WorkList.cpp 246 return U.first;
304 return U.first;
tools/clang/lib/StaticAnalyzer/Frontend/CheckerRegistration.cpp 122 return LHS.first < RHS.first;
122 return LHS.first < RHS.first;
tools/clang/lib/StaticAnalyzer/Frontend/CheckerRegistry.cpp 205 getMutableCheckersForCmdLineArg(Opt.first);
208 Diags.Report(diag::err_unknown_analyzer_checker_or_package) << Opt.first;
290 auto CheckerIt = binaryFind(Checkers, Entry.first);
291 assert(CheckerIt != Checkers.end() && CheckerIt->FullName == Entry.first &&
331 StringRef SuppliedValue = It.first->getValue();
340 It.first->setValue(Option.DefaultValStr);
354 It.first->setValue(Option.DefaultValStr);
378 insertOptionToCollection(CheckerOptEntry.first, Checkers,
385 insertOptionToCollection(PackageOptEntry.first, Packages,
596 std::string FullOption = (Entry.first + ":" + Option.OptionName).str();
614 Entry.first.startswith("alpha")) {
tools/clang/lib/Tooling/ASTDiff/ASTDiff.cpp 791 NodeId Src = Tuple.first;
tools/clang/lib/Tooling/AllTUsExecution.cpp 135 if (Tool.run(Action.first.get()))
tools/clang/lib/Tooling/Core/Lookup.cpp 152 StringRef Head = CurSpelling.split("::").first;
tools/clang/lib/Tooling/Core/Replacement.cpp 125 const FileEntry *Entry = Sources.getFileEntryForID(DecomposedLocation.first);
141 if (Start.first != End.first) return -1;
141 if (Start.first != End.first) return -1;
617 auto FE = FileMgr.getFile(Entry.first);
619 llvm::errs() << "File path " << Entry.first << " is invalid.\n";
621 Result[Entry.first] = std::move(Entry.second);
tools/clang/lib/Tooling/DependencyScanning/DependencyScanningFilesystem.cpp 122 return It.first->getValue();
tools/clang/lib/Tooling/Execution.cpp 34 Callback(KV.first, KV.second);
tools/clang/lib/Tooling/Inclusions/HeaderIncludes.cpp 290 ExistingIncludes.try_emplace(trimInclude(IncludeToAdd.Name)).first;
tools/clang/lib/Tooling/InterpolatingCompilationDatabase.cpp 81 StringRef V = Prefix ? Value.first.substr(0, Key.size()) : Value.first;
81 StringRef V = Prefix ? Value.first.substr(0, Key.size()) : Value.first;
85 StringRef V = Prefix ? Value.first.substr(0, Key.size()) : Value.first;
85 StringRef V = Prefix ? Value.first.substr(0, Key.size()) : Value.first;
357 llvm::dbgs() << "interpolate: chose " << OriginalPaths[Best.first]
363 return OriginalPaths[Best.first];
427 S.Index = Candidate.first;
437 S.PrefixLength = matchingPrefix(Filename, Paths[S.Index].first);
448 S.PrefixLength = matchingPrefix(Filename, Paths[S.Index].first);
466 return {Range.first, Range.second};
480 size_t Prefix = matchingPrefix(Key, It->first);
481 size_t PrevPrefix = matchingPrefix(Key, (It - 1)->first);
tools/clang/lib/Tooling/Refactoring.cpp 78 const std::string &FilePath = FileAndReplaces.first;
tools/clang/lib/Tooling/Refactoring/AtomicChange.cpp 201 const FileEntry *FE = SM.getFileEntryForID(FileIDAndOffset.first);
tools/clang/lib/Tooling/Refactoring/Rename/USRLocFinder.cpp 49 return SM.getFileEntryForID(FileIdAndOffset.first) != nullptr;
tools/clang/lib/Tooling/StandaloneExecution.cpp 66 if (Tool.run(Action.first.get()))
tools/clang/lib/Tooling/Syntax/BuildTree.cpp 116 assert(It->first == Range.begin() && "no child with the specified range");
118 std::next(It)->first == Range.end()) &&
133 BeginChildren->first == FirstToken &&
137 EndChildren->first == NodeTokens.end()) &&
162 ? (std::next(It)->first - It->first)
162 ? (std::next(It)->first - It->first)
163 : A.tokenBuffer().expandedTokens().end() - It->first;
167 It->first->text(A.sourceManager()), CoveredTokens);
tools/clang/lib/Tooling/Syntax/Tokens.cpp 443 TokenBuffer::MarkedFile &File = It.first->second;
601 Keys.push_back(F.first);
tools/clang/lib/Tooling/Syntax/Tree.cpp 30 return {FID, It.first->second};
tools/clang/lib/Tooling/Tooling.cpp 217 FilenameWithContent.first, 0,
457 if (llvm::sys::path::is_absolute(MappedFile.first))
459 MappedFile.first, 0,
523 if (!llvm::sys::path::is_absolute(MappedFile.first))
525 MappedFile.first, 0,
tools/clang/lib/Tooling/Transformer/RewriteRule.cpp 93 std::string Tag = (TagBase + Twine(Case.first)).str();
131 DynTypedMatcher::VO_AnyOf, Bucket.first,
tools/clang/lib/Tooling/Transformer/SourceCode.cpp 60 if (BeginInfo.first != EndInfo.first ||
60 if (BeginInfo.first != EndInfo.first ||
tools/clang/lib/Tooling/Transformer/Transformer.cpp 60 auto &Header = I.first;
tools/clang/tools/clang-diff/ClangDiff.cpp 350 OS << R"(,"begin":)" << Offsets.first;
tools/clang/tools/clang-format/ClangFormat.cpp 179 return LineRange.first.getAsInteger(0, FromLine) ||
tools/clang/tools/clang-offload-bundler/ClangOffloadBundler.cpp 111 OffloadKind = KindTriplePair.first;
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
326 getDiags().Report(Diag->first, Diag->second.getDiagID()));
tools/clang/tools/clang-refactor/TestSupport.cpp 222 << LineColumn.first << ':' << LineColumn.second << " in group '"
376 It.first->second.push_back(Range);
386 TestRanges.GroupedRanges.push_back({Group.first, std::move(Group.second)});
tools/clang/tools/clang-scan-deps/ClangScanDeps.cpp 237 Input = Compilation.first;
tools/clang/tools/driver/cc1as_main.cpp 414 Ctx.addDebugPrefixMapEntry(KV.first, KV.second);
512 auto Sym = Pair.first;
tools/clang/tools/driver/driver.cpp 72 return SavedStrings.insert(S).first->c_str();
120 StringRef MatchPattern = Edit.substr(2).split('/').first;
477 int CommandRes = P.first;
tools/clang/tools/extra/clang-apply-replacements/lib/Tooling/ApplyReplacements.cpp 198 const FileEntry *Entry = FileAndReplacements.first;
tools/clang/tools/extra/clang-apply-replacements/tool/ClangApplyReplacementsMain.cpp 144 const FileEntry *Entry = FileChange.first;
tools/clang/tools/extra/clang-change-namespace/ChangeNamespace.cpp 106 llvm::StringRef File = SM.getBufferData(LocInfo.first, &InvalidTemp);
112 return std::make_unique<Lexer>(SM.getLocForStartOfFile(LocInfo.first),
129 return SM.getLocForEndOfFile(SM.getDecomposedLoc(Loc).first) == End
165 if (SM.getDecomposedLoc(Start).first != SM.getDecomposedLoc(End).first) {
165 if (SM.getDecomposedLoc(Start).first != SM.getDecomposedLoc(End).first) {
971 const std::string &FilePath = FileAndNsMoves.first;
1037 if (!FilePatternRE.match(Entry.first))
tools/clang/tools/extra/clang-change-namespace/tool/ClangChangeNamespace.cpp 142 ChangedFiles.insert(it.first);
tools/clang/tools/extra/clang-doc/BitcodeWriter.cpp 125 BlockIdNameMap[Init.first] = Init.second;
191 RecordIdNameMap[Init.first] = Init.second;
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 48 if (I.first)
49 CDCtx.ECtx->reportResult(llvm::toHex(llvm::toStringRef(I.first->USR)),
50 serialize::serialize(I.first));
tools/clang/tools/extra/clang-doc/tool/ClangDocMain.cpp 262 R.first->second.emplace_back(Value);
tools/clang/tools/extra/clang-include-fixer/FuzzySymbolIndex.cpp 34 if (Pattern.match(E.first))
tools/clang/tools/extra/clang-include-fixer/SymbolIndexManager.cpp 114 } else if (SymbolContext->first ==
tools/clang/tools/extra/clang-include-fixer/find-all-symbols/HeaderMapCollector.cpp 20 this->RegexHeaderMappingTable.emplace_back(llvm::Regex(Entry.first),
35 assert(Entry.first.isValid(Dummy) && "Regex should never be invalid!");
37 if (Entry.first.match(Header))
tools/clang/tools/extra/clang-include-fixer/find-all-symbols/SymbolInfo.cpp 62 io.mapRequired("ContextType", Context.first);
91 if (Context.first == ContextType::EnumDecl)
122 SymbolAndSignals S{Symbol.first, Symbol.second};
tools/clang/tools/extra/clang-include-fixer/tool/ClangIncludeFixer.cpp 181 {SymbolInfo(Split.first.trim(), SymbolInfo::SymbolKind::Unknown,
tools/clang/tools/extra/clang-move/Move.cpp 288 llvm::StringRef File = SM.getBufferData(LocInfo.first, &InvalidTemp);
294 Lexer Lex(SM.getLocForStartOfFile(LocInfo.first), LangOpts, File.begin(),
305 return SM.getLocForEndOfFile(LocInfo.first) == EndLoc
762 StringRef FilePath = FileAndReplacements.first;
tools/clang/tools/extra/clang-move/tool/ClangMove.cpp 188 Files.insert(it.first);
tools/clang/tools/extra/clang-query/Query.cpp 120 DiagnosticsEngine::Note, "\"" + BI->first + "\" binds here",
125 OS << "Binding for \"" << BI->first << "\":\n";
130 OS << "Binding for \"" << BI->first << "\":\n";
tools/clang/tools/extra/clang-tidy/ClangTidy.cpp 178 Diags.Report(Fix.first, Fix.second ? diag::note_fixit_applied
330 StringRef OptName(Opt.first);
447 if (Context.isCheckEnabled(CheckFactory.first))
448 CheckNames.push_back(CheckFactory.first);
454 CheckNames.push_back(AnalyzerCheckNamePrefix + AnalyzerCheck.first);
tools/clang/tools/extra/clang-tidy/ClangTidyDiagnosticConsumer.cpp 456 if (Range.first <= LineNumber && LineNumber <= Range.second)
470 DiagLevelAndFormatString.first, DiagLevelAndFormatString.second);
543 FileID FID = Sources.getDecomposedExpansionLoc(Location).first;
693 ErrorFixes[I].first->Notes.emplace_back(
tools/clang/tools/extra/clang-tidy/ClangTidyModule.cpp 27 if (Context->isCheckEnabled(Factory.first))
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)
63 IO.mapRequired("key", KeyValue.first);
75 Map[KeyValue.first] = KeyValue.second;
155 Result.CheckOptions[KeyValue.first] = KeyValue.second;
172 Result = Result.mergeWith(Source.first);
284 llvm::sys::path::append(ConfigFile, ConfigHandler.first);
tools/clang/tools/extra/clang-tidy/abseil/DurationConversionCastCheck.cpp 70 llvm::StringRef NewFuncName = getDurationInverseForScale(*Scale).first;
tools/clang/tools/extra/clang-tidy/abseil/DurationRewriter.cpp 78 InverseFunctions.first, InverseFunctions.second))),
tools/clang/tools/extra/clang-tidy/bugprone/ArgumentCommentCheck.cpp 70 if (BeginLoc.first != EndLoc.first)
70 if (BeginLoc.first != EndLoc.first)
74 StringRef Buffer = SM.getBufferData(BeginLoc.first, &Invalid);
80 Lexer TheLexer(SM.getLocForStartOfFile(BeginLoc.first), Ctx->getLangOpts(),
94 assert(CommentLoc.first == BeginLoc.first);
94 assert(CommentLoc.first == BeginLoc.first);
299 diag(Comment.first, "argument name '%0' in comment does not "
304 Comment.first, (Matches[1] + II->getName() + Matches[3]).str());
tools/clang/tools/extra/clang-tidy/bugprone/NotNullTerminatedResultCheck.cpp 301 if (It->first->getName() == LengthExprStr)
801 if (It->first->getName() == "__STDC_WANT_LIB_EXT1__") {
802 const auto *MI = PP->getMacroInfo(It->first);
tools/clang/tools/extra/clang-tidy/bugprone/SuspiciousEnumUsageCheck.cpp 47 MinVal = MinMaxVal.first->getInitVal();
tools/clang/tools/extra/clang-tidy/cppcoreguidelines/SpecialMemberFunctionsCheck.cpp 128 if (Result.Nodes.getNodeAs<CXXMethodDecl>(KV.first)) {
135 checkForMissingMembers(C.first, C.second);
183 diag(ID.first, "class '%0' defines %1 but does not define %2")
tools/clang/tools/extra/clang-tidy/cppcoreguidelines/SpecialMemberFunctionsCheck.h 90 return Val.first.getRawEncoding() + SecondHash(Val.second);
tools/clang/tools/extra/clang-tidy/google/AvoidNSObjectNewCheck.cpp 80 StringRef ClassName = FoundClassFactory->first;
tools/clang/tools/extra/clang-tidy/google/UpgradeGoogletestCaseCheck.cpp 34 if (MacroName == Mapping.first)
220 if (CurrentName == Mapping.first)
tools/clang/tools/extra/clang-tidy/misc/UnusedAliasDeclsCheck.cpp 56 diag(FoundDecl.first->getLocation(), "namespace alias decl %0 is unused")
57 << FoundDecl.first << FixItHint::CreateRemoval(FoundDecl.second);
tools/clang/tools/extra/clang-tidy/modernize/UseNullptrCheck.cpp 317 const SrcMgr::SLocEntry *E = &SM.getSLocEntry(LocInfo.first);
370 const SrcMgr::SLocEntry *E = &SM.getSLocEntry(LocInfo.first);
tools/clang/tools/extra/clang-tidy/modernize/UseOverrideCheck.cpp 52 StringRef File = Sources.getBufferData(LocInfo.first);
54 Lexer RawLexer(Sources.getLocForStartOfFile(LocInfo.first),
tools/clang/tools/extra/clang-tidy/modernize/UseTrailingReturnTypeCheck.cpp 133 StringRef File = SM.getBufferData(Loc.first);
135 Lexer Lexer(SM.getLocForStartOfFile(Loc.first), LangOpts, File.begin(),
213 StringRef File = SM.getBufferData(Loc.first);
215 Lexer Lexer(SM.getLocForStartOfFile(Loc.first), LangOpts, File.begin(),
tools/clang/tools/extra/clang-tidy/modernize/UseUsingCheck.cpp 36 StringRef File = SM.getBufferData(LocInfo.first);
38 Lexer DeclLexer(SM.getLocForStartOfFile(LocInfo.first), Context.getLangOpts(),
tools/clang/tools/extra/clang-tidy/mpi/TypeMismatchCheck.cpp 34 while (ItPair.first != ItPair.second) {
35 if (ItPair.first->second == MPIDatatype)
37 ++ItPair.first;
tools/clang/tools/extra/clang-tidy/performance/UnnecessaryValueParamCheck.cpp 101 .first->second;
tools/clang/tools/extra/clang-tidy/readability/AvoidConstParamsInDecls.cpp 55 StringRef File = Sources.getBufferData(LocInfo.first);
57 Lexer RawLexer(Sources.getLocForStartOfFile(LocInfo.first),
tools/clang/tools/extra/clang-tidy/readability/IdentifierNamingCheck.cpp 50 return Val.first.getRawEncoding() + SecondHash(Val.second);
932 const NamingCheckId &Decl = Pair.first;
939 auto Diag = diag(Decl.first, "invalid case style for %0 '%1'")
tools/clang/tools/extra/clang-tidy/readability/MagicNumbersCheck.cpp 159 if (FileOffset.first.isInvalid())
163 SourceManager->getBuffer(FileOffset.first)->getBufferIdentifier();
tools/clang/tools/extra/clang-tidy/readability/NamedParameterCheck.cpp 87 UnnamedParams.front().first->getParamDecl(UnnamedParams.front().second);
97 const auto *M = dyn_cast<CXXMethodDecl>(P.first);
117 const ParmVarDecl *Parm = P.first->getParamDecl(P.second);
tools/clang/tools/extra/clang-tidy/readability/NonConstParameterCheck.cpp 129 const ParmVarDecl *Par = It.first;
tools/clang/tools/extra/clang-tidy/readability/SimplifyBooleanExprCheck.cpp 93 if (Opcode == NegatableOp.first)
96 return BinOp->getOpcodeStr(NegatableOp.first);
107 if (Name.first == OpKind)
122 if (Opcode == NegatableOp.first)
125 return getOperatorName(NegatableOp.first);
tools/clang/tools/extra/clang-tidy/tool/ClangTidyMain.cpp 380 if (It->first.Checks && GlobList(*It->first.Checks).contains(Check)) {
380 if (It->first.Checks && GlobList(*It->first.Checks).contains(Check)) {
tools/clang/tools/extra/clang-tidy/utils/ExprSequence.cpp 69 SyntheticStmtSourceMap[SyntheticStmt.first] = SyntheticStmt.second;
tools/clang/tools/extra/clang-tidy/utils/HeaderGuard.cpp 93 Ifndefs[MacroEntry.first.getIdentifierInfo()].second;
94 SourceLocation Define = MacroEntry.first.getLocation();
96 EndIfs[Ifndefs[MacroEntry.first.getIdentifierInfo()].first];
96 EndIfs[Ifndefs[MacroEntry.first.getIdentifierInfo()].first];
101 MacroEntry.first.getIdentifierInfo()->getName();
232 StringRef Name = MacroEntry.first.getIdentifierInfo()->getName();
233 SourceLocation DefineLoc = MacroEntry.first.getLocation();
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();
226 Edits[LineNumber].first =
246 if (LineEdit.first == CurrentEndLine + 1 &&
248 SourceRange EditRange = LineEdit.second.first;
261 CurrentEndLine = LineEdit.first;
262 CurrentRange = LineEdit.second.first;
tools/clang/tools/extra/clang-tidy/utils/LexerUtils.cpp 99 StringRef File = SM.getBufferData(LocInfo.first);
100 Lexer RawLexer(SM.getLocForStartOfFile(LocInfo.first), Context.getLangOpts(),
tools/clang/tools/extra/clang-tidy/utils/TransformerClangTidyCheck.cpp 102 auto &Header = I.first;
tools/clang/tools/extra/clangd/ClangdLSPServer.cpp 209 if (ReplyCallbacks[Index].first == *IntID) {
272 MaxReplayCallbacks, ReplyCallbacks.front().first);
281 OldestCB->first)));
394 It->second.first(); // Invoke the canceler.
418 return Task.first.derive(llvm::make_scope_exit([this, StrID, Cookie] {
1116 PathRef File = Entry.first;
tools/clang/tools/extra/clangd/CodeComplete.cpp 237 return L.first.front().Name <
238 R.first.front().Name; // Earlier name is better.
271 splitQualifiedName(printQualifiedName(*ND)).first;
342 Include.Header = ToInclude->first;
344 Include.Insertion = Includes.insert(ToInclude->first);
1464 Output.Completions.push_back(toCodeCompletion(C.first));
1544 Bundles[Ret.first->second].push_back(std::move(C));
tools/clang/tools/extra/clangd/Diagnostics.cpp 465 llvm::StringRef R = Code.split('\n').first;
tools/clang/tools/extra/clangd/FileDistance.cpp 86 if (Cost < R.first->second) {
87 R.first->second = Cost;
109 Cache.try_emplace(Child, Unreachable).first->getSecond();
152 return R.first->getSecond();
155 R.first->second = forScheme(U->scheme()).distance(U->body());
159 return R.first->second;
209 Sources[Path.first] = std::move(Param);
218 return Distance.distance(scopeToPath(SymbolScope).first);
tools/clang/tools/extra/clangd/FindSymbols.cpp 34 if (L.first != R.first)
34 if (L.first != R.first)
35 return L.first > R.first;
35 return L.first > R.first;
79 bool IsGlobalQuery = Names.first.consume_front("::");
82 if (IsGlobalQuery || !Names.first.empty())
83 Req.Scopes = {Names.first};
tools/clang/tools/extra/clangd/FindTarget.cpp 370 Result.push_back(Entry.first);
402 TemplatePatterns.push_back(llvm::cast<NamedDecl>(D.first));
407 Targets.push_back(llvm::cast<NamedDecl>(D.first));
tools/clang/tools/extra/clangd/Format.cpp 343 dlog("After {0}:\n{1}^{2}", Pass.first,
tools/clang/tools/extra/clangd/Function.h 87 L.first(V);
tools/clang/tools/extra/clangd/GlobalCompilationDatabase.cpp 149 CachedCDB &Entry = R.first->second;
154 return R.first->second;
228 It.first->second = Entry.CDB != nullptr;
tools/clang/tools/extra/clangd/Headers.cpp 132 return R.first->getValue();
tools/clang/tools/extra/clangd/IncludeFixer.cpp 172 auto I = InsertedHeaders.try_emplace(ToInclude->first);
175 if (auto Edit = Inserter->insert(ToInclude->first))
178 ToInclude->first, Sym.Scope, Sym.Name),
236 SM.getDecomposedLoc(Unresolved.getBeginLoc()).first, &Invalid);
297 Result.UnresolvedScope->append((Result.Name + Split.first).str());
423 return &E.first->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 357 Score *= 1 + 2 * std::max(uriProximity(SymbolURI, FileProximityMatch).first,
447 Score.first, Score.second);
tools/clang/tools/extra/clangd/QueryDriverDatabase.cpp 251 extractSystemIncludes(Key.first, Key.second, QueryDriverRegex);
tools/clang/tools/extra/clangd/Selection.cpp 323 if (B.first != SelFile || E.first != SelFile)
323 if (B.first != SelFile || E.first != SelFile)
400 if (B.first != SelFile || E.first != SelFile)
400 if (B.first != SelFile || E.first != SelFile)
407 SourceRange(SM.getComposedLoc(B.first, B.second),
408 SM.getComposedLoc(E.first, E.second))
tools/clang/tools/extra/clangd/SourceCode.cpp 997 SM.getMacroArgExpandedLocation(SM.getLocForStartOfFile(DecLoc.first)
tools/clang/tools/extra/clangd/TUScheduler.cpp 140 return llvm::find_if(LRU, [K](const KVPair &P) { return P.first == K; });
tools/clang/tools/extra/clangd/Trace.cpp 156 Out.attribute(KV.first, KV.second);
tools/clang/tools/extra/clangd/XRefs.cpp 313 QueryRequest.IDs.insert(It.first);
tools/clang/tools/extra/clangd/index/Background.cpp 78 I.first->second = *Path;
80 return I.first->second;
94 auto Entry = IG.try_emplace(FileURI).first;
101 auto I = IG.try_emplace(Include).first;
242 Files.try_emplace(AbsPath).first->getValue().Digest = IGN.Digest;
274 RefToIDs[&R] = SymRefs.first;
326 ShardVersion &SV = DigestIt.first->second;
tools/clang/tools/extra/clangd/index/BackgroundIndexLoader.cpp 55 LoadedShard &LS = It.first->getValue();
108 ToVisit.push(It.first->getKey());
tools/clang/tools/extra/clangd/index/FileIndex.cpp 147 I.first->second = mergeSymbol(I.first->second, Sym);
147 I.first->second = mergeSymbol(I.first->second, Sym);
152 auto It = Merged.find(Sym.first);
185 MergedRefs[Sym.first].append(Sym.second.begin(), Sym.second.end());
196 Sym.first,
tools/clang/tools/extra/clangd/index/IndexAction.cpp 66 auto I = IG.try_emplace(*URI).first;
100 auto NodeForInclude = IG.try_emplace(*IncludeURI).first->getKey();
103 NodeForIncluding.first->getValue().DirectIncludes.push_back(NodeForInclude);
115 assert(I.first->getKeyData() == I.first->getValue().URI.data() &&
115 assert(I.first->getKeyData() == I.first->getValue().URI.data() &&
tools/clang/tools/extra/clangd/index/MemIndex.cpp 24 return std::make_unique<MemIndex>(Data.first, Data.second, Relations,
tools/clang/tools/extra/clangd/index/MemIndex.h 28 this->Refs.try_emplace(R.first, R.second.begin(), R.second.end());
tools/clang/tools/extra/clangd/index/Ref.cpp 54 Result.emplace_back(Sym.first, llvm::ArrayRef<Ref>(SymRefs).copy(Arena));
tools/clang/tools/extra/clangd/index/Relation.cpp 24 return {IterPair.first, IterPair.second};
tools/clang/tools/extra/clangd/index/Serialization.cpp 162 void intern(llvm::StringRef &S) { S = *Unique.insert(S).first; };
357 Result.first = Data.consumeID();
453 auto Entry = Result.Sources->try_emplace(IGN.URI).first;
459 Include = Result.Sources->try_emplace(Include).first->getKey();
480 Refs.insert(RefsBundle.first, Ref);
597 writeRefs(Sym.first, Sym.second, Strings, RefsOS);
tools/clang/tools/extra/clangd/index/SymbolCollector.cpp 163 Result.Start = Range.first;
270 D = CanonicalDecls.try_emplace(D, ASTNode.OrigD).first->second;
454 PP->getSourceManager().getDecomposedExpansionLoc(Loc).first;
493 if (const Symbol *S = Symbols.find(Entry.first)) {
510 Found = URICache.insert({FID, FileURI}).first;
523 if (auto ID = getSymbolID(It.first)) {
525 auto FileID = SM.getFileID(LocAndRole.first);
530 getTokenRange(LocAndRole.first, SM, ASTCtx->getLangOpts());
532 R.Location.Start = Range.first;
694 R.first->second = Compute();
695 return R.first->second;
723 if (isIf(Line) && isErrorAboutInclude(Content.split('\n').first))
734 I.first->second = Opts.FileFilter(ASTCtx->getSourceManager(), FID);
735 return I.first->second;
tools/clang/tools/extra/clangd/index/YAMLSerialization.cpp 260 Refs.first);
375 Refs.insert(Variant.Refs->first, Ref);
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),
85 SymbolQuality[I] = ScoredSymbols[I].first;
100 {TokenToPostingList.first, PostingList(TokenToPostingList.second)});
106 : It->second.iterator(&It->first);
220 const DocID SymbolDocID = IDAndScore.first;
238 Callback(*Symbols[Item.first]);
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 57 if (IsGlobalScope || !Names.first.empty())
58 Request.Scopes = {Names.first};
tools/clang/tools/extra/clangd/indexer/IndexerMain.cpp 62 Refs.insert(Sym.first, Ref);
tools/clang/tools/extra/clangd/refactor/Tweak.cpp 111 E.ApplyEdits.try_emplace(PathAndEdit->first, PathAndEdit->second);
tools/clang/tools/extra/clangd/refactor/tweaks/DefineInline.cpp 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;
tools/clang/tools/extra/clangd/unittests/CancellationTests.cpp 17 WithContext ContextWithCancellation(std::move(Task.first));
27 ContextWithCancellation.emplace(std::move(Task.first));
38 WithContext ContextWithCancellation(std::move(Task.first));
56 std::thread AsyncTask(TaskToBeCancelled, std::move(Task.first));
tools/clang/tools/extra/clangd/unittests/ClangdTests.cpp 149 FS.Files[testPath(FileWithContents.first)] = FileWithContents.second;
tools/clang/tools/extra/clangd/unittests/CodeCompleteTests.cpp 1057 P.Offsets.first = lspLength(llvm::StringRef(Label).substr(0, Range.Begin));
tools/clang/tools/extra/clangd/unittests/DexTests.cpp 44 IDs[I] = IDAndScore[I].first;
tools/clang/tools/extra/clangd/unittests/DiagnosticsTests.cpp 483 EXPECT_EQ(LSPDiags[0].first.code, "enum_class_reference");
484 EXPECT_EQ(LSPDiags[0].first.source, "clang");
485 EXPECT_EQ(LSPDiags[1].first.code, "");
486 EXPECT_EQ(LSPDiags[1].first.source, "");
tools/clang/tools/extra/clangd/unittests/FindTargetTests.cpp 91 ActualDecls.emplace_back(Entry.first, Entry.second);
888 llvm::StringRef ExpectedCode = C.first;
tools/clang/tools/extra/clangd/unittests/SemanticHighlightingTests.cpp 63 Test.ranges(KindString.second), KindString.first);
113 TU.AdditionalFiles.insert({File.first, File.second});
143 {LineTokens.first, LineTokens.second});
tools/clang/tools/extra/clangd/unittests/SourceCodeTests.cpp 48 range.start = position(p1.first, p1.second);
49 range.end = position(p2.first, p2.second);
473 visibleNamespaces(Case.first, format::getLLVMStyle()))
474 << Case.first;
tools/clang/tools/extra/clangd/unittests/SymbolInfoTests.cpp 328 Annotations TestInput(T.first);
333 << T.first;
tools/clang/tools/extra/clangd/unittests/TUSchedulerTests.cpp 314 WithContext C(std::move(T.first));
323 WithContext C(std::move(T.first));
tools/clang/tools/extra/clangd/unittests/TraceTests.cpp 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 72 EXPECT_EQ(Res->first, testPath(Path));
437 EXPECT_EQ(IO.second, apply(IO.first)) << IO.first;
437 EXPECT_EQ(IO.second, apply(IO.first)) << IO.first;
885 EXPECT_EQ(C.second, apply(C.first)) << C.first;
885 EXPECT_EQ(C.second, apply(C.first)) << C.first;
1381 EXPECT_EQ(apply(Case.first), Case.second) << Case.first;
1381 EXPECT_EQ(apply(Case.first), Case.second) << Case.first;
1531 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;
1589 EXPECT_EQ(apply(Case.first), Case.second) << Case.first;
tools/clang/tools/extra/modularize/Modularize.cpp 395 File = SM.getFileEntryForID(Decomposed.first);
399 Line = SM.getLineNumber(Decomposed.first, Decomposed.second);
400 Column = SM.getColumnNumber(Decomposed.first, Decomposed.second);
516 AllHeaderContents.find(H->first);
531 std::back_inserter(HeaderContentMismatches[H->first]));
683 Entities.add(M->first->getName().str(), Entry::EK_Macro, Loc);
983 ModUtil->addUniqueProblemFile(H->first->getName());
984 errs() << "error: header '" << H->first->getName()
tools/clang/tools/extra/modularize/ModularizeUtilities.cpp 167 if (llvm::sys::path::is_absolute(TargetAndDependents.first))
168 llvm::sys::path::native(TargetAndDependents.first, HeaderFileName);
174 llvm::sys::path::append(HeaderFileName, TargetAndDependents.first);
tools/clang/tools/extra/modularize/PreprocessorTracker.cpp 1138 const PPItemKey &ItemKey = I->first;
1197 const PPItemKey &ItemKey = I->first;
tools/clang/tools/extra/pp-trace/PPCallbacksTracker.cpp 423 if (Filter.first.match(N))
424 R.first->second = Filter.second;
426 DisableTrace = !R.first->second;
545 << "Name: " << Value[I].first->getName() << ", "
tools/clang/tools/extra/unittests/clang-doc/SerializeTest.cpp 41 if (I.first)
42 EmittedInfos.emplace_back(std::move(I.first));
tools/clang/tools/extra/unittests/clang-include-fixer/find-all-symbols/FindAllSymbolsTests.cpp 41 Symbols[Entry.first] += Entry.second;
tools/clang/tools/extra/unittests/clang-move/ClangMoveTests.cpp 243 SmallString<32> FilePath (It.first);
tools/clang/tools/extra/unittests/clang-tidy/ClangTidyOptionsTest.cpp 43 EXPECT_EQ(3u, Options.LineFilter[0].LineRanges[0].first);
45 EXPECT_EQ(20u, Options.LineFilter[0].LineRanges[1].first);
47 EXPECT_EQ(42u, Options.LineFilter[0].LineRanges[2].first);
53 EXPECT_EQ(100u, Options.LineFilter[2].LineRanges[0].first);
tools/clang/tools/extra/unittests/clang-tidy/ClangTidyTest.h 128 Twine("include/") + FileContent.first, 0,
tools/clang/tools/libclang/ARCMigrate.cpp 130 static_cast<Remap *>(map)->Vec[index].first);
tools/clang/tools/libclang/CIndex.cpp 263 if (End.first != Begin.first) {
263 if (End.first != Begin.first) {
266 End.first = Begin.first;
266 End.first = Begin.first;
267 End.second = SM.getFileIDSize(Begin.first);
270 assert(Begin.first == End.first);
270 assert(Begin.first == End.first);
274 FileID File = Begin.first;
4494 const ObjCInterfaceDecl *Super = getCursorObjCSuperClassRef(C).first;
4498 const ObjCInterfaceDecl *Class = getCursorObjCClassRef(C).first;
4502 const ObjCProtocolDecl *OID = getCursorObjCProtocolRef(C).first;
4511 const TypeDecl *Type = getCursorTypeRef(C).first;
4518 const TemplateDecl *Template = getCursorTemplateRef(C).first;
4525 const NamedDecl *NS = getCursorNamespaceRef(C).first;
4532 const FieldDecl *Field = getCursorMemberRef(C).first;
4539 const LabelStmt *Label = getCursorLabelRef(C).first;
4546 OverloadedDeclRefStorage Storage = getCursorOverloadedDeclRef(C).first;
4562 const VarDecl *Var = getCursorVariableRef(C).first;
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);
6179 return MakeCXCursor(getCursorObjCSuperClassRef(C).first, tu);
6182 const ObjCProtocolDecl *Prot = getCursorObjCProtocolRef(C).first;
6190 const ObjCInterfaceDecl *Class = getCursorObjCClassRef(C).first;
6198 return MakeCXCursor(getCursorTypeRef(C).first, tu );
6201 return MakeCXCursor(getCursorTemplateRef(C).first, tu );
6204 return MakeCXCursor(getCursorNamespaceRef(C).first, tu );
6207 return MakeCXCursor(getCursorMemberRef(C).first, tu );
6218 return MakeCXCursor(getCursorLabelRef(C).first,
6227 return MakeCXCursor(getCursorVariableRef(C).first, tu);
6484 return cxcursor::getSelectorIdentifierIndexAndLoc(cursor).first;
6491 OverloadedDeclRefStorage Storage = getCursorOverloadedDeclRef(C).first;
6514 OverloadedDeclRefStorage Storage = getCursorOverloadedDeclRef(cursor).first;
6666 = CXXUnit->getSourceManager().getBufferData(LocInfo.first, &Invalid);
6710 if (BeginLocInfo.first != EndLocInfo.first)
6710 if (BeginLocInfo.first != EndLocInfo.first)
6716 = SourceMgr.getBufferData(BeginLocInfo.first, &Invalid);
6720 Lexer Lex(SourceMgr.getLocForStartOfFile(BeginLocInfo.first),
6794 SourceLocation End = SM.getComposedLoc(DecomposedEnd.first, DecomposedEnd.second);
7450 if (BeginLocInfo.first != EndLocInfo.first)
7450 if (BeginLocInfo.first != EndLocInfo.first)
7455 Buffer = SourceMgr.getBufferData(BeginLocInfo.first, &Invalid);
7459 Lexer Lex(SourceMgr.getLocForStartOfFile(BeginLocInfo.first),
tools/clang/tools/libclang/CIndexHigh.cpp 196 if (LocInfo.first != data->FID)
291 if (SM.getFileEntryForID(LocInfo.first) != data->File)
363 if (SM.getFileEntryForID(LocInfo.first) != File)
tools/clang/tools/libclang/CXCursor.h 263 return getSelectorIdentifierIndexAndLoc(cursor).first;
tools/clang/tools/libclang/CXIndexDataConsumer.cpp 1018 FileID FID = LocInfo.first;
1113 FileID FID = LocInfo.first;
tools/clang/tools/libclang/CXLoadedDiagnostic.cpp 144 *ReplacementRange = FixIts[FixIt].first;
tools/clang/tools/libclang/CXSourceLocation.cpp 323 FileID FID = LocInfo.first;
359 FileID FID = LocInfo.first;
tools/clang/tools/libclang/CXType.cpp 252 = Context.getObjCInterfaceType(getCursorObjCSuperClassRef(C).first);
257 QualType T = Context.getObjCInterfaceType(getCursorObjCClassRef(C).first);
262 QualType T = Context.getTypeDeclType(getCursorTypeRef(C).first);
271 return cxtype::MakeCXType(getCursorMemberRef(C).first->getType(), TU);
274 return cxtype::MakeCXType(getCursorVariableRef(C).first->getType(), TU);
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/Dynamic/ParserTest.cpp 57 MatcherInfo ToStore = { Matcher->first, NameRange, Args, BindID };
tools/clang/unittests/Basic/DiagnosticTest.cpp 87 EXPECT_EQ(ErrDiag->first, SourceLocation());
93 EXPECT_EQ(Value->first, 20);
tools/clang/unittests/CrossTU/CrossTranslationUnitTest.cpp 93 SourceLocation OrigSLoc = (*SLocResult).first;
tools/clang/unittests/Frontend/ParsedSourceLocationTest.cpp 23 EXPECT_EQ(PSR->Begin.first, BeginLine);
25 EXPECT_EQ(PSR->End.first, EndLine);
tools/clang/unittests/Tooling/ASTSelectionTest.cpp 50 SelRange = SourceRange(SelectionRange->first.translate(SM),
tools/clang/unittests/Tooling/CompilationDatabaseTest.cpp 390 Case.first + "\"}]";
394 << Case.first;
tools/clang/unittests/Tooling/ExecutionTest.cpp 219 EXPECT_EQ("f", KVs[0].first);
247 MATCHER_P(Named, Name, "") { return arg.first == Name; }
284 Executor.mapVirtualFile(FileAndContent.first, FileAndContent.second);
tools/clang/unittests/Tooling/RefactoringActionRulesTest.cpp 76 Selection.first.getBegin().getLocWithOffset(Selection.second);
tools/clang/unittests/Tooling/RefactoringTest.cpp 615 TemporaryFiles.insert(std::make_pair(Name, Path.str())).first->second;
1051 EXPECT_EQ(Path1, FileToReplaces.begin()->first);
1072 EXPECT_EQ(Path1, FileToReplaces.begin()->first);
tools/clang/unittests/Tooling/RewriterTestContext.h 80 TemporaryFiles.insert(std::make_pair(Name, Path.str())).first->second;
tools/clang/unittests/Tooling/Syntax/TokensTest.cpp 83 return arg.location() == SourceRng.first &&
169 Ls.first = SourceMgr->getLocForStartOfFile(SourceMgr->getMainFileID())
318 EXPECT_EQ(collectAndDump(Test.first), Test.second)
319 << collectAndDump(Test.first);
475 EXPECT_EQ(Test.second, collectAndDump(Test.first))
476 << collectAndDump(Test.first);
tools/clang/unittests/Tooling/Syntax/TreeTest.cpp 153 auto *Root = buildTree(T.first);
tools/clang/unittests/libclang/TestUtils.h 72 it.first->first->c_str(), // filename
72 it.first->first->c_str(), // filename
73 it.first->second->c_str(), // contents
74 it.first->second->size() // length
tools/clang/utils/TableGen/ClangASTNodesEmitter.cpp 115 if (!First && Result.first)
116 First = Result.first;
tools/clang/utils/TableGen/ClangAttrEmitter.cpp 1311 if ((Ptr = createArgument(Arg, Attr, Base.first)))
1653 OS << " case " << I.first << ": return " << I.second << ";\n";
2016 << SubMatchRule.first->getValueAsString("Name")
2068 << AttributeSubjectMatchRule(SubMatchRule.first, nullptr).getEnumValue()
2111 if (Args[0]->getSuperClasses().back().first->getName() != "TypeArgument")
2143 llvm::StringSwitch<bool>(Arg->getSuperClasses().back().first->getName())
2153 Arg->getSuperClasses().back().first->getName())
2201 Arg->getSuperClasses().back().first->getName())
2258 const Record *R = Super.first;
2360 OS << "AT_" << ParsedAttrSpellingItr->first;
2747 auto SuperClass = findClassByRecord(SuperClasses[e - i - 1].first);
3066 if (I->first.empty())
3069 OS << "if (ScopeName == \"" << I->first << "\") {\n";
3071 GenerateHasAttrSpellingStringSwitch(I->second, OS, Spelling, I->first);
3095 OS << " case AT_" << I.first << ": {\n";
3263 OS << "PARSED_ATTR(" << I.first << ")\n";
3577 if (I.first == APK) {
3704 SS << " // AT_" << I->first << "\n";
3952 Heading(std::move(HeadingAndSpellings.first)),
4106 WriteCategoryHeader(I.first, OS);
4128 OS << I.first;
tools/clang/utils/TableGen/ClangDiagnosticsEmitter.cpp 352 ++V.first;
357 return V.first != 0 && V.first == V.second.getValue();
357 return V.first != 0 && V.first == V.second.getValue();
843 Visitor.Visit(NodePair.first);
1324 const bool IsPedantic = I.first == "pedantic";
1375 const bool IsPedantic = I.first == "pedantic";
1456 MaxLen = std::max(MaxLen, (unsigned)I.first.size());
1463 if (I.first.find_first_not_of("abcdefghijklmnopqrstuvwxyz"
1467 PrintFatalError("Invalid character in diagnostic group '" + I.first +
1469 OS << I.first << " */ " << std::string(MaxLen - I.first.size(), ' ');
1469 OS << I.first << " */ " << std::string(MaxLen - I.first.size(), ' ');
1471 std::string Name = char(I.first.size()) + I.first;
1471 std::string Name = char(I.first.size()) + I.first;
1475 const bool IsPedantic = I.first == "pedantic";
1556 std::string Name = char(I->first.size()) + I->first;
1556 std::string Name = char(I->first.size()) + I->first;
tools/clang/utils/TableGen/ClangOpenCLBuiltinEmitter.cpp 349 return a.first == Signature;
368 StringSwitch<const char *>(T.first->getValueAsString("AccessQualifier"))
375 << " {OCLT_" << T.first->getValueAsString("Name") << ", "
376 << T.first->getValueAsInt("VecWidth") << ", "
377 << T.first->getValueAsBit("IsPointer") << ", "
378 << T.first->getValueAsBit("IsConst") << ", "
379 << T.first->getValueAsBit("IsVolatile") << ", "
381 << T.first->getValueAsString("AddrSpace") << "},\n";
393 for (const Record *R : P.first) {
407 OS << " // " << (Index + 1) << ": " << FOM.first << "\n";
411 << Overload.first->getValueAsListOfDefs("Signature").size() << ", "
412 << Overload.first->getValueAsDef("MinVersion")->getValueAsInt("ID")
414 << Overload.first->getValueAsDef("MaxVersion")->getValueAsInt("ID")
434 ValidBuiltins.push_back(StringMatcher::StringPair(i.first, RetStmt));
508 OS << " case OCLT_" << ITE.first.str() << ":\n"
tools/clang/utils/TableGen/ClangOptionDocEmitter.cpp 236 StringRef Separator = Separators.first;
tools/clang/utils/TableGen/MveEmitter.cpp 736 OS << " " << kv.first << " = " << kv.second << ";\n";
795 std::string Index = utostr(kv.first);
1467 OS << kv.first;
1547 const MergeableGroup &MG = kv.first;
1615 const MergeableGroup &MG = kv.first;
tools/clang/utils/TableGen/NeonEmitter.cpp 1562 return std::make_pair(R.first, Op + R.second);
1569 assert_with_loc(R1.first == R2.first, "Argument type mismatch!");
1569 assert_with_loc(R1.first == R2.first, "Argument type mismatch!");
1570 return std::make_pair(R1.first, R1.second + " " + Op + " " + R2.second);
1580 Types.push_back(R.first);
1617 Type castToType = R.first;
1663 Intr.Variables[N] = Variable(R.first, N + Intr.VariablePostfix);
1665 Intr.OS << R.first.str() << " " << Intr.Variables[N].getName() << " = "
1749 assert_with_loc(Arg1.first == Arg2.first,
1749 assert_with_loc(Arg1.first == Arg2.first,
1757 std::make_unique<Rev>(Arg1.first.getElementSizeInBits()));
1759 std::make_unique<MaskExpander>(Arg1.first.getNumElements()));
1772 Type T(Arg1.first);
1792 assert_with_loc(A.first.isScalar(), "dup() expects a scalar argument");
1813 assert_with_loc(B.first.isScalar(),
1816 Type T = A.first;
1836 assert_with_loc(B.first.isScalar(),
1853 assert_with_loc(!A.first.isVoid(),
1862 Intr.Variables[N] = Variable(A.first, N + Intr.VariablePostfix);
1865 A.first.str() + " " + Intr.Variables[N].getName() + " = " + A.second;
2065 CK = ClassMap[R->getSuperClasses()[1].first];
2089 Entry.emplace_back(R, Name, Proto, I.first, I.second, CK, Body, *this,
2214 OS << "case NEON::BI__builtin_neon_" << I.first << ": ";
tools/dsymutil/BinaryHolder.cpp 46 StringRef ArchiveFilename = getArchiveAndObjectName(Filename).first;
219 StringRef ArchiveFilename = getArchiveAndObjectName(Filename).first;
tools/dsymutil/DebugMap.cpp 52 AddressToMapping[*ObjectAddress] = &*InsertResult.first;
66 return LHS.first < RHS.first;
66 return LHS.first < RHS.first;
75 Sym.first.data());
165 io.mapRequired("sym", s.first);
276 auto AddressIt = SymbolAddresses.find(Entry.first);
279 Res.addSymbol(Entry.first, ObjAddress, Mapping.BinaryAddress, Mapping.Size);
tools/dsymutil/DwarfLinker.cpp 213 Info.NameWithoutTemplate = StringPool.getEntry(Split.first);
1885 if (Range != Ranges.end() && Range->first <= Row.Address.Address &&
2049 if (Range == Ranges.end() || Range->first > Loc ||
2072 LastCIEOffset != IteratorInserted.first->getValue()) {
2074 IteratorInserted.first->getValue() = LastCIEOffset;
2082 Streamer->emitFDE(IteratorInserted.first->getValue(), AddrSize,
2519 StringRef ModuleName = I.first;
tools/dsymutil/DwarfStreamer.cpp 355 uint64_t RangeStart = Range->first;
357 while ((Range + 1) != End && Range->second == (Range + 1)->first)
376 MS->EmitIntValue(Range->first + PcOffset, AddressSize);
377 while (Range + 1 != End && Range->second == (Range + 1)->first)
415 uint64_t Offset = Attr.first.get();
416 Attr.first.set(LocSectionSize);
tools/dsymutil/NonRelocatableStringpool.cpp 21 auto &Entry = I.first->second;
28 return DwarfStringPoolEntryRef(*I.first, true);
38 return InsertResult.first->getKey();
tools/dsymutil/SymbolMap.cpp 37 Line.split('_').first.getAsInteger(10, LineNumber);
tools/gold/gold-plugin.cpp 555 FDToLeaderHandle.insert(std::make_pair(file->fd, file->handle)).first;
1023 addModule(*Lto, F, View, ObjFilename.first->first());
1025 ObjFilename.first->second = true;
1048 Files[Task].first, Task);
1098 if (!F.first.empty())
1099 recordFile(F.first.str(), F.second);
tools/lld/COFF/DebugTypes.cpp 192 *p, createStringError(inconvertibleErrorCode(), pdb.first.c_str()));
tools/lld/COFF/Driver.cpp 248 driver->addBuffer(std::move(mbOrErr.first), wholeArchive, lazy);
313 driver->addArchiveBuffer(takeBuffer(std::move(mbOrErr.first)),
1803 StringRef from = pair.first;
1921 StringRef name = pair.first;
tools/lld/COFF/DriverUtils.cpp 163 StringRef existing = pair.first->second;
658 Export *existing = pair.first->second;
690 if (!existing.first.empty() && v != existing.first) {
690 if (!existing.first.empty() && v != existing.first) {
695 existingStr + " has value " + existing.first + "\n>>> " + sourceStr +
tools/lld/COFF/ICF.cpp 90 StringRef outSecName = c->getSectionName().split('$').first;
tools/lld/COFF/InputFiles.cpp 461 Symbol *sym = kv.first;
807 return std::make_pair(saver.save(ret->first), ret->second);
923 sym = comdat[comdatIndex].first;
954 StringRef suffix = config->thinLTOObjectSuffixReplace.first;
tools/lld/COFF/LTO.cpp 59 config->thinLTOPrefixReplace.first,
102 config->thinLTOPrefixReplace.first, config->thinLTOPrefixReplace.second,
tools/lld/COFF/PDB.cpp 363 objectIndexMap = &r.first;
428 CVIndexMap &indexMap = it.first->second;
534 CVIndexMap &indexMap = insertion.first->second;
550 return r.first;
552 CVIndexMap &indexMap = r.first;
tools/lld/COFF/SymbolTable.cpp 170 if (!loc.fileLine.first.empty())
171 os << loc.fileLine.first << ":" << loc.fileLine.second
472 result.first->isUsedInRegularObj = true;
542 os << fileLine->first << ":" << fileLine->second << "\n>>> ";
734 StringRef name = pair.first.val();
tools/lld/COFF/Writer.cpp 460 uint32_t &thunkSymbolIndex = insertion.first->second;
487 if (nextReplacement != endReplacement && nextReplacement->first == i) {
635 StringRef s = name.split('$').first;
834 name = name.split('$').first;
1187 if (p.first == toName)
1192 fatal("/merge: cycle found for section '" + p.first + "'");
1198 OutputSection *from = findSection(p.first);
1732 StringRef name = p.first;
tools/lld/Common/Args.cpp 55 if (kv.first == key) {
tools/lld/ELF/CallGraphSort.cpp 113 return res.first->second;
118 const auto *fromSB = cast<InputSectionBase>(c.first.first->repl);
118 const auto *fromSB = cast<InputSectionBase>(c.first.first->repl);
119 const auto *toSB = cast<InputSectionBase>(c.first.second->repl);
tools/lld/ELF/Driver.cpp 149 if (ret.first == ELFNoneKind)
151 return std::make_tuple(ret.first, ret.second, osabi);
210 files.push_back(createObjectFile(p.first, path, p.second));
226 if (identify_magic(p.first.getBuffer()) != file_magic::bitcode) {
233 files.push_back(make<LazyObjFile>(p.first, path, p.second));
tools/lld/ELF/InputFiles.cpp 242 return createFileLineMsg(fileLine->first, fileLine->second);
1559 StringRef suffix = config->thinLTOObjectSuffixReplace.first;
tools/lld/ELF/InputSection.cpp 593 for (auto it = range.first; it != range.second; ++it)
tools/lld/ELF/LTO.cpp 63 config->thinLTOPrefixReplace.first,
138 config->thinLTOPrefixReplace.first, config->thinLTOPrefixReplace.second,
tools/lld/ELF/LinkerScript.cpp 241 const Defined *sym = it.first;
271 error("unable to INSERT AFTER/BEFORE " + p.first +
tools/lld/ELF/MapFile.cpp 252 Symbol *sym = kv.first;
tools/lld/ELF/Relocations.cpp 1551 return ts.first->getSize() == 0;
1560 newThunks.push_back(ts.first);
1585 ThunkSection *ts = tp.first;
1822 addressesChanged |= p.first->assignOffsets();
tools/lld/ELF/SymbolTable.cpp 64 int &symIndex = p.first->second;
tools/lld/ELF/SyntheticSections.cpp 773 return primGot.global.front().first;
775 return primGot.relocs.front().first;
825 if (!p.first->isPreemptible)
826 got.local16.insert({{p.first, 0}, 0});
828 return !p.first->isPreemptible;
837 return got.global.count(p.first);
857 const OutputSection *os = p.first;
899 return primGot->global.count(p.first);
934 p.first->gotIndex = p.second;
936 p.first->gotIndex = p.second;
942 Symbol *s = p.first;
948 Symbol *s = p.first;
979 mainPart->relaDyn->addReloc(target->relativeRel, this, offset, p.first);
989 mainPart->relaDyn->addReloc({target->relativeRel, this, offset, l.first,
996 p.first.first, p.first.second});
996 p.first.first, p.first.second});
996 p.first.first, p.first.second});
1044 uint64_t firstPageAddr = getMipsPageAddr(l.first->addr);
1054 write(p.second, p.first.first, p.first.second);
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);
1063 write(p.second, p.first, p.first->isPreemptible ? 0 : -0x7000);
1065 if (p.first == nullptr && !config->isPic)
1067 else if (p.first && !p.first->isPreemptible) {
1067 else if (p.first && !p.first->isPreemptible) {
1073 write(p.second + 1, p.first, -0x8000);
1169 return r.first->second;
1503 p->d_tag = kv.first;
tools/lld/ELF/Writer.cpp 1254 warn("symbol ordering file: no such symbol: " + orderEntry.first);
1319 isd->sections.push_back(p.first);
tools/lld/lib/Driver/DarwinLdDriver.cpp 180 StringRef line = lineAndRest.first;
183 StringRef sym = symAndComment.first.trim();
210 StringRef line = lineAndRest.first;
214 if (symAndComment.first.empty())
216 StringRef sym = symAndComment.first.trim();
224 prefix = prefixAndSym.first;
232 sym = prefixAndSym.first;
256 StringRef filePath = opt.first;
268 StringRef line = lineAndRest.first;
tools/lld/lib/ReaderWriter/MachO/CompactUnwindPass.cpp 498 if (!unwindLocs.count(entry.first))
tools/lld/lib/ReaderWriter/MachO/LayoutPass.cpp 162 checkReachabilityFromRoot(_followOnRoots, ai.first);
tools/lld/lib/ReaderWriter/MachO/StubsPass.cpp 284 targetsNeedingStubs.push_back(it.first);
tools/lld/wasm/SymbolTable.cpp 98 int &symIndex = p.first->second;
201 return replaceSymbol<DefinedFunction>(insertName(name).first, name,
212 s = insertName(name).first;
226 return replaceSymbol<DefinedData>(insertName(name).first, name, flags);
235 return replaceSymbol<DefinedGlobal>(insertName(name).first, name, flags,
685 StringRef symName = pair.first.val();
tools/lld/wasm/SyntheticSections.cpp 76 return pair.first->second;
478 writeStr(sub.os, c.first, "comdat name");
536 for (auto &producer : *producers.first)
540 return seen.first == producer.first;
540 return seen.first == producer.first;
553 writeStr(os, field.first, "field name");
556 writeStr(os, entry.first, "producer name");
tools/lldb/include/lldb/DataFormatters/FormattersContainer.h 57 while (type_lexer.NextIf({' ', '\t', '\v', '\f'}).first)
91 if (iter->first == name) {
110 if (pos.first == name) {
121 const KeyType &type = pos.first;
142 return m_map[index].first;
245 const RegularExpression ®ex = pos->first;
290 const RegularExpression ®ex = pos.first;
303 const RegularExpression ®ex = pos.first;
tools/lldb/include/lldb/Interpreter/CommandObject.h 43 if (add_all || (iter->first.find(cmd_str, 0) == 0)) {
45 matches.AppendString(iter->first.c_str());
60 size_t len = pos->first.size();
tools/lldb/include/lldb/Utility/Broadcaster.h 127 return (input.first.GetBroadcasterClass() == m_broadcaster_class);
142 return (input.first.IsContainedIn(m_broadcaster_spec));
159 return (input.first.GetBroadcasterClass() ==
161 (input.first.GetEventBits() &
tools/lldb/include/lldb/Utility/StructuredData.h 363 if (!callback(pair.first, pair.second.get()))
373 key_object_sp->SetValue(iter->first.AsCString());
tools/lldb/source/API/SBValue.cpp 402 if (TypeValidatorResult::Failure == validation.first) {
tools/lldb/source/Breakpoint/Breakpoint.cpp 746 lldb::break_id_t old_id = old_sc_map.begin()->first;
758 old_id_vec.push_back(tmp_iter->first);
766 new_id_vec.push_back(tmp_iter->first);
tools/lldb/source/Breakpoint/BreakpointSiteList.cpp 180 if (lower == m_bp_site_list.end() || (*lower).first >= upper_bound)
tools/lldb/source/Commands/CommandObjectCommands.cpp 137 if (start_idx.first && start_idx.second == UINT64_MAX) {
138 if (count.first) {
141 } else if (stop_idx.first) {
149 if (!start_idx.first && !stop_idx.first && !count.first) {
149 if (!start_idx.first && !stop_idx.first && !count.first) {
149 if (!start_idx.first && !stop_idx.first && !count.first) {
152 } else if (start_idx.first) {
153 if (count.first) {
155 } else if (!stop_idx.first) {
158 } else if (stop_idx.first) {
159 if (count.first) {
tools/lldb/source/Commands/CommandObjectMultiword.cpp 167 indented_command.append(pos->first);
241 const char *command_name = pos->first.c_str();
tools/lldb/source/Commands/CommandObjectTarget.cpp 3104 const char format_char = m_options.m_format_array[i].first;
tools/lldb/source/Core/FormatEntity.cpp 1968 if (p.first.equals(entry_def->name) || entry_def->name[0] == '*') {
tools/lldb/source/Core/Mangled.cpp 62 if (mangled && g_most_recent_mangled_to_name_sans_args.first == mangled) {
88 g_most_recent_mangled_to_name_sans_args.first = mangled;
tools/lldb/source/Core/ValueObject.cpp 519 root = root->GetChildAtIndex(idx.first, idx.second);
522 *index_of_error = idx.first;
553 root = root->GetChildMemberWithName(name.first, name.second);
556 *name_of_error = name.first;
tools/lldb/source/DataFormatters/FormatClasses.cpp 33 m_formatters_match_vector.first =
36 return m_formatters_match_vector.first;
tools/lldb/source/DataFormatters/ValueObjectPrinter.cpp 335 m_summary_formatter.first = entry;
340 return m_summary_formatter.first;
804 if (TypeValidatorResult::Failure == m_validation.first) {
816 if (TypeValidatorResult::Success == m_validation.first)
tools/lldb/source/Expression/IRExecutionUnit.cpp 134 if (func_range.first == 0 && func_range.second == 0) {
142 func_range.first, func_range.second);
429 m_function_end_load_addr = func_range.first + func_range.second;
tools/lldb/source/Expression/IRMemoryMap.cpp 40 Free(iter->first, err);
89 lldb::addr_t addr = back->first;
156 lldb::addr_t addr = back->first;
171 if (iter == m_allocations.end() || iter->first > addr) {
177 if (iter->first <= addr && iter->first + iter->second.m_size >= addr + size)
177 if (iter->first <= addr && iter->first + iter->second.m_size >= addr + size)
tools/lldb/source/Host/common/MainLoop.cpp 159 sigdelset(&sigmask, sig.first);
205 pfd.fd = fd.first;
245 if (g_signal_flags[entry.first] != 0)
246 signals.push_back(entry.first);
tools/lldb/source/Host/common/NativeProcessProtocol.cpp 236 if (hw_debug_cap == llvm::None || hw_debug_cap->first == 0 ||
237 hw_debug_cap->first <= m_hw_breakpoints_map.size())
649 lldb::addr_t bp_addr = pair.first;
tools/lldb/source/Host/common/TCPSocket.cpp 80 if (::getsockname(m_listen_sockets.begin()->first, sock_addr,
238 CLOSE_SOCKET(socket.first);
255 auto fd = socket.first;
257 auto io_sp = IOObjectSP(new TCPSocket(socket.first, false, inherit));
tools/lldb/source/Host/linux/Host.cpp 134 .first;
tools/lldb/source/Interpreter/CommandAlias.cpp 213 return {desugared.first, options};
tools/lldb/source/Interpreter/CommandInterpreter.cpp 1183 (pos->first.compare(0, 1, "_") == 0))
1186 OutputFormattedHelpText(result.GetOutputStream(), pos->first, "--",
1203 OutputFormattedHelpText(result.GetOutputStream(), alias_pos->first, "--",
1215 OutputFormattedHelpText(result.GetOutputStream(), pos->first, "--",
1382 alias_cmd_obj = desugared.first.get();
2585 llvm::StringRef command_name = pos->first;
tools/lldb/source/Interpreter/OptionValueDictionary.cpp 48 strm.Indent(pos->first.GetCString());
89 strm.Printf("%s=", pos->first.GetCString());
320 strm.Printf("%s=", pos->first.GetCString());
321 copied_dict->SetValueForKey(pos->first, pos->second->DeepCopy(), true);
tools/lldb/source/Plugins/Disassembler/llvm/DisassemblerLLVMC.cpp 556 if (offset_and_iterator.first.IsValid()) {
568 if (base_and_iterator.first.IsValid()) {
581 if (index_and_iterator.first.IsValid()) {
594 if (index_and_iterator.first.IsValid()) {
607 product.m_children.push_back(index_and_iterator.first);
608 product.m_children.push_back(multiplier_and_iterator.first);
612 index.m_children.push_back(base_and_iterator.first);
615 if (offset_and_iterator.first.IsValid()) {
618 offset.m_children.push_back(offset_and_iterator.first);
639 if (offset_and_iterator.first.IsValid()) {
651 if (base_and_iterator.first.IsValid()) {
662 if (offset_and_iterator.first.IsValid()) {
665 offset.m_children.push_back(offset_and_iterator.first);
666 offset.m_children.push_back(base_and_iterator.first);
675 deref.m_children.push_back(base_and_iterator.first);
692 if (base_and_iterator.first.IsValid()) {
705 if (offset_and_iterator.first.IsValid()) {
716 offset.m_children.push_back(offset_and_iterator.first);
717 offset.m_children.push_back(base_and_iterator.first);
737 if (base_and_iterator.first.IsValid()) {
750 deref.m_children.push_back(base_and_iterator.first);
826 if (found_and_iter.first) {
tools/lldb/source/Plugins/DynamicLoader/Darwin-Kernel/DynamicLoaderDarwinKernel.cpp 1345 if (ku.first.size() > longest_name)
1346 longest_name = ku.first.size();
1352 s.Printf(" %-*s %s\n", longest_name, ku.first.c_str(), uuid.c_str());
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangASTSource.cpp 331 i->first->GetFileSpec().GetFilename().GetCString());
337 i->first->FindTypesInNamespace(name, &i->second, UINT32_MAX, types);
757 i->first->GetFileSpec().GetFilename().GetCString());
759 FindExternalVisibleDecls(context, i->first, i->second, current_id);
1677 DeclFromUser<D> user_decl(const_cast<D *>(item.first));
1895 lldb::ModuleSP module_sp = i->first;
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangExpressionDeclMap.cpp 757 i->first->GetFileSpec().GetFilename().GetCString());
759 FindExternalVisibleDecls(context, i->first, i->second, current_id);
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangExpressionParser.cpp 131 module.path.push_back(ConstString(component.first->getName()));
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangModulesDeclVendor.cpp 139 switch (diag.first) {
428 lookup->get(mi->first->getName());
431 ii = mi->first;
467 macro_expansion.append(mi->first->getName().str());
tools/lldb/source/Plugins/Language/CPlusPlus/LibCxxUnorderedMap.cpp 145 if (!val_hash.first)
151 val_hash.first->GetData(data, error);
155 ExecutionContext exe_ctx = val_hash.first->GetExecutionContextRef().Lock(
158 val_hash.first->GetCompilerType());
tools/lldb/source/Plugins/Language/ObjC/NSDictionary.cpp 413 if (candidate.first && candidate.first->Match(class_name))
413 if (candidate.first && candidate.first->Match(class_name))
489 if (candidate.first && candidate.first->Match((class_name)))
489 if (candidate.first && candidate.first->Match((class_name)))
tools/lldb/source/Plugins/Language/ObjC/NSIndexPath.cpp 190 Scalar scalar((unsigned long long)value.first);
193 Scalar scalar((unsigned int)value.first);
tools/lldb/source/Plugins/LanguageRuntime/ObjC/AppleObjCRuntime/AppleObjCRuntimeV2.cpp 606 auto iterator = iterators_pair.first;
615 std_out.Printf("isa = 0x%" PRIx64, iterator->first);
654 iterator->first);
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()) {
2042 const ConstString class_name_cs(class_and_ivar.first);
2665 cf_false = m_CFBoolean_values->first;
tools/lldb/source/Plugins/LanguageRuntime/ObjC/ObjCLanguageRuntime.cpp 165 return pos->first;
189 for (HashToISAIterator range_pos = range.first; range_pos != range.second;
tools/lldb/source/Plugins/LanguageRuntime/RenderScript/RenderScriptRuntime/RenderScriptRuntime.cpp 858 const auto kernel_name = kernel.first;
2861 m_pragmas[kv_pair.first.trim().str()] = kv_pair.second.trim().str();
2928 if (kv_pair.first == "slang")
2930 else if (kv_pair.first == "bcc")
2945 if (kv_pair.first.getAsInteger(10, slot))
3022 const auto key = kv_pair.first;
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 206 while (pos != archive_map.end() && pos->first == file) {
tools/lldb/source/Plugins/ObjectFile/ELF/ObjectFileELF.cpp 2205 .first;
tools/lldb/source/Plugins/ObjectFile/Mach-O/ObjectFileMachO.cpp 4356 if (range.first != range.second) {
4357 for (ValueToSymbolIndexMap::const_iterator pos = range.first;
4392 if (range.first != range.second) {
4393 for (ValueToSymbolIndexMap::const_iterator pos = range.first;
4493 sym[pos.first].SetReExportedSymbolSharedLibrary(
tools/lldb/source/Plugins/ObjectFile/PECOFF/ObjectFilePECOFF.cpp 612 hdr_name = hdr_name.split('\0').first;
tools/lldb/source/Plugins/Platform/Android/AdbClient.cpp 169 device_list.push_back(device.split('\t').first);
tools/lldb/source/Plugins/Platform/gdb-server/PlatformRemoteGDBServer.cpp 851 gdbserver.first, socket_name_cstr));
tools/lldb/source/Plugins/Process/Linux/NativeProcessLinux.cpp 327 lldb::tid_t tid = it->first;
376 tids.push_back(p.first);
1247 MemoryRegionInfo &proc_entry_info = it->first;
1643 load_addr = it.first.GetRange().GetRangeBase();
1733 thread_info.first, error);
1834 (thread == iter.first || thread == LLDB_INVALID_THREAD_ID))
2039 m_processor_trace_monitor.erase(iter.first);
tools/lldb/source/Plugins/Process/Utility/AuxVector.cpp 47 GetEntryName(static_cast<EntryType>(entry.first)), entry.first,
47 GetEntryName(static_cast<EntryType>(entry.first)), entry.first,
tools/lldb/source/Plugins/Process/Utility/DynamicRegisterInfo.cpp 481 const uint32_t reg_num = pos->first;
tools/lldb/source/Plugins/Process/gdb-remote/GDBRemoteCommunicationServerLLGS.cpp 2831 .first;
tools/lldb/source/Plugins/Process/gdb-remote/GDBRemoteCommunicationServerPlatform.cpp 473 return pair.first;
tools/lldb/source/Plugins/Process/gdb-remote/ProcessGDBRemote.cpp 421 if (!value_pair.first.empty()) {
422 uint32_t reg = StringConvert::ToUInt32(value_pair.first.str().c_str(),
1333 s_pos->first);
1356 s_pos->first);
1413 m_gdb_comm.SetCurrentThreadForRun(m_continue_C_tids.front().first);
1465 m_gdb_comm.SetCurrentThreadForRun(m_continue_S_tids.front().first);
1797 gdb_thread->PrivateSetRegisterValue(pair.first, buffer_sp->GetData());
tools/lldb/source/Plugins/Process/gdb-remote/ProcessGDBRemote.h 440 return llvm::hash_combine(key.first, key.second);
tools/lldb/source/Plugins/SymbolFile/Breakpad/SymbolFileBreakpad.cpp 140 return m_map.try_emplace(file, m_map.size() + 1).first->second;
159 if (KV.first < all_files.size())
160 result[KV.second] = all_files[KV.first];
440 llvm::StringRef lhs = rule->first;
576 if (rule.first == name)
609 const RegisterInfo *info = ResolveRegister(resolver, it->first);
tools/lldb/source/Plugins/SymbolFile/DWARF/DWARFASTParserClang.cpp 2127 pos->first->getNameAsString().c_str());
2142 base_pos->first->getNameAsString().c_str());
2156 vbase_pos->first->getNameAsString().c_str());
2193 it != m_decl_ctx_to_die.end() && it->first == opaque_decl_ctx;
tools/lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugAbbrev.cpp 129 m_prev_abbr_offset_pos->first == cu_abbr_offset)
tools/lldb/source/Plugins/SymbolFile/DWARF/DWARFDebugInfo.cpp 168 if (pos == m_type_hash_to_unit_index.end() || pos->first != hash)
tools/lldb/source/Plugins/SymbolFile/DWARF/SymbolFileDWARF.cpp 892 FileSpecList &list = iter_bool.first->second;
tools/lldb/source/Plugins/SymbolFile/NativePDB/CompileUnitIndex.cpp 118 return *result.first->second;
129 std::unique_ptr<CompilandIndexItem>& cci = result.first->second;
tools/lldb/source/Plugins/SymbolFile/NativePDB/PdbAstBuilder.cpp 357 TypeIndex key = entry.first;
535 return CreateDeclInfoForUndecoratedName(getSymbolName(sym)).first;
540 return CreateDeclInfoForUndecoratedName(getSymbolName(sym)).first;
624 return CreateDeclInfoForUndecoratedName(getSymbolName(global)).first;
tools/lldb/source/Plugins/SymbolFile/NativePDB/PdbFPOProgramToDWARFExpression.cpp 67 if (pair.first == symbol.GetName())
82 if (it->first == register_name) {
tools/lldb/source/Plugins/SymbolFile/NativePDB/SymbolFileNativePDB.cpp 850 emplace_result.first->second = CreateGlobalVariable(var_id);
852 return emplace_result.first->second;
863 emplace_result.first->second = CreateFunction(func_id, comp_unit);
865 return emplace_result.first->second;
874 emplace_result.first->second = CreateCompileUnit(cci);
876 lldbassert(emplace_result.first->second);
877 return emplace_result.first->second;
1198 PdbGlobalSymId global(result.first, false);
tools/lldb/source/Plugins/SymbolFile/NativePDB/UdtRecordCompleter.cpp 218 return lhs.first < rhs.first;
218 return lhs.first < rhs.first;
tools/lldb/source/Plugins/UnwindAssembly/InstEmulation/UnwindAssemblyInstEmulation.cpp 163 if (it->second.first->GetOffset() != m_curr_row->GetOffset()) {
165 *newrow = *it->second.first;
195 std::make_shared<UnwindPlan::Row>(*saved_state.first);
tools/lldb/source/Symbol/ArmUnwindInfo.cpp 330 have_location_for_pc |= offset.first == dwarf_pc;
331 row->SetRegisterLocationToAtCFAPlusOffset(offset.first, offset.second - vsp,
tools/lldb/source/Symbol/ClangASTContext.cpp 2205 AddFieldToRecordType(type, field.first, field.second, lldb::eAccessPublic,
9448 if ((remaining_value & val.first) != val.first)
9448 if ((remaining_value & val.first) != val.first)
9450 remaining_value &= ~val.first;
tools/lldb/source/Symbol/ClangASTImporter.cpp 247 backup.first->setDeclContext(backup.second.decl_context);
248 backup.first->setLexicalDeclContext(backup.second.lexical_decl_context);
tools/lldb/source/Symbol/Symtab.cpp 330 RegisterBacklogEntry(record.first, record.second, class_contexts);
tools/lldb/source/Symbol/TypeMap.cpp 114 pos != end && pos->first == uid; ++pos) {
tools/lldb/source/Symbol/UnwindPlan.cpp 82 DataExtractor extractor(expr.data(), expr.size(), order_and_width->first,
242 DumpRegisterName(s, unwind_plan, thread, idx->first);
tools/lldb/source/Symbol/UnwindTable.cpp 169 pos->first);
tools/lldb/source/Target/Memory.cpp 66 AddrRange chunk_range(pos->first, pos->second->GetByteSize());
143 AddrRange chunk_range(pos->first, pos->second->GetByteSize());
201 if (pos->first != curr_addr)
375 for (PermissionsToBlockMap::iterator pos = range.first; pos != range.second;
tools/lldb/source/Target/PathMappingList.cpp 130 m_pairs[index].first.GetCString(),
134 s->Printf("%s -> %s", m_pairs[pair_index].first.GetCString(),
163 auto prefix = it.first.GetStringRef();
193 fixed.SetFile(it.first.GetStringRef(), FileSpec::Style::native);
214 llvm::StringRef prefix_ref = entry.first.GetStringRef();
277 if (pos->first == path)
290 if (pos->first == path)
299 path = m_pairs[idx].first;
313 if (pos->first == path)
tools/lldb/source/Target/RegisterNumber.cpp 53 m_kind_regnum_map[it.first] = it.second;
tools/lldb/source/Target/SectionLoadHistory.cpp 32 return m_stop_id_to_section_load_list.rbegin()->first;
54 pos->first == stop_id)
72 pos->first == stop_id) {
160 s.Printf("StopID = %u:\n", pos->first);
tools/lldb/source/Target/SectionLoadList.cpp 216 if (load_addr != pos->first && pos != m_addr_to_sect.begin())
218 const addr_t pos_load_addr = pos->first;
233 if (load_addr >= rpos->first) {
234 addr_t offset = load_addr - rpos->first;
254 s.Printf("addr = 0x%16.16" PRIx64 ", section = %p: ", pos->first,
tools/lldb/source/Target/StackFrame.cpp 1274 if (!base_and_offset.first) {
1357 if (!base_and_offset.first) {
1361 switch (base_and_offset.first->m_type) {
1364 if (target_sp->ResolveLoadAddress(base_and_offset.first->m_immediate +
1387 return GuessValueForRegisterAndOffset(base_and_offset.first->m_register,
tools/lldb/source/Target/Target.cpp 701 .first;
742 names.push_back(bp_name.first.AsCString());
tools/lldb/source/Target/ThreadPlanStepUntil.cpp 110 (uint64_t)(*m_until_points.begin()).first,
117 s->Printf("\n\t0x%" PRIx64 " (bp: %d)", (uint64_t)(*pos).first,
tools/lldb/source/Target/UnixSignals.cpp 164 return pos->first;
178 return (*m_signals.begin()).first;
191 return pos->first;
289 return it->first;
tools/lldb/source/Utility/Broadcaster.cpp 61 lldb::ListenerSP curr_listener_sp(it->first.lock());
78 pair.first->BroadcasterWillDestruct(&m_broadcaster);
129 if (pair.first == listener_sp) {
171 if (pair.first.get() == listener) {
234 if (unique && pair.first->PeekAtNextEventForBroadcasterWithType(
238 pair.first->AddEvent(event_sp);
341 available_bits &= ~((*iter).first.GetEventBits());
375 uint32_t iter_event_bits = (*iter).first.GetEventBits();
455 (*iter).first.GetEventBits());
tools/lldb/source/Utility/ConstString.cpp 89 .first;
106 StringPoolEntryType &entry = *map.try_emplace(demangled).first;
tools/lldb/source/Utility/Listener.cpp 64 Broadcaster::BroadcasterImplSP broadcaster_sp(pos->first.lock());
413 pos != end && pos->first.lock() == broadcaster_impl_sp; ++pos) {
tools/lldb/source/Utility/Reproducer.cpp 158 return e.first->getSecond().get();
tools/lldb/source/Utility/ReproducerInstrumentation.cpp 72 std::make_pair(m_replayers[RunID].first.get(), std::move(signature));
88 return m_ids[id].first;
tools/lldb/source/Utility/SelectHelper.cpp 109 const lldb::socket_t fd = pair.first;
179 const lldb::socket_t fd = pair.first;
235 const int fd = pair.first;
tools/lldb/source/Utility/StructuredData.cpp 80 StringRef key = KV.first;
101 std::string key = match.first.str();
163 s.attributeBegin(pair.first.AsCString());
tools/lldb/source/Utility/UserIDResolver.cpp 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/lldb-vscode.cpp 1603 auto request_pos = request_bps.find(pair.first);
1607 remove_lines.push_back(pair.first);
1629 old_src_bp_pos->second[pair.first] = std::move(pair.second);
tools/lldb/unittests/Host/FileSystemTest.cpp 103 if (isInPath(I->first)) {
113 if (isInPath(I->first)) {
tools/lldb/unittests/Process/POSIX/NativeProcessELFTest.cpp 42 offset = encoder.PutAddress(offset, pair.first);
tools/lldb/unittests/Symbol/PostfixExpressionTest.cpp 113 result.emplace_back(p.first, ASTPrinter::Print(p.second));
tools/lldb/unittests/SymbolFile/DWARF/DWARFASTParserClangTests.cpp 40 keys.push_back(it.first);
tools/lldb/unittests/Utility/FileSpecTest.cpp 156 FileSpec one(test.first, FileSpec::Style::windows);
172 FileSpec one(test.first, FileSpec::Style::posix);
186 FileSpec one(test.first, FileSpec::Style::posix);
232 SCOPED_TRACE(llvm::Twine("test.first = ") + test.first);
234 FileSpec(test.first, FileSpec::Style::posix).GetPath());
266 FileSpec(test.first, FileSpec::Style::windows).GetPath())
267 << "Original path: " << test.first;
tools/lldb/unittests/Utility/StringLexerTest.cpp 123 EXPECT_FALSE(l.NextIf({'\0', ' ', 'o'}).first);
126 EXPECT_TRUE(r.first);
129 EXPECT_FALSE(l.NextIf({'\0', ' ', 'f'}).first);
132 EXPECT_TRUE(r.first);
135 EXPECT_FALSE(l.NextIf({'\0', ' ', 'f'}).first);
138 EXPECT_TRUE(r.first);
tools/lldb/unittests/Utility/StructuredDataTest.cpp 29 StructuredData::String(P.first).Dump(S, pretty_print);
tools/lldb/unittests/tools/lldb-server/tests/MessageObjects.cpp 281 if (Elements.insert({Field, {""}}).first->second.size() != 1)
344 if (pairs.count(pair.first))
345 return make_parsing_error("{0}: Duplicate Key: {1}", caller, pair.first);
360 pairs[pair.first].push_back(pair.second);
tools/lldb/unittests/tools/lldb-server/tests/ThreadIdsInJstopinfoTest.cpp 47 unsigned long tid = stop_reply_pc.first;
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/llvm-ar/llvm-ar.cpp 1008 Line = Line.split(';').first;
1009 Line = Line.split('*').first;
tools/llvm-cfi-verify/lib/FileAnalysis.cpp 569 object::SymbolRef Sym(Addr.first, Object);
tools/llvm-cfi-verify/lib/GraphBuilder.cpp 86 printPairToDOT(Analysis, OS, KV.first, KV.second);
tools/llvm-cfi-verify/llvm-cfi-verify.cpp 240 outs() << " " << BlacklistFilename << ":" << KV.first << " affects "
tools/llvm-cov/CodeCoverage.cpp 240 if (sys::fs::equivalent(SourceFile, Files.first))
369 << "No profile record found for '" << HashMismatch.first << "'"
399 std::string RemapFrom = nativeWithTrailing(PathRemapping->first);
689 if (!(EquivPair.first.empty() && EquivPair.second.empty()))
910 StringRef File = FileFunc.first;
tools/llvm-cov/SourceCoverageViewHTML.cpp 569 errs() << "Highlighted line " << LineNo << ", " << Range.first << " -> ";
tools/llvm-cov/SourceCoverageViewText.cpp 140 errs() << "Highlighted line " << LineNumber << ", " << Range.first
tools/llvm-cxxdump/llvm-cxxdump.cpp 192 object::SymbolRef Sym = P.first;
344 StringRef VFTableName = VFTableEntry.first.first;
344 StringRef VFTableName = VFTableEntry.first.first;
345 uint64_t Offset = VFTableEntry.first.second;
350 StringRef VBTableName = VBTable.first;
358 StringRef COLName = COLPair.first;
368 StringRef CHDName = CHDPair.first;
376 StringRef BCAName = BCAEntry.first.first;
376 StringRef BCAName = BCAEntry.first.first;
377 uint64_t Offset = BCAEntry.first.second;
382 StringRef BCDName = BCDPair.first;
394 StringRef TDName = TDPair.first;
404 StringRef TIName = TIPair.first;
423 StringRef CTAName = CTAPair.first;
435 StringRef CTName = CTPair.first;
458 StringRef VTTName = VTTPair.first.first;
458 StringRef VTTName = VTTPair.first.first;
459 uint64_t VTTOffset = VTTPair.first.second;
464 StringRef TIName = TIPair.first;
476 if (!SymDone && (DataDone || VTableSymI->first < VTableDataI->first)) {
476 if (!SymDone && (DataDone || VTableSymI->first < VTableDataI->first)) {
477 StringRef VTableName = VTableSymI->first.first;
477 StringRef VTableName = VTableSymI->first.first;
478 uint64_t Offset = VTableSymI->first.second;
486 if (!DataDone && (SymDone || VTableDataI->first < VTableSymI->first)) {
486 if (!DataDone && (SymDone || VTableDataI->first < VTableSymI->first)) {
487 StringRef VTableName = VTableDataI->first.first;
487 StringRef VTableName = VTableDataI->first.first;
488 uint64_t Offset = VTableDataI->first.second;
tools/llvm-cxxfilt/llvm-cxxfilt.cpp 128 Result += demangle(OS, Word.first) + Word.second.str();
tools/llvm-cxxmap/llvm-cxxmap.cpp 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)
49 Instruction *DiffLogBuilder::getLeft(unsigned I) const { return Diff[I].first; }
tools/llvm-diff/DifferenceEngine.cpp 142 return fde.getUnprocPredCount(Old.first)
143 < fde.getUnprocPredCount(New.first);
186 diff(Pair.first, Pair.second);
357 Engine.logf("left switch has extra case %l") << I->first;
730 diff(I->first, I->second);
tools/llvm-dwp/DWPStringPool.h 51 return Pair.first->second;
tools/llvm-dwp/llvm-dwp.cpp 228 auto &Entry = P.first->second;
307 auto S = P.first;
311 assert(S != IndexEntries.begin()[Buckets[H] - 1].first &&
327 Out.EmitIntValue(I ? IndexEntries.begin()[I - 1].first : 0, 8);
448 MCSection *OutSection = SectionPair->second.first;
470 std::string("Duplicate DWO ID (") + utohexstr(PrevE.first) + ") in " +
576 return buildDuplicateError(*P.first, ID, "");
577 P.first->second.Name = ID.Name;
578 P.first->second.DWOName = ID.DWOName;
603 return buildDuplicateError(*P.first, ID, Input);
604 auto &NewEntry = P.first->second;
tools/llvm-exegesis/lib/Analysis.cpp 417 .getProcResource(Pressure.first)
tools/llvm-exegesis/lib/Clustering.cpp 266 const OpcodeAndConfig &Key = OpcodeConfigToClusterID.first;
tools/llvm-exegesis/lib/SchedClassResolution.cpp 289 return WPR.first == ProcResIdx;
tools/llvm-extract/llvm-extract.cpp 259 Function *F = M->getFunction(BBInfo.first);
262 << BBInfo.first << "'!\n";
tools/llvm-jitlink/llvm-jitlink.cpp 272 auto &Prot = KV.first;
325 Blocks[KV.first] = std::move(SegMem);
tools/llvm-lipo/llvm-lipo.cpp 346 Twine(1 << Entry.first->second) + ", " +
447 .first;
591 reportError(Entry.first->second->getFileName() + " and " +
759 Entry.first->second.getBinary()->getFileName() + ", " +
tools/llvm-lto/llvm-lto.cpp 437 OldPrefix = Split.first.str();
tools/llvm-lto2/llvm-lto2.cpp 300 I = CommandLineResolutions.find({F, SplitName.first});
325 << UnusedRes.first.first << ',' << UnusedRes.first.second
325 << UnusedRes.first.first << ',' << UnusedRes.first.second
325 << UnusedRes.first.first << ',' << UnusedRes.first.second
tools/llvm-mc/Disassembler.cpp 39 ArrayRef<uint8_t> Data(Bytes.first.data(), Bytes.first.size());
39 ArrayRef<uint8_t> Data(Bytes.first.data(), Bytes.first.size());
45 for (Index = 0; Index < Bytes.first.size(); Index += Size) {
120 ByteArray.first.clear();
125 ByteArray.first.push_back(ByteVal);
170 ByteArray.first.clear();
196 if (!ByteArray.first.empty())
tools/llvm-mc/llvm-mc.cpp 262 auto Sym = Pair.first;
402 Ctx.addDebugPrefixMapEntry(KV.first, KV.second);
tools/llvm-mca/Views/BottleneckAnalysis.cpp 56 if (U.second && IPI.find(U.first) != IPI.end())
73 const ResourceRef &RR = Use.first;
74 unsigned Index = ProcResID2ResourceUsersIndex[RR.first];
521 addResourceDep(U.first % Source.size(), To, Current, U.second + Cycles);
tools/llvm-mca/Views/DispatchStatistics.cpp 42 TempStream << " " << Entry.first << ", " << Entry.second
tools/llvm-mca/Views/ResourcePressureView.cpp 58 const ResourceRef &RR = Use.first;
59 assert(Resource2VecIndex.find(RR.first) != Resource2VecIndex.end());
60 unsigned R2VIndex = Resource2VecIndex[RR.first];
tools/llvm-mca/Views/RetireControlUnitStatistics.cpp 63 TempStream << " " << Entry.first;
64 if (Entry.first < 10)
tools/llvm-mca/Views/SchedulerStatistics.cpp 111 unsigned NumIssued = Entry.first;
112 if (NumIssued == It->first && HasColors)
tools/llvm-mca/Views/SummaryView.cpp 59 unsigned ProcResID = ResIdx2ProcResID[getResourceStateIndex(RU.first)];
tools/llvm-mca/Views/TimelineView.cpp 50 if (!BufferInfo.first || BufferInfo.second > MCDesc.BufferSize) {
51 BufferInfo.first = Buffer;
tools/llvm-objcopy/CopyConfig.cpp 140 SR.OriginalName = Old2New.first;
165 if (Split.first.empty())
174 return std::make_pair(Split.first, NewAlign);
186 SFU.Name = Section2Flags.first;
277 auto TrimmedLine = Line.split('#').first.trim();
334 StringRef TrimmedLine = Lines[LineNo].split('#').first.trim();
344 SymbolsToRename.insert({Pair.first, NewName});
530 Old2New.first.str().c_str());
553 Config.SetSectionAlignment[NameAndAlign->first] = NameAndAlign->second;
tools/llvm-objcopy/ELF/ELFObjcopy.cpp 693 StringRef SecName = SecPair.first;
711 StringRef SecName = SecPair.first;
tools/llvm-objcopy/MachO/MachOWriter.cpp 469 return LHS.first < RHS.first;
469 return LHS.first < RHS.first;
tools/llvm-objdump/MachODump.cpp 298 return j.first >= i.first && j.first < i.first + Length;
298 return j.first >= i.first && j.first < i.first + Length;
298 return j.first >= i.first && j.first < i.first + Length;
298 return j.first >= i.first && j.first < i.first + Length;
421 (PC == (DTI->first + Length - 1)) && (Length & 1))
1512 return P.first == i;
1662 return P.first == i;
1743 DumpSegName = DumpSegSectName.first;
1747 DumpSectName = DumpSegSectName.first;
7850 Addend = Addr - Sym->first;
tools/llvm-objdump/llvm-objdump.cpp 753 auto HeadTail = PacketBundle.first.split('\n');
771 while (!HeadTail.first.empty()) {
780 auto Duplex = HeadTail.first.split('\v');
782 OS << Duplex.first;
787 Inst = HeadTail.first;
790 if (HeadTail.first.empty())
963 SymbolRef Symbol(PltEntry.first, ElfObj);
1037 return Val.first <= Address;
1187 return O.first <= VA;
1446 return O.first <= Target;
1634 StringRef SecName = unwrapOrError(P.first.getName(), Obj->getFileName());
tools/llvm-opt-report/OptReport.cpp 256 SmallString<128> FileName(FI.first);
315 int Col = CI.first;
415 OS << " | " << std::string(J.first - 1, ' ') << "^\n";
432 UniqueLIs[FLII.second].insert(FLII.first);
tools/llvm-pdbutil/DumpOutputStyle.cpp 340 std::string KindName = formatModuleDetailKind(Kind(K.first));
720 formatTypeLeafKind(TypeLeafKind(K.first)), K.second.Count,
764 StringRef Label = getUdtStatLabel(Stat.first);
873 StringRef Label = getUdtStatLabel(Stat.first);
1351 if (auto EC = codeview::visitTypeRecord(Dep.second, Dep.first, V))
1353 Dep.first, toString(std::move(EC)));
1515 auto ExpectedStr = Strings.getStringForID(A.first);
1520 P.formatLine("unknown str id ({0}) -> {1}", A.first, TI);
1719 if (auto E = Visitor.visitSymbolRecord(Result.second, Result.first))
tools/llvm-pdbutil/DumpOutputStyle.h 58 Iter.first->second.update(RecordSize);
tools/llvm-profdata/llvm-profdata.cpp 156 if (Parts.first.empty() || Parts.second.empty() ||
358 warn(toString(std::move(ErrorPair.first)), ErrorPair.second);
389 Result.addBodySamples(BodySample.first.LineOffset,
390 BodySample.first.Discriminator,
393 Result.addCalledTargetSamples(BodySample.first.LineOffset,
394 BodySample.first.Discriminator,
400 Result.functionSamplesAt(CallsiteSamples.first);
977 OS << " " << hotfunc.first << ", max count = " << hotfunc.second << "\n";
tools/llvm-rc/ResourceFileWriter.cpp 480 RETURN_IF_ERROR(checkNumberFits<uint16_t>(String.first, "String ID"));
481 uint16_t BundleID = String.first >> 4;
492 Iter = EmplaceResult.first;
496 insertStringIntoBundle(Iter->second, String.first, String.second));
1289 Res.setName(Key.first + 1);
tools/llvm-rc/ResourceScriptCppFilter.cpp 90 Line = Line.rsplit('"').first;
tools/llvm-rc/ResourceScriptStmt.cpp 122 OS << " " << String.first << " => " << String.second << "\n";
tools/llvm-readobj/ELFDumper.cpp 4921 const SectionRef &StackSizesSec = StackSizeMapEntry.first;
tools/llvm-readobj/MachODumper.cpp 884 W.printString("Value", Split.first);
tools/llvm-readobj/ObjDumper.cpp 71 createError(formatv("could not find section '{0}'", S.first).str()),
77 createError(formatv("could not find section {0}", S.first).str()),
tools/llvm-rtdyld/llvm-rtdyld.cpp 422 object::SymbolRef Sym = P.first;
474 outs() << " Line info @ " << D.first - Addr << ": "
697 Alloc.first)
700 NextSectionAddr = Alloc.first + Alloc.second + TargetSectionSep;
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));
162 if (ThreadStack.back().first == Record.FuncId) {
164 recordLatency(Top.first, diff(Top.second, Record.TSC));
176 return E.first == Record.FuncId;
211 recordLatency(E.first, diff(E.second, Record.TSC));
241 R.Min = *MinMax.first;
276 const auto &FuncId = FT.first;
454 errs() << "Thread ID: " << ThreadStack.first << "\n";
462 << FuncIdHelper.SymbolOrNumber(Entry.first) << '\n';
tools/llvm-xray/xray-converter.cpp 191 if (map_iter.first != TId)
353 R"("{0}" : { "name" : "{1}")", map_iter.first,
tools/llvm-xray/xray-graph-diff.cpp 236 auto &EdgeTailID = E.first.first;
236 auto &EdgeTailID = E.first.first;
237 auto &EdgeHeadID = E.first.second;
336 const auto &VertexId = V.first;
381 VertexNo[V.first] = i++;
392 const auto &HeadId = E.first.first;
392 const auto &HeadId = E.first.first;
393 const auto &TailId = E.first.second;
404 const auto &VertexId = V.first;
tools/llvm-xray/xray-graph.cpp 295 if (V.first != 0) {
296 for (auto &E : G.inEdges(V.first)) {
301 getStats(TempTimings.begin(), TempTimings.end(), G[V.first].S);
302 updateMaxStats(G[V.first].S, G.GraphVertexMax);
393 OS << "F" << E.first.first << " -> "
393 OS << "F" << E.first.first << " -> "
394 << "F" << E.first.second << " [label=\"" << S.getString(ET) << "\"";
405 if (V.first == 0)
407 OS << "F" << V.first << " [label=\"" << (VT != StatType::NONE ? "{" : "")
452 errs() << "Thread ID: " << ThreadStack.first << "\n";
tools/llvm-xray/xray-stacks.cpp 386 auto I = find_if(Top.first->Callees,
388 if (I == Top.first->Callees.end()) {
391 auto N = createTrieNode(R.TId, R.FuncId, Top.first);
392 Top.first->Callees.emplace_back(N);
420 return E.first->FuncId == R.FuncId;
432 E.first->ExtraData.IntermediateDurations.push_back(
436 Deepest.first->ExtraData.IntermediateDurations.push_back(
439 Deepest.first->ExtraData.TerminalDurations.push_back(
484 OS << "Thread " << iter.first << ":\n";
495 uint32_t threadId = iter.first;
663 printStack(OS, P.first, FN);
669 printStack(OS, P.first, FN);
tools/obj2yaml/dwarf2yaml.cpp 55 Y.DebugStrings.push_back(SymbolPair.first);
tools/obj2yaml/elf2yaml.cpp 109 Ret = (Name + " [" + Twine(++It.first->second) + "]").str();
141 (Name + " [" + Twine(++It.first->second) + "]").str();
tools/obj2yaml/macho2yaml.cpp 495 LEData.StringTable.push_back(SymbolPair.first);
tools/obj2yaml/wasm2yaml.cpp 141 Producer.Name = E.first;
147 Producer.Name = E.first;
153 Producer.Name = E.first;
tools/opt/Debugify.cpp 410 StringRef Pass = Entry.first;
tools/polly/include/polly/ScopInfo.h 2396 MinMaxAliasGroups.back().first = MinMaxAccessesReadWrite;
tools/polly/include/polly/ScopPass.h 220 Worklist.insert(S.first);
tools/polly/lib/Analysis/DependenceInfo.cpp 926 return *Inserted.first->second;
940 assert((It.first && It.second) && "Invalid Scop or Dependence object!\n");
tools/polly/lib/Analysis/PolyhedralInfo.cpp 103 Region *R = It.first;
tools/polly/lib/Analysis/ScopBuilder.cpp 349 return PWAC.first.release();
798 isl::set UnboundedCtx = Parts.first.params();
2160 bool IsMain = (MainInst ? MainLeader == Instructions.first : Count == 0);
2700 isl::map LoadAccs = CandidatePair.first->getAccessRelation();
2714 if (MA == CandidatePair.first || MA == CandidatePair.second)
2731 dyn_cast<const LoadInst>(CandidatePair.first->getAccessInstruction());
2737 CandidatePair.first->markAsReductionLike(RT);
3652 ScopStmt *GlobalReadStmt = GlobalReadPair.first;
3760 ORE.emit(OptimizationRemarkAnalysis(DEBUG_TYPE, "ScopEntry", Beg, P.first)
3780 ORE.emit(OptimizationRemarkAnalysis(DEBUG_TYPE, "ScopEnd", End, P.first)
tools/polly/lib/Analysis/ScopDetection.cpp 411 DetectionContext &Context = It.first->second;
936 Context.Accesses[BasePointer].front().first, BaseValue);
945 const Instruction *Insn = Pair.first;
973 const Instruction *Insn = Pair.first;
1042 auto *BasePointer = Pair.first;
1399 DetectionContext &Context = It.first->second;
1409 DetectionContextMap.erase(It.first);
1428 DetectionContextMap.erase(It.first);
1468 DetectionContext &Context = It.first->second;
1737 CurrBB = DFSStack.top().first;
tools/polly/lib/Analysis/ScopDetectionDiagnostic.cpp 115 Todo.push_back(P.first);
140 OptimizationRemarkMissed(DEBUG_TYPE, "RejectionErrors", Begin, P.first)
162 OptimizationRemarkMissed(DEBUG_TYPE, "InvalidScopEnd", End, P.first)
tools/polly/lib/Analysis/ScopInfo.cpp 984 return PWAC.first;
2168 for (const MinMaxAccessTy &MMANonReadOnly : Pair.first) {
2169 OS << " <" << MMANonReadOnly.first << ", " << MMANonReadOnly.second
2177 OS << " <" << MMAReadOnly.first << ", " << MMAReadOnly.second << ">";
2178 for (const MinMaxAccessTy &MMANonReadOnly : Pair.first) {
2179 OS << " <" << MMANonReadOnly.first << ", " << MMANonReadOnly.second
2250 if (PWAC.first) {
2278 return PWAC.first;
tools/polly/lib/Analysis/ScopPass.cpp 126 auto *OuterAnalysisID = InvPair.first;
tools/polly/lib/CodeGen/BlockGenerators.cpp 408 BBMap.erase(Pair.first);
782 return p.first == Stmt.getBasicBlock();
874 Instruction *EscapeInst = EscapeMapping.first;
877 Value *ScalarAddr = EscapeMappingValue.first;
1516 ValueMapT &RegionMap = Inserted.first->second;
1528 addOperandToPHI(Stmt, PHINodePair.first, PHINodePair.second, BB, LTS);
1645 BasicBlock *OrigIncomingBlock = Pair.first;
tools/polly/lib/CodeGen/IRBuilder.cpp 86 if (Array->getBasePtr() == AliasScopePair.first)
tools/polly/lib/CodeGen/IslAst.cpp 162 str += MemoryAccess::getReductionOperatorStr(ReductionClause.first);
246 NodeInfo->BrokenReductions.insert(MaRedPair.first);
352 isl::pw_multi_aff AFirst = It0->first;
354 isl::pw_multi_aff BFirst = It1->first;
431 auto &MinMaxReadWrite = MinMaxAccessPair.first;
tools/polly/lib/CodeGen/IslNodeBuilder.cpp 365 IDToValue[I.first] = NewValues[I.second];
370 if (Inserted.count(I.first))
373 ValueMap[I.first] = I.second;
711 NewValuesReverse[P.second] = P.first;
tools/polly/lib/Support/SCEVAffinator.cpp 54 isl_pw_aff_foreach_piece(PWAC.first.get(), addNumBasicSets, &NumBasicSets);
70 PWAC0.first = isl::manage(Fn(PWAC0.first.release(), PWAC1.first.release()));
70 PWAC0.first = isl::manage(Fn(PWAC0.first.release(), PWAC1.first.release()));
70 PWAC0.first = isl::manage(Fn(PWAC0.first.release(), PWAC1.first.release()));
90 auto *NonNegDom = isl_pw_aff_nonneg_set(PWAC.first.copy());
92 isl_pw_aff_intersect_domain(PWAC.first.copy(), isl_set_copy(NonNegDom));
94 PWAC.first = isl::manage(isl_pw_aff_union_add(
95 NonNegPWA, isl_pw_aff_add(PWAC.first.release(), ExpPWA)));
99 auto *NegPWA = isl_pw_aff_neg(PWAC.first.copy());
137 isl::pw_aff PWAMod = addModuloSemantic(PWAC.first, Expr->getType());
139 isl::set NotEqualSet = PWAC.first.ne_set(PWAMod);
169 auto *AddRec = dyn_cast<SCEVAddRecExpr>(CachedPair.first.first);
169 auto *AddRec = dyn_cast<SCEVAddRecExpr>(CachedPair.first.first);
194 if (PWAC.first)
198 auto *Factor = ConstantAndLeftOverPair.first;
220 PWAC.first = addModuloSemantic(PWAC.first, Expr->getType());
220 PWAC.first = addModuloSemantic(PWAC.first, Expr->getType());
227 if (computeModuloForExpr(Key.first))
228 PWAC.first = addModuloSemantic(PWAC.first, Expr->getType());
228 PWAC.first = addModuloSemantic(PWAC.first, Expr->getType());
233 PWAC.first = PWAC.first.coalesce();
233 PWAC.first = PWAC.first.coalesce();
234 if (!computeModuloForExpr(Key.first))
235 PWAC = checkForWrapping(Key.first, PWAC);
277 auto *Dom = OpPWAC.first.domain().release();
280 isl_pw_aff_ge_set(OpPWAC.first.copy(), isl_pw_aff_copy(ExpPWA));
282 isl_pw_aff_lt_set(OpPWAC.first.copy(), isl_pw_aff_neg(ExpPWA));
407 Step.first = Step.first.mul(isl::manage(LPwAff));
407 Step.first = Step.first.mul(isl::manage(LPwAff));
479 auto *DivisorDom = DivisorPWAC.first.domain().release();
481 DivisorPWAC.first = DivisorPWAC.first.add(isl::manage(WidthExpPWA));
481 DivisorPWAC.first = DivisorPWAC.first.add(isl::manage(WidthExpPWA));
491 DividendPWAC.first = DividendPWAC.first.floor();
491 DividendPWAC.first = DividendPWAC.first.floor();
tools/polly/lib/Support/SCEVValidator.cpp 727 return std::make_pair(StepPair.first, LeftOverAddRec);
735 auto *Factor = Op0Pair.first;
746 if (Factor == OpUPair.first)
748 else if (Factor == SE.getNegativeSCEV(OpUPair.first))
tools/polly/lib/Support/VirtualInstruction.cpp 358 S, Stmt, LI->getLoopFor(Incoming.first), Incoming.second, true);
tools/polly/lib/Transform/DeLICM.cpp 816 LI->getLoopFor(Incoming[0].first));
tools/sancov/sancov.cpp 310 std::string FileName = P.first;
318 W.attributeObject(P.first, [&] {
321 std::string FunctionName = P.first;
976 OS << stripPathPrefix(P.first.FileName) << ":" << P.second.first << " "
976 OS << stripPathPrefix(P.first.FileName) << ":" << P.second.first << " "
977 << P.first.FunctionName << "\n";
1110 if (findSanitizerCovFunctions(Pair.first).empty()) {
1112 << "WARNING: Ignoring " << Pair.first
1121 Coverages.push_back(symbolize(*DataOrError.get(), Pair.first));
unittests/ADT/APIntTest.cpp 2600 APInt A(64, X.first);
2606 APInt A(64, X.first);
unittests/ADT/BitVectorTest.cpp 822 V.set(R.first, R.second);
unittests/ADT/DenseMapTest.cpp 145 EXPECT_EQ(this->getKey(), it->first);
313 visited[visitedIndex[it->first]] = true;
590 EXPECT_EQ(Try1.first, Try2.first);
590 EXPECT_EQ(Try1.first, Try2.first);
unittests/ADT/FallibleIteratorTest.cpp 46 Item &operator*() { return C[Idx].first; }
48 const Item &operator*() const { return C[Idx].first; }
unittests/ADT/HashingTest.cpp 179 I = code_to_size.insert(std::make_pair(code, Idx)).first;
187 I = code_to_size.insert(std::make_pair(code, Idx)).first;
195 I = code_to_size.insert(std::make_pair(code, Idx)).first;
203 I = code_to_size.insert(std::make_pair(code, Idx)).first;
unittests/ADT/ImmutableMapTest.cpp 45 EXPECT_EQ(5, S2.getMaxElement()->first);
unittests/ADT/MapVectorTest.cpp 21 ASSERT_EQ(R.first, MV1.begin());
22 EXPECT_EQ(R.first->first, 1);
22 EXPECT_EQ(R.first->first, 1);
23 EXPECT_EQ(R.first->second, 2);
37 EXPECT_EQ(I->first, 1);
46 ASSERT_EQ(R.first, MV.begin());
47 EXPECT_EQ(R.first->first, 1);
47 EXPECT_EQ(R.first->first, 1);
48 EXPECT_EQ(R.first->second, 2);
52 ASSERT_EQ(R.first, MV.begin());
53 EXPECT_EQ(R.first->first, 1);
53 EXPECT_EQ(R.first->first, 1);
54 EXPECT_EQ(R.first->second, 2);
58 ASSERT_NE(R.first, MV.end());
59 EXPECT_EQ(R.first->first, 4);
59 EXPECT_EQ(R.first->first, 4);
60 EXPECT_EQ(R.first->second, 5);
72 ASSERT_NE(R.first, MV.end());
73 EXPECT_EQ(R.first->first, 4);
73 EXPECT_EQ(R.first->first, 4);
74 EXPECT_EQ(R.first->second, 7);
139 ASSERT_EQ(P.first, count);
145 ASSERT_EQ(P.first, count);
177 ASSERT_EQ(R.first, MV.begin());
178 EXPECT_EQ(R.first->first, 1);
178 EXPECT_EQ(R.first->first, 1);
179 EXPECT_EQ(R.first->second, 2);
184 ASSERT_EQ(R.first, MV.begin());
185 EXPECT_EQ(R.first->first, 1);
185 EXPECT_EQ(R.first->first, 1);
186 EXPECT_EQ(R.first->second, 2);
203 ASSERT_EQ(R.first, MV.begin());
204 EXPECT_EQ(R.first->first, 1);
204 EXPECT_EQ(R.first->first, 1);
205 EXPECT_EQ(R.first->second, 2);
209 ASSERT_EQ(R.first, MV.begin());
210 EXPECT_EQ(R.first->first, 1);
210 EXPECT_EQ(R.first->first, 1);
211 EXPECT_EQ(R.first->second, 2);
215 ASSERT_NE(R.first, MV.end());
216 EXPECT_EQ(R.first->first, 4);
216 EXPECT_EQ(R.first->first, 4);
217 EXPECT_EQ(R.first->second, 5);
229 ASSERT_NE(R.first, MV.end());
230 EXPECT_EQ(R.first->first, 4);
230 EXPECT_EQ(R.first->first, 4);
231 EXPECT_EQ(R.first->second, 7);
296 ASSERT_EQ(P.first, count);
302 ASSERT_EQ(P.first, count);
321 ASSERT_EQ(R.first, MV.begin());
322 EXPECT_EQ(R.first->first, 1);
322 EXPECT_EQ(R.first->first, 1);
323 EXPECT_EQ(R.first->second, 2);
327 ASSERT_EQ(R.first, MV.begin());
328 EXPECT_EQ(R.first->first, 1);
328 EXPECT_EQ(R.first->first, 1);
329 EXPECT_EQ(R.first->second, 2);
333 ASSERT_NE(R.first, MV.end());
334 EXPECT_EQ(R.first->first, 4);
334 EXPECT_EQ(R.first->first, 4);
335 EXPECT_EQ(R.first->second, 5);
347 ASSERT_NE(R.first, MV.end());
348 EXPECT_EQ(R.first->first, 4);
348 EXPECT_EQ(R.first->first, 4);
349 EXPECT_EQ(R.first->second, 7);
414 ASSERT_EQ(P.first, count);
420 ASSERT_EQ(P.first, count);
unittests/ADT/SCCIteratorTest.cpp 57 NodesInThisSCC.AddNode(SCC[i]->first);
unittests/ADT/SmallPtrSetTest.cpp 289 EXPECT_EQ(&I, *S.insert(&I).first);
unittests/ADT/SparseMultiSetTest.cpp 173 USet::iterator B = RangePair.first;
unittests/ADT/SparseSetTest.cpp 47 EXPECT_TRUE(IP.first == Set.begin());
63 EXPECT_TRUE(IP.first == Set.begin());
107 EXPECT_TRUE(IP.first == Set.begin() + 1);
unittests/ADT/StatisticTest.cpp 27 if (S.first == "Counter")
29 if (S.first == "Counter2")
113 EXPECT_EQ(S1->first, "Counter");
116 EXPECT_EQ(S2->first, "Counter2");
158 EXPECT_EQ(S1->first, "Counter");
161 EXPECT_EQ(S2->first, "Counter2");
unittests/ADT/StringMapTest.cpp 276 t.insert(std::make_pair("abcdef", 42)).first;
291 EXPECT_EQ(1, try1.first->second.v);
292 EXPECT_EQ(1, try1.first->second.move);
296 EXPECT_EQ(2, try2.first->second.v);
297 EXPECT_EQ(2, try1.first->second.move);
299 EXPECT_EQ(try1.first, try2.first);
299 EXPECT_EQ(try1.first, try2.first);
300 EXPECT_EQ(0, try1.first->second.copy);
unittests/ADT/StringRefTest.cpp 28 OS << "(" << P.first << ", " << P.second << ")";
unittests/ADT/TestGraph.h 112 Nodes[i].first = i;
225 return ChildIterator(Parent - Parent->first, Parent->second);
230 return ChildIterator(Parent - Parent->first, NodeSubset());
unittests/Analysis/DivergenceAnalysisTest.cpp 291 auto *DivVal = ItCase.first;
unittests/Analysis/ValueTrackingTest.cpp 947 EXPECT_EQ(GetParam().first, S.str());
unittests/CodeGen/DIEHashTest.cpp 34 *Pool.insert(std::make_pair(S, Entry)).first, Entry.isIndexed()));
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)
unittests/DebugInfo/GSYM/GSYMTest.cpp 68 EXPECT_EQ(R.first->second, Index1);
71 EXPECT_EQ(R.first->second, Index1);
74 EXPECT_EQ(R.first->second, Index2);
77 EXPECT_EQ(R.first->second, Index2);
unittests/DebugInfo/PDB/PDBApiTest.cpp 449 EXPECT_EQ(item->first == Tag, llvm::isa<ExpectedType>(*item->second));
456 if (item->first == PDB_SymType::None || item->first >= PDB_SymType::Max)
456 if (item->first == PDB_SymType::None || item->first >= PDB_SymType::Max)
unittests/ExecutionEngine/JITLink/JITLinkTestCommon.cpp 225 if (OpIdx >= InstAndSize->first.getNumOperands())
229 auto &Op = InstAndSize->first.getOperand(OpIdx);
unittests/ExecutionEngine/Orc/LegacyAPIInteropTest.cpp 31 Result.insert(KV.first);
unittests/ExecutionEngine/Orc/RPCUtilsTest.cpp 172 DummyRPCEndpoint Server(*Channels.first);
178 DummyRPCEndpoint Client(*Channels.first);
222 EXPECT_EQ(Channels.first->SendCalls, 2U)
233 DummyRPCEndpoint Client(*Channels.first);
278 DummyRPCEndpoint Client(*Channels.first);
323 DummyRPCEndpoint Client(*Channels.first);
369 DummyRPCEndpoint Client(*Channels.first);
420 DummyRPCEndpoint Client(*Channels.first);
460 DummyRPCEndpoint Client(*Channels.first);
532 DummyRPCEndpoint Client(*Channels.first);
575 DummyRPCEndpoint Client(*Channels.first);
620 DummyRPCEndpoint Client(*Channels.first);
649 DummyRPCEndpoint Client(*Channels.first);
684 DummyRPCEndpoint Client(*Channels.first);
716 DummyRPCEndpoint Client(*Channels.first);
752 DummyRPCEndpoint Client(*Channels.first);
834 DummyRPCEndpoint Client(*Channels.first);
unittests/ExecutionEngine/Orc/RemoteObjectLayerTest.cpp 129 RPCEndpoint ClientEP(*Channels.first, true);
183 RPCEndpoint ClientEP(*Channels.first, true);
235 RPCEndpoint ClientEP(*Channels.first, true);
285 RPCEndpoint ClientEP(*Channels.first, true);
341 RPCEndpoint ClientEP(*Channels.first, true);
423 RPCEndpoint ClientEP(*Channels.first, true);
498 RPCEndpoint ClientEP(*Channels.first, true);
549 RPCEndpoint ClientEP(*Channels.first, true);
unittests/IR/MetadataTest.cpp 2714 EXPECT_EQ(LLVMContext::MD_dbg, MDs[0].first);
2715 EXPECT_EQ(LLVMContext::MD_prof, MDs[1].first);
2716 EXPECT_EQ(Context.getMDKindID("other1"), MDs[2].first);
2717 EXPECT_EQ(Context.getMDKindID("other2"), MDs[3].first);
unittests/IR/ValueMapTest.cpp 89 EXPECT_EQ(this->AddV.get(), InsertResult1.first->first);
90 EXPECT_EQ(3, InsertResult1.first->second);
95 EXPECT_EQ(this->AddV.get(), InsertResult2.first->first);
96 EXPECT_EQ(3, InsertResult2.first->second);
100 VM.erase(InsertResult2.first);
unittests/ProfileData/CoverageMappingTest.cpp 141 ProfileWriter.setOutputSparse(GetParam().first);
194 FileIDs[E.second] = E.first;
unittests/Support/BinaryStreamTest.cpp 449 ASSERT_EQ(Pairs[0].first, Iter->first);
449 ASSERT_EQ(Pairs[0].first, Iter->first);
452 ASSERT_EQ(Pairs[1].first, Iter->first);
452 ASSERT_EQ(Pairs[1].first, Iter->first);
unittests/Support/JSONTest.cpp 216 EXPECT_FALSE(isUTF8(Invalid.first)) << Invalid.first;
216 EXPECT_FALSE(isUTF8(Invalid.first)) << Invalid.first;
217 EXPECT_EQ(fixUTF8(Invalid.first), Invalid.second);
unittests/Support/Path.cpp 287 SCOPED_TRACE(Path.first);
288 StringRef LastComponent = *path::rbegin(Path.first, Path.second);
300 SCOPED_TRACE(Path.first);
301 StringRef LastComponent = *path::rbegin(Path.first, Path.second);
unittests/Support/ReverseIterationTest.cpp 49 ASSERT_EQ(std::get<0>(Tuple).first, std::get<1>(Tuple));
54 ASSERT_EQ(iter->first, IterKeys[i]);
unittests/Support/ScaledNumberTest.cpp 21 ScaledPair(const std::pair<UIntT, int16_t> &F) : D(F.first), S(F.second) {}
unittests/Support/TargetParserTest.cpp 595 ARM::getExtensionFeatures(E.first, Features);
603 ARM::getExtensionFeatures(~E.first, Features);
unittests/Support/VirtualFileSystemTest.cpp 109 if (isInPath(I->first)) {
119 if (isInPath(I->first)) {
unittests/TextAPI/TextStubV4Tests.cpp 214 File.addUUID(uuids[0].first, uuids[0].second);
215 File.addUUID(uuids[1].first, uuids[1].second);
unittests/XRay/GraphTest.cpp 77 [&](const VVT &VV) { return VV.first == u; }));
82 EXPECT_EQ(1u, V.count(VVT.first));
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),
102 auto Pred = [&](const EVT &EV) { return EV.first == u; };
109 EXPECT_EQ(1u, E.count(EV.first));
110 EXPECT_EQ(VA[EV.first.first] * VA[EV.first.second] *
110 EXPECT_EQ(VA[EV.first.first] * VA[EV.first.second] *
110 EXPECT_EQ(VA[EV.first.first] * VA[EV.first.second] *
111 ((EV.first.first > EV.first.second) ? 2 : 1),
111 ((EV.first.first > EV.first.second) ? 2 : 1),
111 ((EV.first.first > EV.first.second) ? 2 : 1),
113 const auto &IE = G.inEdges(EV.first.second);
114 const auto &OE = G.outEdges(EV.first.first);
114 const auto &OE = G.outEdges(EV.first.first);
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(),
122 [&](const EVT &EVI) { return EVI.first == EV.first; });
122 [&](const EVT &EVI) { return EVI.first == EV.first; });
123 EXPECT_NE(G.inEdges(EV.first.second).end(), It);
127 G.inEdges(EV.first.first).begin(), G.inEdges(EV.first.first).end(),
127 G.inEdges(EV.first.first).begin(), G.inEdges(EV.first.first).end(),
127 G.inEdges(EV.first.first).begin(), G.inEdges(EV.first.first).end(),
127 G.inEdges(EV.first.first).begin(), G.inEdges(EV.first.first).end(),
128 [&](const EVT &EVI) { return EVI.first == EV.first; });
128 [&](const EVT &EVI) { return EVI.first == EV.first; });
129 EXPECT_EQ(G.inEdges(EV.first.first).end(), It);
129 EXPECT_EQ(G.inEdges(EV.first.first).end(), It);
133 std::find_if(G.outEdges(EV.first.second).begin(),
134 G.outEdges(EV.first.second).end(),
135 [&](const EVT &EVI) { return EVI.first == EV.first; });
135 [&](const EVT &EVI) { return EVI.first == EV.first; });
136 EXPECT_EQ(G.outEdges(EV.first.second).end(), It);
140 G.outEdges(EV.first.first).begin(), G.outEdges(EV.first.first).end(),
140 G.outEdges(EV.first.first).begin(), G.outEdges(EV.first.first).end(),
140 G.outEdges(EV.first.first).begin(), G.outEdges(EV.first.first).end(),
140 G.outEdges(EV.first.first).begin(), G.outEdges(EV.first.first).end(),
141 [&](const EVT &EVI) { return EVI.first == EV.first; });
141 [&](const EVT &EVI) { return EVI.first == EV.first; });
142 EXPECT_NE(G.outEdges(EV.first.first).end(), It);
142 EXPECT_NE(G.outEdges(EV.first.first).end(), It);
218 EXPECT_EQ(0u, G.vertices().begin()->first);
245 EXPECT_EQ(EI(0u, 0u), G.edges().begin()->first);
250 EXPECT_EQ(EI(0u, 0u), G.outEdges(0u).begin()->first);
256 EXPECT_EQ(EI(0u, 0u), G.inEdges(0u).begin()->first);
usr/include/c++/7.4.0/bits/hashtable.h 1716 if (__do_rehash.first)
1755 if (__do_rehash.first)
usr/include/c++/7.4.0/bits/hashtable_policy.h 892 if (__do_rehash.first)
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;
94 __pre.first = __s;
97 __suf.first = __e;
102 __pre.first = __s;
103 __pre.second = __res[0].first;
104 __pre.matched = (__pre.first != __pre.second);
105 __suf.first = __res[0].second;
107 __suf.matched = (__suf.first != __suf.second);
116 __it.first = __it.second = __e;
317 if (__s == __it.first)
usr/include/c++/7.4.0/bits/regex_compiler.tcc 427 __last_char.first = false;
432 __last_char.first = true;
437 __last_char.first = true;
442 if (__last_char.first)
462 if (__last_char.first)
465 __last_char.first = true;
470 if (__last_char.first)
473 __last_char.first = false;
509 if (!__last_char.first)
531 __last_char.first = false;
536 __last_char.first = false;
622 if (_M_translator._M_match_range(__it.first, __it.second, __s))
usr/include/c++/7.4.0/bits/regex_executor.tcc 130 _M_dfs(__match_mode, __task.first);
179 if (__rep_count.second == 0 || __rep_count.first != _M_current)
182 __rep_count.first = _M_current;
252 auto __back = __res.first;
253 __res.first = _M_current;
255 __res.first = __back;
354 for (auto __tmp = __submatch.first;
358 if (_M_re._M_automaton->_M_traits.transform(__submatch.first,
usr/include/c++/7.4.0/bits/regex_scanner.h 118 for (; __it->first != '\0'; ++__it)
119 if (__it->first == __c)
usr/include/c++/7.4.0/bits/regex_scanner.tcc 183 for (; __it->first != '\0'; ++__it)
184 if (__it->first == __narrowc)
usr/include/c++/7.4.0/bits/stl_algo.h 3844 std::iter_swap(__i++, __first + __pospos.first);
usr/include/c++/7.4.0/bits/stl_function.h 887 { return __x.first; }
891 { return __x.first; }
902 { return __x.first; }
usr/include/c++/7.4.0/bits/stl_map.h 491 if (__i == end() || key_comp()(__k, (*__i).first))
511 if (__i == end() || key_comp()(__k, (*__i).first))
532 if (__i == end() || key_comp()(__k, (*__i).first))
541 if (__i == end() || key_comp()(__k, (*__i).first))
usr/include/c++/7.4.0/bits/stl_pair.h 292 : first(__p.first), second(__p.second) { }
361 : first(std::forward<_U1>(__p.first)),
383 first = __p.first;
383 first = __p.first;
396 first = std::forward<first_type>(__p.first);
396 first = std::forward<first_type>(__p.first);
407 first = __p.first;
407 first = __p.first;
418 first = std::forward<_U1>(__p.first);
418 first = std::forward<_U1>(__p.first);
429 swap(first, __p.first);
429 swap(first, __p.first);
449 { return __x.first == __y.first && __x.second == __y.second; }
449 { return __x.first == __y.first && __x.second == __y.second; }
455 { return __x.first < __y.first
455 { return __x.first < __y.first
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 252 _M_buffer = __p.first;
usr/include/c++/7.4.0/bits/stl_tree.h 2096 return _Res(_M_insert_(__res.first, __res.second,
2101 return _Res(iterator(__res.first), false);
2120 return _M_insert_(__res.first, __res.second,
2204 return _M_insert_(__res.first, __res.second,
2207 return iterator(__res.first);
2286 return _M_insert_(__res.first, __res.second,
2358 return _Res(_M_insert_node(__res.first, __res.second, __z), true);
2361 return _Res(iterator(__res.first), false);
2382 return _M_insert_node(__res.first, __res.second, __z);
2405 return _M_insert_node(__res.first, __res.second, __z);
2408 return iterator(__res.first);
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 1050 : _Inherited(std::forward<_U1>(__in.first),
1243 this->_M_head(*this) = __in.first;
1252 this->_M_head(*this) = std::forward<_U1>(__in.first);
usr/include/c++/7.4.0/utility 191 { return __pair.first; }
196 { return std::forward<_Tp1>(__pair.first); }
201 { return __pair.first; }
utils/TableGen/AsmMatcherEmitter.cpp 821 size_t start = Ops.first.find_first_of('$');
824 Ops.first = Ops.first.slice(start + 1, std::string::npos);
824 Ops.first = Ops.first.slice(start + 1, std::string::npos);
825 size_t end = Ops.first.find_last_of(" \t");
826 Ops.first = Ops.first.slice(0, end);
826 Ops.first = Ops.first.slice(0, end);
833 Ops.first = Ops.first.slice(0, end);
833 Ops.first = Ops.first.slice(0, end);
843 int SrcAsmOperand = findAsmOperandNamed(Ops.first);
847 "unknown source two-operand alias operand '" + Ops.first +
1330 RegisterClasses[it->first] = RegisterSetClasses[it->second];
1462 ClassInfo *CI = OCM.first;
1723 OperandName = Operands[Idx.first].Name;
1842 SrcOp2 = findAsmOperandNamed(Name, Insert.first->second);
1847 Insert.first->second = SrcOp2;
1875 CGA.ResultInstOperandIndex[AliasOpNo].first == i; ++AliasOpNo) {
1914 if (T.second != -1 && findAsmOperandNamed(T.first, T.second) != -1)
1916 "Operand '" + T.first + "' can never be matched");
2278 << utostr(std::get<0>(KV.first)) << ", "
2279 << utostr(std::get<1>(KV.first)) << ", "
2280 << utostr(std::get<2>(KV.first)) << " },\n";
2496 OS << " case " << RC.first->getValueAsString("Namespace") << "::"
2497 << RC.first->getName() << ": OpKind = " << RC.second->Name
2766 if (R->getValueAsString("ToMnemonic") == AliasEntry.first)
2788 Cases.push_back(std::make_pair(AliasEntry.first, MatchCode));
utils/TableGen/AsmWriterEmitter.cpp 83 O << " case " << OpsToPrint.back().first << ":";
91 O << "\n case " << OpsToPrint[i-1].first << ":";
639 int getOpIndex(StringRef Op) { return OpMap[Op].first; }
749 return LessRecordByID()(LHS.first.TheDef, RHS.first.TheDef);
749 return LessRecordByID()(LHS.first.TheDef, RHS.first.TheDef);
803 const CodeGenInstAlias &CGA = Alias.first;
846 unsigned OpNum = Operands.getSubOperandNumber(MIOpNum).first;
975 IAPrinterMap[Aliases.first].push_back(std::move(IAP));
1013 CasesO.indent(2) << "case " << Entry.first << ":\n";
utils/TableGen/CTagsEmitter.cpp 41 OS << *Id << "\t" << BufferName << "\t" << LineAndColumn.first << "\n";
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 118 CGI.Operands.getSubOperandNumber(NumberedOp).first)))) {
136 std::string &EncoderMethodName = CGI.Operands[SO.first].EncoderMethodName;
276 Case += " case " + itostr(KV.first) + ": {\n";
415 HwModes.insert(KV.first);
502 const std::string &Case = IE->first;
utils/TableGen/CodeGenDAGPatterns.cpp 94 VVT.getOrCreateTypeForMode(I.first, T);
115 unsigned M = P.first;
130 if (!Modes.count(I.first))
141 unsigned M = I.first;
150 unsigned M = I.first;
174 SetType &S = getOrCreate(I.first);
187 Modes.push_back(I.first);
230 Modes.insert(I.first);
232 Modes.insert(I.first);
3196 Init *SomeSDNode = DefInit::get(SDNodes.begin()->first);
3662 ->first;
3745 I.error("Input operand $" + InstInputs.begin()->first +
3826 Record *Instr = Entry.first;
3848 Rec.first = P;
3849 else if (Rec.first->getExtTypes() != P->getExtTypes())
3902 if (SrcNames[Entry.first].first == nullptr)
3902 if (SrcNames[Entry.first].first == nullptr)
3904 Entry.first);
3910 if (DstNames[Entry.first].first == nullptr &&
3910 if (DstNames[Entry.first].first == nullptr &&
3911 SrcNames[Entry.first].second == 1)
3912 Pattern->error("Pattern has dead named input: $" + Entry.first);
4229 Modes.insert(I.first);
4645 unsigned i = it.first;
4646 const MultipleUseVarSet &DepVars = it.second.first;
utils/TableGen/CodeGenDAGPatterns.h 206 return Map.insert({Mode,SetType()}).first->second;
227 return Map.size() == 1 && Map.begin()->first == DefaultMode;
utils/TableGen/CodeGenHwModes.cpp 50 dbgs() << " (" << P.first << ',' << P.second->getName() << ')';
109 dbgs() << " " << P.first->getName() << " -> ";
utils/TableGen/CodeGenInstruction.cpp 245 if (!Ops[Op.first].Constraints[Op.second].isNone())
249 Ops[Op.first].Constraints[Op.second] =
288 if (DestOp.first >= Ops.NumDefs)
292 if (SrcOp.first < Ops.NumDefs)
300 if (!Ops[SrcOp.first].Constraints[SrcOp.second].isNone())
318 Ops[SrcOp.first].Constraints[SrcOp.second] = NewConstraint;
342 std::string OpName = P.first;
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;
497 Res += Selection.split('|').first;
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 555 OS << "enum " << Entry.first << " {\n";
557 OS << "\t" << Entry.first << "_" << FieldValues[i]->getAsUnquotedString();
utils/TableGen/CodeGenRegisters.cpp 319 SubRegMap::const_iterator SRI = Map.find(I->first);
354 SubRegs[RegBank.getCompositeSubRegIndex(Idx, SubReg.first)] = SubReg.second;
369 SubReg.first->AllSuperRegsCovered = false;
373 SubReg2Idx.insert(std::make_pair(SubReg.second, SubReg.first)).first;
373 SubReg2Idx.insert(std::make_pair(SubReg.second, SubReg.first)).first;
374 if (Ins->second == SubReg.first)
382 SubReg.first->getName() + " and " + Ins->second->getName());
533 CodeGenSubRegIndex *NewIdx = NewSubRegs[i].first;
541 NewIdx->addComposite(SI->first, SubIdx);
565 Id.push_back(I->first->EnumValue);
680 NewReg->addSuperClass(SuperPair.first, SuperPair.second);
1024 return SizeOrder(A.first, B.first);
1024 return SizeOrder(A.first, B.first);
1042 SubRegRC = SuperRegClassPair.first;
1178 P.first->Artificial = false;
1331 SubRegAction[P.first].insert({&R, P.second});
1344 C.insert({P.first, F->second});
1357 auto F = Map2.find(P.first);
1369 UserDefined.insert(std::make_pair(&Idx, P.first));
1384 CodeGenSubRegIndex *Idx1 = i1->first;
1393 CodeGenSubRegIndex *Idx2 = i2->first;
2057 CodeGenSubRegIndex *SubRegIndex = S->first;
2182 if (!I->first->Artificial)
2183 SRSets[I->first].push_back(R);
2207 RC->getName() + "_with_" + I->first->getName());
2260 SubSetVec.push_back(SSPairs[i].first);
utils/TableGen/CodeGenRegisters.h 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);
350 if (OpcodeMasks[OpcodeIdx].first[ProcIndex]) {
356 OpcodeMasks[OpcodeIdx].first |= ProcMask;
369 unsigned LhsIdx = Opcode2Index[Lhs.first];
370 unsigned RhsIdx = Opcode2Index[Rhs.first];
382 if (LhsMasks.first != RhsMasks.first)
382 if (LhsMasks.first != RhsMasks.first)
383 return LessThan(LhsMasks.first, RhsMasks.first);
383 return LessThan(LhsMasks.first, RhsMasks.first);
397 Fn.addOpcode(Info.first, std::move(Info.second));
1064 unsigned OldSCIdx = Entry.first;
utils/TableGen/DAGISelMatcher.cpp 174 OS.indent(indent) << "case " << C.first->getEnumName() << ":\n";
189 OS.indent(indent) << "case " << getEnumName(C.first) << ":\n";
utils/TableGen/DAGISelMatcher.h 480 const SDNodeInfo &getCaseOpcode(unsigned i) const { return *Cases[i].first; }
530 MVT::SimpleValueType getCaseType(unsigned i) const { return Cases[i].first; }
utils/TableGen/DAGISelMatcherEmitter.cpp 256 OS << "\"" << It.first << "\",\n";
955 Record *SDNode = Entry.first;
utils/TableGen/DAGISelMatcherGen.cpp 587 auto N = MatchedComplexPatterns[i].first;
872 CGP.getTargetInfo().getRegBank().getReg(PhysRegInputs[i].first);
utils/TableGen/DAGISelMatcherOpt.cpp 453 MatcherPtr.reset(new CheckTypeMatcher(Cases[0].first, 0));
utils/TableGen/DFAEmitter.cpp 127 OS << "{" << P.first << ", " << P.second << "}";
149 dfa_state_type From = KV.first.first;
149 dfa_state_type From = KV.first.first;
150 dfa_state_type To = KV.second.first;
151 action_type A = KV.first.second;
utils/TableGen/DFAPacketizerEmitter.cpp 411 emitForItineraries(OS, KV.second, KV.first);
utils/TableGen/ExegesisEmitter.cpp 149 OS << " \"" << NameAndIndex.first << "\", // " << NameAndIndex.second
utils/TableGen/FastISelEmitter.cpp 700 const OperandsSignature &Operands = OI->first;
705 const std::string &Opcode = I->first;
714 MVT::SimpleValueType VT = TI->first;
719 MVT::SimpleValueType RetVT = RI->first;
746 MVT::SimpleValueType RetVT = RI->first;
769 OS << " if (RetVT.SimpleTy != " << getName(RM.begin()->first)
790 MVT::SimpleValueType VT = TI->first;
857 const std::string &Opcode = I->first;
utils/TableGen/FixedLenDecoderEmitter.cpp 623 if (Inst.first & (1ULL << bitIndex))
632 Inst.first, std::make_unique<FilterChooser>(
677 if (Filter.first == (unsigned)-1) {
692 unsigned Len = encodeULEB128(Filter.first, Buffer);
1215 emitSinglePredicateMatch(o, pairs.first, Emitter->PredicateNamespace);
1219 emitSinglePredicateMatch(o, pairs.first, Emitter->PredicateNamespace);
1843 TiedNames[InOutOperands[i].second] = InOutOperands[SO.first].second;
1844 TiedNames[InOutOperands[SO.first].second] = InOutOperands[i].second;
1919 CGI.Operands.getSubOperandNumber(NumberedOp).first))))
1927 const std::string &Name = CGI.Operands[SO.first].Name;
1930 << ": " << Name << "(" << SO.first << ", " << SO.second
1934 Record *TypeRecord = CGI.Operands[SO.first].Rec;
1943 CGI.Operands[SO.first].MIOperandInfo &&
1944 CGI.Operands[SO.first].MIOperandInfo->getNumArgs()) {
1945 Init *Arg = CGI.Operands[SO.first].MIOperandInfo->
1984 if (CGI.Operands[SO.first].MIOperandInfo &&
1985 CGI.Operands[SO.first].MIOperandInfo->getNumArgs() > 1 &&
2020 TypedInit *TI = cast<TypedInit>(Op.first);
2402 HwModeNames.insert(HWM.getMode(KV.first).Name);
2421 HWM.getMode(KV.first).Name);
2422 HwModeNames.insert(HWM.getMode(KV.first).Name);
2481 8 * Opc.first.second, this);
2502 emitTable(OS, TableInfo.Table, 0, FC.getBitWidth(), Opc.first.first);
2502 emitTable(OS, TableInfo.Table, 0, FC.getBitWidth(), Opc.first.first);
utils/TableGen/GlobalISelEmitter.cpp 3022 if (I.first->getSymbolicName() == SymbolicName)
3023 return *I.first;
3087 if (Pair.first == Matchers.front().get())
4090 CopyToPhysRegMIBuilder.addRenderer<AddRegisterRenderer>(PhysInput.first,
4092 CopyToPhysRegMIBuilder.addRenderer<CopyPhysRegRenderer>(PhysInput.first);
4172 InsertPt, DstMIBuilder.getInsnID(), 1, *SrcRCDstRCPair->first);
4261 if (SrcRCDstRCPair->first != RC)
4747 M.addAction<ConstrainOperandToRegClassAction>(0, 1, *SrcRCDstRCPair->first);
5331 InstructionMatcher &InsnMatcher = *Item.first;
utils/TableGen/InfoByHwMode.cpp 35 auto I = Map.insert({P.first, MVT(llvm::getValueType(P.second))});
71 return Map.insert(std::make_pair(Mode, D->second)).first->second;
73 return Map.insert(std::make_pair(Mode, Type)).first->second;
96 OS << '(' << getModeName(P->first)
148 auto I = Map.insert({P.first, RegSizeInfo(P.second, CGH)});
155 unsigned M0 = Map.begin()->first;
160 unsigned M0 = Map.begin()->first;
165 unsigned M0 = Map.begin()->first;
171 unsigned M0 = Map.begin()->first;
188 OS << '(' << getModeName(P->first) << ':' << P->second << ')';
200 auto I = Map.insert({P.first, P.second});
utils/TableGen/InfoByHwMode.h 45 U.insert(P.first);
47 U.insert(P.first);
103 return Map.size() == 1 && Map.begin()->first == DefaultMode;
utils/TableGen/InstrInfoEmitter.cpp 276 OS << " " << Op.first << " = " << Op.second << ",\n";
295 const std::map<unsigned, unsigned> &OpList = Entry.first;
utils/TableGen/IntrinsicEmitter.cpp 639 const CodeGenIntrinsic &intrinsic = *(I->first);
648 unsigned argNo = intrinsic.ArgumentAttributes[ai].first;
701 } while (ai != ae && intrinsic.ArgumentAttributes[ai].first == argNo);
918 if (!I->first.empty())
919 OS << "if (TargetPrefix == \"" << I->first << "\") ";
925 OS << " static const BuiltinEntry " << I->first << "Names[] = {\n";
928 << Table.GetOrAddStringOffset(P.first) << "}, // " << P.first << "\n";
928 << Table.GetOrAddStringOffset(P.first) << "}, // " << P.first << "\n";
931 OS << " auto I = std::lower_bound(std::begin(" << I->first << "Names),\n";
932 OS << " std::end(" << I->first << "Names),\n";
934 OS << " if (I != std::end(" << I->first << "Names) &&\n";
utils/TableGen/OptParserEmitter.cpp 149 for (PrefixKeyT::const_iterator PI = I->first.begin(),
150 PE = I->first.end(); PI != PE; ++PI) {
utils/TableGen/RegisterInfoEmitter.cpp 353 const auto &Reg = X.first;
365 return A.first->getName() == B.first->getName();
365 return A.first->getName() == B.first->getName();
417 Dwarf2LMap[DwarfRegNo] = I->first;
422 OS << " { " << I->first << "U, " << getQualifiedName(I->second)
454 return LessRecordRegister()(A.first, B);
456 assert(AliasIter != DwarfRegNums.end() && AliasIter->first == Alias &&
461 return LessRecordRegister()(A.first, B);
463 assert(RegIter != DwarfRegNums.end() && RegIter->first == Reg &&
484 OS << " { " << getQualifiedName(I->first) << ", " << RegNo
676 CodeGenSubRegIndex *&Entry = Vec[I.first->EnumValue - 1];
683 auto *&Entry = Vec[I.first->EnumValue - 1];
1669 OS << "\tSubReg " << P.first->getName()
utils/TableGen/SearchableTableEmitter.cpp 123 return Field.Enum->EntryMap[cast<DefInit>(I)->getDef()]->first;
287 OS << " " << Entry->first << " = " << Entry->second << ",\n";
329 return compareBy(LHS.first, RHS.first, Index);
329 return compareBy(LHS.first, RHS.first, Index);
334 IndexRowsStorage.push_back(Entry.first);
344 primaryRepresentation(Field, Entry.first->getValueInit(Field.Name));
588 return LHS->first < RHS->first;
588 return LHS->first < RHS->first;
utils/TableGen/SequenceToOffsetTable.h 73 if (I != Seqs.end() && isSuffix(Seq, I->first))
79 if (I != Seqs.begin() && isSuffix((--I)->first, Seq))
98 Entries += I->first.size() + 1;
106 assert(I != Seqs.end() && isSuffix(Seq, I->first) &&
108 return I->second + (I->first.size() - Seq.size());
120 for (typename SeqT::const_iterator SI = I->first.begin(),
121 SE = I->first.end(); SI != SE; ++SI) {
utils/TableGen/SubtargetFeatureInfo.cpp 132 StringRef Cond = Comma.first;
utils/TableGen/WebAssemblyDisassemblerEmitter.cpp 99 OS << "WebAssemblyInstruction InstructionTable" << PrefixPair.first;
110 OS << " { " << InstIt->second.first << ", ET_Instruction, ";
143 if (PrefixIt != OpcodeTable.end() && I && !PrefixPair.first) {
163 if (PrefixPair.second.empty() || !PrefixPair.first)
165 OS << " { " << PrefixPair.first << ", InstructionTable"
166 << PrefixPair.first;
utils/TableGen/X86DisassemblerTables.cpp 852 const char *Encoding = stringForOperandEncoding(OperandList[i].first);
utils/TableGen/X86EVEX2VEXTablesEmitter.cpp 63 OS << " { X86::" << Pair.first->TheDef->getName()
utils/benchmark/src/benchmark_register.cc 284 AddRange(&arglists[i], ranges[i].first, ranges[i].second,
utils/benchmark/src/console_reporter.cc 61 str += FormatString(" %10s", c.first.c_str());
152 c.first.length());
162 printer(Out, COLOR_DEFAULT, " %s=%s%s", c.first.c_str(), s.c_str(),
utils/benchmark/src/counter.cc 40 auto it = r.find(c.first);
47 auto it = l->find(tc.first);
49 (*l)[tc.first] = tc.second;
60 if (r.find(c.first) == r.end()) {
utils/benchmark/src/csv_reporter.cc 52 user_counter_names_.insert(cnt.first);
71 CHECK(user_counter_names_.find(cnt.first) != user_counter_names_.end())
73 << "Counter named \"" << cnt.first
utils/benchmark/src/json_reporter.cc 197 << FormatKV(c.first, c.second);
utils/benchmark/src/statistics.cc 114 auto it = counter_stats.find(cnt.first);
116 counter_stats.insert({cnt.first, {cnt.second, std::vector<double>{}}});
117 it = counter_stats.find(cnt.first);
120 CHECK_EQ(counter_stats[cnt.first].c.flags, cnt.second.flags);
136 auto it = counter_stats.find(cnt.first);
168 auto c = Counter(uc_stat, counter_stats[kv.first].c.flags);
169 data.counters[kv.first] = c;
utils/unittest/googlemock/include/gmock/gmock-matchers.h 1600 SafeMatcherCast<T>(matchers.first),
3043 return first_matcher_.Matches(a_pair.first) &&
3047 if (!first_matcher_.MatchAndExplain(a_pair.first,
utils/unittest/googlemock/src/gmock-matchers.cc 320 << "element #" << it->first << ", "
350 *listener << sep << " - element #" << matches[mi].first
utils/unittest/googlemock/src/gmock-spec-builders.cc 575 << it->first << ".";
utils/unittest/googletest/include/gtest/gtest-printers.h 681 UniversalPrinter<T1>::Print(value.first, os);
utils/unittest/googletest/src/gtest-typed-test.cc 82 if (name == it->first) {
99 if (tests.count(it->first) == 0) {
100 errors << "You forgot to list test " << it->first << ".\n";
utils/unittest/googletest/src/gtest.cc 1159 *os << it->first << it->second << "\n";