spinlock.h 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174
  1. /*
  2. * include/asm-s390/spinlock.h
  3. *
  4. * S390 version
  5. * Copyright (C) 1999 IBM Deutschland Entwicklung GmbH, IBM Corporation
  6. * Author(s): Martin Schwidefsky (schwidefsky@de.ibm.com)
  7. *
  8. * Derived from "include/asm-i386/spinlock.h"
  9. */
  10. #ifndef __ASM_SPINLOCK_H
  11. #define __ASM_SPINLOCK_H
  12. #include <linux/smp.h>
  13. #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 2)
  14. static inline int
  15. _raw_compare_and_swap(volatile unsigned int *lock,
  16. unsigned int old, unsigned int new)
  17. {
  18. asm volatile(
  19. " cs %0,%3,%1"
  20. : "=d" (old), "=Q" (*lock)
  21. : "0" (old), "d" (new), "Q" (*lock)
  22. : "cc", "memory" );
  23. return old;
  24. }
  25. #else /* __GNUC__ */
  26. static inline int
  27. _raw_compare_and_swap(volatile unsigned int *lock,
  28. unsigned int old, unsigned int new)
  29. {
  30. asm volatile(
  31. " cs %0,%3,0(%4)"
  32. : "=d" (old), "=m" (*lock)
  33. : "0" (old), "d" (new), "a" (lock), "m" (*lock)
  34. : "cc", "memory" );
  35. return old;
  36. }
  37. #endif /* __GNUC__ */
  38. /*
  39. * Simple spin lock operations. There are two variants, one clears IRQ's
  40. * on the local processor, one does not.
  41. *
  42. * We make no fairness assumptions. They have a cost.
  43. *
  44. * (the type definitions are in asm/spinlock_types.h)
  45. */
  46. #define __raw_spin_is_locked(x) ((x)->owner_cpu != 0)
  47. #define __raw_spin_lock_flags(lock, flags) __raw_spin_lock(lock)
  48. #define __raw_spin_unlock_wait(lock) \
  49. do { while (__raw_spin_is_locked(lock)) \
  50. _raw_spin_relax(lock); } while (0)
  51. extern void _raw_spin_lock_wait(raw_spinlock_t *, unsigned int pc);
  52. extern int _raw_spin_trylock_retry(raw_spinlock_t *, unsigned int pc);
  53. extern void _raw_spin_relax(raw_spinlock_t *lock);
  54. static inline void __raw_spin_lock(raw_spinlock_t *lp)
  55. {
  56. unsigned long pc = 1 | (unsigned long) __builtin_return_address(0);
  57. int old;
  58. old = _raw_compare_and_swap(&lp->owner_cpu, 0, ~smp_processor_id());
  59. if (likely(old == 0)) {
  60. lp->owner_pc = pc;
  61. return;
  62. }
  63. _raw_spin_lock_wait(lp, pc);
  64. }
  65. static inline int __raw_spin_trylock(raw_spinlock_t *lp)
  66. {
  67. unsigned long pc = 1 | (unsigned long) __builtin_return_address(0);
  68. int old;
  69. old = _raw_compare_and_swap(&lp->owner_cpu, 0, ~smp_processor_id());
  70. if (likely(old == 0)) {
  71. lp->owner_pc = pc;
  72. return 1;
  73. }
  74. return _raw_spin_trylock_retry(lp, pc);
  75. }
  76. static inline void __raw_spin_unlock(raw_spinlock_t *lp)
  77. {
  78. lp->owner_pc = 0;
  79. _raw_compare_and_swap(&lp->owner_cpu, lp->owner_cpu, 0);
  80. }
  81. /*
  82. * Read-write spinlocks, allowing multiple readers
  83. * but only one writer.
  84. *
  85. * NOTE! it is quite common to have readers in interrupts
  86. * but no interrupt writers. For those circumstances we
  87. * can "mix" irq-safe locks - any writer needs to get a
  88. * irq-safe write-lock, but readers can get non-irqsafe
  89. * read-locks.
  90. */
  91. /**
  92. * read_can_lock - would read_trylock() succeed?
  93. * @lock: the rwlock in question.
  94. */
  95. #define __raw_read_can_lock(x) ((int)(x)->lock >= 0)
  96. /**
  97. * write_can_lock - would write_trylock() succeed?
  98. * @lock: the rwlock in question.
  99. */
  100. #define __raw_write_can_lock(x) ((x)->lock == 0)
  101. extern void _raw_read_lock_wait(raw_rwlock_t *lp);
  102. extern int _raw_read_trylock_retry(raw_rwlock_t *lp);
  103. extern void _raw_write_lock_wait(raw_rwlock_t *lp);
  104. extern int _raw_write_trylock_retry(raw_rwlock_t *lp);
  105. static inline void __raw_read_lock(raw_rwlock_t *rw)
  106. {
  107. unsigned int old;
  108. old = rw->lock & 0x7fffffffU;
  109. if (_raw_compare_and_swap(&rw->lock, old, old + 1) != old)
  110. _raw_read_lock_wait(rw);
  111. }
  112. static inline void __raw_read_unlock(raw_rwlock_t *rw)
  113. {
  114. unsigned int old, cmp;
  115. old = rw->lock;
  116. do {
  117. cmp = old;
  118. old = _raw_compare_and_swap(&rw->lock, old, old - 1);
  119. } while (cmp != old);
  120. }
  121. static inline void __raw_write_lock(raw_rwlock_t *rw)
  122. {
  123. if (unlikely(_raw_compare_and_swap(&rw->lock, 0, 0x80000000) != 0))
  124. _raw_write_lock_wait(rw);
  125. }
  126. static inline void __raw_write_unlock(raw_rwlock_t *rw)
  127. {
  128. _raw_compare_and_swap(&rw->lock, 0x80000000, 0);
  129. }
  130. static inline int __raw_read_trylock(raw_rwlock_t *rw)
  131. {
  132. unsigned int old;
  133. old = rw->lock & 0x7fffffffU;
  134. if (likely(_raw_compare_and_swap(&rw->lock, old, old + 1) == old))
  135. return 1;
  136. return _raw_read_trylock_retry(rw);
  137. }
  138. static inline int __raw_write_trylock(raw_rwlock_t *rw)
  139. {
  140. if (likely(_raw_compare_and_swap(&rw->lock, 0, 0x80000000) == 0))
  141. return 1;
  142. return _raw_write_trylock_retry(rw);
  143. }
  144. #define _raw_read_relax(lock) cpu_relax()
  145. #define _raw_write_relax(lock) cpu_relax()
  146. #endif /* __ASM_SPINLOCK_H */