<!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/ckd_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('ckd__alloc_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/util/ckd_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 <span class="comment">/*</span>
<a name="l00038"></a>00038 <span class="comment"> * ckd_alloc.c -- Memory allocation package.</span>
<a name="l00039"></a>00039 <span class="comment"> *</span>
<a name="l00040"></a>00040 <span class="comment"> * **********************************************</span>
<a name="l00041"></a>00041 <span class="comment"> * CMU ARPA Speech Project</span>
<a name="l00042"></a>00042 <span class="comment"> *</span>
<a name="l00043"></a>00043 <span class="comment"> * Copyright (c) 1999 Carnegie Mellon University.</span>
<a name="l00044"></a>00044 <span class="comment"> * ALL RIGHTS RESERVED.</span>
<a name="l00045"></a>00045 <span class="comment"> * **********************************************</span>
<a name="l00046"></a>00046 <span class="comment"> * </span>
<a name="l00047"></a>00047 <span class="comment"> * HISTORY</span>
<a name="l00048"></a>00048 <span class="comment"> * $Log: ckd_alloc.c,v $</span>
<a name="l00049"></a>00049 <span class="comment"> * Revision 1.6 2005/06/22 02:59:25 arthchan2003</span>
<a name="l00050"></a>00050 <span class="comment"> * Added keyword</span>
<a name="l00051"></a>00051 <span class="comment"> *</span>
<a name="l00052"></a>00052 <span class="comment"> * Revision 1.3 2005/03/30 01:22:48 archan</span>
<a name="l00053"></a>00053 <span class="comment"> * Fixed mistakes in last updates. Add</span>
<a name="l00054"></a>00054 <span class="comment"> *</span>
<a name="l00055"></a>00055 <span class="comment"> * </span>
<a name="l00056"></a>00056 <span class="comment"> * 19-Jun-97 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University</span>
<a name="l00057"></a>00057 <span class="comment"> * Removed file,line arguments from free functions.</span>
<a name="l00058"></a>00058 <span class="comment"> * Removed debugging stuff.</span>
<a name="l00059"></a>00059 <span class="comment"> * </span>
<a name="l00060"></a>00060 <span class="comment"> * 01-Jan-96 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University</span>
<a name="l00061"></a>00061 <span class="comment"> * Created.</span>
<a name="l00062"></a>00062 <span class="comment"> */</span>
<a name="l00063"></a>00063
<a name="l00064"></a>00064
<a name="l00065"></a>00065 <span class="comment">/*********************************************************************</span>
<a name="l00066"></a>00066 <span class="comment"> *</span>
<a name="l00067"></a>00067 <span class="comment"> * $Header: /cvsroot/cmusphinx/sphinx3/src/libutil/ckd_alloc.c,v 1.6 2005/06/22 02:59:25 arthchan2003 Exp $</span>
<a name="l00068"></a>00068 <span class="comment"> *</span>
<a name="l00069"></a>00069 <span class="comment"> * Carnegie Mellon ARPA Speech Group</span>
<a name="l00070"></a>00070 <span class="comment"> *</span>
<a name="l00071"></a>00071 <span class="comment"> * Copyright (c) 1994 Carnegie Mellon University.</span>
<a name="l00072"></a>00072 <span class="comment"> * All rights reserved.</span>
<a name="l00073"></a>00073 <span class="comment"> *</span>
<a name="l00074"></a>00074 <span class="comment"> *********************************************************************</span>
<a name="l00075"></a>00075 <span class="comment"> *</span>
<a name="l00076"></a>00076 <span class="comment"> * file: ckd_alloc.c</span>
<a name="l00077"></a>00077 <span class="comment"> * </span>
<a name="l00078"></a>00078 <span class="comment"> * traceability: </span>
<a name="l00079"></a>00079 <span class="comment"> * </span>
<a name="l00080"></a>00080 <span class="comment"> * description: </span>
<a name="l00081"></a>00081 <span class="comment"> * </span>
<a name="l00082"></a>00082 <span class="comment"> * author: </span>
<a name="l00083"></a>00083 <span class="comment"> * </span>
<a name="l00084"></a>00084 <span class="comment"> *********************************************************************/</span>
<a name="l00085"></a>00085
<a name="l00086"></a>00086
<a name="l00087"></a>00087 <span class="preprocessor">#include <stdio.h></span>
<a name="l00088"></a>00088 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00089"></a>00089 <span class="preprocessor">#include <string.h></span>
<a name="l00090"></a>00090 <span class="preprocessor">#include <assert.h></span>
<a name="l00091"></a>00091 <span class="preprocessor">#include <stdarg.h></span>
<a name="l00092"></a>00092
<a name="l00093"></a>00093 <span class="preprocessor">#ifdef _MSC_VER</span>
<a name="l00094"></a>00094 <span class="preprocessor"></span><span class="preprocessor">#pragma warning (disable: 4996)</span>
<a name="l00095"></a>00095 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00096"></a>00096 <span class="preprocessor"></span>
<a name="l00097"></a>00097 <span class="preprocessor">#include "sphinxbase/ckd_alloc.h"</span>
<a name="l00098"></a>00098 <span class="preprocessor">#include "sphinxbase/err.h"</span>
<a name="l00099"></a>00099
<a name="l00105"></a>00105 <span class="keyword">static</span> jmp_buf *ckd_target;
<a name="l00106"></a>00106 <span class="keyword">static</span> <span class="keywordtype">int</span> jmp_abort;
<a name="l00107"></a>00107
<a name="l00108"></a>00108 jmp_buf *
<a name="l00109"></a><a class="code" href="ckd__alloc_8h.html#a0ec6d92241b1912b10f59519d553acb9">00109</a> <a class="code" href="ckd__alloc_8h.html#a0ec6d92241b1912b10f59519d553acb9" title="Control behaviour of the program when allocation fails.">ckd_set_jump</a>(jmp_buf *env, <span class="keywordtype">int</span> abort)
<a name="l00110"></a>00110 {
<a name="l00111"></a>00111 jmp_buf *old;
<a name="l00112"></a>00112
<a name="l00113"></a>00113 <span class="keywordflow">if</span> (abort)
<a name="l00114"></a>00114 jmp_abort = 1;
<a name="l00115"></a>00115
<a name="l00116"></a>00116 old = ckd_target;
<a name="l00117"></a>00117 ckd_target = env;
<a name="l00118"></a>00118 <span class="keywordflow">return</span> old;
<a name="l00119"></a>00119 }
<a name="l00120"></a>00120
<a name="l00121"></a>00121 <span class="keywordtype">void</span>
<a name="l00122"></a><a class="code" href="ckd__alloc_8h.html#ab81dfe13d2237c64182f06f66fab7b0e">00122</a> <a class="code" href="ckd__alloc_8h.html#ab81dfe13d2237c64182f06f66fab7b0e" title="Fail (with a message) according to behaviour specified by ckd_set_jump().">ckd_fail</a>(<span class="keywordtype">char</span> *format, ...)
<a name="l00123"></a>00123 {
<a name="l00124"></a>00124 va_list args;
<a name="l00125"></a>00125
<a name="l00126"></a>00126 va_start(args, format);
<a name="l00127"></a>00127 vfprintf(stderr, format, args);
<a name="l00128"></a>00128 va_end(args);
<a name="l00129"></a>00129
<a name="l00130"></a>00130 <span class="keywordflow">if</span> (jmp_abort)
<a name="l00131"></a>00131 <span class="comment">/* Silvio Moioli: abort() doesn't exist in Windows CE */</span>
<a name="l00132"></a>00132 <span class="preprocessor"> #if defined(_WIN32_WCE)</span>
<a name="l00133"></a>00133 <span class="preprocessor"></span> exit(-1);
<a name="l00134"></a>00134 <span class="preprocessor"> #else</span>
<a name="l00135"></a>00135 <span class="preprocessor"></span> abort();
<a name="l00136"></a>00136 <span class="preprocessor"> #endif</span>
<a name="l00137"></a>00137 <span class="preprocessor"></span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ckd_target)
<a name="l00138"></a>00138 longjmp(*ckd_target, 1);
<a name="l00139"></a>00139 <span class="keywordflow">else</span>
<a name="l00140"></a>00140 exit(-1);
<a name="l00141"></a>00141 }
<a name="l00142"></a>00142
<a name="l00143"></a>00143 <span class="keywordtype">void</span> *
<a name="l00144"></a>00144 __ckd_calloc__(<span class="keywordtype">size_t</span> n_elem, <span class="keywordtype">size_t</span> elem_size,
<a name="l00145"></a>00145 <span class="keyword">const</span> <span class="keywordtype">char</span> *caller_file, <span class="keywordtype">int</span> caller_line)
<a name="l00146"></a>00146 {
<a name="l00147"></a>00147 <span class="keywordtype">void</span> *mem;
<a name="l00148"></a>00148
<a name="l00149"></a>00149 <span class="preprocessor">#if defined(__ADSPBLACKFIN__) && !defined(__linux__)</span>
<a name="l00150"></a>00150 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((mem = heap_calloc(heap_lookup(1),n_elem, elem_size)) == NULL)
<a name="l00151"></a>00151 <span class="keywordflow">if</span> ((mem = heap_calloc(heap_lookup(0),n_elem, elem_size)) == NULL)
<a name="l00152"></a>00152 {
<a name="l00153"></a>00153 <a class="code" href="ckd__alloc_8h.html#ab81dfe13d2237c64182f06f66fab7b0e" title="Fail (with a message) according to behaviour specified by ckd_set_jump().">ckd_fail</a>(<span class="stringliteral">"calloc(%d,%d) failed from %s(%d), free space: %d\n"</span>, n_elem,
<a name="l00154"></a>00154 elem_size, caller_file, caller_line,space_unused());
<a name="l00155"></a>00155 }
<a name="l00156"></a>00156 <span class="preprocessor">#else</span>
<a name="l00157"></a>00157 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((mem = calloc(n_elem, elem_size)) == NULL) {
<a name="l00158"></a>00158 <a class="code" href="ckd__alloc_8h.html#ab81dfe13d2237c64182f06f66fab7b0e" title="Fail (with a message) according to behaviour specified by ckd_set_jump().">ckd_fail</a>(<span class="stringliteral">"calloc(%d,%d) failed from %s(%d)\n"</span>, n_elem,
<a name="l00159"></a>00159 elem_size, caller_file, caller_line);
<a name="l00160"></a>00160 }
<a name="l00161"></a>00161 <span class="preprocessor">#endif</span>
<a name="l00162"></a>00162 <span class="preprocessor"></span>
<a name="l00163"></a>00163
<a name="l00164"></a>00164 <span class="keywordflow">return</span> mem;
<a name="l00165"></a>00165 }
<a name="l00166"></a>00166
<a name="l00167"></a>00167
<a name="l00168"></a>00168 <span class="keywordtype">void</span> *
<a name="l00169"></a>00169 __ckd_malloc__(<span class="keywordtype">size_t</span> size, <span class="keyword">const</span> <span class="keywordtype">char</span> *caller_file, <span class="keywordtype">int</span> caller_line)
<a name="l00170"></a>00170 {
<a name="l00171"></a>00171 <span class="keywordtype">void</span> *mem;
<a name="l00172"></a>00172
<a name="l00173"></a>00173 <span class="preprocessor">#if defined(__ADSPBLACKFIN__) && !defined(__linux__)</span>
<a name="l00174"></a>00174 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((mem = heap_malloc(heap_lookup(0),size)) == NULL)
<a name="l00175"></a>00175 <span class="keywordflow">if</span> ((mem = heap_malloc(heap_lookup(1),size)) == NULL)
<a name="l00176"></a>00176 <span class="preprocessor">#else</span>
<a name="l00177"></a>00177 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((mem = malloc(size)) == NULL)
<a name="l00178"></a>00178 <span class="preprocessor">#endif</span>
<a name="l00179"></a>00179 <span class="preprocessor"></span> <a class="code" href="ckd__alloc_8h.html#ab81dfe13d2237c64182f06f66fab7b0e" title="Fail (with a message) according to behaviour specified by ckd_set_jump().">ckd_fail</a>(<span class="stringliteral">"malloc(%d) failed from %s(%d)\n"</span>, size,
<a name="l00180"></a>00180 caller_file, caller_line);
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keywordflow">return</span> mem;
<a name="l00183"></a>00183 }
<a name="l00184"></a>00184
<a name="l00185"></a>00185
<a name="l00186"></a>00186 <span class="keywordtype">void</span> *
<a name="l00187"></a>00187 __ckd_realloc__(<span class="keywordtype">void</span> *ptr, <span class="keywordtype">size_t</span> new_size,
<a name="l00188"></a>00188 <span class="keyword">const</span> <span class="keywordtype">char</span> *caller_file, <span class="keywordtype">int</span> caller_line)
<a name="l00189"></a>00189 {
<a name="l00190"></a>00190 <span class="keywordtype">void</span> *mem;
<a name="l00191"></a>00191 <span class="preprocessor">#if defined(__ADSPBLACKFIN__) && !defined(__linux__)</span>
<a name="l00192"></a>00192 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((mem = heap_realloc(heap_lookup(0),ptr, new_size)) == NULL) {
<a name="l00193"></a>00193 <span class="preprocessor">#else</span>
<a name="l00194"></a>00194 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((mem = realloc(ptr, new_size)) == NULL) {
<a name="l00195"></a>00195 <span class="preprocessor">#endif</span>
<a name="l00196"></a>00196 <span class="preprocessor"></span> <a class="code" href="ckd__alloc_8h.html#ab81dfe13d2237c64182f06f66fab7b0e" title="Fail (with a message) according to behaviour specified by ckd_set_jump().">ckd_fail</a>(<span class="stringliteral">"malloc(%d) failed from %s(%d)\n"</span>, new_size,
<a name="l00197"></a>00197 caller_file, caller_line);
<a name="l00198"></a>00198 }
<a name="l00199"></a>00199
<a name="l00200"></a>00200 <span class="keywordflow">return</span> mem;
<a name="l00201"></a>00201 }
<a name="l00202"></a>00202
<a name="l00203"></a>00203
<a name="l00204"></a>00204 <span class="keywordtype">char</span> *
<a name="l00205"></a><a class="code" href="ckd__alloc_8h.html#ad92dae54c994a4f90c842e42d05c494a">00205</a> <a class="code" href="ckd__alloc_8h.html#ad92dae54c994a4f90c842e42d05c494a" title="Like strdup, except that if an error occurs it prints a diagnostic message and exits.">__ckd_salloc__</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *orig, <span class="keyword">const</span> <span class="keywordtype">char</span> *caller_file,
<a name="l00206"></a>00206 <span class="keywordtype">int</span> caller_line)
<a name="l00207"></a>00207 {
<a name="l00208"></a>00208 <span class="keywordtype">size_t</span> len;
<a name="l00209"></a>00209 <span class="keywordtype">char</span> *buf;
<a name="l00210"></a>00210
<a name="l00211"></a>00211 len = strlen(orig) + 1;
<a name="l00212"></a>00212 buf = (<span class="keywordtype">char</span> *) __ckd_malloc__(len, caller_file, caller_line);
<a name="l00213"></a>00213
<a name="l00214"></a>00214 strcpy(buf, orig);
<a name="l00215"></a>00215 <span class="keywordflow">return</span> (buf);
<a name="l00216"></a>00216 }
<a name="l00217"></a>00217
<a name="l00218"></a>00218
<a name="l00219"></a>00219 <span class="keywordtype">void</span> *
<a name="l00220"></a><a class="code" href="ckd__alloc_8h.html#a141713f7d0ac99eac338d6d8ae35b771">00220</a> <a class="code" href="ckd__alloc_8h.html#a141713f7d0ac99eac338d6d8ae35b771" title="Allocate a 2-D array and return ptr to it (ie, ptr to vector of ptrs).">__ckd_calloc_2d__</a>(<span class="keywordtype">size_t</span> d1, <span class="keywordtype">size_t</span> d2, <span class="keywordtype">size_t</span> elemsize,
<a name="l00221"></a>00221 <span class="keyword">const</span> <span class="keywordtype">char</span> *caller_file, <span class="keywordtype">int</span> caller_line)
<a name="l00222"></a>00222 {
<a name="l00223"></a>00223 <span class="keywordtype">char</span> **ref, *mem;
<a name="l00224"></a>00224 <span class="keywordtype">size_t</span> i, offset;
<a name="l00225"></a>00225
<a name="l00226"></a>00226 mem =
<a name="l00227"></a>00227 (<span class="keywordtype">char</span> *) __ckd_calloc__(d1 * d2, elemsize, caller_file,
<a name="l00228"></a>00228 caller_line);
<a name="l00229"></a>00229 ref =
<a name="l00230"></a>00230 (<span class="keywordtype">char</span> **) __ckd_malloc__(d1 * <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> *), caller_file,
<a name="l00231"></a>00231 caller_line);
<a name="l00232"></a>00232
<a name="l00233"></a>00233 <span class="keywordflow">for</span> (i = 0, offset = 0; i < d1; i++, offset += d2 * elemsize)
<a name="l00234"></a>00234 ref[i] = mem + offset;
<a name="l00235"></a>00235
<a name="l00236"></a>00236 <span class="keywordflow">return</span> ref;
<a name="l00237"></a>00237 }
<a name="l00238"></a>00238
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="keywordtype">void</span>
<a name="l00241"></a><a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf">00241</a> <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(<span class="keywordtype">void</span> *ptr)
<a name="l00242"></a>00242 {
<a name="l00243"></a>00243 <span class="keywordflow">if</span> (ptr)
<a name="l00244"></a>00244 <span class="preprocessor">#if defined(__ADSPBLACKFIN__) && !defined(__linux__)</span>
<a name="l00245"></a>00245 <span class="preprocessor"></span> heap_free(0,ptr);
<a name="l00246"></a>00246 <span class="preprocessor">#else</span>
<a name="l00247"></a>00247 <span class="preprocessor"></span> free(ptr);
<a name="l00248"></a>00248 <span class="preprocessor">#endif</span>
<a name="l00249"></a>00249 <span class="preprocessor"></span>}
<a name="l00250"></a>00250
<a name="l00251"></a>00251 <span class="keywordtype">void</span>
<a name="l00252"></a><a class="code" href="ckd__alloc_8h.html#a8246c071ac12e98b7e1df9fe6da15aef">00252</a> <a class="code" href="ckd__alloc_8h.html#a8246c071ac12e98b7e1df9fe6da15aef" title="Free a 2-D array (ptr) previously allocated by ckd_calloc_2d.">ckd_free_2d</a>(<span class="keywordtype">void</span> *tmpptr)
<a name="l00253"></a>00253 {
<a name="l00254"></a>00254 <span class="keywordtype">void</span> **ptr = (<span class="keywordtype">void</span> **)tmpptr;
<a name="l00255"></a>00255 <span class="keywordflow">if</span> (ptr)
<a name="l00256"></a>00256 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(ptr[0]);
<a name="l00257"></a>00257 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(ptr);
<a name="l00258"></a>00258 }
<a name="l00259"></a>00259
<a name="l00260"></a>00260
<a name="l00261"></a>00261 <span class="keywordtype">void</span> *
<a name="l00262"></a><a class="code" href="ckd__alloc_8h.html#a19c770c65f642488f6045c442f53fc0c">00262</a> <a class="code" href="ckd__alloc_8h.html#a19c770c65f642488f6045c442f53fc0c" title="Allocate a 3-D array and return ptr to it.">__ckd_calloc_3d__</a>(<span class="keywordtype">size_t</span> d1, <span class="keywordtype">size_t</span> d2, <span class="keywordtype">size_t</span> d3, <span class="keywordtype">size_t</span> elemsize,
<a name="l00263"></a>00263 <span class="keyword">const</span> <span class="keywordtype">char</span> *caller_file, <span class="keywordtype">int</span> caller_line)
<a name="l00264"></a>00264 {
<a name="l00265"></a>00265 <span class="keywordtype">char</span> ***ref1, **ref2, *mem;
<a name="l00266"></a>00266 <span class="keywordtype">size_t</span> i, j, offset;
<a name="l00267"></a>00267
<a name="l00268"></a>00268 mem =
<a name="l00269"></a>00269 (<span class="keywordtype">char</span> *) __ckd_calloc__(d1 * d2 * d3, elemsize, caller_file,
<a name="l00270"></a>00270 caller_line);
<a name="l00271"></a>00271 ref1 =
<a name="l00272"></a>00272 (<span class="keywordtype">char</span> ***) __ckd_malloc__(d1 * <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> **), caller_file,
<a name="l00273"></a>00273 caller_line);
<a name="l00274"></a>00274 ref2 =
<a name="l00275"></a>00275 (<span class="keywordtype">char</span> **) __ckd_malloc__(d1 * d2 * <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> *), caller_file,
<a name="l00276"></a>00276 caller_line);
<a name="l00277"></a>00277
<a name="l00278"></a>00278 <span class="keywordflow">for</span> (i = 0, offset = 0; i < d1; i++, offset += d2)
<a name="l00279"></a>00279 ref1[i] = ref2 + offset;
<a name="l00280"></a>00280
<a name="l00281"></a>00281 offset = 0;
<a name="l00282"></a>00282 <span class="keywordflow">for</span> (i = 0; i < d1; i++) {
<a name="l00283"></a>00283 <span class="keywordflow">for</span> (j = 0; j < d2; j++) {
<a name="l00284"></a>00284 ref1[i][j] = mem + offset;
<a name="l00285"></a>00285 offset += d3 * elemsize;
<a name="l00286"></a>00286 }
<a name="l00287"></a>00287 }
<a name="l00288"></a>00288
<a name="l00289"></a>00289 <span class="keywordflow">return</span> ref1;
<a name="l00290"></a>00290 }
<a name="l00291"></a>00291
<a name="l00292"></a>00292
<a name="l00293"></a>00293 <span class="keywordtype">void</span>
<a name="l00294"></a><a class="code" href="ckd__alloc_8h.html#a443accde4663a4a07c6d147088614d57">00294</a> <a class="code" href="ckd__alloc_8h.html#a443accde4663a4a07c6d147088614d57" title="Free a 3-D array (ptr) previously allocated by ckd_calloc_3d.">ckd_free_3d</a>(<span class="keywordtype">void</span> *inptr)
<a name="l00295"></a>00295 {
<a name="l00296"></a>00296 <span class="keywordtype">void</span> ***ptr = (<span class="keywordtype">void</span> ***)inptr;
<a name="l00297"></a>00297
<a name="l00298"></a>00298 <span class="keywordflow">if</span> (ptr && ptr[0])
<a name="l00299"></a>00299 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(ptr[0][0]);
<a name="l00300"></a>00300 <span class="keywordflow">if</span> (ptr)
<a name="l00301"></a>00301 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(ptr[0]);
<a name="l00302"></a>00302 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(ptr);
<a name="l00303"></a>00303 }
<a name="l00304"></a>00304
<a name="l00305"></a>00305
<a name="l00306"></a>00306 <span class="keywordtype">void</span> ****
<a name="l00307"></a><a class="code" href="ckd__alloc_8h.html#a7881d3a852b82336f644f504453bb839">00307</a> <a class="code" href="ckd__alloc_8h.html#a7881d3a852b82336f644f504453bb839" title="Allocate a 34D array and return ptr to it.">__ckd_calloc_4d__</a>(<span class="keywordtype">size_t</span> d1,
<a name="l00308"></a>00308 <span class="keywordtype">size_t</span> d2,
<a name="l00309"></a>00309 <span class="keywordtype">size_t</span> d3,
<a name="l00310"></a>00310 <span class="keywordtype">size_t</span> d4,
<a name="l00311"></a>00311 <span class="keywordtype">size_t</span> elem_size,
<a name="l00312"></a>00312 <span class="keywordtype">char</span> *file,
<a name="l00313"></a>00313 <span class="keywordtype">int</span> line)
<a name="l00314"></a>00314 {
<a name="l00315"></a>00315 <span class="keywordtype">void</span> *store;
<a name="l00316"></a>00316 <span class="keywordtype">void</span> **tmp1;
<a name="l00317"></a>00317 <span class="keywordtype">void</span> ***tmp2;
<a name="l00318"></a>00318 <span class="keywordtype">void</span> ****out;
<a name="l00319"></a>00319 <span class="keywordtype">size_t</span> i, j;
<a name="l00320"></a>00320
<a name="l00321"></a>00321 store = calloc(d1 * d2 * d3 * d4, elem_size);
<a name="l00322"></a>00322 <span class="keywordflow">if</span> (store == NULL) {
<a name="l00323"></a>00323 <a class="code" href="err_8h.html#a1a4495946ab2449d61108fe829a94613" title="Exit with non-zero status after error message.">E_FATAL</a>(<span class="stringliteral">"ckd_calloc_4d failed for caller at %s(%d) at %s(%d)\n"</span>,
<a name="l00324"></a>00324 file, line, __FILE__, __LINE__);
<a name="l00325"></a>00325 }
<a name="l00326"></a>00326
<a name="l00327"></a>00327 tmp1 = calloc(d1 * d2 * d3, <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> *));
<a name="l00328"></a>00328 <span class="keywordflow">if</span> (tmp1 == NULL) {
<a name="l00329"></a>00329 <a class="code" href="err_8h.html#a1a4495946ab2449d61108fe829a94613" title="Exit with non-zero status after error message.">E_FATAL</a>(<span class="stringliteral">"ckd_calloc_4d failed for caller at %s(%d) at %s(%d)\n"</span>,
<a name="l00330"></a>00330 file, line, __FILE__, __LINE__);
<a name="l00331"></a>00331 }
<a name="l00332"></a>00332
<a name="l00333"></a>00333 tmp2 = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(d1 * d2, <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> **));
<a name="l00334"></a>00334 <span class="keywordflow">if</span> (tmp2 == NULL) {
<a name="l00335"></a>00335 <a class="code" href="err_8h.html#a1a4495946ab2449d61108fe829a94613" title="Exit with non-zero status after error message.">E_FATAL</a>(<span class="stringliteral">"ckd_calloc_4d failed for caller at %s(%d) at %s(%d)\n"</span>,
<a name="l00336"></a>00336 file, line, __FILE__, __LINE__);
<a name="l00337"></a>00337 }
<a name="l00338"></a>00338
<a name="l00339"></a>00339 out = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(d1, <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> ***));
<a name="l00340"></a>00340 <span class="keywordflow">if</span> (out == NULL) {
<a name="l00341"></a>00341 <a class="code" href="err_8h.html#a1a4495946ab2449d61108fe829a94613" title="Exit with non-zero status after error message.">E_FATAL</a>(<span class="stringliteral">"ckd_calloc_4d failed for caller at %s(%d) at %s(%d)\n"</span>,
<a name="l00342"></a>00342 file, line, __FILE__, __LINE__);
<a name="l00343"></a>00343 }
<a name="l00344"></a>00344
<a name="l00345"></a>00345 <span class="keywordflow">for</span> (i = 0, j = 0; i < d1*d2*d3; i++, j += d4) {
<a name="l00346"></a>00346 tmp1[i] = &((<span class="keywordtype">char</span> *)store)[j*elem_size];
<a name="l00347"></a>00347 }
<a name="l00348"></a>00348
<a name="l00349"></a>00349 <span class="keywordflow">for</span> (i = 0, j = 0; i < d1*d2; i++, j += d3) {
<a name="l00350"></a>00350 tmp2[i] = &tmp1[j];
<a name="l00351"></a>00351 }
<a name="l00352"></a>00352
<a name="l00353"></a>00353 <span class="keywordflow">for</span> (i = 0, j = 0; i < d1; i++, j += d2) {
<a name="l00354"></a>00354 out[i] = &tmp2[j];
<a name="l00355"></a>00355 }
<a name="l00356"></a>00356
<a name="l00357"></a>00357 <span class="keywordflow">return</span> out;
<a name="l00358"></a>00358 }
<a name="l00359"></a>00359
<a name="l00360"></a>00360 <span class="keywordtype">void</span>
<a name="l00361"></a><a class="code" href="ckd__alloc_8h.html#a2fb0211c16bcbd89d932f383e28b9a7a">00361</a> <a class="code" href="ckd__alloc_8h.html#a2fb0211c16bcbd89d932f383e28b9a7a" title="Free a 4-D array (ptr) previously allocated by ckd_calloc_4d.">ckd_free_4d</a>(<span class="keywordtype">void</span> *inptr)
<a name="l00362"></a>00362 {
<a name="l00363"></a>00363 <span class="keywordtype">void</span> ****ptr = (<span class="keywordtype">void</span> ****)inptr;
<a name="l00364"></a>00364 <span class="keywordflow">if</span> (ptr == NULL)
<a name="l00365"></a>00365 <span class="keywordflow">return</span>;
<a name="l00366"></a>00366 <span class="comment">/* free the underlying store */</span>
<a name="l00367"></a>00367 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(ptr[0][0][0]);
<a name="l00368"></a>00368
<a name="l00369"></a>00369 <span class="comment">/* free the access overhead */</span>
<a name="l00370"></a>00370 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(ptr[0][0]);
<a name="l00371"></a>00371 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(ptr[0]);
<a name="l00372"></a>00372 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(ptr);
<a name="l00373"></a>00373 }
<a name="l00374"></a>00374
<a name="l00375"></a>00375 <span class="comment">/* Layers a 3d array access structure over a preallocated storage area */</span>
<a name="l00376"></a>00376 <span class="keywordtype">void</span> *
<a name="l00377"></a><a class="code" href="ckd__alloc_8h.html#af9a3ef2d363ee6a53429427d1d9327a6">00377</a> <a class="code" href="ckd__alloc_8h.html#af9a3ef2d363ee6a53429427d1d9327a6" title="Overlay a 3-D array over a previously allocated storage area.">__ckd_alloc_3d_ptr</a>(<span class="keywordtype">size_t</span> d1,
<a name="l00378"></a>00378 <span class="keywordtype">size_t</span> d2,
<a name="l00379"></a>00379 <span class="keywordtype">size_t</span> d3,
<a name="l00380"></a>00380 <span class="keywordtype">void</span> *store,
<a name="l00381"></a>00381 <span class="keywordtype">size_t</span> elem_size,
<a name="l00382"></a>00382 <span class="keywordtype">char</span> *file,
<a name="l00383"></a>00383 <span class="keywordtype">int</span> line)
<a name="l00384"></a>00384 {
<a name="l00385"></a>00385 <span class="keywordtype">void</span> **tmp1;
<a name="l00386"></a>00386 <span class="keywordtype">void</span> ***out;
<a name="l00387"></a>00387 <span class="keywordtype">size_t</span> i, j;
<a name="l00388"></a>00388
<a name="l00389"></a>00389 tmp1 = __ckd_calloc__(d1 * d2, <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> *), file, line);
<a name="l00390"></a>00390
<a name="l00391"></a>00391 out = __ckd_calloc__(d1, <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> **), file, line);
<a name="l00392"></a>00392
<a name="l00393"></a>00393 <span class="keywordflow">for</span> (i = 0, j = 0; i < d1*d2; i++, j += d3) {
<a name="l00394"></a>00394 tmp1[i] = &((<span class="keywordtype">char</span> *)store)[j*elem_size];
<a name="l00395"></a>00395 }
<a name="l00396"></a>00396
<a name="l00397"></a>00397 <span class="keywordflow">for</span> (i = 0, j = 0; i < d1; i++, j += d2) {
<a name="l00398"></a>00398 out[i] = &tmp1[j];
<a name="l00399"></a>00399 }
<a name="l00400"></a>00400
<a name="l00401"></a>00401 <span class="keywordflow">return</span> out;
<a name="l00402"></a>00402 }
<a name="l00403"></a>00403
<a name="l00404"></a>00404 <span class="keywordtype">void</span> *
<a name="l00405"></a><a class="code" href="ckd__alloc_8h.html#a965f553ee64bbfbeda048d43393ae04b">00405</a> <a class="code" href="ckd__alloc_8h.html#a965f553ee64bbfbeda048d43393ae04b" title="Overlay a s-D array over a previously allocated storage area.">__ckd_alloc_2d_ptr</a>(<span class="keywordtype">size_t</span> d1,
<a name="l00406"></a>00406 <span class="keywordtype">size_t</span> d2,
<a name="l00407"></a>00407 <span class="keywordtype">void</span> *store,
<a name="l00408"></a>00408 <span class="keywordtype">size_t</span> elem_size,
<a name="l00409"></a>00409 <span class="keywordtype">char</span> *file,
<a name="l00410"></a>00410 <span class="keywordtype">int</span> line)
<a name="l00411"></a>00411 {
<a name="l00412"></a>00412 <span class="keywordtype">void</span> **out;
<a name="l00413"></a>00413 <span class="keywordtype">size_t</span> i, j;
<a name="l00414"></a>00414
<a name="l00415"></a>00415 out = __ckd_calloc__(d1, <span class="keyword">sizeof</span>(<span class="keywordtype">void</span> *), file, line);
<a name="l00416"></a>00416
<a name="l00417"></a>00417 <span class="keywordflow">for</span> (i = 0, j = 0; i < d1; i++, j += d2) {
<a name="l00418"></a>00418 out[i] = &((<span class="keywordtype">char</span> *)store)[j*elem_size];
<a name="l00419"></a>00419 }
<a name="l00420"></a>00420
<a name="l00421"></a>00421 <span class="keywordflow">return</span> out;
<a name="l00422"></a>00422 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>ckd_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
>
73
