Showing the changes to java/pkg/com/sun/tools/example/debug/tty/ThreadGroupIterator.java (1 of 18352 files). Show all
Unified · Split
| @@ -0,0 +1,104 @@ | |||
| 1 | /* | ||
| 2 | * Copyright (c) 1998, 2008, Oracle and/or its affiliates. All rights reserved. | ||
| 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | ||
| 4 | * | ||
| 5 | * This code is free software; you can redistribute it and/or modify it | ||
| 6 | * under the terms of the GNU General Public License version 2 only, as | ||
| 7 | * published by the Free Software Foundation. Oracle designates this | ||
| 8 | * particular file as subject to the "Classpath" exception as provided | ||
| 9 | * by Oracle in the LICENSE file that accompanied this code. | ||
| 10 | * | ||
| 11 | * This code is distributed in the hope that it will be useful, but WITHOUT | ||
| 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | ||
| 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | ||
| 14 | * version 2 for more details (a copy is included in the LICENSE file that | ||
| 15 | * accompanied this code). | ||
| 16 | * | ||
| 17 | * You should have received a copy of the GNU General Public License version | ||
| 18 | * 2 along with this work; if not, write to the Free Software Foundation, | ||
| 19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | ||
| 20 | * | ||
| 21 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA | ||
| 22 | * or visit www.oracle.com if you need additional information or have any | ||
| 23 | * questions. | ||
| 24 | */ | ||
| 25 | |||
| 26 | package com.sun.tools.example.debug.tty; | ||
| 27 | |||
| 28 | import com.sun.jdi.ThreadGroupReference; | ||
| 29 | import java.util.List; | ||
| 30 | import java.util.Stack; | ||
| 31 | import java.util.ArrayList; | ||
| 32 | import java.util.Iterator; | ||
| 33 | |||
| 34 | /** | ||
| 35 | * Descend the tree of thread groups. | ||
| 36 | * @author Robert G. Field | ||
| 37 | */ | ||
| 38 | class ThreadGroupIterator implements Iterator<ThreadGroupReference> { | ||
| 39 | private final Stack<Iterator<ThreadGroupReference>> stack = new Stack<Iterator<ThreadGroupReference>>(); | ||
| 40 | |||
| 41 | ThreadGroupIterator(List<ThreadGroupReference> tgl) { | ||
| 42 | push(tgl); | ||
| 43 | } | ||
| 44 | |||
| 45 | ThreadGroupIterator(ThreadGroupReference tg) { | ||
| 46 | List<ThreadGroupReference> tgl = new ArrayList<ThreadGroupReference>(); | ||
| 47 | tgl.add(tg); | ||
| 48 | push(tgl); | ||
| 49 | } | ||
| 50 | |||
| 51 | ThreadGroupIterator() { | ||
| 52 | this(Env.vm().topLevelThreadGroups()); | ||
| 53 | } | ||
| 54 | |||
| 55 | private Iterator<ThreadGroupReference> top() { | ||
| 56 | return stack.peek(); | ||
| 57 | } | ||
| 58 | |||
| 59 | /** | ||
| 60 | * The invariant in this class is that the top iterator | ||
| 61 | * on the stack has more elements. If the stack is | ||
| 62 | * empty, there is no top. This method assures | ||
| 63 | * this invariant. | ||
| 64 | */ | ||
| 65 | private void push(List<ThreadGroupReference> tgl) { | ||
| 66 | stack.push(tgl.iterator()); | ||
| 67 | while (!stack.isEmpty() && !top().hasNext()) { | ||
| 68 | stack.pop(); | ||
| 69 | } | ||
| 70 | } | ||
| 71 | |||
| 72 | @Override | ||
| 73 | public boolean hasNext() { | ||
| 74 | return !stack.isEmpty(); | ||
| 75 | } | ||
| 76 | |||
| 77 | @Override | ||
| 78 | public ThreadGroupReference next() { | ||
| 79 | return nextThreadGroup(); | ||
| 80 | } | ||
| 81 | |||
| 82 | public ThreadGroupReference nextThreadGroup() { | ||
| 83 | ThreadGroupReference tg = top().next(); | ||
| 84 | push(tg.threadGroups()); | ||
| 85 | return tg; | ||
| 86 | } | ||
| 87 | |||
| 88 | @Override | ||
| 89 | public void remove() { | ||
| 90 | throw new UnsupportedOperationException(); | ||
| 91 | } | ||
| 92 | |||
| 93 | static ThreadGroupReference find(String name) { | ||
| 94 | ThreadGroupIterator tgi = new ThreadGroupIterator(); | ||
| 95 | while (tgi.hasNext()) { | ||
| 96 | ThreadGroupReference tg = tgi.nextThreadGroup(); | ||
| 97 | if (tg.name().equals(name)) { | ||
| 98 | return tg; | ||
| 99 | } | ||
| 100 | } | ||
| 101 | return null; | ||
| 102 | } | ||
| 103 | |||
| 104 | } | ||