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

openssl/crypto/lhash/lh_stats.c

 /* crypto/lhash/lh_stats.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 121 matching lines @@
         fprintf(out,"load %d.%02d  actual load %d.%02d\n",
                 (int)(total/lh->num_nodes),
                 (int)((total%lh->num_nodes)*100/lh->num_nodes),
                 (int)(total/n_used),
                 (int)((total%n_used)*100/n_used));
         }
 
 #else
 
 #ifndef OPENSSL_NO_FP_API
-void lh_stats(const LHASH *lh, FILE *fp)
+void lh_stats(const _LHASH *lh, FILE *fp)
         {
         BIO *bp;
 
         bp=BIO_new(BIO_s_file());
         if (bp == NULL) goto end;
         BIO_set_fp(bp,fp,BIO_NOCLOSE);
         lh_stats_bio(lh,bp);
         BIO_free(bp);
 end:;
         }
 
-void lh_node_stats(const LHASH *lh, FILE *fp)
+void lh_node_stats(const _LHASH *lh, FILE *fp)
         {
         BIO *bp;
 
         bp=BIO_new(BIO_s_file());
         if (bp == NULL) goto end;
         BIO_set_fp(bp,fp,BIO_NOCLOSE);
         lh_node_stats_bio(lh,bp);
         BIO_free(bp);
 end:;
         }
 
-void lh_node_usage_stats(const LHASH *lh, FILE *fp)
+void lh_node_usage_stats(const _LHASH *lh, FILE *fp)
         {
         BIO *bp;
 
         bp=BIO_new(BIO_s_file());
         if (bp == NULL) goto end;
         BIO_set_fp(bp,fp,BIO_NOCLOSE);
         lh_node_usage_stats_bio(lh,bp);
         BIO_free(bp);
 end:;
         }
 
 #endif
 
-void lh_stats_bio(const LHASH *lh, BIO *out)
+void lh_stats_bio(const _LHASH *lh, BIO *out)
         {
         BIO_printf(out,"num_items             = %lu\n",lh->num_items);
         BIO_printf(out,"num_nodes             = %u\n",lh->num_nodes);
         BIO_printf(out,"num_alloc_nodes       = %u\n",lh->num_alloc_nodes);
         BIO_printf(out,"num_expands           = %lu\n",lh->num_expands);
         BIO_printf(out,"num_expand_reallocs   = %lu\n",
                    lh->num_expand_reallocs);
         BIO_printf(out,"num_contracts         = %lu\n",lh->num_contracts);
         BIO_printf(out,"num_contract_reallocs = %lu\n",
                    lh->num_contract_reallocs);
         BIO_printf(out,"num_hash_calls        = %lu\n",lh->num_hash_calls);
         BIO_printf(out,"num_comp_calls        = %lu\n",lh->num_comp_calls);
         BIO_printf(out,"num_insert            = %lu\n",lh->num_insert);
         BIO_printf(out,"num_replace           = %lu\n",lh->num_replace);
         BIO_printf(out,"num_delete            = %lu\n",lh->num_delete);
         BIO_printf(out,"num_no_delete         = %lu\n",lh->num_no_delete);
         BIO_printf(out,"num_retrieve          = %lu\n",lh->num_retrieve);
         BIO_printf(out,"num_retrieve_miss     = %lu\n",lh->num_retrieve_miss);
         BIO_printf(out,"num_hash_comps        = %lu\n",lh->num_hash_comps);
 #if 0
         BIO_printf(out,"p                     = %u\n",lh->p);
         BIO_printf(out,"pmax                  = %u\n",lh->pmax);
         BIO_printf(out,"up_load               = %lu\n",lh->up_load);
         BIO_printf(out,"down_load             = %lu\n",lh->down_load);
 #endif
         }
 
-void lh_node_stats_bio(const LHASH *lh, BIO *out)
+void lh_node_stats_bio(const _LHASH *lh, BIO *out)
         {
         LHASH_NODE *n;
         unsigned int i,num;
 
         for (i=0; i<lh->num_nodes; i++)
                 {
                 for (n=lh->b[i],num=0; n != NULL; n=n->next)
                         num++;
                 BIO_printf(out,"node %6u -> %3u\n",i,num);
                 }
         }
 
-void lh_node_usage_stats_bio(const LHASH *lh, BIO *out)
+void lh_node_usage_stats_bio(const _LHASH *lh, BIO *out)
         {
         LHASH_NODE *n;
         unsigned long num;
         unsigned int i;
         unsigned long total=0,n_used=0;
 
         for (i=0; i<lh->num_nodes; i++)
                 {
                 for (n=lh->b[i],num=0; n != NULL; n=n->next)
                         num++;
                 if (num != 0)
                         {
                         n_used++;
                         total+=num;
                         }
                 }
         BIO_printf(out,"%lu nodes used out of %u\n",n_used,lh->num_nodes);
         BIO_printf(out,"%lu items\n",total);
         if (n_used == 0) return;
         BIO_printf(out,"load %d.%02d  actual load %d.%02d\n",
                    (int)(total/lh->num_nodes),
                    (int)((total%lh->num_nodes)*100/lh->num_nodes),
                    (int)(total/n_used),
                    (int)((total%n_used)*100/n_used));
         }
 
 #endif