Lines Matching defs:locks

584   // Unlike a normal lock, however, the exiting thread "locks" OnDeck,
607 // For heavily contended locks it's not uncommon that some other
867 // written the _owner field. These locks may be sneakily acquired by the
869 // identify all such locks, and ensure that Java threads never block at
883 // VM thread to logically acquire locks that had already be physically locked by mutators
1218 Monitor * Monitor::get_least_ranked_lock(Monitor * locks) {
1220 for (res = tmp = locks; tmp != NULL; tmp = tmp->next()) {
1226 // In this case, we expect the held locks to be
1228 for (tmp = locks; tmp != NULL; tmp = tmp->next()) {
1238 Monitor* Monitor::get_least_ranked_lock_besides_this(Monitor* locks) {
1240 for (res = NULL, tmp = locks; tmp != NULL; tmp = tmp->next()) {
1246 // In this case, we expect the held locks to be
1248 for (tmp = locks; tmp != NULL; tmp = tmp->next()) {
1259 bool Monitor::contains(Monitor* locks, Monitor * lock) {
1260 for (; locks != NULL; locks = locks->next()) {
1261 if (locks == lock)
1275 // and checking the invariant that threads and locks
1276 // are in a 1/N relation, with some some locks unowned.
1291 // link "this" into the owned locks list
1294 Monitor* locks = get_least_ranked_lock(new_owner->owned_locks());
1313 locks != NULL && locks->rank() <= this->rank() &&
1316 !(this == Safepoint_lock && contains(locks, Terminator_lock) &&
1321 locks->name(), locks->rank()));
1340 Monitor *locks = old_owner->owned_locks();
1342 // remove "this" from the owned locks list
1346 for (; locks != NULL; prev = locks, locks = locks->next()) {
1347 if (locks == this) {
1367 || rank() == Mutex::special, "wrong thread state for using locks");