| # | Line 300 | Line 300 | public class ConcurrentLinkedDeque<E> | |
|---|---|---|
| 300 | // Successful CAS is the linearization point | |
| 301 | // for e to become an element of this deque, | |
| 302 | // and for newNode to become "live". | |
| 303 | < | if (p != h) // hop two nodes at a time |
| 304 | < | HEAD.compareAndSet(this, h, newNode); // Failure OK. |
| 303 | > | if (p != h) // hop two nodes at a time; failure is OK |
| 304 | > | HEAD.weakCompareAndSetVolatile(this, h, newNode); |
| 305 | return; | |
| 306 | } | |
| 307 | // Lost CAS race to another thread; re-read prev | |
| – | Removed lines |
| + | Added lines |
| < | Changed lines |
| > | Changed lines |