| /prebuilts/go/darwin-x86/src/runtime/debug/ |
| stack.go | 14 // PrintStack prints to standard error the stack trace returned by runtime.Stack.
16 os.Stderr.Write(Stack())
19 // Stack returns a formatted stack trace of the goroutine that calls it.
20 // It calls runtime.Stack with a large enough buffer to capture the entire trace.
21 func Stack() []byte {
24 n := runtime.Stack(buf, false)
|
| /prebuilts/go/linux-x86/src/runtime/debug/ |
| stack.go | 14 // PrintStack prints to standard error the stack trace returned by runtime.Stack.
16 os.Stderr.Write(Stack())
19 // Stack returns a formatted stack trace of the goroutine that calls it.
20 // It calls runtime.Stack with a large enough buffer to capture the entire trace.
21 func Stack() []byte {
24 n := runtime.Stack(buf, false)
|
| /system/core/libmemunreachable/ |
| PtracerThread.cpp | 40 class Stack {
42 explicit Stack(size_t size) : size_(size) {
53 prctl(PR_SET_VMA, PR_SET_VMA_ANON_NAME, base_, size_, "libmemunreachable stack");
57 ~Stack() { munmap(base_, size_); };
63 DISALLOW_COPY_AND_ASSIGN(Stack);
71 stack_ = std::make_unique<Stack>(PTHREAD_STACK_MIN);
73 MEM_LOG_ALWAYS_FATAL("failed to mmap child stack: %s", strerror(errno));
|
| /external/compiler-rt/lib/esan/ |
| esan_sideline.h | 51 char *Stack;
|
| /external/tensorflow/tensorflow/contrib/lite/toco/graph_transformations/ |
| resolve_constant_stack.cc | 27 void Stack(Model* model, StackOperator const& op) {
36 // Stack inputs into buffer
83 Stack<ArrayDataType::kFloat>(model, *op);
86 Stack<ArrayDataType::kUint8>(model, *op);
89 Stack<ArrayDataType::kInt32>(model, *op);
92 Stack<ArrayDataType::kInt64>(model, *op);
95 LOG(FATAL) << "Unsupported data type given to Stack op with output \""
|
| /frameworks/layoutlib/bridge/src/com/android/layoutlib/bridge/impl/ |
| Stack.java | 22 * Custom Stack implementation on top of an {@link ArrayList} instead of
23 * using {@link java.util.Stack} which is on top of a vector.
27 public class Stack<T> extends ArrayList<T> {
31 public Stack() {
35 public Stack(int size) {
40 * Pushes the given object to the stack
48 * Remove the object at the top of the stack and returns it.
49 * @return the removed object or null if the stack was empty.
60 * Returns the object at the top of the stack.
61 * @return the object at the top or null if the stack is empty
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| Stack.java | 29 * The <code>Stack</code> class represents a last-in-first-out
30 * (LIFO) stack of objects. It extends class <tt>Vector</tt> with five
31 * operations that allow a vector to be treated as a stack. The usual
33 * method to <tt>peek</tt> at the top item on the stack, a method to test
34 * for whether the stack is <tt>empty</tt>, and a method to <tt>search</tt>
35 * the stack for an item and discover how far it is from the top.
37 * When a stack is first created, it contains no items.
39 * <p>A more complete and consistent set of LIFO stack operations is
43 * Deque<Integer> stack = new ArrayDeque<Integer>();}</pre>
49 class Stack<E> extends Vector<E>
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/asm/internal/lex/ |
| stack.go | 13 // A Stack is a stack of TokenReaders. As the top TokenReader hits EOF,
15 type Stack struct {
19 // Push adds tr to the top (end) of the input stack. (Popping happens automatically.)
20 func (s *Stack) Push(tr TokenReader) {
24 func (s *Stack) Next() ScanToken {
29 // Pop the topmost item from the stack and resume with the next one down.
36 func (s *Stack) Text() string {
40 func (s *Stack) File() string {
44 func (s *Stack) Base() *src.PosBase
[all...] |
| /prebuilts/go/linux-x86/src/cmd/asm/internal/lex/ |
| stack.go | 13 // A Stack is a stack of TokenReaders. As the top TokenReader hits EOF,
15 type Stack struct {
19 // Push adds tr to the top (end) of the input stack. (Popping happens automatically.)
20 func (s *Stack) Push(tr TokenReader) {
24 func (s *Stack) Next() ScanToken {
29 // Pop the topmost item from the stack and resume with the next one down.
36 func (s *Stack) Text() string {
40 func (s *Stack) File() string {
44 func (s *Stack) Base() *src.PosBase
[all...] |
| /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/internal/ |
| stack.h | 25 // Stack
27 //! A type-unsafe stack for storing different types of data.
28 /*! \tparam Allocator Allocator for allocating stack memory.
31 class Stack {
35 Stack(Allocator* allocator, size_t stackCapacity) : allocator_(allocator), ownAllocator_(0), stack_(0), stackTop_(0), stackEnd_(0), initialCapacity_(stackCapacity) {
40 Stack(Stack&& rhs)
57 ~Stack() {
62 Stack& operator=(Stack&& rhs) {
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/compiler/ |
| misc.py | 31 class Stack:
33 self.stack = []
34 self.pop = self.stack.pop
36 return len(self.stack)
38 self.stack.append(elt)
40 return self.stack[-1]
42 return self.stack[index]
|
| /external/python/cpython2/Lib/compiler/ |
| misc.py | 31 class Stack:
33 self.stack = []
34 self.pop = self.stack.pop
36 return len(self.stack)
38 self.stack.append(elt)
40 return self.stack[-1]
42 return self.stack[index]
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/ |
| misc.py | 31 class Stack:
33 self.stack = []
34 self.pop = self.stack.pop
36 return len(self.stack)
38 self.stack.append(elt)
40 return self.stack[-1]
42 return self.stack[index]
|
| /prebuilts/gdb/linux-x86/lib/python2.7/compiler/ |
| misc.py | 31 class Stack:
33 self.stack = []
34 self.pop = self.stack.pop
36 return len(self.stack)
38 self.stack.append(elt)
40 return self.stack[-1]
42 return self.stack[index]
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| misc.py | 31 class Stack:
33 self.stack = []
34 self.pop = self.stack.pop
36 return len(self.stack)
38 self.stack.append(elt)
40 return self.stack[-1]
42 return self.stack[index]
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| misc.py | 31 class Stack:
33 self.stack = []
34 self.pop = self.stack.pop
36 return len(self.stack)
38 self.stack.append(elt)
40 return self.stack[-1]
42 return self.stack[index]
|
| /device/linaro/bootloader/edk2/UefiCpuPkg/CpuS3DataDxe/ |
| CpuS3Data.c | 153 VOID *Stack;
207 // Allocate stack space for all CPUs
209 Stack = AllocateAcpiNvsMemoryBelow4G (NumberOfCpus * AcpiCpuData->StackSize);
210 ASSERT (Stack != NULL);
211 AcpiCpuData->StackAddress = (EFI_PHYSICAL_ADDRESS)(UINTN)Stack;
|
| /external/swiftshader/third_party/LLVM/lib/Target/X86/ |
| X86FloatingPoint.cpp | 1 //===-- X86FloatingPoint.cpp - Floating point Reg -> Stack converter ------===//
11 // pseudo registers into register stack instructions. This pass uses live
15 // The x87 hardware tracks liveness of the stack registers, so it is necessary
18 // identical stack positions. Instructions are inserted at the end of each basic
59 memset(Stack, 0, sizeof(Stack));
80 // LiveBundle. It represents a set of CFG edges where the live FP stack
81 // registers must be allocated identically in the x87 stack.
88 // but the exact mapping of FP registers to stack slots is fixed later.
94 // stack order has not yet been fixed
[all...] |
| /external/ImageMagick/MagickWand/ |
| wandcli-private.h | 86 /* Define a generic stack linked list, for pushing and popping
94 } Stack;
118 Stack
|
| /external/clang/include/clang/Serialization/ |
| ModuleManager.h | 85 Stack.reserve(N);
92 /// \brief The stack used when marking the imports of a particular module
94 SmallVector<ModuleFile *, 4> Stack;
|
| /external/giflib/ |
| gif_lib_private.h | 42 StackPtr, /* For character stack (see below). */
50 GifByteType Stack[LZ_MAX_CODE]; /* Decoded pixels are stacked here. */
|
| /external/llvm/include/llvm/CodeGen/ |
| PseudoSourceValue.h | 34 /// a memory access references the functions stack frame (e.g., a spill slot),
35 /// below the stack frame (e.g., argument space), or constant pool.
39 Stack,
66 bool isStack() const { return Kind == Stack; }
159 /// Return a pseudo source value referencing the area below the stack frame of
176 /// Return a pseudo source value referencing a fixed stack frame entry,
|
| /external/swiftshader/third_party/LLVM/test/Scripts/ |
| coff-dump.py | 236 Stack = []
282 Stack [0:0] = [Input.tell()]
287 assert(len(Stack) > 0)
288 Input.seek(Stack[0])
289 del Stack[0]
|
| /external/valgrind/coregrind/ |
| m_stacks.c | 3 /*--- Stack management. m_stacks.c ---*/
49 The stack
51 The stack's segment seems to be dynamically extended downwards by
52 the kernel as the stack pointer moves down. Initially, a 1-page
53 (4k) stack is allocated. When SP moves below that for the first
56 upwards to the current valid stack. It then extends the stack
61 That means that Valgrind can't spot when the stack segment is being
63 update stack permissions around SP, so we need to spot all writes
66 The deal is: when SP is assigned a lower value, the stack is bein
280 Stack* stack = find_stack_by_addr(SP); local
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| PseudoSourceValue.h | 34 /// a memory access references the functions stack frame (e.g., a spill slot),
35 /// below the stack frame (e.g., argument space), or constant pool.
39 Stack,
67 bool isStack() const { return Kind == Stack; }
163 /// Return a pseudo source value referencing the area below the stack frame of
180 /// Return a pseudo source value referencing a fixed stack frame entry,
|
