/packages/apps/DocumentsUI/src/com/android/documentsui/ |
NavigationViewManager.java | 77 while (mState.stack.size() > position + 1) { 79 mState.stack.pop(); 100 if (mState.stack.size() <= 1) {
|
/packages/apps/DocumentsUI/src/com/android/documentsui/base/ |
State.java | 101 /** Current user navigation stack; empty implies recents. */ 102 public final DocumentStack stack = new DocumentStack(); field in class:State 131 DurableUtils.writeToParcel(out, stack); 153 DurableUtils.readFromParcel(in, state.stack);
|
/packages/apps/DocumentsUI/src/com/android/documentsui/dirlist/ |
DragStartListener.java | 129 invalidDest.add(mState.stack.peek());
|
/packages/apps/DocumentsUI/tests/unit/com/android/documentsui/base/ |
DocumentStackTest.java | 139 DocumentStack stack = new DocumentStack(mStack); local 141 assertEquals(2, stack.size()); 142 assertEquals(DIR_1, stack.get(0)); 143 assertEquals(DIR_2, stack.get(1)); 144 assertEquals(ROOT_1, stack.getRoot()); 153 DocumentStack stack = new DocumentStack(mStack); local 157 assertEquals(2, stack.size()); 158 assertEquals(DIR_1, stack.get(0)); 159 assertEquals(DIR_2, stack.get(1)); 160 assertEquals(ROOT_1, stack.getRoot()) [all...] |
/packages/apps/DocumentsUI/tests/unit/com/android/documentsui/services/ |
AbstractJobTest.java | 99 DocumentStack stack = local 106 .withDestination(stack)
|
/prebuilts/go/darwin-x86/src/runtime/race/testdata/ |
regression_test.go | 87 type stack []int type 89 func (s *stack) push(x int) { 93 func (s *stack) pop() int { 101 var s stack 102 go func(s *stack) {}(&s)
|
/prebuilts/go/linux-x86/src/runtime/race/testdata/ |
regression_test.go | 87 type stack []int type 89 func (s *stack) push(x int) { 93 func (s *stack) pop() int { 101 var s stack 102 go func(s *stack) {}(&s)
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++abi/libcxxabi/src/Unwind/ |
DwarfInstructions.hpp | 198 // By definition, the CFA is the stack pointer at the call site, so 228 pint_t stack[100]; local 229 pint_t *sp = stack; 234 for (pint_t *t = sp; t > stack; --t) { 253 // pop stack, dereference, push result 349 // push top of stack 353 fprintf(stderr, "duplicate top of stack\n"); 360 fprintf(stderr, "pop top of stack\n"); 368 fprintf(stderr, "duplicate second in stack\n"); 378 fprintf(stderr, "duplicate %d in stack\n", reg) [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/emma/core/java12/com/vladium/logging/ |
Logger.java | 269 * Logs 'msg' from an unnamed calling method followed by the 'throwable' stack 283 * Logs 'msg' from a given calling method followed by the 'throwable' stack 310 * Returns the current top of the thread-local logger stack or the static 311 * Logger instance scoped to Logger.class if the stack is empty. 317 final LinkedList stack = (LinkedList) THREAD_LOCAL_STACK.get (); local 319 // [assertion: stack != null] 321 if (stack.isEmpty ()) 327 return (Logger) stack.getLast (); 340 final LinkedList stack = (LinkedList) THREAD_LOCAL_STACK.get (); local 341 stack.addLast (ctx) 355 final LinkedList stack = (LinkedList) THREAD_LOCAL_STACK.get (); local [all...] |
/frameworks/base/services/tests/servicestests/src/com/android/server/am/ |
ActivityTestsBase.java | 121 final ActivityStack stack = service.mStackSupervisor.getStack(stackId, local 123 stack.addTask(task, true, "creating test task"); 124 task.setStack(stack); 162 // No home stack is set. 183 // Called when moving activity to pinned stack. 200 final T stack = super.getStack(stackId, createStaticStackIfNeeded, createOnTop); local 202 if (stack != null || !createStaticStackIfNeeded) { 203 return stack; 224 // normally stack creation is done here. However we need to do it on demand since
|
/libcore/ojluni/src/main/java/java/util/stream/ |
Nodes.java | 963 Deque<N> stack = new ArrayDeque<>(8); local 1094 Deque<Node<T>> stack = initStack(); local 1148 Deque<N> stack = initStack(); local [all...] |
/frameworks/base/services/core/java/com/android/server/am/ |
ActivityStackSupervisor.java | 240 // Used to indicate if an object (e.g. stack) that we are trying to get 248 // at the top of its container (e.g. stack). 252 // (e.g. stack) is due to it moving to another container. 255 // Force the focus to change to the stack we are moving a task to.. 284 // provided stack id 328 /** Counter for next free stack ID to use for dynamic activity stacks. */ 340 /** The stack containing the launcher app. Assumed to always be attached to 344 /** The stack currently receiving input or launching the next activity. */ 347 /** If this is the same as mFocusedStack then the activity on the top of the focused stack has 348 * been resumed. If stacks are changing position this will hold the old stack until the ne 568 final ActivityStack stack; field in class:ActivityStackSupervisor.PendingActivityLaunch 801 ActivityStack stack = stacks.get(stackNdx); local 943 ActivityStack stack = mFocusedStack; local 963 final ActivityStack stack = stacks.get(stackNdx); local 994 final ActivityStack stack = stacks.get(stackNdx); local 1015 final ActivityStack stack = stacks.get(stackNdx); local 1037 final ActivityStack stack = stacks.get(stackNdx); local 1063 final ActivityStack stack = stacks.get(stackNdx); local 1080 final ActivityStack stack = stacks.get(stackNdx); local 1102 final ActivityStack stack = stacks.get(stackNdx); local 1218 final ActivityStack stack = stacks.get(j); local 1238 final ActivityStack stack = stacks.get(stackNdx); local 1399 final ActivityStack stack = task.getStack(); local 1928 final ActivityStack stack = r.getStack(); local 1942 final ActivityStack stack = r.getStack(); local 2011 final ActivityStack stack = stacks.get(stackNdx); local 2033 final ActivityStack stack = stacks.get(stackNdx); local 2090 final ActivityStack stack = stacks.get(stackNdx); local 2105 final ActivityStack stack = stacks.get(stackNdx); local 2214 final ActivityStack stack = activityDisplay.mStacks.get(i); local 2261 final ActivityStack stack = stacks.get(j); local 2289 final ActivityStack stack = getValidLaunchStackOnDisplay(displayId, r); local 2362 final ActivityStack stack = getStack(stackId); local 2390 final ActivityStack stack = getStack(stackId); local 2397 final ActivityStack stack = getStack(stackId); local 2419 final ActivityStack stack = getStack(fromStackId); local 2520 final ActivityStack stack = getStack(DOCKED_STACK_ID); local 2576 final PinnedActivityStack stack = getStack(PINNED_STACK_ID); local 2627 final ActivityStack stack = getStack(stackId); local 2818 final ActivityStack stack = local 2931 final ActivityStack stack = getStack(stackId, !CREATE_IF_NEEDED, !ON_TOP); local 2966 final PinnedActivityStack stack = getStack(PINNED_STACK_ID, CREATE_IF_NEEDED, ON_TOP); local 3053 final ActivityStack stack = r.getStack(); local 3081 final ActivityStack stack = stacks.get(stackNdx); local 3205 final ActivityStack stack = stacks.get(stackNdx); local 3276 final ActivityStack stack = r.getStack(); local 3300 final ActivityStack stack = r.getStack(); local 3366 final ActivityStack stack = task.getStack(); local 3395 final ActivityStack stack = stacks.get(stackNdx); local 3409 final ActivityStack stack = stacks.get(stackNdx); local 3438 final ActivityStack stack = stacks.get(stackNdx); local 3449 final ActivityStack stack = stacks.get(stackNdx); local 3504 final ActivityStack stack = stacks.get(stackNdx); local 3530 final ActivityStack stack = stacks.get(stackNdx); local 3539 ActivityStack stack = getStack(restoreStackId); local 3624 final ActivityStack stack = stacks.get(stackNdx); local 3719 ActivityStack stack = stacks.get(stackNdx); local 3755 final ActivityStack stack = stacks.get(stackNdx); local 4012 final ActivityStack stack = stacks.get(0); local 4082 ActivityStack stack = getStack(stackId); local 4319 final ActivityStack stack = stacks.get(stackNdx); local 4381 final ActivityStack stack = task.getStack(); local 5216 final ActivityStack stack = display.mStacks.get(j); local [all...] |
CompatModePackages.java | 368 final ActivityStack stack = mService.getFocusedStack(); local 369 ActivityRecord starting = stack.restartPackage(packageName); 392 stack.ensureActivitiesVisibleLocked(starting, 0, !PRESERVE_WINDOWS);
|
/frameworks/base/services/core/java/com/android/server/wm/ |
StackWindowController.java | 45 * Controller for the stack container. This is created by activity manager to link activity stacks 46 * to the stack container they use in window manager. 82 final TaskStack stack = dc.addStackToDisplay(stackId, onTop); local 83 stack.setController(this); 134 "positionChildAt: could not find stack for task=" + mContainer); 185 * Re-sizes a stack and its containing tasks. 187 * @param bounds New stack bounds. Passing in null sets the bounds to fullscreen. 188 * @param configs Configurations for tasks in the resized stack, keyed by task id. 189 * @param taskBounds Bounds for tasks in the resized stack, keyed by task id. 190 * @return True if the stack is now fullscreen 267 final TaskStack stack = mContainer; local [all...] |
/frameworks/support/v7/recyclerview/src/android/support/v7/util/ |
DiffUtil.java | 114 // instead of a recursive implementation, we keep our own stack to avoid potential stack 116 final List<Range> stack = new ArrayList<>(); local 118 stack.add(new Range(0, oldSize, 0, newSize)); 129 while (!stack.isEmpty()) { 130 final Range range = stack.remove(stack.size() - 1); 158 stack.add(left); 175 stack.add(right); [all...] |
/art/tools/ahat/src/heapdump/ |
AhatSnapshot.java | 153 StackTrace stack = inst.getStack(); local 154 if (stack != null) { 155 frames = stack.getFrames();
|
/dalvik/dx/src/com/android/dx/cf/code/ |
Simulator.java | 125 * Constructs an "illegal top-of-stack" exception, for the stack 129 return new SimException("stack mismatch: illegal " + 130 "top-of-stack for opcode"); 143 * to the actual array present on the stack, as long as what is 148 * actually present on the stack.</p> 150 * <p>In the case where there is a known-null on the stack where 168 * stack; is either an array type or a known-null 379 * over one extra stack slot to find the array. 381 ExecutionStack stack = frame.getStack() local 404 ExecutionStack stack = frame.getStack(); local 436 ExecutionStack stack = frame.getStack(); local 448 ExecutionStack stack = frame.getStack(); local 468 ExecutionStack stack = frame.getStack(); local 489 ExecutionStack stack = frame.getStack(); local 521 ExecutionStack stack = frame.getStack(); local [all...] |
/external/autotest/frontend/client/src/autotest/tko/ |
TestLabelManager.java | 42 private StackPanel stack = new StackPanel(); field in class:TestLabelManager 54 stack.showStack(STACK_CREATE); 56 stack.showStack(STACK_SELECT); 67 stack.add(selectPanel); 73 stack.add(createPanel); 80 dialogPanel.add(stack); 105 stack.showStack(STACK_CREATE); 108 stack.showStack(STACK_SELECT); 127 stack.showStack(STACK_SELECT); 160 if (stack.getSelectedIndex() == STACK_CREATE) [all...] |
/external/bison/lib/ |
timevar.c | 146 /* If this variable is timed independently of the timing stack, 158 the timing stack. */ 162 /* An element on the timing stack. Elapsed time is attributed to the 163 topmost timing variable on the stack. */ 167 /* The timing variable at this stack level. */ 170 /* The next lower timing variable context in the stack. */ 178 /* The top of the timing stack. */ 179 static struct timevar_stack_def *stack; variable in typeref:struct:timevar_stack_def 185 /* The time at which the topmost element on the timing stack was 276 /* Push TIMEVAR onto the timing stack. No further elapsed time i [all...] |
/external/boringssl/src/crypto/bn/ |
ctx.c | 67 /* The stack frame info is resizing, set a first-time expansion size; */ 82 /* Stack depth and allocation size */ 95 /* A wrapper to manage the "stack frames" */ 97 /* Array of indexes into the bignum stack */ 99 /* Number of stack frames, and the size of the allocated array */ 116 /* The "stack frames", if you will */ 117 BN_STACK stack; member in struct:bignum_ctx 120 /* Depth of stack overflow */ 135 BN_STACK_init(&ret->stack); 147 BN_STACK_finish(&ctx->stack); [all...] |
/external/compiler-rt/lib/msan/ |
msan_report.cc | 48 " in the stack frame of function '%s%s%s'%s\n", 66 StackTrace stack; local 67 o = o.getNextChainedOrigin(&stack); 70 stack.Print(); 77 StackTrace stack = o.getStackTraceForHeapOrigin(); local 78 switch (stack.tag) { 95 stack.Print(); 99 void ReportUMR(StackTrace *stack, u32 origin) { 108 stack->Print(); 112 ReportErrorSummary("use-of-uninitialized-value", stack); [all...] |
/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_stackdepot.cc | 27 uptr stack[1]; // [size] member in struct:__sanitizer::StackDepotNode 31 // We use these bits to store the per-stack use counter. 45 if (stack[i] != args.trace[i]) return false; 78 internal_memcpy(stack, args.trace, size * sizeof(uptr)); 81 return args_type(&stack[0], size, tag); 111 u32 StackDepotPut(StackTrace stack) { 112 StackDepotHandle h = theDepot.Put(stack); 116 StackDepotHandle StackDepotPut_WithHandle(StackTrace stack) { 117 return theDepot.Put(stack);
|
/external/compiler-rt/lib/tsan/rtl/ |
tsan_report.h | 60 ReportStack *stack; member in struct:__tsan::ReportMop 81 ReportStack *stack; member in struct:__tsan::ReportLocation 94 ReportStack *stack; member in struct:__tsan::ReportThread 101 ReportStack *stack; member in struct:__tsan::ReportMutex 126 void PrintStack(const ReportStack *stack);
|
/external/elfutils/libdwfl/ |
frame_unwind.c | 39 /* Maximum number of DWARF expression stack slots before returning an error. */ 111 do_push (struct eval_stack *stack, Dwarf_Addr val) 113 if (stack->used >= DWARF_EXPR_STACK_MAX) 118 if (stack->used == stack->allocated) 120 stack->allocated = MAX (stack->allocated * 2, 32); 122 new_addrs = realloc (stack->addrs, 123 stack->allocated * sizeof (*stack->addrs)) 160 struct eval_stack stack = local [all...] |