<!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/huff_code.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('huff__code_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/util/huff_code.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) 2009 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 <string.h></span>
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="preprocessor">#include "sphinxbase/huff_code.h"</span>
<a name="l00041"></a>00041 <span class="preprocessor">#include "sphinxbase/ckd_alloc.h"</span>
<a name="l00042"></a>00042 <span class="preprocessor">#include "sphinxbase/hash_table.h"</span>
<a name="l00043"></a>00043 <span class="preprocessor">#include "sphinxbase/byteorder.h"</span>
<a name="l00044"></a>00044 <span class="preprocessor">#include "sphinxbase/heap.h"</span>
<a name="l00045"></a>00045 <span class="preprocessor">#include "sphinxbase/pio.h"</span>
<a name="l00046"></a>00046 <span class="preprocessor">#include "sphinxbase/err.h"</span>
<a name="l00047"></a>00047
<a name="l00048"></a><a class="code" href="structhuff__node__s.html">00048</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structhuff__node__s.html">huff_node_s</a> {
<a name="l00049"></a>00049 <span class="keywordtype">int</span> nbits;
<a name="l00050"></a>00050 <span class="keyword">struct </span><a class="code" href="structhuff__node__s.html">huff_node_s</a> *l;
<a name="l00051"></a>00051 <span class="keyword">union </span>{
<a name="l00052"></a>00052 int32 ival;
<a name="l00053"></a>00053 <span class="keywordtype">char</span> *sval;
<a name="l00054"></a>00054 <span class="keyword">struct </span><a class="code" href="structhuff__node__s.html">huff_node_s</a> *r;
<a name="l00055"></a>00055 } r;
<a name="l00056"></a>00056 } <a class="code" href="structhuff__node__s.html">huff_node_t</a>;
<a name="l00057"></a>00057
<a name="l00058"></a><a class="code" href="structhuff__codeword__s.html">00058</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structhuff__codeword__s.html">huff_codeword_s</a> {
<a name="l00059"></a>00059 <span class="keyword">union </span>{
<a name="l00060"></a>00060 int32 ival;
<a name="l00061"></a>00061 <span class="keywordtype">char</span> *sval;
<a name="l00062"></a>00062 } r;
<a name="l00063"></a>00063 uint32 nbits, codeword;
<a name="l00064"></a>00064 } <a class="code" href="structhuff__codeword__s.html">huff_codeword_t</a>;
<a name="l00065"></a>00065
<a name="l00066"></a>00066 <span class="keyword">enum</span> {
<a name="l00067"></a>00067 HUFF_CODE_INT,
<a name="l00068"></a>00068 HUFF_CODE_STR
<a name="l00069"></a>00069 };
<a name="l00070"></a>00070
<a name="l00071"></a><a class="code" href="structhuff__code__s.html">00071</a> <span class="keyword">struct </span><a class="code" href="structhuff__code__s.html">huff_code_s</a> {
<a name="l00072"></a>00072 int16 refcount;
<a name="l00073"></a>00073 uint8 maxbits;
<a name="l00074"></a>00074 uint8 type;
<a name="l00075"></a>00075 uint32 *firstcode;
<a name="l00076"></a>00076 uint32 *numl;
<a name="l00077"></a>00077 <a class="code" href="structhuff__codeword__s.html">huff_codeword_t</a> **syms;
<a name="l00078"></a>00078 <a class="code" href="structhash__table__t.html">hash_table_t</a> *codewords;
<a name="l00079"></a>00079 FILE *fh;
<a name="l00080"></a>00080 <a class="code" href="structbit__encode__s.html">bit_encode_t</a> *be;
<a name="l00081"></a>00081 <span class="keywordtype">int</span> boff;
<a name="l00082"></a>00082 };
<a name="l00083"></a>00083
<a name="l00084"></a>00084 <span class="keyword">static</span> <a class="code" href="structhuff__node__s.html">huff_node_t</a> *
<a name="l00085"></a>00085 huff_node_new_int(int32 val)
<a name="l00086"></a>00086 {
<a name="l00087"></a>00087 <a class="code" href="structhuff__node__s.html">huff_node_t</a> *hn = <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>(*hn));
<a name="l00088"></a>00088 hn->r.ival = val;
<a name="l00089"></a>00089 <span class="keywordflow">return</span> hn;
<a name="l00090"></a>00090 }
<a name="l00091"></a>00091
<a name="l00092"></a>00092 <span class="keyword">static</span> <a class="code" href="structhuff__node__s.html">huff_node_t</a> *
<a name="l00093"></a>00093 huff_node_new_str(<span class="keywordtype">char</span> <span class="keyword">const</span> *val)
<a name="l00094"></a>00094 {
<a name="l00095"></a>00095 <a class="code" href="structhuff__node__s.html">huff_node_t</a> *hn = <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>(*hn));
<a name="l00096"></a>00096 hn->r.sval = <a class="code" href="ckd__alloc_8h.html#ad313f92478859f9e4ea99d0f6e78c393" title="Macro for __ckd_salloc__.">ckd_salloc</a>(val);
<a name="l00097"></a>00097 <span class="keywordflow">return</span> hn;
<a name="l00098"></a>00098 }
<a name="l00099"></a>00099
<a name="l00100"></a>00100 <span class="keyword">static</span> <a class="code" href="structhuff__node__s.html">huff_node_t</a> *
<a name="l00101"></a>00101 huff_node_new_parent(<a class="code" href="structhuff__node__s.html">huff_node_t</a> *l, <a class="code" href="structhuff__node__s.html">huff_node_t</a> *r)
<a name="l00102"></a>00102 {
<a name="l00103"></a>00103 <a class="code" href="structhuff__node__s.html">huff_node_t</a> *hn = <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>(*hn));
<a name="l00104"></a>00104 hn->l = l;
<a name="l00105"></a>00105 hn->r.r = r;
<a name="l00106"></a>00106 <span class="comment">/* Propagate maximum bit length. */</span>
<a name="l00107"></a>00107 <span class="keywordflow">if</span> (r->nbits > l->nbits)
<a name="l00108"></a>00108 hn->nbits = r->nbits + 1;
<a name="l00109"></a>00109 <span class="keywordflow">else</span>
<a name="l00110"></a>00110 hn->nbits = l->nbits + 1;
<a name="l00111"></a>00111 <span class="keywordflow">return</span> hn;
<a name="l00112"></a>00112 }
<a name="l00113"></a>00113
<a name="l00114"></a>00114 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00115"></a>00115 huff_node_free_int(<a class="code" href="structhuff__node__s.html">huff_node_t</a> *root)
<a name="l00116"></a>00116 {
<a name="l00117"></a>00117 <span class="keywordflow">if</span> (root->l) {
<a name="l00118"></a>00118 huff_node_free_int(root->l);
<a name="l00119"></a>00119 huff_node_free_int(root->r.r);
<a name="l00120"></a>00120 }
<a name="l00121"></a>00121 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(root);
<a name="l00122"></a>00122 }
<a name="l00123"></a>00123
<a name="l00124"></a>00124 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00125"></a>00125 huff_node_free_str(<a class="code" href="structhuff__node__s.html">huff_node_t</a> *root, <span class="keywordtype">int</span> freestr)
<a name="l00126"></a>00126 {
<a name="l00127"></a>00127 <span class="keywordflow">if</span> (root->l) {
<a name="l00128"></a>00128 huff_node_free_str(root->l, freestr);
<a name="l00129"></a>00129 huff_node_free_str(root->r.r, freestr);
<a name="l00130"></a>00130 }
<a name="l00131"></a>00131 <span class="keywordflow">else</span> {
<a name="l00132"></a>00132 <span class="keywordflow">if</span> (freestr)
<a name="l00133"></a>00133 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(root->r.sval);
<a name="l00134"></a>00134 }
<a name="l00135"></a>00135 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(root);
<a name="l00136"></a>00136 }
<a name="l00137"></a>00137
<a name="l00138"></a>00138 <span class="keyword">static</span> <a class="code" href="structhuff__node__s.html">huff_node_t</a> *
<a name="l00139"></a>00139 huff_code_build_tree(<a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *q)
<a name="l00140"></a>00140 {
<a name="l00141"></a>00141 <a class="code" href="structhuff__node__s.html">huff_node_t</a> *root = NULL;
<a name="l00142"></a>00142 int32 rf;
<a name="l00143"></a>00143
<a name="l00144"></a>00144 <span class="keywordflow">while</span> (<a class="code" href="heap_8h.html#a1c713d67123e96974505edfa4346cb0f" title="Return the number of items in the heap.">heap_size</a>(q) > 1) {
<a name="l00145"></a>00145 <a class="code" href="structhuff__node__s.html">huff_node_t</a> *l, *r, *p;
<a name="l00146"></a>00146 int32 lf, rf;
<a name="l00147"></a>00147
<a name="l00148"></a>00148 <a class="code" href="heap_8h.html#a387c8913b4c62ad1a5c4702a4e6dbdbf" title="Like heap_top but also pop the top item off the heap.">heap_pop</a>(q, (<span class="keywordtype">void</span> *)&l, &lf);
<a name="l00149"></a>00149 <a class="code" href="heap_8h.html#a387c8913b4c62ad1a5c4702a4e6dbdbf" title="Like heap_top but also pop the top item off the heap.">heap_pop</a>(q, (<span class="keywordtype">void</span> *)&r, &rf);
<a name="l00150"></a>00150 p = huff_node_new_parent(l, r);
<a name="l00151"></a>00151 <a class="code" href="heap_8h.html#a64bcded2de5086c5d246ff760caa74a3" title="Insert a new item into the given heap.">heap_insert</a>(q, p, lf + rf);
<a name="l00152"></a>00152 }
<a name="l00153"></a>00153 <a class="code" href="heap_8h.html#a387c8913b4c62ad1a5c4702a4e6dbdbf" title="Like heap_top but also pop the top item off the heap.">heap_pop</a>(q, (<span class="keywordtype">void</span> **)&root, &rf);
<a name="l00154"></a>00154 <span class="keywordflow">return</span> root;
<a name="l00155"></a>00155 }
<a name="l00156"></a>00156
<a name="l00157"></a>00157 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00158"></a>00158 huff_code_canonicalize(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc, <a class="code" href="structhuff__node__s.html">huff_node_t</a> *root)
<a name="l00159"></a>00159 {
<a name="l00160"></a>00160 <a class="code" href="structgnode__s.html" title="A node in a generic list.">glist_t</a> agenda;
<a name="l00161"></a>00161 uint32 *nextcode;
<a name="l00162"></a>00162 <span class="keywordtype">int</span> i, ncw;
<a name="l00163"></a>00163
<a name="l00164"></a>00164 hc->firstcode = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(hc->maxbits+1, <span class="keyword">sizeof</span>(*hc->firstcode));
<a name="l00165"></a>00165 hc->syms = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(hc->maxbits+1, <span class="keyword">sizeof</span>(*hc->syms));
<a name="l00166"></a>00166 hc->numl = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(hc->maxbits+1, <span class="keyword">sizeof</span>(*nextcode));
<a name="l00167"></a>00167 nextcode = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(hc->maxbits+1, <span class="keyword">sizeof</span>(*nextcode));
<a name="l00168"></a>00168
<a name="l00169"></a>00169 <span class="comment">/* Traverse the tree, annotating it with the actual bit</span>
<a name="l00170"></a>00170 <span class="comment"> * lengths, and histogramming them in numl. */</span>
<a name="l00171"></a>00171 root->nbits = 0;
<a name="l00172"></a>00172 ncw = 0;
<a name="l00173"></a>00173 agenda = <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>(NULL, root);
<a name="l00174"></a>00174 <span class="keywordflow">while</span> (agenda) {
<a name="l00175"></a>00175 <a class="code" href="structhuff__node__s.html">huff_node_t</a> *node = <a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(agenda);
<a name="l00176"></a>00176 agenda = <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>(agenda, NULL);
<a name="l00177"></a>00177 <span class="keywordflow">if</span> (node->l) {
<a name="l00178"></a>00178 node->l->nbits = node->nbits + 1;
<a name="l00179"></a>00179 agenda = <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>(agenda, node->l);
<a name="l00180"></a>00180 node->r.r->nbits = node->nbits + 1;
<a name="l00181"></a>00181 agenda = <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>(agenda, node->r.r);
<a name="l00182"></a>00182 }
<a name="l00183"></a>00183 <span class="keywordflow">else</span> {
<a name="l00184"></a>00184 hc->numl[node->nbits]++;
<a name="l00185"></a>00185 ncw++;
<a name="l00186"></a>00186 }
<a name="l00187"></a>00187 }
<a name="l00188"></a>00188 <span class="comment">/* Create starting codes and symbol tables for each bit length. */</span>
<a name="l00189"></a>00189 hc->syms[hc->maxbits] = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(hc->numl[hc->maxbits], <span class="keyword">sizeof</span>(**hc->syms));
<a name="l00190"></a>00190 <span class="keywordflow">for</span> (i = hc->maxbits - 1; i > 0; --i) {
<a name="l00191"></a>00191 hc->firstcode[i] = (hc->firstcode[i+1] + hc->numl[i+1]) / 2;
<a name="l00192"></a>00192 hc->syms[i] = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(hc->numl[i], <span class="keyword">sizeof</span>(**hc->syms));
<a name="l00193"></a>00193 }
<a name="l00194"></a>00194 memcpy(nextcode, hc->firstcode, (hc->maxbits + 1) * <span class="keyword">sizeof</span>(*nextcode));
<a name="l00195"></a>00195 <span class="comment">/* Traverse the tree again to produce the codebook itself. */</span>
<a name="l00196"></a>00196 hc->codewords = <a class="code" href="hash__table_8h.html#a56d93e8c03e066b77377ac6eab50cfae" title="Allocate a new hash table for a given expected size.">hash_table_new</a>(ncw, HASH_CASE_YES);
<a name="l00197"></a>00197 agenda = <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>(NULL, root);
<a name="l00198"></a>00198 <span class="keywordflow">while</span> (agenda) {
<a name="l00199"></a>00199 <a class="code" href="structhuff__node__s.html">huff_node_t</a> *node = <a class="code" href="glist_8h.html#ace56682f14d84cc456c805d26fd86734" title="Head of a list of gnodes.">gnode_ptr</a>(agenda);
<a name="l00200"></a>00200 agenda = <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>(agenda, NULL);
<a name="l00201"></a>00201 <span class="keywordflow">if</span> (node->l) {
<a name="l00202"></a>00202 agenda = <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>(agenda, node->l);
<a name="l00203"></a>00203 agenda = <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>(agenda, node->r.r);
<a name="l00204"></a>00204 }
<a name="l00205"></a>00205 <span class="keywordflow">else</span> {
<a name="l00206"></a>00206 <span class="comment">/* Initialize codebook entry, which also retains symbol pointer. */</span>
<a name="l00207"></a>00207 <a class="code" href="structhuff__codeword__s.html">huff_codeword_t</a> *cw;
<a name="l00208"></a>00208 uint32 codeword = nextcode[node->nbits] & ((1 << node->nbits) - 1);
<a name="l00209"></a>00209 cw = hc->syms[node->nbits] + (codeword - hc->firstcode[node->nbits]);
<a name="l00210"></a>00210 cw->nbits = node->nbits;
<a name="l00211"></a>00211 cw->r.sval = node->r.sval; <span class="comment">/* Will copy ints too... */</span>
<a name="l00212"></a>00212 cw->codeword = codeword;
<a name="l00213"></a>00213 <span class="keywordflow">if</span> (hc->type == HUFF_CODE_INT) {
<a name="l00214"></a>00214 <a class="code" href="hash__table_8h.html#a6f5752fadefe2662adb2c141f1511062" title="Like hash_table_enter, but with an explicitly specified key length, instead of a NULL-terminated, C-style key string.">hash_table_enter_bkey</a>(hc->codewords,
<a name="l00215"></a>00215 (<span class="keywordtype">char</span> <span class="keyword">const</span> *)&cw->r.ival,
<a name="l00216"></a>00216 <span class="keyword">sizeof</span>(cw->r.ival),
<a name="l00217"></a>00217 (<span class="keywordtype">void</span> *)cw);
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219 <span class="keywordflow">else</span> {
<a name="l00220"></a>00220 <a class="code" href="hash__table_8h.html#aebfe63c3869c271b125a8413ee384412" title="Try to add a new entry with given key and associated value to hash table h.">hash_table_enter</a>(hc->codewords, cw->r.sval, (<span class="keywordtype">void</span> *)cw);
<a name="l00221"></a>00221 }
<a name="l00222"></a>00222 ++nextcode[node->nbits];
<a name="l00223"></a>00223 }
<a name="l00224"></a>00224 }
<a name="l00225"></a>00225 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(nextcode);
<a name="l00226"></a>00226 }
<a name="l00227"></a>00227
<a name="l00228"></a>00228 <a class="code" href="structhuff__code__s.html">huff_code_t</a> *
<a name="l00229"></a><a class="code" href="huff__code_8h.html#a278b925caf4f2c93cbb63adc8f77bfa6">00229</a> <a class="code" href="huff__code_8h.html#a278b925caf4f2c93cbb63adc8f77bfa6" title="Create a codebook from 32-bit integer data.">huff_code_build_int</a>(int32 <span class="keyword">const</span> *values, int32 <span class="keyword">const</span> *frequencies, <span class="keywordtype">int</span> nvals)
<a name="l00230"></a>00230 {
<a name="l00231"></a>00231 <a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc;
<a name="l00232"></a>00232 <a class="code" href="structhuff__node__s.html">huff_node_t</a> *root;
<a name="l00233"></a>00233 <a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *q;
<a name="l00234"></a>00234 <span class="keywordtype">int</span> i;
<a name="l00235"></a>00235
<a name="l00236"></a>00236 hc = <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>(*hc));
<a name="l00237"></a>00237 hc->refcount = 1;
<a name="l00238"></a>00238 hc->type = HUFF_CODE_INT;
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="comment">/* Initialize the heap with nodes for each symbol. */</span>
<a name="l00241"></a>00241 q = <a class="code" href="heap_8h.html#a9bc21333ce58caaf58e802d8b0190efd" title="Allocate a new heap and return handle to it.">heap_new</a>();
<a name="l00242"></a>00242 <span class="keywordflow">for</span> (i = 0; i < nvals; ++i) {
<a name="l00243"></a>00243 <a class="code" href="heap_8h.html#a64bcded2de5086c5d246ff760caa74a3" title="Insert a new item into the given heap.">heap_insert</a>(q,
<a name="l00244"></a>00244 huff_node_new_int(values[i]),
<a name="l00245"></a>00245 frequencies[i]);
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247
<a name="l00248"></a>00248 <span class="comment">/* Now build the tree, which gives us codeword lengths. */</span>
<a name="l00249"></a>00249 root = huff_code_build_tree(q);
<a name="l00250"></a>00250 <a class="code" href="heap_8h.html#ab12b1efd6392eb574d2da9c981e7320c" title="Destroy the given heap; free the heap nodes.">heap_destroy</a>(q);
<a name="l00251"></a>00251 <span class="keywordflow">if</span> (root == NULL || root->nbits > 32) {
<a name="l00252"></a>00252 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Huffman trees currently limited to 32 bits\n"</span>);
<a name="l00253"></a>00253 huff_node_free_int(root);
<a name="l00254"></a>00254 <a class="code" href="huff__code_8h.html#ac8678d07a65af1963cc0b3bd8b10d646" title="Release a pointer to a Huffman codec object.">huff_code_free</a>(hc);
<a name="l00255"></a>00255 <span class="keywordflow">return</span> NULL;
<a name="l00256"></a>00256 }
<a name="l00257"></a>00257
<a name="l00258"></a>00258 <span class="comment">/* Build a canonical codebook. */</span>
<a name="l00259"></a>00259 hc->maxbits = root->nbits;
<a name="l00260"></a>00260 huff_code_canonicalize(hc, root);
<a name="l00261"></a>00261
<a name="l00262"></a>00262 <span class="comment">/* Tree no longer needed. */</span>
<a name="l00263"></a>00263 huff_node_free_int(root);
<a name="l00264"></a>00264
<a name="l00265"></a>00265 <span class="keywordflow">return</span> hc;
<a name="l00266"></a>00266 }
<a name="l00267"></a>00267
<a name="l00268"></a>00268 <a class="code" href="structhuff__code__s.html">huff_code_t</a> *
<a name="l00269"></a><a class="code" href="huff__code_8h.html#af5d0c85a2ad206c277ecde2a085af790">00269</a> <a class="code" href="huff__code_8h.html#af5d0c85a2ad206c277ecde2a085af790" title="Create a codebook from string data.">huff_code_build_str</a>(<span class="keywordtype">char</span> * <span class="keyword">const</span> *values, int32 <span class="keyword">const</span> *frequencies, <span class="keywordtype">int</span> nvals)
<a name="l00270"></a>00270 {
<a name="l00271"></a>00271 <a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc;
<a name="l00272"></a>00272 <a class="code" href="structhuff__node__s.html">huff_node_t</a> *root;
<a name="l00273"></a>00273 <a class="code" href="structheap__s.html" title="Internal heap data structure.">heap_t</a> *q;
<a name="l00274"></a>00274 <span class="keywordtype">int</span> i;
<a name="l00275"></a>00275
<a name="l00276"></a>00276 hc = <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>(*hc));
<a name="l00277"></a>00277 hc->refcount = 1;
<a name="l00278"></a>00278 hc->type = HUFF_CODE_STR;
<a name="l00279"></a>00279
<a name="l00280"></a>00280 <span class="comment">/* Initialize the heap with nodes for each symbol. */</span>
<a name="l00281"></a>00281 q = <a class="code" href="heap_8h.html#a9bc21333ce58caaf58e802d8b0190efd" title="Allocate a new heap and return handle to it.">heap_new</a>();
<a name="l00282"></a>00282 <span class="keywordflow">for</span> (i = 0; i < nvals; ++i) {
<a name="l00283"></a>00283 <a class="code" href="heap_8h.html#a64bcded2de5086c5d246ff760caa74a3" title="Insert a new item into the given heap.">heap_insert</a>(q,
<a name="l00284"></a>00284 huff_node_new_str(values[i]),
<a name="l00285"></a>00285 frequencies[i]);
<a name="l00286"></a>00286 }
<a name="l00287"></a>00287
<a name="l00288"></a>00288 <span class="comment">/* Now build the tree, which gives us codeword lengths. */</span>
<a name="l00289"></a>00289 root = huff_code_build_tree(q);
<a name="l00290"></a>00290 <a class="code" href="heap_8h.html#ab12b1efd6392eb574d2da9c981e7320c" title="Destroy the given heap; free the heap nodes.">heap_destroy</a>(q);
<a name="l00291"></a>00291 <span class="keywordflow">if</span> (root == NULL || root->nbits > 32) {
<a name="l00292"></a>00292 <a class="code" href="err_8h.html#a5f7b2f58f5a663a6bdd51f197ae21993" title="Print error message to standard error stream.">E_ERROR</a>(<span class="stringliteral">"Huffman trees currently limited to 32 bits\n"</span>);
<a name="l00293"></a>00293 huff_node_free_str(root, TRUE);
<a name="l00294"></a>00294 <a class="code" href="huff__code_8h.html#ac8678d07a65af1963cc0b3bd8b10d646" title="Release a pointer to a Huffman codec object.">huff_code_free</a>(hc);
<a name="l00295"></a>00295 <span class="keywordflow">return</span> NULL;
<a name="l00296"></a>00296 }
<a name="l00297"></a>00297
<a name="l00298"></a>00298 <span class="comment">/* Build a canonical codebook. */</span>
<a name="l00299"></a>00299 hc->maxbits = root->nbits;
<a name="l00300"></a>00300 huff_code_canonicalize(hc, root);
<a name="l00301"></a>00301
<a name="l00302"></a>00302 <span class="comment">/* Tree no longer needed (note we retain pointers to its strings). */</span>
<a name="l00303"></a>00303 huff_node_free_str(root, FALSE);
<a name="l00304"></a>00304
<a name="l00305"></a>00305 <span class="keywordflow">return</span> hc;
<a name="l00306"></a>00306 }
<a name="l00307"></a>00307
<a name="l00308"></a>00308 <a class="code" href="structhuff__code__s.html">huff_code_t</a> *
<a name="l00309"></a><a class="code" href="huff__code_8h.html#a873745b79dac884cbb1b5bdf12e069e6">00309</a> <a class="code" href="huff__code_8h.html#a873745b79dac884cbb1b5bdf12e069e6" title="Read a codebook from a file.">huff_code_read</a>(FILE *infh)
<a name="l00310"></a>00310 {
<a name="l00311"></a>00311 <a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc;
<a name="l00312"></a>00312 <span class="keywordtype">int</span> i, j;
<a name="l00313"></a>00313
<a name="l00314"></a>00314 hc = <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>(*hc));
<a name="l00315"></a>00315 hc->refcount = 1;
<a name="l00316"></a>00316
<a name="l00317"></a>00317 hc->maxbits = fgetc(infh);
<a name="l00318"></a>00318 hc->type = fgetc(infh);
<a name="l00319"></a>00319
<a name="l00320"></a>00320 <span class="comment">/* Two bytes of padding. */</span>
<a name="l00321"></a>00321 fgetc(infh);
<a name="l00322"></a>00322 fgetc(infh);
<a name="l00323"></a>00323
<a name="l00324"></a>00324 <span class="comment">/* Allocate stuff. */</span>
<a name="l00325"></a>00325 hc->firstcode = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(hc->maxbits + 1, <span class="keyword">sizeof</span>(*hc->firstcode));
<a name="l00326"></a>00326 hc->numl = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(hc->maxbits + 1, <span class="keyword">sizeof</span>(*hc->numl));
<a name="l00327"></a>00327 hc->syms = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(hc->maxbits + 1, <span class="keyword">sizeof</span>(*hc->syms));
<a name="l00328"></a>00328
<a name="l00329"></a>00329 <span class="comment">/* Read the symbol tables. */</span>
<a name="l00330"></a>00330 hc->codewords = <a class="code" href="hash__table_8h.html#a56d93e8c03e066b77377ac6eab50cfae" title="Allocate a new hash table for a given expected size.">hash_table_new</a>(hc->maxbits, HASH_CASE_YES);
<a name="l00331"></a>00331 <span class="keywordflow">for</span> (i = 1; i <= hc->maxbits; ++i) {
<a name="l00332"></a>00332 <span class="keywordflow">if</span> (fread(&hc->firstcode[i], 4, 1, infh) != 1)
<a name="l00333"></a>00333 <span class="keywordflow">goto</span> error_out;
<a name="l00334"></a>00334 SWAP_BE_32(&hc->firstcode[i]);
<a name="l00335"></a>00335 <span class="keywordflow">if</span> (fread(&hc->numl[i], 4, 1, infh) != 1)
<a name="l00336"></a>00336 <span class="keywordflow">goto</span> error_out;
<a name="l00337"></a>00337 SWAP_BE_32(&hc->numl[i]);
<a name="l00338"></a>00338 hc->syms[i] = <a class="code" href="ckd__alloc_8h.html#aa00ef21903bc4f8a972488417adc8d2e" title="Macros to simplify the use of above functions.">ckd_calloc</a>(hc->numl[i], <span class="keyword">sizeof</span>(**hc->syms));
<a name="l00339"></a>00339 <span class="keywordflow">for</span> (j = 0; j < hc->numl[i]; ++j) {
<a name="l00340"></a>00340 <a class="code" href="structhuff__codeword__s.html">huff_codeword_t</a> *cw = &hc->syms[i][j];
<a name="l00341"></a>00341 cw->nbits = i;
<a name="l00342"></a>00342 cw->codeword = hc->firstcode[i] + j;
<a name="l00343"></a>00343 <span class="keywordflow">if</span> (hc->type == HUFF_CODE_INT) {
<a name="l00344"></a>00344 <span class="keywordflow">if</span> (fread(&cw->r.ival, 4, 1, infh) != 1)
<a name="l00345"></a>00345 <span class="keywordflow">goto</span> error_out;
<a name="l00346"></a>00346 SWAP_BE_32(&cw->r.ival);
<a name="l00347"></a>00347 <a class="code" href="hash__table_8h.html#a6f5752fadefe2662adb2c141f1511062" title="Like hash_table_enter, but with an explicitly specified key length, instead of a NULL-terminated, C-style key string.">hash_table_enter_bkey</a>(hc->codewords,
<a name="l00348"></a>00348 (<span class="keywordtype">char</span> <span class="keyword">const</span> *)&cw->r.ival,
<a name="l00349"></a>00349 <span class="keyword">sizeof</span>(cw->r.ival),
<a name="l00350"></a>00350 (<span class="keywordtype">void</span> *)cw);
<a name="l00351"></a>00351 }
<a name="l00352"></a>00352 <span class="keywordflow">else</span> {
<a name="l00353"></a>00353 <span class="keywordtype">size_t</span> len;
<a name="l00354"></a>00354 cw->r.sval = <a class="code" href="pio_8h.html#a11e0daa4f315d01c2e030d3a0abe702c" title="Read a line of arbitrary length from a file and return it as a newly allocated string.">fread_line</a>(infh, &len);
<a name="l00355"></a>00355 cw->r.sval[len-1] = <span class="charliteral">'\0'</span>;
<a name="l00356"></a>00356 <a class="code" href="hash__table_8h.html#aebfe63c3869c271b125a8413ee384412" title="Try to add a new entry with given key and associated value to hash table h.">hash_table_enter</a>(hc->codewords, cw->r.sval, (<span class="keywordtype">void</span> *)cw);
<a name="l00357"></a>00357 }
<a name="l00358"></a>00358 }
<a name="l00359"></a>00359 }
<a name="l00360"></a>00360
<a name="l00361"></a>00361 <span class="keywordflow">return</span> hc;
<a name="l00362"></a>00362 error_out:
<a name="l00363"></a>00363 <a class="code" href="huff__code_8h.html#ac8678d07a65af1963cc0b3bd8b10d646" title="Release a pointer to a Huffman codec object.">huff_code_free</a>(hc);
<a name="l00364"></a>00364 <span class="keywordflow">return</span> NULL;
<a name="l00365"></a>00365 }
<a name="l00366"></a>00366
<a name="l00367"></a>00367 <span class="keywordtype">int</span>
<a name="l00368"></a><a class="code" href="huff__code_8h.html#a6b91641e852a8eb4c4d32f40ff6dd055">00368</a> <a class="code" href="huff__code_8h.html#a6b91641e852a8eb4c4d32f40ff6dd055" title="Write a codebook to a file.">huff_code_write</a>(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc, FILE *outfh)
<a name="l00369"></a>00369 {
<a name="l00370"></a>00370 <span class="keywordtype">int</span> i, j;
<a name="l00371"></a>00371
<a name="l00372"></a>00372 <span class="comment">/* Maximum codeword length */</span>
<a name="l00373"></a>00373 fputc(hc->maxbits, outfh);
<a name="l00374"></a>00374 <span class="comment">/* Symbol type */</span>
<a name="l00375"></a>00375 fputc(hc->type, outfh);
<a name="l00376"></a>00376 <span class="comment">/* Two extra bytes (for future use and alignment) */</span>
<a name="l00377"></a>00377 fputc(0, outfh);
<a name="l00378"></a>00378 fputc(0, outfh);
<a name="l00379"></a>00379 <span class="comment">/* For each codeword length: */</span>
<a name="l00380"></a>00380 <span class="keywordflow">for</span> (i = 1; i <= hc->maxbits; ++i) {
<a name="l00381"></a>00381 uint32 val;
<a name="l00382"></a>00382
<a name="l00383"></a>00383 <span class="comment">/* Starting code, number of codes. */</span>
<a name="l00384"></a>00384 val = hc->firstcode[i];
<a name="l00385"></a>00385 <span class="comment">/* Canonically big-endian (like the data itself) */</span>
<a name="l00386"></a>00386 SWAP_BE_32(&val);
<a name="l00387"></a>00387 fwrite(&val, 4, 1, outfh);
<a name="l00388"></a>00388 val = hc->numl[i];
<a name="l00389"></a>00389 SWAP_BE_32(&val);
<a name="l00390"></a>00390 fwrite(&val, 4, 1, outfh);
<a name="l00391"></a>00391
<a name="l00392"></a>00392 <span class="comment">/* Symbols for each code (FIXME: Should compress these too) */</span>
<a name="l00393"></a>00393 <span class="keywordflow">for</span> (j = 0; j < hc->numl[i]; ++j) {
<a name="l00394"></a>00394 <span class="keywordflow">if</span> (hc->type == HUFF_CODE_INT) {
<a name="l00395"></a>00395 int32 val = hc->syms[i][j].r.ival;
<a name="l00396"></a>00396 SWAP_BE_32(&val);
<a name="l00397"></a>00397 fwrite(&val, 4, 1, outfh);
<a name="l00398"></a>00398 }
<a name="l00399"></a>00399 <span class="keywordflow">else</span> {
<a name="l00400"></a>00400 <span class="comment">/* Write them all separated by newlines, so that</span>
<a name="l00401"></a>00401 <span class="comment"> * fgets() will read them for us. */</span>
<a name="l00402"></a>00402 fprintf(outfh, <span class="stringliteral">"%s\n"</span>, hc->syms[i][j].r.sval);
<a name="l00403"></a>00403 }
<a name="l00404"></a>00404 }
<a name="l00405"></a>00405 }
<a name="l00406"></a>00406 <span class="keywordflow">return</span> 0;
<a name="l00407"></a>00407 }
<a name="l00408"></a>00408
<a name="l00409"></a>00409 <span class="keywordtype">int</span>
<a name="l00410"></a>00410 huff_code_dump_codebits(FILE *dumpfh, uint32 nbits, uint32 codeword)
<a name="l00411"></a>00411 {
<a name="l00412"></a>00412 uint32 i;
<a name="l00413"></a>00413
<a name="l00414"></a>00414 <span class="keywordflow">for</span> (i = 0; i < nbits; ++i)
<a name="l00415"></a>00415 fputc((codeword & (1<<(nbits-i-1))) ? <span class="charliteral">'1'</span> : <span class="charliteral">'0'</span>, dumpfh);
<a name="l00416"></a>00416 <span class="keywordflow">return</span> 0;
<a name="l00417"></a>00417 }
<a name="l00418"></a>00418
<a name="l00419"></a>00419 <span class="keywordtype">int</span>
<a name="l00420"></a><a class="code" href="huff__code_8h.html#a821658831cbe9b1199c756435d0ad4aa">00420</a> <a class="code" href="huff__code_8h.html#a821658831cbe9b1199c756435d0ad4aa" title="Print a codebook to a file as text (for debugging)">huff_code_dump</a>(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc, FILE *dumpfh)
<a name="l00421"></a>00421 {
<a name="l00422"></a>00422 <span class="keywordtype">int</span> i, j;
<a name="l00423"></a>00423
<a name="l00424"></a>00424 <span class="comment">/* Print out all codewords. */</span>
<a name="l00425"></a>00425 fprintf(dumpfh, <span class="stringliteral">"Maximum codeword length: %d\n"</span>, hc->maxbits);
<a name="l00426"></a>00426 fprintf(dumpfh, <span class="stringliteral">"Symbols are %s\n"</span>, (hc->type == HUFF_CODE_STR) ? <span class="stringliteral">"strings"</span> : <span class="stringliteral">"ints"</span>);
<a name="l00427"></a>00427 fprintf(dumpfh, <span class="stringliteral">"Codewords:\n"</span>);
<a name="l00428"></a>00428 <span class="keywordflow">for</span> (i = 1; i <= hc->maxbits; ++i) {
<a name="l00429"></a>00429 <span class="keywordflow">for</span> (j = 0; j < hc->numl[i]; ++j) {
<a name="l00430"></a>00430 <span class="keywordflow">if</span> (hc->type == HUFF_CODE_STR)
<a name="l00431"></a>00431 fprintf(dumpfh, <span class="stringliteral">"%-30s"</span>, hc->syms[i][j].r.sval);
<a name="l00432"></a>00432 <span class="keywordflow">else</span>
<a name="l00433"></a>00433 fprintf(dumpfh, <span class="stringliteral">"%-30d"</span>, hc->syms[i][j].r.ival);
<a name="l00434"></a>00434 huff_code_dump_codebits(dumpfh, hc->syms[i][j].nbits,
<a name="l00435"></a>00435 hc->syms[i][j].codeword);
<a name="l00436"></a>00436 fprintf(dumpfh, <span class="stringliteral">"\n"</span>);
<a name="l00437"></a>00437 }
<a name="l00438"></a>00438 }
<a name="l00439"></a>00439 <span class="keywordflow">return</span> 0;
<a name="l00440"></a>00440 }
<a name="l00441"></a>00441
<a name="l00442"></a>00442 <a class="code" href="structhuff__code__s.html">huff_code_t</a> *
<a name="l00443"></a><a class="code" href="huff__code_8h.html#a26a70d1b1704f1af985e67127e622a7b">00443</a> <a class="code" href="huff__code_8h.html#a26a70d1b1704f1af985e67127e622a7b" title="Retain a pointer to a Huffman codec object.">huff_code_retain</a>(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc)
<a name="l00444"></a>00444 {
<a name="l00445"></a>00445 ++hc->refcount;
<a name="l00446"></a>00446 <span class="keywordflow">return</span> hc;
<a name="l00447"></a>00447 }
<a name="l00448"></a>00448
<a name="l00449"></a>00449 <span class="keywordtype">int</span>
<a name="l00450"></a><a class="code" href="huff__code_8h.html#ac8678d07a65af1963cc0b3bd8b10d646">00450</a> <a class="code" href="huff__code_8h.html#ac8678d07a65af1963cc0b3bd8b10d646" title="Release a pointer to a Huffman codec object.">huff_code_free</a>(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc)
<a name="l00451"></a>00451 {
<a name="l00452"></a>00452 <span class="keywordtype">int</span> i;
<a name="l00453"></a>00453
<a name="l00454"></a>00454 <span class="keywordflow">if</span> (hc == NULL)
<a name="l00455"></a>00455 <span class="keywordflow">return</span> 0;
<a name="l00456"></a>00456 <span class="keywordflow">if</span> (--hc->refcount > 0)
<a name="l00457"></a>00457 <span class="keywordflow">return</span> hc->refcount;
<a name="l00458"></a>00458 <span class="keywordflow">for</span> (i = 0; i <= hc->maxbits; ++i) {
<a name="l00459"></a>00459 <span class="keywordtype">int</span> j;
<a name="l00460"></a>00460 <span class="keywordflow">for</span> (j = 0; j < hc->numl[i]; ++j) {
<a name="l00461"></a>00461 <span class="keywordflow">if</span> (hc->type == HUFF_CODE_STR)
<a name="l00462"></a>00462 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(hc->syms[i][j].r.sval);
<a name="l00463"></a>00463 }
<a name="l00464"></a>00464 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(hc->syms[i]);
<a name="l00465"></a>00465 }
<a name="l00466"></a>00466 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(hc->firstcode);
<a name="l00467"></a>00467 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(hc->numl);
<a name="l00468"></a>00468 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(hc->syms);
<a name="l00469"></a>00469 <a class="code" href="hash__table_8h.html#a0a588c22946f8cc16328973035ed19e3" title="Free the specified hash table; the caller is responsible for freeing the key strings pointed to by th...">hash_table_free</a>(hc->codewords);
<a name="l00470"></a>00470 <a class="code" href="ckd__alloc_8h.html#a31c6b405558620ac37599737b5722fbf" title="Test and free a 1-D array.">ckd_free</a>(hc);
<a name="l00471"></a>00471 <span class="keywordflow">return</span> 0;
<a name="l00472"></a>00472 }
<a name="l00473"></a>00473
<a name="l00474"></a>00474 FILE *
<a name="l00475"></a><a class="code" href="huff__code_8h.html#a9698821197737e3e1be9533a3059c82c">00475</a> <a class="code" href="huff__code_8h.html#a9698821197737e3e1be9533a3059c82c" title="Attach a Huffman codec to a file handle for input/output.">huff_code_attach</a>(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc, FILE *fh, <span class="keywordtype">char</span> <span class="keyword">const</span> *mode)
<a name="l00476"></a>00476 {
<a name="l00477"></a>00477 FILE *oldfh = <a class="code" href="huff__code_8h.html#a403f575701c1d5fd2ddef1d001cf53e3" title="Detach a Huffman codec from its file handle.">huff_code_detach</a>(hc);
<a name="l00478"></a>00478
<a name="l00479"></a>00479 hc->fh = fh;
<a name="l00480"></a>00480 <span class="keywordflow">if</span> (mode[0] == <span class="charliteral">'w'</span>)
<a name="l00481"></a>00481 hc->be = <a class="code" href="pio_8h.html#a82e4694a4c13c96550f2410f8c63b1f5" title="Attach bitstream encoder to a file.">bit_encode_attach</a>(hc->fh);
<a name="l00482"></a>00482 <span class="keywordflow">return</span> oldfh;
<a name="l00483"></a>00483 }
<a name="l00484"></a>00484
<a name="l00485"></a>00485 FILE *
<a name="l00486"></a><a class="code" href="huff__code_8h.html#a403f575701c1d5fd2ddef1d001cf53e3">00486</a> <a class="code" href="huff__code_8h.html#a403f575701c1d5fd2ddef1d001cf53e3" title="Detach a Huffman codec from its file handle.">huff_code_detach</a>(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc)
<a name="l00487"></a>00487 {
<a name="l00488"></a>00488 FILE *oldfh = hc->fh;
<a name="l00489"></a>00489
<a name="l00490"></a>00490 <span class="keywordflow">if</span> (hc->be) {
<a name="l00491"></a>00491 <a class="code" href="pio_8h.html#a3e818645e567961225977a1923debc3d" title="Flush any unwritten bits, zero-padding if necessary.">bit_encode_flush</a>(hc->be);
<a name="l00492"></a>00492 <a class="code" href="pio_8h.html#a8330637520174419771670ed740c9049" title="Release pointer to a bit encoder.">bit_encode_free</a>(hc->be);
<a name="l00493"></a>00493 hc->be = NULL;
<a name="l00494"></a>00494 }
<a name="l00495"></a>00495 hc->fh = NULL;
<a name="l00496"></a>00496 <span class="keywordflow">return</span> oldfh;
<a name="l00497"></a>00497 }
<a name="l00498"></a>00498
<a name="l00499"></a>00499 <span class="keywordtype">int</span>
<a name="l00500"></a><a class="code" href="huff__code_8h.html#acf369555b8784eee944f7ebc97b6b825">00500</a> <a class="code" href="huff__code_8h.html#acf369555b8784eee944f7ebc97b6b825" title="Encode an integer, writing it to the file handle, if any.">huff_code_encode_int</a>(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc, int32 sym, uint32 *outcw)
<a name="l00501"></a>00501 {
<a name="l00502"></a>00502 <a class="code" href="structhuff__codeword__s.html">huff_codeword_t</a> *cw;
<a name="l00503"></a>00503
<a name="l00504"></a>00504 <span class="keywordflow">if</span> (<a class="code" href="hash__table_8h.html#a91f5b3924c0e3a50f94c86bb5fd078e8" title="Like hash_lookup, but with an explicitly specified key length, instead of a NULL-terminated, C-style key string.">hash_table_lookup_bkey</a>(hc->codewords,
<a name="l00505"></a>00505 (<span class="keywordtype">char</span> <span class="keyword">const</span> *)&sym,
<a name="l00506"></a>00506 <span class="keyword">sizeof</span>(sym),
<a name="l00507"></a>00507 (<span class="keywordtype">void</span> **)&cw) < 0)
<a name="l00508"></a>00508 <span class="keywordflow">return</span> 0;
<a name="l00509"></a>00509 <span class="keywordflow">if</span> (hc->be)
<a name="l00510"></a>00510 <a class="code" href="pio_8h.html#ae71dedb663c8e3ae8b91dbfbc95ac420" title="Write lowest-order bits of codeword to encoder.">bit_encode_write_cw</a>(hc->be, cw->codeword, cw->nbits);
<a name="l00511"></a>00511 <span class="keywordflow">if</span> (outcw) *outcw = cw->codeword;
<a name="l00512"></a>00512 <span class="keywordflow">return</span> cw->nbits;
<a name="l00513"></a>00513 }
<a name="l00514"></a>00514
<a name="l00515"></a>00515 <span class="keywordtype">int</span>
<a name="l00516"></a><a class="code" href="huff__code_8h.html#a24fe76f501a7a0485f3e9485c60fae32">00516</a> <a class="code" href="huff__code_8h.html#a24fe76f501a7a0485f3e9485c60fae32" title="Encode a string, writing it to the file handle, if any.">huff_code_encode_str</a>(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc, <span class="keywordtype">char</span> <span class="keyword">const</span> *sym, uint32 *outcw)
<a name="l00517"></a>00517 {
<a name="l00518"></a>00518 <a class="code" href="structhuff__codeword__s.html">huff_codeword_t</a> *cw;
<a name="l00519"></a>00519
<a name="l00520"></a>00520 <span class="keywordflow">if</span> (<a class="code" href="hash__table_8h.html#a9a1e5ed410eb96f514b00fdce770fbd7" title="Look up a key in a hash table and optionally return the associated value.">hash_table_lookup</a>(hc->codewords,
<a name="l00521"></a>00521 sym,
<a name="l00522"></a>00522 (<span class="keywordtype">void</span> **)&cw) < 0)
<a name="l00523"></a>00523 <span class="keywordflow">return</span> 0;
<a name="l00524"></a>00524 <span class="keywordflow">if</span> (hc->be)
<a name="l00525"></a>00525 <a class="code" href="pio_8h.html#ae71dedb663c8e3ae8b91dbfbc95ac420" title="Write lowest-order bits of codeword to encoder.">bit_encode_write_cw</a>(hc->be, cw->codeword, cw->nbits);
<a name="l00526"></a>00526 <span class="keywordflow">if</span> (outcw) *outcw = cw->codeword;
<a name="l00527"></a>00527 <span class="keywordflow">return</span> cw->nbits;
<a name="l00528"></a>00528 }
<a name="l00529"></a>00529
<a name="l00530"></a>00530 <span class="keyword">static</span> <a class="code" href="structhuff__codeword__s.html">huff_codeword_t</a> *
<a name="l00531"></a>00531 huff_code_decode_data(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc, <span class="keywordtype">char</span> <span class="keyword">const</span> **inout_data,
<a name="l00532"></a>00532 <span class="keywordtype">size_t</span> *inout_data_len, <span class="keywordtype">int</span> *inout_offset)
<a name="l00533"></a>00533 {
<a name="l00534"></a>00534 <span class="keywordtype">char</span> <span class="keyword">const</span> *data = *inout_data;
<a name="l00535"></a>00535 <span class="keywordtype">char</span> <span class="keyword">const</span> *end = data + *inout_data_len;
<a name="l00536"></a>00536 <span class="keywordtype">int</span> offset = *inout_offset;
<a name="l00537"></a>00537 uint32 cw;
<a name="l00538"></a>00538 <span class="keywordtype">int</span> cwlen;
<a name="l00539"></a>00539 <span class="keywordtype">int</span> byte;
<a name="l00540"></a>00540
<a name="l00541"></a>00541 <span class="keywordflow">if</span> (data == end)
<a name="l00542"></a>00542 <span class="keywordflow">return</span> NULL;
<a name="l00543"></a>00543 byte = *data++;
<a name="l00544"></a>00544 cw = !!(byte & (1 << (7-offset++)));
<a name="l00545"></a>00545 cwlen = 1;
<a name="l00546"></a>00546 <span class="comment">/* printf("%.*x ", cwlen, cw); */</span>
<a name="l00547"></a>00547 <span class="keywordflow">while</span> (cwlen <= hc->maxbits && cw < hc->firstcode[cwlen]) {
<a name="l00548"></a>00548 ++cwlen;
<a name="l00549"></a>00549 cw <<= 1;
<a name="l00550"></a>00550 <span class="keywordflow">if</span> (offset > 7) {
<a name="l00551"></a>00551 <span class="keywordflow">if</span> (data == end)
<a name="l00552"></a>00552 <span class="keywordflow">return</span> NULL;
<a name="l00553"></a>00553 byte = *data++;
<a name="l00554"></a>00554 offset = 0;
<a name="l00555"></a>00555 }
<a name="l00556"></a>00556 cw |= !!(byte & (1 << (7-offset++)));
<a name="l00557"></a>00557 <span class="comment">/* printf("%.*x ", cwlen, cw); */</span>
<a name="l00558"></a>00558 }
<a name="l00559"></a>00559 <span class="keywordflow">if</span> (cwlen > hc->maxbits) <span class="comment">/* FAIL: invalid data */</span>
<a name="l00560"></a>00560 <span class="keywordflow">return</span> NULL;
<a name="l00561"></a>00561
<a name="l00562"></a>00562 <span class="comment">/* Put the last byte back if there are bits left over. */</span>
<a name="l00563"></a>00563 <span class="keywordflow">if</span> (offset < 8)
<a name="l00564"></a>00564 --data;
<a name="l00565"></a>00565 <span class="keywordflow">else</span>
<a name="l00566"></a>00566 offset = 0;
<a name="l00567"></a>00567
<a name="l00568"></a>00568 <span class="comment">/* printf("%.*x\n", cwlen, cw); */</span>
<a name="l00569"></a>00569 *inout_data_len = end - data;
<a name="l00570"></a>00570 *inout_data = data;
<a name="l00571"></a>00571 *inout_offset = offset;
<a name="l00572"></a>00572 <span class="keywordflow">return</span> hc->syms[cwlen] + (cw - hc->firstcode[cwlen]);
<a name="l00573"></a>00573 }
<a name="l00574"></a>00574
<a name="l00575"></a>00575 <span class="keyword">static</span> <a class="code" href="structhuff__codeword__s.html">huff_codeword_t</a> *
<a name="l00576"></a>00576 huff_code_decode_fh(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc)
<a name="l00577"></a>00577 {
<a name="l00578"></a>00578 uint32 cw;
<a name="l00579"></a>00579 <span class="keywordtype">int</span> cwlen;
<a name="l00580"></a>00580 <span class="keywordtype">int</span> byte;
<a name="l00581"></a>00581
<a name="l00582"></a>00582 <span class="keywordflow">if</span> ((byte = fgetc(hc->fh)) == EOF)
<a name="l00583"></a>00583 <span class="keywordflow">return</span> NULL;
<a name="l00584"></a>00584 cw = !!(byte & (1 << (7-hc->boff++)));
<a name="l00585"></a>00585 cwlen = 1;
<a name="l00586"></a>00586 <span class="comment">/* printf("%.*x ", cwlen, cw); */</span>
<a name="l00587"></a>00587 <span class="keywordflow">while</span> (cwlen <= hc->maxbits && cw < hc->firstcode[cwlen]) {
<a name="l00588"></a>00588 ++cwlen;
<a name="l00589"></a>00589 cw <<= 1;
<a name="l00590"></a>00590 <span class="keywordflow">if</span> (hc->boff > 7) {
<a name="l00591"></a>00591 <span class="keywordflow">if</span> ((byte = fgetc(hc->fh)) == EOF)
<a name="l00592"></a>00592 <span class="keywordflow">return</span> NULL;
<a name="l00593"></a>00593 hc->boff = 0;
<a name="l00594"></a>00594 }
<a name="l00595"></a>00595 cw |= !!(byte & (1 << (7-hc->boff++)));
<a name="l00596"></a>00596 <span class="comment">/* printf("%.*x ", cwlen, cw); */</span>
<a name="l00597"></a>00597 }
<a name="l00598"></a>00598 <span class="keywordflow">if</span> (cwlen > hc->maxbits) <span class="comment">/* FAIL: invalid data */</span>
<a name="l00599"></a>00599 <span class="keywordflow">return</span> NULL;
<a name="l00600"></a>00600
<a name="l00601"></a>00601 <span class="comment">/* Put the last byte back if there are bits left over. */</span>
<a name="l00602"></a>00602 <span class="keywordflow">if</span> (hc->boff < 8)
<a name="l00603"></a>00603 ungetc(byte, hc->fh);
<a name="l00604"></a>00604 <span class="keywordflow">else</span>
<a name="l00605"></a>00605 hc->boff = 0;
<a name="l00606"></a>00606
<a name="l00607"></a>00607 <span class="comment">/* printf("%.*x\n", cwlen, cw); */</span>
<a name="l00608"></a>00608 <span class="keywordflow">return</span> hc->syms[cwlen] + (cw - hc->firstcode[cwlen]);
<a name="l00609"></a>00609 }
<a name="l00610"></a>00610
<a name="l00611"></a>00611 <span class="keywordtype">int</span>
<a name="l00612"></a><a class="code" href="huff__code_8h.html#a9155dd07a0a24393ef0e4e66cb314140">00612</a> <a class="code" href="huff__code_8h.html#a9155dd07a0a24393ef0e4e66cb314140" title="Decode an integer, reading it from the file if no data given.">huff_code_decode_int</a>(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc, <span class="keywordtype">int</span> *outval,
<a name="l00613"></a>00613 <span class="keywordtype">char</span> <span class="keyword">const</span> **inout_data,
<a name="l00614"></a>00614 <span class="keywordtype">size_t</span> *inout_data_len, <span class="keywordtype">int</span> *inout_offset)
<a name="l00615"></a>00615 {
<a name="l00616"></a>00616 <a class="code" href="structhuff__codeword__s.html">huff_codeword_t</a> *cw;
<a name="l00617"></a>00617
<a name="l00618"></a>00618 <span class="keywordflow">if</span> (inout_data)
<a name="l00619"></a>00619 cw = huff_code_decode_data(hc, inout_data, inout_data_len, inout_offset);
<a name="l00620"></a>00620 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (hc->fh)
<a name="l00621"></a>00621 cw = huff_code_decode_fh(hc);
<a name="l00622"></a>00622 <span class="keywordflow">else</span>
<a name="l00623"></a>00623 <span class="keywordflow">return</span> -1;
<a name="l00624"></a>00624
<a name="l00625"></a>00625 <span class="keywordflow">if</span> (cw == NULL)
<a name="l00626"></a>00626 <span class="keywordflow">return</span> -1;
<a name="l00627"></a>00627 <span class="keywordflow">if</span> (outval)
<a name="l00628"></a>00628 *outval = cw->r.ival;
<a name="l00629"></a>00629
<a name="l00630"></a>00630 <span class="keywordflow">return</span> 0;
<a name="l00631"></a>00631 }
<a name="l00632"></a>00632
<a name="l00633"></a>00633 <span class="keywordtype">char</span> <span class="keyword">const</span> *
<a name="l00634"></a><a class="code" href="huff__code_8h.html#aec0908ece3a695f8a3f6619d8d726e57">00634</a> <a class="code" href="huff__code_8h.html#aec0908ece3a695f8a3f6619d8d726e57" title="Decode a string, reading it from the file if no data given.">huff_code_decode_str</a>(<a class="code" href="structhuff__code__s.html">huff_code_t</a> *hc,
<a name="l00635"></a>00635 <span class="keywordtype">char</span> <span class="keyword">const</span> **inout_data,
<a name="l00636"></a>00636 <span class="keywordtype">size_t</span> *inout_data_len, <span class="keywordtype">int</span> *inout_offset)
<a name="l00637"></a>00637 {
<a name="l00638"></a>00638 <a class="code" href="structhuff__codeword__s.html">huff_codeword_t</a> *cw;
<a name="l00639"></a>00639
<a name="l00640"></a>00640 <span class="keywordflow">if</span> (inout_data)
<a name="l00641"></a>00641 cw = huff_code_decode_data(hc, inout_data, inout_data_len, inout_offset);
<a name="l00642"></a>00642 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (hc->fh)
<a name="l00643"></a>00643 cw = huff_code_decode_fh(hc);
<a name="l00644"></a>00644 <span class="keywordflow">else</span>
<a name="l00645"></a>00645 <span class="keywordflow">return</span> NULL;
<a name="l00646"></a>00646
<a name="l00647"></a>00647 <span class="keywordflow">if</span> (cw == NULL)
<a name="l00648"></a>00648 <span class="keywordflow">return</span> NULL;
<a name="l00649"></a>00649
<a name="l00650"></a>00650 <span class="keywordflow">return</span> cw->r.sval;
<a name="l00651"></a>00651 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>huff_code.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
>
248
