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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
|
/* VoidPluginCallRequest -- represent Java-to-JavaScript requests
Copyright (C) 2008 Red Hat
This file is part of IcedTea.
IcedTea is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
IcedTea is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with IcedTea; see the file COPYING. If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.
Linking this library statically or dynamically with other modules is
making a combined work based on this library. Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.
As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module. An independent module is a module which is not derived from
or based on this library. If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so. If you do not wish to do so, delete this
exception statement from your version. */
package sun.applet;
import java.util.ArrayList;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.LinkedList;
class PluginMessageConsumer {
private static int MAX_PARALLEL_INITS = 1;
// Each initialization requires 5 responses (tag, handle, width, proxy, cookie)
// before the message stack unlocks/collapses. This works out well because we
// want to allow upto 5 parallel tasks anyway
private static int MAX_WORKERS = MAX_PARALLEL_INITS * 4;
private static int PRIORITY_WORKERS = MAX_PARALLEL_INITS * 2;
private static Hashtable<Integer, PluginMessageHandlerWorker> initWorkers = new Hashtable<Integer, PluginMessageHandlerWorker>(2);
LinkedList<String> readQueue = new LinkedList<String>();
private static LinkedList<String> priorityWaitQueue = new LinkedList<String>();
ArrayList<PluginMessageHandlerWorker> workers = new ArrayList<PluginMessageHandlerWorker>();
PluginStreamHandler streamHandler = null;
AppletSecurity as;
ConsumerThread consumerThread = new ConsumerThread();
private static ArrayList<Integer> processedIds = new ArrayList<Integer>();
/**
* Registers a reference to wait for. Responses to registered priority
* references get handled by priority worker if normal workers are busy.
*
* @param reference The reference to give priority to
*/
public static void registerPriorityWait(Long reference) {
PluginDebug.debug("Registering priority for reference " + reference);
registerPriorityWait("reference " + reference.toString());
}
/**
* Registers a string to wait for.
*
* @param searchString the string to look for in a response
*/
public static void registerPriorityWait(String searchString) {
PluginDebug.debug("Registering priority for string " + searchString);
synchronized (priorityWaitQueue) {
if (!priorityWaitQueue.contains(searchString))
priorityWaitQueue.add(searchString);
}
}
/**
* Unregisters a priority reference to wait for.
*
* @param reference The reference to remove
*/
public static void unRegisterPriorityWait(Long reference) {
unRegisterPriorityWait(reference.toString());
}
/**
* Unregisters a priority string to wait for.
*
* @param searchString The string to unregister from the priority list
*/
public static void unRegisterPriorityWait(String searchString) {
synchronized (priorityWaitQueue) {
priorityWaitQueue.remove(searchString);
}
}
public PluginMessageConsumer(PluginStreamHandler streamHandler) {
as = new AppletSecurity();
this.streamHandler = streamHandler;
this.consumerThread.start();
}
private String getPriorityStrIfPriority(String message) {
// Destroy messages are permanently high priority
if (message.endsWith("destroy"))
return "destroy";
synchronized (priorityWaitQueue) {
Iterator<String> it = priorityWaitQueue.iterator();
while (it.hasNext()) {
String priorityStr = it.next();
if (message.indexOf(priorityStr) > 0)
return priorityStr;
}
}
return null;
}
private void addToInitWorkers(Integer instanceNum, PluginMessageHandlerWorker worker) {
synchronized (initWorkers) {
initWorkers.put(instanceNum, worker);
}
}
public void notifyWorkerIsFree(PluginMessageHandlerWorker worker) {
synchronized (initWorkers) {
Iterator<Integer> i = initWorkers.keySet().iterator();
while (i.hasNext()) {
Integer key = i.next();
if (initWorkers.get(key).equals(worker)) {
processedIds.add(key);
initWorkers.remove(key);
}
}
}
consumerThread.interrupt();
}
public void queue(String message) {
synchronized (readQueue) {
readQueue.addLast(message);
}
// Wake that lazy consumer thread
consumerThread.interrupt();
}
protected class ConsumerThread extends Thread {
/**
* Scans the readQueue for priority messages and brings them to the front
*/
private void bringPriorityMessagesToFront() {
synchronized (readQueue) {
// iterate through the list
for (int i = 0; i < readQueue.size(); i++) {
// remove element at i to inspect it
String message = readQueue.remove(i);
// if element at i is a priority msg, bring it forward
if (getPriorityStrIfPriority(message) != null) {
readQueue.addFirst(message);
} else { // else keep it where it was
readQueue.add(i, message);
}
// by the end the queue size is the same, so the
// position indicator (i) is still valid
}
}
}
public void run() {
while (true) {
String message = null;
synchronized (readQueue) {
message = readQueue.poll();
}
if (message != null) {
String[] msgParts = message.split(" ");
String priorityStr = getPriorityStrIfPriority(message);
boolean isPriorityResponse = (priorityStr != null);
//PluginDebug.debug("Message " + message + " (priority=" + isPriorityResponse + ") ready to be processed. Looking for free worker...");
final PluginMessageHandlerWorker worker = getFreeWorker(isPriorityResponse);
if (worker == null) {
synchronized (readQueue) {
readQueue.addFirst(message);
}
// re-scan to see if any priority message came in
bringPriorityMessagesToFront();
continue; // re-loop to try next msg
}
if (msgParts[2].equals("tag"))
addToInitWorkers((new Integer(msgParts[1])), worker);
if (isPriorityResponse) {
unRegisterPriorityWait(priorityStr);
}
worker.setmessage(message);
worker.interrupt();
} else {
try {
Thread.sleep(1000);
} catch (InterruptedException ie) {
}
}
}
}
}
private PluginMessageHandlerWorker getFreeWorker(boolean prioritized) {
for (PluginMessageHandlerWorker worker : workers) {
if (worker.isFree(prioritized)) {
PluginDebug.debug("Found free worker (" + worker.isPriority() + ") with id " + worker.getWorkerId());
// mark it busy before returning
worker.busy();
return worker;
}
}
// If we have less than MAX_WORKERS, create a new worker
if (workers.size() <= MAX_WORKERS) {
PluginMessageHandlerWorker worker = null;
if (workers.size() < (MAX_WORKERS - PRIORITY_WORKERS)) {
PluginDebug.debug("Cannot find free worker, creating worker " + workers.size());
worker = new PluginMessageHandlerWorker(this, streamHandler, workers.size(), as, false);
} else if (prioritized) {
PluginDebug.debug("Cannot find free worker, creating priority worker " + workers.size());
worker = new PluginMessageHandlerWorker(this, streamHandler, workers.size(), as, true);
} else {
return null;
}
worker.start();
worker.busy();
workers.add(worker);
return worker;
}
// No workers available. Better luck next time!
return null;
}
}
|