unaligned.h 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191
  1. #ifndef __ASM_ARM_UNALIGNED_H
  2. #define __ASM_ARM_UNALIGNED_H
  3. #include <asm/types.h>
  4. extern int __bug_unaligned_x(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_le(ptr) \
  47. ({ \
  48. __typeof__(*(ptr)) __v; \
  49. __u8 *__p = (__u8 *)(ptr); \
  50. switch (sizeof(*(ptr))) { \
  51. case 1: __v = *(ptr); break; \
  52. case 2: __v = __get_unaligned_2_le(__p); break; \
  53. case 4: __v = __get_unaligned_4_le(__p); break; \
  54. case 8: { \
  55. unsigned int __v1, __v2; \
  56. __v2 = __get_unaligned_4_le((__p+4)); \
  57. __v1 = __get_unaligned_4_le(__p); \
  58. __v = ((unsigned long long)__v2 << 32 | __v1); \
  59. } \
  60. break; \
  61. default: __v = __bug_unaligned_x(__p); break; \
  62. } \
  63. __v; \
  64. })
  65. #define __get_unaligned_be(ptr) \
  66. ({ \
  67. __typeof__(*(ptr)) __v; \
  68. __u8 *__p = (__u8 *)(ptr); \
  69. switch (sizeof(*(ptr))) { \
  70. case 1: __v = *(ptr); break; \
  71. case 2: __v = __get_unaligned_2_be(__p); break; \
  72. case 4: __v = __get_unaligned_4_be(__p); break; \
  73. case 8: { \
  74. unsigned int __v1, __v2; \
  75. __v2 = __get_unaligned_4_be(__p); \
  76. __v1 = __get_unaligned_4_be((__p+4)); \
  77. __v = ((unsigned long long)__v2 << 32 | __v1); \
  78. } \
  79. break; \
  80. default: __v = __bug_unaligned_x(__p); break; \
  81. } \
  82. __v; \
  83. })
  84. static inline void __put_unaligned_2_le(__u32 __v, register __u8 *__p)
  85. {
  86. *__p++ = __v;
  87. *__p++ = __v >> 8;
  88. }
  89. static inline void __put_unaligned_2_be(__u32 __v, register __u8 *__p)
  90. {
  91. *__p++ = __v >> 8;
  92. *__p++ = __v;
  93. }
  94. static inline void __put_unaligned_4_le(__u32 __v, register __u8 *__p)
  95. {
  96. __put_unaligned_2_le(__v >> 16, __p + 2);
  97. __put_unaligned_2_le(__v, __p);
  98. }
  99. static inline void __put_unaligned_4_be(__u32 __v, register __u8 *__p)
  100. {
  101. __put_unaligned_2_be(__v >> 16, __p);
  102. __put_unaligned_2_be(__v, __p + 2);
  103. }
  104. static inline void __put_unaligned_8_le(const unsigned long long __v, register __u8 *__p)
  105. {
  106. /*
  107. * tradeoff: 8 bytes of stack for all unaligned puts (2
  108. * instructions), or an extra register in the long long
  109. * case - go for the extra register.
  110. */
  111. __put_unaligned_4_le(__v >> 32, __p+4);
  112. __put_unaligned_4_le(__v, __p);
  113. }
  114. static inline void __put_unaligned_8_be(const unsigned long long __v, register __u8 *__p)
  115. {
  116. /*
  117. * tradeoff: 8 bytes of stack for all unaligned puts (2
  118. * instructions), or an extra register in the long long
  119. * case - go for the extra register.
  120. */
  121. __put_unaligned_4_be(__v >> 32, __p);
  122. __put_unaligned_4_be(__v, __p+4);
  123. }
  124. /*
  125. * Try to store an unaligned value as efficiently as possible.
  126. */
  127. #define __put_unaligned_le(val,ptr) \
  128. ({ \
  129. switch (sizeof(*(ptr))) { \
  130. case 1: \
  131. *(ptr) = (val); \
  132. break; \
  133. case 2: __put_unaligned_2_le((val),(__u8 *)(ptr)); \
  134. break; \
  135. case 4: __put_unaligned_4_le((val),(__u8 *)(ptr)); \
  136. break; \
  137. case 8: __put_unaligned_8_le((val),(__u8 *)(ptr)); \
  138. break; \
  139. default: __bug_unaligned_x(ptr); \
  140. break; \
  141. } \
  142. (void) 0; \
  143. })
  144. #define __put_unaligned_be(val,ptr) \
  145. ({ \
  146. switch (sizeof(*(ptr))) { \
  147. case 1: \
  148. *(ptr) = (val); \
  149. break; \
  150. case 2: __put_unaligned_2_be((val),(__u8 *)(ptr)); \
  151. break; \
  152. case 4: __put_unaligned_4_be((val),(__u8 *)(ptr)); \
  153. break; \
  154. case 8: __put_unaligned_8_be((val),(__u8 *)(ptr)); \
  155. break; \
  156. default: __bug_unaligned_x(ptr); \
  157. break; \
  158. } \
  159. (void) 0; \
  160. })
  161. /*
  162. * Select endianness
  163. */
  164. #ifndef __ARMEB__
  165. #define get_unaligned __get_unaligned_le
  166. #define put_unaligned __put_unaligned_le
  167. #else
  168. #define get_unaligned __get_unaligned_be
  169. #define put_unaligned __put_unaligned_be
  170. #endif
  171. #endif