Home
last modified time | relevance | path

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

12345678

/freebsd/contrib/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 in readFromBlob()
258 SmallVector<WriterStackLevel, 4> Stack; writeToBlob() local
[all...]
/freebsd/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/contrib/llvm-project/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()
144 if (Expected.size() > Stack.size()) in checkBr()
146 auto IsStackTopInvalid = checkStackTop(Expected, Stack); in checkBr()
155 if (LastSig.Returns.size() > Stack.size()) in checkEnd()
166 auto IsStackTopInvalid = checkStackTop(LastSig.Returns, Stack); in checkEnd()
177 Stack.insert(Stack.end(), Sig.Returns.begin(), Sig.Returns.end()); in checkSig()
[all …]
/freebsd/contrib/expat/examples/
H A Delement_declarations.c63 } 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/CodeGenData/
H A DOutlinedHashTree.cpp24 SmallVector<const HashNode *> Stack; in walkGraph() local
25 Stack.emplace_back(getRoot()); in walkGraph()
27 while (!Stack.empty()) { in walkGraph()
28 const auto *Current = Stack.pop_back_val(); in walkGraph()
35 Stack.emplace_back(Next); in walkGraph()
93 SmallVector<std::pair<HashNode *, const HashNode *>> Stack; in merge() local
94 Stack.emplace_back(Dst, Src); in merge()
96 while (!Stack.empty()) { in merge()
97 auto [DstNode, SrcNode] = Stack.pop_back_val(); in merge()
114 Stack.emplace_back(NextDstNode, NextSrcNode.get()); in merge()
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp37 SmallVector<WorkListUnit, 20> Stack; member in __anond1e6f8ae0111::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 __anond1e6f8ae0211::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/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.cpp120 Stack.emplace_back(std::make_unique<TimeTraceProfilerEntry>( in begin()
123 return Stack.back().get(); in begin()
129 Stack.emplace_back(std::make_unique<TimeTraceProfilerEntry>( in begin()
132 return Stack.back().get(); in begin()
136 assert(!Stack.empty() && "Must call begin() first"); in end()
137 end(*Stack.back()); in end()
141 assert(!Stack.empty() && "Must call begin() first"); in end()
156 if (llvm::none_of(llvm::drop_begin(llvm::reverse(Stack)), in end()
165 llvm::erase_if(Stack, in end()
177 assert(Stack.empty() && in write()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/ubsan/
H A Dubsan_diag.h52 Location(const SymbolizedStackHolder &Stack) :
53 Kind(LK_Symbolized), SymbolizedLoc(Stack.get()) {}
22 SymbolizedStack *Stack; global() variable
31 Stack(Stack) Stack() argument
72 Location(const SymbolizedStackHolder & Stack) Location() argument
/freebsd/contrib/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()
266 State.Stack.push_back(ParenState(/*Tok=*/nullptr, FirstIndent, FirstIndent, in getInitialState()
279 auto &CurrentState = State.Stack.back(); in getInitialState()
293 const auto &CurrentState = State.Stack.back(); in canBreak()
322 if (Previous.is(tok::l_brace) && State.Stack.size() > 1 && in canBreak()
323 State.Stack[State.Stack.size() - 2].NestedBlockInlined && in canBreak()
324 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks && in canBreak()
[all …]
/freebsd/contrib/llvm-project/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()
111 << " -> Stack Relative " << Depth << "\n"); 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()
155 "WebAssemblyDebugFixup: Stack not empty at end of basic block!"); in runOnMachineFunction()
H A DWebAssemblyCFGStackify.cpp86 unsigned getBranchDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
88 unsigned getDelegateDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
90 unsigned 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 …]
/freebsd/contrib/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()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaAttr.cpp268 if (AlignPackStack.Stack.empty()) { in ActOnPragmaOptionsAlign()
389 if (AlignPackStack.Stack.empty()) { in ActOnPragmaPack()
489 if (AlignPackStack.Stack.empty()) in DiagnoseUnterminatedPragmaAlignPack()
496 for (const auto &StackSlot : llvm::reverse(AlignPackStack.Stack)) { in DiagnoseUnterminatedPragmaAlignPack()
604 if (FpPragmaStack.Stack.empty()) { in ActOnPragmaFloatControl()
626 if (Action & PSK_Pop && VtorDispStack.Stack.empty()) in ActOnPragmaMSVtorDisp()
643 Stack.emplace_back(Slot(StackSlotLabel, CurrentValue, CurrentPragmaLocation, in Act()
648 auto I = llvm::find_if(llvm::reverse(Stack), [&](const Slot &x) { in Act()
652 if (I != Stack.rend()) { in Act()
655 Stack.erase(std::prev(I.base()), Stack.end()); in Act()
[all …]
/freebsd/contrib/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()
/freebsd/contrib/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 …]
/freebsd/contrib/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.cpp135 SmallVector<MachineBasicBlock *, 4> Stack; member in __anon952a5e950111::PhiIncomingAnalysis
151 assert(Stack.empty()); in analyze()
174 append_range(Stack, MBB->successors()); in analyze()
177 while (!Stack.empty()) { in analyze()
178 MachineBasicBlock *MBB = Stack.pop_back_val(); in analyze()
183 append_range(Stack, MBB->successors()); in analyze()
192 Stack.push_back(Pred); in analyze()
198 for (MachineBasicBlock *UnreachablePred : Stack) { in analyze()
203 Stack.clear(); in analyze()
262 SmallVector<MachineBasicBlock *, 4> Stack; member in __anon952a5e950111::LoopFinder
[all …]
H A DSIAnnotateControlFlow.cpp59 StackVector Stack; member in __anon9f980a420111::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::pair(BB, Saved)); in push()
311 assert(Stack.back().first == BB); in closeControlFlow()
396 if (!Stack.empty()) { in runOnFunction()
/freebsd/contrib/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 …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DFileSystem.h1473 std::vector<directory_iterator> Stack; member
1492 State->Stack.push_back(directory_iterator(path, ec, Follow)); in State()
1493 if (State->Stack.back() == directory_iterator()) in State()
1504 file_type type = State->Stack.back()->type(); in increment()
1507 ErrorOr<basic_file_status> status = State->Stack.back()->status(); in increment()
1513 State->Stack.push_back( in increment()
1514 directory_iterator(*State->Stack.back(), ec, Follow)); in increment()
1515 if (State->Stack.back() != end_itr) { in increment()
1519 State->Stack.pop_back(); in increment()
1523 while (!State->Stack.empty() in increment()
[all …]
/freebsd/contrib/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()
110 // Worklist and the Stack, and add it to the instruction info map. in buildTruncExpressionGraph()
112 Stack.pop_back(); in buildTruncExpressionGraph()
124 Stack.push_back(I); in buildTruncExpressionGraph()
158 // Add only operands not in Stack to prevent cycle in buildTruncExpressionGraph()
160 if (!llvm::is_contained(Stack, Op)) in buildTruncExpressionGraph()
177 SmallVector<Instruction *, 8> Stack; in getMinBitWidth() local
207 if (!Stack in getMinBitWidth()
[all...]
/freebsd/contrib/llvm-project/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 __anon895715230f02()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFExpression.cpp444 SmallVector<PrintedExpr, 4> Stack; in printCompactDWARFExpr() local
457 raw_svector_ostream S(Stack.emplace_back(PrintedExpr::Value).String); in printCompactDWARFExpr()
467 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
480 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
490 assert(!Stack.empty()); in printCompactDWARFExpr()
491 Stack.back().Kind = PrintedExpr::Value; in printCompactDWARFExpr()
509 raw_svector_ostream S(Stack.emplace_back(PrintedExpr::Value).String); in printCompactDWARFExpr()
518 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
534 if (Stack.size() != 1) { in printCompactDWARFExpr()
535 OS << "<stack of size " << Stack.size() << ", expected 1>"; in printCompactDWARFExpr()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericUniformityImpl.h134 void computeStackPO(SmallVectorImpl<const BlockT *> &Stack,
1253 SmallVectorImpl<const BlockT *> &Stack, const CycleInfoT &CI, in computeStackPO() argument
1256 while (!Stack.empty()) { in computeStackPO()
1257 auto *NextBB = Stack.back(); in computeStackPO()
1259 Stack.pop_back(); in computeStackPO()
1281 Stack.push_back(NestedExitBB); in computeStackPO()
1287 Stack.pop_back(); in computeStackPO()
1304 Stack.push_back(SuccBB); in computeStackPO()
1312 Stack.pop_back(); in computeStackPO()
1325 SmallVector<const BlockT *> Stack; in computeCyclePO() local
[all …]

12345678