<!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/glist.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('glist_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/util/glist.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"> * glist.h -- Module for maintaining a generic, linear linked-list structure.</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: glist.c,v $</span>
<a name="l00049"></a>00049 <span class="comment"> * Revision 1.8 2005/06/22 03:02:51 arthchan2003</span>
<a name="l00050"></a>00050 <span class="comment"> * 1, Fixed doxygen documentation, 2, add 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"> * 09-Mar-1999 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University</span>
<a name="l00057"></a>00057 <span class="comment"> * Added glist_chkdup_*().</span>
<a name="l00058"></a>00058 <span class="comment"> * </span>
<a name="l00059"></a>00059 <span class="comment"> * 13-Feb-1999 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon University</span>
<a name="l00060"></a>00060 <span class="comment"> * Created from earlier version.</span>
<a name="l00061"></a>00061 <span class="comment"> */</span>
<a name="l00062"></a>00062
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="preprocessor">#include <stdio.h></span>
<a name="l00065"></a>00065 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00066"></a>00066 <span class="preprocessor">#include <string.h></span>
<a name="l00067"></a>00067 <span class="preprocessor">#include <assert.h></span>
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="preprocessor">#include "sphinxbase/glist.h"</span>
<a name="l00070"></a>00070 <span class="preprocessor">#include "sphinxbase/ckd_alloc.h"</span>
<a name="l00071"></a>00071
<a name="l00072"></a>00072
<a name="l00073"></a>00073 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>
<a name="l00074"></a><a class="code" href="glist_8h.html#a77a9c20b7df5a289477af405ab778377">00074</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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> g, <span class="keywordtype">void</span> *ptr)
<a name="l00075"></a>00075 {
<a name="l00076"></a>00076 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00077"></a>00077
<a name="l00078"></a>00078 gn = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *) <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a>));
<a name="l00079"></a>00079 gn->data.ptr = ptr;
<a name="l00080"></a>00080 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = g;
<a name="l00081"></a>00081 <span class="keywordflow">return</span> ((<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>) gn); <span class="comment">/* Return the new head of the list */</span>
<a name="l00082"></a>00082 }
<a name="l00083"></a>00083
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>
<a name="l00086"></a><a class="code" href="glist_8h.html#a28adfcc24a784aaed1a0b3c4c4de4c42">00086</a> <a class="code" href="glist_8h.html#a28adfcc24a784aaed1a0b3c4c4de4c42" title="Create and prepend a new list node containing an integer.">glist_add_int32</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> g, int32 val)
<a name="l00087"></a>00087 {
<a name="l00088"></a>00088 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00089"></a>00089
<a name="l00090"></a>00090 gn = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *) <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a>));
<a name="l00091"></a>00091 gn->data.i = (long)val;
<a name="l00092"></a>00092 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = g;
<a name="l00093"></a>00093 <span class="keywordflow">return</span> ((<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>) gn); <span class="comment">/* Return the new head of the list */</span>
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>
<a name="l00098"></a><a class="code" href="glist_8h.html#aeb741d435322f34df5e5d3a99abf00de">00098</a> <a class="code" href="glist_8h.html#aeb741d435322f34df5e5d3a99abf00de" title="Create and prepend a new list node containing an unsigned integer.">glist_add_uint32</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> g, uint32 val)
<a name="l00099"></a>00099 {
<a name="l00100"></a>00100 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00101"></a>00101
<a name="l00102"></a>00102 gn = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *) <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a>));
<a name="l00103"></a>00103 gn->data.ui = (<span class="keywordtype">unsigned</span> long)val;
<a name="l00104"></a>00104 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = g;
<a name="l00105"></a>00105 <span class="keywordflow">return</span> ((<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>) gn); <span class="comment">/* Return the new head of the list */</span>
<a name="l00106"></a>00106 }
<a name="l00107"></a>00107
<a name="l00108"></a>00108
<a name="l00109"></a>00109 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>
<a name="l00110"></a><a class="code" href="glist_8h.html#a4fc4db2fbebd7b659554227d411f6737">00110</a> <a class="code" href="glist_8h.html#a4fc4db2fbebd7b659554227d411f6737" title="Create and prepend a new list node containing a single-precision float.">glist_add_float32</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> g, float32 val)
<a name="l00111"></a>00111 {
<a name="l00112"></a>00112 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00113"></a>00113
<a name="l00114"></a>00114 gn = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *) <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a>));
<a name="l00115"></a>00115 gn->data.fl = (double)val;
<a name="l00116"></a>00116 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = g;
<a name="l00117"></a>00117 <span class="keywordflow">return</span> ((<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>) gn); <span class="comment">/* Return the new head of the list */</span>
<a name="l00118"></a>00118 }
<a name="l00119"></a>00119
<a name="l00120"></a>00120
<a name="l00121"></a>00121 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>
<a name="l00122"></a><a class="code" href="glist_8h.html#a5bdd11639ef5846abb7ceb6caf059f4e">00122</a> <a class="code" href="glist_8h.html#a5bdd11639ef5846abb7ceb6caf059f4e" title="Create and prepend a new list node containing a double-precision float.">glist_add_float64</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> g, float64 val)
<a name="l00123"></a>00123 {
<a name="l00124"></a>00124 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00125"></a>00125
<a name="l00126"></a>00126 gn = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *) <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a>));
<a name="l00127"></a>00127 gn->data.fl = (double)val;
<a name="l00128"></a>00128 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = g;
<a name="l00129"></a>00129 <span class="keywordflow">return</span> ((<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>) gn); <span class="comment">/* Return the new head of the list */</span>
<a name="l00130"></a>00130 }
<a name="l00131"></a>00131
<a name="l00132"></a>00132 <span class="keywordtype">void</span>
<a name="l00133"></a><a class="code" href="glist_8h.html#a45380e15d2c33afc554fd60a8828580c">00133</a> <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> g)
<a name="l00134"></a>00134 {
<a name="l00135"></a>00135 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00136"></a>00136
<a name="l00137"></a>00137 <span class="keywordflow">while</span> (g) {
<a name="l00138"></a>00138 gn = g;
<a name="l00139"></a>00139 g = gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>;
<a name="l00140"></a>00140 <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> *) gn);
<a name="l00141"></a>00141 }
<a name="l00142"></a>00142 }
<a name="l00143"></a>00143
<a name="l00144"></a>00144 int32
<a name="l00145"></a><a class="code" href="glist_8h.html#aeb046e39c540d2f5f792119ea0d24c48">00145</a> <a class="code" href="glist_8h.html#aeb046e39c540d2f5f792119ea0d24c48" title="Count the number of element in a given link list.">glist_count</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> g)
<a name="l00146"></a>00146 {
<a name="l00147"></a>00147 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00148"></a>00148 int32 n;
<a name="l00149"></a>00149
<a name="l00150"></a>00150 <span class="keywordflow">for</span> (gn = g, n = 0; gn; gn = gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>, n++);
<a name="l00151"></a>00151 <span class="keywordflow">return</span> n;
<a name="l00152"></a>00152 }
<a name="l00153"></a>00153
<a name="l00154"></a>00154
<a name="l00155"></a>00155 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *
<a name="l00156"></a><a class="code" href="glist_8h.html#a6921d6b8b11cb9e05fadeaa091e89234">00156</a> <a class="code" href="glist_8h.html#a6921d6b8b11cb9e05fadeaa091e89234" title="Return the last node in the given list.">glist_tail</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> g)
<a name="l00157"></a>00157 {
<a name="l00158"></a>00158 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn;
<a name="l00159"></a>00159
<a name="l00160"></a>00160 <span class="keywordflow">if</span> (!g)
<a name="l00161"></a>00161 <span class="keywordflow">return</span> NULL;
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="keywordflow">for</span> (gn = g; gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>; gn = gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>);
<a name="l00164"></a>00164 <span class="keywordflow">return</span> gn;
<a name="l00165"></a>00165 }
<a name="l00166"></a>00166
<a name="l00167"></a>00167
<a name="l00168"></a>00168 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a>
<a name="l00169"></a><a class="code" href="glist_8h.html#a399a2a093c6c4ce1012762e4c25c8185">00169</a> <a class="code" href="glist_8h.html#a399a2a093c6c4ce1012762e4c25c8185" title="Reverse the order of the given glist.">glist_reverse</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> g)
<a name="l00170"></a>00170 {
<a name="l00171"></a>00171 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *gn, *nextgn;
<a name="l00172"></a>00172 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *rev;
<a name="l00173"></a>00173
<a name="l00174"></a>00174 rev = NULL;
<a name="l00175"></a>00175 <span class="keywordflow">for</span> (gn = g; gn; gn = nextgn) {
<a name="l00176"></a>00176 nextgn = gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>;
<a name="l00177"></a>00177
<a name="l00178"></a>00178 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = rev;
<a name="l00179"></a>00179 rev = gn;
<a name="l00180"></a>00180 }
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keywordflow">return</span> rev;
<a name="l00183"></a>00183 }
<a name="l00184"></a>00184
<a name="l00185"></a>00185
<a name="l00186"></a>00186 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *
<a name="l00187"></a><a class="code" href="glist_8h.html#a2d641da6b349c1c939e3b954382513ba">00187</a> <a class="code" href="glist_8h.html#a2d641da6b349c1c939e3b954382513ba" title="Create and insert a new list node, with the given user-defined data, after the given generic node gn...">glist_insert_ptr</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> * gn, <span class="keywordtype">void</span> *ptr)
<a name="l00188"></a>00188 {
<a name="l00189"></a>00189 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *newgn;
<a name="l00190"></a>00190
<a name="l00191"></a>00191 newgn = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *) <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a>));
<a name="l00192"></a>00192 newgn->data.ptr = ptr;
<a name="l00193"></a>00193 newgn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>;
<a name="l00194"></a>00194 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = newgn;
<a name="l00195"></a>00195
<a name="l00196"></a>00196 <span class="keywordflow">return</span> newgn;
<a name="l00197"></a>00197 }
<a name="l00198"></a>00198
<a name="l00199"></a>00199
<a name="l00200"></a>00200 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *
<a name="l00201"></a><a class="code" href="glist_8h.html#a327b6478ee05ac17e3c3b3189579413e">00201</a> <a class="code" href="glist_8h.html#a327b6478ee05ac17e3c3b3189579413e" title="Create and insert a new list node containing an integer.">glist_insert_int32</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> * gn, int32 val)
<a name="l00202"></a>00202 {
<a name="l00203"></a>00203 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *newgn;
<a name="l00204"></a>00204
<a name="l00205"></a>00205 newgn = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *) <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a>));
<a name="l00206"></a>00206 newgn->data.i = val;
<a name="l00207"></a>00207 newgn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>;
<a name="l00208"></a>00208 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = newgn;
<a name="l00209"></a>00209
<a name="l00210"></a>00210 <span class="keywordflow">return</span> newgn;
<a name="l00211"></a>00211 }
<a name="l00212"></a>00212
<a name="l00213"></a>00213
<a name="l00214"></a>00214 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *
<a name="l00215"></a><a class="code" href="glist_8h.html#ab7e58ee641d3648f047eef70a20a4647">00215</a> <a class="code" href="glist_8h.html#ab7e58ee641d3648f047eef70a20a4647" title="Create and insert a new list node containing an unsigned integer.">glist_insert_uint32</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> * gn, uint32 val)
<a name="l00216"></a>00216 {
<a name="l00217"></a>00217 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *newgn;
<a name="l00218"></a>00218
<a name="l00219"></a>00219 newgn = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *) <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a>));
<a name="l00220"></a>00220 newgn->data.ui = val;
<a name="l00221"></a>00221 newgn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>;
<a name="l00222"></a>00222
<a name="l00223"></a>00223 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = newgn;
<a name="l00224"></a>00224
<a name="l00225"></a>00225 <span class="keywordflow">return</span> newgn;
<a name="l00226"></a>00226 }
<a name="l00227"></a>00227
<a name="l00228"></a>00228
<a name="l00229"></a>00229 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *
<a name="l00230"></a><a class="code" href="glist_8h.html#aff08aed022168872fc9d30cd299df2ce">00230</a> <a class="code" href="glist_8h.html#aff08aed022168872fc9d30cd299df2ce" title="Create and insert a new list node containing a single-precision float.">glist_insert_float32</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> * gn, float32 val)
<a name="l00231"></a>00231 {
<a name="l00232"></a>00232 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *newgn;
<a name="l00233"></a>00233
<a name="l00234"></a>00234 newgn = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *) <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a>));
<a name="l00235"></a>00235 newgn->data.fl = (double)val;
<a name="l00236"></a>00236 newgn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>;
<a name="l00237"></a>00237 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = newgn;
<a name="l00238"></a>00238
<a name="l00239"></a>00239 <span class="keywordflow">return</span> newgn;
<a name="l00240"></a>00240 }
<a name="l00241"></a>00241
<a name="l00242"></a>00242
<a name="l00243"></a>00243 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *
<a name="l00244"></a><a class="code" href="glist_8h.html#a97a682e38319dd8f67765732467110f9">00244</a> <a class="code" href="glist_8h.html#a97a682e38319dd8f67765732467110f9" title="Create and insert a new list node containing a double-precision float.">glist_insert_float64</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> * gn, float64 val)
<a name="l00245"></a>00245 {
<a name="l00246"></a>00246 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *newgn;
<a name="l00247"></a>00247
<a name="l00248"></a>00248 newgn = (<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *) <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>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a>));
<a name="l00249"></a>00249 newgn->data.fl = (double)val;
<a name="l00250"></a>00250 newgn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>;
<a name="l00251"></a>00251 gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = newgn;
<a name="l00252"></a>00252
<a name="l00253"></a>00253 <span class="keywordflow">return</span> newgn;
<a name="l00254"></a>00254 }
<a name="l00255"></a>00255
<a name="l00256"></a>00256 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *
<a name="l00257"></a><a class="code" href="glist_8h.html#a68b51aea4de463b284a19668a713d502">00257</a> <a class="code" href="glist_8h.html#a68b51aea4de463b284a19668a713d502" title="Free the given node, gn, of a glist, pred being its predecessor in the list.">gnode_free</a>(<a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> * gn, <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> * pred)
<a name="l00258"></a>00258 {
<a name="l00259"></a>00259 <a class="code" href="structgnode__s.html" title="A node in a generic list.">gnode_t</a> *next;
<a name="l00260"></a>00260
<a name="l00261"></a>00261 next = gn-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a>;
<a name="l00262"></a>00262 <span class="keywordflow">if</span> (pred) {
<a name="l00263"></a>00263 assert(pred-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> == gn);
<a name="l00264"></a>00264
<a name="l00265"></a>00265 pred-><a class="code" href="structgnode__s.html#a24798080e363f9ecf9f348022c582757" title="See prim_type.h.">next</a> = next;
<a name="l00266"></a>00266 }
<a name="l00267"></a>00267
<a name="l00268"></a>00268 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>((<span class="keywordtype">char</span> *) gn);
<a name="l00269"></a>00269
<a name="l00270"></a>00270 <span class="keywordflow">return</span> next;
<a name="l00271"></a>00271 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>glist.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
>
195
