| /external/skia/tools/lua/ |
| count_reduced_clipstacks.lua | 20 function build_stack_string(stack)
22 for i = 1, #stack do
23 local element = stack[i];
41 local stack = canvas:getReducedClipStack()
42 local stackstr = build_stack_string(stack)
|
| /frameworks/base/core/java/android/util/ |
| JsonReader.java | 205 private final List<JsonScope> stack = new ArrayList<JsonScope>(); field in class:JsonReader
536 stack.clear();
537 stack.add(JsonScope.CLOSED);
567 return stack.get(stack.size() - 1);
571 return stack.remove(stack.size() - 1);
575 stack.add(newTop);
579 * Replace the value on the top of the stack with the given value.
582 stack.set(stack.size() - 1, newTop)
[all...] |
| /external/chromium_org/third_party/openmax_dl/dl/api/arm/ |
| armCOMM_s.h | 28 .set _SBytes, 0 @ Number of scratch bytes on stack
29 .set _Workspace, 0 @ Stack offset of scratch workspace
34 @// Work out a list of R saved registers, and how much stack space is needed.
152 @ Note that functions should all be "stack-moves-once"
154 @ where the stack moves.
157 @ rreg = "" don't stack any registers
158 @ "lr" stack "lr" only
159 @ "rN" stack registers "r4-rN,lr"
160 @ dreg = "" don't stack any D registers
161 @ "dN" stack registers "d8-dN
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| 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[nstack++].cond = cond
[all...] |
| /external/regex-re2/re2/ |
| 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[nstack++].cond = cond
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ImmutableSet.h | 651 SmallVector<uintptr_t,20> stack; member in class:llvm::ImutAVLTreeGenericIterator
661 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root));
665 assert(!stack.empty());
666 return reinterpret_cast<TreeTy*>(stack.back() & ~Flags);
670 assert(!stack.empty());
671 return stack.back() & Flags;
675 bool atEnd() const { return stack.empty(); }
678 return stack.size() == 1 && getVisitState() == VisitedNone;
682 assert(!stack.empty());
683 stack.pop_back()
[all...] |
| /external/chromium_org/chrome/browser/ui/panels/ |
| panel_manager.cc | 53 // stack or panel we want to seacrh first for adding new panel.
58 // When there're ties, the right-most stack will appear first.
64 // In the event of another draw, the top-most stack will appear first.
70 // The stack with more panels will appear first.
305 // If there're stacks, try to find a stack that can fit new panel.
308 // 1) Search from the stack with more panels to the stack with least panels.
310 // most stack to the left-most stack.
311 // 3) Among the stack with same number of panels and same x position
318 StackedPanelCollection* stack = *iter; local
412 StackedPanelCollection* stack = local
433 StackedPanelCollection* stack = new StackedPanelCollection(this); local
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| profiledata.cc | 75 memcpy(&evict_[num_evicted_], entry.stack, d * sizeof(Slot));
260 void ProfileData::Add(int depth, const void* const* stack) {
271 Slot slot = reinterpret_cast<Slot>(stack[i]);
286 if (e->stack[i] != reinterpret_cast<Slot>(stack[i])) {
316 e->stack[i] = reinterpret_cast<Slot>(stack[i]);
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| profiledata.cc | 75 memcpy(&evict_[num_evicted_], entry.stack, d * sizeof(Slot));
260 void ProfileData::Add(int depth, const void* const* stack) {
271 Slot slot = reinterpret_cast<Slot>(stack[i]);
286 if (e->stack[i] != reinterpret_cast<Slot>(stack[i])) {
316 e->stack[i] = reinterpret_cast<Slot>(stack[i]);
|
| /external/chromium_org/tools/cr/cr/ |
| visitor.py | 29 self.stack = []
37 self.stack.append(node)
47 self.stack.pop()
49 if self.stack:
50 # propagate back up the stack
66 return self.stack[0]
71 return self.stack[-1]
86 """Returns the current traversal stack as a string."""
87 return '/'.join([entry.name for entry in self.stack])
|
| /external/compiler-rt/lib/lsan/ |
| lsan_allocator.cc | 60 static void RegisterAllocation(const StackTrace &stack, void *p, uptr size) {
65 m->stack_trace_id = StackDepotPut(stack.trace, stack.size);
77 void *Allocate(const StackTrace &stack, uptr size, uptr alignment,
89 RegisterAllocation(stack, p, size);
98 void *Reallocate(const StackTrace &stack, void *p, uptr new_size,
107 RegisterAllocation(stack, p, new_size);
|
| /libcore/luni/src/main/java/java/lang/ |
| Throwable.java | 36 * message in most cases), and for saving a stack trace (that is, a record of
37 * the call stack at a particular point in time) which can be printed later.
43 * information. When printing the stack trace, the trace of the cause is
70 * An intermediate representation of the stack trace. This field may
76 * A fully-expanded representation of the stack trace.
81 * Constructs a new {@code Throwable} that includes the current stack trace.
89 * Constructs a new {@code Throwable} with the current stack trace and the
99 * Constructs a new {@code Throwable} with the current stack trace, the
110 * Constructs a new {@code Throwable} with the current stack trace and the
121 * Constructs a new {@code Throwable} with the current stack trace, th
318 StackTraceElement[] stack = getInternalStackTrace(); local
[all...] |
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/ |
| BinaryDictIOUtils.java | 28 import java.util.Stack;
93 Stack<Position> stack = new Stack<>(); local
97 stack.push(initPos);
99 while (!stack.empty()) {
100 Position p = stack.peek();
116 stack.pop();
134 stack.pop();
142 stack.push(childrenPos)
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrReducedClip.cpp | 17 void reduced_stack_walker(const SkClipStack& stack,
31 void ReduceClipStack(const SkClipStack& stack,
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,
[all...] |
| /external/chromium_org/third_party/skia/third_party/lua/src/ |
| lstate.c | 135 /* initialize stack array */
136 L1->stack = luaM_newvector(L, BASIC_STACK_SIZE, TValue);
139 setnilvalue(L1->stack + i); /* erase new stack */
140 L1->top = L1->stack;
141 L1->stack_last = L1->stack + L1->stacksize - EXTRA_STACK;
154 if (L->stack == NULL)
155 return; /* stack not completely built yet */
158 luaM_freearray(L, L->stack, L->stacksize); /* free stack array *
[all...] |
| /external/skia/src/gpu/ |
| GrReducedClip.cpp | 17 void reduced_stack_walker(const SkClipStack& stack,
31 void ReduceClipStack(const SkClipStack& stack,
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,
[all...] |
| /external/icu/icu4c/source/layout/ |
| LigatureSubstProc.cpp | 71 le_int32 stack[nComponents]; local
107 mm--; // don't overrun the stack.
109 stack[++mm] = componentGlyph;
127 componentStack[m] = stack[mm--];
|
| /external/valgrind/main/coregrind/m_syswrap/ |
| syscall-mips32-linux.S | 72 Int nsigwords) // stack
163 addu $29, $29, 56 #release the stack frame.
185 addu $29, $29, 56 #release the stack frame.
206 /* Let the linker know we don't need an executable stack */
207 .section .note.GNU-stack,"",%progbits
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| PyParse.py | 390 stack = [] # stack of open bracket indices
391 push_stack = stack.append
413 bracketing.append((p, len(stack)))
419 if stack:
420 del stack[-1]
423 bracketing.append((p, len(stack)))
434 bracketing.append((p, len(stack)+1))
437 bracketing.append((p, len(stack)))
442 bracketing.append((p, len(stack)+1)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| shlex.py | 60 "Push a token onto the stack popped by the get_token method"
66 "Push an input source onto the lexer's input source stack."
80 "Pop the input source stack."
89 "Get a token from the input stream (or from stack if it's nonempty)"
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| PyParse.py | 390 stack = [] # stack of open bracket indices
391 push_stack = stack.append
413 bracketing.append((p, len(stack)))
419 if stack:
420 del stack[-1]
423 bracketing.append((p, len(stack)))
434 bracketing.append((p, len(stack)+1))
437 bracketing.append((p, len(stack)))
442 bracketing.append((p, len(stack)+1)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| shlex.py | 60 "Push a token onto the stack popped by the get_token method"
66 "Push an input source onto the lexer's input source stack."
80 "Pop the input source stack."
89 "Get a token from the input stream (or from stack if it's nonempty)"
|
| /external/opencv/cvaux/src/ |
| cvsegment.cpp | 58 #define PUSH(Y,IL,IR,IPL,IPR,FL) { stack[StIn].y=(ushort)(Y); \
59 stack[StIn].l=(ushort)(IL); \
60 stack[StIn].r=(ushort)(IR); \
61 stack[StIn].Prevl=(ushort)(IPL); \
62 stack[StIn].Prevr=(ushort)(IPR); \
63 stack[StIn].fl=(short)(FL); \
67 Y=stack[StIn].y; \
68 IL=stack[StIn].l; \
69 IR=stack[StIn].r;\
70 IPL=stack[StIn].Prevl;
94 Seg *stack = (Seg*)pStack; local
486 void* stack = 0; local
[all...] |
| /packages/apps/UnifiedEmail/src/com/android/emailcommon/internet/ |
| MimeMessage.java | 45 import java.util.Stack;
540 private final Stack<Object> stack = new Stack<Object>(); field in class:MimeMessage.MimeMessageBuilder
546 if (!c.isInstance(stack.peek())) {
547 throw new IllegalStateException("Internal stack error: " + "Expected '"
548 + c.getName() + "' found '" + stack.peek().getClass().getName() + "'");
554 if (stack.isEmpty()) {
555 stack.push(MimeMessage.this);
560 ((Part)stack.peek()).setBody(m)
[all...] |
| /external/valgrind/main/memcheck/tests/x86-linux/ |
| scalar.stderr.exp | 32 Address 0x........ is not stack'd, malloc'd or (recently) free'd
52 Address 0x........ is not stack'd, malloc'd or (recently) free'd
68 Address 0x........ is not stack'd, malloc'd or (recently) free'd
102 Address 0x........ is not stack'd, malloc'd or (recently) free'd
118 Address 0x........ is not stack'd, malloc'd or (recently) free'd
134 Address 0x........ is not stack'd, malloc'd or (recently) free'd
139 Address 0x........ is not stack'd, malloc'd or (recently) free'd
151 Address 0x........ is not stack'd, malloc'd or (recently) free'd
171 Address 0x........ is not stack'd, malloc'd or (recently) free'd
183 Address 0x........ is not stack'd, malloc'd or (recently) free'
[all...] |
