Return to radix.h CVS log

Up to [Net/2] / Net2 / net

Annotation of Net2/net/radix.h, revision 1.1

1.1     ! root        1: /*
        !             2:  * Copyright (c) 1988, 1989 Regents of the University of California.
        !             3:  * All rights reserved.
        !             4:  *
        !             5:  * Redistribution and use in source and binary forms, with or without
        !             6:  * modification, are permitted provided that the following conditions
        !             7:  * are met:
        !             8:  * 1. Redistributions of source code must retain the above copyright
        !             9:  *    notice, this list of conditions and the following disclaimer.
        !            10:  * 2. Redistributions in binary form must reproduce the above copyright
        !            11:  *    notice, this list of conditions and the following disclaimer in the
        !            12:  *    documentation and/or other materials provided with the distribution.
        !            13:  * 3. All advertising materials mentioning features or use of this software
        !            14:  *    must display the following acknowledgement:
        !            15:  *     This product includes software developed by the University of
        !            16:  *     California, Berkeley and its contributors.
        !            17:  * 4. Neither the name of the University nor the names of its contributors
        !            18:  *    may be used to endorse or promote products derived from this software
        !            19:  *    without specific prior written permission.
        !            20:  *
        !            21:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
        !            22:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
        !            23:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
        !            24:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
        !            25:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
        !            26:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
        !            27:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
        !            28:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
        !            29:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
        !            30:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
        !            31:  * SUCH DAMAGE.
        !            32:  *
        !            33:  *     @(#)radix.h     7.4 (Berkeley) 6/28/90
        !            34:  */
        !            35: 
        !            36: /*
        !            37:  * Radix search tree node layout.
        !            38:  */
        !            39: 
        !            40: struct radix_node {
        !            41:        struct  radix_mask *rn_mklist;  /* list of masks contained in subtree */
        !            42:        struct  radix_node *rn_p;       /* parent */
        !            43:        short   rn_b;                   /* bit offset; -1-index(netmask) */
        !            44:        char    rn_bmask;               /* node: mask for bit test*/
        !            45:        u_char  rn_flags;               /* enumerated next */
        !            46: #define RNF_NORMAL     1               /* leaf contains normal route */
        !            47: #define RNF_ROOT       2               /* leaf is root leaf for tree */
        !            48: #define RNF_ACTIVE     4               /* This node is alive (for rtfree) */
        !            49:        union {
        !            50:                struct {                        /* leaf only data: */
        !            51:                        caddr_t rn_Key; /* object of search */
        !            52:                        caddr_t rn_Mask;        /* netmask, if present */
        !            53:                        struct  radix_node *rn_Dupedkey;
        !            54:                } rn_leaf;
        !            55:                struct {                        /* node only data: */
        !            56:                        int     rn_Off;         /* where to start compare */
        !            57:                        struct  radix_node *rn_L;/* progeny */
        !            58:                        struct  radix_node *rn_R;/* progeny */
        !            59:                }rn_node;
        !            60:        }               rn_u;
        !            61: #ifdef RN_DEBUG
        !            62:        int rn_info;
        !            63:        struct radix_node *rn_twin;
        !            64:        struct radix_node *rn_ybro;
        !            65: #endif
        !            66: };
        !            67: 
        !            68: #define MAXKEYLEN 32
        !            69: 
        !            70: #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey
        !            71: #define rn_key rn_u.rn_leaf.rn_Key
        !            72: #define rn_mask rn_u.rn_leaf.rn_Mask
        !            73: #define rn_off rn_u.rn_node.rn_Off
        !            74: #define rn_l rn_u.rn_node.rn_L
        !            75: #define rn_r rn_u.rn_node.rn_R
        !            76: 
        !            77: /*
        !            78:  * Annotations to tree concerning potential routes applying to subtrees.
        !            79:  */
        !            80: 
        !            81: extern struct radix_mask {
        !            82:        short   rm_b;                   /* bit offset; -1-index(netmask) */
        !            83:        char    rm_unused;              /* cf. rn_bmask */
        !            84:        u_char  rm_flags;               /* cf. rn_flags */
        !            85:        struct  radix_mask *rm_mklist;  /* more masks to try */
        !            86:        caddr_t rm_mask;                /* the mask */
        !            87:        int     rm_refs;                /* # of references to this struct */
        !            88: } *rn_mkfreelist;
        !            89: 
        !            90: #define MKGet(m) {\
        !            91:        if (rn_mkfreelist) {\
        !            92:                m = rn_mkfreelist; \
        !            93:                rn_mkfreelist = (m)->rm_mklist; \
        !            94:        } else \
        !            95:                R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\
        !            96: 
        !            97: #define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}
        !            98: 
        !            99: extern struct radix_node_head {
        !           100:        struct  radix_node_head *rnh_next;
        !           101:        struct  radix_node *rnh_treetop;
        !           102:        int     rnh_af;
        !           103:        struct  radix_node rnh_nodes[3];
        !           104: } *radix_node_head;
        !           105: 
        !           106: 
        !           107: #ifndef KERNEL
        !           108: #define Bcmp(a, b, n) bcmp(((char *)(a)), ((char *)(b)), (n))
        !           109: #define Bzero(p, n) bzero((char *)(p), (int)(n));
        !           110: #define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n)))
        !           111: #define Free(p) free((char *)p);
        !           112: #else
        !           113: #define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
        !           114: #define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
        !           115: #define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n));
        !           116: #define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_DONTWAIT))
        !           117: #define Free(p) free((caddr_t)p, M_RTABLE);
        !           118: #endif /*KERNEL*/

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