reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

  192   NodeType &back() { return *Nodes.back(); }

  689         stack.back() |= VisitedLeft;
  692         stack.back() |= VisitedRight;
  709     TreeTy* Current = reinterpret_cast<TreeTy*>(stack.back() & ~Flags);
  716           stack.back() |= VisitedLeft;
  722           stack.back() |= VisitedRight;
  735     TreeTy* Current = reinterpret_cast<TreeTy*>(stack.back() & ~Flags);
  742         stack.back() &= ~Flags; // Set state to "VisitedNone."
  747         stack.back() &= ~Flags;
  748         stack.back() |= VisitedLeft;

  807   unsigned &leafOffset() { return path.back().offset; }

  161     typename MapType::iterator Pos = Map.find(Vector.back().first);

  151     } while (!V.empty() && V.back() == T());
  172       } while (!V.empty() && V.back() == T());

  194       Set.insert(Vector.back());

  375     T Result = ::std::move(this->back());
  482     ::new ((void*) this->end()) T(::std::move(this->back()));
  511     ::new ((void*) this->end()) T(std::move(this->back()));
  646     return this->back();

  288       *I = Dense.back();
  289       unsigned BackIdx = ValIndexOf(Dense.back());

  241     return Val.template get<VecTy*>()->back();

  892   RegionT *ret = Regions.back();
  904   RegionT *ret = getRegionFor(BBs.back());

  123         assert(SE->InsertPointGuards.back() == this);

  702         Changed |= Op != Operands.back();
  712         Changed |= Op != Operands.back();
  729         Changed |= Op != Operands.back();
  741         Changed |= Op != Operands.back();
  751         Changed |= Op != Operands.back();
  761         Changed |= Op != Operands.back();
  771         Changed |= Op != Operands.back();

  473       Value *V = ValueWorkList.back();
  488       BasicBlock *BB = BBWorkList.back();

  512     CurCodeSize = BlockScope.back().PrevCodeSize;
  514     CurAbbrevs = std::move(BlockScope.back().PrevAbbrevs);

  401     SwitchSection(SectionStack.back().first.first, Subsection);
  418     MCSectionSubPair curSection = SectionStack.back().first;
  419     SectionStack.back().second = curSection;
  421       SectionStack.back().first = MCSectionSubPair(Section, Subsection);

  344     if (DstEdges.size() && DstEdges.back()->Dst.Number > Edge->Dst.Number)

  479       char *End = *I == Allocator.Slabs.back() ? Allocator.CurPtr

  644       std::swap(*RIt, Roots.back());
  706       const DomTreeNodeBase<NodeT> *Node = WorkStack.back().first;
  707       const auto ChildIt = WorkStack.back().second;
  717         ++WorkStack.back().second;

  537           std::swap(Root, Roots.back());
 1238     assert(FS.back().getPointer() == CurrentUpdate.getTo() &&
 1239            FS.back().getInt() == CurrentUpdate.getKind());
 1244     assert(FP.back().getPointer() == CurrentUpdate.getFrom() &&
 1245            FP.back().getInt() == CurrentUpdate.getKind());
 1448       if (Children.back()->getDFSNumOut() + 1 != Node->getDFSNumOut()) {
 1449         PrintChildrenError(Children.back(), nullptr);

  761     assert(Stack.back().Ctx == Singleton);
  762     assert(Stack.back().HasValue && "Did not write top-level value");

  177       Info = WorkList.back();

  739     if (Headers.back() == Irr.Node)

  288     WeightSum += Weights.back();
  529     PHINode *P = WorkList.back();

   41     std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back();

  205     auto *UserBlock = TaintStack.back();

  274     Instruction *Cur = Worklist.back();

  863       for (Node &N : *NewSCCs.back()) {
  865         G->SCCMap[&N] = NewSCCs.back();
 1689         for (Node &N : *RC.SCCs.back()) {
 1691           SCCMap[&N] = RC.SCCs.back();

  529         std::pair<BasicBlock *, Value *> &e = StartingStack.back();
  538     std::pair<BasicBlock *, Value *> e = BlockValueStack.back();
  543       assert(BlockValueStack.back() == e && "Nothing should have been pushed!");
  555       assert(BlockValueStack.back() != e && "Stack should have been pushed!");

  835     BasicBlock *DirtyBB = DirtyBlocks.back();
 1338       PHITransAddr &PredPointer = PredList.back().second;
 1613       ReverseLocalDeps[ReverseDepsToAdd.back().first].insert(
 1614           ReverseDepsToAdd.back().second);
 1644       ReverseNonLocalDeps[ReverseDepsToAdd.back().first].insert(
 1645           ReverseDepsToAdd.back().second);
 1687       ReverseNonLocalPtrDeps[ReversePtrDepsToAdd.back().first].insert(
 1688           ReversePtrDepsToAdd.back().second);

 1155     DomTreeNode *Node = WorkStack.back().DTN;
 1156     DomTreeNode::const_iterator ChildIt = WorkStack.back().ChildIt;
 1157     IncomingVal = WorkStack.back().IncomingVal;
 1163       ++WorkStack.back().ChildIt;
 1340     BasicBlock *BackBlock = VersionStack.back()->getBlock();
 1343     while (VersionStack.back()->getBlock() == BackBlock)

  484       const BasicBlock *FixupBlock = Worklist.back();

   84     while (!Stack.empty() && DepthMap[Stack.back()] >= DepthNumber) {

 3423   if (Operands.back()->isZero()) {

  888     NewAddOps.back() = Rest;
 2002           TTI->isTruncateFree(Phi->getType(), Phis.back()->getType())) {
 2006           SE.getTruncateExpr(SE.getSCEV(Phi), Phis.back()->getType());

  195     UseInfo &US = Params.back().Use;
  377       AllocaInfo &AS = Info.Allocas.back();
  384     ParamInfo &PS = Info.Params.back();

  390     assert(Parameters.back().ParamKind == VFParamKind::GlobalPredicate &&

  129     else if (Stack.back().Node.getKind() == Type::Array) {
  131       auto &Array = Stack.back().Node.getArray();
  134       auto &Map = Stack.back().Node.getMap();
  135       if (!Stack.back().MapEntry) {
  137         Stack.back().MapEntry = &Map[Node];
  140         *Stack.back().MapEntry = Node;
  141         Stack.back().MapEntry = nullptr;
  157       if (Stack.back().Node.getKind() == msgpack::Type::Array) {
  158         if (Stack.back().Node.getArray().size() != Stack.back().Length)
  158         if (Stack.back().Node.getArray().size() != Stack.back().Length)
  161         if (Stack.back().MapEntry ||
  162             Stack.back().Node.getMap().size() != Stack.back().Length)
  162             Stack.back().Node.getMap().size() != Stack.back().Length)
  217       if (Stack.back().Node.getKind() == Type::Map) {
  218         if (Stack.back().MapIt != Stack.back().Node.getMap().end())
  218         if (Stack.back().MapIt != Stack.back().Node.getMap().end())
  221         if (Stack.back().ArrayIt != Stack.back().Node.getArray().end())
  221         if (Stack.back().ArrayIt != Stack.back().Node.getArray().end())
  229     if (Stack.back().Node.getKind() == Type::Map) {
  230       if (Stack.back().OnKey) {
  232         Node = Stack.back().MapIt->first;
  233         Stack.back().OnKey = false;
  235         Node = Stack.back().MapIt->second;
  236         ++Stack.back().MapIt;
  237         Stack.back().OnKey = true;
  240       Node = *Stack.back().ArrayIt;
  241       ++Stack.back().ArrayIt;

 2870       unsigned ID = Record.back();
 4511         if (!Ops.back())
 4600         if (!Args.back())
 5043         if (!Args.back())

  343   return OldTypeRefs.Arrays.back().second.get();
 1264                             (Context, Record[1], unrotateSign(Record.back())));
 1268                                          unrotateSign(Record.back())));

  623     const MDNode *N = Worklist.back().first;
  628         Worklist.back().second, N->op_end(),
  632       Worklist.back().second = ++I;
  649     if (Worklist.empty() || Worklist.back().first->isDistinct()) {

   24   BlockScope.back().PrevAbbrevs.swap(CurAbbrevs);

  426   while (!Path.empty() && !indexReallyValid(SubTypes.back(), Path.back() + 1)) {
  426   while (!Path.empty() && !indexReallyValid(SubTypes.back(), Path.back() + 1)) {
  437   ++Path.back();
  438   Type *DeeperType = SubTypes.back()->getTypeAtIndex(Path.back());
  438   Type *DeeperType = SubTypes.back()->getTypeAtIndex(Path.back());
  483   while (SubTypes.back()->getTypeAtIndex(Path.back())->isAggregateType()) {
  483   while (SubTypes.back()->getTypeAtIndex(Path.back())->isAggregateType()) {
  500   } while (SubTypes.back()->getTypeAtIndex(Path.back())->isAggregateType());
  500   } while (SubTypes.back()->getTypeAtIndex(Path.back())->isAggregateType());
  674       Type *SlotType = RetSubTypes.back()->getTypeAtIndex(RetPath.back());
  674       Type *SlotType = RetSubTypes.back()->getTypeAtIndex(RetPath.back());

 2012     Structor &S = Structors.back();

 1257           !Location->LoadChain.empty() ? Location->LoadChain.back() : 0;
 1267           Var.DefRanges.back().isDifferentLocation(DR)) {
 1286         Var.DefRanges.back().Ranges;
 1287     if (!R.empty() && R.back().second == Begin)
 1288       R.back().second = End;
 1864       ReturnAndArgTypeIndices.back() == TypeIndex::Void()) {
 1865     ReturnAndArgTypeIndices.back() = TypeIndex::None();
 1921   if (!ArgTypeIndices.empty() && ArgTypeIndices.back() == TypeIndex::Void())
 1922     ArgTypeIndices.back() = TypeIndex::None();

   60   if (!Entries.empty() && Entries.back().isDbgValue() &&
   61       !Entries.back().isClosed() &&
   62       Entries.back().getInstr()->isIdenticalTo(MI)) {
   64                       << "\t" << Entries.back().getInstr() << "\t" << MI
   78   if (Entries.back().isClobber() && Entries.back().getInstr() == &MI)
   78   if (Entries.back().isClobber() && Entries.back().getInstr() == &MI)

   16   if (Lists.back().EntryOffset == Entries.size()) {
   23   Lists.back().Label = Asm.createTempSymbol("debug_loc");
   28   if (Entries.back().ByteOffset != DWARFBytes.size())
   32   Comments.erase(Comments.begin() + Entries.back().CommentOffset,
   36   assert(Lists.back().EntryOffset <= Entries.size() &&

  329       (&CURanges.back().End->getSection() !=
  335   CURanges.back().End = Range.End;
  505     const RangeSpan &Back = Ranges.back();
  736     auto Item = WorkList.back();

  300     auto *Expr = FrameIndexExprs.back().Expr;
 1338   const MachineInstr *LScopeEnd = LSRange.back().second;
 1496         cast<DbgVariable>(ConcreteEntities.back().get()));
 1502         cast<DbgLabel>(ConcreteEntities.back().get()));
 1504   return ConcreteEntities.back().get();

  130   return std::make_pair(CURangeLists.size() - 1, &CURangeLists.back());

  294           CallSiteEntry &Prev = CallSites.back();

 1193         if (HandlerStack.back().second == CurrentState)

  221     HaveRegParm = Locs.back().isRegLoc();

 2737   while (!Actions.empty() && Point != Actions.back().get()) {
 4679     Value *V = worklist.back();
 5302     if (LargeOffsetGEPs.front().second == LargeOffsetGEPs.back().second)
 5724     Instruction *I = WorkList.back();
 5951   SelectInst *LastSI = ASI.back();
 7078   Instruction *LastInst = Insts.back();

  510     PHIInfo &PI = PHIs.back();

  158       return GCStrategyList.back().get();

  499     SwitchWorkListItem W = WorkList.back();

 1059         FullExtensionReg = DstRegs.back();
 1068         PartialExtensionReg = DstRegs.back();

  493     RepairingPlacement &RepairPt = RepairPts.back();

 1218     BBState &State = BBStack.back();

  119     RegUnits.back().Fixed = &LIS->getRegUnit(*Units);

  239     LexicalScope *WS = WorkStack.back();

  243     locations.back().clearParent();
  245     if (locations.back().isReg()) {
  246       if (locations.back().isDef())
  247         locations.back().setIsDead(false);
  248       locations.back().setIsUse();
  582   return UVEntry = userValues.back().get();

  523     } while (!valnos.empty() && valnos.back()->isUnused());
  560   assert(segments.empty() || segments.back().end <= S.start);
 1226   if (!Spills.empty() && coalescable(Spills.back(), Seg)) {
 1227     Seg.start = Spills.back().start;
 1228     Seg.end = std::max(Spills.back().end, Seg.end);

  386     SlotIndex Idx = WorkList.back().first;
  387     VNInfo *VNI = WorkList.back().second;

  474       LiveIn.back().Kill = Use;

  489     unsigned Reg = Defs.back();

   42       MachineBasicBlock *ActiveMBB = &*Workqueue.back();

  281   MachineInstr *NewRoot = InsInstrs.back();

 1829     unsigned OpIdx = DeadOps.back();
 1894     unsigned OpIdx = DeadOps.back();

 1045     MBB = Stack.back();

  157   generateExistingPhis(KernelBB, PrologBBs.back(), KernelBB, KernelBB, VRMap,
  159   generatePhis(KernelBB, PrologBBs.back(), KernelBB, KernelBB, VRMap, InstrMap,
  325     MachineBasicBlock *LastEpilogBB = EpilogBBs.back();
 1420                                                        : Defaults.back());
 1596     LiveStages[Prologs.back()] = LS;
 1597     AvailableStages[Prologs.back()] = LS;
 1623       Epilogs.back() = peelKernel(LPD_Back);
 1624       LiveStages[Epilogs.back()] = LS;
 1625       AvailableStages[Epilogs.back()] = AS;
 1806     Info->setPreheader(Prologs.back());

 1172         EndPoints[I] = EndPoints.back();

  162     ConnectedVNInfoEqClasses &ConEQ = SubRangeInfos.back().ConEQ;

   57     unsigned LastRegionEnd = Regions.empty() ? 0 : Regions.back().End;
   93   unsigned LastRegionEnd = Regions.empty() ? 0 : Regions.back().End;

   71   unsigned getFrameSize() { return Regions.empty() ? 0 : Regions.back().End; }

  268     SUnit *Cur = WorkList.back();
  299     SUnit *Cur = WorkList.back();

11225       AddToWorklist(Ops.back().getNode());
16347     SDValue Chain = Chains.back();
17444     SDValue Vec = VecIn.back();
17734     EVT LastOpVT = Ops.back().getValueType();

 1122             unsigned UseIdx = GroupIdx.back() + 1;

 1867         NewIntermedVals.push_back(IntermedVals.back());

  220     SDNode *N = Worklist.back();

   59       SUnit *V = Queue.back();
  598           NewDef = Copies.back();

 1453       Interferences[i-1] = Interferences.back();
 1581       NewDef = Copies.back();
 1956     auto &Temp = WorkList.back();

  686     GluedNodes.back()->dump(DAG);
  907       SDNode *N = GluedNodes.back();

 4875   Outputs.resize(VT.getVectorNumElements(), Outputs.back());

 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();
 3032     auto User = UsersToVisit.back();
 7190     SDValue Src = CLI.InVals.back();
 8060     SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back();
10567     SwitchWorkListItem W = WorkList.back();

 1843               .addMBB(BTB.Cases.back().ThisBB);
 3001       N = NodeStack.back();
 3267       if (ChainNodesMatched.back() != NodeToMatch &&
 3304         if (ChainNodesMatched.back() != NodeToMatch &&
 3584       MatchScope &LastScope = MatchScopes.back();
 3588       N = NodeStack.back();

  284         ::getSimpleNodeLabel(GluedNodes.back(), DAG);

  280           UseBlocks.back().LastInstr = LastStop;
 1452     const VNInfo &VNI = *WorkList.back();

  801     unsigned ToReg = VirtRegPairs.back();
  804       unsigned FromReg = VirtRegPairs.back();

  418     MachineInstr *FirstMI = MIs.back();

  126   uint32_t SegmentBegin = SegmentOffsets.back();
  137   uint32_t SegmentLength = NewSegmentBegin - SegmentOffsets.back();

  183     auto &Vec = ConstantPoolVectors.back();

  444               SecNSymStack.back()->Value == BlockSyms.back()->Value)) {
  478         auto &NSym = *BlockSyms.back();

  884     Sections.back().setLoadAddress(0);

 3663     Args.back() = Builder.CreateTrunc(Args.back(), Type::getInt8Ty(C), "trunc");
 3663     Args.back() = Builder.CreateTrunc(Args.back(), Type::getInt8Ty(C), "trunc");

  574     auto *N = ToVisit.back();

 1063   if (!ArgTys.empty() && ArgTys.back()->isVoidTy()) {

 3946     Weights.getValue()[I->getCaseIndex() + 1] = Weights.getValue().back();

 1117   if (Attachments.back().first == ID) {
 1125       *I = std::move(Attachments.back());

   95     R.Args.back().Key = Arg.Key;
   96     R.Args.back().Val = Arg.Val;
   97     R.Args.back().Loc = toRemarkLocation(Arg.Loc);

 3884         Value *UnclePad = Worklist.back();

  548       DF = BundleGroups.back();
  653     MCDataFragment *DF = BundleGroups.back();

 1103   MCSectionSubPair curSection = SectionStack.back().first;
 1104   SectionStack.back().second = curSection;
 1107     SectionStack.back().first = MCSectionSubPair(Section, Subsection);

 1234       WasmDataSegment &Segment = DataSegments.back();

  652     ReadState &RS = NewIS->getUses().back();

   78     Stage *Last = Stages.back().get();

 2991   while (Stack.back().NextChildIndex < Stack.back().ChildCount) {
 2991   while (Stack.back().NextChildIndex < Stack.back().ChildCount) {
 2992     NodeState &Top = Stack.back();
 3030   if (!Stack.back().IsExportNode) {
 3033                         Twine::utohexstr(Stack.back().Start - Trie.begin()));
 3056   if (!Stack.back().IsExportNode) {
 3059                         Twine::utohexstr(Stack.back().Start - Trie.begin()));
 3066     NodeState &Top = Stack.back();

  246   return SynthesizedArgs.back().get();
  255   return SynthesizedArgs.back().get();
  264   return SynthesizedArgs.back().get();
  273   return SynthesizedArgs.back().get();

 1757     std::vector<PipelineElement> &Pipeline = *PipelineStack.back();
 1802   assert(PipelineStack.back() == &ResultPipeline &&

  271     if (RecordIndices.empty() || RecordIndices.back() != RecordIndex)
  449     auto Last = ActiveRegions.back();
  488         startSegment(ActiveRegions.empty() ? CR.value() : *ActiveRegions.back(),
  784     WrappedSegment = Segments.back();

  189       GCOVEdge *Edge = Edges.back().get();

  247         FunctionSamples &FSamples = InlineStack.back()->functionSamplesAt(
  256         FunctionSamples &FProfile = *InlineStack.back();

  129     Parser.TmpArgs.back().KeyIdx = Record[0];
  130     Parser.TmpArgs.back().ValueIdx = Record[1];
  131     Parser.TmpArgs.back().SourceFileNameIdx = Record[2];
  132     Parser.TmpArgs.back().SourceLine = Record[3];
  133     Parser.TmpArgs.back().SourceColumn = Record[4];
  145     Parser.TmpArgs.back().KeyIdx = Record[0];
  146     Parser.TmpArgs.back().ValueIdx = Record[1];
  575       R.Args.back().Key = *Key;
  580       R.Args.back().Val = *Value;
  587         R.Args.back().Loc.emplace();
  588         R.Args.back().Loc->SourceFilePath = *SourceFileName;
  589         R.Args.back().Loc->SourceLine = *Arg.SourceLine;
  590         R.Args.back().Loc->SourceColumn = *Arg.SourceColumn;

 1117     while (I == FileStack.back().End) {
 1177   assert(FileStack.size() > 0 && Argv.size() == FileStack.back().End);

  629   assert(Stack.back().Ctx != Object && "Only attributes allowed here");
  630   if (Stack.back().HasValue) {
  631     assert(Stack.back().Ctx != Singleton && "Only one value allowed here");
  634   if (Stack.back().Ctx == Array)
  636   Stack.back().HasValue = true;
  649   Stack.back().Ctx = Array;
  655   assert(Stack.back().Ctx == Array);
  657   if (Stack.back().HasValue)
  667   Stack.back().Ctx = Object;
  673   assert(Stack.back().Ctx == Object);
  675   if (Stack.back().HasValue)
  683   assert(Stack.back().Ctx == Object);
  684   if (Stack.back().HasValue)
  687   Stack.back().HasValue = true;
  689   Stack.back().Ctx = Singleton;
  702   assert(Stack.back().Ctx == Singleton);
  703   assert(Stack.back().HasValue && "Attribute must have a value");
  705   assert(Stack.back().Ctx == Object);

  700       if (!components.empty() && components.back() != "..") {

   73     auto &E = Stack.back();
   79              Entries.back().getFlameGraphStartUs(StartTime) +
   80                  Entries.back().getFlameGraphDurUs())) &&

 1928       DirStack.empty() ? Path : containedPart(DirStack.back(), Path);
 1994       if (Dir == DirStack.back())
 1997         while (!DirStack.empty() && !containedIn(DirStack.back(), Dir)) {

  463     if (SequenceElement && StateStack.back() == inMapFirstKey) {
  472       if (StateStack.back() == inMapFirstKey) {
  486   if (StateStack.back() == inMapFirstKey) {
  503     auto State = StateStack.back();
  516   if (StateStack.back() == inMapFirstKey) {
  519   } else if (StateStack.back() == inFlowMapFirstKey) {
  563   if (StateStack.back() == inSeqFirstElement) {
  577   if (StateStack.back() == inSeqFirstElement) {
  580   } else if (StateStack.back() == inFlowSeqFirstElement) {
  745   if (StateStack.back() != inMapFirstKey)
  757   if (StateStack.empty() || (!inFlowSeqAnyElement(StateStack.back()) &&
  758                              !inFlowMapAnyKey(StateStack.back())))
  786   if (StateStack.back() == inSeqFirstElement ||
  787       StateStack.back() == inSeqOtherElement) {
  790              ((StateStack.back() == inMapFirstKey) ||
  791               inFlowSeqAnyElement(StateStack.back()) ||
  792               (StateStack.back() == inFlowMapFirstKey)) &&
  818   if (StateStack.back() == inFlowMapOtherKey)

  249     Record *R = Stack.back();

 1147       if (!InitList.back()) return nullptr;
 1150       RecTy *ListType = cast<TypedInit>(InitList.back())->getType();
 1241         RHS = (BinOpInit::get(Code, InitList.back(), RHS, Type))->Fold(CurRec);
 1242         InitList.back() = RHS;
 2330   if (!Result.back()) {
 2355     if (!Result.back()) {

  250       SplitArgs.back().Flags[0].setInConsecutiveRegs();
  253   SplitArgs.back().Flags[0].setInConsecutiveRegsLast();
  934       OutArgs.back().Flags[0].setZExt();

  165   transferImpOps(MI, MIBS.front(), MIBS.back());

  348           Chains.remove(toDel.back());

 3493   auto Ext = static_cast<AArch64Operand*>(ExtOpnd.back().get());
 4152         return Error(Loc.back(), "invalid immediate expression");
 5002       return Error(IDLoc, "too few operands for instruction", SMRange(IDLoc, (*Operands.back()).getEndLoc()));
 5704   auto Ext = static_cast<AArch64Operand *>(ExtOpnd.back().get());

 2582     AMDGPUOperand &Op = static_cast<AMDGPUOperand &>(*Operands.back());
 2616     AMDGPUOperand &Op = static_cast<AMDGPUOperand &>(*Operands.back());

  304       if (VRM->hasPhys(Intervals.back()->reg)) // Did not change allocation.
  337                  << llvm::printReg((VRM->getPhys(Intervals.back()->reg)), TRI)

  169   return !Stack.empty() && Stack.back().first == BB;
  294   assert(Stack.back().first == BB);

  451     if (!ExecBranchStack.empty() && ExecBranchStack.back() == &MBB) {

  365       VisitedDom = CommonDominators.back();
  371           NextLevel[i] = NextLevel.back();
  616                                      IncomingUpdated.back());
  640           SSAUpdater.AddAvailableValue(&IMBB, IncomingUpdated.back());

  312       LaneVGPR = SpillVGPRs.back().VGPR;

  186     MI = Front.back();
  363      MI = Front.back();

 2089         unsigned Reg = UnspilledCS1GPRs.back();
 2100           unsigned Reg = UnspilledCS2GPRs.back();

 1823           if (Offset > MemOps.back().Offset) {
 2307         MachineInstr *Op0 = Ops.back();
 2367             MachineInstr *Op = Ops.back();

 3541       if (Regs.back().second == ARM::VPR)
 3547       if (Regs.back().second == ARM::VPR)
 3553     if (Kind == k_RegisterList && Regs.back().second == ARM::APSR)
11678         SMLoc EndLoc = ((ARMOperand &)*Operands.back()).getEndLoc();

   94           Pred = VPTStates.back();

   64     OpBegins.push_back(OpBegins.back() + Opcodes.size());
   74     OpBegins.push_back(OpBegins.back() + 1);
   80     OpBegins.push_back(OpBegins.back() + 2);
   85     OpBegins.push_back(OpBegins.back() + Size);

  976                       Lookahead.back().getString().data() +
  977                           Lookahead.back().getString().size();
  982         Lexer.is(AsmToken::Colon) || Lookahead.back().is(AsmToken::Colon);
 1013       Lexer.UnLex(Lookahead.back());
 1023     Lexer.UnLex(Lookahead.back());
 1051     switch (Tokens.back().getKind()) {
 1070     Lexer.UnLex(Tokens.back());

 1825     auto Last = NodeAddr<DefNode*>(ReachedDefs.back());
 1831     auto Last = NodeAddr<UseNode*>(ReachedUses.back());

  417       Out.back() += 1;

  456     AssemblerOptions.back()->setFeatures(STI.getFeatureBits());
  464       AssemblerOptions.back()->setFeatures(STI.getFeatureBits());
  473       AssemblerOptions.back()->setFeatures(STI.getFeatureBits());
 1379     unsigned R1 = RegList.List->back();
 2253       MCID.hasDelaySlot() && AssemblerOptions.back()->isReorder();
 2290       if (!AssemblerOptions.back()->isReorder())
 2590   if (MCID.hasDelaySlot() && AssemblerOptions.back()->isReorder())
 3524   if (MCID.hasDelaySlot() && AssemblerOptions.back()->isReorder())
 4979     if (AssemblerOptions.back()->isReorder())
 5016     if (AssemblerOptions.back()->isReorder())
 5781   if (RegIndex != 0 && AssemblerOptions.back()->getATRegIndex() == RegIndex)
 5787   if (!AssemblerOptions.back()->isMacro())
 5971   return AssemblerOptions.back()->getATRegIndex() != 0;
 5975   unsigned ATIndex = AssemblerOptions.back()->getATRegIndex();
 6223       static_cast<MipsOperand *>(Operands.back().release()));
 6472     MipsOperand &Reg = static_cast<MipsOperand &>(*TmpOperands.back());
 6668   AssemblerOptions.back()->setATRegIndex(0);
 6691     AssemblerOptions.back()->setATRegIndex(1);
 6728   if (!AssemblerOptions.back()->setATRegIndex(AtRegNo)) {
 6754   AssemblerOptions.back()->setReorder();
 6768   AssemblerOptions.back()->setNoReorder();
 6782   AssemblerOptions.back()->setMacro();
 6796   if (AssemblerOptions.back()->isReorder()) {
 6800   AssemblerOptions.back()->setNoMacro();
 7034       ComputeAvailableFeatures(AssemblerOptions.back()->getFeatures()));
 7035   STI.setFeatureBits(AssemblerOptions.back()->getFeatures());
 7049         std::make_unique<MipsAssemblerOptions>(AssemblerOptions.back().get()));
 7120   AssemblerOptions.back()->setFeatures(AssemblerOptions.front()->getFeatures());
 7286   if (AssemblerOptions.back()->isReorder())

  207     MBBInfo &MBBI = WorkList.back();

   78       Value *Curr = WorkList.back();

  249         while (I != E && canMerge(SubISELList.back(), *I)) {
  337   MachineBasicBlock::iterator MBBI = (*BIL.back());
  380                          std::next(MachineBasicBlock::iterator(BIL.back())),
  421   BuildMI(*MBB, BIL.back(), dl, TII->get(PPC::BC))
  422       .add(BIL.back()->getOperand(3))
  427           (IsFalseBlockRequired ? FalseBlockI : BIL.back()), dl,
  497   MachineBasicBlock *MBB = BIL.back()->getParent();

12121     SDValue BinOp = BinOps.back();
12337     SDValue BinOp = BinOps.back();

 1252   NewMIs.back()->addMemOperand(MF, MMO);
 1310   NewMIs.back()->addMemOperand(MF, MMO);
 3438         MI.addOperand(MOps.back());

  716         if (AllCRLogicalOps.back().IsNullary)
  718         else if (AllCRLogicalOps.back().IsBinary)

 6666   MachineInstr *LastMI = Selects.back();

  300         skipTerminator(Position, Terminators.back(), false);

  148         printAnnotation(OS, "down to catch" + utostr(EHPadStack.back()));

  104     if (Grouped.empty() || Grouped.back().first != Type)
  107       ++Grouped.back().second;

  290       while (!Entries.empty() && Entries.back().NumBlocksLeft == 0)
  312           !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) {
  313         Entries.back().Deferred.push_back(Next);
  343             !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) {
  344           Entries.back().Deferred.push_back(Next);

  897       if (EHPadStack.back() == UnwindDest)
 1306         assert(ScopeTops[Stack.back()->getNumber()]->getNumber() <=
 1313         assert(Stack.back() == &MBB && "Loop top should be balanced");

  667     RangeTy &Range = Worklist.back();
  673             Worklist.back().begin() != Worklist.back().end()) &&
  673             Worklist.back().begin() != Worklist.back().end()) &&
  691     Worklist.back() = reverse(Instr->explicit_uses());

 2640         if (HandleAVX512Operand(Operands, *Operands.back()))
 2721     X86Operand &Op = (X86Operand &)*Operands.back();
 2723       Operands.back() = X86Operand::CreateReg(X86::DX, Op.getStartLoc(),
 2813       Operands.back() = X86Operand::CreateToken("movsl", NameLoc);
 3098   X86Operand &Prefix = static_cast<X86Operand &>(*Operands.back());
 3232     Tmp.back() = Suffixes[I];
 3440       if (Match.back() == Match_MissingFeature)
 3456     if (Match.back() == Match_MissingFeature)
 3465   if (Match.back() == Match_MnemonicFail) {

  657       int64_t PrevDisp = DispSizeStack.back().first;
  658       unsigned PrevSize = DispSizeStack.back().second;

  428   bool IsFixed = Info.OrigArgs.empty() ? true : Info.OrigArgs.back().IsFixed;

  618   packCmovGroup(Group.front(), Group.back());
  650   MachineInstr *LastCMOV = Group.back();

  301   MachineBasicBlock *RootMBB = BranchPath.back();

  440     MachineInstr *MI = MIReplacements.back().first;
  441     MachineInstr *NewMI = MIReplacements.back().second;

 3721   if (!Outs.empty() && Outs.back().Flags.isInAlloca()) {
 3723     if (!ArgLocs.back().isMemLoc())
 3726     if (ArgLocs.back().getLocMemOffset() != 0)
 8021       Match &= !RepeatedLoads.back().isUndef();
19994   return DAG.getNode(X86ISD::PTEST, DL, MVT::i32, VecIns.back(), VecIns.back());
19994   return DAG.getNode(X86ISD::PTEST, DL, MVT::i32, VecIns.back(), VecIns.back());

  328     MachineBasicBlock &MBB = *DirtySuccessors.back();

   49       R.Begin = OpenRanges.back().second;
   51       Ranges[OpenRanges.back().first].push_back(R);

   73     Value *Curr = Worklist.back();
   84     if (!Stack.empty() && Stack.back() == I) {
  154     Value *Curr = Worklist.back();
  169     if (!Stack.empty() && Stack.back() == I) {

  795   auto *SizeIntrin = Shape.CoroSizes.back();

  309         if (CoroEnds.back()->isFallthrough()) {
  316             std::swap(CoroEnds.front(), CoroEnds.back());
  481     std::swap(CoroSuspends[FinalSuspendIndex], CoroSuspends.back());

  826     Value *V = WorkList.back();

  743         CallSites[CSi] = CallSites.back();

  722   BasicBlock *OutliningCallBB = Cloner.OutlinedFunctions.back().second;
 1412                         (Cloner.ClonedOI ? Cloner.OutlinedFunctions.back().first

  540       Value *V = WorkList.back();
  574       if (WorkList.back() == V) {

 1418   unsigned EndIdx = Mask.back();

  195     return RegInfos.back().R->getExit();
  206     Region *LastRegion = RegInfos.back().R;

  710       GCOVFunction &Func = *Funcs.back();
  758     out.write(reinterpret_cast<char*>(&FileChecksums.back()), 4);
  761       Func->setCfgChecksum(FileChecksums.back());

 1474     BasicBlock *CurrBB = SuccStack.back().first;
 1477     while (SuccStack.back().second != SE) {
 1478       BasicBlock *SuccBB = *SuccStack.back().second++;
 1516       BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end();
 1517       while (PredStack.back().second != PE) {
 1518         BasicBlock *BB = *PredStack.back().second++;

 1222              << "INSERTED " << NewInsts.size() << " INSTS: " << *NewInsts.back()

  650               DT->properlyDominates(Pred, si->second.back()->getParent())) {
  724           SmallVecInsn &V = HPL.back().second;

  725     const ConstantInt *MaxOffset = CurrentChecks.back().getOffset();
  779     RangeChecksOut.emplace_back(CurrentChecks.back());

 2003       WidenIV Widener(WideIVs.back(), LI, SE, DT, DeadInsts, HasGuards);

  625       if (!(isa<PHINode>(Instructions.back()) ||
  626             C->isSameOperationAs(Instructions.back())))
  634       !C->isSameOperationAs(Instructions.back()) ||

  505     ScaledReg = BaseRegs.back();
  563   if (&S != &BaseRegs.back())
  564     std::swap(S, BaseRegs.back());
  779     GlobalValue *Result = ExtractSymbol(NewOps.back(), SE);
 1186     return Fixups.back();
 1568   if (&F != &Formulae.back())
 1569     std::swap(F, Formulae.back());
 2601   if (&LU != &Uses.back())
 2602     std::swap(LU, Uses.back());
 2926     Value *PrevIV = getWideOperand(Chain.Incs.back().IVOperand);
 3328       CountRegisters(LU.Formulae.back(), LUIdx);
 3473         CountRegisters(LU.Formulae.back(), Uses.size() - 1);
 3656       GenerateReassociations(LU, LUIdx, LU.Formulae.back(),
 4795       LLVM_DEBUG(dbgs() << "  Deleting "; LU.Formulae.back().print(dbgs());

  539     if (Value *Candidate = Candidates.back()) {

  223       auto &Component = Components.back();
  229       while (!Stack.empty() && Root.lookup(Stack.back()) >= OurDFS) {
  230         auto *Member = Stack.back();
 2940     auto *I = TempInst.back();
 3748         !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second)) {
 3748         !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second)) {

 1030   if (Ops.size() == 1) return Ops.back();
 1032   Value *V1 = Ops.back();
 1421       return Ops.back().Op;
 1726     return Ops.back();
 1839   while (!Ops.empty() && isa<Constant>(Ops.back().Op)) {
 2244         isa<ConstantInt>(Ops.back().Op) &&
 2245         cast<ConstantInt>(Ops.back().Op)->isMinusOne()) {
 2251                isa<ConstantFP>(Ops.back().Op) &&
 2252                cast<ConstantFP>(Ops.back().Op)->isExactlyValue(-1.0)) {

 1405       BasicBlock *BB = BBWorkList.back();

 1404   if (Indices.size() == 1 && cast<ConstantInt>(Indices.back())->isZero())
 3880       LLVM_DEBUG(dbgs() << "    new slice [" << NewSlices.back().beginOffset()
 3881                         << ", " << NewSlices.back().endOffset()
 4027       LLVM_DEBUG(dbgs() << "    new slice [" << NewSlices.back().beginOffset()
 4028                         << ", " << NewSlices.back().endOffset()

  749   UserChainTail = Extractor.UserChain.back();
 1154     Instruction *Candidate = Candidates.back();

 2031         DominatingSucc, *VMaps.back(), DTUpdates, AC, DT, LI, MSSAU);

  651         InsertedPhis[i] = InsertedPhis.back();
  725                        Order.back()->getEntry();
  829            dominatesPredicates(Entry, Order.back())) {
  840   RegionNode *Node = Order.back();

  476       InstResult = AllocaTmps.back().get();

  850     MDMap[I].reset(DummyNodes.back().get());

  199           std::swap(Weights[idx+1], Weights.back());

  102     Instruction *I = Worklist.back();

  578   return RenameStack.back().Def;
  676                           << RenameStack.back().DFSIn << ","
  677                           << RenameStack.back().DFSOut << ")\n");
  703       ValueDFS &Result = RenameStack.back();

  800         LiveInBlockWorklist[i] = LiveInBlockWorklist.back();

  984       std::swap(Weights.front(), Weights.back());
 1077               std::swap(Weights[i + 1], Weights.back());
 1129               std::swap(Weights[i + 1], Weights.back());
 4390   Constant *Offset = ConstantExpr::getNeg(ContiguousCases->back());

  499     BB = DelayedBBs.back().TempBB.get();
  556   return DistinctWorklist.back();
  636     auto &WE = Worklist.back();

 1392     TreeEntry *Last = VectorizableTree.back().get();
 2366         VectorizableTree.back()->setOperand(0, Op0);
 2389         VectorizableTree.back()->setOperand(0, Op0);
 2440           PtrN = PointerOps.back();
 2443           PtrN = PointerOps[CurrentOrder.back()];
 3574         BlocksSchedules[BB]->getScheduleData(E->isOneOf(E->Scalars.back()));
 4554     ScheduleData *pickedSD = ReadyInsts.back();
 4726     ScheduleData *SD = WorkList.back();
 6283       Instruction *TreeN = Stack.back().first;
 6284       unsigned EdgeToVist = Stack.back().second++;
 6330             markExtraArg(Stack.back(), I);
 6340             markExtraArg(Stack.back(), I);
 6348               markExtraArg(Stack.back(), I);
 6356             markExtraArg(Stack.back(), I);
 6366       markExtraArg(Stack.back(), NextV);
 6590           ReductionData.getFlags(), ReductionOps.back());

  183         --Aux[Nodes.back()];

  229     } else if (!Vec.empty() && Vec.back()->hasTagIdentifierNamespace()) {
  230       NamedDecl *TagD = Vec.back();
  231       Vec.back() = D;

   55         Pending.back()(true);
   83         Pending.back()(true);
   98       Pending.back()(false);
   99       Pending.back() = std::move(DumpWithIndent);

  640     auto &CurrSAndVisited = LocalQueue.back();

   60         Pending.back()(true);
  104         Pending.back()(true);
  115       Pending.back()(false);
  116       Pending.back() = std::move(DumpWithIndent);

 6472     const auto &CurNode = Stack.back();

  766     return *pathStack.back();

  119     return ConditionalStack.back();

  325       if (!Locs.empty() && Locs.back().isActive(P)) {
  326         if (Locs.back().Priority <= Prio) {
  327           Locs.back().TemplateName = TemplateName;
  328           Locs.back().LessLoc = LessLoc;
  329           Locs.back().Priority = Prio;
  341       while (!Locs.empty() && Locs.back().isActiveOrNested(P))
  348       if (!Locs.empty() && Locs.back().isActive(P))
  349         return &Locs.back();

   57     ++FieldCount.back();

 2163     DeclTypeInfo.back().getAttrs().addAll(attrs.begin(), attrs.end());

 1058       OverloadCandidate &C = Candidates.back();

  816     return ExprEvalContexts.back().isConstantEvaluated() ||

  339     return Candidates.back();

   67     if (!Rep.empty() && Rep.back() == Val)
   70     assert((Rep.empty() || Rep.back().first < Val.first) &&

  180                 Scopes.back().PoolVar = VD;
  181                 Scopes.back().CompoundParent = S;
  182                 Scopes.back().Begin = I;
  195               Scopes.back().PoolVar = VD;
  196               Scopes.back().CompoundParent = S;
  197               Scopes.back().Begin = I;
  206       if (isPoolDrain(Scopes.back().PoolVar, child)) {
  207         PoolScope &scope = Scopes.back();

  712                                 getTrivialTypeSourceInfo(ExpandedTypes.back()));
 9202     if (NewParamInfos.back().getOpaqueValue())
10443         if (const auto *D = ParentStack.back().get<Decl>())
10445         else if (const auto *S = ParentStack.back().get<Stmt>())
10448           NodeOrVector = new ast_type_traits::DynTypedNode(ParentStack.back());
10463         bool Found = ParentStack.back().getMemoizationData() &&
10465                                ParentStack.back()) != Vector->end();
10467           Vector->push_back(ParentStack.back());

  623         Content.back()->addTrailingNewline();

   65   return &Objects.back();

  368       uint64_t ArrayIndex = IsArray ? Entries.back().getAsArrayIndex()
  452         Entries.back() = PathEntry::ArrayIndex(
  453             Entries.back().getAsArrayIndex() + TruncatedN);
  462       uint64_t ArrayIndex = IsArray ? Entries.back().getAsArrayIndex()
  483         Entries.back() = PathEntry::ArrayIndex(ArrayIndex);
  526     unsigned CurTempVersion = TempVersionStack.back();
 5127                       Next->getReturnType(), CovariantAdjustmentPath.back()))
 5131                                          CovariantAdjustmentPath.back()))
11203     Queue.back().E = E;
11204     Queue.back().Kind = Job::AnyExprKind;
11363   Job &job = Queue.back();

   83   return getEvalStatus().Diag->back().second;

   69       ArgsData.back().E = Args[ArgIndex];
   72     ArgsData.back().Kind = getKind(FS.getConversionSpecifier().getKind());
   73     if (ArgsData.back().Kind != OSLogBufferItem::ErrnoKind &&
   74         !ArgsData.back().E) {
   88         ArgsData.back().Size = precision.getConstantAmount();
   91         ArgsData.back().Count = Args[precision.getArgIndex()];
  104         ArgsData.back().Size = precision.getConstantAmount();
  107         ArgsData.back().Count = Args[precision.getArgIndex()];
  116         ArgsData.back().Precision = Args[FS.getPrecision().getArgIndex()];
  121       ArgsData.back().FieldWidth = Args[FS.getFieldWidth().getArgIndex()];
  125       ArgsData.back().Flags |= OSLogBufferItem::IsSensitive;
  127       ArgsData.back().Flags |= OSLogBufferItem::IsPrivate;
  129       ArgsData.back().Flags |= OSLogBufferItem::IsPublic;
  131     ArgsData.back().MaskType = FS.getMaskType();

 3283       if (P->MangledPath.empty() || P->MangledPath.back() != Base)

 5845     const CFGBlock *Blk = DFSWorkList.back();

  180     auto &Last = F->StateTransitions.back();

  388     UFE = VirtualFileEntries.back().get();
  411   FileEntry &BFE = *BypassFileEntries.back();

  299     Module *Current = Stack.back();

 3438       std::swap(Args.back(), *(&Args.back() - 1));
 3438       std::swap(Args.back(), *(&Args.back() - 1));
 3475     if (!Args.back().hasLValue()) {
 3476       RValue RVArg = Args.back().getKnownRValue();

  273          BranchFixups.back().Destination == nullptr)

 1704         SEHCodeSlot = ParentCGF.SEHCodeSlotStack.back();
 1944         ParentCGF, ParentCGF.SEHCodeSlotStack.back(), ParentFP));
 1961   Builder.CreateStore(Code, SEHCodeSlotStack.back());
 1975   return Builder.CreateLoad(SEHCodeSlotStack.back());
 2081     Builder.CreateStore(Code, SEHCodeSlotStack.back());
 2111   EmitBranchThroughCleanup(*SEHTryEpilogueStack.back());

  421       ArrayElements.back() = Elems[I];
  953     Elements.back() = llvm::ConstantAggregateZero::get(FillerType);
 1434   assert(PlaceholderAddresses.back().first == nullptr);
 1435   assert(PlaceholderAddresses.back().second == placeholder);
 1436   PlaceholderAddresses.back().first = signal;

  568                    Active.empty() ? nullptr : Active.back().get()));
  760   Active.back()->finish();

 3941     assert((!CGF.ObjCEHValueStack.empty() && CGF.ObjCEHValueStack.back()) &&
 3943     ExceptionAsObject = CGF.ObjCEHValueStack.back();

 2782     unsigned char inst = Layout.back();
 4770     assert((!CGF.ObjCEHValueStack.empty() && CGF.ObjCEHValueStack.back()) &&
 4772     ExceptionAsObject = CGF.ObjCEHValueStack.back();
 5282   assert(IvarsInfo.back().Offset < InstanceEnd);
 5292     if (!buffer.empty() && !(buffer.back() & ScanMask)) {
 5293       unsigned lastSkip = buffer.back() >> SkipShift;
 5298         buffer.back() = (lastSkip << SkipShift);
 5318       unsigned lastScan = (buffer.back() & ScanMask) >> ScanShift;
 5323         buffer.back() = (buffer.back() & SkipMask) | (lastScan << ScanShift);
 5323         buffer.back() = (buffer.back() & SkipMask) | (lastScan << ScanShift);
 5586     if (!Asm.empty() && Asm.back() != '\n')

  170       CatchHandler &Handler = Handlers.back();

 8522             CurSizes.back(), /*IsVolatile=*/false);
 8541     CurMapTypes.back() |= OMP_MAP_TARGET_PARAM;
 8545       CurMapTypes.back() |= OMP_MAP_IMPLICIT;

  463       if (CaptureRegions.size() == 1 && CaptureRegions.back() == OMPD_unknown) {
  469           CaptureRegions.back() == OMPD_parallel &&
 2201       assert(GlobalizedRecords.back().Records.size() < 2 &&
 2205       for (const RecordDecl *RD : GlobalizedRecords.back().Records) {
 2216       GlobalizedRecords.back().Records.push_back(GlobalizedVarsRecord);
 2217       ++GlobalizedRecords.back().RegionCounter;
 2218       if (GlobalizedRecords.back().Records.size() == 1) {
 2253         GlobalizedRecords.back().Buffer = StaticGlobalized;
 2254         GlobalizedRecords.back().RecSize = RecSize;
 2255         GlobalizedRecords.back().UseSharedMemory = UseSharedMemory;
 2256         GlobalizedRecords.back().Loc = Loc;
 2425         assert(GlobalizedRecords.back().RegionCounter > 0 &&
 2427         --GlobalizedRecords.back().RegionCounter;
 2429         if (GlobalizedRecords.back().RegionCounter == 0) {
 2433               Address(GlobalizedRecords.back().UseSharedMemory,
 2435               /*Volatile=*/false, Int16Ty, GlobalizedRecords.back().Loc);

  685         setBitFieldInfo(Member->FD, Member->Offset, FieldTypes.back());

 1156   EmitBranchThroughCleanup(BreakContinueStack.back().BreakBlock);
 1168   EmitBranchThroughCleanup(BreakContinueStack.back().ContinueBlock);
 1278     JumpDest Block = BreakContinueStack.back().BreakBlock;
 1673     OuterContinue = BreakContinueStack.back().ContinueBlock;

  757       CaptureRegions.size() == 1 && CaptureRegions.back() == OMPD_unknown;

   56                                          VTableAddressPoints.back()));

 1284       if (Stack.back().Kind == Kind && getExitBlock().isValid()) {
 1287         assert(!Stack.back().HasBeenEmitted);
 1289         CGF.EmitBlock(Stack.back().ExitBlock.getBlock());
 1291         CGF.EmitBranch(Stack.back().ContBlock.getBlock());
 1293         Stack.back().HasBeenEmitted = true;
 1312         assert(CGF.getOMPCancelDestination(Stack.back().Kind).isValid());
 1314         if (!Stack.back().HasBeenEmitted) {
 1316             CGF.EmitBranchThroughCleanup(Stack.back().ContBlock);
 1317           CGF.EmitBlock(Stack.back().ExitBlock.getBlock());
 1318           CGF.EmitBranchThroughCleanup(Stack.back().ContBlock);
 1320         CGF.EmitBlock(Stack.back().ContBlock.getBlock());

  455     BreakContinueStack.back().BreakCount += CurrentCount;
  463     BreakContinueStack.back().ContinueCount += CurrentCount;
  611       BreakContinueStack.back().ContinueCount += BC.ContinueCount;

  926     BreakContinueStack.back().BreakCount = addCounters(
  927         BreakContinueStack.back().BreakCount, getRegion().getCounter());
  935     BreakContinueStack.back().ContinueCount = addCounters(
  936         BreakContinueStack.back().ContinueCount, getRegion().getCounter());
 1135       BreakContinueStack.back().ContinueCount = addCounters(
 1136           BreakContinueStack.back().ContinueCount, BC.ContinueCount);

  398     return BranchFixups.back();

   78     return Scopes.back();

 3544   for (MSRTTIClass *Class = &Classes.front(); Class <= &Classes.back();) {

  218     return addLegalTypedData(componentTys.back(), begin, end);
  266   if (Entries.empty() || Entries.back().End <= begin) {

  406     : JobAction(OffloadBundlingJobClass, Inputs, Inputs.back()->getType()) {}

 1987         ContainsCompileOrAssembleAction(Actions.back())) {
 1995         Inputs.push_back(Actions.back());
 2003         Action* LastAction = Actions.back();
 2410         auto *IA = cast<InputAction>(UA->getInputs().back());
 2850         auto *IA = cast<InputAction>(UA->getInputs().back());
 3114         HostAction = UA->getInputs().back();
 3143       assert(HostAction == AL.back() && "Host action not in the list??");
 3145       AL.back() = HostAction;
 3414           Current, InputArg, Phase, PL.back(), FullPL);
 3420         assert(Phase == PL.back() && "linking must be final compilation step.");
 3431         assert(Phase == PL.back() && "merging must be final compilation step.");
 3971     ActionChain.back().JA = BaseAction;
 3972     while (ActionChain.back().JA) {
 3973       const Action *CurAction = ActionChain.back().JA;
 3977       JobActionInfo &AI = ActionChain.back();
 4339   } else if (llvm::sys::path::is_separator(Filename.back())) {

  593     SourceRange ArgRange(Keys.front()->getBeginLoc(), Keys.back()->getEndLoc());

  626       Current.FakeLParens.back() > prec::Unknown)

  644     return Commas.back();

   60     if (Tokens.back()->NewlinesBefore > 0 || Tokens.back()->IsMultiline)
   60     if (Tokens.back()->NewlinesBefore > 0 || Tokens.back()->IsMultiline)
   62   } while (Tokens.back()->Tok.isNot(tok::eof));
  116       Tokens.back()->Tok.setKind(tok::starequal);
  364   FormatToken *RegexToken = Tokens.back();
  419   FormatToken *BacktickToken = Tokens.back();
  486   FormatToken *HashToken = Tokens.back();
  509   FormatToken *Last = Tokens.back();
  539   Tokens.back() = String;
  544   if (Tokens.back()->NewlinesBefore == 0 && Tokens.back()->isNot(tok::eof))
  544   if (Tokens.back()->NewlinesBefore == 0 && Tokens.back()->isNot(tok::eof))
  589     FormatToken *Next = Tokens.back();
  595     Tokens.back()->Type = Type;
  596     Tokens.back()->Tok.setKind(tok::kw___unknown_anytype);
  812     if (!(Tokens.size() > 0 && Tokens.back()->Tok.getIdentifierInfo() &&
  813           Tokens.back()->Tok.getIdentifierInfo()->getPPKeywordID() ==

  260     SourceLocation SymbolsEnd = Reference.Symbols.back().Range.getEnd();

   82       Annotator.annotate(*AnnotatedLines.back());
  116   UnwrappedLines.back().push_back(TheLine);

   92     Left->ParentBracket = Contexts.back().ContextKind;
   97     bool InExprContext = Contexts.back().IsExpression;
   99     Contexts.back().IsExpression = false;
  102     Contexts.back().InTemplateArgument =
  167     Left->ParentBracket = Contexts.back().ContextKind;
  171     Contexts.back().ColonIsForRangeExpr =
  184       Contexts.back().IsExpression = false;
  191       Contexts.back().IsExpression = false;
  199       Contexts.back().IsExpression = true;
  205       Contexts.back().IsExpression = false;
  209       Contexts.back().IsExpression = false;
  212       Contexts.back().IsExpression = false;
  215       Contexts.back().IsExpression = true;
  218       Contexts.back().IsExpression = false;
  223       Contexts.back().IsForEachMacro = true;
  224       Contexts.back().IsExpression = false;
  227       Contexts.back().IsExpression = false;
  231       Contexts.back().IsExpression = !IsForOrCatch;
  235       Contexts.back().ColonIsObjCMethodExpr = true;
  280         Contexts.back().IsExpression = true;
  304           if (Contexts.back().FirstObjCSelectorName) {
  305             Contexts.back().FirstObjCSelectorName->LongestObjCSelectorName =
  306                 Contexts.back().LongestObjCSelectorName;
  341         Contexts.back().IsExpression = false;
  356         Contexts.back().CanBeExpression = true;
  448     Left->ParentBracket = Contexts.back().ContextKind;
  456         (Contexts.back().CanBeExpression || Contexts.back().IsExpression ||
  456         (Contexts.back().CanBeExpression || Contexts.back().IsExpression ||
  457          Contexts.back().InTemplateArgument);
  460                                      Contexts.back().InCpp11AttributeSpecifier;
  465         Contexts.back().InCSharpAttributeSpecifier;
  472         Contexts.back().CanBeExpression && Left->isNot(TT_LambdaLSquare) &&
  493                  Contexts.back().ContextKind == tok::l_brace &&
  496       } else if (Style.isCpp() && Contexts.back().ContextKind == tok::l_brace &&
  555     Contexts.back().IsExpression = true;
  558       Contexts.back().IsExpression = false;
  560     Contexts.back().ColonIsObjCMethodExpr = StartsObjCMethodExpr;
  561     Contexts.back().InCpp11AttributeSpecifier = IsCpp11AttributeSpecifier;
  562     Contexts.back().InCSharpAttributeSpecifier = IsCSharp11AttributeSpecifier;
  606         if (!Contexts.back().FirstObjCSelectorName) {
  610             Contexts.back().FirstObjCSelectorName = Previous;
  614               Contexts.back().FirstObjCSelectorName->ObjCSelectorNameParts;
  616         if (Contexts.back().FirstObjCSelectorName) {
  617           Contexts.back().FirstObjCSelectorName->LongestObjCSelectorName =
  618               Contexts.back().LongestObjCSelectorName;
  620             Contexts.back().FirstObjCSelectorName->LongestObjCSelectorName = 0;
  638           Contexts.back().ColonIsObjCMethodExpr = true;
  659       Left->ParentBracket = Contexts.back().ContextKind;
  661       if (Contexts.back().CaretFound)
  663       Contexts.back().CaretFound = false;
  666       Contexts.back().ColonIsDictLiteral = true;
  668         Contexts.back().IsExpression = true;
  671         Contexts.back().IsExpression = false;
  688                (!Contexts.back().ColonIsDictLiteral || !Style.isCpp())) ||
  766         if (Contexts.back().ColonIsForRangeExpr || // colon in for loop
  769             Contexts.back().ContextKind == tok::l_paren ||  // function params
  770             Contexts.back().ContextKind == tok::l_square || // array type
  771             (!Contexts.back().IsExpression &&
  772              Contexts.back().ContextKind == tok::l_brace) || // object type
  775           Contexts.back().IsExpression = false;
  780       if (Contexts.back().ColonIsDictLiteral ||
  788       } else if (Contexts.back().ColonIsObjCMethodExpr ||
  803             Contexts.back().LongestObjCSelectorName == 0 ||
  806           if (!Contexts.back().FirstObjCSelectorName)
  807             Contexts.back().FirstObjCSelectorName = Tok->Previous;
  809                    Contexts.back().LongestObjCSelectorName)
  810             Contexts.back().LongestObjCSelectorName =
  813               Contexts.back().FirstObjCSelectorName->ObjCSelectorNameParts;
  814           ++Contexts.back().FirstObjCSelectorName->ObjCSelectorNameParts;
  816       } else if (Contexts.back().ColonIsForRangeExpr) {
  834       } else if (Contexts.back().ContextKind == tok::l_paren) {
  843           !Contexts.back().IsExpression)
  867       Contexts.back().ColonIsForRangeExpr = true;
  888           !Contexts.back().IsExpression && !Line.startsWith(TT_ObjCProperty) &&
  977       if (Line.MustBeDeclaration && !Contexts.back().IsExpression &&
  986       if (Contexts.back().InCtorInitializer)
  988       else if (Contexts.back().InInheritanceList)
  990       else if (Contexts.back().FirstStartOfName &&
  992         Contexts.back().FirstStartOfName->PartOfMultiVariableDeclStmt = true;
  995       if (Contexts.back().IsForEachMacro)
  996         Contexts.back().IsExpression = true;
 1102       Contexts.back().IsExpression = true;
 1197       if (Contexts.back().FirstObjCSelectorName)
 1198         Contexts.back().FirstObjCSelectorName->LongestObjCSelectorName =
 1199             Contexts.back().LongestObjCSelectorName;
 1242       CurrentToken->BindingStrength = Contexts.back().BindingStrength;
 1287                                    P.Contexts.back().BindingStrength + Increase,
 1288                                    P.Contexts.back().IsExpression));
 1304       Contexts.back().IsExpression = true;
 1325       Contexts.back().IsExpression = true;
 1327       Contexts.back().IsExpression = true;
 1329       Contexts.back().IsExpression = false;
 1331       Contexts.back().IsExpression = Style.Language == FormatStyle::LK_Java;
 1334       Contexts.back().IsExpression = true;
 1335       Contexts.back().InCtorInitializer = true;
 1337       Contexts.back().InInheritanceList = true;
 1344         Contexts.back().IsExpression = false;
 1346       Contexts.back().CanBeExpression = false;
 1349       Contexts.back().IsExpression = true;
 1383       Contexts.back().FirstStartOfName = &Current;
 1389       Contexts.back().FirstStartOfName = nullptr;
 1402                                            Contexts.back().CanBeExpression &&
 1403                                                Contexts.back().IsExpression,
 1404                                            Contexts.back().InTemplateArgument);
 1408         Contexts.back().CaretFound = true;
 1415           Line.MustBeDeclaration && !Contexts.back().IsExpression) {
 1742     if (IsExpression && !Contexts.back().CaretFound)

   65         Current->Children.push_back(Children.back());

  286            PPLevelBranchIndex.back() + 1 >= PPLevelBranchCount.back()) {
  286            PPLevelBranchIndex.back() + 1 >= PPLevelBranchCount.back()) {
  291       ++PPLevelBranchIndex.back();
  293       assert(PPLevelBranchIndex.back() <= PPLevelBranchCount.back());
  293       assert(PPLevelBranchIndex.back() <= PPLevelBranchCount.back());
  438       if (LBraceStack.back()->BlockKind == BK_Unknown) {
  479           LBraceStack.back()->BlockKind = BK_BracedInit;
  482           LBraceStack.back()->BlockKind = BK_Block;
  499       if (!LBraceStack.empty() && LBraceStack.back()->BlockKind == BK_Unknown)
  500         LBraceStack.back()->BlockKind = BK_Block;
  703       (!PPStack.empty() && PPStack.back().Kind == PP_Unreachable))
 2739     if (!PPStack.empty() && (PPStack.back().Kind == PP_Unreachable) &&

  204   Changes.back().TokenLength = 0;
  205   Changes.back().IsTrailingComment = Changes.back().Tok->is(tok::comment);
  205   Changes.back().IsTrailingComment = Changes.back().Tok->is(tok::comment);
  255             Changes[ScopeStack.back()].indentAndNestingLevel())
  287       unsigned ScopeStart = ScopeStack.back();
  568         if (&C != &Changes.back() && (&C + 1)->NewlinesBefore > 0)

  703       ResultDiag = &StoredDiags->back();
 2398       FixItHint &FH = FixIts.back();
 2441   if (Decls->empty() || Decls->back().first <= Offset) {

  553       L = SM.getImmediateMacroCallerLoc(LocationStack.back());

 1603   if (Stmts.empty() || !isa<ObjCForCollectionStmt>(Stmts.back()))
 1610   buf += utostr(ObjCBcLabelNo.back());
 1633   if (Stmts.empty() || !isa<ObjCForCollectionStmt>(Stmts.back()))
 1640   buf += utostr(ObjCBcLabelNo.back());
 1681   assert(isa<ObjCForCollectionStmt>(Stmts.back()) &&
 1799   buf += utostr(ObjCBcLabelNo.back());
 1811   buf += utostr(ObjCBcLabelNo.back());
 5416       dyn_cast<ObjCForCollectionStmt>(Stmts.back()))
 5617     assert ((isa<SwitchStmt>(Stmts.back()) || isa<WhileStmt>(Stmts.back()) ||
 5617     assert ((isa<SwitchStmt>(Stmts.back()) || isa<WhileStmt>(Stmts.back()) ||
 5618              isa<DoStmt>(Stmts.back()) || isa<ForStmt>(Stmts.back()))
 5618              isa<DoStmt>(Stmts.back()) || isa<ForStmt>(Stmts.back()))

 1410   if (Stmts.empty() || !isa<ObjCForCollectionStmt>(Stmts.back()))
 1417   buf += utostr(ObjCBcLabelNo.back());
 1427   if (Stmts.empty() || !isa<ObjCForCollectionStmt>(Stmts.back()))
 1434   buf += utostr(ObjCBcLabelNo.back());
 1475   assert(isa<ObjCForCollectionStmt>(Stmts.back()) &&
 1590   buf += utostr(ObjCBcLabelNo.back());
 1602   buf += utostr(ObjCBcLabelNo.back());
 4540       dyn_cast<ObjCForCollectionStmt>(Stmts.back()))
 4719     assert ((isa<SwitchStmt>(Stmts.back()) || isa<WhileStmt>(Stmts.back()) ||
 4719     assert ((isa<SwitchStmt>(Stmts.back()) || isa<WhileStmt>(Stmts.back()) ||
 4720              isa<DoStmt>(Stmts.back()) || isa<ForStmt>(Stmts.back()))
 4720              isa<DoStmt>(Stmts.back()) || isa<ForStmt>(Stmts.back()))

  216   out.back() = columns;
  244     out.back() = i;
  250   out.back() = i;
  264            == static_cast<unsigned>(m_columnToByte.back()+1));
  265     assert(static_cast<unsigned>(m_byteToColumn.back()+1)
  570     if (Str[End] == PunctuationEndStack.back())

   42     assert(StmtStack.back() == S);
   60     assert(!StmtStack.empty() && E == StmtStack.back());

   70     return Tokens.back();
   73     Out.resize(Tokens.back().Offset);
   76   TokenKind top() const { return Tokens.empty() ? pp_none : Tokens.back().K; }
  519   while (Out.back() == ' ')
  888     if (!Out.empty() && Out.back() != '\n')
  923       int PreviousOffset = Offsets.back().Offset;
  932       int PreviousOffset = Offsets.back().Offset;

  513   if (FrameworkName.empty() || FrameworkName.back() != '/')

 2746       PP->Diag(ConditionalStack.back().IfLoc,

  269   if (Result.back() == '\\') {

  819   PendingSubmodules.back()->Kind = Module::GlobalModuleFragment;
  820   return PendingSubmodules.back().get();
 1851         << SourceRange(Id.front().second, Id.back().second);
 1897   StringRef ModuleName = Id.back().first;
 1898   SourceLocation ModuleNameLoc = Id.back().second;

  110     Lex(CachedTokens.back());
  113   return CachedTokens.back();

   78   addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back()));
   85   addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back()));
   92   addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back()));
  100   addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back()));
  101   CondDirectiveStack.back() = Loc;
  106   addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back()));
  107   CondDirectiveStack.back() = Loc;
  112   addCondDirectiveLoc(CondDirectiveLoc(Loc, CondDirectiveStack.back()));

  315       BuildingSubmoduleStack.back().IsPragma) {
  316     Diag(BuildingSubmoduleStack.back().ImportLoc,
  723       BuildingSubmoduleStack.back().IsPragma != ForPragma) {
  728   auto &Info = BuildingSubmoduleStack.back();

  636       if (Brackets.empty() || Brackets.back() == Brace)
  642       if (Brackets.empty() || Brackets.back() == Paren)
  816               ArgTokens.back().commaAfterElided()) {

  377   PragmaToks.back().setKind(tok::eod);
 1563     PP.EnterAnnotationToken(SourceRange(ImportLoc, ModuleName.back().second),
 1630     PP.EnterAnnotationToken(SourceRange(BeginLoc, ModuleName.back().second),

 1070     Lex(Toks.back());
 1072     switch (Toks.back().getKind()) {
 1154     if (Suffix.back().isNot(tok::semi)) {
 1163     SourceLocation SemiLoc = Suffix.back().getLocation();
 1184       Suffix.back().startToken();
 1185       Suffix.back().setKind(tok::annot_module_begin);
 1186       Suffix.back().setLocation(SemiLoc);
 1187       Suffix.back().setAnnotationEndLoc(SemiLoc);
 1188       Suffix.back().setAnnotationValue(Action.ModuleForHeader);
 1241     if (Suffix.back().isNot(tok::semi)) {
 1246     SemiLoc = Suffix.back().getLocation();
 1298   if (!BuildingSubmoduleStack.empty() && M != BuildingSubmoduleStack.back().M)
 1299     BuildingSubmoduleStack.back().M->Imports.insert(M);

  160   if (ResultToks.empty() || !ResultToks.back().is(tok::comma))
  165     PP.Diag(ResultToks.back().getLocation(), diag::ext_paste_comma);
  175     if (ResultToks.back().is(tok::hashhash))
  179     ResultToks.back().setFlag(Token::CommaAfterElided);
  209       ConcatenatedVAOPTResultToks.back() = LHS;
  237   ResultToks.back() = StringifiedVAOPT;
  332           if (ResultToks.size() && ResultToks.back().is(tok::hashhash)) {
  406       !ResultToks.empty() && ResultToks.back().is(tok::hashhash);
  423         ResultToks.back().setFlag(Token::LeadingSpace);
  426         ResultToks.back().clearFlag(Token::LeadingSpace);
  470             ResultToks.back().is(tok::comma))
  471           ResultToks.back().setFlag(Token::IgnoredComma);
  578       assert(ResultToks.back().is(tok::hashhash));

  149     delete getCurrentClass().LateParsedDeclarations.back();
  174     delete getCurrentClass().LateParsedDeclarations.back();
  316       Token LastDefaultArgToken = Toks->back();
  389     Token LastExceptionSpecToken = Toks->back();
  496   Token LastBodyToken = LM.Toks.back();

 4697     EnumAvailabilityDiags.back().done();

  178                          ExtraNSs.back().IdentLoc);
  196                              ExtraNSs.back().IdentLoc),
 3637     SpecificationRange.setEnd(ExceptionSpecTokens->back().getLocation());

  201   assert(Actions.ExprEvalContexts.back().Context ==
 2164     Comps.back().isBrackets = false;
 2165     Comps.back().U.IdentInfo = Tok.getIdentifierInfo();
 2166     Comps.back().LocStart = Comps.back().LocEnd = ConsumeToken();
 2166     Comps.back().LocStart = Comps.back().LocEnd = ConsumeToken();
 2173         Comps.back().isBrackets = false;
 2174         Comps.back().LocStart = ConsumeToken();
 2181         Comps.back().U.IdentInfo = Tok.getIdentifierInfo();
 2182         Comps.back().LocEnd = ConsumeToken();
 2190         Comps.back().isBrackets = true;
 2193         Comps.back().LocStart = ST.getOpenLocation();
 2199         Comps.back().U.E = Res.get();
 2202         Comps.back().LocEnd = ST.getCloseLocation();

 2599           SourceRange(TokLocs.front(), TokLocs.back()), Str);

 2333     if (Arg.back() == OMPC_DIST_SCHEDULE_static && Tok.is(tok::comma))
 2346     else if (Arg.back() != OMPC_DEFAULTMAP_MODIFIER_unknown)
 2360     if (Arg.back() != OMPD_unknown) {
 2367         Arg.back() = OMPD_unknown;

  533       Diag(LBraceLocs.back(), diag::note_matching) << tok::l_brace;

 2264       << SourceRange(ColonLoc, Partition.back().second);
 2324       << SourceRange(ColonLoc, Path.back().second);

  290     CFGBlock &UnwindBlock = *Stack.back();

   67     ParsedAttr *attr = FreeLists[index].back();

  875     ModuleScopes.back().ImplicitGlobalModuleFragment = true;
  965         !ModuleScopes.empty() && ModuleScopes.back().Module->Kind ==
 1044       ModuleScopes.back().Module->Kind == Module::GlobalModuleFragment &&
 1045       !ModuleScopes.back().ImplicitGlobalModuleFragment) {
 1046     Diag(ModuleScopes.back().BeginLoc,
 1057          !ModuleScopes.back().Module->isModulePurview()) &&
 1741   markEscapingByrefs(*FunctionScopes.back(), *this);
 1787     FunctionScopes.back()->setHasBranchIntoScope();
 1792     FunctionScopes.back()->setHasBranchProtectedScope();
 1797     FunctionScopes.back()->setHasIndirectGoto();
 1804   auto CurBSI = dyn_cast<BlockScopeInfo>(FunctionScopes.back());
 2178   return dyn_cast<CapturedRegionScopeInfo>(FunctionScopes.back());

  347          PackIncludeStack.back().CurrentPragmaLocation != PrevLocation);
  453       CurrentValue = Stack.back().Value;
  454       CurrentPragmaLocation = Stack.back().PragmaLocation;
  761   PragmaAttributeStack.back().Entries.push_back(
  768   PragmaAttributeStack.back().Loc = PragmaLoc;
  769   PragmaAttributeStack.back().Namespace = Namespace;
  846   Diag(PragmaAttributeStack.back().Loc, diag::err_pragma_attribute_no_pop_eof);

  663   auto &ExprEvalCtx = ExprEvalContexts.back();

 1475       if (DisplayedPaths.insert(Path.back().SubobjectNumber).second) {

14734       ReverseMemberChain.back()->getParent()->getTypeForDecl());

 4966   SwitchStmt *Switch = getCurFunction()->SwitchStack.back().getPointer();

 8455   assert(VisitStack.back() && "First decl null?");
10813         ++InitFieldIndex.back();
12469        Context.addModuleInitializer(ModuleScopes.back().Module, var);
12558     Context.addModuleInitializer(ModuleScopes.back().Module, var);
13489     PushExpressionEvaluationContext(ExprEvalContexts.back().Context);
13503     PushExpressionEvaluationContext(ExprEvalContexts.back().Context);
14056                ExprEvalContexts.back().NumCleanupObjects &&

 8301     if (AvailabilityStack.back() >= Introduced)
 8343     const Stmt *StmtOfUse = StmtStack.back();
 8361         if (StmtUSEFinder::isContained(StmtStack.back(), D)) {
 8436     if (CondVersion.empty() || CondVersion <= AvailabilityStack.back())

  404                              Toks->back().getLocation());
 1284       else if (!S.Context.hasSameType(P.back().Base->getType(),
 1285                                       BestPath->back().Base->getType())) {
 1288           << false << RD << BestPath->back().Base->getType()
 1289           << P.back().Base->getType();
 1297     QualType BaseType = BestPath->back().Base->getType();
 1319       << Paths.front().back().Base->getType();
 2267             ReturnStmts.back(),
 2931     if (DisplayedPaths.insert(Path->back().SubobjectNumber).second) {
 3656         ++InitFieldIndex.back();
 3955         if (Path->back().Base->isVirtual()) {
 3956           VirtualBaseSpec = Path->back().Base;
 7103     if (Classes.back()->isUnion())

  366   PushExpressionEvaluationContext(ExprEvalContexts.back().Context);

 1737     return BuildLiteralOperatorCall(R, OpNameInfo, Args, StringTokLocs.back());
 1757     return BuildLiteralOperatorCall(R, OpNameInfo, None, StringTokLocs.back(),
 1953             CodeSynthesisContexts.back().Kind ==
 4420   ExpressionEvaluationContextRecord &LastRecord = ExprEvalContexts.back();
 4434   ExpressionEvaluationContextRecord &LastRecord = ExprEvalContexts.back();
11987       ExprEvalContexts.back().VolatileAssignmentLHSs.push_back(LHSExpr);
13663     ExprEvalContexts.back().PossibleDerefs.insert(UO);
13774   PushExpressionEvaluationContext(ExprEvalContexts.back().Context);
14252   BlockScopeInfo *BSI = cast<BlockScopeInfo>(FunctionScopes.back());
15062   ExprEvalContexts.back().Context =
15077     std::swap(MaybeODRUseExprs, ExprEvalContexts.back().SavedMaybeODRUseExprs);
15084   Decl *ClosureContextDecl = ExprEvalContexts.back().ManglingContextDecl;
15146       auto &LHSs = ExprEvalContexts.back().VolatileAssignmentLHSs;
15154   ExpressionEvaluationContextRecord& Rec = ExprEvalContexts.back();
15215   ExprEvalContexts.back().NumTypos += NumTypos;
15220          ExprCleanupObjects.begin() + ExprEvalContexts.back().NumCleanupObjects,
15241   switch (SemaRef.ExprEvalContexts.back().Context) {
15359   switch (SemaRef.ExprEvalContexts.back().Context) {
17093   switch (ExprEvalContexts.back().Context) {
17108       FunctionScopes.back()->PossiblyUnreachableDiags.
17119             ExprEvalContexts.back().ManglingContextDecl)) {
17147   if (ExprEvalContexts.back().ExprContext ==
17149     ExprEvalContexts.back().DelayedDecltypeCalls.push_back(CE);

 2833       ParamDecls.back()->setImplicit();
 6489   bool IsDecltype = ExprEvalContexts.back().ExprContext ==
 6513     ExprEvalContexts.back().DelayedDecltypeBinds.push_back(Bind);
 6531   unsigned FirstCleanup = ExprEvalContexts.back().NumCleanupObjects;
 6572   assert(ExprEvalContexts.back().ExprContext ==
 6621   ExprEvalContexts.back().ExprContext =
 6635   for (unsigned I = 0, N = ExprEvalContexts.back().DelayedDecltypeCalls.size();
 6637     CallExpr *Call = ExprEvalContexts.back().DelayedDecltypeCalls[I];
 6648   for (unsigned I = 0, N = ExprEvalContexts.back().DelayedDecltypeBinds.size();
 6651       ExprEvalContexts.back().DelayedDecltypeBinds[I];
 7930   if (E && !ExprEvalContexts.empty() && ExprEvalContexts.back().NumTypos &&
 7937       ExprEvalContexts.back().NumTypos -= TyposResolved;

  134   switch (SemaRef.ExprEvalContexts.back().Context) {
 1750         ExprEvalContexts.back().PossibleDerefs.insert(E);

 2273     Replacements.back().setField(cast<FieldDecl>(*PI));
 7436               Path.back().Kind != IndirectLocalPathEntry::DefaultInit) {

  279   Decl *ManglingContextDecl = ExprEvalContexts.back().ManglingContextDecl;
 1235   LambdaScopeInfo *LSI = cast<LambdaScopeInfo>(FunctionScopes.back());
 1533   LambdaScopeInfo LSI = *cast<LambdaScopeInfo>(FunctionScopes.back());
 1826     switch (ExprEvalContexts.back().Context) {
 1846       ExprEvalContexts.back().Lambdas.push_back(Lambda);

 2328     const CXXBasePathElement &PathElement = Path->back();
 2546     QualType SubobjectType = Paths->front().back().Base->getType();
 4263   if (!CList.empty() && !CList.back().isResolved())
 4537     if (NamespaceDeclChain.empty() || NamespaceDeclChain.back() != C)
 4552                  dyn_cast_or_null<NamedDecl>(NamespaceDeclChain.back())) {
 5137   ExprEvalContexts.back().NumTypos++;

   62       ModuleScopes.back().Module->Kind == Module::GlobalModuleFragment) {
   67     ModuleScopes.back().BeginLoc = ModuleLoc;
   79   ModuleScopes.back().BeginLoc = ModuleLoc;
   80   ModuleScopes.back().Module = GlobalModule;
  133       ModuleScopes.back().Module->isModulePurview()) {
  135     Diag(VisibleModules.getImportLoc(ModuleScopes.back().Module),
  143       ModuleScopes.back().Module->Kind == Module::GlobalModuleFragment)
  144     GlobalModuleFragment = ModuleScopes.back().Module;
  153             : ModuleScopes.back().BeginLoc;
  224       ModuleScopes.back().OuterVisibleModules = std::move(VisibleModules);
  231   ModuleScopes.back().BeginLoc = StartLoc;
  232   ModuleScopes.back().Module = Mod;
  233   ModuleScopes.back().ModuleInterface = MDK != ModuleDeclKind::Implementation;
  254                                : ModuleScopes.back().Module->Kind) {
  262     Diag(ModuleScopes.back().BeginLoc, diag::note_previous_definition);
  269   if (!ModuleScopes.back().ModuleInterface) {
  271     Diag(ModuleScopes.back().BeginLoc,
  273         << FixItHint::CreateInsertion(ModuleScopes.back().BeginLoc, "export ");
  288           ModuleScopes.back().Module, PrivateLoc);
  293   ModuleScopes.back().BeginLoc = ModuleLoc;
  294   ModuleScopes.back().Module = PrivateModuleFragment;
  295   ModuleScopes.back().ModuleInterface = true;
  393     Context.addModuleInitializer(ModuleScopes.back().Module, Import);
  396   if (!ModuleScopes.empty() && ModuleScopes.back().ModuleInterface) {
  431       Context.addModuleInitializer(ModuleScopes.back().Module, ImportD);
  444   ModuleScopes.back().Module = Mod;
  446     ModuleScopes.back().OuterVisibleModules = std::move(VisibleModules);
  466     VisibleModules = std::move(ModuleScopes.back().OuterVisibleModules);
  472   assert(!ModuleScopes.empty() && ModuleScopes.back().Module == Mod &&
  536   if (ModuleScopes.empty() || !ModuleScopes.back().Module->isModulePurview()) {
  538   } else if (!ModuleScopes.back().ModuleInterface) {
  540     Diag(ModuleScopes.back().BeginLoc,
  542         << FixItHint::CreateInsertion(ModuleScopes.back().BeginLoc, "export ");
  543   } else if (ModuleScopes.back().Module->Kind ==
  546     Diag(ModuleScopes.back().BeginLoc, diag::note_private_module_fragment);

  192                          : Stack.back().first.rbegin() + IgnoredStackElements;
  195     return Stack.empty() ? iterator() : Stack.back().first.rend();
  214     return &Stack.back().first[Size - 1];
  231     return &Stack.back().first[Size - 2];
  245     return Stack.back().first[Level];
  313         Stack.back().second != CurrentNonCapturingFunctionScope)
  315     Stack.back().first.emplace_back(DKind, DirName, CurScope, Loc);
  316     Stack.back().first.back().DefaultAttrLoc = Loc;
  316     Stack.back().first.back().DefaultAttrLoc = Loc;
  322     assert(!Stack.back().first.empty() &&
  324     Stack.back().first.pop_back();
  392     if (!Stack.empty() && Stack.back().second == OldFSI) {
  393       assert(Stack.back().first.empty());
  790     MEC.Components.back().append(Components.begin(), Components.end());
 2988           CurComponents.back().getAssociatedDeclaration()->getCanonicalDecl());
 3675                CaptureRegions.back() != OMPD_unknown) {
12796       Lookups.back().addDecl(Underlying);
12820       Lookups.back().append(Lookup.begin(), Lookup.end());
12831         Lookups.back().addDecl(DRD);
12881         Lookups.back().append(Lookup.begin(), Lookup.end());
15140       Lookups.back().append(Lookup.begin(), Lookup.end());
15149       Lookups.back().addDecl(DMD);
15356       MVLI.VarComponents.back().append(CurComponents.begin(),
15365     CurDeclaration = CurComponents.back().getAssociatedDeclaration();
15498     MVLI.VarComponents.back().append(CurComponents.begin(),
16457     MVLI.VarComponents.back().push_back(
16540     MVLI.VarComponents.back().push_back(MC);

  211       if (auto *OVE = dyn_cast<OpaqueValueExpr>(Semantics.back()))
  233       if (auto *OVE = dyn_cast<OpaqueValueExpr>(Semantics.back()))

  385   return getCurFunction()->CompoundScopes.back();
  438       getCurFunction()->SwitchStack.back().getPointer()->getCond();
  488     getCurFunction()->SwitchStack.back().setInt(true);
  494   getCurFunction()->SwitchStack.back().getPointer()->addSwitchCase(CS);
  512   getCurFunction()->SwitchStack.back().getPointer()->addSwitchCase(DS);
  850   bool CaseListIsIncomplete = getCurFunction()->SwitchStack.back().getInt();
  851   assert(SS == getCurFunction()->SwitchStack.back().getPointer() &&
 2914       DestScope.Contains(*S.CurrentSEHFinally.back())) {
 3247   if (ExprEvalContexts.back().Context ==
 3392     FunctionScopes.back()->Returns.push_back(Result);
 3394   if (FunctionScopes.back()->FirstReturnLoc.isInvalid())
 3395     FunctionScopes.back()->FirstReturnLoc = ReturnLoc;
 3562   if (R.isInvalid() || ExprEvalContexts.back().Context ==
 3619   if (ExprEvalContexts.back().Context ==
 3811     FunctionScopes.back()->Returns.push_back(Result);
 3813   if (FunctionScopes.back()->FirstReturnLoc.isInvalid())
 3814     FunctionScopes.back()->FirstReturnLoc = ReturnLoc;

 2938         << NestedTypes.back();
 4104         Matched.back().Partial = Partial;
 4105         Matched.back().Args = Info.take();

 3036     const TemplateArgument &Arg = Builder.back();

  398   auto &Active = CodeSynthesisContexts.back();
  412     if (Module *M = CodeSynthesisContextLookupModules.back())
  429       auto &Active = SemaRef.CodeSynthesisContexts.back();
  435                   SemaRef.CodeSynthesisContexts.back());
 2528         Matched.back().Partial = Partial;
 2529         Matched.back().Args = Info.take();

 4038   ActiveInstType &ActiveInst = SemaRef.CodeSynthesisContexts.back();

 5147           RemovalRange = SourceRange(RemovalLocs.front(), RemovalLocs.back());

 2139       auto &Info = ModuleMacros.back();
 2396       while (!ImportStack.back()->ImportedBy.empty())
 2397         ImportStack.push_back(ImportStack.back()->ImportedBy[0]);
 2400       StringRef TopLevelPCHName(ImportStack.back()->FileName);
 2402           moduleKindForDiagnostic(ImportStack.back()->Kind);
 3766         Entry.SlotLabel = PragmaPackStrings.back();

  432     Clobbers.push_back(ClobbersData.back());
  446     Constraints.push_back(ConstraintsData.back());
  980       Designators.back().setField(Field);

 5754   if (Decls.empty() || Decls.back().first <= Offset) {

  276   os << " (type " << FieldChain.back()->getType().getAsString() << ")";

 1330     if (MatchingStatements.back() != nullptr) {
 1358     if (MatchingStatements.back() != nullptr)

 1180       assert(C.CallStack.back().first == Call);
 2948       WLItem &WI = WL.back();
 2978       if (!WL.empty() && &WL.back() == &WI)

  135   return itr.back();

   50     const WorkListUnit& U = Stack.back();
  110         const WorkListUnit& U = Stack.back();
  175       WorkListUnit &U = StackUnexplored.back();
  179       WorkListUnit &U = StackOthers.back();

  176       Disambiguated = (UnspelledScopes.back() + "::" + Disambiguated).str();

  292   auto &CurInclude = Iter->second.back();

   88     if (PartialNsNameSplitted.back() != CurrentNs->getNameAsString())
  258     Code = ("namespace " + NsSplitted.back() + " {\n" + Code +
  259             "} // namespace " + NsSplitted.back() + "\n")

  108   if (!llvm::sys::path::is_separator(Prefix.back()))

  386       (!Namespaces.empty() && Namespaces.back().RefType == InfoType::IT_record))

   45          !llvm::StringRef(QualifiedName).endswith(SymbolQualifiers.back())) {
   47         "::" + SymbolQualifiers.back().str() + StrippedQualifiers;

   95       auto Res = DB.get()->search(Names.back());
   99     LLVM_DEBUG(llvm::dbgs() << "Searching " << Names.back() << "... got "

   75         Level == DiagnosticsEngine::Note ? &Error.Notes.back() : &Error.Message;

  186         Branches.back().push_back(S);
  204         SourceLocation EndLoc = (EndCurrent - 1)->back()->getEndLoc();
  210           EndLoc = (EndCurrent - 1)->back()->getBeginLoc();

  196             Insertions.back().Initializers.emplace_back(getName(D));
  208         Insertions.back().Initializers.emplace_back(getName(D));

  100                                Namespaces.back()->getLocation());
  101   SourceRange BackReplacement(Namespaces.back()->getRBraceLoc(),

   40   StmtAncestors.insert(std::make_pair(Statement, StmtStack.back()));

  188           (GetText(Tokens.back(), Sources) == "0" ||
  189            Tokens.back().is(tok::kw_default) ||
  190            Tokens.back().is(tok::kw_delete)) &&
  196       } else if (GetText(Tokens.back(), Sources) == "ABSTRACT")
  197         InsertLoc = Tokens.back().getLocation();

   61     if (!IfStack.empty() && IfLoc == IfStack.back().Loc)
   63     if (!IfdefStack.empty() && IfLoc == IfdefStack.back().Loc)
   65     if (!IfndefStack.empty() && IfLoc == IfndefStack.back().Loc)

   37     ast_type_traits::DynTypedNode Node = NodesToProcess.back();

  100   SourceLocations.push_back(IncludeLocations[FileName].back());
  140     const std::string &LastInclude = IncludeBucket[IncludeKind].back();
  141     SourceRange LastIncludeLocation = IncludeLocations[LastInclude].back();
  164     const std::string &LastInclude = IncludeBucket[NonEmptyKind].back();
  165     SourceRange LastIncludeLocation = IncludeLocations[LastInclude].back();
  172   SourceRange FirstIncludeLocation = IncludeLocations[FirstInclude].back();

  363     BundledEntry &S = Bundled.back();

  290   const SelectionTree::Node *End = Op.SelectedOperands.back();    // RHS
  297       Start = Op.SelectedOperands.back();

 1601   auto &Include = C.Includes.back();

  136   return LookupDecl(*Scope, Components.back());

 3210     WL = WorkListFreeList.back();
 3254     SourceRange R(Pieces.front().getBegin(), Pieces.back().getEnd());
 7254   const PostChildrenInfo &Info = PostChildrenInfos.back();

  247     IdxCtx.getEntityInfo(PD, ProtEntities.back(), SA);
  357       IdxCtx.getEntityInfo(BaseD, BaseEntities.back(), SA);

  318     CurrentDiags.back()->getChildDiagnostics().appendDiagnostic(std::move(D));
  356   CurrentDiags.back()->Ranges.push_back(SR);
  370   CurrentDiags.back()->FixIts.push_back(
  378   CXLoadedDiagnostic &D = *CurrentDiags.back();

   36   ASSERT_EQ(pp_eof, Tokens.back().K);
   42   ASSERT_EQ(pp_eof, Tokens.back().K);

   75   assert(TraversalStack.back() == D);

   48         Visitor.DeclStack.back()->getDeclContext(), FD, ReplacementString);
  188         nullptr, TLoc.getBeginLoc(), Visitor.DeclStack.back()->getDeclContext(),

 1373   auto Err = Changes.back().replace(
 1509   Changes.back().addHeader("b");
 1510   Changes.back().addHeader("c");
 1512   Changes.back().addHeader("a");
 1527   Changes.back().removeHeader("b");
 1541   Changes.back().addHeader("<asys>"); // Already exists.
 1542   Changes.back().addHeader("<b>");
 1543   Changes.back().addHeader("<d>");
 1544   Changes.back().addHeader("\"b-already-escaped\"");
 1564   Changes.back().removeHeader("<a>");
 1592   Changes.back().addHeader("a");
 1612   Changes.back().removeHeader("a");
 1628   auto Err = Changes.back().replace(Context.Sources, getLoc(9), 3, "");
 1630   Err = Changes.back().replace(Context.Sources, getLoc(35), 3, "");
 1632   Err = Changes.back().replace(Context.Sources, getLoc(51), 3, "");
 1634   Err = Changes.back().replace(Context.Sources, getLoc(56), 3, "");
 1636   Err = Changes.back().replace(Context.Sources, getLoc(72), 3, "");
 1638   Err = Changes.back().replace(Context.Sources, getLoc(97), 3, "");
 1640   Err = Changes.back().replace(Context.Sources, getLoc(118), 3, "");
 1655   auto Err = Changes.back().replace(Context.Sources, getLoc(7), 5, "");
 1657   Err = Changes.back().replace(Context.Sources, getLoc(23), 8, "");
 1659   Err = Changes.back().replace(Context.Sources, getLoc(36), 1, "");
 1661   Err = Changes.back().replace(Context.Sources, getLoc(45), 3, "");
 1663   Err = Changes.back().replace(Context.Sources, getLoc(53), 1, "");
 1665   Err = Changes.back().replace(Context.Sources, getLoc(56), 1, "");
 1679   auto Err = Changes.back().replace(Context.Sources, getLoc(7), 5, "");
 1681   Err = Changes.back().replace(Context.Sources, getLoc(23), 8, "");
 1683   Err = Changes.back().replace(Context.Sources, getLoc(36), 1, "");
 1685   Err = Changes.back().replace(Context.Sources, getLoc(45), 3, "");
 1687   Err = Changes.back().replace(Context.Sources, getLoc(53), 1, "");
 1689   Err = Changes.back().replace(Context.Sources, getLoc(56), 1, "");
 1707   auto Err = Changes.back().replace(Context.Sources, getLoc(4), 1, "");
 1709   Err = Changes.back().replace(Context.Sources, getLoc(4), 0, "b");
 1711   Err = Changes.back().replace(Context.Sources, getLoc(11), 0, "a");
 1713   Err = Changes.back().replace(Context.Sources, getLoc(11), 1, "");

  918     WorklistItem Current = Worklist.back();
  932       Worklist.back().ChildInfo = &MyInfo;

  571         auto E = TempFiles.back().createTempFile();
  577         auto &TempFile = *(TempFiles.back().File);

  736   s.openingRecord->ptrParent = stack.empty() ? 0 : stack.back().scopeOffset;

  196             minimal_ranges.back().SetRangeEnd(
  681           minimal_ranges.back().SetRangeEnd(pos->GetRangeEnd());
  812   Entry *Back() { return (m_entries.empty() ? nullptr : &m_entries.back()); }

  164   if (PartialItem == "." && path::is_separator(CompletionBuffer.back()))

   41     DWARFDIE die = m_worklist.back();

 5638                          ? array_info->element_orders.back()

   84   return stack.back();
   91   if (exprs.empty() || !exprs.back().trim().empty())

  395     if (!sys::path::is_separator(NativePath.back()))

  565     Snippets.back() = Highlight(Snippets.back(), 1, 1 + Snippets.back().size());
  565     Snippets.back() = Highlight(Snippets.back(), 1, 1 + Snippets.back().size());
  565     Snippets.back() = Highlight(Snippets.back(), 1, 1 + Snippets.back().size());

  148   Differences |= contexts.back().Differences;

  580   while (Path.back() == DC_match)

  140       Variables.back().Index = VariableIndex;

  638         Slices.emplace_back(ExtractedObjects.back().get(), O.getAlign());
  691       static_cast<uint64_t>(FatArchList.back().offset) +
  692       FatArchList.back().size;

 8152       (IndexEntries.back().LSDAStart - IndexEntries[0].LSDAStart) / LSDASize;

  489     const auto Reader = Readers.back().get();

  351     if (Result.size() > 0 && Result.back() == '\0')

  214     if (ThreadStack.size() == 0 || ThreadStack.back().FuncId != Record.FuncId) {
  226       while (ThreadStack.back().FuncId != Record.FuncId) {
  227         TimestampT D = diff(ThreadStack.back().TSC, Record.TSC);
  228         VertexIdentifier TopFuncId = ThreadStack.back().FuncId;
  231         EdgeIdentifier EI(ThreadStack.back().FuncId, TopFuncId);
  238     uint64_t D = diff(ThreadStack.back().TSC, Record.TSC);
  240     VertexIdentifier VI = ThreadStack.empty() ? 0 : ThreadStack.back().FuncId;

  385       auto &Top = TS.back();
  434       auto &Deepest = TS.back();
  593     while (lineage.back()->Parent != nullptr)
  594       lineage.push_back(lineage.back()->Parent);
  596       OS << Converter.SymbolOrNumber(lineage.back()->FuncId) << ";";

 2396     MinMaxAliasGroups.back().first = MinMaxAccessesReadWrite;
 2397     MinMaxAliasGroups.back().second = MinMaxAccessesReadOnly;

 1176   assert(LoopStack.size() == 1 && LoopStack.back().L == L);
 1235     Loop *LastLoop = LoopStack.back().L;

  110                     : MDNode::concatenate(ParallelLoops.back(), Id);
  198     Inst->setMetadata("llvm.mem.parallel_loop_access", ParallelLoops.back());

  373   EXPECT_TRUE(*it == this->theVector.back());
  912     EXPECT_TRUE(&back == &V.back());
  923     EXPECT_TRUE(&back == &V.back());
  934     EXPECT_TRUE(&back == &V.back());
  945     EXPECT_TRUE(&back == &V.back());
  956     EXPECT_TRUE(&back == &V.back());
  967     EXPECT_TRUE(&back == &V.back());

  243   ToSerializeRemark.Args.back().Key = "Callee";
  244   ToSerializeRemark.Args.back().Val = "bar";
  246   ToSerializeRemark.Args.back().Key = "String";
  247   ToSerializeRemark.Args.back().Val = " will not be inlined into ";
  249   ToSerializeRemark.Args.back().Key = "Caller";
  250   ToSerializeRemark.Args.back().Val = "foo";
  251   ToSerializeRemark.Args.back().Loc = remarks::RemarkLocation{"file.c", 2, 0};
  253   ToSerializeRemark.Args.back().Key = "String";
  254   ToSerializeRemark.Args.back().Val = " because its definition is unavailable";

  199   R.Args.back().Key = "key";
  200   R.Args.back().Val = "value";
  228   R.Args.back().Key = "key";
  229   R.Args.back().Val = "value";
  230   R.Args.back().Loc.emplace();
  231   R.Args.back().Loc->SourceFilePath = "path";
  232   R.Args.back().Loc->SourceLine = 99;
  233   R.Args.back().Loc->SourceColumn = 55;
  267   R.Args.back().Key = "key";
  268   R.Args.back().Val = "value";
  269   R.Args.back().Loc.emplace();
  270   R.Args.back().Loc->SourceFilePath = "argpath";
  271   R.Args.back().Loc->SourceLine = 11;
  272   R.Args.back().Loc->SourceColumn = 66;
  317   R.Args.back().Key = "key";
  318   R.Args.back().Val = "value";
  319   R.Args.back().Loc.emplace();
  320   R.Args.back().Loc->SourceFilePath = "argpath";
  321   R.Args.back().Loc->SourceLine = 11;
  322   R.Args.back().Loc->SourceColumn = 66;

   24   R.Args.back().Key = "key";
   25   R.Args.back().Val = "value";
   27   R.Args.back().Key = "keydebug";
   28   R.Args.back().Val = "valuedebug";
   29   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};
   41   R3.Args.back().Val = "not";
   54   R.Args.back().Key = "key";
   55   R.Args.back().Val = "value";
   57   R.Args.back().Key = "keydebug";
   58   R.Args.back().Val = "valuedebug";
   59   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};
   70   R.Args.back().Key = "key";
   71   R.Args.back().Val = "can not do this ";
   73   R.Args.back().Key = "keydebug";
   74   R.Args.back().Val = "because of that.";
   75   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};
   93   R.Args.back().Key = "keydebug";
   94   R.Args.back().Val = "valuedebug";
   95   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};
  106   EXPECT_NE(R.Args.back().Key.data(), R2.Args.back().Key.data());
  106   EXPECT_NE(R.Args.back().Key.data(), R2.Args.back().Key.data());
  107   EXPECT_NE(R.Args.back().Val.data(), R2.Args.back().Val.data());
  107   EXPECT_NE(R.Args.back().Val.data(), R2.Args.back().Val.data());
  108   EXPECT_NE(R.Args.back().Loc->SourceFilePath.data(),
  109             R2.Args.back().Loc->SourceFilePath.data());
  117   EXPECT_EQ(StrTab.add(R.Args.back().Key).second.data(),
  118             R2.Args.back().Key.data());
  119   EXPECT_EQ(StrTab.add(R.Args.back().Val).second.data(),
  120             R2.Args.back().Val.data());
  121   EXPECT_EQ(StrTab.add(R.Args.back().Loc->SourceFilePath).second.data(),
  122             R2.Args.back().Loc->SourceFilePath.data());

   79   R.Args.back().Key = "key";
   80   R.Args.back().Val = "value";
   82   R.Args.back().Key = "keydebug";
   83   R.Args.back().Val = "valuedebug";
   84   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};
  112   R.Args.back().Key = "key";
  113   R.Args.back().Val = "value";
  115   R.Args.back().Key = "keydebug";
  116   R.Args.back().Val = "valuedebug";
  117   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};
  142   R.Args.back().Key = "key";
  143   R.Args.back().Val = "value";
  145   R.Args.back().Key = "keydebug";
  146   R.Args.back().Val = "valuedebug";
  147   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};
  178   R.Args.back().Key = "key";
  179   R.Args.back().Val = "value";
  181   R.Args.back().Key = "keydebug";
  182   R.Args.back().Val = "valuedebug";
  183   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};
  218   R.Args.back().Key = "key";
  219   R.Args.back().Val = "value";
  221   R.Args.back().Key = "keydebug";
  222   R.Args.back().Val = "valuedebug";
  223   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};
  252   R.Args.back().Key = "key";
  253   R.Args.back().Val = "value";
  255   R.Args.back().Key = "keydebug";
  256   R.Args.back().Val = "valuedebug";
  257   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};
  292   R.Args.back().Key = "key";
  293   R.Args.back().Val = "value";
  295   R.Args.back().Key = "keydebug";
  296   R.Args.back().Val = "valuedebug";
  297   R.Args.back().Loc = remarks::RemarkLocation{"argpath", 6, 7};

  201 	return c.back();

  841   CodeGenRegisterClass &Super = *SuperClasses.back();

  669       RegUnit &RU = RegUnits.back();
  682       RegUnits.back().Weight = Weight;

 1556     SmallVectorImpl<unsigned> &Seq = RWSequences.back();
 1588           TransVec[TransIdx].ReadSequences.back().push_back(*RWI);
 1590           TransVec[TransIdx].WriteSequences.back().push_back(*RWI);
 1703     SmallVectorImpl<unsigned> &Seq = LastTransitions[0].WriteSequences.back();
 1712     SmallVectorImpl<unsigned> &Seq = LastTransitions[0].ReadSequences.back();

  356       Types.back() = TypeOverride;

 2275   if (Stash.back().get() == &OpcMatcher) {

  723       Rows.back().resize(SubRegIndicesSize);
  724       combine(&Idx, Rows.back());

  677         if (!parseFieldType(Table->Fields.back(), TypeOfVal->getValue())) {