| /external/python/cpython2/Lib/lib2to3/pgen2/ |
| parse.py | 104 # Each stack entry is a tuple: (dfa, state, node).
109 self.stack = [stackentry]
119 dfa, state, node = self.stack[-1]
134 if not self.stack:
137 dfa, state, node = self.stack[-1]
153 if not self.stack:
177 dfa, state, node = self.stack[-1]
182 self.stack[-1] = (dfa, newstate, node)
186 dfa, state, node = self.stack[-1]
188 self.stack[-1] = (dfa, newstate, node
[all...] |
| /external/python/cpython3/Lib/lib2to3/pgen2/ |
| parse.py | 104 # Each stack entry is a tuple: (dfa, state, node).
109 self.stack = [stackentry]
119 dfa, state, node = self.stack[-1]
134 if not self.stack:
137 dfa, state, node = self.stack[-1]
153 if not self.stack:
177 dfa, state, node = self.stack[-1]
182 self.stack[-1] = (dfa, newstate, node)
186 dfa, state, node = self.stack[-1]
188 self.stack[-1] = (dfa, newstate, node
[all...] |
| /external/llvm/tools/llvm-c-test/ |
| calc.c | 44 LLVMValueRef stack[MAX_DEPTH]; local
59 printf("stack underflow\n");
63 stack[depth - 2] = LLVMBuildBinOp(builder, op_to_opcode(tok),
64 stack[depth - 1], stack[depth - 2], "");
73 printf("stack underflow\n");
77 off = LLVMBuildGEP(builder, param, &stack[depth - 1], 1, "");
78 stack[depth - 1] = LLVMBuildLoad(builder, off, "");
92 printf("stack overflow\n");
96 stack[depth++] = LLVMConstInt(LLVMInt64Type(), val, 1)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-c-test/ |
| calc.c | 44 LLVMValueRef stack[MAX_DEPTH]; local
59 printf("stack underflow\n");
63 stack[depth - 2] = LLVMBuildBinOp(builder, op_to_opcode(tok),
64 stack[depth - 1], stack[depth - 2], "");
73 printf("stack underflow\n");
77 off = LLVMBuildGEP(builder, param, &stack[depth - 1], 1, "");
78 stack[depth - 1] = LLVMBuildLoad(builder, off, "");
92 printf("stack overflow\n");
96 stack[depth++] = LLVMConstInt(LLVMInt64Type(), val, 1)
[all...] |
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| traversal.cc | 35 // to the stack).
50 std::vector<DfsStackElem> stack; local
51 stack.reserve(from.size());
57 stack.emplace_back(node_idx.value());
62 while (!stack.empty()) {
63 DfsStackElem w = stack.back();
64 stack.pop_back();
99 stack.emplace_back(w.node, true, w.src);
109 stack.emplace_back(fanin, false, w.node);
113 stack.emplace_back(fanout, false, w.node)
[all...] |
| /device/linaro/bootloader/edk2/StdLib/LibC/CRT/Ia32/ |
| llrem.c | 37 ; Original local stack when calling _allrem
54 ; Set up the local stack for Reminder pointer
60 ; Set up the local stack for Divisor parameter
68 ; Set up the local stack for Dividend parameter
87 ; Adjust stack
local
|
| ullrem.c | 37 ; Original local stack when calling _aullrem
54 ; Set up the local stack for Reminder pointer
60 ; Set up the local stack for Divisor parameter
68 ; Set up the local stack for Dividend parameter
87 ; Adjust stack
local
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| StreamUtil.java | 100 byte[] stack = new byte[5];
101 int pos = stack.length;
103 stack[--pos] = (byte)(tagNo & 0x7F);
108 stack[--pos] = (byte)(tagNo & 0x7F | 0x80);
112 length += stack.length - pos;
|
| /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/asn1/ |
| StreamUtil.java | 101 byte[] stack = new byte[5];
102 int pos = stack.length;
104 stack[--pos] = (byte)(tagNo & 0x7F);
109 stack[--pos] = (byte)(tagNo & 0x7F | 0x80);
113 length += stack.length - pos;
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_report.h | 60 ReportStack *stack; member in struct:__tsan::ReportMop
81 ReportStack *stack; member in struct:__tsan::ReportLocation
94 ReportStack *stack; member in struct:__tsan::ReportThread
101 ReportStack *stack; member in struct:__tsan::ReportMutex
126 void PrintStack(const ReportStack *stack);
|
| /external/tensorflow/tensorflow/lite/testing/ |
| message.cc | 17 #include <stack>
25 // message object. Place a new message at the top of the stack when it start
51 // least one entry in the stack.
84 std::stack<Message*> nodes_;
90 MessageStack stack(message);
91 Tokenize(input, &stack);
92 return stack.valid();
|
| /external/tensorflow/tensorflow/lite/testing/nnapi_tflite_zip_tests/ |
| message.cc | 20 #include <stack>
28 // message object. Place a new message at the top of the stack when it start
54 // least one entry in the stack.
87 std::stack<Message*> nodes_;
93 MessageStack stack(message);
94 Tokenize(input, &stack);
95 return stack.valid();
|
| /device/linaro/bootloader/edk2/EmulatorPkg/Sec/X64/ |
| SwitchRam.asm | 31 ; Adjust callers %rbp to account for stack move
35 push rbp ; stack frame is for the debugger
43 ; Copy all of temp RAM to permanent memory, including stack
49 sub rsp, 028h ; Allocate register spill area & 16-byte align stack
51 ; Temp mem stack now copied to permanent location. %esp still in temp memory
54 pop r9 ; CopySize (old stack)
55 pop r8 ; PermanentMemoryBase (old stack)
56 pop rdx ; TemporaryMemoryBase (old stack)
58 mov rcx, rsp ; Move to new stack
59 sub rcx, rdx ; Calc offset of stack in Temp Memory
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| stack.cc | 16 #include "tensorflow/core/kernels/stack.h"
41 class Stack : public ResourceBase {
51 Stack(const DataType& elem_type, const string& stack_name, int max_size)
61 return errors::InvalidArgument("Stack[", stack_name_, "] overflowed ",
72 return errors::InvalidArgument("Stack[", stack_name_,
80 // We don't swap the first tensor on the stack and any subsequent tensors
101 return strings::StrCat("Stack[", stack_name_, "]");
120 return errors::InvalidArgument("Stack[", stack_name_,
127 Status GetStack(OpKernelContext* ctx, Stack** stack) {
187 Stack* stack = new Stack(elem_type_, stack_name, size); local
222 Stack* stack = nullptr; local
291 Stack* stack = nullptr; local
331 Stack* stack = nullptr; local
[all...] |
| /cts/tools/dasm/src/java_cup/runtime/ |
| lr_parser.java | 4 import java.util.Stack;
8 * parsers act by shifting input onto a parse stack until the symbols
10 * stack. Once this occurs, a reduce is performed. This involves removing
18 * on top of the parse stack (stored as part of a symbol object representing
23 * onto the stack. When the parser reduces, it pops the handle (right hand
24 * side of a production) off the stack. This leaves the parser in the state
29 * (also containing the new state) onto the stack.<p>
68 * pushed onto the stack for the reduce.
158 * is on top of the stack) and the given terminal is next on the input.
180 * the stack. The new top of stack indicates a state. This table is
242 protected Stack stack = new Stack(); field in class:lr_parser
[all...] |
| /external/libffi/src/ia64/ |
| ffi.c | 52 /* The stack layout given to ffi_call_unix and ffi_closure_unix_inner. */
58 UINT64 other_args[]; /* Arguments passed on stack, variable size. */
279 struct ia64_args *stack; local
289 /* Allocate the stack frame. */
290 stack = alloca (cif->bytes);
299 stack->gp_regs[gpcount++] = *(SINT8 *)avalue[i];
302 stack->gp_regs[gpcount++] = *(UINT8 *)avalue[i];
305 stack->gp_regs[gpcount++] = *(SINT16 *)avalue[i];
308 stack->gp_regs[gpcount++] = *(UINT16 *)avalue[i];
311 stack->gp_regs[gpcount++] = *(SINT32 *)avalue[i]
[all...] |
| /external/python/cpython2/Modules/_ctypes/libffi/src/ia64/ |
| ffi.c | 52 /* The stack layout given to ffi_call_unix and ffi_closure_unix_inner. */
58 UINT64 other_args[]; /* Arguments passed on stack, variable size. */
279 struct ia64_args *stack; local
289 /* Allocate the stack frame. */
290 stack = alloca (cif->bytes);
299 stack->gp_regs[gpcount++] = *(SINT8 *)avalue[i];
302 stack->gp_regs[gpcount++] = *(UINT8 *)avalue[i];
305 stack->gp_regs[gpcount++] = *(SINT16 *)avalue[i];
308 stack->gp_regs[gpcount++] = *(UINT16 *)avalue[i];
311 stack->gp_regs[gpcount++] = *(SINT32 *)avalue[i]
[all...] |
| /external/perfetto/src/profiling/memory/ |
| bookkeeping_unittest.cc | 29 std::vector<FrameData> stack() { function in namespace:perfetto::profiling::__anon35840
61 hd.RecordMalloc(stack(), 1, 5, sequence_number, 100 * sequence_number);
65 ASSERT_EQ(hd.GetSizeForTesting(stack()), 5);
70 ASSERT_EQ(hd.GetSizeForTesting(stack()), 5);
75 ASSERT_EQ(hd.GetSizeForTesting(stack()), 0);
87 hd.RecordMalloc(stack(), 1, 5, sequence_number, 100 * sequence_number);
88 hd2.RecordMalloc(stack(), 2, 2, sequence_number, 100 * sequence_number);
90 ASSERT_EQ(hd2.GetSizeForTesting(stack()), 2);
91 ASSERT_EQ(hd.GetSizeForTesting(stack()), 5);
94 ASSERT_EQ(hd.GetSizeForTesting(stack()), 5)
150 const std::vector<FrameData>* stack; \/\/ nullptr for free member in struct:perfetto::profiling::__anon35840::Operation
[all...] |
| /external/swiftshader/src/OpenGL/common/ |
| MatrixStack.cpp | 23 stack = new Matrix[size];
24 stack[0] = 1;
32 delete[] stack;
33 stack = 0;
38 stack[top] = 1;
43 stack[top] = M;
48 stack[top] = Matrix(M[0], M[4], M[8], M[12],
56 stack[top] = Matrix((float)M[0], (float)M[4], (float)M[8], (float)M[12],
64 stack[top] *= Matrix::translate(x, y, z);
90 stack[top] *= rotate
[all...] |
| /external/elfutils/tests/ |
| run-stack-d-test.sh | 66 STACKCMD=${bindir}/`program_transform stack`
68 STACKCMD=${abs_top_builddir}/src/stack
77 testrun_compare ${abs_top_builddir}/src/stack -r -n 2 -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
87 testrun_compare ${abs_top_builddir}/src/stack -r -n 2 -s -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
98 testrun_compare ${abs_top_builddir}/src/stack -n 2 -d -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
107 testrun_compare ${abs_top_builddir}/src/stack -n 2 -s -d -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
|
| /external/gemmlowp/profiling/ |
| profiler.h | 20 // This profiler only samples a pseudo-stack, not the actual call stack.
22 // pseudo-stack "labels", see ScopedProfilingLabel.
114 // of the number of samples that recorded the given pseudo-stack.
188 static void AddStackToNode(const ProfilingStack& stack, Node* node,
191 if (stack.size == level) {
196 if (child->label == stack.labels[level]) {
203 child_to_add_to->label = stack.labels[level];
206 AddStackToNode(stack, child_to_add_to, level + 1);
210 void AddStack(const ProfilingStack& stack) {
[all...] |
| /external/google-breakpad/src/client/linux/dump_writer_common/ |
| seccomp_unwinder.cc | 44 uint64_t top = thread.stack.start_of_memory_range;
47 bp > thread.stack.start_of_memory_range +
48 thread.stack.memory.data_size - sizeof(bp) ||
54 uint8_t* bp_addr = stack_copy + bp - thread.stack.start_of_memory_range;
80 thread.stack.start_of_memory_range+thread.stack.memory.data_size) {
107 uint32_t top = thread.stack.start_of_memory_range;
110 bp > thread.stack.start_of_memory_range +
111 thread.stack.memory.data_size - sizeof(bp) ||
117 uint8_t* bp_addr = stack_copy + bp - thread.stack.start_of_memory_range
[all...] |
| /external/google-breakpad/src/processor/ |
| stackwalker_address_list.cc | 30 // stackwalker_address_list.cc: a pseudo stack walker.
71 StackFrame* StackwalkerAddressList::GetCallerFrame(const CallStack* stack,
73 if (!stack) {
74 BPLOG(ERROR) << "Can't get caller frame without stack";
78 size_t frame_index = stack->frames()->size();
|
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.cons.alloc/ |
| ctor_alloc.pass.cpp | 10 // <stack>
13 // explicit stack(const Alloc& a);
15 #include <stack>
22 : private std::stack<int, std::deque<int, test_allocator<int> > >
24 typedef std::stack<int, std::deque<int, test_allocator<int> > > base;
|
| ctor_copy_alloc.pass.cpp | 10 // <stack>
13 // stack(const stack& q, const Alloc& a);
15 #include <stack>
34 : public std::stack<T, C>
36 typedef std::stack<T, C> base;
|
