| /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);
|
| 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/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...] |
| /libcore/luni/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/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/sources/android/stlport/test/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);
|
| /external/chromium/base/ |
| at_exit.h | 8 #include <stack>
21 // AtExitManager object on the stack:
33 // AtExitManagers are kept on a global stack, and it will be removed during
63 std::stack<CallbackAndParam> stack_;
64 AtExitManager* next_manager_; // Stack of managers to allow shadowing.
|
| /external/grub/docs/ |
| boot.S | 53 /* Initialize the stack pointer. */
54 movl $(stack + STACK_SIZE), %esp
78 /* Our stack area. */
79 .comm stack, STACK_SIZE
|
| boot.S.texi | 53 /* @r{Initialize the stack pointer.} */
54 movl $(stack + STACK_SIZE), %esp
78 /* @r{Our stack area.} */
79 .comm stack, STACK_SIZE
|
| /external/nist-sip/java/gov/nist/javax/sip/ |
| DefaultAddressResolver.java | 34 import gov.nist.javax.sip.stack.HopImpl;
35 import gov.nist.javax.sip.stack.MessageProcessor;
44 * some address that cannot be resolved you should register an AddressResolver with the stack.
|
| EventWrapper.java | 28 import gov.nist.javax.sip.stack.*;
|
| /bionic/libc/kernel/arch-arm/asm/ |
| smp.h | 31 void *stack; member in struct:secondary_data
|
| /dalvik/vm/mterp/x86/ |
| OP_REM_DOUBLE.S | 5 fldl (rFP,%ecx,4) # vCC to fp stack
6 fldl (rFP,%eax,4) # vCC to fp stack
|
| OP_REM_DOUBLE_2ADDR.S | 5 fldl (rFP,rINST_FULL,4) # vBB to fp stack
7 fldl (rFP,%ecx,4) # vAA to fp stack
|
| OP_REM_FLOAT.S | 5 flds (rFP,%ecx,4) # vCC to fp stack
6 flds (rFP,%eax,4) # vCC to fp stack
|
| OP_REM_FLOAT_2ADDR.S | 5 flds (rFP,rINST_FULL,4) # vBB to fp stack
7 flds (rFP,%ecx,4) # vAA to fp stack
|
| /development/ndk/platforms/android-3/arch-arm/include/asm/ |
| smp.h | 31 void *stack; member in struct:secondary_data
|
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| SIPDialogErrorEvent.java | 16 package gov.nist.javax.sip.stack;
|
| SIPTransactionErrorEvent.java | 26 package gov.nist.javax.sip.stack;
|
| ServerResponseInterface.java | 29 package gov.nist.javax.sip.stack;
39 * This is implemented by the application. The stack calls the message
|
| StackMessageFactory.java | 29 package gov.nist.javax.sip.stack;
34 * by the application and called by the stack for processing requests
35 * and responses. When a Request comes in off the wire, the stack calls
37 * When a response comes off the wire, the stack calls newSIPServerResponse
61 * Generate a new server response for the stack.
|
