Subversion Repositories HelenOS

Rev

Rev 4513 | Rev 4527 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (c) 2009 Jakub Jermar
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * - Redistributions of source code must retain the above copyright
  10.  *   notice, this list of conditions and the following disclaimer.
  11.  * - Redistributions in binary form must reproduce the above copyright
  12.  *   notice, this list of conditions and the following disclaimer in the
  13.  *   documentation and/or other materials provided with the distribution.
  14.  * - The name of the author may not be used to endorse or promote products
  15.  *   derived from this software without specific prior written permission.
  16.  *
  17.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  18.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  19.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  22.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  26.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27.  */
  28.  
  29. /** @addtogroup libc
  30.  * @{
  31.  */
  32. /** @file
  33.  */
  34.  
  35. #include <fibril_sync.h>
  36. #include <fibril.h>
  37. #include <async.h>
  38. #include <adt/list.h>
  39. #include <futex.h>
  40. #include <assert.h>
  41.  
  42. void fibril_mutex_initialize(fibril_mutex_t *fm)
  43. {
  44.     fm->counter = 1;
  45.     list_initialize(&fm->waiters);
  46. }
  47.  
  48. void fibril_mutex_lock(fibril_mutex_t *fm)
  49. {
  50.     futex_down(&async_futex);
  51.     if (fm->counter-- <= 0) {
  52.         fibril_t *f = (fibril_t *) fibril_get_id();
  53.         list_append(&f->link, &fm->waiters);
  54.         fibril_switch(FIBRIL_TO_MANAGER);
  55.     } else {
  56.         futex_up(&async_futex);
  57.     }
  58. }
  59.  
  60. bool fibril_mutex_trylock(fibril_mutex_t *fm)
  61. {
  62.     bool locked = false;
  63.    
  64.     futex_down(&async_futex);
  65.     if (fm->counter > 0) {
  66.         fm->counter--;
  67.         locked = true;
  68.     }
  69.     futex_up(&async_futex);
  70.    
  71.     return locked;
  72. }
  73.  
  74. void fibril_mutex_unlock(fibril_mutex_t *fm)
  75. {
  76.     futex_down(&async_futex);
  77.     assert(fm->counter <= 0);
  78.     if (fm->counter++ < 0) {
  79.         link_t *tmp;
  80.         fibril_t *f;
  81.    
  82.         assert(!list_empty(&fm->waiters));
  83.         tmp = fm->waiters.next;
  84.         f = list_get_instance(tmp, fibril_t, link);
  85.         list_remove(&f->link);
  86.         fibril_add_ready((fid_t) f);
  87.     }
  88.     futex_up(&async_futex);
  89. }
  90.  
  91. void fibril_rwlock_initialize(fibril_rwlock_t *frw)
  92. {
  93.     fibril_mutex_initialize(&frw->fm);
  94. }
  95.  
  96. void fibril_rwlock_read_lock(fibril_rwlock_t *frw)
  97. {
  98.     fibril_mutex_lock(&frw->fm);
  99. }
  100.  
  101. void fibril_rwlock_write_lock(fibril_rwlock_t *frw)
  102. {
  103.     fibril_mutex_lock(&frw->fm);
  104. }
  105.  
  106. void fibril_rwlock_read_unlock(fibril_rwlock_t *frw)
  107. {
  108.     fibril_mutex_unlock(&frw->fm);
  109. }
  110.  
  111. void fibril_rwlock_write_unlock(fibril_rwlock_t *frw)
  112. {
  113.     fibril_mutex_unlock(&frw->fm);
  114. }
  115.  
  116. /** @}
  117.  */
  118.