xfs_arch.h 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213
  1. /*
  2. * Copyright (c) 2000-2002 Silicon Graphics, Inc. All Rights Reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or modify it
  5. * under the terms of version 2 of the GNU General Public License as
  6. * published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it would be useful, but
  9. * WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  11. *
  12. * Further, this software is distributed without any warranty that it is
  13. * free of the rightful claim of any third person regarding infringement
  14. * or the like. Any license provided herein, whether implied or
  15. * otherwise, applies only to this software file. Patent licenses, if
  16. * any, provided herein do not apply to combinations of this program with
  17. * other software, or any other product whatsoever.
  18. *
  19. * You should have received a copy of the GNU General Public License along
  20. * with this program; if not, write the Free Software Foundation, Inc., 59
  21. * Temple Place - Suite 330, Boston MA 02111-1307, USA.
  22. *
  23. * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
  24. * Mountain View, CA 94043, or:
  25. *
  26. * http://www.sgi.com
  27. *
  28. * For further information regarding this notice, see:
  29. *
  30. * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
  31. */
  32. #ifndef __XFS_ARCH_H__
  33. #define __XFS_ARCH_H__
  34. #ifndef XFS_BIG_INUMS
  35. # error XFS_BIG_INUMS must be defined true or false
  36. #endif
  37. #ifdef __KERNEL__
  38. #include <asm/byteorder.h>
  39. #ifdef __LITTLE_ENDIAN
  40. # define __BYTE_ORDER __LITTLE_ENDIAN
  41. #endif
  42. #ifdef __BIG_ENDIAN
  43. # define __BYTE_ORDER __BIG_ENDIAN
  44. #endif
  45. #endif /* __KERNEL__ */
  46. /* do we need conversion? */
  47. #define ARCH_NOCONVERT 1
  48. #if __BYTE_ORDER == __LITTLE_ENDIAN
  49. # define ARCH_CONVERT 0
  50. #else
  51. # define ARCH_CONVERT ARCH_NOCONVERT
  52. #endif
  53. /* generic swapping macros */
  54. #ifndef HAVE_SWABMACROS
  55. #define INT_SWAP16(type,var) ((typeof(type))(__swab16((__u16)(var))))
  56. #define INT_SWAP32(type,var) ((typeof(type))(__swab32((__u32)(var))))
  57. #define INT_SWAP64(type,var) ((typeof(type))(__swab64((__u64)(var))))
  58. #endif
  59. #define INT_SWAP(type, var) \
  60. ((sizeof(type) == 8) ? INT_SWAP64(type,var) : \
  61. ((sizeof(type) == 4) ? INT_SWAP32(type,var) : \
  62. ((sizeof(type) == 2) ? INT_SWAP16(type,var) : \
  63. (var))))
  64. /*
  65. * get and set integers from potentially unaligned locations
  66. */
  67. #define INT_GET_UNALIGNED_16_BE(pointer) \
  68. ((__u16)((((__u8*)(pointer))[0] << 8) | (((__u8*)(pointer))[1])))
  69. #define INT_SET_UNALIGNED_16_BE(pointer,value) \
  70. { \
  71. ((__u8*)(pointer))[0] = (((value) >> 8) & 0xff); \
  72. ((__u8*)(pointer))[1] = (((value) ) & 0xff); \
  73. }
  74. /* define generic INT_ macros */
  75. #define INT_GET(reference,arch) \
  76. (((arch) == ARCH_NOCONVERT) \
  77. ? \
  78. (reference) \
  79. : \
  80. INT_SWAP((reference),(reference)) \
  81. )
  82. /* does not return a value */
  83. #define INT_SET(reference,arch,valueref) \
  84. (__builtin_constant_p(valueref) ? \
  85. (void)( (reference) = ( ((arch) != ARCH_NOCONVERT) ? (INT_SWAP((reference),(valueref))) : (valueref)) ) : \
  86. (void)( \
  87. ((reference) = (valueref)), \
  88. ( ((arch) != ARCH_NOCONVERT) ? (reference) = INT_SWAP((reference),(reference)) : 0 ) \
  89. ) \
  90. )
  91. /* does not return a value */
  92. #define INT_MOD_EXPR(reference,arch,code) \
  93. (((arch) == ARCH_NOCONVERT) \
  94. ? \
  95. (void)((reference) code) \
  96. : \
  97. (void)( \
  98. (reference) = INT_GET((reference),arch) , \
  99. ((reference) code), \
  100. INT_SET(reference, arch, reference) \
  101. ) \
  102. )
  103. /* does not return a value */
  104. #define INT_MOD(reference,arch,delta) \
  105. (void)( \
  106. INT_MOD_EXPR(reference,arch,+=(delta)) \
  107. )
  108. /*
  109. * INT_COPY - copy a value between two locations with the
  110. * _same architecture_ but _potentially different sizes_
  111. *
  112. * if the types of the two parameters are equal or they are
  113. * in native architecture, a simple copy is done
  114. *
  115. * otherwise, architecture conversions are done
  116. *
  117. */
  118. /* does not return a value */
  119. #define INT_COPY(dst,src,arch) \
  120. ( \
  121. ((sizeof(dst) == sizeof(src)) || ((arch) == ARCH_NOCONVERT)) \
  122. ? \
  123. (void)((dst) = (src)) \
  124. : \
  125. INT_SET(dst, arch, INT_GET(src, arch)) \
  126. )
  127. /*
  128. * INT_XLATE - copy a value in either direction between two locations
  129. * with different architectures
  130. *
  131. * dir < 0 - copy from memory to buffer (native to arch)
  132. * dir > 0 - copy from buffer to memory (arch to native)
  133. */
  134. /* does not return a value */
  135. #define INT_XLATE(buf,mem,dir,arch) {\
  136. ASSERT(dir); \
  137. if (dir>0) { \
  138. (mem)=INT_GET(buf, arch); \
  139. } else { \
  140. INT_SET(buf, arch, mem); \
  141. } \
  142. }
  143. /*
  144. * In directories inode numbers are stored as unaligned arrays of unsigned
  145. * 8bit integers on disk.
  146. *
  147. * For v1 directories or v2 directories that contain inode numbers that
  148. * do not fit into 32bit the array has eight members, but the first member
  149. * is always zero:
  150. *
  151. * |unused|48-55|40-47|32-39|24-31|16-23| 8-15| 0- 7|
  152. *
  153. * For v2 directories that only contain entries with inode numbers that fit
  154. * into 32bits a four-member array is used:
  155. *
  156. * |24-31|16-23| 8-15| 0- 7|
  157. */
  158. #define XFS_GET_DIR_INO4(di) \
  159. (((u32)(di).i[0] << 24) | ((di).i[1] << 16) | ((di).i[2] << 8) | ((di).i[3]))
  160. #define XFS_PUT_DIR_INO4(from, di) \
  161. do { \
  162. (di).i[0] = (((from) & 0xff000000ULL) >> 24); \
  163. (di).i[1] = (((from) & 0x00ff0000ULL) >> 16); \
  164. (di).i[2] = (((from) & 0x0000ff00ULL) >> 8); \
  165. (di).i[3] = ((from) & 0x000000ffULL); \
  166. } while (0)
  167. #define XFS_DI_HI(di) \
  168. (((u32)(di).i[1] << 16) | ((di).i[2] << 8) | ((di).i[3]))
  169. #define XFS_DI_LO(di) \
  170. (((u32)(di).i[4] << 24) | ((di).i[5] << 16) | ((di).i[6] << 8) | ((di).i[7]))
  171. #define XFS_GET_DIR_INO8(di) \
  172. (((xfs_ino_t)XFS_DI_LO(di) & 0xffffffffULL) | \
  173. ((xfs_ino_t)XFS_DI_HI(di) << 32))
  174. #define XFS_PUT_DIR_INO8(from, di) \
  175. do { \
  176. (di).i[0] = 0; \
  177. (di).i[1] = (((from) & 0x00ff000000000000ULL) >> 48); \
  178. (di).i[2] = (((from) & 0x0000ff0000000000ULL) >> 40); \
  179. (di).i[3] = (((from) & 0x000000ff00000000ULL) >> 32); \
  180. (di).i[4] = (((from) & 0x00000000ff000000ULL) >> 24); \
  181. (di).i[5] = (((from) & 0x0000000000ff0000ULL) >> 16); \
  182. (di).i[6] = (((from) & 0x000000000000ff00ULL) >> 8); \
  183. (di).i[7] = ((from) & 0x00000000000000ffULL); \
  184. } while (0)
  185. #endif /* __XFS_ARCH_H__ */