| /prebuilts/ndk/8/platforms/android-4/arch-arm/usr/lib/ |
| crtend_so.o | |
| /prebuilts/ndk/8/platforms/android-5/arch-arm/usr/lib/ |
| crtend_so.o | |
| /prebuilts/ndk/8/platforms/android-8/arch-arm/usr/lib/ |
| crtend_so.o | |
| /prebuilts/ndk/8/platforms/android-9/arch-arm/usr/lib/ |
| crtend_so.o | |
| /prebuilts/ndk/8/platforms/android-9/arch-mips/usr/lib/ |
| crtend_so.o | |
| /prebuilts/ndk/8/platforms/android-9/arch-x86/usr/lib/ |
| crtend_android.o | |
| crtend_so.o | |
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| Frame.java | 19 * Represents the stack frame and local variable table at a particular point in time.
25 private Type[] stack; field in class:Frame
31 * Create a new frame with the specified local variable table size, and max stack size
34 * @param stack the maximum stack size
36 public Frame(int locals, int stack) {
38 this.stack = new Type[stack];
63 * Returns the type on the stack at the specified index.
65 * @param index the position on the stack
[all...] |
| /external/proguard/src/proguard/evaluation/ |
| Stack.java | 26 * This class represents an operand stack that contains <code>Value</code>
31 public class Stack
42 * Creates a new Stack with a given maximum size, accounting for the double
45 public Stack(int maxSize)
52 * Creates a Stack that is a copy of the given Stack.
54 public Stack(Stack stack)
57 this(stack.values.length)
[all...] |
| /external/javassist/src/main/javassist/bytecode/ |
| CodeAnalyzer.java | 33 /* d = stack[i]
40 int[] stack = new int[length]; local
42 initStack(stack, codeAttr);
47 if (stack[i] < 0) {
49 visitBytecode(ci, stack, i);
55 if (stack[i] > maxStack)
56 maxStack = stack[i];
61 private void initStack(int[] stack, CodeAttribute ca) {
62 stack[0] = -1;
67 stack[et.handlerPc(i)] = -2; // an exception is on stac
[all...] |
| /external/srec/srec/crec/ |
| astar.c | 52 int astar_draw_tree_as_dotty(const char* file, srec* rec, AstarStack* stack);
238 void list_free_parps(AstarStack* stack, char* msg);
240 #define list_free_parps(stack,msg)
248 partial_path* make_new_partial_path(AstarStack* stack);
249 /*void free_partial_path(AstarStack* stack, partial_path* parp); put the proto in astar.h */
289 partial_path* extend_path(AstarStack* stack,
383 extended_parp = make_new_partial_path(stack);
421 void check_stack_root_sanity(AstarStack* stack)
423 partial_path* parp1 = stack->root_path;
424 /* append_arc_arriving(stack->root_path, parp); *
524 AstarStack *stack; local
556 AstarStack *stack = rec->astar_stack; local
657 AstarStack *stack = rec->astar_stack; local
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| StackTest.java | 21 import java.util.Stack;
25 Stack s;
28 * java.util.Stack#Stack()
31 // Test for method java.util.Stack()
32 assertEquals("Stack creation failed", 0, s.size());
36 * java.util.Stack#empty()
39 // Test for method boolean java.util.Stack.empty()
40 assertTrue("New stack answers non-empty", s.empty());
42 assertTrue("Stack should not be empty but answers empty", !s.empty())
133 Stack<Object> stack = new Stack<Object>(); local
[all...] |
| /frameworks/base/tools/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/stack/stack.special/ |
| swap.pass.cpp | 10 // <stack>
13 // void swap(stack<T, Container>& x, stack<T, Container>& y);
15 #include <stack>
30 std::stack<int> q1 = make<std::stack<int> >(5);
31 std::stack<int> q2 = make<std::stack<int> >(10);
32 std::stack<int> q1_save = q1;
33 std::stack<int> q2_save = q2
[all...] |
| /external/clang/test/SemaCXX/ |
| return-stack-addr.cpp | 5 return &x; // expected-warning {{address of stack memory}}
10 return x; // expected-warning {{address of stack memory}}
15 return &x[i]; // expected-warning {{address of stack memory}}
20 return &i[x]; // expected-warning {{address of stack memory}}
25 return &x[2]; // expected-warning {{address of stack memory}}
30 return x; // expected-warning {{reference to stack memory}}
35 return &*&x; // expected-warning {{address of stack memory}}
40 return (&(*(&x))); // expected-warning {{address of stack memory}}
45 return &*(&x+1); // expected-warning {{address of stack memory}}
50 return &*(&x+1); // expected-warning {{address of stack memory}
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Stack.java | 21 * {@code Stack} is a Last-In/First-Out(LIFO) data structure which represents a
22 * stack of objects. It enables users to pop to and push from the stack,
23 * including null objects. There is no limit to the size of the stack.
25 public class Stack<E> extends Vector<E> {
30 * Constructs a stack with the default size of {@code Vector}.
32 public Stack() {
36 * Returns whether the stack is empty or not.
38 * @return {@code true} if the stack is empty, {@code false} otherwise.
45 * Returns the element at the top of the stack without removing it
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| ExecutionStack.java | 26 * Representation of a Java method execution stack.
33 /** {@code non-null;} array of stack contents */
34 private final TypeBearer[] stack; field in class:ExecutionStack
37 * {@code non-null;} array specifying whether stack contents have entries
42 * {@code >= 0;} stack pointer (points one past the end) / current stack
50 * @param maxStack {@code >= 0;} the maximum size of the stack for this
55 stack = new TypeBearer[maxStack];
66 ExecutionStack result = new ExecutionStack(stack.length);
68 System.arraycopy(stack, 0, result.stack, 0, stack.length)
[all...] |
| /external/bison/data/ |
| stack.hh | 21 b4_output_begin([b4_dir_prefix[]stack.hh])
22 b4_copyright([Stack handling for Bison parsers in C++],
26 ** \file ]b4_dir_prefix[stack.hh
27 ** Define the ]b4_namespace_ref[::stack class.
30 ]b4_cpp_guard_open([b4_dir_prefix[]stack.hh])[
36 class stack
43 stack () : seq_ ()
47 stack (unsigned int n) : seq_ (n)
94 /// Present a slice of the top of a stack.
95 template <class T, class S = stack<T>
[all...] |
| /external/webkit/Tools/Scripts/webkitpy/common/system/ |
| stack_utils.py | 29 """Simple routines for logging, obtaining thread stack information."""
37 stack = _find_thread_stack(thread_id)
38 assert(stack is not None)
41 _log_stack(logger, stack)
46 """Returns a stack object that can be used to dump a stack trace for
48 for tid, stack in sys._current_frames().items():
50 return stack
54 def _log_stack(logger, stack):
55 """Log a stack trace to the logger callback.""
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| StackTest.java | 21 import java.util.Stack;
25 Stack s;
28 * @tests java.util.Stack#Stack()
31 // Test for method java.util.Stack()
32 assertEquals("Stack creation failed", 0, s.size());
36 * @tests java.util.Stack#empty()
39 // Test for method boolean java.util.Stack.empty()
40 assertTrue("New stack answers non-empty", s.empty());
42 assertTrue("Stack should not be empty but answers empty", !s.empty())
[all...] |
| /cts/tools/dasm/src/java_cup/runtime/ |
| virtual_parse_stack.java | 4 import java.util.Stack;
6 /** This class implements a temporary or "virtual" parse stack that
7 * replaces the top portion of the actual parse stack (the part that
13 * reverts to the original parse stack (which has not actually been
15 * state is maintained on the virtual stack, not full symbol objects.
27 /** Constructor to build a virtual stack out of a real stack. */
28 public virtual_parse_stack(Stack shadowing_stack) throws java.lang.Exception
33 "Internal parser error: attempt to create null virtual stack");
37 vstack = new Stack();
[all...] |
| /external/clang/test/Sema/ |
| pragma-pack-3.c | 4 // Stack: [], Alignment: 8
7 // Stack: [8], Alignment: 1
10 // Stack: [8, 1], Alignment: 4
13 // top stack entry and resets the current alignment. This is both
19 // Stack: [8, 1], Alignment: 8
22 // Stack: [8], Alignment: 1
30 // Stack: [], Alignment: 8
|
| /external/llvm/lib/Target/R600/ |
| AMDGPUFrameLowering.cpp | 10 // Interface to describe a layout of a stack frame on a AMDIL target machine
35 // The StackWidth determines how stack objects are laid out in memory.
36 // For a vector stack variable, like: int4 stack[2], the data will be stored
41 // T0.X = stack[0].x
42 // T1.X = stack[0].y
43 // T2.X = stack[0].z
44 // T3.X = stack[0].w
45 // T4.X = stack[1].x
46 // T5.X = stack[1].
[all...] |
| /external/valgrind/main/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;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/stack/stack.defn/ |
| swap.pass.cpp | 10 // <stack>
12 // void swap(stack& q);
14 #include <stack>
29 std::stack<int> q1 = make<std::stack<int> >(5);
30 std::stack<int> q2 = make<std::stack<int> >(10);
31 std::stack<int> q1_save = q1;
32 std::stack<int> q2_save = q2;
|
