| /freebsd/contrib/llvm-project/llvm/lib/BinaryFormat/ |
| H A D | MsgPackDocument.cpp | 136 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 D | googletest-output-test-golden-lin.txt | 7 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/expat/examples/ |
| H A D | element_declarations.c | 65 } Stack; typedef
67 static Stack *
68 stackPushMalloc(Stack *stackTop, const XML_Content *model, unsigned level) { in stackPushMalloc()
69 Stack *const newStackTop = malloc(sizeof(Stack)); in stackPushMalloc()
79 static Stack *
80 stackPopFree(Stack *stackTop) { in stackPopFree()
81 Stack *const newStackTop = stackTop->prev; in stackPopFree()
147 Stack *stackTop = stackPushMalloc(NULL, root, 1); in dumpContentModel()
161 Stack *const newStackTop in dumpContentModel()
|
| /freebsd/contrib/llvm-project/llvm/lib/CGData/ |
| H A D | OutlinedHashTree.cpp | 24 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()
113 Stack.emplace_back(NextDstNode, NextSrcNode.get()); in merge()
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 37 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 D | JSON.cpp | 794 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 D | TimeProfiler.cpp | 142 Stack.emplace_back(std::make_unique<InProgressEntry>( in begin()
145 return &Stack.back()->Event; in begin()
153 Stack.emplace_back(std::make_unique<InProgressEntry>( in begin()
156 return &Stack.back()->Event; in begin()
160 if (Stack.empty()) in insert()
163 Stack.back()->InstantEvents.emplace_back(TimeTraceProfilerEntry( in insert()
169 assert(!Stack.empty() && "Must call begin() first"); in end()
170 end(Stack.back()->Event); in end()
174 assert(!Stack.empty() && "Must call begin() first"); in end()
181 llvm::find_if(Stack, [&](const std::unique_ptr<InProgressEntry> &Val) { in end()
[all …]
|
| H A D | ProgramStack.cpp | 60 void runOnNewStackImpl(void *Stack, void (*Fn)(void *), void *Ctx) __asm__(
114 void *Stack = malloc(StackSize); in runOnNewStack() local
115 void *BottomOfStack = (char *)Stack + StackSize; in runOnNewStack()
119 free(Stack); in runOnNewStack()
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/ubsan/ |
| H A D | ubsan_diag.h | 52 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/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_symbolizer.h | 68 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()
|
| /freebsd/contrib/llvm-project/clang/lib/Format/ |
| H A D | ContinuationIndenter.cpp | 50 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.size() - 2].NestedBlockInlined && in canBreak()
332 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks) { in canBreak()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyDebugFixup.cpp | 89 std::vector<StackElem> Stack; in runOnMachineFunction() local
104 for (auto &Elem : reverse(Stack)) { in runOnMachineFunction()
106 auto Depth = static_cast<unsigned>(&Elem - &Stack[0]); 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()
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFExpressionPrinter.cpp | 168 SmallVector<PrintedExpr, 4> Stack; in printCompactDWARFExpr() local
181 raw_svector_ostream S(Stack.emplace_back(PrintedExpr::Value).String); in printCompactDWARFExpr()
191 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
204 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
214 assert(!Stack.empty()); in printCompactDWARFExpr()
215 Stack.back().Kind = PrintedExpr::Value; in printCompactDWARFExpr()
233 raw_svector_ostream S(Stack.emplace_back(PrintedExpr::Value).String); in printCompactDWARFExpr()
242 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
258 if (Stack.size() != 1) { in printCompactDWARFExpr()
259 OS << "<stack of size " << Stack.size() << ", expected 1>"; in printCompactDWARFExpr()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | PhiValues.cpp | 50 SmallVectorImpl<const PHINode *> &Stack) { in processPhi() argument
64 processPhi(PhiPhiOp, Stack); in processPhi()
80 Stack.push_back(Phi); in processPhi()
90 const PHINode *ComponentPhi = Stack.pop_back_val(); in processPhi()
109 if (Stack.empty()) in processPhi()
112 unsigned int &ComponentDepthNumber = DepthMap[Stack.back()]; in processPhi()
130 SmallVector<const PHINode *, 8> Stack; in getValuesForPhi() local
131 processPhi(PN, Stack); in getValuesForPhi()
133 assert(Stack.empty()); in getValuesForPhi()
|
| /freebsd/contrib/llvm-project/clang/lib/Sema/ |
| H A D | SemaAttr.cpp | 371 if (AlignPackStack.Stack.empty()) { in ActOnPragmaOptionsAlign()
491 if (AlignPackStack.Stack.empty()) { in ActOnPragmaPack()
590 if (AlignPackStack.Stack.empty()) in DiagnoseUnterminatedPragmaAlignPack()
597 for (const auto &StackSlot : llvm::reverse(AlignPackStack.Stack)) { in DiagnoseUnterminatedPragmaAlignPack()
705 if (FpPragmaStack.Stack.empty()) { in ActOnPragmaFloatControl()
727 if (Action & PSK_Pop && VtorDispStack.Stack.empty()) in ActOnPragmaMSVtorDisp()
744 Stack.emplace_back(Slot(StackSlotLabel, CurrentValue, CurrentPragmaLocation, in Act()
749 auto I = llvm::find_if(llvm::reverse(Stack), [&](const Slot &x) { in Act()
753 if (I != Stack.rend()) { in Act()
756 Stack.erase(std::prev(I.base()), Stack.end()); in Act()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | ReplaceConstant.cpp | 57 SmallVector<Constant *> Stack; in convertUsersOfConstantsToInstructions() local
64 Stack.push_back(C); in convertUsersOfConstantsToInstructions()
68 Stack.push_back(cast<Constant>(U)); in convertUsersOfConstantsToInstructions()
74 while (!Stack.empty()) { in convertUsersOfConstantsToInstructions()
75 Constant *C = Stack.pop_back_val(); in convertUsersOfConstantsToInstructions()
81 Stack.push_back(cast<Constant>(Nested)); in convertUsersOfConstantsToInstructions()
|
| /freebsd/contrib/llvm-project/llvm/lib/Bitcode/Writer/ |
| H A D | ValueEnumerator.cpp | 175 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
245 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack); in predictValueUseListOrder()
252 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder()
256 Stack); in predictValueUseListOrder()
269 UseListOrderStack Stack; in predictUseListOrder() local
277 predictValueUseListOrder(VAM->getValue(), &F, OM, Stack); in predictUseListOrder()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUAlwaysInlinePass.cpp | 58 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 D | SILowerI1Copies.cpp | 113 SmallVector<MachineBasicBlock *, 4> Stack; member in __anon952a5e950111::PhiIncomingAnalysis
129 assert(Stack.empty()); in analyze()
149 append_range(Stack, MBB->successors()); in analyze()
152 while (!Stack.empty()) { in analyze()
153 MachineBasicBlock *MBB = Stack.pop_back_val(); in analyze()
155 append_range(Stack, MBB->successors()); in analyze()
164 Stack.push_back(Pred); in analyze()
170 for (MachineBasicBlock *UnreachablePred : Stack) { in analyze()
175 Stack.clear(); in analyze()
234 SmallVector<MachineBasicBlock *, 4> Stack; member in __anon952a5e950111::LoopFinder
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/DXILWriter/ |
| H A D | DXILValueEnumerator.cpp | 206 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/lib/Transforms/AggressiveInstCombine/ |
| H A D | TruncInstCombine.cpp | 89 SmallVector<Instruction *, 8> Stack; in buildTruncExpressionGraph() local
107 if (!Stack.empty() && Stack.back() == I) { in buildTruncExpressionGraph()
111 Stack.pop_back(); in buildTruncExpressionGraph()
123 Stack.push_back(I); in buildTruncExpressionGraph()
159 if (!llvm::is_contained(Stack, Op)) in buildTruncExpressionGraph()
176 SmallVector<Instruction *, 8> Stack; in getMinBitWidth() local
206 if (!Stack.empty() && Stack.back() == I) { in getMinBitWidth()
210 Stack.pop_back(); in getMinBitWidth()
219 Stack.push_back(I); in getMinBitWidth()
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-xray/ |
| H A D | xray-account.cpp | 180 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/include/llvm/Support/ |
| H A D | FileSystem.h | 1487 std::vector<directory_iterator> Stack; member
1506 State->Stack.push_back(directory_iterator(path, ec, Follow)); in State()
1507 if (State->Stack.back() == directory_iterator()) in State()
1518 file_type type = State->Stack.back()->type(); in increment()
1521 ErrorOr<basic_file_status> status = State->Stack.back()->status(); in increment()
1527 State->Stack.push_back( in increment()
1528 directory_iterator(*State->Stack.back(), ec, Follow)); in increment()
1529 if (State->Stack.back() != end_itr) { in increment()
1533 State->Stack.pop_back(); in increment()
1537 while (!State->Stack.empty() in increment()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/AsmParser/ |
| H A D | WebAssemblyAsmTypeCheck.cpp | 62 LLVM_DEBUG({ dbgs() << Msg << getTypesString(Stack) << "\n"; }); in dumpTypeStack()
143 auto StackI = Stack.size(); in checkTypes()
153 if (std::get_if<Polymorphic>(&Stack[StackI - 1])) { in checkTypes()
157 if (match(Stack[StackI - 1], Types[TypeI - 1])) { in checkTypes()
165 std::get_if<Polymorphic>(&Stack[StackI - 1])) in checkTypes()
186 (int)Stack.size() - (int)Types.size()); in checkTypes()
189 getTypesString(Stack, StackStartPos)); in checkTypes()
202 auto NumPops = std::min(Stack.size() - BlockInfoStack.back().StackStartPos, in popTypes()
205 if (std::get_if<Polymorphic>(&Stack.back())) in popTypes()
207 Stack.pop_back(); in popTypes()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | GenericUniformityImpl.h | 137 void computeStackPO(SmallVectorImpl<const BlockT *> &Stack,
1300 SmallVectorImpl<const BlockT *> &Stack, const CycleInfoT &CI, in computeStackPO() argument
1303 while (!Stack.empty()) { in computeStackPO()
1304 auto *NextBB = Stack.back(); in computeStackPO()
1306 Stack.pop_back(); in computeStackPO()
1328 Stack.push_back(NestedExitBB); in computeStackPO()
1334 Stack.pop_back(); in computeStackPO()
1351 Stack.push_back(SuccBB); in computeStackPO()
1359 Stack.pop_back(); in computeStackPO()
1372 SmallVector<const BlockT *> Stack; in computeCyclePO() local
[all …]
|