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