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 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507
|
// SPDX-License-Identifier: BSD-2-Clause
/*
* Copyright (c) 2015-2017, Linaro Limited
*/
#include <kernel/mutex.h>
#include <kernel/mutex_pm_aware.h>
#include <kernel/panic.h>
#include <kernel/refcount.h>
#include <kernel/spinlock.h>
#include <kernel/thread.h>
#include <trace.h>
#include "mutex_lockdep.h"
void mutex_init(struct mutex *m)
{
*m = (struct mutex)MUTEX_INITIALIZER;
}
void mutex_init_recursive(struct recursive_mutex *m)
{
*m = (struct recursive_mutex)RECURSIVE_MUTEX_INITIALIZER;
}
static void __mutex_lock(struct mutex *m, const char *fname, int lineno)
{
assert_have_no_spinlock();
assert(thread_get_id_may_fail() != THREAD_ID_INVALID);
assert(thread_is_in_normal_mode());
mutex_lock_check(m);
while (true) {
uint32_t old_itr_status;
bool can_lock;
struct wait_queue_elem wqe;
/*
* If the mutex is locked we need to initialize the wqe
* before releasing the spinlock to guarantee that we don't
* miss the wakeup from mutex_unlock().
*
* If the mutex is unlocked we don't need to use the wqe at
* all.
*/
old_itr_status = cpu_spin_lock_xsave(&m->spin_lock);
can_lock = !m->state;
if (!can_lock) {
wq_wait_init(&m->wq, &wqe, false /* wait_read */);
} else {
m->state = -1; /* write locked */
}
cpu_spin_unlock_xrestore(&m->spin_lock, old_itr_status);
if (!can_lock) {
/*
* Someone else is holding the lock, wait in normal
* world for the lock to become available.
*/
wq_wait_final(&m->wq, &wqe, 0, m, fname, lineno);
} else
return;
}
}
static void __mutex_lock_recursive(struct recursive_mutex *m, const char *fname,
int lineno)
{
short int ct = thread_get_id();
assert_have_no_spinlock();
assert(thread_is_in_normal_mode());
if (atomic_load_short(&m->owner) == ct) {
if (!refcount_inc(&m->lock_depth))
panic();
return;
}
__mutex_lock(&m->m, fname, lineno);
assert(m->owner == THREAD_ID_INVALID);
atomic_store_short(&m->owner, ct);
refcount_set(&m->lock_depth, 1);
}
static void __mutex_unlock(struct mutex *m, const char *fname, int lineno)
{
uint32_t old_itr_status;
assert_have_no_spinlock();
assert(thread_get_id_may_fail() != THREAD_ID_INVALID);
mutex_unlock_check(m);
old_itr_status = cpu_spin_lock_xsave(&m->spin_lock);
if (!m->state)
panic();
m->state = 0;
cpu_spin_unlock_xrestore(&m->spin_lock, old_itr_status);
wq_wake_next(&m->wq, m, fname, lineno);
}
static void __mutex_unlock_recursive(struct recursive_mutex *m,
const char *fname, int lineno)
{
assert_have_no_spinlock();
assert(m->owner == thread_get_id());
if (refcount_dec(&m->lock_depth)) {
/*
* Do an atomic store to match the atomic load in
* __mutex_lock_recursive()
*/
atomic_store_short(&m->owner, THREAD_ID_INVALID);
__mutex_unlock(&m->m, fname, lineno);
}
}
static bool __mutex_trylock(struct mutex *m, const char *fname __unused,
int lineno __unused)
{
uint32_t old_itr_status;
bool can_lock_write;
assert_have_no_spinlock();
assert(thread_get_id_may_fail() != THREAD_ID_INVALID);
old_itr_status = cpu_spin_lock_xsave(&m->spin_lock);
can_lock_write = !m->state;
if (can_lock_write)
m->state = -1;
cpu_spin_unlock_xrestore(&m->spin_lock, old_itr_status);
if (can_lock_write)
mutex_trylock_check(m);
return can_lock_write;
}
static void __mutex_read_unlock(struct mutex *m, const char *fname, int lineno)
{
uint32_t old_itr_status;
short new_state;
assert_have_no_spinlock();
assert(thread_get_id_may_fail() != THREAD_ID_INVALID);
old_itr_status = cpu_spin_lock_xsave(&m->spin_lock);
if (m->state <= 0)
panic();
m->state--;
new_state = m->state;
cpu_spin_unlock_xrestore(&m->spin_lock, old_itr_status);
/* Wake eventual waiters if the mutex was unlocked */
if (!new_state)
wq_wake_next(&m->wq, m, fname, lineno);
}
static void __mutex_read_lock(struct mutex *m, const char *fname, int lineno)
{
assert_have_no_spinlock();
assert(thread_get_id_may_fail() != THREAD_ID_INVALID);
assert(thread_is_in_normal_mode());
while (true) {
uint32_t old_itr_status;
bool can_lock;
struct wait_queue_elem wqe;
/*
* If the mutex is locked we need to initialize the wqe
* before releasing the spinlock to guarantee that we don't
* miss the wakeup from mutex_unlock().
*
* If the mutex is unlocked we don't need to use the wqe at
* all.
*/
old_itr_status = cpu_spin_lock_xsave(&m->spin_lock);
can_lock = m->state != -1;
if (!can_lock) {
wq_wait_init(&m->wq, &wqe, true /* wait_read */);
} else {
m->state++; /* read_locked */
}
cpu_spin_unlock_xrestore(&m->spin_lock, old_itr_status);
if (!can_lock) {
/*
* Someone else is holding the lock, wait in normal
* world for the lock to become available.
*/
wq_wait_final(&m->wq, &wqe, 0, m, fname, lineno);
} else
return;
}
}
static bool __mutex_read_trylock(struct mutex *m, const char *fname __unused,
int lineno __unused)
{
uint32_t old_itr_status;
bool can_lock;
assert_have_no_spinlock();
assert(thread_get_id_may_fail() != THREAD_ID_INVALID);
assert(thread_is_in_normal_mode());
old_itr_status = cpu_spin_lock_xsave(&m->spin_lock);
can_lock = m->state != -1;
if (can_lock)
m->state++;
cpu_spin_unlock_xrestore(&m->spin_lock, old_itr_status);
return can_lock;
}
#ifdef CFG_MUTEX_DEBUG
void mutex_unlock_debug(struct mutex *m, const char *fname, int lineno)
{
__mutex_unlock(m, fname, lineno);
}
void mutex_lock_debug(struct mutex *m, const char *fname, int lineno)
{
__mutex_lock(m, fname, lineno);
}
bool mutex_trylock_debug(struct mutex *m, const char *fname, int lineno)
{
return __mutex_trylock(m, fname, lineno);
}
void mutex_read_unlock_debug(struct mutex *m, const char *fname, int lineno)
{
__mutex_read_unlock(m, fname, lineno);
}
void mutex_read_lock_debug(struct mutex *m, const char *fname, int lineno)
{
__mutex_read_lock(m, fname, lineno);
}
bool mutex_read_trylock_debug(struct mutex *m, const char *fname, int lineno)
{
return __mutex_read_trylock(m, fname, lineno);
}
void mutex_unlock_recursive_debug(struct recursive_mutex *m, const char *fname,
int lineno)
{
__mutex_unlock_recursive(m, fname, lineno);
}
void mutex_lock_recursive_debug(struct recursive_mutex *m, const char *fname,
int lineno)
{
__mutex_lock_recursive(m, fname, lineno);
}
#else
void mutex_unlock(struct mutex *m)
{
__mutex_unlock(m, NULL, -1);
}
void mutex_unlock_recursive(struct recursive_mutex *m)
{
__mutex_unlock_recursive(m, NULL, -1);
}
void mutex_lock(struct mutex *m)
{
__mutex_lock(m, NULL, -1);
}
void mutex_lock_recursive(struct recursive_mutex *m)
{
__mutex_lock_recursive(m, NULL, -1);
}
bool mutex_trylock(struct mutex *m)
{
return __mutex_trylock(m, NULL, -1);
}
void mutex_read_unlock(struct mutex *m)
{
__mutex_read_unlock(m, NULL, -1);
}
void mutex_read_lock(struct mutex *m)
{
__mutex_read_lock(m, NULL, -1);
}
bool mutex_read_trylock(struct mutex *m)
{
return __mutex_read_trylock(m, NULL, -1);
}
#endif
void mutex_destroy(struct mutex *m)
{
/*
* Caller guarantees that no one will try to take the mutex so
* there's no need to take the spinlock before accessing it.
*/
if (m->state)
panic();
if (!wq_is_empty(&m->wq))
panic("waitqueue not empty");
mutex_destroy_check(m);
}
void mutex_destroy_recursive(struct recursive_mutex *m)
{
mutex_destroy(&m->m);
}
unsigned int mutex_get_recursive_lock_depth(struct recursive_mutex *m)
{
assert_have_no_spinlock();
assert(m->owner == thread_get_id());
return refcount_val(&m->lock_depth);
}
void mutex_pm_aware_init(struct mutex_pm_aware *m)
{
*m = (struct mutex_pm_aware)MUTEX_PM_AWARE_INITIALIZER;
}
void mutex_pm_aware_destroy(struct mutex_pm_aware *m)
{
mutex_destroy(&m->mutex);
}
void mutex_pm_aware_lock(struct mutex_pm_aware *m)
{
if (thread_get_id_may_fail() == THREAD_ID_INVALID) {
if (!cpu_spin_trylock(&m->lock) || m->mutex.state)
panic();
} else {
mutex_lock(&m->mutex);
if (!thread_spin_trylock(&m->lock))
panic();
}
}
void mutex_pm_aware_unlock(struct mutex_pm_aware *m)
{
if (thread_get_id_may_fail() == THREAD_ID_INVALID) {
assert(!m->mutex.state);
cpu_spin_unlock(&m->lock);
} else {
thread_spin_unlock(&m->lock);
mutex_unlock(&m->mutex);
}
}
void condvar_init(struct condvar *cv)
{
*cv = (struct condvar)CONDVAR_INITIALIZER;
}
void condvar_destroy(struct condvar *cv)
{
if (cv->m && wq_have_condvar(&cv->m->wq, cv))
panic();
condvar_init(cv);
}
static void cv_signal(struct condvar *cv, bool only_one, const char *fname,
int lineno)
{
uint32_t old_itr_status;
struct mutex *m;
old_itr_status = cpu_spin_lock_xsave(&cv->spin_lock);
m = cv->m;
cpu_spin_unlock_xrestore(&cv->spin_lock, old_itr_status);
if (m)
wq_promote_condvar(&m->wq, cv, only_one, m, fname, lineno);
}
#ifdef CFG_MUTEX_DEBUG
void condvar_signal_debug(struct condvar *cv, const char *fname, int lineno)
{
cv_signal(cv, true /* only one */, fname, lineno);
}
void condvar_broadcast_debug(struct condvar *cv, const char *fname, int lineno)
{
cv_signal(cv, false /* all */, fname, lineno);
}
#else
void condvar_signal(struct condvar *cv)
{
cv_signal(cv, true /* only one */, NULL, -1);
}
void condvar_broadcast(struct condvar *cv)
{
cv_signal(cv, false /* all */, NULL, -1);
}
#endif /*CFG_MUTEX_DEBUG*/
static TEE_Result __condvar_wait_timeout(struct condvar *cv, struct mutex *m,
uint32_t timeout_ms, const char *fname,
int lineno)
{
TEE_Result res = TEE_SUCCESS;
uint32_t old_itr_status = 0;
struct wait_queue_elem wqe = { };
short old_state = 0;
short new_state = 0;
mutex_unlock_check(m);
/* Link this condvar to this mutex until reinitialized */
old_itr_status = cpu_spin_lock_xsave(&cv->spin_lock);
if (cv->m && cv->m != m)
panic("invalid mutex");
cv->m = m;
cpu_spin_unlock(&cv->spin_lock);
cpu_spin_lock(&m->spin_lock);
if (!m->state)
panic();
old_state = m->state;
/* Add to mutex wait queue as a condvar waiter */
wq_wait_init_condvar(&m->wq, &wqe, cv, m->state > 0);
if (m->state > 1) {
/* Multiple read locks, remove one */
m->state--;
} else {
/* Only one lock (read or write), unlock the mutex */
m->state = 0;
}
new_state = m->state;
cpu_spin_unlock_xrestore(&m->spin_lock, old_itr_status);
/* Wake eventual waiters if the mutex was unlocked */
if (!new_state)
wq_wake_next(&m->wq, m, fname, lineno);
res = wq_wait_final(&m->wq, &wqe, timeout_ms, m, fname, lineno);
if (old_state > 0)
mutex_read_lock(m);
else
mutex_lock(m);
return res;
}
#ifdef CFG_MUTEX_DEBUG
void condvar_wait_debug(struct condvar *cv, struct mutex *m,
const char *fname, int lineno)
{
__condvar_wait_timeout(cv, m, 0, fname, lineno);
}
TEE_Result condvar_wait_timeout_debug(struct condvar *cv, struct mutex *m,
uint32_t timeout_ms, const char *fname,
int lineno)
{
return __condvar_wait_timeout(cv, m, timeout_ms, fname, lineno);
}
#else
void condvar_wait(struct condvar *cv, struct mutex *m)
{
__condvar_wait_timeout(cv, m, 0, NULL, -1);
}
TEE_Result condvar_wait_timeout(struct condvar *cv, struct mutex *m,
uint32_t timeout_ms)
{
return __condvar_wait_timeout(cv, m, timeout_ms, NULL, -1);
}
#endif
|