]> git.saurik.com Git - apple/xnu.git/blob - bsd/isofs/cd9660/cd9660_lookup.c
970f2531f4bc6134893155d6e062eb42e4eb5a50
[apple/xnu.git] / bsd / isofs / cd9660 / cd9660_lookup.c
1 /*
2 * Copyright (c) 2000-2003 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
5 *
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.
14 *
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
17 *
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.
25 *
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
27 */
28 /* $NetBSD: cd9660_lookup.c,v 1.13 1994/12/24 15:30:03 cgd Exp $ */
29
30 /*-
31 * Copyright (c) 1989, 1993, 1994
32 * The Regents of the University of California. All rights reserved.
33 *
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).
38 *
39 * Redistribution and use in source and binary forms, with or without
40 * modification, are permitted provided that the following conditions
41 * are met:
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.
54 *
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
65 * SUCH DAMAGE.
66 *
67 * from: @(#)ufs_lookup.c 7.33 (Berkeley) 5/19/91
68 *
69 * @(#)cd9660_lookup.c 8.5 (Berkeley) 12/5/94
70 *
71 */
72
73 #include <sys/param.h>
74 #include <sys/vnode.h>
75 #include <sys/mount.h>
76 #include <sys/namei.h>
77 #include <sys/buf.h>
78 #include <sys/file.h>
79 #include <sys/utfconv.h>
80
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>
85
86 struct nchstats iso_nchstats;
87
88 /*
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).
93 *
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.
104 *
105 * Overall outline of ufs_lookup:
106 *
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
111 * notfound:
112 * if creating, return locked directory, leaving info on available slots
113 * else return error
114 * found:
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
120 *
121 * NOTE: (LOOKUP | LOCKPARENT) currently returns the parent inode unlocked.
122 */
123 int
124 cd9660_lookup(struct vnop_lookup_args *ap)
125 {
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 */
140 int wantassoc;
141 int error;
142 ino_t ino = 0;
143 int reclen;
144 u_short namelen;
145 int isoflags;
146 char altname[ISO_RRIP_NAMEMAX];
147 int res;
148 int len;
149 char *name;
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);
156 size_t altlen;
157
158 bp = NULL;
159 *vpp = NULL;
160 vdp = ap->a_dvp;
161 dp = VTOI(vdp);
162 imp = dp->i_mnt;
163 lockparent = flags & LOCKPARENT;
164 wantparent = flags & (LOCKPARENT|WANTPARENT);
165 wantassoc = 0;
166
167
168 /*
169 * We now have a segment name to search for, and a directory to search.
170 *
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.
174 */
175 if ((error = cache_lookup(vdp, vpp, cnp))) {
176 if (error == ENOENT)
177 return (error);
178 return (0);
179 }
180
181 len = cnp->cn_namelen;
182 name = cnp->cn_nameptr;
183 altname[0] = '\0';
184 /*
185 * A "._" prefix means, we are looking for an associated file
186 */
187 if (imp->iso_ftype != ISO_FTYPE_RRIP &&
188 *name == ASSOCCHAR1 && *(name+1) == ASSOCCHAR2) {
189 wantassoc = 1;
190 len -= 2;
191 name += 2;
192 }
193 /*
194 * Decode search name into UCS-2 (Unicode)
195 */
196 if ((imp->iso_ftype == ISO_FTYPE_JOLIET) &&
197 !((len == 1 && *name == '.') || (flags & ISDOTDOT))) {
198 int flags1 = UTF_PRECOMPOSED;
199
200 if (BYTE_ORDER != BIG_ENDIAN)
201 flags1 |= UTF_REVERSE_ENDIAN;
202
203 (void) utf8_decodestr(name, len, (u_int16_t*) altname, &altlen,
204 sizeof(altname), 0, flags1);
205 name = altname;
206 len = altlen;
207 }
208 /*
209 * If there is cached information on a previous search of
210 * this directory, pick up where we last left off.
211 * We cache only lookups as these are the most common
212 * and have the greatest payoff. Caching CREATE has little
213 * benefit as it usually must search the entire directory
214 * to determine that the entry does not exist. Caching the
215 * location of the last DELETE or RENAME has not reduced
216 * profiling time and hence has been removed in the interest
217 * of simplicity.
218 */
219 bmask = imp->im_sector_size - 1;
220 if (nameiop != LOOKUP || dp->i_diroff == 0 ||
221 dp->i_diroff > dp->i_size) {
222 entryoffsetinblock = 0;
223 dp->i_offset = 0;
224 numdirpasses = 1;
225 } else {
226 dp->i_offset = dp->i_diroff;
227
228 if ((entryoffsetinblock = dp->i_offset & bmask) &&
229 (error = cd9660_blkatoff(vdp, SECTOFF(imp, dp->i_offset), NULL, &bp)))
230 return (error);
231 numdirpasses = 2;
232 iso_nchstats.ncs_2passes++;
233 }
234 endsearch = dp->i_size;
235
236 searchloop:
237 while (dp->i_offset < endsearch) {
238 /*
239 * If offset is on a block boundary,
240 * read the next directory block.
241 * Release previous if it exists.
242 */
243 if ((dp->i_offset & bmask) == 0) {
244 if (bp != NULL)
245 buf_brelse(bp);
246 if ( (error = cd9660_blkatoff(vdp, SECTOFF(imp,dp->i_offset), NULL, &bp)) )
247 return (error);
248 entryoffsetinblock = 0;
249 }
250 /*
251 * Get pointer to next entry.
252 */
253 ep = (struct iso_directory_record *)
254 ((char *)buf_dataptr(bp) + entryoffsetinblock);
255
256 reclen = isonum_711(ep->length);
257 if (reclen == 0) {
258 /* skip to next block, if any */
259 dp->i_offset =
260 (dp->i_offset & ~bmask) + imp->im_sector_size;
261 continue;
262 }
263
264 if (reclen < ISO_DIRECTORY_RECORD_SIZE) {
265 /* illegal entry, stop */
266 break;
267 }
268 if (entryoffsetinblock + reclen > imp->im_sector_size) {
269 /* entries are not allowed to cross sector boundaries */
270 break;
271 }
272 namelen = isonum_711(ep->name_len);
273 isoflags = isonum_711(ep->flags);
274
275 if (reclen < ISO_DIRECTORY_RECORD_SIZE + namelen)
276 /* illegal entry, stop */
277 break;
278 /*
279 * Check for a name match.
280 */
281 if (imp->iso_ftype == ISO_FTYPE_RRIP) {
282 if (isoflags & directoryBit)
283 ino = isodirino(ep, imp);
284 else
285 ino = ((daddr_t)buf_blkno(bp) << imp->im_bshift) + entryoffsetinblock;
286 dp->i_ino = ino;
287 cd9660_rrip_getname(ep,altname,&namelen,&dp->i_ino,imp);
288 if (namelen == cnp->cn_namelen
289 && !bcmp(name,altname,namelen))
290 goto found;
291 ino = 0;
292 } else {
293 if ((!(isoflags & associatedBit)) == !wantassoc) {
294 if ((len == 1
295 && *name == '.')
296 || (flags & ISDOTDOT)) {
297 if (namelen == 1
298 && ep->name[0] == ((flags & ISDOTDOT) ? 1 : 0)) {
299 /*
300 * Save directory entry's inode number and
301 * release directory buffer.
302 */
303 dp->i_ino = isodirino(ep, imp);
304 goto found;
305 }
306 if (namelen != 1
307 || ep->name[0] != 0)
308 goto notfound;
309 } else if (imp->iso_ftype != ISO_FTYPE_JOLIET && !(res = isofncmp(name,len,
310 ep->name,namelen))) {
311 if ( isoflags & directoryBit )
312 ino = isodirino(ep, imp);
313 else
314 ino = ((daddr_t)buf_blkno(bp) << imp->im_bshift) + entryoffsetinblock;
315 saveoffset = dp->i_offset;
316 } else if (imp->iso_ftype == ISO_FTYPE_JOLIET && !(res = ucsfncmp((u_int16_t*)name, len,
317 (u_int16_t*) ep->name, namelen))) {
318 if ( isoflags & directoryBit )
319 ino = isodirino(ep, imp);
320 else
321 ino = ((daddr_t)buf_blkno(bp) << imp->im_bshift) + entryoffsetinblock;
322 saveoffset = dp->i_offset;
323 } else if (ino)
324 goto foundino;
325 #ifdef NOSORTBUG /* On some CDs directory entries are not sorted correctly */
326 else if (res < 0)
327 goto notfound;
328 else if (res > 0 && numdirpasses == 2)
329 numdirpasses++;
330 #endif
331 }
332 }
333 dp->i_offset += reclen;
334 entryoffsetinblock += reclen;
335 } /* endwhile */
336
337 if (ino) {
338 foundino:
339 dp->i_ino = ino;
340 if (saveoffset != dp->i_offset) {
341 if (lblkno(imp, dp->i_offset) !=
342 lblkno(imp, saveoffset)) {
343 if (bp != NULL)
344 buf_brelse(bp);
345 if ( (error = cd9660_blkatoff(vdp, SECTOFF(imp, saveoffset), NULL, &bp)) )
346 return (error);
347 }
348 entryoffsetinblock = saveoffset & bmask;
349 ep = (struct iso_directory_record *)
350 ((char *)buf_dataptr(bp) + entryoffsetinblock);
351 dp->i_offset = saveoffset;
352 }
353 goto found;
354 }
355 notfound:
356 /*
357 * If we started in the middle of the directory and failed
358 * to find our target, we must check the beginning as well.
359 */
360 if (numdirpasses == 2) {
361 numdirpasses--;
362 dp->i_offset = 0;
363 endsearch = dp->i_diroff;
364 goto searchloop;
365 }
366 if (bp != NULL)
367 buf_brelse(bp);
368
369 /*
370 * Insert name into cache (as non-existent) if appropriate.
371 */
372 if (cnp->cn_flags & MAKEENTRY)
373 cache_enter(vdp, *vpp, cnp);
374 return (ENOENT);
375
376 found:
377 if (numdirpasses == 2)
378 iso_nchstats.ncs_pass2++;
379
380 /*
381 * Found component in pathname.
382 * If the final component of path name, save information
383 * in the cache as to where the entry was found.
384 */
385 if ((flags & ISLASTCN) && nameiop == LOOKUP)
386 dp->i_diroff = dp->i_offset;
387
388 /*
389 * Step through the translation in the name. We do not `iput' the
390 * directory because we may need it again if a symbolic link
391 * is relative to the current directory. Instead we save it
392 * unlocked as "pdp". We must get the target inode before unlocking
393 * the directory to insure that the inode will not be removed
394 * before we get it. We prevent deadlock by always fetching
395 * inodes from the root, moving down the directory tree. Thus
396 * when following backward pointers ".." we must unlock the
397 * parent directory before getting the requested directory.
398 * There is a potential race condition here if both the current
399 * and parent directories are removed before the `iget' for the
400 * inode associated with ".." returns. We hope that this occurs
401 * infrequently since we cannot avoid this race condition without
402 * implementing a sophisticated deadlock detection algorithm.
403 * Note also that this simple deadlock detection scheme will not
404 * work if the file system has any hard links other than ".."
405 * that point backwards in the directory structure.
406 */
407 pdp = vdp;
408 /*
409 * If ino is different from dp->i_ino,
410 * it's a relocated directory.
411 */
412 if (flags & ISDOTDOT) {
413 error = cd9660_vget_internal(vnode_mount(vdp), dp->i_ino, &tdp, NULL, NULL,
414 dp->i_ino != ino, ep, p);
415 VTOI(tdp)->i_parent = VTOI(pdp)->i_number;
416 buf_brelse(bp);
417
418 *vpp = tdp;
419 } else if (dp->i_number == dp->i_ino) {
420 buf_brelse(bp);
421 vnode_get(vdp); /* we want ourself, ie "." */
422 *vpp = vdp;
423 } else {
424 error = cd9660_vget_internal(vnode_mount(vdp), dp->i_ino, &tdp, vdp, cnp,
425 dp->i_ino != ino, ep, p);
426 /* save parent inode number */
427 VTOI(tdp)->i_parent = VTOI(pdp)->i_number;
428 buf_brelse(bp);
429 if (error)
430 return (error);
431 *vpp = tdp;
432 }
433 return (0);
434 }
435
436
437 /*
438 * Return buffer with the contents of block "offset" from the beginning of
439 * directory "ip". If "res" is non-zero, fill it in with a pointer to the
440 * remaining space in the directory.
441 */
442 int
443 cd9660_blkatoff(vnode_t vp, off_t offset, char **res, buf_t *bpp)
444 {
445 struct iso_node *ip;
446 register struct iso_mnt *imp;
447 buf_t bp;
448 daddr_t lbn;
449 int bsize, error;
450
451 ip = VTOI(vp);
452 imp = ip->i_mnt;
453 lbn = lblkno(imp, offset);
454 bsize = blksize(imp, ip, lbn);
455
456 if ((bsize != imp->im_sector_size) &&
457 (offset & (imp->im_sector_size - 1)) == 0) {
458 bsize = imp->im_sector_size;
459 }
460
461 if ( (error = (int)buf_bread(vp, (daddr64_t)((unsigned)lbn), bsize, NOCRED, &bp)) ) {
462 buf_brelse(bp);
463 *bpp = NULL;
464 return (error);
465 }
466 if (res)
467 *res = (char *)buf_dataptr(bp) + blkoff(imp, offset);
468 *bpp = bp;
469
470 return (0);
471 }