| /ndk/tests/device/test-stlport/unit/ |
| mvctor_declaration_test.cpp | 23 #include <stack>
272 //stack:
273 CPPUNIT_ASSERT( is_movable(stack<char>()) );
274 CPPUNIT_ASSERT( is_movable(stack<specially_allocated_struct>()) );
276 CPPUNIT_ASSERT( is_move_complete(stack<char>()) );
277 CPPUNIT_ASSERT( !is_move_complete(stack<specially_allocated_struct>()) );
279 CPPUNIT_ASSERT( !is_move_complete(stack<char>()) );
|
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/scene/ |
| ViewHierarchyLoader.java | 34 import java.util.Stack;
64 Stack<ViewNode> stack = new Stack<ViewNode>(); local
77 stack.push(lastNode);
78 } else if (!stack.isEmpty()) {
81 stack.pop();
102 if (!stack.isEmpty()) {
103 final ViewNode parent = stack.peek();
|
| /external/bluetooth/bluedroid/main/ |
| Android.mk | 86 $(LOCAL_PATH)/../stack/include \
87 $(LOCAL_PATH)/../stack/l2cap \
88 $(LOCAL_PATH)/../stack/a2dp \
89 $(LOCAL_PATH)/../stack/btm \
90 $(LOCAL_PATH)/../stack/avdt \
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| heapProfiler.css | 203 .heap-allocation-stack .stack-frame {
210 .heap-allocation-stack .stack-frame a {
214 .no-heap-allocation-stack {
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_report.cc | 96 Printf(" [failed to restore the stack]\n\n");
139 PrintStack(mop->stack);
156 Printf(" Location is stack of %s.\n\n", thread_name(thrbuf, loc->tid));
166 PrintStack(loc->stack);
190 PrintStack(rm->stack);
206 if (rt->stack)
210 PrintStack(rt->stack);
223 return rep->mops[0]->stack;
227 return rep->mutexes[0]->stack;
229 return rep->threads[0]->stack;
[all...] |
| /external/zlib/src/examples/ |
| 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 = 0
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| sgmllib.py | 75 self.stack = []
216 # XXX if end: check for empty stack
344 self.stack.append(tag)
351 found = len(self.stack) - 1
356 if tag not in self.stack:
364 found = len(self.stack)
366 if self.stack[i] == tag: found = i
367 while len(self.stack) > found:
368 tag = self.stack[-1]
377 del self.stack[-1
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| sgmllib.py | 75 self.stack = []
216 # XXX if end: check for empty stack
344 self.stack.append(tag)
351 found = len(self.stack) - 1
356 if tag not in self.stack:
364 found = len(self.stack)
366 if self.stack[i] == tag: found = i
367 while len(self.stack) > found:
368 tag = self.stack[-1]
377 del self.stack[-1
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| eval-stack-trace.js | 28 // Return the stack frames of an Error object.
35 var frames = this.stack;
94 // f (eval at g (eval-stack.js:87:8), <anonymous>:2:9)
95 // eval (eval at g (eval-stack.js:87:8), <anonymous>:4:1)
96 // g (eval-stack.js:87:3)
97 // eval-stack.js:94:3
124 // f (eval at h (eval at <anonymous> (eval-stack.js:116:8)),
126 // eval (eval at h (eval at <anonymous> (eval-stack.js:116:8)),
128 // h (eval at <anonymous> (eval-stack.js:116:8), <anonymous>:3:3)
129 // eval (eval at <anonymous> (eval-stack.js:116:8), <anonymous>:5:1
[all...] |
| /external/chromium_org/extensions/renderer/resources/ |
| last_error.js | 19 * optional |stack|.
21 function set(name, message, stack, targetChrome) {
23 if (stack != null && stack != '')
24 errorMessage += '\n' + stack;
110 function run(name, message, stack, callback, args) {
112 set(name, message, stack, targetChrome);
|
| /external/chromium_org/v8/tools/ |
| logreader.js | 91 * Processes stack record.
95 * @param {Array.<string>} stack String representation of a stack.
96 * @return {Array.<number>} Processed stack.
98 LogReader.prototype.processStack = function(pc, func, stack) {
101 for (var i = 0, n = stack.length; i < n; ++i) {
102 var frame = stack[i];
|
| /external/valgrind/main/memcheck/tests/ |
| addressable.stderr.exp | 14 Address 0x........ is not stack'd, malloc'd or (recently) free'd
19 Address 0x........ is not stack'd, malloc'd or (recently) free'd
26 If you believe this happened as a result of a stack
29 main thread stack using the --main-stacksize= flag.
30 The main thread stack size used in this run was ....
66 Address 0x........ is not stack'd, malloc'd or (recently) free'd
71 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| Assertions.cpp | 229 void WTFGetBacktrace(void** stack, int* size)
232 *size = backtrace(stack, *size);
246 *size = captureStackBackTraceFunc(0, *size, stack, 0);
257 // Use alloca to allocate on the stack since this function is used in OOM situations.
288 void WTFPrintBacktrace(void** stack, int size)
291 FrameToNameScope frameToName(stack[i]);
294 printf_stderr_common("%-3d %p %s\n", frameNumber, stack[i], frameToName.nullableName());
296 printf_stderr_common("%-3d %p\n", frameNumber, stack[i]);
342 // Needed otherwise we are going to dump the stack trace twice
|
| /frameworks/base/services/core/java/com/android/server/am/ |
| ActivityRecord.java | 66 * An entry in the history stack, representing an activity.
165 private boolean inHistory; // are we in the history stack?
514 task.stack.removeTask(task);
516 Slog.d(TAG, "!!! REMOVE THIS LOG !!! setTask: nearly removed stack=" +
517 (newTask == null ? null : newTask.stack));
585 if (this == task.stack.getVisibleBehindActivity()) {
651 // stack.
654 && task.stack.topRunningActivityLocked(null) == this))
818 final ActivityStack stack = task.stack; local
861 final ActivityStack stack = task.stack; local
892 final ActivityStack stack = task.stack; local
985 final ActivityStack stack = mStackSupervisor.getFocusedStack(); local
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaMethod.java | 35 import java.util.Stack;
757 // We push the parent first, then the child on the stack.
758 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
767 stack.add(null); // Start with null parent.
768 stack.add(rootBlock);
770 while (stack.size() > 0) {
771 SsaBasicBlock cur = stack.pop();
772 SsaBasicBlock parent = stack.pop()
797 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| memory_region_map.cc | 47 // HeapLeakChecker uses the regions and the associated stack traces
87 // static fixed-sized stack (saved_regions and saved_buckets), when the
89 // this stack and move the data from saved_regions and saved_buckets to its
255 MyAllocator::Free(bucket->stack, 0);
364 RAW_VLOG(10, "Stack at %p is inside region %p..%p",
389 // Lookup stack trace in table
395 std::equal(key, key + depth, bucket->stack)) {
409 bucket->stack = key_copy;
422 bucket->stack = key_copy;
467 // and its call stack data: it's safe to do it now
[all...] |
| profiler.cc | 34 // Profile current program by sampling stack-trace every so often
269 void* stack[ProfileData::kMaxStackDepth]; local
273 stack[0] = GetPC(*reinterpret_cast<ucontext_t*>(signal_ucontext));
275 // We skip the top two stack trace entries (this function and one
281 int depth = GetStackTraceWithContext(stack + 1, arraysize(stack) - 1,
283 depth++; // To account for pc value in stack[0];
285 instance->collector_.Add(depth, stack);
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaMethod.java | 36 import java.util.Stack;
758 // We push the parent first, then the child on the stack.
759 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
768 stack.add(null); // Start with null parent.
769 stack.add(rootBlock);
771 while (stack.size() > 0) {
772 SsaBasicBlock cur = stack.pop();
773 SsaBasicBlock parent = stack.pop()
798 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
[all...] |
| /external/compiler-rt/lib/msan/ |
| msan_interceptors.cc | 153 *memptr = MsanReallocate(&stack, 0, size, alignment, false);
162 void *ptr = MsanReallocate(&stack, 0, size, boundary, false);
169 void *ptr = MsanReallocate(&stack, 0, size, boundary, false);
176 void *ptr = MsanReallocate(&stack, 0, size, boundary, false);
183 void *ptr = MsanReallocate(&stack, 0, size, GetPageSizeCached(), false);
195 void *ptr = MsanReallocate(&stack, 0, size, PageSize, false);
202 MsanDeallocate(&stack, ptr);
208 MsanDeallocate(&stack, ptr);
254 CopyPoison(dest, src, n + 1, &stack);
265 CopyPoison(dest, src, copy_size, &stack);
[all...] |
| msan_report.cc | 48 " in the stack frame of function '%s%s%s'%s\n",
99 void ReportUMR(StackTrace *stack, u32 origin) {
108 stack->Print();
112 ReportErrorSummary("use-of-uninitialized-value", stack);
115 void ReportExpectedUMRNotFound(StackTrace *stack) {
119 stack->Print();
130 Printf("Stack depot allocated bytes: %zu\n", stack_depot_stats->allocated);
|
| /external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
| 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 needed. This woul
323 stack_entry stack[STACK_SIZE]; local
354 stack_entry stack[STACK_SIZE]; local
385 stack_entry stack[STACK_SIZE]; local
[all...] |
| /art/runtime/arch/arm/ |
| portable_entrypoints_arm.S | 39 mov r11, sp @ save the stack pointer
46 sub sp, r5 @ reserve stack space for argument array
47 add r0, sp, #4 @ pass stack pointer + method ptr as dest for memcpy
55 add sp, #16 @ first 4 args are not passed on stack for portable
58 mov sp, r11 @ restore the stack pointer
|
| /bionic/libc/bionic/ |
| pthread_create.cpp | 55 // We don't know where the user got their stack, so assume the worst and zero the TLS area.
62 // GCC looks in the TLS for the stack guard on x86, so copy it there from our global.
67 // Create and set an alternate signal stack.
108 void* stack = mmap(NULL, thread->attr.stack_size, prot, flags, -1, 0); local
109 if (stack == MAP_FAILED) {
112 "pthread_create failed: couldn't allocate %zd-byte stack: %s",
117 // Set the guard region at the end of the stack to PROT_NONE.
118 if (mprotect(stack, thread->attr.guard_size, PROT_NONE) == -1) {
120 "pthread_create failed: couldn't mprotect PROT_NONE %zd-byte stack guard region: %s",
122 munmap(stack, thread->attr.stack_size)
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| BaseMachine.java | 120 ExecutionStack stack = frame.getStack(); local
130 args[i] = stack.pop();
148 throw new SimException("at stack depth " + (size - 1 - i) +
531 * onto the stack.
552 ExecutionStack stack = frame.getStack(); local
555 stack.setLocal();
557 stack.push(results[i]);
|
| /external/chromium_org/third_party/flot/ |
| jquery.flot.stack.min.js | 13 Two or more series are stacked when their "stack" attribute is set to the same
15 stack, you can set the stack option like this:
18 stack: null/false, true, or a key (number/string)
25 stack: true
36 */(function(e){function n(e){function t(e,t){var n=null;for(var r=0;r<t.length;++r){if(e==t[r])break;t[r].stack==e.stack&&(n=t[r])}return n}function n(e,n,r){if(n.stack==null||n.stack===!1)return;var i=t(n,e.getData());if(!i)return;var s=r.pointsize,o=r.points,u=i.datapoints.pointsize,a=i.datapoints.points,f=[],l,c,h,p,d,v,m=n.lines.show,g=n.bars.horizontal,y=s>2&&(g?r.format[2].x:r.format[2].y),b=m&&n.lines.steps,w=!0,E=g?1:0,S=g?0:1,x=0,T=0,N,C;for(;;){if(x>=o.length)break;N=f.length;if(o[x]==null){for(C=0;C<s;++C)f.push(o[x+C]);x+=s}else if(T>=a.length){if(!m)for(C=0;C<s;++C)f.push(o[x+C]);x+=s}else if(a[T]==null){for(C=0;C<s;++C)f.push(null);w=!0,T+=u}else{l=o[x+E],c=o[x+S],p=a[T+E],d=a[T+S],v=0;if(l==p){for(C=0;C<s;++C)f.push(o[x+C]);f[N+S]+=d,v=d,x+=s,T+=u}else if(l>p){if(m&&x>0&&o[x-s]!=null){h=c+(o[x-s+S]-c)*(p-l)/(o[x-s+E]-l),f.push(p),f.push(h+d);for(C=2;C<s;++C)f.push(o[x+C]);v=d}T+=u}else{if(w&&m){x+=s;continue}for(C=0;C<s;++C)f.push(o[x+C]);m&&T>0&&a[T-u]!=null&&(v=d+(a[T-u+S]-d)*(l-p)/(a[T-u+E]-p)),f[N+S]+=v,x+=s}w=!1,N!=f.length&&y&&(f[N+2]+=v)}if(b&&N!=f.length&&N>0&&f[N]!=null&&f[N]!=f[N-s]&&f[N+1]!=f[N-s+1]){for(C=0;C<s;++C)f[N+s+C]=f[N+C];f[N+1]=f[N-s+1]}}r.points=f}e.hooks.processDatapoints.push(n)}var t={series:{stack:null}};e.plot.plugins.push({init:n,options:t,name:"stack",version:"1.2"})})(jQuery)
[all...] |
