… | |
… | |
254 | will be created if necessary). If C<$exclusive> is true, then it tries to |
254 | will be created if necessary). If C<$exclusive> is true, then it tries to |
255 | acquire an exclusive lock, otherwise the lock will be shared. If C<$wait> |
255 | acquire an exclusive lock, otherwise the lock will be shared. If C<$wait> |
256 | is true, then it will wait until the lock can be acquired, otherwise it |
256 | is true, then it will wait until the lock can be acquired, otherwise it |
257 | only attempts to acquire it and returns immediately if it can't. |
257 | only attempts to acquire it and returns immediately if it can't. |
258 | |
258 | |
259 | If successful it returns a lock object - the lock will be given up |
259 | If successful it returns a lock object - the lock will be given up when |
260 | when the lock object is destroyed. |
260 | the lock object is destroyed or when the process exits (even on a crash) |
|
|
261 | and has a good chance of working on network drives as well. |
261 | |
262 | |
262 | If the lock could not be acquired, C<undef> is returned. |
263 | If the lock could not be acquired, C<undef> is returned. |
263 | |
264 | |
264 | This function will probably go awway in the future, but is provided to |
265 | This function is provided to assist applications that want to clean up old |
265 | assist applications that want to clean up old versions, see "TIPS AND |
266 | versions, see "TIPS AND TRICKS", below. |
266 | TRICKS", below. |
|
|
267 | |
267 | |
268 | =cut |
268 | =cut |
269 | |
269 | |
270 | 1; |
270 | 1; |
271 | |
271 | |