Searched refs:cycle (Results 1 - 9 of 9) sorted by relevance

/openjdk7/jdk/src/share/classes/javax/swing/
H A DSortingFocusTraversalPolicy.java36 * Components of a focus traversal cycle based on a given Comparator. Portions
41 * cycle. That is, during normal focus traversal, the Component
42 * traversed after a focus cycle root will be the focus-cycle-root's default
95 * before installing this FocusTraversalPolicy on a focus cycle root or
109 List<Component> cycle = new ArrayList<Component>();
110 enumerateAndSortCycle(aContainer, cycle);
111 return cycle;
113 private int getComponentIndex(List<Component> cycle, Component aComponent) { argument
116 index = Collections.binarySearch(cycle, aComponen
133 enumerateAndSortCycle(Container focusCycleRoot, List<Component> cycle) argument
140 enumerateCycle(Container container, List<Component> cycle) argument
[all...]
/openjdk7/jdk/src/share/classes/java/awt/
H A DContainerOrderFocusTraversalPolicy.java33 * of child Components in a Container. From a particular focus cycle root, the
40 * down-cycle. That is, during normal forward focus traversal, the Component
41 * traversed after a focus cycle root will be the focus-cycle-root's default
93 * 1) Making the focus traversal cycle.
94 * 2) Traversing the cycle.
96 * traversal cycle. The two methods mentioned above should implement this logic.
98 * cycle: traversing back and forth, retrieving the initial/default/first/last
106 List<Component> cycle = new ArrayList<Component>();
107 enumerateCycle(aContainer, cycle);
110 getComponentIndex(List<Component> cycle, Component aComponent) argument
114 enumerateCycle(Container container, List cycle) argument
[all...]
/openjdk7/hotspot/src/share/vm/runtime/
H A Dvm_operations.cpp227 DeadlockCycle* cycle = _deadlocks; local
228 while (cycle != NULL) {
229 DeadlockCycle* d = cycle;
230 cycle = cycle->next();
251 for (DeadlockCycle* cycle = _deadlocks; cycle != NULL; cycle = cycle->next()) {
253 cycle
[all...]
/openjdk7/jdk/src/macosx/native/jobjc/src/generator/java/com/apple/internal/jobjc/generator/
H A DUtils.java151 * If there is a cycle it is returned. Otherwise null is returned.
156 public final List<Framework> cycle;
157 public FoundCycle(List<Framework> cycle){
158 this.cycle = cycle;
175 catch(FoundCycle x){ return x.cycle; }
H A DFrameworkGenerator.java83 List<Framework> cycle = Utils.getDependencyCycle(frameworks);
84 if(cycle != null)
85 System.out.println("Warning: cycle found in framework dependencies: " + Fp.join(" -> ", cycle));
/openjdk7/hotspot/src/share/vm/services/
H A DthreadService.cpp306 DeadlockCycle* cycle = new DeadlockCycle(); local
318 cycle->reset();
321 // cycle must be contended and heavyweight. So we only care about the
328 cycle->add_thread(currentThread);
351 // Thread already visited, and not on a (new) cycle
357 // We have a (new) cycle
360 cycle->set_deadlock(true);
362 // add this cycle to the deadlocks list
364 deadlocks = cycle;
366 last->set_next(cycle);
[all...]
H A Dmanagement.cpp1931 DeadlockCycle* cycle; local
1932 for (cycle = deadlocks; cycle != NULL; cycle = cycle->next()) {
1933 num_threads += cycle->num_threads();
1940 for (cycle = deadlocks; cycle != NULL; cycle = cycle
[all...]
/openjdk7/jdk/src/share/classes/sun/tools/jconsole/
H A DThreadTab.java510 List<Long> cycle = new ArrayList<Long>();
513 // one thread can only be in one cycle
519 if (cycle.size() > 0) {
520 // a cycle found
521 dcycles.add(cycle.toArray(new Long[0]));
522 cycle = new ArrayList<Long>();
524 // start a new cycle from a non-visited thread
538 cycle.add(ids[deadlockedThread]);
/openjdk7/jdk/test/java/nio/channels/Selector/
H A DSelectorTest.java127 if (re.cycle()) {
275 boolean cycle() throws Exception { method in class:RemoteEntity

Completed in 57 milliseconds