如果有异常发生，线程自动释放锁。
If an exception occurs, the thread automatically releases the lock.
为获得和释放锁而产生的CPU开销。
经常进行提交以释放锁。
做同步的方法释放锁而进入非同步块？
Does synchronised method releases lock while going into unsynchronised block?
然后它释放锁。
因此，它只能释放锁。
你不能忘记释放锁。
先释放锁，关闭数据表，正尝试重新打开数据表。
It has freed the lock, closed the table, and is now trying to reopen it.
您很容易忘记用finally块释放锁，这对程序非常有害。
It is easy to forget to use a finally block to release the lock, to the great detriment of your program.
NHRT需要一直等到RT不再被GC抢占并释放锁后才能执行。
The NHRT needs to wait until the RT is no longer preempted by GC and then release the lock before the NHRT has a chance to execute.
如果锁可用，则获取锁，执行互斥锁动作，然后释放锁。
When the lock is available, it is taken, the mutually-exclusive action is performed, and then the lock is released.
的线程释放锁后，就绪队列中的下一个线程将获取该锁。
Releases the lock, the next thread in the ready queue acquires the lock.
与图1类似，事务1读取某个特定记录，但随后即释放锁。
Similar to Figure 1, transaction 1 reads a specific record but then releases its lock.
将锁偏向于一个线程，意味着该线程不需要释放锁的契约。
Biasing a lock to a thread means that the thread is not required to release the lease on the lock.
如果使用撤消命令撤消对文件挂起的更改，也会释放锁。
Locks are also released if the pending changes for a file are undone by using the undo command.
例如，如果不释放锁(相当于一直持有信号量)，就会导致阻塞问题。
For example, if you are not releasing the lock (equivalent to holding a semaphore), you will create your own blockage problem.
其他次高优先级（优先级P2）的线程不断地阻碍P3运行和释放锁。
Other tasks that are lower priority (P2) prevent the P3 thread from running and releasing the lock.
当锁持有者释放锁时，它的优先级则被“降”回基本优先级。
The lock holder's priority is "deboosted" back to its base priority when it releases the lock.
阻止用户在您显式释放锁之前，签入或签出任何一个指定项。
Prevents users from checking in or checking out the specified items until you explicitly release the lock.
它允许在包括的活动完成后释放锁，但您必须运行补偿逻辑来撤销已完成的操作。
This allows releasing locks once an enclosed activity completes, but one has to run compensation logic to undo already completed actions.
释放锁以后，系统从争用者的最高优先级队列的前端选择线程，以便试图锁定对象。
When a lock is released, the system chooses the thread from the front of the highest-priority queue of contenders to try to lock the object.
在刚刚描述的场景中，发生锁争用时低优先级的线程以高优先级运行，直至线程释放锁。
In the scenario just described, the low-priority thread runs at high priority when lock contention occurs until the point in time that it releases the lock.
于是低优先级任务就会被调度运行，然后释放锁，这时其优先级就恢复到原来的优先级了。
The low priority task can now run and unlock the mutex - at this point it is returned back to its original priority.
当调用如果线程已持有锁，增量递归层次一，并返回。如果线程没有等待直到主人锁释放锁。
When invoked if this thread already owns the lock, increment the recursion level by one, and return immediately. if thread doesn't own the lock it waits until owner release lock.
只有当前任务才能释放锁，同时还支持优先级继承（基本优先级继承协议）和死亡安全监测。
Only the owning task may successfully call semGive. The VxWorks mutex also has the ability to support both priority inheritance (basic priority inheritance protocol) and deletion safety.
强行进入lock语句的finally子句、释放锁以及允许访问任意等待线程(该线程占用了已被破坏的资源)，都有可能引发异常。
It is possible for an exception to occur that forces a branch to the finally clause of the lock statement, releasing the lock and allowing access to any waiting thread to the corrupted resource.
如果多个箭头显示一个环形的锁请求模式—由于它们正在相互等候其它线程释放锁，所以线程彼此阻止运行—结果就形成了一个死锁。
If multiple arrows show a circular lock-request pattern — threads prevent each other from running because they are waiting for each other to release a lock — then you have a deadlock.
size的实现将不得不依次获取各个bucket的锁，对该bucket中的节点进行计数，释放锁，然后继续到下一个bucket。
An implementation of size would have to sequentially acquire the lock for each bucket, count the number of nodes in that bucket, and release the lock and move on to the next bucket.
如果到超时时间段结束时还没有被唤醒，读线程需要唤醒自身并释放互斥锁。
If not awake otherwise, at the end of the timeout, the reader needs to wake itself up and release the mutex.
如果到超时时间段结束时还没有被唤醒，读线程需要唤醒自身并释放互斥锁。
If not awake otherwise, at the end of the timeout, the reader needs to wake itself up and release the mutex.
应用推荐