1 /* $NetBSD: cd9660_lookup.c,v 1.25 2013/06/23 07:28:36 dholland Exp $ */
4 * Copyright (c) 1989, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley
8 * by Pace Willisson (pace@blitz.com). The Rock Ridge Extension
9 * Support code is derived from software contributed to Berkeley
10 * by Atsushi Murai (amurai@spec.co.jp).
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * from: @(#)ufs_lookup.c 7.33 (Berkeley) 5/19/91
38 * @(#)cd9660_lookup.c 8.5 (Berkeley) 5/27/95
41 #include <sys/cdefs.h>
42 __KERNEL_RCSID(0, "$NetBSD: cd9660_lookup.c,v 1.25 2013/06/23 07:28:36 dholland Exp $");
44 #include <sys/param.h>
45 #include <sys/namei.h>
48 #include <sys/vnode.h>
49 #include <sys/mount.h>
50 #include <sys/systm.h>
51 #include <sys/kauth.h>
53 #include <fs/cd9660/iso.h>
54 #include <fs/cd9660/cd9660_extern.h>
55 #include <fs/cd9660/cd9660_node.h>
56 #include <fs/cd9660/iso_rrip.h>
57 #include <fs/cd9660/cd9660_rrip.h>
58 #include <fs/cd9660/cd9660_mount.h>
60 struct nchstats iso_nchstats
;
63 * Convert a component of a pathname into a pointer to a locked inode.
64 * This is a very central and rather complicated routine.
65 * If the file system is not maintained in a strict tree hierarchy,
66 * this can result in a deadlock situation (see comments in code below).
68 * The flag argument is LOOKUP, CREATE, RENAME, or DELETE depending on
69 * whether the name is to be looked up, created, renamed, or deleted.
70 * When CREATE, RENAME, or DELETE is specified, information usable in
71 * creating, renaming, or deleting a directory entry may be calculated.
72 * If the target of the pathname exists, lookup returns both the target
73 * and its parent directory locked.
74 * When creating or renaming, the target may * not be ".".
75 * When deleting , the target may be "."., but the caller must check
76 * to ensure it does an vrele and vput instead of two vputs.
78 * Overall outline of ufs_lookup:
80 * check accessibility of directory
81 * look for name in cache, if found, then if at end of path
82 * and deleting or creating, drop it, else return name
83 * search for name in directory, to found or notfound
85 * if creating, return locked directory, leaving info on available slots
88 * if at end of path and deleting, return information to allow delete
89 * if at end of path and rewriting (RENAME), lock target
90 * inode and return info to allow rewrite
91 * if not at end, add name to cache; if at end and neither creating
92 * nor deleting, add name to cache
95 cd9660_lookup(void *v
)
97 struct vop_lookup_args
/* {
100 struct componentname *a_cnp;
102 struct vnode
*vdp
; /* vnode for directory being searched */
103 struct iso_node
*dp
; /* inode for directory being searched */
104 struct iso_mnt
*imp
; /* file system that directory is in */
105 struct buf
*bp
; /* a buffer of directory entries */
106 struct iso_directory_record
*ep
= NULL
;
107 /* the current directory entry */
108 int entryoffsetinblock
; /* offset of ep in bp's buffer */
109 int saveoffset
= -1; /* offset of last directory entry in dir */
110 int numdirpasses
; /* strategy for directory search */
111 doff_t endsearch
; /* offset to end directory search */
112 struct vnode
*pdp
; /* saved dp during symlink work */
113 struct vnode
*tdp
; /* returned by cd9660_vget_internal */
114 u_long bmask
; /* block offset mask */
119 char altname
[ISO_MAXNAMLEN
];
123 struct vnode
**vpp
= ap
->a_vpp
;
124 struct componentname
*cnp
= ap
->a_cnp
;
125 kauth_cred_t cred
= cnp
->cn_cred
;
127 int nameiop
= cnp
->cn_nameiop
;
129 flags
= cnp
->cn_flags
;
138 * Check accessiblity of directory.
140 if ((error
= VOP_ACCESS(vdp
, VEXEC
, cred
)) != 0)
143 if ((flags
& ISLASTCN
) && (vdp
->v_mount
->mnt_flag
& MNT_RDONLY
) &&
144 (cnp
->cn_nameiop
== DELETE
|| cnp
->cn_nameiop
== RENAME
))
148 * We now have a segment name to search for, and a directory to search.
150 * Before tediously performing a linear scan of the directory,
151 * check the name cache to see if the directory/name pair
152 * we are looking for is known already.
154 if (cache_lookup(vdp
, cnp
->cn_nameptr
, cnp
->cn_namelen
,
155 cnp
->cn_nameiop
, cnp
->cn_flags
, NULL
, vpp
)) {
156 return *vpp
== NULLVP
? ENOENT
: 0;
159 len
= cnp
->cn_namelen
;
160 name
= cnp
->cn_nameptr
;
162 * A leading `=' means, we are looking for an associated file
164 assoc
= (imp
->iso_ftype
!= ISO_FTYPE_RRIP
&& *name
== ASSOCCHAR
);
171 * If there is cached information on a previous search of
172 * this directory, pick up where we last left off.
173 * We cache only lookups as these are the most common
174 * and have the greatest payoff. Caching CREATE has little
175 * benefit as it usually must search the entire directory
176 * to determine that the entry does not exist. Caching the
177 * location of the last DELETE or RENAME has not reduced
178 * profiling time and hence has been removed in the interest
181 bmask
= imp
->im_bmask
;
182 if (nameiop
!= LOOKUP
|| dp
->i_diroff
== 0 ||
183 dp
->i_diroff
> dp
->i_size
) {
184 entryoffsetinblock
= 0;
188 dp
->i_offset
= dp
->i_diroff
;
189 if ((entryoffsetinblock
= dp
->i_offset
& bmask
) &&
190 (error
= cd9660_blkatoff(vdp
, (off_t
)dp
->i_offset
, NULL
,
194 iso_nchstats
.ncs_2passes
++;
196 endsearch
= dp
->i_size
;
199 while (dp
->i_offset
< endsearch
) {
201 * If offset is on a block boundary,
202 * read the next directory block.
203 * Release previous if it exists.
205 if ((dp
->i_offset
& bmask
) == 0) {
208 error
= cd9660_blkatoff(vdp
, (off_t
)dp
->i_offset
,
212 entryoffsetinblock
= 0;
215 * Get pointer to next entry.
218 ep
= (struct iso_directory_record
*)
219 ((char *)bp
->b_data
+ entryoffsetinblock
);
221 reclen
= isonum_711(ep
->length
);
223 /* skip to next block, if any */
225 (dp
->i_offset
& ~bmask
) + imp
->logical_block_size
;
229 if (reclen
< ISO_DIRECTORY_RECORD_SIZE
)
230 /* illegal entry, stop */
233 if (entryoffsetinblock
+ reclen
> imp
->logical_block_size
)
234 /* entries are not allowed to cross boundaries */
237 namelen
= isonum_711(ep
->name_len
);
239 if (reclen
< ISO_DIRECTORY_RECORD_SIZE
+ namelen
)
240 /* illegal entry, stop */
244 * Check for a name match.
246 switch (imp
->iso_ftype
) {
248 if ((!(isonum_711(ep
->flags
)&4)) == !assoc
) {
251 || (flags
& ISDOTDOT
)) {
253 && ep
->name
[0] == ((flags
& ISDOTDOT
) ? 1 : 0)) {
255 * Save directory entry's inode number and
256 * release directory buffer.
258 dp
->i_ino
= isodirino(ep
, imp
);
264 } else if (!(res
= isofncmp(name
,len
,
266 imp
->im_joliet_level
))) {
267 if (isonum_711(ep
->flags
)&2)
268 ino
= isodirino(ep
, imp
);
270 ino
= dbtob(bp
->b_blkno
)
271 + entryoffsetinblock
;
272 saveoffset
= dp
->i_offset
;
275 #ifdef NOSORTBUG /* On some CDs directory entries are not sorted correctly */
278 else if (res
> 0 && numdirpasses
== 2)
284 if (isonum_711(ep
->flags
)&2)
285 ino
= isodirino(ep
, imp
);
287 ino
= dbtob(bp
->b_blkno
) + entryoffsetinblock
;
289 cd9660_rrip_getname(ep
,altname
,&namelen
,&dp
->i_ino
,imp
);
290 if (namelen
== cnp
->cn_namelen
) {
291 if (imp
->im_flags
& ISOFSMNT_RRCASEINS
) {
292 if (strncasecmp(name
, altname
, namelen
) == 0)
295 if (memcmp(name
, altname
, namelen
) == 0)
302 dp
->i_offset
+= reclen
;
303 entryoffsetinblock
+= reclen
;
308 if (saveoffset
!= dp
->i_offset
) {
309 if (cd9660_lblkno(imp
, dp
->i_offset
) !=
310 cd9660_lblkno(imp
, saveoffset
)) {
313 if ((error
= cd9660_blkatoff(vdp
,
314 (off_t
)saveoffset
, NULL
, &bp
)) != 0)
317 entryoffsetinblock
= saveoffset
& bmask
;
318 ep
= (struct iso_directory_record
*)
319 ((char *)bp
->b_data
+ entryoffsetinblock
);
320 dp
->i_offset
= saveoffset
;
326 * If we started in the middle of the directory and failed
327 * to find our target, we must check the beginning as well.
329 if (numdirpasses
== 2) {
332 endsearch
= dp
->i_diroff
;
339 * Insert name into cache (as non-existent) if appropriate.
341 cache_enter(vdp
, *vpp
, cnp
->cn_nameptr
, cnp
->cn_namelen
, cnp
->cn_flags
);
342 return (nameiop
== CREATE
|| nameiop
== RENAME
) ? EROFS
: ENOENT
;
345 if (numdirpasses
== 2)
346 iso_nchstats
.ncs_pass2
++;
349 * Found component in pathname.
350 * If the final component of path name, save information
351 * in the cache as to where the entry was found.
353 if ((flags
& ISLASTCN
) && nameiop
== LOOKUP
)
354 dp
->i_diroff
= dp
->i_offset
;
357 * Step through the translation in the name. We do not `iput' the
358 * directory because we may need it again if a symbolic link
359 * is relative to the current directory. Instead we save it
360 * unlocked as "pdp". We must get the target inode before unlocking
361 * the directory to insure that the inode will not be removed
362 * before we get it. We prevent deadlock by always fetching
363 * inodes from the root, moving down the directory tree. Thus
364 * when following backward pointers ".." we must unlock the
365 * parent directory before getting the requested directory.
366 * There is a potential race condition here if both the current
367 * and parent directories are removed before the `iget' for the
368 * inode associated with ".." returns. We hope that this occurs
369 * infrequently since we cannot avoid this race condition without
370 * implementing a sophisticated deadlock detection algorithm.
371 * Note also that this simple deadlock detection scheme will not
372 * work if the file system has any hard links other than ".."
373 * that point backwards in the directory structure.
378 * If ino is different from dp->i_ino,
379 * it's a relocated directory.
382 if (flags
& ISDOTDOT
) {
383 VOP_UNLOCK(pdp
); /* race to get the inode */
384 error
= cd9660_vget_internal(vdp
->v_mount
, dp
->i_ino
, &tdp
,
385 dp
->i_ino
!= ino
, ep
);
386 vn_lock(pdp
, LK_EXCLUSIVE
| LK_RETRY
);
390 } else if (dp
->i_number
== dp
->i_ino
) {
391 vref(vdp
); /* we want ourself, ie "." */
394 error
= cd9660_vget_internal(vdp
->v_mount
, dp
->i_ino
, &tdp
,
395 dp
->i_ino
!= ino
, ep
);
402 * Insert name into cache if appropriate.
404 cache_enter(vdp
, *vpp
, cnp
->cn_nameptr
, cnp
->cn_namelen
, cnp
->cn_flags
);
409 * Return buffer with the contents of block "offset" from the beginning of
410 * directory "ip". If "res" is non-zero, fill it in with a pointer to the
411 * remaining space in the directory.
414 cd9660_blkatoff(struct vnode
*vp
, off_t offset
, char **res
, struct buf
**bpp
)
424 lbn
= cd9660_lblkno(imp
, offset
);
425 bsize
= cd9660_blksize(imp
, ip
, lbn
);
427 if ((error
= bread(vp
, lbn
, bsize
, NOCRED
, 0, &bp
)) != 0) {
432 *res
= (char *)bp
->b_data
+ cd9660_blkoff(imp
, offset
);