]> git.saurik.com Git - apple/xnu.git/blame_incremental - bsd/isofs/cd9660/cd9660_lookup.c
xnu-792.25.20.tar.gz
[apple/xnu.git] / bsd / isofs / cd9660 / cd9660_lookup.c
... / ...
CommitLineData
1/*
2 * Copyright (c) 2000-2003 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * The contents of this file constitute Original Code as defined in and
7 * are subject to the Apple Public Source License Version 1.1 (the
8 * "License"). You may not use this file except in compliance with the
9 * License. Please obtain a copy of the License at
10 * http://www.apple.com/publicsource and read it before using this file.
11 *
12 * This Original Code and all software distributed under the License are
13 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17 * License for the specific language governing rights and limitations
18 * under the License.
19 *
20 * @APPLE_LICENSE_HEADER_END@
21 */
22/* $NetBSD: cd9660_lookup.c,v 1.13 1994/12/24 15:30:03 cgd Exp $ */
23
24/*-
25 * Copyright (c) 1989, 1993, 1994
26 * The Regents of the University of California. All rights reserved.
27 *
28 * This code is derived from software contributed to Berkeley
29 * by Pace Willisson (pace@blitz.com). The Rock Ridge Extension
30 * Support code is derived from software contributed to Berkeley
31 * by Atsushi Murai (amurai@spec.co.jp).
32 *
33 * Redistribution and use in source and binary forms, with or without
34 * modification, are permitted provided that the following conditions
35 * are met:
36 * 1. Redistributions of source code must retain the above copyright
37 * notice, this list of conditions and the following disclaimer.
38 * 2. Redistributions in binary form must reproduce the above copyright
39 * notice, this list of conditions and the following disclaimer in the
40 * documentation and/or other materials provided with the distribution.
41 * 3. All advertising materials mentioning features or use of this software
42 * must display the following acknowledgement:
43 * This product includes software developed by the University of
44 * California, Berkeley and its contributors.
45 * 4. Neither the name of the University nor the names of its contributors
46 * may be used to endorse or promote products derived from this software
47 * without specific prior written permission.
48 *
49 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
50 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
53 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59 * SUCH DAMAGE.
60 *
61 * from: @(#)ufs_lookup.c 7.33 (Berkeley) 5/19/91
62 *
63 * @(#)cd9660_lookup.c 8.5 (Berkeley) 12/5/94
64 *
65 */
66
67#include <sys/param.h>
68#include <sys/vnode.h>
69#include <sys/mount.h>
70#include <sys/namei.h>
71#include <sys/buf.h>
72#include <sys/file.h>
73#include <sys/utfconv.h>
74
75#include <isofs/cd9660/iso.h>
76#include <isofs/cd9660/cd9660_node.h>
77#include <isofs/cd9660/iso_rrip.h>
78#include <isofs/cd9660/cd9660_rrip.h>
79
80struct nchstats iso_nchstats;
81
82/*
83 * Convert a component of a pathname into a pointer to a locked inode.
84 * This is a very central and rather complicated routine.
85 * If the file system is not maintained in a strict tree hierarchy,
86 * this can result in a deadlock situation (see comments in code below).
87 *
88 * The flag argument is LOOKUP, CREATE, RENAME, or DELETE depending on
89 * whether the name is to be looked up, created, renamed, or deleted.
90 * When CREATE, RENAME, or DELETE is specified, information usable in
91 * creating, renaming, or deleting a directory entry may be calculated.
92 * If flag has LOCKPARENT or'ed into it and the target of the pathname
93 * exists, lookup returns both the target and its parent directory locked.
94 * When creating or renaming and LOCKPARENT is specified, the target may
95 * not be ".". When deleting and LOCKPARENT is specified, the target may
96 * be "."., but the caller must check to ensure it does an vrele and iput
97 * instead of two iputs.
98 *
99 * Overall outline of ufs_lookup:
100 *
101 * check accessibility of directory
102 * look for name in cache, if found, then if at end of path
103 * and deleting or creating, drop it, else return name
104 * search for name in directory, to found or notfound
105 * notfound:
106 * if creating, return locked directory, leaving info on available slots
107 * else return error
108 * found:
109 * if at end of path and deleting, return information to allow delete
110 * if at end of path and rewriting (RENAME and LOCKPARENT), lock target
111 * inode and return info to allow rewrite
112 * if not at end, add name to cache; if at end and neither creating
113 * nor deleting, add name to cache
114 *
115 * NOTE: (LOOKUP | LOCKPARENT) currently returns the parent inode unlocked.
116 */
117int
118cd9660_lookup(struct vnop_lookup_args *ap)
119{
120 register struct vnode *vdp; /* vnode for directory being searched */
121 register struct iso_node *dp; /* inode for directory being searched */
122 register struct iso_mnt *imp; /* file system that directory is in */
123 struct buf *bp; /* a buffer of directory entries */
124 struct iso_directory_record *ep = NULL;/* the current directory entry */
125 int entryoffsetinblock; /* offset of ep in bp's buffer */
126 int saveoffset = 0; /* offset of last directory entry in dir */
127 int numdirpasses; /* strategy for directory search */
128 doff_t endsearch; /* offset to end directory search */
129 struct vnode *pdp; /* saved dp during symlink work */
130 struct vnode *tdp; /* returned by cd9660_vget_internal */
131 u_long bmask; /* block offset mask */
132 int lockparent; /* 1 => lockparent flag is set */
133 int wantparent; /* 1 => wantparent or lockparent flag */
134 int wantassoc;
135 int error;
136 ino_t ino = 0;
137 int reclen;
138 u_short namelen;
139 int isoflags;
140 char altname[ISO_RRIP_NAMEMAX];
141 int res;
142 int len;
143 char *name;
144 struct vnode **vpp = ap->a_vpp;
145 struct componentname *cnp = ap->a_cnp;
146 int flags = cnp->cn_flags;
147 int nameiop = cnp->cn_nameiop;
148 vfs_context_t ctx = cnp->cn_context;
149 struct proc *p = vfs_context_proc(ctx);
150 size_t altlen;
151
152 bp = NULL;
153 *vpp = NULL;
154 vdp = ap->a_dvp;
155 dp = VTOI(vdp);
156 imp = dp->i_mnt;
157 lockparent = flags & LOCKPARENT;
158 wantparent = flags & (LOCKPARENT|WANTPARENT);
159 wantassoc = 0;
160
161
162 /*
163 * We now have a segment name to search for, and a directory to search.
164 *
165 * Before tediously performing a linear scan of the directory,
166 * check the name cache to see if the directory/name pair
167 * we are looking for is known already.
168 */
169 if ((error = cache_lookup(vdp, vpp, cnp))) {
170 if (error == ENOENT)
171 return (error);
172 return (0);
173 }
174
175 len = cnp->cn_namelen;
176 name = cnp->cn_nameptr;
177 altname[0] = '\0';
178 /*
179 * A "._" prefix means, we are looking for an associated file
180 */
181 if (imp->iso_ftype != ISO_FTYPE_RRIP &&
182 *name == ASSOCCHAR1 && *(name+1) == ASSOCCHAR2) {
183 wantassoc = 1;
184 len -= 2;
185 name += 2;
186 }
187 /*
188 * Decode search name into UCS-2 (Unicode)
189 */
190 if ((imp->iso_ftype == ISO_FTYPE_JOLIET) &&
191 !((len == 1 && *name == '.') || (flags & ISDOTDOT))) {
192 int flags1 = UTF_PRECOMPOSED;
193
194 (void) utf8_decodestr(name, len, (u_int16_t*) altname, &altlen,
195 sizeof(altname), 0, flags1);
196 name = altname;
197 len = altlen;
198 }
199 /*
200 * If there is cached information on a previous search of
201 * this directory, pick up where we last left off.
202 * We cache only lookups as these are the most common
203 * and have the greatest payoff. Caching CREATE has little
204 * benefit as it usually must search the entire directory
205 * to determine that the entry does not exist. Caching the
206 * location of the last DELETE or RENAME has not reduced
207 * profiling time and hence has been removed in the interest
208 * of simplicity.
209 */
210 bmask = imp->im_sector_size - 1;
211 if (nameiop != LOOKUP || dp->i_diroff == 0 ||
212 dp->i_diroff > dp->i_size) {
213 entryoffsetinblock = 0;
214 dp->i_offset = 0;
215 numdirpasses = 1;
216 } else {
217 dp->i_offset = dp->i_diroff;
218
219 if ((entryoffsetinblock = dp->i_offset & bmask) &&
220 (error = cd9660_blkatoff(vdp, SECTOFF(imp, dp->i_offset), NULL, &bp)))
221 return (error);
222 numdirpasses = 2;
223 iso_nchstats.ncs_2passes++;
224 }
225 endsearch = dp->i_size;
226
227searchloop:
228 while (dp->i_offset < endsearch) {
229 /*
230 * If offset is on a block boundary,
231 * read the next directory block.
232 * Release previous if it exists.
233 */
234 if ((dp->i_offset & bmask) == 0) {
235 if (bp != NULL)
236 buf_brelse(bp);
237 if ( (error = cd9660_blkatoff(vdp, SECTOFF(imp,dp->i_offset), NULL, &bp)) )
238 return (error);
239 entryoffsetinblock = 0;
240 }
241 /*
242 * Get pointer to next entry.
243 */
244 ep = (struct iso_directory_record *)
245 ((char *)buf_dataptr(bp) + entryoffsetinblock);
246
247 reclen = isonum_711(ep->length);
248 if (reclen == 0) {
249 /* skip to next block, if any */
250 dp->i_offset =
251 (dp->i_offset & ~bmask) + imp->im_sector_size;
252 continue;
253 }
254
255 if (reclen < ISO_DIRECTORY_RECORD_SIZE) {
256 /* illegal entry, stop */
257 break;
258 }
259 if (entryoffsetinblock + reclen > imp->im_sector_size) {
260 /* entries are not allowed to cross sector boundaries */
261 break;
262 }
263 namelen = isonum_711(ep->name_len);
264 isoflags = isonum_711(ep->flags);
265
266 if (reclen < ISO_DIRECTORY_RECORD_SIZE + namelen)
267 /* illegal entry, stop */
268 break;
269 /*
270 * Check for a name match.
271 */
272 if (imp->iso_ftype == ISO_FTYPE_RRIP) {
273 if (isoflags & directoryBit)
274 ino = isodirino(ep, imp);
275 else
276 ino = ((daddr_t)buf_blkno(bp) << imp->im_bshift) + entryoffsetinblock;
277 dp->i_ino = ino;
278 cd9660_rrip_getname(ep,altname,&namelen,&dp->i_ino,imp);
279 if (namelen == cnp->cn_namelen
280 && !bcmp(name,altname,namelen))
281 goto found;
282 ino = 0;
283 } else {
284 if ((!(isoflags & associatedBit)) == !wantassoc) {
285 if ((len == 1
286 && *name == '.')
287 || (flags & ISDOTDOT)) {
288 if (namelen == 1
289 && ep->name[0] == ((flags & ISDOTDOT) ? 1 : 0)) {
290 /*
291 * Save directory entry's inode number and
292 * release directory buffer.
293 */
294 dp->i_ino = isodirino(ep, imp);
295 goto found;
296 }
297 if (namelen != 1
298 || ep->name[0] != 0)
299 goto notfound;
300 } else if (imp->iso_ftype != ISO_FTYPE_JOLIET && !(res = isofncmp(name,len,
301 ep->name,namelen))) {
302 if ( isoflags & directoryBit )
303 ino = isodirino(ep, imp);
304 else
305 ino = ((daddr_t)buf_blkno(bp) << imp->im_bshift) + entryoffsetinblock;
306 saveoffset = dp->i_offset;
307 } else if (imp->iso_ftype == ISO_FTYPE_JOLIET && !(res = ucsfncmp((u_int16_t*)name, len,
308 (u_int16_t*) ep->name, namelen))) {
309 if ( isoflags & directoryBit )
310 ino = isodirino(ep, imp);
311 else
312 ino = ((daddr_t)buf_blkno(bp) << imp->im_bshift) + entryoffsetinblock;
313 saveoffset = dp->i_offset;
314 } else if (ino)
315 goto foundino;
316#ifdef NOSORTBUG /* On some CDs directory entries are not sorted correctly */
317 else if (res < 0)
318 goto notfound;
319 else if (res > 0 && numdirpasses == 2)
320 numdirpasses++;
321#endif
322 }
323 }
324 dp->i_offset += reclen;
325 entryoffsetinblock += reclen;
326 } /* endwhile */
327
328 if (ino) {
329foundino:
330 dp->i_ino = ino;
331 if (saveoffset != dp->i_offset) {
332 if (lblkno(imp, dp->i_offset) !=
333 lblkno(imp, saveoffset)) {
334 if (bp != NULL)
335 buf_brelse(bp);
336 if ( (error = cd9660_blkatoff(vdp, SECTOFF(imp, saveoffset), NULL, &bp)) )
337 return (error);
338 }
339 entryoffsetinblock = saveoffset & bmask;
340 ep = (struct iso_directory_record *)
341 ((char *)buf_dataptr(bp) + entryoffsetinblock);
342 dp->i_offset = saveoffset;
343 }
344 goto found;
345 }
346notfound:
347 /*
348 * If we started in the middle of the directory and failed
349 * to find our target, we must check the beginning as well.
350 */
351 if (numdirpasses == 2) {
352 numdirpasses--;
353 dp->i_offset = 0;
354 endsearch = dp->i_diroff;
355 goto searchloop;
356 }
357 if (bp != NULL)
358 buf_brelse(bp);
359
360 /*
361 * Insert name into cache (as non-existent) if appropriate.
362 */
363 if (cnp->cn_flags & MAKEENTRY)
364 cache_enter(vdp, *vpp, cnp);
365 return (ENOENT);
366
367found:
368 if (numdirpasses == 2)
369 iso_nchstats.ncs_pass2++;
370
371 /*
372 * Found component in pathname.
373 * If the final component of path name, save information
374 * in the cache as to where the entry was found.
375 */
376 if ((flags & ISLASTCN) && nameiop == LOOKUP)
377 dp->i_diroff = dp->i_offset;
378
379 /*
380 * Step through the translation in the name. We do not `iput' the
381 * directory because we may need it again if a symbolic link
382 * is relative to the current directory. Instead we save it
383 * unlocked as "pdp". We must get the target inode before unlocking
384 * the directory to insure that the inode will not be removed
385 * before we get it. We prevent deadlock by always fetching
386 * inodes from the root, moving down the directory tree. Thus
387 * when following backward pointers ".." we must unlock the
388 * parent directory before getting the requested directory.
389 * There is a potential race condition here if both the current
390 * and parent directories are removed before the `iget' for the
391 * inode associated with ".." returns. We hope that this occurs
392 * infrequently since we cannot avoid this race condition without
393 * implementing a sophisticated deadlock detection algorithm.
394 * Note also that this simple deadlock detection scheme will not
395 * work if the file system has any hard links other than ".."
396 * that point backwards in the directory structure.
397 */
398 pdp = vdp;
399 /*
400 * If ino is different from dp->i_ino,
401 * it's a relocated directory.
402 */
403 if (flags & ISDOTDOT) {
404 error = cd9660_vget_internal(vnode_mount(vdp), dp->i_ino, &tdp, NULL, NULL,
405 dp->i_ino != ino, ep, p);
406 VTOI(tdp)->i_parent = VTOI(pdp)->i_number;
407 buf_brelse(bp);
408
409 *vpp = tdp;
410 } else if (dp->i_number == dp->i_ino) {
411 buf_brelse(bp);
412 vnode_get(vdp); /* we want ourself, ie "." */
413 *vpp = vdp;
414 } else {
415 error = cd9660_vget_internal(vnode_mount(vdp), dp->i_ino, &tdp, vdp, cnp,
416 dp->i_ino != ino, ep, p);
417 /* save parent inode number */
418 VTOI(tdp)->i_parent = VTOI(pdp)->i_number;
419 buf_brelse(bp);
420 if (error)
421 return (error);
422 *vpp = tdp;
423 }
424 return (0);
425}
426
427
428/*
429 * Return buffer with the contents of block "offset" from the beginning of
430 * directory "ip". If "res" is non-zero, fill it in with a pointer to the
431 * remaining space in the directory.
432 */
433int
434cd9660_blkatoff(vnode_t vp, off_t offset, char **res, buf_t *bpp)
435{
436 struct iso_node *ip;
437 register struct iso_mnt *imp;
438 buf_t bp;
439 daddr_t lbn;
440 int bsize, error;
441
442 ip = VTOI(vp);
443 imp = ip->i_mnt;
444 lbn = lblkno(imp, offset);
445 bsize = blksize(imp, ip, lbn);
446
447 if ((bsize != imp->im_sector_size) &&
448 (offset & (imp->im_sector_size - 1)) == 0) {
449 bsize = imp->im_sector_size;
450 }
451
452 if ( (error = (int)buf_bread(vp, (daddr64_t)((unsigned)lbn), bsize, NOCRED, &bp)) ) {
453 buf_brelse(bp);
454 *bpp = NULL;
455 return (error);
456 }
457 if (res)
458 *res = (char *)buf_dataptr(bp) + blkoff(imp, offset);
459 *bpp = bp;
460
461 return (0);
462}