|
| 1 | +/* |
| 2 | + * Copyright (c) 2026 Sonu Kumar |
| 3 | + * |
| 4 | + * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | + * You may not use this file except in compliance with the License. |
| 6 | + * You may obtain a copy of the License at |
| 7 | + * |
| 8 | + * https://www.apache.org/licenses/LICENSE-2.0 |
| 9 | + * |
| 10 | + * Unless required by applicable law or agreed to in writing, software |
| 11 | + * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | + * See the License for the specific language governing permissions and limitations under the License. |
| 14 | + * |
| 15 | + */ |
| 16 | + |
| 17 | +package com.github.sonus21.rqueue.listener; |
| 18 | + |
| 19 | +import com.github.sonus21.rqueue.core.RqueueBeanProvider; |
| 20 | +import com.github.sonus21.rqueue.core.middleware.Middleware; |
| 21 | +import com.github.sonus21.rqueue.listener.RqueueMessageListenerContainer.QueueStateMgr; |
| 22 | +import com.github.sonus21.rqueue.utils.Constants; |
| 23 | +import com.github.sonus21.rqueue.utils.QueueThreadPool; |
| 24 | +import com.github.sonus21.rqueue.utils.TimeoutUtils; |
| 25 | +import java.util.ArrayList; |
| 26 | +import java.util.HashMap; |
| 27 | +import java.util.List; |
| 28 | +import java.util.Map; |
| 29 | +import java.util.function.Function; |
| 30 | +import java.util.stream.Collectors; |
| 31 | +import org.slf4j.event.Level; |
| 32 | +import org.springframework.messaging.MessageHeaders; |
| 33 | + |
| 34 | +/** |
| 35 | + * Use it only with priority queues. Message processing can be slow. The hard strict priority |
| 36 | + * algorithm is better in HardStrictPriorityPoller than in StrictPriorityPoller More details see in |
| 37 | + * <a href="https://github.com/sonus21/rqueue/issues/276">GitHub project issue</a> |
| 38 | + */ |
| 39 | +class HardStrictPriorityPoller extends RqueueMessagePoller { |
| 40 | + |
| 41 | + private final RqueueBeanProvider rqueueBeanProvider; |
| 42 | + |
| 43 | + private final Map<String, QueueDetail> queueNameToDetail; |
| 44 | + private final Map<String, QueueThreadPool> queueNameToThread; |
| 45 | + private final Map<String, Long> queueDeactivationTime = new HashMap<>(); |
| 46 | + private final HardStrictPriorityPollerProperties hardStrictPriorityPollerProperties; |
| 47 | + |
| 48 | + HardStrictPriorityPoller( |
| 49 | + String groupName, |
| 50 | + final List<QueueDetail> queueDetails, |
| 51 | + final Map<String, QueueThreadPool> queueNameToThread, |
| 52 | + RqueueBeanProvider rqueueBeanProvider, |
| 53 | + QueueStateMgr queueStateMgr, |
| 54 | + List<Middleware> middlewares, |
| 55 | + long pollingInterval, |
| 56 | + long backoffTime, |
| 57 | + PostProcessingHandler postProcessingHandler, |
| 58 | + MessageHeaders messageHeaders, |
| 59 | + HardStrictPriorityPollerProperties hardStrictPriorityPollerProperties) { |
| 60 | + super( |
| 61 | + "HardStrict-" + groupName, |
| 62 | + rqueueBeanProvider, |
| 63 | + queueStateMgr, |
| 64 | + middlewares, |
| 65 | + pollingInterval, |
| 66 | + backoffTime, |
| 67 | + postProcessingHandler, |
| 68 | + messageHeaders); |
| 69 | + |
| 70 | + this.rqueueBeanProvider = rqueueBeanProvider; |
| 71 | + // Sort queues by priority once during initialization |
| 72 | + List<QueueDetail> queueDetailList = new ArrayList<>(queueDetails); |
| 73 | + queueDetailList.sort( |
| 74 | + (o1, o2) -> |
| 75 | + o2.getPriority().get(Constants.DEFAULT_PRIORITY_KEY) |
| 76 | + - o1.getPriority().get(Constants.DEFAULT_PRIORITY_KEY)); |
| 77 | + |
| 78 | + this.queues = queueDetailList.stream().map(QueueDetail::getName).collect(Collectors.toList()); |
| 79 | + this.queueNameToDetail = |
| 80 | + queueDetailList.stream() |
| 81 | + .collect(Collectors.toMap(QueueDetail::getName, Function.identity())); |
| 82 | + this.queueNameToThread = queueNameToThread; |
| 83 | + this.hardStrictPriorityPollerProperties = |
| 84 | + hardStrictPriorityPollerProperties != null |
| 85 | + ? hardStrictPriorityPollerProperties |
| 86 | + : new HardStrictPriorityPollerProperties(); |
| 87 | + } |
| 88 | + |
| 89 | + @Override |
| 90 | + public void start() { |
| 91 | + log(Level.DEBUG, "Running, Ordered Queues: {}", null, queues); |
| 92 | + while (true) { |
| 93 | + if (shouldExit()) { |
| 94 | + return; |
| 95 | + } |
| 96 | + |
| 97 | + boolean messageFoundInAnyQueue = false; |
| 98 | + |
| 99 | + try { |
| 100 | + for (String queue : queues) { |
| 101 | + if (eligibleForPolling(queue) && !isDeactivated(queue)) { |
| 102 | + QueueThreadPool queueThreadPool = queueNameToThread.get(queue); |
| 103 | + QueueDetail queueDetail = queueNameToDetail.get(queue); |
| 104 | + poll(-1, queue, queueDetail, queueThreadPool); |
| 105 | + |
| 106 | + if (hardStrictPriorityPollerProperties.getAfterPollSleepInterval() != null) { |
| 107 | + TimeoutUtils.sleepLog( |
| 108 | + hardStrictPriorityPollerProperties.getAfterPollSleepInterval(), false); |
| 109 | + } |
| 110 | + |
| 111 | + if (existMessagesInCurrentQueueOrHigherPriorityQueue(queue, queues)) { |
| 112 | + // break current cycle and start new cycle |
| 113 | + // it allow to process queue with the higher priority |
| 114 | + messageFoundInAnyQueue = true; |
| 115 | + break; |
| 116 | + } |
| 117 | + } |
| 118 | + } |
| 119 | + |
| 120 | + // If no messages were found across all queues, sleep for the polling interval |
| 121 | + if (!messageFoundInAnyQueue) { |
| 122 | + TimeoutUtils.sleepLog(pollingInterval, false); |
| 123 | + } |
| 124 | + |
| 125 | + } catch (Throwable e) { |
| 126 | + log(Level.ERROR, "Exception in the poller {}", e, e.getMessage()); |
| 127 | + if (shouldExit()) { |
| 128 | + return; |
| 129 | + } |
| 130 | + TimeoutUtils.sleepLog(backoffTime, false); |
| 131 | + } |
| 132 | + } |
| 133 | + } |
| 134 | + |
| 135 | + boolean existMessagesInCurrentQueueOrHigherPriorityQueue( |
| 136 | + String currentQueue, List<String> queues) { |
| 137 | + for (String queue : queues) { |
| 138 | + if (eligibleForPolling(queue) && !isDeactivated(queue)) { |
| 139 | + QueueDetail queueDetail = queueNameToDetail.get(queue); |
| 140 | + if (existAvailableMessagesForPoll(queueDetail)) { |
| 141 | + // the current or higher priority queue contains messages that need to be processed. |
| 142 | + return true; |
| 143 | + } |
| 144 | + } |
| 145 | + // we check all queues from the highest priority to current queue |
| 146 | + if (queue.equals(currentQueue)) { |
| 147 | + return false; |
| 148 | + } |
| 149 | + } |
| 150 | + // unexpected behavior, need more details if it occurs |
| 151 | + log(Level.WARN, "current queue '{}' not found in queues list '{}'", null, currentQueue, queues); |
| 152 | + return false; |
| 153 | + } |
| 154 | + |
| 155 | + protected boolean existAvailableMessagesForPoll(QueueDetail queueDetail) { |
| 156 | + boolean readyMessagesExists = |
| 157 | + rqueueBeanProvider |
| 158 | + .getRqueueMessageTemplate() |
| 159 | + .findFirstElementFromList(queueDetail.getQueueName()) |
| 160 | + .isPresent(); |
| 161 | + if (readyMessagesExists) { |
| 162 | + log( |
| 163 | + Level.TRACE, |
| 164 | + "readyMessages exists for queue '{}', existAvailableMessagesForPoll = true.", |
| 165 | + null, |
| 166 | + queueDetail.getName()); |
| 167 | + return true; |
| 168 | + } |
| 169 | + |
| 170 | + // Only check delayed messages with score <= current time |
| 171 | + long currentTime = System.currentTimeMillis(); |
| 172 | + boolean delayedMessagesExists = |
| 173 | + rqueueBeanProvider |
| 174 | + .getRqueueMessageTemplate() |
| 175 | + .findFirstElementFromZsetWithScore(queueDetail.getScheduledQueueName()) |
| 176 | + .filter(element -> element.getScore() <= currentTime) |
| 177 | + .isPresent(); |
| 178 | + |
| 179 | + if (delayedMessagesExists) { |
| 180 | + log( |
| 181 | + Level.TRACE, |
| 182 | + "delayedMessages exists for scheduled queue '{}' and currentTime '{}'," |
| 183 | + + " existAvailableMessagesForPoll = true.", |
| 184 | + null, |
| 185 | + queueDetail.getScheduledQueueName(), |
| 186 | + currentTime); |
| 187 | + return true; |
| 188 | + } |
| 189 | + |
| 190 | + return false; |
| 191 | + } |
| 192 | + |
| 193 | + private boolean isDeactivated(String queue) { |
| 194 | + Long deactivationTime = queueDeactivationTime.get(queue); |
| 195 | + if (deactivationTime == null) { |
| 196 | + return false; |
| 197 | + } |
| 198 | + if (System.currentTimeMillis() - deactivationTime > pollingInterval) { |
| 199 | + queueDeactivationTime.remove(queue); |
| 200 | + return false; |
| 201 | + } |
| 202 | + return true; |
| 203 | + } |
| 204 | + |
| 205 | + @Override |
| 206 | + long getSemaphoreWaitTime() { |
| 207 | + return hardStrictPriorityPollerProperties.getSemaphoreWaitTime() != null |
| 208 | + ? hardStrictPriorityPollerProperties.getSemaphoreWaitTime() |
| 209 | + : 20L; |
| 210 | + } |
| 211 | + |
| 212 | + @Override |
| 213 | + void deactivate(int index, String queue, DeactivateType deactivateType) { |
| 214 | + if (deactivateType == DeactivateType.POLL_FAILED) { |
| 215 | + // Pause in case of connection errors or polling failures |
| 216 | + TimeoutUtils.sleepLog(backoffTime, false); |
| 217 | + } else { |
| 218 | + // Mark deactivation time if the queue is empty |
| 219 | + queueDeactivationTime.put(queue, System.currentTimeMillis()); |
| 220 | + } |
| 221 | + } |
| 222 | +} |
0 commit comments