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

References

  828     if (!ArgsV.back())

  828     if (!ArgsV.back())

  827     if (!ArgsV.back())

  813     if (!ArgsV.back())

  837     if (!ArgsV.back())

  459     if (!ArgsV.back())

  487     if (!ArgsV.back())

  614     if (!ArgsV.back())

  726     if (!ArgsV.back())

  833     if (!ArgsV.back())

  832     if (!ArgsV.back())

  837     Scope = LexicalBlocks.back();
  993     if (!ArgsV.back())

  121       NodeRef Node = VisitStack.back().first;
  122       Optional<ChildItTy> &Opt = VisitStack.back().second;

  466       T = freeNodes.back();

   85   std::pair<KeyT, ValueT>       &back()        { return Vector.back(); }
  161     typename MapType::iterator Pos = Map.find(Vector.back().first);

  127     while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
  127     while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
  128       NodeRef BB = *VisitStack.back().second++;
  129       if (this->insertEdge(Optional<NodeRef>(VisitStack.back().first), BB)) {
  164     this->finishPostorder(VisitStack.back().first);

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

  157   while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
  157   while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
  159     NodeRef childN = *VisitStack.back().NextChild++;
  169     if (VisitStack.back().MinVisited > childNum)
  170       VisitStack.back().MinVisited = childNum;
  180     NodeRef visitingN = VisitStack.back().Node;
  181     unsigned minVisitNum = VisitStack.back().MinVisited;
  182     assert(VisitStack.back().NextChild == GT::child_end(visitingN));
  186     if (!VisitStack.empty() && VisitStack.back().MinVisited > minVisitNum)
  187       VisitStack.back().MinVisited = minVisitNum;
  203       CurrentSCC.push_back(SCCNodeStack.back());
  205       nodeVisitNumbers[CurrentSCC.back()] = ~0U;
  206     } while (CurrentSCC.back() != visitingN);

  307         UnknownInsts[i] = UnknownInsts.back();

  219       CalledFunctions.back().second->DropRef();
  242     *I = CalledFunctions.back();

  170     DFCalculateWorkObject<BlockT> *currentW = &workList.back();

  135   Interval *operator*() { return IntStack.back().first; }
  144       Interval::succ_iterator &SuccIt = IntStack.back().second,
  145                                 EndIt = succ_end(IntStack.back().first);
  153       if (IOwnMem) delete IntStack.back().first;

  429     BlockT *PredBB = ReverseCFGWorklist.back();

   74     RegionT *R = RegionQueue.back();
   92     RegionT *R = RegionQueue.back();

  336     N.Map = Maps.back().get();
  344     N.Array = Arrays.back().get();
  365     memcpy(&Strings.back()[0], S.data(), S.size());
  366     return StringRef(&Strings.back()[0], S.size());

   72     BlockInfoRecords.back().BlockID = BlockID;
   73     return BlockInfoRecords.back();

  189     if (!BlockInfoRecords.empty() && BlockInfoRecords.back().BlockID == BlockID)
  190       return &BlockInfoRecords.back();
  218     BlockScope.back().PrevAbbrevs.swap(CurAbbrevs);
  230     const Block &B = BlockScope.back();
  524     BlockInfoRecords.back().BlockID = BlockID;
  525     return BlockInfoRecords.back();

  565     *I = Queue.back();

  130   int getFinalCycle() { return Cycle[ScheduledInstrs.back()]; }

   87         G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
   88         AdjEdgeIds[Idx] = AdjEdgeIds.back();
  195         NId = FreeNodeIds.back();
  210         EId = FreeEdgeIds.back();

  188       NodeId NId = stack.back();

  391     return &SUnits.back();

   91     Instructions.back().Ops.push_back(Operand1);
   97     Instructions.back().Ops.push_back(Operand1);
   98     Instructions.back().Ops.push_back(Operand2);

  728     return *Sections.back();

  216       SourceModules.back().SourceMod = std::move(M);

   96     auto TrampolineAddr = AvailableTrampolines.back();
  379     auto Key = FreeStubs.back();

   77       Unmapped.back().CodeAllocs.emplace_back(Size, Alignment);
   79           Unmapped.back().CodeAllocs.back().getLocalAddress());
   79           Unmapped.back().CodeAllocs.back().getLocalAddress());
   90         Unmapped.back().RODataAllocs.emplace_back(Size, Alignment);
   92             Unmapped.back().RODataAllocs.back().getLocalAddress());
   92             Unmapped.back().RODataAllocs.back().getLocalAddress());
   99       Unmapped.back().RWDataAllocs.emplace_back(Size, Alignment);
  101           Unmapped.back().RWDataAllocs.back().getLocalAddress());
  101           Unmapped.back().RWDataAllocs.back().getLocalAddress());
  117         Unmapped.back().RemoteCodeAddr =
  122                    << format("0x%016" PRIx64, Unmapped.back().RemoteCodeAddr)
  128         Unmapped.back().RemoteRODataAddr =
  133                    << format("0x%016" PRIx64, Unmapped.back().RemoteRODataAddr)
  139         Unmapped.back().RemoteRWDataAddr =
  144                    << format("0x%016" PRIx64, Unmapped.back().RemoteRWDataAddr)
  425       auto Key = FreeStubs.back();
  463       auto TrampolineAddr = AvailableTrampolines.back();

  152       ResourceId I = FreeIds.back();

  838     auto SequenceNumber = FreeSequenceNumbers.back();

   70     return ItemEndOffsets.empty() ? 0 : ItemEndOffsets.back();

 1145     std::swap(*ChIt, IDom->Children.back());

  173   Value &back() { return V.back(); }

  191       *I = CalledFunctions.back();
  205       CalledFunctions[i] = CalledFunctions.back();
  219       *I = CalledFunctions.back();

  370     const Instruction &I = *Worklist.back();

  456     AllocsForIndirectGlobals[AllocRelatedValues.back()] = GV;
  457     Handles.emplace_front(*this, AllocRelatedValues.back());

  315     BasicBlock *ToUpdate = worklist.back();

  251     BasicBlock *BB = InfluenceStack.back();
  268     Value *V = Worklist.back();

 1055     NonLocalDepEntry Val = Cache.back();
 1065       NonLocalDepEntry Val = Cache.back();

 1957     if (convertToString(Record, 0, BundleTags.back()))
 2244     unsigned ValID = GlobalInitWorklist.back().second;
 2247       GlobalInits.push_back(GlobalInitWorklist.back());
 2250         GlobalInitWorklist.back().first->setInitializer(C);
 2258     unsigned ValID = IndirectSymbolInitWorklist.back().second;
 2260       IndirectSymbolInits.push_back(IndirectSymbolInitWorklist.back());
 2265       GlobalIndirectSymbol *GIS = IndirectSymbolInitWorklist.back().first;
 2274     unsigned ValID = FunctionPrefixWorklist.back().second;
 2276       FunctionPrefixes.push_back(FunctionPrefixWorklist.back());
 2279         FunctionPrefixWorklist.back().first->setPrefixData(C);
 2287     unsigned ValID = FunctionPrologueWorklist.back().second;
 2289       FunctionPrologues.push_back(FunctionPrologueWorklist.back());
 2292         FunctionPrologueWorklist.back().first->setPrologueData(C);
 2300     unsigned ValID = FunctionPersonalityFnWorklist.back().second;
 2302       FunctionPersonalityFns.push_back(FunctionPersonalityFnWorklist.back());
 2305         FunctionPersonalityFnWorklist.back().first->setPersonalityFn(C);
 2944   Function *Fn = FunctionsWithBodies.back();

  161     Value *RealVal = operator[](ResolveConstants.back().second);
  162     Constant *Placeholder = ResolveConstants.back().first;

 3151     return !VE.UseListOrders.empty() && VE.UseListOrders.back().F == F;
 3159     writeUseList(std::move(VE.UseListOrders.back()));

  234   assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
  236     Stack.back().Shuffle[I] = List[I].second;

  468       CurBlockInfo->Abbrevs.push_back(std::move(CurAbbrevs.back()));

  985     unsigned CurHash = MergePotentials.back().getHash();

  229   MachineInstr *UndefMI = UndefReads.back().first;
  230   unsigned OpIdx = UndefReads.back().second;
  244       UndefMI = UndefReads.back().first;
  245       OpIdx = UndefReads.back().second;

  384       OutList.push_back(InList.back());

   76   GCFunctionInfo *GFI = Functions.back().get();

  267     return UsedGlobalSets.back();
  474         Inits.push_back(ConstantAggregateZero::get(Tys.back()));

  486       std::unique_ptr<IfcvtToken> Token = std::move(Tokens.back());

  129     std::swap(*Best, Queue.back());
  139     std::swap(*I, Queue.back());

  125     MachineBasicBlock *Pred = WorkList.back();
  140   if (!VRInfo.Kills.empty() && VRInfo.Kills.back()->getParent() == MBB) {
  143     VRInfo.Kills.back() = &MI;

 1239     MachineBasicBlock *dst = Chain.Edges.back();

  116   BBCallbacks.back().setMap(this);

  522         SuffixTreeNode *Curr = ToVisit.back();

 3528     SUnit *SU = ReadyQ.back();

  559         PendingQueue[i] = PendingQueue.back();

  591     unsigned VReg = Worklist.back();

  496     SUnit *SU = WorkList.back();
  577     SU = WorkList.back();
  620     const SUnit *SU = WorkList.back();
  654     const SUnit *SU = WorkList.back();

 1413   void advance() { ++DFSStack.back().second; }
 1417     return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second);

  610     std::swap(*Best, Queue.back());
  622     std::swap(*I, Queue.back());

  622     PendingQueue[i] = PendingQueue.back();
  949   SUnit *OldSU = Sequence.back();
  958     OldSU = Sequence.back();
 1813       std::swap(*I, Queue.back());
 1847     std::swap(*Best, Q.back());

   77   SUnits.back().OrigNode = &SUnits.back();
   77   SUnits.back().OrigNode = &SUnits.back();
   78   SUnit *SU = &SUnits.back();

  192         PendingQueue[i] = PendingQueue.back();

 2085     Ops.push_back(InOps.back());

 4194     AsmOperandInfo &OpInfo = ConstraintOperands.back();

  383   auto &Locations = CSInfos.back().Locations;

  110   auto &Entry = Entries.back();
  121   auto &Entry = Entries.back();

   82   Block &B = Blocks.back();
   93   Block &B = Blocks.back();

  924     DWARFDie DIE = Worklist.back();

   92       if (!Aranges.empty() && Aranges.back().HighPC() == PrevAddress &&
   93           ValidCUs.find(Aranges.back().CUOffset) != ValidCUs.end()) {
   94         Aranges.back().setHighPC(E.Address);

  133           Instructions.back().Expression = DWARFExpression(
  146           Instructions.back().Expression = DWARFExpression(
  524             Entries.back()->cfis().parse(Data, &Offset, EndStructureOffset)) {

   29     Set &SetData = Sets.back();

  401     DWARFDie Die = Worklist.back();

  127     auto CachedAlloc = CacheItem.second.back();

  118   return *ModiList.back();
  363     auto &Entry = Ret.back();

  261     PublicsByAddr.emplace_back(&Sym, &DeserializedPublics.back());

   63   ExecutionContext &SF = ECStack.back();
  332   ExecutionContext &SF = ECStack.back();
  664   ExecutionContext &SF = ECStack.back();
  735   ExecutionContext &SF = ECStack.back();
  860   ExecutionContext &SF = ECStack.back();
  904     ExecutionContext &CallingSF = ECStack.back();
  917   ExecutionContext &SF = ECStack.back();
  935   ExecutionContext &SF = ECStack.back();
  948   ExecutionContext &SF = ECStack.back();
  967   ExecutionContext &SF = ECStack.back();
 1016   ExecutionContext &SF = ECStack.back();
 1041     ECStack.back().Allocas.add(Memory);
 1086   ExecutionContext &SF = ECStack.back();
 1092   ExecutionContext &SF = ECStack.back();
 1103   ExecutionContext &SF = ECStack.back();
 1117   ExecutionContext &SF = ECStack.back();
 1190   ExecutionContext &SF = ECStack.back();
 1217   ExecutionContext &SF = ECStack.back();
 1244   ExecutionContext &SF = ECStack.back();
 1708   ExecutionContext &SF = ECStack.back();
 1713   ExecutionContext &SF = ECStack.back();
 1718   ExecutionContext &SF = ECStack.back();
 1723   ExecutionContext &SF = ECStack.back();
 1728   ExecutionContext &SF = ECStack.back();
 1733   ExecutionContext &SF = ECStack.back();
 1738   ExecutionContext &SF = ECStack.back();
 1743   ExecutionContext &SF = ECStack.back();
 1748   ExecutionContext &SF = ECStack.back();
 1753   ExecutionContext &SF = ECStack.back();
 1758   ExecutionContext &SF = ECStack.back();
 1763   ExecutionContext &SF = ECStack.back();
 1771   ExecutionContext &SF = ECStack.back();
 1800   ExecutionContext &SF = ECStack.back();
 1833   ExecutionContext &SF = ECStack.back();
 1865   ExecutionContext &SF = ECStack.back();
 1933   ExecutionContext &SF = ECStack.back();
 1976   ExecutionContext &SF = ECStack.back();
 2124   assert((ECStack.empty() || !ECStack.back().Caller.getInstruction() ||
 2125           ECStack.back().Caller.arg_size() == ArgVals.size()) &&
 2129   ExecutionContext &StackFrame = ECStack.back();
 2163     ExecutionContext &SF = ECStack.back();  // Current stack frame

   72     callFunction(AtExitHandlers.back(), None);

  184     return &(ECStack.back ().VarArgs[0]);

  311     auto *Sym = Worklist.back();

  416     if (!SecNSymStack.empty() && isAltEntry(*SecNSymStack.back()))
  422     if (SecNSymStack.back()->Value != NSec.Address) {
  423       auto AnonBlockSize = SecNSymStack.back()->Value - NSec.Address;
  440       BlockSyms.push_back(SecNSymStack.back());
  443              (isAltEntry(*SecNSymStack.back()) ||
  444               SecNSymStack.back()->Value == BlockSyms.back()->Value)) {
  445         BlockSyms.push_back(SecNSymStack.back());
  453                                       : SecNSymStack.back()->Value;

  645     std::swap(*I, EventListeners.back());

  608     auto QuerySymbols = std::move(QueryInfos.back().first);
  609     auto QueryInfo = std::move(QueryInfos.back().second);
  965       auto SymI = Worklist.back().SymI;
  966       auto ResolvedSym = Worklist.back().ResolvedSym;
 1032       auto SymI = Worklist.back();
 1151       assert(Worklist.back().first && "Failed JITDylib can not be null");
 1152       auto &JD = *Worklist.back().first;
 1153       auto Name = std::move(Worklist.back().second);
 1718     if (PendingQueries.back()->getRequiredState() > RequiredState)
 1721     Result.push_back(std::move(PendingQueries.back()));
 1847       JDs.front()->addToSearchOrder(*JDs.back());
 1848     return *JDs.back();
 2125         JITDylibAndMU = std::move(OutstandingMUs.back());

  404     Err = joinErrors(std::move(Err), Allocs.back()->deallocate());
  475     auto EHFrameRange = EHFrameRanges.back();

  441       std::swap(*I, EventListeners.back());

  131     MemMgr = MemMgrs.back().get();

  239   assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
  241     Stack.back().Shuffle[I] = List[I].second;
 4170       [&]() { return !UseListOrders.empty() && UseListOrders.back().F == F; };
 4177     printUseListOrder(UseListOrders.back());

  147       unsigned N = atoi(pCodes->back().c_str());

  511   _symbols.back().attributes &= ~LTO_SYMBOL_SCOPE_MASK;
  512   _symbols.back().attributes |= scope;

 1431     GlobalValue *GV = Worklist.back();

  296               FilteredLines.back().getFileNum() != IA.File ||
  297               FilteredLines.back().getLine() != IA.Line ||
  298               FilteredLines.back().getColumn() != IA.Col) {

  225   DataRegionData &Data = Regions.back();

 2818   jumpToLoc(ActiveMacros.back()->ExitLoc, ActiveMacros.back()->ExitBuffer);
 2818   jumpToLoc(ActiveMacros.back()->ExitLoc, ActiveMacros.back()->ExitBuffer);
 2822   delete ActiveMacros.back();
 4377     if (!Parameters.empty() && Parameters.back().Vararg)
 4379                    "Vararg parameter '" + Parameters.back().Name +
 4604   while (TheCondStack.size() != ActiveMacros.back()->CondStackDepth) {
 4605     TheCondState = TheCondStack.back();
 5203     LastIgnoreState = TheCondStack.back().Ignore;
 5237     LastIgnoreState = TheCondStack.back().Ignore;
 5264     if (TheCondStack.back().Ignore) {
 5289     if (TheCondStack.back().Ignore) {
 5322     TheCondState = TheCondStack.back();

  258   return !DwarfFrameInfos.empty() && !DwarfFrameInfos.back().End;
  268   return &DwarfFrameInfos.back();
  684   CurrentWinFrameInfo = WinFrameInfos.back().get();
  719   CurrentWinFrameInfo = WinFrameInfos.back().get();
  957   if ((!DwarfFrameInfos.empty() && !DwarfFrameInfos.back().End) ||
  958       (!WinFrameInfos.empty() && !WinFrameInfos.back()->End)) {

  197     WinEH::Instruction inst = info->Instructions.back();
  619     WinEH::Instruction inst = info->Instructions.back();

  243   return Symbols.back().get();
  255   return Sections.back().get();

  453   return Parent->ThinBuffers.back()->getBuffer();

  165     Tok = Stack.back();

  199   storage::Symbol &Sym = Syms.back();
  208     Unc = &Uncommons.back();

  624     Symbols.emplace_back(LinkingData.SymbolTable.back(), GlobalType, EventType,
  626     LLVM_DEBUG(dbgs() << "Adding symbol: " << Symbols.back() << "\n");
  962     if (Tables.back().ElemType != wasm::WASM_TYPE_FUNCREF) {

  443               Context, InputFilenames[Child->Origin], InputFilenames.back()));

 1773       PipelineStack.push_back(&Pipeline.back().InnerPipeline);

  384       const auto &Last = Segments.back();
  398       const auto &Last = Segments.back();

  521   VDataPtrOrErr.get()->deserializeTo(DataBuffer.back(), nullptr);

  203     change_ty Change = Worklist.back();

  842   return NumericVariables.back().get();
  850   return Substitutions.back().get();
  858   return Substitutions.back().get();
 1157     ImplicitNegativeChecks.back().parsePattern(PatternInBuffer,
 1256     std::swap(DagNotMatches, CheckStrings->back().DagNotStrings);
 1266     std::swap(DagNotMatches, CheckStrings->back().DagNotStrings);

  122     Width = std::max(Width, Targets.back().first.size());

 1246       ParentEntry = FS->Roots.back().get();

  578   if (!PrepIncludeStack.back()->empty()) {
  696     PrepIncludeStack.back()->push_back(
  724     if (PrepIncludeStack.back()->empty())
  727     PreprocessorControlDesc IfdefEntry = PrepIncludeStack.back()->back();
  727     PreprocessorControlDesc IfdefEntry = PrepIncludeStack.back()->back();
  736     PrepIncludeStack.back()->pop_back();
  737     PrepIncludeStack.back()->push_back(
  757     if (PrepIncludeStack.back()->empty())
  760     auto &IfdefOrElseEntry = PrepIncludeStack.back()->back();
  760     auto &IfdefOrElseEntry = PrepIncludeStack.back()->back();
  771     PrepIncludeStack.back()->pop_back();
 1001   for (auto I = PrepIncludeStack.back()->rbegin(),
 1002             E = PrepIncludeStack.back()->rend();
 1012   if (PrepIncludeStack.back()->empty())
 1016   auto &PrepControl = PrepIncludeStack.back()->back();
 1016   auto &PrepControl = PrepIncludeStack.back()->back();

  348     Loops.back()->Entries.push_back(std::move(E));
  383       return resolve(Loop.Entries, Substs, Final, &Dest->back().Loop->Entries,
 2809   std::unique_ptr<ForeachLoop> Loop = std::move(Loops.back());

  269     DisasmLineMaxLen = std::max(DisasmLineMaxLen, DisasmLines.back().size());
  282     DisasmLineMaxLen = std::max(DisasmLineMaxLen, DisasmLines.back().size());

  266   auto &Kernel = HSAMetadata.mKernels.back();
  284   auto &Attrs = HSAMetadata.mKernels.back().mAttrs;
  367   HSAMetadata.mKernels.back().mArgs.push_back(Kernel::Arg::Metadata());
  368   auto &Arg = HSAMetadata.mKernels.back().mArgs.back();
  368   auto &Arg = HSAMetadata.mKernels.back().mArgs.back();
  475   auto &Kernel = HSAMetadata.mKernels.back();
  482   HSAMetadata.mKernels.back().mCodeProps = CodeProps;
  483   HSAMetadata.mKernels.back().mDebugProps = DebugProps;

  342       std::string &DisasmLine = DisasmLines.back();
  357       std::string &HexLine = HexLines.back();

  315              if (!Regions.empty() && Regions.back()->Begin == RegionBegin) {
  317                Regions.back()->MaxPressure.print(

  204   CFStack::StackItem Top = BranchStack.back();
  537           LastAlu.back() = nullptr;
  543           LastAlu.back() = nullptr;
  545           LastAlu.back() = &*MI;
  585               std::move(LoopStack.back());
  607           MachineInstr * JumpInst = IfThenElseStack.back();
  622           if (LastAlu.back()) {
  623             ToPopAfter.push_back(LastAlu.back());
  634           MachineInstr *IfOrElseInst = IfThenElseStack.back();
  647           LoopStack.back().second.insert(MIb);
  655           LoopStack.back().second.insert(MIb);

  557   TransOps = std::move(IGSrcs.back());

  461     SU = AQ.back();

  319   CompatibleRSI = PreviousRegSeq[MIs.back()];

  235       if (getSlot(MI) <= getSlot(*CurrentPacketMIs.back())) {
  308       MI.getOperand(Op).setImm(BS.back());
  310         setIsLastBit(CurrentPacketMIs.back(), 0);

 1307     int i = WorkList.back();

  514     WorkItem WI = Worklist.back();

   57   auto Largest = result.back().first;

   48           CC = ITStates.back();

 2281         if (LoxFIs.count(FI) && (&Range == &RL.back())) {

 1027   SDNode *OutN = Output.back().getNode();

  416   DebugLoc DL = OG.back()->getDebugLoc();
  483   MachineBasicBlock *MBB = OG.back()->getParent();

  360   char *ActiveBegin = Blocks.back();

  330     BinaryOperator *Op = LogicOpsWorklist.back();

  254     auto Top = NestingStack.back();
  266             nestingString(NestingStack.back()).first);

   53   auto Largest = result.back().first;

  202         assert(Params.back());

 1425     PHINode *PN = PHIsToRewrite.back().first;
 1426     unsigned FieldNo = PHIsToRewrite.back().second;

  397     OutliningRegion *ColdRegion = &Regions.back();
  453       ColdRegion = &Regions.back();

  184   std::vector<uint64_t> &Fragment = Fragments.back();
  599   ByteArrayInfo *BAI = &ByteArrayInfos.back();
 1614     std::set<uint64_t> &TMSet = TypeMembers.back();

  517     Instruction *I = PDIUnrelatedWL.back();
  537     BasicBlock *BB = WorklistBB.back();

  476     auto *thisBB = DFS.back();
 1462     Function *CurrFunc = Worklist.back();

  277     Constant *C = DeadConstants.back();

  793       Bits.back().GV = &GV;
  794       Bits.back().ObjectSize =
  796       BitsPtr = &Bits.back();

  268     return *AllEdges.back();

 1256     Init.back() = Tag;

  391     Value *TopVal = PostorderStack.back().first;
  394     if (PostorderStack.back().second) {
  401     PostorderStack.back().second = true;

 1397   if (!LoopProcessWorklist.empty() && LoopProcessWorklist.back() == NewLoop &&
 1584     Instruction *I = Worklist.back();

  300     BasicBlock *BB = Worklist.back();

 3736       assert(Offsets.Splits.back() ==

  482     const BasicBlock *BB = CloneWorklist.back();

  386   Function::iterator InsertPos = ++BackedgeBlocks.back()->getIterator();

  707       assert(Latches.back() == LastValueMap[LatchBlock] && "bad last latch");
  708       PN->addIncoming(InVal, Latches.back());
  850         NewIDom = TermBlocks.back();
  878             (CompletelyUnroll && !LatchIsExiting && Latch == Latches.back())) &&
  933         Loop *LatchLoop = LI->getLoopFor(Latches.back());

  443   updatePHIBlocksAndValues(LoopExit, AftBlocksLast[0], AftBlocksLast.back(),
  448       cast<BranchInst>(ForeBlocksLast.back()->getTerminator());
  460                              AftBlocksLast.back(), LastValueMap);
  473       cast<BranchInst>(SubLoopBlocksLast.back()->getTerminator());
  477                   ForeBlocksLast.back());
  479                   SubLoopBlocksLast.back());
  490                     ForeBlocksLast.back());
  492                     SubLoopBlocksLast.back());
  497   BranchInst *Term = cast<BranchInst>(AftBlocksLast.back()->getTerminator());
  505                   SubLoopBlocksLast.back());
  516                     SubLoopBlocksLast.back());
  531                            ForeBlocksLast.back(), SubLoopBlocksFirst[0]);
  533                            SubLoopBlocksLast.back(), AftBlocksFirst[0]);

  294     int64_t GapLow = LHS.back().High->getSExtValue() + 1;
  298       NewUpperBound = LHS.back().High;
  481     UpperBound = Cases.back().High;
  505     APInt High = Cases.back().High->getValue();
  528       IntRange &LastRange = UnreachableRanges.back();

  279     Allocas[AllocaIdx] = Allocas.back();
  651     RenamePassData RPD = std::move(RenamePassWorkList.back());

 1072             std::swap(PredCases[i], PredCases.back());
 1133             std::swap(PredCases[i], PredCases.back());

 4601   return &(ScheduleDataChunks.back()[ChunkPos++]);

  139     auto &Entry = Sleds.back();

  356         auto Top = TSD.back();

   82       auto &Record = Records.back();
  151       auto &Record = Records.back();

  274                     : RTLs.UsedRTLs.back()->Idx +
  275                           RTLs.UsedRTLs.back()->NumberOfDevices;

   63     Constant *V = Todo.back();

 1458     assert(signed(CachedLexPos) - signed(N) >= signed(BacktrackPositions.back())
 1997     CurLexer = std::move(IncludeMacroStack.back().TheLexer);
 1998     CurPPLexer = IncludeMacroStack.back().ThePPLexer;
 1999     CurTokenLexer = std::move(IncludeMacroStack.back().TheTokenLexer);
 2000     CurDirLookup  = IncludeMacroStack.back().TheDirLookup;
 2001     CurLexerSubmodule = IncludeMacroStack.back().TheSubmodule;
 2002     CurLexerKind = IncludeMacroStack.back().CurLexerKind;

  769       return Tags.back().get();

  110     MigrationContext::GCAttrOccurrence &Attr = MigrateCtx.GCAttrs.back();

   17   ContextFrame& data = ContextStack.back();
   68   ErrorContent &Last = Errors.back();
   71   Last.Messages.back().Range = Range;
   72   Last.Messages.back().Type = Error;
   73   return ArgStream(&Last.Messages.back().Args);

  328     ++P->ContextStack.back().second;

  113   if (DiagStateOnPushStack.back() != GetCurDiagState()) {
  115     PushDiagStatePoint(DiagStateOnPushStack.back(), Loc);

  251     FilenameID = Entries.back().FilenameID;
  253   assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
  258     IncludeOffset = Entries.empty() ? 0 : Entries.back().IncludeOffset;
  262     assert(!Entries.empty() && Entries.back().IncludeOffset &&
  268           FindNearestLineEntry(FID, Entries.back().IncludeOffset))

  118       0, 0, DI->LexicalBlockStack.back(), DI->getInlinedAt()));
  182   auto *Scope = cast<llvm::DIScope>(LexicalBlockStack.back());
 3759   llvm::MDNode *Scope = LexicalBlockStack.back();
 3767     Back = LexicalBlockStack.back().get();
 3794                           LexicalBlockStack.back(), CurInlinedAt));
 3818   unsigned RCount = FnBeginRegionCount.back();
 3961   auto *Scope = cast<llvm::DIScope>(LexicalBlockStack.back());
 4059   auto *Scope = cast<llvm::DIScope>(LexicalBlockStack.back());
 4144       cast<llvm::DILocalScope>(LexicalBlockStack.back()), VD->getName(), Unit,
 4149       llvm::DebugLoc::get(Line, Column, LexicalBlockStack.back(), CurInlinedAt);
 4326   auto *scope = cast<llvm::DILocalScope>(LexicalBlockStack.back());
 4535     return LexicalBlockStack.back();
 4755   llvm::MDNode *Scope = LexicalBlockStack.back();

  536   while (!CXXGlobalInits.empty() && !CXXGlobalInits.back())

  636   if (Members.back().Offset % Alignment)
  645     Members.back().Data = getIntNType(Context.toBits(Alignment));

 2052         ResultRegTypes.push_back(ResultTruncRegTypes.back());
 2072           ResultRegTypes.back() = ConvertType(InputTy);
 2077                                                  ResultRegTypes.back()))
 2078         ResultRegTypes.back() = AdjTy;
 2086       if (auto *VT = dyn_cast<llvm::VectorType>(ResultRegTypes.back()))

  156   auto &entry = Builder.SelfReferences.back();

  547     SourceMappingRegion DR = RegionStack.back();
  571       SourceMappingRegion &Region = RegionStack.back();
  655     return RegionStack.back();
  764           assert(SpellingRegion(SM, SourceRegions.back()).isInSourceOrder());

  153     if (OneFeature != Features.back())

  271     HasStandalone = HasStandalone || (OsLibs.back() == "standalone");

  267     State.Stack.back().AvoidBinPacking = true;
  268     State.Stack.back().BreakBeforeParameter = true;
  269     State.Stack.back().AlignColons = false;
  549       State.Stack.back().VariablePos == 0) {
  550     State.Stack.back().VariablePos = State.Column;
  553     while (Tok && State.Stack.back().VariablePos >= Tok->ColumnWidth) {
  554       State.Stack.back().VariablePos -= Tok->ColumnWidth;
  560       State.Stack.back().LastSpace = State.Stack.back().VariablePos;
  560       State.Stack.back().LastSpace = State.Stack.back().VariablePos;
  589     State.Stack.back().NoLineBreak = true;
  592     State.Stack.back().NoLineBreak = true;
  595       !State.Stack.back().ObjCSelectorNameFound) {
  598                  State.Stack.back().Indent);
  601       State.Stack.back().AlignColons = false;
  603       State.Stack.back().ColonPos = MinIndent + Current.LongestObjCSelectorName;
  605       State.Stack.back().ColonPos = FirstColonPos;
  627     State.Stack.back().NoLineBreak = true;
  629     State.Stack.back().NoLineBreak = true;
  634     State.Stack.back().Indent = State.Column + Spaces;
  635   if (State.Stack.back().AvoidBinPacking && startsNextParameter(Current, Style))
  636     State.Stack.back().NoLineBreak = true;
  639     State.Stack.back().ContainsUnwrappedBuilder = true;
  642     State.Stack.back().NoLineBreak = true;
  652     State.Stack.back().NoLineBreak = true;
  677         (!State.Stack.back().LastOperatorWrapped && BreakBeforeOperator))
  678       State.Stack.back().NoLineBreakInOperand = true;
  687     State.Stack.back().LastSpace = State.Column;
  688     State.Stack.back().NestedBlockIndent = State.Column;
  693     State.Stack.back().LastSpace = State.Column;
  697     State.Stack.back().Indent = State.Column;
  698     State.Stack.back().LastSpace = State.Column;
  709       State.Stack.back().LastSpace = State.Column;
  711     State.Stack.back().Indent = State.Column;
  712     State.Stack.back().LastSpace = State.Column;
  726       State.Stack.back().LastSpace = State.Column;
  745   if (!State.Stack.back().ContainsLineBreak)
  747   State.Stack.back().ContainsLineBreak = true;
  755       State.Stack.back().FirstLessLess == 0 &&
  757        State.Stack.back().BreakBeforeParameter))
  777     State.Stack.back().NestedBlockIndent = State.Column;
  780     if (State.Stack.back().CallContinuation == 0)
  781       State.Stack.back().CallContinuation = State.Column;
  783     if (!State.Stack.back().ObjCSelectorNameFound) {
  785         State.Stack.back().AlignColons = false;
  787         State.Stack.back().ColonPos =
  789                  ? std::max(State.Stack.back().Indent,
  791                  : State.Stack.back().Indent) +
  795     } else if (State.Stack.back().AlignColons &&
  796                State.Stack.back().ColonPos <= NextNonComment->ColumnWidth) {
  797       State.Stack.back().ColonPos = State.Column + NextNonComment->ColumnWidth;
  812           std::max(State.Stack.back().LastSpace, State.Stack.back().Indent) +
  812           std::max(State.Stack.back().LastSpace, State.Stack.back().Indent) +
  818        !State.Stack.back().AvoidBinPacking) ||
  820     State.Stack.back().BreakBeforeParameter = false;
  824     State.Stack.back().BreakBeforeParameter = false;
  827     State.Stack.back().BreakBeforeParameter = true;
  829     State.Stack.back().BreakBeforeParameter = false;
  851     State.Stack.back().LastSpace = State.Column;
  856     State.Stack.back().LastSpace += 3; // 3 -> width of "<< ".
  878     State.Stack.back().BreakBeforeParameter = true;
  885     State.Stack.back().BreakBeforeClosingBrace = true;
  887   if (State.Stack.back().AvoidBinPacking) {
  904       State.Stack.back().BreakBeforeParameter = true;
  911       State.Stack.back().BreakBeforeParameter = false;
 1088     State.Stack.back().NoLineBreakInOperand = false;
 1090     State.Stack.back().AvoidBinPacking = true;
 1092     if (State.Stack.back().FirstLessLess == 0)
 1093       State.Stack.back().FirstLessLess = State.Column;
 1095       State.Stack.back().LastOperatorWrapped = Newline;
 1098     State.Stack.back().LastOperatorWrapped = Newline;
 1101     State.Stack.back().LastOperatorWrapped = Newline;
 1103       State.Stack.back().StartOfArraySubscripts == 0)
 1104     State.Stack.back().StartOfArraySubscripts = State.Column;
 1106     State.Stack.back().QuestionColumn = State.Column;
 1112       State.Stack.back().QuestionColumn = State.Column;
 1119     State.Stack.back().StartOfFunctionCall =
 1122     State.Stack.back().ObjCSelectorNameFound = true;
 1130     State.Stack.back().Indent =
 1135     State.Stack.back().NestedBlockIndent = State.Stack.back().Indent;
 1135     State.Stack.back().NestedBlockIndent = State.Stack.back().Indent;
 1137       State.Stack.back().AvoidBinPacking = true;
 1138       State.Stack.back().BreakBeforeParameter =
 1141       State.Stack.back().BreakBeforeParameter = false;
 1146     State.Stack.back().Indent =
 1148     State.Stack.back().NestedBlockIndent = State.Stack.back().Indent;
 1148     State.Stack.back().NestedBlockIndent = State.Stack.back().Indent;
 1150       State.Stack.back().AvoidBinPacking = true;
 1153     State.Stack.back().Indent =
 1156     State.Stack.back().NestedBlockIndent =
 1159     State.Stack.back().LastSpace = State.Column;
 1173       !State.Stack.back().HasMultipleNestedBlocks) {
 1183     State.Stack.back().NestedBlockInlined =
 1190   bool AllowBreak = !State.Stack.back().NoLineBreak &&
 1191                     !State.Stack.back().NoLineBreakInOperand;
 1242     ParenState NewParenState = State.Stack.back();
 1247         NewParenState.NoLineBreak || State.Stack.back().NoLineBreakInOperand;
 1264                    State.Stack.back().LastSpace);
 1295     unsigned VariablePos = State.Stack.back().VariablePos;
 1301     State.Stack.back().VariablePos = VariablePos;
 1317   unsigned LastSpace = State.Stack.back().LastSpace;
 1320   unsigned NestedBlockIndent = std::max(State.Stack.back().StartOfFunctionCall,
 1321                                         State.Stack.back().NestedBlockIndent);
 1326                   std::min(State.Column, State.Stack.back().NestedBlockIndent);
 1328       NewIndent = State.Stack.back().LastSpace + Style.ContinuationIndentWidth;
 1346                 std::max(State.Stack.back().LastSpace,
 1347                          State.Stack.back().StartOfFunctionCall);
 1354       NewIndent = std::max(NewIndent, State.Stack.back().Indent);
 1355       LastSpace = std::max(LastSpace, State.Stack.back().Indent);
 1413       (State.Stack.back().NoLineBreak ||
 1414        State.Stack.back().NoLineBreakInOperand ||
 1416         State.Stack.back().ContainsUnwrappedBuilder));
 1419   State.Stack.back().NestedBlockIndent = NestedBlockIndent;
 1420   State.Stack.back().BreakBeforeParameter = BreakBeforeParameter;
 1421   State.Stack.back().HasMultipleNestedBlocks = Current.BlockParameterCount > 1;
 1422   State.Stack.back().IsInsideObjCArrayLiteral =
 1451   if (State.Stack.back().BreakBeforeParameter && Current.MatchingParen &&
 1461         State.Stack.back().BreakBeforeParameter = false;
 1469       State.Stack.back().StartOfArraySubscripts = 0;
 1474   unsigned NestedBlockIndent = State.Stack.back().NestedBlockIndent;
 1481                                    State.Stack.back().LastSpace,
 1484   State.Stack.back().NestedBlockIndent = NestedBlockIndent;
 1485   State.Stack.back().BreakBeforeParameter = true;
 1565           ? State.Stack.back().NestedBlockIndent
 1566           : State.Stack.back().Indent;
 1784     if (State.Stack.back().IsInsideObjCArrayLiteral) {
 2203     State.Stack.back().LastSpace = StartColumn;

  139     State.Stack.back().AvoidBinPacking = true;

  773       int AdditionalIndent = State.Stack.back().Indent -
  894       State.Stack.back().BreakBeforeParameter = true;

  209   std::string pchName = includes.back() + ".pch-final";

   28     auto &Last = Decls.back();

  126     return HeaderMaps.back().second.get();

  187     Token &Tok = Result.back();
  189   } while (Result.back().isNot(tok::eof));

   43   CachedLexPos = BacktrackPositions.back();
  127       assert((BacktrackPositions.empty() || BacktrackPositions.back() <= i) &&

   70          SourceMgr.isBeforeInTranslationUnit(CondDirectiveLocs.back().getLoc(),

  551       MacroExpandingLexersStack.back().first == CurTokenLexer.get())

 1051   size_t tokIndex = MacroExpandingLexersStack.back().second;

  643     MacroInfo *MacroToReInstall = iter->second.back();

  260                 PreprocessedEntities.back()->getSourceRange().getBegin())) &&
  269                    PreprocessedEntities.back()->getSourceRange().getBegin())) {

  889   unsigned rawType = Stack->back().first;
  894   SourceLocation loc = Stack->back().second;
  973   const std::pair<unsigned, SourceLocation> *Back = &Stack->back();
  982       Back = &Stack->back();

 2636     if (!MacroStack.empty() && InstantiationLoc == MacroStack.back().second) {
 2637       MacroStack.back().first->subPieces.push_back(piece);
 2651       if (InstantiationLoc == MacroStack.back().second) {
 2652         MacroGroup = MacroStack.back().first;
 2656       if (ParentInstantiationLoc == MacroStack.back().second) {
 2657         MacroGroup = MacroStack.back().first;
 2664     if (!MacroGroup || ParentInstantiationLoc == MacroStack.back().second) {

  408       V = FreeNodes.back();

  414     newState = freeStates.back();

  590       std::tie(LastRow, LastCol) = TreePairs.back();

  199     auto &Prev = NewReplaces.back();
  493         Result.back().getOffset() + Result.back().getLength() < R.getOffset()) {
  493         Result.back().getOffset() + Result.back().getLength() < R.getOffset()) {
  497           std::max(Result.back().getOffset() + Result.back().getLength(),
  497           std::max(Result.back().getOffset() + Result.back().getLength(),
  500           Range(Result.back().getOffset(), NewEnd - Result.back().getOffset());
  500           Range(Result.back().getOffset(), NewEnd - Result.back().getOffset());

   56     SelectedASTNode Result = std::move(SelectionStack.back());
  134     SelectedASTNode Node = std::move(SelectionStack.back());
  137       SelectionStack.back().Children.push_back(std::move(Node));

  367     assert(Result.ExpandedTokens.back().kind() == tok::eof);
  375            SM.getFileID(Result.ExpandedTokens.back().location()));
  377                  Result.ExpandedTokens.back().location(),
  539       fillGapUntil(F.second, F.second.SpelledTokens.back().endLocation(),

  314   auto &CG = *static_cast<CodeGenerator *>(ASTConsumers.back().get());

  142     Results.back().push_back(std::move(Result));
  144     if (Results.back().size() >=

  335   return &I->Description.back();
  340   return &I->Description.back();
  345   return &I->Description.back();
  350   return &I->Description.back();
  355   return I->Children.back().get();

   91       I = &I->Children.back();

  207     if (!InlineChildren && (C == Children.back() ||
  353   Out.back()->Attributes.emplace_back("id", "Enums");
  355   auto &DivBody = Out.back();
  382   Out.back()->Attributes.emplace_back("id", "Functions");
  384   auto &DivBody = Out.back();
  401   Out.back()->Attributes.emplace_back("id", "Members");
  403   auto &ULBody = Out.back();
  425   Out.back()->Attributes.emplace_back("id", Title);
  427   auto &ULBody = Out.back();
  578     auto &SpanBody = Out.back();
  590   const auto &UlBody = Out.back();
  647   Out.back()->Attributes.emplace_back("id",
  676   Out.back()->Attributes.emplace_back("id",
  680   auto &FunctionHeader = Out.back();
  785     auto &PBody = Out.back();

   94     ClangDocCommentVisitor Visitor(*CurrentCI.Children.back());
  399     parseFullComment(C, I.Description.back());
  484                    I.Bases.back().Access);

  268     MoveTool->addRemovedDecl(MoveTool->getMovedDecls().back());
  270         MoveTool->getMovedDecls().back());
  618   Finder->addMatcher(MovedClass, MatchCallbacks.back().get());
  625       MatchCallbacks.back().get());
  630       MatchCallbacks.back().get());
  635                      MatchCallbacks.back().get());
  640       MatchCallbacks.back().get());
  648       MatchCallbacks.back().get());
  657                      MatchCallbacks.back().get());

  247     ClangTidyError &Error = Errors.back();
  433         Errors.back());

   51     Loc = Locs.back().getBegin();
   86          InnerRanges.back() == OuterRanges.back() &&
   86          InnerRanges.back() == OuterRanges.back() &&
   87          InnerRanges.back() == NextRanges.back()) {
   87          InnerRanges.back() == NextRanges.back()) {
   96       InnerRanges.back() != NextRanges.back())
   96       InnerRanges.back() != NextRanges.back())
   99   diag(InnerRanges.back().getBegin(), "multiple statement macro used without "

  917       FixIts.back().diagnostics = {D};

  137       this->Index = MergedIdx.back().get();

 1465       Output.Completions.back().Score = C.second;
 1466       Output.Completions.back().CompletionTokenRange = ReplacedRange;
 1547         Bundles.back().push_back(std::move(C));

  146   Note &N = D.Notes.back();

   43         if (!Brackets.empty() && Brackets.back() == ')')
   47         if (!Brackets.empty() && Brackets.back() == '}')
   51         if (!Brackets.empty() && Brackets.back() == ']')

   40       auto &Inc = Out->MainFileIncludes.back();

  166         Heap.back() = std::move(V);

   49       TokInfo &S = Tokens.back();

   23   if (Result.empty() || Result.back() != R) {

 1079       CurrentNamespace = Enclosing.back();
 1086       CurrentNamespace = std::move(Enclosing.back());
 1088       assert(Enclosing.back() == Event.Payload);

  113     std::unique_ptr<ParsedAST> ForCleanup = std::move(LRU.back().second);

  298       Result.back().Name = printName(AST.getASTContext(), *ND);
  299     Result.back().PreferredDeclaration = *Loc;
  302       Result.back().Definition = *Loc;
  655       auto &P = HI.Parameters->back();

   33       Task = std::move(Queue.back());

  131         MainFileRefs.push_back(RefSlabs.back().get());
  161       AllSymbols.push_back(&SymsStorage.back());

  535     visitStrings(Symbols.back(),
  542       visitStrings(Sources.back(),
  550       for (auto &Ref : Refs.back().second) {
  573       Strings.intern(InternedCmd.CommandLine.back());

  172   DocID Last = Result.back().Head = Documents.front();
  173   llvm::MutableArrayRef<uint8_t> RemainingPayload = Result.back().Payload;
  177       Result.back().Head = Doc;
  178       RemainingPayload = Result.back().Payload;

 1055     ExpectedParameter &P = Parameters.back();

  675     SymbolRefs.back().Kind = Kind;
  676     SymbolRefs.back().Location.FileURI = Filename;

  362         TestCase.points().back(), SourceMgr, AST.getASTContext().getLangOpts());

  384       this->Files[Files.back()] = "";

   61     Expected.back().range = R;
   62     Expected.back().kind = K;

  348   return ModularizeUtilities::getCanonicalPath(Inputs.back());

   71     Module *last = SubModules.back();

  449   CallbackCalls.back().Arguments.push_back(Argument{Name, Value});

   86   I.Bases.back().ChildFunctions.emplace_back();
   87   I.Bases.back().Members.emplace_back("int", "X", AccessSpecifier::AS_private);
  173   CommentInfo *BlankLine = Top.Children.back().get();
  176   BlankLine->Children.back()->Kind = "TextComment";
  179   CommentInfo *Brief = Top.Children.back().get();
  182   Brief->Children.back()->Kind = "TextComment";
  183   Brief->Children.back()->Name = "ParagraphComment";
  184   Brief->Children.back()->Text = " Brief description.";
  187   CommentInfo *Extended = Top.Children.back().get();
  190   Extended->Children.back()->Kind = "TextComment";
  191   Extended->Children.back()->Text = " Extended description that";
  193   Extended->Children.back()->Kind = "TextComment";
  194   Extended->Children.back()->Text = " continues onto the next line.";
  197   CommentInfo *HTML = Top.Children.back().get();
  200   HTML->Children.back()->Kind = "TextComment";
  202   HTML->Children.back()->Kind = "HTMLStartTagComment";
  203   HTML->Children.back()->Name = "ul";
  204   HTML->Children.back()->AttrKeys.emplace_back("class");
  205   HTML->Children.back()->AttrValues.emplace_back("test");
  207   HTML->Children.back()->Kind = "HTMLStartTagComment";
  208   HTML->Children.back()->Name = "li";
  210   HTML->Children.back()->Kind = "TextComment";
  211   HTML->Children.back()->Text = " Testing.";
  213   HTML->Children.back()->Kind = "HTMLEndTagComment";
  214   HTML->Children.back()->Name = "ul";
  215   HTML->Children.back()->SelfClosing = true;
  218   CommentInfo *Verbatim = Top.Children.back().get();
  223   Verbatim->Children.back()->Kind = "VerbatimBlockLineComment";
  224   Verbatim->Children.back()->Text = " The description continues.";
  227   CommentInfo *ParamOut = Top.Children.back().get();
  233   ParamOut->Children.back()->Kind = "ParagraphComment";
  234   ParamOut->Children.back()->Children.emplace_back(
  236   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  236   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  237   ParamOut->Children.back()->Children.emplace_back(
  239   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  239   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  240   ParamOut->Children.back()->Children.back()->Text = " is a parameter.";
  240   ParamOut->Children.back()->Children.back()->Text = " is a parameter.";
  243   CommentInfo *ParamIn = Top.Children.back().get();
  248   ParamIn->Children.back()->Kind = "ParagraphComment";
  249   ParamIn->Children.back()->Children.emplace_back(
  251   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  251   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  252   ParamIn->Children.back()->Children.back()->Text = " is a parameter.";
  252   ParamIn->Children.back()->Children.back()->Text = " is a parameter.";
  253   ParamIn->Children.back()->Children.emplace_back(
  255   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  255   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  258   CommentInfo *Return = Top.Children.back().get();
  263   Return->Children.back()->Kind = "ParagraphComment";
  264   Return->Children.back()->Children.emplace_back(
  266   Return->Children.back()->Children.back()->Kind = "TextComment";
  266   Return->Children.back()->Children.back()->Kind = "TextComment";
  267   Return->Children.back()->Children.back()->Text = "void";
  267   Return->Children.back()->Children.back()->Text = "void";

   51   I.ChildFunctions.back().Access = AccessSpecifier::AS_none;
   52   I.ChildFunctions.back().Name = "OneFunction";
   54   I.ChildEnums.back().Name = "OneEnum";
  163   I.ChildFunctions.back().Name = "OneFunction";
  165   I.ChildEnums.back().Name = "OneEnum";
  382   CommentInfo *BlankLine = Top.Children.back().get();
  385   BlankLine->Children.back()->Kind = "TextComment";
  388   CommentInfo *Brief = Top.Children.back().get();
  391   Brief->Children.back()->Kind = "TextComment";
  392   Brief->Children.back()->Name = "ParagraphComment";
  393   Brief->Children.back()->Text = " Brief description.";
  396   CommentInfo *Extended = Top.Children.back().get();
  399   Extended->Children.back()->Kind = "TextComment";
  400   Extended->Children.back()->Text = " Extended description that";
  402   Extended->Children.back()->Kind = "TextComment";
  403   Extended->Children.back()->Text = " continues onto the next line.";
  406   CommentInfo *Entities = Top.Children.back().get();
  409   Entities->Children.back()->Kind = "TextComment";
  410   Entities->Children.back()->Name = "ParagraphComment";
  411   Entities->Children.back()->Text =

   33   I.ChildFunctions.back().Name = "OneFunction";
   34   I.ChildFunctions.back().Access = AccessSpecifier::AS_none;
   36   I.ChildEnums.back().Name = "OneEnum";
   97   I.ChildFunctions.back().Name = "OneFunction";
   99   I.ChildEnums.back().Name = "OneEnum";
  225   CommentInfo *BlankLine = Top.Children.back().get();
  228   BlankLine->Children.back()->Kind = "TextComment";
  231   CommentInfo *Brief = Top.Children.back().get();
  234   Brief->Children.back()->Kind = "TextComment";
  235   Brief->Children.back()->Name = "ParagraphComment";
  236   Brief->Children.back()->Text = " Brief description.";
  239   CommentInfo *Extended = Top.Children.back().get();
  242   Extended->Children.back()->Kind = "TextComment";
  243   Extended->Children.back()->Text = " Extended description that";
  245   Extended->Children.back()->Kind = "TextComment";
  246   Extended->Children.back()->Text = " continues onto the next line.";
  249   CommentInfo *HTML = Top.Children.back().get();
  252   HTML->Children.back()->Kind = "TextComment";
  254   HTML->Children.back()->Kind = "HTMLStartTagComment";
  255   HTML->Children.back()->Name = "ul";
  256   HTML->Children.back()->AttrKeys.emplace_back("class");
  257   HTML->Children.back()->AttrValues.emplace_back("test");
  259   HTML->Children.back()->Kind = "HTMLStartTagComment";
  260   HTML->Children.back()->Name = "li";
  262   HTML->Children.back()->Kind = "TextComment";
  263   HTML->Children.back()->Text = " Testing.";
  265   HTML->Children.back()->Kind = "HTMLEndTagComment";
  266   HTML->Children.back()->Name = "ul";
  267   HTML->Children.back()->SelfClosing = true;
  270   CommentInfo *Verbatim = Top.Children.back().get();
  275   Verbatim->Children.back()->Kind = "VerbatimBlockLineComment";
  276   Verbatim->Children.back()->Text = " The description continues.";
  279   CommentInfo *ParamOut = Top.Children.back().get();
  285   ParamOut->Children.back()->Kind = "ParagraphComment";
  286   ParamOut->Children.back()->Children.emplace_back(
  288   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  288   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  289   ParamOut->Children.back()->Children.emplace_back(
  291   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  291   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  292   ParamOut->Children.back()->Children.back()->Text = " is a parameter.";
  292   ParamOut->Children.back()->Children.back()->Text = " is a parameter.";
  295   CommentInfo *ParamIn = Top.Children.back().get();
  300   ParamIn->Children.back()->Kind = "ParagraphComment";
  301   ParamIn->Children.back()->Children.emplace_back(
  303   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  303   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  304   ParamIn->Children.back()->Children.back()->Text = " is a parameter.";
  304   ParamIn->Children.back()->Children.back()->Text = " is a parameter.";
  305   ParamIn->Children.back()->Children.emplace_back(
  307   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  307   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  310   CommentInfo *Return = Top.Children.back().get();
  315   Return->Children.back()->Kind = "ParagraphComment";
  316   Return->Children.back()->Children.emplace_back(
  318   Return->Children.back()->Children.back()->Kind = "TextComment";
  318   Return->Children.back()->Children.back()->Kind = "TextComment";
  319   Return->Children.back()->Children.back()->Text = "void";
  319   Return->Children.back()->Children.back()->Text = "void";

   26   One.ChildFunctions.back().Name = "OneFunction";
   27   One.ChildFunctions.back().USR = NonEmptySID;
   29   One.ChildEnums.back().Name = "OneEnum";
   30   One.ChildEnums.back().USR = NonEmptySID;
   41   Two.ChildFunctions.back().Name = "TwoFunction";
   43   Two.ChildEnums.back().Name = "TwoEnum";
   62   Expected->ChildFunctions.back().Name = "OneFunction";
   63   Expected->ChildFunctions.back().USR = NonEmptySID;
   65   Expected->ChildFunctions.back().Name = "TwoFunction";
   67   Expected->ChildEnums.back().Name = "OneEnum";
   68   Expected->ChildEnums.back().USR = NonEmptySID;
   70   Expected->ChildEnums.back().Name = "TwoEnum";
   95   One.ChildFunctions.back().Name = "OneFunction";
   96   One.ChildFunctions.back().USR = NonEmptySID;
   98   One.ChildEnums.back().Name = "OneEnum";
   99   One.ChildEnums.back().USR = NonEmptySID;
  112   Two.ChildFunctions.back().Name = "TwoFunction";
  114   Two.ChildEnums.back().Name = "TwoEnum";
  137   Expected->ChildFunctions.back().Name = "OneFunction";
  138   Expected->ChildFunctions.back().USR = NonEmptySID;
  140   Expected->ChildFunctions.back().Name = "TwoFunction";
  142   Expected->ChildEnums.back().Name = "OneEnum";
  143   Expected->ChildEnums.back().USR = NonEmptySID;
  145   Expected->ChildEnums.back().Name = "TwoEnum";
  165   auto OneFullComment = &One.Description.back();
  185   auto TwoFullComment = &Two.Description.back();
  212   auto ExpectedFullComment = &Expected->Description.back();

  397   ExpectedE.Bases.back().ChildFunctions.emplace_back(std::move(FunctionSet));
  410   ExpectedE.Bases.back().ChildFunctions.emplace_back(std::move(FunctionGet));
  411   ExpectedE.Bases.back().Members.emplace_back("int", "I",
  443   ExpectedH.Bases.back().ChildFunctions.emplace_back(std::move(FunctionSetNew));
  456   ExpectedH.Bases.back().ChildFunctions.emplace_back(std::move(FunctionGetNew));
  457   ExpectedH.Bases.back().Members.emplace_back("int", "I",

   36   I.ChildFunctions.back().Name = "OneFunction";
   37   I.ChildFunctions.back().Access = AccessSpecifier::AS_none;
   39   I.ChildEnums.back().Name = "OneEnum";
   89   I.Bases.back().ChildFunctions.emplace_back();
   90   I.Bases.back().ChildFunctions.back().Name = "InheritedFunctionOne";
   90   I.Bases.back().ChildFunctions.back().Name = "InheritedFunctionOne";
   91   I.Bases.back().Members.emplace_back("int", "path/to/int", "N",
  101   I.ChildFunctions.back().Name = "OneFunction";
  103   I.ChildEnums.back().Name = "OneEnum";
  279   CommentInfo *BlankLine = Top.Children.back().get();
  282   BlankLine->Children.back()->Kind = "TextComment";
  285   CommentInfo *Brief = Top.Children.back().get();
  288   Brief->Children.back()->Kind = "TextComment";
  289   Brief->Children.back()->Name = "ParagraphComment";
  290   Brief->Children.back()->Text = " Brief description.";
  293   CommentInfo *Extended = Top.Children.back().get();
  296   Extended->Children.back()->Kind = "TextComment";
  297   Extended->Children.back()->Text = " Extended description that";
  299   Extended->Children.back()->Kind = "TextComment";
  300   Extended->Children.back()->Text = " continues onto the next line.";
  303   CommentInfo *HTML = Top.Children.back().get();
  306   HTML->Children.back()->Kind = "TextComment";
  308   HTML->Children.back()->Kind = "HTMLStartTagComment";
  309   HTML->Children.back()->Name = "ul";
  310   HTML->Children.back()->AttrKeys.emplace_back("class");
  311   HTML->Children.back()->AttrValues.emplace_back("test");
  313   HTML->Children.back()->Kind = "HTMLStartTagComment";
  314   HTML->Children.back()->Name = "li";
  316   HTML->Children.back()->Kind = "TextComment";
  317   HTML->Children.back()->Text = " Testing.";
  319   HTML->Children.back()->Kind = "HTMLEndTagComment";
  320   HTML->Children.back()->Name = "ul";
  321   HTML->Children.back()->SelfClosing = true;
  324   CommentInfo *Verbatim = Top.Children.back().get();
  329   Verbatim->Children.back()->Kind = "VerbatimBlockLineComment";
  330   Verbatim->Children.back()->Text = " The description continues.";
  333   CommentInfo *ParamOut = Top.Children.back().get();
  339   ParamOut->Children.back()->Kind = "ParagraphComment";
  340   ParamOut->Children.back()->Children.emplace_back(
  342   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  342   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  343   ParamOut->Children.back()->Children.emplace_back(
  345   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  345   ParamOut->Children.back()->Children.back()->Kind = "TextComment";
  346   ParamOut->Children.back()->Children.back()->Text = " is a parameter.";
  346   ParamOut->Children.back()->Children.back()->Text = " is a parameter.";
  349   CommentInfo *ParamIn = Top.Children.back().get();
  354   ParamIn->Children.back()->Kind = "ParagraphComment";
  355   ParamIn->Children.back()->Children.emplace_back(
  357   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  357   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  358   ParamIn->Children.back()->Children.back()->Text = " is a parameter.";
  358   ParamIn->Children.back()->Children.back()->Text = " is a parameter.";
  359   ParamIn->Children.back()->Children.emplace_back(
  361   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  361   ParamIn->Children.back()->Children.back()->Kind = "TextComment";
  364   CommentInfo *Return = Top.Children.back().get();
  369   Return->Children.back()->Kind = "ParagraphComment";
  370   Return->Children.back()->Children.emplace_back(
  372   Return->Children.back()->Children.back()->Kind = "TextComment";
  372   Return->Children.back()->Children.back()->Kind = "TextComment";
  373   Return->Children.back()->Children.back()->Text = "void";
  373   Return->Children.back()->Children.back()->Text = "void";

   21   if (ExpectedWarning && *ExpectedWarning != Errors.back().Message.Message)
   23            Errors.back().Message.Message + "'";
   43   if (ExpectedWarning && *ExpectedWarning != Errors.back().Message.Message)
   45            Errors.back().Message.Message + "'";

 1505     Vec = pool.AvailableCursors.back();

  138   CXStringBuf *Buf = Pool.back();

  702     EXPECT_EQ(Results[0].CommandLine.back(), path(F))

  101   TUD.Diagnostics.back().Notes.push_back(
  103   TUD.Diagnostics.back().Notes.push_back(

 2276       Args.back()->writeDeclarations(OS);
 2280       if (Args.back()->isFake()) {
 2282       } else if (Args.back()->isOptional()) {
 2832       Args.back()->writePCHReadDecls(OS);

  875     auto &S = RST.back();
  879       RST.back() += " |nbsp| ";
  916                   RST.begin() + SeparatorIndexes.back() + 1);

  124       D.Groups.back().Group = G;
  125       Documentation &Base = D.Groups.back();
  264         Args.back() += "...";

 1509     Lines.back().insert(0, RetVar.getName() + " = ");

   89   return *Objects.back();

 1006       Abbreviations.back()->AddAttribute(Attr.getAttribute(), Attr.getForm());
 1007     AbbreviationsSet.InsertNode(Abbreviations.back().get(), InsertToken);
 1010     Abbreviations.back()->setNumber(Abbreviations.size());
 1770   if (!Rows.empty() && Rows.back().Address < Seq.front().Address) {
 1894         auto NextLine = Seq.back();
 2559     LinkContext &LC = ObjectContexts.back();

   59   return UnobfuscatedStrings.back();

  570     ld_plugin_symbol &sym = cf.syms.back();

  595     auto *dir = make<ImportDirectoryChunk>(dllNames.back());
  632     auto *dir = make<DelayDirectoryChunk>(dllNames.back());

   75     return chunks.back()->getRVA() + chunks.back()->getSize() - getRVA();
   75     return chunks.back()->getRVA() + chunks.back()->getSize() - getRVA();

 1027     edataEnd = edataSec->chunks.back();
 1182     lastPdata = pdataSec->chunks.back();

 1204         files.back()->justSymbols = true;
 1241       std::tie(config->asNeeded, config->isStatic, inWholeArchive) = stack.back();
 1555   Partition &newPart = partitions.back();

  114       EhSectionPiece &last = pieces.back();

   98       !isa<InputSectionDescription>(sectionCommands.back()))
  100   auto *isd = cast<InputSectionDescription>(sectionCommands.back());

  574       !isa<InputSectionDescription>(osec->sectionCommands.back()))
  576   auto *isd = cast<InputSectionDescription>(osec->sectionCommands.back());
 1623     InputSection *last = isd->sections.back();
 1663             isd->sections.back()->outSecOff + isd->sections.back()->getSize();
 1663             isd->sections.back()->outSecOff + isd->sections.back()->getSize();

  724     gots.back().file = &f;
  886           !tryMergeGots(mergedGots.back(), srcGot, false)) {
  888         std::swap(mergedGots.back(), srcGot);
 1811     offset = g.back().r_offset;
 2538     GdbSymbol &sym = symbols.back();
 2972     Verneed &vn = verneeds.back();
 3268   sentinel = executableSections.back();

 2053     return ret.back();

  615     if (sysLibRoots.back() != "/")

  335       pages.back().entries = remainingInfos.slice(0, entriesInPage);
  340                  << pages.back().entries[0].rangeStart->name() << " to "
  341                  << pages.back().entries.back().rangeStart->name() << " + "
  343                                  pages.back().entries.back().rangeLength)
  469                  << llvm::format("0x%08x", unwindInfos.back().encoding)
  504       const DefinedAtom *cfiAtom = usedDwarfWorklist.back();

  762     _flatNamespaceFile = result.back().get();

  641   Section* normSect = &file.sections.back();

  298       customSections.back()->setRelocations(section.Relocations);
  299       customSectionsByIndex[sectionIndex] = customSections.back();

  527         sp = m_stack.back();
  535       lldb::IOHandlerSP sp(m_stack.back());
  541     m_top = (m_stack.empty() ? nullptr : m_stack.back().get());

  126       m_diagnostics.back()->AppendMessage(str);

  143     return m_variables.back();

  923       m_selected_platform_sp = m_platforms.back();
  966       m_selected_platform_sp = m_platforms.back();

  486   Entry *Back() { return (m_entries.empty() ? nullptr : &m_entries.back()); }

  277   if (children.empty() || children.back().type != Entry::Type::String)
  280     children.back().string.append(1, ch);
  284   if (children.empty() || children.back().type != Entry::Type::String)
  287     children.back().string.append(s.data(), s.size());

 1963     if (&GetChildren().back() == child) {
 2140     if (&m_children.back() == child) {

  651           if (m_offsets.back() < size_t(end - start))

 1074       stack.back().SetValueType(Value::eValueTypeFileAddress);
 1078         stack.back().ConvertToLoadAddress(module_sp.get(),
 1131       Value::ValueType value_type = stack.back().GetValueType();
 1134         void *src = (void *)stack.back().GetScalar().ULongLong();
 1137         stack.back().GetScalar() = ptr;
 1138         stack.back().ClearContext();
 1141         auto file_addr = stack.back().GetScalar().ULongLong(
 1163         stack.back().GetScalar() = load_Addr;
 1164         stack.back().SetValueType(Value::eValueTypeLoadAddress);
 1171                 stack.back().GetScalar().ULongLong(LLDB_INVALID_ADDRESS);
 1176               stack.back().GetScalar() = pointer_value;
 1177               stack.back().ClearContext();
 1226       Value::ValueType value_type = stack.back().GetValueType();
 1229         void *src = (void *)stack.back().GetScalar().ULongLong();
 1265         stack.back().GetScalar() = ptr;
 1266         stack.back().ClearContext();
 1272                 stack.back().GetScalar().ULongLong(LLDB_INVALID_ADDRESS);
 1282                 stack.back().GetScalar() = addr_data.GetU8(&addr_data_offset);
 1285                 stack.back().GetScalar() = addr_data.GetU16(&addr_data_offset);
 1288                 stack.back().GetScalar() = addr_data.GetU32(&addr_data_offset);
 1291                 stack.back().GetScalar() = addr_data.GetU64(&addr_data_offset);
 1294                 stack.back().GetScalar() =
 1297               stack.back().ClearContext();
 1410         stack.push_back(stack.back());
 1467         tmp = stack.back();
 1468         stack.back() = stack[stack.size() - 2];
 1505       } else if (!stack.back().ResolveValue(exe_ctx).AbsoluteValue()) {
 1524         tmp = stack.back();
 1526         stack.back().ResolveValue(exe_ctx) =
 1527             stack.back().ResolveValue(exe_ctx) & tmp.ResolveValue(exe_ctx);
 1543         tmp = stack.back();
 1550           stack.back() =
 1551               stack.back().ResolveValue(exe_ctx) / tmp.ResolveValue(exe_ctx);
 1552           if (!stack.back().ResolveValue(exe_ctx).IsValid()) {
 1572         tmp = stack.back();
 1574         stack.back().ResolveValue(exe_ctx) =
 1575             stack.back().ResolveValue(exe_ctx) - tmp.ResolveValue(exe_ctx);
 1591         tmp = stack.back();
 1593         stack.back().ResolveValue(exe_ctx) =
 1594             stack.back().ResolveValue(exe_ctx) % tmp.ResolveValue(exe_ctx);
 1609         tmp = stack.back();
 1611         stack.back().ResolveValue(exe_ctx) =
 1612             stack.back().ResolveValue(exe_ctx) * tmp.ResolveValue(exe_ctx);
 1626         if (!stack.back().ResolveValue(exe_ctx).UnaryNegate()) {
 1645         if (!stack.back().ResolveValue(exe_ctx).OnesComplement()) {
 1664         tmp = stack.back();
 1666         stack.back().ResolveValue(exe_ctx) =
 1667             stack.back().ResolveValue(exe_ctx) | tmp.ResolveValue(exe_ctx);
 1682         tmp = stack.back();
 1684         stack.back().GetScalar() += tmp.GetScalar();
 1701         stack.back().GetScalar() += uconst_value;
 1702         if (!stack.back().GetScalar().IsValid()) {
 1722         tmp = stack.back();
 1724         stack.back().ResolveValue(exe_ctx) <<= tmp.ResolveValue(exe_ctx);
 1740         tmp = stack.back();
 1742         if (!stack.back().ResolveValue(exe_ctx).ShiftRightLogical(
 1764         tmp = stack.back();
 1766         stack.back().ResolveValue(exe_ctx) >>= tmp.ResolveValue(exe_ctx);
 1781         tmp = stack.back();
 1783         stack.back().ResolveValue(exe_ctx) =
 1784             stack.back().ResolveValue(exe_ctx) ^ tmp.ResolveValue(exe_ctx);
 1820         tmp = stack.back();
 1851         tmp = stack.back();
 1853         stack.back().ResolveValue(exe_ctx) =
 1854             stack.back().ResolveValue(exe_ctx) == tmp.ResolveValue(exe_ctx);
 1872         tmp = stack.back();
 1874         stack.back().ResolveValue(exe_ctx) =
 1875             stack.back().ResolveValue(exe_ctx) >= tmp.ResolveValue(exe_ctx);
 1893         tmp = stack.back();
 1895         stack.back().ResolveValue(exe_ctx) =
 1896             stack.back().ResolveValue(exe_ctx) > tmp.ResolveValue(exe_ctx);
 1914         tmp = stack.back();
 1916         stack.back().ResolveValue(exe_ctx) =
 1917             stack.back().ResolveValue(exe_ctx) <= tmp.ResolveValue(exe_ctx);
 1935         tmp = stack.back();
 1937         stack.back().ResolveValue(exe_ctx) =
 1938             stack.back().ResolveValue(exe_ctx) < tmp.ResolveValue(exe_ctx);
 1956         tmp = stack.back();
 1958         stack.back().ResolveValue(exe_ctx) =
 1959             stack.back().ResolveValue(exe_ctx) != tmp.ResolveValue(exe_ctx);
 2102         stack.back().SetValueType(Value::eValueTypeLoadAddress);
 2121         stack.back().SetValueType(Value::eValueTypeLoadAddress);
 2134             stack.back().SetValueType(Value::eValueTypeLoadAddress);
 2188           Value curr_piece_source_value(stack.back());
 2311         switch (stack.back().GetValueType()) {
 2313           if (!stack.back().GetScalar().ExtractBitfield(piece_bit_size,
 2320                   (uint64_t)(stack.back().GetScalar().GetByteSize() * 8));
 2419       stack.back().SetValueType(Value::eValueTypeScalar);
 2494       Scalar &top = stack.back().ResolveValue(exe_ctx);
 2512           stack.back().SetValueType(Value::eValueTypeLoadAddress);
 2560           stack.back().GetScalar().ULongLong(LLDB_INVALID_ADDRESS);
 2571       stack.back().GetScalar() = tls_load_addr;
 2572       stack.back().SetValueType(Value::eValueTypeLoadAddress);
 2592       stack.back().SetValueType(Value::eValueTypeFileAddress);
 2653     result = stack.back();

  611     m_parent.CommitOneAllocation(process_sp, err, m_parent.m_records.back());
  642     m_parent.CommitOneAllocation(process_sp, err, m_parent.m_records.back());

   86       if (str == m_history.back())

 2362     } else if (m_command_source_flags.back() &
 2374     } else if (m_command_source_flags.back() & eHandleCommandFlagStopOnError) {
 2386     } else if (m_command_source_flags.back() & eHandleCommandFlagStopOnCrash) {
 2395     } else if (m_command_source_flags.back() & eHandleCommandFlagEchoCommand) {
 2407     } else if (m_command_source_flags.back() &
 2419     } else if (m_command_source_flags.back() & eHandleCommandFlagPrintResult) {
 2430     } else if (m_command_source_flags.back() & eHandleCommandFlagPrintErrors) {

  247     m_getopt_table.back().definition = nullptr;
  248     m_getopt_table.back().flag = nullptr;
  249     m_getopt_table.back().val = 0;
  836       m_option_defs.back().usage_mask = dst_mask;

   99     FileSpec old_top = m_file_stack.back();
  114       if (m_file_stack.back() != m_current_file)

  589     if (!m_regions.back().IsValid()) {
  595       m_regions.back().Dump(s);
  599     next_region = m_regions.back().GetNextRegionAddr();

 3829     return m_scripts.back().get();
 3864   return m_allocations.back().get();

 3788               symtab->SymbolAtIndex(N_FUN_indexes.back())
 3959             symbol_ptr = symtab->SymbolAtIndex(N_INCL_indexes.back());
 4018             symbol_ptr = symtab->SymbolAtIndex(N_BRAC_indexes.back());
 4052             symbol_ptr = symtab->SymbolAtIndex(N_COMM_indexes.back());

 1610   return static_cast<NativeThreadLinux &>(*m_threads.back());

  464     if (pos->second.back() != LLDB_INVALID_REGNUM)
  514     if (pos->second.back() != LLDB_INVALID_REGNUM)

  125   CursorSP prev_frame = m_frames.back();

  131     GDBRemotePacket entry = m_packet_history.back();
  152         assert(m_packet_history.back().type ==

  204             m_die_array.back().SetHasChildren(false);
  209         if (die_index_stack.back())
  210           m_die_array[die_index_stack.back()].SetSiblingIndex(
  211               m_die_array.size() - die_index_stack.back());
  227       die_index_stack.back() = m_die_array.size() - 1;

  512     const CompileUnitInfo *last_comp_unit_info = &m_compile_unit_infos.back();

   61       return scope_stack.back();
  517     clang::QualType qt = GetOrCreateType(types.back());
  558       clang::QualType qt = GetOrCreateType(matches.back());

 9606         buf.back() = '\0';

   56         new Scope(result.back(), Scope::DeclScope, sema.getDiagnostics());
   80   sema.LookupName(*lookup_result, scopes.back());

  785           row = stack.back();

   79   if (!entries.empty() && entries.back().file_addr == file_addr) {
   89     entry.is_prologue_end = entry.file_idx == entries.back().file_idx;
   90     entries.back() = entry;
  105       !Entry::EntryAddressLessThan(entry, m_entries.back())) {
  501           !sequence.m_entries.back().is_terminal_entry) {
  509       sequence.m_entries.push_back(sequence.m_entries.back());
  515       sequence.m_entries.back().file_addr = prev_end_entry_linked_file_addr;
  516       sequence.m_entries.back().is_terminal_entry = true;
  528       sequence.m_entries.back().file_addr = entry_linked_file_addr;
  534         sequence.m_entries.back().is_terminal_entry) {

  361       m_row_list.back()->GetOffset() != row_sp->GetOffset())
  364     m_row_list.back() = row_sp;

 5513     struct PreResumeCallbackAndBaton action = m_pre_resume_actions.back();

  359   StackFrame &prev_frame = *m_frames.back().get();

  956     return m_completed_plan_stack.back()->ShouldReportStop(event_ptr);
  994               m_completed_plan_stack.back()->GetName());
  996     return m_completed_plan_stack.back()->ShouldReportRun(event_ptr);
 1020           m_plan_stack.back()->GetThreadPlanTracer());
 1043     ThreadPlanSP &plan = m_plan_stack.back();
 1057     ThreadPlanSP &plan = m_plan_stack.back();
 1070   return m_plan_stack.empty() ? nullptr : m_plan_stack.back().get();

   33   if (m_threads.empty() || m_threads.back()->GetIndexID() < thread_index_id)

   62   ThreadSP expr_thread_sp = FindThreadByID(m_expression_tid_stack.back());
   74   assert(m_expression_tid_stack.back() == tid);

  185     m_argv.push_back(m_entries.back().data());
  248     m_argv.push_back(m_entries.back().data());
  292   assert(m_argv.back() == nullptr);
  296     m_argv.push_back(m_entries.back().data());
  305   assert(m_argv.back() == nullptr);
  309     m_argv.push_back(m_entries.back().data());
  322   assert(m_argv.back() == nullptr);
  333   assert(m_argv.back() == nullptr);

  154   if (!m_hijacking_listeners.empty() && event_type & m_hijacking_masks.back())
  209     hijacking_listener_sp = m_hijacking_listeners.back();
  210     if ((event_type & m_hijacking_masks.back()) == 0)
  280     return (event_mask & m_hijacking_masks.back()) != 0;
  286     return m_hijacking_listeners.back()->GetName();
  295     ListenerSP listener_sp = m_hijacking_listeners.back();

  256   return m_data_recorders.back().get();

   91   assert(stack.back() == this);
   94     stack.back()->ChildDuration(total_dur);

  264       object::Archive::create(ArchiveBuffers.back()->getMemBufferRef());
  268   return *Archives.back();

  248   return *LoadedSourceFiles.back().second;

  371                &Coverage, Options, LCP, &FileReports.back(), &Filters);

  360       yamlize(Yin, Benchmarks.back(), /*unused*/ true, Context);

  143     Cluster &CurrentCluster = Clusters_.back();
  213     Cluster &CurrentCluster = Clusters_.back();
  273     Cluster &UnstableCluster = Clusters_.back();

  143   CodeTemplate &CT = Result.back();
  161   CodeTemplate &CT = Result.back();

  298       Function *F = &*Workqueue.back();

  577       ThinGenerator.addModule(Filename, InputBuffers.back()->getBuffer());
  790       ThinGenerator.addModule(Filename, InputBuffers.back()->getBuffer());
  829       ThinGenerator.addModule(Filename, InputBuffers.back()->getBuffer());

   64     Section &S = Sections.back();
   96     Symbol &Sym = Symbols.back();

 1065     return *Segments.back();

   84     Section &S = Sections.back();

  150     Run *CurrentRun = &Runs.back();
  154       CurrentRun = &Runs.back();

  221       yaml::PdbDbiModuleInfo &DMI = Obj.DbiStream->ModInfos.back();

 2865     std::vector<GroupMember> &GM = Ret.back().Members;

  687   auto SM = Modifiers.back().get();

  162     if (ThreadStack.back().first == Record.FuncId) {
  163       const auto &Top = ThreadStack.back();
  279     auto &Row = std::get<2>(Results.back());

 1714       cast<SCEVConstant>(Sizes.back())->getAPInt().getSExtValue();

  603         LoopSets.back().insert(L0);
  605         LoopSets.back().insert(L1);
  607         LoopSets.back().insert(L2);

  112           {GlobalState->Indices.back(), ulittle32_t(Offset)});

  189   P.FileNames.back().Name =
  545   return *CompileUnits.back();
  551   return *LineTables.back();

  100   uint32_t FreeBlockStart = Blocks.back() + 1;

  161         InputFunctions.back().ReverseVirtualFileMapping;
  177     auto &Regions = InputFunctions.back().Regions;
  186     InputFunctions.back().Regions.push_back(CounterMappingRegion::makeExpansion(
  269   InputFunctionCoverageData &Input = InputFunctions.back();
  270   OutputFunctionCoverageData &Output = OutputFunctions.back();
  295   OutputFunctionCoverageData &Output = OutputFunctions.back();
  636   OutputFunctionCoverageData &Output = OutputFunctions.back();

  164   EXPECT_EQ(Order.back(), "PipSqueak");

  289 	__tmp._M_subexpr = this->_M_paren_stack.back();

  201 	return c.back();

  115     assert(TheOperators.back() == this);

 2057       ConversionTable.back().push_back(KindID);
 2058       ConversionTable.back().push_back(CVT_Done);
 2547       OS << "    return B == " << SuperClasses.back() << ";\n";
 3341       FeatureBitsets.back().push_back(MI->RequiredFeatures[I]->TheDef);

   83   O << "    case " << OpsToPrint.back().first << ":";
   84   AsmWriterOperand TheOp = OpsToPrint.back().second;
  104   AsmWriterInst FirstInst = Insts.back();
  189       InstIdxs.back().push_back(i);

   97           Operands.back().OperandType == AsmWriterOperand::isLiteralTextOperand)
   98         Operands.back().Str.append(Str);

  556         FeatureBitsets.back().push_back(I->second.TheDef);

 3063     Record *R = Nodes.back();
 3079     Record *XFormNode = Xforms.back();
 3091     ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
 3091     ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));

  159     OperandInfo &back() { return OperandList.back(); }

  569     if (!I->second->SuperRegs.empty() && I->second->SuperRegs.back() == this)
  674       Record *NewReg = SynthDefs.back().get();
 1887     RegUnitSets.back().Name = RC.getName();
 1890     RC.buildRegUnitSet(*this, RegUnitSets.back().Units);
 1894       findRegUnitSet(RegUnitSets, RegUnitSets.back());
 1942       RegUnitSets.back().Name =
 1949                      std::inserter(RegUnitSets.back().Units,
 1950                                    RegUnitSets.back().Units.begin()));
 1954         findRegUnitSet(RegUnitSets, RegUnitSets.back());
 1959                           << RegUnitSets.back().Name << ":";
 1961                         : RegUnitSets.back().Units) printRegUnitName(U);

  561   LLVM_DEBUG(ProcModels.back().dump());
  871   SchedClasses.back().ProcIndices.push_back(0);
 1033   CodeGenSchedClass &SC = SchedClasses.back();
 1106     CodeGenSchedClass &SC = SchedClasses.back();
 1619   TransVec.back().PredTerm = Trans.PredTerm;
 1620   TransVec.back().ProcIndices = Trans.ProcIndices;
 1696   LastTransitions.back().ProcIndices.append(ProcIndices.begin(),
 1795     CodeGenRegisterFile &CGRF = PM.RegisterFiles.back();

  393         Groups.back().getOpcodeInfo().getPredicates() != Info.getPredicates())
  395     Groups.back().addOpcode(OpcodeRec);

  595     if (Intrinsics[I].TargetPrefix != Targets.back().Name) {
  596       Targets.back().Count = I - Targets.back().Offset;
  596       Targets.back().Count = I - Targets.back().Offset;
  599   Targets.back().Count = Intrinsics.size() - Targets.back().Offset;
  599   Targets.back().Count = Intrinsics.size() - Targets.back().Offset;

  273     Actions.insert(Transitions.back().getActions());
  306   const auto &ActionTypes = Transitions.back().getTypes();

  683       FixupList &CurScope = TableInfo.FixupStack.back();
  730     TableInfo.FixupStack.back().push_back(PrevFilter);
 1283   TableInfo.FixupStack.back().push_back(TableInfo.Table.size());
 1379     TableInfo.FixupStack.back().push_back(TableInfo.Table.size());
 1423     TableInfo.FixupStack.back().push_back(TableInfo.Table.size());
 1442   resolveTableFixups(TableInfo.Table, TableInfo.FixupStack.back(),
 2495     resolveTableFixups(TableInfo.Table, TableInfo.FixupStack.back(),

 2077       Rule.defineOperand(SymbolicName, *Operands.back());
 2079     return *Operands.back();
 2808     return *static_cast<Kind *>(OperandRenderers.back().get());
 2949   MutatableInsns.insert(Matchers.back().get());
 2950   return *Matchers.back();

  132         OperandList.back().Rec = OpR;

  581     Enum.EntryMap.insert(std::make_pair(EntryRec, Enum.Entries.back().get()));

  444     std::vector<InstrItinerary> &ItinList = ProcItinLists.back();
  988   std::vector<MCSchedClassDesc> &SCTab = SchedTables.ProcSchedClasses.back();
  994     MCSchedClassDesc &SCDesc = SCTab.back();
 1076       unsigned WriteID = WriteSeq.back();

  209           instance.last_benchmark_instance = (&args == &family->args_.back());

 3372       matcher_describers().push_back(matchers_.back().GetDescriber());