HomeSort by relevance Sort by last modified time
    Searched refs:stack (Results 751 - 775 of 2692) sorted by null

<<31323334353637383940>>

  /external/chromium_org/third_party/mesa/src/src/mesa/program/
register_allocate.c 40 * pushed on a stack and removed (with its edges) from the graph.
44 * stack, their edges restored, and assigned a color different from
45 * their neighbors. Because they were pushed on the stack only when
132 * Set when the node is in the trivially colorable stack. When
153 unsigned int *stack; member in struct:ra_graph
314 g->stack = rzalloc_array(g, unsigned int, count);
364 * trivially-colorable nodes into a stack of nodes to be colored,
385 g->stack[g->stack_count] = i;
402 * Pops nodes from the stack back into the graph, coloring them with
415 int n = g->stack[g->stack_count - 1]
    [all...]
  /external/chromium_org/third_party/ots/src/
cff_type2_charstring.cc 13 #include <stack>
36 std::stack<int32_t> *argument_stack,
125 std::stack<int32_t> *argument_stack,
291 // The first stack-clearing operator should be one of hstem, hstemhm,
482 // whether |N| is smaller than the current stack depth or not.
610 // argument_stack: The stack which an operator in |char_string| operates.
620 std::stack<int32_t> *argument_stack,
770 std::stack<int32_t> argument_stack;
  /external/chromium_org/tools/mac/
symbolicate_crash.py 66 """Symbolicates a crash report stack trace."""
94 # Attaches a list of symbol names to stack frames. This assumes that the
104 # dictionary until the first thread stack is reached.
122 # thread stack heading has been read past. Seek backwards from the current
128 """Parses the stack dump of a crash report and creates a list of threads
129 and their stack traces."""
130 # Compile a regex that matches the start of a thread stack. Note that this
132 # right after all the stack traces.
141 # Check for start of the thread stack.
145 # A blank line indicates a break in the thread stack
    [all...]
  /external/libffi/src/x86/
ffi64.c 174 /* If the struct is larger than 16 bytes, pass it on the stack. */
314 not, add it's size to the stack byte count. */
347 char *stack, *argp; local
365 stack = alloca (sizeof (struct register_args) + cif->bytes + 4*8);
366 reg_args = (struct register_args *) stack;
367 argp = stack + sizeof (struct register_args);
391 /* Stack arguments are *always* at least 8 byte aligned. */
430 ffi_call_unix64 (stack, cif->bytes + sizeof (struct register_args),
521 /* Stack arguments are *always* at least 8 byte aligned. */
win32.S 57 # Return stack to previous state and call the function
60 # FIXME: Align the stack to a 128-bit boundary to avoid
170 # Return stack to previous state and call the function
173 # FIXME: Align the stack to a 128-bit boundary to avoid
178 # stdcall functions pop arguments off the stack themselves
269 leal 12(%ebp), %edx /* account for stub return address on stack */
  /external/mesa3d/src/mesa/program/
register_allocate.c 40 * pushed on a stack and removed (with its edges) from the graph.
44 * stack, their edges restored, and assigned a color different from
45 * their neighbors. Because they were pushed on the stack only when
132 * Set when the node is in the trivially colorable stack. When
153 unsigned int *stack; member in struct:ra_graph
314 g->stack = rzalloc_array(g, unsigned int, count);
364 * trivially-colorable nodes into a stack of nodes to be colored,
385 g->stack[g->stack_count] = i;
402 * Pops nodes from the stack back into the graph, coloring them with
415 int n = g->stack[g->stack_count - 1]
    [all...]
  /packages/apps/Browser/src/com/android/browser/
PieControl.java 152 PieStackView stack = new PieStackView(mActivity); local
153 stack.setLayoutListener(new OnLayoutListener() {
159 stack.setOnCurrentListener(mTabAdapter);
160 stack.setAdapter(mTabAdapter);
161 mShowTabs.setPieView(stack);
  /external/chromium_org/third_party/jinja2/
lexer.py 555 stack = ['root']
558 stack.append(state + '_begin')
561 statetokens = self.rules[stack[-1]]
647 stack.pop()
652 stack.append(key)
661 stack.append(new_state)
662 statetokens = self.rules[stack[-1]]
663 # we are still at the same position and no stack change.
668 'stack change' % regex)
  /external/chromium_org/third_party/openssl/openssl/ssl/
ssl_cert.c 665 * Load CA certs from a file into a ::STACK. Note that it is somewhat misnamed;
667 * for a stack of CAs is to send it to the client). Actually, it doesn't have
670 * \return a ::STACK containing the certs.
734 * Add a file of certs to a stack.
735 * \param stack the stack to add to.
737 * already in the stack will be added.
739 * certs may have been added to \c stack.
742 int SSL_add_file_cert_subjects_to_stack(STACK_OF(X509_NAME) *stack,
751 oldcmp=sk_X509_NAME_set_cmp_func(stack,xname_cmp)
    [all...]
  /external/libffi/src/mips/
n32.S 79 SUBU $sp, $sp, v0 # move the stack pointer to reflect the
88 # Copy the stack pointer to t9
91 # Fix the stack if there are more than 8 64bit slots worth
311 ADDU $sp, SIZEOF_FRAME # Fix stack pointer
318 ($12). Stores any arguments passed in registers onto the stack,
322 Stack layout:
387 # fit in registers, then they were stored on the stack.
502 .uleb128 SIZEOF_FRAME # adjust stack.by SIZEOF_FRAME
524 .uleb128 SIZEOF_FRAME2 # adjust stack.by SIZEOF_FRAME
  /external/openssl/ssl/
ssl_cert.c 645 * Load CA certs from a file into a ::STACK. Note that it is somewhat misnamed;
647 * for a stack of CAs is to send it to the client). Actually, it doesn't have
650 * \return a ::STACK containing the certs.
714 * Add a file of certs to a stack.
715 * \param stack the stack to add to.
717 * already in the stack will be added.
719 * certs may have been added to \c stack.
722 int SSL_add_file_cert_subjects_to_stack(STACK_OF(X509_NAME) *stack,
731 oldcmp=sk_X509_NAME_set_cmp_func(stack,xname_cmp)
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
gettext.py 110 stack = ['']
113 stack.append('')
115 if len(stack) == 1:
120 s = expr.sub(repl, stack.pop())
121 stack[-1] += '(%s)' % s
123 stack[-1] += c
124 plural = expr.sub(repl, stack.pop())
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
gettext.py 110 stack = ['']
113 stack.append('')
115 if len(stack) == 1:
120 s = expr.sub(repl, stack.pop())
121 stack[-1] += '(%s)' % s
123 stack[-1] += c
124 plural = expr.sub(repl, stack.pop())
  /external/chromium_org/v8/test/mjsunit/tools/
profile.js 32 function stackToString(stack) {
33 return stack.join(' -> ');
88 // Stack looks like this: [pc, caller, ..., main].
191 var stack = stackToString(path);
192 assertNotNull(node, 'node not found: ' + stack);
193 assertEquals(selfTicks, node.selfWeight, 'self of ' + stack);
194 assertEquals(totalTicks, node.totalWeight, 'total of ' + stack);
243 // Only count each function in the stack once.
  /external/speex/libspeex/
filters.c 319 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)
339 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)
359 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)
379 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)
386 iir_mem16(xx, ak, y, N, ord, mem, stack);
389 filter_mem16(y, awk1, awk2, y, N, ord, mem, stack);
391 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)
398 filter_mem16(xx, ak, awk1, y, N, ord, mem, stack);
401 fir_mem16(y, awk2, y, N, ord, mem, stack);
406 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)
    [all...]
  /external/v8/test/mjsunit/tools/
profile.js 32 function stackToString(stack) {
33 return stack.join(' -> ');
88 // Stack looks like this: [pc, caller, ..., main].
191 var stack = stackToString(path);
192 assertNotNull(node, 'node not found: ' + stack);
193 assertEquals(selfTicks, node.selfWeight, 'self of ' + stack);
194 assertEquals(totalTicks, node.totalWeight, 'total of ' + stack);
243 // Only count each function in the stack once.
  /external/valgrind/main/none/tests/
cmdline2.stdout.exp 37 --num-callers=<number> show <number> callers in stack traces [12]
40 --show-below-main=no|yes continue stack traces below main() [no]
47 --max-stackframe=<number> assume stack switch for SP changes larger
49 --main-stacksize=<number> set size of main thread's stack (in bytes)
64 --smc-check=none|stack|all|all-non-file [stack]
68 --read-var-info=yes|no read debug info on stack and global variables
  /external/libvpx/libvpx/vp8/common/arm/neon/
vp8_subpixelvariance16x16_neon.asm 24 ; stack(r4) unsigned char *dst_ptr,
25 ; stack(r5) int dst_pixels_per_line,
26 ; stack(r6) unsigned int *sse
36 ldr r4, [sp, #16] ;load *dst_ptr from stack
37 ldr r5, [sp, #20] ;load dst_pixels_per_line from stack
38 ldr r6, [sp, #24] ;load *sse from stack
51 sub sp, sp, #272 ;reserve space on stack for temporary storage
242 sub sp, sp, #528 ;reserve space on stack for temporary storage
311 sub sp, sp, #528 ;reserve space on stack for temporary storage
  /external/chromium_org/native_client_sdk/src/libraries/xray/
xray.c 93 struct XRayTraceStackEntry stack[XRAY_TRACE_STACK_SIZE] XRAY_ALIGN64;
331 struct XRayTraceStackEntry* se = &capture->stack[depth];
358 struct XRayTraceStackEntry* se = &capture->stack[depth];
425 struct XRayTraceStackEntry* se = &capture->stack[depth];
457 struct XRayTraceStackEntry* se = &capture->stack[depth];
493 memset(&capture->stack, 0,
494 sizeof(capture->stack[0]) * XRAY_TRACE_STACK_SIZE);
499 /* Change the maximum stack depth captures are made. */
605 /* The trace stack[0] is reserved */
606 memset(&capture->stack[0], 0, sizeof(capture->stack[0]))
    [all...]
  /external/chromium_org/third_party/freetype/src/psaux/
t1decode.c 377 /* compute random seed from stack address of parameter */
387 decoder->top = decoder->stack;
437 FT_TRACE5(( " (%d)", decoder->top - decoder->stack ));
651 /* Push value on stack, or process operator */
656 if ( top - decoder->stack >= T1_MAX_CHARSTRINGS_OPERANDS )
658 FT_ERROR(( "t1_decoder_parse_charstrings: stack overflow\n" ));
683 if ( top - decoder->stack < 2 )
693 /* remove all operands to callothersubr from the stack */
696 /* arguments, we increase the stack by the value of */
700 /* stack pointer as necessary *
    [all...]
  /external/freetype/src/psaux/
t1decode.c 383 /* compute random seed from stack address of parameter */
393 decoder->top = decoder->stack;
443 FT_TRACE5(( " (%d)", decoder->top - decoder->stack ));
657 /* Push value on stack, or process operator */
662 if ( top - decoder->stack >= T1_MAX_CHARSTRINGS_OPERANDS )
664 FT_ERROR(( "t1_decoder_parse_charstrings: stack overflow\n" ));
689 if ( top - decoder->stack < 2 )
699 /* remove all operands to callothersubr from the stack */
702 /* arguments, we increase the stack by the value of */
706 /* stack pointer as necessary *
    [all...]
  /external/nist-sip/java/gov/nist/javax/sip/
SipProviderImpl.java 39 import gov.nist.javax.sip.stack.HopImpl;
40 import gov.nist.javax.sip.stack.MessageChannel;
41 import gov.nist.javax.sip.stack.SIPClientTransaction;
42 import gov.nist.javax.sip.stack.SIPDialog;
43 import gov.nist.javax.sip.stack.SIPDialogErrorEvent;
44 import gov.nist.javax.sip.stack.SIPDialogEventListener;
45 import gov.nist.javax.sip.stack.SIPServerTransaction;
46 import gov.nist.javax.sip.stack.SIPTransaction;
47 import gov.nist.javax.sip.stack.SIPTransactionErrorEvent;
48 import gov.nist.javax.sip.stack.SIPTransactionEventListener
    [all...]
  /external/chromium_org/v8/test/cctest/
test-profile-generator.cc 468 sample1.stack[0] = ToAddress(0x1510);
474 sample2.stack[0] = ToAddress(0x1780);
475 sample2.stack[1] = ToAddress(0x10000); // non-existent.
476 sample2.stack[2] = ToAddress(0x1620);
482 sample3.stack[0] = ToAddress(0x1910);
483 sample3.stack[1] = ToAddress(0x1610);
533 sample1.stack[0] = ToAddress(0x1510);
538 sample2.stack[0] = ToAddress(0x1780);
539 sample2.stack[1] = ToAddress(0x10000); // non-existent.
540 sample2.stack[2] = ToAddress(0x1620)
    [all...]
  /external/libvorbis/lib/
psy.c 454 long stack=0; local
459 if(stack<2){
460 posstack[stack]=i;
461 ampstack[stack++]=seeds[i];
464 if(seeds[i]<ampstack[stack-1]){
465 posstack[stack]=i;
466 ampstack[stack++]=seeds[i];
469 if(i<posstack[stack-1]+linesper){
470 if(stack>1 && ampstack[stack-1]<=ampstack[stack-2] &
    [all...]
  /frameworks/base/tools/aapt/
XMLNode.cpp     [all...]

Completed in 1169 milliseconds

<<31323334353637383940>>