| /frameworks/base/packages/SystemUI/src/com/android/systemui/recents/events/ui/dragndrop/ |
| DragEndCancelledEvent.java | 30 public final TaskStack stack; field in class:DragEndCancelledEvent
34 public DragEndCancelledEvent(TaskStack stack, Task task, TaskView taskView) {
35 this.stack = stack;
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/stack/ |
| ScrollContainer.java | 17 package com.android.systemui.statusbar.stack;
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-m68k/ |
| tls-def-1.s | 9 .section .note.GNU-stack,"",@progbits
|
| /external/chromium-trace/catapult/telemetry/telemetry/timeline/ |
| slice.py | 31 def IterEventsInThisContainerRecrusively(self, stack=None):
34 if stack == None:
35 stack = []
37 assert len(stack) == 0
38 stack.extend(reversed(self.sub_slices))
39 while len(stack):
40 s = stack.pop()
42 stack.extend(reversed(s.sub_slices))
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/integration/cloudformation/ |
| test_connection.py | 125 # A newly created stack should have events
129 # No policy should be set on the stack by default
133 # Our new stack should show up in the stack list
135 stack = stacks[0]
136 self.assertEqual(self.stack_name, stack.stack_name)
138 params = [(p.key, p.value) for p in stack.parameters]
143 stack.update()
144 if stack.stack_status.find("PROGRESS") == -1:
155 stack = stacks[0
[all...] |
| /external/compiler-rt/lib/lsan/ |
| lsan_allocator.h | 23 void *Allocate(const StackTrace &stack, uptr size, uptr alignment,
26 void *Reallocate(const StackTrace &stack, void *p, uptr new_size,
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_symbolizer_mac.h | 27 bool SymbolizePC(uptr addr, SymbolizedStack *stack) override;
37 bool SymbolizePC(uptr addr, SymbolizedStack *stack) override;
|
| /external/libchrome/base/ |
| at_exit.h | 8 #include <stack>
23 // AtExitManager object on the stack:
55 // AtExitManagers are kept on a global stack, and it will be removed during
61 std::stack<base::Closure> stack_;
62 AtExitManager* next_manager_; // Stack of managers to allow shadowing.
|
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/ |
| push_rv.pass.cpp | 10 // <stack>
14 #include <stack>
22 std::stack<MoveOnly> q;
|
| /external/speex/libspeex/ |
| lsp.h | 56 int lpc_to_lsp (spx_coef_t *a, int lpcrdr, spx_lsp_t *freq, int nb, spx_word16_t delta, char *stack);
57 void lsp_to_lpc(spx_lsp_t *freq, spx_coef_t *ak, int lpcrdr, char *stack);
|
| /external/valgrind/memcheck/tests/solaris/ |
| execx.stderr.exp | 3 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| /external/valgrind/none/tests/linux/ |
| stack-overflow.stderr.exp | 2 Stack overflow in thread #1: can't grow stack to 0x........
6 Stack overflow in thread #1: can't grow stack to 0x........
7 at 0x........: main (stack-overflow.c:5)
8 If you believe this happened as a result of a stack
11 main thread stack using the --main-stacksize= flag.
12 The main thread stack size used in this run was ....
|
| /external/valgrind/none/tests/solaris/ |
| stack-overflow.stderr.exp | 2 Stack overflow in thread #1: can't grow stack to 0x........
6 Stack overflow in thread #1: can't grow stack to 0x........
7 at 0x........: main (stack-overflow.c:5)
8 If you believe this happened as a result of a stack
11 main thread stack using the --main-stacksize= flag.
12 The main thread stack size used in this run was ....
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| push_rv.pass.cpp | 10 // <stack>
14 #include <stack>
22 std::stack<MoveOnly> q;
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/hppa/parse/ |
| procbug.s | 6 divu: stws,ma %r4,4(%r5) ; save registers on stack
13 divu2: stws,ma %r4,4(%r5) ; save registers on stack
|
| /external/v8/test/mjsunit/ |
| stack-traces-overflow.js | 28 // Flags: --stack-size=100
31 var a, b, c, d, e; // Allocates some locals on the function's stack frame.
38 // Test stack trace has correct function location at top of the stack.
42 var first_frame = e.stack.split("\n")[1]
43 assertTrue(first_frame.indexOf("stack-traces-overflow.js:30:18") > 0);
46 // Test stack trace getter and setter.
50 assertTrue(e.stack.indexOf("rec1") > 0);
51 e.stack = "123";
52 assertEquals("123", e.stack);
[all...] |
| /external/valgrind/memcheck/tests/linux/ |
| stack_changes.c | 11 // checks that Valgrind notices their stack changes properly.
28 void *stack; local
37 stack = (void *)mmap(0, STACK_SIZE, PROT_READ|PROT_WRITE|PROT_EXEC,
40 if (stack == (void*)-1) {
45 ret = VALGRIND_STACK_REGISTER(stack, stack + STACK_SIZE);
48 uc->uc_stack.ss_sp = stack;
|
| /external/apache-http/src/org/apache/http/impl/client/ |
| ClientParamsStack.java | 42 * Represents a stack of parameter collections.
43 * When retrieving a parameter, the stack is searched in a fixed order
44 * and the first match returned. Setting parameters via the stack is
45 * not supported. To minimize overhead, the stack has a fixed size and
47 * The supported stack entries, sorted by increasing priority, are:
69 * Each stack entry may be <code>null</code>. That is preferable over
101 * Creates a new parameter stack from elements.
120 * Creates a copy of a parameter stack.
121 * The new stack will have the exact same entries as the argument stack
[all...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/tic6x/ |
| unwind-bad-2.l | 2 [^:]*:8: Error: stack pointer offset too large for personality routine
3 [^:]*:20: Error: stack frame layout does not match personality routine
4 [^:]*:33: Error: stack frame layout does not match personality routine
12 [^:]*:91: Error: unwound stack pointer not doubleword aligned
13 [^:]*:100: Error: stack frame layout too complex for unwinder
|
| /external/elfutils/libdwfl/ |
| frame_unwind.c | 39 /* Maximum number of DWARF expression stack slots before returning an error. */
111 do_push (struct eval_stack *stack, Dwarf_Addr val)
113 if (stack->used >= DWARF_EXPR_STACK_MAX)
118 if (stack->used == stack->allocated)
120 stack->allocated = MAX (stack->allocated * 2, 32);
122 new_addrs = realloc (stack->addrs,
123 stack->allocated * sizeof (*stack->addrs))
160 struct eval_stack stack = local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| NamespaceMappings.java | 31 * prefix/uri/depth triplets are pushed on a stack pushed on a stack. The depth
47 * "def" is pushed on the stack with depth 1.
52 * stack. Of course popNamespaces(2) would pop anything with depth 2 or
55 * So prefix/uri pairs are pushed and poped off the stack as elements are
57 * are on the stack and a prefix can be found given a uri, or a uri can be found
73 * Each entry (prefix) in this hashtable points to a Stack of URIs
74 * This table maps a prefix (String) to a Stack of NamespaceNodes.
75 * All Namespace nodes in that retrieved stack have the same prefix,
76 * though possibly different URI's or depths. Such a stack must hav
119 Stack stack; local
141 final Stack stack = getPrefixStack(prefix); local
152 final Stack stack = (Stack) m_namespaces.get(prefix); local
210 Stack stack; local
233 Stack stack; local
[all...] |
| /external/compiler-rt/lib/asan/tests/ |
| asan_noinst_test.cc | 137 BufferedStackTrace stack; local
138 stack.trace_buffer[0] = 0x890;
139 stack.size = 1;
142 void *p = __asan::asan_malloc(size, &stack);
143 __asan::asan_free(p, &stack, __asan::FROM_MALLOC);
147 void *p1 = __asan::asan_malloc(size, &stack);
148 __asan::asan_free(p1, &stack, __asan::FROM_MALLOC);
158 BufferedStackTrace stack; local
159 stack.trace_buffer[0] = 0x890;
160 stack.size = 1
185 BufferedStackTrace stack; local
238 BufferedStackTrace stack; local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| TreeTraverser.java | 85 private final Deque<Iterator<T>> stack;
88 this.stack = new ArrayDeque<Iterator<T>>();
89 stack.addLast(Iterators.singletonIterator(checkNotNull(root)));
94 return !stack.isEmpty();
99 Iterator<T> itr = stack.getLast(); // throws NSEE if empty
102 stack.removeLast();
106 stack.addLast(childItr);
145 private final ArrayDeque<PostOrderNode<T>> stack;
148 this.stack = new ArrayDeque<PostOrderNode<T>>();
149 stack.addLast(expand(root))
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeTraverser.java | 77 private final LinkedList<Iterator<T>> stack;
80 this.stack = Lists.newLinkedList();
81 stack.addLast(Iterators.singletonIterator(checkNotNull(root)));
86 return !stack.isEmpty();
91 Iterator<T> itr = stack.getLast(); // throws NSEE if empty
94 stack.removeLast();
98 stack.addLast(childItr);
137 private final LinkedList<PostOrderNode<T>> stack;
140 this.stack = Lists.newLinkedList();
141 stack.addLast(expand(root))
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
| FrameNode.java | 41 * A node that represents a stack map frame. These nodes are pseudo instruction
46 * The stack map frame types must describe the values of the local variables and
47 * of the operand stack elements <i>just before</i> <b>i</b> is executed. <br>
64 * The types of the local variables of this stack map frame. Elements of
72 * The types of the operand stack elements of this stack map frame. Elements
77 public List stack;
field in class:FrameNode
91 * @param nLocal number of local variables of this stack map frame.
92 * @param local the types of the local variables of this stack map frame.
96 * @param nStack number of operand stack elements of this stack map frame.
[all...] |
