2 * linux/fs/hfs/catalog.c
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.
8 * This file contains the functions related to the catalog B-tree.
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
21 * Given the ID of the parent and the name build a search key.
23 void hfs_cat_build_key(btree_key *key, u32 parent, struct qstr *name)
25 key->cat.reserved = 0;
26 key->cat.ParID = cpu_to_be32(parent);
28 hfs_triv2mac(&key->cat.CName, name);
29 key->key_len = 6 + key->cat.CName.len;
31 memset(&key->cat.CName, 0, sizeof(struct hfs_name));
36 int hfs_cat_build_record(hfs_cat_rec *rec, u32 cnid, struct inode *inode)
38 u32 mtime = hfs_mtime();
40 memset(rec, 0, sizeof(*rec));
41 if (S_ISDIR(inode->i_mode)) {
42 rec->type = HFS_CDR_DIR;
43 rec->dir.DirID = cpu_to_be32(cnid);
44 rec->dir.CrDat = mtime;
45 rec->dir.MdDat = mtime;
47 rec->dir.UsrInfo.frView = cpu_to_be16(0xff);
48 return sizeof(struct hfs_cat_dir);
50 /* init some fields for the file record */
51 rec->type = HFS_CDR_FIL;
52 rec->file.Flags = HFS_FIL_USED | HFS_FIL_THD;
53 if (!(inode->i_mode & S_IWUSR))
54 rec->file.Flags |= HFS_FIL_LOCK;
55 rec->file.FlNum = cpu_to_be32(cnid);
56 rec->file.CrDat = mtime;
57 rec->file.MdDat = mtime;
59 rec->file.UsrWds.fdType = HFS_SB(inode->i_sb)->s_type;
60 rec->file.UsrWds.fdCreator = HFS_SB(inode->i_sb)->s_creator;
61 return sizeof(struct hfs_cat_file);
65 static int hfs_cat_build_thread(hfs_cat_rec *rec, int type,
66 u32 parentid, struct qstr *name)
69 memset(rec->thread.reserved, 0, sizeof(rec->thread.reserved));
70 rec->thread.ParID = cpu_to_be32(parentid);
71 hfs_triv2mac(&rec->thread.CName, name);
72 return sizeof(struct hfs_cat_thread);
78 * Add a new file or directory to the catalog B-tree and
79 * return a (struct hfs_cat_entry) for it in '*result'.
81 int hfs_cat_create(u32 cnid, struct inode *dir, struct qstr *str, struct inode *inode)
83 struct hfs_find_data fd;
84 struct super_block *sb;
85 union hfs_cat_rec entry;
89 dprint(DBG_CAT_MOD, "create_cat: %s,%u(%d)\n", str->name, cnid, inode->i_nlink);
90 if (dir->i_size >= HFS_MAX_VALENCE)
94 hfs_find_init(HFS_SB(sb)->cat_tree, &fd);
96 hfs_cat_build_key(fd.search_key, cnid, NULL);
97 entry_size = hfs_cat_build_thread(&entry, S_ISDIR(inode->i_mode) ?
98 HFS_CDR_THD : HFS_CDR_FTH,
100 err = hfs_brec_find(&fd);
101 if (err != -ENOENT) {
106 err = hfs_brec_insert(&fd, &entry, entry_size);
110 hfs_cat_build_key(fd.search_key, dir->i_ino, str);
111 entry_size = hfs_cat_build_record(&entry, cnid, inode);
112 err = hfs_brec_find(&fd);
113 if (err != -ENOENT) {
119 err = hfs_brec_insert(&fd, &entry, entry_size);
122 mark_inode_dirty(dir);
134 * This is the comparison function used for the catalog B-tree. In
135 * comparing catalog B-tree entries, the parent id is the most
136 * significant field (compared as unsigned ints). The name field is
137 * the least significant (compared in "Macintosh lexical order",
138 * see hfs_strcmp() in string.c)
140 * struct hfs_cat_key *key1: pointer to the first key to compare
141 * struct hfs_cat_key *key2: pointer to the second key to compare
142 * Output Variable(s):
145 * int: negative if key1<key2, positive if key1>key2, and 0 if key1==key2
147 * key1 and key2 point to "valid" (struct hfs_cat_key)s.
149 * This function has no side-effects
151 int hfs_cat_keycmp(const btree_key *key1, const btree_key *key2)
155 retval = be32_to_cpu(key1->cat.ParID) - be32_to_cpu(key2->cat.ParID);
157 retval = hfs_strcmp(key1->cat.CName.name, key1->cat.CName.len,
158 key2->cat.CName.name, key2->cat.CName.len);
163 /* Try to get a catalog entry for given catalog id */
164 // move to read_super???
165 int hfs_cat_find_brec(struct super_block *sb, u32 cnid,
166 struct hfs_find_data *fd)
171 hfs_cat_build_key(fd->search_key, cnid, NULL);
172 res = hfs_brec_read(fd, &rec, sizeof(rec));
177 if (type != HFS_CDR_THD && type != HFS_CDR_FTH) {
178 printk("HFS-fs: Found bad thread record in catalog\n");
182 fd->search_key->cat.ParID = rec.thread.ParID;
183 len = fd->search_key->cat.CName.len = rec.thread.CName.len;
184 memcpy(fd->search_key->cat.CName.name, rec.thread.CName.name, len);
185 return hfs_brec_find(fd);
192 * Delete the indicated file or directory.
193 * The associated thread is also removed unless ('with_thread'==0).
195 int hfs_cat_delete(u32 cnid, struct inode *dir, struct qstr *str)
197 struct super_block *sb;
198 struct hfs_find_data fd;
199 struct list_head *pos;
202 dprint(DBG_CAT_MOD, "delete_cat: %s,%u\n", str ? str->name : NULL, cnid);
204 hfs_find_init(HFS_SB(sb)->cat_tree, &fd);
206 hfs_cat_build_key(fd.search_key, dir->i_ino, str);
207 res = hfs_brec_find(&fd);
211 type = hfs_bnode_read_u8(fd.bnode, fd.entryoffset);
212 if (type == HFS_CDR_FIL) {
213 struct hfs_cat_file file;
214 hfs_bnode_read(fd.bnode, &file, fd.entryoffset, sizeof(file));
215 if (be32_to_cpu(file.FlNum) == cnid) {
217 hfs_free_fork(sb, &file, HFS_FK_DATA);
219 hfs_free_fork(sb, &file, HFS_FK_RSRC);
223 list_for_each(pos, &HFS_I(dir)->open_dir_list) {
224 struct hfs_readdir_data *rd =
225 list_entry(pos, struct hfs_readdir_data, list);
226 if (fd.tree->keycmp(fd.search_key, (void *)&rd->key) < 0)
230 res = hfs_brec_remove(&fd);
234 hfs_cat_build_key(fd.search_key, cnid, NULL);
235 res = hfs_brec_find(&fd);
237 res = hfs_brec_remove(&fd);
243 mark_inode_dirty(dir);
254 * Rename a file or directory, possibly to a new directory.
255 * If the destination exists it is removed and a
256 * (struct hfs_cat_entry) for it is returned in '*result'.
258 int hfs_cat_move(u32 cnid, struct inode *src_dir, struct qstr *src_name,
259 struct inode *dst_dir, struct qstr *dst_name)
261 struct super_block *sb;
262 struct hfs_find_data src_fd, dst_fd;
263 union hfs_cat_rec entry;
264 int entry_size, type;
267 dprint(DBG_CAT_MOD, "rename_cat: %u - %lu,%s - %lu,%s\n", cnid, src_dir->i_ino, src_name->name,
268 dst_dir->i_ino, dst_name->name);
270 hfs_find_init(HFS_SB(sb)->cat_tree, &src_fd);
273 /* find the old dir entry and read the data */
274 hfs_cat_build_key(src_fd.search_key, src_dir->i_ino, src_name);
275 err = hfs_brec_find(&src_fd);
279 hfs_bnode_read(src_fd.bnode, &entry, src_fd.entryoffset,
282 /* create new dir entry with the data from the old entry */
283 hfs_cat_build_key(dst_fd.search_key, dst_dir->i_ino, dst_name);
284 err = hfs_brec_find(&dst_fd);
285 if (err != -ENOENT) {
291 err = hfs_brec_insert(&dst_fd, &entry, src_fd.entrylength);
295 mark_inode_dirty(dst_dir);
297 /* finally remove the old entry */
298 hfs_cat_build_key(src_fd.search_key, src_dir->i_ino, src_name);
299 err = hfs_brec_find(&src_fd);
302 err = hfs_brec_remove(&src_fd);
306 mark_inode_dirty(src_dir);
309 if (type == HFS_CDR_FIL && !(entry.file.Flags & HFS_FIL_THD))
312 /* remove old thread entry */
313 hfs_cat_build_key(src_fd.search_key, cnid, NULL);
314 err = hfs_brec_find(&src_fd);
317 err = hfs_brec_remove(&src_fd);
321 /* create new thread entry */
322 hfs_cat_build_key(dst_fd.search_key, cnid, NULL);
323 entry_size = hfs_cat_build_thread(&entry, type == HFS_CDR_FIL ? HFS_CDR_FTH : HFS_CDR_THD,
324 dst_dir->i_ino, dst_name);
325 err = hfs_brec_find(&dst_fd);
326 if (err != -ENOENT) {
331 err = hfs_brec_insert(&dst_fd, &entry, entry_size);
333 hfs_bnode_put(dst_fd.bnode);
334 hfs_find_exit(&src_fd);