<!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: include/sphinxbase/bitvec.h 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('bitvec_8h.html',''); </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <h1>include/sphinxbase/bitvec.h</h1> </div> </div> <div class="contents"> <a href="bitvec_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */</span> <a name="l00002"></a>00002 <span class="comment">/* ====================================================================</span> <a name="l00003"></a>00003 <span class="comment"> * Copyright (c) 1999-2004 Carnegie Mellon University. All rights</span> <a name="l00004"></a>00004 <span class="comment"> * reserved.</span> <a name="l00005"></a>00005 <span class="comment"> *</span> <a name="l00006"></a>00006 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span> <a name="l00007"></a>00007 <span class="comment"> * modification, are permitted provided that the following conditions</span> <a name="l00008"></a>00008 <span class="comment"> * are met:</span> <a name="l00009"></a>00009 <span class="comment"> *</span> <a name="l00010"></a>00010 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span> <a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer. </span> <a name="l00012"></a>00012 <span class="comment"> *</span> <a name="l00013"></a>00013 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span> <a name="l00014"></a>00014 <span class="comment"> * notice, this list of conditions and the following disclaimer in</span> <a name="l00015"></a>00015 <span class="comment"> * the documentation and/or other materials provided with the</span> <a name="l00016"></a>00016 <span class="comment"> * distribution.</span> <a name="l00017"></a>00017 <span class="comment"> *</span> <a name="l00018"></a>00018 <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span> <a name="l00019"></a>00019 <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span> <a name="l00020"></a>00020 <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span> <a name="l00021"></a>00021 <span class="comment"> *</span> <a name="l00022"></a>00022 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span> <a name="l00023"></a>00023 <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span> <a name="l00024"></a>00024 <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span> <a name="l00025"></a>00025 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span> <a name="l00026"></a>00026 <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span> <a name="l00027"></a>00027 <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span> <a name="l00028"></a>00028 <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span> <a name="l00029"></a>00029 <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span> <a name="l00030"></a>00030 <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span> <a name="l00031"></a>00031 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span> <a name="l00032"></a>00032 <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span> <a name="l00033"></a>00033 <span class="comment"> *</span> <a name="l00034"></a>00034 <span class="comment"> * ====================================================================</span> <a name="l00035"></a>00035 <span class="comment"> *</span> <a name="l00036"></a>00036 <span class="comment"> */</span> <a name="l00037"></a>00037 <a name="l00038"></a>00038 <span class="preprocessor">#ifndef _LIBUTIL_BITVEC_H_</span> <a name="l00039"></a>00039 <span class="preprocessor"></span><span class="preprocessor">#define _LIBUTIL_BITVEC_H_</span> <a name="l00040"></a>00040 <span class="preprocessor"></span> <a name="l00041"></a>00041 <span class="preprocessor">#include <string.h></span> <a name="l00042"></a>00042 <a name="l00043"></a>00043 <span class="comment">/* Win32/WinCE DLL gunk */</span> <a name="l00044"></a>00044 <span class="preprocessor">#include <sphinxbase/sphinxbase_export.h></span> <a name="l00045"></a>00045 <a name="l00046"></a>00046 <span class="preprocessor">#include <sphinxbase/prim_type.h></span> <a name="l00047"></a>00047 <span class="preprocessor">#include <sphinxbase/ckd_alloc.h></span> <a name="l00048"></a>00048 <a name="l00056"></a>00056 <span class="preprocessor">#ifdef __cplusplus</span> <a name="l00057"></a>00057 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">"C"</span> { <a name="l00058"></a>00058 <span class="preprocessor">#endif</span> <a name="l00059"></a>00059 <span class="preprocessor"></span><span class="preprocessor">#if 0</span> <a name="l00060"></a>00060 <span class="preprocessor"></span><span class="comment">/* Fool Emacs. */</span> <a name="l00061"></a>00061 } <a name="l00062"></a>00062 <span class="preprocessor">#endif</span> <a name="l00063"></a>00063 <span class="preprocessor"></span> <a name="l00064"></a>00064 <span class="preprocessor">#define BITVEC_BITS 32</span> <a name="l00065"></a>00065 <span class="preprocessor"></span><span class="keyword">typedef</span> uint32 bitvec_t; <a name="l00066"></a>00066 <a name="l00070"></a><a class="code" href="bitvec_8h.html#a1d82193826583f234a71cba32267d3f3">00070</a> <span class="preprocessor">#define bitvec_size(n) (((n)+BITVEC_BITS-1)/BITVEC_BITS)</span> <a name="l00071"></a>00071 <span class="preprocessor"></span> <a name="l00075"></a><a class="code" href="bitvec_8h.html#a866043a7ac23e137f6c2f2466f4abc70">00075</a> <span class="preprocessor">#define bitvec_alloc(n) ckd_calloc(bitvec_size(n), sizeof(bitvec_t))</span> <a name="l00076"></a>00076 <span class="preprocessor"></span> <a name="l00080"></a><a class="code" href="bitvec_8h.html#ae53ebce7c4c616fdc601e8306aebcc4b">00080</a> <span class="preprocessor">#define bitvec_realloc(v,n) ckd_realloc(v, bitvec_size(n) * sizeof(bitvec_t))</span> <a name="l00081"></a>00081 <span class="preprocessor"></span> <a name="l00085"></a><a class="code" href="bitvec_8h.html#a5628e35c88ac7e91b99dce916758824a">00085</a> <span class="preprocessor">#define bitvec_free(v) ckd_free(v)</span> <a name="l00086"></a>00086 <span class="preprocessor"></span> <a name="l00093"></a><a class="code" href="bitvec_8h.html#ae90878b8f2316f5733d83a3f47d378ac">00093</a> <span class="preprocessor">#define bitvec_set(v,b) (v[(b)/BITVEC_BITS] |= (1UL << ((b) & (BITVEC_BITS-1))))</span> <a name="l00094"></a>00094 <span class="preprocessor"></span> <a name="l00101"></a><a class="code" href="bitvec_8h.html#ab7abefb917e02790e9384d3149ff461e">00101</a> <span class="preprocessor">#define bitvec_set_all(v,n) memset(v, (bitvec_t)-1, \</span> <a name="l00102"></a>00102 <span class="preprocessor"> (((n)+BITVEC_BITS-1)/BITVEC_BITS) * \</span> <a name="l00103"></a>00103 <span class="preprocessor"> sizeof(bitvec_t))</span> <a name="l00104"></a>00104 <span class="preprocessor"></span> <a name="l00110"></a><a class="code" href="bitvec_8h.html#a74b3387345ca2730a8067626878843fc">00110</a> <span class="preprocessor">#define bitvec_clear(v,b) (v[(b)/BITVEC_BITS] &= ~(1UL << ((b) & (BITVEC_BITS-1))))</span> <a name="l00111"></a>00111 <span class="preprocessor"></span> <a name="l00118"></a><a class="code" href="bitvec_8h.html#a89f80d7a8040e9225f3c1c9bf102ae1d">00118</a> <span class="preprocessor">#define bitvec_clear_all(v,n) memset(v, 0, (((n)+BITVEC_BITS-1)/BITVEC_BITS) * \</span> <a name="l00119"></a>00119 <span class="preprocessor"> sizeof(bitvec_t))</span> <a name="l00120"></a>00120 <span class="preprocessor"></span> <a name="l00127"></a><a class="code" href="bitvec_8h.html#ae323f80288b2ff946d6d8b0e38f791c9">00127</a> <span class="preprocessor">#define bitvec_is_set(v,b) (v[(b)/BITVEC_BITS] & (1UL << ((b) & (BITVEC_BITS-1))))</span> <a name="l00128"></a>00128 <span class="preprocessor"></span> <a name="l00135"></a><a class="code" href="bitvec_8h.html#a8154409a6e05e7c1ed7f21eff5ed06d4">00135</a> <span class="preprocessor">#define bitvec_is_clear(v,b) (! (bitvec_is_set(v,b)))</span> <a name="l00136"></a>00136 <span class="preprocessor"></span> <a name="l00137"></a>00137 <a name="l00145"></a>00145 SPHINXBASE_EXPORT <a name="l00146"></a>00146 <span class="keywordtype">size_t</span> <a class="code" href="bitvec_8h.html#ac8eeaf487cd029e23fffe676f9a77a10" title="Return the number of bits set in the given bitvector.">bitvec_count_set</a>(bitvec_t *vec, <span class="comment">/* In: Bit vector to search */</span> <a name="l00147"></a>00147 <span class="keywordtype">size_t</span> len); <span class="comment">/* In: Lenght of above bit vector */</span> <a name="l00148"></a>00148 <a name="l00149"></a>00149 <span class="preprocessor">#ifdef __cplusplus</span> <a name="l00150"></a>00150 <span class="preprocessor"></span>} <a name="l00151"></a>00151 <span class="preprocessor">#endif</span> <a name="l00152"></a>00152 <span class="preprocessor"></span> <a name="l00153"></a>00153 <span class="preprocessor">#endif</span> </pre></div></div> </div> <div id="nav-path" class="navpath"> <ul> <li class="navelem"><a class="el" href="bitvec_8h.html">bitvec.h</a> </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>