| Commit message (Collapse) | Author | Age |
| |
|
| |
|
| |
|
|
|
|
|
| |
insert barrier() to be sure order is preserved by inline expansion
don't depend on macro for initialization
|
| |
|
|
|
|
| |
Force gcc to actually spin.
|
|
|
|
| |
The first needs to be unlocked, not the last.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
This re-implements the queue locks for the new LITMUS version. Major
differences to the previous implementation:
1) platform independent implementation - no manual assembly code in
the queue lock implementation required
2) Recursive acquiring of the locks is not possible! None of the
other Linux locking primitives allow it, so it is consistent
and we weren't using it anyway as far as I know.
3) The number of "processes" in the implementation is fixed to
NR_CPUS. Anything else doesn't really make sense in the kernel
anyway.
|
|
|
|
|
| |
Queue locks in LTMUS always must allow for NR_CPUS processes. Therefore,
it is redundant to specify that int queue_lock_init().
|
|
|