/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cff/ |
H A D | cffgload.h | 160 FT_Fixed stack[CFF_MAX_OPERANDS + 1]; member in struct:CFF_Decoder_
|
/external/proguard/src/proguard/evaluation/ |
H A D | BasicInvocationUnit.java | 34 * and it updates the stack for the invocation of a class member, 50 private Stack stack; field in class:BasicInvocationUnit 138 public void invokeMember(Clazz clazz, Method method, CodeAttribute codeAttribute, int offset, ConstantInstruction constantInstruction, Stack stack) argument 177 this.stack = stack; 179 this.stack = null; 190 setFieldValue(clazz, fieldrefConstant, stack.pop()); 196 setFieldClassValue(clazz, fieldrefConstant, stack.apop()); 204 stack.push(getFieldValue(clazz, fieldrefConstant, type)); 223 setMethodParameterValue(clazz, methodrefConstant, parameterIndex, stack [all...] |
H A D | Stack.java | 28 * This class represents an operand stack that contains <code>Value</code> 56 public Stack(Stack stack) argument 59 this(stack.values.length); 61 // Copy the stack contents. 62 copy(stack); 67 * Returns the actual maximum stack size that was required for all stack 107 // Copy the stack contents. 130 // Generalize the stack values. 152 // Check if the other stack extend [all...] |
/external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
H A D | SDL_qsort.c | 88 /* How big does our stack need to be? Answer: one entry per 111 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;} 112 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;} 116 first=ffirst=stack[stacktop].first;\ 117 last=llast=stack[stacktop].last;\ 130 * an item onto the stack its size is <= 1/2 of that 131 * of its parent; so the stack can't need more than 171 * computing the size of stack neede 323 stack_entry stack[STACK_SIZE]; local 354 stack_entry stack[STACK_SIZE]; local 385 stack_entry stack[STACK_SIZE]; local [all...] |
/external/speex/libspeex/ |
H A D | cb_search.c | 53 static void compute_weighted_codebook(const signed char *shape_cb, const spx_word16_t *r, spx_word16_t *resp, spx_word16_t *resp2, spx_word32_t *E, int shape_cb_size, int subvect_size, char *stack) argument 111 char *stack, 153 compute_weighted_codebook(shape_cb, r, resp, resp2, E, shape_cb_size, subvect_size, stack); 160 vq_nbest_sign(x, resp2, subvect_size, shape_cb_size, E, 1, &best_index, &best_dist, stack); 162 vq_nbest(x, resp2, subvect_size, shape_cb_size, E, 1, &best_index, &best_dist, stack); 234 syn_percep_zero16(r2, ak, awk1, awk2, r2, nsf,p, stack); 253 char *stack, 297 split_cb_search_shape_sign_N1(target,ak,awk1,awk2,par,p,nsf,exc,r,bits,stack,update_target); 351 compute_weighted_codebook(shape_cb, r, resp, resp2, E, shape_cb_size, subvect_size, stack); 381 vq_nbest_sign(x, resp2, subvect_size, shape_cb_size, E, N, best_index, best_dist, stack); 100 split_cb_search_shape_sign_N1( spx_word16_t target[], spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], const void *par, int p, int nsf, spx_sig_t *exc, spx_word16_t *r, SpeexBits *bits, char *stack, int update_target ) argument 242 split_cb_search_shape_sign( spx_word16_t target[], spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], const void *par, int p, int nsf, spx_sig_t *exc, spx_word16_t *r, SpeexBits *bits, char *stack, int complexity, int update_target ) argument 514 split_cb_shape_sign_unquant( spx_sig_t *exc, const void *par, int nsf, SpeexBits *bits, char *stack, spx_int32_t *seed ) argument 572 noise_codebook_quant( spx_word16_t target[], spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], const void *par, int p, int nsf, spx_sig_t *exc, spx_word16_t *r, SpeexBits *bits, char *stack, int complexity, int update_target ) argument 599 noise_codebook_unquant( spx_sig_t *exc, const void *par, int nsf, SpeexBits *bits, char *stack, spx_int32_t *seed ) argument [all...] |
H A D | sb_celp.h | 58 char *stack; /**< Temporary allocation stack */ member in struct:SBEncState 111 char *stack; member in struct:SBDecState
|
/external/srec/srec/crec/ |
H A D | srec_results.c | 112 AstarStack* stack = rec ? rec->astar_stack : 0; local 114 if (!stack) 119 rc = astar_stack_prepare(stack, n, rec); 129 if (stack->num_complete_paths) 131 *bestcost = stack->complete_paths[0]->costsofar; 144 AstarStack* stack = rec ? rec->astar_stack : 0; local 145 astar_stack_clear(stack); 151 AstarStack* stack = rec ? rec->astar_stack : 0; local 152 return stack ? stack 158 AstarStack* stack = rec ? rec->astar_stack : 0; local 173 AstarStack* stack = rec ? rec->astar_stack : 0; local 181 AstarStack* stack = rec ? rec->astar_stack : 0; local 208 AstarStack* stack = rec ? rec->astar_stack : 0; local 234 AstarStack* stack = rec ? rec->astar_stack : 0; local 286 AstarStack* stack = rec ? rec->astar_stack : 0; local 353 AstarStack* stack = rec ? rec->astar_stack : 0; local 460 AstarStack* stack = rec ? rec->astar_stack : 0; local [all...] |
H A D | srec_stats.c | 141 void srec_stats_update_astar(AstarStack* stack) argument 147 stack->num_active_paths); 150 stack->num_complete_paths); 152 num_parps_in_use = stack->partial_path_array_size; 153 for (parp = stack->free_parp_list; parp; parp = parp->next)
|
/external/valgrind/main/coregrind/m_aspacemgr/ |
H A D | aspacemgr-common.c | 364 Protect the stack active area and the guard areas appropriately. 366 stack. On success, also sets *initial_sp to what the stack pointer 373 VgStack* stack; local 377 /* Allocate the stack. */ 385 stack = (VgStack*)(AddrH)sr_Res(sres); 388 aspacem_assert(VG_IS_PAGE_ALIGNED(stack)); 392 (Addr) &stack[0], 397 (Addr) &stack->bytes[0], 402 (Addr) &stack 439 am_get_VgStack_unused_szB( VgStack* stack, SizeT limit ) argument [all...] |
/external/valgrind/main/coregrind/m_debuginfo/ |
H A D | d3basics.c | 492 FAIL("evaluate_Dwarf3_Expr: stack overflow(1)"); \ 494 stack[sp] = (_arg); \ 501 FAIL("evaluate_Dwarf3_Expr: stack underflow(1)"); \ 502 _lval = stack[sp]; \ 509 Addr stack[N_EXPR_STACK]; /* stack of addresses, as per D3 spec */ local 559 /* end of expr - return expr on the top of stack. */ 561 /* stack empty. Bad. */ 562 FAIL("evaluate_Dwarf3_Expr: stack empty at end of expr"); 605 FAIL("evaluate_Dwarf3_Expr: DW_OP_{implicit,stack}_valu [all...] |
/external/valgrind/main/coregrind/ |
H A D | m_libcassert.c | 303 // execontext/stack dump/symtab code. But it's better than nothing. 332 VgStack* stack local 336 has exited, then valgrind_stack_base points to the stack base. */ 338 && (!exited_threads || stack == 0)) continue; 343 if (valgrind_stack_usage && stack != 0) 344 VG_(printf)("valgrind stack top usage: %ld of %ld\n", 346 - VG_(am_get_VgStack_unused_szB)(stack,
|
/external/valgrind/main/coregrind/m_syswrap/ |
H A D | syswrap-mips32-linux.c | 78 /* Call f(arg1), but first switch stacks, using 'stack' as the new 79 stack, and use 'retaddr' as f's return-to address. Also, clear all 83 void ML_ (call_on_new_stack_0_1) (Addr stack, Addr retaddr, 85 // a0 = stack 93 " move $29, $4\n\t" // stack to %sp 129 pid_t* child_tid in stack 16 130 pid_t* parent_tid in stack 20 131 void* tls_ptr in stack 24 139 pid_t* child_tid in stack 16 151 void *stack, //a 250 UWord * stack; local [all...] |
H A D | syswrap-s390x-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 76 void ML_(call_on_new_stack_0_1) ( Addr stack, 81 r2 = stack 92 " lgr %r15,%r2\n" // stack to r15 111 // r15 is the stack pointer 144 ULong do_syscall_clone_s390x_linux ( void *stack, 156 " lg %r1, 160(%r15)\n" // save fn from parent stack into r1 157 " lg %r0, 168(%r15)\n" // save arg from parent stack into r0 158 " aghi %r2, -160\n" // create stack fram 218 UWord* stack; local [all...] |
/external/zlib/src/examples/ |
H A D | gun.c | 216 unsigned stack; /* next position for reversed string */ local 265 stack = 0; 325 match[stack++] = (unsigned char)final; 330 p = match + stack; 335 stack = p - match; 336 match[stack++] = (unsigned char)code; 350 while (stack > SIZE - outcnt) { 352 outbuf[outcnt++] = match[--stack]; 359 p = match + stack; 363 stack [all...] |
/external/chromium_org/base/debug/ |
H A D | trace_event_memory.cc | 24 // entries on the pseudo-stack per scope. 49 // Records a stack of TRACE_MEMORY events. One per thread is required. 69 TraceMemoryStack* stack = static_cast<TraceMemoryStack*>(value); local 70 delete stack; 86 TraceMemoryStack* stack = 88 delete stack; 98 // Returns the thread-local trace memory stack for the current thread, creating 102 TraceMemoryStack* stack = local 105 if (!stack) { 106 stack 288 TraceMemoryStack* stack = GetTraceMemoryStack(); local 295 TraceMemoryStack* stack = GetTraceMemoryStack(); local [all...] |
/external/chromium_org/chrome/browser/ui/panels/ |
H A D | panel_drag_controller.cc | 85 StackedPanelCollection* stack = panel->stack(); local 86 if (stack) { 89 stack->panels().begin(); 90 iter != stack->panels().end(); ++iter) { 163 // Check if the dragging panel can be moved out the stack. Note that this 172 // Check if the dragging panel can stack with other panel or stack. 247 // when the stack has more than 2 panels and the 2nd top panel is unstacked 249 // remain in the stack 634 StackedPanelCollection* stack = dragging_panel_->stack(); local 720 StackedPanelCollection* stack = panel->stack(); local 769 StackedPanelCollection* stack = panel->stack(); local [all...] |
/external/chromium_org/ppapi/proxy/ |
H A D | raw_var_data.cc | 7 #include <stack> 76 // This function uses a stack-based DFS search to traverse the var graph. Each 77 // iteration, the top node on the stack examined. If the node has not been 82 // Otherwise, if they haven't been visited yet we add them to the stack, If the 83 // node at the top of the stack has already been visited, then we pop it off the 84 // stack and erase it from |parent_ids|. 93 std::stack<StackEntry> stack; local 94 stack.push(StackEntry(var, GetOrCreateRawVarData(var, &visited_map, 97 while (!stack [all...] |
/external/chromium_org/sandbox/linux/seccomp-bpf/ |
H A D | codegen.cc | 212 Instructions stack; local 221 stack.push_back(const_cast<Instruction*>(insn)); 226 // already remembered the "false" branch on the stack and will 251 while (!insn && !stack.empty()) { 253 // stack to any branches that we haven't processed yet. By definition, 256 insn = stack.back(); 257 stack.pop_back(); 264 // up the stack. 326 Instructions stack; local 345 // false branch of the jump. We need to maintain a stack t [all...] |
/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | PoolAlloc.h | 207 tAllocStack stack; // stack of where to allocate from, to partition pool member in class:TPoolAllocator
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_ssa.cpp | 299 Stack *stack; member in class:nv50_ir::RenamePass 406 stack = new Stack[func->allLValues.getSize()]; 411 if (stack) 412 delete[] stack; 418 if (!stack[val->id].getSize()) 420 return reinterpret_cast<LValue *>(stack[val->id].peek().u.p); 437 if (!stack) 461 stack[lval->id].push(ssa); 484 stack[lval->id].push(stmt->def(d).get()); 529 stack[stm [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
H A D | brw_eu.h | 120 struct brw_instruction stack[BRW_EU_MAX_INSN_STACK]; member in struct:brw_compile 147 * blocks they were popping out of, to fix up the mask stack. This tracks
|
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
H A D | 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[ [all...] |
/external/chromium_org/third_party/re2/re2/ |
H A D | onepass.cc | 399 InstCond *stack = new InstCond[size]; local 417 // Flood graph using manual stack, filling in actions as found. 426 stack[nstack].id = id; 427 stack[nstack++].cond = 0; 429 int id = stack[--nstack].id; 431 uint32 cond = stack[nstack].cond; 441 stack[nstack].id = ip->out1(); 442 stack[nstack++].cond = cond; 443 stack[nstack].id = ip->out(); 444 stack[nstac [all...] |
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkClipStack.h | 22 // stores the stack depth (fSaveCount) and clips (fDeque) separately. 23 // Each clip in fDeque stores the stack state to which it belongs 112 /** The GenID can be used by clip stack clients to cache representations of the clip. The 114 stack not to the element itself. That is the same clip path in different stacks will 184 int fSaveCount; // save count of stack when this element was added. 189 /* fFiniteBoundType and fFiniteBound are used to incrementally update the clip stack's 202 // When element is applied to the previous elements in the stack is the result known to be 266 stack */ 314 * clip-stack. If false is returned then the rect does not intersect the 357 * Dumps the contents of the clip stack t 413 B2TIter(const SkClipStack& stack) argument 423 reset(const SkClipStack& stack) argument [all...] |
/external/chromium_org/third_party/speex/libspeex/ |
H A D | lsp.c | 144 char *stack 177 static float cheb_poly_eva(spx_word32_t *coef, spx_word16_t x, int m, char *stack) argument 219 int lpc_to_lsp (spx_coef_t *a,int lpcrdr,spx_lsp_t *freq,int nb,spx_word16_t delta, char *stack) argument 325 psuml = cheb_poly_eva(pt,xl,m,stack); /* evals poly. at xl */ 340 psumr = cheb_poly_eva(pt,xr,m,stack);/* poly(xl-delta_x) */ 364 psumm=cheb_poly_eva(pt,xm,m,stack); 403 void lsp_to_lpc(spx_lsp_t *freq,spx_coef_t *ak,int lpcrdr, char *stack) argument 522 void lsp_to_lpc(spx_lsp_t *freq,spx_coef_t *ak,int lpcrdr, char *stack) argument
|