1 |
| |
2 |
| |
3 |
| |
4 |
| |
5 |
| |
6 |
| |
7 |
| package org.jboss.cache.transaction; |
8 |
| |
9 |
| |
10 |
| import net.jcip.annotations.ThreadSafe; |
11 |
| import org.apache.commons.logging.Log; |
12 |
| import org.apache.commons.logging.LogFactory; |
13 |
| import org.jboss.cache.CacheSPI; |
14 |
| import org.jboss.cache.Fqn; |
15 |
| import org.jboss.cache.Modification; |
16 |
| import org.jboss.cache.config.Option; |
17 |
| import org.jboss.cache.lock.IdentityLock; |
18 |
| import org.jboss.cache.lock.NodeLock; |
19 |
| import org.jboss.cache.marshall.MethodCall; |
20 |
| |
21 |
| import javax.transaction.Transaction; |
22 |
| import java.util.ArrayList; |
23 |
| import java.util.Collection; |
24 |
| import java.util.Collections; |
25 |
| import java.util.LinkedHashSet; |
26 |
| import java.util.LinkedList; |
27 |
| import java.util.List; |
28 |
| import java.util.ListIterator; |
29 |
| import java.util.concurrent.CopyOnWriteArrayList; |
30 |
| |
31 |
| |
32 |
| |
33 |
| |
34 |
| |
35 |
| |
36 |
| |
37 |
| |
38 |
| |
39 |
| |
40 |
| |
41 |
| |
42 |
| |
43 |
| |
44 |
| |
45 |
| |
46 |
| |
47 |
| @ThreadSafe |
48 |
| public class TransactionEntry |
49 |
| { |
50 |
| |
51 |
| private static Log log = LogFactory.getLog(TransactionEntry.class); |
52 |
| |
53 |
| |
54 |
| |
55 |
| |
56 |
| private Transaction ltx = null; |
57 |
| private Option option; |
58 |
| |
59 |
| private boolean forceAsyncReplication = false; |
60 |
| |
61 |
| |
62 |
| |
63 |
| |
64 |
| private List<MethodCall> modification_list = new LinkedList<MethodCall>(); |
65 |
| |
66 |
| |
67 |
| |
68 |
| private List<MethodCall> cl_mod_list = new CopyOnWriteArrayList<MethodCall>(); |
69 |
| |
70 |
| |
71 |
| |
72 |
| |
73 |
| |
74 |
| |
75 |
| |
76 |
| private final List<MethodCall> undo_list = new LinkedList<MethodCall>(); |
77 |
| |
78 |
| |
79 |
| |
80 |
| |
81 |
| |
82 |
| |
83 |
| |
84 |
| private LinkedHashSet<NodeLock> locks = new LinkedHashSet<NodeLock>(); |
85 |
| |
86 |
| |
87 |
| |
88 |
| |
89 |
| |
90 |
| private List<Fqn> dummyNodesCreatedByCacheLoader; |
91 |
| |
92 |
| |
93 |
| |
94 |
| |
95 |
| private List<Fqn> removedNodes = new LinkedList<Fqn>(); |
96 |
| |
97 |
| |
98 |
| |
99 |
| |
100 |
1121973
| public TransactionEntry()
|
101 |
| { |
102 |
| } |
103 |
| |
104 |
| |
105 |
| |
106 |
| |
107 |
168022
| public void addModification(MethodCall m)
|
108 |
| { |
109 |
0
| if (m == null) return;
|
110 |
168022
| modification_list.add(m);
|
111 |
| } |
112 |
| |
113 |
41080
| public void addCacheLoaderModification(MethodCall m)
|
114 |
| { |
115 |
41080
| if (m != null) cl_mod_list.add(m);
|
116 |
| } |
117 |
| |
118 |
| |
119 |
| |
120 |
| |
121 |
2243444
| public List<MethodCall> getModifications()
|
122 |
| { |
123 |
2243444
| return modification_list;
|
124 |
| } |
125 |
| |
126 |
40703
| public List<MethodCall> getCacheLoaderModifications()
|
127 |
| { |
128 |
| |
129 |
40703
| return Collections.unmodifiableList(cl_mod_list);
|
130 |
| } |
131 |
| |
132 |
| |
133 |
| |
134 |
| |
135 |
| |
136 |
| |
137 |
183190
| public void addUndoOperation(MethodCall m)
|
138 |
| { |
139 |
183190
| undo_list.add(m);
|
140 |
| } |
141 |
| |
142 |
| |
143 |
| |
144 |
| |
145 |
| |
146 |
| |
147 |
10853
| public void addRemovedNode(Fqn fqn)
|
148 |
| { |
149 |
10853
| removedNodes.add(fqn);
|
150 |
| } |
151 |
| |
152 |
| |
153 |
| |
154 |
| |
155 |
69787
| public List<Fqn> getRemovedNodes()
|
156 |
| { |
157 |
69787
| return new ArrayList<Fqn>(removedNodes);
|
158 |
| } |
159 |
| |
160 |
| |
161 |
| |
162 |
| |
163 |
| |
164 |
0
| public List<MethodCall> getUndoOperations()
|
165 |
| { |
166 |
0
| return undo_list;
|
167 |
| } |
168 |
| |
169 |
| |
170 |
| |
171 |
| |
172 |
1121973
| public void setTransaction(Transaction tx)
|
173 |
| { |
174 |
1121973
| ltx = tx;
|
175 |
| } |
176 |
| |
177 |
| |
178 |
| |
179 |
| |
180 |
0
| public Transaction getTransaction()
|
181 |
| { |
182 |
0
| return ltx;
|
183 |
| } |
184 |
| |
185 |
| |
186 |
| |
187 |
| |
188 |
294779
| public void addLock(NodeLock l)
|
189 |
| { |
190 |
294779
| if (l != null)
|
191 |
| { |
192 |
294779
| synchronized (locks)
|
193 |
| { |
194 |
294779
| locks.add(l);
|
195 |
| } |
196 |
| } |
197 |
| } |
198 |
| |
199 |
| |
200 |
| |
201 |
| |
202 |
| |
203 |
| |
204 |
51
| public void addLocks(Collection<NodeLock> newLocks)
|
205 |
| { |
206 |
51
| if (newLocks != null)
|
207 |
| { |
208 |
51
| synchronized (locks)
|
209 |
| { |
210 |
51
| locks.addAll(newLocks);
|
211 |
| } |
212 |
| } |
213 |
| } |
214 |
| |
215 |
| |
216 |
| |
217 |
| |
218 |
| |
219 |
| |
220 |
62
| public List<NodeLock> getLocks()
|
221 |
| { |
222 |
62
| synchronized (locks)
|
223 |
| { |
224 |
62
| return new ArrayList<NodeLock>(locks);
|
225 |
| } |
226 |
| } |
227 |
| |
228 |
| |
229 |
| |
230 |
| |
231 |
| |
232 |
69310
| public void releaseAllLocksLIFO(Object owner)
|
233 |
| { |
234 |
| |
235 |
69310
| boolean trace = log.isTraceEnabled();
|
236 |
69310
| synchronized (locks)
|
237 |
| { |
238 |
| |
239 |
| |
240 |
69310
| IdentityLock[] lockArray = locks.toArray(new IdentityLock[locks.size()]);
|
241 |
69310
| for (int i = lockArray.length - 1; i >= 0; i--)
|
242 |
| { |
243 |
277815
| if (trace)
|
244 |
| { |
245 |
0
| log.trace("releasing lock for " + lockArray[i].getFqn() + " (" + lockArray[i] + ")");
|
246 |
| } |
247 |
277815
| lockArray[i].release(owner);
|
248 |
| } |
249 |
69310
| locks.clear();
|
250 |
| } |
251 |
| } |
252 |
| |
253 |
| |
254 |
| |
255 |
| |
256 |
| |
257 |
1052431
| public void releaseAllLocksFIFO(Object owner)
|
258 |
| { |
259 |
| |
260 |
| |
261 |
1052431
| synchronized (locks)
|
262 |
| { |
263 |
1052431
| for (NodeLock lock : locks)
|
264 |
| { |
265 |
2860
| lock.release(owner);
|
266 |
2860
| if (log.isTraceEnabled())
|
267 |
| { |
268 |
0
| log.trace("releasing lock for " + ((IdentityLock) lock).getFqn() + " (" + lock + ")");
|
269 |
| } |
270 |
| } |
271 |
| } |
272 |
| } |
273 |
| |
274 |
| |
275 |
| |
276 |
| |
277 |
| |
278 |
| |
279 |
| |
280 |
| |
281 |
21640
| public boolean isForceAsyncReplication()
|
282 |
| { |
283 |
21640
| return forceAsyncReplication;
|
284 |
| } |
285 |
| |
286 |
| |
287 |
| |
288 |
| |
289 |
| |
290 |
| |
291 |
| |
292 |
| |
293 |
16
| public void setForceAsyncReplication(boolean forceAsyncReplication)
|
294 |
| { |
295 |
16
| this.forceAsyncReplication = forceAsyncReplication;
|
296 |
| } |
297 |
| |
298 |
| |
299 |
| |
300 |
| |
301 |
| |
302 |
269
| public void undoOperations(CacheSPI cache)
|
303 |
| { |
304 |
269
| if (log.isTraceEnabled())
|
305 |
| { |
306 |
0
| log.trace("undoOperations " + undo_list);
|
307 |
| } |
308 |
269
| ArrayList<MethodCall> l;
|
309 |
269
| synchronized (undo_list)
|
310 |
| { |
311 |
269
| l = new ArrayList<MethodCall>(undo_list);
|
312 |
| } |
313 |
269
| for (ListIterator<MethodCall> i = l.listIterator(l.size()); i.hasPrevious();)
|
314 |
| { |
315 |
1273
| MethodCall undo_op = i.previous();
|
316 |
1273
| undo(undo_op, cache);
|
317 |
| } |
318 |
| } |
319 |
| |
320 |
1273
| private void undo(MethodCall undo_op, CacheSPI cache)
|
321 |
| { |
322 |
1273
| try
|
323 |
| { |
324 |
1273
| Object retval = undo_op.invoke(cache);
|
325 |
1272
| if (retval instanceof Throwable)
|
326 |
| { |
327 |
0
| throw (Throwable) retval;
|
328 |
| } |
329 |
| } |
330 |
| catch (Throwable t) |
331 |
| { |
332 |
1
| log.error("undo operation failed, error=" + t);
|
333 |
1
| log.trace(t, t);
|
334 |
| } |
335 |
| } |
336 |
| |
337 |
| |
338 |
| |
339 |
| |
340 |
12
| public String toString()
|
341 |
| { |
342 |
12
| StringBuffer sb = new StringBuffer();
|
343 |
12
| sb.append("TransactionEntry\nmodification_list: ").append(modification_list);
|
344 |
12
| synchronized (undo_list)
|
345 |
| { |
346 |
12
| sb.append("\nundo_list: ").append(undo_list);
|
347 |
| } |
348 |
12
| synchronized (locks)
|
349 |
| { |
350 |
12
| sb.append("\nlocks: ").append(locks);
|
351 |
| } |
352 |
12
| return sb.toString();
|
353 |
| } |
354 |
| |
355 |
110
| public void loadUninitialisedNode(Fqn fqn)
|
356 |
| { |
357 |
110
| if (dummyNodesCreatedByCacheLoader == null)
|
358 |
82
| dummyNodesCreatedByCacheLoader = new LinkedList<Fqn>();
|
359 |
110
| dummyNodesCreatedByCacheLoader.add(fqn);
|
360 |
| } |
361 |
| |
362 |
49
| public List<Fqn> getDummyNodesCreatedByCacheLoader()
|
363 |
| { |
364 |
49
| return dummyNodesCreatedByCacheLoader;
|
365 |
| } |
366 |
| |
367 |
| |
368 |
| |
369 |
| |
370 |
| |
371 |
| |
372 |
1401756
| public void setOption(Option o)
|
373 |
| { |
374 |
1401756
| this.option = o;
|
375 |
| } |
376 |
| |
377 |
| |
378 |
| |
379 |
| |
380 |
1189211
| public Option getOption()
|
381 |
| { |
382 |
1189211
| return this.option;
|
383 |
| } |
384 |
| } |