![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to hfs_lockf.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Apple XNU] / XNU / bsd / hfs|
Return to hfs_lockf.h CVS log | Up to [Apple XNU] / XNU / bsd / hfs |
1.1 root 1: /*
2: * Copyright (c) 1999 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:
23: /* (c) 1997-1998 Apple Computer, Inc. All Rights Reserved */
24: /*
25: * Copyright (c) 1991, 1993
26: * The Regents of the University of California. All rights reserved.
27: *
28: * This code is derived from software contributed to Berkeley by
29: * Scooter Morris at Genentech Inc.
30: *
31: * Redistribution and use in source and binary forms, with or without
32: * modification, are permitted provided that the following conditions
33: * are met:
34: * 1. Redistributions of source code must retain the above copyright
35: * notice, this list of conditions and the following disclaimer.
36: * 2. Redistributions in binary form must reproduce the above copyright
37: * notice, this list of conditions and the following disclaimer in the
38: * documentation and/or other materials provided with the distribution.
39: * 3. All advertising materials mentioning features or use of this software
40: * must display the following acknowledgement:
41: * This product includes software developed by the University of
42: * California, Berkeley and its contributors.
43: * 4. Neither the name of the University nor the names of its contributors
44: * may be used to endorse or promote products derived from this software
45: * without specific prior written permission.
46: *
47: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
48: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
49: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
50: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
51: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
52: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
53: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
54: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
55: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
56: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
57: * SUCH DAMAGE.
58: *
59: *
60: * @(#)hfs_lockf.h 1.0 5/5/98
61: * derived from @(#)lockf.h 8.2 (Berkeley) 10/26/94
62: */
63:
64: /*
65: * The hfslockf structure is a kernel structure which contains the information
66: * associated with a byte range lock. The hfslockf structures are linked into
67: * the inode structure. Locks are sorted by the starting byte of the lock for
68: * efficiency.
69: */
70: TAILQ_HEAD(locklist, hfslockf);
71:
72: struct hfslockf {
73: short lf_flags; /* Semantics: F_POSIX, F_FLOCK, F_WAIT */
74: short lf_type; /* Lock type: F_RDLCK, F_WRLCK */
75: off_t lf_start; /* Byte # of the start of the lock */
76: off_t lf_end; /* Byte # of the end of the lock (-1=EOF) */
77: caddr_t lf_id; /* Id of the resource holding the lock */
78: struct hfsnode *lf_hfsnode; /* Back pointer to the inode */
79: struct hfslockf *lf_next; /* Pointer to the next lock on this inode */
80: struct locklist lf_blkhd; /* List of requests blocked on this lock */
81: TAILQ_ENTRY(hfslockf) lf_block;/* A request waiting for a lock */
82: };
83:
84: /* Maximum length of sleep chains to traverse to try and detect deadlock. */
85: #define MAXDEPTH 50
86:
87: __BEGIN_DECLS
88: void hfs_addblock __P((struct hfslockf *, struct hfslockf *));
89: int hfs_clearlock __P((struct hfslockf *));
90: int hfs_findoverlap __P((struct hfslockf *,
91: struct hfslockf *, int, struct hfslockf ***, struct hfslockf **));
92: struct hfslockf *
93: hfs_getblock __P((struct hfslockf *));
94: int hfs_getlock __P((struct hfslockf *, struct flock *));
95: int hfs_setlock __P((struct hfslockf *));
96: void hfs_split __P((struct hfslockf *, struct hfslockf *));
97: void hfs_wakelock __P((struct hfslockf *));
98: __END_DECLS
99:
100: #ifdef LOCKF_DEBUG
101: extern int lockf_debug;
102:
103: __BEGIN_DECLS
104: void hfs_lprint __P((char *, struct hfslockf *));
105: void hfs_lprintlist __P((char *, struct hfslockf *));
106: __END_DECLS
107: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.