|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 2000 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: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */ ! 23: /* ! 24: * Copyright (c) 1989, 1993 ! 25: * The Regents of the University of California. All rights reserved. ! 26: * ! 27: * This code is derived from software contributed to Berkeley by ! 28: * Rick Macklem at The University of Guelph. ! 29: * ! 30: * Redistribution and use in source and binary forms, with or without ! 31: * modification, are permitted provided that the following conditions ! 32: * are met: ! 33: * 1. Redistributions of source code must retain the above copyright ! 34: * notice, this list of conditions and the following disclaimer. ! 35: * 2. Redistributions in binary form must reproduce the above copyright ! 36: * notice, this list of conditions and the following disclaimer in the ! 37: * documentation and/or other materials provided with the distribution. ! 38: * 3. All advertising materials mentioning features or use of this software ! 39: * must display the following acknowledgement: ! 40: * This product includes software developed by the University of ! 41: * California, Berkeley and its contributors. ! 42: * 4. Neither the name of the University nor the names of its contributors ! 43: * may be used to endorse or promote products derived from this software ! 44: * without specific prior written permission. ! 45: * ! 46: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ! 47: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE ! 48: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ! 49: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE ! 50: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL ! 51: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS ! 52: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ! 53: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT ! 54: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY ! 55: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF ! 56: * SUCH DAMAGE. ! 57: * ! 58: * @(#)rpcv2.h 8.2 (Berkeley) 3/30/95 ! 59: * FreeBSD-Id: rpcv2.h,v 1.8 1997/05/11 18:05:39 tegge Exp $ ! 60: */ ! 61: ! 62: ! 63: #ifndef _NFS_RPCV2_H_ ! 64: #define _NFS_RPCV2_H_ ! 65: ! 66: /* ! 67: * Definitions for Sun RPC Version 2, from ! 68: * "RPC: Remote Procedure Call Protocol Specification" RFC1057 ! 69: */ ! 70: ! 71: /* Version # */ ! 72: #define RPC_VER2 2 ! 73: ! 74: /* Authentication */ ! 75: #define RPCAUTH_NULL 0 ! 76: #define RPCAUTH_UNIX 1 ! 77: #define RPCAUTH_SHORT 2 ! 78: #define RPCAUTH_KERB4 4 ! 79: #define RPCAUTH_NQNFS 300000 ! 80: #define RPCAUTH_MAXSIZ 400 ! 81: #define RPCVERF_MAXSIZ 12 /* For Kerb, can actually be 400 */ ! 82: #define RPCAUTH_UNIXGIDS 16 ! 83: ! 84: /* ! 85: * Constants associated with authentication flavours. ! 86: */ ! 87: #define RPCAKN_FULLNAME 0 ! 88: #define RPCAKN_NICKNAME 1 ! 89: ! 90: /* Rpc Constants */ ! 91: #define RPC_CALL 0 ! 92: #define RPC_REPLY 1 ! 93: #define RPC_MSGACCEPTED 0 ! 94: #define RPC_MSGDENIED 1 ! 95: #define RPC_PROGUNAVAIL 1 ! 96: #define RPC_PROGMISMATCH 2 ! 97: #define RPC_PROCUNAVAIL 3 ! 98: #define RPC_GARBAGE 4 /* I like this one */ ! 99: #define RPC_MISMATCH 0 ! 100: #define RPC_AUTHERR 1 ! 101: ! 102: /* Authentication failures */ ! 103: #define AUTH_BADCRED 1 ! 104: #define AUTH_REJECTCRED 2 ! 105: #define AUTH_BADVERF 3 ! 106: #define AUTH_REJECTVERF 4 ! 107: #define AUTH_TOOWEAK 5 /* Give em wheaties */ ! 108: ! 109: /* Sizes of rpc header parts */ ! 110: #define RPC_SIZ 24 ! 111: #define RPC_REPLYSIZ 28 ! 112: ! 113: /* RPC Prog definitions */ ! 114: #define RPCPROG_MNT 100005 ! 115: #define RPCMNT_VER1 1 ! 116: #define RPCMNT_VER3 3 ! 117: #define RPCMNT_MOUNT 1 ! 118: #define RPCMNT_DUMP 2 ! 119: #define RPCMNT_UMOUNT 3 ! 120: #define RPCMNT_UMNTALL 4 ! 121: #define RPCMNT_EXPORT 5 ! 122: #define RPCMNT_NAMELEN 255 ! 123: #define RPCMNT_PATHLEN 1024 ! 124: #define RPCPROG_NFS 100003 ! 125: ! 126: /* ! 127: * Structures used for RPCAUTH_KERB4. ! 128: */ ! 129: struct nfsrpc_fullverf { ! 130: u_long t1; ! 131: u_long t2; ! 132: u_long w2; ! 133: }; ! 134: ! 135: struct nfsrpc_fullblock { ! 136: u_long t1; ! 137: u_long t2; ! 138: u_long w1; ! 139: u_long w2; ! 140: }; ! 141: ! 142: struct nfsrpc_nickverf { ! 143: u_long kind; ! 144: struct nfsrpc_fullverf verf; ! 145: }; ! 146: ! 147: /* ! 148: * and their sizes in bytes.. If sizeof (struct nfsrpc_xx) != these ! 149: * constants, well then things will break in mount_nfs and nfsd. ! 150: */ ! 151: #define RPCX_FULLVERF 12 ! 152: #define RPCX_FULLBLOCK 16 ! 153: #define RPCX_NICKVERF 16 ! 154: ! 155: #if NFSKERB ! 156: XXX ! 157: #else ! 158: typedef u_char NFSKERBKEY_T[2]; ! 159: typedef u_char NFSKERBKEYSCHED_T[2]; ! 160: #endif ! 161: #define NFS_KERBSRV "rcmd" /* Kerberos Service for NFS */ ! 162: #define NFS_KERBTTL (30 * 60) /* Credential ttl (sec) */ ! 163: #define NFS_KERBCLOCKSKEW (5 * 60) /* Clock skew (sec) */ ! 164: #define NFS_KERBW1(t) (*((u_long *)(&((t).dat[((t).length + 3) & ~0x3])))) ! 165: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.