semaphore.h 3.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147
  1. /* SMP- and interrupt-safe semaphores.
  2. * PA-RISC version by Matthew Wilcox
  3. *
  4. * Linux/PA-RISC Project (http://www.parisc-linux.org/)
  5. * Copyright (C) 1996 Linus Torvalds
  6. * Copyright (C) 1999-2001 Matthew Wilcox < willy at debian d0T org >
  7. * Copyright (C) 2000 Grant Grundler < grundler a debian org >
  8. *
  9. * This program is free software; you can redistribute it and/or modify
  10. * it under the terms of the GNU General Public License as published by
  11. * the Free Software Foundation; either version 2 of the License, or
  12. * (at your option) any later version.
  13. *
  14. * This program is distributed in the hope that it will be useful,
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  17. * GNU General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU General Public License
  20. * along with this program; if not, write to the Free Software
  21. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  22. */
  23. #ifndef _ASM_PARISC_SEMAPHORE_H
  24. #define _ASM_PARISC_SEMAPHORE_H
  25. #include <linux/spinlock.h>
  26. #include <linux/wait.h>
  27. #include <linux/rwsem.h>
  28. #include <asm/system.h>
  29. /*
  30. * The `count' is initialised to the number of people who are allowed to
  31. * take the lock. (Normally we want a mutex, so this is `1'). if
  32. * `count' is positive, the lock can be taken. if it's 0, no-one is
  33. * waiting on it. if it's -1, at least one task is waiting.
  34. */
  35. struct semaphore {
  36. spinlock_t sentry;
  37. int count;
  38. wait_queue_head_t wait;
  39. };
  40. #define __SEMAPHORE_INITIALIZER(name, n) \
  41. { \
  42. .sentry = SPIN_LOCK_UNLOCKED, \
  43. .count = n, \
  44. .wait = __WAIT_QUEUE_HEAD_INITIALIZER((name).wait) \
  45. }
  46. #define __MUTEX_INITIALIZER(name) \
  47. __SEMAPHORE_INITIALIZER(name,1)
  48. #define __DECLARE_SEMAPHORE_GENERIC(name,count) \
  49. struct semaphore name = __SEMAPHORE_INITIALIZER(name,count)
  50. #define DECLARE_MUTEX(name) __DECLARE_SEMAPHORE_GENERIC(name,1)
  51. #define DECLARE_MUTEX_LOCKED(name) __DECLARE_SEMAPHORE_GENERIC(name,0)
  52. extern inline void sema_init (struct semaphore *sem, int val)
  53. {
  54. *sem = (struct semaphore)__SEMAPHORE_INITIALIZER((*sem),val);
  55. }
  56. static inline void init_MUTEX (struct semaphore *sem)
  57. {
  58. sema_init(sem, 1);
  59. }
  60. static inline void init_MUTEX_LOCKED (struct semaphore *sem)
  61. {
  62. sema_init(sem, 0);
  63. }
  64. static inline int sem_getcount(struct semaphore *sem)
  65. {
  66. return sem->count;
  67. }
  68. asmlinkage void __down(struct semaphore * sem);
  69. asmlinkage int __down_interruptible(struct semaphore * sem);
  70. asmlinkage void __up(struct semaphore * sem);
  71. /* Semaphores can be `tried' from irq context. So we have to disable
  72. * interrupts while we're messing with the semaphore. Sorry.
  73. */
  74. extern __inline__ void down(struct semaphore * sem)
  75. {
  76. might_sleep();
  77. spin_lock_irq(&sem->sentry);
  78. if (sem->count > 0) {
  79. sem->count--;
  80. } else {
  81. __down(sem);
  82. }
  83. spin_unlock_irq(&sem->sentry);
  84. }
  85. extern __inline__ int down_interruptible(struct semaphore * sem)
  86. {
  87. int ret = 0;
  88. might_sleep();
  89. spin_lock_irq(&sem->sentry);
  90. if (sem->count > 0) {
  91. sem->count--;
  92. } else {
  93. ret = __down_interruptible(sem);
  94. }
  95. spin_unlock_irq(&sem->sentry);
  96. return ret;
  97. }
  98. /*
  99. * down_trylock returns 0 on success, 1 if we failed to get the lock.
  100. * May not sleep, but must preserve irq state
  101. */
  102. extern __inline__ int down_trylock(struct semaphore * sem)
  103. {
  104. int flags, count;
  105. spin_lock_irqsave(&sem->sentry, flags);
  106. count = sem->count - 1;
  107. if (count >= 0)
  108. sem->count = count;
  109. spin_unlock_irqrestore(&sem->sentry, flags);
  110. return (count < 0);
  111. }
  112. /*
  113. * Note! This is subtle. We jump to wake people up only if
  114. * the semaphore was negative (== somebody was waiting on it).
  115. */
  116. extern __inline__ void up(struct semaphore * sem)
  117. {
  118. int flags;
  119. spin_lock_irqsave(&sem->sentry, flags);
  120. if (sem->count < 0) {
  121. __up(sem);
  122. } else {
  123. sem->count++;
  124. }
  125. spin_unlock_irqrestore(&sem->sentry, flags);
  126. }
  127. #endif /* _ASM_PARISC_SEMAPHORE_H */