catalog.c 9.2 KB

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