| /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/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...] |
| /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/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/llvm/tools/llvm-xray/ |
| xray-account.h | 38 llvm::SmallVector<std::pair<int32_t, uint64_t>, 32> Stack;
89 /// If we've been set to deduce sibling calls, we try walking up the stack
|
| /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/clang/include/clang/Serialization/ |
| ModuleManager.h | 105 Stack.reserve(N);
112 /// The stack used when marking the imports of a particular module
114 SmallVector<ModuleFile *, 4> Stack;
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| 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...] |
| 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...] |
| /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/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/sys/external/bsd/compiler_rt/dist/lib/asan/tests/ |
| asan_str_test.cc | 39 Stack,
44 return oob_kind == OOBKind::Stack ? kStackReadUnderflow
49 return oob_kind == OOBKind::Stack ? kStackReadOverflow
93 StrLenOOBTestTemplate(stack_string, length, OOBKind::Stack);
|
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| NestedNameSpecifier.cpp | 637 SmallVector<NestedNameSpecifier *, 4> Stack;
639 Stack.push_back(NNS);
640 while (!Stack.empty()) {
641 NestedNameSpecifier *NNS = Stack.pop_back_val();
665 SaveSourceLocation(Stack.empty()? R.getEnd() : R.getBegin(),
|
| /src/external/apache2/llvm/dist/clang/lib/Format/ |
| ContinuationIndenter.h | 429 /// A stack keeping track of properties applying to parenthesis
431 std::vector<ParenState> Stack;
433 /// Ignore the stack of \c ParenStates for state comparison.
441 /// ParenState stack (in an otherwise identical state) and these different
475 return Stack < Other.Stack;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ObjectYAML/ |
| MinidumpYAML.h | 89 yaml::BinaryRef Stack;
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| CFIInstrInserter.cpp | 273 SmallVector<MachineBasicBlock *, 4> Stack;
274 Stack.push_back(MBBInfo.MBB);
277 MachineBasicBlock *Current = Stack.pop_back_val();
286 Stack.push_back(Succ);
289 } while (!Stack.empty());
|
| /src/external/apache2/llvm/dist/llvm/lib/Object/ |
| COFFModuleDefinition.cpp | 66 // fully decorated with leading underscore and trailing stack argument
161 if (Stack.empty()) {
165 Tok = Stack.back();
166 Stack.pop_back();
183 void unget() { Stack.push_back(Tok); }
355 std::vector<Token> Stack;
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| 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/Target/AMDGPU/ |
| SIAnnotateControlFlow.cpp | 58 StackVector Stack;
152 /// Is BB the last block saved on the stack ?
154 return !Stack.empty() && Stack.back().first == BB;
157 /// Pop the last saved value from the control flow stack
159 return Stack.pop_back_val().second;
162 /// Push a BB and saved value to the control flow stack
164 Stack.push_back(std::make_pair(BB, Saved));
288 assert(Stack.back().first == BB);
365 if (!Stack.empty())
[all...] |
| 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/external/apache2/llvm/dist/llvm/tools/llvm-profgen/ |
| 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/clang/lib/Frontend/ |
| DiagnosticRenderer.cpp | 154 /// Prints an include stack when appropriate for a particular
160 /// of customizing the formatting and display of the include stack.
164 /// \param Level The diagnostic level of the message this stack pertains to.
188 /// Helper to recursively walk up the include stack and print each layer
201 // import stack rather than the
205 // This location was imported by a module. Emit the module import stack.
218 /// Emit the module import stack associated with the current location.
229 /// Helper to recursively walk up the import stack and print each layer
247 /// Emit the module build stack, for cases where a module is (re-)built
250 ModuleBuildStack Stack = SM.getModuleBuildStack()
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaOpenMP.cpp | 46 // Stack of data-sharing attributes for variables
63 /// Stack for tracking declarations used in OpenMP directives and
205 /// Stack of used declaration and their data-sharing attributes.
208 SmallVector<std::pair<StackTy, const FunctionScopeInfo *>, 4> Stack;
220 /// Iterators over the stack iterate in order from innermost to outermost
224 return Stack.empty() ? const_iterator()
225 : Stack.back().first.rbegin() + IgnoredStackElements;
228 return Stack.empty() ? const_iterator() : Stack.back().first.rend();
232 return Stack.empty() ? iterator(
[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...] |
| /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...] |
