| @@ -1,14 +1,14 @@ | | | @@ -1,14 +1,14 @@ |
| 1 | /* $NetBSD: dir.h,v 1.20 2005/12/11 12:25:28 christos Exp $ */ | | 1 | /* $NetBSD: dir.h,v 1.21 2009/07/22 04:49:19 dholland Exp $ */ |
| 2 | | | 2 | |
| 3 | /* | | 3 | /* |
| 4 | * Copyright (c) 1982, 1986, 1989, 1993 | | 4 | * Copyright (c) 1982, 1986, 1989, 1993 |
| 5 | * The Regents of the University of California. All rights reserved. | | 5 | * The Regents of the University of California. All rights reserved. |
| 6 | * (c) UNIX System Laboratories, Inc. | | 6 | * (c) UNIX System Laboratories, Inc. |
| 7 | * All or some portions of this file are derived from material licensed | | 7 | * All or some portions of this file are derived from material licensed |
| 8 | * to the University of California by American Telephone and Telegraph | | 8 | * to the University of California by American Telephone and Telegraph |
| 9 | * Co. or Unix System Laboratories, Inc. and are reproduced herein with | | 9 | * Co. or Unix System Laboratories, Inc. and are reproduced herein with |
| 10 | * the permission of UNIX System Laboratories, Inc. | | 10 | * the permission of UNIX System Laboratories, Inc. |
| 11 | * | | 11 | * |
| 12 | * Redistribution and use in source and binary forms, with or without | | 12 | * Redistribution and use in source and binary forms, with or without |
| 13 | * modification, are permitted provided that the following conditions | | 13 | * modification, are permitted provided that the following conditions |
| 14 | * are met: | | 14 | * are met: |
| @@ -30,27 +30,27 @@ | | | @@ -30,27 +30,27 @@ |
| 30 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | | 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 | | 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 | | 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 | | 33 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 34 | * SUCH DAMAGE. | | 34 | * SUCH DAMAGE. |
| 35 | * | | 35 | * |
| 36 | * @(#)dir.h 8.5 (Berkeley) 4/27/95 | | 36 | * @(#)dir.h 8.5 (Berkeley) 4/27/95 |
| 37 | */ | | 37 | */ |
| 38 | | | 38 | |
| 39 | #ifndef _UFS_UFS_DIR_H_ | | 39 | #ifndef _UFS_UFS_DIR_H_ |
| 40 | #define _UFS_UFS_DIR_H_ | | 40 | #define _UFS_UFS_DIR_H_ |
| 41 | | | 41 | |
| 42 | /* | | 42 | /* |
| 43 | * Theoretically, directories can be more than 2Gb in length, however, in | | 43 | * Theoretically, directories can be more than 2Gb in length; however, in |
| 44 | * practice this seems unlikely. So, we define the type doff_t as a 32-bit | | 44 | * practice this seems unlikely. So, we define the type doff_t as a 32-bit |
| 45 | * quantity to keep down the cost of doing lookup on a 32-bit machine. | | 45 | * quantity to keep down the cost of doing lookup on a 32-bit machine. |
| 46 | */ | | 46 | */ |
| 47 | #define doff_t int32_t | | 47 | #define doff_t int32_t |
| 48 | #define MAXDIRSIZE (0x7fffffff) | | 48 | #define MAXDIRSIZE (0x7fffffff) |
| 49 | | | 49 | |
| 50 | /* | | 50 | /* |
| 51 | * A directory consists of some number of blocks of DIRBLKSIZ | | 51 | * A directory consists of some number of blocks of DIRBLKSIZ |
| 52 | * bytes, where DIRBLKSIZ is chosen such that it can be transferred | | 52 | * bytes, where DIRBLKSIZ is chosen such that it can be transferred |
| 53 | * to disk in a single atomic operation (e.g. 512 bytes on most machines). | | 53 | * to disk in a single atomic operation (e.g. 512 bytes on most machines). |
| 54 | * | | 54 | * |
| 55 | * Each DIRBLKSIZ byte block contains some number of directory entry | | 55 | * Each DIRBLKSIZ byte block contains some number of directory entry |
| 56 | * structures, which are of variable length. Each directory entry has | | 56 | * structures, which are of variable length. Each directory entry has |