/freebsd/contrib/llvm-project/llvm/lib/BinaryFormat/ |
H A D | MsgPackDocument.cpp | 195 if (Stack.empty()) in readFromBlob() 212 ++Stack.back().Index; in readFromBlob() 219 DocNode MapKey = !Stack.empty() && !Stack.back().MapKey.isEmpty() in readFromBlob() 244 if (Stack.back().Index != Stack.back().End) in readFromBlob() 246 Stack.pop_back(); in readFromBlob() 270 Stack.push_back( in writeToBlob() 275 Stack.push_back( in writeToBlob() 304 if (Stack.back().MapIt != Stack.back().Node.getMap().end()) in writeToBlob() 307 if (Stack.back().ArrayIt != Stack.back().Node.getArray().end()) in writeToBlob() 310 Stack.pop_back(); in writeToBlob() [all …]
|
/freebsd/contrib/googletest/googletest/test/ |
H A D | googletest-output-test-golden-lin.txt | 7 Stack trace: (omitted) 13 Stack trace: (omitted) 47 Stack trace: (omitted) 55 Stack trace: (omitted) 69 Stack trace: (omitted) 80 Stack trace: (omitted) 90 Stack trace: (omitted) 99 Stack trace: (omitted) 109 Stack trace: (omitted) 115 Stack trace: (omitted) [all …]
|
/freebsd/contrib/expat/examples/ |
H A D | element_declarations.c | 63 } Stack; typedef 65 static Stack * 66 stackPushMalloc(Stack *stackTop, const XML_Content *model, unsigned level) { in stackPushMalloc() 67 Stack *const newStackTop = malloc(sizeof(Stack)); in stackPushMalloc() 77 static Stack * 78 stackPopFree(Stack *stackTop) { in stackPopFree() 79 Stack *const newStackTop = stackTop->prev; in stackPopFree() 145 Stack *stackTop = stackPushMalloc(NULL, root, 1); in dumpContentModel() 159 Stack *const newStackTop in dumpContentModel()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/AsmParser/ |
H A D | WebAssemblyAsmTypeCheck.cpp | 64 for (auto VT : Stack) { in dumpTypeStack() 87 if (Stack.empty()) { in popType() 103 if (Stack.empty()) { in popRefType() 177 Stack.insert(Stack.end(), Sig.Returns.begin(), Sig.Returns.end()); in checkSig() 240 if (!Stack.empty()) { in endOfFunction() 257 Stack.push_back(Type); in typeCheck() 268 Stack.push_back(Type); in typeCheck() 272 Stack.push_back(Type); in typeCheck() 283 Stack.push_back(Type); in typeCheck() 354 Stack.insert(Stack.end(), Sig->Params.begin(), Sig->Params.end()); in typeCheck() [all …]
|
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | WorkList.cpp | 37 SmallVector<WorkListUnit, 20> Stack; member in __anon5f5042760111::DFS 41 return !Stack.empty(); in hasWork() 45 Stack.push_back(U); in enqueue() 49 assert(!Stack.empty()); in dequeue() 50 const WorkListUnit& U = Stack.back(); in dequeue() 51 Stack.pop_back(); // This technically "invalidates" U, but we are fine. in dequeue() 93 SmallVector<WorkListUnit, 20> Stack; member in __anon5f5042760211::BFSBlockDFSContents 97 return !Queue.empty() || !Stack.empty(); in hasWork() 104 Stack.push_back(U); in enqueue() 109 if (!Stack.empty()) { in dequeue() [all …]
|
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_symbolizer.h | 68 SymbolizedStack *Stack; variable 71 if (Stack) in clear() 72 Stack->ClearAll(); in clear() 76 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr) 77 : Stack(Stack) {} in Stack() function 80 if (Stack != S) 82 Stack = S; 84 const SymbolizedStack *get() const { return Stack; } in get()
|
/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | JSON.cpp | 829 if (Stack.size() > 1 && Stack.back().Ctx == Singleton) { in flushComment() 846 Stack.emplace_back(); in arrayBegin() 859 Stack.pop_back(); in arrayEnd() 860 assert(!Stack.empty()); in arrayEnd() 865 Stack.emplace_back(); in objectBegin() 878 Stack.pop_back(); in objectEnd() 879 assert(!Stack.empty()); in objectEnd() 889 Stack.emplace_back(); in attributeBegin() 906 Stack.pop_back(); in attributeEnd() 912 Stack.emplace_back(); in rawValueBegin() [all …]
|
H A D | TimeProfiler.cpp | 106 Stack.emplace_back(ClockType::now(), TimePointType(), std::move(Name), in begin() 111 assert(!Stack.empty() && "Must call begin() first"); in end() 112 TimeTraceProfilerEntry &E = Stack.back(); in end() 134 if (llvm::none_of(llvm::drop_begin(llvm::reverse(Stack)), in end() 143 Stack.pop_back(); in end() 152 assert(Stack.empty() && in write() 155 [](const auto &TTP) { return TTP->Stack.empty(); }) && in write() 272 SmallVector<TimeTraceProfilerEntry, 16> Stack; member
|
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyDebugFixup.cpp | 92 std::vector<StackElem> Stack; in runOnMachineFunction() local 107 for (auto &Elem : reverse(Stack)) { in runOnMachineFunction() 109 auto Depth = static_cast<unsigned>(&Elem - &Stack[0]); in runOnMachineFunction() 128 auto Prev = Stack.back(); in runOnMachineFunction() 129 Stack.pop_back(); in runOnMachineFunction() 149 Stack.push_back({MO.getReg(), nullptr}); in runOnMachineFunction() 154 assert(Stack.empty() && in runOnMachineFunction()
|
H A D | WebAssemblyCFGStackify.cpp | 1569 for (auto X : reverse(Stack)) { in getBranchDepth() 1581 return Stack.size(); in getDelegateDepth() 1587 return getBranchDepth(Stack, MBB); in getDelegateDepth() 1604 for (auto X : reverse(Stack)) { in getDelegateDepth() 1614 const SmallVectorImpl<EndMarkerInfo> &Stack, in getRethrowDepth() argument 1638 for (auto X : reverse(Stack)) { in getRethrowDepth() 1653 SmallVector<EndMarkerInfo, 8> Stack; in rewriteDepthImmediates() local 1663 Stack.pop_back(); in rewriteDepthImmediates() 1668 Stack.pop_back(); in rewriteDepthImmediates() 1672 Stack.push_back(std::make_pair(&MBB, &MI)); in rewriteDepthImmediates() [all …]
|
/freebsd/contrib/llvm-project/clang/lib/Format/ |
H A D | ContinuationIndenter.cpp | 323 State.Stack[State.Stack.size() - 2].NestedBlockInlined && in canBreak() 324 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks && in canBreak() 923 State.Stack[State.Stack.size() - 2].CallContinuation == 0) { in addTokenOnCurrentLine() 1030 State.Stack[State.Stack.size() - 2].LastSpace = in addTokenOnNewLine() 1090 State.Stack[State.Stack.size() - 2].NestedBlockInlined) || in addTokenOnNewLine() 1252 return State.Stack[State.Stack.size() - 2].NestedBlockIndent; in getNewLineColumn() 1254 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn() 1275 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn() 1282 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn() 1285 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | PhiValues.cpp | 50 SmallVectorImpl<const PHINode *> &Stack) { in processPhi() argument 64 processPhi(PhiPhiOp, Stack); in processPhi() 78 Stack.push_back(Phi); in processPhi() 88 const PHINode *ComponentPhi = Stack.pop_back_val(); in processPhi() 107 if (Stack.empty()) in processPhi() 110 unsigned int &ComponentDepthNumber = DepthMap[Stack.back()]; in processPhi() 128 SmallVector<const PHINode *, 8> Stack; in getValuesForPhi() local 129 processPhi(PN, Stack); in getValuesForPhi() 131 assert(Stack.empty()); in getValuesForPhi()
|
/freebsd/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaAttr.cpp | 639 if (I != Stack.rend()) { in Act() 642 Stack.erase(std::prev(I.base()), Stack.end()); in Act() 653 Stack.erase(std::prev(I.base()), Stack.end()); in Act() 654 if (Stack.empty()) { in Act() 660 Stack.pop_back(); in Act() 672 Stack.pop_back(); in Act() 746 if (Action & PSK_Pop && Stack->Stack.empty()) in ActOnPragmaMSSeg() 1394 Stack->pop_back(); in PopPragmaVisibility() 1395 Back = &Stack->back(); in PopPragmaVisibility() 1404 Stack->pop_back(); in PopPragmaVisibility() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUAlwaysInlinePass.cpp | 58 SmallVector<User *, 16> Stack(GV.users()); in recursivelyVisitUsers() local 62 while (!Stack.empty()) { in recursivelyVisitUsers() 63 User *U = Stack.pop_back_val(); in recursivelyVisitUsers() 78 Stack.push_back(F); in recursivelyVisitUsers() 85 append_range(Stack, U->users()); in recursivelyVisitUsers()
|
H A D | SILowerI1Copies.cpp | 135 SmallVector<MachineBasicBlock *, 4> Stack; member in __anon2293a85d0111::PhiIncomingAnalysis 151 assert(Stack.empty()); in analyze() 177 while (!Stack.empty()) { in analyze() 192 Stack.push_back(Pred); in analyze() 203 Stack.clear(); in analyze() 262 SmallVector<MachineBasicBlock *, 4> Stack; member in __anon2293a85d0111::LoopFinder 272 Stack.clear(); in initialize() 349 Stack.push_back(DefBlock); in advanceLevel() 356 Stack.push_back(NextLevel[i]); in advanceLevel() 367 while (!Stack.empty()) { in advanceLevel() [all …]
|
H A D | SIAnnotateControlFlow.cpp | 59 StackVector Stack; member in __anon56938a0a0111::SIAnnotateControlFlow 156 return !Stack.empty() && Stack.back().first == BB; in isTopOfStack() 161 return Stack.pop_back_val().second; in popSaved() 166 Stack.push_back(std::pair(BB, Saved)); in push() 312 assert(Stack.back().first == BB); in closeControlFlow() 393 if (!Stack.empty()) { in runOnFunction()
|
/freebsd/contrib/llvm-project/llvm/lib/IR/ |
H A D | ReplaceConstant.cpp | 52 SmallVector<Constant *> Stack; in convertUsersOfConstantsToInstructions() local 56 Stack.push_back(cast<Constant>(U)); in convertUsersOfConstantsToInstructions() 60 while (!Stack.empty()) { in convertUsersOfConstantsToInstructions() 61 Constant *C = Stack.pop_back_val(); in convertUsersOfConstantsToInstructions() 67 Stack.push_back(cast<Constant>(Nested)); in convertUsersOfConstantsToInstructions()
|
/freebsd/contrib/llvm-project/llvm/lib/Bitcode/Writer/ |
H A D | ValueEnumerator.cpp | 217 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl() 220 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl() 241 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder() 245 Stack); in predictValueUseListOrder() 258 UseListOrderStack Stack; in predictUseListOrder() local 267 predictValueUseListOrder(&BB, &F, OM, Stack); in predictUseListOrder() 269 predictValueUseListOrder(&A, &F, OM, Stack); in predictUseListOrder() 288 Stack); in predictUseListOrder() 289 predictValueUseListOrder(&I, &F, OM, Stack); in predictUseListOrder() 296 predictValueUseListOrder(&G, nullptr, OM, Stack); in predictUseListOrder() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/DXILWriter/ |
H A D | DXILValueEnumerator.cpp | 268 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl() 271 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl() 292 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder() 296 Stack); in predictValueUseListOrder() 309 UseListOrderStack Stack; in predictUseListOrder() local 318 predictValueUseListOrder(&BB, &F, OM, Stack); in predictUseListOrder() 320 predictValueUseListOrder(&A, &F, OM, Stack); in predictUseListOrder() 328 Stack); in predictUseListOrder() 332 predictValueUseListOrder(&I, &F, OM, Stack); in predictUseListOrder() 338 predictValueUseListOrder(&G, nullptr, OM, Stack); in predictUseListOrder() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | FileSystem.h | 1494 if (State->Stack.top() == directory_iterator()) in State() 1505 file_type type = State->Stack.top()->type(); in increment() 1514 State->Stack.push(directory_iterator(*State->Stack.top(), ec, Follow)); in increment() 1515 if (State->Stack.top() != end_itr) { in increment() 1519 State->Stack.pop(); in increment() 1523 while (!State->Stack.empty() in increment() 1525 State->Stack.pop(); in increment() 1530 if (State->Stack.empty()) in increment() 1557 State->Stack.pop(); in pop() 1559 } while (!State->Stack.empty() in pop() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
H A D | TruncInstCombine.cpp | 90 SmallVector<Instruction *, 8> Stack; in buildTruncExpressionGraph() local 108 if (!Stack.empty() && Stack.back() == I) { in buildTruncExpressionGraph() 112 Stack.pop_back(); in buildTruncExpressionGraph() 124 Stack.push_back(I); in buildTruncExpressionGraph() 160 if (!llvm::is_contained(Stack, Op)) in buildTruncExpressionGraph() 177 SmallVector<Instruction *, 8> Stack; in getMinBitWidth() local 207 if (!Stack.empty() && Stack.back() == I) { in getMinBitWidth() 211 Stack.pop_back(); in getMinBitWidth() 220 Stack.push_back(I); in getMinBitWidth()
|
/freebsd/contrib/llvm-project/llvm/tools/llvm-xray/ |
H A D | xray-account.cpp | 180 ThreadStack.Stack.emplace_back(Record.FuncId, Record.TSC); in accountRecord() 187 if (ThreadStack.Stack.empty()) in accountRecord() 190 if (ThreadStack.Stack.back().first == Record.FuncId) { in accountRecord() 191 const auto &Top = ThreadStack.Stack.back(); in accountRecord() 197 ThreadStack.Stack.pop_back(); in accountRecord() 206 llvm::find_if(llvm::reverse(ThreadStack.Stack), in accountRecord() 210 if (Parent == ThreadStack.Stack.rend()) in accountRecord() 250 ThreadStack.Stack.pop_back(); in accountRecord() 496 if (ThreadStack.second.Stack.empty()) { in __anonc21121eb0f02() 500 auto Level = ThreadStack.second.Stack.size(); in __anonc21121eb0f02() [all …]
|
H A D | xray-stacks.cpp | 36 static cl::SubCommand Stack("stack", "Call stack accounting"); variable 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), cl::init(AggregationType::TOTAL_TIME)); 681 static CommandRegistration Unused(&Stack, []() -> Error { in __anon8f09f5870802()
|
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFExpression.cpp | 441 SmallVector<PrintedExpr, 4> Stack; in printCompactDWARFExpr() local 464 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr() 477 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr() 487 assert(!Stack.empty()); in printCompactDWARFExpr() 488 Stack.back().Kind = PrintedExpr::Value; in printCompactDWARFExpr() 515 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr() 531 if (Stack.size() != 1) { in printCompactDWARFExpr() 532 OS << "<stack of size " << Stack.size() << ", expected 1>"; in printCompactDWARFExpr() 536 if (Stack.front().Kind == PrintedExpr::Address) in printCompactDWARFExpr() 537 OS << "[" << Stack.front().String << "]"; in printCompactDWARFExpr() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | GenericUniformityImpl.h | 1260 while (!Stack.empty()) { in computeStackPO() 1261 auto *NextBB = Stack.back(); in computeStackPO() 1263 Stack.pop_back(); in computeStackPO() 1285 Stack.push_back(NestedExitBB); in computeStackPO() 1291 Stack.pop_back(); in computeStackPO() 1308 Stack.push_back(SuccBB); in computeStackPO() 1316 Stack.pop_back(); in computeStackPO() 1329 SmallVector<const BlockT *> Stack; in computeCyclePO() local 1353 Stack.push_back(BB); in computeCyclePO() 1367 SmallVector<const BlockT *> Stack; in compute() local [all …]
|