2 * Copyright (c) 2000-2001 Christoph Hellwig.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions, and the following disclaimer,
10 * without modification.
11 * 2. The name of the author may not be used to endorse or promote products
12 * derived from this software without specific prior written permission.
14 * Alternatively, this software may be distributed under the terms of the
15 * GNU General Public License ("GPL").
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
21 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * Veritas filesystem driver - lookup and other directory related code.
34 #include <linux/time.h>
36 #include <linux/highmem.h>
37 #include <linux/kernel.h>
38 #include <linux/pagemap.h>
39 #include <linux/smp_lock.h>
43 #include "vxfs_inode.h"
44 #include "vxfs_extern.h"
47 * Number of VxFS blocks per page.
49 #define VXFS_BLOCK_PER_PAGE(sbp) ((PAGE_CACHE_SIZE / (sbp)->s_blocksize))
52 static struct dentry * vxfs_lookup(struct inode *, struct dentry *, struct nameidata *);
53 static int vxfs_readdir(struct file *, void *, filldir_t);
55 const struct inode_operations vxfs_dir_inode_ops = {
56 .lookup = vxfs_lookup,
59 const struct file_operations vxfs_dir_operations = {
60 .llseek = generic_file_llseek,
61 .read = generic_read_dir,
62 .readdir = vxfs_readdir,
67 dir_pages(struct inode *inode)
69 return (inode->i_size + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
73 dir_blocks(struct inode *ip)
75 u_long bsize = ip->i_sb->s_blocksize;
76 return (ip->i_size + bsize - 1) & ~(bsize - 1);
80 * NOTE! unlike strncmp, vxfs_match returns 1 for success, 0 for failure.
82 * len <= VXFS_NAMELEN and de != NULL are guaranteed by caller.
85 vxfs_match(int len, const char * const name, struct vxfs_direct *de)
87 if (len != de->d_namelen)
91 return !memcmp(name, de->d_name, len);
94 static inline struct vxfs_direct *
95 vxfs_next_entry(struct vxfs_direct *de)
97 return ((struct vxfs_direct *)((char*)de + de->d_reclen));
101 * vxfs_find_entry - find a mathing directory entry for a dentry
102 * @ip: directory inode
103 * @dp: dentry for which we want to find a direct
104 * @ppp: gets filled with the page the return value sits in
107 * vxfs_find_entry finds a &struct vxfs_direct for the VFS directory
108 * cache entry @dp. @ppp will be filled with the page the return
112 * The wanted direct on success, else a NULL pointer.
114 static struct vxfs_direct *
115 vxfs_find_entry(struct inode *ip, struct dentry *dp, struct page **ppp)
117 u_long npages, page, nblocks, pblocks, block;
118 u_long bsize = ip->i_sb->s_blocksize;
119 const char *name = dp->d_name.name;
120 int namelen = dp->d_name.len;
122 npages = dir_pages(ip);
123 nblocks = dir_blocks(ip);
124 pblocks = VXFS_BLOCK_PER_PAGE(ip->i_sb);
126 for (page = 0; page < npages; page++) {
130 pp = vxfs_get_page(ip->i_mapping, page);
133 kaddr = (caddr_t)page_address(pp);
135 for (block = 0; block <= nblocks && block <= pblocks; block++) {
136 caddr_t baddr, limit;
137 struct vxfs_dirblk *dbp;
138 struct vxfs_direct *de;
140 baddr = kaddr + (block * bsize);
141 limit = baddr + bsize - VXFS_DIRLEN(1);
143 dbp = (struct vxfs_dirblk *)baddr;
144 de = (struct vxfs_direct *)(baddr + VXFS_DIRBLKOV(dbp));
146 for (; (caddr_t)de <= limit; de = vxfs_next_entry(de)) {
151 if (vxfs_match(namelen, name, de)) {
164 * vxfs_inode_by_name - find inode number for dentry
165 * @dip: directory to search in
166 * @dp: dentry we seach for
169 * vxfs_inode_by_name finds out the inode number of
170 * the path component described by @dp in @dip.
173 * The wanted inode number on success, else Zero.
176 vxfs_inode_by_name(struct inode *dip, struct dentry *dp)
178 struct vxfs_direct *de;
182 de = vxfs_find_entry(dip, dp, &pp);
186 page_cache_release(pp);
193 * vxfs_lookup - lookup pathname component
194 * @dip: dir in which we lookup
195 * @dp: dentry we lookup
196 * @nd: lookup nameidata
199 * vxfs_lookup tries to lookup the pathname component described
203 * A NULL-pointer on success, else an negative error code encoded
204 * in the return pointer.
206 static struct dentry *
207 vxfs_lookup(struct inode *dip, struct dentry *dp, struct nameidata *nd)
209 struct inode *ip = NULL;
212 if (dp->d_name.len > VXFS_NAMELEN)
213 return ERR_PTR(-ENAMETOOLONG);
216 ino = vxfs_inode_by_name(dip, dp);
218 ip = vxfs_iget(dip->i_sb, ino);
230 * vxfs_readdir - read a directory
231 * @fp: the directory to read
232 * @retp: return buffer
233 * @filler: filldir callback
236 * vxfs_readdir fills @retp with directory entries from @fp
237 * using the VFS supplied callback @filler.
243 vxfs_readdir(struct file *fp, void *retp, filldir_t filler)
245 struct inode *ip = fp->f_path.dentry->d_inode;
246 struct super_block *sbp = ip->i_sb;
247 u_long bsize = sbp->s_blocksize;
248 u_long page, npages, block, pblocks, nblocks, offset;
253 switch ((long)fp->f_pos) {
255 if (filler(retp, ".", 1, fp->f_pos, ip->i_ino, DT_DIR) < 0)
260 if (filler(retp, "..", 2, fp->f_pos, VXFS_INO(ip)->vii_dotdot, DT_DIR) < 0)
268 if (pos > VXFS_DIRROUND(ip->i_size)) {
273 npages = dir_pages(ip);
274 nblocks = dir_blocks(ip);
275 pblocks = VXFS_BLOCK_PER_PAGE(sbp);
277 page = pos >> PAGE_CACHE_SHIFT;
278 offset = pos & ~PAGE_CACHE_MASK;
279 block = (u_long)(pos >> sbp->s_blocksize_bits) % pblocks;
281 for (; page < npages; page++, block = 0) {
285 pp = vxfs_get_page(ip->i_mapping, page);
288 kaddr = (caddr_t)page_address(pp);
290 for (; block <= nblocks && block <= pblocks; block++) {
291 caddr_t baddr, limit;
292 struct vxfs_dirblk *dbp;
293 struct vxfs_direct *de;
295 baddr = kaddr + (block * bsize);
296 limit = baddr + bsize - VXFS_DIRLEN(1);
298 dbp = (struct vxfs_dirblk *)baddr;
299 de = (struct vxfs_direct *)
302 (baddr + VXFS_DIRBLKOV(dbp)));
304 for (; (caddr_t)de <= limit; de = vxfs_next_entry(de)) {
312 offset = (caddr_t)de - kaddr;
313 over = filler(retp, de->d_name, de->d_namelen,
314 ((page << PAGE_CACHE_SHIFT) | offset) + 2,
315 de->d_ino, DT_UNKNOWN);
328 fp->f_pos = ((page << PAGE_CACHE_SHIFT) | offset) + 2;