![[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 Darwin 0.x] / kernel / bsd / hfs|
Return to hfs_lockf.h CVS log | Up to [Apple Darwin 0.x] / kernel / bsd / hfs |
1.1 root 1: /*
2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7: * Reserved. This file contains Original Code and/or Modifications of
8: * Original Code as defined in and that are subject to the Apple Public
9: * Source License Version 1.1 (the "License"). You may not use this file
10: * except in compliance with the License. Please obtain a copy of the
11: * License at http://www.apple.com/publicsource and read it before using
12: * this file.
13: *
14: * The Original Code and all software distributed under the License are
15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
19: * License for the specific language governing rights and limitations
20: * under the License.
21: *
22: * @APPLE_LICENSE_HEADER_END@
23: */
24:
25: /* (c) 1997-1998 Apple Computer, Inc. All Rights Reserved */
26: /*
27: * Copyright (c) 1991, 1993
28: * The Regents of the University of California. All rights reserved.
29: *
30: * This code is derived from software contributed to Berkeley by
31: * Scooter Morris at Genentech Inc.
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: *
62: * @(#)hfs_lockf.h 1.0 5/5/98
63: * derived from @(#)lockf.h 8.2 (Berkeley) 10/26/94
64: */
65:
66: /*
67: * The hfslockf structure is a kernel structure which contains the information
68: * associated with a byte range lock. The hfslockf structures are linked into
69: * the inode structure. Locks are sorted by the starting byte of the lock for
70: * efficiency.
71: */
72: TAILQ_HEAD(locklist, hfslockf);
73:
74: struct hfslockf {
75: short lf_flags; /* Semantics: F_POSIX, F_FLOCK, F_WAIT */
76: short lf_type; /* Lock type: F_RDLCK, F_WRLCK */
77: off_t lf_start; /* Byte # of the start of the lock */
78: off_t lf_end; /* Byte # of the end of the lock (-1=EOF) */
79: caddr_t lf_id; /* Id of the resource holding the lock */
80: struct hfsnode *lf_hfsnode; /* Back pointer to the inode */
81: struct hfslockf *lf_next; /* Pointer to the next lock on this inode */
82: struct locklist lf_blkhd; /* List of requests blocked on this lock */
83: TAILQ_ENTRY(hfslockf) lf_block;/* A request waiting for a lock */
84: };
85:
86: /* Maximum length of sleep chains to traverse to try and detect deadlock. */
87: #define MAXDEPTH 50
88:
89: __BEGIN_DECLS
90: void hfs_addblock __P((struct hfslockf *, struct hfslockf *));
91: int hfs_clearlock __P((struct hfslockf *));
92: int hfs_findoverlap __P((struct hfslockf *,
93: struct hfslockf *, int, struct hfslockf ***, struct hfslockf **));
94: struct hfslockf *
95: hfs_getblock __P((struct hfslockf *));
96: int hfs_getlock __P((struct hfslockf *, struct flock *));
97: int hfs_setlock __P((struct hfslockf *));
98: void hfs_split __P((struct hfslockf *, struct hfslockf *));
99: void hfs_wakelock __P((struct hfslockf *));
100: __END_DECLS
101:
102: #ifdef LOCKF_DEBUG
103: extern int lockf_debug;
104:
105: __BEGIN_DECLS
106: void hfs_lprint __P((char *, struct hfslockf *));
107: void hfs_lprintlist __P((char *, struct hfslockf *));
108: __END_DECLS
109: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.