blob: 3536013e043c665a90da8bc342e9f3fc68a2c9a4 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
package com.yahoo.vespa.http.client.core.communication;
import com.yahoo.vespa.http.client.core.Document;
import java.time.Clock;
import java.time.Duration;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.List;
import java.util.Optional;
import java.util.concurrent.TimeUnit;
/**
* Shared document queue that gives clients operations on documents which do not have operations already in flight.
* This is multithread safe.
*
* @author dybis
*/
class DocumentQueue {
private final Deque<Document> queue;
private final int maxSize;
private boolean closed = false;
private final Clock clock;
DocumentQueue(int maxSize, Clock clock) {
this.maxSize = maxSize;
this.queue = new ArrayDeque<>(maxSize);
this.clock = clock;
}
List<Document> removeAllDocuments() {
synchronized (queue) {
List<Document> allDocs = new ArrayList<>();
while (!queue.isEmpty()) {
allDocs.add(queue.poll());
}
queue.notifyAll();
return allDocs;
}
}
void put(Document document, boolean calledFromIoThreadGroup) throws InterruptedException {
document.setQueueInsertTime(clock.instant());
synchronized (queue) {
while (!closed && (queue.size() >= maxSize) && !calledFromIoThreadGroup) {
queue.wait();
}
if (closed) {
throw new IllegalStateException("Cannot add elements to closed queue.");
}
queue.add(document);
queue.notifyAll();
}
}
Document poll(long timeout, TimeUnit unit) throws InterruptedException {
synchronized (queue) {
long remainingToWait = unit.toMillis(timeout);
while (queue.isEmpty()) {
long startTime = clock.millis();
queue.wait(remainingToWait);
remainingToWait -= (clock.millis() - startTime);
if (remainingToWait <= 0) {
break;
}
}
Document document = queue.poll();
queue.notifyAll();
return document;
}
}
Document poll() {
synchronized (queue) {
Document document = queue.poll();
queue.notifyAll();
return document;
}
}
boolean isEmpty() {
synchronized (queue) {
return queue.isEmpty();
}
}
int size() {
synchronized (queue) {
return queue.size();
}
}
void clear() {
synchronized (queue) {
queue.clear();
queue.notifyAll();
}
}
boolean close() {
boolean previousState;
synchronized (queue) {
previousState = closed;
closed = true;
queue.notifyAll();
}
return previousState;
}
Optional<Document> pollDocumentIfTimedoutInQueue(Duration localQueueTimeOut) {
synchronized (queue) {
if (queue.isEmpty()) return Optional.empty();
Document document = queue.peek();
if (document.getQueueInsertTime().plus(localQueueTimeOut).isBefore(clock.instant()))
return Optional.ofNullable(queue.poll());
else
return Optional.empty();
}
}
}
|
