dir-item.c 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181
  1. #include <linux/module.h>
  2. #include "ctree.h"
  3. #include "disk-io.h"
  4. #include "hash.h"
  5. #include "transaction.h"
  6. int insert_with_overflow(struct btrfs_trans_handle *trans, struct btrfs_root
  7. *root, struct btrfs_path *path, struct btrfs_key
  8. *cpu_key, u32 data_size)
  9. {
  10. int overflow;
  11. int ret;
  12. ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
  13. overflow = btrfs_key_overflow(cpu_key);
  14. while(ret == -EEXIST && overflow < BTRFS_KEY_OVERFLOW_MAX) {
  15. overflow++;
  16. btrfs_set_key_overflow(cpu_key, overflow);
  17. btrfs_release_path(root, path);
  18. ret = btrfs_insert_empty_item(trans, root, path, cpu_key,
  19. data_size);
  20. }
  21. return ret;
  22. }
  23. int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
  24. *root, const char *name, int name_len, u64 dir, u64
  25. objectid, u8 type)
  26. {
  27. int ret = 0;
  28. struct btrfs_path *path;
  29. struct btrfs_dir_item *dir_item;
  30. char *name_ptr;
  31. struct btrfs_key key;
  32. u32 data_size;
  33. key.objectid = dir;
  34. key.flags = 0;
  35. btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
  36. ret = btrfs_name_hash(name, name_len, &key.offset);
  37. BUG_ON(ret);
  38. path = btrfs_alloc_path();
  39. btrfs_init_path(path);
  40. data_size = sizeof(*dir_item) + name_len;
  41. ret = insert_with_overflow(trans, root, path, &key, data_size);
  42. if (ret)
  43. goto out;
  44. dir_item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
  45. path->slots[0],
  46. struct btrfs_dir_item);
  47. btrfs_set_dir_objectid(dir_item, objectid);
  48. btrfs_set_dir_type(dir_item, type);
  49. btrfs_set_dir_flags(dir_item, 0);
  50. btrfs_set_dir_name_len(dir_item, name_len);
  51. name_ptr = (char *)(dir_item + 1);
  52. btrfs_memcpy(root, path->nodes[0]->b_data, name_ptr, name, name_len);
  53. btrfs_mark_buffer_dirty(path->nodes[0]);
  54. btrfs_release_path(root, path);
  55. btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
  56. key.offset = objectid;
  57. ret = insert_with_overflow(trans, root, path, &key, data_size);
  58. // FIXME clear the dirindex bit
  59. if (ret)
  60. goto out;
  61. dir_item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
  62. path->slots[0],
  63. struct btrfs_dir_item);
  64. btrfs_set_dir_objectid(dir_item, objectid);
  65. btrfs_set_dir_type(dir_item, type);
  66. btrfs_set_dir_flags(dir_item, 0);
  67. btrfs_set_dir_name_len(dir_item, name_len);
  68. name_ptr = (char *)(dir_item + 1);
  69. btrfs_memcpy(root, path->nodes[0]->b_data, name_ptr, name, name_len);
  70. btrfs_mark_buffer_dirty(path->nodes[0]);
  71. out:
  72. btrfs_release_path(root, path);
  73. btrfs_free_path(path);
  74. return ret;
  75. }
  76. int btrfs_lookup_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
  77. *root, struct btrfs_path *path, u64 dir,
  78. const char *name, int name_len, int mod)
  79. {
  80. int ret;
  81. struct btrfs_key key;
  82. int ins_len = mod < 0 ? -1 : 0;
  83. int cow = mod != 0;
  84. struct btrfs_disk_key *found_key;
  85. struct btrfs_leaf *leaf;
  86. key.objectid = dir;
  87. key.flags = 0;
  88. btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
  89. btrfs_set_key_overflow(&key, BTRFS_KEY_OVERFLOW_MAX - 1);
  90. ret = btrfs_name_hash(name, name_len, &key.offset);
  91. BUG_ON(ret);
  92. while(1) {
  93. ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
  94. if (ret < 0)
  95. return ret;
  96. if (ret > 0) {
  97. if (path->slots[0] == 0)
  98. return 1;
  99. path->slots[0]--;
  100. }
  101. leaf = btrfs_buffer_leaf(path->nodes[0]);
  102. found_key = &leaf->items[path->slots[0]].key;
  103. if (btrfs_disk_key_objectid(found_key) != dir ||
  104. btrfs_disk_key_type(found_key) != BTRFS_DIR_ITEM_KEY ||
  105. btrfs_disk_key_offset(found_key) != key.offset)
  106. return 1;
  107. if (btrfs_match_dir_item_name(root, path, name, name_len))
  108. return 0;
  109. if (btrfs_disk_key_overflow(found_key) == 0)
  110. return 1;
  111. btrfs_release_path(root, path);
  112. }
  113. return 1;
  114. }
  115. int btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
  116. struct btrfs_root *root,
  117. struct btrfs_path *path, u64 dir,
  118. u64 objectid, int mod)
  119. {
  120. int ret;
  121. struct btrfs_key key;
  122. int ins_len = mod < 0 ? -1 : 0;
  123. int cow = mod != 0;
  124. struct btrfs_disk_key *found_key;
  125. struct btrfs_leaf *leaf;
  126. key.objectid = dir;
  127. key.flags = 0;
  128. btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
  129. btrfs_set_key_overflow(&key, BTRFS_KEY_OVERFLOW_MAX - 1);
  130. key.offset = objectid;
  131. ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
  132. if (ret < 0)
  133. return ret;
  134. if (ret > 0) {
  135. if (path->slots[0] == 0)
  136. return 1;
  137. path->slots[0]--;
  138. }
  139. leaf = btrfs_buffer_leaf(path->nodes[0]);
  140. found_key = &leaf->items[path->slots[0]].key;
  141. if (btrfs_disk_key_objectid(found_key) != dir ||
  142. btrfs_disk_key_type(found_key) != BTRFS_DIR_INDEX_KEY)
  143. return 1;
  144. if (btrfs_disk_key_offset(found_key) == objectid)
  145. return 0;
  146. return 1;
  147. }
  148. int btrfs_match_dir_item_name(struct btrfs_root *root,
  149. struct btrfs_path *path,
  150. const char *name, int name_len)
  151. {
  152. struct btrfs_dir_item *dir_item;
  153. char *name_ptr;
  154. dir_item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
  155. path->slots[0],
  156. struct btrfs_dir_item);
  157. if (btrfs_dir_name_len(dir_item) != name_len)
  158. return 0;
  159. name_ptr = (char *)(dir_item + 1);
  160. if (memcmp(name_ptr, name, name_len))
  161. return 0;
  162. return 1;
  163. }