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

openssl/crypto/bn/bn_lib.c

 /* crypto/bn/bn_lib.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 115 matching lines @@
         if      (which == 0) return(bn_limit_bits);
         else if (which == 1) return(bn_limit_bits_high);
         else if (which == 2) return(bn_limit_bits_low);
         else if (which == 3) return(bn_limit_bits_mont);
         else return(0);
         }
 #endif
 
 const BIGNUM *BN_value_one(void)
         {
-        static BN_ULONG data_one=1L;
-        static BIGNUM const_one={&data_one,1,1,0,BN_FLG_STATIC_DATA};
+        static const BN_ULONG data_one=1L;
+        static const BIGNUM const_one={(BN_ULONG *)&data_one,1,1,0,BN_FLG_STATIC_DATA};
 
         return(&const_one);
         }
 
+char *BN_options(void)
+        {
+        static int init=0;
+        static char data[16];
+
+        if (!init)
+                {
+                init++;
+#ifdef BN_LLONG
+                BIO_snprintf(data,sizeof data,"bn(%d,%d)",
+                             (int)sizeof(BN_ULLONG)*8,(int)sizeof(BN_ULONG)*8);
+#else
+                BIO_snprintf(data,sizeof data,"bn(%d,%d)",
+                             (int)sizeof(BN_ULONG)*8,(int)sizeof(BN_ULONG)*8);
+#endif
+                }
+        return(data);
+        }
+
 int BN_num_bits_word(BN_ULONG l)
         {
-        static const char bits[256]={
+        static const unsigned char bits[256]={
                 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,
                 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
                 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
                 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
                 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
                 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
                 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
                 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
                 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
                 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
@@ skipping 54 matching lines @@
 #if defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
                 if (l & 0xffff0000L)
                         {
                         if (l & 0xff000000L)
                                 return(bits[(int)(l>>24L)]+24);
                         else    return(bits[(int)(l>>16L)]+16);
                         }
                 else
 #endif
                         {
-#if defined(SIXTEEN_BIT) || defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
+#if defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
                         if (l & 0xff00L)
                                 return(bits[(int)(l>>8)]+8);
                         else    
 #endif
                                 return(bits[(int)(l   )]  );
                         }
                 }
         }
 
 int BN_num_bits(const BIGNUM *a)
@@ skipping 507 matching lines @@
 
 int BN_is_bit_set(const BIGNUM *a, int n)
         {
         int i,j;
 
         bn_check_top(a);
         if (n < 0) return 0;
         i=n/BN_BITS2;
         j=n%BN_BITS2;
         if (a->top <= i) return 0;
-        return(((a->d[i])>>j)&((BN_ULONG)1));
+        return (int)(((a->d[i])>>j)&((BN_ULONG)1));
         }
 
 int BN_mask_bits(BIGNUM *a, int n)
         {
         int b,w;
 
         bn_check_top(a);
         if (n < 0) return 0;
 
         w=n/BN_BITS2;
@@ skipping 59 matching lines @@
         if (dl > 0)
                 {
                 for (i=dl; i>0; i--)
                         {
                         if (a[n+i] != 0)
                                 return 1; /* a > b */
                         }
                 }
         return bn_cmp_words(a,b,cl);
         }