catalog.c 9.8 KB

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