Return to clnp_timer.c CVS log

Up to [Apple Darwin 0.x] / kernel / bsd / netiso

Annotation of kernel/bsd/netiso/clnp_timer.c, revision 1.1

1.1     ! root        1: /*
        !             2:  * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
        !             3:  *
        !             4:  * @APPLE_LICENSE_HEADER_START@
        !             5:  * 
        !             6:  * Portions Copyright (c) 1999 Apple Computer, Inc.  All Rights
        !             7:  * Reserved.  This file contains Original Code and/or Modifications of
        !             8:  * Original Code as defined in and that are subject to the Apple Public
        !             9:  * Source License Version 1.1 (the "License").  You may not use this file
        !            10:  * except in compliance with the License.  Please obtain a copy of the
        !            11:  * License at http://www.apple.com/publicsource and read it before using
        !            12:  * this file.
        !            13:  * 
        !            14:  * The Original Code and all software distributed under the License are
        !            15:  * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
        !            16:  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
        !            17:  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
        !            18:  * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT.  Please see the
        !            19:  * License for the specific language governing rights and limitations
        !            20:  * under the License.
        !            21:  * 
        !            22:  * @APPLE_LICENSE_HEADER_END@
        !            23:  */
        !            24: 
        !            25: /*-
        !            26:  * Copyright (c) 1991, 1993
        !            27:  *     The Regents of the University of California.  All rights reserved.
        !            28:  *
        !            29:  * Redistribution and use in source and binary forms, with or without
        !            30:  * modification, are permitted provided that the following conditions
        !            31:  * are met:
        !            32:  * 1. Redistributions of source code must retain the above copyright
        !            33:  *    notice, this list of conditions and the following disclaimer.
        !            34:  * 2. Redistributions in binary form must reproduce the above copyright
        !            35:  *    notice, this list of conditions and the following disclaimer in the
        !            36:  *    documentation and/or other materials provided with the distribution.
        !            37:  * 3. All advertising materials mentioning features or use of this software
        !            38:  *    must display the following acknowledgement:
        !            39:  *     This product includes software developed by the University of
        !            40:  *     California, Berkeley and its contributors.
        !            41:  * 4. Neither the name of the University nor the names of its contributors
        !            42:  *    may be used to endorse or promote products derived from this software
        !            43:  *    without specific prior written permission.
        !            44:  *
        !            45:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
        !            46:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
        !            47:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
        !            48:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
        !            49:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
        !            50:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
        !            51:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
        !            52:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
        !            53:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
        !            54:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
        !            55:  * SUCH DAMAGE.
        !            56:  *
        !            57:  *     @(#)clnp_timer.c        8.1 (Berkeley) 6/10/93
        !            58:  */
        !            59: 
        !            60: /***********************************************************
        !            61:                Copyright IBM Corporation 1987
        !            62: 
        !            63:                       All Rights Reserved
        !            64: 
        !            65: Permission to use, copy, modify, and distribute this software and its 
        !            66: documentation for any purpose and without fee is hereby granted, 
        !            67: provided that the above copyright notice appear in all copies and that
        !            68: both that copyright notice and this permission notice appear in 
        !            69: supporting documentation, and that the name of IBM not be
        !            70: used in advertising or publicity pertaining to distribution of the
        !            71: software without specific, written prior permission.  
        !            72: 
        !            73: IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
        !            74: ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
        !            75: IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
        !            76: ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
        !            77: WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
        !            78: ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
        !            79: SOFTWARE.
        !            80: 
        !            81: ******************************************************************/
        !            82: 
        !            83: /*
        !            84:  * ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison
        !            85:  */
        !            86: 
        !            87: #include <sys/param.h>
        !            88: #include <sys/mbuf.h>
        !            89: #include <sys/domain.h>
        !            90: #include <sys/protosw.h>
        !            91: #include <sys/socket.h>
        !            92: #include <sys/socketvar.h>
        !            93: #include <sys/errno.h>
        !            94: 
        !            95: #include <net/if.h>
        !            96: #include <net/route.h>
        !            97: 
        !            98: #include <netiso/iso.h>
        !            99: #include <netiso/clnp.h>
        !           100: #include <netiso/clnp_stat.h>
        !           101: #include <netiso/argo_debug.h>
        !           102: 
        !           103: extern struct clnp_fragl *clnp_frags;
        !           104: 
        !           105: /*
        !           106:  * FUNCTION:           clnp_freefrags
        !           107:  *
        !           108:  * PURPOSE:                    Free the resources associated with a fragment
        !           109:  *
        !           110:  * RETURNS:                    pointer to next fragment in list of fragments
        !           111:  *
        !           112:  * SIDE EFFECTS:       
        !           113:  *
        !           114:  * NOTES:                      
        !           115:  *                     TODO: send ER back to source
        !           116:  */
        !           117: struct clnp_fragl *
        !           118: clnp_freefrags(cfh)
        !           119: register struct clnp_fragl     *cfh;   /* fragment header to delete */
        !           120: {
        !           121:        struct clnp_fragl       *next = cfh->cfl_next;
        !           122:        struct clnp_frag        *cf;
        !           123: 
        !           124:        /* free any frags hanging around */
        !           125:        cf = cfh->cfl_frags;
        !           126:        while (cf != NULL) {
        !           127:                struct clnp_frag        *cf_next = cf->cfr_next;
        !           128:                INCSTAT(cns_fragdropped);
        !           129:                m_freem(cf->cfr_data);
        !           130:                cf = cf_next;
        !           131:        }
        !           132: 
        !           133:        /* free the copy of the header */
        !           134:        INCSTAT(cns_fragdropped);
        !           135:        m_freem(cfh->cfl_orighdr);
        !           136: 
        !           137:        if (clnp_frags == cfh) {
        !           138:                clnp_frags = cfh->cfl_next;
        !           139:        } else {
        !           140:                struct clnp_fragl       *scan;
        !           141: 
        !           142:                for (scan = clnp_frags; scan != NULL; scan = scan->cfl_next) {
        !           143:                        if (scan->cfl_next == cfh) {
        !           144:                                scan->cfl_next = cfh->cfl_next;
        !           145:                                break;
        !           146:                        }
        !           147:                }
        !           148:        }
        !           149: 
        !           150:        /* free the fragment header */
        !           151:        m_freem(dtom(cfh));
        !           152: 
        !           153:        return(next);
        !           154: }
        !           155: 
        !           156: /*
        !           157:  * FUNCTION:           clnp_slowtimo
        !           158:  *
        !           159:  * PURPOSE:                    clnp timer processing; if the ttl expires on a 
        !           160:  *                                     packet on the reassembly queue, discard it.
        !           161:  *
        !           162:  * RETURNS:                    none
        !           163:  *
        !           164:  * SIDE EFFECTS:       
        !           165:  *
        !           166:  * NOTES:                      
        !           167:  */
        !           168: clnp_slowtimo()
        !           169: {
        !           170:        register struct clnp_fragl      *cfh = clnp_frags;
        !           171:        int s = splnet();
        !           172: 
        !           173:        while (cfh != NULL) {
        !           174:                if (--cfh->cfl_ttl == 0) {
        !           175:                        cfh = clnp_freefrags(cfh);
        !           176:                        INCSTAT(cns_fragtimeout);
        !           177:                } else {
        !           178:                        cfh = cfh->cfl_next;
        !           179:                }
        !           180:        }
        !           181:        splx(s);
        !           182: }
        !           183: 
        !           184: /*
        !           185:  * FUNCTION:           clnp_drain
        !           186:  *
        !           187:  * PURPOSE:                    drain off all datagram fragments
        !           188:  *
        !           189:  * RETURNS:                    none
        !           190:  *
        !           191:  * SIDE EFFECTS:       
        !           192:  *
        !           193:  * NOTES:                      
        !           194:  *     TODO: should send back ER
        !           195:  */
        !           196: clnp_drain()
        !           197: {
        !           198:        register struct clnp_fragl      *cfh = clnp_frags;
        !           199: 
        !           200:        while (cfh != NULL)
        !           201:                cfh = clnp_freefrags(cfh);
        !           202: }

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