📄 a00199.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>uIP 1.0: uip/uip-split.c Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.6 --><div class="tabs"> <ul> <li><a href="main.html"><span>Main Page</span></a></li> <li><a href="modules.html"><span>Modules</span></a></li> <li><a href="classes.html"><span>Data Structures</span></a></li> <li id="current"><a href="files.html"><span>Files</span></a></li> <li><a href="examples.html"><span>Examples</span></a></li> </ul></div><div class="tabs"> <ul> <li><a href="files.html"><span>File List</span></a></li> <li><a href="globals.html"><span>Globals</span></a></li> </ul></div><h1>uip/uip-split.c</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span><a name="l00002"></a>00002 <span class="comment"> * Copyright (c) 2004, Swedish Institute of Computer Science.</span><a name="l00003"></a>00003 <span class="comment"> * All rights reserved.</span><a name="l00004"></a>00004 <span class="comment"> *</span><a name="l00005"></a>00005 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span><a name="l00006"></a>00006 <span class="comment"> * modification, are permitted provided that the following conditions</span><a name="l00007"></a>00007 <span class="comment"> * are met:</span><a name="l00008"></a>00008 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span><a name="l00009"></a>00009 <span class="comment"> * notice, this list of conditions and the following disclaimer.</span><a name="l00010"></a>00010 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span><a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer in the</span><a name="l00012"></a>00012 <span class="comment"> * documentation and/or other materials provided with the distribution.</span><a name="l00013"></a>00013 <span class="comment"> * 3. Neither the name of the Institute nor the names of its contributors</span><a name="l00014"></a>00014 <span class="comment"> * may be used to endorse or promote products derived from this software</span><a name="l00015"></a>00015 <span class="comment"> * without specific prior written permission.</span><a name="l00016"></a>00016 <span class="comment"> *</span><a name="l00017"></a>00017 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND</span><a name="l00018"></a>00018 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE</span><a name="l00019"></a>00019 <span class="comment"> * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</span><a name="l00020"></a>00020 <span class="comment"> * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE</span><a name="l00021"></a>00021 <span class="comment"> * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL</span><a name="l00022"></a>00022 <span class="comment"> * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS</span><a name="l00023"></a>00023 <span class="comment"> * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)</span><a name="l00024"></a>00024 <span class="comment"> * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT</span><a name="l00025"></a>00025 <span class="comment"> * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY</span><a name="l00026"></a>00026 <span class="comment"> * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF</span><a name="l00027"></a>00027 <span class="comment"> * SUCH DAMAGE.</span><a name="l00028"></a>00028 <span class="comment"> *</span><a name="l00029"></a>00029 <span class="comment"> * This file is part of the uIP TCP/IP stack</span><a name="l00030"></a>00030 <span class="comment"> *</span><a name="l00031"></a>00031 <span class="comment"> * Author: Adam Dunkels <adam@sics.se></span><a name="l00032"></a>00032 <span class="comment"> *</span><a name="l00033"></a>00033 <span class="comment"> * $Id: uip-split.c,v 1.2 2006/06/12 08:00:30 adam Exp $</span><a name="l00034"></a>00034 <span class="comment"> */</span><a name="l00035"></a>00035 <a name="l00036"></a>00036 <span class="preprocessor">#include <string.h></span><a name="l00037"></a>00037 <a name="l00038"></a>00038 <span class="preprocessor">#include "<a class="code" href="a00134.html">uip-split.h</a>"</span><a name="l00039"></a>00039 <span class="preprocessor">#include "<a class="code" href="a00136.html">uip.h</a>"</span><a name="l00040"></a>00040 <span class="preprocessor">#include "uip-fw.h"</span><a name="l00041"></a>00041 <span class="preprocessor">#include "<a class="code" href="a00137.html">uip_arch.h</a>"</span><a name="l00042"></a>00042 <a name="l00043"></a>00043 <a name="l00044"></a>00044 <a name="l00045"></a>00045 <span class="preprocessor">#define BUF ((struct uip_tcpip_hdr *)&uip_buf[UIP_LLH_LEN])</span><a name="l00046"></a>00046 <span class="preprocessor"></span><a name="l00047"></a>00047 <span class="comment">/*-----------------------------------------------------------------------------*/</span><a name="l00048"></a>00048 <span class="keywordtype">void</span><a name="l00049"></a><a class="code" href="a00154.html#gb4b17aaf20d630f30919b19937b966a3">00049</a> <a class="code" href="a00154.html#gb4b17aaf20d630f30919b19937b966a3">uip_split_output</a>(<span class="keywordtype">void</span>)<a name="l00050"></a>00050 {<a name="l00051"></a>00051 <a class="code" href="a00153.html#g77570ac4fcab86864fa1916e55676da2">u16_t</a> tcplen, len1, len2;<a name="l00052"></a>00052 <a name="l00053"></a>00053 <span class="comment">/* We only try to split maximum sized TCP segments. */</span><a name="l00054"></a>00054 <span class="keywordflow">if</span>(<a class="code" href="a00150.html#g24f52ac52d6e714cb04a5aa01be3bdd0">BUF</a>->proto == <a class="code" href="a00150.html#g517c770991459cc62dc009c0d3875c6a">UIP_PROTO_TCP</a> &&<a name="l00055"></a>00055 <a class="code" href="a00149.html#g12a33f0c09711167bdf3dd7d7cf8c5a1">uip_len</a> == <a class="code" href="a00153.html#g3589822ecb9d9c4145209756396b8a6b">UIP_BUFSIZE</a> - <a class="code" href="a00153.html#ge6f4a2453dbd8bc60e6a82774552366a">UIP_LLH_LEN</a>) {<a name="l00056"></a>00056 <a name="l00057"></a>00057 tcplen = <a class="code" href="a00149.html#g12a33f0c09711167bdf3dd7d7cf8c5a1">uip_len</a> - <a class="code" href="a00150.html#gee37386b2ab828787c05227eb109def7">UIP_TCPIP_HLEN</a>;<a name="l00058"></a>00058 <span class="comment">/* Split the segment in two. If the original packet length was</span><a name="l00059"></a>00059 <span class="comment"> odd, we make the second packet one byte larger. */</span><a name="l00060"></a>00060 len1 = len2 = tcplen / 2;<a name="l00061"></a>00061 <span class="keywordflow">if</span>(len1 + len2 < tcplen) {⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -