Re: First-in-last-out waiting quere for lock in Kaffe

> I noticed that in kaffe lock implementation (in slowLockMutex() > and slowUnlockMutex() ), the last thread suspending on the lock > will always be resumed firstly, which doesn't embody equality > policy. Right? It is not the fairest policy. However, the JLS does not require a fair locking p

First-in-last-out waiting quere for lock in Kaffe

Dear all, I noticed that in kaffe lock implementation (in slowLockMutex() and slowUnlockMutex() ), the last thread suspending on the lock will always be resumed firstly, which doesn't embody equality policy. Right? Fang Wei Jian