| /libcore/json/src/main/java/org/json/ |
| D | JSONStringer.java | 117 private final List<Scope> stack = new ArrayList<Scope>(); field in JSONStringer
181 if (stack.isEmpty() && out.length() > 0) { in open()
185 stack.add(empty); in open()
201 stack.remove(stack.size() - 1); in close()
214 if (stack.isEmpty()) { in peek()
217 return stack.get(stack.size() - 1); in peek()
225 stack.set(stack.size() - 1, topOfStack); in replaceTop()
237 if (stack.isEmpty()) { in value()
273 if (stack.isEmpty()) { in value()
289 if (stack.isEmpty()) { in value()
[all …]
|
| /libcore/ojluni/src/main/java/java/nio/file/ |
| D | FileTreeWalker.java | 61 private final ArrayDeque<DirectoryNode> stack = new ArrayDeque<>(); field in FileTreeWalker
239 for (DirectoryNode ancestor: stack) { in wouldLoop()
286 int depth = stack.size(); in visit()
310 stack.push(new DirectoryNode(entry, attrs.fileKey(), stream)); in visit()
334 DirectoryNode top = stack.peek(); in next()
367 stack.pop(); in next()
388 if (!stack.isEmpty()) { in pop()
389 DirectoryNode node = stack.pop(); in pop()
401 if (!stack.isEmpty()) { in skipRemainingSiblings()
402 stack.peek().skip(); in skipRemainingSiblings()
[all …]
|
| /libcore/dalvik/src/main/java/dalvik/system/ |
| D | CloseGuard.java | 259 Throwable stack = new Throwable(message); in openWithCallSite() local
260 closerNameOrAllocationInfo = stack; in openWithCallSite()
262 tracker.open(stack); in openWithCallSite()
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| D | StackTest.java | 133 Stack<Object> stack = new Stack<Object>(); in test_pushLjava_lang_Object() local
135 stack.push(array[i]); in test_pushLjava_lang_Object()
138 assertEquals(array.length - i, stack.search(array[i])); in test_pushLjava_lang_Object()
|
| /libcore/ojluni/src/main/java/java/util/logging/ |
| D | LogRecord.java | 560 StackTraceElement[] stack = VMStack.getThreadStackTrace(Thread.currentThread()); in inferCaller() local
561 int depth = stack.length; in inferCaller()
572 StackTraceElement frame = stack[ix]; in inferCaller()
|
| /libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
| D | CollectionAndMapModifyStreamTest.java | 69 Stack<Integer> stack = new Stack<>(); in createCollections() local
70 stack.addAll(content); in createCollections()
71 collections.add(stack); in createCollections()
|
| /libcore/luni/src/test/java/libcore/java/lang/ |
| D | ThreadTestHelper.smali | 35 # introduced so that the stack trace is a little bit more interesting.
87 # Added so the stack trace looks more interesting
|
| /libcore/ojluni/annotations/hiddenapi/java/nio/file/ |
| D | FileTreeWalker.java | 94 private final java.util.ArrayDeque<java.nio.file.FileTreeWalker.DirectoryNode> stack; field in FileTreeWalker
97 stack = null;
|
| /libcore/ojluni/src/main/java/java/io/ |
| D | ObjectOutputStream.java | 2533 private final List<String> stack; field in ObjectOutputStream.DebugTraceInfoStack
2536 stack = new ArrayList<>(); in DebugTraceInfoStack()
2543 stack.clear(); in clear()
2550 stack.remove(stack.size()-1); in pop()
2557 stack.add("\t- " + entry); in push()
2565 if (!stack.isEmpty()) { in toString()
2566 for(int i = stack.size(); i > 0; i-- ) { in toString()
2567 buffer.append(stack.get(i-1) + ((i != 1) ? "\n" : "")); in toString()
|
| /libcore/ojluni/src/test/java/util/stream/testlib/org/openjdk/testlib/java/util/stream/ |
| D | SpliteratorTestHelper.java | 528 Deque<SplitNode<T>> stack = new ArrayDeque<>(); in testSplitUntilNull() local
529 stack.push(e); in testSplitUntilNull()
532 while (!stack.isEmpty()) { in testSplitUntilNull()
535 e = stack.pop(); in testSplitUntilNull()
578 stack.push(e.fromSplit(parentAndRightSplit)); in testSplitUntilNull()
579 stack.push(e.fromSplit(leftSplit)); in testSplitUntilNull()
|
| /libcore/ojluni/src/test/java/util/stream/bootlib/java/util/stream/ |
| D | SpliteratorTestHelper.java | 528 Deque<SplitNode<T>> stack = new ArrayDeque<>(); in testSplitUntilNull() local
529 stack.push(e); in testSplitUntilNull()
532 while (!stack.isEmpty()) { in testSplitUntilNull()
535 e = stack.pop(); in testSplitUntilNull()
578 stack.push(e.fromSplit(parentAndRightSplit)); in testSplitUntilNull()
579 stack.push(e.fromSplit(leftSplit)); in testSplitUntilNull()
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| D | Nodes.java | 963 Deque<N> stack = new ArrayDeque<>(8); in initStack() local
965 stack.addFirst((N) curNode.getChild(i)); in initStack()
966 return stack; in initStack()
974 protected final N findNextLeafNode(Deque<N> stack) { in findNextLeafNode() argument
976 while ((n = stack.pollFirst()) != null) { in findNextLeafNode()
982 stack.addFirst((N) n.getChild(i)); in findNextLeafNode()
1094 Deque<Node<T>> stack = initStack(); in forEachRemaining() local
1096 while ((leaf = findNextLeafNode(stack)) != null) { in forEachRemaining()
1148 Deque<N> stack = initStack(); in forEachRemaining() local
1150 while ((leaf = findNextLeafNode(stack)) != null) { in forEachRemaining()
|
| /libcore/luni/src/test/java/libcore/java/lang/reflect/ |
| D | MethodTest.java | 648 StackTraceElement[] stack = Thread.currentThread().getStackTrace(); in identifyCaller() local
650 while (!stack[i++].getMethodName().equals("identifyCaller")) {} in identifyCaller()
651 return stack[i].getClassName(); in identifyCaller()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | CompletableFuture.java | 223 volatile Completion stack; // Top of Treiber stack of dependent actions field in CompletableFuture
235 Completion h = stack; in tryPushStack()
473 while ((h = f.stack) != null || in postComplete()
474 (f != this && (h = (f = this).stack) != null)) { in postComplete()
491 for (Completion p = null, q = stack; q != null;) { in cleanStack()
499 q = stack; in cleanStack()
507 q = stack; in cleanStack()
561 if (a != null && a.stack != null) { in postFire()
567 if (result != null && stack != null) { in postFire()
1085 if (b != null && b.stack != null) { // clean second source in postFire()
[all …]
|
| D | ConcurrentHashMap.java | 3355 TableStack<K,V> stack, spare; // to save/restore on ForwardingNodes field in ConcurrentHashMap.Traverser
3395 if (stack != null) in advance()
3414 s.next = stack; in pushState()
3415 stack = s; in pushState()
3425 while ((s = stack) != null && (index += (len = s.length)) >= n) { in recoverState()
3432 stack = next; in recoverState()
4880 TableStack<K,V> stack, spare; field in ConcurrentHashMap.BulkTask
4927 if (stack != null) in advance()
4943 s.next = stack; in pushState()
4944 stack = s; in pushState()
[all …]
|
| /libcore/ojluni/annotations/hiddenapi/java/io/ |
| D | ObjectOutputStream.java | 544 private final java.util.List<java.lang.String> stack; field in ObjectOutputStream.DebugTraceInfoStack
547 stack = null;
|
| /libcore/ |
| D | JavaLibrary.bp | 20 // Android software stack. It is made up of various parts, some of which can be
|
| /libcore/expectations/ |
| D | knownfailures.txt | 1438 description: "Recursive calls to Charset.forName from within providers will overflow the stack.",
|