The Artima Developer Community
Sponsored Link

Legacy Java Answers Forum
October 2000

Advertisement

Advertisement

This page contains an archived post to the Java Answers Forum made prior to February 25, 2002. If you wish to participate in discussions, please visit the new Artima Forums.

Message:

activeCount() and enumerate() inconsistency

Posted by Jose Botella Rojas on October 04, 2000 at 2:59 PM

I was running the following example in the Bruce Eckel excellent
book Thinking in Java 2edt. when it printed a NullPointerException
in the marked line:

//: c14:ThreadGroup1.java
// From 'Thinking in Java, 2nd ed.' by Bruce Eckel
// www.BruceEckel.com. See copyright notice in CopyRight.txt.
// How thread groups control priorities
// of the threads inside them.

public class ThreadGroup1 {
public static void main(String[] args) {
// Get the system thread & print its Info:
ThreadGroup sys =
Thread.currentThread().getThreadGroup();
sys.list(); // (1)
// Reduce the system thread group priority:
sys.setMaxPriority(Thread.MAX_PRIORITY - 1);
// Increase the main thread priority:
Thread curr = Thread.currentThread();
curr.setPriority(curr.getPriority() + 1);
sys.list(); // (2)
// Attempt to set a new group to the max:
ThreadGroup g1 = new ThreadGroup("g1");
g1.setMaxPriority(Thread.MAX_PRIORITY);
// Attempt to set a new thread to the max:
Thread t = new Thread(g1, "A");
t.setPriority(Thread.MAX_PRIORITY);
g1.list(); // (3)
// Reduce g1's max priority, then attempt
// to increase it:
g1.setMaxPriority(Thread.MAX_PRIORITY - 2);
g1.setMaxPriority(Thread.MAX_PRIORITY);
g1.list(); // (4)
// Attempt to set a new thread to the max:
t = new Thread(g1, "B");
t.setPriority(Thread.MAX_PRIORITY);
g1.list(); // (5)
// Lower the max priority below the default
// thread priority:
g1.setMaxPriority(Thread.MIN_PRIORITY + 2);
// Look at a new thread's priority before
// and after changing it:
t = new Thread(g1, "C");
g1.list(); // (6)
t.setPriority(t.getPriority() -1);
g1.list(); // (7)
// Make g2 a child Threadgroup of g1 and
// try to increase its priority:
ThreadGroup g2 = new ThreadGroup(g1, "g2");
g2.list(); // (8)
g2.setMaxPriority(Thread.MAX_PRIORITY);
g2.list(); // (9)
// Add a bunch of new threads to g2:
for (int i = 0; i < 5; i++)
new Thread(g2, Integer.toString(i));
// Show information about all threadgroups
// and threads:
sys.list(); // (10)
System.out.println("Starting all threads:");
Thread[] all = new Thread[sys.activeCount()];
sys.enumerate(all);
for(int i = 0; i < all.length; i++)
if(!all[i].isAlive()) //THIS IS THE OFFENDING LINE
all[i].start();
// Suspends & Stops all threads in
// this group and its subgroups:
System.out.println("All threads started");
sys.suspend(); // Deprecated in Java 2
// Never gets here...
System.out.println("All threads suspended");
sys.stop(); // Deprecated in Java 2
System.out.println("All threads stopped");
}
} ///:~


So I tried the following snippet code that reproduces the same
error, unless you unremark the lines that start the threads:
"primera.start()" and "segunda.start()".
It seems that activeCount() returns the number of the "active"
threads created, regardless they were started or not; unlike
enumerate() that only return the references of those "active"
threads that has been started. In other words what an active
thread is?

Thank you for your attention.


public class Test5 {
public static void main(String[] args) {
print();
Thread primera = new Thread("primera");
print();
System.out.println(Thread.currentThread().getThreadGroup().activeCount());
Thread segunda = new Thread("segunda");
print();
int active = Thread.currentThread().getThreadGroup().activeCount();
System.out.println(active);
Thread[] list = new Thread[active];
//primera.start();
//segunda.start();
Thread.currentThread().getThreadGroup().enumerate(list);
printFor(list);
}
static void print() {
Thread.currentThread().getThreadGroup().list();
}
static void printFor(Thread[] list) {
for (int i=0; i System.out.println(list[i].getName());
}
}



Replies:

Sponsored Links



Google
  Web Artima.com   
Copyright © 1996-2009 Artima, Inc. All Rights Reserved. - Privacy Policy - Terms of Use - Advertise with Us