| /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
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| push_rv.pass.cpp | 10 // <stack>
14 #include <stack>
22 std::stack<MoveOnly> q;
|
| /external/lldb/source/Expression/ |
| DWARFExpression.cpp | 333 case DW_OP_pick: s->Printf("DW_OP_pick(0x%2.2x) ", m_data.GetU8(&offset)); break; // 0x15 1 1-byte stack index
594 // case DW_OP_APPLE_assign: // 0xF1 - pops value off and assigns it to second item on stack (2nd item must have assignable context)
597 // case DW_OP_APPLE_address_of: // 0xF2 - gets the address of the top stack item (top item must be a variable, or have value_type that is an address already)
600 // case DW_OP_APPLE_value_of: // 0xF3 - pops the value off the stack and pushes the value of that object (top item must be a variable, or expression local)
603 // case DW_OP_APPLE_deref_type: // 0xF4 - gets the address of the top stack item (top item must be a variable, or a clang type)
1311 std::vector<Value> stack; local
[all...] |
| /external/chromium-trace/trace-viewer/src/cc/ |
| layer_tree_quad_stack_viewer.css | 7 layer-tree-quad-stack-viewer > top-controls {
19 layer-tree-quad-stack-viewer > quad-stack-viewer {
|
| /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...] |
| /external/compiler-rt/lib/asan/tests/ |
| asan_noinst_test.cc | 143 StackTrace stack; local
144 stack.trace[0] = 0x890;
145 stack.size = 1;
148 void *p = __asan::asan_malloc(size, &stack);
149 __asan::asan_free(p, &stack, __asan::FROM_MALLOC);
153 void *p1 = __asan::asan_malloc(size, &stack);
154 __asan::asan_free(p1, &stack, __asan::FROM_MALLOC);
164 StackTrace stack; local
165 stack.trace[0] = 0x890;
166 stack.size = 1
191 StackTrace stack; local
244 StackTrace stack; local
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
| FrameNode.java | 41 * A node that represents a stack map frame. These nodes are pseudo instruction
46 * The stack map frame types must describe the values of the local variables and
47 * of the operand stack elements <i>just before</i> <b>i</b> is executed. <br>
64 * The types of the local variables of this stack map frame. Elements of
72 * The types of the operand stack elements of this stack map frame. Elements
77 public List stack;
field in class:FrameNode
91 * @param nLocal number of local variables of this stack map frame.
92 * @param local the types of the local variables of this stack map frame.
96 * @param nStack number of operand stack elements of this stack map frame.
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| stack-traces-overflow.js | 32 // Test stack trace getter and setter.
36 assertTrue(e.stack.indexOf("rec1") > 0);
37 e.stack = "123";
38 assertEquals("123", e.stack);
45 assertTrue(e.stack.indexOf("rec2") > 0);
46 assertTrue(e.stack.indexOf("rec3") > 0);
47 e.stack = "123";
48 assertEquals("123", e.stack);
55 assertTrue(e.stack.indexOf("rec1") > 0);
60 // Check setting/getting stack property on the prototype chain
[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...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| parse.py | 104 # Each stack entry is a tuple: (dfa, state, node).
109 self.stack = [stackentry]
119 dfa, state, node = self.stack[-1]
134 if not self.stack:
137 dfa, state, node = self.stack[-1]
153 if not self.stack:
177 dfa, state, node = self.stack[-1]
182 self.stack[-1] = (dfa, newstate, node)
186 dfa, state, node = self.stack[-1]
188 self.stack[-1] = (dfa, newstate, node
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| parse.py | 104 # Each stack entry is a tuple: (dfa, state, node).
109 self.stack = [stackentry]
119 dfa, state, node = self.stack[-1]
134 if not self.stack:
137 dfa, state, node = self.stack[-1]
153 if not self.stack:
177 dfa, state, node = self.stack[-1]
182 self.stack[-1] = (dfa, newstate, node)
186 dfa, state, node = self.stack[-1]
188 self.stack[-1] = (dfa, newstate, node
[all...] |
| /external/llvm/tools/llvm-c-test/ |
| calc.c | 45 LLVMValueRef stack[MAX_DEPTH]; local
60 printf("stack underflow\n");
64 stack[depth - 2] = LLVMBuildBinOp(builder, op_to_opcode(tok),
65 stack[depth - 1], stack[depth - 2], "");
74 printf("stack underflow\n");
78 off = LLVMBuildGEP(builder, param, &stack[depth - 1], 1, "");
79 stack[depth - 1] = LLVMBuildLoad(builder, off, "");
93 printf("stack overflow\n");
97 stack[depth++] = LLVMConstInt(LLVMInt64Type(), val, 1)
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| StreamUtil.java | 101 byte[] stack = new byte[5];
102 int pos = stack.length;
104 stack[--pos] = (byte)(tagNo & 0x7F);
109 stack[--pos] = (byte)(tagNo & 0x7F | 0x80);
113 length += stack.length - pos;
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_report.h | 60 ReportStack *stack; member in struct:__tsan::ReportMop
85 ReportStack *stack; member in struct:__tsan::ReportLocation
94 ReportStack *stack; member in struct:__tsan::ReportThread
101 ReportStack *stack; member in struct:__tsan::ReportMutex
126 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/libxml2/ |
| timsort.h | 295 static int CHECK_INVARIANT(TIM_SORT_RUN_T *stack, const int stack_curr)
301 const int64_t A1 = stack[stack_curr - 2].length;
302 const int64_t B1 = stack[stack_curr - 1].length;
306 A = stack[stack_curr - 3].length;
307 B = stack[stack_curr - 2].length;
308 C = stack[stack_curr - 1].length;
334 static void TIM_SORT_MERGE(SORT_TYPE *dst, const TIM_SORT_RUN_T *stack, const int stack_curr, TEMP_STORAGE_T *store)
336 const int64_t A = stack[stack_curr - 2].length;
337 const int64_t B = stack[stack_curr - 1].length;
338 const int64_t curr = stack[stack_curr - 2].start
[all...] |
| /external/chromium_org/chrome/browser/resources/extensions/ |
| extension_error_overlay.css | 36 .extension-error-overlay-stack-trace-list {
41 .extension-error-overlay-stack-trace summary {
47 .extension-error-overlay-stack-trace summary::-webkit-details-marker {
51 .extension-error-overlay-stack-trace-list li {
59 .extension-error-overlay-stack-trace-list li:hover {
63 .extension-error-overlay-stack-trace-list li.extension-error-active {
|
| /external/chromium_org/ui/base/x/ |
| x11_menu_list.cc | 42 void XMenuList::InsertMenuWindowXIDs(std::vector<XID>* stack) {
43 stack->insert(stack->begin(), menus_.begin(), menus_.end());
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_stackdepot.h | 21 // StackDepot efficiently stores huge amounts of stack traces.
32 uptr *stack();
38 u32 StackDepotPut(const uptr *stack, uptr size);
39 StackDepotHandle StackDepotPut_WithHandle(const uptr *stack, uptr size);
40 // Retrieves a stored stack trace by the id.
45 // StackDepot, but the snapshot is only guaranteed to contain those stack traces
|
| /external/libcxx/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;
|
