<!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.5"/>
<title>PolarSSL v1.3.8: havege.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="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">PolarSSL v1.3.8
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="modules.html"><span>Modules</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 id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_4478130ea462cc4195c75f9e6ba20061.html">library</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">havege.c</div> </div>
</div><!--header-->
<div class="contents">
<a href="havege_8c.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> </div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * The HAVEGE RNG was designed by Andre Seznec in 2002.</span></div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * http://www.irisa.fr/caps/projects/hipsor/publi.php</span></div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * Contact: seznec(at)irisa_dot_fr - orocheco(at)irisa_dot_fr</span></div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#if !defined(POLARSSL_CONFIG_FILE)</span></div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor"></span><span class="preprocessor">#include "<a class="code" href="config_8h.html">polarssl/config.h</a>"</span></div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#else</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor"></span><span class="preprocessor">#include POLARSSL_CONFIG_FILE</span></div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor"></span><span class="preprocessor">#endif</span></div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#if defined(POLARSSL_HAVEGE_C)</span></div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "<a class="code" href="havege_8h.html">polarssl/havege.h</a>"</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include "<a class="code" href="timing_8h.html">polarssl/timing.h</a>"</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include <string.h></span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">/* Implementation that should never be optimized out by the compiler */</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword">static</span> <span class="keywordtype">void</span> polarssl_zeroize( <span class="keywordtype">void</span> *v, <span class="keywordtype">size_t</span> n ) {</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">volatile</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *p = v; <span class="keywordflow">while</span>( n-- ) *p++ = 0;</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> </div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">/* ------------------------------------------------------------------------</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * On average, one iteration accesses two 8-word blocks in the havege WALK</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * table, and generates 16 words in the RES array.</span></div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> * The data read in the WALK table is updated and permuted after each use.</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> * The result of the hardware clock counter read is used for this update.</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> *</span></div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> * 25 conditional tests are present. The conditional tests are grouped in</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * two nested groups of 12 conditional tests and 1 test that controls the</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> * permutation; on average, there should be 6 tests executed and 3 of them</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> * should be mispredicted.</span></div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> * ------------------------------------------------------------------------</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#define SWAP(X,Y) { int *T = X; X = Y; Y = T; }</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor">#define TST1_ENTER if( PTEST & 1 ) { PTEST ^= 3; PTEST >>= 1;</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor"></span><span class="preprocessor">#define TST2_ENTER if( PTEST & 1 ) { PTEST ^= 3; PTEST >>= 1;</span></div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="preprocessor">#define TST1_LEAVE U1++; }</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor"></span><span class="preprocessor">#define TST2_LEAVE U2++; }</span></div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="preprocessor">#define ONE_ITERATION \</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor"> PTEST = PT1 >> 20; \</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor"> TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \</span></div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor"> TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \</span></div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor"> TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor"> TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="preprocessor"> TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="preprocessor"> TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \</span></div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor"> PTX = (PT1 >> 18) & 7; \</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="preprocessor"> PT1 &= 0x1FFF; \</span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="preprocessor"> PT2 &= 0x1FFF; \</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="preprocessor"> CLK = (int) hardclock(); \</span></div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="preprocessor"> i = 0; \</span></div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="preprocessor"> A = &WALK[PT1 ]; RES[i++] ^= *A; \</span></div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="preprocessor"> B = &WALK[PT2 ]; RES[i++] ^= *B; \</span></div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="preprocessor"> C = &WALK[PT1 ^ 1]; RES[i++] ^= *C; \</span></div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="preprocessor"> D = &WALK[PT2 ^ 4]; RES[i++] ^= *D; \</span></div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="preprocessor"> IN = (*A >> (1)) ^ (*A << (31)) ^ CLK; \</span></div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor"> *A = (*B >> (2)) ^ (*B << (30)) ^ CLK; \</span></div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="preprocessor"> *B = IN ^ U1; \</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="preprocessor"> *C = (*C >> (3)) ^ (*C << (29)) ^ CLK; \</span></div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="preprocessor"> *D = (*D >> (4)) ^ (*D << (28)) ^ CLK; \</span></div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="preprocessor"> A = &WALK[PT1 ^ 2]; RES[i++] ^= *A; \</span></div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="preprocessor"> B = &WALK[PT2 ^ 2]; RES[i++] ^= *B; \</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="preprocessor"> C = &WALK[PT1 ^ 3]; RES[i++] ^= *C; \</span></div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="preprocessor"> D = &WALK[PT2 ^ 6]; RES[i++] ^= *D; \</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="preprocessor"> if( PTEST & 1 ) SWAP( A, C ); \</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="preprocessor"> IN = (*A >> (5)) ^ (*A << (27)) ^ CLK; \</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="preprocessor"> *A = (*B >> (6)) ^ (*B << (26)) ^ CLK; \</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="preprocessor"> *B = IN; CLK = (int) hardclock(); \</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="preprocessor"> *C = (*C >> (7)) ^ (*C << (25)) ^ CLK; \</span></div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="preprocessor"> *D = (*D >> (8)) ^ (*D << (24)) ^ CLK; \</span></div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor"> A = &WALK[PT1 ^ 4]; \</span></div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="preprocessor"> B = &WALK[PT2 ^ 1]; \</span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="preprocessor"> PTEST = PT2 >> 1; \</span></div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="preprocessor"> PT2 = (RES[(i - 8) ^ PTY] ^ WALK[PT2 ^ PTY ^ 7]); \</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="preprocessor"> PT2 = ((PT2 & 0x1FFF) & (~8)) ^ ((PT1 ^ 8) & 0x8); \</span></div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="preprocessor"> PTY = (PT2 >> 10) & 7; \</span></div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="preprocessor"> TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \</span></div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="preprocessor"> TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \</span></div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="preprocessor"> TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \</span></div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="preprocessor"> TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \</span></div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="preprocessor"> TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \</span></div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="preprocessor"> TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \</span></div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="preprocessor"> C = &WALK[PT1 ^ 5]; \</span></div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor"> D = &WALK[PT2 ^ 5]; \</span></div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="preprocessor"> RES[i++] ^= *A; \</span></div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="preprocessor"> RES[i++] ^= *B; \</span></div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="preprocessor"> RES[i++] ^= *C; \</span></div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="preprocessor"> RES[i++] ^= *D; \</span></div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="preprocessor"> IN = (*A >> ( 9)) ^ (*A << (23)) ^ CLK; \</span></div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="preprocessor"> *A = (*B >> (10)) ^ (*B << (22)) ^ CLK; \</span></div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="preprocessor"> *B = IN ^ U2; \</span></div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="preprocessor"> *C = (*C >> (11)) ^ (*C << (21)) ^ CLK; \</span></div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="preprocessor"> *D = (*D >> (12)) ^ (*D << (20)) ^ CLK; \</span></div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="preprocessor"> A = &WALK[PT1 ^ 6]; RES[i++] ^= *A; \</span></div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="preprocessor"> B = &WALK[PT2 ^ 3]; RES[i++] ^= *B; \</span></div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="preprocessor"> C = &WALK[PT1 ^ 7]; RES[i++] ^= *C; \</span></div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="preprocessor"> D = &WALK[PT2 ^ 7]; RES[i++] ^= *D; \</span></div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="preprocessor"> IN = (*A >> (13)) ^ (*A << (19)) ^ CLK; \</span></div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="preprocessor"> *A = (*B >> (14)) ^ (*B << (18)) ^ CLK; \</span></div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="preprocessor"> *B = IN; \</span></div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="preprocessor"> *C = (*C >> (15)) ^ (*C << (17)) ^ CLK; \</span></div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="preprocessor"> *D = (*D >> (16)) ^ (*D << (16)) ^ CLK; \</span></div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="preprocessor"> PT1 = ( RES[( i - 8 ) ^ PTX] ^ \</span></div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="preprocessor"> WALK[PT1 ^ PTX ^ 7] ) & (~1); \</span></div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="preprocessor"> PT1 ^= (PT2 ^ 0x10) & 0x10; \</span></div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="preprocessor"> \</span></div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="preprocessor"> for( n++, i = 0; i < 16; i++ ) \</span></div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="preprocessor"> hs->pool[n % COLLECT_SIZE] ^= RES[i];</span></div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="preprocessor"></span></div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> * Entropy gathering function</span></div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="keyword">static</span> <span class="keywordtype">void</span> havege_fill( <a class="code" href="structhavege__state.html">havege_state</a> *hs )</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>  <span class="keywordtype">int</span> i, n = 0;</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordtype">int</span> U1, U2, *A, *B, *C, *D;</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordtype">int</span> PT1, PT2, *WALK, RES[16];</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordtype">int</span> PTX, PTY, CLK, PTEST, IN;</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>  WALK = hs-><a class="code" href="structhavege__state.html#a885e69e7f14862cca5b242c42c131cab">WALK</a>;</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  PT1 = hs-><a class="code" href="structhavege__state.html#a9062068726aa0bb8ba3ecd6554f77b00">PT1</a>;</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  PT2 = hs-><a class="code" href="structhavege__state.html#abbe69e415975efd1a8f850dd2e74dae7">PT2</a>;</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  PTX = U1 = 0;</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  PTY = U2 = 0;</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  memset( RES, 0, <span class="keyword">sizeof</span>( RES ) );</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>  <span class="keywordflow">while</span>( n < <a class="code" href="havege_8h.html#a3a37b97f6111e51ff65bd8bf3fd8677b">COLLECT_SIZE</a> * 4 )</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  {</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  ONE_ITERATION</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  ONE_ITERATION</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  ONE_ITERATION</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  ONE_ITERATION</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> </div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  hs-><a class="code" href="structhavege__state.html#a9062068726aa0bb8ba3ecd6554f77b00">PT1</a> = PT1;</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  hs-><a class="code" href="structhavege__state.html#abbe69e415975efd1a8f850dd2e74dae7">PT2</a> = PT2;</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  hs-><a class="code" href="structhavege__state.html#ab7974b01743ac5cfc8439621cd6acd6a">offset</a>[0] = 0;</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  hs-><a class="code" href="structhavege__state.html#ab7974b01743ac5cfc8439621cd6acd6a">offset</a>[1] = <a class="code" href="havege_8h.html#a3a37b97f6111e51ff65bd8bf3fd8677b">COLLECT_SIZE</a> / 2;</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span> }</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * HAVEGE initialization</span></div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="keywordtype">void</span> <a class="code" href="havege_8h.html#a86f553a34ca010f502beada3729f202b">havege_init</a>( <a class="code" href="structhavege__state.html">havege_state</a> *hs )</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>  memset( hs, 0, <span class="keyword">sizeof</span>( <a class="code" href="structhavege__state.html">havege_state</a> ) );</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  havege_fill( hs );</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> }</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> </div>
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="keywordtype">void</span> <a class="code" href="havege_8h.html#af7432cd400b6f89ec3b4b14e9b0fe4f9">havege_free</a>( <a class="code" href="structhavege__state.html">havege_state</a> *hs )</div>
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span> {</div>
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">if</span>( hs == NULL )</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> </div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  polarssl_zeroize( hs, <span class="keyword">sizeof</span>( <a class="code" href="structhavege__state.html">havege_state</a> ) );</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> }</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> </div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="comment">/*</span></div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"> * HAVEGE rand function</span></div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> */</span></div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="keywordtype">int</span> <a class="code" href="havege_8h.html#a6a8f466fa0a92a0a75c28cbb4eb5156a">havege_random</a>( <span class="keywordtype">void</span> *p_rng, <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *buf, <span class="keywordtype">size_t</span> len )</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> {</div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordtype">int</span> val;</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordtype">size_t</span> use_len;</div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <a class="code" href="structhavege__state.html">havege_state</a> *hs = (<a class="code" href="structhavege__state.html">havege_state</a> *) p_rng;</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *p = buf;</div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">while</span>( len > 0 )</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  {</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  use_len = len;</div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">if</span>( use_len > <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>) )</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  use_len = <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>);</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span>( hs-><a class="code" href="structhavege__state.html#ab7974b01743ac5cfc8439621cd6acd6a">offset</a>[1] >= <a class="code" href="havege_8h.html#a3a37b97f6111e51ff65bd8bf3fd8677b">COLLECT_SIZE</a> )</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  havege_fill( hs );</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  val = hs-><a class="code" href="structhavege__state.html#aca8fe99805760ca5065d39c2f57c481c">pool</a>[hs-><a class="code" href="structhavege__state.html#ab7974b01743ac5cfc8439621cd6acd6a">offset</a>[0]++];</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  val ^= hs-><a class="code" href="structhavege__state.html#aca8fe99805760ca5065d39c2f57c481c">pool</a>[hs-><a class="code" href="structhavege__state.html#ab7974b01743ac5cfc8439621cd6acd6a">offset</a>[1]++];</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  memcpy( p, &val, use_len );</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>  len -= use_len;</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  p += use_len;</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> </div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">return</span>( 0 );</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> }</div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span> </div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="preprocessor">#endif </span><span class="comment">/* POLARSSL_HAVEGE_C */</span><span class="preprocessor"></span></div>
<div class="ttc" id="havege_8h_html_a3a37b97f6111e51ff65bd8bf3fd8677b"><div class="ttname"><a href="havege_8h.html#a3a37b97f6111e51ff65bd8bf3fd8677b">COLLECT_SIZE</a></div><div class="ttdeci">#define COLLECT_SIZE</div><div class="ttdef"><b>Definition:</b> <a href="havege_8h_source.html#l00032">havege.h:32</a></div></div>
<div class="ttc" id="havege_8h_html_af7432cd400b6f89ec3b4b14e9b0fe4f9"><div class="ttname"><a href="havege_8h.html#af7432cd400b6f89ec3b4b14e9b0fe4f9">havege_free</a></div><div class="ttdeci">void havege_free(havege_state *hs)</div><div class="ttdoc">Clear HAVEGE state. </div></div>
<div class="ttc" id="config_8h_html"><div class="ttname"><a href="config_8h.html">config.h</a></div><div class="ttdoc">Configuration options (set of defines) </div></div>
<div class="ttc" id="structhavege__state_html_abbe69e415975efd1a8f850dd2e74dae7"><div class="ttname"><a href="structhavege__state.html#abbe69e415975efd1a8f850dd2e74dae7">havege_state::PT2</a></div><div class="ttdeci">int PT2</div><div class="ttdef"><b>Definition:</b> <a href="havege_8h_source.html#l00043">havege.h:43</a></div></div>
<div class="ttc" id="structhavege__state_html"><div class="ttname"><a href="structhavege__state.html">havege_state</a></div><div class="ttdoc">HAVEGE state structure. </div><div class="ttdef"><b>Definition:</b> <a href="havege_8h_source.html#l00041">havege.h:41</a></div></div>
<div class="ttc" id="havege_8h_html"><div class="ttname"><a href="havege_8h.html">havege.h</a></div><div class="ttdoc">HAVEGE: HArdware Volatile Entropy Gathering and Expansion. </div></div>
<div class="ttc" id="structhavege__state_html_aca8fe99805760ca5065d39c2f57c481c"><div class="ttname"><a href="structhavege__state.html#aca8fe99805760ca5065d39c2f57c481c">havege_state::pool</a></div><div class="ttdeci">int pool[COLLECT_SIZE]</div><div class="ttdef"><b>Definition:</b> <a href="havege_8h_source.html#l00044">havege.h:44</a></div></div>
<div class="ttc" id="structhavege__state_html_a885e69e7f14862cca5b242c42c131cab"><div class="ttname"><a href="structhavege__state.html#a885e69e7f14862cca5b242c42c131cab">havege_state::WALK</a></div><div class="ttdeci">int WALK[8192]</div><div class="ttdef"><b>Definition:</b> <a href="havege_8h_source.html#l00045">havege.h:45</a></div></div>
<div class="ttc" id="havege_8h_html_a6a8f466fa0a92a0a75c28cbb4eb5156a"><div class="ttname"><a href="havege_8h.html#a6a8f466fa0a92a0a75c28cbb4eb5156a">havege_random</a></div><div class="ttdeci">int havege_random(void *p_rng, unsigned char *output, size_t len)</div><div class="ttdoc">HAVEGE rand function. </div></div>
<div class="ttc" id="structhavege__state_html_ab7974b01743ac5cfc8439621cd6acd6a"><div class="ttname"><a href="structhavege__state.html#ab7974b01743ac5cfc8439621cd6acd6a">havege_state::offset</a></div><div class="ttdeci">int offset[2]</div><div class="ttdef"><b>Definition:</b> <a href="havege_8h_source.html#l00043">havege.h:43</a></div></div>
<div class="ttc" id="havege_8h_html_a86f553a34ca010f502beada3729f202b"><div class="ttname"><a href="havege_8h.html#a86f553a34ca010f502beada3729f202b">havege_init</a></div><div class="ttdeci">void havege_init(havege_state *hs)</div><div class="ttdoc">HAVEGE initialization. </div></div>
<div class="ttc" id="structhavege__state_html_a9062068726aa0bb8ba3ecd6554f77b00"><div class="ttname"><a href="structhavege__state.html#a9062068726aa0bb8ba3ecd6554f77b00">havege_state::PT1</a></div><div class="ttdeci">int PT1</div><div class="ttdef"><b>Definition:</b> <a href="havege_8h_source.html#l00043">havege.h:43</a></div></div>
<div class="ttc" id="timing_8h_html"><div class="ttname"><a href="timing_8h.html">timing.h</a></div><div class="ttdoc">Portable interface to the CPU cycle counter. </div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Thu Jul 31 2014 11:35:51 for PolarSSL v1.3.8 by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.5
</small></address>
</body>
</html>
