| /external/libffi/src/pa/ |
| ffi.c | 82 /* PA has a downward growing stack, which looks like this:
99 The first four argument words on the stack are reserved for use by
111 The registers are allocated in the same manner as stack slots.
112 This allows the callee to save its arguments on the stack if
123 The rest of the arguments are passed on the stack starting at SP-52,
127 or in the stack. */
129 /* ffi_prep_args is called by the assembly routine once stack space
132 The following code will put everything into the stack frame
140 void ffi_prep_args_pa32(UINT32 *stack, extended_cif *ecif, unsigned bytes)
149 debug(1, "%s: stack = %p, ecif = %p, bytes = %u\n", __FUNCTION__, stack
[all...] |
| /cts/tools/dasm/src/dasm/ |
| parser.java | 812 java.util.Stack stack,
817 return action_obj.CUP$do_action(act_num, parser, stack, top);
[all...] |
| /external/llvm/test/FrontendC/ |
| 2002-12-15-StructParameters.c | 5 void *stack; member in struct:__anon8310
|
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| RawMessageChannel.java | 1 package gov.nist.javax.sip.stack;
|
| SIPStackTimerTask.java | 9 package gov.nist.javax.sip.stack;
31 System.out.println("SIP stack timer task failed due to exception:");
|
| ServerRequestInterface.java | 29 package gov.nist.javax.sip.stack;
35 * This is implemented by the application. The stack calls the message
|
| /external/speex/libspeex/ |
| cb_search.h | 62 char *stack,
72 char *stack,
88 char *stack,
99 char *stack,
|
| lsp_bfin.h | 42 char *stack
|
| vq.h | 45 void vq_nbest(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
47 void vq_nbest_sign(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
49 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
51 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
|
| 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);
|
| filters.h | 61 void qmf_decomp(const spx_word16_t *xx, const spx_word16_t *aa, spx_word16_t *, spx_word16_t *y2, int N, int M, spx_word16_t *mem, char *stack);
62 void qmf_synth(const spx_word16_t *x1, const spx_word16_t *x2, const spx_word16_t *a, spx_word16_t *y, int N, int M, spx_word16_t *mem1, spx_word16_t *mem2, char *stack);
64 void filter_mem16(const spx_word16_t *x, const spx_coef_t *num, const spx_coef_t *den, spx_word16_t *y, int N, int ord, spx_mem_t *mem, char *stack);
65 void iir_mem16(const spx_word16_t *x, const spx_coef_t *den, spx_word16_t *y, int N, int ord, spx_mem_t *mem, char *stack);
66 void fir_mem16(const spx_word16_t *x, const spx_coef_t *num, spx_word16_t *y, int N, int ord, spx_mem_t *mem, char *stack);
73 void syn_percep_zero16(const spx_word16_t *xx, const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_word16_t *y, int N, int ord, char *stack);
74 void residue_percep_zero16(const spx_word16_t *xx, const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_word16_t *y, int N, int ord, char *stack);
76 void compute_impulse_response(const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_word16_t *y, int N, int ord, char *stack);
87 char *stack
|
| ltp.h | 52 void pitch_xcorr(const spx_word16_t *_x, const spx_word16_t *_y, spx_word32_t *corr, int len, int nb_pitch, char *stack);
54 void open_loop_nbest_pitch(spx_word16_t *sw, int start, int end, int len, int *pitch, spx_word16_t *gain, int N, char *stack);
72 char *stack,
93 char *stack,
115 char *stack,
136 char *stack,
|
| /external/valgrind/main/memcheck/tests/ |
| execve2.stderr.exp | 3 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| execve.stderr.exp | 3 Address 0x........ is not stack'd, malloc'd or (recently) free'd
7 Address 0x........ is not stack'd, malloc'd or (recently) free'd
11 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| /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/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
96 * Creates a new parameter stack from elements.
115 * Creates a copy of a parameter stack.
116 * The new stack will have the exact same entries as the argument stack
[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...] |
| /cts/libs/json/src/com/android/json/stream/ |
| JsonWriter.java | 125 private final List<JsonScope> stack = new ArrayList<JsonScope>(); field in class:JsonWriter
127 stack.add(JsonScope.EMPTY_DOCUMENT);
215 stack.add(empty);
228 throw new IllegalStateException("Nesting problem: " + stack);
231 stack.remove(stack.size() - 1);
240 * Returns the value on the top of the stack.
243 return stack.get(stack.size() - 1);
247 * Replace the value on the top of the stack with the given value
[all...] |
| /ndk/build/tools/ |
| build-ndk-stack.sh | 17 # This script is used to rebuild the host 'ndk-stack' tool from the
18 # sources under sources/host-tools/ndk-stack.
20 # Note: The tool is installed under prebuilt/$HOST_TAG/bin/ndk-stack
28 "This script is used to rebuild the host ndk-stack binary program."
40 OUT=$ANDROID_NDK_ROOT/$(get_host_exec_name ndk-stack)
57 BUILD_DIR=$NDK_TMPDIR/build-ndk-stack
73 OUT=$ANDROID_NDK_ROOT/$(get_host_exec_name ndk-stack)
83 PROGNAME=ndk-stack
95 SRCDIR=$ANDROID_NDK_ROOT/sources/host-tools/ndk-stack
|
| /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 | 51 /* The stack layout given to ffi_call_unix and ffi_closure_unix_inner. */
57 UINT64 other_args[]; /* Arguments passed on stack, variable size. */
278 struct ia64_args *stack; local
288 /* Allocate the stack frame. */
289 stack = alloca (cif->bytes);
298 stack->gp_regs[gpcount++] = *(SINT8 *)avalue[i];
301 stack->gp_regs[gpcount++] = *(UINT8 *)avalue[i];
304 stack->gp_regs[gpcount++] = *(SINT16 *)avalue[i];
307 stack->gp_regs[gpcount++] = *(UINT16 *)avalue[i];
310 stack->gp_regs[gpcount++] = *(SINT32 *)avalue[i]
[all...] |
| /external/stlport/test/unit/ |
| stack_test.cpp | 5 #include <stack>
35 stack<int, deque<int> > s;
49 stack<int, list<int> > s;
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| stack_test.cpp | 5 #include <stack>
35 stack<int, deque<int> > s;
49 stack<int, list<int> > s;
|
| /ndk/tests/device/test-stlport/unit/ |
| stack_test.cpp | 5 #include <stack>
35 stack<int, deque<int> > s;
49 stack<int, list<int> > s;
|
| /external/bouncycastle/src/main/java/org/bouncycastle/asn1/ |
| DEROutputStream.java | 69 byte[] stack = new byte[5];
70 int pos = stack.length;
72 stack[--pos] = (byte)(tagNo & 0x7F);
77 stack[--pos] = (byte)(tagNo & 0x7F | 0x80);
81 write(stack, pos, stack.length - pos);
|
