Lines Matching refs:hs
164 hs->pool[n % COLLECT_SIZE] ^= RES[i];
169 static void havege_fill( havege_state *hs )
176 WALK = hs->WALK;
177 PT1 = hs->PT1;
178 PT2 = hs->PT2;
193 hs->PT1 = PT1;
194 hs->PT2 = PT2;
196 hs->offset[0] = 0;
197 hs->offset[1] = COLLECT_SIZE / 2;
203 void havege_init( havege_state *hs )
205 memset( hs, 0, sizeof( havege_state ) );
207 havege_fill( hs );
216 havege_state *hs = (havege_state *) p_rng;
218 if( hs->offset[1] >= COLLECT_SIZE )
219 havege_fill( hs );
221 ret = hs->pool[hs->offset[0]++];
222 ret ^= hs->pool[hs->offset[1]++];
236 havege_state hs;
251 havege_init( &hs );
258 buf[j] = havege_rand( &hs );