projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| 15637ed4 RG |
1 | /* |
| 2 | * Copyright (c) 1991 The Regents of the University of California. | |
| 3 | * All rights reserved. | |
| 4 | * | |
| 5 | * This code is derived from software contributed to Berkeley by | |
| 6 | * Scooter Morris at Genentech Inc. | |
| 7 | * | |
| 8 | * Redistribution and use in source and binary forms, with or without | |
| 9 | * modification, are permitted provided that the following conditions | |
| 10 | * are met: | |
| 11 | * 1. Redistributions of source code must retain the above copyright | |
| 12 | * notice, this list of conditions and the following disclaimer. | |
| 13 | * 2. Redistributions in binary form must reproduce the above copyright | |
| 14 | * notice, this list of conditions and the following disclaimer in the | |
| 15 | * documentation and/or other materials provided with the distribution. | |
| 16 | * 3. All advertising materials mentioning features or use of this software | |
| 17 | * must display the following acknowledgement: | |
| 18 | * This product includes software developed by the University of | |
| 19 | * California, Berkeley and its contributors. | |
| 20 | * 4. Neither the name of the University nor the names of its contributors | |
| 21 | * may be used to endorse or promote products derived from this software | |
| 22 | * without specific prior written permission. | |
| 23 | * | |
| 24 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
| 25 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| 27 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
| 28 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
| 29 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
| 30 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
| 31 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
| 32 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
| 33 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
| 34 | * SUCH DAMAGE. | |
| 35 | * | |
| 78ed81a3 | 36 | * from: @(#)lockf.h 7.1 (Berkeley) 2/1/91 |
| 37 | * $Id: lockf.h,v 1.2 1993/10/16 18:17:41 rgrimes Exp $ | |
| 15637ed4 RG |
38 | */ |
| 39 | ||
| 40 | /* | |
| 41 | * The lockf structure is a kernel structure which contains all the | |
| 42 | * information associated with a byte range lock. The lockf structures | |
| 43 | * are linked into the inode structure. Locks are sorted by the starting | |
| 44 | * byte of the lock for efficiency. | |
| 45 | */ | |
| 46 | struct lockf { | |
| 47 | short lf_flags; /* Lock semantics: F_POSIX, F_FLOCK, F_WAIT */ | |
| 48 | short lf_type; /* Lock type: F_RDLCK, F_WRLCK */ | |
| 49 | off_t lf_start; /* The byte # of the start of the lock */ | |
| 50 | off_t lf_end; /* The byte # of the end of the lock (-1=EOF)*/ | |
| 51 | caddr_t lf_id; /* The id of the resource holding the lock */ | |
| 78ed81a3 | 52 | struct lockf **lf_head; /* Back pointer to the head of lockf list */ |
| 15637ed4 RG |
53 | struct lockf *lf_next; /* A pointer to the next lock on this inode */ |
| 54 | struct lockf *lf_block; /* The list of blocked locks */ | |
| 55 | }; | |
| 56 | ||
| 57 | /* | |
| 58 | * Maximum length of sleep chains to traverse to try and detect deadlock. | |
| 59 | */ | |
| 60 | #define MAXDEPTH 50 | |
| 61 | ||
| 62 | #ifdef KERNEL | |
| 63 | /* | |
| 64 | * Public lock manipulation routines | |
| 65 | */ | |
| 66 | extern struct lockf *lf_remove(); /* Remove a lock */ | |
| 67 | extern struct lockf *lf_getblock(); /* Return the first blocking lock */ | |
| 68 | ||
| 69 | #ifdef LOCKF_DEBUG | |
| 70 | extern int lockf_debug; | |
| 71 | #endif LOCKF_DEBUG | |
| 72 | #endif KERNEL |