/external/javassist/src/main/javassist/expr/ |
H A D | ExprEditor.java | 100 context.updateMax(h.locals(), h.stack()); 166 void updateMax(int locals, int stack) { argument 170 if (maxStack < stack) 171 maxStack = stack; 245 context.updateMax(expr.locals(), expr.stack());
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | ReductionRules.h | 159 Solution backpropagate(GraphT& G, StackT stack) { argument 166 while (!stack.empty()) { 167 NodeId NId = stack.back(); 168 stack.pop_back();
|
/external/mesa3d/src/glx/ |
H A D | indirect_vertex_array_priv.h | 306 struct array_stack_state *stack; member in struct:array_state_vector
|
/external/nist-sip/java/gov/nist/javax/sip/stack/ |
H A D | IOHandler.java | 29 package gov.nist.javax.sip.stack; 198 // note that the IP Address for stack may not be 202 // address (i.e. that of the stack). In version 1.2
|
H A D | TCPMessageProcessor.java | 29 package gov.nist.javax.sip.stack; 164 * Returns the stack. 166 * @return my sip stack.
|
H A D | TLSMessageProcessor.java | 41 package gov.nist.javax.sip.stack; 180 * Returns the stack. 182 * @return my sip stack.
|
H A D | UDPMessageProcessor.java | 29 package gov.nist.javax.sip.stack; 54 * stack that were incorporated into this code. Niklas Uhrberg suggested that 95 * pointer to the stack. 298 * Returns the stack. 300 * @return my sip stack.
|
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cff/ |
H A D | cffparse.h | 44 FT_Byte* stack[CFF_MAX_STACK_DEPTH + 1]; member in struct:CFF_ParserRec_
|
/external/proguard/src/proguard/preverify/ |
H A D | CodePreverifier.java | 114 // Collect the stack map frames. 135 // Convert the stack values to types. 149 // Compress the stack map frames if the target is not Java Micro Edition. 207 // Remove any stack map (table) attribute from the code attribute. 221 // Put the frames into a stack map attribute. 230 // Put the frames into a stack map table attribute. 234 // Fill out the name of the stack map attribute. 238 // Add the new stack map (table) attribute to the code attribute. 340 * stack. If necessary, class constants are added to the constant pool 347 TracedStack stack) 343 correspondingVerificationTypes(ProgramClass programClass, ProgramMethod programMethod, CodeAttribute codeAttribute, int offset, TracedStack stack) argument [all...] |
/external/skia/src/gpu/ |
H A D | GrReducedClip.cpp | 17 void reduced_stack_walker(const SkClipStack& stack, 31 void ReduceClipStack(const SkClipStack& stack, argument 43 *resultGenID = stack.getTopmostGenID(); 45 if (stack.isWideOpen()) { 51 // We initially look at whether the bounds alone is sufficient. We also use the stack bounds to 57 stack.getBounds(&stackBounds, &stackBoundsType, &iior); 91 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart); 136 // helper that actually walks the stack. 137 reduced_stack_walker(stack, scalarBounds, result, resultGenID, initialState, requiresAA); 144 void reduced_stack_walker(const SkClipStack& stack, argument [all...] |
/external/skia/tests/ |
H A D | ClipCacheTest.cpp | 71 // create a clip stack that will (trivially) reduce to a single rect that 73 SkClipStack stack; local 74 stack.clipDevRect(clipRect, SkRegion::kReplace_Op, false); 79 stack.getConservativeBounds(0, 0, kXSize, kYSize, 89 clipData.fClipStack = &stack; 102 // verify that the top state of the stack matches the passed in state
|
/external/speex/libspeex/ |
H A D | filters_bfin.h | 85 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) argument 230 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) argument 355 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) argument 363 filter_mem16(x, num, den, y, N, ord, mem, stack); 368 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) argument 438 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)
|
H A D | ltp_arm4.h | 88 void pitch_xcorr(const spx_word16_t *_x, const spx_word16_t *_y, spx_word32_t *corr, int len, int nb_pitch, char *stack) argument
|
H A D | ltp_bfin.h | 66 void pitch_xcorr(const spx_word16_t *_x, const spx_word16_t *_y, spx_word32_t *corr, int len, int nb_pitch, char *stack) argument 157 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) argument 210 pitch_xcorr(sw, sw-end, corr, len, end-start+1, stack);
|
/external/valgrind/main/coregrind/ |
H A D | m_stacks.c | 44 The stack 46 The stack's segment seems to be dynamically extended downwards by 47 the kernel as the stack pointer moves down. Initially, a 1-page 48 (4k) stack is allocated. When SP moves below that for the first 51 upwards to the current valid stack. It then extends the stack 56 That means that Valgrind can't spot when the stack segment is being 58 update stack permissions around SP, so we need to spot all writes 61 The deal is: when SP is assigned a lower value, the stack is being 63 between the old stack pt 266 Stack* stack = find_stack_by_addr(SP); local [all...] |
/external/valgrind/main/coregrind/m_syswrap/ |
H A D | syswrap-amd64-darwin.c | 246 // on a separate non-client stack. 253 char *stack; local 258 stack = (char *)allocstack(tst->tid); 259 stack -= 64+320; // make room for top frame 260 memset(stack, 0, 64+320); // ...and clear it 261 *(uintptr_t *)stack = 0; // push fake return address 265 mach->__rsp = (uintptr_t)stack; 269 /* Call f(arg1), but first switch stacks, using 'stack' as the new 270 stack, and use 'retaddr' as f's return-to address. Also, clear all 273 void call_on_new_stack_0_1 ( Addr stack, 358 Addr stack = VG_PGROUNDUP(sp) - stacksize; local 421 Addr stack; local [all...] |
H A D | syswrap-amd64-linux.c | 65 /* Call f(arg1), but first switch stacks, using 'stack' as the new 66 stack, and use 'retaddr' as f's return-to address. Also, clear all 69 void ML_(call_on_new_stack_0_1) ( Addr stack, 73 // %rdi == stack 81 " movq %rdi, %rsp\n" // set stack 82 " pushq %rsi\n" // retaddr to stack 83 " pushq %rdx\n" // f to stack 84 " pushq %rcx\n" // arg1 to stack 137 void* stack, 147 // set up child stack, temporaril 212 UWord* stack; local [all...] |
H A D | syswrap-arm-linux.c | 67 /* Call f(arg1), but first switch stacks, using 'stack' as the new 68 stack, and use 'retaddr' as f's return-to address. Also, clear all 71 void ML_(call_on_new_stack_0_1) ( Addr stack, 75 // r0 = stack 109 void* stack, 120 /*Setup child stack */ 125 /* r1 (arg2) is already our child's stack */ 159 1. allocate a ThreadId+ThreadState+stack for the the thread 164 but using the scheduler entrypoint for IP, and a separate stack 179 UWord *stack; local [all...] |
H A D | syswrap-arm64-linux.c | 65 /* Call f(arg1), but first switch stacks, using 'stack' as the new 66 stack, and use 'retaddr' as f's return-to address. Also, clear all 69 void ML_(call_on_new_stack_0_1) ( Addr stack, 73 // r0 = stack 160 // set up child stack, temporarily preserving fn and arg 161 " sub x1, x1, #16\n" // make space on stack 208 1. allocate a ThreadId+ThreadState+stack for the the thread 213 but using the scheduler entrypoint for IP, and a separate stack 228 UWord* stack; local 239 stack [all...] |
H A D | syswrap-mips64-linux.c | 77 /* Call f(arg1), but first switch stacks, using 'stack' as the new stack, and 81 void ML_(call_on_new_stack_0_1) ( Addr stack, /* $4 - $a0 */ 89 " move $29, $4\n" /* set stack */ 124 void* stack, /* a1 - 5 */ 190 1. allocate a ThreadId+ThreadState+stack for the the thread 195 the scheduler entrypoint for IP, and a separate stack for SP. */ 207 UWord * stack; local 215 stack = (UWord *)ML_(allocstack)(ctid); 216 if (stack [all...] |
H A D | syswrap-ppc32-linux.c | 64 /* Call f(arg1), but first switch stacks, using 'stack' as the new 65 stack, and use 'retaddr' as f's return-to address. Also, clear all 68 void ML_(call_on_new_stack_0_1) ( Addr stack, 72 // r3 = stack 80 " mr %r1,%r3\n\t" // stack to %sp 153 void* stack, 170 // setup child stack 173 " stwu 0,-16(4)\n" // make initial stack frame 193 /* Note: 2.4 kernel doesn't set the child stack pointer, 196 on the wrong stack, unfortunatel 246 UWord* stack; local [all...] |
H A D | syswrap-ppc64-linux.c | 64 /* Call f(arg1), but first switch stacks, using 'stack' as the new 65 stack, and use 'retaddr' as f's return-to address. Also, clear all 68 void ML_(call_on_new_stack_0_1) ( Addr stack, 72 // r3 = stack 91 " mr %r1,%r3\n\t" // stack to %sp 166 void* stack, 190 // setup child stack 194 " stdu 0,-32(4)\n" // make initial stack frame 220 /* Note: 2.4 kernel doesn't set the child stack pointer, 223 on the wrong stack, unfortunatel 273 UWord* stack; local [all...] |
H A D | syswrap-x86-darwin.c | 200 // on a separate non-client stack. 207 char *stack; local 212 stack = (char *)allocstack(tst->tid); 213 stack -= 64+320; // make room for top frame 214 memset(stack, 0, 64+320); // ...and clear it 215 *(uintptr_t *)stack = (uintptr_t)tst; // set parameter 216 stack -= sizeof(uintptr_t); 217 *(uintptr_t *)stack = 0; // push fake return address 220 mach->__esp = (uintptr_t)stack; 224 /* Call f(arg1), but first switch stacks, using 'stack' a 316 Addr stack = VG_PGROUNDUP(sp) - stacksize; local 386 Addr stack; local [all...] |
/external/bison/lib/ |
H A D | timevar.c | 146 /* If this variable is timed independently of the timing stack, 158 the timing stack. */ 162 /* An element on the timing stack. Elapsed time is attributed to the 163 topmost timing variable on the stack. */ 167 /* The timing variable at this stack level. */ 170 /* The next lower timing variable context in the stack. */ 178 /* The top of the timing stack. */ 179 static struct timevar_stack_def *stack; variable in typeref:struct:timevar_stack_def 185 /* The time at which the topmost element on the timing stack was 276 /* Push TIMEVAR onto the timing stack [all...] |
/external/bluetooth/bluedroid/btif/src/ |
H A D | bluetooth.c | 487 bluetooth_device_t *stack = malloc(sizeof(bluetooth_device_t) ); local 488 memset(stack, 0, sizeof(bluetooth_device_t) ); 489 stack->common.tag = HARDWARE_DEVICE_TAG; 490 stack->common.version = 0; 491 stack->common.module = (struct hw_module_t*)module; 492 stack->common.close = close_bluetooth_stack; 493 stack->get_bluetooth_interface = bluetooth__get_bluetooth_interface; 494 *abstraction = (struct hw_device_t*)stack;
|