struct-funcs.c 3.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
  1. /*
  2. * Copyright (C) 2007 Oracle. All rights reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public
  6. * License v2 as published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it will be useful,
  9. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. * General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU General Public
  14. * License along with this program; if not, write to the
  15. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16. * Boston, MA 021110-1307, USA.
  17. */
  18. #include <linux/highmem.h>
  19. #define BTRFS_SETGET_FUNCS(name, type, member, bits) \
  20. u##bits btrfs_##name(struct extent_buffer *eb, \
  21. type *s) \
  22. { \
  23. unsigned long offset = (unsigned long)s + \
  24. offsetof(type, member); \
  25. __le##bits *tmp; \
  26. /* ugly, but we want the fast path here */ \
  27. if (eb->map_token && offset >= eb->map_start && \
  28. offset + sizeof(((type *)0)->member) <= eb->map_start + \
  29. eb->map_len) { \
  30. tmp = (__le##bits *)(eb->kaddr + offset - \
  31. eb->map_start); \
  32. return le##bits##_to_cpu(*tmp); \
  33. } \
  34. { \
  35. int err; \
  36. char *map_token; \
  37. char *kaddr; \
  38. int unmap_on_exit = (eb->map_token == NULL); \
  39. unsigned long map_start; \
  40. unsigned long map_len; \
  41. __le##bits res; \
  42. err = map_extent_buffer(eb, offset, \
  43. sizeof(((type *)0)->member), \
  44. &map_token, &kaddr, \
  45. &map_start, &map_len, KM_USER1); \
  46. if (err) { \
  47. read_eb_member(eb, s, type, member, &res); \
  48. return le##bits##_to_cpu(res); \
  49. } \
  50. tmp = (__le##bits *)(kaddr + offset - map_start); \
  51. res = le##bits##_to_cpu(*tmp); \
  52. if (unmap_on_exit) \
  53. unmap_extent_buffer(eb, map_token, KM_USER1); \
  54. return res; \
  55. } \
  56. } \
  57. void btrfs_set_##name(struct extent_buffer *eb, \
  58. type *s, u##bits val) \
  59. { \
  60. unsigned long offset = (unsigned long)s + \
  61. offsetof(type, member); \
  62. __le##bits *tmp; \
  63. /* ugly, but we want the fast path here */ \
  64. if (eb->map_token && offset >= eb->map_start && \
  65. offset + sizeof(((type *)0)->member) <= eb->map_start + \
  66. eb->map_len) { \
  67. tmp = (__le##bits *)(eb->kaddr + offset - \
  68. eb->map_start); \
  69. *tmp = cpu_to_le##bits(val); \
  70. return; \
  71. } \
  72. { \
  73. int err; \
  74. char *map_token; \
  75. char *kaddr; \
  76. int unmap_on_exit = (eb->map_token == NULL); \
  77. unsigned long map_start; \
  78. unsigned long map_len; \
  79. err = map_extent_buffer(eb, offset, \
  80. sizeof(((type *)0)->member), \
  81. &map_token, &kaddr, \
  82. &map_start, &map_len, KM_USER1); \
  83. if (err) { \
  84. val = cpu_to_le##bits(val); \
  85. write_eb_member(eb, s, type, member, &val); \
  86. return; \
  87. } \
  88. tmp = (__le##bits *)(kaddr + offset - map_start); \
  89. *tmp = cpu_to_le##bits(val); \
  90. if (unmap_on_exit) \
  91. unmap_extent_buffer(eb, map_token, KM_USER1); \
  92. } \
  93. }
  94. #include "ctree.h"