1*10465441SEvalZero<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> 2*10465441SEvalZero<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"> 3*10465441SEvalZero<title>uIP 1.0: lib/memb.c Source File</title> 4*10465441SEvalZero<link href="doxygen.css" rel="stylesheet" type="text/css"> 5*10465441SEvalZero<link href="tabs.css" rel="stylesheet" type="text/css"> 6*10465441SEvalZero</head><body> 7*10465441SEvalZero<!-- Generated by Doxygen 1.4.6 --> 8*10465441SEvalZero<div class="tabs"> 9*10465441SEvalZero <ul> 10*10465441SEvalZero <li><a href="main.html"><span>Main Page</span></a></li> 11*10465441SEvalZero <li><a href="modules.html"><span>Modules</span></a></li> 12*10465441SEvalZero <li><a href="classes.html"><span>Data Structures</span></a></li> 13*10465441SEvalZero <li id="current"><a href="files.html"><span>Files</span></a></li> 14*10465441SEvalZero <li><a href="examples.html"><span>Examples</span></a></li> 15*10465441SEvalZero </ul></div> 16*10465441SEvalZero<div class="tabs"> 17*10465441SEvalZero <ul> 18*10465441SEvalZero <li><a href="files.html"><span>File List</span></a></li> 19*10465441SEvalZero <li><a href="globals.html"><span>Globals</span></a></li> 20*10465441SEvalZero </ul></div> 21*10465441SEvalZero<h1>lib/memb.c</h1><a href="a00120.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span> 22*10465441SEvalZero<a name="l00002"></a>00002 <span class="comment"> * Copyright (c) 2004, Swedish Institute of Computer Science.</span> 23*10465441SEvalZero<a name="l00003"></a>00003 <span class="comment"> * All rights reserved.</span> 24*10465441SEvalZero<a name="l00004"></a>00004 <span class="comment"> *</span> 25*10465441SEvalZero<a name="l00005"></a>00005 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span> 26*10465441SEvalZero<a name="l00006"></a>00006 <span class="comment"> * modification, are permitted provided that the following conditions</span> 27*10465441SEvalZero<a name="l00007"></a>00007 <span class="comment"> * are met:</span> 28*10465441SEvalZero<a name="l00008"></a>00008 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span> 29*10465441SEvalZero<a name="l00009"></a>00009 <span class="comment"> * notice, this list of conditions and the following disclaimer.</span> 30*10465441SEvalZero<a name="l00010"></a>00010 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span> 31*10465441SEvalZero<a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer in the</span> 32*10465441SEvalZero<a name="l00012"></a>00012 <span class="comment"> * documentation and/or other materials provided with the distribution.</span> 33*10465441SEvalZero<a name="l00013"></a>00013 <span class="comment"> * 3. Neither the name of the Institute nor the names of its contributors</span> 34*10465441SEvalZero<a name="l00014"></a>00014 <span class="comment"> * may be used to endorse or promote products derived from this software</span> 35*10465441SEvalZero<a name="l00015"></a>00015 <span class="comment"> * without specific prior written permission.</span> 36*10465441SEvalZero<a name="l00016"></a>00016 <span class="comment"> *</span> 37*10465441SEvalZero<a name="l00017"></a>00017 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND</span> 38*10465441SEvalZero<a name="l00018"></a>00018 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE</span> 39*10465441SEvalZero<a name="l00019"></a>00019 <span class="comment"> * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE</span> 40*10465441SEvalZero<a name="l00020"></a>00020 <span class="comment"> * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE</span> 41*10465441SEvalZero<a name="l00021"></a>00021 <span class="comment"> * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL</span> 42*10465441SEvalZero<a name="l00022"></a>00022 <span class="comment"> * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS</span> 43*10465441SEvalZero<a name="l00023"></a>00023 <span class="comment"> * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)</span> 44*10465441SEvalZero<a name="l00024"></a>00024 <span class="comment"> * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT</span> 45*10465441SEvalZero<a name="l00025"></a>00025 <span class="comment"> * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY</span> 46*10465441SEvalZero<a name="l00026"></a>00026 <span class="comment"> * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF</span> 47*10465441SEvalZero<a name="l00027"></a>00027 <span class="comment"> * SUCH DAMAGE.</span> 48*10465441SEvalZero<a name="l00028"></a>00028 <span class="comment"> *</span> 49*10465441SEvalZero<a name="l00029"></a>00029 <span class="comment"> * This file is part of the uIP TCP/IP stack</span> 50*10465441SEvalZero<a name="l00030"></a>00030 <span class="comment"> *</span> 51*10465441SEvalZero<a name="l00031"></a>00031 <span class="comment"> * Author: Adam Dunkels <[email protected]></span> 52*10465441SEvalZero<a name="l00032"></a>00032 <span class="comment"> *</span> 53*10465441SEvalZero<a name="l00033"></a>00033 <span class="comment"> * $Id: memb.c,v 1.1 2006/06/12 08:21:43 adam Exp $</span> 54*10465441SEvalZero<a name="l00034"></a>00034 <span class="comment"> */</span> 55*10465441SEvalZero<a name="l00035"></a>00035 <span class="comment"></span> 56*10465441SEvalZero<a name="l00036"></a>00036 <span class="comment">/**</span> 57*10465441SEvalZero<a name="l00037"></a>00037 <span class="comment"> * \addtogroup memb</span> 58*10465441SEvalZero<a name="l00038"></a>00038 <span class="comment"> * @{</span> 59*10465441SEvalZero<a name="l00039"></a>00039 <span class="comment"> */</span> 60*10465441SEvalZero<a name="l00040"></a>00040 <span class="comment"></span> 61*10465441SEvalZero<a name="l00041"></a>00041 <span class="comment"> /**</span> 62*10465441SEvalZero<a name="l00042"></a>00042 <span class="comment"> * \file</span> 63*10465441SEvalZero<a name="l00043"></a>00043 <span class="comment"> * Memory block allocation routines.</span> 64*10465441SEvalZero<a name="l00044"></a>00044 <span class="comment"> * \author Adam Dunkels <[email protected]></span> 65*10465441SEvalZero<a name="l00045"></a>00045 <span class="comment"> */</span> 66*10465441SEvalZero<a name="l00046"></a>00046 <span class="preprocessor">#include <string.h></span> 67*10465441SEvalZero<a name="l00047"></a>00047 68*10465441SEvalZero<a name="l00048"></a>00048 <span class="preprocessor">#include "<a class="code" href="a00121.html">memb.h</a>"</span> 69*10465441SEvalZero<a name="l00049"></a>00049 70*10465441SEvalZero<a name="l00050"></a>00050 <span class="comment">/*---------------------------------------------------------------------------*/</span> 71*10465441SEvalZero<a name="l00051"></a>00051 <span class="keywordtype">void</span> 72*10465441SEvalZero<a name="l00052"></a><a class="code" href="a00159.html#gd58a6c7e62ae59bf7a016ded12ca2910">00052</a> <a class="code" href="a00159.html#gd58a6c7e62ae59bf7a016ded12ca2910">memb_init</a>(<span class="keyword">struct</span> <a class="code" href="a00081.html">memb_blocks</a> *m) 73*10465441SEvalZero<a name="l00053"></a>00053 { 74*10465441SEvalZero<a name="l00054"></a>00054 memset(m-><a class="code" href="a00081.html#5595902fd42d874e35a70206fad8f6d0">count</a>, 0, m-><a class="code" href="a00081.html#164124d48fe85bc98d9a300382a5245d">num</a>); 75*10465441SEvalZero<a name="l00055"></a>00055 memset(m-><a class="code" href="a00081.html#b5801722740492e69bcc73687476009f">mem</a>, 0, m-><a class="code" href="a00081.html#b42c7af6114fde5d21206a2e18a7d3ee">size</a> * m-><a class="code" href="a00081.html#164124d48fe85bc98d9a300382a5245d">num</a>); 76*10465441SEvalZero<a name="l00056"></a>00056 } 77*10465441SEvalZero<a name="l00057"></a>00057 <span class="comment">/*---------------------------------------------------------------------------*/</span> 78*10465441SEvalZero<a name="l00058"></a>00058 <span class="keywordtype">void</span> * 79*10465441SEvalZero<a name="l00059"></a><a class="code" href="a00159.html#gfe5e93119035e14cc485760a176249ba">00059</a> <a class="code" href="a00159.html#gfe5e93119035e14cc485760a176249ba">memb_alloc</a>(<span class="keyword">struct</span> <a class="code" href="a00081.html">memb_blocks</a> *m) 80*10465441SEvalZero<a name="l00060"></a>00060 { 81*10465441SEvalZero<a name="l00061"></a>00061 <span class="keywordtype">int</span> i; 82*10465441SEvalZero<a name="l00062"></a>00062 83*10465441SEvalZero<a name="l00063"></a>00063 <span class="keywordflow">for</span>(i = 0; i < m-><a class="code" href="a00081.html#164124d48fe85bc98d9a300382a5245d">num</a>; ++i) { 84*10465441SEvalZero<a name="l00064"></a>00064 <span class="keywordflow">if</span>(m-><a class="code" href="a00081.html#5595902fd42d874e35a70206fad8f6d0">count</a>[i] == 0) { 85*10465441SEvalZero<a name="l00065"></a>00065 <span class="comment">/* If this block was unused, we increase the reference count to</span> 86*10465441SEvalZero<a name="l00066"></a>00066 <span class="comment"> indicate that it now is used and return a pointer to the</span> 87*10465441SEvalZero<a name="l00067"></a>00067 <span class="comment"> memory block. */</span> 88*10465441SEvalZero<a name="l00068"></a>00068 ++(m-><a class="code" href="a00081.html#5595902fd42d874e35a70206fad8f6d0">count</a>[i]); 89*10465441SEvalZero<a name="l00069"></a>00069 return (<span class="keywordtype">void</span> *)((<span class="keywordtype">char</span> *)m-><a class="code" href="a00081.html#b5801722740492e69bcc73687476009f">mem</a> + (i * m-><a class="code" href="a00081.html#b42c7af6114fde5d21206a2e18a7d3ee">size</a>)); 90*10465441SEvalZero<a name="l00070"></a>00070 } 91*10465441SEvalZero<a name="l00071"></a>00071 } 92*10465441SEvalZero<a name="l00072"></a>00072 93*10465441SEvalZero<a name="l00073"></a>00073 <span class="comment">/* No free block was found, so we return NULL to indicate failure to</span> 94*10465441SEvalZero<a name="l00074"></a>00074 <span class="comment"> allocate block. */</span> 95*10465441SEvalZero<a name="l00075"></a>00075 <span class="keywordflow">return</span> <a class="code" href="a00160.html#g070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>; 96*10465441SEvalZero<a name="l00076"></a>00076 } 97*10465441SEvalZero<a name="l00077"></a>00077 <span class="comment">/*---------------------------------------------------------------------------*/</span> 98*10465441SEvalZero<a name="l00078"></a>00078 <span class="keywordtype">char</span> 99*10465441SEvalZero<a name="l00079"></a><a class="code" href="a00159.html#gceb952d27de8125d5146ac0bee325b8f">00079</a> <a class="code" href="a00159.html#gceb952d27de8125d5146ac0bee325b8f">memb_free</a>(<span class="keyword">struct</span> <a class="code" href="a00081.html">memb_blocks</a> *m, <span class="keywordtype">void</span> *ptr) 100*10465441SEvalZero<a name="l00080"></a>00080 { 101*10465441SEvalZero<a name="l00081"></a>00081 <span class="keywordtype">int</span> i; 102*10465441SEvalZero<a name="l00082"></a>00082 <span class="keywordtype">char</span> *ptr2; 103*10465441SEvalZero<a name="l00083"></a>00083 104*10465441SEvalZero<a name="l00084"></a>00084 <span class="comment">/* Walk through the list of blocks and try to find the block to</span> 105*10465441SEvalZero<a name="l00085"></a>00085 <span class="comment"> which the pointer "ptr" points to. */</span> 106*10465441SEvalZero<a name="l00086"></a>00086 ptr2 = (<span class="keywordtype">char</span> *)m-><a class="code" href="a00081.html#b5801722740492e69bcc73687476009f">mem</a>; 107*10465441SEvalZero<a name="l00087"></a>00087 <span class="keywordflow">for</span>(i = 0; i < m->num; ++i) { 108*10465441SEvalZero<a name="l00088"></a>00088 109*10465441SEvalZero<a name="l00089"></a>00089 <span class="keywordflow">if</span>(ptr2 == (<span class="keywordtype">char</span> *)ptr) { 110*10465441SEvalZero<a name="l00090"></a>00090 <span class="comment">/* We've found to block to which "ptr" points so we decrease the</span> 111*10465441SEvalZero<a name="l00091"></a>00091 <span class="comment"> reference count and return the new value of it. */</span> 112*10465441SEvalZero<a name="l00092"></a>00092 <span class="keywordflow">if</span>(m-><a class="code" href="a00081.html#5595902fd42d874e35a70206fad8f6d0">count</a>[i] > 0) { 113*10465441SEvalZero<a name="l00093"></a>00093 <span class="comment">/* Make sure that we don't deallocate free memory. */</span> 114*10465441SEvalZero<a name="l00094"></a>00094 --(m-><a class="code" href="a00081.html#5595902fd42d874e35a70206fad8f6d0">count</a>[i]); 115*10465441SEvalZero<a name="l00095"></a>00095 } 116*10465441SEvalZero<a name="l00096"></a>00096 <span class="keywordflow">return</span> m-><a class="code" href="a00081.html#5595902fd42d874e35a70206fad8f6d0">count</a>[i]; 117*10465441SEvalZero<a name="l00097"></a>00097 } 118*10465441SEvalZero<a name="l00098"></a>00098 ptr2 += m-><a class="code" href="a00081.html#b42c7af6114fde5d21206a2e18a7d3ee">size</a>; 119*10465441SEvalZero<a name="l00099"></a>00099 } 120*10465441SEvalZero<a name="l00100"></a>00100 <span class="keywordflow">return</span> -1; 121*10465441SEvalZero<a name="l00101"></a>00101 } 122*10465441SEvalZero<a name="l00102"></a>00102 <span class="comment">/*---------------------------------------------------------------------------*/</span> 123*10465441SEvalZero<a name="l00103"></a>00103 <span class="comment"></span> 124*10465441SEvalZero<a name="l00104"></a>00104 <span class="comment">/** @} */</span> 125*10465441SEvalZero</pre></div><hr size="1"><address style="align: right;"><small>Generated on Mon Jun 12 10:23:01 2006 for uIP 1.0 by 126*10465441SEvalZero<a href="http://www.doxygen.org/index.html"> 127*10465441SEvalZero<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.6 </small></address> 128*10465441SEvalZero</body> 129*10465441SEvalZero</html> 130
