Home
last modified time | relevance | path

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

12345678910>>...12

/llvm-project-15.0.7/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 …]
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Ddeopt-bundles.ll10 ; STACKMAPS: Stack Maps: callsite 2882400015
11 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
17 ; STACKMAPS-NEXT: Stack Maps: callsite 4242
18 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
24 ; STACKMAPS-NEXT: Stack Maps: callsite 4243
25 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
32 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
39 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
45 ; STACKMAPS-NEXT: Stack Maps: callsite 4243
46 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
[all …]
H A Ddeopt-intrinsic.ll40 ; STACKMAPS: Stack Maps: callsites:
41 ; STACKMAPS-NEXT: Stack Maps: callsite 2882400015
42 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
43 ; STACKMAPS-NEXT: Stack Maps: Loc 0: Constant 0 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
44 ; STACKMAPS-NEXT: Stack Maps: Loc 1: Constant 0 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
45 ; STACKMAPS-NEXT: Stack Maps: Loc 2: Constant 1 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
46 ; STACKMAPS-NEXT: Stack Maps: Loc 3: Constant 0 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
47 ; STACKMAPS-NEXT: Stack Maps: has 0 live-out registers
48 ; STACKMAPS-NEXT: Stack Maps: callsite 2882400015
49 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
[all …]
H A Ddeopt-intrinsic-cconv.ll27 ; STACKMAPS: Stack Maps: callsites:
28 ; STACKMAPS-NEXT: Stack Maps: callsite 2882400015
29 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
30 ; STACKMAPS-NEXT: Stack Maps: Loc 0: Constant 12 [encoding: .byte 4, .byte 0, .short 8, .short 0,…
31 ; STACKMAPS-NEXT: Stack Maps: Loc 1: Constant 0 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
32 ; STACKMAPS-NEXT: Stack Maps: Loc 2: Constant 1 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
33 ; STACKMAPS-NEXT: Stack Maps: Loc 3: Constant 3 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
34 ; STACKMAPS-NEXT: Stack Maps: has 0 live-out registers
/llvm-project-15.0.7/llvm/lib/Target/WebAssembly/AsmParser/
H A DWebAssemblyAsmTypeCheck.cpp64 for (auto VT : Stack) { in dumpTypeStack()
87 if (Stack.empty()) { in popType()
103 if (Stack.empty()) { in popRefType()
139 auto PVT = Stack[Stack.size() - LastSig.Returns.size() + i]; in checkEnd()
152 Stack.insert(Stack.end(), Sig.Returns.begin(), Sig.Returns.end()); in checkSig()
215 if (!Stack.empty()) { in endOfFunction()
232 Stack.push_back(Type); in typeCheck()
243 Stack.push_back(Type); in typeCheck()
247 Stack.push_back(Type); in typeCheck()
258 Stack.push_back(Type); in typeCheck()
[all …]
/llvm-project-15.0.7/clang-tools-extra/pseudo/lib/
H A DBracket.cpp129 std::vector<unsigned> Stack; in simplePairBrackets() local
132 Stack.push_back(I); in simplePairBrackets()
133 } else if (!Stack.empty() && in simplePairBrackets()
134 Brackets[Stack.back()].Kind == Brackets[I].Kind) { in simplePairBrackets()
135 Brackets[Stack.back()].Pair = I; in simplePairBrackets()
136 Brackets[I].Pair = Stack.back(); in simplePairBrackets()
137 Stack.pop_back(); in simplePairBrackets()
140 Stack.clear(); in simplePairBrackets()
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp37 SmallVector<WorkListUnit, 20> Stack; member in __anon24f49dde0111::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 __anon24f49dde0211::BFSBlockDFSContents
97 return !Queue.empty() || !Stack.empty(); in hasWork()
104 Stack.push_back(U); in enqueue()
109 if (!Stack.empty()) { in dequeue()
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DSyncDependenceAnalysis.cpp162 while (!Stack.empty()) { in computeStackPO()
163 const auto *NextBB = Stack.back(); in computeStackPO()
181 Stack.push_back(NestedExitBB); in computeStackPO()
185 Stack.pop_back(); in computeStackPO()
201 Stack.push_back(SuccBB); in computeStackPO()
205 Stack.pop_back(); in computeStackPO()
215 BlockStack Stack; in computeTopLevelPO() local
216 Stack.reserve(24); // FIXME made-up number in computeTopLevelPO()
217 Stack.push_back(&F.getEntryBlock()); in computeTopLevelPO()
224 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()
/llvm-project-15.0.7/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() argument
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()
/llvm-project-15.0.7/llvm/lib/Support/
H A DJSON.cpp826 if (Stack.size() > 1 && Stack.back().Ctx == Singleton) { in flushComment()
843 Stack.emplace_back(); in arrayBegin()
856 Stack.pop_back(); in arrayEnd()
857 assert(!Stack.empty()); in arrayEnd()
862 Stack.emplace_back(); in objectBegin()
875 Stack.pop_back(); in objectEnd()
876 assert(!Stack.empty()); in objectEnd()
886 Stack.emplace_back(); in attributeBegin()
903 Stack.pop_back(); in attributeEnd()
909 Stack.emplace_back(); in rawValueBegin()
[all …]
/llvm-project-15.0.7/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.cpp1568 for (auto X : reverse(Stack)) { in getBranchDepth()
1580 return Stack.size(); in getDelegateDepth()
1586 return getBranchDepth(Stack, MBB); in getDelegateDepth()
1603 for (auto X : reverse(Stack)) { in getDelegateDepth()
1613 const SmallVectorImpl<EndMarkerInfo> &Stack, in getRethrowDepth() argument
1637 for (auto X : reverse(Stack)) { in getRethrowDepth()
1652 SmallVector<EndMarkerInfo, 8> Stack; in rewriteDepthImmediates() local
1662 Stack.pop_back(); in rewriteDepthImmediates()
1667 Stack.pop_back(); in rewriteDepthImmediates()
1671 Stack.push_back(std::make_pair(&MBB, &MI)); in rewriteDepthImmediates()
[all …]
/llvm-project-15.0.7/clang/lib/Format/
H A DContinuationIndenter.cpp312 State.Stack[State.Stack.size() - 2].NestedBlockInlined && in canBreak()
313 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks) { in canBreak()
828 State.Stack[State.Stack.size() - 2].CallContinuation == 0) { in addTokenOnCurrentLine()
935 State.Stack[State.Stack.size() - 2].LastSpace = in addTokenOnNewLine()
995 State.Stack[State.Stack.size() - 2].NestedBlockInlined) || in addTokenOnNewLine()
1107 return State.Stack[State.Stack.size() - 2].NestedBlockIndent; in getNewLineColumn()
1109 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn()
1130 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn()
1134 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn()
1137 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn()
[all …]
/llvm-project-15.0.7/clang-tools-extra/pseudo/unittests/
H A DBracketTest.cpp44 std::vector<const Token *> Stack; in verifyNesting() local
47 Stack.push_back(&Tok); in verifyNesting()
49 ASSERT_FALSE(Stack.empty()) << Tok; in verifyNesting()
50 ASSERT_EQ(Stack.back(), Tok.pair()) in verifyNesting()
51 << *Stack.back() << " != " << *Tok.pair() << " = pair of " << Tok; in verifyNesting()
52 Stack.pop_back(); in verifyNesting()
55 ASSERT_THAT(Stack, testing::IsEmpty()); in verifyNesting()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/Utils/
H A DAMDGPUMemoryUtils.cpp37 SmallVector<User *> Stack{U}; in collectFunctionUses() local
39 while (!Stack.empty()) { in collectFunctionUses()
40 U = Stack.pop_back_val(); in collectFunctionUses()
51 append_range(Stack, U->users()); in collectFunctionUses()
72 SmallVector<const User *, 16> Stack(GV.users()); in shouldLowerLDSToStruct() local
76 while (!Stack.empty()) { in shouldLowerLDSToStruct()
77 const User *V = Stack.pop_back_val(); in shouldLowerLDSToStruct()
102 append_range(Stack, V->users()); in shouldLowerLDSToStruct()
/llvm-project-15.0.7/clang/lib/Sema/
H A DSemaAttr.cpp655 if (I != Stack.rend()) { in Act()
658 Stack.erase(std::prev(I.base()), Stack.end()); in Act()
669 Stack.erase(std::prev(I.base()), Stack.end()); in Act()
670 if (Stack.empty()) { in Act()
676 Stack.pop_back(); in Act()
688 Stack.pop_back(); in Act()
762 if (Action & PSK_Pop && Stack->Stack.empty()) in ActOnPragmaMSSeg()
1379 Stack->pop_back(); in PopPragmaVisibility()
1380 Back = &Stack->back(); in PopPragmaVisibility()
1389 Stack->pop_back(); in PopPragmaVisibility()
[all …]
/llvm-project-15.0.7/llvm/lib/IR/
H A DReplaceConstant.cpp110 std::vector<std::vector<ConstantExpr *>> Stack{Path}; in collectConstantExprPaths() local
111 while (!Stack.empty()) { in collectConstantExprPaths()
112 std::vector<ConstantExpr *> TPath = Stack.back(); in collectConstantExprPaths()
113 Stack.pop_back(); in collectConstantExprPaths()
125 Stack.push_back(NPath); in collectConstantExprPaths()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DAMDGPUAlwaysInlinePass.cpp58 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 DSILowerI1Copies.cpp132 SmallVector<MachineBasicBlock *, 4> Stack; member in __anone83803c50111::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 __anone83803c50111::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 …]
/llvm-project-15.0.7/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp217 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 …]
/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A D2013-04-16-AAPCS-C5-vs-VFP.ll31 double %p8, ; --> Stack
33 %struct_t* byval(%struct_t) %p10) ; --> Stack+8
56 double 23.8, ; --> Stack
57 i32 43, ; --> R0, not Stack+8
58 %struct_t* byval(%struct_t) @static_val) ; --> Stack+8, not R1
/llvm-project-15.0.7/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 __anoncdccbc530f02()
498 auto Level = ThreadStack.second.Stack.size(); in __anoncdccbc530f02()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/DirectX/DXILWriter/
H A DDXILValueEnumerator.cpp268 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 …]
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DFileSystem.h1496 if (State->Stack.top() == directory_iterator()) in State()
1507 file_type type = State->Stack.top()->type(); in increment()
1516 State->Stack.push(directory_iterator(*State->Stack.top(), ec, Follow)); in increment()
1517 if (State->Stack.top() != end_itr) { in increment()
1521 State->Stack.pop(); in increment()
1525 while (!State->Stack.empty() in increment()
1527 State->Stack.pop(); in increment()
1532 if (State->Stack.empty()) in increment()
1559 State->Stack.pop(); in pop()
1561 } while (!State->Stack.empty() in pop()
[all …]

12345678910>>...12