| 226 |
|
* threads. Both await methods use a similar spin strategy: If |
| 227 |
|
* the associated queue appears to be empty, then the thread |
| 228 |
|
* spin-waits up to SPINS times (where each iteration decreases |
| 229 |
< |
* spin count with 50% probability) before enqueing, and then, if |
| 229 |
> |
* spin count with 50% probability) before enqueuing, and then, if |
| 230 |
|
* it is the first thread to be enqueued, spins again up to SPINS |
| 231 |
|
* times before blocking. If, upon wakening it fails to obtain |
| 232 |
|
* lock, and is still (or becomes) the first waiting thread (which |
