1 .\" Copyright (c) 2007 Stephan Uphoff <ups@FreeBSD.org>
2 .\" Copyright (c) 2006 Gleb Smirnoff <glebius@FreeBSD.org>
3 .\" All rights reserved.
5 .\" Redistribution and use in source and binary forms, with or without
6 .\" modification, are permitted provided that the following conditions
8 .\" 1. Redistributions of source code must retain the above copyright
9 .\" notice, this list of conditions and the following disclaimer.
10 .\" 2. Redistributions in binary form must reproduce the above copyright
11 .\" notice, this list of conditions and the following disclaimer in the
12 .\" documentation and/or other materials provided with the distribution.
14 .\" THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 .\" Based on rwlock.9 man page
46 .Nd kernel reader/writer lock optimized for read-mostly access patterns
52 .Fn rm_init "struct rmlock *rm" "const char *name"
54 .Fn rm_init_flags "struct rmlock *rm" "const char *name" "int opts"
56 .Fn rm_destroy "struct rmlock *rm"
58 .Fn rm_rlock "struct rmlock *rm" "struct rm_priotracker* tracker"
60 .Fn rm_try_rlock "struct rmlock *rm" "struct rm_priotracker* tracker"
62 .Fn rm_wlock "struct rmlock *rm"
64 .Fn rm_runlock "struct rmlock *rm" "struct rm_priotracker* tracker"
66 .Fn rm_wunlock "struct rmlock *rm"
68 .Fn rm_wowned "const struct rmlock *rm"
70 .Fn rm_sleep "void *wchan" "struct rmlock *rm" "int priority" "const char *wmesg" "int timo"
72 .Cd "options INVARIANTS"
73 .Cd "options INVARIANT_SUPPORT"
75 .Fn rm_assert "struct rmlock *rm" "int what"
77 .Fn RM_SYSINIT "name" "struct rmlock *rm" "const char *desc" "int opts"
79 Read-mostly locks allow shared access to protected data by multiple threads,
80 or exclusive access by a single thread.
81 The threads with shared access are known as
83 since they only read the protected data.
84 A thread with exclusive access is known as a
86 since it can modify protected data.
88 Read-mostly locks are designed to be efficient for locks almost exclusively
89 used as reader locks and as such should be used for protecting data that
91 Acquiring an exclusive lock after the lock has been locked for shared access
92 is an expensive operation.
94 Normal read-mostly locks are similar to
96 locks and follow the same lock ordering rules as
99 Read-mostly locks have full priority propagation like mutexes.
102 read-mostly locks propagate priority to both readers and writers.
103 This is implemented via the
105 structure argument supplied to
109 Readers can recurse if the lock is initialized with the
112 however, writers are never allowed to recurse.
114 Sleepable read-mostly locks are created by passing
118 Unlike normal read-mostly locks,
119 sleepable read-mostly locks follow the same lock ordering rules as
122 Sleepable read-mostly locks do not propagate priority to writers,
123 but they do propagate priority to readers.
124 Writers are permitted to sleep while holding a read-mostly lock,
126 Unlike other sleepable locks such as
129 readers must use try operations on other sleepable locks to avoid sleeping.
130 .Ss Macros and Functions
131 .Bl -tag -width indent
132 .It Fn rm_init "struct rmlock *rm" "const char *name"
133 Initialize the read-mostly lock
137 description is used solely for debugging purposes.
138 This function must be called before any other operations
140 .It Fn rm_init_flags "struct rmlock *rm" "const char *name" "int opts"
143 initialize the read-mostly lock
145 with a set of optional flags.
148 arguments contains one or more of the following flags:
149 .Bl -tag -width ".Dv RM_NOWITNESS"
155 Allow threads to recursively acquire shared locks for
158 Create a sleepable read-mostly lock.
160 .It Fn rm_rlock "struct rmlock *rm" "struct rm_priotracker* tracker"
165 to track read owners of a lock for priority propagation.
166 This data structure is only used internally by
168 and must persist until
171 This data structure can be allocated on the stack since
172 readers cannot sleep.
173 If any thread holds this lock exclusively, the current thread blocks,
174 and its priority is propagated to the exclusive holder.
175 If the lock was initialized with the
179 function can be called when the current thread has already acquired reader
182 .It Fn rm_try_rlock "struct rmlock *rm" "struct rm_priotracker* tracker"
187 will return 0 if the lock cannot be acquired immediately;
189 the lock will be acquired and a non-zero value will be returned.
192 may fail even while the lock is not currently held by a writer.
193 If the lock was initialized with the
197 will succeed if the current thread has already acquired reader access.
198 .It Fn rm_wlock "struct rmlock *rm"
202 If there are any shared owners of the lock, the current thread blocks.
205 function cannot be called recursively.
206 .It Fn rm_runlock "struct rmlock *rm" "struct rm_priotracker* tracker"
207 This function releases a shared lock previously acquired by
211 argument must match the
213 argument used for acquiring the shared lock
214 .It Fn rm_wunlock "struct rmlock *rm"
215 This function releases an exclusive lock previously acquired by
217 .It Fn rm_destroy "struct rmlock *rm"
218 This functions destroys a lock previously initialized with
222 lock must be unlocked.
223 .It Fn rm_wowned "const struct rmlock *rm"
224 This function returns a non-zero value if the current thread owns an
227 .It Fn rm_sleep "void *wchan" "struct rmlock *rm" "int priority" "const char *wmesg" "int timo"
228 This function atomically releases
230 while waiting for an event.
233 lock must be exclusively locked.
234 For more details on the parameters to this function,
237 .It Fn rm_assert "struct rmlock *rm" "int what"
238 This function asserts that the
240 lock is in the state specified by
242 If the assertions are not true and the kernel is compiled with
243 .Cd "options INVARIANTS"
245 .Cd "options INVARIANT_SUPPORT" ,
246 the kernel will panic.
247 Currently the following base assertions are supported:
248 .Bl -tag -width ".Dv RA_UNLOCKED"
250 Assert that current thread holds either a shared or exclusive lock
254 Assert that current thread holds a shared lock of
257 Assert that current thread holds an exclusive lock of
260 Assert that current thread holds neither a shared nor exclusive lock of
264 In addition, one of the following optional flags may be specified with
269 .Bl -tag -width ".Dv RA_NOTRECURSED"
271 Assert that the current thread holds a recursive lock of
273 .It Dv RA_NOTRECURSED
274 Assert that the current thread does not hold a recursive lock of
288 functions appeared in
294 facility was written by
295 .An "Stephan Uphoff" .
296 This manual page was written by
298 for rwlock and modified to reflect rmlock by
299 .An "Stephan Uphoff" .
303 implementation is currently not optimized for single processor systems.
306 can fail transiently even when there is no writer, while another reader
307 updates the state on the local CPU.
311 implementation uses a single per CPU list shared by all
312 rmlocks in the system.
313 If rmlocks become popular, hashing to multiple per CPU queues may
314 be needed to speed up the writer lock process.