atomic.h 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142
  1. #ifndef _INTERNAL_ATOMIC_H
  2. #define _INTERNAL_ATOMIC_H
  3. #include <stdint.h>
  4. static inline int a_ctz_l(unsigned long x)
  5. {
  6. static const char debruijn32[32] = {
  7. 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13,
  8. 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14
  9. };
  10. return debruijn32[(x&-x)*0x076be629 >> 27];
  11. }
  12. static inline int a_ctz_64(uint64_t x)
  13. {
  14. uint32_t y = x;
  15. if (!y) {
  16. y = x>>32;
  17. return 32 + a_ctz_l(y);
  18. }
  19. return a_ctz_l(y);
  20. }
  21. #if __ARM_ARCH_6__ || __ARM_ARCH_6K__ || __ARM_ARCH_6ZK__ \
  22. || __ARM_ARCH_7A__ || __ARM_ARCH_7R__ \
  23. || __ARM_ARCH >= 7
  24. static inline int __k_cas(int t, int s, volatile int *p)
  25. {
  26. int ret;
  27. __asm__(
  28. " mcr p15,0,r0,c7,c10,5\n"
  29. "1: ldrex %0,%3\n"
  30. " subs %0,%0,%1\n"
  31. " strexeq %0,%2,%3\n"
  32. " teqeq %0,#1\n"
  33. " beq 1b\n"
  34. " mcr p15,0,r0,c7,c10,5\n"
  35. : "=&r"(ret)
  36. : "r"(t), "r"(s), "Q"(*p)
  37. : "memory", "cc" );
  38. return ret;
  39. }
  40. #else
  41. #define __k_cas ((int (*)(int, int, volatile int *))0xffff0fc0)
  42. #endif
  43. static inline int a_cas(volatile int *p, int t, int s)
  44. {
  45. int old;
  46. for (;;) {
  47. if (!__k_cas(t, s, p))
  48. return t;
  49. if ((old=*p) != t)
  50. return old;
  51. }
  52. }
  53. static inline void *a_cas_p(volatile void *p, void *t, void *s)
  54. {
  55. return (void *)a_cas(p, (int)t, (int)s);
  56. }
  57. static inline long a_cas_l(volatile void *p, long t, long s)
  58. {
  59. return a_cas(p, t, s);
  60. }
  61. static inline int a_swap(volatile int *x, int v)
  62. {
  63. int old;
  64. do old = *x;
  65. while (__k_cas(old, v, x));
  66. return old;
  67. }
  68. static inline int a_fetch_add(volatile int *x, int v)
  69. {
  70. int old;
  71. do old = *x;
  72. while (__k_cas(old, old+v, x));
  73. return old;
  74. }
  75. static inline void a_inc(volatile int *x)
  76. {
  77. a_fetch_add(x, 1);
  78. }
  79. static inline void a_dec(volatile int *x)
  80. {
  81. a_fetch_add(x, -1);
  82. }
  83. static inline void a_store(volatile int *p, int x)
  84. {
  85. while (__k_cas(*p, x, p));
  86. }
  87. static inline void a_spin()
  88. {
  89. }
  90. static inline void a_crash()
  91. {
  92. *(volatile char *)0=0;
  93. }
  94. static inline void a_and(volatile int *p, int v)
  95. {
  96. int old;
  97. do old = *p;
  98. while (__k_cas(old, old&v, p));
  99. }
  100. static inline void a_or(volatile int *p, int v)
  101. {
  102. int old;
  103. do old = *p;
  104. while (__k_cas(old, old|v, p));
  105. }
  106. static inline void a_or_l(volatile void *p, long v)
  107. {
  108. a_or(p, v);
  109. }
  110. static inline void a_and_64(volatile uint64_t *p, uint64_t v)
  111. {
  112. union { uint64_t v; uint32_t r[2]; } u = { v };
  113. a_and((int *)p, u.r[0]);
  114. a_and((int *)p+1, u.r[1]);
  115. }
  116. static inline void a_or_64(volatile uint64_t *p, uint64_t v)
  117. {
  118. union { uint64_t v; uint32_t r[2]; } u = { v };
  119. a_or((int *)p, u.r[0]);
  120. a_or((int *)p+1, u.r[1]);
  121. }
  122. #endif