Changeset c0d814a in mainline for kernel/generic/src/synch/mutex.c
- Timestamp:
- 2025-04-10T20:02:30Z (4 days ago)
- Children:
- b8b031f
- Parents:
- a92290d (diff), 90dd8aee (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the(diff)
links above to see all the changes relative to each parent. - git-author:
- Wayne Thornton <wmthornton-dev@…> (2025-04-10 20:02:30)
- git-committer:
- GitHub <noreply@…> (2025-04-10 20:02:30)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/generic/src/synch/mutex.c
ra92290d rc0d814a 1 1 /* 2 2 * Copyright (c) 2001-2004 Jakub Jermar 3 * Copyright (c) 202 3Jiří Zárevúcky3 * Copyright (c) 2025 Jiří Zárevúcky 4 4 * All rights reserved. 5 5 * … … 39 39 #include <assert.h> 40 40 #include <errno.h> 41 #include <proc/thread.h> 42 #include <stdatomic.h> 41 43 #include <synch/mutex.h> 42 44 #include <synch/semaphore.h> 43 #include <arch.h>44 #include <stacktrace.h>45 #include <cpu.h>46 #include <proc/thread.h>47 45 48 46 /** Initialize mutex. … … 56 54 } 57 55 56 /** A race in mtx->owner access is unavoidable, so we have to make 57 * access to it formally atomic. These are convenience functions to 58 * read/write the variable without memory barriers, since we don't need 59 * them and C11 atomics default to the strongest possible memory ordering 60 * by default, which is utterly ridiculous. 61 */ 62 static inline thread_t *_get_owner(mutex_t *mtx) 63 { 64 return atomic_load_explicit(&mtx->owner, memory_order_relaxed); 65 } 66 67 /** Counterpart to _get_owner(). */ 68 static inline void _set_owner(mutex_t *mtx, thread_t *owner) 69 { 70 atomic_store_explicit(&mtx->owner, owner, memory_order_relaxed); 71 } 72 58 73 /** Find out whether the mutex is currently locked. 59 74 * … … 64 79 bool mutex_locked(mutex_t *mtx) 65 80 { 66 errno_t rc = semaphore_trydown(&mtx->sem); 67 if (rc == EOK) { 68 semaphore_up(&mtx->sem); 69 } 70 return rc != EOK; 71 } 81 if (!THREAD) 82 return mtx->nesting > 0; 72 83 73 static void mutex_lock_active(mutex_t *mtx) 74 { 75 assert((mtx->type == MUTEX_ACTIVE) || !THREAD); 76 77 const unsigned deadlock_treshold = 100000000; 78 unsigned int cnt = 0; 79 bool deadlock_reported = false; 80 81 while (semaphore_trydown(&mtx->sem) != EOK) { 82 if (cnt++ > deadlock_treshold) { 83 printf("cpu%u: looping on active mutex %p\n", CPU->id, mtx); 84 stack_trace(); 85 cnt = 0; 86 deadlock_reported = true; 87 } 88 } 89 90 if (deadlock_reported) 91 printf("cpu%u: not deadlocked\n", CPU->id); 84 return _get_owner(mtx) == THREAD; 92 85 } 93 86 … … 98 91 void mutex_lock(mutex_t *mtx) 99 92 { 100 if ( mtx->type == MUTEX_RECURSIVE && mtx->owner ==THREAD) {101 assert( THREAD);93 if (!THREAD) { 94 assert(mtx->type == MUTEX_RECURSIVE || mtx->nesting == 0); 102 95 mtx->nesting++; 103 96 return; 104 97 } 105 98 106 if (mtx->type == MUTEX_ACTIVE || !THREAD) { 107 mutex_lock_active(mtx); 99 if (_get_owner(mtx) == THREAD) { 100 /* This will also detect nested locks on a non-recursive mutex. */ 101 assert(mtx->type == MUTEX_RECURSIVE); 102 assert(mtx->nesting > 0); 103 mtx->nesting++; 108 104 return; 109 105 } 110 106 111 107 semaphore_down(&mtx->sem); 112 mtx->owner = THREAD; 108 109 _set_owner(mtx, THREAD); 110 assert(mtx->nesting == 0); 113 111 mtx->nesting = 1; 114 112 } … … 123 121 errno_t mutex_lock_timeout(mutex_t *mtx, uint32_t usec) 124 122 { 125 if (usec != 0) { 126 assert(mtx->type != MUTEX_ACTIVE); 127 assert(THREAD); 123 if (!THREAD) { 124 assert(mtx->type == MUTEX_RECURSIVE || mtx->nesting == 0); 125 mtx->nesting++; 126 return EOK; 128 127 } 129 128 130 if (mtx->type == MUTEX_RECURSIVE && mtx->owner == THREAD) { 131 assert(THREAD); 129 if (_get_owner(mtx) == THREAD) { 130 assert(mtx->type == MUTEX_RECURSIVE); 131 assert(mtx->nesting > 0); 132 132 mtx->nesting++; 133 133 return EOK; … … 135 135 136 136 errno_t rc = semaphore_down_timeout(&mtx->sem, usec); 137 if (rc == EOK) { 138 mtx->owner = THREAD; 139 mtx->nesting = 1; 140 } 141 return rc; 137 if (rc != EOK) 138 return rc; 139 140 _set_owner(mtx, THREAD); 141 assert(mtx->nesting == 0); 142 mtx->nesting = 1; 143 return EOK; 142 144 } 143 145 … … 157 159 void mutex_unlock(mutex_t *mtx) 158 160 { 159 if (mtx->type == MUTEX_RECURSIVE) { 160 assert(mtx->owner == THREAD); 161 if (--mtx->nesting > 0) 162 return; 163 mtx->owner = NULL; 161 if (--mtx->nesting > 0) { 162 assert(mtx->type == MUTEX_RECURSIVE); 163 return; 164 164 } 165 166 assert(mtx->nesting == 0); 167 168 if (!THREAD) 169 return; 170 171 assert(_get_owner(mtx) == THREAD); 172 _set_owner(mtx, NULL); 173 165 174 semaphore_up(&mtx->sem); 166 175 }
Note:
See TracChangeset
for help on using the changeset viewer.