/usr/share/doc/pocketsphinx/html/s2__semi__mgau_8c_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 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 | <!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/s2_semi_mgau.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="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('s2__semi__mgau_8c_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">s2_semi_mgau.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> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">/* System headers */</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include <stdio.h></span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include <stdlib.h></span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include <string.h></span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include <assert.h></span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include <limits.h></span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include <math.h></span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#if defined(__ADSPBLACKFIN__)</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#elif !defined(_WIN32_WCE)</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include <sys/types.h></span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">/* SphinxBase headers */</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#include <sphinx_config.h></span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#include <sphinxbase/cmd_ln.h></span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="preprocessor">#include <sphinxbase/fixpoint.h></span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor">#include <sphinxbase/ckd_alloc.h></span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor">#include <sphinxbase/bio.h></span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#include <sphinxbase/err.h></span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#include <sphinxbase/prim_type.h></span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment">/* Local headers */</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include "s2_semi_mgau.h"</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include "<a class="code" href="tied__mgau__common_8h.html">tied_mgau_common.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> <span class="keyword">static</span> <a class="code" href="structps__mgaufuncs__s.html">ps_mgaufuncs_t</a> s2_semi_mgau_funcs = {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="stringliteral">"s2_semi"</span>,</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  s2_semi_mgau_frame_eval, <span class="comment">/* frame_eval */</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  s2_semi_mgau_mllr_transform, <span class="comment">/* transform */</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  s2_semi_mgau_free <span class="comment">/* free */</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> </div><div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="structvqFeature__s.html"> 70</a></span> <span class="keyword">struct </span><a class="code" href="structvqFeature__s.html">vqFeature_s</a> {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  int32 score; <span class="comment">/* score or distance */</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  int32 codeword; <span class="comment">/* codeword (vector index) */</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> };</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> eval_topn(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *s, int32 feat, mfcc_t *z)</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>  <span class="keywordtype">int</span> i, ceplen;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="structvqFeature__s.html">vqFeature_t</a> *topn;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  topn = s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[feat];</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  ceplen = s->g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[feat];</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">for</span> (i = 0; i < s->max_topn; i++) {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  mfcc_t *mean, diff, sqdiff, compl; <span class="comment">/* diff, diff^2, component likelihood */</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="structvqFeature__s.html">vqFeature_t</a> vtmp;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  mfcc_t *var, d;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  mfcc_t *obs;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  int32 cw, j;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  cw = topn[i].codeword;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  mean = s->g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>[0][feat][0] + cw * ceplen;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  var = s->g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a>[0][feat][0] + cw * ceplen;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  d = s->g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a>[0][feat][cw];</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  obs = z;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">for</span> (j = 0; j < ceplen; j++) {</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  diff = *obs++ - *mean++;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  sqdiff = MFCCMUL(diff, diff);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  compl = MFCCMUL(sqdiff, *var);</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  d = <a class="code" href="tied__mgau__common_8h.html#a740dfe5b30e702ba8b2ec7426bd4d57e">GMMSUB</a>(d, compl);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  ++var;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  topn[i].score = (int32)d;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">if</span> (i == 0)</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  vtmp = topn[i];</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">for</span> (j = i - 1; j >= 0 && (int32)d > topn[j].score; j--) {</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  topn[j + 1] = topn[j];</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  topn[j + 1] = vtmp;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> eval_cb(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *s, int32 feat, mfcc_t *z)</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <a class="code" href="structvqFeature__s.html">vqFeature_t</a> *worst, *best, *topn;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  mfcc_t *mean;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  mfcc_t *var, *det, *detP, *detE;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  int32 i, ceplen;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  best = topn = s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[feat];</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  worst = topn + (s->max_topn - 1);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  mean = s->g-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">mean</a>[0][feat][0];</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  var = s->g-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">var</a>[0][feat][0];</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  det = s->g-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">det</a>[0][feat];</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  detE = det + s->g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  ceplen = s->g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[feat];</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">for</span> (detP = det; detP < detE; ++detP) {</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  mfcc_t diff, sqdiff, compl; <span class="comment">/* diff, diff^2, component likelihood */</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  mfcc_t d;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  mfcc_t *obs;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="structvqFeature__s.html">vqFeature_t</a> *cur;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  int32 cw, j;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  d = *detP;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  obs = z;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  cw = (int)(detP - det);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">for</span> (j = 0; (j < ceplen) && (d >= worst->score); ++j) {</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  diff = *obs++ - *mean++;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  sqdiff = MFCCMUL(diff, diff);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  compl = MFCCMUL(sqdiff, *var);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  d = <a class="code" href="tied__mgau__common_8h.html#a740dfe5b30e702ba8b2ec7426bd4d57e">GMMSUB</a>(d, compl);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  ++var;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">if</span> (j < ceplen) {</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">/* terminated early, so not in topn */</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  mean += (ceplen - j);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  var += (ceplen - j);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  }</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">if</span> ((int32)d < worst->score)</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">for</span> (i = 0; i < s->max_topn; i++) {</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">/* already there, so don't need to insert */</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">if</span> (topn[i].codeword == cw)</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  }</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (i < s->max_topn)</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">continue</span>; <span class="comment">/* already there. Don't insert */</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">/* remaining code inserts codeword and dist in correct spot */</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">for</span> (cur = worst - 1; cur >= best && (int32)d >= cur->score; --cur)</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  memcpy(cur + 1, cur, <span class="keyword">sizeof</span>(<a class="code" href="structvqFeature__s.html">vqFeature_t</a>));</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  ++cur;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  cur->codeword = cw;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  cur->score = (int32)d;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> mgau_dist(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, int32 frame, int32 feat, mfcc_t * z)</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> {</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  eval_topn(s, feat, z);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">/* If this frame is skipped, do nothing else. */</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">if</span> (frame % s->ds_ratio)</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> </div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">/* Evaluate the rest of the codebook (or subset thereof). */</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  eval_cb(s, feat, z);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="keyword">static</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> mgau_norm(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *s, <span class="keywordtype">int</span> feat)</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> {</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  int32 norm;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordtype">int</span> j;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">/* Compute quantized normalizing constant. */</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  norm = s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[feat][0].score >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7">SENSCR_SHIFT</a>;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">/* Normalize the scores, negate them, and clamp their dynamic range. */</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">for</span> (j = 0; j < s->max_topn; ++j) {</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[feat][j].score = -((s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[feat][j].score >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7">SENSCR_SHIFT</a>) - norm);</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">if</span> (s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[feat][j].score > <a class="code" href="tied__mgau__common_8h.html#a965d50d73044c3f2dc2589662fd2e89e">MAX_NEG_ASCR</a>)</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[feat][j].score = <a class="code" href="tied__mgau__common_8h.html#a965d50d73044c3f2dc2589662fd2e89e">MAX_NEG_ASCR</a>;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">if</span> (s->topn_beam[feat] && s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[feat][j].score > s->topn_beam[feat])</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">return</span> j;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> }</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> </div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> get_scores_8b_feat_6(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  int32 n_senone_active)</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> {</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  int32 j, l;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  uint8 *pid_cw0, *pid_cw1, *pid_cw2, *pid_cw3, *pid_cw4, *pid_cw5;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  pid_cw1 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].codeword];</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  pid_cw2 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].codeword];</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  pid_cw3 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].codeword];</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  pid_cw4 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][4].codeword];</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  pid_cw5 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][5].codeword];</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> </div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordtype">int</span> sen = senone_active[j] + l;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  int32 tmp = pid_cw0[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  pid_cw1[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].score);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  pid_cw2[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].score);</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  pid_cw3[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].score);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  pid_cw4[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][4].score);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  pid_cw5[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][5].score);</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  senone_scores[sen] += tmp;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  l = sen;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> get_scores_8b_feat_5(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  int32 n_senone_active)</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> {</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  int32 j, l;</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  uint8 *pid_cw0, *pid_cw1, *pid_cw2, *pid_cw3, *pid_cw4;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  pid_cw1 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].codeword];</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  pid_cw2 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].codeword];</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  pid_cw3 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].codeword];</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  pid_cw4 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][4].codeword];</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordtype">int</span> sen = senone_active[j] + l;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  int32 tmp = pid_cw0[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> </div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  pid_cw1[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].score);</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  pid_cw2[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].score);</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  pid_cw3[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].score);</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  pid_cw4[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][4].score);</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  senone_scores[sen] += tmp;</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  l = sen;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> get_scores_8b_feat_4(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  int32 n_senone_active)</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> {</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  int32 j, l;</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  uint8 *pid_cw0, *pid_cw1, *pid_cw2, *pid_cw3;</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  pid_cw1 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].codeword];</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  pid_cw2 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].codeword];</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  pid_cw3 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].codeword];</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordtype">int</span> sen = senone_active[j] + l;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  int32 tmp = pid_cw0[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> </div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  pid_cw1[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].score);</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  pid_cw2[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].score);</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  pid_cw3[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].score);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  senone_scores[sen] += tmp;</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  l = sen;</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> }</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> get_scores_8b_feat_3(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  int32 n_senone_active)</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> {</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  int32 j, l;</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  uint8 *pid_cw0, *pid_cw1, *pid_cw2;</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> </div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  pid_cw1 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].codeword];</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  pid_cw2 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].codeword];</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> </div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordtype">int</span> sen = senone_active[j] + l;</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  int32 tmp = pid_cw0[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> </div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  pid_cw1[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].score);</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  pid_cw2[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].score);</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  senone_scores[sen] += tmp;</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  l = sen;</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  }</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> }</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> get_scores_8b_feat_2(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  int32 n_senone_active)</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> {</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  int32 j, l;</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  uint8 *pid_cw0, *pid_cw1;</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> </div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  pid_cw1 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].codeword];</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordtype">int</span> sen = senone_active[j] + l;</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  int32 tmp = pid_cw0[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  pid_cw1[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].score);</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  senone_scores[sen] += tmp;</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  l = sen;</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  }</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> }</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> </div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> get_scores_8b_feat_1(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  int32 n_senone_active)</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> {</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  int32 j, l;</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  uint8 *pid_cw0;</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> </div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordtype">int</span> sen = senone_active[j] + l;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  int32 tmp = pid_cw0[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  senone_scores[sen] += tmp;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  l = sen;</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  }</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> }</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> get_scores_8b_feat_any(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> topn,</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  int32 n_senone_active)</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> {</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  int32 j, k, l;</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> </div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordtype">int</span> sen = senone_active[j] + l;</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  uint8 *pid_cw;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  int32 tmp;</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  pid_cw = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  tmp = pid_cw[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">for</span> (k = 1; k < topn; ++k) {</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  pid_cw = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][k].codeword];</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  pid_cw[sen] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][k].score);</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  senone_scores[sen] += tmp;</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  l = sen;</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> }</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span> get_scores_8b_feat(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> topn,</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  int16 *senone_scores, uint8 *senone_active, int32 n_senone_active)</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> {</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">switch</span> (topn) {</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">case</span> 6:</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">return</span> get_scores_8b_feat_6(s, i, senone_scores,</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">case</span> 5:</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">return</span> get_scores_8b_feat_5(s, i, senone_scores,</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">case</span> 4:</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">return</span> get_scores_8b_feat_4(s, i, senone_scores,</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">case</span> 3:</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">return</span> get_scores_8b_feat_3(s, i, senone_scores,</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">case</span> 2:</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">return</span> get_scores_8b_feat_2(s, i, senone_scores,</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">case</span> 1:</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">return</span> get_scores_8b_feat_1(s, i, senone_scores,</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">return</span> get_scores_8b_feat_any(s, i, topn, senone_scores,</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  }</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> }</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> </div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> get_scores_8b_feat_all(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> topn, int16 *senone_scores)</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> {</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  int32 j, k;</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> </div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">for</span> (j = 0; j < s->n_sen; j++) {</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  uint8 *pid_cw;</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  int32 tmp;</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  pid_cw = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  tmp = pid_cw[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">for</span> (k = 1; k < topn; ++k) {</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  pid_cw = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][k].codeword];</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  pid_cw[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][k].score);</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  }</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  senone_scores[j] += tmp;</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  }</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> }</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> get_scores_4b_feat_6(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  int32 n_senone_active)</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> {</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  int32 j, l;</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  uint8 *pid_cw0, *pid_cw1, *pid_cw2, *pid_cw3, *pid_cw4, *pid_cw5;</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  uint8 w_den[6][16];</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> </div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="comment">/* Precompute scaled densities. */</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">for</span> (j = 0; j < 16; ++j) {</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  w_den[0][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  w_den[1][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].score;</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  w_den[2][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].score;</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  w_den[3][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].score;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  w_den[4][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][4].score;</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  w_den[5][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][5].score;</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  }</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> </div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  pid_cw1 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].codeword];</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  pid_cw2 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].codeword];</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  pid_cw3 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].codeword];</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  pid_cw4 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][4].codeword];</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  pid_cw5 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][5].codeword];</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> </div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordtype">int</span> n = senone_active[j] + l;</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordtype">int</span> tmp, cw;</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> </div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">if</span> (n & 1) {</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  cw = pid_cw0[n/2] >> 4;</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  tmp = w_den[0][cw];</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  cw = pid_cw1[n/2] >> 4;</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[1][cw]);</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  cw = pid_cw2[n/2] >> 4;</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[2][cw]);</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  cw = pid_cw3[n/2] >> 4;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[3][cw]);</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  cw = pid_cw4[n/2] >> 4;</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[4][cw]);</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  cw = pid_cw5[n/2] >> 4;</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[5][cw]);</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  }</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  cw = pid_cw0[n/2] & 0x0f;</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  tmp = w_den[0][cw];</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  cw = pid_cw1[n/2] & 0x0f;</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[1][cw]);</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  cw = pid_cw2[n/2] & 0x0f;</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[2][cw]);</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  cw = pid_cw3[n/2] & 0x0f;</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[3][cw]);</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  cw = pid_cw4[n/2] & 0x0f;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[4][cw]);</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  cw = pid_cw5[n/2] & 0x0f;</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[5][cw]);</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  }</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  senone_scores[n] += tmp;</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  l = n;</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  }</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> }</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> </div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> get_scores_4b_feat_5(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  int32 n_senone_active)</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> {</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  int32 j, l;</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  uint8 *pid_cw0, *pid_cw1, *pid_cw2, *pid_cw3, *pid_cw4;</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  uint8 w_den[5][16];</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> </div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="comment">/* Precompute scaled densities. */</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordflow">for</span> (j = 0; j < 16; ++j) {</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  w_den[0][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  w_den[1][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].score;</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  w_den[2][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].score;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  w_den[3][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].score;</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  w_den[4][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][4].score;</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  }</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> </div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  pid_cw1 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].codeword];</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  pid_cw2 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].codeword];</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  pid_cw3 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].codeword];</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  pid_cw4 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][4].codeword];</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> </div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordtype">int</span> n = senone_active[j] + l;</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordtype">int</span> tmp, cw;</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> </div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordflow">if</span> (n & 1) {</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  cw = pid_cw0[n/2] >> 4;</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  tmp = w_den[0][cw];</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  cw = pid_cw1[n/2] >> 4;</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[1][cw]);</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  cw = pid_cw2[n/2] >> 4;</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[2][cw]);</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  cw = pid_cw3[n/2] >> 4;</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[3][cw]);</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  cw = pid_cw4[n/2] >> 4;</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[4][cw]);</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  }</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  cw = pid_cw0[n/2] & 0x0f;</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  tmp = w_den[0][cw];</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  cw = pid_cw1[n/2] & 0x0f;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[1][cw]);</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  cw = pid_cw2[n/2] & 0x0f;</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[2][cw]);</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  cw = pid_cw3[n/2] & 0x0f;</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[3][cw]);</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  cw = pid_cw4[n/2] & 0x0f;</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[4][cw]);</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  }</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  senone_scores[n] += tmp;</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  l = n;</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> }</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> </div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> get_scores_4b_feat_4(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  int32 n_senone_active)</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> {</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  int32 j, l;</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  uint8 *pid_cw0, *pid_cw1, *pid_cw2, *pid_cw3;</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  uint8 w_den[4][16];</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> </div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">/* Precompute scaled densities. */</span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordflow">for</span> (j = 0; j < 16; ++j) {</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  w_den[0][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  w_den[1][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].score;</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  w_den[2][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].score;</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  w_den[3][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].score;</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  }</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span> </div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  pid_cw1 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].codeword];</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  pid_cw2 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].codeword];</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  pid_cw3 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][3].codeword];</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span> </div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordtype">int</span> n = senone_active[j] + l;</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordtype">int</span> tmp, cw;</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span> </div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordflow">if</span> (n & 1) {</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  cw = pid_cw0[n/2] >> 4;</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  tmp = w_den[0][cw];</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  cw = pid_cw1[n/2] >> 4;</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[1][cw]);</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  cw = pid_cw2[n/2] >> 4;</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[2][cw]);</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  cw = pid_cw3[n/2] >> 4;</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[3][cw]);</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  }</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  cw = pid_cw0[n/2] & 0x0f;</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  tmp = w_den[0][cw];</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  cw = pid_cw1[n/2] & 0x0f;</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[1][cw]);</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  cw = pid_cw2[n/2] & 0x0f;</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[2][cw]);</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  cw = pid_cw3[n/2] & 0x0f;</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[3][cw]);</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  }</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  senone_scores[n] += tmp;</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  l = n;</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  }</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> }</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span> </div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span> get_scores_4b_feat_3(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  int32 n_senone_active)</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span> {</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  int32 j, l;</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  uint8 *pid_cw0, *pid_cw1, *pid_cw2;</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  uint8 w_den[3][16];</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span> </div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">/* Precompute scaled densities. */</span></div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">for</span> (j = 0; j < 16; ++j) {</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  w_den[0][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  w_den[1][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].score;</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  w_den[2][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].score;</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  }</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> </div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  pid_cw1 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].codeword];</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  pid_cw2 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][2].codeword];</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span> </div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordtype">int</span> n = senone_active[j] + l;</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordtype">int</span> tmp, cw;</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> </div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordflow">if</span> (n & 1) {</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  cw = pid_cw0[n/2] >> 4;</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  tmp = w_den[0][cw];</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  cw = pid_cw1[n/2] >> 4;</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[1][cw]);</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  cw = pid_cw2[n/2] >> 4;</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[2][cw]);</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  }</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  cw = pid_cw0[n/2] & 0x0f;</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  tmp = w_den[0][cw];</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  cw = pid_cw1[n/2] & 0x0f;</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[1][cw]);</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  cw = pid_cw2[n/2] & 0x0f;</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[2][cw]);</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  }</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  senone_scores[n] += tmp;</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  l = n;</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span> }</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> </div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span> get_scores_4b_feat_2(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  int32 n_senone_active)</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span> {</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  int32 j, l;</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  uint8 *pid_cw0, *pid_cw1;</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  uint8 w_den[2][16];</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> </div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="comment">/* Precompute scaled densities. */</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordflow">for</span> (j = 0; j < 16; ++j) {</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  w_den[0][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  w_den[1][j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].score;</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  }</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> </div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  pid_cw1 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][1].codeword];</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> </div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keywordtype">int</span> n = senone_active[j] + l;</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keywordtype">int</span> tmp, cw;</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span> </div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">if</span> (n & 1) {</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  cw = pid_cw0[n/2] >> 4;</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  tmp = w_den[0][cw];</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  cw = pid_cw1[n/2] >> 4;</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[1][cw]);</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  }</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  cw = pid_cw0[n/2] & 0x0f;</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  tmp = w_den[0][cw];</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  cw = pid_cw1[n/2] & 0x0f;</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp, w_den[1][cw]);</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  }</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  senone_scores[n] += tmp;</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  l = n;</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  }</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> }</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span> </div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span> get_scores_4b_feat_1(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i,</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  int32 n_senone_active)</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> {</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  int32 j, l;</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  uint8 *pid_cw0;</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  uint8 w_den[16];</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> </div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="comment">/* Precompute scaled densities. */</span></div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">for</span> (j = 0; j < 16; ++j) {</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  w_den[j] = s->mixw_cb[j] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  }</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> </div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  pid_cw0 = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> </div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="keywordtype">int</span> n = senone_active[j] + l;</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keywordtype">int</span> tmp, cw;</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span> </div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordflow">if</span> (n & 1) {</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  cw = pid_cw0[n/2] >> 4;</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  tmp = w_den[cw];</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  }</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  cw = pid_cw0[n/2] & 0x0f;</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  tmp = w_den[cw];</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  }</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  senone_scores[n] += tmp;</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  l = n;</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  }</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> }</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> </div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span> get_scores_4b_feat_any(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> topn,</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  int16 *senone_scores, uint8 *senone_active,</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  int32 n_senone_active)</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> {</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  int32 j, k, l;</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span> </div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keywordflow">for</span> (l = j = 0; j < n_senone_active; j++) {</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordtype">int</span> n = senone_active[j] + l;</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordtype">int</span> tmp, cw;</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  uint8 *pid_cw;</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  </div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  pid_cw = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordflow">if</span> (n & 1)</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  cw = pid_cw[n/2] >> 4;</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  cw = pid_cw[n/2] & 0x0f;</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  tmp = s->mixw_cb[cw] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">for</span> (k = 1; k < topn; ++k) {</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  pid_cw = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][k].codeword];</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keywordflow">if</span> (n & 1)</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  cw = pid_cw[n/2] >> 4;</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  cw = pid_cw[n/2] & 0x0f;</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  tmp = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp,</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  s->mixw_cb[cw] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][k].score);</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  }</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  senone_scores[n] += tmp;</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  l = n;</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  }</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> }</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> </div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> get_scores_4b_feat(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> topn,</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  int16 *senone_scores, uint8 *senone_active, int32 n_senone_active)</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span> {</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keywordflow">switch</span> (topn) {</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keywordflow">case</span> 6:</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordflow">return</span> get_scores_4b_feat_6(s, i, senone_scores,</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">case</span> 5:</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="keywordflow">return</span> get_scores_4b_feat_5(s, i, senone_scores,</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordflow">case</span> 4:</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordflow">return</span> get_scores_4b_feat_4(s, i, senone_scores,</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordflow">case</span> 3:</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keywordflow">return</span> get_scores_4b_feat_3(s, i, senone_scores,</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">case</span> 2:</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keywordflow">return</span> get_scores_4b_feat_2(s, i, senone_scores,</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">case</span> 1:</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordflow">return</span> get_scores_4b_feat_1(s, i, senone_scores,</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordflow">return</span> get_scores_4b_feat_any(s, i, topn, senone_scores,</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  }</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> }</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> </div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> get_scores_4b_feat_all(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> topn, int16 *senone_scores)</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span> {</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordtype">int</span> j, last_sen;</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> </div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  j = 0;</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="comment">/* Number of senones is always even, but don't overrun if it isn't. */</span></div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  last_sen = s->n_sen & ~1;</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keywordflow">while</span> (j < last_sen) {</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  uint8 *pid_cw;</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  int32 tmp0, tmp1;</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordtype">int</span> k;</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span> </div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  pid_cw = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].codeword];</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  tmp0 = s->mixw_cb[pid_cw[j/2] & 0x0f] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  tmp1 = s->mixw_cb[pid_cw[j/2] >> 4] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][0].score;</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keywordflow">for</span> (k = 1; k < topn; ++k) {</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  int32 w_den0, w_den1;</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span> </div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  pid_cw = s->mixw[i][s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][k].codeword];</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  w_den0 = s->mixw_cb[pid_cw[j/2] & 0x0f] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][k].score;</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  w_den1 = s->mixw_cb[pid_cw[j/2] >> 4] + s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i][k].score;</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  tmp0 = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp0, w_den0);</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  tmp1 = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a>(s->lmath_8b, tmp1, w_den1);</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  }</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  senone_scores[j++] += tmp0;</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  senone_scores[j++] += tmp1;</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  }</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span> }</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span> </div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span> <span class="comment">/*</span></div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> <span class="comment"> * Compute senone scores for the active senones.</span></div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span> <span class="comment"> */</span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> int32</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> s2_semi_mgau_frame_eval(<a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *ps,</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  int16 *senone_scores,</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  uint8 *senone_active,</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  int32 n_senone_active,</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  mfcc_t ** featbuf, int32 frame,</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  int32 compallsen)</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span> {</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *s = (<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *)ps;</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordtype">int</span> i, topn_idx;</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keywordtype">int</span> n_feat = s->g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>;</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span> </div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  memset(senone_scores, 0, s->n_sen * <span class="keyword">sizeof</span>(*senone_scores));</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="comment">/* No bounds checking is done here, which just means you'll get</span></div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span> <span class="comment"> * semi-random crap if you request a frame in the future or one</span></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span> <span class="comment"> * that's too far in the past. */</span></div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  topn_idx = frame % s-><a class="code" href="structs2__semi__mgau__s.html#a3cbc9fe683da5b7befe6b2712adae327">n_topn_hist</a>;</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a> = s-><a class="code" href="structs2__semi__mgau__s.html#a8892e22acbf81b08972cb6d7968ed4ce">topn_hist</a>[topn_idx];</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keywordflow">for</span> (i = 0; i < n_feat; ++i) {</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="comment">/* For past frames this will already be computed. */</span></div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keywordflow">if</span> (frame >= ps_mgau_base(ps)->frame_idx) {</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <a class="code" href="structvqFeature__s.html">vqFeature_t</a> **lastf;</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordflow">if</span> (topn_idx == 0)</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  lastf = s-><a class="code" href="structs2__semi__mgau__s.html#a8892e22acbf81b08972cb6d7968ed4ce">topn_hist</a>[s-><a class="code" href="structs2__semi__mgau__s.html#a3cbc9fe683da5b7befe6b2712adae327">n_topn_hist</a>-1];</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  lastf = s-><a class="code" href="structs2__semi__mgau__s.html#a8892e22acbf81b08972cb6d7968ed4ce">topn_hist</a>[topn_idx-1];</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  memcpy(s-><a class="code" href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">f</a>[i], lastf[i], <span class="keyword">sizeof</span>(<a class="code" href="structvqFeature__s.html">vqFeature_t</a>) * s->max_topn);</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  mgau_dist(s, frame, i, featbuf[i]);</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  s-><a class="code" href="structs2__semi__mgau__s.html#acfe1e5d43a25418ef19afba837f85cf7">topn_hist_n</a>[topn_idx][i] = mgau_norm(s, i);</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  }</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keywordflow">if</span> (s->mixw_cb) {</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keywordflow">if</span> (compallsen)</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  get_scores_4b_feat_all(s, i, s-><a class="code" href="structs2__semi__mgau__s.html#acfe1e5d43a25418ef19afba837f85cf7">topn_hist_n</a>[topn_idx][i], senone_scores);</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  get_scores_4b_feat(s, i, s-><a class="code" href="structs2__semi__mgau__s.html#acfe1e5d43a25418ef19afba837f85cf7">topn_hist_n</a>[topn_idx][i], senone_scores,</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  }</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <span class="keywordflow">if</span> (compallsen)</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  get_scores_8b_feat_all(s, i, s-><a class="code" href="structs2__semi__mgau__s.html#acfe1e5d43a25418ef19afba837f85cf7">topn_hist_n</a>[topn_idx][i], senone_scores);</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  get_scores_8b_feat(s, i, s-><a class="code" href="structs2__semi__mgau__s.html#acfe1e5d43a25418ef19afba837f85cf7">topn_hist_n</a>[topn_idx][i], senone_scores,</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  senone_active, n_senone_active);</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  }</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  }</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span> </div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span> }</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span> </div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span> read_sendump(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *s, <a class="code" href="structbin__mdef__s.html">bin_mdef_t</a> *mdef, <span class="keywordtype">char</span> <span class="keyword">const</span> *file)</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span> {</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  FILE *fp;</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keywordtype">char</span> line[1000];</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  int32 i, n, r, c;</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  int32 do_swap, do_mmap;</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keywordtype">size_t</span> offset;</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordtype">int</span> n_clust = 0;</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="keywordtype">int</span> n_feat = s->g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>;</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keywordtype">int</span> n_density = s->g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>;</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keywordtype">int</span> n_sen = bin_mdef_n_sen(mdef);</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordtype">int</span> n_bits = 8;</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span> </div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  s->n_sen = n_sen; <span class="comment">/* FIXME: Should have been done earlier */</span></div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  do_mmap = cmd_ln_boolean_r(s->config, <span class="stringliteral">"-mmap"</span>);</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> </div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keywordflow">if</span> ((fp = fopen(file, <span class="stringliteral">"rb"</span>)) == NULL)</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> </div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  E_INFO(<span class="stringliteral">"Loading senones from dump file %s\n"</span>, file);</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">/* Read title size, title */</span></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">if</span> (fread(&n, <span class="keyword">sizeof</span>(int32), 1, fp) != 1) {</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  E_ERROR_SYSTEM(<span class="stringliteral">"Failed to read title size from %s"</span>, file);</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  }</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="comment">/* This is extremely bogus */</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  do_swap = 0;</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">if</span> (n < 1 || n > 999) {</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  SWAP_INT32(&n);</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">if</span> (n < 1 || n > 999) {</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  E_ERROR(<span class="stringliteral">"Title length %x in dump file %s out of range\n"</span>, n, file);</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  }</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  do_swap = 1;</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  }</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keywordflow">if</span> (fread(line, <span class="keyword">sizeof</span>(<span class="keywordtype">char</span>), n, fp) != n) {</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  E_ERROR_SYSTEM(<span class="stringliteral">"Cannot read title"</span>);</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  }</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keywordflow">if</span> (line[n - 1] != <span class="charliteral">'\0'</span>) {</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  E_ERROR(<span class="stringliteral">"Bad title in dump file\n"</span>);</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  }</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  E_INFO(<span class="stringliteral">"%s\n"</span>, line);</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> </div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="comment">/* Read header size, header */</span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keywordflow">if</span> (fread(&n, <span class="keyword">sizeof</span>(n), 1, fp) != 1) {</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  E_ERROR_SYSTEM(<span class="stringliteral">"Failed to read header size from %s"</span>, file);</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  }</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordflow">if</span> (do_swap) SWAP_INT32(&n);</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keywordflow">if</span> (fread(line, <span class="keyword">sizeof</span>(<span class="keywordtype">char</span>), n, fp) != n) {</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  E_ERROR_SYSTEM(<span class="stringliteral">"Cannot read header"</span>);</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  }</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keywordflow">if</span> (line[n - 1] != <span class="charliteral">'\0'</span>) {</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  E_ERROR(<span class="stringliteral">"Bad header in dump file\n"</span>);</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  }</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> </div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="comment">/* Read other header strings until string length = 0 */</span></div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keywordflow">for</span> (;;) {</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keywordflow">if</span> (fread(&n, <span class="keyword">sizeof</span>(n), 1, fp) != 1) {</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  E_ERROR_SYSTEM(<span class="stringliteral">"Failed to read header string size from %s"</span>, file);</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  }</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keywordflow">if</span> (do_swap) SWAP_INT32(&n);</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keywordflow">if</span> (n == 0)</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keywordflow">if</span> (fread(line, <span class="keyword">sizeof</span>(<span class="keywordtype">char</span>), n, fp) != n) {</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  E_ERROR_SYSTEM(<span class="stringliteral">"Cannot read header"</span>);</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  }</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="comment">/* Look for a cluster count, if present */</span></div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keywordflow">if</span> (!strncmp(line, <span class="stringliteral">"feature_count "</span>, strlen(<span class="stringliteral">"feature_count "</span>))) {</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  n_feat = atoi(line + strlen(<span class="stringliteral">"feature_count "</span>));</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  }</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keywordflow">if</span> (!strncmp(line, <span class="stringliteral">"mixture_count "</span>, strlen(<span class="stringliteral">"mixture_count "</span>))) {</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  n_density = atoi(line + strlen(<span class="stringliteral">"mixture_count "</span>));</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  }</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keywordflow">if</span> (!strncmp(line, <span class="stringliteral">"model_count "</span>, strlen(<span class="stringliteral">"model_count "</span>))) {</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  n_sen = atoi(line + strlen(<span class="stringliteral">"model_count "</span>));</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  }</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="keywordflow">if</span> (!strncmp(line, <span class="stringliteral">"cluster_count "</span>, strlen(<span class="stringliteral">"cluster_count "</span>))) {</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  n_clust = atoi(line + strlen(<span class="stringliteral">"cluster_count "</span>));</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  }</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="keywordflow">if</span> (!strncmp(line, <span class="stringliteral">"cluster_bits "</span>, strlen(<span class="stringliteral">"cluster_bits "</span>))) {</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  n_bits = atoi(line + strlen(<span class="stringliteral">"cluster_bits "</span>));</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  }</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  }</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> </div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="comment">/* Defaults for #rows, #columns in mixw array. */</span></div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  c = n_sen;</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  r = n_density;</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="keywordflow">if</span> (n_clust == 0) {</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="comment">/* Older mixw files have them here, and they might be padded. */</span></div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keywordflow">if</span> (fread(&r, <span class="keyword">sizeof</span>(r), 1, fp) != 1) {</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  E_ERROR_SYSTEM(<span class="stringliteral">"Cannot read #rows"</span>);</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  }</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keywordflow">if</span> (do_swap) SWAP_INT32(&r);</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keywordflow">if</span> (fread(&c, <span class="keyword">sizeof</span>(c), 1, fp) != 1) {</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  E_ERROR_SYSTEM(<span class="stringliteral">"Cannot read #columns"</span>);</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  }</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keywordflow">if</span> (do_swap) SWAP_INT32(&c);</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  E_INFO(<span class="stringliteral">"Rows: %d, Columns: %d\n"</span>, r, c);</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  }</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span> </div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keywordflow">if</span> (n_feat != s->g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>) {</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  E_ERROR(<span class="stringliteral">"Number of feature streams mismatch: %d != %d\n"</span>,</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  n_feat, s->g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>);</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  }</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="keywordflow">if</span> (n_density != s->g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>) {</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  E_ERROR(<span class="stringliteral">"Number of densities mismatch: %d != %d\n"</span>,</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  n_density, s->g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>);</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  }</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">if</span> (n_sen != s->n_sen) {</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  E_ERROR(<span class="stringliteral">"Number of senones mismatch: %d != %d\n"</span>,</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  n_sen, s->n_sen);</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  }</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span> </div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keywordflow">if</span> (!((n_clust == 0) || (n_clust == 15) || (n_clust == 16))) {</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  E_ERROR(<span class="stringliteral">"Cluster count must be 0, 15, or 16\n"</span>);</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  }</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="keywordflow">if</span> (n_clust == 15)</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  ++n_clust;</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span> </div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keywordflow">if</span> (!((n_bits == 8) || (n_bits == 4))) {</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  E_ERROR(<span class="stringliteral">"Cluster count must be 4 or 8\n"</span>);</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  }</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> </div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keywordflow">if</span> (do_mmap) {</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  E_INFO(<span class="stringliteral">"Using memory-mapped I/O for senones\n"</span>);</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  }</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  offset = ftell(fp);</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> </div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="comment">/* Allocate memory for pdfs (or memory map them) */</span></div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">if</span> (do_mmap) {</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  s->sendump_mmap = mmio_file_read(file);</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="comment">/* Get cluster codebook if any. */</span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <span class="keywordflow">if</span> (n_clust) {</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  s->mixw_cb = ((uint8 *) mmio_file_ptr(s->sendump_mmap)) + offset;</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  offset += n_clust;</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  }</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  }</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="comment">/* Get cluster codebook if any. */</span></div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keywordflow">if</span> (n_clust) {</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  s->mixw_cb = ckd_calloc(1, n_clust);</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="keywordflow">if</span> (fread(s->mixw_cb, 1, n_clust, fp) != (<span class="keywordtype">size_t</span>) n_clust) {</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  E_ERROR(<span class="stringliteral">"Failed to read %d bytes from sendump\n"</span>, n_clust);</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  }</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  }</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  }</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span> </div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="comment">/* Set up pointers, or read, or whatever */</span></div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="keywordflow">if</span> (s->sendump_mmap) {</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  s->mixw = ckd_calloc_2d(n_feat, n_density, <span class="keyword">sizeof</span>(*s->mixw));</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="keywordflow">for</span> (n = 0; n < n_feat; n++) {</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="keywordtype">int</span> step = c;</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="keywordflow">if</span> (n_bits == 4)</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  step = (step + 1) / 2;</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="keywordflow">for</span> (i = 0; i < r; i++) {</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  s->mixw[n][i] = ((uint8 *) mmio_file_ptr(s->sendump_mmap)) + offset;</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  offset += step;</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  }</div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  }</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  }</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  s->mixw = ckd_calloc_3d(n_feat, n_density, n_sen, <span class="keyword">sizeof</span>(***s->mixw));</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="comment">/* Read pdf values and ids */</span></div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="keywordflow">for</span> (n = 0; n < n_feat; n++) {</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keywordtype">int</span> step = c;</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="keywordflow">if</span> (n_bits == 4)</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  step = (step + 1) / 2;</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keywordflow">for</span> (i = 0; i < r; i++) {</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="keywordflow">if</span> (fread(s->mixw[n][i], <span class="keyword">sizeof</span>(***s->mixw), step, fp)</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  != (size_t) step) {</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  E_ERROR(<span class="stringliteral">"Failed to read %d bytes from sendump\n"</span>, step);</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  }</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  }</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  }</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  }</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span> </div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  fclose(fp);</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span> error_out:</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  fclose(fp);</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span> }</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span> </div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span> <span class="keyword">static</span> int32</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span> read_mixw(<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> * s, <span class="keywordtype">char</span> <span class="keyword">const</span> *file_name, <span class="keywordtype">double</span> SmoothMin)</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span> {</div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="keywordtype">char</span> **argname, **argval;</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keywordtype">char</span> eofchk;</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  FILE *fp;</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  int32 byteswap, chksum_present;</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  uint32 chksum;</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  float32 *pdf;</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  int32 i, f, c, n;</div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  int32 n_sen;</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  int32 n_feat;</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  int32 n_comp;</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  int32 n_err;</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span> </div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  E_INFO(<span class="stringliteral">"Reading mixture weights file '%s'\n"</span>, file_name);</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span> </div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordflow">if</span> ((fp = fopen(file_name, <span class="stringliteral">"rb"</span>)) == NULL)</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  E_FATAL_SYSTEM(<span class="stringliteral">"Failed to open mixture weights file '%s' for reading"</span>, file_name);</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span> </div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <span class="comment">/* Read header, including argument-value info and 32-bit byteorder magic */</span></div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="keywordflow">if</span> (bio_readhdr(fp, &argname, &argval, &byteswap) < 0)</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  E_FATAL(<span class="stringliteral">"Failed to read header from file '%s'\n"</span>, file_name);</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span> </div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="comment">/* Parse argument-value list */</span></div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  chksum_present = 0;</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="keywordflow">for</span> (i = 0; argname[i]; i++) {</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keywordflow">if</span> (strcmp(argname[i], <span class="stringliteral">"version"</span>) == 0) {</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="keywordflow">if</span> (strcmp(argval[i], MGAU_MIXW_VERSION) != 0)</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  E_WARN(<span class="stringliteral">"Version mismatch(%s): %s, expecting %s\n"</span>,</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  file_name, argval[i], MGAU_MIXW_VERSION);</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  }</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (strcmp(argname[i], <span class="stringliteral">"chksum0"</span>) == 0) {</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  chksum_present = 1; <span class="comment">/* Ignore the associated value */</span></div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  }</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  }</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  bio_hdrarg_free(argname, argval);</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  argname = argval = NULL;</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span> </div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  chksum = 0;</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> </div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="comment">/* Read #senones, #features, #codewords, arraysize */</span></div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="keywordflow">if</span> ((bio_fread(&n_sen, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) != 1)</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  || (bio_fread(&n_feat, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) !=</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  1)</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  || (bio_fread(&n_comp, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) !=</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  1)</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  || (bio_fread(&n, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) != 1)) {</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  E_FATAL(<span class="stringliteral">"bio_fread(%s) (arraysize) failed\n"</span>, file_name);</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  }</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">if</span> (n_feat != s->g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>)</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  E_FATAL(<span class="stringliteral">"#Features streams(%d) != %d\n"</span>, n_feat, s->g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>);</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="keywordflow">if</span> (n != n_sen * n_feat * n_comp) {</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  E_FATAL</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  (<span class="stringliteral">"%s: #float32s(%d) doesn't match header dimensions: %d x %d x %d\n"</span>,</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  file_name, i, n_sen, n_feat, n_comp);</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  }</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span> </div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <span class="comment">/* n_sen = number of mixture weights per codeword, which is</span></div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span> <span class="comment"> * fixed at the number of senones since we have only one codebook.</span></div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span> <span class="comment"> */</span></div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  s->n_sen = n_sen;</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span> </div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="comment">/* Quantized mixture weight arrays. */</span></div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  s->mixw = ckd_calloc_3d(n_feat, s->g-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">n_density</a>, n_sen, <span class="keyword">sizeof</span>(***s->mixw));</div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span> </div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="comment">/* Temporary structure to read in floats before conversion to (int32) logs3 */</span></div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  pdf = (float32 *) ckd_calloc(n_comp, <span class="keyword">sizeof</span>(float32));</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span> </div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="comment">/* Read senone probs data, normalize, floor, convert to logs3, truncate to 8 bits */</span></div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  n_err = 0;</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="keywordflow">for</span> (i = 0; i < n_sen; i++) {</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="keywordflow">for</span> (f = 0; f < n_feat; f++) {</div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keywordflow">if</span> (bio_fread((<span class="keywordtype">void</span> *) pdf, <span class="keyword">sizeof</span>(float32),</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  n_comp, fp, byteswap, &chksum) != n_comp) {</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  E_FATAL(<span class="stringliteral">"bio_fread(%s) (arraydata) failed\n"</span>, file_name);</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  }</div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span> </div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  <span class="comment">/* Normalize and floor */</span></div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="keywordflow">if</span> (vector_sum_norm(pdf, n_comp) <= 0.0)</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  n_err++;</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  vector_floor(pdf, n_comp, SmoothMin);</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  vector_sum_norm(pdf, n_comp);</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span> </div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="comment">/* Convert to LOG, quantize, and transpose */</span></div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="keywordflow">for</span> (c = 0; c < n_comp; c++) {</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  int32 qscr;</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span> </div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  qscr = -logmath_log(s->lmath_8b, pdf[c]);</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="keywordflow">if</span> ((qscr > <a class="code" href="tied__mgau__common_8h.html#ad739d757ed78293c18dc2386fd3b750e">MAX_NEG_MIXW</a>) || (qscr < 0))</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  qscr = <a class="code" href="tied__mgau__common_8h.html#ad739d757ed78293c18dc2386fd3b750e">MAX_NEG_MIXW</a>;</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  s->mixw[f][c][i] = qscr;</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  }</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  }</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  }</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keywordflow">if</span> (n_err > 0)</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  E_WARN(<span class="stringliteral">"Weight normalization failed for %d mixture weights components\n"</span>, n_err);</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span> </div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  ckd_free(pdf);</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span> </div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="keywordflow">if</span> (chksum_present)</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  bio_verify_chksum(fp, byteswap, chksum);</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span> </div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="keywordflow">if</span> (fread(&eofchk, 1, 1, fp) == 1)</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  E_FATAL(<span class="stringliteral">"More data than expected in %s\n"</span>, file_name);</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span> </div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  fclose(fp);</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span> </div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  E_INFO(<span class="stringliteral">"Read %d x %d x %d mixture weights\n"</span>, n_sen, n_feat, n_comp);</div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keywordflow">return</span> n_sen;</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span> }</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span> </div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> </div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span> <span class="keyword">static</span> <span class="keywordtype">int</span></div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span> split_topn(<span class="keywordtype">char</span> <span class="keyword">const</span> *str, uint8 *out, <span class="keywordtype">int</span> nfeat)</div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span> {</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="keywordtype">char</span> *topn_list = ckd_salloc(str);</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="keywordtype">char</span> *c, *cc;</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="keywordtype">int</span> i, maxn;</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span> </div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  c = topn_list;</div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  i = 0;</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  maxn = 0;</div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="keywordflow">while</span> (i < nfeat && (cc = strchr(c, <span class="charliteral">','</span>)) != NULL) {</div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  *cc = <span class="charliteral">'\0'</span>;</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  out[i] = atoi(c);</div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <span class="keywordflow">if</span> (out[i] > maxn) maxn = out[i];</div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  c = cc + 1;</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  ++i;</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  }</div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  <span class="keywordflow">if</span> (i < nfeat && *c != <span class="charliteral">'\0'</span>) {</div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  out[i] = atoi(c);</div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  <span class="keywordflow">if</span> (out[i] > maxn) maxn = out[i];</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  ++i;</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  }</div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keywordflow">while</span> (i < nfeat)</div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  out[i++] = maxn;</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span> </div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  ckd_free(topn_list);</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="keywordflow">return</span> maxn;</div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span> }</div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span> </div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> </div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span> <a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *</div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span> s2_semi_mgau_init(<a class="code" href="structacmod__s.html">acmod_t</a> *acmod)</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span> {</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *s;</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *ps;</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  <span class="keywordtype">char</span> <span class="keyword">const</span> *sendump_path;</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keywordtype">int</span> i;</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <span class="keywordtype">int</span> n_feat;</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span> </div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  s = ckd_calloc(1, <span class="keyword">sizeof</span>(*s));</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  s->config = acmod-><a class="code" href="structacmod__s.html#a3563f4d0bdc48d3ee140b9e28806279d">config</a>;</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span> </div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  s->lmath = logmath_retain(acmod-><a class="code" href="structacmod__s.html#a9de7e8ac9c0c4df3d2a9ad5406787f3c">lmath</a>);</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  <span class="comment">/* Log-add table. */</span></div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  s->lmath_8b = logmath_init(logmath_get_base(acmod-><a class="code" href="structacmod__s.html#a9de7e8ac9c0c4df3d2a9ad5406787f3c">lmath</a>), <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7">SENSCR_SHIFT</a>, TRUE);</div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="keywordflow">if</span> (s->lmath_8b == NULL)</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <span class="comment">/* Ensure that it is only 8 bits wide so that fast_logmath_add() works. */</span></div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  <span class="keywordflow">if</span> (logmath_get_width(s->lmath_8b) != 1) {</div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  E_ERROR(<span class="stringliteral">"Log base %f is too small to represent add table in 8 bits\n"</span>,</div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  logmath_get_base(s->lmath_8b));</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  }</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span> </div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  <span class="comment">/* Read means and variances. */</span></div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  <span class="keywordflow">if</span> ((s->g = <a class="code" href="ms__gauden_8h.html#ae4587b0aeb39fd926622a422969ecebc">gauden_init</a>(cmd_ln_str_r(s->config, <span class="stringliteral">"-mean"</span>),</div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  cmd_ln_str_r(s->config, <span class="stringliteral">"-var"</span>),</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  cmd_ln_float32_r(s->config, <span class="stringliteral">"-varfloor"</span>),</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  s->lmath)) == NULL)</div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  <span class="comment">/* Currently only a single codebook is supported. */</span></div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="keywordflow">if</span> (s->g-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">n_mgau</a> != 1)</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span> </div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  n_feat = s->g-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">n_feat</a>;</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span> </div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  <span class="comment">/* Verify n_feat and veclen, against acmod. */</span></div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  <span class="keywordflow">if</span> (n_feat != feat_dimension1(acmod-><a class="code" href="structacmod__s.html#a37ec6c2b1f3ada764842e08481239b34">fcb</a>)) {</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  E_ERROR(<span class="stringliteral">"Number of streams does not match: %d != %d\n"</span>,</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  n_feat, feat_dimension1(acmod-><a class="code" href="structacmod__s.html#a37ec6c2b1f3ada764842e08481239b34">fcb</a>));</div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  }</div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  <span class="keywordflow">for</span> (i = 0; i < n_feat; ++i) {</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  <span class="keywordflow">if</span> (s->g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[i] != feat_dimension2(acmod-><a class="code" href="structacmod__s.html#a37ec6c2b1f3ada764842e08481239b34">fcb</a>, i)) {</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  E_ERROR(<span class="stringliteral">"Dimension of stream %d does not match: %d != %d\n"</span>,</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  i, s->g-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">featlen</a>[i], feat_dimension2(acmod-><a class="code" href="structacmod__s.html#a37ec6c2b1f3ada764842e08481239b34">fcb</a>, i));</div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  }</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  }</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  <span class="comment">/* Read mixture weights */</span></div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keywordflow">if</span> ((sendump_path = cmd_ln_str_r(s->config, <span class="stringliteral">"-sendump"</span>))) {</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="keywordflow">if</span> (read_sendump(s, acmod-><a class="code" href="structacmod__s.html#a351548ff5547c29b4a684e10434a51dd">mdef</a>, sendump_path) < 0) {</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  }</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  }</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  <span class="keywordflow">if</span> (read_mixw(s, cmd_ln_str_r(s->config, <span class="stringliteral">"-mixw"</span>),</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  cmd_ln_float32_r(s->config, <span class="stringliteral">"-mixwfloor"</span>)) < 0) {</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keywordflow">goto</span> error_out;</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  }</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  }</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  s->ds_ratio = cmd_ln_int32_r(s->config, <span class="stringliteral">"-ds"</span>);</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> </div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="comment">/* Determine top-N for each feature */</span></div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  s->topn_beam = ckd_calloc(n_feat, <span class="keyword">sizeof</span>(*s->topn_beam));</div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  s->max_topn = cmd_ln_int32_r(s->config, <span class="stringliteral">"-topn"</span>);</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  split_topn(cmd_ln_str_r(s->config, <span class="stringliteral">"-topn_beam"</span>), s->topn_beam, n_feat);</div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  E_INFO(<span class="stringliteral">"Maximum top-N: %d "</span>, s->max_topn);</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  E_INFOCONT(<span class="stringliteral">"Top-N beams:"</span>);</div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="keywordflow">for</span> (i = 0; i < n_feat; ++i) {</div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  E_INFOCONT(<span class="stringliteral">" %d"</span>, s->topn_beam[i]);</div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  }</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  E_INFOCONT(<span class="stringliteral">"\n"</span>);</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span> </div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="comment">/* Top-N scores from recent frames */</span></div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  s-><a class="code" href="structs2__semi__mgau__s.html#a3cbc9fe683da5b7befe6b2712adae327">n_topn_hist</a> = cmd_ln_int32_r(s->config, <span class="stringliteral">"-pl_window"</span>) + 2;</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  s-><a class="code" href="structs2__semi__mgau__s.html#a8892e22acbf81b08972cb6d7968ed4ce">topn_hist</a> = (<a class="code" href="structvqFeature__s.html">vqFeature_t</a> ***)</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  ckd_calloc_3d(s-><a class="code" href="structs2__semi__mgau__s.html#a3cbc9fe683da5b7befe6b2712adae327">n_topn_hist</a>, n_feat, s->max_topn,</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <span class="keyword">sizeof</span>(***s-><a class="code" href="structs2__semi__mgau__s.html#a8892e22acbf81b08972cb6d7968ed4ce">topn_hist</a>));</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  s-><a class="code" href="structs2__semi__mgau__s.html#acfe1e5d43a25418ef19afba837f85cf7">topn_hist_n</a> = ckd_calloc_2d(s-><a class="code" href="structs2__semi__mgau__s.html#a3cbc9fe683da5b7befe6b2712adae327">n_topn_hist</a>, n_feat,</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  <span class="keyword">sizeof</span>(**s-><a class="code" href="structs2__semi__mgau__s.html#acfe1e5d43a25418ef19afba837f85cf7">topn_hist_n</a>));</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  <span class="keywordflow">for</span> (i = 0; i < s-><a class="code" href="structs2__semi__mgau__s.html#a3cbc9fe683da5b7befe6b2712adae327">n_topn_hist</a>; ++i) {</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keywordtype">int</span> j;</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="keywordflow">for</span> (j = 0; j < n_feat; ++j) {</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="keywordtype">int</span> k;</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  <span class="keywordflow">for</span> (k = 0; k < s->max_topn; ++k) {</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  s-><a class="code" href="structs2__semi__mgau__s.html#a8892e22acbf81b08972cb6d7968ed4ce">topn_hist</a>[i][j][k].score = WORST_DIST;</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  s-><a class="code" href="structs2__semi__mgau__s.html#a8892e22acbf81b08972cb6d7968ed4ce">topn_hist</a>[i][j][k].codeword = k;</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  }</div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  }</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  }</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> </div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  ps = (<a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *)s;</div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  ps-><a class="code" href="structps__mgau__s.html#a931f7cbf334b8ed50b0e1c2803a10c67">vt</a> = &s2_semi_mgau_funcs;</div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keywordflow">return</span> ps;</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span> error_out:</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  s2_semi_mgau_free(ps_mgau_base(s));</div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keywordflow">return</span> NULL;</div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span> }</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> </div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span> <span class="keywordtype">int</span></div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span> s2_semi_mgau_mllr_transform(<a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *ps,</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  <a class="code" href="structps__mllr__s.html">ps_mllr_t</a> *mllr)</div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span> {</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *s = (<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *)ps;</div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="keywordflow">return</span> <a class="code" href="ms__gauden_8h.html#ab640722f2c2b1e8bc6e883d9b5b72494">gauden_mllr_transform</a>(s->g, mllr, s->config);</div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span> }</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span> </div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span> <span class="keywordtype">void</span></div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span> s2_semi_mgau_free(<a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *ps)</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span> {</div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *s = (<a class="code" href="structs2__semi__mgau__s.html">s2_semi_mgau_t</a> *)ps;</div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span> </div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  logmath_free(s->lmath);</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  logmath_free(s->lmath_8b);</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="keywordflow">if</span> (s->sendump_mmap) {</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  ckd_free_2d(s->mixw); </div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  mmio_file_unmap(s->sendump_mmap);</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  }</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  ckd_free_3d(s->mixw);</div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  <span class="keywordflow">if</span> (s->mixw_cb)</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  ckd_free(s->mixw_cb);</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  }</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <a class="code" href="ms__gauden_8h.html#a0306e088fa33894ca40182d2392ffe4d">gauden_free</a>(s->g);</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  ckd_free(s->topn_beam);</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  ckd_free_2d(s-><a class="code" href="structs2__semi__mgau__s.html#acfe1e5d43a25418ef19afba837f85cf7">topn_hist_n</a>);</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  ckd_free_3d((<span class="keywordtype">void</span> **)s-><a class="code" href="structs2__semi__mgau__s.html#a8892e22acbf81b08972cb6d7968ed4ce">topn_hist</a>);</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  ckd_free(s);</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span> }</div><div class="ttc" id="structgauden__t_html_ab5104d8fa59bc94b12b36104dd4c19ac"><div class="ttname"><a href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac">gauden_t::n_density</a></div><div class="ttdeci">int32 n_density</div><div class="ttdoc">Number gaussian densities in each codebook-feature stream. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00090">ms_gauden.h:90</a></div></div>
<div class="ttc" id="ms__gauden_8h_html_a0306e088fa33894ca40182d2392ffe4d"><div class="ttname"><a href="ms__gauden_8h.html#a0306e088fa33894ca40182d2392ffe4d">gauden_free</a></div><div class="ttdeci">void gauden_free(gauden_t *g)</div><div class="ttdoc">Release memory allocated by gauden_init. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8c_source.html#l00399">ms_gauden.c:399</a></div></div>
<div class="ttc" id="structgauden__t_html_a315918a44ff97b95a6fcdf8739d8089b"><div class="ttname"><a href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b">gauden_t::det</a></div><div class="ttdeci">mfcc_t *** det</div><div class="ttdoc">log(determinant) for each variance vector; actually, log(sqrt(2*pi*det)) </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00085">ms_gauden.h:85</a></div></div>
<div class="ttc" id="structacmod__s_html_a9de7e8ac9c0c4df3d2a9ad5406787f3c"><div class="ttname"><a href="structacmod__s.html#a9de7e8ac9c0c4df3d2a9ad5406787f3c">acmod_s::lmath</a></div><div class="ttdeci">logmath_t * lmath</div><div class="ttdoc">Log-math computation. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00151">acmod.h:151</a></div></div>
<div class="ttc" id="structs2__semi__mgau__s_html_a3cbc9fe683da5b7befe6b2712adae327"><div class="ttname"><a href="structs2__semi__mgau__s.html#a3cbc9fe683da5b7befe6b2712adae327">s2_semi_mgau_s::n_topn_hist</a></div><div class="ttdeci">int n_topn_hist</div><div class="ttdoc">Number of past frames tracked. </div><div class="ttdef"><b>Definition:</b> <a href="s2__semi__mgau_8h_source.html#l00077">s2_semi_mgau.h:77</a></div></div>
<div class="ttc" id="structs2__semi__mgau__s_html_a8892e22acbf81b08972cb6d7968ed4ce"><div class="ttname"><a href="structs2__semi__mgau__s.html#a8892e22acbf81b08972cb6d7968ed4ce">s2_semi_mgau_s::topn_hist</a></div><div class="ttdeci">vqFeature_t *** topn_hist</div><div class="ttdoc">Top-N scores and codewords for past frames. </div><div class="ttdef"><b>Definition:</b> <a href="s2__semi__mgau_8h_source.html#l00074">s2_semi_mgau.h:74</a></div></div>
<div class="ttc" id="ms__gauden_8h_html_ab640722f2c2b1e8bc6e883d9b5b72494"><div class="ttname"><a href="ms__gauden_8h.html#ab640722f2c2b1e8bc6e883d9b5b72494">gauden_mllr_transform</a></div><div class="ttdeci">int32 gauden_mllr_transform(gauden_t *s, ps_mllr_t *mllr, cmd_ln_t *config)</div><div class="ttdoc">Transform Gaussians according to an MLLR matrix (or, eventually, more). </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8c_source.html#l00550">ms_gauden.c:550</a></div></div>
<div class="ttc" id="ms__gauden_8h_html_ae4587b0aeb39fd926622a422969ecebc"><div class="ttname"><a href="ms__gauden_8h.html#ae4587b0aeb39fd926622a422969ecebc">gauden_init</a></div><div class="ttdeci">gauden_t * gauden_init(char const *meanfile, char const *varfile, float32 varfloor, logmath_t *lmath)</div><div class="ttdoc">Read mixture gaussian codebooks from the given files. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8c_source.html#l00361">ms_gauden.c:361</a></div></div>
<div class="ttc" id="structbin__mdef__s_html"><div class="ttname"><a href="structbin__mdef__s.html">bin_mdef_s</a></div><div class="ttdef"><b>Definition:</b> <a href="bin__mdef_8h_source.html#l00117">bin_mdef.h:117</a></div></div>
<div class="ttc" id="structs2__semi__mgau__s_html"><div class="ttname"><a href="structs2__semi__mgau__s.html">s2_semi_mgau_s</a></div><div class="ttdef"><b>Definition:</b> <a href="s2__semi__mgau_8h_source.html#l00059">s2_semi_mgau.h:59</a></div></div>
<div class="ttc" id="structacmod__s_html_a3563f4d0bdc48d3ee140b9e28806279d"><div class="ttname"><a href="structacmod__s.html#a3563f4d0bdc48d3ee140b9e28806279d">acmod_s::config</a></div><div class="ttdeci">cmd_ln_t * config</div><div class="ttdoc">Configuration. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00150">acmod.h:150</a></div></div>
<div class="ttc" id="structgauden__t_html_aca099d830de926e628ac0b523046b32c"><div class="ttname"><a href="structgauden__t.html#aca099d830de926e628ac0b523046b32c">gauden_t::featlen</a></div><div class="ttdeci">int32 * featlen</div><div class="ttdoc">feature length for each feature </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00091">ms_gauden.h:91</a></div></div>
<div class="ttc" id="tied__mgau__common_8h_html_a740dfe5b30e702ba8b2ec7426bd4d57e"><div class="ttname"><a href="tied__mgau__common_8h.html#a740dfe5b30e702ba8b2ec7426bd4d57e">GMMSUB</a></div><div class="ttdeci">#define GMMSUB(a, b)</div><div class="ttdoc">Subtract GMM component b (assumed to be positive) and saturate. </div><div class="ttdef"><b>Definition:</b> <a href="tied__mgau__common_8h_source.html#l00062">tied_mgau_common.h:62</a></div></div>
<div class="ttc" id="structgauden__t_html_af15df11bd2f3ab0290e0a33ca15c836c"><div class="ttname"><a href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c">gauden_t::n_mgau</a></div><div class="ttdeci">int32 n_mgau</div><div class="ttdoc">Number codebooks. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00088">ms_gauden.h:88</a></div></div>
<div class="ttc" id="structps__mllr__s_html"><div class="ttname"><a href="structps__mllr__s.html">ps_mllr_s</a></div><div class="ttdoc">Feature space linear transform structure. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00082">acmod.h:82</a></div></div>
<div class="ttc" id="hmm_8h_html_af94da16e3e5b550b9be05b0f07402cc7"><div class="ttname"><a href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7">SENSCR_SHIFT</a></div><div class="ttdeci">#define SENSCR_SHIFT</div><div class="ttdoc">Shift count for senone scores. </div><div class="ttdef"><b>Definition:</b> <a href="hmm_8h_source.html#l00073">hmm.h:73</a></div></div>
<div class="ttc" id="structgauden__t_html_aa76d63009601dcb6b99f17db96167f37"><div class="ttname"><a href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37">gauden_t::mean</a></div><div class="ttdeci">mfcc_t **** mean</div><div class="ttdoc">mean[codebook][feature][codeword] vector </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00083">ms_gauden.h:83</a></div></div>
<div class="ttc" id="structacmod__s_html_a37ec6c2b1f3ada764842e08481239b34"><div class="ttname"><a href="structacmod__s.html#a37ec6c2b1f3ada764842e08481239b34">acmod_s::fcb</a></div><div class="ttdeci">feat_t * fcb</div><div class="ttdoc">Dynamic feature computation. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00156">acmod.h:156</a></div></div>
<div class="ttc" id="structgauden__t_html_a6dea221962b4a278dbae4806925a7be0"><div class="ttname"><a href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0">gauden_t::n_feat</a></div><div class="ttdeci">int32 n_feat</div><div class="ttdoc">Number feature streams in each codebook. </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00089">ms_gauden.h:89</a></div></div>
<div class="ttc" id="structs2__semi__mgau__s_html_acfe1e5d43a25418ef19afba837f85cf7"><div class="ttname"><a href="structs2__semi__mgau__s.html#acfe1e5d43a25418ef19afba837f85cf7">s2_semi_mgau_s::topn_hist_n</a></div><div class="ttdeci">uint8 ** topn_hist_n</div><div class="ttdoc">Variable top-N for past frames. </div><div class="ttdef"><b>Definition:</b> <a href="s2__semi__mgau_8h_source.html#l00075">s2_semi_mgau.h:75</a></div></div>
<div class="ttc" id="structps__mgau__s_html_a931f7cbf334b8ed50b0e1c2803a10c67"><div class="ttname"><a href="structps__mgau__s.html#a931f7cbf334b8ed50b0e1c2803a10c67">ps_mgau_s::vt</a></div><div class="ttdeci">ps_mgaufuncs_t * vt</div><div class="ttdoc">vtable of mgau functions. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00114">acmod.h:114</a></div></div>
<div class="ttc" id="tied__mgau__common_8h_html_a947ea19b4351ecbf70330e089994c3a1"><div class="ttname"><a href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1">fast_logmath_add</a></div><div class="ttdeci">LOGMATH_INLINE int fast_logmath_add(logmath_t *lmath, int mlx, int mly)</div><div class="ttdoc">Quickly log-add two negated log probabilities. </div><div class="ttdef"><b>Definition:</b> <a href="tied__mgau__common_8h_source.html#l00103">tied_mgau_common.h:103</a></div></div>
<div class="ttc" id="structacmod__s_html_a351548ff5547c29b4a684e10434a51dd"><div class="ttname"><a href="structacmod__s.html#a351548ff5547c29b4a684e10434a51dd">acmod_s::mdef</a></div><div class="ttdeci">bin_mdef_t * mdef</div><div class="ttdoc">Model definition. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00159">acmod.h:159</a></div></div>
<div class="ttc" id="tied__mgau__common_8h_html_a965d50d73044c3f2dc2589662fd2e89e"><div class="ttname"><a href="tied__mgau__common_8h.html#a965d50d73044c3f2dc2589662fd2e89e">MAX_NEG_ASCR</a></div><div class="ttdeci">#define MAX_NEG_ASCR</div><div class="ttdoc">Maximum negated acoustic score value. </div><div class="ttdef"><b>Definition:</b> <a href="tied__mgau__common_8h_source.html#l00083">tied_mgau_common.h:83</a></div></div>
<div class="ttc" id="structps__mgaufuncs__s_html"><div class="ttname"><a href="structps__mgaufuncs__s.html">ps_mgaufuncs_s</a></div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00098">acmod.h:98</a></div></div>
<div class="ttc" id="structs2__semi__mgau__s_html_ad8cb7f058bcc7402dd6a41c61f1b26e5"><div class="ttname"><a href="structs2__semi__mgau__s.html#ad8cb7f058bcc7402dd6a41c61f1b26e5">s2_semi_mgau_s::f</a></div><div class="ttdeci">vqFeature_t ** f</div><div class="ttdoc">Topn-N for currently scoring frame. </div><div class="ttdef"><b>Definition:</b> <a href="s2__semi__mgau_8h_source.html#l00076">s2_semi_mgau.h:76</a></div></div>
<div class="ttc" id="tied__mgau__common_8h_html_ad739d757ed78293c18dc2386fd3b750e"><div class="ttname"><a href="tied__mgau__common_8h.html#ad739d757ed78293c18dc2386fd3b750e">MAX_NEG_MIXW</a></div><div class="ttdeci">#define MAX_NEG_MIXW</div><div class="ttdoc">Maximum negated mixture weight value. </div><div class="ttdef"><b>Definition:</b> <a href="tied__mgau__common_8h_source.html#l00082">tied_mgau_common.h:82</a></div></div>
<div class="ttc" id="structacmod__s_html"><div class="ttname"><a href="structacmod__s.html">acmod_s</a></div><div class="ttdoc">Acoustic model structure. </div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00148">acmod.h:148</a></div></div>
<div class="ttc" id="structgauden__t_html_a172cb69c018608ab8c33d54e6f0fdf19"><div class="ttname"><a href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19">gauden_t::var</a></div><div class="ttdeci">mfcc_t **** var</div><div class="ttdoc">like mean; diagonal covariance vector only </div><div class="ttdef"><b>Definition:</b> <a href="ms__gauden_8h_source.html#l00084">ms_gauden.h:84</a></div></div>
<div class="ttc" id="structps__mgau__s_html"><div class="ttname"><a href="structps__mgau__s.html">ps_mgau_s</a></div><div class="ttdef"><b>Definition:</b> <a href="acmod_8h_source.html#l00113">acmod.h:113</a></div></div>
<div class="ttc" id="tied__mgau__common_8h_html"><div class="ttname"><a href="tied__mgau__common_8h.html">tied_mgau_common.h</a></div><div class="ttdoc">Common code shared between SC and PTM (tied-state) models. </div></div>
<div class="ttc" id="structvqFeature__s_html"><div class="ttname"><a href="structvqFeature__s.html">vqFeature_s</a></div><div class="ttdef"><b>Definition:</b> <a href="s2__semi__mgau_8c_source.html#l00070">s2_semi_mgau.c:70</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>s2_semi_mgau.c</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>
|