catalog.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347
  1. /*
  2. * linux/fs/hfs/catalog.c
  3. *
  4. * Copyright (C) 1995-1997 Paul H. Hargrove
  5. * (C) 2003 Ardis Technologies <roman@ardistech.com>
  6. * This file may be distributed under the terms of the GNU General Public License.
  7. *
  8. * This file contains the functions related to the catalog B-tree.
  9. *
  10. * Cache code shamelessly stolen from
  11. * linux/fs/inode.c Copyright (C) 1991, 1992 Linus Torvalds
  12. * re-shamelessly stolen Copyright (C) 1997 Linus Torvalds
  13. */
  14. #include "hfs_fs.h"
  15. #include "btree.h"
  16. /*
  17. * hfs_cat_build_key()
  18. *
  19. * Given the ID of the parent and the name build a search key.
  20. */
  21. void hfs_cat_build_key(btree_key *key, u32 parent, struct qstr *name)
  22. {
  23. key->cat.reserved = 0;
  24. key->cat.ParID = cpu_to_be32(parent);
  25. if (name) {
  26. hfs_triv2mac(&key->cat.CName, name);
  27. key->key_len = 6 + key->cat.CName.len;
  28. } else {
  29. memset(&key->cat.CName, 0, sizeof(struct hfs_name));
  30. key->key_len = 6;
  31. }
  32. }
  33. static int hfs_cat_build_record(hfs_cat_rec *rec, u32 cnid, struct inode *inode)
  34. {
  35. __be32 mtime = hfs_mtime();
  36. memset(rec, 0, sizeof(*rec));
  37. if (S_ISDIR(inode->i_mode)) {
  38. rec->type = HFS_CDR_DIR;
  39. rec->dir.DirID = cpu_to_be32(cnid);
  40. rec->dir.CrDat = mtime;
  41. rec->dir.MdDat = mtime;
  42. rec->dir.BkDat = 0;
  43. rec->dir.UsrInfo.frView = cpu_to_be16(0xff);
  44. return sizeof(struct hfs_cat_dir);
  45. } else {
  46. /* init some fields for the file record */
  47. rec->type = HFS_CDR_FIL;
  48. rec->file.Flags = HFS_FIL_USED | HFS_FIL_THD;
  49. if (!(inode->i_mode & S_IWUSR))
  50. rec->file.Flags |= HFS_FIL_LOCK;
  51. rec->file.FlNum = cpu_to_be32(cnid);
  52. rec->file.CrDat = mtime;
  53. rec->file.MdDat = mtime;
  54. rec->file.BkDat = 0;
  55. rec->file.UsrWds.fdType = HFS_SB(inode->i_sb)->s_type;
  56. rec->file.UsrWds.fdCreator = HFS_SB(inode->i_sb)->s_creator;
  57. return sizeof(struct hfs_cat_file);
  58. }
  59. }
  60. static int hfs_cat_build_thread(hfs_cat_rec *rec, int type,
  61. u32 parentid, struct qstr *name)
  62. {
  63. rec->type = type;
  64. memset(rec->thread.reserved, 0, sizeof(rec->thread.reserved));
  65. rec->thread.ParID = cpu_to_be32(parentid);
  66. hfs_triv2mac(&rec->thread.CName, name);
  67. return sizeof(struct hfs_cat_thread);
  68. }
  69. /*
  70. * create_entry()
  71. *
  72. * Add a new file or directory to the catalog B-tree and
  73. * return a (struct hfs_cat_entry) for it in '*result'.
  74. */
  75. int hfs_cat_create(u32 cnid, struct inode *dir, struct qstr *str, struct inode *inode)
  76. {
  77. struct hfs_find_data fd;
  78. struct super_block *sb;
  79. union hfs_cat_rec entry;
  80. int entry_size;
  81. int err;
  82. dprint(DBG_CAT_MOD, "create_cat: %s,%u(%d)\n", str->name, cnid, inode->i_nlink);
  83. if (dir->i_size >= HFS_MAX_VALENCE)
  84. return -ENOSPC;
  85. sb = dir->i_sb;
  86. hfs_find_init(HFS_SB(sb)->cat_tree, &fd);
  87. hfs_cat_build_key(fd.search_key, cnid, NULL);
  88. entry_size = hfs_cat_build_thread(&entry, S_ISDIR(inode->i_mode) ?
  89. HFS_CDR_THD : HFS_CDR_FTH,
  90. dir->i_ino, str);
  91. err = hfs_brec_find(&fd);
  92. if (err != -ENOENT) {
  93. if (!err)
  94. err = -EEXIST;
  95. goto err2;
  96. }
  97. err = hfs_brec_insert(&fd, &entry, entry_size);
  98. if (err)
  99. goto err2;
  100. hfs_cat_build_key(fd.search_key, dir->i_ino, str);
  101. entry_size = hfs_cat_build_record(&entry, cnid, inode);
  102. err = hfs_brec_find(&fd);
  103. if (err != -ENOENT) {
  104. /* panic? */
  105. if (!err)
  106. err = -EEXIST;
  107. goto err1;
  108. }
  109. err = hfs_brec_insert(&fd, &entry, entry_size);
  110. if (err)
  111. goto err1;
  112. dir->i_size++;
  113. dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
  114. mark_inode_dirty(dir);
  115. hfs_find_exit(&fd);
  116. return 0;
  117. err1:
  118. hfs_cat_build_key(fd.search_key, cnid, NULL);
  119. if (!hfs_brec_find(&fd))
  120. hfs_brec_remove(&fd);
  121. err2:
  122. hfs_find_exit(&fd);
  123. return err;
  124. }
  125. /*
  126. * hfs_cat_compare()
  127. *
  128. * Description:
  129. * This is the comparison function used for the catalog B-tree. In
  130. * comparing catalog B-tree entries, the parent id is the most
  131. * significant field (compared as unsigned ints). The name field is
  132. * the least significant (compared in "Macintosh lexical order",
  133. * see hfs_strcmp() in string.c)
  134. * Input Variable(s):
  135. * struct hfs_cat_key *key1: pointer to the first key to compare
  136. * struct hfs_cat_key *key2: pointer to the second key to compare
  137. * Output Variable(s):
  138. * NONE
  139. * Returns:
  140. * int: negative if key1<key2, positive if key1>key2, and 0 if key1==key2
  141. * Preconditions:
  142. * key1 and key2 point to "valid" (struct hfs_cat_key)s.
  143. * Postconditions:
  144. * This function has no side-effects
  145. */
  146. int hfs_cat_keycmp(const btree_key *key1, const btree_key *key2)
  147. {
  148. int retval;
  149. retval = be32_to_cpu(key1->cat.ParID) - be32_to_cpu(key2->cat.ParID);
  150. if (!retval)
  151. retval = hfs_strcmp(key1->cat.CName.name, key1->cat.CName.len,
  152. key2->cat.CName.name, key2->cat.CName.len);
  153. return retval;
  154. }
  155. /* Try to get a catalog entry for given catalog id */
  156. // move to read_super???
  157. int hfs_cat_find_brec(struct super_block *sb, u32 cnid,
  158. struct hfs_find_data *fd)
  159. {
  160. hfs_cat_rec rec;
  161. int res, len, type;
  162. hfs_cat_build_key(fd->search_key, cnid, NULL);
  163. res = hfs_brec_read(fd, &rec, sizeof(rec));
  164. if (res)
  165. return res;
  166. type = rec.type;
  167. if (type != HFS_CDR_THD && type != HFS_CDR_FTH) {
  168. printk("HFS-fs: Found bad thread record in catalog\n");
  169. return -EIO;
  170. }
  171. fd->search_key->cat.ParID = rec.thread.ParID;
  172. len = fd->search_key->cat.CName.len = rec.thread.CName.len;
  173. memcpy(fd->search_key->cat.CName.name, rec.thread.CName.name, len);
  174. return hfs_brec_find(fd);
  175. }
  176. /*
  177. * hfs_cat_delete()
  178. *
  179. * Delete the indicated file or directory.
  180. * The associated thread is also removed unless ('with_thread'==0).
  181. */
  182. int hfs_cat_delete(u32 cnid, struct inode *dir, struct qstr *str)
  183. {
  184. struct super_block *sb;
  185. struct hfs_find_data fd;
  186. struct list_head *pos;
  187. int res, type;
  188. dprint(DBG_CAT_MOD, "delete_cat: %s,%u\n", str ? str->name : NULL, cnid);
  189. sb = dir->i_sb;
  190. hfs_find_init(HFS_SB(sb)->cat_tree, &fd);
  191. hfs_cat_build_key(fd.search_key, dir->i_ino, str);
  192. res = hfs_brec_find(&fd);
  193. if (res)
  194. goto out;
  195. type = hfs_bnode_read_u8(fd.bnode, fd.entryoffset);
  196. if (type == HFS_CDR_FIL) {
  197. struct hfs_cat_file file;
  198. hfs_bnode_read(fd.bnode, &file, fd.entryoffset, sizeof(file));
  199. if (be32_to_cpu(file.FlNum) == cnid) {
  200. #if 0
  201. hfs_free_fork(sb, &file, HFS_FK_DATA);
  202. #endif
  203. hfs_free_fork(sb, &file, HFS_FK_RSRC);
  204. }
  205. }
  206. list_for_each(pos, &HFS_I(dir)->open_dir_list) {
  207. struct hfs_readdir_data *rd =
  208. list_entry(pos, struct hfs_readdir_data, list);
  209. if (fd.tree->keycmp(fd.search_key, (void *)&rd->key) < 0)
  210. rd->file->f_pos--;
  211. }
  212. res = hfs_brec_remove(&fd);
  213. if (res)
  214. goto out;
  215. hfs_cat_build_key(fd.search_key, cnid, NULL);
  216. res = hfs_brec_find(&fd);
  217. if (!res) {
  218. res = hfs_brec_remove(&fd);
  219. if (res)
  220. goto out;
  221. }
  222. dir->i_size--;
  223. dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
  224. mark_inode_dirty(dir);
  225. res = 0;
  226. out:
  227. hfs_find_exit(&fd);
  228. return res;
  229. }
  230. /*
  231. * hfs_cat_move()
  232. *
  233. * Rename a file or directory, possibly to a new directory.
  234. * If the destination exists it is removed and a
  235. * (struct hfs_cat_entry) for it is returned in '*result'.
  236. */
  237. int hfs_cat_move(u32 cnid, struct inode *src_dir, struct qstr *src_name,
  238. struct inode *dst_dir, struct qstr *dst_name)
  239. {
  240. struct super_block *sb;
  241. struct hfs_find_data src_fd, dst_fd;
  242. union hfs_cat_rec entry;
  243. int entry_size, type;
  244. int err;
  245. dprint(DBG_CAT_MOD, "rename_cat: %u - %lu,%s - %lu,%s\n", cnid, src_dir->i_ino, src_name->name,
  246. dst_dir->i_ino, dst_name->name);
  247. sb = src_dir->i_sb;
  248. hfs_find_init(HFS_SB(sb)->cat_tree, &src_fd);
  249. dst_fd = src_fd;
  250. /* find the old dir entry and read the data */
  251. hfs_cat_build_key(src_fd.search_key, src_dir->i_ino, src_name);
  252. err = hfs_brec_find(&src_fd);
  253. if (err)
  254. goto out;
  255. hfs_bnode_read(src_fd.bnode, &entry, src_fd.entryoffset,
  256. src_fd.entrylength);
  257. /* create new dir entry with the data from the old entry */
  258. hfs_cat_build_key(dst_fd.search_key, dst_dir->i_ino, dst_name);
  259. err = hfs_brec_find(&dst_fd);
  260. if (err != -ENOENT) {
  261. if (!err)
  262. err = -EEXIST;
  263. goto out;
  264. }
  265. err = hfs_brec_insert(&dst_fd, &entry, src_fd.entrylength);
  266. if (err)
  267. goto out;
  268. dst_dir->i_size++;
  269. dst_dir->i_mtime = dst_dir->i_ctime = CURRENT_TIME_SEC;
  270. mark_inode_dirty(dst_dir);
  271. /* finally remove the old entry */
  272. hfs_cat_build_key(src_fd.search_key, src_dir->i_ino, src_name);
  273. err = hfs_brec_find(&src_fd);
  274. if (err)
  275. goto out;
  276. err = hfs_brec_remove(&src_fd);
  277. if (err)
  278. goto out;
  279. src_dir->i_size--;
  280. src_dir->i_mtime = src_dir->i_ctime = CURRENT_TIME_SEC;
  281. mark_inode_dirty(src_dir);
  282. type = entry.type;
  283. if (type == HFS_CDR_FIL && !(entry.file.Flags & HFS_FIL_THD))
  284. goto out;
  285. /* remove old thread entry */
  286. hfs_cat_build_key(src_fd.search_key, cnid, NULL);
  287. err = hfs_brec_find(&src_fd);
  288. if (err)
  289. goto out;
  290. err = hfs_brec_remove(&src_fd);
  291. if (err)
  292. goto out;
  293. /* create new thread entry */
  294. hfs_cat_build_key(dst_fd.search_key, cnid, NULL);
  295. entry_size = hfs_cat_build_thread(&entry, type == HFS_CDR_FIL ? HFS_CDR_FTH : HFS_CDR_THD,
  296. dst_dir->i_ino, dst_name);
  297. err = hfs_brec_find(&dst_fd);
  298. if (err != -ENOENT) {
  299. if (!err)
  300. err = -EEXIST;
  301. goto out;
  302. }
  303. err = hfs_brec_insert(&dst_fd, &entry, entry_size);
  304. out:
  305. hfs_bnode_put(dst_fd.bnode);
  306. hfs_find_exit(&src_fd);
  307. return err;
  308. }