lock dispatching (again) whilst adding a consumer

git-svn-id: https://svn.apache.org/repos/asf/activemq/trunk@618689 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Robert Davies 2008-02-05 16:20:11 +00:00
parent ecc87ea672
commit f81d0d59d3
2 changed files with 86 additions and 83 deletions

View File

@ -129,9 +129,8 @@ public abstract class PrefetchSubscription extends AbstractSubscription {
synchronized (pendingLock) { synchronized (pendingLock) {
enqueueCounter++; enqueueCounter++;
pending.addMessageLast(node); pending.addMessageLast(node);
dispatchPending();
} }
dispatchPending();
} }
public void processMessageDispatchNotification(MessageDispatchNotification mdn) throws Exception { public void processMessageDispatchNotification(MessageDispatchNotification mdn) throws Exception {

View File

@ -22,6 +22,7 @@ import java.util.Iterator;
import java.util.LinkedHashMap; import java.util.LinkedHashMap;
import java.util.LinkedList; import java.util.LinkedList;
import java.util.List; import java.util.List;
import java.util.concurrent.locks.ReentrantLock;
import javax.jms.InvalidSelectorException; import javax.jms.InvalidSelectorException;
import javax.jms.JMSException; import javax.jms.JMSException;
@ -83,6 +84,7 @@ public class Queue extends BaseDestination implements Task {
private final Object sendLock = new Object(); private final Object sendLock = new Object();
private final TaskRunner taskRunner; private final TaskRunner taskRunner;
private final LinkedList<Runnable> messagesWaitingForSpace = new LinkedList<Runnable>(); private final LinkedList<Runnable> messagesWaitingForSpace = new LinkedList<Runnable>();
private final ReentrantLock dispatchLock = new ReentrantLock();
private final Runnable sendMessagesWaitingForSpaceTask = new Runnable() { private final Runnable sendMessagesWaitingForSpaceTask = new Runnable() {
public void run() { public void run() {
wakeup(); wakeup();
@ -98,7 +100,6 @@ public class Queue extends BaseDestination implements Task {
} else { } else {
this.messages = new StoreQueueCursor(broker,this); this.messages = new StoreQueueCursor(broker,this);
} }
this.taskRunner = taskFactory.createTaskRunner(this, "Queue " + destination.getPhysicalName()); this.taskRunner = taskFactory.createTaskRunner(this, "Queue " + destination.getPhysicalName());
this.log = LogFactory.getLog(getClass().getName() + "." + destination.getPhysicalName()); this.log = LogFactory.getLog(getClass().getName() + "." + destination.getPhysicalName());
} }
@ -173,6 +174,8 @@ public class Queue extends BaseDestination implements Task {
} }
public void addSubscription(ConnectionContext context, Subscription sub) throws Exception { public void addSubscription(ConnectionContext context, Subscription sub) throws Exception {
dispatchLock.lock();
try {
sub.add(context, this); sub.add(context, this);
destinationStatistics.getConsumers().increment(); destinationStatistics.getConsumers().increment();
MessageEvaluationContext msgContext = new MessageEvaluationContext(); MessageEvaluationContext msgContext = new MessageEvaluationContext();
@ -194,9 +197,10 @@ public class Queue extends BaseDestination implements Task {
} }
} }
// we hold the lock on the dispatchValue - so lets build the paged in // we hold the lock on the dispatchValue - so lets build the paged
// in
// list directly; // list directly;
buildList(false); doPageIn(false);
// synchronize with dispatch method so that no new messages are sent // synchronize with dispatch method so that no new messages are sent
// while // while
@ -208,9 +212,10 @@ public class Queue extends BaseDestination implements Task {
synchronized (pagedInMessages) { synchronized (pagedInMessages) {
// Add all the matching messages in the queue to the // Add all the matching messages in the queue to the
// subscription. // subscription.
for (Iterator<MessageReference> i = pagedInMessages.values().iterator(); i for (Iterator<MessageReference> i = pagedInMessages.values()
.hasNext();) { .iterator(); i.hasNext();) {
QueueMessageReference node = (QueueMessageReference) i.next(); QueueMessageReference node = (QueueMessageReference) i
.next();
if (node.isDropped() if (node.isDropped()
|| (!sub.getConsumerInfo().isBrowser() && node || (!sub.getConsumerInfo().isBrowser() && node
.getLockOwner() != null)) { .getLockOwner() != null)) {
@ -226,7 +231,9 @@ public class Queue extends BaseDestination implements Task {
} }
} }
} }
} finally {
dispatchLock.unlock();
}
} }
public void removeSubscription(ConnectionContext context, Subscription sub) public void removeSubscription(ConnectionContext context, Subscription sub)
@ -956,25 +963,19 @@ public class Queue extends BaseDestination implements Task {
wakeup(); wakeup();
} }
final synchronized void wakeup() { final void wakeup() {
try { try {
taskRunner.wakeup(); taskRunner.wakeup();
} catch (InterruptedException e) { } catch (InterruptedException e) {
log.warn("Task Runner failed to wakeup ", e); log.warn("Task Runner failed to wakeup ", e);
} }
} }
private List<MessageReference> doPageIn(boolean force) throws Exception { private List<MessageReference> doPageIn(boolean force) throws Exception {
List<MessageReference> result = null; List<MessageReference> result = null;
result = buildList(force); dispatchLock.lock();
return result; try {
}
private List<MessageReference> buildList(boolean force) throws Exception {
final int toPageIn = getMaxPageSize() - pagedInMessages.size(); final int toPageIn = getMaxPageSize() - pagedInMessages.size();
List<MessageReference> result = null;
if ((force || !consumers.isEmpty()) && toPageIn > 0) { if ((force || !consumers.isEmpty()) && toPageIn > 0) {
messages.setMaxBatchSize(toPageIn); messages.setMaxBatchSize(toPageIn);
int count = 0; int count = 0;
@ -1005,6 +1006,9 @@ public class Queue extends BaseDestination implements Task {
} }
} }
} }
}finally {
dispatchLock.unlock();
}
return result; return result;
} }