| /src/external/apache2/llvm/dist/llvm/lib/BinaryFormat/ |
| MsgPackDocument.cpp | 104 // A level in the document reading stack.
132 SmallVector<StackLevel, 4> Stack;
136 Stack.push_back(StackLevel(Root, 0, (size_t)-1));
143 if (Multi && Stack.size() == 1) {
182 if (Stack.empty())
184 else if (Stack.back().Node.getKind() == Type::Array) {
186 auto &Array = Stack.back().Node.getArray();
187 DestNode = &Array[Stack.back().Index++];
189 auto &Map = Stack.back().Node.getMap();
190 if (!Stack.back().MapEntry)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Format/ |
| ContinuationIndenter.cpp | 38 const std::vector<ParenState> &Stack) {
49 // the paren stack in lockstep, keeping track of the stack level which visited
59 // The paren stack at this point contains 3 brace levels:
65 // brace of the initial left brace and at level 2 of the stack. Then,
67 // the second } on line 4, and will traverse the stack downwards until it
70 // traverse the stack downwards until it finds the matching { on level 0.
75 // The algorithm will only traverse the stack if it encounters braces, array
80 // Maintains a stack level corresponding to the current End token.
81 int MatchingStackIndex = Stack.size() - 1
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyDebugFixup.cpp | 11 /// in such registers in debug_value instructions become stack relative also.
13 /// track stack depth when values get stackified.
55 "Ensures debug_value's that have been stackified become stack relative",
74 std::vector<StackElem> Stack;
85 // change into a stack operand.
89 for (auto &Elem : reverse(Stack)) {
91 auto Depth = static_cast<unsigned>(&Elem - &Stack[0]);
93 << " -> Stack Relative " << Depth << "\n");
107 // Track stack depth.
110 auto Prev = Stack.back()
[all...] |
| WebAssemblyCFGStackify.cpp | 86 unsigned getBranchDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
88 unsigned getDelegateDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
91 getRethrowDepth(const SmallVectorImpl<EndMarkerInfo> &Stack,
260 // predecessors so that we minimize the time that the BLOCK is on the stack,
261 // which reduces overall stack height.
1134 // If the EH pad on the stack top is where this instruction should unwind
1585 const SmallVectorImpl<EndMarkerInfo> &Stack, const MachineBasicBlock *MBB) {
1587 for (auto X : reverse(Stack)) {
1592 assert(Depth < Stack.size() && "Branch destination should be in scope");
1597 const SmallVectorImpl<EndMarkerInfo> &Stack, const MachineBasicBlock *MBB)
[all...] |
| /src/external/mit/expat/dist/examples/ |
| element_declarations.c | 64 } Stack;
66 static Stack *
67 stackPushMalloc(Stack *stackTop, const XML_Content *model, unsigned level) {
68 Stack *const newStackTop = malloc(sizeof(Stack));
78 static Stack *
79 stackPopFree(Stack *stackTop) {
80 Stack *const newStackTop = stackTop->prev;
146 Stack *stackTop = stackPushMalloc(NULL, root, 1);
160 Stack *const newStackTo
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/Utils/ |
| AMDGPULDSUtils.cpp | 39 SmallVector<User *, 16> Stack;
40 Stack.push_back(InitialUser);
42 while (!Stack.empty()) {
43 User *V = Stack.pop_back_val();
62 Stack.push_back(*EU);
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| WorkList.cpp | 37 SmallVector<WorkListUnit, 20> Stack;
41 return !Stack.empty();
45 Stack.push_back(U);
49 assert(!Stack.empty());
50 const WorkListUnit& U = Stack.back();
51 Stack.pop_back(); // This technically "invalidates" U, but we are fine.
93 SmallVector<WorkListUnit, 20> Stack;
97 return !Queue.empty() || !Stack.empty();
104 Stack.push_back(U);
109 if (!Stack.empty())
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUAlwaysInlinePass.cpp | 57 SmallVector<User *, 16> Stack(GV.users());
61 while (!Stack.empty()) {
62 User *U = Stack.pop_back_val();
77 Stack.push_back(F);
84 append_range(Stack, U->users());
|
| AMDGPUAnnotateKernelFeatures.cpp | 113 SmallVector<const Constant *, 16> Stack;
114 Stack.push_back(EntryC);
116 while (!Stack.empty()) {
117 const Constant *C = Stack.pop_back_val();
138 Stack.push_back(OpC);
364 F.addFnAttr("amdgpu-stack-objects");
|
| SILowerI1Copies.cpp | 132 SmallVector<MachineBasicBlock *, 4> Stack;
148 assert(Stack.empty());
181 append_range(Stack, MBB->successors());
184 while (!Stack.empty()) {
185 MachineBasicBlock *MBB = Stack.pop_back_val();
190 append_range(Stack, MBB->successors());
199 Stack.push_back(Pred);
205 for (MachineBasicBlock *UnreachablePred : Stack) {
210 Stack.clear();
269 SmallVector<MachineBasicBlock *, 4> Stack;
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/ubsan/ |
| ubsan_diag.h | 23 SymbolizedStack *Stack;
26 if (Stack)
27 Stack->ClearAll();
31 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr)
32 : Stack(Stack) {}
35 if (Stack != S)
37 Stack = S;
39 const SymbolizedStack *get() const { return Stack; }
73 Location(const SymbolizedStackHolder &Stack)
[all...] |
| /src/external/gpl3/gcc.old/dist/libsanitizer/ubsan/ |
| ubsan_diag.h | 22 SymbolizedStack *Stack;
25 if (Stack)
26 Stack->ClearAll();
30 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr)
31 : Stack(Stack) {}
34 if (Stack != S)
36 Stack = S;
38 const SymbolizedStack *get() const { return Stack; }
72 Location(const SymbolizedStackHolder &Stack)
[all...] |
| /src/external/gpl3/gcc/dist/libsanitizer/ubsan/ |
| ubsan_diag.h | 22 SymbolizedStack *Stack;
25 if (Stack)
26 Stack->ClearAll();
30 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr)
31 : Stack(Stack) {}
34 if (Stack != S)
36 Stack = S;
38 const SymbolizedStack *get() const { return Stack; }
72 Location(const SymbolizedStackHolder &Stack)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| SyncDependenceAnalysis.cpp | 111 #include <stack>
142 static void computeStackPO(BlockStack &Stack, const LoopInfo &LI, Loop *Loop,
145 while (!Stack.empty()) {
146 const auto *NextBB = Stack.back();
164 Stack.push_back(NestedExitBB);
168 Stack.pop_back();
184 Stack.push_back(SuccBB);
188 Stack.pop_back();
198 BlockStack Stack;
199 Stack.reserve(24); // FIXME made-up numbe
[all...] |
| PhiValues.cpp | 50 SmallVectorImpl<const PHINode *> &Stack) {
64 processPhi(PhiPhiOp, Stack);
77 // Now that incoming phis have been handled, push this phi to the stack.
78 Stack.push_back(Phi);
84 // component will be those on top of the depth stack with the same or
88 const PHINode *ComponentPhi = Stack.pop_back_val();
107 if (Stack.empty())
110 unsigned int &ComponentDepthNumber = DepthMap[Stack.back()];
128 SmallVector<const PHINode *, 8> Stack;
129 processPhi(PN, Stack);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| JSON.cpp | 775 assert(Stack.back().Ctx != Object && "Only attributes allowed here");
776 if (Stack.back().HasValue) {
777 assert(Stack.back().Ctx != Singleton && "Only one value allowed here");
780 if (Stack.back().Ctx == Array)
783 Stack.back().HasValue = true;
808 if (Stack.size() > 1 && Stack.back().Ctx == Singleton) {
825 Stack.emplace_back();
826 Stack.back().Ctx = Array;
832 assert(Stack.back().Ctx == Array)
[all...] |
| TimeProfiler.cpp | 85 Stack.emplace_back(steady_clock::now(), TimePointType(), std::move(Name),
90 assert(!Stack.empty() && "Must call begin() first");
91 Entry &E = Stack.back();
113 if (std::find_if(++Stack.rbegin(), Stack.rend(), [&](const Entry &Val) {
115 }) == Stack.rend()) {
121 Stack.pop_back();
129 assert(Stack.empty() &&
132 [](const auto &TTP) { return TTP->Stack.empty(); }) &&
249 SmallVector<Entry, 16> Stack;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| TruncInstCombine.cpp | 78 SmallVector<Instruction *, 8> Stack;
96 if (!Stack.empty() && Stack.back() == I) {
98 // Worklist and the Stack, and add it to the instruction info map.
100 Stack.pop_back();
111 // Add the instruction to the stack before start handling its operands.
112 Stack.push_back(I);
151 SmallVector<Instruction *, 8> Stack;
181 if (!Stack.empty() && Stack.back() == I)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaAttr.cpp | 130 "stack",
181 "stack",
251 // Reset just pops the top of the stack, or resets the current alignment to
254 if (AlignPackStack.Stack.empty()) {
260 << "stack empty";
375 if (AlignPackStack.Stack.empty()) {
377 "Empty pack stack can only be at Native alignment mode.");
378 Diag(PragmaLoc, diag::warn_pragma_pop_failed) << "pack" << "stack empty";
427 if (AlignPackStack.Stack.empty())
434 for (const auto &StackSlot : llvm::reverse(AlignPackStack.Stack)) {
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-profgen/ |
| PerfReader.cpp | 28 // The 2nd frame after leaf could be missing if stack sample is
97 Binary->getExpandedContextStr(Stack, KeyStr->WasLeafInlined);
107 for (auto CallProbe : Stack) {
118 T &Stack) {
122 std::shared_ptr<ContextKey> Key = Stack.getContextKey();
142 UnwindState::ProfiledFrame *Cur, T &Stack) {
144 if (!Stack.pushFrame(Cur)) {
154 collectSamplesFromFrame(Cur, Stack);
157 collectSamplesFromFrameTrie(Item.second.get(), Stack);
159 // Recover the call stack
[all...] |
| ProfiledBinary.h | 65 // PrologEpilog offset tracker, used to filter out broken stack samples
230 const auto &Stack = getFrameLocationStack(Offset);
231 if (Stack.empty())
233 return Stack.back();
239 // Get the context string of the current stack with inline context filled in.
242 std::string getExpandedContextStr(const SmallVectorImpl<uint64_t> &Stack,
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| xray-account.cpp | 178 ThreadStack.Stack.emplace_back(Record.FuncId, Record.TSC);
185 if (ThreadStack.Stack.empty())
188 if (ThreadStack.Stack.back().first == Record.FuncId) {
189 const auto &Top = ThreadStack.Stack.back();
195 ThreadStack.Stack.pop_back();
202 // Look for the parent up the stack.
204 std::find_if(ThreadStack.Stack.rbegin(), ThreadStack.Stack.rend(),
208 if (Parent == ThreadStack.Stack.rend())
211 // Account time for this apparently sibling call exit up the stack
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| FileSystem.h | 43 #include <stack>
1451 std::stack<directory_iterator, std::vector<directory_iterator>> Stack;
1470 State->Stack.push(directory_iterator(path, ec, Follow));
1471 if (State->Stack.top() == directory_iterator())
1482 file_type type = State->Stack.top()->type();
1485 ErrorOr<basic_file_status> status = State->Stack.top()->status();
1491 State->Stack.push(directory_iterator(*State->Stack.top(), ec, Follow));
1492 if (State->Stack.top() != end_itr)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| DWARFExpression.cpp | 407 SmallVector<PrintedExpr, 4> Stack;
422 raw_svector_ostream S(Stack.emplace_back(PrintedExpr::Value).String);
434 raw_svector_ostream S(Stack.emplace_back().String);
447 raw_svector_ostream S(Stack.emplace_back().String);
455 // The top stack entry should be treated as the actual value of tne
457 assert(!Stack.empty());
458 Stack.back().Kind = PrintedExpr::Value;
471 raw_svector_ostream S(Stack.emplace_back(PrintedExpr::Value).String);
482 raw_svector_ostream S(Stack.emplace_back().String);
487 // If we hit an unknown operand, we don't know its effect on the stack,
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Bitcode/Writer/ |
| ValueEnumerator.cpp | 202 UseListOrderStack &Stack) {
263 Stack.emplace_back(V, F, List.size());
264 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
266 Stack.back().Shuffle[I] = List[I].second;
270 OrderMap &OM, UseListOrderStack &Stack) {
280 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack);
287 predictValueUseListOrder(Op, F, OM, Stack);
291 Stack);
301 // function in a stack.
304 UseListOrderStack Stack;
[all...] |
