|
|
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: /* Copyright (c) 1995 NeXT 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: * @(#)lockf.h 8.2 (Berkeley) 10/26/94
62: */
63:
64: #ifndef _SYS_LOCKF_H_
65: #define _SYS_LOCKF_H_
66:
67: /*
68: * The lockf structure is a kernel structure which contains the information
69: * associated with a byte range lock. The lockf structures are linked into
70: * the inode structure. Locks are sorted by the starting byte of the lock for
71: * efficiency.
72: */
73: struct lockf {
74: short lf_flags; /* Lock semantics: F_POSIX, F_FLOCK, F_WAIT */
75: short lf_type; /* Lock type: F_RDLCK, F_WRLCK */
76: off_t lf_start; /* The byte # of the start of the lock */
77: off_t lf_end; /* The byte # of the end of the lock (-1=EOF)*/
78: caddr_t lf_id; /* The id of the resource holding the lock */
79: struct lockf **lf_head; /* Back pointer to the head of lockf list */
80: struct lockf *lf_next; /* A pointer to the next lock on this inode */
81: struct lockf *lf_block; /* The list of blocked locks */
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 lf_addblock __P((struct lockf *, struct lockf *));
89: int lf_advlock __P((struct lockf **,
90: off_t, caddr_t, int, struct flock *, int));
91: int lf_clearlock __P((struct lockf *));
92: int lf_findoverlap __P((struct lockf *,
93: struct lockf *, int, struct lockf ***, struct lockf **));
94: struct lockf *
95: lf_getblock __P((struct lockf *));
96: int lf_getlock __P((struct lockf *, struct flock *));
97: int lf_setlock __P((struct lockf *));
98: void lf_split __P((struct lockf *, struct lockf *));
99: void lf_wakelock __P((struct lockf *));
100: __END_DECLS
101:
102: #if LOCKF_DEBUG
103: extern int lockf_debug;
104:
105: __BEGIN_DECLS
106: void lf_print __P((char *, struct lockf *));
107: void lf_printlist __P((char *, struct lockf *));
108: __END_DECLS
109: #endif /* LOCKF_DEBUG */
110: #endif /* !_SYS_LOCKF_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.