dir-item.c 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215
  1. #include <linux/module.h>
  2. #include "ctree.h"
  3. #include "disk-io.h"
  4. #include "hash.h"
  5. #include "transaction.h"
  6. static struct btrfs_dir_item *insert_with_overflow(struct btrfs_trans_handle
  7. *trans,
  8. struct btrfs_root *root,
  9. struct btrfs_path *path,
  10. struct btrfs_key *cpu_key,
  11. u32 data_size)
  12. {
  13. int ret;
  14. char *ptr;
  15. struct btrfs_item *item;
  16. struct btrfs_leaf *leaf;
  17. ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
  18. if (ret == -EEXIST) {
  19. ret = btrfs_extend_item(trans, root, path, data_size);
  20. WARN_ON(ret > 0);
  21. if (ret)
  22. return ERR_PTR(ret);
  23. }
  24. WARN_ON(ret > 0);
  25. leaf = btrfs_buffer_leaf(path->nodes[0]);
  26. item = leaf->items + path->slots[0];
  27. ptr = btrfs_item_ptr(leaf, path->slots[0], char);
  28. BUG_ON(data_size > btrfs_item_size(item));
  29. ptr += btrfs_item_size(item) - data_size;
  30. return (struct btrfs_dir_item *)ptr;
  31. }
  32. int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
  33. *root, const char *name, int name_len, u64 dir,
  34. struct btrfs_key *location, u8 type)
  35. {
  36. int ret = 0;
  37. struct btrfs_path *path;
  38. struct btrfs_dir_item *dir_item;
  39. char *name_ptr;
  40. struct btrfs_key key;
  41. u32 data_size;
  42. key.objectid = dir;
  43. key.flags = 0;
  44. btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
  45. ret = btrfs_name_hash(name, name_len, &key.offset);
  46. BUG_ON(ret);
  47. path = btrfs_alloc_path();
  48. btrfs_init_path(path);
  49. data_size = sizeof(*dir_item) + name_len;
  50. dir_item = insert_with_overflow(trans, root, path, &key, data_size);
  51. if (IS_ERR(dir_item)) {
  52. ret = PTR_ERR(dir_item);
  53. goto out;
  54. }
  55. btrfs_cpu_key_to_disk(&dir_item->location, location);
  56. btrfs_set_dir_type(dir_item, type);
  57. btrfs_set_dir_flags(dir_item, 0);
  58. btrfs_set_dir_name_len(dir_item, name_len);
  59. name_ptr = (char *)(dir_item + 1);
  60. btrfs_memcpy(root, path->nodes[0]->b_data, name_ptr, name, name_len);
  61. btrfs_mark_buffer_dirty(path->nodes[0]);
  62. /* FIXME, use some real flag for selecting the extra index */
  63. if (root == root->fs_info->tree_root) {
  64. ret = 0;
  65. goto out;
  66. }
  67. btrfs_release_path(root, path);
  68. btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
  69. key.offset = location->objectid;
  70. dir_item = insert_with_overflow(trans, root, path, &key, data_size);
  71. if (IS_ERR(dir_item)) {
  72. ret = PTR_ERR(dir_item);
  73. goto out;
  74. }
  75. btrfs_cpu_key_to_disk(&dir_item->location, location);
  76. btrfs_set_dir_type(dir_item, type);
  77. btrfs_set_dir_flags(dir_item, 0);
  78. btrfs_set_dir_name_len(dir_item, name_len);
  79. name_ptr = (char *)(dir_item + 1);
  80. btrfs_memcpy(root, path->nodes[0]->b_data, name_ptr, name, name_len);
  81. btrfs_mark_buffer_dirty(path->nodes[0]);
  82. out:
  83. btrfs_free_path(path);
  84. return ret;
  85. }
  86. struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans,
  87. struct btrfs_root *root,
  88. struct btrfs_path *path, u64 dir,
  89. const char *name, int name_len,
  90. int mod)
  91. {
  92. int ret;
  93. struct btrfs_key key;
  94. int ins_len = mod < 0 ? -1 : 0;
  95. int cow = mod != 0;
  96. struct btrfs_disk_key *found_key;
  97. struct btrfs_leaf *leaf;
  98. key.objectid = dir;
  99. key.flags = 0;
  100. btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
  101. ret = btrfs_name_hash(name, name_len, &key.offset);
  102. BUG_ON(ret);
  103. ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
  104. if (ret < 0)
  105. return ERR_PTR(ret);
  106. if (ret > 0) {
  107. if (path->slots[0] == 0)
  108. return NULL;
  109. path->slots[0]--;
  110. }
  111. leaf = btrfs_buffer_leaf(path->nodes[0]);
  112. found_key = &leaf->items[path->slots[0]].key;
  113. if (btrfs_disk_key_objectid(found_key) != dir ||
  114. btrfs_disk_key_type(found_key) != BTRFS_DIR_ITEM_KEY ||
  115. btrfs_disk_key_offset(found_key) != key.offset)
  116. return NULL;
  117. return btrfs_match_dir_item_name(root, path, name, name_len);
  118. }
  119. struct btrfs_dir_item *
  120. btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
  121. struct btrfs_root *root,
  122. struct btrfs_path *path, u64 dir,
  123. u64 objectid, const char *name, int name_len,
  124. int mod)
  125. {
  126. int ret;
  127. struct btrfs_key key;
  128. int ins_len = mod < 0 ? -1 : 0;
  129. int cow = mod != 0;
  130. key.objectid = dir;
  131. key.flags = 0;
  132. btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
  133. key.offset = objectid;
  134. ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
  135. if (ret < 0)
  136. return ERR_PTR(ret);
  137. if (ret > 0)
  138. return ERR_PTR(-ENOENT);
  139. return btrfs_match_dir_item_name(root, path, name, name_len);
  140. }
  141. struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
  142. struct btrfs_path *path,
  143. const char *name, int name_len)
  144. {
  145. struct btrfs_dir_item *dir_item;
  146. char *name_ptr;
  147. u32 total_len;
  148. u32 cur = 0;
  149. u32 this_len;
  150. struct btrfs_leaf *leaf;
  151. leaf = btrfs_buffer_leaf(path->nodes[0]);
  152. dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
  153. total_len = btrfs_item_size(leaf->items + path->slots[0]);
  154. while(cur < total_len) {
  155. this_len = sizeof(*dir_item) + btrfs_dir_name_len(dir_item);
  156. name_ptr = (char *)(dir_item + 1);
  157. if (btrfs_dir_name_len(dir_item) == name_len &&
  158. memcmp(name_ptr, name, name_len) == 0)
  159. return dir_item;
  160. cur += this_len;
  161. dir_item = (struct btrfs_dir_item *)((char *)dir_item +
  162. this_len);
  163. }
  164. return NULL;
  165. }
  166. int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans,
  167. struct btrfs_root *root,
  168. struct btrfs_path *path,
  169. struct btrfs_dir_item *di)
  170. {
  171. struct btrfs_leaf *leaf;
  172. u32 sub_item_len;
  173. u32 item_len;
  174. int ret;
  175. leaf = btrfs_buffer_leaf(path->nodes[0]);
  176. sub_item_len = sizeof(*di) + btrfs_dir_name_len(di);
  177. item_len = btrfs_item_size(leaf->items + path->slots[0]);
  178. if (sub_item_len == btrfs_item_size(leaf->items + path->slots[0])) {
  179. ret = btrfs_del_item(trans, root, path);
  180. BUG_ON(ret);
  181. } else {
  182. char *ptr = (char *)di;
  183. char *start = btrfs_item_ptr(leaf, path->slots[0], char);
  184. btrfs_memmove(root, leaf, ptr, ptr + sub_item_len,
  185. item_len - (ptr + sub_item_len - start));
  186. ret = btrfs_truncate_item(trans, root, path,
  187. item_len - sub_item_len);
  188. BUG_ON(ret);
  189. }
  190. return 0;
  191. }