Home
last modified time | relevance | path

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

12345678910>>...13

/llvm-project/llvm/lib/BinaryFormat/
H A DMsgPackDocument.cpp136 SmallVector<StackLevel, 4> Stack; in readFromBlob() local
140 Stack.push_back(StackLevel(Root, 0, (size_t)-1)); in readFromBlob()
153 if (Multi && Stack.size() == 1) { in readFromBlob()
195 if (Stack.empty()) in readFromBlob()
197 else if (Stack.back().Node.getKind() == Type::Array) { in readFromBlob()
199 auto &Array = Stack.back().Node.getArray(); in readFromBlob()
200 DestNode = &Array[Stack.back().Index++]; in readFromBlob()
202 auto &Map = Stack.back().Node.getMap(); in readFromBlob()
203 if (!Stack.back().MapEntry) { in readFromBlob()
205 Stack.back().MapKey = Node; in readFromBlob()
[all …]
/llvm-project/llvm/test/CodeGen/X86/
H A Ddeopt-bundles.ll10 ; STACKMAPS: Stack Maps: callsite 2882400015
11 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
12 ; STACKMAPS-NEXT: Stack Maps: Loc 0: Constant 0 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
13 ; STACKMAPS-NEXT: Stack Maps: Loc 1: Constant 0 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
14 ; STACKMAPS-NEXT: Stack Maps: Loc 2: Constant 1 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
15 ; STACKMAPS-NEXT: Stack Maps: Loc 3: Constant 0 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
16 ; STACKMAPS-NEXT: Stack Maps: has 0 live-out registers
17 ; STACKMAPS-NEXT: Stack Maps: callsite 4242
18 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
19 ; STACKMAPS-NEXT: Stack Maps: Loc 0: Constant 0 [encoding: .byte 4, .byte 0, .short 8, .short 0, …
[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 …]
/llvm-project/llvm/lib/Target/WebAssembly/AsmParser/
H A DWebAssemblyAsmTypeCheck.cpp61 LLVM_DEBUG({ dbgs() << Msg << getTypesString(Stack) << "\n"; }); in dumpTypeStack()
142 auto StackI = Stack.size(); in checkBr()
152 if (std::get_if<Polymorphic>(&Stack[StackI - 1])) { in checkEnd()
156 if (match(Stack[StackI - 1], Types[TypeI - 1])) { in checkEnd()
164 std::get_if<Polymorphic>(&Stack[StackI - 1])) in checkEnd()
171 // Also, if not all elements of the Stack has been matched and when
185 (int)Stack.size() - (int)Types.size()); in getSymRef()
188 getTypesString(Stack, StackStartPos)); in getSymRef()
201 auto NumPops = std::min(Stack.size() - BlockInfoStack.back().StackStartPos, in getGlobal()
204 if (std::get_if<Polymorphic>(&Stack in getGlobal()
[all...]
/llvm-project/llvm/lib/CodeGenData/
H A DOutlinedHashTree.cpp
/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp37 SmallVector<WorkListUnit, 20> Stack; member in __anon0d17b1c10111::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 __anon0d17b1c10211::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/llvm/lib/Support/
H A DJSON.cpp792 assert(Stack.back().Ctx != Object && "Only attributes allowed here"); in valueBegin()
793 if (Stack.back().HasValue) { in valueBegin()
794 assert(Stack.back().Ctx != Singleton && "Only one value allowed here"); in valueBegin()
797 if (Stack.back().Ctx == Array) in valueBegin()
800 Stack.back().HasValue = true; in valueBegin()
825 if (Stack.size() > 1 && Stack.back().Ctx == Singleton) { in flushComment()
842 Stack.emplace_back(); in arrayBegin()
843 Stack.back().Ctx = Array; in arrayBegin()
849 assert(Stack.back().Ctx == Array); in arrayEnd()
851 if (Stack.back().HasValue) in arrayEnd()
[all …]
H A DTimeProfiler.cpp142 Stack.emplace_back(std::make_unique<InProgressEntry>( in end()
145 return &Stack.back()->Event; in end()
153 Stack.emplace_back(std::make_unique<InProgressEntry>(
156 return &Stack.back()->Event; in write()
160 if (Stack.empty()) in write()
163 Stack.back()->InstantEvents.emplace_back(TimeTraceProfilerEntry( in write()
169 assert(!Stack.empty() && "Must call begin() first"); in write()
170 end(Stack.back()->Event); in write()
174 assert(!Stack.empty() && "Must call begin() first"); in write()
181 llvm::find_if(Stack, [ in write()
296 SmallVector<std::unique_ptr<TimeTraceProfilerEntry>, 16> Stack; global() member
[all...]
/llvm-project/clang-tools-extra/pseudo/lib/
H A DBracket.cpp
/llvm-project/clang/lib/Format/
H A DContinuationIndenter.cpp50 ArrayRef<ParenState> Stack) { in getLengthToMatchingParen() argument
93 int MatchingStackIndex = Stack.size() - 1; in getLengthToMatchingParen()
99 while (MatchingStackIndex >= 0 && Stack[MatchingStackIndex].Tok != LBrace) in getLengthToMatchingParen()
101 return MatchingStackIndex >= 0 ? &Stack[MatchingStackIndex] : nullptr; in getLengthToMatchingParen()
274 State.Stack.push_back(ParenState(/*Tok=*/nullptr, FirstIndent, FirstIndent, in getInitialState()
287 auto &CurrentState = State.Stack.back(); in getInitialState()
301 const auto &CurrentState = State.Stack.back(); in canBreak()
330 if (Previous.is(tok::l_brace) && State.Stack.size() > 1 && in canBreak()
331 State.Stack[State.Stack in canBreak()
[all...]
/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_symbolizer.h68 SymbolizedStack *Stack; variable
71 if (Stack) in clear()
72 Stack->ClearAll(); in clear()
76 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr)
77 : Stack(Stack) {} in Stack() argument
80 if (Stack != S)
82 Stack = S;
84 const SymbolizedStack *get() const { return Stack; } in get()
/llvm-project/clang-tools-extra/clang-tidy/utils/
H A DDeclRefExprUtils.cpp187 llvm::SmallVector<StackEntry, 4> Stack; in AST_MATCHER_P() local
188 Stack.emplace_back(&Node, Indirections); in AST_MATCHER_P()
191 while (!Stack.empty()) { in AST_MATCHER_P()
192 const StackEntry Entry = Stack.back(); in AST_MATCHER_P()
193 Stack.pop_back(); in AST_MATCHER_P()
231 Stack.emplace_back(P, Entry.Indirections); in AST_MATCHER_P()
246 Stack.emplace_back(Cast, Entry.Indirections); in AST_MATCHER_P()
256 Stack.emplace_back(Cast, Entry.Indirections); in AST_MATCHER_P()
280 Stack.emplace_back( in AST_MATCHER_P()
289 Stack.emplace_back(Member, 0); in AST_MATCHER_P()
[all …]
/llvm-project/clang-tools-extra/pseudo/unittests/
H A DBracketTest.cpp
/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyDebugFixup.cpp89 std::vector<StackElem> Stack; in runOnMachineFunction()
104 for (auto &Elem : reverse(Stack)) { in runOnMachineFunction()
106 auto Depth = static_cast<unsigned>(&Elem - &Stack[0]); in runOnMachineFunction()
108 << " -> Stack Relative " << Depth << "\n"); in runOnMachineFunction()
125 auto Prev = Stack.back(); in runOnMachineFunction()
126 Stack.pop_back(); in runOnMachineFunction()
146 Stack.push_back({MO.getReg(), nullptr}); in runOnMachineFunction()
151 assert(Stack.empty() && in runOnMachineFunction()
152 "WebAssemblyDebugFixup: Stack not empty at end of basic block!"); in runOnMachineFunction()
92 std::vector<StackElem> Stack; runOnMachineFunction() local
H A DWebAssemblyCFGStackify.cpp98 unsigned getBranchDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
100 unsigned getDelegateDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
102 unsigned getRethrowDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
2488 const SmallVectorImpl<EndMarkerInfo> &Stack, const MachineBasicBlock *MBB) {
2490 for (auto X : reverse(Stack)) {
2495 assert(Depth < Stack.size() && "Branch destination should be in scope");
2500 const SmallVectorImpl<EndMarkerInfo> &Stack, const MachineBasicBlock *MBB) {
2502 return Stack.size();
2508 return getBranchDepth(Stack, MBB);
2511 // corresponding try's end_try BB because Stack contain
1567 getBranchDepth(const SmallVectorImpl<EndMarkerInfo> & Stack,const MachineBasicBlock * MBB) getBranchDepth() argument
1579 getDelegateDepth(const SmallVectorImpl<EndMarkerInfo> & Stack,const MachineBasicBlock * MBB) getDelegateDepth() argument
1614 getRethrowDepth(const SmallVectorImpl<EndMarkerInfo> & Stack,const SmallVectorImpl<const MachineBasicBlock * > & EHPadStack) getRethrowDepth() argument
1653 SmallVector<EndMarkerInfo, 8> Stack; rewriteDepthImmediates() local
[all...]
/llvm-project/llvm/lib/Analysis/
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/clang/lib/Sema/
H A DSemaAttr.cpp366 if (AlignPackStack.Stack.empty()) { in ActOnPragmaPack()
487 if (AlignPackStack.Stack.empty()) { in DiagnoseUnterminatedPragmaAlignPack()
587 if (AlignPackStack.Stack.empty()) in ActOnPragmaFloatControl()
594 for (const auto &StackSlot : llvm::reverse(AlignPackStack.Stack)) { in ActOnPragmaFloatControl()
702 if (FpPragmaStack.Stack.empty()) { in UnifySection()
724 if (Action & PSK_Pop && VtorDispStack.Stack.empty()) in UnifySection()
741 Stack.emplace_back(Slot(StackSlotLabel, CurrentValue, CurrentPragmaLocation, in UnifySection()
746 auto I = llvm::find_if(llvm::reverse(Stack), [&](const Slot &x) {
750 if (I != Stack.rend()) { in ActOnPragmaMSSeg()
753 Stack in ActOnPragmaMSSeg()
752 PragmaStack<StringLiteral *> *Stack = ActOnPragmaMSSeg() local
1223 VisStack *Stack = static_cast<VisStack*>(VisContext); AddPushedVisibilityAttribute() local
1244 VisStack *Stack = static_cast<VisStack*>(S.VisContext); PushPragmaVisibility() local
1379 VisStack *Stack = static_cast<VisStack*>(VisContext); PopPragmaVisibility() local
[all...]
/llvm-project/llvm/lib/IR/
H A DReplaceConstant.cpp57 SmallVector<Constant *> Stack; in convertUsersOfConstantsToInstructions() local
61 Stack.push_back(C); in convertUsersOfConstantsToInstructions()
65 Stack.push_back(cast<Constant>(U)); in convertUsersOfConstantsToInstructions()
71 while (!Stack.empty()) { in convertUsersOfConstantsToInstructions()
72 Constant *C = Stack.pop_back_val(); in convertUsersOfConstantsToInstructions()
78 Stack.push_back(cast<Constant>(Nested)); in convertUsersOfConstantsToInstructions()
/llvm-project/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp175 UseListOrderStack &Stack) { in predictValueUseListOrderImpl() argument
225 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl()
226 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size"); in predictValueUseListOrderImpl()
228 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl()
232 OrderMap &OM, UseListOrderStack &Stack) { in predictValueUseListOrder() argument
242 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack); in predictValueUseListOrder()
249 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder()
253 Stack); in predictValueUseListOrder()
266 UseListOrderStack Stack; in predictUseListOrder() local
274 predictValueUseListOrder(VAM->getValue(), &F, OM, Stack); in predictUseListOrder()
[all …]
/llvm-project/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.cpp114 SmallVector<MachineBasicBlock *, 4> Stack;
130 assert(Stack.empty());
153 append_range(Stack, MBB->successors()); in analyze()
156 while (!Stack.empty()) { in analyze()
157 MachineBasicBlock *MBB = Stack.pop_back_val(); in analyze()
162 append_range(Stack, MBB->successors()); in analyze()
171 Stack.push_back(Pred); in analyze()
177 for (MachineBasicBlock *UnreachablePred : Stack) { in analyze()
182 Stack.clear(); in analyze()
241 SmallVector<MachineBasicBlock *, 4> Stack;
135 SmallVector<MachineBasicBlock *, 4> Stack; global() member in __anond05b17a80111::PhiIncomingAnalysis
262 SmallVector<MachineBasicBlock *, 4> Stack; global() member in __anond05b17a80111::LoopFinder
[all...]
/llvm-project/llvm/lib/Target/DirectX/DXILWriter/
H A DDXILValueEnumerator.cpp206 UseListOrderStack &Stack) { in predictValueUseListOrderImpl() argument
268 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl()
269 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size"); in predictValueUseListOrderImpl()
271 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl()
275 OrderMap &OM, UseListOrderStack &Stack) { in predictValueUseListOrder() argument
285 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack); in predictValueUseListOrder()
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()
[all …]
/llvm-project/llvm/test/CodeGen/ARM/
H A D2013-04-16-AAPCS-C5-vs-VFP.ll31 double %p8, ; --> Stack
33 ptr byval(%struct_t) %p10) ; --> Stack+8
56 double 23.8, ; --> Stack
57 i32 43, ; --> R0, not Stack+8
58 ptr byval(%struct_t) @static_val) ; --> Stack+8, not R1
/llvm-project/llvm/include/llvm/Support/
H A DFileSystem.h1469 std::vector<directory_iterator> Stack;
1488 State->Stack.push_back(directory_iterator(path, ec, Follow));
1489 if (State->Stack.back() == directory_iterator())
1500 file_type type = State->Stack.back()->type(); in increment()
1503 ErrorOr<basic_file_status> status = State->Stack.back()->status(); in increment()
1509 State->Stack.push_back( in increment()
1510 directory_iterator(*State->Stack.back(), ec, Follow)); in increment()
1511 if (State->Stack.back() != end_itr) { in increment()
1515 State->Stack.pop_back(); in increment()
1519 while (!State->Stack in increment()
1473 std::vector<directory_iterator> Stack; global() member
[all...]
/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp90 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()

12345678910>>...13