dir-item.c 6.2 KB

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