file-item.c 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248
  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. printk("__lookup for %Lu\n", offset);
  61. ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
  62. if (ret < 0)
  63. goto fail;
  64. leaf = btrfs_buffer_leaf(path->nodes[0]);
  65. if (ret > 0) {
  66. ret = 1;
  67. if (path->slots[0] == 0) {
  68. printk("fail1\n");
  69. goto fail;
  70. }
  71. path->slots[0]--;
  72. btrfs_disk_key_to_cpu(&found_key,
  73. &leaf->items[path->slots[0]].key);
  74. if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY ||
  75. found_key.objectid != objectid) {
  76. printk("fail2 type %u %Lu %Lu\n", btrfs_key_type(&found_key), found_key.objectid, objectid);
  77. goto fail;
  78. }
  79. csum_offset = (offset - found_key.offset) >>
  80. root->fs_info->sb->s_blocksize_bits;
  81. if (csum_offset >=
  82. btrfs_item_size(leaf->items + path->slots[0]) /
  83. sizeof(struct btrfs_csum_item)) {
  84. printk("fail3, csum offset %lu size %u\n", csum_offset, btrfs_item_size(leaf->items + path->slots[0]) / sizeof(struct btrfs_csum_item));
  85. goto fail;
  86. }
  87. }
  88. item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
  89. item += csum_offset;
  90. return item;
  91. fail:
  92. if (ret > 0)
  93. ret = -ENOENT;
  94. return ERR_PTR(ret);
  95. }
  96. int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
  97. struct btrfs_root *root,
  98. struct btrfs_path *path, u64 objectid,
  99. u64 offset, int mod)
  100. {
  101. int ret;
  102. struct btrfs_key file_key;
  103. int ins_len = mod < 0 ? -1 : 0;
  104. int cow = mod != 0;
  105. struct btrfs_csum_item *csum_item;
  106. csum_item = btrfs_lookup_csum(trans, root, path, objectid, offset, 0);
  107. if (IS_ERR(csum_item))
  108. return PTR_ERR(csum_item);
  109. file_key.objectid = objectid;
  110. file_key.offset = btrfs_csum_extent_offset(csum_item);
  111. file_key.flags = 0;
  112. btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
  113. btrfs_release_path(root, path);
  114. printk("lookup file extent searches for %Lu\n", file_key.offset);
  115. ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
  116. printk("ret is %d\n", ret);
  117. return ret;
  118. }
  119. int btrfs_csum_file_block(struct btrfs_trans_handle *trans,
  120. struct btrfs_root *root,
  121. u64 objectid, u64 offset,
  122. u64 extent_offset,
  123. char *data, size_t len)
  124. {
  125. int ret;
  126. struct btrfs_key file_key;
  127. struct btrfs_key found_key;
  128. struct btrfs_path *path;
  129. struct btrfs_csum_item *item;
  130. struct btrfs_leaf *leaf;
  131. u64 csum_offset;
  132. path = btrfs_alloc_path();
  133. BUG_ON(!path);
  134. btrfs_init_path(path);
  135. item = btrfs_lookup_csum(trans, root, path, objectid, offset, 0);
  136. if (!IS_ERR(item))
  137. goto found;
  138. btrfs_release_path(root, path);
  139. file_key.objectid = objectid;
  140. file_key.offset = offset;
  141. file_key.flags = 0;
  142. btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
  143. printk("searching for csum %Lu %Lu\n", objectid, offset);
  144. ret = btrfs_search_slot(trans, root, &file_key, path,
  145. sizeof(struct btrfs_csum_item), 1);
  146. printk("ret %d\n", ret);
  147. if (ret < 0)
  148. goto fail;
  149. if (ret == 0) {
  150. BUG();
  151. }
  152. if (path->slots[0] == 0) {
  153. btrfs_release_path(root, path);
  154. goto insert;
  155. }
  156. path->slots[0]--;
  157. leaf = btrfs_buffer_leaf(path->nodes[0]);
  158. btrfs_disk_key_to_cpu(&found_key, &leaf->items[path->slots[0]].key);
  159. printk("found key %Lu %Lu %u\n", found_key.objectid, found_key.offset, found_key.flags);
  160. csum_offset = (offset - found_key.offset) >>
  161. root->fs_info->sb->s_blocksize_bits;
  162. printk("csum_offset %Lu\n", csum_offset);
  163. if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY ||
  164. found_key.objectid != objectid ||
  165. csum_offset >= MAX_CSUM_ITEMS(root)) {
  166. btrfs_release_path(root, path);
  167. printk("insert1\n");
  168. goto insert;
  169. }
  170. if (csum_offset >= btrfs_item_size(leaf->items + path->slots[0]) /
  171. sizeof(struct btrfs_csum_item)) {
  172. ret = btrfs_extend_item(trans, root, path,
  173. sizeof(struct btrfs_csum_item));
  174. BUG_ON(ret);
  175. printk("item extended\n");
  176. goto csum;
  177. }
  178. insert:
  179. csum_offset = 0;
  180. printk("inserting item %Lu %Lu %u\n", file_key.objectid, file_key.offset, file_key.flags);
  181. ret = btrfs_insert_empty_item(trans, root, path, &file_key,
  182. sizeof(struct btrfs_csum_item));
  183. if (ret != 0 && ret != -EEXIST)
  184. goto fail;
  185. csum:
  186. item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0],
  187. struct btrfs_csum_item);
  188. ret = 0;
  189. item += csum_offset;
  190. found:
  191. ret = btrfs_csum_data(root, data, len, item->csum);
  192. btrfs_set_csum_extent_offset(item, extent_offset);
  193. btrfs_mark_buffer_dirty(path->nodes[0]);
  194. fail:
  195. btrfs_release_path(root, path);
  196. btrfs_free_path(path);
  197. printk("return ret %d\n", ret);
  198. return ret;
  199. }
  200. int btrfs_csum_verify_file_block(struct btrfs_root *root,
  201. u64 objectid, u64 offset,
  202. char *data, size_t len)
  203. {
  204. int ret;
  205. struct btrfs_key file_key;
  206. struct btrfs_path *path;
  207. struct btrfs_csum_item *item;
  208. char result[BTRFS_CSUM_SIZE];
  209. path = btrfs_alloc_path();
  210. BUG_ON(!path);
  211. btrfs_init_path(path);
  212. file_key.objectid = objectid;
  213. file_key.offset = offset;
  214. file_key.flags = 0;
  215. btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
  216. mutex_lock(&root->fs_info->fs_mutex);
  217. item = btrfs_lookup_csum(NULL, root, path, objectid, offset, 0);
  218. if (IS_ERR(item)) {
  219. ret = PTR_ERR(item);
  220. goto fail;
  221. }
  222. ret = btrfs_csum_data(root, data, len, result);
  223. WARN_ON(ret);
  224. if (memcmp(result, item->csum, BTRFS_CSUM_SIZE))
  225. ret = 1;
  226. fail:
  227. btrfs_release_path(root, path);
  228. btrfs_free_path(path);
  229. mutex_unlock(&root->fs_info->fs_mutex);
  230. return ret;
  231. }