unaligned.h 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179
  1. #ifndef __ASM_ARM_UNALIGNED_H
  2. #define __ASM_ARM_UNALIGNED_H
  3. #include <asm/types.h>
  4. extern int __bug_unaligned_x(const void *ptr);
  5. /*
  6. * What is the most efficient way of loading/storing an unaligned value?
  7. *
  8. * That is the subject of this file. Efficiency here is defined as
  9. * minimum code size with minimum register usage for the common cases.
  10. * It is currently not believed that long longs are common, so we
  11. * trade efficiency for the chars, shorts and longs against the long
  12. * longs.
  13. *
  14. * Current stats with gcc 2.7.2.2 for these functions:
  15. *
  16. * ptrsize get: code regs put: code regs
  17. * 1 1 1 1 2
  18. * 2 3 2 3 2
  19. * 4 7 3 7 3
  20. * 8 20 6 16 6
  21. *
  22. * gcc 2.95.1 seems to code differently:
  23. *
  24. * ptrsize get: code regs put: code regs
  25. * 1 1 1 1 2
  26. * 2 3 2 3 2
  27. * 4 7 4 7 4
  28. * 8 19 8 15 6
  29. *
  30. * which may or may not be more efficient (depending upon whether
  31. * you can afford the extra registers). Hopefully the gcc 2.95
  32. * is inteligent enough to decide if it is better to use the
  33. * extra register, but evidence so far seems to suggest otherwise.
  34. *
  35. * Unfortunately, gcc is not able to optimise the high word
  36. * out of long long >> 32, or the low word from long long << 32
  37. */
  38. #define __get_unaligned_2_le(__p) \
  39. (__p[0] | __p[1] << 8)
  40. #define __get_unaligned_2_be(__p) \
  41. (__p[0] << 8 | __p[1])
  42. #define __get_unaligned_4_le(__p) \
  43. (__p[0] | __p[1] << 8 | __p[2] << 16 | __p[3] << 24)
  44. #define __get_unaligned_4_be(__p) \
  45. (__p[0] << 24 | __p[1] << 16 | __p[2] << 8 | __p[3])
  46. #define __get_unaligned_8_le(__p) \
  47. ((unsigned long long)__get_unaligned_4_le((__p+4)) << 32 | \
  48. __get_unaligned_4_le(__p))
  49. #define __get_unaligned_8_be(__p) \
  50. ((unsigned long long)__get_unaligned_4_be(__p) << 32 | \
  51. __get_unaligned_4_be((__p+4)))
  52. #define __get_unaligned_le(ptr) \
  53. ({ \
  54. const __u8 *__p = (const __u8 *)(ptr); \
  55. __builtin_choose_expr(sizeof(*(ptr)) == 1, *__p, \
  56. __builtin_choose_expr(sizeof(*(ptr)) == 2, __get_unaligned_2_le(__p), \
  57. __builtin_choose_expr(sizeof(*(ptr)) == 4, __get_unaligned_4_le(__p), \
  58. __builtin_choose_expr(sizeof(*(ptr)) == 8, __get_unaligned_8_le(__p), \
  59. (void)__bug_unaligned_x(__p))))); \
  60. })
  61. #define __get_unaligned_be(ptr) \
  62. ({ \
  63. const __u8 *__p = (const __u8 *)(ptr); \
  64. __builtin_choose_expr(sizeof(*(ptr)) == 1, *__p, \
  65. __builtin_choose_expr(sizeof(*(ptr)) == 2, __get_unaligned_2_be(__p), \
  66. __builtin_choose_expr(sizeof(*(ptr)) == 4, __get_unaligned_4_be(__p), \
  67. __builtin_choose_expr(sizeof(*(ptr)) == 8, __get_unaligned_8_be(__p), \
  68. (void)__bug_unaligned_x(__p))))); \
  69. })
  70. static inline void __put_unaligned_2_le(__u32 __v, register __u8 *__p)
  71. {
  72. *__p++ = __v;
  73. *__p++ = __v >> 8;
  74. }
  75. static inline void __put_unaligned_2_be(__u32 __v, register __u8 *__p)
  76. {
  77. *__p++ = __v >> 8;
  78. *__p++ = __v;
  79. }
  80. static inline void __put_unaligned_4_le(__u32 __v, register __u8 *__p)
  81. {
  82. __put_unaligned_2_le(__v >> 16, __p + 2);
  83. __put_unaligned_2_le(__v, __p);
  84. }
  85. static inline void __put_unaligned_4_be(__u32 __v, register __u8 *__p)
  86. {
  87. __put_unaligned_2_be(__v >> 16, __p);
  88. __put_unaligned_2_be(__v, __p + 2);
  89. }
  90. static inline void __put_unaligned_8_le(const unsigned long long __v, register __u8 *__p)
  91. {
  92. /*
  93. * tradeoff: 8 bytes of stack for all unaligned puts (2
  94. * instructions), or an extra register in the long long
  95. * case - go for the extra register.
  96. */
  97. __put_unaligned_4_le(__v >> 32, __p+4);
  98. __put_unaligned_4_le(__v, __p);
  99. }
  100. static inline void __put_unaligned_8_be(const unsigned long long __v, register __u8 *__p)
  101. {
  102. /*
  103. * tradeoff: 8 bytes of stack for all unaligned puts (2
  104. * instructions), or an extra register in the long long
  105. * case - go for the extra register.
  106. */
  107. __put_unaligned_4_be(__v >> 32, __p);
  108. __put_unaligned_4_be(__v, __p+4);
  109. }
  110. /*
  111. * Try to store an unaligned value as efficiently as possible.
  112. */
  113. #define __put_unaligned_le(val,ptr) \
  114. ({ \
  115. switch (sizeof(*(ptr))) { \
  116. case 1: \
  117. *(ptr) = (val); \
  118. break; \
  119. case 2: __put_unaligned_2_le((val),(__u8 *)(ptr)); \
  120. break; \
  121. case 4: __put_unaligned_4_le((val),(__u8 *)(ptr)); \
  122. break; \
  123. case 8: __put_unaligned_8_le((val),(__u8 *)(ptr)); \
  124. break; \
  125. default: __bug_unaligned_x(ptr); \
  126. break; \
  127. } \
  128. (void) 0; \
  129. })
  130. #define __put_unaligned_be(val,ptr) \
  131. ({ \
  132. switch (sizeof(*(ptr))) { \
  133. case 1: \
  134. *(ptr) = (val); \
  135. break; \
  136. case 2: __put_unaligned_2_be((val),(__u8 *)(ptr)); \
  137. break; \
  138. case 4: __put_unaligned_4_be((val),(__u8 *)(ptr)); \
  139. break; \
  140. case 8: __put_unaligned_8_be((val),(__u8 *)(ptr)); \
  141. break; \
  142. default: __bug_unaligned_x(ptr); \
  143. break; \
  144. } \
  145. (void) 0; \
  146. })
  147. /*
  148. * Select endianness
  149. */
  150. #ifndef __ARMEB__
  151. #define get_unaligned __get_unaligned_le
  152. #define put_unaligned __put_unaligned_le
  153. #else
  154. #define get_unaligned __get_unaligned_be
  155. #define put_unaligned __put_unaligned_be
  156. #endif
  157. #endif