00001 /* 00002 * Copyright (C) 2001-2003 by egnite Software GmbH. All rights reserved. 00003 * 00004 * Redistribution and use in source and binary forms, with or without 00005 * modification, are permitted provided that the following conditions 00006 * are met: 00007 * 00008 * 1. Redistributions of source code must retain the above copyright 00009 * notice, this list of conditions and the following disclaimer. 00010 * 2. Redistributions in binary form must reproduce the above copyright 00011 * notice, this list of conditions and the following disclaimer in the 00012 * documentation and/or other materials provided with the distribution. 00013 * 3. Neither the name of the copyright holders nor the names of 00014 * contributors may be used to endorse or promote products derived 00015 * from this software without specific prior written permission. 00016 * 00017 * THIS SOFTWARE IS PROVIDED BY EGNITE SOFTWARE GMBH AND CONTRIBUTORS 00018 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 00019 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 00020 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL EGNITE 00021 * SOFTWARE GMBH OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 00022 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 00023 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS 00024 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED 00025 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 00026 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF 00027 * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00028 * SUCH DAMAGE. 00029 * 00030 * For additional information see http://www.ethernut.de/ 00031 * 00032 * - 00033 * Portions Copyright (C) 2000 David J. Hudson <dave@humbug.demon.co.uk> 00034 * 00035 * This file is distributed in the hope that it will be useful, but WITHOUT 00036 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 00037 * FITNESS FOR A PARTICULAR PURPOSE. 00038 * 00039 * You can redistribute this file and/or modify it under the terms of the GNU 00040 * General Public License (GPL) as published by the Free Software Foundation; 00041 * either version 2 of the License, or (at your discretion) any later version. 00042 * See the accompanying file "copying-gpl.txt" for more details. 00043 * 00044 * As a special exception to the GPL, permission is granted for additional 00045 * uses of the text contained in this file. See the accompanying file 00046 * "copying-liquorice.txt" for details. 00047 * - 00048 * Portions Copyright (c) 1983, 1993 by 00049 * The Regents of the University of California. All rights reserved. 00050 * 00051 * Redistribution and use in source and binary forms, with or without 00052 * modification, are permitted provided that the following conditions 00053 * are met: 00054 * 1. Redistributions of source code must retain the above copyright 00055 * notice, this list of conditions and the following disclaimer. 00056 * 2. Redistributions in binary form must reproduce the above copyright 00057 * notice, this list of conditions and the following disclaimer in the 00058 * documentation and/or other materials provided with the distribution. 00059 * 3. Neither the name of the University nor the names of its contributors 00060 * may be used to endorse or promote products derived from this software 00061 * without specific prior written permission. 00062 * 00063 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 00064 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00065 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00066 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 00067 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00068 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00069 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00070 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00071 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00072 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00073 * SUCH DAMAGE. 00074 * - 00075 * Portions Copyright (c) 1993 by Digital Equipment Corporation. 00076 * 00077 * Permission to use, copy, modify, and distribute this software for any 00078 * purpose with or without fee is hereby granted, provided that the above 00079 * copyright notice and this permission notice appear in all copies, and that 00080 * the name of Digital Equipment Corporation not be used in advertising or 00081 * publicity pertaining to distribution of the document or software without 00082 * specific, written prior permission. 00083 * 00084 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL 00085 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES 00086 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT 00087 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL 00088 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR 00089 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS 00090 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS 00091 * SOFTWARE. 00092 */ 00093 00094 /* 00095 * $Log$ 00096 * Revision 1.10 2008/10/05 16:48:52 haraldkipp 00097 * Security fix. Check various lengths of incoming packets. 00098 * 00099 * Revision 1.9 2008/09/18 09:45:56 haraldkipp 00100 * All broadcasts were answered with ICMP unreachable. Due to this the ARP 00101 * table grew fast in large networks. Fixed. 00102 * 00103 * Revision 1.8 2008/08/20 06:57:00 haraldkipp 00104 * Implemented IP demultiplexer. 00105 * 00106 * Revision 1.7 2008/04/18 13:13:11 haraldkipp 00107 * Using fast ints. 00108 * 00109 * Revision 1.6 2006/10/08 16:48:22 haraldkipp 00110 * Documentation fixed 00111 * 00112 * Revision 1.5 2005/06/05 16:48:32 haraldkipp 00113 * Additional parameter enables NutUdpInput() to avoid responding to UDP 00114 * broadcasts with ICMP unreachable messages. Fixes bug #1215192. 00115 * 00116 * Revision 1.4 2005/05/26 11:47:24 drsung 00117 * ICMP unreachable will be sent on incoming udp packets with no local peer port. 00118 * 00119 * Revision 1.3 2005/02/02 16:22:35 haraldkipp 00120 * Do not wake up waiting threads if the incoming datagram 00121 * doesn't fit in the buffer. 00122 * 00123 * Revision 1.2 2003/11/24 21:01:04 drsung 00124 * Packet queue added for UDP sockets. 00125 * 00126 * Revision 1.1.1.1 2003/05/09 14:41:45 haraldkipp 00127 * Initial using 3.2.1 00128 * 00129 * Revision 1.10 2003/02/04 18:14:57 harald 00130 * Version 3 released 00131 * 00132 * Revision 1.9 2002/06/26 17:29:36 harald 00133 * First pre-release with 2.4 stack 00134 * 00135 */ 00136 00137 #include <sys/event.h> 00138 00139 #include <netinet/udp.h> 00140 #include <sys/socket.h> 00141 #include <netinet/ip_icmp.h> 00142 #include <netinet/icmp.h> 00143 00148 00158 int NutUdpInput(NUTDEVICE * dev, NETBUF * nb) 00159 { 00160 UDPHDR *uh; 00161 UDPSOCKET *sock; 00162 00163 uh = (UDPHDR *) nb->nb_tp.vp; 00164 /* Make sure that the datagram contains a full header. */ 00165 if (uh == NULL || nb->nb_tp.sz < sizeof(UDPHDR)) { 00166 NutNetBufFree(nb); 00167 return 0; 00168 } 00169 00170 nb->nb_ap.sz = nb->nb_tp.sz - sizeof(UDPHDR); 00171 nb->nb_tp.sz = sizeof(UDPHDR); 00172 if (nb->nb_ap.sz) { 00173 nb->nb_ap.vp = uh + 1; 00174 } 00175 00176 /* 00177 * Find a port. If none exists and if this datagram hasn't been 00178 * broadcasted, return an ICMP unreachable. 00179 */ 00180 if ((sock = NutUdpFindSocket(uh->uh_dport)) == 0) { 00181 if ((nb->nb_flags & NBAF_UNICAST) == 0 || 00182 NutIcmpResponse(ICMP_UNREACH, ICMP_UNREACH_PORT, 0, nb) == 0) { 00183 NutNetBufFree(nb); 00184 } 00185 return 0; 00186 } 00187 00188 /* if buffer size is defined, use packet queue */ 00189 if (sock->so_rx_bsz) { 00190 /* New packet fits into the buffer? */ 00191 if (sock->so_rx_cnt + nb->nb_ap.sz > sock->so_rx_bsz) { 00192 /* No, so discard it */ 00193 NutNetBufFree(nb); 00194 return 0; 00195 } else { 00196 /* if a first packet is already in the queue, find the end 00197 * and add the new packet */ 00198 if (sock->so_rx_nb) { 00199 NETBUF *snb; 00200 for (snb = sock->so_rx_nb; snb->nb_next != 0; snb = snb->nb_next); 00201 snb->nb_next = nb; 00202 } else 00203 sock->so_rx_nb = nb; 00204 00205 /* increment input buffer count */ 00206 sock->so_rx_cnt += nb->nb_ap.sz; 00207 }; 00208 } else { /* no packet queue */ 00209 /* if a packet is still buffered, discard it */ 00210 if (sock->so_rx_nb) { 00211 NutNetBufFree(sock->so_rx_nb); 00212 } 00213 sock->so_rx_nb = nb; 00214 sock->so_rx_cnt = nb->nb_ap.sz; /* set input buffer count to size of new packet */ 00215 }; 00216 00217 /* post the event only, if one thread is waiting */ 00218 if (sock->so_rx_rdy) 00219 NutEventPost(&sock->so_rx_rdy); 00220 return 0; 00221 } 00222