* gdb.dwarf2/dw2-noloc.S: New file.

[deliverable/binutils-gdb.git] / gdb / bcache.c

diff --git a/gdb/bcache.c b/gdb/bcache.c
index cadadb5cce63f575591bd5ac0ca32c39259c8b0a..a6eadd3bb96dd3f4ea631fd5923f2c10cb09c2c5 100644 (file)
--- a/gdb/bcache.c
+++ b/gdb/bcache.c
@@ -2,7 +2,7 @@
    Written by Fred Fish <fnf@cygnus.com>
    Rewritten by Jim Blandy <jimb@cygnus.com>
 
-   Copyright 1999, 2000, 2002, 2003 Free Software Foundation, Inc.
+   Copyright (C) 1999, 2000, 2002, 2003, 2007 Free Software Foundation, Inc.
 
    This file is part of GDB.
 
@@ -18,8 +18,8 @@
 
    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
-   Foundation, Inc., 59 Temple Place - Suite 330,
-   Boston, MA 02111-1307, USA.  */
+   Foundation, Inc., 51 Franklin Street, Fifth Floor,
+   Boston, MA 02110-1301, USA.  */
 
 #include "defs.h"
 #include "gdb_obstack.h"
@@ -301,9 +301,10 @@ static void
 print_percentage (int portion, int total)
 {
   if (total == 0)
-    printf_filtered ("(not applicable)\n");
+    /* i18n: Like "Percentage of duplicates, by count: (not applicable)" */
+    printf_filtered (_("(not applicable)\n"));
   else
-    printf_filtered ("%3d%%\n", portion * 100 / total);
+    printf_filtered ("%3d%%\n", (int) (portion * 100.0 / total));
 }
 
 
@@ -382,53 +383,55 @@ print_bcache_statistics (struct bcache *c, char *type)
     xfree (entry_size);
   }
 
-  printf_filtered ("  Cached '%s' statistics:\n", type);
-  printf_filtered ("    Total object count:  %ld\n", c->total_count);
-  printf_filtered ("    Unique object count: %lu\n", c->unique_count);
-  printf_filtered ("    Percentage of duplicates, by count: ");
+  printf_filtered (_("  Cached '%s' statistics:\n"), type);
+  printf_filtered (_("    Total object count:  %ld\n"), c->total_count);
+  printf_filtered (_("    Unique object count: %lu\n"), c->unique_count);
+  printf_filtered (_("    Percentage of duplicates, by count: "));
   print_percentage (c->total_count - c->unique_count, c->total_count);
   printf_filtered ("\n");
 
-  printf_filtered ("    Total object size:   %ld\n", c->total_size);
-  printf_filtered ("    Unique object size:  %ld\n", c->unique_size);
-  printf_filtered ("    Percentage of duplicates, by size:  ");
+  printf_filtered (_("    Total object size:   %ld\n"), c->total_size);
+  printf_filtered (_("    Unique object size:  %ld\n"), c->unique_size);
+  printf_filtered (_("    Percentage of duplicates, by size:  "));
   print_percentage (c->total_size - c->unique_size, c->total_size);
   printf_filtered ("\n");
 
-  printf_filtered ("    Max entry size:     %d\n", max_entry_size);
-  printf_filtered ("    Average entry size: ");
+  printf_filtered (_("    Max entry size:     %d\n"), max_entry_size);
+  printf_filtered (_("    Average entry size: "));
   if (c->unique_count > 0)
     printf_filtered ("%ld\n", c->unique_size / c->unique_count);
   else
-    printf_filtered ("(not applicable)\n");    
-  printf_filtered ("    Median entry size:  %d\n", median_entry_size);
+    /* i18n: "Average entry size: (not applicable)" */
+    printf_filtered (_("(not applicable)\n"));    
+  printf_filtered (_("    Median entry size:  %d\n"), median_entry_size);
   printf_filtered ("\n");
 
-  printf_filtered ("    Total memory used by bcache, including overhead: %ld\n",
+  printf_filtered (_("    Total memory used by bcache, including overhead: %ld\n"),
                   c->structure_size);
-  printf_filtered ("    Percentage memory overhead: ");
+  printf_filtered (_("    Percentage memory overhead: "));
   print_percentage (c->structure_size - c->unique_size, c->unique_size);
-  printf_filtered ("    Net memory savings:         ");
+  printf_filtered (_("    Net memory savings:         "));
   print_percentage (c->total_size - c->structure_size, c->total_size);
   printf_filtered ("\n");
 
-  printf_filtered ("    Hash table size:           %3d\n", c->num_buckets);
-  printf_filtered ("    Hash table expands:        %lu\n",
+  printf_filtered (_("    Hash table size:           %3d\n"), c->num_buckets);
+  printf_filtered (_("    Hash table expands:        %lu\n"),
                   c->expand_count);
-  printf_filtered ("    Hash table hashes:         %lu\n",
+  printf_filtered (_("    Hash table hashes:         %lu\n"),
                   c->total_count + c->expand_hash_count);
-  printf_filtered ("    Half hash misses:          %lu\n",
+  printf_filtered (_("    Half hash misses:          %lu\n"),
                   c->half_hash_miss_count);
-  printf_filtered ("    Hash table population:     ");
+  printf_filtered (_("    Hash table population:     "));
   print_percentage (occupied_buckets, c->num_buckets);
-  printf_filtered ("    Median hash chain length:  %3d\n",
+  printf_filtered (_("    Median hash chain length:  %3d\n"),
                   median_chain_length);
-  printf_filtered ("    Average hash chain length: ");
+  printf_filtered (_("    Average hash chain length: "));
   if (c->num_buckets > 0)
     printf_filtered ("%3lu\n", c->unique_count / c->num_buckets);
   else
-    printf_filtered ("(not applicable)\n");
-  printf_filtered ("    Maximum hash chain length: %3d\n", max_chain_length);
+    /* i18n: "Average hash chain length: (not applicable)" */
+    printf_filtered (_("(not applicable)\n"));
+  printf_filtered (_("    Maximum hash chain length: %3d\n"), max_chain_length);
   printf_filtered ("\n");
 }