Linux kernel mirror (for testing)
git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel
os
linux
ipc/sem.c: mundane typo fixes
s/runtine/runtime/
s/AQUIRE/ACQUIRE/
s/seperately/separately/
s/wont/won\'t/
s/succesfull/successful/
Link: https://lkml.kernel.org/r/20210326022240.26375-1-unixbhaskar@gmail.com
Signed-off-by: Bhaskar Chowdhury <unixbhaskar@gmail.com>
Acked-by: Randy Dunlap <rdunlap@infradead.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
authored by
Bhaskar Chowdhury
and committed by
Linus Torvalds
b1989a3d
17652f42
+5
-5
+5
-5
ipc/sem.c
+5
-5
ipc/sem.c
···
36
36
* - two Linux specific semctl() commands: SEM_STAT, SEM_INFO.
37
37
* - undo adjustments at process exit are limited to 0..SEMVMX.
38
38
* - namespace are supported.
39
-
* - SEMMSL, SEMMNS, SEMOPM and SEMMNI can be configured at runtine by writing
39
+
* - SEMMSL, SEMMNS, SEMOPM and SEMMNI can be configured at runtime by writing
40
40
* to /proc/sys/kernel/sem.
41
41
* - statistics about the usage are reported in /proc/sysvipc/sem.
42
42
*
···
224
224
* Setting it to a result code is a RELEASE, this is ensured by both a
225
225
* smp_store_release() (for case a) and while holding sem_lock()
226
226
* (for case b).
227
-
* The AQUIRE when reading the result code without holding sem_lock() is
227
+
* The ACQUIRE when reading the result code without holding sem_lock() is
228
228
* achieved by using READ_ONCE() + smp_acquire__after_ctrl_dep().
229
229
* (case a above).
230
230
* Reading the result code while holding sem_lock() needs no further barriers,
···
821
821
822
822
/* It is impossible that someone waits for the new value:
823
823
* - complex operations always restart.
824
-
* - wait-for-zero are handled seperately.
824
+
* - wait-for-zero are handled separately.
825
825
* - q is a previously sleeping simple operation that
826
826
* altered the array. It must be a decrement, because
827
827
* simple increments never sleep.
···
1046
1046
* - No complex ops, thus all sleeping ops are
1047
1047
* decrease.
1048
1048
* - if we decreased the value, then any sleeping
1049
-
* semaphore ops wont be able to run: If the
1049
+
* semaphore ops won't be able to run: If the
1050
1050
* previous value was too small, then the new
1051
1051
* value will be too small, too.
1052
1052
*/
···
2108
2108
queue.dupsop = dupsop;
2109
2109
2110
2110
error = perform_atomic_semop(sma, &queue);
2111
-
if (error == 0) { /* non-blocking succesfull path */
2111
+
if (error == 0) { /* non-blocking successful path */
2112
2112
DEFINE_WAKE_Q(wake_q);
2113
2113
2114
2114
/*