catalog.c 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348
  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(struct super_block *sb, 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_asc2mac(sb, &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(struct super_block *sb,
  61. hfs_cat_rec *rec, int type,
  62. u32 parentid, struct qstr *name)
  63. {
  64. rec->type = type;
  65. memset(rec->thread.reserved, 0, sizeof(rec->thread.reserved));
  66. rec->thread.ParID = cpu_to_be32(parentid);
  67. hfs_asc2mac(sb, &rec->thread.CName, name);
  68. return sizeof(struct hfs_cat_thread);
  69. }
  70. /*
  71. * create_entry()
  72. *
  73. * Add a new file or directory to the catalog B-tree and
  74. * return a (struct hfs_cat_entry) for it in '*result'.
  75. */
  76. int hfs_cat_create(u32 cnid, struct inode *dir, struct qstr *str, struct inode *inode)
  77. {
  78. struct hfs_find_data fd;
  79. struct super_block *sb;
  80. union hfs_cat_rec entry;
  81. int entry_size;
  82. int err;
  83. dprint(DBG_CAT_MOD, "create_cat: %s,%u(%d)\n", str->name, cnid, inode->i_nlink);
  84. if (dir->i_size >= HFS_MAX_VALENCE)
  85. return -ENOSPC;
  86. sb = dir->i_sb;
  87. hfs_find_init(HFS_SB(sb)->cat_tree, &fd);
  88. hfs_cat_build_key(sb, fd.search_key, cnid, NULL);
  89. entry_size = hfs_cat_build_thread(sb, &entry, S_ISDIR(inode->i_mode) ?
  90. HFS_CDR_THD : HFS_CDR_FTH,
  91. dir->i_ino, str);
  92. err = hfs_brec_find(&fd);
  93. if (err != -ENOENT) {
  94. if (!err)
  95. err = -EEXIST;
  96. goto err2;
  97. }
  98. err = hfs_brec_insert(&fd, &entry, entry_size);
  99. if (err)
  100. goto err2;
  101. hfs_cat_build_key(sb, fd.search_key, dir->i_ino, str);
  102. entry_size = hfs_cat_build_record(&entry, cnid, inode);
  103. err = hfs_brec_find(&fd);
  104. if (err != -ENOENT) {
  105. /* panic? */
  106. if (!err)
  107. err = -EEXIST;
  108. goto err1;
  109. }
  110. err = hfs_brec_insert(&fd, &entry, entry_size);
  111. if (err)
  112. goto err1;
  113. dir->i_size++;
  114. dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
  115. mark_inode_dirty(dir);
  116. hfs_find_exit(&fd);
  117. return 0;
  118. err1:
  119. hfs_cat_build_key(sb, fd.search_key, cnid, NULL);
  120. if (!hfs_brec_find(&fd))
  121. hfs_brec_remove(&fd);
  122. err2:
  123. hfs_find_exit(&fd);
  124. return err;
  125. }
  126. /*
  127. * hfs_cat_compare()
  128. *
  129. * Description:
  130. * This is the comparison function used for the catalog B-tree. In
  131. * comparing catalog B-tree entries, the parent id is the most
  132. * significant field (compared as unsigned ints). The name field is
  133. * the least significant (compared in "Macintosh lexical order",
  134. * see hfs_strcmp() in string.c)
  135. * Input Variable(s):
  136. * struct hfs_cat_key *key1: pointer to the first key to compare
  137. * struct hfs_cat_key *key2: pointer to the second key to compare
  138. * Output Variable(s):
  139. * NONE
  140. * Returns:
  141. * int: negative if key1<key2, positive if key1>key2, and 0 if key1==key2
  142. * Preconditions:
  143. * key1 and key2 point to "valid" (struct hfs_cat_key)s.
  144. * Postconditions:
  145. * This function has no side-effects
  146. */
  147. int hfs_cat_keycmp(const btree_key *key1, const btree_key *key2)
  148. {
  149. int retval;
  150. retval = be32_to_cpu(key1->cat.ParID) - be32_to_cpu(key2->cat.ParID);
  151. if (!retval)
  152. retval = hfs_strcmp(key1->cat.CName.name, key1->cat.CName.len,
  153. key2->cat.CName.name, key2->cat.CName.len);
  154. return retval;
  155. }
  156. /* Try to get a catalog entry for given catalog id */
  157. // move to read_super???
  158. int hfs_cat_find_brec(struct super_block *sb, u32 cnid,
  159. struct hfs_find_data *fd)
  160. {
  161. hfs_cat_rec rec;
  162. int res, len, type;
  163. hfs_cat_build_key(sb, fd->search_key, cnid, NULL);
  164. res = hfs_brec_read(fd, &rec, sizeof(rec));
  165. if (res)
  166. return res;
  167. type = rec.type;
  168. if (type != HFS_CDR_THD && type != HFS_CDR_FTH) {
  169. printk(KERN_ERR "hfs: found bad thread record in catalog\n");
  170. return -EIO;
  171. }
  172. fd->search_key->cat.ParID = rec.thread.ParID;
  173. len = fd->search_key->cat.CName.len = rec.thread.CName.len;
  174. memcpy(fd->search_key->cat.CName.name, rec.thread.CName.name, len);
  175. return hfs_brec_find(fd);
  176. }
  177. /*
  178. * hfs_cat_delete()
  179. *
  180. * Delete the indicated file or directory.
  181. * The associated thread is also removed unless ('with_thread'==0).
  182. */
  183. int hfs_cat_delete(u32 cnid, struct inode *dir, struct qstr *str)
  184. {
  185. struct super_block *sb;
  186. struct hfs_find_data fd;
  187. struct list_head *pos;
  188. int res, type;
  189. dprint(DBG_CAT_MOD, "delete_cat: %s,%u\n", str ? str->name : NULL, cnid);
  190. sb = dir->i_sb;
  191. hfs_find_init(HFS_SB(sb)->cat_tree, &fd);
  192. hfs_cat_build_key(sb, fd.search_key, dir->i_ino, str);
  193. res = hfs_brec_find(&fd);
  194. if (res)
  195. goto out;
  196. type = hfs_bnode_read_u8(fd.bnode, fd.entryoffset);
  197. if (type == HFS_CDR_FIL) {
  198. struct hfs_cat_file file;
  199. hfs_bnode_read(fd.bnode, &file, fd.entryoffset, sizeof(file));
  200. if (be32_to_cpu(file.FlNum) == cnid) {
  201. #if 0
  202. hfs_free_fork(sb, &file, HFS_FK_DATA);
  203. #endif
  204. hfs_free_fork(sb, &file, HFS_FK_RSRC);
  205. }
  206. }
  207. list_for_each(pos, &HFS_I(dir)->open_dir_list) {
  208. struct hfs_readdir_data *rd =
  209. list_entry(pos, struct hfs_readdir_data, list);
  210. if (fd.tree->keycmp(fd.search_key, (void *)&rd->key) < 0)
  211. rd->file->f_pos--;
  212. }
  213. res = hfs_brec_remove(&fd);
  214. if (res)
  215. goto out;
  216. hfs_cat_build_key(sb, fd.search_key, cnid, NULL);
  217. res = hfs_brec_find(&fd);
  218. if (!res) {
  219. res = hfs_brec_remove(&fd);
  220. if (res)
  221. goto out;
  222. }
  223. dir->i_size--;
  224. dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
  225. mark_inode_dirty(dir);
  226. res = 0;
  227. out:
  228. hfs_find_exit(&fd);
  229. return res;
  230. }
  231. /*
  232. * hfs_cat_move()
  233. *
  234. * Rename a file or directory, possibly to a new directory.
  235. * If the destination exists it is removed and a
  236. * (struct hfs_cat_entry) for it is returned in '*result'.
  237. */
  238. int hfs_cat_move(u32 cnid, struct inode *src_dir, struct qstr *src_name,
  239. struct inode *dst_dir, struct qstr *dst_name)
  240. {
  241. struct super_block *sb;
  242. struct hfs_find_data src_fd, dst_fd;
  243. union hfs_cat_rec entry;
  244. int entry_size, type;
  245. int err;
  246. dprint(DBG_CAT_MOD, "rename_cat: %u - %lu,%s - %lu,%s\n", cnid, src_dir->i_ino, src_name->name,
  247. dst_dir->i_ino, dst_name->name);
  248. sb = src_dir->i_sb;
  249. hfs_find_init(HFS_SB(sb)->cat_tree, &src_fd);
  250. dst_fd = src_fd;
  251. /* find the old dir entry and read the data */
  252. hfs_cat_build_key(sb, src_fd.search_key, src_dir->i_ino, src_name);
  253. err = hfs_brec_find(&src_fd);
  254. if (err)
  255. goto out;
  256. hfs_bnode_read(src_fd.bnode, &entry, src_fd.entryoffset,
  257. src_fd.entrylength);
  258. /* create new dir entry with the data from the old entry */
  259. hfs_cat_build_key(sb, dst_fd.search_key, dst_dir->i_ino, dst_name);
  260. err = hfs_brec_find(&dst_fd);
  261. if (err != -ENOENT) {
  262. if (!err)
  263. err = -EEXIST;
  264. goto out;
  265. }
  266. err = hfs_brec_insert(&dst_fd, &entry, src_fd.entrylength);
  267. if (err)
  268. goto out;
  269. dst_dir->i_size++;
  270. dst_dir->i_mtime = dst_dir->i_ctime = CURRENT_TIME_SEC;
  271. mark_inode_dirty(dst_dir);
  272. /* finally remove the old entry */
  273. hfs_cat_build_key(sb, src_fd.search_key, src_dir->i_ino, src_name);
  274. err = hfs_brec_find(&src_fd);
  275. if (err)
  276. goto out;
  277. err = hfs_brec_remove(&src_fd);
  278. if (err)
  279. goto out;
  280. src_dir->i_size--;
  281. src_dir->i_mtime = src_dir->i_ctime = CURRENT_TIME_SEC;
  282. mark_inode_dirty(src_dir);
  283. type = entry.type;
  284. if (type == HFS_CDR_FIL && !(entry.file.Flags & HFS_FIL_THD))
  285. goto out;
  286. /* remove old thread entry */
  287. hfs_cat_build_key(sb, src_fd.search_key, cnid, NULL);
  288. err = hfs_brec_find(&src_fd);
  289. if (err)
  290. goto out;
  291. err = hfs_brec_remove(&src_fd);
  292. if (err)
  293. goto out;
  294. /* create new thread entry */
  295. hfs_cat_build_key(sb, dst_fd.search_key, cnid, NULL);
  296. entry_size = hfs_cat_build_thread(sb, &entry, type == HFS_CDR_FIL ? HFS_CDR_FTH : HFS_CDR_THD,
  297. dst_dir->i_ino, dst_name);
  298. err = hfs_brec_find(&dst_fd);
  299. if (err != -ENOENT) {
  300. if (!err)
  301. err = -EEXIST;
  302. goto out;
  303. }
  304. err = hfs_brec_insert(&dst_fd, &entry, entry_size);
  305. out:
  306. hfs_bnode_put(dst_fd.bnode);
  307. hfs_find_exit(&src_fd);
  308. return err;
  309. }