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 static int hfs_cat_build_record(hfs_cat_rec
*rec
, u32 cnid
, struct inode
*inode
)
38 __be32 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
);
124 dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME_SEC
;
125 mark_inode_dirty(dir
);
130 hfs_cat_build_key(fd
.search_key
, cnid
, NULL
);
131 if (!hfs_brec_find(&fd
))
132 hfs_brec_remove(&fd
);
142 * This is the comparison function used for the catalog B-tree. In
143 * comparing catalog B-tree entries, the parent id is the most
144 * significant field (compared as unsigned ints). The name field is
145 * the least significant (compared in "Macintosh lexical order",
146 * see hfs_strcmp() in string.c)
148 * struct hfs_cat_key *key1: pointer to the first key to compare
149 * struct hfs_cat_key *key2: pointer to the second key to compare
150 * Output Variable(s):
153 * int: negative if key1<key2, positive if key1>key2, and 0 if key1==key2
155 * key1 and key2 point to "valid" (struct hfs_cat_key)s.
157 * This function has no side-effects
159 int hfs_cat_keycmp(const btree_key
*key1
, const btree_key
*key2
)
163 retval
= be32_to_cpu(key1
->cat
.ParID
) - be32_to_cpu(key2
->cat
.ParID
);
165 retval
= hfs_strcmp(key1
->cat
.CName
.name
, key1
->cat
.CName
.len
,
166 key2
->cat
.CName
.name
, key2
->cat
.CName
.len
);
171 /* Try to get a catalog entry for given catalog id */
172 // move to read_super???
173 int hfs_cat_find_brec(struct super_block
*sb
, u32 cnid
,
174 struct hfs_find_data
*fd
)
179 hfs_cat_build_key(fd
->search_key
, cnid
, NULL
);
180 res
= hfs_brec_read(fd
, &rec
, sizeof(rec
));
185 if (type
!= HFS_CDR_THD
&& type
!= HFS_CDR_FTH
) {
186 printk("HFS-fs: Found bad thread record in catalog\n");
190 fd
->search_key
->cat
.ParID
= rec
.thread
.ParID
;
191 len
= fd
->search_key
->cat
.CName
.len
= rec
.thread
.CName
.len
;
192 memcpy(fd
->search_key
->cat
.CName
.name
, rec
.thread
.CName
.name
, len
);
193 return hfs_brec_find(fd
);
200 * Delete the indicated file or directory.
201 * The associated thread is also removed unless ('with_thread'==0).
203 int hfs_cat_delete(u32 cnid
, struct inode
*dir
, struct qstr
*str
)
205 struct super_block
*sb
;
206 struct hfs_find_data fd
;
207 struct list_head
*pos
;
210 dprint(DBG_CAT_MOD
, "delete_cat: %s,%u\n", str
? str
->name
: NULL
, cnid
);
212 hfs_find_init(HFS_SB(sb
)->cat_tree
, &fd
);
214 hfs_cat_build_key(fd
.search_key
, dir
->i_ino
, str
);
215 res
= hfs_brec_find(&fd
);
219 type
= hfs_bnode_read_u8(fd
.bnode
, fd
.entryoffset
);
220 if (type
== HFS_CDR_FIL
) {
221 struct hfs_cat_file file
;
222 hfs_bnode_read(fd
.bnode
, &file
, fd
.entryoffset
, sizeof(file
));
223 if (be32_to_cpu(file
.FlNum
) == cnid
) {
225 hfs_free_fork(sb
, &file
, HFS_FK_DATA
);
227 hfs_free_fork(sb
, &file
, HFS_FK_RSRC
);
231 list_for_each(pos
, &HFS_I(dir
)->open_dir_list
) {
232 struct hfs_readdir_data
*rd
=
233 list_entry(pos
, struct hfs_readdir_data
, list
);
234 if (fd
.tree
->keycmp(fd
.search_key
, (void *)&rd
->key
) < 0)
238 res
= hfs_brec_remove(&fd
);
242 hfs_cat_build_key(fd
.search_key
, cnid
, NULL
);
243 res
= hfs_brec_find(&fd
);
245 res
= hfs_brec_remove(&fd
);
251 dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME_SEC
;
252 mark_inode_dirty(dir
);
263 * Rename a file or directory, possibly to a new directory.
264 * If the destination exists it is removed and a
265 * (struct hfs_cat_entry) for it is returned in '*result'.
267 int hfs_cat_move(u32 cnid
, struct inode
*src_dir
, struct qstr
*src_name
,
268 struct inode
*dst_dir
, struct qstr
*dst_name
)
270 struct super_block
*sb
;
271 struct hfs_find_data src_fd
, dst_fd
;
272 union hfs_cat_rec entry
;
273 int entry_size
, type
;
276 dprint(DBG_CAT_MOD
, "rename_cat: %u - %lu,%s - %lu,%s\n", cnid
, src_dir
->i_ino
, src_name
->name
,
277 dst_dir
->i_ino
, dst_name
->name
);
279 hfs_find_init(HFS_SB(sb
)->cat_tree
, &src_fd
);
282 /* find the old dir entry and read the data */
283 hfs_cat_build_key(src_fd
.search_key
, src_dir
->i_ino
, src_name
);
284 err
= hfs_brec_find(&src_fd
);
288 hfs_bnode_read(src_fd
.bnode
, &entry
, src_fd
.entryoffset
,
291 /* create new dir entry with the data from the old entry */
292 hfs_cat_build_key(dst_fd
.search_key
, dst_dir
->i_ino
, dst_name
);
293 err
= hfs_brec_find(&dst_fd
);
294 if (err
!= -ENOENT
) {
300 err
= hfs_brec_insert(&dst_fd
, &entry
, src_fd
.entrylength
);
304 dst_dir
->i_mtime
= dst_dir
->i_ctime
= CURRENT_TIME_SEC
;
305 mark_inode_dirty(dst_dir
);
307 /* finally remove the old entry */
308 hfs_cat_build_key(src_fd
.search_key
, src_dir
->i_ino
, src_name
);
309 err
= hfs_brec_find(&src_fd
);
312 err
= hfs_brec_remove(&src_fd
);
316 src_dir
->i_mtime
= src_dir
->i_ctime
= CURRENT_TIME_SEC
;
317 mark_inode_dirty(src_dir
);
320 if (type
== HFS_CDR_FIL
&& !(entry
.file
.Flags
& HFS_FIL_THD
))
323 /* remove old thread entry */
324 hfs_cat_build_key(src_fd
.search_key
, cnid
, NULL
);
325 err
= hfs_brec_find(&src_fd
);
328 err
= hfs_brec_remove(&src_fd
);
332 /* create new thread entry */
333 hfs_cat_build_key(dst_fd
.search_key
, cnid
, NULL
);
334 entry_size
= hfs_cat_build_thread(&entry
, type
== HFS_CDR_FIL
? HFS_CDR_FTH
: HFS_CDR_THD
,
335 dst_dir
->i_ino
, dst_name
);
336 err
= hfs_brec_find(&dst_fd
);
337 if (err
!= -ENOENT
) {
342 err
= hfs_brec_insert(&dst_fd
, &entry
, entry_size
);
344 hfs_bnode_put(dst_fd
.bnode
);
345 hfs_find_exit(&src_fd
);