/freebsd-11-stable/contrib/llvm-project/llvm/lib/BinaryFormat/ |
H A D | MsgPackDocument.cpp | 78 SmallVector<StackLevel, 4> Stack; local 82 Stack.push_back(StackLevel({Root, (size_t)-1, nullptr})); 89 if (Multi && Stack.size() == 1) { 127 if (Stack.empty()) 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 183 SmallVector<WriterStackLevel, 4> Stack; local [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Format/ |
H A D | ContinuationIndenter.cpp | 38 const std::vector<ParenState> &Stack) { 81 int MatchingStackIndex = Stack.size() - 1; 87 while (MatchingStackIndex >= 0 && Stack[MatchingStackIndex].Tok != LBrace) 89 return MatchingStackIndex >= 0 ? &Stack[MatchingStackIndex] : nullptr; 254 State.Stack.push_back(ParenState(/*Tok=*/nullptr, FirstIndent, FirstIndent, 267 State.Stack.back().AvoidBinPacking = true; 268 State.Stack.back().BreakBeforeParameter = true; 269 State.Stack.back().AlignColons = false; 281 if (!Current.CanBreakBefore && !(State.Stack.back().BreakBeforeClosingBrace && 300 if (Current.isMemberAccess() && State.Stack 37 getLengthToMatchingParen(const FormatToken &Tok, const std::vector<ParenState> &Stack) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUAlwaysInlinePass.cpp | 59 SmallVector<User *, 16> Stack; local 64 Stack.push_back(U); 66 while (!Stack.empty()) { 67 User *U = Stack.pop_back_val(); 75 Stack.push_back(F); 83 Stack.push_back(UU);
|
H A D | SIAnnotateControlFlow.cpp | 76 StackVector Stack; member in class:__anon2109::SIAnnotateControlFlow 170 return !Stack.empty() && Stack.back().first == BB; 175 return Stack.pop_back_val().second; 180 Stack.push_back(std::make_pair(BB, Saved)); 295 assert(Stack.back().first == BB); 365 if (!Stack.empty()) {
|
H A D | AMDGPUAnnotateKernelFeatures.cpp | 112 SmallVector<const Constant *, 16> Stack; 113 Stack.push_back(EntryC); 115 while (!Stack.empty()) { 116 const Constant *C = Stack.pop_back_val(); 133 Stack.push_back(OpC);
|
H A D | AMDGPUUnifyDivergentExitNodes.cpp | 101 SmallVector<BasicBlock *, 8> Stack; local 105 Stack.push_back(Pred); 107 while (!Stack.empty()) { 108 BasicBlock *Top = Stack.pop_back_val(); 114 Stack.push_back(Pred);
|
H A D | SILowerI1Copies.cpp | 140 SmallVector<MachineBasicBlock *, 4> Stack; member in class:__anon2122::PhiIncomingAnalysis 156 assert(Stack.empty()); 190 Stack.push_back(Succ); 194 while (!Stack.empty()) { 195 MachineBasicBlock *MBB = Stack.pop_back_val(); 201 Stack.push_back(Succ); 210 Stack.push_back(Pred); 216 for (MachineBasicBlock *UnreachablePred : Stack) { 221 Stack.clear(); 280 SmallVector<MachineBasicBlock *, 4> Stack; member in class:__anon2122::LoopFinder [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | WorkList.cpp | 37 SmallVector<WorkListUnit, 20> Stack; member in class:__anon903::DFS 41 return !Stack.empty(); 45 Stack.push_back(U); 49 assert(!Stack.empty()); 50 const WorkListUnit& U = Stack.back(); 51 Stack.pop_back(); // This technically "invalidates" U, but we are fine. 93 SmallVector<WorkListUnit, 20> Stack; member in class:__anon904::BFSBlockDFSContents 97 return !Queue.empty() || !Stack.empty(); 104 Stack.push_back(U); 109 if (!Stack [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/ubsan/ |
H A D | ubsan_diag.h | 22 SymbolizedStack *Stack; member in class:__ubsan::SymbolizedStackHolder 25 if (Stack) 26 Stack->ClearAll(); 30 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr) 31 : Stack(Stack) {} 34 if (Stack != S) 36 Stack = S; 38 const SymbolizedStack *get() const { return Stack; } 72 Location(const SymbolizedStackHolder &Stack) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | TimeProfiler.cpp | 67 Stack.emplace_back(steady_clock::now(), TimePointType(), std::move(Name), 72 assert(!Stack.empty() && "Must call begin() first"); 73 auto &E = Stack.back(); 95 if (std::find_if(++Stack.rbegin(), Stack.rend(), [&](const Entry &Val) { 97 }) == Stack.rend()) { 103 Stack.pop_back(); 107 assert(Stack.empty() && 181 SmallVector<Entry, 16> Stack; member in struct:llvm::TimeTraceProfiler
|
H A D | JSON.cpp | 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; 648 Stack.emplace_back(); 649 Stack.back().Ctx = Array; 655 assert(Stack.back().Ctx == Array); 657 if (Stack.back().HasValue) 660 Stack [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | PhiValues.cpp | 51 SmallVectorImpl<const PHINode *> &Stack) { 65 processPhi(PhiPhiOp, Stack); 79 Stack.push_back(Phi); 89 const PHINode *ComponentPhi = Stack.pop_back_val(); 108 if (Stack.empty()) 111 unsigned int &ComponentDepthNumber = DepthMap[Stack.back()]; 129 SmallVector<const PHINode *, 8> Stack; local 130 processPhi(PN, Stack); 132 assert(Stack.empty()); 50 processPhi(const PHINode *Phi, SmallVectorImpl<const PHINode *> &Stack) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
H A D | TruncInstCombine.cpp | 66 SmallVector<Instruction *, 8> Stack; local 84 if (!Stack.empty() && Stack.back() == I) { 86 // Worklist and the Stack, and add it to the instruction info map. 88 Stack.pop_back(); 100 Stack.push_back(I); 139 SmallVector<Instruction *, 8> Stack; local 169 if (!Stack.empty() && Stack.back() == I) { 171 // Worklist and the Stack, an [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaAttr.cpp | 241 if (PackStack.Stack.empty()) { 328 if (PackStack.Stack.empty()) 370 if (PackStack.Stack.empty()) 373 for (const auto &StackSlot : llvm::reverse(PackStack.Stack)) { 420 if (Action & PSK_Pop && VtorDispStack.Stack.empty()) 437 Stack.emplace_back(StackSlotLabel, CurrentValue, CurrentPragmaLocation, 442 auto I = llvm::find_if(llvm::reverse(Stack), [&](const Slot &x) { 446 if (I != Stack.rend()) { 449 Stack.erase(std::prev(I.base()), Stack 517 PragmaStack<StringLiteral *> *Stack = local 910 VisStack *Stack = static_cast<VisStack*>(S.VisContext); local 971 VisStack *Stack = static_cast<VisStack*>(VisContext); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Bitcode/Writer/ |
H A D | ValueEnumerator.cpp | 172 UseListOrderStack &Stack) { 233 Stack.emplace_back(V, F, List.size()); 234 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size"); 236 Stack.back().Shuffle[I] = List[I].second; 240 OrderMap &OM, UseListOrderStack &Stack) { 250 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack); 257 predictValueUseListOrder(Op, F, OM, Stack); 268 UseListOrderStack Stack; local 278 predictValueUseListOrder(&BB, &F, OM, Stack); 280 predictValueUseListOrder(&A, &F, OM, Stack); 170 predictValueUseListOrderImpl(const Value *V, const Function *F, unsigned ID, const OrderMap &OM, UseListOrderStack &Stack) argument 239 predictValueUseListOrder(const Value *V, const Function *F, OrderMap &OM, UseListOrderStack &Stack) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | CFIInstrInserter.cpp | 224 SmallVector<MachineBasicBlock *, 4> Stack; local 225 Stack.push_back(MBBInfo.MBB); 228 MachineBasicBlock *Current = Stack.pop_back_val(); 239 Stack.push_back(Succ); 242 } while (!Stack.empty());
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | FileSystem.h | 1333 std::stack<directory_iterator, std::vector<directory_iterator>> Stack; member in struct:llvm::sys::fs::detail::RecDirIterState 1352 State->Stack.push(directory_iterator(path, ec, Follow)); 1353 if (State->Stack.top() == directory_iterator()) 1364 file_type type = State->Stack.top()->type(); 1367 ErrorOr<basic_file_status> status = State->Stack.top()->status(); 1373 State->Stack.push(directory_iterator(*State->Stack.top(), ec, Follow)); 1374 if (State->Stack.top() != end_itr) { 1378 State->Stack.pop(); 1382 while (!State->Stack [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/ |
H A D | OrcCBindingsStack.h | 125 CBindingsResolver(OrcCBindingsStack &Stack, argument 128 : Stack(Stack), ExternalResolver(std::move(ExternalResolver)), 140 Stack.reportError(std::move(Err)); 159 Stack.ES.legacyFailQuery(*Query, Addr.takeError()); 163 Stack.ES.legacyFailQuery(*Query, std::move(Err)); 182 if (Stack.CODLayer) { 183 if (auto Sym = Stack.CODLayer->findSymbol(Name, true)) 188 if (auto Sym = Stack.CompileLayer.findSymbol(Name, true)) 194 if (auto Sym = Stack 204 OrcCBindingsStack &Stack; member in class:llvm::OrcCBindingsStack::CBindingsResolver [all...] |
/freebsd-11-stable/crypto/heimdal/lib/com_err/ |
H A D | parse.c | 385 # define YYSTACK_RELOCATE(Stack) \ 389 YYCOPY (&yyptr->Stack, Stack, yysize); \ 390 Stack = &yyptr->Stack; \ 391 yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ 763 YYFPRINTF (stderr, "Stack now"); 1277 YYDPRINTF ((stderr, "Stack size increased to %lu\n",
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Basic/ |
H A D | Module.cpp | 296 SmallVector<Module *, 2> Stack; 297 Stack.push_back(this); 298 while (!Stack.empty()) { 299 Module *Current = Stack.back(); 300 Stack.pop_back(); 311 Stack.push_back(*Sub); 409 SmallVector<Module *, 16> Stack(Imports.begin(), Imports.end()); 410 while (!Stack.empty()) { 411 Module *CurrModule = Stack.pop_back_val(); 415 CurrModule->getExportedModules(Stack); [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/ |
H A D | xray-stacks.cpp | 1 //===- xray-stacks.cpp: XRay Function Call Stack Accounting ---------------===// 36 static cl::SubCommand Stack("stack", "Call stack accounting"); 39 cl::sub(Stack), cl::OneOrMore); 43 cl::sub(Stack), cl::init(false)); 53 cl::sub(Stack), cl::init("")); 60 cl::sub(Stack), cl::init(false)); 65 cl::sub(Stack), cl::init(false)); 71 cl::sub(Stack), cl::init(false)); 89 cl::sub(Stack), cl::init(HUMAN)); 108 cl::sub(Stack), c [all...] |
/freebsd-11-stable/contrib/amd/fsinfo/ |
H A D | null_gram.c | 331 # define YYSTACK_RELOCATE(Stack_alloc, Stack) \ 335 YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ 336 Stack = &yyptr->Stack_alloc; \ 337 yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ 622 YYFPRINTF (stderr, "Stack now"); 1075 YYDPRINTF ((stderr, "Stack size increased to %lu\n",
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Object/ |
H A D | COFFModuleDefinition.cpp | 161 if (Stack.empty()) { 165 Tok = Stack.back(); 166 Stack.pop_back(); 183 void unget() { Stack.push_back(Tok); } 355 std::vector<Token> Stack; member in class:llvm::object::Parser
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | PseudoSourceValue.h | 39 Stack, 69 bool isStack() const { return Kind == Stack; }
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Serialization/ |
H A D | ModuleManager.h | 105 Stack.reserve(N); 114 SmallVector<ModuleFile *, 4> Stack; member in struct:clang::serialization::ModuleManager::VisitState
|