struct-funcs.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Copyright (C) 2007 Oracle. All rights reserved.
  4. */
  5. #include <asm/unaligned.h>
  6. #include "ctree.h"
  7. static bool check_setget_bounds(const struct extent_buffer *eb,
  8. const void *ptr, unsigned off, int size)
  9. {
  10. const unsigned long member_offset = (unsigned long)ptr + off;
  11. if (unlikely(member_offset + size > eb->len)) {
  12. btrfs_warn(eb->fs_info,
  13. "bad eb member %s: ptr 0x%lx start %llu member offset %lu size %d",
  14. (member_offset > eb->len ? "start" : "end"),
  15. (unsigned long)ptr, eb->start, member_offset, size);
  16. return false;
  17. }
  18. return true;
  19. }
  20. /*
  21. * Macro templates that define helpers to read/write extent buffer data of a
  22. * given size, that are also used via ctree.h for access to item members by
  23. * specialized helpers.
  24. *
  25. * Generic helpers:
  26. * - btrfs_set_8 (for 8/16/32/64)
  27. * - btrfs_get_8 (for 8/16/32/64)
  28. *
  29. * Generic helpers with a token (cached address of the most recently accessed
  30. * page):
  31. * - btrfs_set_token_8 (for 8/16/32/64)
  32. * - btrfs_get_token_8 (for 8/16/32/64)
  33. *
  34. * The set/get functions handle data spanning two pages transparently, in case
  35. * metadata block size is larger than page. Every pointer to metadata items is
  36. * an offset into the extent buffer page array, cast to a specific type. This
  37. * gives us all the type checking.
  38. *
  39. * The extent buffer pages stored in the array pages do not form a contiguous
  40. * phyusical range, but the API functions assume the linear offset to the range
  41. * from 0 to metadata node size.
  42. */
  43. #define DEFINE_BTRFS_SETGET_BITS(bits) \
  44. u##bits btrfs_get_token_##bits(struct btrfs_map_token *token, \
  45. const void *ptr, unsigned long off) \
  46. { \
  47. const unsigned long member_offset = (unsigned long)ptr + off; \
  48. const unsigned long idx = get_eb_page_index(member_offset); \
  49. const unsigned long oip = get_eb_offset_in_page(token->eb, \
  50. member_offset); \
  51. const int size = sizeof(u##bits); \
  52. u8 lebytes[sizeof(u##bits)]; \
  53. const int part = PAGE_SIZE - oip; \
  54. \
  55. ASSERT(token); \
  56. ASSERT(token->kaddr); \
  57. ASSERT(check_setget_bounds(token->eb, ptr, off, size)); \
  58. if (token->offset <= member_offset && \
  59. member_offset + size <= token->offset + PAGE_SIZE) { \
  60. return get_unaligned_le##bits(token->kaddr + oip); \
  61. } \
  62. token->kaddr = page_address(token->eb->pages[idx]); \
  63. token->offset = idx << PAGE_SHIFT; \
  64. if (INLINE_EXTENT_BUFFER_PAGES == 1 || oip + size <= PAGE_SIZE ) \
  65. return get_unaligned_le##bits(token->kaddr + oip); \
  66. \
  67. memcpy(lebytes, token->kaddr + oip, part); \
  68. token->kaddr = page_address(token->eb->pages[idx + 1]); \
  69. token->offset = (idx + 1) << PAGE_SHIFT; \
  70. memcpy(lebytes + part, token->kaddr, size - part); \
  71. return get_unaligned_le##bits(lebytes); \
  72. } \
  73. u##bits btrfs_get_##bits(const struct extent_buffer *eb, \
  74. const void *ptr, unsigned long off) \
  75. { \
  76. const unsigned long member_offset = (unsigned long)ptr + off; \
  77. const unsigned long oip = get_eb_offset_in_page(eb, member_offset); \
  78. const unsigned long idx = get_eb_page_index(member_offset); \
  79. char *kaddr = page_address(eb->pages[idx]); \
  80. const int size = sizeof(u##bits); \
  81. const int part = PAGE_SIZE - oip; \
  82. u8 lebytes[sizeof(u##bits)]; \
  83. \
  84. ASSERT(check_setget_bounds(eb, ptr, off, size)); \
  85. if (INLINE_EXTENT_BUFFER_PAGES == 1 || oip + size <= PAGE_SIZE) \
  86. return get_unaligned_le##bits(kaddr + oip); \
  87. \
  88. memcpy(lebytes, kaddr + oip, part); \
  89. kaddr = page_address(eb->pages[idx + 1]); \
  90. memcpy(lebytes + part, kaddr, size - part); \
  91. return get_unaligned_le##bits(lebytes); \
  92. } \
  93. void btrfs_set_token_##bits(struct btrfs_map_token *token, \
  94. const void *ptr, unsigned long off, \
  95. u##bits val) \
  96. { \
  97. const unsigned long member_offset = (unsigned long)ptr + off; \
  98. const unsigned long idx = get_eb_page_index(member_offset); \
  99. const unsigned long oip = get_eb_offset_in_page(token->eb, \
  100. member_offset); \
  101. const int size = sizeof(u##bits); \
  102. u8 lebytes[sizeof(u##bits)]; \
  103. const int part = PAGE_SIZE - oip; \
  104. \
  105. ASSERT(token); \
  106. ASSERT(token->kaddr); \
  107. ASSERT(check_setget_bounds(token->eb, ptr, off, size)); \
  108. if (token->offset <= member_offset && \
  109. member_offset + size <= token->offset + PAGE_SIZE) { \
  110. put_unaligned_le##bits(val, token->kaddr + oip); \
  111. return; \
  112. } \
  113. token->kaddr = page_address(token->eb->pages[idx]); \
  114. token->offset = idx << PAGE_SHIFT; \
  115. if (INLINE_EXTENT_BUFFER_PAGES == 1 || oip + size <= PAGE_SIZE) { \
  116. put_unaligned_le##bits(val, token->kaddr + oip); \
  117. return; \
  118. } \
  119. put_unaligned_le##bits(val, lebytes); \
  120. memcpy(token->kaddr + oip, lebytes, part); \
  121. token->kaddr = page_address(token->eb->pages[idx + 1]); \
  122. token->offset = (idx + 1) << PAGE_SHIFT; \
  123. memcpy(token->kaddr, lebytes + part, size - part); \
  124. } \
  125. void btrfs_set_##bits(const struct extent_buffer *eb, void *ptr, \
  126. unsigned long off, u##bits val) \
  127. { \
  128. const unsigned long member_offset = (unsigned long)ptr + off; \
  129. const unsigned long oip = get_eb_offset_in_page(eb, member_offset); \
  130. const unsigned long idx = get_eb_page_index(member_offset); \
  131. char *kaddr = page_address(eb->pages[idx]); \
  132. const int size = sizeof(u##bits); \
  133. const int part = PAGE_SIZE - oip; \
  134. u8 lebytes[sizeof(u##bits)]; \
  135. \
  136. ASSERT(check_setget_bounds(eb, ptr, off, size)); \
  137. if (INLINE_EXTENT_BUFFER_PAGES == 1 || oip + size <= PAGE_SIZE) { \
  138. put_unaligned_le##bits(val, kaddr + oip); \
  139. return; \
  140. } \
  141. \
  142. put_unaligned_le##bits(val, lebytes); \
  143. memcpy(kaddr + oip, lebytes, part); \
  144. kaddr = page_address(eb->pages[idx + 1]); \
  145. memcpy(kaddr, lebytes + part, size - part); \
  146. }
  147. DEFINE_BTRFS_SETGET_BITS(8)
  148. DEFINE_BTRFS_SETGET_BITS(16)
  149. DEFINE_BTRFS_SETGET_BITS(32)
  150. DEFINE_BTRFS_SETGET_BITS(64)
  151. void btrfs_node_key(const struct extent_buffer *eb,
  152. struct btrfs_disk_key *disk_key, int nr)
  153. {
  154. unsigned long ptr = btrfs_node_key_ptr_offset(nr);
  155. read_eb_member(eb, (struct btrfs_key_ptr *)ptr,
  156. struct btrfs_key_ptr, key, disk_key);
  157. }