/usr/share/doc/pocketsphinx/html/blkarray__list_8h_source.html is in pocketsphinx-doc 0.8.0+real5prealpha-1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 | <!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.11"/>
<title>PocketSphinx: src/libpocketsphinx/blkarray_list.h 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="navtreedata.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 id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">PocketSphinx
 <span id="projectnumber">5prealpha</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</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('blkarray__list_8h_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">blkarray_list.h</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">/* ====================================================================</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Copyright (c) 1999-2004 Carnegie Mellon University. All rights</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * reserved.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> *</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * Redistribution and use in source and binary forms, with or without</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * modification, are permitted provided that the following conditions</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * are met:</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> *</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * notice, this list of conditions and the following disclaimer. </span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> *</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * notice, this list of conditions and the following disclaimer in</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * the documentation and/or other materials provided with the</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * distribution.</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> *</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 SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * ====================================================================</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> *</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> */</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</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"> * blkarray_list.h -- array-based list structure, for memory and access</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * efficiency.</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"> * HISTORY</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"> * $Log: blkarray_list.h,v $</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * Revision 1.1.1.1 2006/05/23 18:45:02 dhuggins</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * re-importation</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> *</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * Revision 1.2 2004/12/10 16:48:58 rkm</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * Added continuous density acoustic model handling</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"> * Revision 1.1 2004/07/16 00:57:12 egouvea</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * Added Ravi's implementation of FSG support.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> *</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * Revision 1.2 2004/05/27 14:22:57 rkm</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> * FSG cross-word triphones completed (but for single-phone words)</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> *</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Revision 1.1.1.1 2004/03/01 14:30:31 rkm</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"> * Revision 1.1 2004/02/26 01:14:48 rkm</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> * *** empty log message ***</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> <span class="comment"> * </span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> * 18-Feb-2004 M K Ravishankar (rkm@cs.cmu.edu) at Carnegie Mellon</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> * Started.</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> */</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#ifndef __S2_BLKARRAY_LIST_H__</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor">#define __S2_BLKARRAY_LIST_H__</span></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> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor">#include <sphinxbase/prim_type.h></span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </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> <span class="comment">/*</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * For maintaining a (conceptual) "list" of pointers to arbitrary data.</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * The application is responsible for knowing the true data type.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * Use an array instead of a true list for efficiency (both memory and</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * speed). But use a blocked (2-D) array to allow dynamic resizing at a</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * coarse grain. An entire block is allocated or freed, as appropriate.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> */</span></div><div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="structblkarray__list__s.html"> 79</a></span> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structblkarray__list__s.html">blkarray_list_s</a> {</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordtype">void</span> ***ptr; <span class="comment">/* ptr[][] is the user-supplied ptr */</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  int32 maxblks; <span class="comment">/* size of ptr (#rows) */</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  int32 blksize; <span class="comment">/* size of ptr[] (#cols, ie, size of each row) */</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  int32 n_valid; <span class="comment">/* # entries actually stored in the list */</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  int32 cur_row; <span class="comment">/* The current row being that has empty entry */</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  int32 cur_row_free; <span class="comment">/* First entry valid within the current row */</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> } <a class="code" href="structblkarray__list__s.html">blkarray_list_t</a>;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">/* Access macros */</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="preprocessor">#define blkarray_list_ptr(l,r,c) ((l)->ptr[r][c])</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="preprocessor">#define blkarray_list_maxblks(l) ((l)->maxblks)</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="preprocessor">#define blkarray_list_blksize(l) ((l)->blksize)</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="preprocessor">#define blkarray_list_n_valid(l) ((l)->n_valid)</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="preprocessor">#define blkarray_list_cur_row(l) ((l)->cur_row)</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="preprocessor">#define blkarray_list_cur_row_free(l) ((l)->cur_row_free)</span></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> </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment">/*</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> * Initialize and return a new blkarray_list containing an empty list</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> * (i.e., 0 length). Sized for the given values of maxblks and blksize.</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> * NOTE: (maxblks * blksize) should not overflow int32, but this is not</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> * checked.</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"> * Return the allocated entry if successful, NULL if any error.</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"> */</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <a class="code" href="structblkarray__list__s.html">blkarray_list_t</a> *_blkarray_list_init (int32 maxblks, int32 blksize);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment">/*</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> * Like _blkarray_list_init() above, but for some default values of</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> * maxblks and blksize.</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> */</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <a class="code" href="structblkarray__list__s.html">blkarray_list_t</a> *blkarray_list_init ( <span class="keywordtype">void</span> );</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="keywordtype">void</span> blkarray_list_free(<a class="code" href="structblkarray__list__s.html">blkarray_list_t</a> *bl);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> </div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment">/*</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> * Append the given new entry (data) to the end of the list.</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> * Return the index of the entry if successful, -1 if any error.</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> * The returned indices are guaranteed to be successive integers (i.e.,</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"> * 0, 1, 2...) for successive append operations, until the list is reset,</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> * when they resume from 0.</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> */</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> int32 blkarray_list_append (<a class="code" href="structblkarray__list__s.html">blkarray_list_t</a> *, <span class="keywordtype">void</span> *data);</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">/*</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"> * Free all the entries in the list (using ckd_free) and reset the</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> * list length to 0.</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> */</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="keywordtype">void</span> blkarray_list_reset (<a class="code" href="structblkarray__list__s.html">blkarray_list_t</a> *);</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment">/* Gets n-th element of the array list */</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="keywordtype">void</span> * blkarray_list_get(<a class="code" href="structblkarray__list__s.html">blkarray_list_t</a> *, int32 n);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="structblkarray__list__s_html"><div class="ttname"><a href="structblkarray__list__s.html">blkarray_list_s</a></div><div class="ttdef"><b>Definition:</b> <a href="blkarray__list_8h_source.html#l00079">blkarray_list.h:79</a></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_8d034a1e03e98d9b7ac467250bbebdea.html">libpocketsphinx</a></li><li class="navelem"><b>blkarray_list.h</b></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.11 </li>
</ul>
</div>
</body>
</html>
|