Run util/openssl-format-source -v -c .
Reviewed-by: Tim Hudson <tjh@openssl.org>
This commit is contained in:
@@ -5,21 +5,21 @@
|
||||
* This package is an SSL implementation written
|
||||
* by Eric Young (eay@cryptsoft.com).
|
||||
* The implementation was written so as to conform with Netscapes SSL.
|
||||
*
|
||||
*
|
||||
* This library is free for commercial and non-commercial use as long as
|
||||
* the following conditions are aheared to. The following conditions
|
||||
* apply to all code found in this distribution, be it the RC4, RSA,
|
||||
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
|
||||
* included with this distribution is covered by the same copyright terms
|
||||
* except that the holder is Tim Hudson (tjh@cryptsoft.com).
|
||||
*
|
||||
*
|
||||
* Copyright remains Eric Young's, and as such any Copyright notices in
|
||||
* the code are not to be removed.
|
||||
* If this package is used in a product, Eric Young should be given attribution
|
||||
* as the author of the parts of the library used.
|
||||
* This can be in the form of a textual message at program startup or
|
||||
* in documentation (online or textual) provided with the package.
|
||||
*
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
@@ -34,10 +34,10 @@
|
||||
* Eric Young (eay@cryptsoft.com)"
|
||||
* The word 'cryptographic' can be left out if the rouines from the library
|
||||
* being used are not cryptographic related :-).
|
||||
* 4. If you include any Windows specific code (or a derivative thereof) from
|
||||
* 4. If you include any Windows specific code (or a derivative thereof) from
|
||||
* the apps directory (application code) you must include an acknowledgement:
|
||||
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
||||
*
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
@@ -49,7 +49,7 @@
|
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
*
|
||||
*
|
||||
* The licence and distribution terms for any publically available version or
|
||||
* derivative of this code cannot be changed. i.e. this code cannot simply be
|
||||
* copied and put under another distribution licence
|
||||
@@ -65,155 +65,145 @@
|
||||
/* some FIPS 140-1 random number test */
|
||||
/* some simple tests */
|
||||
|
||||
int main(int argc,char **argv)
|
||||
{
|
||||
unsigned char buf[2500];
|
||||
int i,j,k,s,sign,nsign,err=0;
|
||||
unsigned long n1;
|
||||
unsigned long n2[16];
|
||||
unsigned long runs[2][34];
|
||||
/*double d; */
|
||||
long d;
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
unsigned char buf[2500];
|
||||
int i, j, k, s, sign, nsign, err = 0;
|
||||
unsigned long n1;
|
||||
unsigned long n2[16];
|
||||
unsigned long runs[2][34];
|
||||
/*
|
||||
* double d;
|
||||
*/
|
||||
long d;
|
||||
|
||||
i = RAND_pseudo_bytes(buf,2500);
|
||||
if (i < 0)
|
||||
{
|
||||
printf ("init failed, the rand method is not properly installed\n");
|
||||
err++;
|
||||
goto err;
|
||||
}
|
||||
i = RAND_pseudo_bytes(buf, 2500);
|
||||
if (i < 0) {
|
||||
printf("init failed, the rand method is not properly installed\n");
|
||||
err++;
|
||||
goto err;
|
||||
}
|
||||
|
||||
n1=0;
|
||||
for (i=0; i<16; i++) n2[i]=0;
|
||||
for (i=0; i<34; i++) runs[0][i]=runs[1][i]=0;
|
||||
n1 = 0;
|
||||
for (i = 0; i < 16; i++)
|
||||
n2[i] = 0;
|
||||
for (i = 0; i < 34; i++)
|
||||
runs[0][i] = runs[1][i] = 0;
|
||||
|
||||
/* test 1 and 2 */
|
||||
sign=0;
|
||||
nsign=0;
|
||||
for (i=0; i<2500; i++)
|
||||
{
|
||||
j=buf[i];
|
||||
/* test 1 and 2 */
|
||||
sign = 0;
|
||||
nsign = 0;
|
||||
for (i = 0; i < 2500; i++) {
|
||||
j = buf[i];
|
||||
|
||||
n2[j&0x0f]++;
|
||||
n2[(j>>4)&0x0f]++;
|
||||
n2[j & 0x0f]++;
|
||||
n2[(j >> 4) & 0x0f]++;
|
||||
|
||||
for (k=0; k<8; k++)
|
||||
{
|
||||
s=(j&0x01);
|
||||
if (s == sign)
|
||||
nsign++;
|
||||
else
|
||||
{
|
||||
if (nsign > 34) nsign=34;
|
||||
if (nsign != 0)
|
||||
{
|
||||
runs[sign][nsign-1]++;
|
||||
if (nsign > 6)
|
||||
runs[sign][5]++;
|
||||
}
|
||||
sign=s;
|
||||
nsign=1;
|
||||
}
|
||||
for (k = 0; k < 8; k++) {
|
||||
s = (j & 0x01);
|
||||
if (s == sign)
|
||||
nsign++;
|
||||
else {
|
||||
if (nsign > 34)
|
||||
nsign = 34;
|
||||
if (nsign != 0) {
|
||||
runs[sign][nsign - 1]++;
|
||||
if (nsign > 6)
|
||||
runs[sign][5]++;
|
||||
}
|
||||
sign = s;
|
||||
nsign = 1;
|
||||
}
|
||||
|
||||
if (s) n1++;
|
||||
j>>=1;
|
||||
}
|
||||
}
|
||||
if (nsign > 34) nsign=34;
|
||||
if (nsign != 0) runs[sign][nsign-1]++;
|
||||
if (s)
|
||||
n1++;
|
||||
j >>= 1;
|
||||
}
|
||||
}
|
||||
if (nsign > 34)
|
||||
nsign = 34;
|
||||
if (nsign != 0)
|
||||
runs[sign][nsign - 1]++;
|
||||
|
||||
/* test 1 */
|
||||
if (!((9654 < n1) && (n1 < 10346)))
|
||||
{
|
||||
printf("test 1 failed, X=%lu\n",n1);
|
||||
err++;
|
||||
}
|
||||
printf("test 1 done\n");
|
||||
/* test 1 */
|
||||
if (!((9654 < n1) && (n1 < 10346))) {
|
||||
printf("test 1 failed, X=%lu\n", n1);
|
||||
err++;
|
||||
}
|
||||
printf("test 1 done\n");
|
||||
|
||||
/* test 2 */
|
||||
/* test 2 */
|
||||
#ifdef undef
|
||||
d=0;
|
||||
for (i=0; i<16; i++)
|
||||
d+=n2[i]*n2[i];
|
||||
d=d*16.0/5000.0-5000.0;
|
||||
if (!((1.03 < d) && (d < 57.4)))
|
||||
{
|
||||
printf("test 2 failed, X=%.2f\n",d);
|
||||
err++;
|
||||
}
|
||||
d = 0;
|
||||
for (i = 0; i < 16; i++)
|
||||
d += n2[i] * n2[i];
|
||||
d = d * 16.0 / 5000.0 - 5000.0;
|
||||
if (!((1.03 < d) && (d < 57.4))) {
|
||||
printf("test 2 failed, X=%.2f\n", d);
|
||||
err++;
|
||||
}
|
||||
#endif
|
||||
d=0;
|
||||
for (i=0; i<16; i++)
|
||||
d+=n2[i]*n2[i];
|
||||
d=(d*8)/25-500000;
|
||||
if (!((103 < d) && (d < 5740)))
|
||||
{
|
||||
printf("test 2 failed, X=%ld.%02ld\n",d/100L,d%100L);
|
||||
err++;
|
||||
}
|
||||
printf("test 2 done\n");
|
||||
d = 0;
|
||||
for (i = 0; i < 16; i++)
|
||||
d += n2[i] * n2[i];
|
||||
d = (d * 8) / 25 - 500000;
|
||||
if (!((103 < d) && (d < 5740))) {
|
||||
printf("test 2 failed, X=%ld.%02ld\n", d / 100L, d % 100L);
|
||||
err++;
|
||||
}
|
||||
printf("test 2 done\n");
|
||||
|
||||
/* test 3 */
|
||||
for (i=0; i<2; i++)
|
||||
{
|
||||
if (!((2267 < runs[i][0]) && (runs[i][0] < 2733)))
|
||||
{
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i,1,runs[i][0]);
|
||||
err++;
|
||||
}
|
||||
if (!((1079 < runs[i][1]) && (runs[i][1] < 1421)))
|
||||
{
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i,2,runs[i][1]);
|
||||
err++;
|
||||
}
|
||||
if (!(( 502 < runs[i][2]) && (runs[i][2] < 748)))
|
||||
{
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i,3,runs[i][2]);
|
||||
err++;
|
||||
}
|
||||
if (!(( 223 < runs[i][3]) && (runs[i][3] < 402)))
|
||||
{
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i,4,runs[i][3]);
|
||||
err++;
|
||||
}
|
||||
if (!(( 90 < runs[i][4]) && (runs[i][4] < 223)))
|
||||
{
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i,5,runs[i][4]);
|
||||
err++;
|
||||
}
|
||||
if (!(( 90 < runs[i][5]) && (runs[i][5] < 223)))
|
||||
{
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i,6,runs[i][5]);
|
||||
err++;
|
||||
}
|
||||
}
|
||||
printf("test 3 done\n");
|
||||
|
||||
/* test 4 */
|
||||
if (runs[0][33] != 0)
|
||||
{
|
||||
printf("test 4 failed, bit=%d run=%d num=%lu\n",
|
||||
0,34,runs[0][33]);
|
||||
err++;
|
||||
}
|
||||
if (runs[1][33] != 0)
|
||||
{
|
||||
printf("test 4 failed, bit=%d run=%d num=%lu\n",
|
||||
1,34,runs[1][33]);
|
||||
err++;
|
||||
}
|
||||
printf("test 4 done\n");
|
||||
/* test 3 */
|
||||
for (i = 0; i < 2; i++) {
|
||||
if (!((2267 < runs[i][0]) && (runs[i][0] < 2733))) {
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i, 1, runs[i][0]);
|
||||
err++;
|
||||
}
|
||||
if (!((1079 < runs[i][1]) && (runs[i][1] < 1421))) {
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i, 2, runs[i][1]);
|
||||
err++;
|
||||
}
|
||||
if (!((502 < runs[i][2]) && (runs[i][2] < 748))) {
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i, 3, runs[i][2]);
|
||||
err++;
|
||||
}
|
||||
if (!((223 < runs[i][3]) && (runs[i][3] < 402))) {
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i, 4, runs[i][3]);
|
||||
err++;
|
||||
}
|
||||
if (!((90 < runs[i][4]) && (runs[i][4] < 223))) {
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i, 5, runs[i][4]);
|
||||
err++;
|
||||
}
|
||||
if (!((90 < runs[i][5]) && (runs[i][5] < 223))) {
|
||||
printf("test 3 failed, bit=%d run=%d num=%lu\n",
|
||||
i, 6, runs[i][5]);
|
||||
err++;
|
||||
}
|
||||
}
|
||||
printf("test 3 done\n");
|
||||
|
||||
/* test 4 */
|
||||
if (runs[0][33] != 0) {
|
||||
printf("test 4 failed, bit=%d run=%d num=%lu\n", 0, 34, runs[0][33]);
|
||||
err++;
|
||||
}
|
||||
if (runs[1][33] != 0) {
|
||||
printf("test 4 failed, bit=%d run=%d num=%lu\n", 1, 34, runs[1][33]);
|
||||
err++;
|
||||
}
|
||||
printf("test 4 done\n");
|
||||
err:
|
||||
err=((err)?1:0);
|
||||
err = ((err) ? 1 : 0);
|
||||
#ifdef OPENSSL_SYS_NETWARE
|
||||
if (err) printf("ERROR: %d\n", err);
|
||||
if (err)
|
||||
printf("ERROR: %d\n", err);
|
||||
#endif
|
||||
EXIT(err);
|
||||
return(err);
|
||||
}
|
||||
EXIT(err);
|
||||
return (err);
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user