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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
Set `key` to hold string `value` if `key` does not exist. In that case, it is
equal to `SET`. When `key` already holds a value, no operation is performed.
`SETNX` is short for "**SET** if **N**ot e**X**ists".
@return
@integer-reply, specifically:
- `1` if the key was set
- `0` if the key was not set
@examples
```cli
SETNX mykey "Hello"
SETNX mykey "World"
GET mykey
```
## Design pattern: Locking with `!SETNX`
**Please note that:**
1. The following pattern is discouraged in favor of
[the Redlock algorithm](http://redis.io/topics/distlock) which is only a bit
more complex to implement, but offers better guarantees and is fault
tolerant.
2. We document the old pattern anyway because certain existing implementations
link to this page as a reference. Moreover it is an interesting example of
how Redis commands can be used in order to mount programming primitives.
3. Anyway even assuming a single-instance locking primitive, starting with
2.6.12 it is possible to create a much simpler locking primitive, equivalent
to the one discussed here, using the `SET` command to acquire the lock, and a
simple Lua script to release the lock. The pattern is documented in the `SET`
command page.
That said, `SETNX` can be used, and was historically used, as a locking
primitive. For example, to acquire the lock of the key `foo`, the client could
try the following:
```
SETNX lock.foo <current Unix time + lock timeout + 1>
```
If `SETNX` returns `1` the client acquired the lock, setting the `lock.foo` key
to the Unix time at which the lock should no longer be considered valid. The
client will later use `DEL lock.foo` in order to release the lock.
If `SETNX` returns `0` the key is already locked by some other client. We can
either return to the caller if it's a non blocking lock, or enter a loop
retrying to hold the lock until we succeed or some kind of timeout expires.
### Handling deadlocks
In the above locking algorithm there is a problem: what happens if a client
fails, crashes, or is otherwise not able to release the lock? It's possible to
detect this condition because the lock key contains a UNIX timestamp. If such a
timestamp is equal to the current Unix time the lock is no longer valid.
When this happens we can't just call `DEL` against the key to remove the lock
and then try to issue a `SETNX`, as there is a race condition here, when
multiple clients detected an expired lock and are trying to release it.
- C1 and C2 read `lock.foo` to check the timestamp, because they both received
`0` after executing `SETNX`, as the lock is still held by C3 that crashed
after holding the lock.
- C1 sends `DEL lock.foo`
- C1 sends `SETNX lock.foo` and it succeeds
- C2 sends `DEL lock.foo`
- C2 sends `SETNX lock.foo` and it succeeds
- **ERROR**: both C1 and C2 acquired the lock because of the race condition.
Fortunately, it's possible to avoid this issue using the following algorithm.
Let's see how C4, our sane client, uses the good algorithm:
- C4 sends `SETNX lock.foo` in order to acquire the lock
- The crashed client C3 still holds it, so Redis will reply with `0` to C4.
- C4 sends `GET lock.foo` to check if the lock expired. If it is not, it will
sleep for some time and retry from the start.
- Instead, if the lock is expired because the Unix time at `lock.foo` is older
than the current Unix time, C4 tries to perform:
```
GETSET lock.foo <current Unix timestamp + lock timeout + 1>
```
- Because of the `GETSET` semantic, C4 can check if the old value stored at
`key` is still an expired timestamp. If it is, the lock was acquired.
- If another client, for instance C5, was faster than C4 and acquired the lock
with the `GETSET` operation, the C4 `GETSET` operation will return a non
expired timestamp. C4 will simply restart from the first step. Note that even
if C4 set the key a bit a few seconds in the future this is not a problem.
In order to make this locking algorithm more robust, a client holding a lock
should always check the timeout didn't expire before unlocking the key with
`DEL` because client failures can be complex, not just crashing but also
blocking a lot of time against some operations and trying to issue `DEL` after a
lot of time (when the LOCK is already held by another client).
|
