3 * BFS directory operations.
4 * Copyright (C) 1999,2000 Tigran Aivazian <tigran@veritas.com>
5 * Made endianness-clean by Andrew Stribblehill <ads@wompom.org> 2005
8 #include <linux/time.h>
9 #include <linux/string.h>
11 #include <linux/smp_lock.h>
12 #include <linux/buffer_head.h>
13 #include <linux/sched.h>
19 #define dprintf(x...) printf(x)
24 static int bfs_add_entry(struct inode *dir, const unsigned char *name,
25 int namelen, int ino);
26 static struct buffer_head *bfs_find_entry(struct inode *dir,
27 const unsigned char *name, int namelen,
28 struct bfs_dirent **res_dir);
30 static int bfs_readdir(struct file *f, void *dirent, filldir_t filldir)
32 struct inode *dir = f->f_path.dentry->d_inode;
33 struct buffer_head *bh;
34 struct bfs_dirent *de;
40 if (f->f_pos & (BFS_DIRENT_SIZE - 1)) {
41 printf("Bad f_pos=%08lx for %s:%08lx\n",
42 (unsigned long)f->f_pos,
43 dir->i_sb->s_id, dir->i_ino);
48 while (f->f_pos < dir->i_size) {
49 offset = f->f_pos & (BFS_BSIZE - 1);
50 block = BFS_I(dir)->i_sblock + (f->f_pos >> BFS_BSIZE_BITS);
51 bh = sb_bread(dir->i_sb, block);
53 f->f_pos += BFS_BSIZE - offset;
57 de = (struct bfs_dirent *)(bh->b_data + offset);
59 int size = strnlen(de->name, BFS_NAMELEN);
60 if (filldir(dirent, de->name, size, f->f_pos,
68 offset += BFS_DIRENT_SIZE;
69 f->f_pos += BFS_DIRENT_SIZE;
70 } while ((offset < BFS_BSIZE) && (f->f_pos < dir->i_size));
78 const struct file_operations bfs_dir_operations = {
79 .read = generic_read_dir,
80 .readdir = bfs_readdir,
84 extern void dump_imap(const char *, struct super_block *);
86 static int bfs_create(struct inode *dir, struct dentry *dentry, int mode,
91 struct super_block *s = dir->i_sb;
92 struct bfs_sb_info *info = BFS_SB(s);
99 ino = find_first_zero_bit(info->si_imap, info->si_lasti);
100 if (ino > info->si_lasti) {
105 set_bit(ino, info->si_imap);
107 inode->i_uid = current->fsuid;
108 inode->i_gid = (dir->i_mode & S_ISGID) ? dir->i_gid : current->fsgid;
109 inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME_SEC;
111 inode->i_op = &bfs_file_inops;
112 inode->i_fop = &bfs_file_operations;
113 inode->i_mapping->a_ops = &bfs_aops;
114 inode->i_mode = mode;
116 BFS_I(inode)->i_dsk_ino = ino;
117 BFS_I(inode)->i_sblock = 0;
118 BFS_I(inode)->i_eblock = 0;
119 insert_inode_hash(inode);
120 mark_inode_dirty(inode);
121 dump_imap("create", s);
123 err = bfs_add_entry(dir, dentry->d_name.name, dentry->d_name.len,
126 inode_dec_link_count(inode);
132 d_instantiate(dentry, inode);
136 static struct dentry *bfs_lookup(struct inode *dir, struct dentry *dentry,
137 struct nameidata *nd)
139 struct inode *inode = NULL;
140 struct buffer_head *bh;
141 struct bfs_dirent *de;
143 if (dentry->d_name.len > BFS_NAMELEN)
144 return ERR_PTR(-ENAMETOOLONG);
147 bh = bfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len, &de);
149 unsigned long ino = (unsigned long)le16_to_cpu(de->ino);
151 inode = bfs_iget(dir->i_sb, ino);
154 return ERR_CAST(inode);
158 d_add(dentry, inode);
162 static int bfs_link(struct dentry *old, struct inode *dir,
165 struct inode *inode = old->d_inode;
169 err = bfs_add_entry(dir, new->d_name.name, new->d_name.len,
176 inode->i_ctime = CURRENT_TIME_SEC;
177 mark_inode_dirty(inode);
178 atomic_inc(&inode->i_count);
179 d_instantiate(new, inode);
184 static int bfs_unlink(struct inode *dir, struct dentry *dentry)
188 struct buffer_head *bh;
189 struct bfs_dirent *de;
191 inode = dentry->d_inode;
193 bh = bfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len, &de);
194 if (!bh || (le16_to_cpu(de->ino) != inode->i_ino))
197 if (!inode->i_nlink) {
198 printf("unlinking non-existent file %s:%lu (nlink=%d)\n",
199 inode->i_sb->s_id, inode->i_ino,
204 mark_buffer_dirty(bh);
205 dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
206 mark_inode_dirty(dir);
207 inode->i_ctime = dir->i_ctime;
208 inode_dec_link_count(inode);
217 static int bfs_rename(struct inode *old_dir, struct dentry *old_dentry,
218 struct inode *new_dir, struct dentry *new_dentry)
220 struct inode *old_inode, *new_inode;
221 struct buffer_head *old_bh, *new_bh;
222 struct bfs_dirent *old_de, *new_de;
225 old_bh = new_bh = NULL;
226 old_inode = old_dentry->d_inode;
227 if (S_ISDIR(old_inode->i_mode))
231 old_bh = bfs_find_entry(old_dir,
232 old_dentry->d_name.name,
233 old_dentry->d_name.len, &old_de);
235 if (!old_bh || (le16_to_cpu(old_de->ino) != old_inode->i_ino))
239 new_inode = new_dentry->d_inode;
240 new_bh = bfs_find_entry(new_dir,
241 new_dentry->d_name.name,
242 new_dentry->d_name.len, &new_de);
244 if (new_bh && !new_inode) {
249 error = bfs_add_entry(new_dir,
250 new_dentry->d_name.name,
251 new_dentry->d_name.len,
257 old_dir->i_ctime = old_dir->i_mtime = CURRENT_TIME_SEC;
258 mark_inode_dirty(old_dir);
260 new_inode->i_ctime = CURRENT_TIME_SEC;
261 inode_dec_link_count(new_inode);
263 mark_buffer_dirty(old_bh);
273 const struct inode_operations bfs_dir_inops = {
274 .create = bfs_create,
275 .lookup = bfs_lookup,
277 .unlink = bfs_unlink,
278 .rename = bfs_rename,
281 static int bfs_add_entry(struct inode *dir, const unsigned char *name,
282 int namelen, int ino)
284 struct buffer_head *bh;
285 struct bfs_dirent *de;
286 int block, sblock, eblock, off, pos;
289 dprintf("name=%s, namelen=%d\n", name, namelen);
293 if (namelen > BFS_NAMELEN)
294 return -ENAMETOOLONG;
296 sblock = BFS_I(dir)->i_sblock;
297 eblock = BFS_I(dir)->i_eblock;
298 for (block = sblock; block <= eblock; block++) {
299 bh = sb_bread(dir->i_sb, block);
302 for (off = 0; off < BFS_BSIZE; off += BFS_DIRENT_SIZE) {
303 de = (struct bfs_dirent *)(bh->b_data + off);
305 pos = (block - sblock) * BFS_BSIZE + off;
306 if (pos >= dir->i_size) {
307 dir->i_size += BFS_DIRENT_SIZE;
308 dir->i_ctime = CURRENT_TIME_SEC;
310 dir->i_mtime = CURRENT_TIME_SEC;
311 mark_inode_dirty(dir);
312 de->ino = cpu_to_le16((u16)ino);
313 for (i = 0; i < BFS_NAMELEN; i++)
315 (i < namelen) ? name[i] : 0;
316 mark_buffer_dirty(bh);
326 static inline int bfs_namecmp(int len, const unsigned char *name,
329 if ((len < BFS_NAMELEN) && buffer[len])
331 return !memcmp(name, buffer, len);
334 static struct buffer_head *bfs_find_entry(struct inode *dir,
335 const unsigned char *name, int namelen,
336 struct bfs_dirent **res_dir)
338 unsigned long block = 0, offset = 0;
339 struct buffer_head *bh = NULL;
340 struct bfs_dirent *de;
343 if (namelen > BFS_NAMELEN)
346 while (block * BFS_BSIZE + offset < dir->i_size) {
348 bh = sb_bread(dir->i_sb, BFS_I(dir)->i_sblock + block);
354 de = (struct bfs_dirent *)(bh->b_data + offset);
355 offset += BFS_DIRENT_SIZE;
356 if (le16_to_cpu(de->ino) &&
357 bfs_namecmp(namelen, name, de->name)) {
361 if (offset < bh->b_size)