| /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/compiler-rt/lib/asan/ |
| asan_stack.h | 24 void PrintStack(StackTrace *stack);
28 // Get the stack trace with the given pc and bp.
29 // The pc will be in the position 0 of the resulting stack trace.
33 StackTrace stack; \
34 GetStackTrace(&stack, max_s, pc, bp, 0, 0, fast)
37 StackTrace stack; \
45 GetStackTrace(&stack, max_s, pc, bp, \
50 // NOTE: A Rule of thumb is to retrieve stack trace in the interceptors
52 // don't want stack trace to contain functions from ASan internals.
78 PrintStack(&stack); \
[all...] |
| asan_malloc_linux.cc | 65 asan_free(ptr, &stack, FROM_MALLOC);
70 asan_free(ptr, &stack, FROM_MALLOC);
75 return asan_malloc(size, &stack);
91 return asan_calloc(nmemb, size, &stack);
96 return asan_realloc(ptr, size, &stack);
101 return asan_memalign(boundary, size, &stack, FROM_MALLOC);
109 return asan_malloc_usable_size(ptr, &stack);
133 return asan_posix_memalign(memptr, alignment, size, &stack);
138 return asan_valloc(size, &stack);
143 return asan_pvalloc(size, &stack);
[all...] |
| /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/chromium_org/third_party/flot/ |
| jquery.flot.stack.min.js | 1 (function(b){var a={series:{stack:null}};function c(f){function d(k,j){var h=null;for(var g=0;g<j.length;++g){if(k==j[g]){break}if(j[g].stack==k.stack){h=j[g]}}return h}function e(C,v,g){if(v.stack==null){return}var p=d(v,C.getData());if(!p){return}var z=g.pointsize,F=g.points,h=p.datapoints.pointsize,y=p.datapoints.points,t=[],x,w,k,J,I,r,u=v.lines.show,G=v.bars.horizontal,o=z>2&&(G?g.format[2].x:g.format[2].y),n=u&&v.lines.steps,E=true,q=G?1:0,H=G?0:1,D=0,B=0,A;while(true){if(D>=F.length){break}A=t.length;if(F[D]==null){for(m=0;m<z;++m){t.push(F[D+m])}D+=z}else{if(B>=y.length){if(!u){for(m=0;m<z;++m){t.push(F[D+m])}}D+=z}else{if(y[B]==null){for(m=0;m<z;++m){t.push(null)}E=true;B+=h}else{x=F[D+q];w=F[D+H];J=y[B+q];I=y[B+H];r=0;if(x==J){for(m=0;m<z;++m){t.push(F[D+m])}t[A+H]+=I;r=I;D+=z;B+=h}else{if(x>J){if(u&&D>0&&F[D-z]!=null){k=w+(F[D-z+H]-w)*(J-x)/(F[D-z+q]-x);t.push(J);t.push(k+I);for(m=2;m<z;++m){t.push(F[D+m])}r=I}B+=h}else{if(E&&u){D+=z;continue}for(m=0;m<z;++m){t.push(F[D+m])}if(u&&B>0&&y[B-h]!=null){r=I+(y[B-h+H]-I)*(x-J)/(y[B-h+q]-J)}t[A+H]+=r;D+=z}}E=false;if(A!=t.length&&o){t[A+2]+=r}}}}if(n&&A!=t.length&&A>0&&t[A]!=null&&t[A]!=t[A-z]&&t[A+1]!=t[A-z+1]){for(m=0;m<z;++m){t[A+z+m]=t[A+m]}t[A+1]=t[A-z+1]}}g.points=t}f.hooks.processDatapoints.push(e)}b.plot.plugins.push({init:c,options:a,name:"stack",version:"1.2"})})(jQuery)
|
| /external/compiler-rt/lib/msan/ |
| msan_report.cc | 64 " in the stack frame of function '%s%s%s'%s\n",
77 static void ReportSummary(const char *error_type, StackTrace *stack) {
78 if (!stack->size || !IsSymbolizerAvailable()) return;
80 uptr pc = StackTrace::GetPreviousInstructionPc(stack->trace[0]);
91 void ReportUMR(StackTrace *stack, u32 origin) {
100 PrintStack(stack->trace, stack->size);
104 ReportSummary("use-of-uninitialized-value", stack);
107 void ReportExpectedUMRNotFound(StackTrace *stack) {
111 PrintStack(stack->trace, stack->size)
[all...] |
| msan.h | 47 void *MsanReallocate(StackTrace *stack, void *oldp, uptr size,
70 void GetStackTrace(StackTrace *stack, uptr max_s, uptr pc, uptr bp,
73 void ReportUMR(StackTrace *stack, u32 origin);
74 void ReportExpectedUMRNotFound(StackTrace *stack);
81 StackTrace stack; \
82 stack.size = 0; \
84 GetStackTrace(&stack, common_flags()->malloc_context_size, \
|
| /external/jmonkeyengine/engine/src/core/com/jme3/util/ |
| TempVars.java | 56 * <code>TempVarsStack</code> contains a stack of TempVars.
57 * Every time TempVars.get() is called, a new entry is added to the stack,
97 TempVarsStack stack = varsLocal.get();
local
99 TempVars instance = stack.tempVars[stack.index];
106 stack.tempVars[stack.index] = instance;
109 stack.index++;
130 TempVarsStack stack = varsLocal.get();
local
132 // Return it to the 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/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/speex/libspeex/ |
| 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
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| StreamUtil.java | 96 byte[] stack = new byte[5];
97 int pos = stack.length;
99 stack[--pos] = (byte)(tagNo & 0x7F);
104 stack[--pos] = (byte)(tagNo & 0x7F | 0x80);
108 length += stack.length - pos;
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_report.h | 54 ReportStack *stack; member in struct:__tsan::ReportMop
78 ReportStack *stack; member in struct:__tsan::ReportLocation
87 ReportStack *stack; member in struct:__tsan::ReportThread
93 ReportStack *stack; member in struct:__tsan::ReportMutex
117 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/libffi/src/ia64/ |
| ffi.c | 51 /* The stack layout given to ffi_call_unix and ffi_closure_unix_inner. */
57 UINT64 other_args[]; /* Arguments passed on stack, variable size. */
278 struct ia64_args *stack; local
288 /* Allocate the stack frame. */
289 stack = alloca (cif->bytes);
298 stack->gp_regs[gpcount++] = *(SINT8 *)avalue[i];
301 stack->gp_regs[gpcount++] = *(UINT8 *)avalue[i];
304 stack->gp_regs[gpcount++] = *(SINT16 *)avalue[i];
307 stack->gp_regs[gpcount++] = *(UINT16 *)avalue[i];
310 stack->gp_regs[gpcount++] = *(SINT32 *)avalue[i]
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| StackStats.cpp | 64 dataLogF(" === LOG new stack stats ========\n");
69 const StackBounds& stack = wtfThreadData().stack(); local
71 m_stackStart = (char*)stack.origin();
82 const StackBounds& stack = threadData->stack(); local
88 // If there was no previous checkpoint, measure from the start of the stack:
99 // Update the stack height stats:
123 dataLogF(" CHECKPOINT %p diff %d/%.1fk/max %.1fk | reentry %d/max %d | height %.1fk/max %.1fk | stack %p size %.1fk\n",
127 stack.origin(), stack.size() / 1024.0)
143 const StackBounds& stack = threadData->stack(); local
162 const StackBounds& stack = threadData->stack(); local
217 const StackBounds& stack = threadData->stack(); local
[all...] |
| /external/llvm/unittests/Support/ |
| ManagedStatic.cpp | 31 // Valgrind's leak checker complains glibc's stack allocation.
32 // To appease valgrind, we provide our own stack for each thread.
34 void *stack = malloc(n); local
37 pthread_attr_setstack(&a, stack, n);
39 return stack;
|
| /external/stlport/test/unit/ |
| stack_test.cpp | 5 #include <stack>
35 stack<int, deque<int> > s;
49 stack<int, list<int> > s;
|
| /ndk/sources/cxx-stl/llvm-libc++/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;
|
