<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>SphinxBase: src/libsphinxbase/util/listelem_alloc.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.3 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">SphinxBase <span id="projectnumber">0.6</span></div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('listelem__alloc_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/util/listelem_alloc.c</h1> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/* ====================================================================</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (c) 1999-2004 Carnegie Mellon University. All rights</span>
<a name="l00004"></a>00004 <span class="comment"> * reserved.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00007"></a>00007 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00008"></a>00008 <span class="comment"> * are met:</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer. </span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00014"></a>00014 <span class="comment"> * notice, this list of conditions and the following disclaimer in</span>
<a name="l00015"></a>00015 <span class="comment"> * the documentation and/or other materials provided with the</span>
<a name="l00016"></a>00016 <span class="comment"> * distribution.</span>
<a name="l00017"></a>00017 <span class="comment"> *</span>
<a name="l00018"></a>00018 <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span>
<a name="l00019"></a>00019 <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span>
<a name="l00020"></a>00020 <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span>
<a name="l00021"></a>00021 <span class="comment"> *</span>
<a name="l00022"></a>00022 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span>
<a name="l00023"></a>00023 <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span>
<a name="l00024"></a>00024 <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span>
<a name="l00025"></a>00025 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span>
<a name="l00026"></a>00026 <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span>
<a name="l00027"></a>00027 <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span>
<a name="l00028"></a>00028 <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span>
<a name="l00029"></a>00029 <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span>
<a name="l00030"></a>00030 <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span>
<a name="l00031"></a>00031 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span>
<a name="l00032"></a>00032 <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00033"></a>00033 <span class="comment"> *</span>
<a name="l00034"></a>00034 <span class="comment"> * ====================================================================</span>
<a name="l00035"></a>00035 <span class="comment"> *</span>
<a name="l00036"></a>00036 <span class="comment"> */</span>
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="preprocessor">#include <stdio.h></span>
<a name="l00039"></a>00039 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00040"></a>00040
<a name="l00041"></a>00041 <span class="preprocessor">#include "sphinxbase/err.h"</span>
<a name="l00042"></a>00042 <span class="preprocessor">#include "sphinxbase/ckd_alloc.h"</span>
<a name="l00043"></a>00043 <span class="preprocessor">#include "sphinxbase/listelem_alloc.h"</span>
<a name="l00044"></a>00044 <span class="preprocessor">#include "sphinxbase/glist.h"</span>
<a name="l00045"></a>00045
<a name="l00065"></a><a class="code" href="structlistelem__alloc__s.html">00065</a> <span class="keyword">struct </span><a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_s</a> {
<a name="l00066"></a><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb">00066</a> <span class="keywordtype">char</span> **<a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a>;
<a name="l00067"></a><a class="code" href="structlistelem__alloc__s.html#a1216578b1d5416dc0a03c802cfa1def9">00067</a> <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> <a class="code" href="structlistelem__alloc__s.html#a1216578b1d5416dc0a03c802cfa1def9" title="Linked list of blocks allocated.">blocks</a>;
<a name="l00068"></a><a class="code" href="structlistelem__alloc__s.html#ada7b3fcd2f878e67e07e4bb185bb3015">00068</a> <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> <a class="code" href="structlistelem__alloc__s.html#ada7b3fcd2f878e67e07e4bb185bb3015" title="Number of elements in each block.">blocksize</a>;
<a name="l00069"></a><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49">00069</a> <span class="keywordtype">size_t</span> <a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a>;
<a name="l00070"></a><a class="code" href="structlistelem__alloc__s.html#ab96fd1e097105a34d6ae2e79ae8e2520">00070</a> <span class="keywordtype">size_t</span> <a class="code" href="structlistelem__alloc__s.html#ab96fd1e097105a34d6ae2e79ae8e2520" title="Number of alloc operations before increasing blocksize.">blk_alloc</a>;
<a name="l00071"></a>00071 <span class="keywordtype">size_t</span> n_blocks;
<a name="l00072"></a>00072 <span class="keywordtype">size_t</span> n_alloc;
<a name="l00073"></a>00073 <span class="keywordtype">size_t</span> n_freed;
<a name="l00074"></a>00074 };
<a name="l00075"></a>00075
<a name="l00076"></a>00076 <span class="preprocessor">#define MIN_ALLOC 50 </span>
<a name="l00077"></a>00077 <span class="preprocessor">#define BLKID_SHIFT 16 </span>
<a name="l00078"></a>00078 <span class="preprocessor">#define BLKID_MASK ((1<<BLKID_SHIFT)-1)</span>
<a name="l00079"></a>00079 <span class="preprocessor"></span>
<a name="l00083"></a>00083 <span class="keyword">static</span> <span class="keywordtype">void</span> listelem_add_block(<a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_t</a> *list,
<a name="l00084"></a>00084 <span class="keywordtype">char</span> *caller_file, <span class="keywordtype">int</span> caller_line);
<a name="l00085"></a>00085
<a name="l00086"></a>00086 <a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_t</a> *
<a name="l00087"></a><a class="code" href="listelem__alloc_8h.html#a4b08b49eaa74cbe9a3c95170cee78de7">00087</a> <a class="code" href="listelem__alloc_8h.html#a4b08b49eaa74cbe9a3c95170cee78de7" title="Initialize and return a list element allocator.">listelem_alloc_init</a>(<span class="keywordtype">size_t</span> elemsize)
<a name="l00088"></a>00088 {
<a name="l00089"></a>00089 <a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_t</a> *list;
<a name="l00090"></a>00090
<a name="l00091"></a>00091 <span class="keywordflow">if</span> ((elemsize % <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> *)) != 0) {
<a name="l00092"></a>00092 <span class="keywordtype">size_t</span> rounded = (elemsize + <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> *) - 1) & ~(<span class="keyword">sizeof</span>(<span class="keywordtype">void</span> *)-1);
<a name="l00093"></a>00093 <a class="code" href="err_8h.html#a6a794bec721b555ac1f2167f9e12f662" title="Print warning information to standard error stream.">E_WARN</a>
<a name="l00094"></a>00094 (<span class="stringliteral">"List item size (%lu) not multiple of sizeof(void *), rounding to %lu\n"</span>,
<a name="l00095"></a>00095 (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>)elemsize,
<a name="l00096"></a>00096 (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>)rounded);
<a name="l00097"></a>00097 elemsize = rounded;
<a name="l00098"></a>00098 }
<a name="l00099"></a>00099 list = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(1, <span class="keyword">sizeof</span>(*list));
<a name="l00100"></a>00100 list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a> = NULL;
<a name="l00101"></a>00101 list-><a class="code" href="structlistelem__alloc__s.html#a1216578b1d5416dc0a03c802cfa1def9" title="Linked list of blocks allocated.">blocks</a> = NULL;
<a name="l00102"></a>00102 list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a> = elemsize;
<a name="l00103"></a>00103 <span class="comment">/* Intent of this is to increase block size once we allocate</span>
<a name="l00104"></a>00104 <span class="comment"> * 256KiB (i.e. 1<<18). If somehow the element size is big enough</span>
<a name="l00105"></a>00105 <span class="comment"> * to overflow that, just fail, people should use malloc anyway. */</span>
<a name="l00106"></a>00106 list-><a class="code" href="structlistelem__alloc__s.html#ab96fd1e097105a34d6ae2e79ae8e2520" title="Number of alloc operations before increasing blocksize.">blk_alloc</a> = (1 << 18) / (MIN_ALLOC * elemsize);
<a name="l00107"></a>00107 <span class="keywordflow">if</span> (list-><a class="code" href="structlistelem__alloc__s.html#ab96fd1e097105a34d6ae2e79ae8e2520" title="Number of alloc operations before increasing blocksize.">blk_alloc</a> <= 0) {
<a name="l00108"></a>00108 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Element size * block size exceeds 256k, use malloc instead.\n"</span>);
<a name="l00109"></a>00109 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(list);
<a name="l00110"></a>00110 <span class="keywordflow">return</span> NULL;
<a name="l00111"></a>00111 }
<a name="l00112"></a>00112 list->n_alloc = 0;
<a name="l00113"></a>00113 list->n_freed = 0;
<a name="l00114"></a>00114
<a name="l00115"></a>00115 <span class="comment">/* Allocate an initial block to minimize latency. */</span>
<a name="l00116"></a>00116 listelem_add_block(list, __FILE__, __LINE__);
<a name="l00117"></a>00117 <span class="keywordflow">return</span> list;
<a name="l00118"></a>00118 }
<a name="l00119"></a>00119
<a name="l00120"></a>00120 <span class="keywordtype">void</span>
<a name="l00121"></a><a class="code" href="listelem__alloc_8h.html#a94c02e93a0abaa2bd79636cbac6cced2">00121</a> <a class="code" href="listelem__alloc_8h.html#a94c02e93a0abaa2bd79636cbac6cced2" title="Finalize and release all memory associated with a list element allocator.">listelem_alloc_free</a>(<a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_t</a> *list)
<a name="l00122"></a>00122 {
<a name="l00123"></a>00123 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00124"></a>00124 <span class="keywordflow">if</span> (list == NULL)
<a name="l00125"></a>00125 <span class="keywordflow">return</span>;
<a name="l00126"></a>00126 <span class="keywordflow">for</span> (gn = list-><a class="code" href="structlistelem__alloc__s.html#a1216578b1d5416dc0a03c802cfa1def9" title="Linked list of blocks allocated.">blocks</a>; gn; gn = gnode_next(gn))
<a name="l00127"></a>00127 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(<a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(gn));
<a name="l00128"></a>00128 <a class="code" href="glist_8h.html#a45380e15d2c33afc554fd60a8828580c" title="Free the given generic list; user-defined data contained within is not automatically freed...">glist_free</a>(list-><a class="code" href="structlistelem__alloc__s.html#a1216578b1d5416dc0a03c802cfa1def9" title="Linked list of blocks allocated.">blocks</a>);
<a name="l00129"></a>00129 <a class="code" href="glist_8h.html#a45380e15d2c33afc554fd60a8828580c" title="Free the given generic list; user-defined data contained within is not automatically freed...">glist_free</a>(list-><a class="code" href="structlistelem__alloc__s.html#ada7b3fcd2f878e67e07e4bb185bb3015" title="Number of elements in each block.">blocksize</a>);
<a name="l00130"></a>00130 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(list);
<a name="l00131"></a>00131 }
<a name="l00132"></a>00132
<a name="l00133"></a>00133 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00134"></a>00134 listelem_add_block(<a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_t</a> *list, <span class="keywordtype">char</span> *caller_file, <span class="keywordtype">int</span> caller_line)
<a name="l00135"></a>00135 {
<a name="l00136"></a>00136 <span class="keywordtype">char</span> **cpp, *cp;
<a name="l00137"></a>00137 <span class="keywordtype">size_t</span> j;
<a name="l00138"></a>00138 int32 blocksize;
<a name="l00139"></a>00139
<a name="l00140"></a>00140 blocksize = list-><a class="code" href="structlistelem__alloc__s.html#ada7b3fcd2f878e67e07e4bb185bb3015" title="Number of elements in each block.">blocksize</a> ? gnode_int32(list-><a class="code" href="structlistelem__alloc__s.html#ada7b3fcd2f878e67e07e4bb185bb3015" title="Number of elements in each block.">blocksize</a>) : MIN_ALLOC;
<a name="l00141"></a>00141 <span class="comment">/* Check if block size should be increased (if many requests for this size) */</span>
<a name="l00142"></a>00142 <span class="keywordflow">if</span> (list-><a class="code" href="structlistelem__alloc__s.html#ab96fd1e097105a34d6ae2e79ae8e2520" title="Number of alloc operations before increasing blocksize.">blk_alloc</a> == 0) {
<a name="l00143"></a>00143 <span class="comment">/* See above. No sense in allocating blocks bigger than</span>
<a name="l00144"></a>00144 <span class="comment"> * 256KiB (well, actually, there might be, but we'll worry</span>
<a name="l00145"></a>00145 <span class="comment"> * about that later). */</span>
<a name="l00146"></a>00146 blocksize <<= 1;
<a name="l00147"></a>00147 <span class="keywordflow">if</span> (blocksize * list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a> > (1 << 18))
<a name="l00148"></a>00148 blocksize = (1 << 18) / list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a>;
<a name="l00149"></a>00149 list-><a class="code" href="structlistelem__alloc__s.html#ab96fd1e097105a34d6ae2e79ae8e2520" title="Number of alloc operations before increasing blocksize.">blk_alloc</a> = (1 << 18) / (blocksize * list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a>);
<a name="l00150"></a>00150 }
<a name="l00151"></a>00151
<a name="l00152"></a>00152 <span class="comment">/* Allocate block */</span>
<a name="l00153"></a>00153 cpp = list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a> =
<a name="l00154"></a>00154 (<span class="keywordtype">char</span> **) __ckd_calloc__(blocksize, list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a>,
<a name="l00155"></a>00155 caller_file, caller_line);
<a name="l00156"></a>00156 list-><a class="code" href="structlistelem__alloc__s.html#a1216578b1d5416dc0a03c802cfa1def9" title="Linked list of blocks allocated.">blocks</a> = <a class="code" href="glist_8h.html#a77a9c20b7df5a289477af405ab778377" title="Create and prepend a new list node, with the given user-defined data, at the HEAD of the given generi...">glist_add_ptr</a>(list-><a class="code" href="structlistelem__alloc__s.html#a1216578b1d5416dc0a03c802cfa1def9" title="Linked list of blocks allocated.">blocks</a>, cpp);
<a name="l00157"></a>00157 list-><a class="code" href="structlistelem__alloc__s.html#ada7b3fcd2f878e67e07e4bb185bb3015" title="Number of elements in each block.">blocksize</a> = <a class="code" href="glist_8h.html#a28adfcc24a784aaed1a0b3c4c4de4c42" title="Create and prepend a new list node containing an integer.">glist_add_int32</a>(list-><a class="code" href="structlistelem__alloc__s.html#ada7b3fcd2f878e67e07e4bb185bb3015" title="Number of elements in each block.">blocksize</a>, blocksize);
<a name="l00158"></a>00158 cp = (<span class="keywordtype">char</span> *) cpp;
<a name="l00159"></a>00159 <span class="comment">/* Link up the blocks via their first machine word. */</span>
<a name="l00160"></a>00160 <span class="keywordflow">for</span> (j = blocksize - 1; j > 0; --j) {
<a name="l00161"></a>00161 cp += list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a>;
<a name="l00162"></a>00162 *cpp = cp;
<a name="l00163"></a>00163 cpp = (<span class="keywordtype">char</span> **) cp;
<a name="l00164"></a>00164 }
<a name="l00165"></a>00165 <span class="comment">/* Make sure the last element's forward pointer is NULL */</span>
<a name="l00166"></a>00166 *cpp = NULL;
<a name="l00167"></a>00167 --list-><a class="code" href="structlistelem__alloc__s.html#ab96fd1e097105a34d6ae2e79ae8e2520" title="Number of alloc operations before increasing blocksize.">blk_alloc</a>;
<a name="l00168"></a>00168 ++list->n_blocks;
<a name="l00169"></a>00169 }
<a name="l00170"></a>00170
<a name="l00171"></a>00171
<a name="l00172"></a>00172 <span class="keywordtype">void</span> *
<a name="l00173"></a>00173 __listelem_malloc__(<a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_t</a> *list, <span class="keywordtype">char</span> *caller_file, <span class="keywordtype">int</span> caller_line)
<a name="l00174"></a>00174 {
<a name="l00175"></a>00175 <span class="keywordtype">char</span> **ptr;
<a name="l00176"></a>00176
<a name="l00177"></a>00177 <span class="comment">/* Allocate a new block if list empty */</span>
<a name="l00178"></a>00178 <span class="keywordflow">if</span> (list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a> == NULL)
<a name="l00179"></a>00179 listelem_add_block(list, caller_file, caller_line);
<a name="l00180"></a>00180
<a name="l00181"></a>00181 <span class="comment">/* Unlink and return first element in freelist */</span>
<a name="l00182"></a>00182 ptr = list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a>;
<a name="l00183"></a>00183 list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a> = (<span class="keywordtype">char</span> **) (*(list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a>));
<a name="l00184"></a>00184 (list->n_alloc)++;
<a name="l00185"></a>00185
<a name="l00186"></a>00186 <span class="keywordflow">return</span> (<span class="keywordtype">void</span> *)ptr;
<a name="l00187"></a>00187 }
<a name="l00188"></a>00188
<a name="l00189"></a>00189 <span class="keywordtype">void</span> *
<a name="l00190"></a>00190 __listelem_malloc_id__(<a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_t</a> *list, <span class="keywordtype">char</span> *caller_file,
<a name="l00191"></a>00191 <span class="keywordtype">int</span> caller_line, int32 *out_id)
<a name="l00192"></a>00192 {
<a name="l00193"></a>00193 <span class="keywordtype">char</span> **ptr;
<a name="l00194"></a>00194
<a name="l00195"></a>00195 <span class="comment">/* Allocate a new block if list empty */</span>
<a name="l00196"></a>00196 <span class="keywordflow">if</span> (list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a> == NULL)
<a name="l00197"></a>00197 listelem_add_block(list, caller_file, caller_line);
<a name="l00198"></a>00198
<a name="l00199"></a>00199 <span class="comment">/* Unlink and return first element in freelist */</span>
<a name="l00200"></a>00200 ptr = list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a>;
<a name="l00201"></a>00201 list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a> = (<span class="keywordtype">char</span> **) (*(list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a>));
<a name="l00202"></a>00202 (list->n_alloc)++;
<a name="l00203"></a>00203
<a name="l00204"></a>00204 <span class="keywordflow">if</span> (out_id) {
<a name="l00205"></a>00205 int32 blksize, blkidx, ptridx;
<a name="l00206"></a>00206 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn, *gn2;
<a name="l00207"></a>00207 <span class="keywordtype">char</span> **block;
<a name="l00208"></a>00208
<a name="l00209"></a>00209 gn2 = list-><a class="code" href="structlistelem__alloc__s.html#ada7b3fcd2f878e67e07e4bb185bb3015" title="Number of elements in each block.">blocksize</a>;
<a name="l00210"></a>00210 block = NULL;
<a name="l00211"></a>00211 blkidx = 0;
<a name="l00212"></a>00212 <span class="keywordflow">for</span> (gn = list-><a class="code" href="structlistelem__alloc__s.html#a1216578b1d5416dc0a03c802cfa1def9" title="Linked list of blocks allocated.">blocks</a>; gn; gn = gnode_next(gn)) {
<a name="l00213"></a>00213 block = <a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(gn);
<a name="l00214"></a>00214 blksize = gnode_int32(gn2) * list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a> / <span class="keyword">sizeof</span>(*block);
<a name="l00215"></a>00215 <span class="keywordflow">if</span> (ptr >= block && ptr < block + blksize)
<a name="l00216"></a>00216 <span class="keywordflow">break</span>;
<a name="l00217"></a>00217 gn2 = gnode_next(gn2);
<a name="l00218"></a>00218 ++blkidx;
<a name="l00219"></a>00219 }
<a name="l00220"></a>00220 <span class="keywordflow">if</span> (gn == NULL) {
<a name="l00221"></a>00221 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Failed to find block index for pointer %p!\n"</span>, ptr);
<a name="l00222"></a>00222 }
<a name="l00223"></a>00223 ptridx = (ptr - block) / (list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a> / <span class="keyword">sizeof</span>(*block));
<a name="l00224"></a>00224 <a class="code" href="err_8h.html#af46f94d0e21f22f1153f8f1cd9a372d6" title="Print debugging information to standard error stream.">E_DEBUG</a>(4,(<span class="stringliteral">"ptr %p block %p blkidx %d ptridx %d\n"</span>,
<a name="l00225"></a>00225 ptr, block, list->n_blocks - blkidx - 1, ptridx));
<a name="l00226"></a>00226 *out_id = ((list->n_blocks - blkidx - 1) << BLKID_SHIFT) | ptridx;
<a name="l00227"></a>00227 }
<a name="l00228"></a>00228
<a name="l00229"></a>00229 <span class="keywordflow">return</span> ptr;
<a name="l00230"></a>00230 }
<a name="l00231"></a>00231
<a name="l00232"></a>00232 <span class="keywordtype">void</span> *
<a name="l00233"></a><a class="code" href="listelem__alloc_8h.html#a74e610ac90e2b0696b2aedef4289d8f3">00233</a> <a class="code" href="listelem__alloc_8h.html#a74e610ac90e2b0696b2aedef4289d8f3" title="Retrieve a list element by its identifier.">listelem_get_item</a>(<a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_t</a> *list, int32 <span class="keywordtype">id</span>)
<a name="l00234"></a>00234 {
<a name="l00235"></a>00235 int32 blkidx, ptridx, i;
<a name="l00236"></a>00236 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00237"></a>00237
<a name="l00238"></a>00238 blkidx = (<span class="keywordtype">id</span> >> BLKID_SHIFT) & BLKID_MASK;
<a name="l00239"></a>00239 ptridx = <span class="keywordtype">id</span> & BLKID_MASK;
<a name="l00240"></a>00240
<a name="l00241"></a>00241 i = 0;
<a name="l00242"></a>00242 blkidx = list->n_blocks - blkidx;
<a name="l00243"></a>00243 <span class="keywordflow">for</span> (gn = list-><a class="code" href="structlistelem__alloc__s.html#a1216578b1d5416dc0a03c802cfa1def9" title="Linked list of blocks allocated.">blocks</a>; gn; gn = gnode_next(gn)) {
<a name="l00244"></a>00244 <span class="keywordflow">if</span> (++i == blkidx)
<a name="l00245"></a>00245 <span class="keywordflow">break</span>;
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247 <span class="keywordflow">if</span> (gn == NULL) {
<a name="l00248"></a>00248 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Failed to find block index %d\n"</span>, blkidx);
<a name="l00249"></a>00249 <span class="keywordflow">return</span> NULL;
<a name="l00250"></a>00250 }
<a name="l00251"></a>00251
<a name="l00252"></a>00252 <span class="keywordflow">return</span> (<span class="keywordtype">void</span> *)((<span class="keywordtype">char</span> **)<a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(gn)
<a name="l00253"></a>00253 + ptridx * (list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a> / <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> *)));
<a name="l00254"></a>00254 }
<a name="l00255"></a>00255
<a name="l00256"></a>00256 <span class="keywordtype">void</span>
<a name="l00257"></a><a class="code" href="listelem__alloc_8h.html#ab83a7a6fd086c14140ad2c8c4162709b">00257</a> <a class="code" href="listelem__alloc_8h.html#ab83a7a6fd086c14140ad2c8c4162709b" title="Free list element of given size.">__listelem_free__</a>(<a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_t</a> *list, <span class="keywordtype">void</span> *elem,
<a name="l00258"></a>00258 <span class="keywordtype">char</span> *caller_file, <span class="keywordtype">int</span> caller_line)
<a name="l00259"></a>00259 {
<a name="l00260"></a>00260 <span class="keywordtype">char</span> **cpp;
<a name="l00261"></a>00261
<a name="l00262"></a>00262 <span class="comment">/*</span>
<a name="l00263"></a>00263 <span class="comment"> * Insert freed item at head of list.</span>
<a name="l00264"></a>00264 <span class="comment"> */</span>
<a name="l00265"></a>00265 cpp = (<span class="keywordtype">char</span> **) elem;
<a name="l00266"></a>00266 *cpp = (<span class="keywordtype">char</span> *) list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a>;
<a name="l00267"></a>00267 list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a> = cpp;
<a name="l00268"></a>00268 (list->n_freed)++;
<a name="l00269"></a>00269 }
<a name="l00270"></a>00270
<a name="l00271"></a>00271
<a name="l00272"></a>00272 <span class="keywordtype">void</span>
<a name="l00273"></a><a class="code" href="listelem__alloc_8h.html#a838d9361ba76a89a834a7ea6a185b57d">00273</a> <a class="code" href="listelem__alloc_8h.html#a838d9361ba76a89a834a7ea6a185b57d" title="Print number of allocation, numer of free operation stats.">listelem_stats</a>(<a class="code" href="structlistelem__alloc__s.html" title="Fast linked list allocator.">listelem_alloc_t</a> *list)
<a name="l00274"></a>00274 {
<a name="l00275"></a>00275 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn, *gn2;
<a name="l00276"></a>00276 <span class="keywordtype">char</span> **cpp;
<a name="l00277"></a>00277 <span class="keywordtype">size_t</span> n;
<a name="l00278"></a>00278
<a name="l00279"></a>00279 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"Linklist stats:\n"</span>);
<a name="l00280"></a>00280 <span class="keywordflow">for</span> (n = 0, cpp = list-><a class="code" href="structlistelem__alloc__s.html#a2c3be8623c5bb2d4afb3ad888790a4eb" title="ptr to first element in freelist">freelist</a>; cpp;
<a name="l00281"></a>00281 cpp = (<span class="keywordtype">char</span> **) (*cpp), n++);
<a name="l00282"></a>00282 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>
<a name="l00283"></a>00283 (<span class="stringliteral">"elemsize %lu, #alloc %lu, #freed %lu, #freelist %lu\n"</span>,
<a name="l00284"></a>00284 (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>)list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a>,
<a name="l00285"></a>00285 (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>)list->n_alloc,
<a name="l00286"></a>00286 (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>)list->n_freed,
<a name="l00287"></a>00287 (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>)n);
<a name="l00288"></a>00288 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"Allocated blocks:\n"</span>);
<a name="l00289"></a>00289 gn2 = list-><a class="code" href="structlistelem__alloc__s.html#ada7b3fcd2f878e67e07e4bb185bb3015" title="Number of elements in each block.">blocksize</a>;
<a name="l00290"></a>00290 <span class="keywordflow">for</span> (gn = list-><a class="code" href="structlistelem__alloc__s.html#a1216578b1d5416dc0a03c802cfa1def9" title="Linked list of blocks allocated.">blocks</a>; gn; gn = gnode_next(gn)) {
<a name="l00291"></a>00291 <a class="code" href="err_8h.html#ac3c705943d946708cea0a1443be1c853" title="Print logging information to standard error stream.">E_INFO</a>(<span class="stringliteral">"%p (%d * %d bytes)\n"</span>, <a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(gn), gnode_int32(gn2), list-><a class="code" href="structlistelem__alloc__s.html#a9e27c7163c45a43f8dfd667cbc014f49" title="Number of (char *) in element.">elemsize</a>);
<a name="l00292"></a>00292 gn2 = gnode_next(gn2);
<a name="l00293"></a>00293 }
<a name="l00294"></a>00294 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>listelem_alloc.c</b> </li>
<li class="footer">Generated on Tue Apr 19 2011 for SphinxBase by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </li>
</ul>
</div>
</body>
</html>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
0b420d0fce195cf4115dc6a3be5c2da2
>
files
>
269
