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

openssl/crypto/bn/bn_mul.c

 /* crypto/bn/bn_mul.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 533 matching lines @@
                 }
         }
 
 /* n+tn is the word length
  * t needs to be n*4 is size, as does r */
 /* tnX may not be negative but less than n */
 void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
              int tna, int tnb, BN_ULONG *t)
         {
         int i,j,n2=n*2;
-        int c1,c2,neg,zero;
+        int c1,c2,neg;
         BN_ULONG ln,lo,*p;
 
 # ifdef BN_COUNT
         fprintf(stderr," bn_mul_part_recursive (%d%+d) * (%d%+d)\n",
                 n, tna, n, tnb);
 # endif
         if (n < 8)
                 {
                 bn_mul_normal(r,a,n+tna,b,n+tnb);
                 return;
                 }
 
         /* r=(a[0]-a[1])*(b[1]-b[0]) */
         c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
         c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
-        zero=neg=0;
+        neg=0;
         switch (c1*3+c2)
                 {
         case -4:
                 bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
                 bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
                 break;
         case -3:
-                zero=1;
                 /* break; */
         case -2:
                 bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
                 bn_sub_part_words(&(t[n]),&(b[n]),b,      tnb,tnb-n); /* + */
                 neg=1;
                 break;
         case -1:
         case 0:
         case 1:
-                zero=1;
                 /* break; */
         case 2:
                 bn_sub_part_words(t,      a,      &(a[n]),tna,n-tna); /* + */
                 bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
                 neg=1;
                 break;
         case 3:
-                zero=1;
                 /* break; */
         case 4:
                 bn_sub_part_words(t,      a,      &(a[n]),tna,n-tna);
                 bn_sub_part_words(&(t[n]),&(b[n]),b,      tnb,tnb-n);
                 break;
                 }
                 /* The zero case isn't yet implemented here. The speedup
                    would probably be negligible. */
 # if 0
         if (n == 4)
@@ skipping 398 matching lines @@
                         bn_mul_comba8(rr->d,a->d,b->d);
                         goto end;
                         }
                 }
 #endif /* BN_MUL_COMBA */
 #ifdef BN_RECURSION
         if ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL))
                 {
                 if (i >= -1 && i <= 1)
                         {
-                        int sav_j =0;
                         /* Find out the power of two lower or equal
                            to the longest of the two numbers */
                         if (i >= 0)
                                 {
                                 j = BN_num_bits_word((BN_ULONG)al);
                                 }
                         if (i == -1)
                                 {
                                 j = BN_num_bits_word((BN_ULONG)bl);
                                 }
-                        sav_j = j;
                         j = 1<<(j-1);
                         assert(j <= al || j <= bl);
                         k = j+j;
                         t = BN_CTX_get(ctx);
                         if (t == NULL)
                                 goto err;
                         if (al > j || bl > j)
                                 {
                                 if (bn_wexpand(t,k*4) == NULL) goto err;
                                 if (bn_wexpand(rr,k*4) == NULL) goto err;
@@ skipping 125 matching lines @@
                 if (--n <= 0) return;
                 bn_mul_add_words(&(r[2]),a,n,b[2]);
                 if (--n <= 0) return;
                 bn_mul_add_words(&(r[3]),a,n,b[3]);
                 if (--n <= 0) return;
                 bn_mul_add_words(&(r[4]),a,n,b[4]);
                 r+=4;
                 b+=4;
                 }
         }