Home
last modified time | relevance | path

Searched refs:Stack (Results 1 – 25 of 169) sorted by relevance

1234567

/freebsd-13.1/contrib/llvm-project/llvm/lib/BinaryFormat/
H A DMsgPackDocument.cpp182 if (Stack.empty()) in readFromBlob()
199 ++Stack.back().Index; in readFromBlob()
206 DocNode MapKey = !Stack.empty() && !Stack.back().MapKey.isEmpty() in readFromBlob()
231 if (Stack.back().Index != Stack.back().End) in readFromBlob()
233 Stack.pop_back(); in readFromBlob()
257 Stack.push_back( in writeToBlob()
262 Stack.push_back( in writeToBlob()
288 if (Stack.back().MapIt != Stack.back().Node.getMap().end()) in writeToBlob()
291 if (Stack.back().ArrayIt != Stack.back().Node.getArray().end()) in writeToBlob()
294 Stack.pop_back(); in writeToBlob()
[all …]
/freebsd-13.1/contrib/llvm-project/clang/lib/Format/
H A DContinuationIndenter.cpp306 State.Stack[State.Stack.size() - 2].NestedBlockInlined && in canBreak()
307 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks) in canBreak()
579 State.Stack.back().LastSpace = State.Stack.back().VariablePos; in addTokenOnCurrentLine()
751 State.Stack[State.Stack.size() - 2].CallContinuation == 0) in addTokenOnCurrentLine()
853 State.Stack[State.Stack.size() - 2].LastSpace = in addTokenOnNewLine()
908 State.Stack[State.Stack.size() - 2].NestedBlockInlined) || in addTokenOnNewLine()
1002 return State.Stack[State.Stack.size() - 2].NestedBlockIndent; in getNewLineColumn()
1004 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn()
1025 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn()
1027 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn()
[all …]
/freebsd-13.1/contrib/googletest/googletest/test/
H A Dgoogletest-output-test-golden-lin.txt7 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-13.1/contrib/llvm-project/llvm/lib/Target/WebAssembly/AsmParser/
H A DWebAssemblyAsmTypeCheck.cpp64 for (auto VT : Stack) { in dumpTypeStack()
84 if (Stack.empty()) { in popType()
92 auto PVT = Stack.back(); in popType()
93 Stack.pop_back(); in popType()
118 auto PVT = Stack[Stack.size() - LastSig.Returns.size() + i]; in checkEnd()
131 Stack.insert(Stack.end(), Sig.Returns.begin(), Sig.Returns.end()); in checkSig()
175 if (!Stack.empty()) { in endOfFunction()
191 Stack.push_back(Type); in typeCheck()
202 Stack.push_back(Type); in typeCheck()
206 Stack.push_back(Type); in typeCheck()
[all …]
/freebsd-13.1/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp37 SmallVector<WorkListUnit, 20> Stack; member in __anonff96a6e20111::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 __anonff96a6e20211::BFSBlockDFSContents
97 return !Queue.empty() || !Stack.empty(); in hasWork()
104 Stack.push_back(U); in enqueue()
109 if (!Stack.empty()) { in dequeue()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DSyncDependenceAnalysis.cpp145 while (!Stack.empty()) { in computeStackPO()
146 const auto *NextBB = Stack.back(); in computeStackPO()
164 Stack.push_back(NestedExitBB); in computeStackPO()
168 Stack.pop_back(); in computeStackPO()
184 Stack.push_back(SuccBB); in computeStackPO()
188 Stack.pop_back(); in computeStackPO()
198 BlockStack Stack; in computeTopLevelPO() local
199 Stack.reserve(24); // FIXME made-up number in computeTopLevelPO()
200 Stack.push_back(&F.getEntryBlock()); in computeTopLevelPO()
207 std::vector<const BasicBlock *> Stack; in computeLoopPO() local
[all …]
H A DPhiValues.cpp50 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-13.1/contrib/llvm-project/compiler-rt/lib/ubsan/
H A Dubsan_diag.h22 SymbolizedStack *Stack; variable
25 if (Stack) in clear()
26 Stack->ClearAll(); in clear()
30 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr)
31 : Stack(Stack) {} in Stack() function
34 if (Stack != S) in reset()
36 Stack = S; in reset()
38 const SymbolizedStack *get() const { return Stack; } in get()
72 Location(const SymbolizedStackHolder &Stack) : in Location() argument
73 Kind(LK_Symbolized), SymbolizedLoc(Stack.get()) {} in Location()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Support/
H A DJSON.cpp808 if (Stack.size() > 1 && Stack.back().Ctx == Singleton) { in flushComment()
825 Stack.emplace_back(); in arrayBegin()
838 Stack.pop_back(); in arrayEnd()
839 assert(!Stack.empty()); in arrayEnd()
844 Stack.emplace_back(); in objectBegin()
857 Stack.pop_back(); in objectEnd()
858 assert(!Stack.empty()); in objectEnd()
868 Stack.emplace_back(); in attributeBegin()
885 Stack.pop_back(); in attributeEnd()
891 Stack.emplace_back(); in rawValueBegin()
[all …]
H A DTimeProfiler.cpp85 Stack.emplace_back(steady_clock::now(), TimePointType(), std::move(Name), in begin()
90 assert(!Stack.empty() && "Must call begin() first"); in end()
91 Entry &E = Stack.back(); in end()
113 if (std::find_if(++Stack.rbegin(), Stack.rend(), [&](const Entry &Val) { in end()
115 }) == Stack.rend()) { in end()
121 Stack.pop_back(); in end()
129 assert(Stack.empty() && in write()
132 [](const auto &TTP) { return TTP->Stack.empty(); }) && in write()
249 SmallVector<Entry, 16> Stack; member
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyDebugFixup.cpp74 std::vector<StackElem> Stack; in runOnMachineFunction() local
89 for (auto &Elem : reverse(Stack)) { in runOnMachineFunction()
91 auto Depth = static_cast<unsigned>(&Elem - &Stack[0]); in runOnMachineFunction()
110 auto Prev = Stack.back(); in runOnMachineFunction()
111 Stack.pop_back(); in runOnMachineFunction()
131 Stack.push_back({MO.getReg(), nullptr}); in runOnMachineFunction()
136 assert(Stack.empty() && in runOnMachineFunction()
H A DWebAssemblyCFGStackify.cpp1587 for (auto X : reverse(Stack)) { in getBranchDepth()
1599 return Stack.size(); in getDelegateDepth()
1605 return getBranchDepth(Stack, MBB); in getDelegateDepth()
1622 for (auto X : reverse(Stack)) { in getDelegateDepth()
1632 const SmallVectorImpl<EndMarkerInfo> &Stack, in getRethrowDepth() argument
1656 for (auto X : reverse(Stack)) { in getRethrowDepth()
1671 SmallVector<EndMarkerInfo, 8> Stack; in rewriteDepthImmediates() local
1682 Stack.pop_back(); in rewriteDepthImmediates()
1687 Stack.pop_back(); in rewriteDepthImmediates()
1691 Stack.push_back(std::make_pair(&MBB, &MI)); in rewriteDepthImmediates()
[all …]
/freebsd-13.1/contrib/llvm-project/clang/lib/Sema/
H A DSemaAttr.cpp562 if (I != Stack.rend()) { in Act()
565 Stack.erase(std::prev(I.base()), Stack.end()); in Act()
576 Stack.erase(std::prev(I.base()), Stack.end()); in Act()
577 if (Stack.empty()) { in Act()
583 Stack.pop_back(); in Act()
595 Stack.pop_back(); in Act()
669 if (Action & PSK_Pop && Stack->Stack.empty()) in ActOnPragmaMSSeg()
1198 Stack->pop_back(); in PopPragmaVisibility()
1199 Back = &Stack->back(); in PopPragmaVisibility()
1208 Stack->pop_back(); in PopPragmaVisibility()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/Utils/
H A DAMDGPULDSUtils.cpp202 SmallVector<User *> Stack{U}; in collectFunctionUses() local
204 while (!Stack.empty()) { in collectFunctionUses()
205 U = Stack.pop_back_val(); in collectFunctionUses()
216 append_range(Stack, U->users()); in collectFunctionUses()
233 while (!Stack.empty()) { in hasUserInstruction()
234 const User *U = Stack.pop_back_val(); in hasUserInstruction()
242 append_range(Stack, U->users()); in hasUserInstruction()
255 SmallVector<const User *, 16> Stack(GV.users()); in shouldLowerLDSToStruct() local
260 while (!Stack.empty()) { in shouldLowerLDSToStruct()
261 const User *V = Stack.pop_back_val(); in shouldLowerLDSToStruct()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp78 SmallVector<Instruction *, 8> Stack; in buildTruncExpressionDag() local
96 if (!Stack.empty() && Stack.back() == I) { in buildTruncExpressionDag()
100 Stack.pop_back(); in buildTruncExpressionDag()
112 Stack.push_back(I); in buildTruncExpressionDag()
151 SmallVector<Instruction *, 8> Stack; in getMinBitWidth() local
181 if (!Stack.empty() && Stack.back() == I) { in getMinBitWidth()
185 Stack.pop_back(); in getMinBitWidth()
194 Stack.push_back(I); in getMinBitWidth()
/freebsd-13.1/contrib/llvm-project/llvm/lib/IR/
H A DReplaceConstant.cpp92 std::vector<std::vector<ConstantExpr *>> Stack{Path}; in collectConstantExprPaths() local
93 while (!Stack.empty()) { in collectConstantExprPaths()
94 std::vector<ConstantExpr *> TPath = Stack.back(); in collectConstantExprPaths()
95 Stack.pop_back(); in collectConstantExprPaths()
107 Stack.push_back(NPath); in collectConstantExprPaths()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUAlwaysInlinePass.cpp57 SmallVector<User *, 16> Stack(GV.users()); in recursivelyVisitUsers() local
61 while (!Stack.empty()) { in recursivelyVisitUsers()
62 User *U = Stack.pop_back_val(); in recursivelyVisitUsers()
77 Stack.push_back(F); in recursivelyVisitUsers()
84 append_range(Stack, U->users()); in recursivelyVisitUsers()
H A DSILowerI1Copies.cpp132 SmallVector<MachineBasicBlock *, 4> Stack; member in __anonc2da0cc90111::PhiIncomingAnalysis
148 assert(Stack.empty()); in analyze()
184 while (!Stack.empty()) { in analyze()
199 Stack.push_back(Pred); in analyze()
210 Stack.clear(); in analyze()
269 SmallVector<MachineBasicBlock *, 4> Stack; member in __anonc2da0cc90111::LoopFinder
279 Stack.clear(); in initialize()
352 Stack.push_back(DefBlock); in advanceLevel()
359 Stack.push_back(NextLevel[i]); in advanceLevel()
370 while (!Stack.empty()) { in advanceLevel()
[all …]
H A DSIAnnotateControlFlow.cpp58 StackVector Stack; member in __anoncca68f760111::SIAnnotateControlFlow
155 return !Stack.empty() && Stack.back().first == BB; in isTopOfStack()
160 return Stack.pop_back_val().second; in popSaved()
165 Stack.push_back(std::make_pair(BB, Saved)); in push()
289 assert(Stack.back().first == BB); in closeControlFlow()
366 if (!Stack.empty()) { in runOnFunction()
/freebsd-13.1/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-account.cpp178 ThreadStack.Stack.emplace_back(Record.FuncId, Record.TSC); in accountRecord()
185 if (ThreadStack.Stack.empty()) in accountRecord()
188 if (ThreadStack.Stack.back().first == Record.FuncId) { in accountRecord()
189 const auto &Top = ThreadStack.Stack.back(); in accountRecord()
195 ThreadStack.Stack.pop_back(); in accountRecord()
204 std::find_if(ThreadStack.Stack.rbegin(), ThreadStack.Stack.rend(), in accountRecord()
208 if (Parent == ThreadStack.Stack.rend()) in accountRecord()
248 ThreadStack.Stack.pop_back(); in accountRecord()
494 if (ThreadStack.second.Stack.empty()) { in __anone10012d70f02()
498 auto Level = ThreadStack.second.Stack.size(); in __anone10012d70f02()
[all …]
H A Dxray-stacks.cpp36 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));
685 static CommandRegistration Unused(&Stack, []() -> Error { in __anon4a2878f30802()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp264 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl()
267 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl()
288 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder()
292 Stack); in predictValueUseListOrder()
305 UseListOrderStack Stack; in predictUseListOrder() local
315 predictValueUseListOrder(&BB, &F, OM, Stack); in predictUseListOrder()
317 predictValueUseListOrder(&A, &F, OM, Stack); in predictUseListOrder()
325 Stack); in predictUseListOrder()
329 predictValueUseListOrder(&I, &F, OM, Stack); in predictUseListOrder()
335 predictValueUseListOrder(&G, nullptr, OM, Stack); in predictUseListOrder()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/
H A DFileSystem.h1469 if (State->Stack.top() == directory_iterator()) in State()
1480 file_type type = State->Stack.top()->type(); in increment()
1489 State->Stack.push(directory_iterator(*State->Stack.top(), ec, Follow)); in increment()
1490 if (State->Stack.top() != end_itr) { in increment()
1494 State->Stack.pop(); in increment()
1498 while (!State->Stack.empty() in increment()
1500 State->Stack.pop(); in increment()
1505 if (State->Stack.empty()) in increment()
1532 State->Stack.pop(); in pop()
1534 } while (!State->Stack.empty() in pop()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFExpression.cpp410 SmallVector<PrintedExpr, 4> Stack; in printCompactDWARFExpr() local
425 raw_svector_ostream S(Stack.emplace_back(PrintedExpr::Value).String); in printCompactDWARFExpr()
437 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
450 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
460 assert(!Stack.empty()); in printCompactDWARFExpr()
461 Stack.back().Kind = PrintedExpr::Value; in printCompactDWARFExpr()
485 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
501 assert(Stack.size() == 1 && "expected one value on stack"); in printCompactDWARFExpr()
503 if (Stack.front().Kind == PrintedExpr::Address) in printCompactDWARFExpr()
504 OS << "[" << Stack.front().String << "]"; in printCompactDWARFExpr()
[all …]
/freebsd-13.1/contrib/llvm-project/clang/lib/Basic/
H A DModule.cpp310 SmallVector<Module *, 2> Stack; in markUnavailable() local
311 Stack.push_back(this); in markUnavailable()
312 while (!Stack.empty()) { in markUnavailable()
313 Module *Current = Stack.back(); in markUnavailable()
314 Stack.pop_back(); in markUnavailable()
325 Stack.push_back(*Sub); in markUnavailable()
423 SmallVector<Module *, 16> Stack(Imports.begin(), Imports.end()); in buildVisibleModulesCache() local
424 while (!Stack.empty()) { in buildVisibleModulesCache()
425 Module *CurrModule = Stack.pop_back_val(); in buildVisibleModulesCache()
429 CurrModule->getExportedModules(Stack); in buildVisibleModulesCache()

1234567