catalog.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * linux/fs/hfsplus/catalog.c
  4. *
  5. * Copyright (C) 2001
  6. * Brad Boyer (flar@allandria.com)
  7. * (C) 2003 Ardis Technologies <roman@ardistech.com>
  8. *
  9. * Handling of catalog records
  10. */
  11. #include "hfsplus_fs.h"
  12. #include "hfsplus_raw.h"
  13. int hfsplus_cat_case_cmp_key(const hfsplus_btree_key *k1,
  14. const hfsplus_btree_key *k2)
  15. {
  16. __be32 k1p, k2p;
  17. k1p = k1->cat.parent;
  18. k2p = k2->cat.parent;
  19. if (k1p != k2p)
  20. return be32_to_cpu(k1p) < be32_to_cpu(k2p) ? -1 : 1;
  21. return hfsplus_strcasecmp(&k1->cat.name, &k2->cat.name);
  22. }
  23. int hfsplus_cat_bin_cmp_key(const hfsplus_btree_key *k1,
  24. const hfsplus_btree_key *k2)
  25. {
  26. __be32 k1p, k2p;
  27. k1p = k1->cat.parent;
  28. k2p = k2->cat.parent;
  29. if (k1p != k2p)
  30. return be32_to_cpu(k1p) < be32_to_cpu(k2p) ? -1 : 1;
  31. return hfsplus_strcmp(&k1->cat.name, &k2->cat.name);
  32. }
  33. /* Generates key for catalog file/folders record. */
  34. int hfsplus_cat_build_key(struct super_block *sb,
  35. hfsplus_btree_key *key, u32 parent, const struct qstr *str)
  36. {
  37. int len, err;
  38. key->cat.parent = cpu_to_be32(parent);
  39. err = hfsplus_asc2uni(sb, &key->cat.name, HFSPLUS_MAX_STRLEN,
  40. str->name, str->len);
  41. if (unlikely(err < 0))
  42. return err;
  43. len = be16_to_cpu(key->cat.name.length);
  44. key->key_len = cpu_to_be16(6 + 2 * len);
  45. return 0;
  46. }
  47. /* Generates key for catalog thread record. */
  48. void hfsplus_cat_build_key_with_cnid(struct super_block *sb,
  49. hfsplus_btree_key *key, u32 parent)
  50. {
  51. key->cat.parent = cpu_to_be32(parent);
  52. key->cat.name.length = 0;
  53. key->key_len = cpu_to_be16(6);
  54. }
  55. static void hfsplus_cat_build_key_uni(hfsplus_btree_key *key, u32 parent,
  56. struct hfsplus_unistr *name)
  57. {
  58. int ustrlen;
  59. ustrlen = be16_to_cpu(name->length);
  60. key->cat.parent = cpu_to_be32(parent);
  61. key->cat.name.length = cpu_to_be16(ustrlen);
  62. ustrlen *= 2;
  63. memcpy(key->cat.name.unicode, name->unicode, ustrlen);
  64. key->key_len = cpu_to_be16(6 + ustrlen);
  65. }
  66. void hfsplus_cat_set_perms(struct inode *inode, struct hfsplus_perm *perms)
  67. {
  68. if (inode->i_flags & S_IMMUTABLE)
  69. perms->rootflags |= HFSPLUS_FLG_IMMUTABLE;
  70. else
  71. perms->rootflags &= ~HFSPLUS_FLG_IMMUTABLE;
  72. if (inode->i_flags & S_APPEND)
  73. perms->rootflags |= HFSPLUS_FLG_APPEND;
  74. else
  75. perms->rootflags &= ~HFSPLUS_FLG_APPEND;
  76. perms->userflags = HFSPLUS_I(inode)->userflags;
  77. perms->mode = cpu_to_be16(inode->i_mode);
  78. perms->owner = cpu_to_be32(i_uid_read(inode));
  79. perms->group = cpu_to_be32(i_gid_read(inode));
  80. if (S_ISREG(inode->i_mode))
  81. perms->dev = cpu_to_be32(inode->i_nlink);
  82. else if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode))
  83. perms->dev = cpu_to_be32(inode->i_rdev);
  84. else
  85. perms->dev = 0;
  86. }
  87. static int hfsplus_cat_build_record(hfsplus_cat_entry *entry,
  88. u32 cnid, struct inode *inode)
  89. {
  90. struct hfsplus_sb_info *sbi = HFSPLUS_SB(inode->i_sb);
  91. if (S_ISDIR(inode->i_mode)) {
  92. struct hfsplus_cat_folder *folder;
  93. folder = &entry->folder;
  94. memset(folder, 0, sizeof(*folder));
  95. folder->type = cpu_to_be16(HFSPLUS_FOLDER);
  96. if (test_bit(HFSPLUS_SB_HFSX, &sbi->flags))
  97. folder->flags |= cpu_to_be16(HFSPLUS_HAS_FOLDER_COUNT);
  98. folder->id = cpu_to_be32(inode->i_ino);
  99. HFSPLUS_I(inode)->create_date =
  100. folder->create_date =
  101. folder->content_mod_date =
  102. folder->attribute_mod_date =
  103. folder->access_date = hfsp_now2mt();
  104. hfsplus_cat_set_perms(inode, &folder->permissions);
  105. if (inode == sbi->hidden_dir)
  106. /* invisible and namelocked */
  107. folder->user_info.frFlags = cpu_to_be16(0x5000);
  108. return sizeof(*folder);
  109. } else {
  110. struct hfsplus_cat_file *file;
  111. file = &entry->file;
  112. memset(file, 0, sizeof(*file));
  113. file->type = cpu_to_be16(HFSPLUS_FILE);
  114. file->flags = cpu_to_be16(HFSPLUS_FILE_THREAD_EXISTS);
  115. file->id = cpu_to_be32(cnid);
  116. HFSPLUS_I(inode)->create_date =
  117. file->create_date =
  118. file->content_mod_date =
  119. file->attribute_mod_date =
  120. file->access_date = hfsp_now2mt();
  121. if (cnid == inode->i_ino) {
  122. hfsplus_cat_set_perms(inode, &file->permissions);
  123. if (S_ISLNK(inode->i_mode)) {
  124. file->user_info.fdType =
  125. cpu_to_be32(HFSP_SYMLINK_TYPE);
  126. file->user_info.fdCreator =
  127. cpu_to_be32(HFSP_SYMLINK_CREATOR);
  128. } else {
  129. file->user_info.fdType =
  130. cpu_to_be32(sbi->type);
  131. file->user_info.fdCreator =
  132. cpu_to_be32(sbi->creator);
  133. }
  134. if (HFSPLUS_FLG_IMMUTABLE &
  135. (file->permissions.rootflags |
  136. file->permissions.userflags))
  137. file->flags |=
  138. cpu_to_be16(HFSPLUS_FILE_LOCKED);
  139. } else {
  140. file->user_info.fdType =
  141. cpu_to_be32(HFSP_HARDLINK_TYPE);
  142. file->user_info.fdCreator =
  143. cpu_to_be32(HFSP_HFSPLUS_CREATOR);
  144. file->user_info.fdFlags =
  145. cpu_to_be16(0x100);
  146. file->create_date =
  147. HFSPLUS_I(sbi->hidden_dir)->create_date;
  148. file->permissions.dev =
  149. cpu_to_be32(HFSPLUS_I(inode)->linkid);
  150. }
  151. return sizeof(*file);
  152. }
  153. }
  154. static int hfsplus_fill_cat_thread(struct super_block *sb,
  155. hfsplus_cat_entry *entry, int type,
  156. u32 parentid, const struct qstr *str)
  157. {
  158. int err;
  159. entry->type = cpu_to_be16(type);
  160. entry->thread.reserved = 0;
  161. entry->thread.parentID = cpu_to_be32(parentid);
  162. err = hfsplus_asc2uni(sb, &entry->thread.nodeName, HFSPLUS_MAX_STRLEN,
  163. str->name, str->len);
  164. if (unlikely(err < 0))
  165. return err;
  166. return 10 + be16_to_cpu(entry->thread.nodeName.length) * 2;
  167. }
  168. /* Try to get a catalog entry for given catalog id */
  169. int hfsplus_find_cat(struct super_block *sb, u32 cnid,
  170. struct hfs_find_data *fd)
  171. {
  172. hfsplus_cat_entry tmp;
  173. int err;
  174. u16 type;
  175. hfsplus_cat_build_key_with_cnid(sb, fd->search_key, cnid);
  176. err = hfs_brec_read(fd, &tmp, sizeof(hfsplus_cat_entry));
  177. if (err)
  178. return err;
  179. type = be16_to_cpu(tmp.type);
  180. if (type != HFSPLUS_FOLDER_THREAD && type != HFSPLUS_FILE_THREAD) {
  181. pr_err("found bad thread record in catalog\n");
  182. return -EIO;
  183. }
  184. if (be16_to_cpu(tmp.thread.nodeName.length) > 255) {
  185. pr_err("catalog name length corrupted\n");
  186. return -EIO;
  187. }
  188. hfsplus_cat_build_key_uni(fd->search_key,
  189. be32_to_cpu(tmp.thread.parentID),
  190. &tmp.thread.nodeName);
  191. return hfs_brec_find(fd, hfs_find_rec_by_key);
  192. }
  193. static void hfsplus_subfolders_inc(struct inode *dir)
  194. {
  195. struct hfsplus_sb_info *sbi = HFSPLUS_SB(dir->i_sb);
  196. if (test_bit(HFSPLUS_SB_HFSX, &sbi->flags)) {
  197. /*
  198. * Increment subfolder count. Note, the value is only meaningful
  199. * for folders with HFSPLUS_HAS_FOLDER_COUNT flag set.
  200. */
  201. HFSPLUS_I(dir)->subfolders++;
  202. }
  203. }
  204. static void hfsplus_subfolders_dec(struct inode *dir)
  205. {
  206. struct hfsplus_sb_info *sbi = HFSPLUS_SB(dir->i_sb);
  207. if (test_bit(HFSPLUS_SB_HFSX, &sbi->flags)) {
  208. /*
  209. * Decrement subfolder count. Note, the value is only meaningful
  210. * for folders with HFSPLUS_HAS_FOLDER_COUNT flag set.
  211. *
  212. * Check for zero. Some subfolders may have been created
  213. * by an implementation ignorant of this counter.
  214. */
  215. if (HFSPLUS_I(dir)->subfolders)
  216. HFSPLUS_I(dir)->subfolders--;
  217. }
  218. }
  219. int hfsplus_create_cat(u32 cnid, struct inode *dir,
  220. const struct qstr *str, struct inode *inode)
  221. {
  222. struct super_block *sb = dir->i_sb;
  223. struct hfs_find_data fd;
  224. hfsplus_cat_entry entry;
  225. int entry_size;
  226. int err;
  227. hfs_dbg(CAT_MOD, "create_cat: %s,%u(%d)\n",
  228. str->name, cnid, inode->i_nlink);
  229. err = hfs_find_init(HFSPLUS_SB(sb)->cat_tree, &fd);
  230. if (err)
  231. return err;
  232. /*
  233. * Fail early and avoid ENOSPC during the btree operations. We may
  234. * have to split the root node at most once.
  235. */
  236. err = hfs_bmap_reserve(fd.tree, 2 * fd.tree->depth);
  237. if (err)
  238. goto err2;
  239. hfsplus_cat_build_key_with_cnid(sb, fd.search_key, cnid);
  240. entry_size = hfsplus_fill_cat_thread(sb, &entry,
  241. S_ISDIR(inode->i_mode) ?
  242. HFSPLUS_FOLDER_THREAD : HFSPLUS_FILE_THREAD,
  243. dir->i_ino, str);
  244. if (unlikely(entry_size < 0)) {
  245. err = entry_size;
  246. goto err2;
  247. }
  248. err = hfs_brec_find(&fd, hfs_find_rec_by_key);
  249. if (err != -ENOENT) {
  250. if (!err)
  251. err = -EEXIST;
  252. goto err2;
  253. }
  254. err = hfs_brec_insert(&fd, &entry, entry_size);
  255. if (err)
  256. goto err2;
  257. err = hfsplus_cat_build_key(sb, fd.search_key, dir->i_ino, str);
  258. if (unlikely(err))
  259. goto err1;
  260. entry_size = hfsplus_cat_build_record(&entry, cnid, inode);
  261. err = hfs_brec_find(&fd, hfs_find_rec_by_key);
  262. if (err != -ENOENT) {
  263. /* panic? */
  264. if (!err)
  265. err = -EEXIST;
  266. goto err1;
  267. }
  268. err = hfs_brec_insert(&fd, &entry, entry_size);
  269. if (err)
  270. goto err1;
  271. dir->i_size++;
  272. if (S_ISDIR(inode->i_mode))
  273. hfsplus_subfolders_inc(dir);
  274. dir->i_mtime = dir->i_ctime = current_time(dir);
  275. hfsplus_mark_inode_dirty(dir, HFSPLUS_I_CAT_DIRTY);
  276. hfs_find_exit(&fd);
  277. return 0;
  278. err1:
  279. hfsplus_cat_build_key_with_cnid(sb, fd.search_key, cnid);
  280. if (!hfs_brec_find(&fd, hfs_find_rec_by_key))
  281. hfs_brec_remove(&fd);
  282. err2:
  283. hfs_find_exit(&fd);
  284. return err;
  285. }
  286. int hfsplus_delete_cat(u32 cnid, struct inode *dir, const struct qstr *str)
  287. {
  288. struct super_block *sb = dir->i_sb;
  289. struct hfs_find_data fd;
  290. struct hfsplus_fork_raw fork;
  291. struct list_head *pos;
  292. int err, off;
  293. u16 type;
  294. hfs_dbg(CAT_MOD, "delete_cat: %s,%u\n", str ? str->name : NULL, cnid);
  295. err = hfs_find_init(HFSPLUS_SB(sb)->cat_tree, &fd);
  296. if (err)
  297. return err;
  298. /*
  299. * Fail early and avoid ENOSPC during the btree operations. We may
  300. * have to split the root node at most once.
  301. */
  302. err = hfs_bmap_reserve(fd.tree, 2 * (int)fd.tree->depth - 2);
  303. if (err)
  304. goto out;
  305. if (!str) {
  306. int len;
  307. hfsplus_cat_build_key_with_cnid(sb, fd.search_key, cnid);
  308. err = hfs_brec_find(&fd, hfs_find_rec_by_key);
  309. if (err)
  310. goto out;
  311. off = fd.entryoffset +
  312. offsetof(struct hfsplus_cat_thread, nodeName);
  313. fd.search_key->cat.parent = cpu_to_be32(dir->i_ino);
  314. hfs_bnode_read(fd.bnode,
  315. &fd.search_key->cat.name.length, off, 2);
  316. len = be16_to_cpu(fd.search_key->cat.name.length) * 2;
  317. hfs_bnode_read(fd.bnode,
  318. &fd.search_key->cat.name.unicode,
  319. off + 2, len);
  320. fd.search_key->key_len = cpu_to_be16(6 + len);
  321. } else {
  322. err = hfsplus_cat_build_key(sb, fd.search_key, dir->i_ino, str);
  323. if (unlikely(err))
  324. goto out;
  325. }
  326. err = hfs_brec_find(&fd, hfs_find_rec_by_key);
  327. if (err)
  328. goto out;
  329. type = hfs_bnode_read_u16(fd.bnode, fd.entryoffset);
  330. if (type == HFSPLUS_FILE) {
  331. #if 0
  332. off = fd.entryoffset + offsetof(hfsplus_cat_file, data_fork);
  333. hfs_bnode_read(fd.bnode, &fork, off, sizeof(fork));
  334. hfsplus_free_fork(sb, cnid, &fork, HFSPLUS_TYPE_DATA);
  335. #endif
  336. off = fd.entryoffset +
  337. offsetof(struct hfsplus_cat_file, rsrc_fork);
  338. hfs_bnode_read(fd.bnode, &fork, off, sizeof(fork));
  339. hfsplus_free_fork(sb, cnid, &fork, HFSPLUS_TYPE_RSRC);
  340. }
  341. /* we only need to take spinlock for exclusion with ->release() */
  342. spin_lock(&HFSPLUS_I(dir)->open_dir_lock);
  343. list_for_each(pos, &HFSPLUS_I(dir)->open_dir_list) {
  344. struct hfsplus_readdir_data *rd =
  345. list_entry(pos, struct hfsplus_readdir_data, list);
  346. if (fd.tree->keycmp(fd.search_key, (void *)&rd->key) < 0)
  347. rd->file->f_pos--;
  348. }
  349. spin_unlock(&HFSPLUS_I(dir)->open_dir_lock);
  350. err = hfs_brec_remove(&fd);
  351. if (err)
  352. goto out;
  353. hfsplus_cat_build_key_with_cnid(sb, fd.search_key, cnid);
  354. err = hfs_brec_find(&fd, hfs_find_rec_by_key);
  355. if (err)
  356. goto out;
  357. err = hfs_brec_remove(&fd);
  358. if (err)
  359. goto out;
  360. dir->i_size--;
  361. if (type == HFSPLUS_FOLDER)
  362. hfsplus_subfolders_dec(dir);
  363. dir->i_mtime = dir->i_ctime = current_time(dir);
  364. hfsplus_mark_inode_dirty(dir, HFSPLUS_I_CAT_DIRTY);
  365. if (type == HFSPLUS_FILE || type == HFSPLUS_FOLDER) {
  366. if (HFSPLUS_SB(sb)->attr_tree)
  367. hfsplus_delete_all_attrs(dir, cnid);
  368. }
  369. out:
  370. hfs_find_exit(&fd);
  371. return err;
  372. }
  373. int hfsplus_rename_cat(u32 cnid,
  374. struct inode *src_dir, const struct qstr *src_name,
  375. struct inode *dst_dir, const struct qstr *dst_name)
  376. {
  377. struct super_block *sb = src_dir->i_sb;
  378. struct hfs_find_data src_fd, dst_fd;
  379. hfsplus_cat_entry entry;
  380. int entry_size, type;
  381. int err;
  382. hfs_dbg(CAT_MOD, "rename_cat: %u - %lu,%s - %lu,%s\n",
  383. cnid, src_dir->i_ino, src_name->name,
  384. dst_dir->i_ino, dst_name->name);
  385. err = hfs_find_init(HFSPLUS_SB(sb)->cat_tree, &src_fd);
  386. if (err)
  387. return err;
  388. dst_fd = src_fd;
  389. /*
  390. * Fail early and avoid ENOSPC during the btree operations. We may
  391. * have to split the root node at most twice.
  392. */
  393. err = hfs_bmap_reserve(src_fd.tree, 4 * (int)src_fd.tree->depth - 1);
  394. if (err)
  395. goto out;
  396. /* find the old dir entry and read the data */
  397. err = hfsplus_cat_build_key(sb, src_fd.search_key,
  398. src_dir->i_ino, src_name);
  399. if (unlikely(err))
  400. goto out;
  401. err = hfs_brec_find(&src_fd, hfs_find_rec_by_key);
  402. if (err)
  403. goto out;
  404. if (src_fd.entrylength > sizeof(entry) || src_fd.entrylength < 0) {
  405. err = -EIO;
  406. goto out;
  407. }
  408. hfs_bnode_read(src_fd.bnode, &entry, src_fd.entryoffset,
  409. src_fd.entrylength);
  410. type = be16_to_cpu(entry.type);
  411. /* create new dir entry with the data from the old entry */
  412. err = hfsplus_cat_build_key(sb, dst_fd.search_key,
  413. dst_dir->i_ino, dst_name);
  414. if (unlikely(err))
  415. goto out;
  416. err = hfs_brec_find(&dst_fd, hfs_find_rec_by_key);
  417. if (err != -ENOENT) {
  418. if (!err)
  419. err = -EEXIST;
  420. goto out;
  421. }
  422. err = hfs_brec_insert(&dst_fd, &entry, src_fd.entrylength);
  423. if (err)
  424. goto out;
  425. dst_dir->i_size++;
  426. if (type == HFSPLUS_FOLDER)
  427. hfsplus_subfolders_inc(dst_dir);
  428. dst_dir->i_mtime = dst_dir->i_ctime = current_time(dst_dir);
  429. /* finally remove the old entry */
  430. err = hfsplus_cat_build_key(sb, src_fd.search_key,
  431. src_dir->i_ino, src_name);
  432. if (unlikely(err))
  433. goto out;
  434. err = hfs_brec_find(&src_fd, hfs_find_rec_by_key);
  435. if (err)
  436. goto out;
  437. err = hfs_brec_remove(&src_fd);
  438. if (err)
  439. goto out;
  440. src_dir->i_size--;
  441. if (type == HFSPLUS_FOLDER)
  442. hfsplus_subfolders_dec(src_dir);
  443. src_dir->i_mtime = src_dir->i_ctime = current_time(src_dir);
  444. /* remove old thread entry */
  445. hfsplus_cat_build_key_with_cnid(sb, src_fd.search_key, cnid);
  446. err = hfs_brec_find(&src_fd, hfs_find_rec_by_key);
  447. if (err)
  448. goto out;
  449. type = hfs_bnode_read_u16(src_fd.bnode, src_fd.entryoffset);
  450. err = hfs_brec_remove(&src_fd);
  451. if (err)
  452. goto out;
  453. /* create new thread entry */
  454. hfsplus_cat_build_key_with_cnid(sb, dst_fd.search_key, cnid);
  455. entry_size = hfsplus_fill_cat_thread(sb, &entry, type,
  456. dst_dir->i_ino, dst_name);
  457. if (unlikely(entry_size < 0)) {
  458. err = entry_size;
  459. goto out;
  460. }
  461. err = hfs_brec_find(&dst_fd, hfs_find_rec_by_key);
  462. if (err != -ENOENT) {
  463. if (!err)
  464. err = -EEXIST;
  465. goto out;
  466. }
  467. err = hfs_brec_insert(&dst_fd, &entry, entry_size);
  468. hfsplus_mark_inode_dirty(dst_dir, HFSPLUS_I_CAT_DIRTY);
  469. hfsplus_mark_inode_dirty(src_dir, HFSPLUS_I_CAT_DIRTY);
  470. out:
  471. hfs_bnode_put(dst_fd.bnode);
  472. hfs_find_exit(&src_fd);
  473. return err;
  474. }