Upgrade chrome's OpenSSL to same version Android ships with.

openssl/crypto/bn/bntest.c

 /* crypto/bn/bntest.c */
 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  * All rights reserved.
  *
  * 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
@@ skipping 468 matching lines @@
         if (sizeof(w) > sizeof(unsigned long))
                 {
                 unsigned long   h=(unsigned long)(w>>32),
                                 l=(unsigned long)(w);
 
                 if (h)  BIO_printf(bp,"%lX%08lX",h,l);
                 else    BIO_printf(bp,"%lX",l);
                 return;
                 }
 #endif
-        BIO_printf(bp,"%lX",w);
+        BIO_printf(bp,BN_HEX_FMT1,w);
         }
 
 int test_div_word(BIO *bp)
         {
         BIGNUM   a,b;
         BN_ULONG r,s;
         int i;
 
         BN_init(&a);
         BN_init(&b);
@@ skipping 225 matching lines @@
 
         BN_init(&a);
         BN_init(&b);
         BN_init(&c);
         BN_init(&d);
         BN_init(&A);
         BN_init(&B);
         BN_init(&n);
 
         mont=BN_MONT_CTX_new();
+        if (mont == NULL)
+                return 0;
 
         BN_bntest_rand(&a,100,0,0); /**/
         BN_bntest_rand(&b,100,0,0); /**/
         for (i=0; i<num2; i++)
                 {
                 int bits = (200*(i+1))/num2;
 
                 if (bits == 0)
                         continue;
                 BN_bntest_rand(&n,bits,0,1);
@@ skipping 364 matching lines @@
         BN_free(&a);
         BN_free(&b);
         BN_free(&c);
         return ret;
         }
 
 int test_gf2m_mod(BIO *bp)
         {
         BIGNUM *a,*b[2],*c,*d,*e;
         int i, j, ret = 0;
-        unsigned int p0[] = {163,7,6,3,0};
-        unsigned int p1[] = {193,15,0};
+        int p0[] = {163,7,6,3,0,-1};
+        int p1[] = {193,15,0,-1};
 
         a=BN_new();
         b[0]=BN_new();
         b[1]=BN_new();
         c=BN_new();
         d=BN_new();
         e=BN_new();
 
         BN_GF2m_arr2poly(p0, b[0]);
         BN_GF2m_arr2poly(p1, b[1]);
@@ skipping 36 matching lines @@
         BN_free(c);
         BN_free(d);
         BN_free(e);
         return ret;
         }
 
 int test_gf2m_mod_mul(BIO *bp,BN_CTX *ctx)
         {
         BIGNUM *a,*b[2],*c,*d,*e,*f,*g,*h;
         int i, j, ret = 0;
-        unsigned int p0[] = {163,7,6,3,0};
-        unsigned int p1[] = {193,15,0};
+        int p0[] = {163,7,6,3,0,-1};
+        int p1[] = {193,15,0,-1};
 
         a=BN_new();
         b[0]=BN_new();
         b[1]=BN_new();
         c=BN_new();
         d=BN_new();
         e=BN_new();
         f=BN_new();
         g=BN_new();
         h=BN_new();
@@ skipping 49 matching lines @@
         BN_free(f);
         BN_free(g);
         BN_free(h);
         return ret;
         }
 
 int test_gf2m_mod_sqr(BIO *bp,BN_CTX *ctx)
         {
         BIGNUM *a,*b[2],*c,*d;
         int i, j, ret = 0;
-        unsigned int p0[] = {163,7,6,3,0};
-        unsigned int p1[] = {193,15,0};
+        int p0[] = {163,7,6,3,0,-1};
+        int p1[] = {193,15,0,-1};
 
         a=BN_new();
         b[0]=BN_new();
         b[1]=BN_new();
         c=BN_new();
         d=BN_new();
 
         BN_GF2m_arr2poly(p0, b[0]);
         BN_GF2m_arr2poly(p1, b[1]);
 
@@ skipping 37 matching lines @@
         BN_free(b[1]);
         BN_free(c);
         BN_free(d);
         return ret;
         }
 
 int test_gf2m_mod_inv(BIO *bp,BN_CTX *ctx)
         {
         BIGNUM *a,*b[2],*c,*d;
         int i, j, ret = 0;
-        unsigned int p0[] = {163,7,6,3,0};
-        unsigned int p1[] = {193,15,0};
+        int p0[] = {163,7,6,3,0,-1};
+        int p1[] = {193,15,0,-1};
 
         a=BN_new();
         b[0]=BN_new();
         b[1]=BN_new();
         c=BN_new();
         d=BN_new();
 
         BN_GF2m_arr2poly(p0, b[0]);
         BN_GF2m_arr2poly(p1, b[1]);
 
@@ skipping 33 matching lines @@
         BN_free(b[1]);
         BN_free(c);
         BN_free(d);
         return ret;
         }
 
 int test_gf2m_mod_div(BIO *bp,BN_CTX *ctx)
         {
         BIGNUM *a,*b[2],*c,*d,*e,*f;
         int i, j, ret = 0;
-        unsigned int p0[] = {163,7,6,3,0};
-        unsigned int p1[] = {193,15,0};
+        int p0[] = {163,7,6,3,0,-1};
+        int p1[] = {193,15,0,-1};
 
         a=BN_new();
         b[0]=BN_new();
         b[1]=BN_new();
         c=BN_new();
         d=BN_new();
         e=BN_new();
         f=BN_new();
 
         BN_GF2m_arr2poly(p0, b[0]);
@@ skipping 41 matching lines @@
         BN_free(d);
         BN_free(e);
         BN_free(f);
         return ret;
         }
 
 int test_gf2m_mod_exp(BIO *bp,BN_CTX *ctx)
         {
         BIGNUM *a,*b[2],*c,*d,*e,*f;
         int i, j, ret = 0;
-        unsigned int p0[] = {163,7,6,3,0};
-        unsigned int p1[] = {193,15,0};
+        int p0[] = {163,7,6,3,0,-1};
+        int p1[] = {193,15,0,-1};
 
         a=BN_new();
         b[0]=BN_new();
         b[1]=BN_new();
         c=BN_new();
         d=BN_new();
         e=BN_new();
         f=BN_new();
 
         BN_GF2m_arr2poly(p0, b[0]);
@@ skipping 49 matching lines @@
         BN_free(d);
         BN_free(e);
         BN_free(f);
         return ret;
         }
 
 int test_gf2m_mod_sqrt(BIO *bp,BN_CTX *ctx)
         {
         BIGNUM *a,*b[2],*c,*d,*e,*f;
         int i, j, ret = 0;
-        unsigned int p0[] = {163,7,6,3,0};
-        unsigned int p1[] = {193,15,0};
+        int p0[] = {163,7,6,3,0,-1};
+        int p1[] = {193,15,0,-1};
 
         a=BN_new();
         b[0]=BN_new();
         b[1]=BN_new();
         c=BN_new();
         d=BN_new();
         e=BN_new();
         f=BN_new();
 
         BN_GF2m_arr2poly(p0, b[0]);
@@ skipping 37 matching lines @@
         BN_free(d);
         BN_free(e);
         BN_free(f);
         return ret;
         }
 
 int test_gf2m_mod_solve_quad(BIO *bp,BN_CTX *ctx)
         {
         BIGNUM *a,*b[2],*c,*d,*e;
         int i, j, s = 0, t, ret = 0;
-        unsigned int p0[] = {163,7,6,3,0};
-        unsigned int p1[] = {193,15,0};
+        int p0[] = {163,7,6,3,0,-1};
+        int p1[] = {193,15,0,-1};
 
         a=BN_new();
         b[0]=BN_new();
         b[1]=BN_new();
         c=BN_new();
         d=BN_new();
         e=BN_new();
 
         BN_GF2m_arr2poly(p0, b[0]);
         BN_GF2m_arr2poly(p1, b[1]);
@@ skipping 435 matching lines @@
         return(1);
         }
 
 int rand_neg(void)
         {
         static unsigned int neg=0;
         static int sign[8]={0,0,0,1,1,0,1,1};
 
         return(sign[(neg++)%8]);
         }