Package org.apache.activemq.broker.region

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

48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
        this.propertyName = propertyName;
    }

    @Override
    public MessageReference[] evictMessages(LinkedList messages) throws IOException {
        MessageReference oldest = (MessageReference)messages.getFirst();
        HashMap<Object, MessageReference> pivots = new HashMap<Object, MessageReference>();
        Iterator iter = messages.iterator();

        for (int i = 0; iter.hasNext(); i++) {
            MessageReference reference = (MessageReference) iter.next();
            if (propertyName != null && reference.getMessage().getProperty(propertyName) != null) {
                Object key = reference.getMessage().getProperty(propertyName);
                if (pivots.containsKey(key)) {
                    MessageReference pivot = pivots.get(key);
                    if (reference.getMessage().getTimestamp() > pivot.getMessage().getTimestamp()) {
                         pivots.put(key, reference);
                    }
                } else {
                    pivots.put(key, reference);
                }
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
122
123
            assertFalse("cursor is not full " + usage.getTempUsage(), underTest.isFull());

            underTest.reset();
            long receivedCount = 0;
            while(underTest.hasNext()) {
                MessageReference ref = underTest.next();
                underTest.remove();
                assertEquals("id is correct", receivedCount++, ref.getMessageId().getProducerSequenceId());
            }
            assertEquals("got all messages back", receivedCount, numMessages);
            LOG.info("page count: " +pageFile.getPageCount());
            LOG.info("free count: " + pageFile.getFreePageCount());
            LOG.info("content size: " + pageFile.getPageContentSize());
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
        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
244
245
246
247
248
249
250
251
252
253
254
255
256
    }
   
   
    public 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;
        // wonder do we need to determine size here, it may change before restart
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
    public synchronized boolean isEmpty() {
        if (memoryList.isEmpty() && isDiskListEmpty()) {
            return true;
        }
        for (Iterator<MessageReference> iterator = memoryList.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
171
172
173
174
175
176
177
178
179
180
181
182
    @Override
    public synchronized LinkedList<MessageReference> pageInList(int maxItems) {
        LinkedList<MessageReference> result = new LinkedList<MessageReference>();
        int count = 0;
        for (Iterator<MessageReference> i = memoryList.iterator(); i.hasNext() && count < maxItems;) {
            MessageReference ref = i.next();
            ref.incrementReferenceCount();
            result.add(ref);
            count++;
        }
        if (count < maxItems && !isDiskListEmpty()) {
            for (Iterator<MessageReference> i = new DiskIterator(); i.hasNext() && count < maxItems;) {
View Full Code Here
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
    /**
     * @return the next pending message
     */
    @Override
    public synchronized MessageReference next() {
        MessageReference reference = iter.next();
        last = reference;
        if (!isDiskListEmpty()) {
            // got from disk
            reference.getMessage().setRegionDestination(regionDestination);
            reference.getMessage().setMemoryUsage(this.getSystemUsage().getMemoryUsage());
        }
        reference.incrementReferenceCount();
        return reference;
    }
View Full Code Here
410
411
412
413
414
415
416
417
418
419
420
421
422
    }

    protected synchronized void expireOldMessages() {
        if (!memoryList.isEmpty()) {
            for (Iterator<MessageReference> iterator = memoryList.iterator(); iterator.hasNext();) {
                MessageReference node = iterator.next();
                if (node.isExpired()) {
                    node.decrementReferenceCount();
                    discardExpiredMessage(node);
                    iterator.remove();
                }
            }
        }
View Full Code Here
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
             if (LOG.isTraceEnabled()) {
                start = System.currentTimeMillis();
                LOG.trace("" + name + ", flushToDisk() mem list size: " +memoryList.size()  + " " +  (systemUsage != null ? systemUsage.getMemoryUsage() : "") );
             }
            for (Iterator<MessageReference> iterator = memoryList.iterator(); iterator.hasNext();) {
                MessageReference node = iterator.next();
                node.decrementReferenceCount();
                ByteSequence bs;
                try {
                    bs = getByteSequence(node.getMessage());
                    getDiskList().addLast(node.getMessageId().toString(), bs);
                } catch (IOException e) {
                    LOG.error("Failed to write to disk list", e);
                    throw new RuntimeException(e);
                }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
            public boolean hasNext() {
                return next != null;
            }

            public MessageReference next() {
                MessageReference result = null;
                this.current = this.next;
                result = this.current.getMessage();
                this.next = (PendingNode) this.next.getNext();
                return result;
            }
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.