HomeSort by relevance Sort by last modified time
    Searched refs:stack (Results 76 - 100 of 1681) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/speex/libspeex/
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,
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/stack/stack.defn/
push_rv.pass.cpp 10 // <stack>
14 #include <stack>
22 std::stack<MoveOnly> q;
  /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/compiler-rt/lib/asan/
asan_malloc_linux.cc 64 asan_free(ptr, &stack, FROM_MALLOC);
69 asan_free(ptr, &stack, FROM_MALLOC);
74 return asan_malloc(size, &stack);
90 return asan_calloc(nmemb, size, &stack);
95 return asan_realloc(ptr, size, &stack);
100 return asan_memalign(boundary, size, &stack, FROM_MALLOC);
108 return asan_malloc_usable_size(ptr, &stack);
132 return asan_posix_memalign(memptr, alignment, size, &stack);
137 return asan_valloc(size, &stack);
142 return asan_pvalloc(size, &stack);
    [all...]
asan_thread.h 34 void Init(u32 parent_tid, StackTrace *stack) {
38 if (stack) {
39 internal_memcpy(&stack_, stack, sizeof(*stack));
49 StackTrace *stack() { return &stack_; } function in class:__asan::AsanThreadSummary
75 void *arg, StackTrace *stack);
  /external/compiler-rt/lib/msan/
msan_report.cc 63 " in the stack frame of function '%s%s%s'%s\n",
76 static void ReportSummary(const char *error_type, StackTrace *stack) {
77 if (!stack->size || !IsSymbolizerAvailable()) return;
79 uptr pc = StackTrace::GetPreviousInstructionPc(stack->trace[0]);
89 void ReportUMR(StackTrace *stack, u32 origin) {
98 PrintStack(stack->trace, stack->size);
102 ReportSummary("use-of-uninitialized-value", stack);
105 void ReportExpectedUMRNotFound(StackTrace *stack) {
109 PrintStack(stack->trace, stack->size)
    [all...]
  /external/jmonkeyengine/engine/src/core/com/jme3/util/
TempVars.java 56 * <code>TempVarsStack</code> contains a stack of TempVars.
57 * Every time TempVars.get() is called, a new entry is added to the stack,
97 TempVarsStack stack = varsLocal.get(); local
99 TempVars instance = stack.tempVars[stack.index];
106 stack.tempVars[stack.index] = instance;
109 stack.index++;
130 TempVarsStack stack = varsLocal.get(); local
132 // Return it to the 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...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/
StreamUtil.java 94 byte[] stack = new byte[5];
95 int pos = stack.length;
97 stack[--pos] = (byte)(tagNo & 0x7F);
102 stack[--pos] = (byte)(tagNo & 0x7F | 0x80);
106 length += stack.length - pos;
  /external/compiler-rt/lib/tsan/rtl/
tsan_report.h 53 ReportStack *stack; member in struct:__tsan::ReportMop
77 ReportStack *stack; member in struct:__tsan::ReportLocation
86 ReportStack *stack; member in struct:__tsan::ReportThread
92 ReportStack *stack; member in struct:__tsan::ReportMutex
115 void PrintStack(const ReportStack *stack);
  /frameworks/volley/src/com/android/volley/toolbox/
Volley.java 39 * @param stack An {@link HttpStack} to use for the network, or null for default.
42 public static RequestQueue newRequestQueue(Context context, HttpStack stack) {
53 if (stack == null) {
55 stack = new HurlStack();
59 stack = new HttpClientStack(AndroidHttpClient.newInstance(userAgent));
63 Network network = new BasicNetwork(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/llvm/unittests/Support/
ManagedStatic.cpp 30 // Valgrind's leak checker complains glibc's stack allocation.
31 // To appease valgrind, we provide our own stack for each thread.
33 void *stack = malloc(n); local
36 pthread_attr_setstack(&a, stack, n);
38 return stack;
  /external/stlport/test/unit/
stack_test.cpp 5 #include <stack>
35 stack<int, deque<int> > s;
49 stack<int, list<int> > s;
  /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."
56 BUILD_DIR=$NDK_TMPDIR/build-ndk-stack
61 OUT=$NDK_DIR/$(get_host_exec_name ndk-stack)
74 PROGNAME=ndk-stack
86 SRCDIR=$ANDROID_NDK_ROOT/sources/host-tools/ndk-stack
105 ARCHIVE=ndk-stack-$HOST_TAG.tar.bz2
106 SUBDIR=$(get_host_exec_name ndk-stack $HOST_TAG
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/stack/stack.cons.alloc/
ctor_alloc.pass.cpp 10 // <stack>
13 // explicit stack(const Alloc& a);
15 #include <stack>
21 : private std::stack<int, std::deque<int, test_allocator<int> > >
23 typedef std::stack<int, std::deque<int, test_allocator<int> > > base;
ctor_copy_alloc.pass.cpp 10 // <stack>
13 // stack(const stack& q, const Alloc& a);
15 #include <stack>
34 : public std::stack<T, C>
36 typedef std::stack<T, C> base;
  /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;

Completed in 1316 milliseconds

1 2 34 5 6 7 8 91011>>