Home
last modified time | relevance | path

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

12345678910>>...13

/openbsd-src/gnu/llvm/llvm/lib/BinaryFormat/
H A DMsgPackDocument.cpp132 SmallVector<StackLevel, 4> Stack; in readFromBlob() local
136 Stack.push_back(StackLevel(Root, 0, (size_t)-1)); in readFromBlob()
143 if (Multi && Stack.size() == 1) { in readFromBlob()
182 if (Stack.empty()) in readFromBlob()
184 else if (Stack.back().Node.getKind() == Type::Array) { in readFromBlob()
186 auto &Array = Stack.back().Node.getArray(); in readFromBlob()
187 DestNode = &Array[Stack.back().Index++]; in readFromBlob()
189 auto &Map = Stack.back().Node.getMap(); in readFromBlob()
190 if (!Stack.back().MapEntry) { in readFromBlob()
192 Stack.back().MapKey = Node; in readFromBlob()
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.brendan/
H A Dtemplate15.C3 template<class T> class Stack {
5 Stack (int s = 10); //Comment out "= 10" and it will compile
6 ~Stack(void); //Omitting "void" doesn't help
9 template<class T> Stack<T>::~Stack(void) in ~Stack()
14 template<class T> Stack<T>::Stack(int s) in Stack() function
18 Stack<int> stk(10); in main()
/openbsd-src/gnu/llvm/llvm/lib/Target/WebAssembly/AsmParser/
H A DWebAssemblyAsmTypeCheck.cpp64 for (auto VT : Stack) { in dumpTypeStack()
87 if (Stack.empty()) { in popType()
93 auto PVT = Stack.pop_back_val(); in popType()
103 if (Stack.empty()) { in popRefType()
106 auto PVT = Stack.pop_back_val(); in popRefType()
126 if (LastSig.Returns.size() > Stack.size()) in checkEnd()
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()
216 return typeError(ErrorLoc, std::to_string(Stack.size()) + in endOfFunction()
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.jason/
H A Ddtor3.C9 template <class T> class Stack {
11 Stack() { new (Data) T(); } in Stack() function
12 ~Stack() { ((T*)Data)->~T(); } in ~Stack()
17 Stack<int> a;
18 Stack<Stack<int> > c;
H A Dtemplate26.C10 class Stack {
15 Stack(): nobjects(0) {} in Stack() function
59 find_parameter_in_stack(Stack<T1>& stack, Parameter<T2>& (T1::*access)()) in find_parameter_in_stack()
85 Stack<A> A_stack; in main()
/openbsd-src/lib/libexpat/examples/
H A Delement_declarations.c64 } Stack;
66 static Stack * in stackPushMalloc()
67 stackPushMalloc(Stack *stackTop, const XML_Content *model, unsigned level) { in stackPushMalloc()
68 Stack *const newStackTop = malloc(sizeof(Stack)); in stackPushMalloc()
78 static Stack * in stackPopFree()
79 stackPopFree(Stack *stackTop) { in stackPopFree()
80 Stack *const newStackTop = stackTop->prev; in stackPopFree()
146 Stack *stackTop = stackPushMalloc(NULL, root, 1); in dumpContentModel()
160 Stack *cons in dumpContentModel()
63 } Stack; global() typedef
[all...]
/openbsd-src/gnu/llvm/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp37 SmallVector<WorkListUnit, 20> Stack; member in __anon59a745250111::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 __anon59a745250211::BFSBlockDFSContents
97 return !Queue.empty() || !Stack.empty(); in hasWork()
104 Stack.push_back(U); in enqueue()
109 if (!Stack.empty()) { in dequeue()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DSyncDependenceAnalysis.cpp159 static void computeStackPO(BlockStack &Stack, const LoopInfo &LI, Loop *Loop, in computeStackPO() argument
162 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()
[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()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/lib/Support/
H A DJSON.cpp794 assert(Stack.back().Ctx != Object && "Only attributes allowed here"); in valueBegin()
795 if (Stack.back().HasValue) { in valueBegin()
796 assert(Stack.back().Ctx != Singleton && "Only one value allowed here"); in valueBegin()
799 if (Stack.back().Ctx == Array) in valueBegin()
802 Stack.back().HasValue = true; in valueBegin()
827 if (Stack.size() > 1 && Stack.back().Ctx == Singleton) { in flushComment()
844 Stack.emplace_back(); in arrayBegin()
845 Stack.back().Ctx = Array; in arrayBegin()
851 assert(Stack.back().Ctx == Array); in arrayEnd()
853 if (Stack.back().HasValue) in arrayEnd()
[all …]
H A DTimeProfiler.cpp106 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
/openbsd-src/gnu/llvm/clang/lib/Format/
H A DContinuationIndenter.cpp41 ArrayRef<ParenState> Stack) { in getLengthToMatchingParen() argument
84 int MatchingStackIndex = Stack.size() - 1; in getLengthToMatchingParen()
90 while (MatchingStackIndex >= 0 && Stack[MatchingStackIndex].Tok != LBrace) in getLengthToMatchingParen()
92 return MatchingStackIndex >= 0 ? &Stack[MatchingStackIndex] : nullptr; in getLengthToMatchingParen()
257 State.Stack.push_back(ParenState(/*Tok=*/nullptr, FirstIndent, FirstIndent, in getInitialState()
269 auto &CurrentState = State.Stack.back(); in getInitialState()
283 const auto &CurrentState = State.Stack.back(); in canBreak()
312 if (Previous.is(tok::l_brace) && State.Stack.size() > 1 && in canBreak()
313 State.Stack[State.Stack.size() - 2].NestedBlockInlined && in canBreak()
314 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks) { in canBreak()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Target/WebAssembly/
H A DWebAssemblyDebugFixup.cpp92 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 DWebAssemblyCFGStackify.cpp86 unsigned getBranchDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
88 unsigned getDelegateDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
91 getRethrowDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
1566 const SmallVectorImpl<EndMarkerInfo> &Stack, const MachineBasicBlock *MBB) { in getBranchDepth() argument
1568 for (auto X : reverse(Stack)) { in getBranchDepth()
1573 assert(Depth < Stack.size() && "Branch destination should be in scope"); in getBranchDepth()
1578 const SmallVectorImpl<EndMarkerInfo> &Stack, const MachineBasicBlock *MBB) { in getDelegateDepth() argument
1580 return Stack.size(); in getDelegateDepth()
1586 return getBranchDepth(Stack, MBB); in getDelegateDepth()
1603 for (auto X : reverse(Stack)) { in getDelegateDepth()
[all …]
/openbsd-src/gnu/llvm/clang/lib/Sema/
H A DSemaAttr.cpp257 if (AlignPackStack.Stack.empty()) { in ActOnPragmaOptionsAlign()
378 if (AlignPackStack.Stack.empty()) { in ActOnPragmaPack()
478 if (AlignPackStack.Stack.empty()) in DiagnoseUnterminatedPragmaAlignPack()
485 for (const auto &StackSlot : llvm::reverse(AlignPackStack.Stack)) { in DiagnoseUnterminatedPragmaAlignPack()
593 if (FpPragmaStack.Stack.empty()) { in ActOnPragmaFloatControl()
615 if (Action & PSK_Pop && VtorDispStack.Stack.empty()) in ActOnPragmaMSVtorDisp()
632 Stack.emplace_back(Slot(StackSlotLabel, CurrentValue, CurrentPragmaLocation, in Act()
637 auto I = llvm::find_if(llvm::reverse(Stack), [&](const Slot &x) { in Act()
641 if (I != Stack.rend()) { in Act()
644 Stack.erase(std::prev(I.base()), Stack.end()); in Act()
[all …]
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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.cpp133 SmallVector<MachineBasicBlock *, 4> Stack; member in __anon1ceaab0c0111::PhiIncomingAnalysis
150 assert(Stack.empty()); in analyze()
172 append_range(Stack, MBB->successors()); in analyze()
175 while (!Stack.empty()) { in analyze()
176 MachineBasicBlock *MBB = Stack.pop_back_val(); in analyze()
181 append_range(Stack, MBB->successors()); in analyze()
190 Stack.push_back(Pred); in analyze()
196 for (MachineBasicBlock *UnreachablePred : Stack) { in analyze()
201 Stack.clear(); in analyze()
260 SmallVector<MachineBasicBlock *, 4> Stack; member in __anon1ceaab0c0111::LoopFinder
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp167 UseListOrderStack &Stack) { in predictValueUseListOrderImpl() argument
217 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl()
218 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size"); in predictValueUseListOrderImpl()
220 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl()
224 OrderMap &OM, UseListOrderStack &Stack) { in predictValueUseListOrder() argument
234 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack); in predictValueUseListOrder()
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()
[all …]
/openbsd-src/gnu/usr.bin/perl/ext/File-Find/lib/File/
H A DFind.pm309 my @Stack;
355 push @Stack,[$CdLvl,$p_dir,$dir_rel,-1] if $bydepth;
400 push @Stack,[$CdLvl,$dir_name,"",-2] if $post_process;
434 my $stack_top = @Stack;
448 #push @Stack,[$CdLvl,$dir_name,$FN,$sub_nlink];
449 splice @Stack, $stack_top, 0,
467 while ( defined ($SE = pop @Stack) ) {
516 push @Stack,[$CdLvl,$p_dir,$dir_rel,-1] if $bydepth;
533 my @Stack;
574 push @Stack,[
[all...]
/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/llvm/include/llvm/Support/
H A DFileSystem.h1476 std::stack<directory_iterator, std::vector<directory_iterator>> Stack; member
1495 State->Stack.push(directory_iterator(path, ec, Follow)); in State()
1496 if (State->Stack.top() == directory_iterator()) in State()
1507 file_type type = State->Stack.top()->type(); in increment()
1510 ErrorOr<basic_file_status> status = State->Stack.top()->status(); 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()
1526 && State->Stack.top().increment(ec) == end_itr) { in increment()
[all …]
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/tools/llvm-xray/
H A Dxray-account.cpp180 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()
241 auto R = make_range(std::next(Parent).base(), ThreadStack.Stack.end()); in accountRecord()
250 ThreadStack.Stack.pop_back(); in accountRecord()
496 if (ThreadStack.second.Stack.empty()) { in __anonf550fb3a0f02()
[all …]

12345678910>>...13