<!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"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.8"/>
<title>SphinxBase: src/libsphinxbase/util/bitvec.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<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>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.8 -->
<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><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('bitvec_8c_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">bitvec.c</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">/* ====================================================================</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * Copyright (c) 1999-2004 Carnegie Mellon University. All rights</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * reserved.</span></div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * Redistribution and use in source and binary forms, with or without</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * modification, are permitted provided that the following conditions</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * are met:</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> * notice, this list of conditions and the following disclaimer. </span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * notice, this list of conditions and the following disclaimer in</span></div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * the documentation and/or other materials provided with the</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * distribution.</span></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span></div>
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span></div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span></div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span></div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span></div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span></div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * ====================================================================</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * bitvec.c -- Bit vector type.</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * **********************************************</span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * CMU ARPA Speech Project</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * Copyright (c) 1999 Carnegie Mellon University.</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * ALL RIGHTS RESERVED.</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * **********************************************</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * </span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * HISTORY</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * $Log: bitvec.c,v $</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * Revision 1.4 2005/06/22 02:58:22 arthchan2003</span></div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * Added keyword</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * Revision 1.3 2005/03/30 01:22:48 archan</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Fixed mistakes in last updates. Add</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> * </span></div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> * 05-Mar-1999 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> * Started.</span></div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> </div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include "<a class="code" href="bitvec_8h.html">sphinxbase/bitvec.h</a>"</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> bitvec_t *</div>
<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="bitvec_8h.html#a617e9fca97ca02a5e959f989c5c1a4e4"> 64</a></span> <a class="code" href="bitvec_8h.html#a617e9fca97ca02a5e959f989c5c1a4e4">bitvec_realloc</a>(bitvec_t *vec,</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">size_t</span> old_len,</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">size_t</span> new_len)</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> {</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  bitvec_t *new_vec;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordtype">size_t</span> old_size = <a class="code" href="bitvec_8h.html#a1d82193826583f234a71cba32267d3f3">bitvec_size</a>(old_len);</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordtype">size_t</span> new_size = <a class="code" href="bitvec_8h.html#a1d82193826583f234a71cba32267d3f3">bitvec_size</a>(new_len);</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  </div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  new_vec = <a class="code" href="ckd__alloc_8h.html#afd496738b3e114bd494c5a0955f1bfb3">ckd_realloc</a>(vec, new_size * <span class="keyword">sizeof</span>(bitvec_t));</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (new_size > old_size)</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  memset(new_vec + old_size, 0, (new_size - old_size) * <span class="keyword">sizeof</span>(bitvec_t));</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">return</span> new_vec;</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> }</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> </div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="keywordtype">size_t</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="bitvec_8h.html#ac8eeaf487cd029e23fffe676f9a77a10"> 80</a></span> <a class="code" href="bitvec_8h.html#ac8eeaf487cd029e23fffe676f9a77a10">bitvec_count_set</a>(bitvec_t *vec, <span class="keywordtype">size_t</span> len)</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> {</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordtype">size_t</span> words, bits, w, b, n;</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  bitvec_t *v;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  words = len / BITVEC_BITS;</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  bits = len % BITVEC_BITS;</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  v = vec;</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  n = 0;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">for</span> (w = 0; w < words; ++w, ++v) {</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">if</span> (*v == 0)</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">continue</span>;</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">for</span> (b = 0; b < BITVEC_BITS; ++b)</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (*v & (1<<b))</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  ++n;</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">for</span> (b = 0; b < bits; ++b)</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">if</span> (*v & (1<<b))</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  ++n;</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">return</span> n;</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> }</div>
<div class="ttc" id="bitvec_8h_html_a1d82193826583f234a71cba32267d3f3"><div class="ttname"><a href="bitvec_8h.html#a1d82193826583f234a71cba32267d3f3">bitvec_size</a></div><div class="ttdeci">#define bitvec_size(n)</div><div class="ttdoc">Number of bitvec_t in a bit vector. </div><div class="ttdef"><b>Definition:</b> <a href="bitvec_8h_source.html#l00070">bitvec.h:70</a></div></div>
<div class="ttc" id="bitvec_8h_html_ac8eeaf487cd029e23fffe676f9a77a10"><div class="ttname"><a href="bitvec_8h.html#ac8eeaf487cd029e23fffe676f9a77a10">bitvec_count_set</a></div><div class="ttdeci">SPHINXBASE_EXPORT size_t bitvec_count_set(bitvec_t *vec, size_t len)</div><div class="ttdoc">Return the number of bits set in the given bitvector. </div><div class="ttdef"><b>Definition:</b> <a href="bitvec_8c_source.html#l00080">bitvec.c:80</a></div></div>
<div class="ttc" id="bitvec_8h_html_a617e9fca97ca02a5e959f989c5c1a4e4"><div class="ttname"><a href="bitvec_8h.html#a617e9fca97ca02a5e959f989c5c1a4e4">bitvec_realloc</a></div><div class="ttdeci">SPHINXBASE_EXPORT bitvec_t * bitvec_realloc(bitvec_t *vec, size_t old_len, size_t new_len)</div><div class="ttdoc">Resize a bit vector, clear the remaining bits. </div><div class="ttdef"><b>Definition:</b> <a href="bitvec_8c_source.html#l00064">bitvec.c:64</a></div></div>
<div class="ttc" id="ckd__alloc_8h_html_afd496738b3e114bd494c5a0955f1bfb3"><div class="ttname"><a href="ckd__alloc_8h.html#afd496738b3e114bd494c5a0955f1bfb3">ckd_realloc</a></div><div class="ttdeci">#define ckd_realloc(ptr, sz)</div><div class="ttdoc">Macro for ckd_realloc </div><div class="ttdef"><b>Definition:</b> <a href="ckd__alloc_8h_source.html#l00258">ckd_alloc.h:258</a></div></div>
<div class="ttc" id="bitvec_8h_html"><div class="ttname"><a href="bitvec_8h.html">bitvec.h</a></div><div class="ttdoc">An implementation of bit vectors. </div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_3b5e6589d8d7d3e6424fe0fcd4bf9c2a.html">libsphinxbase</a></li><li class="navelem"><a class="el" href="dir_dc1f04dceb148346198172cb52290701.html">util</a></li><li class="navelem"><b>bitvec.c</b></li>
<li class="footer">Generated on Sat Oct 18 2014 15:21:16 for SphinxBase by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.8 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
5
>
x86_64
>
media
>
core-release
>
by-pkgid
>
b56c9eed3fa0f00740b6f09a2460a97f
>
files
>
72
