--- /dev/null
+const char http_http[8] = /* "http://" */ { 0x68, 0x74, 0x74, 0x70, 0x3a, 0x2f, 0x2f, };\r
+const char http_200[5] = /* "200 " */ { 0x32, 0x30, 0x30, 0x20, };\r
+const char http_301[5] = /* "301 " */ { 0x33, 0x30, 0x31, 0x20, };\r
+const char http_302[5] = /* "302 " */ { 0x33, 0x30, 0x32, 0x20, };\r
+const char http_get[5] = /* "GET " */ { 0x47, 0x45, 0x54, 0x20, };\r
+const char http_10[9] = /* "HTTP/1.0" */ { 0x48, 0x54, 0x54, 0x50, 0x2f, 0x31, 0x2e, 0x30, };\r
+const char http_11[9] = /* "HTTP/1.1" */ { 0x48, 0x54, 0x54, 0x50, 0x2f, 0x31, 0x2e, 0x31, };\r
+const char http_content_type[15] =\r
+\r
+/* "content-type: " */\r
+{ 0x63,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x65,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x2d,\r
+ 0x74,\r
+ 0x79,\r
+ 0x70,\r
+ 0x65,\r
+ 0x3a,\r
+ 0x20,\r
+};\r
+const char http_texthtml[10] = /* "text/html" */ { 0x74, 0x65, 0x78, 0x74, 0x2f, 0x68, 0x74, 0x6d, 0x6c, };\r
+const char http_location[11] = /* "location: " */ { 0x6c, 0x6f, 0x63, 0x61, 0x74, 0x69, 0x6f, 0x6e, 0x3a, 0x20, };\r
+const char http_host[7] = /* "host: " */ { 0x68, 0x6f, 0x73, 0x74, 0x3a, 0x20, };\r
+const char http_crnl[3] = /* "\r\n" */ { 0xd, 0xa, };\r
+const char http_index_html[12] = /* "/index.html" */ { 0x2f, 0x69, 0x6e, 0x64, 0x65, 0x78, 0x2e, 0x68, 0x74, 0x6d, 0x6c, };\r
+const char http_404_html[10] = /* "/404.html" */ { 0x2f, 0x34, 0x30, 0x34, 0x2e, 0x68, 0x74, 0x6d, 0x6c, };\r
+const char http_referer[9] = /* "Referer:" */ { 0x52, 0x65, 0x66, 0x65, 0x72, 0x65, 0x72, 0x3a, };\r
+const char http_header_200[84] =\r
+\r
+/* "HTTP/1.0 200 OK\r\nServer: uIP/1.0 http://www.sics.se/~adam/uip/\r\nConnection: close\r\n" */\r
+{ 0x48,\r
+ 0x54,\r
+ 0x54,\r
+ 0x50,\r
+ 0x2f,\r
+ 0x31,\r
+ 0x2e,\r
+ 0x30,\r
+ 0x20,\r
+ 0x32,\r
+ 0x30,\r
+ 0x30,\r
+ 0x20,\r
+ 0x4f,\r
+ 0x4b,\r
+ 0xd,\r
+ 0xa,\r
+ 0x53,\r
+ 0x65,\r
+ 0x72,\r
+ 0x76,\r
+ 0x65,\r
+ 0x72,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x75,\r
+ 0x49,\r
+ 0x50,\r
+ 0x2f,\r
+ 0x31,\r
+ 0x2e,\r
+ 0x30,\r
+ 0x20,\r
+ 0x68,\r
+ 0x74,\r
+ 0x74,\r
+ 0x70,\r
+ 0x3a,\r
+ 0x2f,\r
+ 0x2f,\r
+ 0x77,\r
+ 0x77,\r
+ 0x77,\r
+ 0x2e,\r
+ 0x73,\r
+ 0x69,\r
+ 0x63,\r
+ 0x73,\r
+ 0x2e,\r
+ 0x73,\r
+ 0x65,\r
+ 0x2f,\r
+ 0x7e,\r
+ 0x61,\r
+ 0x64,\r
+ 0x61,\r
+ 0x6d,\r
+ 0x2f,\r
+ 0x75,\r
+ 0x69,\r
+ 0x70,\r
+ 0x2f,\r
+ 0xd,\r
+ 0xa,\r
+ 0x43,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x6e,\r
+ 0x65,\r
+ 0x63,\r
+ 0x74,\r
+ 0x69,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x63,\r
+ 0x6c,\r
+ 0x6f,\r
+ 0x73,\r
+ 0x65,\r
+ 0xd,\r
+ 0xa,\r
+};\r
+const char http_header_404[91] =\r
+\r
+/* "HTTP/1.0 404 Not found\r\nServer: uIP/1.0 http://www.sics.se/~adam/uip/\r\nConnection: close\r\n" */\r
+{ 0x48,\r
+ 0x54,\r
+ 0x54,\r
+ 0x50,\r
+ 0x2f,\r
+ 0x31,\r
+ 0x2e,\r
+ 0x30,\r
+ 0x20,\r
+ 0x34,\r
+ 0x30,\r
+ 0x34,\r
+ 0x20,\r
+ 0x4e,\r
+ 0x6f,\r
+ 0x74,\r
+ 0x20,\r
+ 0x66,\r
+ 0x6f,\r
+ 0x75,\r
+ 0x6e,\r
+ 0x64,\r
+ 0xd,\r
+ 0xa,\r
+ 0x53,\r
+ 0x65,\r
+ 0x72,\r
+ 0x76,\r
+ 0x65,\r
+ 0x72,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x75,\r
+ 0x49,\r
+ 0x50,\r
+ 0x2f,\r
+ 0x31,\r
+ 0x2e,\r
+ 0x30,\r
+ 0x20,\r
+ 0x68,\r
+ 0x74,\r
+ 0x74,\r
+ 0x70,\r
+ 0x3a,\r
+ 0x2f,\r
+ 0x2f,\r
+ 0x77,\r
+ 0x77,\r
+ 0x77,\r
+ 0x2e,\r
+ 0x73,\r
+ 0x69,\r
+ 0x63,\r
+ 0x73,\r
+ 0x2e,\r
+ 0x73,\r
+ 0x65,\r
+ 0x2f,\r
+ 0x7e,\r
+ 0x61,\r
+ 0x64,\r
+ 0x61,\r
+ 0x6d,\r
+ 0x2f,\r
+ 0x75,\r
+ 0x69,\r
+ 0x70,\r
+ 0x2f,\r
+ 0xd,\r
+ 0xa,\r
+ 0x43,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x6e,\r
+ 0x65,\r
+ 0x63,\r
+ 0x74,\r
+ 0x69,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x63,\r
+ 0x6c,\r
+ 0x6f,\r
+ 0x73,\r
+ 0x65,\r
+ 0xd,\r
+ 0xa,\r
+};\r
+const char http_content_type_plain[29] =\r
+\r
+/* "Content-type: text/plain\r\n\r\n" */\r
+{ 0x43,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x65,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x2d,\r
+ 0x74,\r
+ 0x79,\r
+ 0x70,\r
+ 0x65,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x74,\r
+ 0x65,\r
+ 0x78,\r
+ 0x74,\r
+ 0x2f,\r
+ 0x70,\r
+ 0x6c,\r
+ 0x61,\r
+ 0x69,\r
+ 0x6e,\r
+ 0xd,\r
+ 0xa,\r
+ 0xd,\r
+ 0xa,\r
+};\r
+const char http_content_type_html[28] =\r
+\r
+/* "Content-type: text/html\r\n\r\n" */\r
+{ 0x43,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x65,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x2d,\r
+ 0x74,\r
+ 0x79,\r
+ 0x70,\r
+ 0x65,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x74,\r
+ 0x65,\r
+ 0x78,\r
+ 0x74,\r
+ 0x2f,\r
+ 0x68,\r
+ 0x74,\r
+ 0x6d,\r
+ 0x6c,\r
+ 0xd,\r
+ 0xa,\r
+ 0xd,\r
+ 0xa,\r
+};\r
+const char http_content_type_css[27] =\r
+\r
+/* "Content-type: text/css\r\n\r\n" */\r
+{ 0x43,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x65,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x2d,\r
+ 0x74,\r
+ 0x79,\r
+ 0x70,\r
+ 0x65,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x74,\r
+ 0x65,\r
+ 0x78,\r
+ 0x74,\r
+ 0x2f,\r
+ 0x63,\r
+ 0x73,\r
+ 0x73,\r
+ 0xd,\r
+ 0xa,\r
+ 0xd,\r
+ 0xa,\r
+};\r
+const char http_content_type_text[28] =\r
+\r
+/* "Content-type: text/text\r\n\r\n" */\r
+{ 0x43,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x65,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x2d,\r
+ 0x74,\r
+ 0x79,\r
+ 0x70,\r
+ 0x65,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x74,\r
+ 0x65,\r
+ 0x78,\r
+ 0x74,\r
+ 0x2f,\r
+ 0x74,\r
+ 0x65,\r
+ 0x78,\r
+ 0x74,\r
+ 0xd,\r
+ 0xa,\r
+ 0xd,\r
+ 0xa,\r
+};\r
+const char http_content_type_png[28] =\r
+\r
+/* "Content-type: image/png\r\n\r\n" */\r
+{ 0x43,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x65,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x2d,\r
+ 0x74,\r
+ 0x79,\r
+ 0x70,\r
+ 0x65,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x69,\r
+ 0x6d,\r
+ 0x61,\r
+ 0x67,\r
+ 0x65,\r
+ 0x2f,\r
+ 0x70,\r
+ 0x6e,\r
+ 0x67,\r
+ 0xd,\r
+ 0xa,\r
+ 0xd,\r
+ 0xa,\r
+};\r
+const char http_content_type_gif[28] =\r
+\r
+/* "Content-type: image/gif\r\n\r\n" */\r
+{ 0x43,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x65,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x2d,\r
+ 0x74,\r
+ 0x79,\r
+ 0x70,\r
+ 0x65,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x69,\r
+ 0x6d,\r
+ 0x61,\r
+ 0x67,\r
+ 0x65,\r
+ 0x2f,\r
+ 0x67,\r
+ 0x69,\r
+ 0x66,\r
+ 0xd,\r
+ 0xa,\r
+ 0xd,\r
+ 0xa,\r
+};\r
+const char http_content_type_jpg[29] =\r
+\r
+/* "Content-type: image/jpeg\r\n\r\n" */\r
+{ 0x43,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x65,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x2d,\r
+ 0x74,\r
+ 0x79,\r
+ 0x70,\r
+ 0x65,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x69,\r
+ 0x6d,\r
+ 0x61,\r
+ 0x67,\r
+ 0x65,\r
+ 0x2f,\r
+ 0x6a,\r
+ 0x70,\r
+ 0x65,\r
+ 0x67,\r
+ 0xd,\r
+ 0xa,\r
+ 0xd,\r
+ 0xa,\r
+};\r
+const char http_content_type_binary[43] =\r
+\r
+/* "Content-type: application/octet-stream\r\n\r\n" */\r
+{ 0x43,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x65,\r
+ 0x6e,\r
+ 0x74,\r
+ 0x2d,\r
+ 0x74,\r
+ 0x79,\r
+ 0x70,\r
+ 0x65,\r
+ 0x3a,\r
+ 0x20,\r
+ 0x61,\r
+ 0x70,\r
+ 0x70,\r
+ 0x6c,\r
+ 0x69,\r
+ 0x63,\r
+ 0x61,\r
+ 0x74,\r
+ 0x69,\r
+ 0x6f,\r
+ 0x6e,\r
+ 0x2f,\r
+ 0x6f,\r
+ 0x63,\r
+ 0x74,\r
+ 0x65,\r
+ 0x74,\r
+ 0x2d,\r
+ 0x73,\r
+ 0x74,\r
+ 0x72,\r
+ 0x65,\r
+ 0x61,\r
+ 0x6d,\r
+ 0xd,\r
+ 0xa,\r
+ 0xd,\r
+ 0xa,\r
+};\r
+const char http_html[6] = /* ".html" */ { 0x2e, 0x68, 0x74, 0x6d, 0x6c, };\r
+const char http_shtml[7] = /* ".shtml" */ { 0x2e, 0x73, 0x68, 0x74, 0x6d, 0x6c, };\r
+const char http_htm[5] = /* ".htm" */ { 0x2e, 0x68, 0x74, 0x6d, };\r
+const char http_css[5] = /* ".css" */ { 0x2e, 0x63, 0x73, 0x73, };\r
+const char http_png[5] = /* ".png" */ { 0x2e, 0x70, 0x6e, 0x67, };\r
+const char http_gif[5] = /* ".gif" */ { 0x2e, 0x67, 0x69, 0x66, };\r
+const char http_jpg[5] = /* ".jpg" */ { 0x2e, 0x6a, 0x70, 0x67, };\r
+const char http_text[5] = /* ".txt" */ { 0x2e, 0x74, 0x78, 0x74, };\r
+const char http_txt[5] = /* ".txt" */ { 0x2e, 0x74, 0x78, 0x74, };\r
--- /dev/null
+/**\r
+ * \addtogroup httpd\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Web server script interface\r
+ * \author\r
+ * Adam Dunkels <adam@sics.se>\r
+ *\r
+ */\r
+\r
+/*\r
+ * Copyright (c) 2001-2006, Adam Dunkels.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. The name of the author may not be used to endorse or promote\r
+ * products derived from this software without specific prior\r
+ * written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS\r
+ * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\r
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\r
+ * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\r
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\r
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\r
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack.\r
+ *\r
+ * $Id: httpd-cgi.c,v 1.2 2006/06/11 21:46:37 adam Exp $\r
+ *\r
+ */\r
+#include "net/uip.h"\r
+#include "net/psock.h"\r
+#include "httpd.h"\r
+#include "httpd-cgi.h"\r
+#include "httpd-fs.h"\r
+\r
+#include <stdio.h>\r
+#include <string.h>\r
+\r
+HTTPD_CGI_CALL( file, "file-stats", file_stats );\r
+HTTPD_CGI_CALL( tcp, "tcp-connections", tcp_stats );\r
+HTTPD_CGI_CALL( net, "net-stats", net_stats );\r
+\r
+static const struct httpd_cgi_call *calls[] = { &file, &tcp, &net, NULL };\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static PT_THREAD( nullfunction ( struct httpd_state *s, char *ptr ) )\r
+{\r
+ PSOCK_BEGIN( &s->sout );\r
+ PSOCK_END( &s->sout );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+httpd_cgifunction httpd_cgi( char *name )\r
+{\r
+ const struct httpd_cgi_call **f;\r
+\r
+ /* Find the matching name in the table, return the function. */\r
+ for( f = calls; *f != NULL; ++f )\r
+ {\r
+ if( strncmp((*f)->name, name, strlen((*f)->name)) == 0 )\r
+ {\r
+ return( *f )->function;\r
+ }\r
+ }\r
+\r
+ return nullfunction;\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static unsigned short generate_file_stats( void *arg )\r
+{\r
+ char *f = ( char * ) arg;\r
+ return snprintf( ( char * ) uip_appdata, UIP_APPDATA_SIZE, "%5u", httpd_fs_count(f) );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static PT_THREAD( file_stats ( struct httpd_state *s, char *ptr ) )\r
+{\r
+ PSOCK_BEGIN( &s->sout );\r
+\r
+ PSOCK_GENERATOR_SEND( &s->sout, generate_file_stats, strchr(ptr, ' ') + 1 );\r
+\r
+ PSOCK_END( &s->sout );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static const char closed[] = /* "CLOSED",*/ { 0x43, 0x4c, 0x4f, 0x53, 0x45, 0x44, 0 };\r
+static const char syn_rcvd[] = /* "SYN-RCVD",*/ { 0x53, 0x59, 0x4e, 0x2d, 0x52, 0x43, 0x56, 0x44, 0 };\r
+static const char syn_sent[] = /* "SYN-SENT",*/ { 0x53, 0x59, 0x4e, 0x2d, 0x53, 0x45, 0x4e, 0x54, 0 };\r
+static const char established[] = /* "ESTABLISHED",*/ { 0x45, 0x53, 0x54, 0x41, 0x42, 0x4c, 0x49, 0x53, 0x48, 0x45, 0x44, 0 };\r
+static const char fin_wait_1[] = /* "FIN-WAIT-1",*/ { 0x46, 0x49, 0x4e, 0x2d, 0x57, 0x41, 0x49, 0x54, 0x2d, 0x31, 0 };\r
+static const char fin_wait_2[] = /* "FIN-WAIT-2",*/ { 0x46, 0x49, 0x4e, 0x2d, 0x57, 0x41, 0x49, 0x54, 0x2d, 0x32, 0 };\r
+static const char closing[] = /* "CLOSING",*/ { 0x43, 0x4c, 0x4f, 0x53, 0x49, 0x4e, 0x47, 0 };\r
+static const char time_wait[] = /* "TIME-WAIT,"*/ { 0x54, 0x49, 0x4d, 0x45, 0x2d, 0x57, 0x41, 0x49, 0x54, 0 };\r
+static const char last_ack[] = /* "LAST-ACK"*/ { 0x4c, 0x41, 0x53, 0x54, 0x2d, 0x41, 0x43, 0x4b, 0 };\r
+\r
+static const char *states[] = { closed, syn_rcvd, syn_sent, established, fin_wait_1, fin_wait_2, closing, time_wait, last_ack };\r
+\r
+static unsigned short generate_tcp_stats( void *arg )\r
+{\r
+ struct uip_conn *conn;\r
+ struct httpd_state *s = ( struct httpd_state * ) arg;\r
+\r
+ conn = &uip_conns[s->count];\r
+ return snprintf( ( char * ) uip_appdata, UIP_APPDATA_SIZE,\r
+ "<tr><td>%d</td><td>%u.%u.%u.%u:%u</td><td>%s</td><td>%u</td><td>%u</td><td>%c %c</td></tr>\r\n", htons(conn->lport),\r
+ htons(conn->ripaddr[0]) >> 8, htons(conn->ripaddr[0]) & 0xff, htons(conn->ripaddr[1]) >> 8,\r
+ htons(conn->ripaddr[1]) & 0xff, htons(conn->rport), states[conn->tcpstateflags & UIP_TS_MASK], conn->nrtx, conn->timer,\r
+ (uip_outstanding(conn)) ? '*' : ' ', (uip_stopped(conn)) ? '!' : ' ' );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static PT_THREAD( tcp_stats ( struct httpd_state *s, char *ptr ) )\r
+{\r
+ PSOCK_BEGIN( &s->sout );\r
+\r
+ for( s->count = 0; s->count < UIP_CONNS; ++s->count )\r
+ {\r
+ if( (uip_conns[s->count].tcpstateflags & UIP_TS_MASK) != UIP_CLOSED )\r
+ {\r
+ PSOCK_GENERATOR_SEND( &s->sout, generate_tcp_stats, s );\r
+ }\r
+ }\r
+\r
+ PSOCK_END( &s->sout );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static unsigned short generate_net_stats( void *arg )\r
+{\r
+ struct httpd_state *s = ( struct httpd_state * ) arg;\r
+ return snprintf( ( char * ) uip_appdata, UIP_APPDATA_SIZE, "%5u\n", (( uip_stats_t * ) &uip_stat)[s->count] );\r
+}\r
+\r
+static PT_THREAD( net_stats ( struct httpd_state *s, char *ptr ) )\r
+{\r
+ PSOCK_BEGIN( &s->sout );\r
+\r
+#if UIP_STATISTICS\r
+ for( s->count = 0; s->count < sizeof(uip_stat) / sizeof(uip_stats_t); ++s->count )\r
+ {\r
+ PSOCK_GENERATOR_SEND( &s->sout, generate_net_stats, s );\r
+ }\r
+\r
+#endif /* UIP_STATISTICS */\r
+\r
+ PSOCK_END( &s->sout );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/** @} */\r
--- /dev/null
+/*\r
+ * Copyright (c) 2001, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the lwIP TCP/IP stack.\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: httpd-fs.c,v 1.1 2006/06/07 09:13:08 adam Exp $\r
+ */\r
+#include "httpd.h"\r
+#include "httpd-fs.h"\r
+#include "httpd-fsdata.h"\r
+\r
+#ifndef NULL\r
+#define NULL 0\r
+#endif /* NULL */\r
+\r
+#include "httpd-fsdata.c"\r
+\r
+#if HTTPD_FS_STATISTICS\r
+static u16_t count[HTTPD_FS_NUMFILES];\r
+#endif /* HTTPD_FS_STATISTICS */\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+static u8_t httpd_fs_strcmp( const char *str1, const char *str2 )\r
+{\r
+ u8_t i;\r
+ i = 0;\r
+loop:\r
+ if( str2[i] == 0 || str1[i] == '\r' || str1[i] == '\n' )\r
+ {\r
+ return 0;\r
+ }\r
+\r
+ if( str1[i] != str2[i] )\r
+ {\r
+ return 1;\r
+ }\r
+\r
+ ++i;\r
+ goto loop;\r
+}\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+int httpd_fs_open( const char *name, struct httpd_fs_file *file )\r
+{\r
+#if HTTPD_FS_STATISTICS\r
+ u16_t i = 0;\r
+#endif /* HTTPD_FS_STATISTICS */\r
+ struct httpd_fsdata_file_noconst *f;\r
+\r
+ for( f = ( struct httpd_fsdata_file_noconst * ) HTTPD_FS_ROOT; f != NULL; f = ( struct httpd_fsdata_file_noconst * ) f->next )\r
+ {\r
+ if( httpd_fs_strcmp(name, f->name) == 0 )\r
+ {\r
+ file->data = f->data;\r
+ file->len = f->len;\r
+#if HTTPD_FS_STATISTICS\r
+ ++count[i];\r
+#endif /* HTTPD_FS_STATISTICS */\r
+ return 1;\r
+ }\r
+\r
+#if HTTPD_FS_STATISTICS\r
+ ++i;\r
+#endif /* HTTPD_FS_STATISTICS */\r
+ }\r
+\r
+ return 0;\r
+}\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+void httpd_fs_init( void )\r
+{\r
+#if HTTPD_FS_STATISTICS\r
+ u16_t i;\r
+ for( i = 0; i < HTTPD_FS_NUMFILES; i++ )\r
+ {\r
+ count[i] = 0;\r
+ }\r
+\r
+#endif /* HTTPD_FS_STATISTICS */\r
+}\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+#if HTTPD_FS_STATISTICS\r
+u16_t httpd_fs_count( char *name )\r
+{\r
+ struct httpd_fsdata_file_noconst *f;\r
+ u16_t i;\r
+\r
+ i = 0;\r
+ for( f = ( struct httpd_fsdata_file_noconst * ) HTTPD_FS_ROOT; f != NULL; f = ( struct httpd_fsdata_file_noconst * ) f->next )\r
+ {\r
+ if( httpd_fs_strcmp(name, f->name) == 0 )\r
+ {\r
+ return count[i];\r
+ }\r
+\r
+ ++i;\r
+ }\r
+\r
+ return 0;\r
+}\r
+\r
+#endif /* HTTPD_FS_STATISTICS */\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
--- /dev/null
+/*\r
+ * Copyright (c) 2001, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the lwIP TCP/IP stack.\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: httpd-fs.h,v 1.1 2006/06/07 09:13:08 adam Exp $\r
+ */\r
+#ifndef __HTTPD_FS_H__\r
+#define __HTTPD_FS_H__\r
+\r
+#define HTTPD_FS_STATISTICS 1\r
+\r
+struct httpd_fs_file\r
+{\r
+ char *data;\r
+ int len;\r
+};\r
+\r
+/* file must be allocated by caller and will be filled in\r
+ by the function. */\r
+int httpd_fs_open( const char *name, struct httpd_fs_file *file );\r
+\r
+#ifdef HTTPD_FS_STATISTICS\r
+#if HTTPD_FS_STATISTICS == 1\r
+u16_t httpd_fs_count( char *name );\r
+#endif /* HTTPD_FS_STATISTICS */\r
+#endif /* HTTPD_FS_STATISTICS */\r
+\r
+void httpd_fs_init( void );\r
+#endif /* __HTTPD_FS_H__ */\r
--- /dev/null
+/*
+ * Copyright (c) 2001, Swedish Institute of Computer Science.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ * notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in the
+ * documentation and/or other materials provided with the distribution.
+ * 3. Neither the name of the Institute nor the names of its contributors
+ * may be used to endorse or promote products derived from this software
+ * without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ * This file is part of the lwIP TCP/IP stack.
+ *
+ * Author: Adam Dunkels <adam@sics.se>
+ *
+ * $Id: httpd-fsdata.h,v 1.1 2006/06/17 22:41:14 adamdunkels Exp $
+ */
+#ifndef __HTTPD_FSDATA_H__
+#define __HTTPD_FSDATA_H__
+
+struct httpd_fsdata_file {
+ const struct httpd_fsdata_file *next;
+ const char *name;
+ const char *data;
+ const int len;
+#ifdef HTTPD_FS_STATISTICS
+#if HTTPD_FS_STATISTICS == 1
+ u16_t count;
+#endif /* HTTPD_FS_STATISTICS */
+#endif /* HTTPD_FS_STATISTICS */
+};
+
+struct httpd_fsdata_file_noconst {
+ struct httpd_fsdata_file *next;
+ char *name;
+ char *data;
+ int len;
+#ifdef HTTPD_FS_STATISTICS
+#if HTTPD_FS_STATISTICS == 1
+ u16_t count;
+#endif /* HTTPD_FS_STATISTICS */
+#endif /* HTTPD_FS_STATISTICS */
+};
+
+#endif /* __HTTPD_FSDATA_H__ */
--- /dev/null
+/**\r
+ * \addtogroup apps\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \defgroup httpd Web server\r
+ * @{\r
+ * The uIP web server is a very simplistic implementation of an HTTP\r
+ * server. It can serve web pages and files from a read-only ROM\r
+ * filesystem, and provides a very small scripting language.\r
+\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Web server\r
+ * \author\r
+ * Adam Dunkels <adam@sics.se>\r
+ */\r
+\r
+/*\r
+ * Copyright (c) 2004, Adam Dunkels.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack.\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: httpd.c,v 1.2 2006/06/11 21:46:38 adam Exp $\r
+ */\r
+#include "net/uip.h"\r
+#include "net/httpd.h"\r
+#include "net/httpd-fs.h"\r
+#include "net/httpd-cgi.h"\r
+#include "net/http-strings.h"\r
+\r
+#include <string.h>\r
+\r
+#define STATE_WAITING 0\r
+#define STATE_OUTPUT 1\r
+\r
+#define ISO_nl 0x0a\r
+#define ISO_space 0x20\r
+#define ISO_bang 0x21\r
+#define ISO_percent 0x25\r
+#define ISO_period 0x2e\r
+#define ISO_slash 0x2f\r
+#define ISO_colon 0x3a\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static unsigned short generate_part_of_file( void *state )\r
+{\r
+ struct httpd_state *s = ( struct httpd_state * ) state;\r
+\r
+ if( s->file.len > uip_mss() )\r
+ {\r
+ s->len = uip_mss();\r
+ }\r
+ else\r
+ {\r
+ s->len = s->file.len;\r
+ }\r
+\r
+ memcpy( uip_appdata, s->file.data, s->len );\r
+\r
+ return s->len;\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static PT_THREAD( send_file ( struct httpd_state *s ) )\r
+{\r
+ PSOCK_BEGIN( &s->sout );\r
+\r
+ do\r
+ {\r
+ PSOCK_GENERATOR_SEND( &s->sout, generate_part_of_file, s );\r
+ s->file.len -= s->len;\r
+ s->file.data += s->len;\r
+ } while( s->file.len > 0 );\r
+\r
+ PSOCK_END( &s->sout );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static PT_THREAD( send_part_of_file ( struct httpd_state *s ) )\r
+{\r
+ PSOCK_BEGIN( &s->sout );\r
+\r
+ PSOCK_SEND( &s->sout, s->file.data, s->len );\r
+\r
+ PSOCK_END( &s->sout );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static void next_scriptstate( struct httpd_state *s )\r
+{\r
+ char *p;\r
+ p = strchr( s->scriptptr, ISO_nl ) + 1;\r
+ s->scriptlen -= ( unsigned short ) ( p - s->scriptptr );\r
+ s->scriptptr = p;\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static PT_THREAD( handle_script ( struct httpd_state *s ) )\r
+{\r
+ char *ptr;\r
+\r
+ PT_BEGIN( &s->scriptpt );\r
+\r
+ while( s->file.len > 0 )\r
+ {\r
+ /* Check if we should start executing a script. */\r
+ if( *s->file.data == ISO_percent && *(s->file.data + 1) == ISO_bang )\r
+ {\r
+ s->scriptptr = s->file.data + 3;\r
+ s->scriptlen = s->file.len - 3;\r
+ if( *(s->scriptptr - 1) == ISO_colon )\r
+ {\r
+ httpd_fs_open( s->scriptptr + 1, &s->file );\r
+ PT_WAIT_THREAD( &s->scriptpt, send_file(s) );\r
+ }\r
+ else\r
+ {\r
+ PT_WAIT_THREAD( &s->scriptpt, httpd_cgi(s->scriptptr) (s, s->scriptptr) );\r
+ }\r
+\r
+ next_scriptstate( s );\r
+\r
+ /* The script is over, so we reset the pointers and continue\r
+ sending the rest of the file. */\r
+ s->file.data = s->scriptptr;\r
+ s->file.len = s->scriptlen;\r
+ }\r
+ else\r
+ {\r
+ /* See if we find the start of script marker in the block of HTML\r
+ to be sent. */\r
+ if( s->file.len > uip_mss() )\r
+ {\r
+ s->len = uip_mss();\r
+ }\r
+ else\r
+ {\r
+ s->len = s->file.len;\r
+ }\r
+\r
+ if( *s->file.data == ISO_percent )\r
+ {\r
+ ptr = strchr( s->file.data + 1, ISO_percent );\r
+ }\r
+ else\r
+ {\r
+ ptr = strchr( s->file.data, ISO_percent );\r
+ }\r
+\r
+ if( ptr != NULL && ptr != s->file.data )\r
+ {\r
+ s->len = ( int ) ( ptr - s->file.data );\r
+ if( s->len >= uip_mss() )\r
+ {\r
+ s->len = uip_mss();\r
+ }\r
+ }\r
+\r
+ PT_WAIT_THREAD( &s->scriptpt, send_part_of_file(s) );\r
+ s->file.data += s->len;\r
+ s->file.len -= s->len;\r
+ }\r
+ }\r
+\r
+ PT_END( &s->scriptpt );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static PT_THREAD( send_headers ( struct httpd_state *s, const char *statushdr ) )\r
+{\r
+ char *ptr;\r
+\r
+ PSOCK_BEGIN( &s->sout );\r
+\r
+ PSOCK_SEND_STR( &s->sout, statushdr );\r
+\r
+ ptr = strrchr( s->filename, ISO_period );\r
+ if( ptr == NULL )\r
+ {\r
+ PSOCK_SEND_STR( &s->sout, http_content_type_binary );\r
+ }\r
+ else if( strncmp(http_html, ptr, 5) == 0 || strncmp(http_shtml, ptr, 6) == 0 )\r
+ {\r
+ PSOCK_SEND_STR( &s->sout, http_content_type_html );\r
+ }\r
+ else if( strncmp(http_css, ptr, 4) == 0 )\r
+ {\r
+ PSOCK_SEND_STR( &s->sout, http_content_type_css );\r
+ }\r
+ else if( strncmp(http_png, ptr, 4) == 0 )\r
+ {\r
+ PSOCK_SEND_STR( &s->sout, http_content_type_png );\r
+ }\r
+ else if( strncmp(http_gif, ptr, 4) == 0 )\r
+ {\r
+ PSOCK_SEND_STR( &s->sout, http_content_type_gif );\r
+ }\r
+ else if( strncmp(http_jpg, ptr, 4) == 0 )\r
+ {\r
+ PSOCK_SEND_STR( &s->sout, http_content_type_jpg );\r
+ }\r
+ else\r
+ {\r
+ PSOCK_SEND_STR( &s->sout, http_content_type_plain );\r
+ }\r
+\r
+ PSOCK_END( &s->sout );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static PT_THREAD( handle_output ( struct httpd_state *s ) )\r
+{\r
+ char *ptr;\r
+\r
+ PT_BEGIN( &s->outputpt );\r
+\r
+ if( !httpd_fs_open(s->filename, &s->file) )\r
+ {\r
+ httpd_fs_open( http_404_html, &s->file );\r
+ strcpy( s->filename, http_404_html );\r
+ PT_WAIT_THREAD( &s->outputpt, send_headers(s, http_header_404) );\r
+ PT_WAIT_THREAD( &s->outputpt, send_file(s) );\r
+ }\r
+ else\r
+ {\r
+ PT_WAIT_THREAD( &s->outputpt, send_headers(s, http_header_200) );\r
+ ptr = strchr( s->filename, ISO_period );\r
+ if( ptr != NULL && strncmp(ptr, http_shtml, 6) == 0 )\r
+ {\r
+ PT_INIT( &s->scriptpt );\r
+ PT_WAIT_THREAD( &s->outputpt, handle_script(s) );\r
+ }\r
+ else\r
+ {\r
+ PT_WAIT_THREAD( &s->outputpt, send_file(s) );\r
+ }\r
+ }\r
+\r
+ PSOCK_CLOSE( &s->sout );\r
+ PT_END( &s->outputpt );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static PT_THREAD( handle_input ( struct httpd_state *s ) )\r
+{\r
+ PSOCK_BEGIN( &s->sin );\r
+\r
+ PSOCK_READTO( &s->sin, ISO_space );\r
+\r
+ if( strncmp(s->inputbuf, http_get, 4) != 0 )\r
+ {\r
+ PSOCK_CLOSE_EXIT( &s->sin );\r
+ }\r
+\r
+ PSOCK_READTO( &s->sin, ISO_space );\r
+\r
+ if( s->inputbuf[0] != ISO_slash )\r
+ {\r
+ PSOCK_CLOSE_EXIT( &s->sin );\r
+ }\r
+\r
+ if( s->inputbuf[1] == ISO_space )\r
+ {\r
+ strncpy( s->filename, http_index_html, sizeof(s->filename) );\r
+ }\r
+ else\r
+ {\r
+ s->inputbuf[PSOCK_DATALEN( &s->sin ) - 1] = 0;\r
+ strncpy( s->filename, &s->inputbuf[0], sizeof(s->filename) );\r
+ }\r
+\r
+ /* httpd_log_file(uip_conn->ripaddr, s->filename);*/\r
+ s->state = STATE_OUTPUT;\r
+\r
+ while( 1 )\r
+ {\r
+ PSOCK_READTO( &s->sin, ISO_nl );\r
+\r
+ if( strncmp(s->inputbuf, http_referer, 8) == 0 )\r
+ {\r
+ s->inputbuf[PSOCK_DATALEN( &s->sin ) - 2] = 0;\r
+\r
+ /* httpd_log(&s->inputbuf[9]);*/\r
+ }\r
+ }\r
+\r
+ PSOCK_END( &s->sin );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static void handle_connection( struct httpd_state *s )\r
+{\r
+ handle_input( s );\r
+ if( s->state == STATE_OUTPUT )\r
+ {\r
+ handle_output( s );\r
+ }\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+void httpd_appcall( void )\r
+{\r
+ struct httpd_state *s = ( struct httpd_state * ) &( uip_conn->appstate );\r
+\r
+ if( uip_closed() || uip_aborted() || uip_timedout() )\r
+ {\r
+ }\r
+ else if( uip_connected() )\r
+ {\r
+ PSOCK_INIT( &s->sin, s->inputbuf, sizeof(s->inputbuf) - 1 );\r
+ PSOCK_INIT( &s->sout, s->inputbuf, sizeof(s->inputbuf) - 1 );\r
+ PT_INIT( &s->outputpt );\r
+ s->state = STATE_WAITING;\r
+\r
+ /* timer_set(&s->timer, CLOCK_SECOND * 100);*/\r
+ s->timer = 0;\r
+ handle_connection( s );\r
+ }\r
+ else if( s != NULL )\r
+ {\r
+ if( uip_poll() )\r
+ {\r
+ ++s->timer;\r
+ if( s->timer >= 20 )\r
+ {\r
+ uip_abort();\r
+ }\r
+ }\r
+ else\r
+ {\r
+ s->timer = 0;\r
+ }\r
+\r
+ handle_connection( s );\r
+ }\r
+ else\r
+ {\r
+ uip_abort();\r
+ }\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \brief Initialize the web server\r
+ *\r
+ * This function initializes the web server and should be\r
+ * called at system boot-up.\r
+ */\r
+void httpd_init( void )\r
+{\r
+ uip_listen( HTONS(80) );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/** @} */\r
--- /dev/null
+/*\r
+ * Copyright (c) 2001-2005, Adam Dunkels.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. The name of the author may not be used to endorse or promote\r
+ * products derived from this software without specific prior\r
+ * written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS\r
+ * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\r
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\r
+ * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\r
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\r
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\r
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack.\r
+ *\r
+ * $Id: httpd.h,v 1.2 2006/06/11 21:46:38 adam Exp $\r
+ *\r
+ */\r
+#ifndef __HTTPD_H__\r
+#define __HTTPD_H__\r
+\r
+#include "net/psock.h"\r
+#include "httpd-fs.h"\r
+\r
+struct httpd_state\r
+{\r
+ unsigned char timer;\r
+ struct psock sin, sout;\r
+ struct pt outputpt, scriptpt;\r
+ char inputbuf[50];\r
+ char filename[20];\r
+ char state;\r
+ struct httpd_fs_file file;\r
+ int len;\r
+ char *scriptptr;\r
+ int scriptlen;\r
+\r
+ unsigned short count;\r
+};\r
+\r
+void httpd_init( void );\r
+void httpd_appcall( void );\r
+\r
+void httpd_log( char *msg );\r
+void httpd_log_file( u16_t *requester, char *file );\r
+#endif /* __HTTPD_H__ */\r
--- /dev/null
+#!/usr/bin/perl
+
+open(OUTPUT, "> httpd-fsdata.c");
+
+chdir("httpd-fs");
+
+opendir(DIR, ".");
+@files = grep { !/^\./ && !/(CVS|~)/ } readdir(DIR);
+closedir(DIR);
+
+foreach $file (@files) {
+
+ if(-d $file && $file !~ /^\./) {
+ print "Processing directory $file\n";
+ opendir(DIR, $file);
+ @newfiles = grep { !/^\./ && !/(CVS|~)/ } readdir(DIR);
+ closedir(DIR);
+ printf "Adding files @newfiles\n";
+ @files = (@files, map { $_ = "$file/$_" } @newfiles);
+ next;
+ }
+}
+
+foreach $file (@files) {
+ if(-f $file) {
+
+ print "Adding file $file\n";
+
+ open(FILE, $file) || die "Could not open file $file\n";
+
+ $file =~ s-^-/-;
+ $fvar = $file;
+ $fvar =~ s-/-_-g;
+ $fvar =~ s-\.-_-g;
+ # for AVR, add PROGMEM here
+ print(OUTPUT "static const unsigned char data".$fvar."[] = {\n");
+ print(OUTPUT "\t/* $file */\n\t");
+ for($j = 0; $j < length($file); $j++) {
+ printf(OUTPUT "%#02x, ", unpack("C", substr($file, $j, 1)));
+ }
+ printf(OUTPUT "0,\n");
+
+
+ $i = 0;
+ while(read(FILE, $data, 1)) {
+ if($i == 0) {
+ print(OUTPUT "\t");
+ }
+ printf(OUTPUT "%#02x, ", unpack("C", $data));
+ $i++;
+ if($i == 10) {
+ print(OUTPUT "\n");
+ $i = 0;
+ }
+ }
+ print(OUTPUT "0};\n\n");
+ close(FILE);
+ push(@fvars, $fvar);
+ push(@pfiles, $file);
+ }
+}
+
+for($i = 0; $i < @fvars; $i++) {
+ $file = $pfiles[$i];
+ $fvar = $fvars[$i];
+
+ if($i == 0) {
+ $prevfile = "NULL";
+ } else {
+ $prevfile = "file" . $fvars[$i - 1];
+ }
+ print(OUTPUT "const struct httpd_fsdata_file file".$fvar."[] = {{$prevfile, data$fvar, ");
+ print(OUTPUT "data$fvar + ". (length($file) + 1) .", ");
+ print(OUTPUT "sizeof(data$fvar) - ". (length($file) + 1) ."}};\n\n");
+}
+
+print(OUTPUT "#define HTTPD_FS_ROOT file$fvars[$i - 1]\n\n");
+print(OUTPUT "#define HTTPD_FS_NUMFILES $i\n");
--- /dev/null
+/*\r
+ * Copyright (c) 2004, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the Contiki operating system.\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: memb.h,v 1.6 2009/04/06 21:18:04 adamdunkels Exp $\r
+ */\r
+\r
+/**\r
+ * \addtogroup mem\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \defgroup memb Memory block management functions\r
+ *\r
+ * The memory block allocation routines provide a simple yet powerful\r
+ * set of functions for managing a set of memory blocks of fixed\r
+ * size. A set of memory blocks is statically declared with the\r
+ * MEMB() macro. Memory blocks are allocated from the declared\r
+ * memory by the memb_alloc() function, and are deallocated with the\r
+ * memb_free() function.\r
+ *\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Memory block allocation routines.\r
+ * \author\r
+ * Adam Dunkels <adam@sics.se>\r
+ *\r
+ */\r
+#ifndef __MEMB_H__\r
+#define __MEMB_H__\r
+\r
+#include "sys/cc.h"\r
+\r
+/**\r
+ * Declare a memory block.\r
+ *\r
+ * This macro is used to statically declare a block of memory that can\r
+ * be used by the block allocation functions. The macro statically\r
+ * declares a C array with a size that matches the specified number of\r
+ * blocks and their individual sizes.\r
+ *\r
+ * Example:\r
+ \code\r
+MEMB(connections, struct connection, 16);\r
+ \endcode\r
+ *\r
+ * \param name The name of the memory block (later used with\r
+ * memb_init(), memb_alloc() and memb_free()).\r
+ *\r
+ * \param structure The name of the struct that the memory block holds\r
+ *\r
+ * \param num The total number of memory chunks in the block.\r
+ *\r
+ */\r
+#define MEMB( name, structure, num ) \\r
+ static char CC_CONCAT( name, _memb_count )[num]; \\r
+ static structure CC_CONCAT( name, _memb_mem )[num]; \\r
+ static struct memb name = \\r
+ { \\r
+ sizeof( structure ), num, CC_CONCAT( name, _memb_count ), ( void * ) CC_CONCAT( name, _memb_mem ) \\r
+ }\r
+\r
+struct memb\r
+{ unsigned short size; unsigned short num; char *count; void *mem; };\r
+\r
+/**\r
+ * Initialize a memory block that was declared with MEMB().\r
+ *\r
+ * \param m A memory block previously declared with MEMB().\r
+ */\r
+void memb_init( struct memb *m );\r
+\r
+/**\r
+ * Allocate a memory block from a block of memory declared with MEMB().\r
+ *\r
+ * \param m A memory block previously declared with MEMB().\r
+ */\r
+void *memb_alloc( struct memb *m );\r
+\r
+/**\r
+ * Deallocate a memory block from a memory block previously declared\r
+ * with MEMB().\r
+ *\r
+ * \param m m A memory block previously declared with MEMB().\r
+ *\r
+ * \param ptr A pointer to the memory block that is to be deallocated.\r
+ *\r
+ * \return The new reference count for the memory block (should be 0\r
+ * if successfully deallocated) or -1 if the pointer "ptr" did not\r
+ * point to a legal memory block.\r
+ */\r
+char memb_free( struct memb *m, void *ptr );\r
+\r
+int memb_inmemb( struct memb *m, void *ptr );\r
+\r
+/** @} */\r
+\r
+/** @} */\r
+#endif /* __MEMB_H__ */\r
--- /dev/null
+/*\r
+ * Copyright (c) 2006, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack\r
+ *\r
+ * $Id: clock-arch.h,v 1.2 2006/06/12 08:00:31 adam Exp $\r
+ */\r
+\r
+#ifndef __CLOCK_ARCH_H__\r
+#define __CLOCK_ARCH_H__\r
+\r
+#include "FreeRTOS.h"\r
+\r
+typedef unsigned long clock_time_t;\r
+#define CLOCK_CONF_SECOND configTICK_RATE_HZ\r
+\r
+#endif /* __CLOCK_ARCH_H__ */\r
--- /dev/null
+/*\r
+ * Copyright (c) 2004-2005, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: lc-switch.h,v 1.2 2006/06/12 08:00:30 adam Exp $\r
+ */\r
+\r
+/**\r
+ * \addtogroup lc\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Implementation of local continuations based on switch() statment\r
+ * \author Adam Dunkels <adam@sics.se>\r
+ *\r
+ * This implementation of local continuations uses the C switch()\r
+ * statement to resume execution of a function somewhere inside the\r
+ * function's body. The implementation is based on the fact that\r
+ * switch() statements are able to jump directly into the bodies of\r
+ * control structures such as if() or while() statmenets.\r
+ *\r
+ * This implementation borrows heavily from Simon Tatham's coroutines\r
+ * implementation in C:\r
+ * http://www.chiark.greenend.org.uk/~sgtatham/coroutines.html\r
+ */\r
+\r
+#ifndef __LC_SWITCH_H__\r
+#define __LC_SWTICH_H__\r
+\r
+/* WARNING! lc implementation using switch() does not work if an\r
+ LC_SET() is done within another switch() statement! */\r
+\r
+/** \hideinitializer */\r
+typedef unsigned short lc_t;\r
+\r
+#define LC_INIT(s) s = 0;\r
+\r
+#define LC_RESUME(s) switch(s) { case 0:\r
+\r
+#define LC_SET(s) s = __LINE__; case __LINE__:\r
+\r
+#define LC_END(s) }\r
+\r
+#endif /* __LC_SWITCH_H__ */\r
+\r
+/** @} */\r
--- /dev/null
+/*\r
+ * Copyright (c) 2004-2005, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: lc.h,v 1.2 2006/06/12 08:00:30 adam Exp $\r
+ */\r
+\r
+/**\r
+ * \addtogroup pt\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \defgroup lc Local continuations\r
+ * @{\r
+ *\r
+ * Local continuations form the basis for implementing protothreads. A\r
+ * local continuation can be <i>set</i> in a specific function to\r
+ * capture the state of the function. After a local continuation has\r
+ * been set can be <i>resumed</i> in order to restore the state of the\r
+ * function at the point where the local continuation was set.\r
+ *\r
+ *\r
+ */\r
+\r
+/**\r
+ * \file lc.h\r
+ * Local continuations\r
+ * \author\r
+ * Adam Dunkels <adam@sics.se>\r
+ *\r
+ */\r
+\r
+#ifdef DOXYGEN\r
+/**\r
+ * Initialize a local continuation.\r
+ *\r
+ * This operation initializes the local continuation, thereby\r
+ * unsetting any previously set continuation state.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define LC_INIT(lc)\r
+\r
+/**\r
+ * Set a local continuation.\r
+ *\r
+ * The set operation saves the state of the function at the point\r
+ * where the operation is executed. As far as the set operation is\r
+ * concerned, the state of the function does <b>not</b> include the\r
+ * call-stack or local (automatic) variables, but only the program\r
+ * counter and such CPU registers that needs to be saved.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define LC_SET(lc)\r
+\r
+/**\r
+ * Resume a local continuation.\r
+ *\r
+ * The resume operation resumes a previously set local continuation, thus\r
+ * restoring the state in which the function was when the local\r
+ * continuation was set. If the local continuation has not been\r
+ * previously set, the resume operation does nothing.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define LC_RESUME(lc)\r
+\r
+/**\r
+ * Mark the end of local continuation usage.\r
+ *\r
+ * The end operation signifies that local continuations should not be\r
+ * used any more in the function. This operation is not needed for\r
+ * most implementations of local continuation, but is required by a\r
+ * few implementations.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define LC_END(lc)\r
+\r
+/**\r
+ * \var typedef lc_t;\r
+ *\r
+ * The local continuation type.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#endif /* DOXYGEN */\r
+\r
+#ifndef __LC_H__\r
+#define __LC_H__\r
+\r
+#ifdef LC_CONF_INCLUDE\r
+#include LC_CONF_INCLUDE\r
+#else\r
+#include "lc-switch.h"\r
+#endif /* LC_CONF_INCLUDE */\r
+\r
+#endif /* __LC_H__ */\r
+\r
+/** @} */\r
+/** @} */\r
--- /dev/null
+#ifdef __GNUC__\r
+__attribute__( (packed) );\r
+#endif\r
+#ifdef __RENESAS__\r
+;\r
+#pragma unpack\r
+#endif\r
--- /dev/null
+#ifdef __GNUC__\r
+\r
+/* Nothing to do here. */\r
+;\r
+#endif\r
+#ifdef __RENESAS__\r
+#pragma pack 1\r
+#endif\r
--- /dev/null
+/*\r
+ * Copyright (c) 2004, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: psock.h,v 1.3 2006/06/12 08:00:30 adam Exp $\r
+ */\r
+\r
+/**\r
+ * \defgroup psock Protosockets library\r
+ * @{\r
+ *\r
+ * The protosocket library provides an interface to the uIP stack that is\r
+ * similar to the traditional BSD socket interface. Unlike programs\r
+ * written for the ordinary uIP event-driven interface, programs\r
+ * written with the protosocket library are executed in a sequential\r
+ * fashion and does not have to be implemented as explicit state\r
+ * machines.\r
+ *\r
+ * Protosockets only work with TCP connections.\r
+ *\r
+ * The protosocket library uses \ref pt protothreads to provide\r
+ * sequential control flow. This makes the protosockets lightweight in\r
+ * terms of memory, but also means that protosockets inherits the\r
+ * functional limitations of protothreads. Each protosocket lives only\r
+ * within a single function. Automatic variables (stack variables) are\r
+ * not retained across a protosocket library function call.\r
+ *\r
+ * \note Because the protosocket library uses protothreads, local\r
+ * variables will not always be saved across a call to a protosocket\r
+ * library function. It is therefore advised that local variables are\r
+ * used with extreme care.\r
+ *\r
+ * The protosocket library provides functions for sending data without\r
+ * having to deal with retransmissions and acknowledgements, as well\r
+ * as functions for reading data without having to deal with data\r
+ * being split across more than one TCP segment.\r
+ *\r
+ * Because each protosocket runs as a protothread, the protosocket has to be\r
+ * started with a call to PSOCK_BEGIN() at the start of the function\r
+ * in which the protosocket is used. Similarly, the protosocket protothread can\r
+ * be terminated by a call to PSOCK_EXIT().\r
+ *\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Protosocket library header file\r
+ * \author\r
+ * Adam Dunkels <adam@sics.se>\r
+ *\r
+ */\r
+\r
+#ifndef __PSOCK_H__\r
+#define __PSOCK_H__\r
+\r
+#include "uipopt.h"\r
+#include "pt.h"\r
+\r
+ /*\r
+ * The structure that holds the state of a buffer.\r
+ *\r
+ * This structure holds the state of a uIP buffer. The structure has\r
+ * no user-visible elements, but is used through the functions\r
+ * provided by the library.\r
+ *\r
+ */\r
+struct psock_buf {\r
+ u8_t *ptr;\r
+ unsigned short left;\r
+};\r
+\r
+/**\r
+ * The representation of a protosocket.\r
+ *\r
+ * The protosocket structrure is an opaque structure with no user-visible\r
+ * elements.\r
+ */\r
+struct psock {\r
+ struct pt pt, psockpt; /* Protothreads - one that's using the psock\r
+ functions, and one that runs inside the\r
+ psock functions. */\r
+ const u8_t *sendptr; /* Pointer to the next data to be sent. */\r
+ u8_t *readptr; /* Pointer to the next data to be read. */\r
+ \r
+ char *bufptr; /* Pointer to the buffer used for buffering\r
+ incoming data. */\r
+ \r
+ u16_t sendlen; /* The number of bytes left to be sent. */\r
+ u16_t readlen; /* The number of bytes left to be read. */\r
+\r
+ struct psock_buf buf; /* The structure holding the state of the\r
+ input buffer. */\r
+ unsigned int bufsize; /* The size of the input buffer. */\r
+ \r
+ unsigned char state; /* The state of the protosocket. */\r
+};\r
+\r
+void psock_init(struct psock *psock, char *buffer, unsigned int buffersize);\r
+/**\r
+ * Initialize a protosocket.\r
+ *\r
+ * This macro initializes a protosocket and must be called before the\r
+ * protosocket is used. The initialization also specifies the input buffer\r
+ * for the protosocket.\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket to be\r
+ * initialized\r
+ *\r
+ * \param buffer (char *) A pointer to the input buffer for the\r
+ * protosocket.\r
+ *\r
+ * \param buffersize (unsigned int) The size of the input buffer.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_INIT(psock, buffer, buffersize) \\r
+ psock_init(psock, buffer, buffersize)\r
+\r
+/**\r
+ * Start the protosocket protothread in a function.\r
+ *\r
+ * This macro starts the protothread associated with the protosocket and\r
+ * must come before other protosocket calls in the function it is used.\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket to be\r
+ * started.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_BEGIN(psock) PT_BEGIN(&((psock)->pt))\r
+\r
+PT_THREAD(psock_send(struct psock *psock, const char *buf, unsigned int len));\r
+/**\r
+ * Send data.\r
+ *\r
+ * This macro sends data over a protosocket. The protosocket protothread blocks\r
+ * until all data has been sent and is known to have been received by\r
+ * the remote end of the TCP connection.\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket over which\r
+ * data is to be sent.\r
+ *\r
+ * \param data (char *) A pointer to the data that is to be sent.\r
+ *\r
+ * \param datalen (unsigned int) The length of the data that is to be\r
+ * sent.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_SEND(psock, data, datalen) \\r
+ PT_WAIT_THREAD(&((psock)->pt), psock_send(psock, data, datalen))\r
+\r
+/**\r
+ * \brief Send a null-terminated string.\r
+ * \param psock Pointer to the protosocket.\r
+ * \param str The string to be sent.\r
+ *\r
+ * This function sends a null-terminated string over the\r
+ * protosocket.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_SEND_STR(psock, str) \\r
+ PT_WAIT_THREAD(&((psock)->pt), psock_send(psock, str, strlen(str)))\r
+\r
+PT_THREAD(psock_generator_send(struct psock *psock,\r
+ unsigned short (*f)(void *), void *arg));\r
+\r
+/**\r
+ * \brief Generate data with a function and send it\r
+ * \param psock Pointer to the protosocket.\r
+ * \param generator Pointer to the generator function\r
+ * \param arg Argument to the generator function\r
+ *\r
+ * This function generates data and sends it over the\r
+ * protosocket. This can be used to dynamically generate\r
+ * data for a transmission, instead of generating the data\r
+ * in a buffer beforehand. This function reduces the need for\r
+ * buffer memory. The generator function is implemented by\r
+ * the application, and a pointer to the function is given\r
+ * as an argument with the call to PSOCK_GENERATOR_SEND().\r
+ *\r
+ * The generator function should place the generated data\r
+ * directly in the uip_appdata buffer, and return the\r
+ * length of the generated data. The generator function is\r
+ * called by the protosocket layer when the data first is\r
+ * sent, and once for every retransmission that is needed.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_GENERATOR_SEND(psock, generator, arg) \\r
+ PT_WAIT_THREAD(&((psock)->pt), \\r
+ psock_generator_send(psock, generator, arg))\r
+\r
+\r
+/**\r
+ * Close a protosocket.\r
+ *\r
+ * This macro closes a protosocket and can only be called from within the\r
+ * protothread in which the protosocket lives.\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket that is to\r
+ * be closed.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_CLOSE(psock) uip_close()\r
+\r
+PT_THREAD(psock_readbuf(struct psock *psock));\r
+/**\r
+ * Read data until the buffer is full.\r
+ *\r
+ * This macro will block waiting for data and read the data into the\r
+ * input buffer specified with the call to PSOCK_INIT(). Data is read\r
+ * until the buffer is full..\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket from which\r
+ * data should be read.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_READBUF(psock) \\r
+ PT_WAIT_THREAD(&((psock)->pt), psock_readbuf(psock))\r
+\r
+PT_THREAD(psock_readto(struct psock *psock, unsigned char c));\r
+/**\r
+ * Read data up to a specified character.\r
+ *\r
+ * This macro will block waiting for data and read the data into the\r
+ * input buffer specified with the call to PSOCK_INIT(). Data is only\r
+ * read until the specifieed character appears in the data stream.\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket from which\r
+ * data should be read.\r
+ *\r
+ * \param c (char) The character at which to stop reading.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_READTO(psock, c) \\r
+ PT_WAIT_THREAD(&((psock)->pt), psock_readto(psock, c))\r
+\r
+/**\r
+ * The length of the data that was previously read.\r
+ *\r
+ * This macro returns the length of the data that was previously read\r
+ * using PSOCK_READTO() or PSOCK_READ().\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket holding the data.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_DATALEN(psock) psock_datalen(psock)\r
+\r
+u16_t psock_datalen(struct psock *psock);\r
+\r
+/**\r
+ * Exit the protosocket's protothread.\r
+ *\r
+ * This macro terminates the protothread of the protosocket and should\r
+ * almost always be used in conjunction with PSOCK_CLOSE().\r
+ *\r
+ * \sa PSOCK_CLOSE_EXIT()\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_EXIT(psock) PT_EXIT(&((psock)->pt))\r
+\r
+/**\r
+ * Close a protosocket and exit the protosocket's protothread.\r
+ *\r
+ * This macro closes a protosocket and exits the protosocket's protothread.\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_CLOSE_EXIT(psock) \\r
+ do { \\r
+ PSOCK_CLOSE(psock); \\r
+ PSOCK_EXIT(psock); \\r
+ } while(0)\r
+\r
+/**\r
+ * Declare the end of a protosocket's protothread.\r
+ *\r
+ * This macro is used for declaring that the protosocket's protothread\r
+ * ends. It must always be used together with a matching PSOCK_BEGIN()\r
+ * macro.\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_END(psock) PT_END(&((psock)->pt))\r
+\r
+char psock_newdata(struct psock *s);\r
+\r
+/**\r
+ * Check if new data has arrived on a protosocket.\r
+ *\r
+ * This macro is used in conjunction with the PSOCK_WAIT_UNTIL()\r
+ * macro to check if data has arrived on a protosocket.\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_NEWDATA(psock) psock_newdata(psock)\r
+\r
+/**\r
+ * Wait until a condition is true.\r
+ *\r
+ * This macro blocks the protothread until the specified condition is\r
+ * true. The macro PSOCK_NEWDATA() can be used to check if new data\r
+ * arrives when the protosocket is waiting.\r
+ *\r
+ * Typically, this macro is used as follows:\r
+ *\r
+ \code\r
+ PT_THREAD(thread(struct psock *s, struct timer *t))\r
+ {\r
+ PSOCK_BEGIN(s);\r
+\r
+ PSOCK_WAIT_UNTIL(s, PSOCK_NEWADATA(s) || timer_expired(t));\r
+ \r
+ if(PSOCK_NEWDATA(s)) {\r
+ PSOCK_READTO(s, '\n');\r
+ } else {\r
+ handle_timed_out(s);\r
+ }\r
+ \r
+ PSOCK_END(s);\r
+ }\r
+ \endcode\r
+ *\r
+ * \param psock (struct psock *) A pointer to the protosocket.\r
+ * \param condition The condition to wait for.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PSOCK_WAIT_UNTIL(psock, condition) \\r
+ PT_WAIT_UNTIL(&((psock)->pt), (condition));\r
+\r
+#define PSOCK_WAIT_THREAD(psock, condition) \\r
+ PT_WAIT_THREAD(&((psock)->pt), (condition))\r
+\r
+#endif /* __PSOCK_H__ */\r
+\r
+/** @} */\r
--- /dev/null
+/*\r
+ * Copyright (c) 2004-2005, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: pt.h,v 1.2 2006/06/12 08:00:30 adam Exp $\r
+ */\r
+\r
+/**\r
+ * \addtogroup pt\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Protothreads implementation.\r
+ * \author\r
+ * Adam Dunkels <adam@sics.se>\r
+ *\r
+ */\r
+\r
+#ifndef __PT_H__\r
+#define __PT_H__\r
+\r
+#include "lc.h"\r
+\r
+struct pt {\r
+ lc_t lc;\r
+};\r
+\r
+#define PT_WAITING 0\r
+#define PT_EXITED 1\r
+#define PT_ENDED 2\r
+#define PT_YIELDED 3\r
+\r
+/**\r
+ * \name Initialization\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Initialize a protothread.\r
+ *\r
+ * Initializes a protothread. Initialization must be done prior to\r
+ * starting to execute the protothread.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \sa PT_SPAWN()\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_INIT(pt) LC_INIT((pt)->lc)\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \name Declaration and definition\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Declaration of a protothread.\r
+ *\r
+ * This macro is used to declare a protothread. All protothreads must\r
+ * be declared with this macro.\r
+ *\r
+ * \param name_args The name and arguments of the C function\r
+ * implementing the protothread.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_THREAD(name_args) char name_args\r
+\r
+/**\r
+ * Declare the start of a protothread inside the C function\r
+ * implementing the protothread.\r
+ *\r
+ * This macro is used to declare the starting point of a\r
+ * protothread. It should be placed at the start of the function in\r
+ * which the protothread runs. All C statements above the PT_BEGIN()\r
+ * invokation will be executed each time the protothread is scheduled.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_BEGIN(pt) { char PT_YIELD_FLAG = 1; LC_RESUME((pt)->lc)\r
+\r
+/**\r
+ * Declare the end of a protothread.\r
+ *\r
+ * This macro is used for declaring that a protothread ends. It must\r
+ * always be used together with a matching PT_BEGIN() macro.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_END(pt) LC_END((pt)->lc); PT_YIELD_FLAG = 0; \\r
+ PT_INIT(pt); return PT_ENDED; }\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \name Blocked wait\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Block and wait until condition is true.\r
+ *\r
+ * This macro blocks the protothread until the specified condition is\r
+ * true.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ * \param condition The condition.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_WAIT_UNTIL(pt, condition) \\r
+ do { \\r
+ LC_SET((pt)->lc); \\r
+ if(!(condition)) { \\r
+ return PT_WAITING; \\r
+ } \\r
+ } while(0)\r
+\r
+/**\r
+ * Block and wait while condition is true.\r
+ *\r
+ * This function blocks and waits while condition is true. See\r
+ * PT_WAIT_UNTIL().\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ * \param cond The condition.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_WAIT_WHILE(pt, cond) PT_WAIT_UNTIL((pt), !(cond))\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \name Hierarchical protothreads\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Block and wait until a child protothread completes.\r
+ *\r
+ * This macro schedules a child protothread. The current protothread\r
+ * will block until the child protothread completes.\r
+ *\r
+ * \note The child protothread must be manually initialized with the\r
+ * PT_INIT() function before this function is used.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ * \param thread The child protothread with arguments\r
+ *\r
+ * \sa PT_SPAWN()\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_WAIT_THREAD(pt, thread) PT_WAIT_WHILE((pt), PT_SCHEDULE(thread))\r
+\r
+/**\r
+ * Spawn a child protothread and wait until it exits.\r
+ *\r
+ * This macro spawns a child protothread and waits until it exits. The\r
+ * macro can only be used within a protothread.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ * \param child A pointer to the child protothread's control structure.\r
+ * \param thread The child protothread with arguments\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_SPAWN(pt, child, thread) \\r
+ do { \\r
+ PT_INIT((child)); \\r
+ PT_WAIT_THREAD((pt), (thread)); \\r
+ } while(0)\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \name Exiting and restarting\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Restart the protothread.\r
+ *\r
+ * This macro will block and cause the running protothread to restart\r
+ * its execution at the place of the PT_BEGIN() call.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_RESTART(pt) \\r
+ do { \\r
+ PT_INIT(pt); \\r
+ return PT_WAITING; \\r
+ } while(0)\r
+\r
+/**\r
+ * Exit the protothread.\r
+ *\r
+ * This macro causes the protothread to exit. If the protothread was\r
+ * spawned by another protothread, the parent protothread will become\r
+ * unblocked and can continue to run.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_EXIT(pt) \\r
+ do { \\r
+ PT_INIT(pt); \\r
+ return PT_EXITED; \\r
+ } while(0)\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \name Calling a protothread\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Schedule a protothread.\r
+ *\r
+ * This function shedules a protothread. The return value of the\r
+ * function is non-zero if the protothread is running or zero if the\r
+ * protothread has exited.\r
+ *\r
+ * \param f The call to the C function implementing the protothread to\r
+ * be scheduled\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_SCHEDULE(f) ((f) == PT_WAITING)\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \name Yielding from a protothread\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Yield from the current protothread.\r
+ *\r
+ * This function will yield the protothread, thereby allowing other\r
+ * processing to take place in the system.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_YIELD(pt) \\r
+ do { \\r
+ PT_YIELD_FLAG = 0; \\r
+ LC_SET((pt)->lc); \\r
+ if(PT_YIELD_FLAG == 0) { \\r
+ return PT_YIELDED; \\r
+ } \\r
+ } while(0)\r
+\r
+/**\r
+ * \brief Yield from the protothread until a condition occurs.\r
+ * \param pt A pointer to the protothread control structure.\r
+ * \param cond The condition.\r
+ *\r
+ * This function will yield the protothread, until the\r
+ * specified condition evaluates to true.\r
+ *\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_YIELD_UNTIL(pt, cond) \\r
+ do { \\r
+ PT_YIELD_FLAG = 0; \\r
+ LC_SET((pt)->lc); \\r
+ if((PT_YIELD_FLAG == 0) || !(cond)) { \\r
+ return PT_YIELDED; \\r
+ } \\r
+ } while(0)\r
+\r
+/** @} */\r
+\r
+#endif /* __PT_H__ */\r
+\r
+/** @} */\r
--- /dev/null
+\r
+ /**\r
+ * \addtogroup uip\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Header file for the uIP TCP/IP stack.\r
+ * \author Adam Dunkels <adam@dunkels.com>\r
+ * \author Julien Abeille <jabeille@cisco.com> (IPv6 related code)\r
+ * \author Mathilde Durvy <mdurvy@cisco.com> (IPv6 related code)\r
+ *\r
+ * The uIP TCP/IP stack header file contains definitions for a number\r
+ * of C macros that are used by uIP programs as well as internal uIP\r
+ * structures, TCP/IP header structures and function declarations.\r
+ *\r
+ */\r
+\r
+/*\r
+ * Copyright (c) 2001-2003, Adam Dunkels.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. The name of the author may not be used to endorse or promote\r
+ * products derived from this software without specific prior\r
+ * written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS\r
+ * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\r
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\r
+ * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\r
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\r
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\r
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack.\r
+ *\r
+ * $Id: uip.h,v 1.24 2009/04/06 13:18:50 nvt-se Exp $\r
+ *\r
+ */\r
+#ifndef __UIP_H__\r
+#define __UIP_H__\r
+\r
+#include "net/uipopt.h"\r
+#include "uip-conf.h"\r
+\r
+/**\r
+ * Representation of an IP address.\r
+ *\r
+ */\r
+#if UIP_CONF_IPV6 != 0\r
+ typedef union uip_ip6addr_t\r
+ {\r
+ u8_t u8[16]; /* Initializer, must come first!!! */\r
+ u16_t u16[8];\r
+ } uip_ip6addr_t;\r
+\r
+ typedef uip_ip6addr_t uip_ipaddr_t;\r
+#else /* UIP_CONF_IPV6 */\r
+ typedef union uip_ip4addr_t\r
+ {\r
+ u8_t u8[4]; /* Initializer, must come first!!! */\r
+ u16_t u16[2];\r
+ #if 0\r
+ u32_t u32;\r
+ #endif\r
+ } uip_ip4addr_t;\r
+ typedef uip_ip4addr_t uip_ipaddr_t;\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/** \brief 16 bit 802.15.4 address */\r
+struct uip_802154_shortaddr\r
+{\r
+ u8_t addr[2];\r
+};\r
+\r
+/** \brief 64 bit 802.15.4 address */\r
+struct uip_802154_longaddr\r
+{\r
+ u8_t addr[8];\r
+};\r
+\r
+/** \brief 802.11 address */\r
+struct uip_80211_addr\r
+{\r
+ u8_t addr[6];\r
+};\r
+\r
+/** \brief 802.3 address */\r
+#include "net/pack_struct_start.h"\r
+struct uip_eth_addr\r
+{\r
+ u8_t addr[6];\r
+}\r
+#include "net/pack_struct_end.h"\r
+\r
+#ifdef UIP_CONF_LL_802154\r
+\r
+ /** \brief 802.15.4 address */\r
+ typedef struct uip_802154_longaddr uip_lladdr_t;\r
+ #define UIP_802154_SHORTADDR_LEN 2\r
+ #define UIP_802154_LONGADDR_LEN 8\r
+ #define UIP_LLADDR_LEN UIP_802154_LONGADDR_LEN\r
+#else /*UIP_CONF_LL_802154*/\r
+ #ifdef UIP_CONF_LL_80211\r
+ /** \brief 802.11 address */\r
+ typedef struct uip_80211_addr uip_lladdr_t;\r
+ #define UIP_LLADDR_LEN 6\r
+ #else /*UIP_CONF_LL_80211*/\r
+\r
+ /** \brief Ethernet address */\r
+ typedef struct uip_eth_addr uip_lladdr_t;\r
+\r
+ #define UIP_LLADDR_LEN 6\r
+ #endif /*UIP_CONF_LL_80211*/\r
+#endif /*UIP_CONF_LL_802154*/\r
+\r
+//_RB_#include "net/tcpip.h"\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/* First, the functions that should be called from the\r
+ * system. Initialization, the periodic timer, and incoming packets are\r
+ * handled by the following three functions.\r
+ */\r
+\r
+/**\r
+ * \defgroup uipconffunc uIP configuration functions\r
+ * @{\r
+ *\r
+ * The uIP configuration functions are used for setting run-time\r
+ * parameters in uIP such as IP addresses.\r
+ */\r
+\r
+/**\r
+ * Set the IP address of this host.\r
+ *\r
+ * The IP address is represented as a 4-byte array where the first\r
+ * octet of the IP address is put in the first member of the 4-byte\r
+ * array.\r
+ *\r
+ * Example:\r
+ \code\r
+\r
+ uip_ipaddr_t addr;\r
+\r
+ uip_ipaddr(&addr, 192,168,1,2);\r
+ uip_sethostaddr(&addr);\r
+ \r
+ \endcode\r
+ * \param addr A pointer to an IP address of type uip_ipaddr_t;\r
+ *\r
+ * \sa uip_ipaddr()\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_sethostaddr( addr ) uip_ipaddr_copy( &uip_hostaddr, (addr) )\r
+\r
+/**\r
+ * Get the IP address of this host.\r
+ *\r
+ * The IP address is represented as a 4-byte array where the first\r
+ * octet of the IP address is put in the first member of the 4-byte\r
+ * array.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t hostaddr;\r
+\r
+ uip_gethostaddr(&hostaddr);\r
+ \endcode\r
+ * \param addr A pointer to a uip_ipaddr_t variable that will be\r
+ * filled in with the currently configured IP address.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_gethostaddr( addr ) uip_ipaddr_copy( (addr), &uip_hostaddr )\r
+\r
+/**\r
+ * Set the default router's IP address.\r
+ *\r
+ * \param addr A pointer to a uip_ipaddr_t variable containing the IP\r
+ * address of the default router.\r
+ *\r
+ * \sa uip_ipaddr()\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_setdraddr( addr ) uip_ipaddr_copy( &uip_draddr, (addr) )\r
+\r
+/**\r
+ * Set the netmask.\r
+ *\r
+ * \param addr A pointer to a uip_ipaddr_t variable containing the IP\r
+ * address of the netmask.\r
+ *\r
+ * \sa uip_ipaddr()\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_setnetmask( addr ) uip_ipaddr_copy( &uip_netmask, (addr) )\r
+\r
+/**\r
+ * Get the default router's IP address.\r
+ *\r
+ * \param addr A pointer to a uip_ipaddr_t variable that will be\r
+ * filled in with the IP address of the default router.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_getdraddr( addr ) uip_ipaddr_copy( (addr), &uip_draddr )\r
+\r
+/**\r
+ * Get the netmask.\r
+ *\r
+ * \param addr A pointer to a uip_ipaddr_t variable that will be\r
+ * filled in with the value of the netmask.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_getnetmask( addr ) uip_ipaddr_copy( (addr), &uip_netmask )\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \defgroup uipinit uIP initialization functions\r
+ * @{\r
+ *\r
+ * The uIP initialization functions are used for booting uIP.\r
+ */\r
+\r
+/**\r
+ * uIP initialization function.\r
+ *\r
+ * This function should be called at boot up to initilize the uIP\r
+ * TCP/IP stack.\r
+ */\r
+void uip_init( void );\r
+\r
+/**\r
+ * uIP initialization function.\r
+ *\r
+ * This function may be used at boot time to set the initial ip_id.\r
+ */\r
+void uip_setipid( u16_t id );\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \defgroup uipdevfunc uIP device driver functions\r
+ * @{\r
+ *\r
+ * These functions are used by a network device driver for interacting\r
+ * with uIP.\r
+ */\r
+\r
+/**\r
+ * Process an incoming packet.\r
+ *\r
+ * This function should be called when the device driver has received\r
+ * a packet from the network. The packet from the device driver must\r
+ * be present in the uip_buf buffer, and the length of the packet\r
+ * should be placed in the uip_len variable.\r
+ *\r
+ * When the function returns, there may be an outbound packet placed\r
+ * in the uip_buf packet buffer. If so, the uip_len variable is set to\r
+ * the length of the packet. If no packet is to be sent out, the\r
+ * uip_len variable is set to 0.\r
+ *\r
+ * The usual way of calling the function is presented by the source\r
+ * code below.\r
+ \code\r
+ uip_len = devicedriver_poll();\r
+ if(uip_len > 0) {\r
+ uip_input();\r
+ if(uip_len > 0) {\r
+ devicedriver_send();\r
+ }\r
+ }\r
+ \endcode\r
+ *\r
+ * \note If you are writing a uIP device driver that needs ARP\r
+ * (Address Resolution Protocol), e.g., when running uIP over\r
+ * Ethernet, you will need to call the uIP ARP code before calling\r
+ * this function:\r
+ \code\r
+ #define BUF ((struct uip_eth_hdr *)&uip_buf[0])\r
+ uip_len = ethernet_devicedrver_poll();\r
+ if(uip_len > 0) {\r
+ if(BUF->type == HTONS(UIP_ETHTYPE_IP)) {\r
+ uip_arp_ipin();\r
+ uip_input();\r
+ if(uip_len > 0) {\r
+ uip_arp_out();\r
+ ethernet_devicedriver_send();\r
+ }\r
+ } else if(BUF->type == HTONS(UIP_ETHTYPE_ARP)) {\r
+ uip_arp_arpin();\r
+ if(uip_len > 0) {\r
+ ethernet_devicedriver_send();\r
+ }\r
+ }\r
+ \endcode\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_input() uip_process( UIP_DATA )\r
+\r
+/**\r
+ * Periodic processing for a connection identified by its number.\r
+ *\r
+ * This function does the necessary periodic processing (timers,\r
+ * polling) for a uIP TCP conneciton, and should be called when the\r
+ * periodic uIP timer goes off. It should be called for every\r
+ * connection, regardless of whether they are open of closed.\r
+ *\r
+ * When the function returns, it may have an outbound packet waiting\r
+ * for service in the uIP packet buffer, and if so the uip_len\r
+ * variable is set to a value larger than zero. The device driver\r
+ * should be called to send out the packet.\r
+ *\r
+ * The usual way of calling the function is through a for() loop like\r
+ * this:\r
+ \code\r
+ for(i = 0; i < UIP_CONNS; ++i) {\r
+ uip_periodic(i);\r
+ if(uip_len > 0) {\r
+ devicedriver_send();\r
+ }\r
+ }\r
+ \endcode\r
+ *\r
+ * \note If you are writing a uIP device driver that needs ARP\r
+ * (Address Resolution Protocol), e.g., when running uIP over\r
+ * Ethernet, you will need to call the uip_arp_out() function before\r
+ * calling the device driver:\r
+ \code\r
+ for(i = 0; i < UIP_CONNS; ++i) {\r
+ uip_periodic(i);\r
+ if(uip_len > 0) {\r
+ uip_arp_out();\r
+ ethernet_devicedriver_send();\r
+ }\r
+ }\r
+ \endcode\r
+ *\r
+ * \param conn The number of the connection which is to be periodically polled.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_TCP\r
+#define uip_periodic( conn ) \\r
+ do \\r
+ { \\r
+ uip_conn = &uip_conns[conn]; \\r
+ uip_process( UIP_TIMER ); \\r
+ } while( 0 )\r
+\r
+/**\r
+ *\r
+ *\r
+ */\r
+#define uip_conn_active( conn ) ( uip_conns[conn].tcpstateflags != UIP_CLOSED )\r
+\r
+/**\r
+ * Perform periodic processing for a connection identified by a pointer\r
+ * to its structure.\r
+ *\r
+ * Same as uip_periodic() but takes a pointer to the actual uip_conn\r
+ * struct instead of an integer as its argument. This function can be\r
+ * used to force periodic processing of a specific connection.\r
+ *\r
+ * \param conn A pointer to the uip_conn struct for the connection to\r
+ * be processed.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_periodic_conn( conn ) \\r
+ do \\r
+ { \\r
+ uip_conn = conn; \\r
+ uip_process( UIP_TIMER ); \\r
+ } while( 0 )\r
+\r
+/**\r
+ * Request that a particular connection should be polled.\r
+ *\r
+ * Similar to uip_periodic_conn() but does not perform any timer\r
+ * processing. The application is polled for new data.\r
+ *\r
+ * \param conn A pointer to the uip_conn struct for the connection to\r
+ * be processed.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_poll_conn( conn ) \\r
+ do \\r
+ { \\r
+ uip_conn = conn; \\r
+ uip_process( UIP_POLL_REQUEST ); \\r
+ } while( 0 )\r
+#endif /* UIP_TCP */\r
+\r
+#ifdef UIP_UDP\r
+\r
+/**\r
+ * Periodic processing for a UDP connection identified by its number.\r
+ *\r
+ * This function is essentially the same as uip_periodic(), but for\r
+ * UDP connections. It is called in a similar fashion as the\r
+ * uip_periodic() function:\r
+ \code\r
+ for(i = 0; i < UIP_UDP_CONNS; i++) {\r
+ uip_udp_periodic(i);\r
+ if(uip_len > 0) {\r
+ devicedriver_send();\r
+ }\r
+ }\r
+ \endcode\r
+ *\r
+ * \note As for the uip_periodic() function, special care has to be\r
+ * taken when using uIP together with ARP and Ethernet:\r
+ \code\r
+ for(i = 0; i < UIP_UDP_CONNS; i++) {\r
+ uip_udp_periodic(i);\r
+ if(uip_len > 0) {\r
+ uip_arp_out();\r
+ ethernet_devicedriver_send();\r
+ }\r
+ }\r
+ \endcode\r
+ *\r
+ * \param conn The number of the UDP connection to be processed.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_udp_periodic( conn ) \\r
+ do \\r
+ { \\r
+ uip_udp_conn = &uip_udp_conns[conn]; \\r
+ uip_process( UIP_UDP_TIMER ); \\r
+ } while( 0 )\r
+\r
+/**\r
+ * Periodic processing for a UDP connection identified by a pointer to\r
+ * its structure.\r
+ *\r
+ * Same as uip_udp_periodic() but takes a pointer to the actual\r
+ * uip_conn struct instead of an integer as its argument. This\r
+ * function can be used to force periodic processing of a specific\r
+ * connection.\r
+ *\r
+ * \param conn A pointer to the uip_udp_conn struct for the connection\r
+ * to be processed.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_udp_periodic_conn( conn ) \\r
+ do \\r
+ { \\r
+ uip_udp_conn = conn; \\r
+ uip_process( UIP_UDP_TIMER ); \\r
+ } while( 0 )\r
+#endif /* UIP_UDP */\r
+\r
+ /** \brief Abandon the reassembly of the current packet */\r
+ void uip_reass_over( void );\r
+\r
+/**\r
+ * The uIP packet buffer.\r
+ *\r
+ * The uip_buf array is used to hold incoming and outgoing\r
+ * packets. The device driver should place incoming data into this\r
+ * buffer. When sending data, the device driver should read the link\r
+ * level headers and the TCP/IP headers from this buffer. The size of\r
+ * the link level headers is configured by the UIP_LLH_LEN define.\r
+ *\r
+ * \note The application data need not be placed in this buffer, so\r
+ * the device driver must read it from the place pointed to by the\r
+ * uip_appdata pointer as illustrated by the following example:\r
+ \code\r
+ void\r
+ devicedriver_send(void)\r
+ {\r
+ hwsend(&uip_buf[0], UIP_LLH_LEN);\r
+ if(uip_len <= UIP_LLH_LEN + UIP_TCPIP_HLEN) {\r
+ hwsend(&uip_buf[UIP_LLH_LEN], uip_len - UIP_LLH_LEN);\r
+ } else {\r
+ hwsend(&uip_buf[UIP_LLH_LEN], UIP_TCPIP_HLEN);\r
+ hwsend(uip_appdata, uip_len - UIP_TCPIP_HLEN - UIP_LLH_LEN);\r
+ }\r
+ }\r
+ \endcode\r
+*/\r
+#ifndef UIP_CONF_EXTERNAL_BUFFER\r
+CCIF extern u8_t uip_buf[UIP_BUFSIZE + 2];\r
+#else\r
+CCIF extern unsigned char *uip_buf;\r
+#endif\r
+\r
+/** @} */\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/* Functions that are used by the uIP application program. Opening and\r
+ * closing connections, sending and receiving data, etc. is all\r
+ * handled by the functions below.\r
+ */\r
+\r
+/**\r
+ * \defgroup uipappfunc uIP application functions\r
+ * @{\r
+ *\r
+ * Functions used by an application running of top of uIP.\r
+ */\r
+\r
+/**\r
+ * Start listening to the specified port.\r
+ *\r
+ * \note Since this function expects the port number in network byte\r
+ * order, a conversion using HTONS() or htons() is necessary.\r
+ *\r
+ \code\r
+ uip_listen(HTONS(80));\r
+ \endcode\r
+ *\r
+ * \param port A 16-bit port number in network byte order.\r
+ */\r
+void uip_listen( u16_t port );\r
+\r
+/**\r
+ * Stop listening to the specified port.\r
+ *\r
+ * \note Since this function expects the port number in network byte\r
+ * order, a conversion using HTONS() or htons() is necessary.\r
+ *\r
+ \code\r
+ uip_unlisten(HTONS(80));\r
+ \endcode\r
+ *\r
+ * \param port A 16-bit port number in network byte order.\r
+ */\r
+void uip_unlisten( u16_t port );\r
+\r
+/**\r
+ * Connect to a remote host using TCP.\r
+ *\r
+ * This function is used to start a new connection to the specified\r
+ * port on the specified host. It allocates a new connection identifier,\r
+ * sets the connection to the SYN_SENT state and sets the\r
+ * retransmission timer to 0. This will cause a TCP SYN segment to be\r
+ * sent out the next time this connection is periodically processed,\r
+ * which usually is done within 0.5 seconds after the call to\r
+ * uip_connect().\r
+ *\r
+ * \note This function is available only if support for active open\r
+ * has been configured by defining UIP_ACTIVE_OPEN to 1 in uipopt.h.\r
+ *\r
+ * \note Since this function requires the port number to be in network\r
+ * byte order, a conversion using HTONS() or htons() is necessary.\r
+ *\r
+ \code\r
+ uip_ipaddr_t ipaddr;\r
+\r
+ uip_ipaddr(&ipaddr, 192,168,1,2);\r
+ uip_connect(&ipaddr, HTONS(80));\r
+ \endcode\r
+ *\r
+ * \param ripaddr The IP address of the remote host.\r
+ *\r
+ * \param port A 16-bit port number in network byte order.\r
+ *\r
+ * \return A pointer to the uIP connection identifier for the new connection,\r
+ * or NULL if no connection could be allocated.\r
+ *\r
+ */\r
+struct uip_conn *uip_connect( uip_ipaddr_t *ripaddr, u16_t port );\r
+\r
+/**\r
+ * \internal\r
+ *\r
+ * Check if a connection has outstanding (i.e., unacknowledged) data.\r
+ *\r
+ * \param conn A pointer to the uip_conn structure for the connection.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_outstanding( conn ) ( (conn)->len )\r
+\r
+/**\r
+ * Send data on the current connection.\r
+ *\r
+ * This function is used to send out a single segment of TCP\r
+ * data. Only applications that have been invoked by uIP for event\r
+ * processing can send data.\r
+ *\r
+ * The amount of data that actually is sent out after a call to this\r
+ * function is determined by the maximum amount of data TCP allows. uIP\r
+ * will automatically crop the data so that only the appropriate\r
+ * amount of data is sent. The function uip_mss() can be used to query\r
+ * uIP for the amount of data that actually will be sent.\r
+ *\r
+ * \note This function does not guarantee that the sent data will\r
+ * arrive at the destination. If the data is lost in the network, the\r
+ * application will be invoked with the uip_rexmit() event being\r
+ * set. The application will then have to resend the data using this\r
+ * function.\r
+ *\r
+ * \param data A pointer to the data which is to be sent.\r
+ *\r
+ * \param len The maximum amount of data bytes to be sent.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+CCIF void uip_send( const void *data, int len );\r
+\r
+/**\r
+ * The length of any incoming data that is currently available (if available)\r
+ * in the uip_appdata buffer.\r
+ *\r
+ * The test function uip_data() must first be used to check if there\r
+ * is any data available at all.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+\r
+/*void uip_datalen(void);*/\r
+#define uip_datalen() uip_len\r
+\r
+/**\r
+ * The length of any out-of-band data (urgent data) that has arrived\r
+ * on the connection.\r
+ *\r
+ * \note The configuration parameter UIP_URGDATA must be set for this\r
+ * function to be enabled.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_urgdatalen() uip_urglen\r
+\r
+/**\r
+ * Close the current connection.\r
+ *\r
+ * This function will close the current connection in a nice way.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_close() ( uip_flags = UIP_CLOSE )\r
+\r
+/**\r
+ * Abort the current connection.\r
+ *\r
+ * This function will abort (reset) the current connection, and is\r
+ * usually used when an error has occurred that prevents using the\r
+ * uip_close() function.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_abort() ( uip_flags = UIP_ABORT )\r
+\r
+/**\r
+ * Tell the sending host to stop sending data.\r
+ *\r
+ * This function will close our receiver's window so that we stop\r
+ * receiving data for the current connection.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_stop() ( uip_conn->tcpstateflags |= UIP_STOPPED )\r
+\r
+/**\r
+ * Find out if the current connection has been previously stopped with\r
+ * uip_stop().\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_stopped( conn ) ( (conn)->tcpstateflags & UIP_STOPPED )\r
+\r
+/**\r
+ * Restart the current connection, if is has previously been stopped\r
+ * with uip_stop().\r
+ *\r
+ * This function will open the receiver's window again so that we\r
+ * start receiving data for the current connection.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_restart() \\r
+ do \\r
+ { \\r
+ uip_flags |= UIP_NEWDATA; \\r
+ uip_conn->tcpstateflags &= ~UIP_STOPPED; \\r
+ } while( 0 )\r
+\r
+ /* uIP tests that can be made to determine in what state the current\r
+ connection is, and what the application function should do. */\r
+\r
+/**\r
+ * Is the current connection a UDP connection?\r
+ *\r
+ * This function checks whether the current connection is a UDP connection.\r
+ *\r
+ * \hideinitializer\r
+ *\r
+ */\r
+#define uip_udpconnection() ( uip_conn == NULL )\r
+\r
+/**\r
+ * Is new incoming data available?\r
+ *\r
+ * Will reduce to non-zero if there is new data for the application\r
+ * present at the uip_appdata pointer. The size of the data is\r
+ * available through the uip_len variable.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_newdata() ( uip_flags & UIP_NEWDATA )\r
+\r
+/**\r
+ * Has previously sent data been acknowledged?\r
+ *\r
+ * Will reduce to non-zero if the previously sent data has been\r
+ * acknowledged by the remote host. This means that the application\r
+ * can send new data.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_acked() ( uip_flags & UIP_ACKDATA )\r
+\r
+/**\r
+ * Has the connection just been connected?\r
+ *\r
+ * Reduces to non-zero if the current connection has been connected to\r
+ * a remote host. This will happen both if the connection has been\r
+ * actively opened (with uip_connect()) or passively opened (with\r
+ * uip_listen()).\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_connected() ( uip_flags & UIP_CONNECTED )\r
+\r
+/**\r
+ * Has the connection been closed by the other end?\r
+ *\r
+ * Is non-zero if the connection has been closed by the remote\r
+ * host. The application may then do the necessary clean-ups.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_closed() ( uip_flags & UIP_CLOSE )\r
+\r
+/**\r
+ * Has the connection been aborted by the other end?\r
+ *\r
+ * Non-zero if the current connection has been aborted (reset) by the\r
+ * remote host.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_aborted() ( uip_flags & UIP_ABORT )\r
+\r
+/**\r
+ * Has the connection timed out?\r
+ *\r
+ * Non-zero if the current connection has been aborted due to too many\r
+ * retransmissions.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_timedout() ( uip_flags & UIP_TIMEDOUT )\r
+\r
+/**\r
+ * Do we need to retransmit previously data?\r
+ *\r
+ * Reduces to non-zero if the previously sent data has been lost in\r
+ * the network, and the application should retransmit it. The\r
+ * application should send the exact same data as it did the last\r
+ * time, using the uip_send() function.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_rexmit() ( uip_flags & UIP_REXMIT )\r
+\r
+/**\r
+ * Is the connection being polled by uIP?\r
+ *\r
+ * Is non-zero if the reason the application is invoked is that the\r
+ * current connection has been idle for a while and should be\r
+ * polled.\r
+ *\r
+ * The polling event can be used for sending data without having to\r
+ * wait for the remote host to send data.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_poll() ( uip_flags & UIP_POLL )\r
+\r
+/**\r
+ * Get the initial maximum segment size (MSS) of the current\r
+ * connection.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_initialmss() ( uip_conn->initialmss )\r
+\r
+/**\r
+ * Get the current maximum segment size that can be sent on the current\r
+ * connection.\r
+ *\r
+ * The current maximum segment size that can be sent on the\r
+ * connection is computed from the receiver's window and the MSS of\r
+ * the connection (which also is available by calling\r
+ * uip_initialmss()).\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_mss() ( uip_conn->mss )\r
+ /**\r
+ * Set up a new UDP connection.\r
+ *\r
+ * This function sets up a new UDP connection. The function will\r
+ * automatically allocate an unused local port for the new\r
+ * connection. However, another port can be chosen by using the\r
+ * uip_udp_bind() call, after the uip_udp_new() function has been\r
+ * called.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t addr;\r
+ struct uip_udp_conn *c;\r
+ \r
+ uip_ipaddr(&addr, 192,168,2,1);\r
+ c = uip_udp_new(&addr, HTONS(12345));\r
+ if(c != NULL) {\r
+ uip_udp_bind(c, HTONS(12344));\r
+ }\r
+ \endcode\r
+ * \param ripaddr The IP address of the remote host.\r
+ *\r
+ * \param rport The remote port number in network byte order.\r
+ *\r
+ * \return The uip_udp_conn structure for the new connection or NULL\r
+ * if no connection could be allocated.\r
+ */\r
+ struct uip_udp_conn *uip_udp_new( const uip_ipaddr_t *ripaddr, u16_t rport );\r
+\r
+/**\r
+ * Removed a UDP connection.\r
+ *\r
+ * \param conn A pointer to the uip_udp_conn structure for the connection.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_udp_remove( conn ) ( conn )->lport = 0\r
+\r
+/**\r
+ * Bind a UDP connection to a local port.\r
+ *\r
+ * \param conn A pointer to the uip_udp_conn structure for the\r
+ * connection.\r
+ *\r
+ * \param port The local port number, in network byte order.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_udp_bind( conn, port ) ( conn )->lport = port\r
+\r
+/**\r
+ * Send a UDP datagram of length len on the current connection.\r
+ *\r
+ * This function can only be called in response to a UDP event (poll\r
+ * or newdata). The data must be present in the uip_buf buffer, at the\r
+ * place pointed to by the uip_appdata pointer.\r
+ *\r
+ * \param len The length of the data in the uip_buf buffer.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_udp_send( len ) uip_send( ( char * ) uip_appdata, len )\r
+\r
+/** @} */\r
+\r
+/* uIP convenience and converting functions. */\r
+\r
+/**\r
+ * \defgroup uipconvfunc uIP conversion functions\r
+ * @{\r
+ *\r
+ * These functions can be used for converting between different data\r
+ * formats used by uIP.\r
+ */\r
+\r
+/**\r
+ * Convert an IP address to four bytes separated by commas.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t ipaddr;\r
+ printf("ipaddr=%d.%d.%d.%d\n", uip_ipaddr_to_quad(&ipaddr));\r
+ \endcode\r
+ *\r
+ * \param a A pointer to a uip_ipaddr_t.\r
+ * \hideinitializer\r
+ */\r
+#define uip_ipaddr_to_quad( a ) ( a )->u8[0], ( a )->u8[1], ( a )->u8[2], ( a )->u8[3]\r
+\r
+/**\r
+ * Construct an IP address from four bytes.\r
+ *\r
+ * This function constructs an IP address of the type that uIP handles\r
+ * internally from four bytes. The function is handy for specifying IP\r
+ * addresses to use with e.g. the uip_connect() function.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t ipaddr;\r
+ struct uip_conn *c;\r
+ \r
+ uip_ipaddr(&ipaddr, 192,168,1,2);\r
+ c = uip_connect(&ipaddr, HTONS(80));\r
+ \endcode\r
+ *\r
+ * \param addr A pointer to a uip_ipaddr_t variable that will be\r
+ * filled in with the IP address.\r
+ *\r
+ * \param addr0 The first octet of the IP address.\r
+ * \param addr1 The second octet of the IP address.\r
+ * \param addr2 The third octet of the IP address.\r
+ * \param addr3 The forth octet of the IP address.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_ipaddr( addr, addr0, addr1, addr2, addr3 ) \\r
+ do \\r
+ { \\r
+ ( addr )->u8[0] = addr0; \\r
+ ( addr )->u8[1] = addr1; \\r
+ ( addr )->u8[2] = addr2; \\r
+ ( addr )->u8[3] = addr3; \\r
+ } while( 0 )\r
+\r
+/**\r
+ * Construct an IPv6 address from eight 16-bit words.\r
+ *\r
+ * This function constructs an IPv6 address.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_ip6addr( addr, addr0, addr1, addr2, addr3, addr4, addr5, addr6, addr7 ) \\r
+ do \\r
+ { \\r
+ ( addr )->u16[0] = HTONS( addr0 ); \\r
+ ( addr )->u16[1] = HTONS( addr1 ); \\r
+ ( addr )->u16[2] = HTONS( addr2 ); \\r
+ ( addr )->u16[3] = HTONS( addr3 ); \\r
+ ( addr )->u16[4] = HTONS( addr4 ); \\r
+ ( addr )->u16[5] = HTONS( addr5 ); \\r
+ ( addr )->u16[6] = HTONS( addr6 ); \\r
+ ( addr )->u16[7] = HTONS( addr7 ); \\r
+ } while( 0 ) /**\r
+ * Construct an IPv6 address from eight 8-bit words.\r
+ *\r
+ * This function constructs an IPv6 address.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_ip6addr_u8 ( addr, addr0, addr1, addr2, addr3, addr4, addr5, addr6, addr7, addr8, addr9, addr10, addr11, addr12, addr13, addr14, \\r
+ addr15 ) do \\r
+ {\\r
+ ( addr )->u8[0] = addr0; \\r
+ ( addr )->u8[1] = addr1; \\r
+ ( addr )->u8[2] = addr2; \\r
+ ( addr )->u8[3] = addr3; \\r
+ ( addr )->u8[4] = addr4; \\r
+ ( addr )->u8[5] = addr5; \\r
+ ( addr )->u8[6] = addr6; \\r
+ ( addr )->u8[7] = addr7; \\r
+ ( addr )->u8[8] = addr8; \\r
+ ( addr )->u8[9] = addr9; \\r
+ ( addr )->u8[10] = addr10; \\r
+ ( addr )->u8[11] = addr11; \\r
+ ( addr )->u8[12] = addr12; \\r
+ ( addr )->u8[13] = addr13; \\r
+ ( addr )->u8[14] = addr14; \\r
+ ( addr )->u8[15] = addr15; \\r
+ } while( 0 )\r
+ /**\r
+ * Copy an IP address to another IP address.\r
+ *\r
+ * Copies an IP address from one place to another.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t ipaddr1, ipaddr2;\r
+\r
+ uip_ipaddr(&ipaddr1, 192,16,1,2);\r
+ uip_ipaddr_copy(&ipaddr2, &ipaddr1);\r
+ \endcode\r
+ *\r
+ * \param dest The destination for the copy.\r
+ * \param src The source from where to copy.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifndef uip_ipaddr_copy\r
+#define uip_ipaddr_copy( dest, src ) ( *(dest) = *(src) )\r
+#endif\r
+\r
+ /**\r
+ * Compare two IP addresses\r
+ *\r
+ * Compares two IP addresses.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t ipaddr1, ipaddr2;\r
+\r
+ uip_ipaddr(&ipaddr1, 192,16,1,2);\r
+ if(uip_ipaddr_cmp(&ipaddr2, &ipaddr1)) {\r
+ printf("They are the same");\r
+ }\r
+ \endcode\r
+ *\r
+ * \param addr1 The first IP address.\r
+ * \param addr2 The second IP address.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#if !UIP_CONF_IPV6\r
+#define uip_ipaddr_cmp( addr1, addr2 ) ( (addr1)->u16[0] == (addr2)->u16[0] && (addr1)->u16[1] == (addr2)->u16[1] )\r
+#else /* !UIP_CONF_IPV6 */\r
+#define uip_ipaddr_cmp( addr1, addr2 ) ( memcmp(addr1, addr2, sizeof(uip_ip6addr_t)) == 0 )\r
+#endif /* !UIP_CONF_IPV6 */\r
+\r
+ /**\r
+ * Compare two IP addresses with netmasks\r
+ *\r
+ * Compares two IP addresses with netmasks. The masks are used to mask\r
+ * out the bits that are to be compared.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t ipaddr1, ipaddr2, mask;\r
+\r
+ uip_ipaddr(&mask, 255,255,255,0);\r
+ uip_ipaddr(&ipaddr1, 192,16,1,2);\r
+ uip_ipaddr(&ipaddr2, 192,16,1,3);\r
+ if(uip_ipaddr_maskcmp(&ipaddr1, &ipaddr2, &mask)) {\r
+ printf("They are the same");\r
+ }\r
+ \endcode\r
+ *\r
+ * \param addr1 The first IP address.\r
+ * \param addr2 The second IP address.\r
+ * \param mask The netmask.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#if !UIP_CONF_IPV6\r
+#define uip_ipaddr_maskcmp( addr1, addr2, mask ) \\r
+ ( \\r
+ (((( u16_t * ) addr1)[0] & (( u16_t * ) mask)[0]) == ((( u16_t * ) addr2)[0] & (( u16_t * ) mask)[0])) && \\r
+ (((( u16_t * ) addr1)[1] & (( u16_t * ) mask)[1]) == ((( u16_t * ) addr2)[1] & (( u16_t * ) mask)[1])) \\r
+ )\r
+#else\r
+#define uip_ipaddr_prefixcmp( addr1, addr2, length ) ( memcmp(addr1, addr2, length >> 3) == 0 )\r
+#endif\r
+\r
+ /**\r
+ * Check if an address is a broadcast address for a network.\r
+ *\r
+ * Checks if an address is the broadcast address for a network. The\r
+ * network is defined by an IP address that is on the network and the\r
+ * network's netmask.\r
+ *\r
+ * \param addr The IP address.\r
+ * \param netaddr The network's IP address.\r
+ * \param netmask The network's netmask.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+\r
+ /*#define uip_ipaddr_isbroadcast(addr, netaddr, netmask)\r
+ ((uip_ipaddr_t *)(addr)).u16 & ((uip_ipaddr_t *)(addr)).u16*/\r
+\r
+/**\r
+ * Mask out the network part of an IP address.\r
+ *\r
+ * Masks out the network part of an IP address, given the address and\r
+ * the netmask.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t ipaddr1, ipaddr2, netmask;\r
+\r
+ uip_ipaddr(&ipaddr1, 192,16,1,2);\r
+ uip_ipaddr(&netmask, 255,255,255,0);\r
+ uip_ipaddr_mask(&ipaddr2, &ipaddr1, &netmask);\r
+ \endcode\r
+ *\r
+ * In the example above, the variable "ipaddr2" will contain the IP\r
+ * address 192.168.1.0.\r
+ *\r
+ * \param dest Where the result is to be placed.\r
+ * \param src The IP address.\r
+ * \param mask The netmask.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_ipaddr_mask( dest, src, mask ) \\r
+ do \\r
+ { \\r
+ ( ( u16_t * ) dest )[0] = ( ( u16_t * ) src )[0] & ( ( u16_t * ) mask )[0]; \\r
+ ( ( u16_t * ) dest )[1] = ( ( u16_t * ) src )[1] & ( ( u16_t * ) mask )[1]; \\r
+ } while( 0 )\r
+\r
+/**\r
+ * Pick the first octet of an IP address.\r
+ *\r
+ * Picks out the first octet of an IP address.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t ipaddr;\r
+ u8_t octet;\r
+\r
+ uip_ipaddr(&ipaddr, 1,2,3,4);\r
+ octet = uip_ipaddr1(&ipaddr);\r
+ \endcode\r
+ *\r
+ * In the example above, the variable "octet" will contain the value 1.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_ipaddr1( addr ) ( (addr)->u8[0] )\r
+\r
+/**\r
+ * Pick the second octet of an IP address.\r
+ *\r
+ * Picks out the second octet of an IP address.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t ipaddr;\r
+ u8_t octet;\r
+\r
+ uip_ipaddr(&ipaddr, 1,2,3,4);\r
+ octet = uip_ipaddr2(&ipaddr);\r
+ \endcode\r
+ *\r
+ * In the example above, the variable "octet" will contain the value 2.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_ipaddr2( addr ) ( (addr)->u8[1] )\r
+\r
+/**\r
+ * Pick the third octet of an IP address.\r
+ *\r
+ * Picks out the third octet of an IP address.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t ipaddr;\r
+ u8_t octet;\r
+\r
+ uip_ipaddr(&ipaddr, 1,2,3,4);\r
+ octet = uip_ipaddr3(&ipaddr);\r
+ \endcode\r
+ *\r
+ * In the example above, the variable "octet" will contain the value 3.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_ipaddr3( addr ) ( (addr)->u8[2] )\r
+\r
+/**\r
+ * Pick the fourth octet of an IP address.\r
+ *\r
+ * Picks out the fourth octet of an IP address.\r
+ *\r
+ * Example:\r
+ \code\r
+ uip_ipaddr_t ipaddr;\r
+ u8_t octet;\r
+\r
+ uip_ipaddr(&ipaddr, 1,2,3,4);\r
+ octet = uip_ipaddr4(&ipaddr);\r
+ \endcode\r
+ *\r
+ * In the example above, the variable "octet" will contain the value 4.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_ipaddr4( addr ) ( (addr)->u8[3] )\r
+ /**\r
+ * Convert 16-bit quantity from host byte order to network byte order.\r
+ *\r
+ * This macro is primarily used for converting constants from host\r
+ * byte order to network byte order. For converting variables to\r
+ * network byte order, use the htons() function instead.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifndef HTONS\r
+#if UIP_BYTE_ORDER == UIP_BIG_ENDIAN\r
+#define HTONS( n ) ( n )\r
+#define HTONL( n ) ( n )\r
+#else /* UIP_BYTE_ORDER == UIP_BIG_ENDIAN */\r
+#define HTONS( n ) ( u16_t ) ( (((u16_t) (n)) << 8) | (((u16_t) (n)) >> 8) )\r
+#define HTONL( n ) ( ((u32_t) HTONS(n) << 16) | HTONS((u32_t) (n) >> 16) )\r
+#endif /* UIP_BYTE_ORDER == UIP_BIG_ENDIAN */\r
+#else\r
+#error "HTONS already defined!"\r
+#endif /* HTONS */\r
+\r
+ /**\r
+ * Convert 16-bit quantity from host byte order to network byte order.\r
+ *\r
+ * This function is primarily used for converting variables from host\r
+ * byte order to network byte order. For converting constants to\r
+ * network byte order, use the HTONS() macro instead.\r
+ */\r
+#ifndef htons\r
+ CCIF u16_t htons( u16_t val );\r
+#endif /* htons */\r
+\r
+#ifndef ntohs\r
+ #define ntohs htons\r
+#endif\r
+\r
+#ifndef htonl\r
+ CCIF u32_t htonl( u32_t val );\r
+#endif /* htonl */\r
+\r
+#ifndef ntohl\r
+ #define ntohl htonl\r
+#endif\r
+\r
+/** @} */\r
+\r
+/**\r
+ * Pointer to the application data in the packet buffer.\r
+ *\r
+ * This pointer points to the application data when the application is\r
+ * called. If the application wishes to send data, the application may\r
+ * use this space to write the data into before calling uip_send().\r
+ */\r
+CCIF extern void *uip_appdata;\r
+\r
+#if UIP_URGDATA > 0\r
+\r
+/* u8_t *uip_urgdata:\r
+ *\r
+ * This pointer points to any urgent data that has been received. Only\r
+ * present if compiled with support for urgent data (UIP_URGDATA).\r
+ */\r
+extern void *uip_urgdata;\r
+#endif /* UIP_URGDATA > 0 */\r
+\r
+/**\r
+ * \defgroup uipdrivervars Variables used in uIP device drivers\r
+ * @{\r
+ *\r
+ * uIP has a few global variables that are used in device drivers for\r
+ * uIP.\r
+ */\r
+\r
+/**\r
+ * The length of the packet in the uip_buf buffer.\r
+ *\r
+ * The global variable uip_len holds the length of the packet in the\r
+ * uip_buf buffer.\r
+ *\r
+ * When the network device driver calls the uIP input function,\r
+ * uip_len should be set to the length of the packet in the uip_buf\r
+ * buffer.\r
+ *\r
+ * When sending packets, the device driver should use the contents of\r
+ * the uip_len variable to determine the length of the outgoing\r
+ * packet.\r
+ *\r
+ */\r
+CCIF extern u16_t uip_len;\r
+\r
+/**\r
+ * The length of the extension headers\r
+ */\r
+extern u8_t uip_ext_len;\r
+\r
+/** @} */\r
+#if UIP_URGDATA > 0\r
+extern u16_t uip_urglen, uip_surglen;\r
+#endif /* UIP_URGDATA > 0 */\r
+\r
+/**\r
+ * Representation of a uIP TCP connection.\r
+ *\r
+ * The uip_conn structure is used for identifying a connection. All\r
+ * but one field in the structure are to be considered read-only by an\r
+ * application. The only exception is the appstate field whose purpose\r
+ * is to let the application store application-specific state (e.g.,\r
+ * file pointers) for the connection. The type of this field is\r
+ * configured in the "uipopt.h" header file.\r
+ */\r
+struct uip_conn\r
+{\r
+ uip_ipaddr_t ripaddr; /**< The IP address of the remote host. */\r
+\r
+ u16_t lport; /**< The local TCP port, in network byte order. */\r
+ u16_t rport; /**< The local remote TCP port, in network byte\r
+ order. */\r
+\r
+ u8_t rcv_nxt[4]; /**< The sequence number that we expect to\r
+ receive next. */\r
+ u8_t snd_nxt[4]; /**< The sequence number that was last sent by\r
+ us. */\r
+ u16_t len; /**< Length of the data that was previously sent. */\r
+ u16_t mss; /**< Current maximum segment size for the\r
+ connection. */\r
+ u16_t initialmss; /**< Initial maximum segment size for the\r
+ connection. */\r
+ u8_t sa; /**< Retransmission time-out calculation state\r
+ variable. */\r
+ u8_t sv; /**< Retransmission time-out calculation state\r
+ variable. */\r
+ u8_t rto; /**< Retransmission time-out. */\r
+ u8_t tcpstateflags; /**< TCP state and flags. */\r
+ u8_t timer; /**< The retransmission timer. */\r
+ u8_t nrtx; /**< The number of retransmissions for the last\r
+ segment sent. */\r
+\r
+ /** The application state. */\r
+ uip_tcp_appstate_t appstate;\r
+};\r
+\r
+/**\r
+ * Pointer to the current TCP connection.\r
+ *\r
+ * The uip_conn pointer can be used to access the current TCP\r
+ * connection.\r
+ */\r
+CCIF extern struct uip_conn *uip_conn;\r
+#ifdef UIP_TCP\r
+\r
+/* The array containing all uIP connections. */\r
+CCIF extern struct uip_conn uip_conns[UIP_CONNS];\r
+#endif\r
+\r
+/**\r
+ * \addtogroup uiparch\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * 4-byte array used for the 32-bit sequence number calculations.\r
+ */\r
+extern u8_t uip_acc32[4];\r
+\r
+/** @} */\r
+#if UIP_UDP == 1\r
+/**\r
+ * Representation of a uIP UDP connection.\r
+ */\r
+struct uip_udp_conn\r
+{\r
+ uip_ipaddr_t ripaddr; /**< The IP address of the remote peer. */\r
+ u16_t lport; /**< The local port number in network byte order. */\r
+ u16_t rport; /**< The remote port number in network byte order. */\r
+ u8_t ttl; /**< Default time-to-live. */\r
+\r
+ /** The application state. */\r
+ uip_udp_appstate_t appstate;\r
+};\r
+\r
+/**\r
+ * The current UDP connection.\r
+ */\r
+extern struct uip_udp_conn *uip_udp_conn;\r
+extern struct uip_udp_conn uip_udp_conns[UIP_UDP_CONNS];\r
+#endif /* UIP_UDP */\r
+\r
+struct uip_router\r
+{\r
+ int ( *activate ) ( void );\r
+ int ( *deactivate ) ( void );\r
+ uip_ipaddr_t * ( *lookup ) ( uip_ipaddr_t *destipaddr, uip_ipaddr_t *nexthop );\r
+};\r
+\r
+#ifdef UIP_CONF_ROUTER\r
+extern const struct uip_router *uip_router;\r
+\r
+/**\r
+ * uIP routing driver registration function.\r
+ */\r
+void uip_router_register( const struct uip_router *router );\r
+#endif /*UIP_CONF_ROUTER*/\r
+\r
+#ifdef UIP_CONF_ICMP6\r
+struct uip_icmp6_conn\r
+{\r
+ uip_icmp6_appstate_t appstate;\r
+};\r
+extern struct uip_icmp6_conn uip_icmp6_conns;\r
+#endif /*UIP_CONF_ICMP6*/\r
+\r
+/**\r
+ * The uIP TCP/IP statistics.\r
+ *\r
+ * This is the variable in which the uIP TCP/IP statistics are gathered.\r
+ */\r
+#if UIP_STATISTICS == 1\r
+extern struct uip_stats uip_stat;\r
+#define UIP_STAT( s ) s\r
+#else\r
+#define UIP_STAT( s )\r
+#endif /* UIP_STATISTICS == 1 */\r
+\r
+/**\r
+ * The structure holding the TCP/IP statistics that are gathered if\r
+ * UIP_STATISTICS is set to 1.\r
+ *\r
+ */\r
+struct uip_stats\r
+{\r
+ struct\r
+ {\r
+ uip_stats_t recv; /**< Number of received packets at the IP\r
+ layer. */\r
+ uip_stats_t sent; /**< Number of sent packets at the IP\r
+ layer. */\r
+ uip_stats_t forwarded; /**< Number of forwarded packets at the IP \r
+ layer. */\r
+ uip_stats_t drop; /**< Number of dropped packets at the IP\r
+ layer. */\r
+ uip_stats_t vhlerr; /**< Number of packets dropped due to wrong\r
+ IP version or header length. */\r
+ uip_stats_t hblenerr; /**< Number of packets dropped due to wrong\r
+ IP length, high byte. */\r
+ uip_stats_t lblenerr; /**< Number of packets dropped due to wrong\r
+ IP length, low byte. */\r
+ uip_stats_t fragerr; /**< Number of packets dropped since they\r
+ were IP fragments. */\r
+ uip_stats_t chkerr; /**< Number of packets dropped due to IP\r
+ checksum errors. */\r
+ uip_stats_t protoerr; /**< Number of packets dropped since they\r
+ were neither ICMP, UDP nor TCP. */\r
+ } ip; /**< IP statistics. */\r
+ struct\r
+ {\r
+ uip_stats_t recv; /**< Number of received ICMP packets. */\r
+ uip_stats_t sent; /**< Number of sent ICMP packets. */\r
+ uip_stats_t drop; /**< Number of dropped ICMP packets. */\r
+ uip_stats_t typeerr; /**< Number of ICMP packets with a wrong\r
+ type. */\r
+ uip_stats_t chkerr; /**< Number of ICMP packets with a bad\r
+ checksum. */\r
+ } icmp; /**< ICMP statistics. */\r
+#ifdef UIP_TCP\r
+ struct\r
+ {\r
+ uip_stats_t recv; /**< Number of recived TCP segments. */\r
+ uip_stats_t sent; /**< Number of sent TCP segments. */\r
+ uip_stats_t drop; /**< Number of dropped TCP segments. */\r
+ uip_stats_t chkerr; /**< Number of TCP segments with a bad\r
+ checksum. */\r
+ uip_stats_t ackerr; /**< Number of TCP segments with a bad ACK\r
+ number. */\r
+ uip_stats_t rst; /**< Number of recevied TCP RST (reset) segments. */\r
+ uip_stats_t rexmit; /**< Number of retransmitted TCP segments. */\r
+ uip_stats_t syndrop; /**< Number of dropped SYNs due to too few\r
+ connections was avaliable. */\r
+ uip_stats_t synrst; /**< Number of SYNs for closed ports,\r
+ triggering a RST. */\r
+ } tcp; /**< TCP statistics. */\r
+#endif\r
+#ifdef UIP_UDP\r
+ struct\r
+ {\r
+ uip_stats_t drop; /**< Number of dropped UDP segments. */\r
+ uip_stats_t recv; /**< Number of recived UDP segments. */\r
+ uip_stats_t sent; /**< Number of sent UDP segments. */\r
+ uip_stats_t chkerr; /**< Number of UDP segments with a bad\r
+ checksum. */\r
+ } udp; /**< UDP statistics. */\r
+#endif /* UIP_UDP */\r
+#if UIP_CONF_IPV6 != 0\r
+ struct\r
+ {\r
+ uip_stats_t drop; /**< Number of dropped ND6 packets. */\r
+ uip_stats_t recv; /**< Number of recived ND6 packets */\r
+ uip_stats_t sent; /**< Number of sent ND6 packets */\r
+ } nd6;\r
+#endif /*UIP_CONF_IPV6*/\r
+};\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/* All the stuff below this point is internal to uIP and should not be\r
+ * used directly by an application or by a device driver.\r
+ */\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/* u8_t uip_flags:\r
+ *\r
+ * When the application is called, uip_flags will contain the flags\r
+ * that are defined in this file. Please read below for more\r
+ * information.\r
+ */\r
+CCIF extern u8_t uip_flags;\r
+\r
+/* The following flags may be set in the global variable uip_flags\r
+ before calling the application callback. The UIP_ACKDATA,\r
+ UIP_NEWDATA, and UIP_CLOSE flags may both be set at the same time,\r
+ whereas the others are mutually exclusive. Note that these flags\r
+ should *NOT* be accessed directly, but only through the uIP\r
+ functions/macros. */\r
+#define UIP_ACKDATA 1 /* Signifies that the outstanding data was\r
+ acked and the application should send\r
+ out new data instead of retransmitting\r
+ the last data. */\r
+#define UIP_NEWDATA 2 /* Flags the fact that the peer has sent\r
+ us new data. */\r
+#define UIP_REXMIT 4 /* Tells the application to retransmit the\r
+ data that was last sent. */\r
+#define UIP_POLL 8 /* Used for polling the application, to\r
+ check if the application has data that\r
+ it wants to send. */\r
+#define UIP_CLOSE 16 /* The remote host has closed the\r
+ connection, thus the connection has\r
+ gone away. Or the application signals\r
+ that it wants to close the\r
+ connection. */\r
+#define UIP_ABORT 32 /* The remote host has aborted the\r
+ connection, thus the connection has\r
+ gone away. Or the application signals\r
+ that it wants to abort the\r
+ connection. */\r
+#define UIP_CONNECTED 64 /* We have got a connection from a remote\r
+ host and have set up a new connection\r
+ for it, or an active connection has\r
+ been successfully established. */\r
+\r
+#define UIP_TIMEDOUT 128 /* The connection has been aborted due to\r
+ too many retransmissions. */\r
+\r
+/**\r
+ * \brief process the options within a hop by hop or destination option header\r
+ * \retval 0: nothing to send,\r
+ * \retval 1: drop pkt\r
+ * \retval 2: ICMP error message to send\r
+*/\r
+\r
+/*static u8_t\r
+uip_ext_hdr_options_process(); */\r
+\r
+/* uip_process(flag):\r
+ *\r
+ * The actual uIP function which does all the work.\r
+ */\r
+void uip_process( u8_t flag );\r
+\r
+/* The following flags are passed as an argument to the uip_process()\r
+ function. They are used to distinguish between the two cases where\r
+ uip_process() is called. It can be called either because we have\r
+ incoming data that should be processed, or because the periodic\r
+ timer has fired. These values are never used directly, but only in\r
+ the macros defined in this file. */\r
+#define UIP_DATA 1 /* Tells uIP that there is incoming\r
+ data in the uip_buf buffer. The\r
+ length of the data is stored in the\r
+ global variable uip_len. */\r
+#define UIP_TIMER 2 /* Tells uIP that the periodic timer\r
+ has fired. */\r
+#define UIP_POLL_REQUEST 3 /* Tells uIP that a connection should\r
+ be polled. */\r
+#define UIP_UDP_SEND_CONN 4 /* Tells uIP that a UDP datagram\r
+ should be constructed in the\r
+ uip_buf buffer. */\r
+#ifdef UIP_UDP\r
+#define UIP_UDP_TIMER 5\r
+#endif /* UIP_UDP */\r
+\r
+/* The TCP states used in the uip_conn->tcpstateflags. */\r
+#define UIP_CLOSED 0\r
+#define UIP_SYN_RCVD 1\r
+#define UIP_SYN_SENT 2\r
+#define UIP_ESTABLISHED 3\r
+#define UIP_FIN_WAIT_1 4\r
+#define UIP_FIN_WAIT_2 5\r
+#define UIP_CLOSING 6\r
+#define UIP_TIME_WAIT 7\r
+#define UIP_LAST_ACK 8\r
+#define UIP_TS_MASK 15\r
+\r
+#define UIP_STOPPED 16\r
+\r
+/* The TCP and IP headers. */\r
+#include "net/pack_struct_start.h"\r
+struct uip_tcpip_hdr\r
+{\r
+#if UIP_CONF_IPV6 != 0\r
+ /* IPv6 header. */\r
+ u8_t vtc, tcflow;\r
+ u16_t flow;\r
+ u8_t len[2];\r
+ u8_t proto, ttl;\r
+ uip_ip6addr_t srcipaddr, destipaddr;\r
+#else /* UIP_CONF_IPV6 */\r
+ /* IPv4 header. */\r
+ u8_t vhl, tos, len[2], ipid[2], ipoffset[2], ttl, proto;\r
+ u16_t ipchksum;\r
+ uip_ipaddr_t srcipaddr, destipaddr;\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+ /* TCP header. */\r
+ u16_t srcport, destport;\r
+ u8_t seqno[4], ackno[4], tcpoffset, flags, wnd[2];\r
+ u16_t tcpchksum;\r
+ u8_t urgp[2];\r
+ u8_t optdata[4];\r
+}\r
+\r
+#include "net/pack_struct_end.h"\r
+\r
+/* The ICMP and IP headers. */\r
+#include "net/pack_struct_start.h"\r
+struct uip_icmpip_hdr\r
+{\r
+#if UIP_CONF_IPV6 != 0\r
+ /* IPv6 header. */\r
+ u8_t vtc, tcf;\r
+ u16_t flow;\r
+ u8_t len[2];\r
+ u8_t proto, ttl;\r
+ uip_ip6addr_t srcipaddr, destipaddr;\r
+#else /* UIP_CONF_IPV6 */\r
+ /* IPv4 header. */\r
+ u8_t vhl, tos, len[2], ipid[2], ipoffset[2], ttl, proto;\r
+ u16_t ipchksum;\r
+ uip_ipaddr_t srcipaddr, destipaddr;\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+ /* ICMP header. */\r
+ u8_t type, icode;\r
+ u16_t icmpchksum;\r
+#if !UIP_CONF_IPV6\r
+ u16_t id, seqno;\r
+ u8_t payload[1];\r
+#endif /* !UIP_CONF_IPV6 */\r
+}\r
+\r
+#include "net/pack_struct_end.h"\r
+\r
+/* The UDP and IP headers. */\r
+#include "net/pack_struct_start.h"\r
+struct uip_udpip_hdr\r
+{\r
+#if UIP_CONF_IPV6 != 0\r
+ /* IPv6 header. */\r
+ u8_t vtc, tcf;\r
+ u16_t flow;\r
+ u8_t len[2];\r
+ u8_t proto, ttl;\r
+ uip_ip6addr_t srcipaddr, destipaddr;\r
+#else /* UIP_CONF_IPV6 */\r
+ /* IP header. */\r
+ u8_t vhl, tos, len[2], ipid[2], ipoffset[2], ttl, proto;\r
+ u16_t ipchksum;\r
+ uip_ipaddr_t srcipaddr, destipaddr;\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+ /* UDP header. */\r
+ u16_t srcport, destport;\r
+ u16_t udplen;\r
+ u16_t udpchksum;\r
+}\r
+\r
+#include "net/pack_struct_end.h"\r
+\r
+/*\r
+ * In IPv6 the length of the L3 headers before the transport header is\r
+ * not fixed, due to the possibility to include extension option headers\r
+ * after the IP header. hence we split here L3 and L4 headers\r
+ */\r
+\r
+/* The IP header */\r
+struct uip_ip_hdr\r
+{\r
+#if UIP_CONF_IPV6 != 0\r
+ /* IPV6 header */\r
+ u8_t vtc;\r
+ u8_t tcflow;\r
+ u16_t flow;\r
+ u8_t len[2];\r
+ u8_t proto, ttl;\r
+ uip_ip6addr_t srcipaddr, destipaddr;\r
+#else /* UIP_CONF_IPV6 */\r
+ /* IPV4 header */\r
+ u8_t vhl, tos, len[2], ipid[2], ipoffset[2], ttl, proto;\r
+ u16_t ipchksum;\r
+ uip_ipaddr_t srcipaddr, destipaddr;\r
+#endif /* UIP_CONF_IPV6 */\r
+};\r
+\r
+/*\r
+ * IPv6 extension option headers: we are able to process\r
+ * the 4 extension headers defined in RFC2460 (IPv6):\r
+ * - Hop by hop option header, destination option header:\r
+ * These two are not used by any core IPv6 protocol, hence\r
+ * we just read them and go to the next. They convey options,\r
+ * the options defined in RFC2460 are Pad1 and PadN, which do\r
+ * some padding, and that we do not need to read (the length\r
+ * field in the header is enough)\r
+ * - Routing header: this one is most notably used by MIPv6,\r
+ * which we do not implement, hence we just read it and go\r
+ * to the next\r
+ * - Fragmentation header: we read this header and are able to\r
+ * reassemble packets\r
+ *\r
+ * We do not offer any means to send packets with extension headers\r
+ *\r
+ * We do not implement Authentication and ESP headers, which are\r
+ * used in IPSec and defined in RFC4302,4303,4305,4385\r
+ */\r
+\r
+/* common header part */\r
+struct uip_ext_hdr\r
+{\r
+ u8_t next;\r
+ u8_t len;\r
+};\r
+\r
+/* Hop by Hop option header */\r
+struct uip_hbho_hdr\r
+{\r
+ u8_t next;\r
+ u8_t len;\r
+};\r
+\r
+/* destination option header */\r
+struct uip_desto_hdr\r
+{\r
+ u8_t next;\r
+ u8_t len;\r
+};\r
+\r
+/* We do not define structures for PAD1 and PADN options */\r
+\r
+/*\r
+ * routing header\r
+ * the routing header as 4 common bytes, then routing header type\r
+ * specific data there are several types of routing header. Type 0 was\r
+ * deprecated as per RFC5095 most notable other type is 2, used in\r
+ * RFC3775 (MIPv6) here we do not implement MIPv6, so we just need to\r
+ * parse the 4 first bytes\r
+ */\r
+struct uip_routing_hdr\r
+{\r
+ u8_t next;\r
+ u8_t len;\r
+ u8_t routing_type;\r
+ u8_t seg_left;\r
+};\r
+\r
+/* fragmentation header */\r
+struct uip_frag_hdr\r
+{\r
+ u8_t next;\r
+ u8_t res;\r
+ u16_t offsetresmore;\r
+ u32_t id;\r
+};\r
+\r
+/*\r
+ * an option within the destination or hop by hop option headers\r
+ * it contains type an length, which is true for all options but PAD1\r
+ */\r
+struct uip_ext_hdr_opt\r
+{\r
+ u8_t type;\r
+ u8_t len;\r
+};\r
+\r
+/* PADN option */\r
+struct uip_ext_hdr_opt_padn\r
+{\r
+ u8_t opt_type;\r
+ u8_t opt_len;\r
+};\r
+\r
+/* TCP header */\r
+struct uip_tcp_hdr\r
+{\r
+ u16_t srcport;\r
+ u16_t destport;\r
+ u8_t seqno[4];\r
+ u8_t ackno[4];\r
+ u8_t tcpoffset;\r
+ u8_t flags;\r
+ u8_t wnd[2];\r
+ u16_t tcpchksum;\r
+ u8_t urgp[2];\r
+ u8_t optdata[4];\r
+};\r
+\r
+/* The ICMP headers. */\r
+struct uip_icmp_hdr\r
+{\r
+ u8_t type, icode;\r
+ u16_t icmpchksum;\r
+#if !UIP_CONF_IPV6\r
+ u16_t id, seqno;\r
+#endif /* !UIP_CONF_IPV6 */\r
+};\r
+\r
+/* The UDP headers. */\r
+struct uip_udp_hdr\r
+{\r
+ u16_t srcport;\r
+ u16_t destport;\r
+ u16_t udplen;\r
+ u16_t udpchksum;\r
+};\r
+\r
+/**\r
+ * The buffer size available for user data in the \ref uip_buf buffer.\r
+ *\r
+ * This macro holds the available size for user data in the \ref\r
+ * uip_buf buffer. The macro is intended to be used for checking\r
+ * bounds of available user data.\r
+ *\r
+ * Example:\r
+ \code\r
+ snprintf(uip_appdata, UIP_APPDATA_SIZE, "%u\n", i);\r
+ \endcode\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define UIP_APPDATA_SIZE ( UIP_BUFSIZE - UIP_LLH_LEN - UIP_TCPIP_HLEN )\r
+#define UIP_APPDATA_PTR ( void * ) &uip_buf[UIP_LLH_LEN + UIP_TCPIP_HLEN]\r
+\r
+#define UIP_PROTO_ICMP 1\r
+#define UIP_PROTO_TCP 6\r
+#define UIP_PROTO_UDP 17\r
+#define UIP_PROTO_ICMP6 58\r
+\r
+#if UIP_CONF_IPV6 != 0\r
+\r
+/** @{ */\r
+\r
+/** \brief extension headers types */\r
+#define UIP_PROTO_HBHO 0\r
+#define UIP_PROTO_DESTO 60\r
+#define UIP_PROTO_ROUTING 43\r
+#define UIP_PROTO_FRAG 44\r
+#define UIP_PROTO_NONE 59\r
+\r
+/** @} */\r
+\r
+/** @{ */\r
+\r
+/** \brief Destination and Hop By Hop extension headers option types */\r
+#define UIP_EXT_HDR_OPT_PAD1 0\r
+#define UIP_EXT_HDR_OPT_PADN 1\r
+\r
+/** @} */\r
+\r
+/** @{ */\r
+\r
+/**\r
+ * \brief Bitmaps for extension header processing\r
+ *\r
+ * When processing extension headers, we should record somehow which one we\r
+ * see, because you cannot have twice the same header, except for destination\r
+ * We store all this in one u8_t bitmap one bit for each header expected. The\r
+ * order in the bitmap is the order recommended in RFC2460\r
+ */\r
+#define UIP_EXT_HDR_BITMAP_HBHO 0x01\r
+#define UIP_EXT_HDR_BITMAP_DESTO1 0x02\r
+#define UIP_EXT_HDR_BITMAP_ROUTING 0x04\r
+#define UIP_EXT_HDR_BITMAP_FRAG 0x08\r
+#define UIP_EXT_HDR_BITMAP_AH 0x10\r
+#define UIP_EXT_HDR_BITMAP_ESP 0x20\r
+#define UIP_EXT_HDR_BITMAP_DESTO2 0x40\r
+\r
+/** @} */\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+/* Header sizes. */\r
+#if UIP_CONF_IPV6 != 0\r
+#define UIP_IPH_LEN 40\r
+#define UIP_FRAGH_LEN 8\r
+#else /* UIP_CONF_IPV6 */\r
+#define UIP_IPH_LEN 20 /* Size of IP header */\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+#define UIP_UDPH_LEN 8 /* Size of UDP header */\r
+#define UIP_TCPH_LEN 20 /* Size of TCP header */\r
+#ifdef UIP_IPH_LEN\r
+#define UIP_ICMPH_LEN 4 /* Size of ICMP header */\r
+#endif\r
+#define UIP_IPUDPH_LEN ( UIP_UDPH_LEN + UIP_IPH_LEN ) /* Size of IP +\r
+ * UDP\r
+ * header */\r
+#define UIP_IPTCPH_LEN ( UIP_TCPH_LEN + UIP_IPH_LEN ) /* Size of IP +\r
+ * TCP\r
+ * header */\r
+#define UIP_TCPIP_HLEN UIP_IPTCPH_LEN\r
+#define UIP_IPICMPH_LEN ( UIP_IPH_LEN + UIP_ICMPH_LEN ) /* size of ICMP\r
+ + IP header */\r
+#define UIP_LLIPH_LEN ( UIP_LLH_LEN + UIP_IPH_LEN ) /* size of L2\r
+ + IP header */\r
+#if UIP_CONF_IPV6 != 0\r
+\r
+/**\r
+ * The sums below are quite used in ND. When used for uip_buf, we\r
+ * include link layer length when used for uip_len, we do not, hence\r
+ * we need values with and without LLH_LEN we do not use capital\r
+ * letters as these values are variable\r
+ */\r
+#define uip_l2_l3_hdr_len ( UIP_LLH_LEN + UIP_IPH_LEN + uip_ext_len )\r
+#define uip_l2_l3_icmp_hdr_len ( UIP_LLH_LEN + UIP_IPH_LEN + uip_ext_len + UIP_ICMPH_LEN )\r
+#define uip_l3_hdr_len ( UIP_IPH_LEN + uip_ext_len )\r
+#define uip_l3_icmp_hdr_len ( UIP_IPH_LEN + uip_ext_len + UIP_ICMPH_LEN )\r
+#endif /*UIP_CONF_IPV6*/\r
+\r
+#ifdef UIP_FIXEDADDR\r
+CCIF extern const uip_ipaddr_t uip_hostaddr, uip_netmask, uip_draddr;\r
+#else /* UIP_FIXEDADDR */\r
+CCIF extern uip_ipaddr_t uip_hostaddr, uip_netmask, uip_draddr;\r
+#endif /* UIP_FIXEDADDR */\r
+CCIF extern const uip_ipaddr_t uip_broadcast_addr;\r
+CCIF extern const uip_ipaddr_t uip_all_zeroes_addr;\r
+\r
+#ifdef UIP_FIXEDETHADDR\r
+CCIF extern const uip_lladdr_t uip_lladdr;\r
+#else\r
+CCIF extern uip_lladdr_t uip_lladdr;\r
+#endif\r
+#if UIP_CONF_IPV6 != 0\r
+\r
+/**\r
+ * \brief Is IPv6 address a the unspecified address\r
+ * a is of type uip_ipaddr_t\r
+ */\r
+#define uip_is_addr_unspecified( a ) \\r
+ ( \\r
+ (((a)->u16[0]) == 0) && \\r
+ (((a)->u16[1]) == 0) && \\r
+ (((a)->u16[2]) == 0) && \\r
+ (((a)->u16[3]) == 0) && \\r
+ (((a)->u16[4]) == 0) && \\r
+ (((a)->u16[5]) == 0) && \\r
+ (((a)->u16[6]) == 0) && \\r
+ (((a)->u16[7]) == 0) \\r
+ )\r
+\r
+/** \brief Is IPv6 address a the link local all-nodes multicast address */\r
+#define uip_is_addr_linklocal_allnodes_mcast( a ) \\r
+ ( \\r
+ (((a)->u8[0]) == 0xff) && \\r
+ (((a)->u8[1]) == 0x02) && \\r
+ (((a)->u16[1]) == 0) && \\r
+ (((a)->u16[2]) == 0) && \\r
+ (((a)->u16[3]) == 0) && \\r
+ (((a)->u16[4]) == 0) && \\r
+ (((a)->u16[5]) == 0) && \\r
+ (((a)->u16[6]) == 0) && \\r
+ (((a)->u8[14]) == 0) && \\r
+ (((a)->u8[15]) == 0x01) \\r
+ )\r
+\r
+/** \brief set IP address a to unspecified */\r
+#define uip_create_unspecified( a ) uip_ip6addr( a, 0, 0, 0, 0, 0, 0, 0, 0 )\r
+\r
+/** \brief set IP address a to the link local all-nodes multicast address */\r
+#define uip_create_linklocal_allnodes_mcast( a ) uip_ip6addr( a, 0xff02, 0, 0, 0, 0, 0, 0, 0x0001 )\r
+\r
+/** \brief set IP address a to the link local all-routers multicast address */\r
+#define uip_create_linklocal_allrouters_mcast( a ) uip_ip6addr( a, 0xff02, 0, 0, 0, 0, 0, 0, 0x0002 )\r
+\r
+/**\r
+ * \brief is addr (a) a solicited node multicast address, see RFC3513\r
+ * a is of type uip_ipaddr_t*\r
+ */\r
+#define uip_is_addr_solicited_node( a ) \\r
+ ( \\r
+ (((a)->u8[0]) == 0xFF) && \\r
+ (((a)->u8[1]) == 0x02) && \\r
+ (((a)->u16[1]) == 0) && \\r
+ (((a)->u16[2]) == 0) && \\r
+ (((a)->u16[3]) == 0) && \\r
+ (((a)->u16[4]) == 0) && \\r
+ (((a)->u16[5]) == 1) && \\r
+ (((a)->u8[12]) == 0xFF) \\r
+ )\r
+\r
+/**\r
+ * \briefput in b the solicited node address corresponding to address a\r
+ * both a and b are of type uip_ipaddr_t*\r
+ * */\r
+#define uip_create_solicited_node( a, b ) \\r
+ ( ((b)->u8[0]) = 0xFF ); \\r
+ ( ((b)->u8[1]) = 0x02 ); \\r
+ ( ((b)->u16[1]) = 0 ); \\r
+ ( ((b)->u16[2]) = 0 ); \\r
+ ( ((b)->u16[3]) = 0 ); \\r
+ ( ((b)->u16[4]) = 0 ); \\r
+ ( ((b)->u8[10]) = 0 ); \\r
+ ( ((b)->u8[11]) = 0x01 ); \\r
+ ( ((b)->u8[12]) = 0xFF ); \\r
+ ( ((b)->u8[13]) = ((a)->u8[13]) ); \\r
+ ( ((b)->u16[7]) = ((a)->u16[7]) )\r
+\r
+/**\r
+ * \brief is addr (a) a link local unicast address, see RFC3513\r
+ * i.e. is (a) on prefix FE80::/10\r
+ * a is of type uip_ipaddr_t*\r
+ */\r
+#define uip_is_addr_link_local( a ) ( (((a)->u8[0]) == 0xFE) && (((a)->u8[1]) == 0x80) )\r
+\r
+/**\r
+ * \brief was addr (a) forged based on the mac address m\r
+ * a type is uip_ipaddr_t\r
+ * m type is uiplladdr_t\r
+ */\r
+#ifdef UIP_CONF_LL_802154\r
+#define uip_is_addr_mac_addr_based( a, m ) \\r
+ ( \\r
+ (((a)->u8[8]) == (((m)->addr[0]) ^ 0x02)) && \\r
+ (((a)->u8[9]) == (m)->addr[1]) && \\r
+ (((a)->u8[10]) == (m)->addr[2]) && \\r
+ (((a)->u8[11]) == (m)->addr[3]) && \\r
+ (((a)->u8[12]) == (m)->addr[4]) && \\r
+ (((a)->u8[13]) == (m)->addr[5]) && \\r
+ (((a)->u8[14]) == (m)->addr[6]) && \\r
+ (((a)->u8[15]) == (m)->addr[7]) \\r
+ )\r
+#else\r
+#define uip_is_addr_mac_addr_based( a, m ) \\r
+ ( \\r
+ (((a)->u8[8]) == (((m)->addr[0]) | 0x02)) && \\r
+ (((a)->u8[9]) == (m)->addr[1]) && \\r
+ (((a)->u8[10]) == (m)->addr[2]) && \\r
+ (((a)->u8[11]) == 0xff) && \\r
+ (((a)->u8[12]) == 0xfe) && \\r
+ (((a)->u8[13]) == (m)->addr[3]) && \\r
+ (((a)->u8[14]) == (m)->addr[4]) && \\r
+ (((a)->u8[15]) == (m)->addr[5]) \\r
+ )\r
+#endif /*UIP_CONF_LL_802154*/\r
+\r
+/**\r
+ * \brief is address a multicast address, see RFC 3513\r
+ * a is of type uip_ipaddr_t*\r
+ * */\r
+#define uip_is_addr_mcast( a ) ( ((a)->u8[0]) == 0xFF )\r
+\r
+/**\r
+ * \brief is group-id of multicast address a\r
+ * the all nodes group-id\r
+ */\r
+#define uip_is_mcast_group_id_all_nodes( a ) \\r
+ ( \\r
+ (((a)->u16[1]) == 0) && \\r
+ (((a)->u16[2]) == 0) && \\r
+ (((a)->u16[3]) == 0) && \\r
+ (((a)->u16[4]) == 0) && \\r
+ (((a)->u16[5]) == 0) && \\r
+ (((a)->u16[6]) == 0) && \\r
+ (((a)->u8[14]) == 0) && \\r
+ (((a)->u8[15]) == 1) \\r
+ )\r
+\r
+/**\r
+ * \brief is group-id of multicast address a\r
+ * the all routers group-id\r
+ */\r
+#define uip_is_mcast_group_id_all_routers( a ) \\r
+ ( \\r
+ (((a)->u16[1]) == 0) && \\r
+ (((a)->u16[2]) == 0) && \\r
+ (((a)->u16[3]) == 0) && \\r
+ (((a)->u16[4]) == 0) && \\r
+ (((a)->u16[5]) == 0) && \\r
+ (((a)->u16[6]) == 0) && \\r
+ (((a)->u8[14]) == 0) && \\r
+ (((a)->u8[15]) == 2) \\r
+ )\r
+#endif /*UIP_CONF_IPV6*/\r
+\r
+/**\r
+ * Calculate the Internet checksum over a buffer.\r
+ *\r
+ * The Internet checksum is the one's complement of the one's\r
+ * complement sum of all 16-bit words in the buffer.\r
+ *\r
+ * See RFC1071.\r
+ *\r
+ * \param buf A pointer to the buffer over which the checksum is to be\r
+ * computed.\r
+ *\r
+ * \param len The length of the buffer over which the checksum is to\r
+ * be computed.\r
+ *\r
+ * \return The Internet checksum of the buffer.\r
+ */\r
+u16_t uip_chksum( u16_t *buf, u16_t len );\r
+\r
+/**\r
+ * Calculate the IP header checksum of the packet header in uip_buf.\r
+ *\r
+ * The IP header checksum is the Internet checksum of the 20 bytes of\r
+ * the IP header.\r
+ *\r
+ * \return The IP header checksum of the IP header in the uip_buf\r
+ * buffer.\r
+ */\r
+u16_t uip_ipchksum( void );\r
+\r
+/**\r
+ * Calculate the TCP checksum of the packet in uip_buf and uip_appdata.\r
+ *\r
+ * The TCP checksum is the Internet checksum of data contents of the\r
+ * TCP segment, and a pseudo-header as defined in RFC793.\r
+ *\r
+ * \return The TCP checksum of the TCP segment in uip_buf and pointed\r
+ * to by uip_appdata.\r
+ */\r
+u16_t uip_tcpchksum( void );\r
+\r
+/**\r
+ * Calculate the UDP checksum of the packet in uip_buf and uip_appdata.\r
+ *\r
+ * The UDP checksum is the Internet checksum of data contents of the\r
+ * UDP segment, and a pseudo-header as defined in RFC768.\r
+ *\r
+ * \return The UDP checksum of the UDP segment in uip_buf and pointed\r
+ * to by uip_appdata.\r
+ */\r
+u16_t uip_udpchksum( void );\r
+\r
+/**\r
+ * Calculate the ICMP checksum of the packet in uip_buf.\r
+ *\r
+ * \return The ICMP checksum of the ICMP packet in uip_buf\r
+ */\r
+u16_t uip_icmp6chksum( void );\r
+#endif /* __UIP_H__ */\r
+\r
+/** @} */\r
--- /dev/null
+/**\r
+ * \addtogroup uip\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \addtogroup uiparp\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Macros and definitions for the ARP module.\r
+ * \author Adam Dunkels <adam@dunkels.com>\r
+ */\r
+\r
+/*\r
+ * Copyright (c) 2001-2003, Adam Dunkels.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. The name of the author may not be used to endorse or promote\r
+ * products derived from this software without specific prior\r
+ * written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS\r
+ * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\r
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\r
+ * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\r
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\r
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\r
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack.\r
+ *\r
+ * $Id: uip_arp.h,v 1.2 2006/08/26 23:58:45 oliverschmidt Exp $\r
+ *\r
+ */\r
+#ifndef __UIP_ARP_H__\r
+#define __UIP_ARP_H__\r
+\r
+#include "net/uip.h"\r
+\r
+CCIF extern struct uip_eth_addr uip_ethaddr;\r
+\r
+/**\r
+ * The Ethernet header.\r
+ */\r
+#include "net/pack_struct_start.h"\r
+struct uip_eth_hdr\r
+{\r
+ struct uip_eth_addr dest;\r
+ struct uip_eth_addr src;\r
+ u16_t type;\r
+}\r
+\r
+#include "net/pack_struct_end.h"\r
+\r
+#define UIP_ETHTYPE_ARP 0x0806\r
+#define UIP_ETHTYPE_IP 0x0800\r
+#define UIP_ETHTYPE_IPV6 0x86dd\r
+\r
+/* The uip_arp_init() function must be called before any of the other\r
+ ARP functions. */\r
+void uip_arp_init( void );\r
+\r
+/* The uip_arp_ipin() function should be called whenever an IP packet\r
+ arrives from the Ethernet. This function refreshes the ARP table or\r
+ inserts a new mapping if none exists. The function assumes that an\r
+ IP packet with an Ethernet header is present in the uip_buf buffer\r
+ and that the length of the packet is in the uip_len variable. */\r
+\r
+/*void uip_arp_ipin(void);*/\r
+#define uip_arp_ipin()\r
+\r
+/* The uip_arp_arpin() should be called when an ARP packet is received\r
+ by the Ethernet driver. This function also assumes that the\r
+ Ethernet frame is present in the uip_buf buffer. When the\r
+ uip_arp_arpin() function returns, the contents of the uip_buf\r
+ buffer should be sent out on the Ethernet if the uip_len variable\r
+ is > 0. */\r
+void uip_arp_arpin( void );\r
+\r
+/* The uip_arp_out() function should be called when an IP packet\r
+ should be sent out on the Ethernet. This function creates an\r
+ Ethernet header before the IP header in the uip_buf buffer. The\r
+ Ethernet header will have the correct Ethernet MAC destination\r
+ address filled in if an ARP table entry for the destination IP\r
+ address (or the IP address of the default router) is present. If no\r
+ such table entry is found, the IP packet is overwritten with an ARP\r
+ request and we rely on TCP to retransmit the packet that was\r
+ overwritten. In any case, the uip_len variable holds the length of\r
+ the Ethernet frame that should be transmitted. */\r
+void uip_arp_out( void );\r
+\r
+/* The uip_arp_timer() function should be called every ten seconds. It\r
+ is responsible for flushing old entries in the ARP table. */\r
+void uip_arp_timer( void );\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \addtogroup uipconffunc\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Specifiy the Ethernet MAC address.\r
+ *\r
+ * The ARP code needs to know the MAC address of the Ethernet card in\r
+ * order to be able to respond to ARP queries and to generate working\r
+ * Ethernet headers.\r
+ *\r
+ * \note This macro only specifies the Ethernet MAC address to the ARP\r
+ * code. It cannot be used to change the MAC address of the Ethernet\r
+ * card.\r
+ *\r
+ * \param eaddr A pointer to a struct uip_eth_addr containing the\r
+ * Ethernet MAC address of the Ethernet card.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define uip_setethaddr( eaddr ) \\r
+ do \\r
+ { \\r
+ uip_ethaddr.addr[0] = eaddr.addr[0]; \\r
+ uip_ethaddr.addr[1] = eaddr.addr[1]; \\r
+ uip_ethaddr.addr[2] = eaddr.addr[2]; \\r
+ uip_ethaddr.addr[3] = eaddr.addr[3]; \\r
+ uip_ethaddr.addr[4] = eaddr.addr[4]; \\r
+ uip_ethaddr.addr[5] = eaddr.addr[5]; \\r
+ } while( 0 )\r
+\r
+ /** @} */\r
+#endif /* __UIP_ARP_H__ */\r
+\r
+ /** @} */\r
+
\ No newline at end of file
--- /dev/null
+/**\r
+ * \addtogroup uip\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \defgroup uipopt Configuration options for uIP\r
+ * @{\r
+ *\r
+ * uIP is configured using the per-project configuration file\r
+ * "uipopt.h". This file contains all compile-time options for uIP and\r
+ * should be tweaked to match each specific project. The uIP\r
+ * distribution contains a documented example "uipopt.h" that can be\r
+ * copied and modified for each project.\r
+ *\r
+ * \note Contiki does not use the uipopt.h file to configure uIP, but\r
+ * uses a per-port uip-conf.h file that should be edited instead.\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Configuration options for uIP.\r
+ * \author Adam Dunkels <adam@dunkels.com>\r
+ *\r
+ * This file is used for tweaking various configuration options for\r
+ * uIP. You should make a copy of this file into one of your project's\r
+ * directories instead of editing this example "uipopt.h" file that\r
+ * comes with the uIP distribution.\r
+ */\r
+\r
+/*\r
+ * Copyright (c) 2001-2003, Adam Dunkels.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. The name of the author may not be used to endorse or promote\r
+ * products derived from this software without specific prior\r
+ * written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS\r
+ * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\r
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\r
+ * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\r
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\r
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\r
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack.\r
+ *\r
+ * $Id: uipopt.h,v 1.11 2009/04/10 00:37:48 adamdunkels Exp $\r
+ *\r
+ */\r
+#ifndef __UIPOPT_H__\r
+#define __UIPOPT_H__\r
+\r
+#ifndef UIP_LITTLE_ENDIAN\r
+#define UIP_LITTLE_ENDIAN 3412\r
+#endif /* UIP_LITTLE_ENDIAN */\r
+#ifndef UIP_BIG_ENDIAN\r
+#define UIP_BIG_ENDIAN 1234\r
+#endif /* UIP_BIG_ENDIAN */\r
+\r
+#include "uip-conf.h"\r
+//_RB_#include "contiki-conf.h"\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipoptstaticconf Static configuration options\r
+ * @{\r
+ *\r
+ * These configuration options can be used for setting the IP address\r
+ * settings statically, but only if UIP_FIXEDADDR is set to 1. The\r
+ * configuration options for a specific node includes IP address,\r
+ * netmask and default router as well as the Ethernet address. The\r
+ * netmask, default router and Ethernet address are applicable only\r
+ * if uIP should be run over Ethernet.\r
+ *\r
+ * This options are meaningful only for the IPv4 code.\r
+ *\r
+ * All of these should be changed to suit your project.\r
+ */\r
+\r
+/**\r
+ * Determines if uIP should use a fixed IP address or not.\r
+ *\r
+ * If uIP should use a fixed IP address, the settings are set in the\r
+ * uipopt.h file. If not, the macros uip_sethostaddr(),\r
+ * uip_setdraddr() and uip_setnetmask() should be used instead.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_CONF_FIXEDADDR\r
+#define UIP_FIXED_ADDR UIP_CONF_FIXEDADDR\r
+#define UIP_FIXEDADDR 1\r
+#endif\r
+\r
+/**\r
+ * Ping IP address assignment.\r
+ *\r
+ * uIP uses a "ping" packets for setting its own IP address if this\r
+ * option is set. If so, uIP will start with an empty IP address and\r
+ * the destination IP address of the first incoming "ping" (ICMP echo)\r
+ * packet will be used for setting the hosts IP address.\r
+ *\r
+ * \note This works only if UIP_FIXEDADDR is 0.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_CONF_PINGADDRCONF\r
+#define UIP_PINGADDRCONF UIP_CONF_PINGADDRCONF\r
+#else /* UIP_CONF_PINGADDRCONF */\r
+#define UIP_PINGADDRCONF 0\r
+#endif /* UIP_CONF_PINGADDRCONF */\r
+\r
+/**\r
+ * Specifies if the uIP ARP module should be compiled with a fixed\r
+ * Ethernet MAC address or not.\r
+ *\r
+ * If this configuration option is 0, the macro uip_setethaddr() can\r
+ * be used to specify the Ethernet address at run-time.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define UIP_FIXEDETHADDR 0\r
+\r
+/** @} */\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipoptip IP configuration options\r
+ * @{\r
+ *\r
+ */\r
+\r
+/**\r
+ * The IP TTL (time to live) of IP packets sent by uIP.\r
+ *\r
+ * This should normally not be changed.\r
+ */\r
+#define UIP_TTL 64\r
+\r
+/**\r
+ * The maximum time an IP fragment should wait in the reassembly\r
+ * buffer before it is dropped.\r
+ *\r
+ */\r
+#define UIP_REASS_MAXAGE 60 /*60s*/\r
+\r
+/**\r
+ * Turn on support for IP packet reassembly.\r
+ *\r
+ * uIP supports reassembly of fragmented IP packets. This features\r
+ * requires an additional amount of RAM to hold the reassembly buffer\r
+ * and the reassembly code size is approximately 700 bytes. The\r
+ * reassembly buffer is of the same size as the uip_buf buffer\r
+ * (configured by UIP_BUFSIZE).\r
+ *\r
+ * \note IP packet reassembly is not heavily tested.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_CONF_REASSEMBLY\r
+#define UIP_REASSEMBLY UIP_CONF_REASSEMBLY\r
+#else /* UIP_CONF_REASSEMBLY */\r
+#define UIP_REASSEMBLY 0\r
+#endif /* UIP_CONF_REASSEMBLY */\r
+\r
+/** @} */\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipoptipv6 IPv6 configuration options\r
+ * @{\r
+ *\r
+ */\r
+\r
+/** The maximum transmission unit at the IP Layer*/\r
+#define UIP_LINK_MTU 1280\r
+\r
+#ifndef UIP_CONF_IPV6\r
+\r
+/** Do we use IPv6 or not (default: no) */\r
+#define UIP_CONF_IPV6 0\r
+#endif\r
+#ifndef UIP_CONF_IPV6_QUEUE_PKT\r
+\r
+/** Do we do per %neighbor queuing during address resolution (default: no) */\r
+#define UIP_CONF_IPV6_QUEUE_PKT 0\r
+#endif\r
+#ifndef UIP_CONF_IPV6_CHECKS\r
+\r
+/** Do we do IPv6 consistency checks (highly recommended, default: yes) */\r
+#define UIP_CONF_IPV6_CHECKS 1\r
+#endif\r
+#ifndef UIP_CONF_IPV6_REASSEMBLY\r
+\r
+/** Do we do IPv6 fragmentation (default: no) */\r
+#define UIP_CONF_IPV6_REASSEMBLY 0\r
+#endif\r
+#ifndef UIP_CONF_NETIF_MAX_ADDRESSES\r
+\r
+/** Default number of IPv6 addresses associated to the node's interface */\r
+#define UIP_CONF_NETIF_MAX_ADDRESSES 3\r
+#endif\r
+#ifndef UIP_CONF_ND6_MAX_PREFIXES\r
+\r
+/** Default number of IPv6 prefixes associated to the node's interface */\r
+#define UIP_CONF_ND6_MAX_PREFIXES 3\r
+#endif\r
+#ifndef UIP_CONF_ND6_MAX_NEIGHBORS\r
+\r
+/** Default number of neighbors that can be stored in the %neighbor cache */\r
+#define UIP_CONF_ND6_MAX_NEIGHBORS 4\r
+#endif\r
+#ifndef UIP_CONF_ND6_MAX_DEFROUTERS\r
+\r
+/** Minimum number of default routers */\r
+#define UIP_CONF_ND6_MAX_DEFROUTERS 2\r
+#endif\r
+\r
+/** @} */\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipoptudp UDP configuration options\r
+ * @{\r
+ *\r
+ * \note The UDP support in uIP is still not entirely complete; there\r
+ * is no support for sending or receiving broadcast or multicast\r
+ * packets, but it works well enough to support a number of vital\r
+ * applications such as DNS queries, though\r
+ */\r
+\r
+/**\r
+ * Toggles whether UDP support should be compiled in or not.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_CONF_UDP\r
+#define UIP_UDP UIP_CONF_UDP\r
+#else /* UIP_CONF_UDP */\r
+#define UIP_UDP 0\r
+#endif /* UIP_CONF_UDP */\r
+\r
+/**\r
+ * Toggles if UDP checksums should be used or not.\r
+ *\r
+ * \note Support for UDP checksums is currently not included in uIP,\r
+ * so this option has no function.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_CONF_UDP_CHECKSUMS\r
+#define UIP_UDP_CHECKSUMS UIP_CONF_UDP_CHECKSUMS\r
+#else\r
+#define UIP_UDP_CHECKSUMS 0\r
+#endif\r
+\r
+/**\r
+ * The maximum amount of concurrent UDP connections.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_CONF_UDP_CONNS\r
+#define UIP_UDP_CONNS UIP_CONF_UDP_CONNS\r
+#else /* UIP_CONF_UDP_CONNS */\r
+#define UIP_UDP_CONNS 10\r
+#endif /* UIP_CONF_UDP_CONNS */\r
+\r
+/**\r
+ * The name of the function that should be called when UDP datagrams arrive.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+\r
+/** @} */\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipopttcp TCP configuration options\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Toggles whether UDP support should be compiled in or not.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_CONF_TCP\r
+#define UIP_TCP UIP_CONF_TCP\r
+#else /* UIP_CONF_UDP */\r
+#define UIP_TCP 1\r
+#endif /* UIP_CONF_UDP */\r
+\r
+/**\r
+ * Determines if support for opening connections from uIP should be\r
+ * compiled in.\r
+ *\r
+ * If the applications that are running on top of uIP for this project\r
+ * do not need to open outgoing TCP connections, this configuration\r
+ * option can be turned off to reduce the code size of uIP.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifndef UIP_CONF_ACTIVE_OPEN\r
+#define UIP_ACTIVE_OPEN 1\r
+#else /* UIP_CONF_ACTIVE_OPEN */\r
+#define UIP_ACTIVE_OPEN UIP_CONF_ACTIVE_OPEN\r
+#endif /* UIP_CONF_ACTIVE_OPEN */\r
+\r
+/**\r
+ * The maximum number of simultaneously open TCP connections.\r
+ *\r
+ * Since the TCP connections are statically allocated, turning this\r
+ * configuration knob down results in less RAM used. Each TCP\r
+ * connection requires approximately 30 bytes of memory.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifndef UIP_CONF_MAX_CONNECTIONS\r
+#define UIP_CONNS 10\r
+#else /* UIP_CONF_MAX_CONNECTIONS */\r
+#define UIP_CONNS UIP_CONF_MAX_CONNECTIONS\r
+#endif /* UIP_CONF_MAX_CONNECTIONS */\r
+\r
+/**\r
+ * The maximum number of simultaneously listening TCP ports.\r
+ *\r
+ * Each listening TCP port requires 2 bytes of memory.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifndef UIP_CONF_MAX_LISTENPORTS\r
+#define UIP_LISTENPORTS 20\r
+#else /* UIP_CONF_MAX_LISTENPORTS */\r
+#define UIP_LISTENPORTS UIP_CONF_MAX_LISTENPORTS\r
+#endif /* UIP_CONF_MAX_LISTENPORTS */\r
+\r
+/**\r
+ * Determines if support for TCP urgent data notification should be\r
+ * compiled in.\r
+ *\r
+ * Urgent data (out-of-band data) is a rarely used TCP feature that\r
+ * very seldom would be required.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define UIP_URGDATA 0\r
+\r
+/**\r
+ * The initial retransmission timeout counted in timer pulses.\r
+ *\r
+ * This should not be changed.\r
+ */\r
+#define UIP_RTO 3\r
+\r
+/**\r
+ * The maximum number of times a segment should be retransmitted\r
+ * before the connection should be aborted.\r
+ *\r
+ * This should not be changed.\r
+ */\r
+#define UIP_MAXRTX 8\r
+\r
+/**\r
+ * The maximum number of times a SYN segment should be retransmitted\r
+ * before a connection request should be deemed to have been\r
+ * unsuccessful.\r
+ *\r
+ * This should not need to be changed.\r
+ */\r
+#define UIP_MAXSYNRTX 5\r
+\r
+/**\r
+ * The TCP maximum segment size.\r
+ *\r
+ * This is should not be to set to more than\r
+ * UIP_BUFSIZE - UIP_LLH_LEN - UIP_TCPIP_HLEN.\r
+ */\r
+#ifdef UIP_CONF_TCP_MSS\r
+#define UIP_TCP_MSS UIP_CONF_TCP_MSS\r
+#else\r
+#define UIP_TCP_MSS ( UIP_BUFSIZE - UIP_LLH_LEN - UIP_TCPIP_HLEN )\r
+#endif\r
+\r
+/**\r
+ * The size of the advertised receiver's window.\r
+ *\r
+ * Should be set low (i.e., to the size of the uip_buf buffer) if the\r
+ * application is slow to process incoming data, or high (32768 bytes)\r
+ * if the application processes data quickly.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifndef UIP_CONF_RECEIVE_WINDOW\r
+#define UIP_RECEIVE_WINDOW UIP_TCP_MSS\r
+#else\r
+#define UIP_RECEIVE_WINDOW UIP_CONF_RECEIVE_WINDOW\r
+#endif\r
+\r
+/**\r
+ * How long a connection should stay in the TIME_WAIT state.\r
+ *\r
+ * This configuration option has no real implication, and it should be\r
+ * left untouched.\r
+ */\r
+#define UIP_TIME_WAIT_TIMEOUT 120\r
+\r
+/** @} */\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipoptarp ARP configuration options\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * The size of the ARP table.\r
+ *\r
+ * This option should be set to a larger value if this uIP node will\r
+ * have many connections from the local network.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_CONF_ARPTAB_SIZE\r
+#define UIP_ARPTAB_SIZE UIP_CONF_ARPTAB_SIZE\r
+#else\r
+#define UIP_ARPTAB_SIZE 8\r
+#endif\r
+\r
+/**\r
+ * The maximum age of ARP table entries measured in 10ths of seconds.\r
+ *\r
+ * An UIP_ARP_MAXAGE of 120 corresponds to 20 minutes (BSD\r
+ * default).\r
+ */\r
+#define UIP_ARP_MAXAGE 120\r
+\r
+/** @} */\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipoptmac layer 2 options (for ipv6)\r
+ * @{\r
+ */\r
+#define UIP_DEFAULT_PREFIX_LEN 64\r
+\r
+/** @} */\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipoptsics 6lowpan options (for ipv6)\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Timeout for packet reassembly at the 6lowpan layer\r
+ * (should be < 60s)\r
+ */\r
+#ifdef SICSLOWPAN_CONF_MAXAGE\r
+#define SICSLOWPAN_REASS_MAXAGE SICSLOWPAN_CONF_MAXAGE\r
+#else\r
+#define SICSLOWPAN_REASS_MAXAGE 20\r
+#endif\r
+\r
+/**\r
+ * Do we compress the IP header or not (default: no)\r
+ */\r
+#ifndef SICSLOWPAN_CONF_COMPRESSION\r
+#define SICSLOWPAN_CONF_COMPRESSION 0\r
+#endif\r
+\r
+/**\r
+ * If we use IPHC compression, how many address contexts do we support\r
+ */\r
+#ifndef SICSLOWPAN_CONF_MAX_ADDR_CONTEXTS\r
+#define SICSLOWPAN_CONF_MAX_ADDR_CONTEXTS 1\r
+#endif\r
+\r
+/**\r
+ * Do we support 6lowpan fragmentation\r
+ */\r
+#ifndef SICSLOWPAN_CONF_FRAG\r
+#define SICSLOWPAN_CONF_FRAG 0\r
+#endif\r
+\r
+/** @} */\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipoptgeneral General configuration options\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * The size of the uIP packet buffer.\r
+ *\r
+ * The uIP packet buffer should not be smaller than 60 bytes, and does\r
+ * not need to be larger than 1514 bytes. Lower size results in lower\r
+ * TCP throughput, larger size results in higher TCP throughput.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifndef UIP_CONF_BUFFER_SIZE\r
+#define UIP_BUFSIZE UIP_LINK_MTU + UIP_LLH_LEN\r
+#else /* UIP_CONF_BUFFER_SIZE */\r
+#define UIP_BUFSIZE UIP_CONF_BUFFER_SIZE\r
+#endif /* UIP_CONF_BUFFER_SIZE */\r
+\r
+/**\r
+ * Determines if statistics support should be compiled in.\r
+ *\r
+ * The statistics is useful for debugging and to show the user.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifndef UIP_CONF_STATISTICS\r
+#define UIP_STATISTICS 0\r
+#else /* UIP_CONF_STATISTICS */\r
+#define UIP_STATISTICS UIP_CONF_STATISTICS\r
+#endif /* UIP_CONF_STATISTICS */\r
+\r
+/**\r
+ * Determines if logging of certain events should be compiled in.\r
+ *\r
+ * This is useful mostly for debugging. The function uip_log()\r
+ * must be implemented to suit the architecture of the project, if\r
+ * logging is turned on.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifndef UIP_CONF_LOGGING\r
+#define UIP_LOGGING 0\r
+#else /* UIP_CONF_LOGGING */\r
+#define UIP_LOGGING UIP_CONF_LOGGING\r
+#endif /* UIP_CONF_LOGGING */\r
+\r
+/**\r
+ * Broadcast support.\r
+ *\r
+ * This flag configures IP broadcast support. This is useful only\r
+ * together with UDP.\r
+ *\r
+ * \hideinitializer\r
+ *\r
+ */\r
+#ifndef UIP_CONF_BROADCAST\r
+#define UIP_BROADCAST 0\r
+#else /* UIP_CONF_BROADCAST */\r
+#define UIP_BROADCAST UIP_CONF_BROADCAST\r
+#endif /* UIP_CONF_BROADCAST */\r
+\r
+/**\r
+ * Print out a uIP log message.\r
+ *\r
+ * This function must be implemented by the module that uses uIP, and\r
+ * is called by uIP whenever a log message is generated.\r
+ */\r
+void uip_log( char *msg );\r
+\r
+/**\r
+ * The link level header length.\r
+ *\r
+ * This is the offset into the uip_buf where the IP header can be\r
+ * found. For Ethernet, this should be set to 14. For SLIP, this\r
+ * should be set to 0.\r
+ *\r
+ * \note we probably won't use this constant for other link layers than\r
+ * ethernet as they have variable header length (this is due to variable\r
+ * number and type of address fields and to optional security features)\r
+ * E.g.: 802.15.4 -> 2 + (1/2*4/8) + 0/5/6/10/14\r
+ * 802.11 -> 4 + (6*3/4) + 2\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_CONF_LLH_LEN\r
+#define UIP_LLH_LEN UIP_CONF_LLH_LEN\r
+#else /* UIP_LLH_LEN */\r
+#define UIP_LLH_LEN 14\r
+#endif /* UIP_CONF_LLH_LEN */\r
+\r
+/** @} */\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipoptcpu CPU architecture configuration\r
+ * @{\r
+ *\r
+ * The CPU architecture configuration is where the endianess of the\r
+ * CPU on which uIP is to be run is specified. Most CPUs today are\r
+ * little endian, and the most notable exception are the Motorolas\r
+ * which are big endian. The BYTE_ORDER macro should be changed to\r
+ * reflect the CPU architecture on which uIP is to be run.\r
+ */\r
+\r
+/**\r
+ * The byte order of the CPU architecture on which uIP is to be run.\r
+ *\r
+ * This option can be either UIP_BIG_ENDIAN (Motorola byte order) or\r
+ * UIP_LITTLE_ENDIAN (Intel byte order).\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef UIP_CONF_BYTE_ORDER\r
+#define UIP_BYTE_ORDER UIP_CONF_BYTE_ORDER\r
+#else /* UIP_CONF_BYTE_ORDER */\r
+#define UIP_BYTE_ORDER UIP_LITTLE_ENDIAN\r
+#endif /* UIP_CONF_BYTE_ORDER */\r
+\r
+/** @} */\r
+\r
+/*------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * \defgroup uipoptapp Application specific configurations\r
+ * @{\r
+ *\r
+ * An uIP application is implemented using a single application\r
+ * function that is called by uIP whenever a TCP/IP event occurs. The\r
+ * name of this function must be registered with uIP at compile time\r
+ * using the UIP_APPCALL definition.\r
+ *\r
+ * uIP applications can store the application state within the\r
+ * uip_conn structure by specifying the type of the application\r
+ * structure by typedef:ing the type uip_tcp_appstate_t and uip_udp_appstate_t.\r
+ *\r
+ * The file containing the definitions must be included in the\r
+ * uipopt.h file.\r
+ *\r
+ * The following example illustrates how this can look.\r
+ \code\r
+\r
+ void httpd_appcall(void);\r
+ #define UIP_APPCALL httpd_appcall\r
+\r
+ struct httpd_state {\r
+ u8_t state;\r
+ u16_t count;\r
+ char *dataptr;\r
+ char *script;\r
+ };\r
+ typedef struct httpd_state uip_tcp_appstate_t\r
+ \endcode\r
+*/\r
+\r
+/**\r
+ * \var #define UIP_APPCALL\r
+ *\r
+ * The name of the application function that uIP should call in\r
+ * response to TCP/IP events.\r
+ *\r
+ */\r
+\r
+/**\r
+ * \var typedef uip_tcp_appstate_t\r
+ *\r
+ * The type of the application state that is to be stored in the\r
+ * uip_conn structure. This usually is typedef:ed to a struct holding\r
+ * application state information.\r
+ */\r
+\r
+/**\r
+ * \var typedef uip_udp_appstate_t\r
+ *\r
+ * The type of the application state that is to be stored in the\r
+ * uip_conn structure. This usually is typedef:ed to a struct holding\r
+ * application state information.\r
+ */\r
+\r
+/** @} */\r
+#endif /* __UIPOPT_H__ */\r
+\r
+/** @} */\r
+\r
+/** @} */\r
--- /dev/null
+/*\r
+ * Copyright (c) 2004, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: psock.c,v 1.2 2006/06/12 08:00:30 adam Exp $\r
+ */\r
+\r
+#include <stdio.h>\r
+#include <string.h>\r
+\r
+#include "net/uipopt.h"\r
+#include "net/psock.h"\r
+#include "net/uip.h"\r
+\r
+#define STATE_NONE 0\r
+#define STATE_ACKED 1\r
+#define STATE_READ 2\r
+#define STATE_BLOCKED_NEWDATA 3\r
+#define STATE_BLOCKED_CLOSE 4\r
+#define STATE_BLOCKED_SEND 5\r
+#define STATE_DATA_SENT 6\r
+\r
+/*\r
+ * Return value of the buffering functions that indicates that a\r
+ * buffer was not filled by incoming data.\r
+ *\r
+ */\r
+#define BUF_NOT_FULL 0\r
+#define BUF_NOT_FOUND 0\r
+\r
+/*\r
+ * Return value of the buffering functions that indicates that a\r
+ * buffer was completely filled by incoming data.\r
+ *\r
+ */\r
+#define BUF_FULL 1\r
+\r
+/*\r
+ * Return value of the buffering functions that indicates that an\r
+ * end-marker byte was found.\r
+ *\r
+ */\r
+#define BUF_FOUND 2\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static void\r
+buf_setup(struct psock_buf *buf,\r
+ u8_t *bufptr, u16_t bufsize)\r
+{\r
+ buf->ptr = bufptr;\r
+ buf->left = bufsize;\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+static u8_t\r
+buf_bufdata(struct psock_buf *buf, u16_t len,\r
+ u8_t **dataptr, u16_t *datalen)\r
+{\r
+ ( void ) len;\r
+ if(*datalen < buf->left) {\r
+ memcpy(buf->ptr, *dataptr, *datalen);\r
+ buf->ptr += *datalen;\r
+ buf->left -= *datalen;\r
+ *dataptr += *datalen;\r
+ *datalen = 0;\r
+ return BUF_NOT_FULL;\r
+ } else if(*datalen == buf->left) {\r
+ memcpy(buf->ptr, *dataptr, *datalen);\r
+ buf->ptr += *datalen;\r
+ buf->left = 0;\r
+ *dataptr += *datalen;\r
+ *datalen = 0;\r
+ return BUF_FULL;\r
+ } else {\r
+ memcpy(buf->ptr, *dataptr, buf->left);\r
+ buf->ptr += buf->left;\r
+ *datalen -= buf->left;\r
+ *dataptr += buf->left;\r
+ buf->left = 0;\r
+ return BUF_FULL;\r
+ }\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+static u8_t\r
+buf_bufto(register struct psock_buf *buf, u8_t endmarker,\r
+ register u8_t **dataptr, register u16_t *datalen)\r
+{\r
+ u8_t c;\r
+ while(buf->left > 0 && *datalen > 0) {\r
+ c = *buf->ptr = **dataptr;\r
+ ++*dataptr;\r
+ ++buf->ptr;\r
+ --*datalen;\r
+ --buf->left;\r
+ \r
+ if(c == endmarker) {\r
+ return BUF_FOUND;\r
+ }\r
+ }\r
+\r
+ if(*datalen == 0) {\r
+ return BUF_NOT_FOUND;\r
+ }\r
+\r
+ while(*datalen > 0) {\r
+ c = **dataptr;\r
+ --*datalen;\r
+ ++*dataptr;\r
+ \r
+ if(c == endmarker) {\r
+ return BUF_FOUND | BUF_FULL;\r
+ }\r
+ }\r
+ \r
+ return BUF_FULL;\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+static char\r
+send_data(register struct psock *s)\r
+{\r
+ if(s->state != STATE_DATA_SENT || uip_rexmit()) {\r
+ if(s->sendlen > uip_mss()) {\r
+ uip_send(s->sendptr, uip_mss());\r
+ } else {\r
+ uip_send(s->sendptr, s->sendlen);\r
+ }\r
+ s->state = STATE_DATA_SENT;\r
+ return 1;\r
+ }\r
+ return 0;\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+static char\r
+data_acked(register struct psock *s)\r
+{\r
+ if(s->state == STATE_DATA_SENT && uip_acked()) {\r
+ if(s->sendlen > uip_mss()) {\r
+ s->sendlen -= uip_mss();\r
+ s->sendptr += uip_mss();\r
+ } else {\r
+ s->sendptr += s->sendlen;\r
+ s->sendlen = 0;\r
+ }\r
+ s->state = STATE_ACKED;\r
+ return 1;\r
+ }\r
+ return 0;\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+PT_THREAD(psock_send(register struct psock *s, const char *buf,\r
+ unsigned int len))\r
+{\r
+ PT_BEGIN(&s->psockpt);\r
+\r
+ /* If there is no data to send, we exit immediately. */\r
+ if(len == 0) {\r
+ PT_EXIT(&s->psockpt);\r
+ }\r
+\r
+ /* Save the length of and a pointer to the data that is to be\r
+ sent. */\r
+ s->sendptr = (unsigned char*)buf;\r
+ s->sendlen = len;\r
+\r
+ s->state = STATE_NONE;\r
+\r
+ /* We loop here until all data is sent. The s->sendlen variable is\r
+ updated by the data_sent() function. */\r
+ while(s->sendlen > 0) {\r
+\r
+ /*\r
+ * The condition for this PT_WAIT_UNTIL is a little tricky: the\r
+ * protothread will wait here until all data has been acknowledged\r
+ * (data_acked() returns true) and until all data has been sent\r
+ * (send_data() returns true). The two functions data_acked() and\r
+ * send_data() must be called in succession to ensure that all\r
+ * data is sent. Therefore the & operator is used instead of the\r
+ * && operator, which would cause only the data_acked() function\r
+ * to be called when it returns false.\r
+ */\r
+ PT_WAIT_UNTIL(&s->psockpt, data_acked(s) & send_data(s));\r
+ }\r
+\r
+ s->state = STATE_NONE;\r
+ \r
+ PT_END(&s->psockpt);\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+PT_THREAD(psock_generator_send(register struct psock *s,\r
+ unsigned short (*generate)(void *), void *arg))\r
+{\r
+ PT_BEGIN(&s->psockpt);\r
+\r
+ /* Ensure that there is a generator function to call. */\r
+ if(generate == NULL) {\r
+ PT_EXIT(&s->psockpt);\r
+ }\r
+\r
+ /* Call the generator function to generate the data in the\r
+ uip_appdata buffer. */\r
+ s->sendlen = generate(arg);\r
+ s->sendptr = uip_appdata;\r
+\r
+ s->state = STATE_NONE; \r
+ do {\r
+ /* Call the generator function again if we are called to perform a\r
+ retransmission. */\r
+ if(uip_rexmit()) {\r
+ generate(arg);\r
+ }\r
+ /* Wait until all data is sent and acknowledged. */\r
+ PT_WAIT_UNTIL(&s->psockpt, data_acked(s) & send_data(s));\r
+ } while(s->sendlen > 0);\r
+ \r
+ s->state = STATE_NONE;\r
+ \r
+ PT_END(&s->psockpt);\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+u16_t\r
+psock_datalen(struct psock *psock)\r
+{\r
+ return psock->bufsize - psock->buf.left;\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+char\r
+psock_newdata(struct psock *s)\r
+{\r
+ if(s->readlen > 0) {\r
+ /* There is data in the uip_appdata buffer that has not yet been\r
+ read with the PSOCK_READ functions. */\r
+ return 1;\r
+ } else if(s->state == STATE_READ) {\r
+ /* All data in uip_appdata buffer already consumed. */\r
+ s->state = STATE_BLOCKED_NEWDATA;\r
+ return 0;\r
+ } else if(uip_newdata()) {\r
+ /* There is new data that has not been consumed. */\r
+ return 1;\r
+ } else {\r
+ /* There is no new data. */\r
+ return 0;\r
+ }\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+PT_THREAD(psock_readto(register struct psock *psock, unsigned char c))\r
+{\r
+ PT_BEGIN(&psock->psockpt);\r
+\r
+ buf_setup(&psock->buf, (unsigned char*)psock->bufptr, psock->bufsize);\r
+ \r
+ /* XXX: Should add buf_checkmarker() before do{} loop, if\r
+ incoming data has been handled while waiting for a write. */\r
+\r
+ do {\r
+ if(psock->readlen == 0) {\r
+ PT_WAIT_UNTIL(&psock->psockpt, psock_newdata(psock));\r
+ psock->state = STATE_READ;\r
+ psock->readptr = (u8_t *)uip_appdata;\r
+ psock->readlen = uip_datalen();\r
+ }\r
+ } while((buf_bufto(&psock->buf, c,\r
+ &psock->readptr,\r
+ &psock->readlen) & BUF_FOUND) == 0);\r
+ \r
+ if(psock_datalen(psock) == 0) {\r
+ psock->state = STATE_NONE;\r
+ PT_RESTART(&psock->psockpt);\r
+ }\r
+ PT_END(&psock->psockpt);\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+PT_THREAD(psock_readbuf(register struct psock *psock))\r
+{\r
+ PT_BEGIN(&psock->psockpt);\r
+\r
+ buf_setup(&psock->buf, (unsigned char * ) psock->bufptr, psock->bufsize);\r
+ \r
+ /* XXX: Should add buf_checkmarker() before do{} loop, if\r
+ incoming data has been handled while waiting for a write. */\r
+\r
+ do {\r
+ if(psock->readlen == 0) {\r
+ PT_WAIT_UNTIL(&psock->psockpt, psock_newdata(psock));\r
+ psock->state = STATE_READ;\r
+ psock->readptr = (u8_t *)uip_appdata;\r
+ psock->readlen = uip_datalen();\r
+ }\r
+ } while(buf_bufdata(&psock->buf, psock->bufsize,\r
+ &psock->readptr,\r
+ &psock->readlen) != BUF_FULL);\r
+\r
+ if(psock_datalen(psock) == 0) {\r
+ psock->state = STATE_NONE;\r
+ PT_RESTART(&psock->psockpt);\r
+ }\r
+ PT_END(&psock->psockpt);\r
+}\r
+/*---------------------------------------------------------------------------*/\r
+void\r
+psock_init(register struct psock *psock, char *buffer, unsigned int buffersize)\r
+{\r
+ psock->state = STATE_NONE;\r
+ psock->readlen = 0;\r
+ psock->bufptr = buffer;\r
+ psock->bufsize = buffersize;\r
+ buf_setup(&psock->buf, (unsigned char*) buffer, buffersize);\r
+ PT_INIT(&psock->pt);\r
+ PT_INIT(&psock->psockpt);\r
+}\r
+/*---------------------------------------------------------------------------*/\r
--- /dev/null
+/** \addtogroup sys\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \defgroup clock Clock library\r
+ *\r
+ * The clock library is the interface between Contiki and the platform\r
+ * specific clock functionality. The clock library performs a single\r
+ * function: measuring time. Additionally, the clock library provides\r
+ * a macro, CLOCK_SECOND, which corresponds to one second of system\r
+ * time.\r
+ *\r
+ * \note The clock library need in many cases not be used\r
+ * directly. Rather, the \ref timer "timer library" or the \ref etimer\r
+ * "event timers" should be used.\r
+ *\r
+ * \sa \ref timer "Timer library"\r
+ * \sa \ref etimer "Event timers"\r
+ *\r
+ * @{\r
+ */\r
+\r
+/*\r
+ * Copyright (c) 2004, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the Contiki operating system.\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: clock.h,v 1.11 2009/01/24 15:20:11 adamdunkels Exp $\r
+ */\r
+#ifndef __CLOCK_H__\r
+#define __CLOCK_H__\r
+\r
+#include "net/clock-arch.h"\r
+\r
+//_RB_#include "contiki-conf.h"\r
+#if 0 /* XXX problems with signedness and use in timer_expired(). #if:ed it out for now. */\r
+\r
+/**\r
+ * Check if a clock time value is less than another clock time value.\r
+ *\r
+ * This macro checks if a clock time value is less than another clock\r
+ * time value. This macro is needed to correctly handle wrap-around of\r
+ * clock time values.\r
+ *\r
+ */\r
+#define CLOCK_LT( a, b ) ( (clock_time_t) ((a) - (b)) < ((clock_time_t) (~((clock_time_t) 0)) >> 1) )\r
+#endif /* 0 */\r
+\r
+/**\r
+ * Initialize the clock library.\r
+ *\r
+ * This function initializes the clock library and should be called\r
+ * from the main() function of the system.\r
+ *\r
+ */\r
+void clock_init( void );\r
+\r
+/**\r
+ * Get the current clock time.\r
+ *\r
+ * This function returns the current system clock time.\r
+ *\r
+ * \return The current clock time, measured in system ticks.\r
+ */\r
+CCIF clock_time_t clock_time( void );\r
+\r
+void clock_delay( unsigned int );\r
+\r
+/**\r
+ * A second, measured in system clock time.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#ifdef CLOCK_CONF_SECOND\r
+#define CLOCK_SECOND CLOCK_CONF_SECOND\r
+#else\r
+#define CLOCK_SECOND ( clock_time_t ) 32\r
+#endif\r
+int clock_fine_max( void );\r
+unsigned short clock_fine( void );\r
+\r
+CCIF unsigned long clock_seconds( void );\r
+#endif /* __CLOCK_H__ */\r
+\r
+/** @} */\r
+\r
+/** @} */\r
--- /dev/null
+/*\r
+ * Copyright (c) 2004-2005, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the Contiki operating system.\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: pt.h,v 1.3 2008/10/14 12:46:39 nvt-se Exp $\r
+ */\r
+\r
+/**\r
+ * \addtogroup pt\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Protothreads implementation.\r
+ * \author\r
+ * Adam Dunkels <adam@sics.se>\r
+ *\r
+ */\r
+#ifndef __PT_H__\r
+#define __PT_H__\r
+\r
+#include "sys/lc.h"\r
+\r
+struct pt\r
+{\r
+ lc_t lc;\r
+};\r
+\r
+#define PT_WAITING 0\r
+#define PT_YIELDED 1\r
+#define PT_EXITED 2\r
+#define PT_ENDED 3\r
+\r
+/**\r
+ * \name Initialization\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Initialize a protothread.\r
+ *\r
+ * Initializes a protothread. Initialization must be done prior to\r
+ * starting to execute the protothread.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \sa PT_SPAWN()\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_INIT( pt ) LC_INIT( (pt)->lc )\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \name Declaration and definition\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Declaration of a protothread.\r
+ *\r
+ * This macro is used to declare a protothread. All protothreads must\r
+ * be declared with this macro.\r
+ *\r
+ * \param name_args The name and arguments of the C function\r
+ * implementing the protothread.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_THREAD( name_args ) char name_args\r
+\r
+/**\r
+ * Declare the start of a protothread inside the C function\r
+ * implementing the protothread.\r
+ *\r
+ * This macro is used to declare the starting point of a\r
+ * protothread. It should be placed at the start of the function in\r
+ * which the protothread runs. All C statements above the PT_BEGIN()\r
+ * invokation will be executed each time the protothread is scheduled.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_BEGIN( pt ) \\r
+ { \\r
+ char PT_YIELD_FLAG = 1; \\r
+ LC_RESUME( (pt)->lc )\r
+\r
+/**\r
+ * Declare the end of a protothread.\r
+ *\r
+ * This macro is used for declaring that a protothread ends. It must\r
+ * always be used together with a matching PT_BEGIN() macro.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_END( pt ) \\r
+ LC_END( (pt)->lc ); \\r
+ PT_YIELD_FLAG = 0; \\r
+ PT_INIT( pt ); \\r
+ return PT_ENDED; \\r
+}\r
+\r
+/** @} */\r
+\r
+/**\r
+ * \name Blocked wait\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Block and wait until condition is true.\r
+ *\r
+ * This macro blocks the protothread until the specified condition is\r
+ * true.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ * \param condition The condition.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_WAIT_UNTIL( pt, condition ) \\r
+ do \\r
+ { \\r
+ LC_SET( (pt)->lc ); \\r
+ if( !(condition) ) \\r
+ { \\r
+ return PT_WAITING; \\r
+ } \\r
+ } while( 0 )\r
+\r
+/**\r
+ * Block and wait while condition is true.\r
+ *\r
+ * This function blocks and waits while condition is true. See\r
+ * PT_WAIT_UNTIL().\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ * \param cond The condition.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_WAIT_WHILE( pt, cond ) PT_WAIT_UNTIL( (pt), !(cond) )\r
+ /** @} */\r
+\r
+ /**\r
+ * \name Hierarchical protothreads\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Block and wait until a child protothread completes.\r
+ *\r
+ * This macro schedules a child protothread. The current protothread\r
+ * will block until the child protothread completes.\r
+ *\r
+ * \note The child protothread must be manually initialized with the\r
+ * PT_INIT() function before this function is used.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ * \param thread The child protothread with arguments\r
+ *\r
+ * \sa PT_SPAWN()\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_WAIT_THREAD( pt, thread ) PT_WAIT_WHILE( (pt), PT_SCHEDULE(thread) )\r
+\r
+/**\r
+ * Spawn a child protothread and wait until it exits.\r
+ *\r
+ * This macro spawns a child protothread and waits until it exits. The\r
+ * macro can only be used within a protothread.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ * \param child A pointer to the child protothread's control structure.\r
+ * \param thread The child protothread with arguments\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_SPAWN( pt, child, thread ) \\r
+ do \\r
+ { \\r
+ PT_INIT( (child) ); \\r
+ PT_WAIT_THREAD( (pt), (thread) ); \\r
+ } while( 0 )\r
+\r
+ /** @} */\r
+\r
+ /**\r
+ * \name Exiting and restarting\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Restart the protothread.\r
+ *\r
+ * This macro will block and cause the running protothread to restart\r
+ * its execution at the place of the PT_BEGIN() call.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_RESTART( pt ) \\r
+ do \\r
+ { \\r
+ PT_INIT( pt ); \\r
+ return PT_WAITING; \\r
+ } while( 0 )\r
+\r
+/**\r
+ * Exit the protothread.\r
+ *\r
+ * This macro causes the protothread to exit. If the protothread was\r
+ * spawned by another protothread, the parent protothread will become\r
+ * unblocked and can continue to run.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_EXIT( pt ) \\r
+ do \\r
+ { \\r
+ PT_INIT( pt ); \\r
+ return PT_EXITED; \\r
+ } while( 0 )\r
+ /** @} */\r
+\r
+ /**\r
+ * \name Calling a protothread\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Schedule a protothread.\r
+ *\r
+ * This function schedules a protothread. The return value of the\r
+ * function is non-zero if the protothread is running or zero if the\r
+ * protothread has exited.\r
+ *\r
+ * \param f The call to the C function implementing the protothread to\r
+ * be scheduled\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_SCHEDULE( f ) ( (f) < PT_EXITED )\r
+ /** @} */\r
+\r
+ /**\r
+ * \name Yielding from a protothread\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * Yield from the current protothread.\r
+ *\r
+ * This function will yield the protothread, thereby allowing other\r
+ * processing to take place in the system.\r
+ *\r
+ * \param pt A pointer to the protothread control structure.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_YIELD( pt ) \\r
+ do \\r
+ { \\r
+ PT_YIELD_FLAG = 0; \\r
+ LC_SET( (pt)->lc ); \\r
+ if( PT_YIELD_FLAG == 0 ) \\r
+ { \\r
+ return PT_YIELDED; \\r
+ } \\r
+ } while( 0 )\r
+\r
+/**\r
+ * \brief Yield from the protothread until a condition occurs.\r
+ * \param pt A pointer to the protothread control structure.\r
+ * \param cond The condition.\r
+ *\r
+ * This function will yield the protothread, until the\r
+ * specified condition evaluates to true.\r
+ *\r
+ *\r
+ * \hideinitializer\r
+ */\r
+#define PT_YIELD_UNTIL( pt, cond ) \\r
+ do \\r
+ { \\r
+ PT_YIELD_FLAG = 0; \\r
+ LC_SET( (pt)->lc ); \\r
+ if( (PT_YIELD_FLAG == 0) || !(cond) ) \\r
+ { \\r
+ return PT_YIELDED; \\r
+ } \\r
+ } while( 0 )\r
+ /** @} */\r
+#endif /* __PT_H__ */\r
+\r
+ /** @} */\r
+
\ No newline at end of file
--- /dev/null
+/** \addtogroup sys\r
+ * @{ */\r
+\r
+/**\r
+ * \defgroup timer Timer library\r
+ *\r
+ * The Contiki kernel does not provide support for timed\r
+ * events. Rather, an application that wants to use timers needs to\r
+ * explicitly use the timer library.\r
+ *\r
+ * The timer library provides functions for setting, resetting and\r
+ * restarting timers, and for checking if a timer has expired. An\r
+ * application must "manually" check if its timers have expired; this\r
+ * is not done automatically.\r
+ *\r
+ * A timer is declared as a \c struct \c timer and all access to the\r
+ * timer is made by a pointer to the declared timer.\r
+ *\r
+ * \note The timer library is not able to post events when a timer\r
+ * expires. The \ref etimer "Event timers" should be used for this\r
+ * purpose.\r
+ *\r
+ * \note The timer library uses the \ref clock "Clock library" to\r
+ * measure time. Intervals should be specified in the format used by\r
+ * the clock library.\r
+ *\r
+ * \sa \ref etimer "Event timers"\r
+ *\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Timer library header file.\r
+ * \author\r
+ * Adam Dunkels <adam@sics.se>\r
+ */\r
+\r
+/*\r
+ * Copyright (c) 2004, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the Contiki operating system.\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: timer.h,v 1.2 2008/09/21 08:58:05 adamdunkels Exp $\r
+ */\r
+#ifndef __TIMER_H__\r
+#define __TIMER_H__\r
+\r
+#include "sys/clock.h"\r
+\r
+/**\r
+ * A timer.\r
+ *\r
+ * This structure is used for declaring a timer. The timer must be set\r
+ * with timer_set() before it can be used.\r
+ *\r
+ * \hideinitializer\r
+ */\r
+struct timer\r
+{\r
+ clock_time_t start;\r
+ clock_time_t interval;\r
+};\r
+\r
+void timer_set( struct timer *t, clock_time_t interval );\r
+void timer_reset( struct timer *t );\r
+void timer_restart( struct timer *t );\r
+int timer_expired( struct timer *t );\r
+clock_time_t timer_remaining( struct timer *t );\r
+#endif /* __TIMER_H__ */\r
+\r
+/** @} */\r
+\r
+/** @} */\r
--- /dev/null
+/**\r
+ * \addtogroup timer\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Timer library implementation.\r
+ * \author\r
+ * Adam Dunkels <adam@sics.se>\r
+ */\r
+\r
+/*\r
+ * Copyright (c) 2004, Swedish Institute of Computer Science.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. Neither the name of the Institute nor the names of its contributors\r
+ * may be used to endorse or promote products derived from this software\r
+ * without specific prior written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND\r
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE\r
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
+ * SUCH DAMAGE.\r
+ *\r
+ * This file is part of the Contiki operating system.\r
+ *\r
+ * Author: Adam Dunkels <adam@sics.se>\r
+ *\r
+ * $Id: timer.c,v 1.5 2009/01/24 15:20:11 adamdunkels Exp $\r
+ */\r
+\r
+//_RB_#include "contiki-conf.h"\r
+#include "uip-conf.h"\r
+#include "net/clock-arch.h"\r
+#include "sys/clock.h"\r
+#include "sys/timer.h"\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * Set a timer.\r
+ *\r
+ * This function is used to set a timer for a time sometime in the\r
+ * future. The function timer_expired() will evaluate to true after\r
+ * the timer has expired.\r
+ *\r
+ * \param t A pointer to the timer\r
+ * \param interval The interval before the timer expires.\r
+ *\r
+ */\r
+void timer_set( struct timer *t, clock_time_t interval )\r
+{\r
+ t->interval = interval;\r
+ t->start = clock_time();\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * Reset the timer with the same interval.\r
+ *\r
+ * This function resets the timer with the same interval that was\r
+ * given to the timer_set() function. The start point of the interval\r
+ * is the exact time that the timer last expired. Therefore, this\r
+ * function will cause the timer to be stable over time, unlike the\r
+ * timer_restart() function.\r
+ *\r
+ * \param t A pointer to the timer.\r
+ *\r
+ * \sa timer_restart()\r
+ */\r
+void timer_reset( struct timer *t )\r
+{\r
+ t->start += t->interval;\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * Restart the timer from the current point in time\r
+ *\r
+ * This function restarts a timer with the same interval that was\r
+ * given to the timer_set() function. The timer will start at the\r
+ * current time.\r
+ *\r
+ * \note A periodic timer will drift if this function is used to reset\r
+ * it. For preioric timers, use the timer_reset() function instead.\r
+ *\r
+ * \param t A pointer to the timer.\r
+ *\r
+ * \sa timer_reset()\r
+ */\r
+void timer_restart( struct timer *t )\r
+{\r
+ t->start = clock_time();\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * Check if a timer has expired.\r
+ *\r
+ * This function tests if a timer has expired and returns true or\r
+ * false depending on its status.\r
+ *\r
+ * \param t A pointer to the timer\r
+ *\r
+ * \return Non-zero if the timer has expired, zero otherwise.\r
+ *\r
+ */\r
+int timer_expired( struct timer *t )\r
+{\r
+ return( clock_time_t ) ( clock_time() - t->start ) >= ( clock_time_t ) t->interval;\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * The time until the timer expires\r
+ *\r
+ * This function returns the time until the timer expires.\r
+ *\r
+ * \param t A pointer to the timer\r
+ *\r
+ * \return The time until the timer expires\r
+ *\r
+ */\r
+clock_time_t timer_remaining( struct timer *t )\r
+{\r
+ return t->start + t->interval - clock_time();\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/** @} */\r
--- /dev/null
+//#define DEBUG_PRINTF( ... ) /*printf(__VA_ARGS__)*/\r
+\r
+/**\r
+ * \addtogroup uip\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * The uIP TCP/IP stack code.\r
+ * \author Adam Dunkels <adam@dunkels.com>\r
+ */\r
+\r
+/*\r
+ * Copyright (c) 2001-2003, Adam Dunkels.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. The name of the author may not be used to endorse or promote\r
+ * products derived from this software without specific prior\r
+ * written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS\r
+ * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\r
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\r
+ * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\r
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\r
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\r
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack.\r
+ *\r
+ * $Id: uip.c,v 1.15 2008/10/15 08:08:32 adamdunkels Exp $\r
+ *\r
+ */\r
+\r
+/*\r
+ * uIP is a small implementation of the IP, UDP and TCP protocols (as\r
+ * well as some basic ICMP stuff). The implementation couples the IP,\r
+ * UDP, TCP and the application layers very tightly. To keep the size\r
+ * of the compiled code down, this code frequently uses the goto\r
+ * statement. While it would be possible to break the uip_process()\r
+ * function into many smaller functions, this would increase the code\r
+ * size because of the overhead of parameter passing and the fact that\r
+ * the optimier would not be as efficient.\r
+ *\r
+ * The principle is that we have a small buffer, called the uip_buf,\r
+ * in which the device driver puts an incoming packet. The TCP/IP\r
+ * stack parses the headers in the packet, and calls the\r
+ * application. If the remote host has sent data to the application,\r
+ * this data is present in the uip_buf and the application read the\r
+ * data from there. It is up to the application to put this data into\r
+ * a byte stream if needed. The application will not be fed with data\r
+ * that is out of sequence.\r
+ *\r
+ * If the application whishes to send data to the peer, it should put\r
+ * its data into the uip_buf. The uip_appdata pointer points to the\r
+ * first available byte. The TCP/IP stack will calculate the\r
+ * checksums, and fill in the necessary header fields and finally send\r
+ * the packet back to the peer.\r
+*/\r
+#include "net/uip.h"\r
+#include "net/uipopt.h"\r
+#include "net/uip_arp.h"\r
+#include "net/uip_arch.h"\r
+\r
+#if !UIP_CONF_IPV6 /* If UIP_CONF_IPV6 is defined, we compile the\r
+ uip6.c file instead of this one. Therefore\r
+ this #ifndef removes the entire compilation\r
+ output of the uip.c file */\r
+\r
+#if UIP_CONF_IPV6\r
+#include "net/uip-neighbor.h"\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+#include <string.h>\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/* Variable definitions. */\r
+\r
+/* The IP address of this host. If it is defined to be fixed (by\r
+ setting UIP_FIXEDADDR to 1 in uipopt.h), the address is set\r
+ here. Otherwise, the address */\r
+#if UIP_FIXEDADDR > 0\r
+const uip_ipaddr_t uip_hostaddr = { UIP_IPADDR0, UIP_IPADDR1, UIP_IPADDR2, UIP_IPADDR3 };\r
+const uip_ipaddr_t uip_draddr = { UIP_DRIPADDR0, UIP_DRIPADDR1, UIP_DRIPADDR2, UIP_DRIPADDR3 };\r
+const uip_ipaddr_t uip_netmask = { UIP_NETMASK0, UIP_NETMASK1, UIP_NETMASK2, UIP_NETMASK3 };\r
+#else\r
+uip_ipaddr_t uip_hostaddr, uip_draddr, uip_netmask;\r
+#endif /* UIP_FIXEDADDR */\r
+\r
+const uip_ipaddr_t uip_broadcast_addr =\r
+#if UIP_CONF_IPV6\r
+{ { 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff } };\r
+#else /* UIP_CONF_IPV6 */\r
+{\r
+ {\r
+ 0xff, 0xff, 0xff, 0xff\r
+ }\r
+};\r
+#endif /* UIP_CONF_IPV6 */\r
+const uip_ipaddr_t uip_all_zeroes_addr = { { 0x0, /* rest is 0 */ } };\r
+\r
+#if UIP_FIXEDETHADDR\r
+const struct uip_eth_addr uip_ethaddr = { { UIP_ETHADDR0, UIP_ETHADDR1, UIP_ETHADDR2, UIP_ETHADDR3, UIP_ETHADDR4, UIP_ETHADDR5 } };\r
+#else\r
+struct uip_eth_addr uip_ethaddr = { { 0, 0, 0, 0, 0, 0 } };\r
+#endif\r
+#ifndef UIP_CONF_EXTERNAL_BUFFER\r
+u8_t uip_buf[UIP_BUFSIZE + 2]; /* The packet buffer that contains\r
+ incoming packets. */\r
+#endif /* UIP_CONF_EXTERNAL_BUFFER */\r
+\r
+void *uip_appdata; /* The uip_appdata pointer points to\r
+ application data. */\r
+void *uip_sappdata; /* The uip_appdata pointer points to\r
+ the application data which is to\r
+ be sent. */\r
+#if UIP_URGDATA > 0\r
+void *uip_urgdata; /* The uip_urgdata pointer points to\r
+ urgent data (out-of-band data), if\r
+ present. */\r
+u16_t uip_urglen, uip_surglen;\r
+#endif /* UIP_URGDATA > 0 */\r
+\r
+u16_t uip_len, uip_slen;\r
+\r
+/* The uip_len is either 8 or 16 bits,\r
+ depending on the maximum packet\r
+ size. */\r
+u8_t uip_flags; /* The uip_flags variable is used for\r
+ communication between the TCP/IP stack\r
+ and the application program. */\r
+struct uip_conn *uip_conn; /* uip_conn always points to the current\r
+ connection. */\r
+\r
+struct uip_conn uip_conns[UIP_CONNS];\r
+\r
+/* The uip_conns array holds all TCP\r
+ connections. */\r
+u16_t uip_listenports[UIP_LISTENPORTS];\r
+\r
+/* The uip_listenports list all currently\r
+ listning ports. */\r
+#if UIP_UDP\r
+struct uip_udp_conn *uip_udp_conn;\r
+struct uip_udp_conn uip_udp_conns[UIP_UDP_CONNS];\r
+#endif /* UIP_UDP */\r
+\r
+static u16_t ipid; /* Ths ipid variable is an increasing\r
+ number that is used for the IP ID\r
+ field. */\r
+\r
+void uip_setipid( u16_t id )\r
+{\r
+ ipid = id;\r
+}\r
+\r
+static u8_t iss[4]; /* The iss variable is used for the TCP\r
+ initial sequence number. */\r
+\r
+#if UIP_ACTIVE_OPEN\r
+static u16_t lastport; /* Keeps track of the last port used for\r
+ a new connection. */\r
+#endif /* UIP_ACTIVE_OPEN */\r
+\r
+/* Temporary variables. */\r
+u8_t uip_acc32[4];\r
+static u8_t c, opt;\r
+static u16_t tmp16;\r
+\r
+/* Structures and definitions. */\r
+#define TCP_FIN 0x01\r
+#define TCP_SYN 0x02\r
+#define TCP_RST 0x04\r
+#define TCP_PSH 0x08\r
+#define TCP_ACK 0x10\r
+#define TCP_URG 0x20\r
+#define TCP_CTL 0x3f\r
+\r
+#define TCP_OPT_END 0 /* End of TCP options list */\r
+#define TCP_OPT_NOOP 1 /* "No-operation" TCP option */\r
+#define TCP_OPT_MSS 2 /* Maximum segment size TCP option */\r
+\r
+#define TCP_OPT_MSS_LEN 4 /* Length of TCP MSS option. */\r
+\r
+#define ICMP_ECHO_REPLY 0\r
+#define ICMP_ECHO 8\r
+\r
+#define ICMP_DEST_UNREACHABLE 3\r
+#define ICMP_PORT_UNREACHABLE 3\r
+\r
+#define ICMP6_ECHO_REPLY 129\r
+#define ICMP6_ECHO 128\r
+#define ICMP6_NEIGHBOR_SOLICITATION 135\r
+#define ICMP6_NEIGHBOR_ADVERTISEMENT 136\r
+\r
+#define ICMP6_FLAG_S ( 1 << 6 )\r
+#define ICMP6_OPTION_SOURCE_LINK_ADDRESS 1\r
+#define ICMP6_OPTION_TARGET_LINK_ADDRESS 2\r
+\r
+/* Macros. */\r
+#define BUF ( ( struct uip_tcpip_hdr * ) &uip_buf[UIP_LLH_LEN] )\r
+#define FBUF ( ( struct uip_tcpip_hdr * ) &uip_reassbuf[0] )\r
+#define ICMPBUF ( ( struct uip_icmpip_hdr * ) &uip_buf[UIP_LLH_LEN] )\r
+#define UDPBUF ( ( struct uip_udpip_hdr * ) &uip_buf[UIP_LLH_LEN] )\r
+#if UIP_STATISTICS == 1\r
+struct uip_stats uip_stat;\r
+#define UIP_STAT( s ) s\r
+#else\r
+#define UIP_STAT( s )\r
+#endif /* UIP_STATISTICS == 1 */\r
+\r
+#if UIP_LOGGING == 1\r
+#include <stdio.h>\r
+void uip_log( char *msg );\r
+#define UIP_LOG( m ) uip_log( m )\r
+#else\r
+#define UIP_LOG( m )\r
+#endif /* UIP_LOGGING == 1 */\r
+\r
+#if !UIP_ARCH_ADD32\r
+void uip_add32( u8_t *op32, u16_t op16 )\r
+{\r
+ uip_acc32[3] = op32[3] + ( op16 & 0xff );\r
+ uip_acc32[2] = op32[2] + ( op16 >> 8 );\r
+ uip_acc32[1] = op32[1];\r
+ uip_acc32[0] = op32[0];\r
+\r
+ if( uip_acc32[2] < (op16 >> 8) )\r
+ {\r
+ ++uip_acc32[1];\r
+ if( uip_acc32[1] == 0 )\r
+ {\r
+ ++uip_acc32[0];\r
+ }\r
+ }\r
+\r
+ if( uip_acc32[3] < (op16 & 0xff) )\r
+ {\r
+ ++uip_acc32[2];\r
+ if( uip_acc32[2] == 0 )\r
+ {\r
+ ++uip_acc32[1];\r
+ if( uip_acc32[1] == 0 )\r
+ {\r
+ ++uip_acc32[0];\r
+ }\r
+ }\r
+ }\r
+}\r
+\r
+#endif /* UIP_ARCH_ADD32 */\r
+\r
+#if !UIP_ARCH_CHKSUM\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static u16_t chksum( u16_t sum, const u8_t *data, u16_t len )\r
+{\r
+ u16_t t;\r
+ const u8_t *dataptr;\r
+ const u8_t *last_byte;\r
+\r
+ dataptr = data;\r
+ last_byte = data + len - 1;\r
+\r
+ while( dataptr < last_byte )\r
+ { /* At least two more bytes */\r
+ t = ( dataptr[0] << 8 ) + dataptr[1];\r
+ sum += t;\r
+ if( sum < t )\r
+ {\r
+ sum++; /* carry */\r
+ }\r
+\r
+ dataptr += 2;\r
+ }\r
+\r
+ if( dataptr == last_byte )\r
+ {\r
+ t = ( dataptr[0] << 8 ) + 0;\r
+ sum += t;\r
+ if( sum < t )\r
+ {\r
+ sum++; /* carry */\r
+ }\r
+ }\r
+\r
+ /* Return sum in host byte order. */\r
+ return sum;\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+u16_t uip_chksum( u16_t *data, u16_t len )\r
+{\r
+ return htons( chksum(0, ( u8_t * ) data, len) );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+#ifndef UIP_ARCH_IPCHKSUM\r
+u16_t uip_ipchksum( void )\r
+{\r
+ u16_t sum;\r
+\r
+ sum = chksum( 0, &uip_buf[UIP_LLH_LEN], UIP_IPH_LEN );\r
+\r
+ //DEBUG_PRINTF( "uip_ipchksum: sum 0x%04x\n", sum );\r
+ return( sum == 0 ) ? 0xffff : htons( sum );\r
+}\r
+\r
+#endif\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static u16_t upper_layer_chksum( u8_t proto )\r
+{\r
+ u16_t upper_layer_len;\r
+ u16_t sum;\r
+\r
+#if UIP_CONF_IPV6\r
+ upper_layer_len = ( ((u16_t) (BUF->len[0]) << 8) + BUF->len[1] );\r
+#else /* UIP_CONF_IPV6 */\r
+ upper_layer_len = ( ((u16_t) (BUF->len[0]) << 8) + BUF->len[1] ) - UIP_IPH_LEN;\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+ /* First sum pseudoheader. */\r
+\r
+ /* IP protocol and length fields. This addition cannot carry. */\r
+ sum = upper_layer_len + proto;\r
+\r
+ /* Sum IP source and destination addresses. */\r
+ sum = chksum( sum, ( u8_t * ) &BUF->srcipaddr, 2 * sizeof(uip_ipaddr_t) );\r
+\r
+ /* Sum TCP header and data. */\r
+ sum = chksum( sum, &uip_buf[UIP_IPH_LEN + UIP_LLH_LEN], upper_layer_len );\r
+\r
+ return( sum == 0 ) ? 0xffff : htons( sum );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+#if UIP_CONF_IPV6\r
+u16_t uip_icmp6chksum( void )\r
+{\r
+ return upper_layer_chksum( UIP_PROTO_ICMP6 );\r
+}\r
+\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+/*---------------------------------------------------------------------------*/\r
+u16_t uip_tcpchksum( void )\r
+{\r
+ return upper_layer_chksum( UIP_PROTO_TCP );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+#if UIP_UDP_CHECKSUMS\r
+u16_t uip_udpchksum( void )\r
+{\r
+ return upper_layer_chksum( UIP_PROTO_UDP );\r
+}\r
+\r
+#endif /* UIP_UDP_CHECKSUMS */\r
+#endif /* UIP_ARCH_CHKSUM */\r
+\r
+/*---------------------------------------------------------------------------*/\r
+void uip_init( void )\r
+{\r
+ for( c = 0; c < UIP_LISTENPORTS; ++c )\r
+ {\r
+ uip_listenports[c] = 0;\r
+ }\r
+\r
+ for( c = 0; c < UIP_CONNS; ++c )\r
+ {\r
+ uip_conns[c].tcpstateflags = UIP_CLOSED;\r
+ }\r
+\r
+#if UIP_ACTIVE_OPEN\r
+ lastport = 1024;\r
+#endif /* UIP_ACTIVE_OPEN */\r
+\r
+#if UIP_UDP\r
+ for( c = 0; c < UIP_UDP_CONNS; ++c )\r
+ {\r
+ uip_udp_conns[c].lport = 0;\r
+ }\r
+\r
+#endif /* UIP_UDP */\r
+\r
+ /* IPv4 initialization. */\r
+#if UIP_FIXEDADDR == 0\r
+ /* uip_hostaddr[0] = uip_hostaddr[1] = 0;*/\r
+#endif /* UIP_FIXEDADDR */\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+#if UIP_ACTIVE_OPEN\r
+struct uip_conn *uip_connect( uip_ipaddr_t *ripaddr, u16_t rport )\r
+{\r
+ register struct uip_conn *conn, *cconn;\r
+\r
+ /* Find an unused local port. */\r
+again:\r
+ ++lastport;\r
+\r
+ if( lastport >= 32000 )\r
+ {\r
+ lastport = 4096;\r
+ }\r
+\r
+ /* Check if this port is already in use, and if so try to find\r
+ another one. */\r
+ for( c = 0; c < UIP_CONNS; ++c )\r
+ {\r
+ conn = &uip_conns[c];\r
+ if( conn->tcpstateflags != UIP_CLOSED && conn->lport == htons(lastport) )\r
+ {\r
+ goto again;\r
+ }\r
+ }\r
+\r
+ conn = 0;\r
+ for( c = 0; c < UIP_CONNS; ++c )\r
+ {\r
+ cconn = &uip_conns[c];\r
+ if( cconn->tcpstateflags == UIP_CLOSED )\r
+ {\r
+ conn = cconn;\r
+ break;\r
+ }\r
+\r
+ if( cconn->tcpstateflags == UIP_TIME_WAIT )\r
+ {\r
+ if( conn == 0 || cconn->timer > conn->timer )\r
+ {\r
+ conn = cconn;\r
+ }\r
+ }\r
+ }\r
+\r
+ if( conn == 0 )\r
+ {\r
+ return 0;\r
+ }\r
+\r
+ conn->tcpstateflags = UIP_SYN_SENT;\r
+\r
+ conn->snd_nxt[0] = iss[0];\r
+ conn->snd_nxt[1] = iss[1];\r
+ conn->snd_nxt[2] = iss[2];\r
+ conn->snd_nxt[3] = iss[3];\r
+\r
+ conn->initialmss = conn->mss = UIP_TCP_MSS;\r
+\r
+ conn->len = 1; /* TCP length of the SYN is one. */\r
+ conn->nrtx = 0;\r
+ conn->timer = 1; /* Send the SYN next time around. */\r
+ conn->rto = UIP_RTO;\r
+ conn->sa = 0;\r
+ conn->sv = 16; /* Initial value of the RTT variance. */\r
+ conn->lport = htons( lastport );\r
+ conn->rport = rport;\r
+ uip_ipaddr_copy( &conn->ripaddr, ripaddr );\r
+\r
+ return conn;\r
+}\r
+\r
+#endif /* UIP_ACTIVE_OPEN */\r
+\r
+/*---------------------------------------------------------------------------*/\r
+#if UIP_UDP\r
+struct uip_udp_conn *uip_udp_new( const uip_ipaddr_t *ripaddr, u16_t rport )\r
+{\r
+ register struct uip_udp_conn *conn;\r
+\r
+ /* Find an unused local port. */\r
+again:\r
+ ++lastport;\r
+\r
+ if( lastport >= 32000 )\r
+ {\r
+ lastport = 4096;\r
+ }\r
+\r
+ for( c = 0; c < UIP_UDP_CONNS; ++c )\r
+ {\r
+ if( uip_udp_conns[c].lport == htons(lastport) )\r
+ {\r
+ goto again;\r
+ }\r
+ }\r
+\r
+ conn = 0;\r
+ for( c = 0; c < UIP_UDP_CONNS; ++c )\r
+ {\r
+ if( uip_udp_conns[c].lport == 0 )\r
+ {\r
+ conn = &uip_udp_conns[c];\r
+ break;\r
+ }\r
+ }\r
+\r
+ if( conn == 0 )\r
+ {\r
+ return 0;\r
+ }\r
+\r
+ conn->lport = HTONS( lastport );\r
+ conn->rport = rport;\r
+ if( ripaddr == NULL )\r
+ {\r
+ memset( &conn->ripaddr, 0, sizeof(uip_ipaddr_t) );\r
+ }\r
+ else\r
+ {\r
+ uip_ipaddr_copy( &conn->ripaddr, ripaddr );\r
+ }\r
+\r
+ conn->ttl = UIP_TTL;\r
+\r
+ return conn;\r
+}\r
+\r
+#endif /* UIP_UDP */\r
+\r
+/*---------------------------------------------------------------------------*/\r
+void uip_unlisten( u16_t port )\r
+{\r
+ for( c = 0; c < UIP_LISTENPORTS; ++c )\r
+ {\r
+ if( uip_listenports[c] == port )\r
+ {\r
+ uip_listenports[c] = 0;\r
+ return;\r
+ }\r
+ }\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+void uip_listen( u16_t port )\r
+{\r
+ for( c = 0; c < UIP_LISTENPORTS; ++c )\r
+ {\r
+ if( uip_listenports[c] == 0 )\r
+ {\r
+ uip_listenports[c] = port;\r
+ return;\r
+ }\r
+ }\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/* XXX: IP fragment reassembly: not well-tested. */\r
+#if UIP_REASSEMBLY && !UIP_CONF_IPV6\r
+#define UIP_REASS_BUFSIZE ( UIP_BUFSIZE - UIP_LLH_LEN )\r
+static u8_t uip_reassbuf[UIP_REASS_BUFSIZE];\r
+static u8_t uip_reassbitmap[UIP_REASS_BUFSIZE / ( 8 * 8 )];\r
+static const u8_t bitmap_bits[8] = { 0xff, 0x7f, 0x3f, 0x1f, 0x0f, 0x07, 0x03, 0x01 };\r
+static u16_t uip_reasslen;\r
+static u8_t uip_reassflags;\r
+#define UIP_REASS_FLAG_LASTFRAG 0x01\r
+static u8_t uip_reasstmr;\r
+\r
+#define IP_MF 0x20\r
+\r
+static u8_t uip_reass( void )\r
+{\r
+ u16_t offset, len;\r
+ u16_t i;\r
+\r
+ /* If ip_reasstmr is zero, no packet is present in the buffer, so we\r
+ write the IP header of the fragment into the reassembly\r
+ buffer. The timer is updated with the maximum age. */\r
+ if( uip_reasstmr == 0 )\r
+ {\r
+ memcpy( uip_reassbuf, &BUF->vhl, UIP_IPH_LEN );\r
+ uip_reasstmr = UIP_REASS_MAXAGE;\r
+ uip_reassflags = 0;\r
+\r
+ /* Clear the bitmap. */\r
+ memset( uip_reassbitmap, 0, sizeof(uip_reassbitmap) );\r
+ }\r
+\r
+ /* Check if the incoming fragment matches the one currently present\r
+ in the reasembly buffer. If so, we proceed with copying the\r
+ fragment into the buffer. */\r
+ if\r
+ (\r
+ BUF->srcipaddr[0] == FBUF->srcipaddr[0] &&\r
+ BUF->srcipaddr[1] == FBUF->srcipaddr[1] &&\r
+ BUF->destipaddr[0] == FBUF->destipaddr[0] &&\r
+ BUF->destipaddr[1] == FBUF->destipaddr[1] &&\r
+ BUF->ipid[0] == FBUF->ipid[0] &&\r
+ BUF->ipid[1] == FBUF->ipid[1]\r
+ )\r
+ {\r
+ len = ( BUF->len[0] << 8 ) + BUF->len[1] - ( BUF->vhl & 0x0f ) * 4;\r
+ offset = ( ((BUF->ipoffset[0] & 0x3f) << 8) + BUF->ipoffset[1] ) * 8;\r
+\r
+ /* If the offset or the offset + fragment length overflows the\r
+ reassembly buffer, we discard the entire packet. */\r
+ if( offset > UIP_REASS_BUFSIZE || offset + len > UIP_REASS_BUFSIZE )\r
+ {\r
+ uip_reasstmr = 0;\r
+ goto nullreturn;\r
+ }\r
+\r
+ /* Copy the fragment into the reassembly buffer, at the right\r
+ offset. */\r
+ memcpy( &uip_reassbuf[UIP_IPH_LEN + offset], ( char * ) BUF + ( int ) ((BUF->vhl & 0x0f) * 4), len );\r
+\r
+ /* Update the bitmap. */\r
+ if( offset / (8 * 8) == (offset + len) / (8 * 8) )\r
+ {\r
+ /* If the two endpoints are in the same byte, we only update\r
+ that byte. */\r
+ uip_reassbitmap[offset / ( 8 * 8 )] |= bitmap_bits[( offset / 8 ) & 7] &~bitmap_bits[( (offset + len) / 8 ) & 7];\r
+ }\r
+ else\r
+ {\r
+ /* If the two endpoints are in different bytes, we update the\r
+ bytes in the endpoints and fill the stuff inbetween with\r
+ 0xff. */\r
+ uip_reassbitmap[offset / ( 8 * 8 )] |= bitmap_bits[( offset / 8 ) & 7];\r
+ for( i = 1 + offset / (8 * 8); i < (offset + len) / (8 * 8); ++i )\r
+ {\r
+ uip_reassbitmap[i] = 0xff;\r
+ }\r
+\r
+ uip_reassbitmap[( offset + len ) / ( 8 * 8 )] |= ~bitmap_bits[( (offset + len) / 8 ) & 7];\r
+ }\r
+\r
+ /* If this fragment has the More Fragments flag set to zero, we\r
+ know that this is the last fragment, so we can calculate the\r
+ size of the entire packet. We also set the\r
+ IP_REASS_FLAG_LASTFRAG flag to indicate that we have received\r
+ the final fragment. */\r
+ if( (BUF->ipoffset[0] & IP_MF) == 0 )\r
+ {\r
+ uip_reassflags |= UIP_REASS_FLAG_LASTFRAG;\r
+ uip_reasslen = offset + len;\r
+ }\r
+\r
+ /* Finally, we check if we have a full packet in the buffer. We do\r
+ this by checking if we have the last fragment and if all bits\r
+ in the bitmap are set. */\r
+ if( uip_reassflags & UIP_REASS_FLAG_LASTFRAG )\r
+ {\r
+ /* Check all bytes up to and including all but the last byte in\r
+ the bitmap. */\r
+ for( i = 0; i < uip_reasslen / (8 * 8) - 1; ++i )\r
+ {\r
+ if( uip_reassbitmap[i] != 0xff )\r
+ {\r
+ goto nullreturn;\r
+ }\r
+ }\r
+\r
+ /* Check the last byte in the bitmap. It should contain just the\r
+ right amount of bits. */\r
+ if( uip_reassbitmap[uip_reasslen / (8 * 8)] != (u8_t)~bitmap_bits[uip_reasslen / 8 & 7] )\r
+ {\r
+ goto nullreturn;\r
+ }\r
+\r
+ /* If we have come this far, we have a full packet in the\r
+ buffer, so we allocate a pbuf and copy the packet into it. We\r
+ also reset the timer. */\r
+ uip_reasstmr = 0;\r
+ memcpy( BUF, FBUF, uip_reasslen );\r
+\r
+ /* Pretend to be a "normal" (i.e., not fragmented) IP packet\r
+ from now on. */\r
+ BUF->ipoffset[0] = BUF->ipoffset[1] = 0;\r
+ BUF->len[0] = uip_reasslen >> 8;\r
+ BUF->len[1] = uip_reasslen & 0xff;\r
+ BUF->ipchksum = 0;\r
+ BUF->ipchksum = ~( uip_ipchksum() );\r
+\r
+ return uip_reasslen;\r
+ }\r
+ }\r
+\r
+nullreturn:\r
+ return 0;\r
+}\r
+\r
+#endif /* UIP_REASSEMBLY */\r
+\r
+/*---------------------------------------------------------------------------*/\r
+static void uip_add_rcv_nxt( u16_t n )\r
+{\r
+ uip_add32( uip_conn->rcv_nxt, n );\r
+ uip_conn->rcv_nxt[0] = uip_acc32[0];\r
+ uip_conn->rcv_nxt[1] = uip_acc32[1];\r
+ uip_conn->rcv_nxt[2] = uip_acc32[2];\r
+ uip_conn->rcv_nxt[3] = uip_acc32[3];\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+void uip_process( u8_t flag )\r
+{\r
+ register struct uip_conn *uip_connr = uip_conn;\r
+\r
+#if UIP_UDP\r
+ if( flag == UIP_UDP_SEND_CONN )\r
+ {\r
+ goto udp_send;\r
+ }\r
+\r
+#endif /* UIP_UDP */\r
+\r
+ uip_sappdata = uip_appdata = &uip_buf[UIP_IPTCPH_LEN + UIP_LLH_LEN];\r
+\r
+ /* Check if we were invoked because of a poll request for a\r
+ particular connection. */\r
+ if( flag == UIP_POLL_REQUEST )\r
+ {\r
+ if( (uip_connr->tcpstateflags & UIP_TS_MASK) == UIP_ESTABLISHED && !uip_outstanding(uip_connr) )\r
+ {\r
+ uip_flags = UIP_POLL;\r
+ UIP_APPCALL();\r
+ goto appsend;\r
+ }\r
+\r
+ goto drop;\r
+\r
+ /* Check if we were invoked because of the perodic timer fireing. */\r
+ }\r
+ else if( flag == UIP_TIMER )\r
+ {\r
+#if UIP_REASSEMBLY\r
+ if( uip_reasstmr != 0 )\r
+ {\r
+ --uip_reasstmr;\r
+ }\r
+\r
+#endif /* UIP_REASSEMBLY */\r
+\r
+ /* Increase the initial sequence number. */\r
+ if( ++iss[3] == 0 )\r
+ {\r
+ if( ++iss[2] == 0 )\r
+ {\r
+ if( ++iss[1] == 0 )\r
+ {\r
+ ++iss[0];\r
+ }\r
+ }\r
+ }\r
+\r
+ /* Reset the length variables. */\r
+ uip_len = 0;\r
+ uip_slen = 0;\r
+\r
+ /* Check if the connection is in a state in which we simply wait\r
+ for the connection to time out. If so, we increase the\r
+ connection's timer and remove the connection if it times\r
+ out. */\r
+ if( uip_connr->tcpstateflags == UIP_TIME_WAIT || uip_connr->tcpstateflags == UIP_FIN_WAIT_2 )\r
+ {\r
+ ++( uip_connr->timer );\r
+ if( uip_connr->timer == UIP_TIME_WAIT_TIMEOUT )\r
+ {\r
+ uip_connr->tcpstateflags = UIP_CLOSED;\r
+ }\r
+ }\r
+ else if( uip_connr->tcpstateflags != UIP_CLOSED )\r
+ {\r
+ /* If the connection has outstanding data, we increase the\r
+ connection's timer and see if it has reached the RTO value\r
+ in which case we retransmit. */\r
+ if( uip_outstanding(uip_connr) )\r
+ {\r
+ if( uip_connr->timer-- == 0 )\r
+ {\r
+ if\r
+ (\r
+ uip_connr->nrtx == UIP_MAXRTX ||\r
+ (\r
+ (uip_connr->tcpstateflags == UIP_SYN_SENT || uip_connr->tcpstateflags == UIP_SYN_RCVD) &&\r
+ uip_connr->nrtx == UIP_MAXSYNRTX\r
+ )\r
+ )\r
+ {\r
+ uip_connr->tcpstateflags = UIP_CLOSED;\r
+\r
+ /* We call UIP_APPCALL() with uip_flags set to\r
+ UIP_TIMEDOUT to inform the application that the\r
+ connection has timed out. */\r
+ uip_flags = UIP_TIMEDOUT;\r
+ UIP_APPCALL();\r
+\r
+ /* We also send a reset packet to the remote host. */\r
+ BUF->flags = TCP_RST | TCP_ACK;\r
+ goto tcp_send_nodata;\r
+ }\r
+\r
+ /* Exponential backoff. */\r
+ uip_connr->timer = UIP_RTO << ( uip_connr->nrtx > 4 ? 4 : uip_connr->nrtx );\r
+ ++( uip_connr->nrtx );\r
+\r
+ /* Ok, so we need to retransmit. We do this differently\r
+ depending on which state we are in. In ESTABLISHED, we\r
+ call upon the application so that it may prepare the\r
+ data for the retransmit. In SYN_RCVD, we resend the\r
+ SYNACK that we sent earlier and in LAST_ACK we have to\r
+ retransmit our FINACK. */\r
+ UIP_STAT( ++uip_stat.tcp.rexmit );\r
+ switch( uip_connr->tcpstateflags & UIP_TS_MASK )\r
+ {\r
+ case UIP_SYN_RCVD:\r
+ /* In the SYN_RCVD state, we should retransmit our\r
+ SYNACK. */\r
+ goto tcp_send_synack;\r
+\r
+ #if UIP_ACTIVE_OPEN\r
+\r
+ case UIP_SYN_SENT:\r
+ /* In the SYN_SENT state, we retransmit out SYN. */\r
+ BUF->flags = 0;\r
+ goto tcp_send_syn;\r
+ #endif /* UIP_ACTIVE_OPEN */\r
+\r
+ case UIP_ESTABLISHED:\r
+ /* In the ESTABLISHED state, we call upon the application\r
+ to do the actual retransmit after which we jump into\r
+ the code for sending out the packet (the apprexmit\r
+ label). */\r
+ uip_flags = UIP_REXMIT;\r
+ UIP_APPCALL();\r
+ goto apprexmit;\r
+\r
+ case UIP_FIN_WAIT_1:\r
+ case UIP_CLOSING:\r
+ case UIP_LAST_ACK:\r
+ /* In all these states we should retransmit a FINACK. */\r
+ goto tcp_send_finack;\r
+ }\r
+ }\r
+ }\r
+ else if( (uip_connr->tcpstateflags & UIP_TS_MASK) == UIP_ESTABLISHED )\r
+ {\r
+ /* If there was no need for a retransmission, we poll the\r
+ application for new data. */\r
+ uip_flags = UIP_POLL;\r
+ UIP_APPCALL();\r
+ goto appsend;\r
+ }\r
+ }\r
+\r
+ goto drop;\r
+ }\r
+\r
+#if UIP_UDP\r
+ if( flag == UIP_UDP_TIMER )\r
+ {\r
+ if( uip_udp_conn->lport != 0 )\r
+ {\r
+ uip_conn = NULL;\r
+ uip_sappdata = uip_appdata = &uip_buf[UIP_LLH_LEN + UIP_IPUDPH_LEN];\r
+ uip_len = uip_slen = 0;\r
+ uip_flags = UIP_POLL;\r
+ UIP_UDP_APPCALL();\r
+ goto udp_send;\r
+ }\r
+ else\r
+ {\r
+ goto drop;\r
+ }\r
+ }\r
+\r
+#endif\r
+\r
+ /* This is where the input processing starts. */\r
+ UIP_STAT( ++uip_stat.ip.recv );\r
+\r
+ /* Start of IP input header processing code. */\r
+#if UIP_CONF_IPV6\r
+ /* Check validity of the IP header. */\r
+ if( (BUF->vtc & 0xf0) != 0x60 )\r
+ { /* IP version and header length. */\r
+ UIP_STAT( ++uip_stat.ip.drop );\r
+ UIP_STAT( ++uip_stat.ip.vhlerr );\r
+ UIP_LOG( "ipv6: invalid version." );\r
+ goto drop;\r
+ }\r
+\r
+#else /* UIP_CONF_IPV6 */\r
+ /* Check validity of the IP header. */\r
+ if( BUF->vhl != 0x45 )\r
+ { /* IP version and header length. */\r
+ UIP_STAT( ++uip_stat.ip.drop );\r
+ UIP_STAT( ++uip_stat.ip.vhlerr );\r
+ UIP_LOG( "ip: invalid version or header length." );\r
+ goto drop;\r
+ }\r
+\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+ /* Check the size of the packet. If the size reported to us in\r
+ uip_len is smaller the size reported in the IP header, we assume\r
+ that the packet has been corrupted in transit. If the size of\r
+ uip_len is larger than the size reported in the IP packet header,\r
+ the packet has been padded and we set uip_len to the correct\r
+ value.. */\r
+ if( (BUF->len[0] << 8) + BUF->len[1] <= uip_len )\r
+ {\r
+ uip_len = ( BUF->len[0] << 8 ) + BUF->len[1];\r
+#if UIP_CONF_IPV6\r
+ uip_len += 40; /* The length reported in the IPv6 header is the\r
+ length of the payload that follows the\r
+ header. However, uIP uses the uip_len variable\r
+ for holding the size of the entire packet,\r
+ including the IP header. For IPv4 this is not a\r
+ problem as the length field in the IPv4 header\r
+ contains the length of the entire packet. But\r
+ for IPv6 we need to add the size of the IPv6\r
+ header (40 bytes). */\r
+#endif /* UIP_CONF_IPV6 */\r
+ }\r
+ else\r
+ {\r
+ UIP_LOG( "ip: packet shorter than reported in IP header." );\r
+ goto drop;\r
+ }\r
+\r
+#if !UIP_CONF_IPV6\r
+ /* Check the fragment flag. */\r
+ if( (BUF->ipoffset[0] & 0x3f) != 0 || BUF->ipoffset[1] != 0 )\r
+ {\r
+#if UIP_REASSEMBLY\r
+ uip_len = uip_reass();\r
+ if( uip_len == 0 )\r
+ {\r
+ goto drop;\r
+ }\r
+\r
+#else /* UIP_REASSEMBLY */\r
+ UIP_STAT( ++uip_stat.ip.drop );\r
+ UIP_STAT( ++uip_stat.ip.fragerr );\r
+ UIP_LOG( "ip: fragment dropped." );\r
+ goto drop;\r
+#endif /* UIP_REASSEMBLY */\r
+ }\r
+\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+ if( uip_ipaddr_cmp(&uip_hostaddr, &uip_all_zeroes_addr) )\r
+ {\r
+ /* If we are configured to use ping IP address configuration and\r
+ hasn't been assigned an IP address yet, we accept all ICMP\r
+ packets. */\r
+#if UIP_PINGADDRCONF && !UIP_CONF_IPV6\r
+ if( BUF->proto == UIP_PROTO_ICMP )\r
+ {\r
+ UIP_LOG( "ip: possible ping config packet received." );\r
+ goto icmp_input;\r
+ }\r
+ else\r
+ {\r
+ UIP_LOG( "ip: packet dropped since no address assigned." );\r
+ goto drop;\r
+ }\r
+\r
+#endif /* UIP_PINGADDRCONF */\r
+ }\r
+ else\r
+ {\r
+ /* If IP broadcast support is configured, we check for a broadcast\r
+ UDP packet, which may be destined to us. */\r
+#if UIP_BROADCAST\r
+ //DEBUG_PRINTF( "UDP IP checksum 0x%04x\n", uip_ipchksum() );\r
+ if( BUF->proto == UIP_PROTO_UDP && uip_ipaddr_cmp(&BUF->destipaddr, &uip_broadcast_addr) /*&&\r
+ uip_ipchksum() == 0xffff*/ )\r
+ {\r
+ goto udp_input;\r
+ }\r
+\r
+#endif /* UIP_BROADCAST */\r
+\r
+ /* Check if the packet is destined for our IP address. */\r
+#if !UIP_CONF_IPV6\r
+ if( !uip_ipaddr_cmp(&BUF->destipaddr, &uip_hostaddr) )\r
+ {\r
+ UIP_STAT( ++uip_stat.ip.drop );\r
+ goto drop;\r
+ }\r
+\r
+#else /* UIP_CONF_IPV6 */\r
+ /* For IPv6, packet reception is a little trickier as we need to\r
+ make sure that we listen to certain multicast addresses (all\r
+ hosts multicast address, and the solicited-node multicast\r
+ address) as well. However, we will cheat here and accept all\r
+ multicast packets that are sent to the ff02::/16 addresses. */\r
+ if( !uip_ipaddr_cmp(&BUF->destipaddr, &uip_hostaddr) && BUF->destipaddr.u16[0] != HTONS(0xff02) )\r
+ {\r
+ UIP_STAT( ++uip_stat.ip.drop );\r
+ goto drop;\r
+ }\r
+\r
+#endif /* UIP_CONF_IPV6 */\r
+ }\r
+\r
+#if !UIP_CONF_IPV6\r
+ if( uip_ipchksum() != 0xffff )\r
+ { /* Compute and check the IP header\r
+ checksum. */\r
+ UIP_STAT( ++uip_stat.ip.drop );\r
+ UIP_STAT( ++uip_stat.ip.chkerr );\r
+ UIP_LOG( "ip: bad checksum." );\r
+ goto drop;\r
+ }\r
+\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+ if( BUF->proto == UIP_PROTO_TCP )\r
+ { /* Check for TCP packet. If so,\r
+ proceed with TCP input\r
+ processing. */\r
+ goto tcp_input;\r
+ }\r
+\r
+#if UIP_UDP\r
+ if( BUF->proto == UIP_PROTO_UDP )\r
+ {\r
+ goto udp_input;\r
+ }\r
+\r
+#endif /* UIP_UDP */\r
+\r
+#if !UIP_CONF_IPV6\r
+ /* ICMPv4 processing code follows. */\r
+ if( BUF->proto != UIP_PROTO_ICMP )\r
+ { /* We only allow ICMP packets from\r
+ here. */\r
+ UIP_STAT( ++uip_stat.ip.drop );\r
+ UIP_STAT( ++uip_stat.ip.protoerr );\r
+ UIP_LOG( "ip: neither tcp nor icmp." );\r
+ goto drop;\r
+ }\r
+\r
+#if UIP_PINGADDRCONF\r
+ icmp_input :\r
+#endif /* UIP_PINGADDRCONF */\r
+ UIP_STAT( ++uip_stat.icmp.recv );\r
+\r
+ /* ICMP echo (i.e., ping) processing. This is simple, we only change\r
+ the ICMP type from ECHO to ECHO_REPLY and adjust the ICMP\r
+ checksum before we return the packet. */\r
+ if( ICMPBUF->type != ICMP_ECHO )\r
+ {\r
+ UIP_STAT( ++uip_stat.icmp.drop );\r
+ UIP_STAT( ++uip_stat.icmp.typeerr );\r
+ UIP_LOG( "icmp: not icmp echo." );\r
+ goto drop;\r
+ }\r
+\r
+ /* If we are configured to use ping IP address assignment, we use\r
+ the destination IP address of this ping packet and assign it to\r
+ ourself. */\r
+#if UIP_PINGADDRCONF\r
+ if( uip_ipaddr_cmp(&uip_hostaddr, &uip_all_zeroes_addr) )\r
+ {\r
+ uip_hostaddr = BUF->destipaddr;\r
+ }\r
+\r
+#endif /* UIP_PINGADDRCONF */\r
+\r
+ ICMPBUF->type = ICMP_ECHO_REPLY;\r
+\r
+ if( ICMPBUF->icmpchksum >= HTONS(0xffff - (ICMP_ECHO << 8)) )\r
+ {\r
+ ICMPBUF->icmpchksum += HTONS( ICMP_ECHO << 8 ) + 1;\r
+ }\r
+ else\r
+ {\r
+ ICMPBUF->icmpchksum += HTONS( ICMP_ECHO << 8 );\r
+ }\r
+\r
+ /* Swap IP addresses. */\r
+ uip_ipaddr_copy( &BUF->destipaddr, &BUF->srcipaddr );\r
+ uip_ipaddr_copy( &BUF->srcipaddr, &uip_hostaddr );\r
+\r
+ UIP_STAT( ++uip_stat.icmp.sent );\r
+ BUF->ttl = UIP_TTL;\r
+ goto ip_send_nolen;\r
+\r
+ /* End of IPv4 input header processing code. */\r
+#else /* !UIP_CONF_IPV6 */\r
+ /* This is IPv6 ICMPv6 processing code. */\r
+\r
+ //DEBUG_PRINTF( "icmp6_input: length %d\n", uip_len );\r
+ if( BUF->proto != UIP_PROTO_ICMP6 )\r
+ { /* We only allow ICMPv6 packets from\r
+ here. */\r
+ UIP_STAT( ++uip_stat.ip.drop );\r
+ UIP_STAT( ++uip_stat.ip.protoerr );\r
+ UIP_LOG( "ip: neither tcp nor icmp6." );\r
+ goto drop;\r
+ }\r
+\r
+ UIP_STAT( ++uip_stat.icmp.recv );\r
+\r
+ /* If we get a neighbor solicitation for our address we should send\r
+ a neighbor advertisement message back. */\r
+ if( ICMPBUF->type == ICMP6_NEIGHBOR_SOLICITATION )\r
+ {\r
+ if( uip_ipaddr_cmp(&ICMPBUF->icmp6data, &uip_hostaddr) )\r
+ {\r
+ if( ICMPBUF->options[0] == ICMP6_OPTION_SOURCE_LINK_ADDRESS )\r
+ {\r
+ /* Save the sender's address in our neighbor list. */\r
+ uip_neighbor_add( &ICMPBUF->srcipaddr, &(ICMPBUF->options[2]) );\r
+ }\r
+\r
+ /* We should now send a neighbor advertisement back to where the\r
+ neighbor solicication came from. */\r
+ ICMPBUF->type = ICMP6_NEIGHBOR_ADVERTISEMENT;\r
+ ICMPBUF->flags = ICMP6_FLAG_S; /* Solicited flag. */\r
+\r
+ ICMPBUF->reserved1 = ICMPBUF->reserved2 = ICMPBUF->reserved3 = 0;\r
+\r
+ uip_ipaddr_copy( &ICMPBUF->destipaddr, &ICMPBUF->srcipaddr );\r
+ uip_ipaddr_copy( &ICMPBUF->srcipaddr, &uip_hostaddr );\r
+ ICMPBUF->options[0] = ICMP6_OPTION_TARGET_LINK_ADDRESS;\r
+ ICMPBUF->options[1] = 1; /* Options length, 1 = 8 bytes. */\r
+ memcpy( &(ICMPBUF->options[2]), &uip_ethaddr, sizeof(uip_ethaddr) );\r
+ ICMPBUF->icmpchksum = 0;\r
+ ICMPBUF->icmpchksum = ~uip_icmp6chksum();\r
+\r
+ goto send;\r
+ }\r
+\r
+ goto drop;\r
+ }\r
+ else if( ICMPBUF->type == ICMP6_ECHO )\r
+ {\r
+ /* ICMP echo (i.e., ping) processing. This is simple, we only\r
+ change the ICMP type from ECHO to ECHO_REPLY and update the\r
+ ICMP checksum before we return the packet. */\r
+ ICMPBUF->type = ICMP6_ECHO_REPLY;\r
+\r
+ uip_ipaddr_copy( &BUF->destipaddr, &BUF->srcipaddr );\r
+ uip_ipaddr_copy( &BUF->srcipaddr, &uip_hostaddr );\r
+ ICMPBUF->icmpchksum = 0;\r
+ ICMPBUF->icmpchksum = ~uip_icmp6chksum();\r
+\r
+ UIP_STAT( ++uip_stat.icmp.sent );\r
+ goto send;\r
+ }\r
+ else\r
+ {\r
+ //DEBUG_PRINTF( "Unknown icmp6 message type %d\n", ICMPBUF->type );\r
+ UIP_STAT( ++uip_stat.icmp.drop );\r
+ UIP_STAT( ++uip_stat.icmp.typeerr );\r
+ UIP_LOG( "icmp: unknown ICMP message." );\r
+ goto drop;\r
+ }\r
+\r
+ /* End of IPv6 ICMP processing. */\r
+#endif /* !UIP_CONF_IPV6 */\r
+\r
+#if UIP_UDP\r
+ /* UDP input processing. */\r
+ udp_input :\r
+ /* UDP processing is really just a hack. We don't do anything to the\r
+ UDP/IP headers, but let the UDP application do all the hard\r
+ work. If the application sets uip_slen, it has a packet to\r
+ send. */\r
+#if UIP_UDP_CHECKSUMS\r
+ uip_len = uip_len - UIP_IPUDPH_LEN;\r
+ uip_appdata = &uip_buf[UIP_LLH_LEN + UIP_IPUDPH_LEN];\r
+ if( UDPBUF->udpchksum != 0 && uip_udpchksum() != 0xffff )\r
+ {\r
+ UIP_STAT( ++uip_stat.udp.drop );\r
+ UIP_STAT( ++uip_stat.udp.chkerr );\r
+ UIP_LOG( "udp: bad checksum." );\r
+ goto drop;\r
+ }\r
+\r
+#else /* UIP_UDP_CHECKSUMS */\r
+ uip_len = uip_len - UIP_IPUDPH_LEN;\r
+#endif /* UIP_UDP_CHECKSUMS */\r
+\r
+ /* Demultiplex this UDP packet between the UDP "connections". */\r
+ for( uip_udp_conn = &uip_udp_conns[0]; uip_udp_conn < &uip_udp_conns[UIP_UDP_CONNS]; ++uip_udp_conn )\r
+ {\r
+ /* If the local UDP port is non-zero, the connection is considered\r
+ to be used. If so, the local port number is checked against the\r
+ destination port number in the received packet. If the two port\r
+ numbers match, the remote port number is checked if the\r
+ connection is bound to a remote port. Finally, if the\r
+ connection is bound to a remote IP address, the source IP\r
+ address of the packet is checked. */\r
+ if\r
+ (\r
+ uip_udp_conn->lport != 0 &&\r
+ UDPBUF->destport == uip_udp_conn->lport &&\r
+ (uip_udp_conn->rport == 0 || UDPBUF->srcport == uip_udp_conn->rport) &&\r
+ (\r
+ uip_ipaddr_cmp(&uip_udp_conn->ripaddr, &uip_all_zeroes_addr) ||\r
+ uip_ipaddr_cmp(&uip_udp_conn->ripaddr, &uip_broadcast_addr) ||\r
+ uip_ipaddr_cmp(&BUF->srcipaddr, &uip_udp_conn->ripaddr)\r
+ )\r
+ )\r
+ {\r
+ goto udp_found;\r
+ }\r
+ }\r
+\r
+ UIP_LOG( "udp: no matching connection found" );\r
+#if UIP_CONF_ICMP_DEST_UNREACH && !UIP_CONF_IPV6\r
+ /* Copy fields from packet header into payload of this ICMP packet. */\r
+ memcpy( &(ICMPBUF->payload[0]), ICMPBUF, UIP_IPH_LEN + 8 );\r
+\r
+ /* Set the ICMP type and code. */\r
+ ICMPBUF->type = ICMP_DEST_UNREACHABLE;\r
+ ICMPBUF->icode = ICMP_PORT_UNREACHABLE;\r
+\r
+ /* Calculate the ICMP checksum. */\r
+ ICMPBUF->icmpchksum = 0;\r
+ ICMPBUF->icmpchksum = ~uip_chksum( ( u16_t * ) &(ICMPBUF->type), 36 );\r
+\r
+ /* Set the IP destination address to be the source address of the\r
+ original packet. */\r
+ uip_ipaddr_copy( &BUF->destipaddr, &BUF->srcipaddr );\r
+\r
+ /* Set our IP address as the source address. */\r
+ uip_ipaddr_copy( &BUF->srcipaddr, &uip_hostaddr );\r
+\r
+ /* The size of the ICMP destination unreachable packet is 36 + the\r
+ size of the IP header (20) = 56. */\r
+ uip_len = 36 + UIP_IPH_LEN;\r
+ ICMPBUF->len[0] = 0;\r
+ ICMPBUF->len[1] = ( u8_t ) uip_len;\r
+ ICMPBUF->ttl = UIP_TTL;\r
+ ICMPBUF->proto = UIP_PROTO_ICMP;\r
+\r
+ goto ip_send_nolen;\r
+#else /* UIP_CONF_ICMP_DEST_UNREACH */\r
+ goto drop;\r
+#endif /* UIP_CONF_ICMP_DEST_UNREACH */\r
+\r
+ udp_found : uip_conn = NULL;\r
+ uip_flags = UIP_NEWDATA;\r
+ uip_sappdata = uip_appdata = &uip_buf[UIP_LLH_LEN + UIP_IPUDPH_LEN];\r
+ uip_slen = 0;\r
+ UIP_UDP_APPCALL();\r
+\r
+udp_send:\r
+ if( uip_slen == 0 )\r
+ {\r
+ goto drop;\r
+ }\r
+\r
+ uip_len = uip_slen + UIP_IPUDPH_LEN;\r
+\r
+#if UIP_CONF_IPV6\r
+ /* For IPv6, the IP length field does not include the IPv6 IP header\r
+ length. */\r
+ BUF->len[0] = ( (uip_len - UIP_IPH_LEN) >> 8 );\r
+ BUF->len[1] = ( (uip_len - UIP_IPH_LEN) & 0xff );\r
+#else /* UIP_CONF_IPV6 */\r
+ BUF->len[0] = ( uip_len >> 8 );\r
+ BUF->len[1] = ( uip_len & 0xff );\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+ BUF->ttl = uip_udp_conn->ttl;\r
+ BUF->proto = UIP_PROTO_UDP;\r
+\r
+ UDPBUF->udplen = HTONS( uip_slen + UIP_UDPH_LEN );\r
+ UDPBUF->udpchksum = 0;\r
+\r
+ BUF->srcport = uip_udp_conn->lport;\r
+ BUF->destport = uip_udp_conn->rport;\r
+\r
+ uip_ipaddr_copy( &BUF->srcipaddr, &uip_hostaddr );\r
+ uip_ipaddr_copy( &BUF->destipaddr, &uip_udp_conn->ripaddr );\r
+\r
+ uip_appdata = &uip_buf[UIP_LLH_LEN + UIP_IPTCPH_LEN];\r
+\r
+#if UIP_UDP_CHECKSUMS\r
+ /* Calculate UDP checksum. */\r
+ UDPBUF->udpchksum = ~( uip_udpchksum() );\r
+ if( UDPBUF->udpchksum == 0 )\r
+ {\r
+ UDPBUF->udpchksum = 0xffff;\r
+ }\r
+\r
+#endif /* UIP_UDP_CHECKSUMS */\r
+\r
+ goto ip_send_nolen;\r
+#endif /* UIP_UDP */\r
+\r
+ /* TCP input processing. */\r
+ tcp_input : UIP_STAT( ++uip_stat.tcp.recv );\r
+\r
+ /* Start of TCP input header processing code. */\r
+ if( uip_tcpchksum() != 0xffff )\r
+ { /* Compute and check the TCP\r
+ checksum. */\r
+ UIP_STAT( ++uip_stat.tcp.drop );\r
+ UIP_STAT( ++uip_stat.tcp.chkerr );\r
+ UIP_LOG( "tcp: bad checksum." );\r
+ goto drop;\r
+ }\r
+\r
+ /* Demultiplex this segment. */\r
+\r
+ /* First check any active connections. */\r
+ for( uip_connr = &uip_conns[0]; uip_connr <= &uip_conns[UIP_CONNS - 1]; ++uip_connr )\r
+ {\r
+ if\r
+ (\r
+ uip_connr->tcpstateflags != UIP_CLOSED &&\r
+ BUF->destport == uip_connr->lport &&\r
+ BUF->srcport == uip_connr->rport &&\r
+ uip_ipaddr_cmp(&BUF->srcipaddr, &uip_connr->ripaddr)\r
+ )\r
+ {\r
+ goto found;\r
+ }\r
+ }\r
+\r
+ /* If we didn't find and active connection that expected the packet,\r
+ either this packet is an old duplicate, or this is a SYN packet\r
+ destined for a connection in LISTEN. If the SYN flag isn't set,\r
+ it is an old packet and we send a RST. */\r
+ if( (BUF->flags & TCP_CTL) != TCP_SYN )\r
+ {\r
+ goto reset;\r
+ }\r
+\r
+ tmp16 = BUF->destport;\r
+\r
+ /* Next, check listening connections. */\r
+ for( c = 0; c < UIP_LISTENPORTS; ++c )\r
+ {\r
+ if( tmp16 == uip_listenports[c] )\r
+ {\r
+ goto found_listen;\r
+ }\r
+ }\r
+\r
+ /* No matching connection found, so we send a RST packet. */\r
+ UIP_STAT( ++uip_stat.tcp.synrst );\r
+\r
+reset:\r
+ /* We do not send resets in response to resets. */\r
+ if( BUF->flags & TCP_RST )\r
+ {\r
+ goto drop;\r
+ }\r
+\r
+ UIP_STAT( ++uip_stat.tcp.rst );\r
+\r
+ BUF->flags = TCP_RST | TCP_ACK;\r
+ uip_len = UIP_IPTCPH_LEN;\r
+ BUF->tcpoffset = 5 << 4;\r
+\r
+ /* Flip the seqno and ackno fields in the TCP header. */\r
+ c = BUF->seqno[3];\r
+ BUF->seqno[3] = BUF->ackno[3];\r
+ BUF->ackno[3] = c;\r
+\r
+ c = BUF->seqno[2];\r
+ BUF->seqno[2] = BUF->ackno[2];\r
+ BUF->ackno[2] = c;\r
+\r
+ c = BUF->seqno[1];\r
+ BUF->seqno[1] = BUF->ackno[1];\r
+ BUF->ackno[1] = c;\r
+\r
+ c = BUF->seqno[0];\r
+ BUF->seqno[0] = BUF->ackno[0];\r
+ BUF->ackno[0] = c;\r
+\r
+ /* We also have to increase the sequence number we are\r
+ acknowledging. If the least significant byte overflowed, we need\r
+ to propagate the carry to the other bytes as well. */\r
+ if( ++BUF->ackno[3] == 0 )\r
+ {\r
+ if( ++BUF->ackno[2] == 0 )\r
+ {\r
+ if( ++BUF->ackno[1] == 0 )\r
+ {\r
+ ++BUF->ackno[0];\r
+ }\r
+ }\r
+ }\r
+\r
+ /* Swap port numbers. */\r
+ tmp16 = BUF->srcport;\r
+ BUF->srcport = BUF->destport;\r
+ BUF->destport = tmp16;\r
+\r
+ /* Swap IP addresses. */\r
+ uip_ipaddr_copy( &BUF->destipaddr, &BUF->srcipaddr );\r
+ uip_ipaddr_copy( &BUF->srcipaddr, &uip_hostaddr );\r
+\r
+ /* And send out the RST packet! */\r
+ goto tcp_send_noconn;\r
+\r
+ /* This label will be jumped to if we matched the incoming packet\r
+ with a connection in LISTEN. In that case, we should create a new\r
+ connection and send a SYNACK in return. */\r
+found_listen:\r
+ /* First we check if there are any connections avaliable. Unused\r
+ connections are kept in the same table as used connections, but\r
+ unused ones have the tcpstate set to CLOSED. Also, connections in\r
+ TIME_WAIT are kept track of and we'll use the oldest one if no\r
+ CLOSED connections are found. Thanks to Eddie C. Dost for a very\r
+ nice algorithm for the TIME_WAIT search. */\r
+ uip_connr = 0;\r
+ for( c = 0; c < UIP_CONNS; ++c )\r
+ {\r
+ if( uip_conns[c].tcpstateflags == UIP_CLOSED )\r
+ {\r
+ uip_connr = &uip_conns[c];\r
+ break;\r
+ }\r
+\r
+ if( uip_conns[c].tcpstateflags == UIP_TIME_WAIT )\r
+ {\r
+ if( uip_connr == 0 || uip_conns[c].timer > uip_connr->timer )\r
+ {\r
+ uip_connr = &uip_conns[c];\r
+ }\r
+ }\r
+ }\r
+\r
+ if( uip_connr == 0 )\r
+ {\r
+ /* All connections are used already, we drop packet and hope that\r
+ the remote end will retransmit the packet at a time when we\r
+ have more spare connections. */\r
+ UIP_STAT( ++uip_stat.tcp.syndrop );\r
+ UIP_LOG( "tcp: found no unused connections." );\r
+ goto drop;\r
+ }\r
+\r
+ uip_conn = uip_connr;\r
+\r
+ /* Fill in the necessary fields for the new connection. */\r
+ uip_connr->rto = uip_connr->timer = UIP_RTO;\r
+ uip_connr->sa = 0;\r
+ uip_connr->sv = 4;\r
+ uip_connr->nrtx = 0;\r
+ uip_connr->lport = BUF->destport;\r
+ uip_connr->rport = BUF->srcport;\r
+ uip_ipaddr_copy( &uip_connr->ripaddr, &BUF->srcipaddr );\r
+ uip_connr->tcpstateflags = UIP_SYN_RCVD;\r
+\r
+ uip_connr->snd_nxt[0] = iss[0];\r
+ uip_connr->snd_nxt[1] = iss[1];\r
+ uip_connr->snd_nxt[2] = iss[2];\r
+ uip_connr->snd_nxt[3] = iss[3];\r
+ uip_connr->len = 1;\r
+\r
+ /* rcv_nxt should be the seqno from the incoming packet + 1. */\r
+ uip_connr->rcv_nxt[3] = BUF->seqno[3];\r
+ uip_connr->rcv_nxt[2] = BUF->seqno[2];\r
+ uip_connr->rcv_nxt[1] = BUF->seqno[1];\r
+ uip_connr->rcv_nxt[0] = BUF->seqno[0];\r
+ uip_add_rcv_nxt( 1 );\r
+\r
+ /* Parse the TCP MSS option, if present. */\r
+ if( (BUF->tcpoffset & 0xf0) > 0x50 )\r
+ {\r
+ for( c = 0; c < ((BUF->tcpoffset >> 4) - 5) << 2; )\r
+ {\r
+ opt = uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN + c];\r
+ if( opt == TCP_OPT_END )\r
+ {\r
+ /* End of options. */\r
+ break;\r
+ }\r
+ else if( opt == TCP_OPT_NOOP )\r
+ {\r
+ ++c;\r
+\r
+ /* NOP option. */\r
+ }\r
+ else if( opt == TCP_OPT_MSS && uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN + 1 + c] == TCP_OPT_MSS_LEN )\r
+ {\r
+ /* An MSS option with the right option length. */\r
+ tmp16 = ( (u16_t) uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN + 2 + c] << 8 ) | ( u16_t ) uip_buf[UIP_IPTCPH_LEN + UIP_LLH_LEN + 3 + c];\r
+ uip_connr->initialmss = uip_connr->mss = tmp16 > UIP_TCP_MSS ? UIP_TCP_MSS : tmp16;\r
+\r
+ /* And we are done processing options. */\r
+ break;\r
+ }\r
+ else\r
+ {\r
+ /* All other options have a length field, so that we easily\r
+ can skip past them. */\r
+ if( uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN + 1 + c] == 0 )\r
+ {\r
+ /* If the length field is zero, the options are malformed\r
+ and we don't process them further. */\r
+ break;\r
+ }\r
+\r
+ c += uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN + 1 + c];\r
+ }\r
+ }\r
+ }\r
+\r
+ /* Our response will be a SYNACK. */\r
+#if UIP_ACTIVE_OPEN\r
+ tcp_send_synack : BUF->flags = TCP_ACK;\r
+\r
+tcp_send_syn:\r
+ BUF->flags |= TCP_SYN;\r
+#else /* UIP_ACTIVE_OPEN */\r
+ tcp_send_synack : BUF->flags = TCP_SYN | TCP_ACK;\r
+#endif /* UIP_ACTIVE_OPEN */\r
+\r
+ /* We send out the TCP Maximum Segment Size option with our\r
+ SYNACK. */\r
+ BUF->optdata[0] = TCP_OPT_MSS;\r
+ BUF->optdata[1] = TCP_OPT_MSS_LEN;\r
+ BUF->optdata[2] = ( UIP_TCP_MSS ) / 256;\r
+ BUF->optdata[3] = ( UIP_TCP_MSS ) & 255;\r
+ uip_len = UIP_IPTCPH_LEN + TCP_OPT_MSS_LEN;\r
+ BUF->tcpoffset = ( (UIP_TCPH_LEN + TCP_OPT_MSS_LEN) / 4 ) << 4;\r
+ goto tcp_send;\r
+\r
+ /* This label will be jumped to if we found an active connection. */\r
+found:\r
+ uip_conn = uip_connr;\r
+ uip_flags = 0;\r
+\r
+ /* We do a very naive form of TCP reset processing; we just accept\r
+ any RST and kill our connection. We should in fact check if the\r
+ sequence number of this reset is wihtin our advertised window\r
+ before we accept the reset. */\r
+ if( BUF->flags & TCP_RST )\r
+ {\r
+ uip_connr->tcpstateflags = UIP_CLOSED;\r
+ UIP_LOG( "tcp: got reset, aborting connection." );\r
+ uip_flags = UIP_ABORT;\r
+ UIP_APPCALL();\r
+ goto drop;\r
+ }\r
+\r
+ /* Calculate the length of the data, if the application has sent\r
+ any data to us. */\r
+ c = ( BUF->tcpoffset >> 4 ) << 2;\r
+\r
+ /* uip_len will contain the length of the actual TCP data. This is\r
+ calculated by subtracing the length of the TCP header (in\r
+ c) and the length of the IP header (20 bytes). */\r
+ uip_len = uip_len - c - UIP_IPH_LEN;\r
+\r
+ /* First, check if the sequence number of the incoming packet is\r
+ what we're expecting next. If not, we send out an ACK with the\r
+ correct numbers in. */\r
+ if( !(((uip_connr->tcpstateflags & UIP_TS_MASK) == UIP_SYN_SENT) && ((BUF->flags & TCP_CTL) == (TCP_SYN | TCP_ACK))) )\r
+ {\r
+ if\r
+ (\r
+ (uip_len > 0 || ((BUF->flags & (TCP_SYN | TCP_FIN)) != 0)) &&\r
+ (\r
+ BUF->seqno[0] != uip_connr->rcv_nxt[0] ||\r
+ BUF->seqno[1] != uip_connr->rcv_nxt[1] ||\r
+ BUF->seqno[2] != uip_connr->rcv_nxt[2] ||\r
+ BUF->seqno[3] != uip_connr->rcv_nxt[3]\r
+ )\r
+ )\r
+ {\r
+ goto tcp_send_ack;\r
+ }\r
+ }\r
+\r
+ /* Next, check if the incoming segment acknowledges any outstanding\r
+ data. If so, we update the sequence number, reset the length of\r
+ the outstanding data, calculate RTT estimations, and reset the\r
+ retransmission timer. */\r
+ if( (BUF->flags & TCP_ACK) && uip_outstanding(uip_connr) )\r
+ {\r
+ uip_add32( uip_connr->snd_nxt, uip_connr->len );\r
+\r
+ if\r
+ (\r
+ BUF->ackno[0] == uip_acc32[0] &&\r
+ BUF->ackno[1] == uip_acc32[1] &&\r
+ BUF->ackno[2] == uip_acc32[2] &&\r
+ BUF->ackno[3] == uip_acc32[3]\r
+ )\r
+ {\r
+ /* Update sequence number. */\r
+ uip_connr->snd_nxt[0] = uip_acc32[0];\r
+ uip_connr->snd_nxt[1] = uip_acc32[1];\r
+ uip_connr->snd_nxt[2] = uip_acc32[2];\r
+ uip_connr->snd_nxt[3] = uip_acc32[3];\r
+\r
+ /* Do RTT estimation, unless we have done retransmissions. */\r
+ if( uip_connr->nrtx == 0 )\r
+ {\r
+ signed char m;\r
+ m = uip_connr->rto - uip_connr->timer;\r
+\r
+ /* This is taken directly from VJs original code in his paper */\r
+ m = m - ( uip_connr->sa >> 3 );\r
+ uip_connr->sa += m;\r
+ if( m < 0 )\r
+ {\r
+ m = -m;\r
+ }\r
+\r
+ m = m - ( uip_connr->sv >> 2 );\r
+ uip_connr->sv += m;\r
+ uip_connr->rto = ( uip_connr->sa >> 3 ) + uip_connr->sv;\r
+ }\r
+\r
+ /* Set the acknowledged flag. */\r
+ uip_flags = UIP_ACKDATA;\r
+\r
+ /* Reset the retransmission timer. */\r
+ uip_connr->timer = uip_connr->rto;\r
+\r
+ /* Reset length of outstanding data. */\r
+ uip_connr->len = 0;\r
+ }\r
+ }\r
+\r
+ /* Do different things depending on in what state the connection is. */\r
+ switch( uip_connr->tcpstateflags & UIP_TS_MASK )\r
+ {\r
+ /* CLOSED and LISTEN are not handled here. CLOSE_WAIT is not\r
+ implemented, since we force the application to close when the\r
+ peer sends a FIN (hence the application goes directly from\r
+ ESTABLISHED to LAST_ACK). */\r
+ case UIP_SYN_RCVD:\r
+ /* In SYN_RCVD we have sent out a SYNACK in response to a SYN, and\r
+ we are waiting for an ACK that acknowledges the data we sent\r
+ out the last time. Therefore, we want to have the UIP_ACKDATA\r
+ flag set. If so, we enter the ESTABLISHED state. */\r
+ if( uip_flags & UIP_ACKDATA )\r
+ {\r
+ uip_connr->tcpstateflags = UIP_ESTABLISHED;\r
+ uip_flags = UIP_CONNECTED;\r
+ uip_connr->len = 0;\r
+ if( uip_len > 0 )\r
+ {\r
+ uip_flags |= UIP_NEWDATA;\r
+ uip_add_rcv_nxt( uip_len );\r
+ }\r
+\r
+ uip_slen = 0;\r
+ UIP_APPCALL();\r
+ goto appsend;\r
+ }\r
+\r
+ goto drop;\r
+ #if UIP_ACTIVE_OPEN\r
+\r
+ case UIP_SYN_SENT:\r
+ /* In SYN_SENT, we wait for a SYNACK that is sent in response to\r
+ our SYN. The rcv_nxt is set to sequence number in the SYNACK\r
+ plus one, and we send an ACK. We move into the ESTABLISHED\r
+ state. */\r
+ if( (uip_flags & UIP_ACKDATA) && (BUF->flags & TCP_CTL) == (TCP_SYN | TCP_ACK) )\r
+ {\r
+ /* Parse the TCP MSS option, if present. */\r
+ if( (BUF->tcpoffset & 0xf0) > 0x50 )\r
+ {\r
+ for( c = 0; c < ((BUF->tcpoffset >> 4) - 5) << 2; )\r
+ {\r
+ opt = uip_buf[UIP_IPTCPH_LEN + UIP_LLH_LEN + c];\r
+ if( opt == TCP_OPT_END )\r
+ {\r
+ /* End of options. */\r
+ break;\r
+ }\r
+ else if( opt == TCP_OPT_NOOP )\r
+ {\r
+ ++c;\r
+\r
+ /* NOP option. */\r
+ }\r
+ else if( opt == TCP_OPT_MSS && uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN + 1 + c] == TCP_OPT_MSS_LEN )\r
+ {\r
+ /* An MSS option with the right option length. */\r
+ tmp16 = ( uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN + 2 + c] << 8 ) | uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN + 3 + c];\r
+ uip_connr->initialmss = uip_connr->mss = tmp16 > UIP_TCP_MSS ? UIP_TCP_MSS : tmp16;\r
+\r
+ /* And we are done processing options. */\r
+ break;\r
+ }\r
+ else\r
+ {\r
+ /* All other options have a length field, so that we easily\r
+ can skip past them. */\r
+ if( uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN + 1 + c] == 0 )\r
+ {\r
+ /* If the length field is zero, the options are malformed\r
+ and we don't process them further. */\r
+ break;\r
+ }\r
+\r
+ c += uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN + 1 + c];\r
+ }\r
+ }\r
+ }\r
+\r
+ uip_connr->tcpstateflags = UIP_ESTABLISHED;\r
+ uip_connr->rcv_nxt[0] = BUF->seqno[0];\r
+ uip_connr->rcv_nxt[1] = BUF->seqno[1];\r
+ uip_connr->rcv_nxt[2] = BUF->seqno[2];\r
+ uip_connr->rcv_nxt[3] = BUF->seqno[3];\r
+ uip_add_rcv_nxt( 1 );\r
+ uip_flags = UIP_CONNECTED | UIP_NEWDATA;\r
+ uip_connr->len = 0;\r
+ uip_len = 0;\r
+ uip_slen = 0;\r
+ UIP_APPCALL();\r
+ goto appsend;\r
+ }\r
+\r
+ /* Inform the application that the connection failed */\r
+ uip_flags = UIP_ABORT;\r
+ UIP_APPCALL();\r
+\r
+ /* The connection is closed after we send the RST */\r
+ uip_conn->tcpstateflags = UIP_CLOSED;\r
+ goto reset;\r
+ #endif /* UIP_ACTIVE_OPEN */\r
+\r
+ case UIP_ESTABLISHED:\r
+ /* In the ESTABLISHED state, we call upon the application to feed\r
+ data into the uip_buf. If the UIP_ACKDATA flag is set, the\r
+ application should put new data into the buffer, otherwise we are\r
+ retransmitting an old segment, and the application should put that\r
+ data into the buffer.\r
+\r
+ If the incoming packet is a FIN, we should close the connection on\r
+ this side as well, and we send out a FIN and enter the LAST_ACK\r
+ state. We require that there is no outstanding data; otherwise the\r
+ sequence numbers will be screwed up. */\r
+ if( BUF->flags & TCP_FIN && !(uip_connr->tcpstateflags & UIP_STOPPED) )\r
+ {\r
+ if( uip_outstanding(uip_connr) )\r
+ {\r
+ goto drop;\r
+ }\r
+\r
+ uip_add_rcv_nxt( 1 + uip_len );\r
+ uip_flags |= UIP_CLOSE;\r
+ if( uip_len > 0 )\r
+ {\r
+ uip_flags |= UIP_NEWDATA;\r
+ }\r
+\r
+ UIP_APPCALL();\r
+ uip_connr->len = 1;\r
+ uip_connr->tcpstateflags = UIP_LAST_ACK;\r
+ uip_connr->nrtx = 0;\r
+ tcp_send_finack:\r
+ BUF->flags = TCP_FIN | TCP_ACK;\r
+ goto tcp_send_nodata;\r
+ }\r
+\r
+ /* Check the URG flag. If this is set, the segment carries urgent\r
+ data that we must pass to the application. */\r
+ if( (BUF->flags & TCP_URG) != 0 )\r
+ {\r
+ #if UIP_URGDATA > 0\r
+ uip_urglen = ( BUF->urgp[0] << 8 ) | BUF->urgp[1];\r
+ if( uip_urglen > uip_len )\r
+ {\r
+ /* There is more urgent data in the next segment to come. */\r
+ uip_urglen = uip_len;\r
+ }\r
+\r
+ uip_add_rcv_nxt( uip_urglen );\r
+ uip_len -= uip_urglen;\r
+ uip_urgdata = uip_appdata;\r
+ uip_appdata += uip_urglen;\r
+ }\r
+ else\r
+ {\r
+ uip_urglen = 0;\r
+ #else /* UIP_URGDATA > 0 */\r
+ uip_appdata = ( ( char * ) uip_appdata ) + ( (BUF->urgp[0] << 8) | BUF->urgp[1] );\r
+ uip_len -= ( BUF->urgp[0] << 8 ) | BUF->urgp[1];\r
+ #endif /* UIP_URGDATA > 0 */\r
+ }\r
+\r
+ /* If uip_len > 0 we have TCP data in the packet, and we flag this\r
+ by setting the UIP_NEWDATA flag and update the sequence number\r
+ we acknowledge. If the application has stopped the dataflow\r
+ using uip_stop(), we must not accept any data packets from the\r
+ remote host. */\r
+ if( uip_len > 0 && !(uip_connr->tcpstateflags & UIP_STOPPED) )\r
+ {\r
+ uip_flags |= UIP_NEWDATA;\r
+ uip_add_rcv_nxt( uip_len );\r
+ }\r
+\r
+ /* Check if the available buffer space advertised by the other end\r
+ is smaller than the initial MSS for this connection. If so, we\r
+ set the current MSS to the window size to ensure that the\r
+ application does not send more data than the other end can\r
+ handle.\r
+\r
+ If the remote host advertises a zero window, we set the MSS to\r
+ the initial MSS so that the application will send an entire MSS\r
+ of data. This data will not be acknowledged by the receiver,\r
+ and the application will retransmit it. This is called the\r
+ "persistent timer" and uses the retransmission mechanim.\r
+ */\r
+ tmp16 = ( (u16_t) BUF->wnd[0] << 8 ) + ( u16_t ) BUF->wnd[1];\r
+ if( tmp16 > uip_connr->initialmss || tmp16 == 0 )\r
+ {\r
+ tmp16 = uip_connr->initialmss;\r
+ }\r
+\r
+ uip_connr->mss = tmp16;\r
+\r
+ /* If this packet constitutes an ACK for outstanding data (flagged\r
+ by the UIP_ACKDATA flag, we should call the application since it\r
+ might want to send more data. If the incoming packet had data\r
+ from the peer (as flagged by the UIP_NEWDATA flag), the\r
+ application must also be notified.\r
+\r
+ When the application is called, the global variable uip_len\r
+ contains the length of the incoming data. The application can\r
+ access the incoming data through the global pointer\r
+ uip_appdata, which usually points UIP_IPTCPH_LEN + UIP_LLH_LEN\r
+ bytes into the uip_buf array.\r
+\r
+ If the application wishes to send any data, this data should be\r
+ put into the uip_appdata and the length of the data should be\r
+ put into uip_len. If the application don't have any data to\r
+ send, uip_len must be set to 0. */\r
+ if( uip_flags & (UIP_NEWDATA | UIP_ACKDATA) )\r
+ {\r
+ uip_slen = 0;\r
+ UIP_APPCALL();\r
+\r
+ appsend:\r
+ if( uip_flags & UIP_ABORT )\r
+ {\r
+ uip_slen = 0;\r
+ uip_connr->tcpstateflags = UIP_CLOSED;\r
+ BUF->flags = TCP_RST | TCP_ACK;\r
+ goto tcp_send_nodata;\r
+ }\r
+\r
+ if( uip_flags & UIP_CLOSE )\r
+ {\r
+ uip_slen = 0;\r
+ uip_connr->len = 1;\r
+ uip_connr->tcpstateflags = UIP_FIN_WAIT_1;\r
+ uip_connr->nrtx = 0;\r
+ BUF->flags = TCP_FIN | TCP_ACK;\r
+ goto tcp_send_nodata;\r
+ }\r
+\r
+ /* If uip_slen > 0, the application has data to be sent. */\r
+ if( uip_slen > 0 )\r
+ {\r
+ /* If the connection has acknowledged data, the contents of\r
+ the ->len variable should be discarded. */\r
+ if( (uip_flags & UIP_ACKDATA) != 0 )\r
+ {\r
+ uip_connr->len = 0;\r
+ }\r
+\r
+ /* If the ->len variable is non-zero the connection has\r
+ already data in transit and cannot send anymore right\r
+ now. */\r
+ if( uip_connr->len == 0 )\r
+ {\r
+ /* The application cannot send more than what is allowed by\r
+ the mss (the minumum of the MSS and the available\r
+ window). */\r
+ if( uip_slen > uip_connr->mss )\r
+ {\r
+ uip_slen = uip_connr->mss;\r
+ }\r
+\r
+ /* Remember how much data we send out now so that we know\r
+ when everything has been acknowledged. */\r
+ uip_connr->len = uip_slen;\r
+ }\r
+ else\r
+ {\r
+ /* If the application already had unacknowledged data, we\r
+ make sure that the application does not send (i.e.,\r
+ retransmit) out more than it previously sent out. */\r
+ uip_slen = uip_connr->len;\r
+ }\r
+ }\r
+\r
+ uip_connr->nrtx = 0;\r
+ apprexmit:\r
+ uip_appdata = uip_sappdata;\r
+\r
+ /* If the application has data to be sent, or if the incoming\r
+ packet had new data in it, we must send out a packet. */\r
+ if( uip_slen > 0 && uip_connr->len > 0 )\r
+ {\r
+ /* Add the length of the IP and TCP headers. */\r
+ uip_len = uip_connr->len + UIP_TCPIP_HLEN;\r
+\r
+ /* We always set the ACK flag in response packets. */\r
+ BUF->flags = TCP_ACK | TCP_PSH;\r
+\r
+ /* Send the packet. */\r
+ goto tcp_send_noopts;\r
+ }\r
+\r
+ /* If there is no data to send, just send out a pure ACK if\r
+ there is newdata. */\r
+ if( uip_flags & UIP_NEWDATA )\r
+ {\r
+ uip_len = UIP_TCPIP_HLEN;\r
+ BUF->flags = TCP_ACK;\r
+ goto tcp_send_noopts;\r
+ }\r
+ }\r
+\r
+ goto drop;\r
+\r
+ case UIP_LAST_ACK:\r
+ /* We can close this connection if the peer has acknowledged our\r
+ FIN. This is indicated by the UIP_ACKDATA flag. */\r
+ if( uip_flags & UIP_ACKDATA )\r
+ {\r
+ uip_connr->tcpstateflags = UIP_CLOSED;\r
+ uip_flags = UIP_CLOSE;\r
+ UIP_APPCALL();\r
+ }\r
+\r
+ break;\r
+\r
+ case UIP_FIN_WAIT_1:\r
+ /* The application has closed the connection, but the remote host\r
+ hasn't closed its end yet. Thus we do nothing but wait for a\r
+ FIN from the other side. */\r
+ if( uip_len > 0 )\r
+ {\r
+ uip_add_rcv_nxt( uip_len );\r
+ }\r
+\r
+ if( BUF->flags & TCP_FIN )\r
+ {\r
+ if( uip_flags & UIP_ACKDATA )\r
+ {\r
+ uip_connr->tcpstateflags = UIP_TIME_WAIT;\r
+ uip_connr->timer = 0;\r
+ uip_connr->len = 0;\r
+ }\r
+ else\r
+ {\r
+ uip_connr->tcpstateflags = UIP_CLOSING;\r
+ }\r
+\r
+ uip_add_rcv_nxt( 1 );\r
+ uip_flags = UIP_CLOSE;\r
+ UIP_APPCALL();\r
+ goto tcp_send_ack;\r
+ }\r
+ else if( uip_flags & UIP_ACKDATA )\r
+ {\r
+ uip_connr->tcpstateflags = UIP_FIN_WAIT_2;\r
+ uip_connr->len = 0;\r
+ goto drop;\r
+ }\r
+\r
+ if( uip_len > 0 )\r
+ {\r
+ goto tcp_send_ack;\r
+ }\r
+\r
+ goto drop;\r
+\r
+ case UIP_FIN_WAIT_2:\r
+ if( uip_len > 0 )\r
+ {\r
+ uip_add_rcv_nxt( uip_len );\r
+ }\r
+\r
+ if( BUF->flags & TCP_FIN )\r
+ {\r
+ uip_connr->tcpstateflags = UIP_TIME_WAIT;\r
+ uip_connr->timer = 0;\r
+ uip_add_rcv_nxt( 1 );\r
+ uip_flags = UIP_CLOSE;\r
+ UIP_APPCALL();\r
+ goto tcp_send_ack;\r
+ }\r
+\r
+ if( uip_len > 0 )\r
+ {\r
+ goto tcp_send_ack;\r
+ }\r
+\r
+ goto drop;\r
+\r
+ case UIP_TIME_WAIT:\r
+ goto tcp_send_ack;\r
+\r
+ case UIP_CLOSING:\r
+ if( uip_flags & UIP_ACKDATA )\r
+ {\r
+ uip_connr->tcpstateflags = UIP_TIME_WAIT;\r
+ uip_connr->timer = 0;\r
+ }\r
+ }\r
+\r
+ goto drop;\r
+\r
+ /* We jump here when we are ready to send the packet, and just want\r
+ to set the appropriate TCP sequence numbers in the TCP header. */\r
+tcp_send_ack:\r
+ BUF->flags = TCP_ACK;\r
+\r
+tcp_send_nodata:\r
+ uip_len = UIP_IPTCPH_LEN;\r
+\r
+tcp_send_noopts:\r
+ BUF->tcpoffset = ( UIP_TCPH_LEN / 4 ) << 4;\r
+\r
+ /* We're done with the input processing. We are now ready to send a\r
+ reply. Our job is to fill in all the fields of the TCP and IP\r
+ headers before calculating the checksum and finally send the\r
+ packet. */\r
+tcp_send:\r
+ BUF->ackno[0] = uip_connr->rcv_nxt[0];\r
+ BUF->ackno[1] = uip_connr->rcv_nxt[1];\r
+ BUF->ackno[2] = uip_connr->rcv_nxt[2];\r
+ BUF->ackno[3] = uip_connr->rcv_nxt[3];\r
+\r
+ BUF->seqno[0] = uip_connr->snd_nxt[0];\r
+ BUF->seqno[1] = uip_connr->snd_nxt[1];\r
+ BUF->seqno[2] = uip_connr->snd_nxt[2];\r
+ BUF->seqno[3] = uip_connr->snd_nxt[3];\r
+\r
+ BUF->proto = UIP_PROTO_TCP;\r
+\r
+ BUF->srcport = uip_connr->lport;\r
+ BUF->destport = uip_connr->rport;\r
+\r
+ uip_ipaddr_copy( &BUF->srcipaddr, &uip_hostaddr );\r
+ uip_ipaddr_copy( &BUF->destipaddr, &uip_connr->ripaddr );\r
+\r
+ if( uip_connr->tcpstateflags & UIP_STOPPED )\r
+ {\r
+ /* If the connection has issued uip_stop(), we advertise a zero\r
+ window so that the remote host will stop sending data. */\r
+ BUF->wnd[0] = BUF->wnd[1] = 0;\r
+ }\r
+ else\r
+ {\r
+ BUF->wnd[0] = ( (UIP_RECEIVE_WINDOW) >> 8 );\r
+ BUF->wnd[1] = ( (UIP_RECEIVE_WINDOW) & 0xff );\r
+ }\r
+\r
+tcp_send_noconn:\r
+ BUF->ttl = UIP_TTL;\r
+#if UIP_CONF_IPV6\r
+ /* For IPv6, the IP length field does not include the IPv6 IP header\r
+ length. */\r
+ BUF->len[0] = ( (uip_len - UIP_IPH_LEN) >> 8 );\r
+ BUF->len[1] = ( (uip_len - UIP_IPH_LEN) & 0xff );\r
+#else /* UIP_CONF_IPV6 */\r
+ BUF->len[0] = ( uip_len >> 8 );\r
+ BUF->len[1] = ( uip_len & 0xff );\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+ BUF->urgp[0] = BUF->urgp[1] = 0;\r
+\r
+ /* Calculate TCP checksum. */\r
+ BUF->tcpchksum = 0;\r
+ BUF->tcpchksum = ~( uip_tcpchksum() );\r
+\r
+ip_send_nolen:\r
+#if UIP_CONF_IPV6\r
+ BUF->vtc = 0x60;\r
+ BUF->tcflow = 0x00;\r
+ BUF->flow = 0x00;\r
+#else /* UIP_CONF_IPV6 */\r
+ BUF->vhl = 0x45;\r
+ BUF->tos = 0;\r
+ BUF->ipoffset[0] = BUF->ipoffset[1] = 0;\r
+ ++ipid;\r
+ BUF->ipid[0] = ipid >> 8;\r
+ BUF->ipid[1] = ipid & 0xff;\r
+\r
+ /* Calculate IP checksum. */\r
+ BUF->ipchksum = 0;\r
+ BUF->ipchksum = ~( uip_ipchksum() );\r
+\r
+ //DEBUG_PRINTF( "uip ip_send_nolen: chkecum 0x%04x\n", uip_ipchksum() );\r
+#endif /* UIP_CONF_IPV6 */\r
+ UIP_STAT( ++uip_stat.tcp.sent );\r
+#if UIP_CONF_IPV6\r
+ send :\r
+#endif /* UIP_CONF_IPV6 */\r
+\r
+ //DEBUG_PRINTF( "Sending packet with length %d (%d)\n", uip_len, (BUF->len[0] << 8) | BUF->len[1] );\r
+ UIP_STAT( ++uip_stat.ip.sent );\r
+\r
+ /* Return and let the caller do the actual transmission. */\r
+ uip_flags = 0;\r
+ return;\r
+\r
+drop:\r
+ uip_len = 0;\r
+ uip_flags = 0;\r
+ return;\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+u16_t htons( u16_t val )\r
+{\r
+ return HTONS( val );\r
+}\r
+\r
+u32_t htonl( u32_t val )\r
+{\r
+ return HTONL( val );\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+void uip_send( const void *data, int len )\r
+{\r
+ int copylen;\r
+#define MIN( a, b ) ( (a) < (b) ? (a) : (b) )\r
+ copylen = MIN( len, UIP_BUFSIZE - UIP_LLH_LEN - UIP_TCPIP_HLEN - ( int )\r
+ (( char * ) uip_sappdata - ( char * ) &uip_buf[UIP_LLH_LEN + UIP_TCPIP_HLEN]) );\r
+ if( copylen > 0 )\r
+ {\r
+ uip_slen = copylen;\r
+ if( data != uip_sappdata )\r
+ {\r
+ memcpy( uip_sappdata, (data), uip_slen );\r
+ }\r
+ }\r
+}\r
+\r
+/*---------------------------------------------------------------------------*/\r
+\r
+/** @} */\r
+#endif /* UIP_CONF_IPV6 */\r
--- /dev/null
+/**\r
+ * \addtogroup uip\r
+ * @{\r
+ */\r
+\r
+/**\r
+ * \defgroup uiparp uIP Address Resolution Protocol\r
+ * @{\r
+ *\r
+ * The Address Resolution Protocol ARP is used for mapping between IP\r
+ * addresses and link level addresses such as the Ethernet MAC\r
+ * addresses. ARP uses broadcast queries to ask for the link level\r
+ * address of a known IP address and the host which is configured with\r
+ * the IP address for which the query was meant, will respond with its\r
+ * link level address.\r
+ *\r
+ * \note This ARP implementation only supports Ethernet.\r
+ */\r
+\r
+/**\r
+ * \file\r
+ * Implementation of the ARP Address Resolution Protocol.\r
+ * \author Adam Dunkels <adam@dunkels.com>\r
+ *\r
+ */\r
+\r
+/*\r
+ * Copyright (c) 2001-2003, Adam Dunkels.\r
+ * All rights reserved.\r
+ *\r
+ * Redistribution and use in source and binary forms, with or without\r
+ * modification, are permitted provided that the following conditions\r
+ * are met:\r
+ * 1. Redistributions of source code must retain the above copyright\r
+ * notice, this list of conditions and the following disclaimer.\r
+ * 2. Redistributions in binary form must reproduce the above copyright\r
+ * notice, this list of conditions and the following disclaimer in the\r
+ * documentation and/or other materials provided with the distribution.\r
+ * 3. The name of the author may not be used to endorse or promote\r
+ * products derived from this software without specific prior\r
+ * written permission.\r
+ *\r
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS\r
+ * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\r
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\r
+ * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\r
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\r
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\r
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r
+ *\r
+ * This file is part of the uIP TCP/IP stack.\r
+ *\r
+ * $Id: uip_arp.c,v 1.5 2008/02/07 01:35:00 adamdunkels Exp $\r
+ *\r
+ */\r
+#include "net/uip_arp.h"\r
+\r
+#include <string.h>\r
+\r
+#include "net/pack_struct_start.h"\r
+struct arp_hdr\r
+{\r
+ struct uip_eth_hdr ethhdr;\r
+ u16_t hwtype;\r
+ u16_t protocol;\r
+ u8_t hwlen;\r
+ u8_t protolen;\r
+ u16_t opcode;\r
+ struct uip_eth_addr shwaddr;\r
+ uip_ipaddr_t sipaddr;\r
+ struct uip_eth_addr dhwaddr;\r
+ uip_ipaddr_t dipaddr;\r
+}\r
+\r
+#include "net/pack_struct_end.h"\r
+\r
+#include "net/pack_struct_start.h"\r
+\r
+struct ethip_hdr\r
+{\r
+ struct uip_eth_hdr ethhdr;\r
+\r
+ /* IP header. */\r
+ u8_t vhl, tos, len[2], ipid[2], ipoffset[2], ttl, proto;\r
+ u16_t ipchksum;\r
+ uip_ipaddr_t srcipaddr, destipaddr;\r
+}\r
+\r
+#include "net/pack_struct_end.h"\r
+\r
+#define ARP_REQUEST 1\r
+#define ARP_REPLY 2\r
+\r
+#define ARP_HWTYPE_ETH 1\r
+\r
+struct arp_entry\r
+{\r
+ uip_ipaddr_t ipaddr;\r
+ struct uip_eth_addr ethaddr;\r
+ u8_t time;\r
+};\r
+\r
+static const struct uip_eth_addr broadcast_ethaddr = { { 0xff, 0xff, 0xff, 0xff, 0xff, 0xff } };\r
+static const u16_t broadcast_ipaddr[2] = { 0xffff, 0xffff };\r
+\r
+static struct arp_entry arp_table[UIP_ARPTAB_SIZE];\r
+static uip_ipaddr_t ipaddr;\r
+static u8_t i, c;\r
+\r
+static u8_t arptime;\r
+static u8_t tmpage;\r
+\r
+#define BUF ( ( struct arp_hdr * ) &uip_buf[0] )\r
+#define IPBUF ( ( struct ethip_hdr * ) &uip_buf[0] )\r
+#define DEBUG 0\r
+#if DEBUG\r
+#include <stdio.h>\r
+#define PRINTF( ... ) printf( __VA_ARGS__ )\r
+#else\r
+\r
+//#define PRINTF( ... )\r
+#endif\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * Initialize the ARP module.\r
+ *\r
+ */\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+void uip_arp_init( void )\r
+{\r
+ for( i = 0; i < UIP_ARPTAB_SIZE; ++i )\r
+ {\r
+ memset( &arp_table[i].ipaddr, 0, 4 );\r
+ }\r
+}\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * Periodic ARP processing function.\r
+ *\r
+ * This function performs periodic timer processing in the ARP module\r
+ * and should be called at regular intervals. The recommended interval\r
+ * is 10 seconds between the calls.\r
+ *\r
+ */\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+void uip_arp_timer( void )\r
+{\r
+ struct arp_entry *tabptr;\r
+\r
+ ++arptime;\r
+ for( i = 0; i < UIP_ARPTAB_SIZE; ++i )\r
+ {\r
+ tabptr = &arp_table[i];\r
+ if( uip_ipaddr_cmp(&tabptr->ipaddr, &uip_all_zeroes_addr) && arptime - tabptr->time >= UIP_ARP_MAXAGE )\r
+ {\r
+ memset( &tabptr->ipaddr, 0, 4 );\r
+ }\r
+ }\r
+}\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+static void uip_arp_update( uip_ipaddr_t *ipaddr, struct uip_eth_addr *ethaddr )\r
+{\r
+ register struct arp_entry *tabptr;\r
+\r
+ /* Walk through the ARP mapping table and try to find an entry to\r
+ update. If none is found, the IP -> MAC address mapping is\r
+ inserted in the ARP table. */\r
+ for( i = 0; i < UIP_ARPTAB_SIZE; ++i )\r
+ {\r
+ tabptr = &arp_table[i];\r
+\r
+ /* Only check those entries that are actually in use. */\r
+ if( !uip_ipaddr_cmp(&tabptr->ipaddr, &uip_all_zeroes_addr) )\r
+ {\r
+ /* Check if the source IP address of the incoming packet matches\r
+ the IP address in this ARP table entry. */\r
+ if( uip_ipaddr_cmp(ipaddr, &tabptr->ipaddr) )\r
+ {\r
+ /* An old entry found, update this and return. */\r
+ memcpy( tabptr->ethaddr.addr, ethaddr->addr, 6 );\r
+ tabptr->time = arptime;\r
+\r
+ return;\r
+ }\r
+ }\r
+ }\r
+\r
+ /* If we get here, no existing ARP table entry was found, so we\r
+ create one. */\r
+\r
+ /* First, we try to find an unused entry in the ARP table. */\r
+ for( i = 0; i < UIP_ARPTAB_SIZE; ++i )\r
+ {\r
+ tabptr = &arp_table[i];\r
+ if( uip_ipaddr_cmp(&tabptr->ipaddr, &uip_all_zeroes_addr) )\r
+ {\r
+ break;\r
+ }\r
+ }\r
+\r
+ /* If no unused entry is found, we try to find the oldest entry and\r
+ throw it away. */\r
+ if( i == UIP_ARPTAB_SIZE )\r
+ {\r
+ tmpage = 0;\r
+ c = 0;\r
+ for( i = 0; i < UIP_ARPTAB_SIZE; ++i )\r
+ {\r
+ tabptr = &arp_table[i];\r
+ if( arptime - tabptr->time > tmpage )\r
+ {\r
+ tmpage = arptime - tabptr->time;\r
+ c = i;\r
+ }\r
+ }\r
+\r
+ i = c;\r
+ tabptr = &arp_table[i];\r
+ }\r
+\r
+ /* Now, i is the ARP table entry which we will fill with the new\r
+ information. */\r
+ uip_ipaddr_copy( &tabptr->ipaddr, ipaddr );\r
+ memcpy( tabptr->ethaddr.addr, ethaddr->addr, 6 );\r
+ tabptr->time = arptime;\r
+}\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * ARP processing for incoming IP packets\r
+ *\r
+ * This function should be called by the device driver when an IP\r
+ * packet has been received. The function will check if the address is\r
+ * in the ARP cache, and if so the ARP cache entry will be\r
+ * refreshed. If no ARP cache entry was found, a new one is created.\r
+ *\r
+ * This function expects an IP packet with a prepended Ethernet header\r
+ * in the uip_buf[] buffer, and the length of the packet in the global\r
+ * variable uip_len.\r
+ */\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+#if 0\r
+void uip_arp_ipin( void )\r
+{\r
+ uip_len -= sizeof( struct uip_eth_hdr );\r
+\r
+ /* Only insert/update an entry if the source IP address of the\r
+ incoming IP packet comes from a host on the local network. */\r
+ if( (IPBUF->srcipaddr[0] & uip_netmask[0]) != (uip_hostaddr[0] & uip_netmask[0]) )\r
+ {\r
+ return;\r
+ }\r
+\r
+ if( (IPBUF->srcipaddr[1] & uip_netmask[1]) != (uip_hostaddr[1] & uip_netmask[1]) )\r
+ {\r
+ return;\r
+ }\r
+\r
+ uip_arp_update( IPBUF->srcipaddr, &(IPBUF->ethhdr.src) );\r
+\r
+ return;\r
+}\r
+\r
+#endif /* 0 */\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * ARP processing for incoming ARP packets.\r
+ *\r
+ * This function should be called by the device driver when an ARP\r
+ * packet has been received. The function will act differently\r
+ * depending on the ARP packet type: if it is a reply for a request\r
+ * that we previously sent out, the ARP cache will be filled in with\r
+ * the values from the ARP reply. If the incoming ARP packet is an ARP\r
+ * request for our IP address, an ARP reply packet is created and put\r
+ * into the uip_buf[] buffer.\r
+ *\r
+ * When the function returns, the value of the global variable uip_len\r
+ * indicates whether the device driver should send out a packet or\r
+ * not. If uip_len is zero, no packet should be sent. If uip_len is\r
+ * non-zero, it contains the length of the outbound packet that is\r
+ * present in the uip_buf[] buffer.\r
+ *\r
+ * This function expects an ARP packet with a prepended Ethernet\r
+ * header in the uip_buf[] buffer, and the length of the packet in the\r
+ * global variable uip_len.\r
+ */\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+void uip_arp_arpin( void )\r
+{\r
+ if( uip_len < sizeof(struct arp_hdr) )\r
+ {\r
+ uip_len = 0;\r
+ return;\r
+ }\r
+\r
+ uip_len = 0;\r
+\r
+ switch( BUF->opcode )\r
+ {\r
+ case HTONS( ARP_REQUEST ):\r
+ /* ARP request. If it asked for our address, we send out a\r
+ reply. */\r
+\r
+ /* if(BUF->dipaddr[0] == uip_hostaddr[0] &&\r
+ BUF->dipaddr[1] == uip_hostaddr[1]) {*/\r
+\r
+ //PRINTF( "uip_arp_arpin: request for %d.%d.%d.%d (we are %d.%d.%d.%d)\n", BUF->dipaddr.u8[0], BUF->dipaddr.u8[1], BUF->dipaddr.u8[2], \r
+ //BUF->dipaddr.u8[3], uip_hostaddr.u8[0], uip_hostaddr.u8[1], uip_hostaddr.u8[2], uip_hostaddr.u8[3] );\r
+ if( uip_ipaddr_cmp(&BUF->dipaddr, &uip_hostaddr) )\r
+ {\r
+ /* First, we register the one who made the request in our ARP\r
+ table, since it is likely that we will do more communication\r
+ with this host in the future. */\r
+ uip_arp_update( &BUF->sipaddr, &BUF->shwaddr );\r
+\r
+ BUF->opcode = HTONS( ARP_REPLY );\r
+\r
+ memcpy( BUF->dhwaddr.addr, BUF->shwaddr.addr, 6 );\r
+ memcpy( BUF->shwaddr.addr, uip_ethaddr.addr, 6 );\r
+ memcpy( BUF->ethhdr.src.addr, uip_ethaddr.addr, 6 );\r
+ memcpy( BUF->ethhdr.dest.addr, BUF->dhwaddr.addr, 6 );\r
+\r
+ uip_ipaddr_copy( &BUF->dipaddr, &BUF->sipaddr );\r
+ uip_ipaddr_copy( &BUF->sipaddr, &uip_hostaddr );\r
+\r
+ BUF->ethhdr.type = HTONS( UIP_ETHTYPE_ARP );\r
+ uip_len = sizeof( struct arp_hdr );\r
+ }\r
+\r
+ break;\r
+\r
+ case HTONS( ARP_REPLY ):\r
+ /* ARP reply. We insert or update the ARP table if it was meant\r
+ for us. */\r
+ if( uip_ipaddr_cmp(&BUF->dipaddr, &uip_hostaddr) )\r
+ {\r
+ uip_arp_update( &BUF->sipaddr, &BUF->shwaddr );\r
+ }\r
+\r
+ break;\r
+ }\r
+\r
+ return;\r
+}\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+\r
+/**\r
+ * Prepend Ethernet header to an outbound IP packet and see if we need\r
+ * to send out an ARP request.\r
+ *\r
+ * This function should be called before sending out an IP packet. The\r
+ * function checks the destination IP address of the IP packet to see\r
+ * what Ethernet MAC address that should be used as a destination MAC\r
+ * address on the Ethernet.\r
+ *\r
+ * If the destination IP address is in the local network (determined\r
+ * by logical ANDing of netmask and our IP address), the function\r
+ * checks the ARP cache to see if an entry for the destination IP\r
+ * address is found. If so, an Ethernet header is prepended and the\r
+ * function returns. If no ARP cache entry is found for the\r
+ * destination IP address, the packet in the uip_buf[] is replaced by\r
+ * an ARP request packet for the IP address. The IP packet is dropped\r
+ * and it is assumed that they higher level protocols (e.g., TCP)\r
+ * eventually will retransmit the dropped packet.\r
+ *\r
+ * If the destination IP address is not on the local network, the IP\r
+ * address of the default router is used instead.\r
+ *\r
+ * When the function returns, a packet is present in the uip_buf[]\r
+ * buffer, and the length of the packet is in the global variable\r
+ * uip_len.\r
+ */\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+void uip_arp_out( void )\r
+{\r
+ struct arp_entry *tabptr;\r
+\r
+ /* Find the destination IP address in the ARP table and construct\r
+ the Ethernet header. If the destination IP addres isn't on the\r
+ local network, we use the default router's IP address instead.\r
+\r
+ If not ARP table entry is found, we overwrite the original IP\r
+ packet with an ARP request for the IP address. */\r
+\r
+ /* First check if destination is a local broadcast. */\r
+ if( uip_ipaddr_cmp(&IPBUF->destipaddr, &uip_broadcast_addr) )\r
+ {\r
+ memcpy( IPBUF->ethhdr.dest.addr, broadcast_ethaddr.addr, 6 );\r
+ }\r
+ else\r
+ {\r
+ /* Check if the destination address is on the local network. */\r
+ if( !uip_ipaddr_maskcmp(&IPBUF->destipaddr, &uip_hostaddr, &uip_netmask) )\r
+ {\r
+ /* Destination address was not on the local network, so we need to\r
+ use the default router's IP address instead of the destination\r
+ address when determining the MAC address. */\r
+ uip_ipaddr_copy( &ipaddr, &uip_draddr );\r
+ }\r
+ else\r
+ {\r
+ /* Else, we use the destination IP address. */\r
+ uip_ipaddr_copy( &ipaddr, &IPBUF->destipaddr );\r
+ }\r
+\r
+ for( i = 0; i < UIP_ARPTAB_SIZE; ++i )\r
+ {\r
+ tabptr = &arp_table[i];\r
+ if( uip_ipaddr_cmp(&ipaddr, &tabptr->ipaddr) )\r
+ {\r
+ break;\r
+ }\r
+ }\r
+\r
+ if( i == UIP_ARPTAB_SIZE )\r
+ {\r
+ /* The destination address was not in our ARP table, so we\r
+ overwrite the IP packet with an ARP request. */\r
+ memset( BUF->ethhdr.dest.addr, 0xff, 6 );\r
+ memset( BUF->dhwaddr.addr, 0x00, 6 );\r
+ memcpy( BUF->ethhdr.src.addr, uip_ethaddr.addr, 6 );\r
+ memcpy( BUF->shwaddr.addr, uip_ethaddr.addr, 6 );\r
+\r
+ uip_ipaddr_copy( &BUF->dipaddr, &ipaddr );\r
+ uip_ipaddr_copy( &BUF->sipaddr, &uip_hostaddr );\r
+ BUF->opcode = HTONS( ARP_REQUEST ); /* ARP request. */\r
+ BUF->hwtype = HTONS( ARP_HWTYPE_ETH );\r
+ BUF->protocol = HTONS( UIP_ETHTYPE_IP );\r
+ BUF->hwlen = 6;\r
+ BUF->protolen = 4;\r
+ BUF->ethhdr.type = HTONS( UIP_ETHTYPE_ARP );\r
+\r
+ uip_appdata = &uip_buf[UIP_TCPIP_HLEN + UIP_LLH_LEN];\r
+\r
+ uip_len = sizeof( struct arp_hdr );\r
+ return;\r
+ }\r
+\r
+ /* Build an ethernet header. */\r
+ memcpy( IPBUF->ethhdr.dest.addr, tabptr->ethaddr.addr, 6 );\r
+ }\r
+\r
+ memcpy( IPBUF->ethhdr.src.addr, uip_ethaddr.addr, 6 );\r
+\r
+ IPBUF->ethhdr.type = HTONS( UIP_ETHTYPE_IP );\r
+\r
+ uip_len += sizeof( struct uip_eth_hdr );\r
+}\r
+\r
+/*-----------------------------------------------------------------------------------*/\r
+\r
+/** @} */\r
+\r
+/** @} */\r
projects / freertos / commitdiff