| /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...] |
| /external/chromium-trace/trace-viewer/src/ui/ |
| quad_stack_test.js | 25 var stack = new ui.QuadStack();
28 stack.initialize(quadsBbox.asRect(), deviceViewportSizeForFrame);
29 stack.quads = quads;
30 stack.style.border = '1px solid black';
32 this.addHTMLOutput(stack);
34 assertEquals(stack.worldViewportRect.width, 200);
35 assertEquals(stack.worldViewportRect.height, 100);
36 assertNotUndefined(stack.viewport);
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-crbug-393988.js | 7 Object.defineProperty(o, "stack", { value: 1 });
8 assertEquals(1, o.stack);
|
| /external/libunwind/src/hppa/ |
| siglongjmp.S | 14 /* We do not need executable stack. */
15 .section .note.GNU-stack,"",@progbits
|
| /external/strace/test/ |
| clone.c | 17 char stack[4096]; local
18 clone(child, stack+4000, CLONE_VM|CLONE_FS|CLONE_FILES, NULL);
|
| /external/compiler-rt/lib/asan/ |
| asan_stack.h | 24 // Get the stack trace with the given pc and bp.
25 // The pc will be in the position 0 of the resulting stack trace.
28 void GetStackTraceWithPcBpAndContext(StackTrace *stack, uptr max_depth, uptr pc,
31 stack->Unwind(max_depth, pc, bp, context, 0, 0, fast);
34 stack->size = 0;
40 stack->Unwind(max_depth, pc, bp, context, stack_top, stack_bottom, fast);
43 stack->Unwind(max_depth, pc, bp, context, 0, 0, false);
51 // NOTE: A Rule of thumb is to retrieve stack trace in the interceptors
53 // don't want stack trace to contain functions from ASan internals.
56 StackTrace stack; \
[all...] |
| /external/libcxx/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...] |
| /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++/libcxx/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/pcre/dist/sljit/ |
| sljitUtils.c | 2 * Stack-less Just-In-Time compiler
148 /* Stack */
205 struct sljit_stack *stack; local
235 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack));
236 if (!stack)
242 SLJIT_FREE(stack);
245 stack->base = base.uw;
246 stack->limit = stack->base;
247 stack->max_limit = stack->base + max_limit
[all...] |
| /external/chromium_org/v8/src/ |
| regexp-stack.h | 13 // Maintains a per-v8thread stack area that can be used by irregexp
14 // implementation for its backtracking stack.
15 // Since there is only one stack area, the Irregexp implementation is not
20 // Create and delete an instance to control the life-time of a growing stack.
22 // Initializes the stack memory area if necessary.
24 ~RegExpStackScope(); // Releases the stack if it has grown.
26 RegExpStack* stack() const { return regexp_stack_; } function in class:v8::internal::RegExpStackScope
37 // Number of allocated locations on the stack below the limit.
38 // No sequence of pushes must be longer that this without doing a stack-limit
42 // Gives the top of the memory used as stack
[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/chromium_org/third_party/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...] |
| /system/core/include/utils/ |
| CallStack.h | 32 // Collect/print the call stack (function, file, line) traces for a single thread.
35 // Create an empty call stack. No-op.
37 // Create a callstack with the current thread's stack trace.
42 // Reset the stack frames (same as creating an empty call stack).
45 // Immediately collect the stack traces for the specified thread.
46 // The default is to dump the stack of the current call.
49 // Dump a stack trace to the log using the supplied logtag.
54 // Dump a stack trace to the specified file descriptor.
57 // Return a string (possibly very long) containing the complete stack trace
[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/chromium_org/chrome/third_party/chromevox/third_party/closure-library/closure/goog/debug/ |
| error.js | 17 * stack is correctly maintained.
36 // Attempt to ensure there is a stack trace.
40 var stack = new Error().stack;
41 if (stack) {
42 this.stack = stack;
|
| /external/chromium_org/third_party/opus/src/celt/ |
| stack_alloc.h | 5 @brief Temporary memory allocation on stack
55 * @def ALIGN(stack, size)
57 * Aligns the stack to a 'size' boundary
59 * @param stack Stack
64 * @def PUSH(stack, size, type)
66 * Allocates 'size' elements of type 'type' on the stack
68 * @param stack Stack
76 * Declare variable on 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/libopus/celt/ |
| stack_alloc.h | 5 @brief Temporary memory allocation on stack
55 * @def ALIGN(stack, size)
57 * Aligns the stack to a 'size' boundary
59 * @param stack Stack
64 * @def PUSH(stack, size, type)
66 * Allocates 'size' elements of type 'type' on the stack
68 * @param stack Stack
76 * Declare variable on stack
[all...] |
| /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;
|
| /external/clang/test/CodeGenCXX/ |
| split-stacks.cpp | 1 // RUN: %clang -target x86_64-linux-gnu -fsplit-stack -S -std=c++11 %s -emit-llvm -o - | FileCheck -check-prefix=CHECK-SEGSTK %s
22 // CHECK-SEGSTK-NOT: [[NSS1]] = { {{.*}} "split-stack" {{.*}} }
23 // CHECK-SEGSTK-NOT: [[NSS2]] = { {{.*}} "split-stack" {{.*}} }
24 // CHECK-SEGSTK: [[SS]] = { {{.*}} "split-stack" {{.*}} }
25 // CHECK-SEGSTK-NOT: [[NSS1]] = { {{.*}} "split-stack" {{.*}} }
26 // CHECK-SEGSTK-NOT: [[NSS2]] = { {{.*}} "split-stack" {{.*}} }
31 // CHECK-NOSEGSTK-NOT: [[NSS1]] = { {{.*}} "split-stack" {{.*}} }
32 // CHECK-NOSEGSTK-NOT: [[NSS2]] = { {{.*}} "split-stack" {{.*}} }
33 // CHECK-NOSEGSTK-NOT: [[NSS3]] = { {{.*}} "split-stack" {{.*}} }
|
| /external/libcxx/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;
|
