file-item.c 5.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226
  1. #include <linux/module.h>
  2. #include "ctree.h"
  3. #include "disk-io.h"
  4. #include "transaction.h"
  5. #define MAX_CSUM_ITEMS(r) ((((BTRFS_LEAF_DATA_SIZE(r) - \
  6. sizeof(struct btrfs_item)) / \
  7. sizeof(struct btrfs_csum_item)) - 1))
  8. int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
  9. struct btrfs_root *root,
  10. u64 objectid, u64 pos,
  11. u64 offset, u64 num_blocks)
  12. {
  13. int ret = 0;
  14. struct btrfs_file_extent_item *item;
  15. struct btrfs_key file_key;
  16. struct btrfs_path *path;
  17. path = btrfs_alloc_path();
  18. BUG_ON(!path);
  19. btrfs_init_path(path);
  20. /*
  21. ret = btrfs_alloc_extent(trans, root, num_blocks, hint_block,
  22. (u64)-1, &ins);
  23. */
  24. BUG_ON(ret);
  25. file_key.objectid = objectid;
  26. file_key.offset = pos;
  27. file_key.flags = 0;
  28. btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
  29. ret = btrfs_insert_empty_item(trans, root, path, &file_key,
  30. sizeof(*item));
  31. BUG_ON(ret);
  32. item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0],
  33. struct btrfs_file_extent_item);
  34. btrfs_set_file_extent_disk_blocknr(item, offset);
  35. btrfs_set_file_extent_disk_num_blocks(item, num_blocks);
  36. btrfs_set_file_extent_offset(item, 0);
  37. btrfs_set_file_extent_num_blocks(item, num_blocks);
  38. btrfs_set_file_extent_generation(item, trans->transid);
  39. btrfs_mark_buffer_dirty(path->nodes[0]);
  40. btrfs_release_path(root, path);
  41. btrfs_free_path(path);
  42. return 0;
  43. }
  44. struct btrfs_csum_item *btrfs_lookup_csum(struct btrfs_trans_handle *trans,
  45. struct btrfs_root *root,
  46. struct btrfs_path *path,
  47. u64 objectid, u64 offset,
  48. int cow)
  49. {
  50. int ret;
  51. struct btrfs_key file_key;
  52. struct btrfs_key found_key;
  53. struct btrfs_csum_item *item;
  54. struct btrfs_leaf *leaf;
  55. u64 csum_offset = 0;
  56. file_key.objectid = objectid;
  57. file_key.offset = offset;
  58. file_key.flags = 0;
  59. btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
  60. ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
  61. if (ret < 0)
  62. goto fail;
  63. leaf = btrfs_buffer_leaf(path->nodes[0]);
  64. if (ret > 0) {
  65. ret = 1;
  66. if (path->slots[0] == 0)
  67. goto fail;
  68. path->slots[0]--;
  69. btrfs_disk_key_to_cpu(&found_key,
  70. &leaf->items[path->slots[0]].key);
  71. if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY ||
  72. found_key.objectid != objectid) {
  73. goto fail;
  74. }
  75. csum_offset = (offset - found_key.offset) >>
  76. root->fs_info->sb->s_blocksize_bits;
  77. if (csum_offset >=
  78. btrfs_item_size(leaf->items + path->slots[0]) /
  79. sizeof(struct btrfs_csum_item)) {
  80. goto fail;
  81. }
  82. }
  83. item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
  84. item += csum_offset;
  85. return item;
  86. fail:
  87. if (ret > 0)
  88. ret = -ENOENT;
  89. return ERR_PTR(ret);
  90. }
  91. int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
  92. struct btrfs_root *root,
  93. struct btrfs_path *path, u64 objectid,
  94. u64 offset, int mod)
  95. {
  96. int ret;
  97. struct btrfs_key file_key;
  98. int ins_len = mod < 0 ? -1 : 0;
  99. int cow = mod != 0;
  100. file_key.objectid = objectid;
  101. file_key.offset = offset;
  102. file_key.flags = 0;
  103. btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
  104. ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
  105. return ret;
  106. }
  107. int btrfs_csum_file_block(struct btrfs_trans_handle *trans,
  108. struct btrfs_root *root,
  109. u64 objectid, u64 offset,
  110. char *data, size_t len)
  111. {
  112. int ret;
  113. struct btrfs_key file_key;
  114. struct btrfs_key found_key;
  115. struct btrfs_path *path;
  116. struct btrfs_csum_item *item;
  117. struct btrfs_leaf *leaf;
  118. u64 csum_offset;
  119. path = btrfs_alloc_path();
  120. BUG_ON(!path);
  121. btrfs_init_path(path);
  122. item = btrfs_lookup_csum(trans, root, path, objectid, offset, 0);
  123. if (!IS_ERR(item))
  124. goto found;
  125. btrfs_release_path(root, path);
  126. file_key.objectid = objectid;
  127. file_key.offset = offset;
  128. file_key.flags = 0;
  129. btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
  130. ret = btrfs_search_slot(trans, root, &file_key, path,
  131. sizeof(struct btrfs_csum_item), 1);
  132. if (ret < 0)
  133. goto fail;
  134. if (ret == 0) {
  135. BUG();
  136. }
  137. if (path->slots[0] == 0) {
  138. btrfs_release_path(root, path);
  139. goto insert;
  140. }
  141. path->slots[0]--;
  142. leaf = btrfs_buffer_leaf(path->nodes[0]);
  143. btrfs_disk_key_to_cpu(&found_key, &leaf->items[path->slots[0]].key);
  144. csum_offset = (offset - found_key.offset) >>
  145. root->fs_info->sb->s_blocksize_bits;
  146. if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY ||
  147. found_key.objectid != objectid ||
  148. csum_offset >= MAX_CSUM_ITEMS(root)) {
  149. btrfs_release_path(root, path);
  150. goto insert;
  151. }
  152. if (csum_offset >= btrfs_item_size(leaf->items + path->slots[0]) /
  153. sizeof(struct btrfs_csum_item)) {
  154. ret = btrfs_extend_item(trans, root, path,
  155. sizeof(struct btrfs_csum_item));
  156. BUG_ON(ret);
  157. goto csum;
  158. }
  159. insert:
  160. csum_offset = 0;
  161. ret = btrfs_insert_empty_item(trans, root, path, &file_key,
  162. sizeof(struct btrfs_csum_item));
  163. if (ret != 0 && ret != -EEXIST)
  164. goto fail;
  165. csum:
  166. item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0],
  167. struct btrfs_csum_item);
  168. ret = 0;
  169. item += csum_offset;
  170. found:
  171. ret = btrfs_csum_data(root, data, len, item->csum);
  172. btrfs_mark_buffer_dirty(path->nodes[0]);
  173. fail:
  174. btrfs_release_path(root, path);
  175. btrfs_free_path(path);
  176. return ret;
  177. }
  178. int btrfs_csum_verify_file_block(struct btrfs_root *root,
  179. u64 objectid, u64 offset,
  180. char *data, size_t len)
  181. {
  182. int ret;
  183. struct btrfs_key file_key;
  184. struct btrfs_path *path;
  185. struct btrfs_csum_item *item;
  186. char result[BTRFS_CSUM_SIZE];
  187. path = btrfs_alloc_path();
  188. BUG_ON(!path);
  189. btrfs_init_path(path);
  190. file_key.objectid = objectid;
  191. file_key.offset = offset;
  192. file_key.flags = 0;
  193. btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
  194. mutex_lock(&root->fs_info->fs_mutex);
  195. item = btrfs_lookup_csum(NULL, root, path, objectid, offset, 0);
  196. if (IS_ERR(item)) {
  197. ret = PTR_ERR(item);
  198. goto fail;
  199. }
  200. ret = btrfs_csum_data(root, data, len, result);
  201. WARN_ON(ret);
  202. if (memcmp(result, item->csum, BTRFS_CSUM_SIZE))
  203. ret = 1;
  204. fail:
  205. btrfs_release_path(root, path);
  206. btrfs_free_path(path);
  207. mutex_unlock(&root->fs_info->fs_mutex);
  208. return ret;
  209. }