Return to rpcv2.h CVS log

Up to [Net/2] / Net2 / nfs

Annotation of Net2/nfs/rpcv2.h, revision 1.1.1.2

1.1       root        1: /*
                      2:  * Copyright (c) 1989 The Regents of the University of California.
                      3:  * All rights reserved.
                      4:  *
                      5:  * This code is derived from software contributed to Berkeley by
                      6:  * Rick Macklem at The University of Guelph.
                      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:  *
1.1.1.2 ! root       36:  *     from: @(#)rpcv2.h       7.4 (Berkeley) 6/28/90
        !            37:  *     rpcv2.h,v 1.3 1993/05/20 03:19:16 cgd Exp
1.1       root       38:  */
                     39: 
1.1.1.2 ! root       40: #ifndef _NFS_RPCV2_H_
        !            41: #define _NFS_RPCV2_H_
        !            42: 
1.1       root       43: /*
                     44:  * Definitions for Sun RPC Version 2, from
                     45:  * "RPC: Remote Procedure Call Protocol Specification" RFC1057
                     46:  */
                     47: 
                     48: /* Version # */
                     49: #define        RPC_VER2        2
                     50: 
                     51: /* Authentication */
                     52: #define        RPCAUTH_NULL    0
                     53: #define        RPCAUTH_UNIX    1
                     54: #define        RPCAUTH_SHORT   2
                     55: #define        RPCAUTH_MAXSIZ  400
                     56: #define        RPCAUTH_UNIXGIDS 16
                     57: 
                     58: /* Rpc Constants */
                     59: #define        RPC_CALL        0
                     60: #define        RPC_REPLY       1
                     61: #define        RPC_MSGACCEPTED 0
                     62: #define        RPC_MSGDENIED   1
                     63: #define        RPC_PROGUNAVAIL 1
                     64: #define        RPC_PROGMISMATCH        2
                     65: #define        RPC_PROCUNAVAIL 3
                     66: #define        RPC_GARBAGE     4               /* I like this one */
                     67: #define        RPC_MISMATCH    0
                     68: #define        RPC_AUTHFAIL    1
                     69: 
                     70: /* Authentication failures */
                     71: #define        AUTH_BADCRED    1
                     72: #define        AUTH_REJECTCRED 2
                     73: #define        AUTH_BADVERF    3
                     74: #define        AUTH_REJECTVERF 4
                     75: #define        AUTH_TOOWEAK    5               /* Give em wheaties */
                     76: 
                     77: /* Sizes of rpc header parts */
                     78: #define        RPC_SIZ         24
                     79: #define        RPC_REPLYSIZ    28
                     80: 
                     81: /* RPC Prog definitions */
                     82: #define        RPCPROG_MNT     100005
                     83: #define        RPCMNT_VER1     1
                     84: #define        RPCMNT_MOUNT    1
                     85: #define        RPCMNT_DUMP     2
                     86: #define        RPCMNT_UMOUNT   3
                     87: #define        RPCMNT_UMNTALL  4
                     88: #define        RPCMNT_EXPORT   5
                     89: #define        RPCMNT_NAMELEN  255
                     90: #define        RPCMNT_PATHLEN  1024
                     91: #define        RPCPROG_NFS     100003
1.1.1.2 ! root       92: 
        !            93: #endif /* !_NFS_RPCV2_H_ */

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.