2 * Copyright (c) 2000-2003 Apple Computer, Inc. All rights reserved.
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
28 /* $NetBSD: cd9660_lookup.c,v 1.13 1994/12/24 15:30:03 cgd Exp $ */
31 * Copyright (c) 1989, 1993, 1994
32 * The Regents of the University of California. All rights reserved.
34 * This code is derived from software contributed to Berkeley
35 * by Pace Willisson (pace@blitz.com). The Rock Ridge Extension
36 * Support code is derived from software contributed to Berkeley
37 * by Atsushi Murai (amurai@spec.co.jp).
39 * Redistribution and use in source and binary forms, with or without
40 * modification, are permitted provided that the following conditions
42 * 1. Redistributions of source code must retain the above copyright
43 * notice, this list of conditions and the following disclaimer.
44 * 2. Redistributions in binary form must reproduce the above copyright
45 * notice, this list of conditions and the following disclaimer in the
46 * documentation and/or other materials provided with the distribution.
47 * 3. All advertising materials mentioning features or use of this software
48 * must display the following acknowledgement:
49 * This product includes software developed by the University of
50 * California, Berkeley and its contributors.
51 * 4. Neither the name of the University nor the names of its contributors
52 * may be used to endorse or promote products derived from this software
53 * without specific prior written permission.
55 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
56 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
57 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
58 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
59 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
60 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
61 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
62 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
63 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
64 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
67 * from: @(#)ufs_lookup.c 7.33 (Berkeley) 5/19/91
69 * @(#)cd9660_lookup.c 8.5 (Berkeley) 12/5/94
73 #include <sys/param.h>
74 #include <sys/vnode.h>
75 #include <sys/mount.h>
76 #include <sys/namei.h>
79 #include <sys/utfconv.h>
81 #include <isofs/cd9660/iso.h>
82 #include <isofs/cd9660/cd9660_node.h>
83 #include <isofs/cd9660/iso_rrip.h>
84 #include <isofs/cd9660/cd9660_rrip.h>
86 struct nchstats iso_nchstats
;
89 * Convert a component of a pathname into a pointer to a locked inode.
90 * This is a very central and rather complicated routine.
91 * If the file system is not maintained in a strict tree hierarchy,
92 * this can result in a deadlock situation (see comments in code below).
94 * The flag argument is LOOKUP, CREATE, RENAME, or DELETE depending on
95 * whether the name is to be looked up, created, renamed, or deleted.
96 * When CREATE, RENAME, or DELETE is specified, information usable in
97 * creating, renaming, or deleting a directory entry may be calculated.
98 * If flag has LOCKPARENT or'ed into it and the target of the pathname
99 * exists, lookup returns both the target and its parent directory locked.
100 * When creating or renaming and LOCKPARENT is specified, the target may
101 * not be ".". When deleting and LOCKPARENT is specified, the target may
102 * be "."., but the caller must check to ensure it does an vrele and iput
103 * instead of two iputs.
105 * Overall outline of ufs_lookup:
107 * check accessibility of directory
108 * look for name in cache, if found, then if at end of path
109 * and deleting or creating, drop it, else return name
110 * search for name in directory, to found or notfound
112 * if creating, return locked directory, leaving info on available slots
115 * if at end of path and deleting, return information to allow delete
116 * if at end of path and rewriting (RENAME and LOCKPARENT), lock target
117 * inode and return info to allow rewrite
118 * if not at end, add name to cache; if at end and neither creating
119 * nor deleting, add name to cache
121 * NOTE: (LOOKUP | LOCKPARENT) currently returns the parent inode unlocked.
124 cd9660_lookup(struct vnop_lookup_args
*ap
)
126 register struct vnode
*vdp
; /* vnode for directory being searched */
127 register struct iso_node
*dp
; /* inode for directory being searched */
128 register struct iso_mnt
*imp
; /* file system that directory is in */
129 struct buf
*bp
; /* a buffer of directory entries */
130 struct iso_directory_record
*ep
= NULL
;/* the current directory entry */
131 int entryoffsetinblock
; /* offset of ep in bp's buffer */
132 int saveoffset
= 0; /* offset of last directory entry in dir */
133 int numdirpasses
; /* strategy for directory search */
134 doff_t endsearch
; /* offset to end directory search */
135 struct vnode
*pdp
; /* saved dp during symlink work */
136 struct vnode
*tdp
; /* returned by cd9660_vget_internal */
137 u_long bmask
; /* block offset mask */
138 int lockparent
; /* 1 => lockparent flag is set */
139 int wantparent
; /* 1 => wantparent or lockparent flag */
146 char altname
[ISO_RRIP_NAMEMAX
];
150 struct vnode
**vpp
= ap
->a_vpp
;
151 struct componentname
*cnp
= ap
->a_cnp
;
152 int flags
= cnp
->cn_flags
;
153 int nameiop
= cnp
->cn_nameiop
;
154 vfs_context_t ctx
= cnp
->cn_context
;
155 struct proc
*p
= vfs_context_proc(ctx
);
163 lockparent
= flags
& LOCKPARENT
;
164 wantparent
= flags
& (LOCKPARENT
|WANTPARENT
);
169 * We now have a segment name to search for, and a directory to search.
171 * Before tediously performing a linear scan of the directory,
172 * check the name cache to see if the directory/name pair
173 * we are looking for is known already.
175 if ((error
= cache_lookup(vdp
, vpp
, cnp
))) {
181 len
= cnp
->cn_namelen
;
182 name
= cnp
->cn_nameptr
;
185 * A "._" prefix means, we are looking for an associated file
187 if (imp
->iso_ftype
!= ISO_FTYPE_RRIP
&&
188 *name
== ASSOCCHAR1
&& *(name
+1) == ASSOCCHAR2
) {
194 * Decode search name into UCS-2 (Unicode)
196 if ((imp
->iso_ftype
== ISO_FTYPE_JOLIET
) &&
197 !((len
== 1 && *name
== '.') || (flags
& ISDOTDOT
))) {
198 int flags1
= UTF_PRECOMPOSED
;
200 (void) utf8_decodestr(name
, len
, (u_int16_t
*) altname
, &altlen
,
201 sizeof(altname
), 0, flags1
);
206 * If there is cached information on a previous search of
207 * this directory, pick up where we last left off.
208 * We cache only lookups as these are the most common
209 * and have the greatest payoff. Caching CREATE has little
210 * benefit as it usually must search the entire directory
211 * to determine that the entry does not exist. Caching the
212 * location of the last DELETE or RENAME has not reduced
213 * profiling time and hence has been removed in the interest
216 bmask
= imp
->im_sector_size
- 1;
217 if (nameiop
!= LOOKUP
|| dp
->i_diroff
== 0 ||
218 dp
->i_diroff
> dp
->i_size
) {
219 entryoffsetinblock
= 0;
223 dp
->i_offset
= dp
->i_diroff
;
225 if ((entryoffsetinblock
= dp
->i_offset
& bmask
) &&
226 (error
= cd9660_blkatoff(vdp
, SECTOFF(imp
, dp
->i_offset
), NULL
, &bp
)))
229 iso_nchstats
.ncs_2passes
++;
231 endsearch
= dp
->i_size
;
234 while (dp
->i_offset
< endsearch
) {
236 * If offset is on a block boundary,
237 * read the next directory block.
238 * Release previous if it exists.
240 if ((dp
->i_offset
& bmask
) == 0) {
243 if ( (error
= cd9660_blkatoff(vdp
, SECTOFF(imp
,dp
->i_offset
), NULL
, &bp
)) )
245 entryoffsetinblock
= 0;
248 * Get pointer to next entry.
250 ep
= (struct iso_directory_record
*)
251 ((char *)buf_dataptr(bp
) + entryoffsetinblock
);
253 reclen
= isonum_711(ep
->length
);
255 /* skip to next block, if any */
257 (dp
->i_offset
& ~bmask
) + imp
->im_sector_size
;
261 if (reclen
< ISO_DIRECTORY_RECORD_SIZE
) {
262 /* illegal entry, stop */
265 if (entryoffsetinblock
+ reclen
> imp
->im_sector_size
) {
266 /* entries are not allowed to cross sector boundaries */
269 namelen
= isonum_711(ep
->name_len
);
270 isoflags
= isonum_711(ep
->flags
);
272 if (reclen
< ISO_DIRECTORY_RECORD_SIZE
+ namelen
)
273 /* illegal entry, stop */
276 * Check for a name match.
278 if (imp
->iso_ftype
== ISO_FTYPE_RRIP
) {
279 if (isoflags
& directoryBit
)
280 ino
= isodirino(ep
, imp
);
282 ino
= ((daddr_t
)buf_blkno(bp
) << imp
->im_bshift
) + entryoffsetinblock
;
284 cd9660_rrip_getname(ep
,altname
,&namelen
,&dp
->i_ino
,imp
);
285 if (namelen
== cnp
->cn_namelen
286 && !bcmp(name
,altname
,namelen
))
290 if ((!(isoflags
& associatedBit
)) == !wantassoc
) {
293 || (flags
& ISDOTDOT
)) {
295 && ep
->name
[0] == ((flags
& ISDOTDOT
) ? 1 : 0)) {
297 * Save directory entry's inode number and
298 * release directory buffer.
300 dp
->i_ino
= isodirino(ep
, imp
);
306 } else if (imp
->iso_ftype
!= ISO_FTYPE_JOLIET
&& !(res
= isofncmp(name
,len
,
307 ep
->name
,namelen
))) {
308 if ( isoflags
& directoryBit
)
309 ino
= isodirino(ep
, imp
);
311 ino
= ((daddr_t
)buf_blkno(bp
) << imp
->im_bshift
) + entryoffsetinblock
;
312 saveoffset
= dp
->i_offset
;
313 } else if (imp
->iso_ftype
== ISO_FTYPE_JOLIET
&& !(res
= ucsfncmp((u_int16_t
*)name
, len
,
314 (u_int16_t
*) ep
->name
, namelen
))) {
315 if ( isoflags
& directoryBit
)
316 ino
= isodirino(ep
, imp
);
318 ino
= ((daddr_t
)buf_blkno(bp
) << imp
->im_bshift
) + entryoffsetinblock
;
319 saveoffset
= dp
->i_offset
;
322 #ifdef NOSORTBUG /* On some CDs directory entries are not sorted correctly */
325 else if (res
> 0 && numdirpasses
== 2)
330 dp
->i_offset
+= reclen
;
331 entryoffsetinblock
+= reclen
;
337 if (saveoffset
!= dp
->i_offset
) {
338 if (lblkno(imp
, dp
->i_offset
) !=
339 lblkno(imp
, saveoffset
)) {
342 if ( (error
= cd9660_blkatoff(vdp
, SECTOFF(imp
, saveoffset
), NULL
, &bp
)) )
345 entryoffsetinblock
= saveoffset
& bmask
;
346 ep
= (struct iso_directory_record
*)
347 ((char *)buf_dataptr(bp
) + entryoffsetinblock
);
348 dp
->i_offset
= saveoffset
;
354 * If we started in the middle of the directory and failed
355 * to find our target, we must check the beginning as well.
357 if (numdirpasses
== 2) {
360 endsearch
= dp
->i_diroff
;
367 * Insert name into cache (as non-existent) if appropriate.
369 if (cnp
->cn_flags
& MAKEENTRY
)
370 cache_enter(vdp
, *vpp
, cnp
);
374 if (numdirpasses
== 2)
375 iso_nchstats
.ncs_pass2
++;
378 * Found component in pathname.
379 * If the final component of path name, save information
380 * in the cache as to where the entry was found.
382 if ((flags
& ISLASTCN
) && nameiop
== LOOKUP
)
383 dp
->i_diroff
= dp
->i_offset
;
386 * Step through the translation in the name. We do not `iput' the
387 * directory because we may need it again if a symbolic link
388 * is relative to the current directory. Instead we save it
389 * unlocked as "pdp". We must get the target inode before unlocking
390 * the directory to insure that the inode will not be removed
391 * before we get it. We prevent deadlock by always fetching
392 * inodes from the root, moving down the directory tree. Thus
393 * when following backward pointers ".." we must unlock the
394 * parent directory before getting the requested directory.
395 * There is a potential race condition here if both the current
396 * and parent directories are removed before the `iget' for the
397 * inode associated with ".." returns. We hope that this occurs
398 * infrequently since we cannot avoid this race condition without
399 * implementing a sophisticated deadlock detection algorithm.
400 * Note also that this simple deadlock detection scheme will not
401 * work if the file system has any hard links other than ".."
402 * that point backwards in the directory structure.
406 * If ino is different from dp->i_ino,
407 * it's a relocated directory.
409 if (flags
& ISDOTDOT
) {
410 error
= cd9660_vget_internal(vnode_mount(vdp
), dp
->i_ino
, &tdp
, NULL
, NULL
,
411 dp
->i_ino
!= ino
, ep
, p
);
412 VTOI(tdp
)->i_parent
= VTOI(pdp
)->i_number
;
416 } else if (dp
->i_number
== dp
->i_ino
) {
418 vnode_get(vdp
); /* we want ourself, ie "." */
421 error
= cd9660_vget_internal(vnode_mount(vdp
), dp
->i_ino
, &tdp
, vdp
, cnp
,
422 dp
->i_ino
!= ino
, ep
, p
);
423 /* save parent inode number */
424 VTOI(tdp
)->i_parent
= VTOI(pdp
)->i_number
;
435 * Return buffer with the contents of block "offset" from the beginning of
436 * directory "ip". If "res" is non-zero, fill it in with a pointer to the
437 * remaining space in the directory.
440 cd9660_blkatoff(vnode_t vp
, off_t offset
, char **res
, buf_t
*bpp
)
443 register struct iso_mnt
*imp
;
450 lbn
= lblkno(imp
, offset
);
451 bsize
= blksize(imp
, ip
, lbn
);
453 if ((bsize
!= imp
->im_sector_size
) &&
454 (offset
& (imp
->im_sector_size
- 1)) == 0) {
455 bsize
= imp
->im_sector_size
;
458 if ( (error
= (int)buf_bread(vp
, (daddr64_t
)((unsigned)lbn
), bsize
, NOCRED
, &bp
)) ) {
464 *res
= (char *)buf_dataptr(bp
) + blkoff(imp
, offset
);