| /netbsd-src/external/apache2/llvm/dist/llvm/lib/BinaryFormat/ |
| H A D | MsgPackDocument.cpp | 132 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 …]
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Format/ |
| H A D | ContinuationIndenter.cpp | 38 const std::vector<ParenState> &Stack) { in getLengthToMatchingParen() argument
81 int MatchingStackIndex = Stack.size() - 1; in getLengthToMatchingParen()
87 while (MatchingStackIndex >= 0 && Stack[MatchingStackIndex].Tok != LBrace) in getLengthToMatchingParen()
89 return MatchingStackIndex >= 0 ? &Stack[MatchingStackIndex] : nullptr; in getLengthToMatchingParen()
254 State.Stack.push_back(ParenState(/*Tok=*/nullptr, FirstIndent, FirstIndent, in getInitialState()
267 State.Stack.back().AvoidBinPacking = true; in getInitialState()
268 State.Stack.back().BreakBeforeParameter = true; in getInitialState()
269 State.Stack.back().AlignColons = false; in getInitialState()
281 if (!Current.CanBreakBefore && !(State.Stack.back().BreakBeforeClosingBrace && in canBreak()
300 if (Current.isMemberAccess() && State.Stack.back().ContainsUnwrappedBuilder) in canBreak()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/ |
| H A D | JSON.cpp | 775 assert(Stack.back().Ctx != Object && "Only attributes allowed here"); in valueBegin()
776 if (Stack.back().HasValue) { in valueBegin()
777 assert(Stack.back().Ctx != Singleton && "Only one value allowed here"); in valueBegin()
780 if (Stack.back().Ctx == Array) in valueBegin()
783 Stack.back().HasValue = true; in valueBegin()
808 if (Stack.size() > 1 && Stack.back().Ctx == Singleton) { in flushComment()
825 Stack.emplace_back(); in arrayBegin()
826 Stack.back().Ctx = Array; in arrayBegin()
832 assert(Stack.back().Ctx == Array); in arrayEnd()
834 if (Stack.back().HasValue) in arrayEnd()
[all …]
|
| H A D | TimeProfiler.cpp | 85 Stack.emplace_back(steady_clock::now(), TimePointType(), std::move(Name), in begin()
90 assert(!Stack.empty() && "Must call begin() first"); in end()
91 Entry &E = Stack.back(); in end()
113 if (std::find_if(++Stack.rbegin(), Stack.rend(), [&](const Entry &Val) { in end()
115 }) == Stack.rend()) { in end()
121 Stack.pop_back(); in end()
129 assert(Stack.empty() && in write()
132 [](const auto &TTP) { return TTP->Stack.empty(); }) && in write()
249 SmallVector<Entry, 16> Stack; member
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 37 SmallVector<WorkListUnit, 20> Stack; member in __anon126612d90111::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 __anon126612d90211::BFSBlockDFSContents
97 return !Queue.empty() || !Stack.empty(); in hasWork()
104 Stack.push_back(U); in enqueue()
109 if (!Stack.empty()) { in dequeue()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | SyncDependenceAnalysis.cpp | 142 static void computeStackPO(BlockStack &Stack, const LoopInfo &LI, Loop *Loop, in computeStackPO() argument
145 while (!Stack.empty()) { in computeStackPO()
146 const auto *NextBB = Stack.back(); in computeStackPO()
164 Stack.push_back(NestedExitBB); in computeStackPO()
168 Stack.pop_back(); in computeStackPO()
184 Stack.push_back(SuccBB); in computeStackPO()
188 Stack.pop_back(); in computeStackPO()
198 BlockStack Stack; in computeTopLevelPO() local
199 Stack.reserve(24); // FIXME made-up number in computeTopLevelPO()
200 Stack.push_back(&F.getEntryBlock()); in computeTopLevelPO()
[all …]
|
| H A D | PhiValues.cpp | 50 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()
|
| /netbsd-src/external/gpl3/gcc/dist/libsanitizer/ubsan/ |
| H A D | ubsan_diag.h | 22 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()
|
| /netbsd-src/sys/external/bsd/compiler_rt/dist/lib/ubsan/ |
| H A D | ubsan_diag.h | 23 SymbolizedStack *Stack; variable
26 if (Stack) in clear()
27 Stack->ClearAll(); in clear()
31 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr)
32 : Stack(Stack) {} in Stack() function
35 if (Stack != S) in reset()
37 Stack = S; in reset()
39 const SymbolizedStack *get() const { return Stack; } in get()
73 Location(const SymbolizedStackHolder &Stack) : in Location() argument
74 Kind(LK_Symbolized), SymbolizedLoc(Stack.get()) {} in Location()
|
| /netbsd-src/external/gpl3/gcc.old/dist/libsanitizer/ubsan/ |
| H A D | ubsan_diag.h | 21 SymbolizedStack *Stack; variable
24 if (Stack) in clear()
25 Stack->ClearAll(); in clear()
29 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr)
30 : Stack(Stack) {} in Stack() argument
33 if (Stack != S) in reset()
35 Stack = S; in reset()
37 const SymbolizedStack *get() const { return Stack; } in get()
71 Location(const SymbolizedStackHolder &Stack) : in Location() argument
72 Kind(LK_Symbolized), SymbolizedLoc(Stack.get()) {} in Location()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Sema/ |
| H A D | SemaAttr.cpp | 254 if (AlignPackStack.Stack.empty()) { in ActOnPragmaOptionsAlign()
375 if (AlignPackStack.Stack.empty()) { in ActOnPragmaPack()
427 if (AlignPackStack.Stack.empty()) in DiagnoseUnterminatedPragmaAlignPack()
434 for (const auto &StackSlot : llvm::reverse(AlignPackStack.Stack)) { in DiagnoseUnterminatedPragmaAlignPack()
514 if (FpPragmaStack.Stack.empty()) { in ActOnPragmaFloatControl()
536 if (Action & PSK_Pop && VtorDispStack.Stack.empty()) in ActOnPragmaMSVtorDisp()
553 Stack.emplace_back(Slot(StackSlotLabel, CurrentValue, CurrentPragmaLocation, in Act()
558 auto I = llvm::find_if(llvm::reverse(Stack), [&](const Slot &x) { in Act()
562 if (I != Stack.rend()) { in Act()
565 Stack.erase(std::prev(I.base()), Stack.end()); in Act()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyDebugFixup.cpp | 74 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 D | WebAssemblyCFGStackify.cpp | 86 unsigned getBranchDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
88 unsigned getDelegateDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
91 getRethrowDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
1585 const SmallVectorImpl<EndMarkerInfo> &Stack, const MachineBasicBlock *MBB) { in getBranchDepth() argument
1587 for (auto X : reverse(Stack)) { in getBranchDepth()
1592 assert(Depth < Stack.size() && "Branch destination should be in scope"); in getBranchDepth()
1597 const SmallVectorImpl<EndMarkerInfo> &Stack, const MachineBasicBlock *MBB) { in getDelegateDepth() argument
1599 return Stack.size(); in getDelegateDepth()
1605 return getBranchDepth(Stack, MBB); in getDelegateDepth()
1622 for (auto X : reverse(Stack)) { in getDelegateDepth()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| H A D | TruncInstCombine.cpp | 78 SmallVector<Instruction *, 8> Stack; in buildTruncExpressionDag() local
96 if (!Stack.empty() && Stack.back() == I) { in buildTruncExpressionDag()
100 Stack.pop_back(); in buildTruncExpressionDag()
112 Stack.push_back(I); in buildTruncExpressionDag()
151 SmallVector<Instruction *, 8> Stack; in getMinBitWidth() local
181 if (!Stack.empty() && Stack.back() == I) { in getMinBitWidth()
185 Stack.pop_back(); in getMinBitWidth()
194 Stack.push_back(I); in getMinBitWidth()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/Utils/ |
| H A D | AMDGPULDSUtils.cpp | 39 SmallVector<User *, 16> Stack; in userRequiresLowering() local
40 Stack.push_back(InitialUser); in userRequiresLowering()
42 while (!Stack.empty()) { in userRequiresLowering()
43 User *V = Stack.pop_back_val(); in userRequiresLowering()
62 Stack.push_back(*EU); in userRequiresLowering()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUAlwaysInlinePass.cpp | 57 SmallVector<User *, 16> Stack(GV.users()); in recursivelyVisitUsers() local
61 while (!Stack.empty()) { in recursivelyVisitUsers()
62 User *U = Stack.pop_back_val(); in recursivelyVisitUsers()
77 Stack.push_back(F); in recursivelyVisitUsers()
84 append_range(Stack, U->users()); in recursivelyVisitUsers()
|
| H A D | SILowerI1Copies.cpp | 132 SmallVector<MachineBasicBlock *, 4> Stack; member in __anond5a978c00111::PhiIncomingAnalysis
148 assert(Stack.empty()); in analyze()
181 append_range(Stack, MBB->successors()); in analyze()
184 while (!Stack.empty()) { in analyze()
185 MachineBasicBlock *MBB = Stack.pop_back_val(); in analyze()
190 append_range(Stack, MBB->successors()); in analyze()
199 Stack.push_back(Pred); in analyze()
205 for (MachineBasicBlock *UnreachablePred : Stack) { in analyze()
210 Stack.clear(); in analyze()
269 SmallVector<MachineBasicBlock *, 4> Stack; member in __anond5a978c00111::LoopFinder
[all …]
|
| H A D | SIAnnotateControlFlow.cpp | 58 StackVector Stack; member in __anon5b8ad8ad0111::SIAnnotateControlFlow
154 return !Stack.empty() && Stack.back().first == BB; in isTopOfStack()
159 return Stack.pop_back_val().second; in popSaved()
164 Stack.push_back(std::make_pair(BB, Saved)); in push()
288 assert(Stack.back().first == BB); in closeControlFlow()
365 if (!Stack.empty()) { in runOnFunction()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Bitcode/Writer/ |
| H A D | ValueEnumerator.cpp | 202 UseListOrderStack &Stack) { in predictValueUseListOrderImpl() argument
263 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl()
264 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size"); in predictValueUseListOrderImpl()
266 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl()
270 OrderMap &OM, UseListOrderStack &Stack) { in predictValueUseListOrder() argument
280 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack); in predictValueUseListOrder()
287 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder()
291 Stack); in predictValueUseListOrder()
304 UseListOrderStack Stack; in predictUseListOrder() local
314 predictValueUseListOrder(&BB, &F, OM, Stack); in predictUseListOrder()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| H A D | xray-account.cpp | 178 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()
239 auto R = make_range(std::next(Parent).base(), ThreadStack.Stack.end()); in accountRecord()
248 ThreadStack.Stack.pop_back(); in accountRecord()
494 if (ThreadStack.second.Stack.empty()) { in __anona2b7686e0f02()
[all …]
|
| H A D | xray-stacks.cpp | 36 static cl::SubCommand Stack("stack", "Call stack accounting"); variable
39 cl::sub(Stack), cl::OneOrMore);
43 cl::sub(Stack), cl::init(false));
53 cl::sub(Stack), cl::init(""));
60 cl::sub(Stack), cl::init(false));
65 cl::sub(Stack), cl::init(false));
71 cl::sub(Stack), cl::init(false));
89 cl::sub(Stack), cl::init(HUMAN));
108 cl::sub(Stack), cl::init(AggregationType::TOTAL_TIME));
685 static CommandRegistration Unused(&Stack, []() -> Error { in __anonf2eff7aa0802()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-profgen/ |
| H A D | PerfReader.cpp | 97 Binary->getExpandedContextStr(Stack, KeyStr->WasLeafInlined); in getContextKey()
107 for (auto CallProbe : Stack) { in getContextKey()
118 T &Stack) { in collectSamplesFromFrame() argument
122 std::shared_ptr<ContextKey> Key = Stack.getContextKey(); in collectSamplesFromFrame()
142 UnwindState::ProfiledFrame *Cur, T &Stack) { in collectSamplesFromFrameTrie() argument
144 if (!Stack.pushFrame(Cur)) { in collectSamplesFromFrameTrie()
154 collectSamplesFromFrame(Cur, Stack); in collectSamplesFromFrameTrie()
157 collectSamplesFromFrameTrie(Item.second.get(), Stack); in collectSamplesFromFrameTrie()
160 Stack.popFrame(); in collectSamplesFromFrameTrie()
166 ProbeStack Stack(Binary); in collectSamplesFromFrameTrie() local
[all …]
|
| H A D | PerfReader.h | 384 SmallVector<uint64_t, 16> Stack; member
388 Stack.push_back(Cur->Address); in pushFrame()
393 if (!Stack.empty()) in popFrame()
394 Stack.pop_back(); in popFrame()
400 SmallVector<const PseudoProbe *, 16> Stack; member
411 Stack.push_back(CallProbe); in pushFrame()
416 if (!Stack.empty()) in popFrame()
417 Stack.pop_back(); in popFrame()
477 void collectSamplesFromFrame(UnwindState::ProfiledFrame *Cur, T &Stack);
480 void collectSamplesFromFrameTrie(UnwindState::ProfiledFrame *Cur, T &Stack);
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| H A D | FileSystem.h | 1451 std::stack<directory_iterator, std::vector<directory_iterator>> Stack; member
1470 State->Stack.push(directory_iterator(path, ec, Follow)); in State()
1471 if (State->Stack.top() == directory_iterator()) in State()
1482 file_type type = State->Stack.top()->type(); in increment()
1485 ErrorOr<basic_file_status> status = State->Stack.top()->status(); in increment()
1491 State->Stack.push(directory_iterator(*State->Stack.top(), ec, Follow)); in increment()
1492 if (State->Stack.top() != end_itr) { in increment()
1496 State->Stack.pop(); in increment()
1500 while (!State->Stack.empty() in increment()
1501 && State->Stack.top().increment(ec) == end_itr) { in increment()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFExpression.cpp | 407 SmallVector<PrintedExpr, 4> Stack; in printCompactDWARFExpr() local
422 raw_svector_ostream S(Stack.emplace_back(PrintedExpr::Value).String); in printCompactDWARFExpr()
434 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
447 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
457 assert(!Stack.empty()); in printCompactDWARFExpr()
458 Stack.back().Kind = PrintedExpr::Value; in printCompactDWARFExpr()
471 raw_svector_ostream S(Stack.emplace_back(PrintedExpr::Value).String); in printCompactDWARFExpr()
482 raw_svector_ostream S(Stack.emplace_back().String); in printCompactDWARFExpr()
498 assert(Stack.size() == 1 && "expected one value on stack"); in printCompactDWARFExpr()
500 if (Stack.front().Kind == PrintedExpr::Address) in printCompactDWARFExpr()
[all …]
|