1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/*=========================================================================
*
* Copyright NumFOCUS
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#include "itkSimpleFastMutexLock.h"
#include <iostream> // For cout.
int
itkSimpleFastMutexLockTest(int, char *[])
{
{
itk::SimpleFastMutexLock lock;
// Acquire the lock
lock.Lock();
// Acquire the lock again; as this call happens within the same thread,
// it shouldn't block.
// If the lock isn't recursive, it will block forever and the CTest
// timeout will cause the test to fail.
lock.Lock();
}
{ // Test non-blocking version
itk::SimpleFastMutexLock nblock;
nblock.Lock();
nblock.Unlock();
const bool testTryLockWhenFree = nblock.TryLock();
if (testTryLockWhenFree != true)
{
std::cout << "Failed to capture a free lock with TryLock()" << std::endl;
return EXIT_FAILURE;
}
if (!nblock.TryLock())
{
std::cout << "Failed to recursively capture a lock with TryLock()" << std::endl;
return EXIT_FAILURE;
}
nblock.Unlock();
nblock.Lock();
// Ensure the TryLock() does not cause a deadlock.
// If the lock isn't recursive, it will block forever and the CTest
// timeout will cause the test to fail.
nblock.Unlock();
}
return EXIT_SUCCESS;
}
|
