3 * BFS directory operations.
4 * Copyright (C) 1999,2000 Tigran Aivazian <tigran@veritas.com>
7 #include <linux/time.h>
8 #include <linux/string.h>
10 #include <linux/smp_lock.h>
11 #include <linux/buffer_head.h>
12 #include <linux/sched.h>
18 #define dprintf(x...) printf(x)
23 static int bfs_add_entry(struct inode * dir, const char * name, int namelen, int ino);
24 static struct buffer_head * bfs_find_entry(struct inode * dir,
25 const char * name, int namelen, struct bfs_dirent ** res_dir);
27 static int bfs_readdir(struct file * f, void * dirent, filldir_t filldir)
29 struct inode * dir = f->f_dentry->d_inode;
30 struct buffer_head * bh;
31 struct bfs_dirent * de;
37 if (f->f_pos & (BFS_DIRENT_SIZE-1)) {
38 printf("Bad f_pos=%08lx for %s:%08lx\n", (unsigned long)f->f_pos,
39 dir->i_sb->s_id, dir->i_ino);
44 while (f->f_pos < dir->i_size) {
45 offset = f->f_pos & (BFS_BSIZE-1);
46 block = BFS_I(dir)->i_sblock + (f->f_pos >> BFS_BSIZE_BITS);
47 bh = sb_bread(dir->i_sb, block);
49 f->f_pos += BFS_BSIZE - offset;
53 de = (struct bfs_dirent *)(bh->b_data + offset);
55 int size = strnlen(de->name, BFS_NAMELEN);
56 if (filldir(dirent, de->name, size, f->f_pos, de->ino, DT_UNKNOWN) < 0) {
62 offset += BFS_DIRENT_SIZE;
63 f->f_pos += BFS_DIRENT_SIZE;
64 } while (offset < BFS_BSIZE && f->f_pos < dir->i_size);
72 struct file_operations bfs_dir_operations = {
73 .read = generic_read_dir,
74 .readdir = bfs_readdir,
78 extern void dump_imap(const char *, struct super_block *);
80 static int bfs_create(struct inode * dir, struct dentry * dentry, int mode,
85 struct super_block * s = dir->i_sb;
86 struct bfs_sb_info * info = BFS_SB(s);
93 ino = find_first_zero_bit(info->si_imap, info->si_lasti);
94 if (ino > info->si_lasti) {
99 set_bit(ino, info->si_imap);
101 inode->i_uid = current->fsuid;
102 inode->i_gid = (dir->i_mode & S_ISGID) ? dir->i_gid : current->fsgid;
103 inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME_SEC;
104 inode->i_blocks = inode->i_blksize = 0;
105 inode->i_op = &bfs_file_inops;
106 inode->i_fop = &bfs_file_operations;
107 inode->i_mapping->a_ops = &bfs_aops;
108 inode->i_mode = mode;
110 BFS_I(inode)->i_dsk_ino = ino;
111 BFS_I(inode)->i_sblock = 0;
112 BFS_I(inode)->i_eblock = 0;
113 insert_inode_hash(inode);
114 mark_inode_dirty(inode);
115 dump_imap("create",s);
117 err = bfs_add_entry(dir, dentry->d_name.name, dentry->d_name.len, inode->i_ino);
120 mark_inode_dirty(inode);
126 d_instantiate(dentry, inode);
130 static struct dentry * bfs_lookup(struct inode * dir, struct dentry * dentry, struct nameidata *nd)
132 struct inode * inode = NULL;
133 struct buffer_head * bh;
134 struct bfs_dirent * de;
136 if (dentry->d_name.len > BFS_NAMELEN)
137 return ERR_PTR(-ENAMETOOLONG);
140 bh = bfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len, &de);
142 unsigned long ino = le32_to_cpu(de->ino);
144 inode = iget(dir->i_sb, ino);
147 return ERR_PTR(-EACCES);
151 d_add(dentry, inode);
155 static int bfs_link(struct dentry * old, struct inode * dir, struct dentry * new)
157 struct inode * inode = old->d_inode;
161 err = bfs_add_entry(dir, new->d_name.name, new->d_name.len, inode->i_ino);
167 inode->i_ctime = CURRENT_TIME_SEC;
168 mark_inode_dirty(inode);
169 atomic_inc(&inode->i_count);
170 d_instantiate(new, inode);
176 static int bfs_unlink(struct inode * dir, struct dentry * dentry)
179 struct inode * inode;
180 struct buffer_head * bh;
181 struct bfs_dirent * de;
183 inode = dentry->d_inode;
185 bh = bfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len, &de);
186 if (!bh || de->ino != inode->i_ino)
189 if (!inode->i_nlink) {
190 printf("unlinking non-existent file %s:%lu (nlink=%d)\n", inode->i_sb->s_id,
191 inode->i_ino, inode->i_nlink);
195 mark_buffer_dirty(bh);
196 dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
197 mark_inode_dirty(dir);
199 inode->i_ctime = dir->i_ctime;
200 mark_inode_dirty(inode);
209 static int bfs_rename(struct inode * old_dir, struct dentry * old_dentry,
210 struct inode * new_dir, struct dentry * new_dentry)
212 struct inode * old_inode, * new_inode;
213 struct buffer_head * old_bh, * new_bh;
214 struct bfs_dirent * old_de, * new_de;
217 old_bh = new_bh = NULL;
218 old_inode = old_dentry->d_inode;
219 if (S_ISDIR(old_inode->i_mode))
223 old_bh = bfs_find_entry(old_dir,
224 old_dentry->d_name.name,
225 old_dentry->d_name.len, &old_de);
227 if (!old_bh || old_de->ino != old_inode->i_ino)
231 new_inode = new_dentry->d_inode;
232 new_bh = bfs_find_entry(new_dir,
233 new_dentry->d_name.name,
234 new_dentry->d_name.len, &new_de);
236 if (new_bh && !new_inode) {
241 error = bfs_add_entry(new_dir,
242 new_dentry->d_name.name,
243 new_dentry->d_name.len, old_inode->i_ino);
248 old_dir->i_ctime = old_dir->i_mtime = CURRENT_TIME_SEC;
249 mark_inode_dirty(old_dir);
251 new_inode->i_nlink--;
252 new_inode->i_ctime = CURRENT_TIME_SEC;
253 mark_inode_dirty(new_inode);
255 mark_buffer_dirty(old_bh);
265 struct inode_operations bfs_dir_inops = {
266 .create = bfs_create,
267 .lookup = bfs_lookup,
269 .unlink = bfs_unlink,
270 .rename = bfs_rename,
273 static int bfs_add_entry(struct inode * dir, const char * name, int namelen, int ino)
275 struct buffer_head * bh;
276 struct bfs_dirent * de;
277 int block, sblock, eblock, off, eoff;
280 dprintf("name=%s, namelen=%d\n", name, namelen);
284 if (namelen > BFS_NAMELEN)
285 return -ENAMETOOLONG;
287 sblock = BFS_I(dir)->i_sblock;
288 eblock = BFS_I(dir)->i_eblock;
289 eoff = dir->i_size % BFS_BSIZE;
290 for (block=sblock; block<=eblock; block++) {
291 bh = sb_bread(dir->i_sb, block);
294 for (off=0; off<BFS_BSIZE; off+=BFS_DIRENT_SIZE) {
295 de = (struct bfs_dirent *)(bh->b_data + off);
296 if (block==eblock && off>=eoff) {
297 /* Do not read/interpret the garbage in the end of eblock. */
301 if ((block-sblock)*BFS_BSIZE + off >= dir->i_size) {
302 dir->i_size += BFS_DIRENT_SIZE;
303 dir->i_ctime = CURRENT_TIME_SEC;
305 dir->i_mtime = CURRENT_TIME_SEC;
306 mark_inode_dirty(dir);
308 for (i=0; i<BFS_NAMELEN; i++)
309 de->name[i] = (i < namelen) ? name[i] : 0;
310 mark_buffer_dirty(bh);
320 static inline int bfs_namecmp(int len, const char * name, const char * buffer)
322 if (len < BFS_NAMELEN && buffer[len])
324 return !memcmp(name, buffer, len);
327 static struct buffer_head * bfs_find_entry(struct inode * dir,
328 const char * name, int namelen, struct bfs_dirent ** res_dir)
330 unsigned long block, offset;
331 struct buffer_head * bh;
332 struct bfs_dirent * de;
335 if (namelen > BFS_NAMELEN)
339 while (block * BFS_BSIZE + offset < dir->i_size) {
341 bh = sb_bread(dir->i_sb, BFS_I(dir)->i_sblock + block);
347 de = (struct bfs_dirent *)(bh->b_data + offset);
348 offset += BFS_DIRENT_SIZE;
349 if (de->ino && bfs_namecmp(namelen, name, de->name)) {
353 if (offset < bh->b_size)