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

<<21222324252627282930>>

  /dalvik/vm/compiler/template/out/
CompilerTemplateAsm-armv7-a.S 48 Stack is "full descending". Only the arguments that don't fit in the first 4
49 registers are placed on the stack. "sp" points at the first stacked argument
88 * Given a frame pointer, find the stack save area.
163 * Unwind a frame from the Dalvik stack for compiled OP_RETURN_XXX.
236 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
238 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
241 bxlo lr @ return to raise stack overflow excep.
303 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
305 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
309 bxlo r12 @ return to raise stack overflow excep
    [all...]
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Collections.pas 55 /// Stack abstraction that also supports the IList interface
61 /// Adds an element to the top of the stack list.
66 /// Removes the element at the top of the stack list and returns it.
68 /// <returns>The element at the top of the stack.</returns>
72 /// Removes the element at the top of the stack list without removing it.
74 /// <returns>The element at the top of the stack.</returns>
  /external/libvpx/libvpx/vp8/common/ppc/
filter_altivec.asm 203 stwu r1,-32(r1) ;# create space on the stack
365 addi r1, r1, 32 ;# recover stack
394 stwu r1,-32(r1) ;# create space on the stack
543 addi r1, r1, 32 ;# recover stack
566 stwu r1,-32(r1) ;# create space on the stack
751 addi r1, r1, 32 ;# recover stack
775 stwu r1,-416(r1) ;# create space on the stack
823 ;# use the stack as temporary storage
919 ;# always write to the stack when doing a horizontal copy
939 ;# always read from the stack when doing a vertical filte
    [all...]
  /external/marisa-trie/v0_1_5/lib/marisa_alpha/
trie-search.cc 649 Vector<Cell> stack; local
650 stack.push_back(cell);
653 Cell &cur = stack[stack_pos - 1];
669 if (stack_pos == stack.size()) {
673 stack.push_back(cell);
675 stack[stack_pos - 1].set_node(stack[stack_pos - 1].node() + 1);
  /external/nist-sip/java/gov/nist/javax/sip/
DialogFilter.java 43 import gov.nist.javax.sip.stack.MessageChannel;
44 import gov.nist.javax.sip.stack.SIPClientTransaction;
45 import gov.nist.javax.sip.stack.SIPDialog;
46 import gov.nist.javax.sip.stack.SIPServerTransaction;
47 import gov.nist.javax.sip.stack.SIPTransaction;
48 import gov.nist.javax.sip.stack.ServerRequestInterface;
49 import gov.nist.javax.sip.stack.ServerResponseInterface;
77 * An adapter class from the JAIN implementation objects to the NIST-SIP stack. The primary
82 * implement a JAIN-SIP interface). This is part of the glue that ties together the NIST-SIP stack
83 * and event model with the JAIN-SIP stack. This is strictly an implementation class
    [all...]
  /dalvik/vm/mterp/armv5te/
footer.S 25 ldr sp, [rSELF,#offThread_jitResumeNSP] @ cut back native stack
107 ldr sp, [rSELF,#offThread_jitResumeNSP] @ cut back native stack
483 SAVEAREA_FROM_FP(r10, rFP) @ r10<- stack save area
513 SAVEAREA_FROM_FP(r10, rFP) @ r10<- stack save area
549 @ find space for the new stack frame, check for overflow
550 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
559 blo .LstackOverflow @ yes, this frame will overflow stack
563 SAVEAREA_FROM_FP(ip, rFP) @ ip<- stack save area
646 /* insert fake function header to help gdb find the stack frame */
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
BaseRecognizer.cs 242 * more information such as the stack frame with
406 * follow that rule reference on the stack; this amounts to
433 * that rule is pushed on a stack. Here are the various "local"
444 * and, hence, the follow context stack is:
557 // what is exact? it seems to only add sets from above on stack
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
BaseRecognizer.cs 265 * more information such as the stack frame with
476 * follow that rule reference on the stack; this amounts to
503 * that rule is pushed on a stack. Here are the various "local"
514 * and, hence, the follow context stack is:
629 // what is exact? it seems to only add sets from above on stack
    [all...]
  /external/libnfc-nci/halimpl/bcm2079x/gki/ulinux/
gki_ulinux.c 209 ** stack - (input) pointer to the top of the stack (highest memory location)
210 ** stacksize - (input) size of the stack allocated for the task
219 UINT8 GKI_create_task (TASKPTR task_entry, UINT8 task_id, INT8 *taskname, UINT16 *stack, UINT16 stacksize, void* pCondVar, void* pMutex)
227 GKI_TRACE_5 ("GKI_create_task func=0x%x id=%d name=%s stack=0x%x stackSize=%d", task_entry, task_id, taskname, stack, stacksize);
298 stack,
601 ** NOTE This function is NOT called by the Widcomm stack and
855 ** NOTE This function is NOT called by the Widcomm stack and
878 ** NOTE The Widcomm upper stack and profiles may run as a single task
    [all...]
  /external/libnfc-nci/src/gki/ulinux/
gki_ulinux.c 206 ** stack - (input) pointer to the top of the stack (highest memory location)
207 ** stacksize - (input) size of the stack allocated for the task
216 UINT8 GKI_create_task (TASKPTR task_entry, UINT8 task_id, INT8 *taskname, UINT16 *stack, UINT16 stacksize, void* pCondVar, void* pMutex)
224 GKI_TRACE_5 ("GKI_create_task func=0x%x id=%d name=%s stack=0x%x stackSize=%d", task_entry, task_id, taskname, stack, stacksize);
295 stack,
579 ** NOTE This function is NOT called by the Widcomm stack and
833 ** NOTE This function is NOT called by the Widcomm stack and
856 ** NOTE The Widcomm upper stack and profiles may run as a single task
    [all...]
  /external/libvpx/libvpx/vp8/common/arm/neon/
sixtappredict8x8_neon.asm 33 ; stack(r4) unsigned char *dst_ptr,
34 ; stack(r5) int dst_pitch
41 ldr r4, [sp, #12] ;load parameters from stack
42 ldr r5, [sp, #16] ;load parameters from stack
55 sub sp, sp, #64 ;reserve space on stack for temporary storage
246 vld1.u8 {q9}, [lr]! ;load intermediate data from stack
  /external/opencv/cv/src/
cvcalibinit.cpp 544 CvSeq* stack = cvCreateSeq( 0, sizeof(*stack), sizeof(void*), temp_storage ); local
572 cvSeqPush(stack, &start);
580 while( stack->total )
583 cvSeqPop( stack, &q );
618 cvSeqPush( stack, &neighbor );
1142 CvSeq* stack = cvCreateSeq( 0, sizeof(*stack), sizeof(void*), temp_storage ); local
    [all...]
  /external/v8/test/cctest/
test-cpu-profiler.cc 50 sample->stack[0] = frame2;
54 sample->stack[1] = frame3;
248 sample->stack[i] = ToAddress(0x1200);
test-profile-generator.cc 601 sample1.stack[0] = ToAddress(0x1510);
607 sample2.stack[0] = ToAddress(0x1780);
608 sample2.stack[1] = ToAddress(0x10000); // non-existent.
609 sample2.stack[2] = ToAddress(0x1620);
615 sample3.stack[0] = ToAddress(0x1910);
616 sample3.stack[1] = ToAddress(0x1610);
758 // don't appear in the stack trace.
  /frameworks/native/libs/utils/
Threads.cpp 717 status_t Thread::run(const char* name, int32_t priority, size_t stack)
740 this, name, priority, stack, &mThread);
743 this, name, priority, stack, &mThread);
  /frameworks/native/opengl/libagl/
context.h 450 matrixf_t *stack; member in struct:android::gl::matrix_stack_t
464 matrixf_t& top() { return stack[depth]; }
465 const matrixf_t& top() const { return stack[depth]; }
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/
FusionDictionary.java 401 ArrayList<CharGroup> stack = node.mData; local
403 for (int i = 0; i < stack.size(); ++i) {
404 int currentValue = stack.get(i).mChars[0];
406 throw new RuntimeException("Invalid stack");
    [all...]
  /build/tools/droiddoc/templates-ds/assets/js/
prettify.js 17 j;var u=i.ownerDocument,v=u.createElement("SPAN");v.className=d[a+1];var x=i.parentNode;x.replaceChild(v,i);v.appendChild(i);e<o&&(l[h+1]=i=u.createTextNode(t.substring(b,o)),x.insertBefore(i,v.nextSibling))}e=b;e>=o&&(h+=2);e>=c&&(a+=2)}}catch(w){"console"in window&&console.log(w&&w.stack?w.stack:w)}}var v=["break,continue,do,else,for,if,return,while"],w=[[v,"auto,case,char,const,default,double,enum,extern,float,goto,int,long,register,short,signed,sizeof,static,struct,switch,typedef,union,unsigned,void,volatile"],
20 J=[v,"alias,and,begin,case,class,def,defined,elsif,end,ensure,false,in,module,next,nil,not,or,redo,rescue,retry,self,super,then,true,undef,unless,until,when,yield,BEGIN,END"],v=[v,"case,done,elif,esac,eval,fi,function,in,local,set,then,until"],K=/^(DIR|FILE|vector|(de|priority_)?queue|list|stack|(const_)?iterator|(multi)?(set|map)|bitset|u?(int|float)\d*)/,N=/\S/,O=u({keywords:[F,H,w,"caller,delete,die,do,dump,elsif,eval,exit,foreach,for,goto,if,import,last,local,my,next,no,our,print,package,redo,require,sub,undef,unless,until,use,wantarray,while,BEGIN,END"+
  /build/tools/droiddoc/templates-sac/assets/js/
prettify.js 17 j;var u=i.ownerDocument,v=u.createElement("SPAN");v.className=d[a+1];var x=i.parentNode;x.replaceChild(v,i);v.appendChild(i);e<o&&(l[h+1]=i=u.createTextNode(t.substring(b,o)),x.insertBefore(i,v.nextSibling))}e=b;e>=o&&(h+=2);e>=c&&(a+=2)}}catch(w){"console"in window&&console.log(w&&w.stack?w.stack:w)}}var v=["break,continue,do,else,for,if,return,while"],w=[[v,"auto,case,char,const,default,double,enum,extern,float,goto,int,long,register,short,signed,sizeof,static,struct,switch,typedef,union,unsigned,void,volatile"],
20 J=[v,"alias,and,begin,case,class,def,defined,elsif,end,ensure,false,in,module,next,nil,not,or,redo,rescue,retry,self,super,then,true,undef,unless,until,when,yield,BEGIN,END"],v=[v,"case,done,elif,esac,eval,fi,function,in,local,set,then,until"],K=/^(DIR|FILE|vector|(de|priority_)?queue|list|stack|(const_)?iterator|(multi)?(set|map)|bitset|u?(int|float)\d*)/,N=/\S/,O=u({keywords:[F,H,w,"caller,delete,die,do,dump,elsif,eval,exit,foreach,for,goto,if,import,last,local,my,next,no,our,print,package,redo,require,sub,undef,unless,until,use,wantarray,while,BEGIN,END"+
  /build/tools/droiddoc/templates-sdk/assets/js/
prettify.js 17 j;var u=i.ownerDocument,v=u.createElement("SPAN");v.className=d[a+1];var x=i.parentNode;x.replaceChild(v,i);v.appendChild(i);e<o&&(l[h+1]=i=u.createTextNode(t.substring(b,o)),x.insertBefore(i,v.nextSibling))}e=b;e>=o&&(h+=2);e>=c&&(a+=2)}}catch(w){"console"in window&&console.log(w&&w.stack?w.stack:w)}}var v=["break,continue,do,else,for,if,return,while"],w=[[v,"auto,case,char,const,default,double,enum,extern,float,goto,int,long,register,short,signed,sizeof,static,struct,switch,typedef,union,unsigned,void,volatile"],
20 J=[v,"alias,and,begin,case,class,def,defined,elsif,end,ensure,false,in,module,next,nil,not,or,redo,rescue,retry,self,super,then,true,undef,unless,until,when,yield,BEGIN,END"],v=[v,"case,done,elif,esac,eval,fi,function,in,local,set,then,until"],K=/^(DIR|FILE|vector|(de|priority_)?queue|list|stack|(const_)?iterator|(multi)?(set|map)|bitset|u?(int|float)\d*)/,N=/\S/,O=u({keywords:[F,H,w,"caller,delete,die,do,dump,elsif,eval,exit,foreach,for,goto,if,import,last,local,my,next,no,our,print,package,redo,require,sub,undef,unless,until,use,wantarray,while,BEGIN,END"+
  /dalvik/vm/mterp/mips/
footer.S 24 lw sp, offThread_jitResumeNSP(rSELF) # cut back native stack
97 lw sp, offThread_jitResumeNSP(rSELF) # cut back native stack
500 SAVEAREA_FROM_FP(rBIX, rFP) # rBIX <- stack save area
594 # find space for the new stack frame, check for overflow
595 SAVEAREA_FROM_FP(a1, rFP) # a1 <- stack save area
604 bltu t0, rOBJ, .LstackOverflow # yes, this frame will overflow stack
676 /* insert fake function header to help gdb find the stack frame */
866 /* fix earlier stack overflow if necessary; Preserve a0 */
911 /* fix stack overflow if necessary */
    [all...]
  /external/compiler-rt/lib/msan/
msan_interceptors.cc 116 *memptr = MsanReallocate(&stack, 0, size, alignment, false);
735 return MsanReallocate(&stack, 0, nmemb * size, sizeof(u64), true);
740 return MsanReallocate(&stack, ptr, size, sizeof(u64), false);
745 return MsanReallocate(&stack, 0, size, sizeof(u64), false);
753 u32 stack_id = StackDepotPut(stack.trace, stack.size);
755 CHECK_EQ((stack_id >> 31), 0); // Higher bit is occupied by stack origins.
  /external/openfst/src/include/fst/
replace.h 500 const StackPrefix& stack = stackprefix_array_[tuple.prefix_id]; local
504 if (fst->Final(fst_state) != Weight::Zero() && stack.Depth() == 0)
696 // if state is final, pop up stack
697 const StackPrefix& stack = stackprefix_array_[tuple.prefix_id]; local
698 if (fst->Final(fst_state) != Weight::Zero() && stack.Depth()) {
703 PrefixId prefix_id = PopPrefix(stack);
704 const PrefixTuple& top = stack.Top();
791 // \brief Tuple of fst_id and destination state (entry in stack prefix)
800 // \brief Container for stack prefix.
832 // \brief Compare two stack prefix classes for equalit
    [all...]
  /external/v8/test/mjsunit/
mjsunit.js 30 // This allows fetching the stack trace using TryCatch::StackTrace.
31 this.stack = new Error("").stack;
  /external/valgrind/main/coregrind/m_syswrap/
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, temporarily preserving fn and ar
212 UWord* stack; local
    [all...]

Completed in 1506 milliseconds

<<21222324252627282930>>