35 #if defined(POLARSSL_HAVEGE_C)
56 #define SWAP(X,Y) { int *T = X; X = Y; Y = T; }
58 #define TST1_ENTER if( PTEST & 1 ) { PTEST ^= 3; PTEST >>= 1;
59 #define TST2_ENTER if( PTEST & 1 ) { PTEST ^= 3; PTEST >>= 1;
61 #define TST1_LEAVE U1++; }
62 #define TST2_LEAVE U2++; }
64 #define ONE_ITERATION \
68 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \
69 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \
70 TST1_ENTER TST1_ENTER TST1_ENTER TST1_ENTER \
72 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \
73 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \
74 TST1_LEAVE TST1_LEAVE TST1_LEAVE TST1_LEAVE \
76 PTX = (PT1 >> 18) & 7; \
79 CLK = (int) hardclock(); \
82 A = &WALK[PT1 ]; RES[i++] ^= *A; \
83 B = &WALK[PT2 ]; RES[i++] ^= *B; \
84 C = &WALK[PT1 ^ 1]; RES[i++] ^= *C; \
85 D = &WALK[PT2 ^ 4]; RES[i++] ^= *D; \
87 IN = (*A >> (1)) ^ (*A << (31)) ^ CLK; \
88 *A = (*B >> (2)) ^ (*B << (30)) ^ CLK; \
90 *C = (*C >> (3)) ^ (*C << (29)) ^ CLK; \
91 *D = (*D >> (4)) ^ (*D << (28)) ^ CLK; \
93 A = &WALK[PT1 ^ 2]; RES[i++] ^= *A; \
94 B = &WALK[PT2 ^ 2]; RES[i++] ^= *B; \
95 C = &WALK[PT1 ^ 3]; RES[i++] ^= *C; \
96 D = &WALK[PT2 ^ 6]; RES[i++] ^= *D; \
98 if( PTEST & 1 ) SWAP( A, C ); \
100 IN = (*A >> (5)) ^ (*A << (27)) ^ CLK; \
101 *A = (*B >> (6)) ^ (*B << (26)) ^ CLK; \
102 *B = IN; CLK = (int) hardclock(); \
103 *C = (*C >> (7)) ^ (*C << (25)) ^ CLK; \
104 *D = (*D >> (8)) ^ (*D << (24)) ^ CLK; \
106 A = &WALK[PT1 ^ 4]; \
107 B = &WALK[PT2 ^ 1]; \
111 PT2 = (RES[(i - 8) ^ PTY] ^ WALK[PT2 ^ PTY ^ 7]); \
112 PT2 = ((PT2 & 0x1FFF) & (~8)) ^ ((PT1 ^ 8) & 0x8); \
113 PTY = (PT2 >> 10) & 7; \
115 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \
116 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \
117 TST2_ENTER TST2_ENTER TST2_ENTER TST2_ENTER \
119 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \
120 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \
121 TST2_LEAVE TST2_LEAVE TST2_LEAVE TST2_LEAVE \
123 C = &WALK[PT1 ^ 5]; \
124 D = &WALK[PT2 ^ 5]; \
131 IN = (*A >> ( 9)) ^ (*A << (23)) ^ CLK; \
132 *A = (*B >> (10)) ^ (*B << (22)) ^ CLK; \
134 *C = (*C >> (11)) ^ (*C << (21)) ^ CLK; \
135 *D = (*D >> (12)) ^ (*D << (20)) ^ CLK; \
137 A = &WALK[PT1 ^ 6]; RES[i++] ^= *A; \
138 B = &WALK[PT2 ^ 3]; RES[i++] ^= *B; \
139 C = &WALK[PT1 ^ 7]; RES[i++] ^= *C; \
140 D = &WALK[PT2 ^ 7]; RES[i++] ^= *D; \
142 IN = (*A >> (13)) ^ (*A << (19)) ^ CLK; \
143 *A = (*B >> (14)) ^ (*B << (18)) ^ CLK; \
145 *C = (*C >> (15)) ^ (*C << (17)) ^ CLK; \
146 *D = (*D >> (16)) ^ (*D << (16)) ^ CLK; \
148 PT1 = ( RES[(i - 8) ^ PTX] ^ \
149 WALK[PT1 ^ PTX ^ 7] ) & (~1); \
150 PT1 ^= (PT2 ^ 0x10) & 0x10; \
152 for( n++, i = 0; i < 16; i++ ) \
153 hs->pool[n % COLLECT_SIZE] ^= RES[i];
161 int U1, U2, *A, *B, *C, *D;
162 int PT1, PT2, *WALK, RES[16];
163 int PTX, PTY, CLK, PTEST, IN;
172 memset( RES, 0,
sizeof( RES ) );
202 int havege_random(
void *p_rng,
unsigned char *buf,
size_t len )
207 unsigned char *p = buf;
212 if( use_len >
sizeof(
int) )
213 use_len =
sizeof(
int);
221 memcpy( p, &val, use_len );