Package org.apache.activemq.broker.region

Examples of org.apache.activemq.broker.region.MessageReference

62
63
64
65
66
67
68
69
70
71
    public void recover(ConnectionContext context, Topic topic, SubscriptionRecovery sub) throws Exception {
        // Re-dispatch the messages from the buffer.
        List copy = buffer.getMessages(sub.getActiveMQDestination());
        if (!copy.isEmpty()) {
            for (Iterator iter = copy.iterator(); iter.hasNext();) {
                MessageReference node = (MessageReference)iter.next();
                sub.addRecoveredMessage(context, node);
            }
        }
    }
View Full Code Here
53
54
55
56
57
58
59
60
61
62
        int delta = node.getMessageHardRef().getSize();
        synchronized (lock) {
            list.add(node);
            size += delta;
            while (size > maximumSize) {
                MessageReference evicted = list.removeFirst();
                size -= evicted.getMessageHardRef().getSize();
            }
        }
    }
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
80
    public Message[] browse(ActiveMQDestination destination) {
        List<Message> result = new ArrayList<Message>();
        DestinationFilter filter = DestinationFilter.parseFilter(destination);
        synchronized (lock) {
            for (Iterator<MessageReference> i = list.iterator(); i.hasNext();) {
                MessageReference ref = i.next();
                Message msg;
                msg = ref.getMessage();
                if (filter.matches(msg.getDestination())) {
                    result.add(msg);
                }

            }
View Full Code Here
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
        return this.iterator.hasNext();
    }
   
   
    public final synchronized MessageReference next() {
        MessageReference result = null;
        if (!this.batchList.isEmpty()&&this.iterator.hasNext()) {
            result = this.iterator.next();
        }
        last = result;
        if (result != null) {
            result.incrementReferenceCount();
        }
        return result;
    }
View Full Code Here
229
230
231
232
233
234
235
236
237
238
239
240
241
    }
   
   
    public final synchronized void gc() {
        for (Iterator<MessageReference>i = batchList.iterator();i.hasNext();) {
            MessageReference msg = i.next();
            rollback(msg.getMessageId());
            msg.decrementReferenceCount();
        }
        batchList.clear();
        clearIterator(false);
        batchResetNeeded = true;
        this.cacheEnabled=false;
View Full Code Here
130
131
132
133
134
135
136
137
       }
       return currentCursor != null ? currentCursor.hasNext() : false;
    }

    public synchronized MessageReference next() {
        MessageReference result = currentCursor != null ? currentCursor.next() : null;
        return result;
    }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
59
60
   
    public synchronized List<MessageReference> remove(ConnectionContext context, Destination destination)
            throws Exception {
        List<MessageReference> rc = new ArrayList<MessageReference>();
        for (Iterator<MessageReference> iterator = list.iterator(); iterator.hasNext();) {
            MessageReference r = iterator.next();
            if (r.getRegionDestination() == destination) {
                r.decrementReferenceCount();
                rc.add(r);
                iterator.remove();
            }
        }
        return rc;
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
    public synchronized boolean isEmpty() {
        if (list.isEmpty()) {
            return true;
        } else {
            for (Iterator<MessageReference> iterator = list.iterator(); iterator.hasNext();) {
                MessageReference node = iterator.next();
                if (node == QueueMessageReference.NULL_MESSAGE) {
                    continue;
                }
                if (!node.isDropped()) {
                    return false;
                }
                // We can remove dropped references.
                iterator.remove();
            }
View Full Code Here
158
159
160
161
162
163
164
165
166
167
     * clear all pending messages
     */
   
    public synchronized void clear() {
        for (Iterator<MessageReference> i = list.iterator(); i.hasNext();) {
            MessageReference ref = i.next();
            ref.decrementReferenceCount();
        }
        list.clear();
    }
View Full Code Here
180
181
182
183
184
185
186
187
188
189
190
191
     */
   
    public LinkedList<MessageReference> pageInList(int maxItems) {
        LinkedList<MessageReference> result = new LinkedList<MessageReference>();
        for (Iterator<MessageReference>i = list.iterator();i.hasNext();) {
            MessageReference ref = i.next();
            ref.incrementReferenceCount();
            result.add(ref);
            if (result.size() >= maxItems) {
                break;
            }
        }
View Full Code Here
TOP

Related Classes of org.apache.activemq.broker.region.MessageReference

  • org.apache.activemq.broker.region.cursors.AbstractStoreCursor
  • org.apache.activemq.broker.region.cursors.FilePendingMessageCursor
  • org.apache.activemq.broker.region.cursors.FilePendingMessageCursorTest
  • org.apache.activemq.broker.region.cursors.OrderedPendingList
  • org.apache.activemq.broker.region.cursors.StoreDurableSubscriberCursor
  • org.apache.activemq.broker.region.cursors.StoreQueueCursor
  • org.apache.activemq.broker.region.cursors.StoreQueueCursorNoDuplicateTest
  • org.apache.activemq.broker.region.cursors.StoreQueueCursorOrderTest
  • org.apache.activemq.broker.region.cursors.VMPendingMessageCursor
  • org.apache.activemq.broker.region.policy.FixedCountSubscriptionRecoveryPolicy
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.