mirror of
https://sourceware.org/git/binutils-gdb.git
synced 2024-12-09 04:21:49 +08:00
a121b7c1ac
This is the remainder boring constification that all looks more of less borderline obvious IMO. gdb/ChangeLog: 2017-04-05 Pedro Alves <palves@redhat.com> * ada-exp.y (yyerror): Constify. * ada-lang.c (bound_name, get_selections) (ada_variant_discrim_type) (ada_variant_discrim_name, ada_value_struct_elt) (ada_lookup_struct_elt_type, is_unchecked_variant) (ada_which_variant_applies, standard_exc, ada_get_next_arg) (catch_ada_exception_command_split) (catch_ada_assert_command_split, catch_assert_command) (ada_op_name): Constify. * ada-lang.h (ada_yyerror, get_selections) (ada_variant_discrim_name, ada_value_struct_elt): Constify. * arc-tdep.c (arc_print_frame_cache): Constify. * arm-tdep.c (arm_skip_stub): Constify. * ax-gdb.c (gen_binop, gen_struct_ref_recursive, gen_struct_ref) (gen_aggregate_elt_ref): Constify. * bcache.c (print_bcache_statistics): Constify. * bcache.h (print_bcache_statistics): Constify. * break-catch-throw.c (catch_exception_command_1): * breakpoint.c (struct ep_type_description::description): Constify. (add_solib_catchpoint): Constify. (catch_fork_command_1): Add cast. (add_catch_command): Constify. * breakpoint.h (add_catch_command, add_solib_catchpoint): Constify. * bsd-uthread.c (bsd_uthread_state): Constify. * buildsym.c (patch_subfile_names): Constify. * buildsym.h (next_symbol_text_func, patch_subfile_names): Constify. * c-exp.y (yyerror): Constify. (token::oper): Constify. * c-lang.h (c_yyerror, cp_print_class_member): Constify. * c-varobj.c (cplus_describe_child): Constify. * charset.c (find_charset_names): Add cast. (find_charset_names): Constify array and add const_cast. * cli/cli-cmds.c (complete_command, cd_command): Constify. (edit_command): Constify. * cli/cli-decode.c (lookup_cmd): Constify. * cli/cli-dump.c (dump_memory_command, dump_value_command): Constify. (struct dump_context): Constify. (add_dump_command, restore_command): Constify. * cli/cli-script.c (get_command_line): Constify. * cli/cli-script.h (get_command_line): Constify. * cli/cli-utils.c (check_for_argument): Constify. * cli/cli-utils.h (check_for_argument): Constify. * coff-pe-read.c (struct read_pe_section_data): Constify. * command.h (lookup_cmd): Constify. * common/print-utils.c (decimal2str): Constify. * completer.c (gdb_print_filename): Constify. * corefile.c (set_gnutarget): Constify. * cp-name-parser.y (yyerror): Constify. * cp-valprint.c (cp_print_class_member): Constify. * cris-tdep.c (cris_register_name, crisv32_register_name): Constify. * d-exp.y (yyerror): Constify. (struct token::oper): Constify. * d-lang.h (d_yyerror): Constify. * dbxread.c (struct header_file_location::name): Constify. (add_old_header_file, add_new_header_file, last_function_name) (dbx_next_symbol_text, add_bincl_to_list) (find_corresponding_bincl_psymtab, set_namestring) (find_stab_function_addr, read_dbx_symtab, start_psymtab) (dbx_end_psymtab, read_ofile_symtab, process_one_symbol): * defs.h (command_line_input, print_address_symbolic) (deprecated_readline_begin_hook): Constify. * dwarf2read.c (anonymous_struct_prefix, dwarf_bool_name): Constify. * event-top.c (handle_line_of_input): Constify and add cast. * exceptions.c (catch_errors): Constify. * exceptions.h (catch_errors): Constify. * expprint.c (print_subexp_standard, op_string, op_name) (op_name_standard, dump_raw_expression, dump_raw_expression): * expression.h (op_name, op_string, dump_raw_expression): Constify. * f-exp.y (yyerror): Constify. (struct token::oper): Constify. (struct f77_boolean_val::name): Constify. * f-lang.c (f_word_break_characters): Constify. * f-lang.h (f_yyerror): Constify. * fork-child.c (fork_inferior): Add cast. * frv-tdep.c (struct gdbarch_tdep::register_names): Constify. (new_variant): Constify. * gdbarch.sh (pstring_ptr, pstring_list): Constify. * gdbarch.c: Regenerate. * gdbcore.h (set_gnutarget): Constify. * go-exp.y (yyerror): Constify. (token::oper): Constify. * go-lang.h (go_yyerror): Constify. * go32-nat.c (go32_sysinfo): Constify. * guile/scm-breakpoint.c (gdbscm_breakpoint_expression): Constify. * guile/scm-cmd.c (cmdscm_function): Constify. * guile/scm-param.c (pascm_param_value): Constify. * h8300-tdep.c (h8300_register_name, h8300s_register_name) (h8300sx_register_name): Constify. * hppa-tdep.c (hppa32_register_name, hppa64_register_name): Constify. * ia64-tdep.c (ia64_register_names): Constify. * infcmd.c (construct_inferior_arguments): Constify. (path_command, attach_post_wait): Constify. * language.c (show_range_command, show_case_command) (unk_lang_error): Constify. * language.h (language_defn::la_error) (language_defn::la_name_of_this): Constify. * linespec.c (decode_line_2): Constify. * linux-thread-db.c (thread_db_err_str): Constify. * lm32-tdep.c (lm32_register_name): Constify. * m2-exp.y (yyerror): Constify. * m2-lang.h (m2_yyerror): Constify. * m32r-tdep.c (m32r_register_names): Constify and make static. * m68hc11-tdep.c (m68hc11_register_names): Constify. * m88k-tdep.c (m88k_register_name): Constify. * macroexp.c (appendmem): Constify. * mdebugread.c (fdr_name, add_data_symbol, parse_type) (upgrade_type, parse_external, parse_partial_symbols) (mdebug_next_symbol_text, cross_ref, mylookup_symbol, new_psymtab) (new_symbol): Constify. * memattr.c (mem_info_command): Constify. * mep-tdep.c (register_name_from_keyword): Constify. * mi/mi-cmd-env.c (mi_cmd_env_path, _initialize_mi_cmd_env): Constify. * mi/mi-cmd-stack.c (list_args_or_locals): Constify. * mi/mi-cmd-var.c (mi_cmd_var_show_attributes): Constify. * mi/mi-main.c (captured_mi_execute_command): Constify and add cast. (mi_execute_async_cli_command): Constify. * mips-tdep.c (mips_register_name): Constify. * mn10300-tdep.c (register_name, mn10300_generic_register_name) (am33_register_name, am33_2_register_name) * moxie-tdep.c (moxie_register_names): Constify. * nat/linux-osdata.c (osdata_type): Constify fields. * nto-tdep.c (nto_parse_redirection): Constify. * objc-lang.c (lookup_struct_typedef, lookup_objc_class) (lookup_child_selector): Constify. (objc_methcall::name): Constify. * objc-lang.h (lookup_objc_class, lookup_child_selector) (lookup_struct_typedef): Constify. * objfiles.c (pc_in_section): Constify. * objfiles.h (pc_in_section): Constify. * p-exp.y (struct token::oper): Constify. (yyerror): Constify. * p-lang.h (pascal_yyerror): Constify. * parser-defs.h (op_name_standard): Constify. (op_print::string): Constify. (exp_descriptor::op_name): Constify. * printcmd.c (print_address_symbolic): Constify. * psymtab.c (print_partial_symbols): Constify. * python/py-breakpoint.c (stop_func): Constify. (bppy_get_expression): Constify. * python/py-cmd.c (cmdpy_completer::name): Constify. (cmdpy_function): Constify. * python/py-event.c (evpy_add_attribute) (gdbpy_initialize_event_generic): Constify. * python/py-event.h (evpy_add_attribute) (gdbpy_initialize_event_generic): Constify. * python/py-evts.c (add_new_registry): Constify. * python/py-finishbreakpoint.c (outofscope_func): Constify. * python/py-framefilter.c (get_py_iter_from_func): Constify. * python/py-inferior.c (get_buffer): Add cast. * python/py-param.c (parm_constant::name): Constify. * python/py-unwind.c (fprint_frame_id): Constify. * python/python.c (gdbpy_parameter_value): Constify. * remote-fileio.c (remote_fio_func_map): Make 'name' const. * remote.c (memory_packet_config::name): Constify. (show_packet_config_cmd, remote_write_bytes) (remote_buffer_add_string): * reverse.c (exec_reverse_once): Constify. * rs6000-tdep.c (variant::name, variant::description): Constify. * rust-exp.y (rustyyerror): Constify. * rust-lang.c (rust_op_name): Constify. * rust-lang.h (rustyyerror): Constify. * serial.h (serial_ops::name): Constify. * sh-tdep.c (sh_sh_register_name, sh_sh3_register_name) (sh_sh3e_register_name, sh_sh2e_register_name) (sh_sh2a_register_name, sh_sh2a_nofpu_register_name) (sh_sh_dsp_register_name, sh_sh3_dsp_register_name) (sh_sh4_register_name, sh_sh4_nofpu_register_name) (sh_sh4al_dsp_register_name): Constify. * sh64-tdep.c (sh64_register_name): Constify. * solib-darwin.c (lookup_symbol_from_bfd): Constify. * spu-tdep.c (spu_register_name, info_spu_dma_cmdlist): Constify. * stabsread.c (patch_block_stabs, read_type_number) (ref_map::stabs, ref_add, process_reference) (symbol_reference_defined, define_symbol, define_symbol) (error_type, read_type, read_member_functions, read_cpp_abbrev) (read_one_struct_field, read_struct_fields, read_baseclasses) (read_tilde_fields, read_struct_type, read_array_type) (read_enum_type, read_sun_builtin_type, read_sun_floating_type) (read_huge_number, read_range_type, read_args, common_block_start) (find_name_end): Constify. * stabsread.h (common_block_start, define_symbol) (process_one_symbol, symbol_reference_defined, ref_add): * symfile.c (get_section_index, add_symbol_file_command): * symfile.h (get_section_index): Constify. * target-descriptions.c (tdesc_type::name): Constify. (tdesc_free_type): Add cast. * target.c (find_default_run_target): (add_deprecated_target_alias, find_default_run_target) (target_announce_detach): Constify. (do_option): Constify. * target.h (add_deprecated_target_alias): Constify. * thread.c (print_thread_info_1): Constify. * top.c (deprecated_readline_begin_hook, command_line_input): Constify. (init_main): Add casts. * top.h (handle_line_of_input): Constify. * tracefile-tfile.c (tfile_write_uploaded_tsv): Constify. * tracepoint.c (tvariables_info_1, trace_status_mi): Constify. (tfind_command): Rename to ... (tfind_command_1): ... this and constify. (tfind_command): New function. (tfind_end_command, tfind_start_command): Adjust. (encode_source_string): Constify. * tracepoint.h (encode_source_string): Constify. * tui/tui-data.c (tui_partial_win_by_name): Constify. * tui/tui-data.h (tui_partial_win_by_name): Constify. * tui/tui-source.c (tui_set_source_content_nil): Constify. * tui/tui-source.h (tui_set_source_content_nil): Constify. * tui/tui-win.c (parse_scrolling_args): Constify. * tui/tui-windata.c (tui_erase_data_content): Constify. * tui/tui-windata.h (tui_erase_data_content): Constify. * tui/tui-winsource.c (tui_erase_source_content): Constify. * tui/tui.c (tui_enable): Add cast. * utils.c (defaulted_query): Constify. (init_page_info): Add cast. (puts_debug, subset_compare): Constify. * utils.h (subset_compare): Constify. * varobj.c (varobj_format_string): Constify. * varobj.h (varobj_format_string): Constify. * vax-tdep.c (vax_register_name): Constify. * windows-nat.c (windows_detach): Constify. * xcoffread.c (process_linenos, xcoff_next_symbol_text): Constify. * xml-support.c (gdb_xml_end_element): Constify. * xml-tdesc.c (tdesc_start_reg): Constify. * xstormy16-tdep.c (xstormy16_register_name): Constify. * xtensa-tdep.c (xtensa_find_register_by_name): Constify. * xtensa-tdep.h (xtensa_register_t::name): Constify. gdb/gdbserver/ChangeLog: 2017-04-05 Pedro Alves <palves@redhat.com> * gdbreplay.c (sync_error): Constify. * linux-x86-low.c (push_opcode): Constify.
492 lines
15 KiB
C
492 lines
15 KiB
C
/* Implement a cached obstack.
|
||
Written by Fred Fish <fnf@cygnus.com>
|
||
Rewritten by Jim Blandy <jimb@cygnus.com>
|
||
|
||
Copyright (C) 1999-2017 Free Software Foundation, Inc.
|
||
|
||
This file is part of GDB.
|
||
|
||
This program is free software; you can redistribute it and/or modify
|
||
it under the terms of the GNU General Public License as published by
|
||
the Free Software Foundation; either version 3 of the License, or
|
||
(at your option) any later version.
|
||
|
||
This program is distributed in the hope that it will be useful,
|
||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
GNU General Public License for more details.
|
||
|
||
You should have received a copy of the GNU General Public License
|
||
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
||
|
||
#include "defs.h"
|
||
#include "gdb_obstack.h"
|
||
#include "bcache.h"
|
||
|
||
/* The type used to hold a single bcache string. The user data is
|
||
stored in d.data. Since it can be any type, it needs to have the
|
||
same alignment as the most strict alignment of any type on the host
|
||
machine. I don't know of any really correct way to do this in
|
||
stock ANSI C, so just do it the same way obstack.h does. */
|
||
|
||
struct bstring
|
||
{
|
||
/* Hash chain. */
|
||
struct bstring *next;
|
||
/* Assume the data length is no more than 64k. */
|
||
unsigned short length;
|
||
/* The half hash hack. This contains the upper 16 bits of the hash
|
||
value and is used as a pre-check when comparing two strings and
|
||
avoids the need to do length or memcmp calls. It proves to be
|
||
roughly 100% effective. */
|
||
unsigned short half_hash;
|
||
|
||
union
|
||
{
|
||
char data[1];
|
||
double dummy;
|
||
}
|
||
d;
|
||
};
|
||
|
||
|
||
/* The structure for a bcache itself. The bcache is initialized, in
|
||
bcache_xmalloc(), by filling it with zeros and then setting the
|
||
corresponding obstack's malloc() and free() methods. */
|
||
|
||
struct bcache
|
||
{
|
||
/* All the bstrings are allocated here. */
|
||
struct obstack cache;
|
||
|
||
/* How many hash buckets we're using. */
|
||
unsigned int num_buckets;
|
||
|
||
/* Hash buckets. This table is allocated using malloc, so when we
|
||
grow the table we can return the old table to the system. */
|
||
struct bstring **bucket;
|
||
|
||
/* Statistics. */
|
||
unsigned long unique_count; /* number of unique strings */
|
||
long total_count; /* total number of strings cached, including dups */
|
||
long unique_size; /* size of unique strings, in bytes */
|
||
long total_size; /* total number of bytes cached, including dups */
|
||
long structure_size; /* total size of bcache, including infrastructure */
|
||
/* Number of times that the hash table is expanded and hence
|
||
re-built, and the corresponding number of times that a string is
|
||
[re]hashed as part of entering it into the expanded table. The
|
||
total number of hashes can be computed by adding TOTAL_COUNT to
|
||
expand_hash_count. */
|
||
unsigned long expand_count;
|
||
unsigned long expand_hash_count;
|
||
/* Number of times that the half-hash compare hit (compare the upper
|
||
16 bits of hash values) hit, but the corresponding combined
|
||
length/data compare missed. */
|
||
unsigned long half_hash_miss_count;
|
||
|
||
/* Hash function to be used for this bcache object. */
|
||
unsigned long (*hash_function)(const void *addr, int length);
|
||
|
||
/* Compare function to be used for this bcache object. */
|
||
int (*compare_function)(const void *, const void *, int length);
|
||
};
|
||
|
||
/* The old hash function was stolen from SDBM. This is what DB 3.0
|
||
uses now, and is better than the old one. */
|
||
|
||
unsigned long
|
||
hash(const void *addr, int length)
|
||
{
|
||
return hash_continue (addr, length, 0);
|
||
}
|
||
|
||
/* Continue the calculation of the hash H at the given address. */
|
||
|
||
unsigned long
|
||
hash_continue (const void *addr, int length, unsigned long h)
|
||
{
|
||
const unsigned char *k, *e;
|
||
|
||
k = (const unsigned char *)addr;
|
||
e = k+length;
|
||
for (; k< e;++k)
|
||
{
|
||
h *=16777619;
|
||
h ^= *k;
|
||
}
|
||
return (h);
|
||
}
|
||
|
||
/* Growing the bcache's hash table. */
|
||
|
||
/* If the average chain length grows beyond this, then we want to
|
||
resize our hash table. */
|
||
#define CHAIN_LENGTH_THRESHOLD (5)
|
||
|
||
static void
|
||
expand_hash_table (struct bcache *bcache)
|
||
{
|
||
/* A table of good hash table sizes. Whenever we grow, we pick the
|
||
next larger size from this table. sizes[i] is close to 1 << (i+10),
|
||
so we roughly double the table size each time. After we fall off
|
||
the end of this table, we just double. Don't laugh --- there have
|
||
been executables sighted with a gigabyte of debug info. */
|
||
static unsigned long sizes[] = {
|
||
1021, 2053, 4099, 8191, 16381, 32771,
|
||
65537, 131071, 262144, 524287, 1048573, 2097143,
|
||
4194301, 8388617, 16777213, 33554467, 67108859, 134217757,
|
||
268435459, 536870923, 1073741827, 2147483659UL
|
||
};
|
||
unsigned int new_num_buckets;
|
||
struct bstring **new_buckets;
|
||
unsigned int i;
|
||
|
||
/* Count the stats. Every unique item needs to be re-hashed and
|
||
re-entered. */
|
||
bcache->expand_count++;
|
||
bcache->expand_hash_count += bcache->unique_count;
|
||
|
||
/* Find the next size. */
|
||
new_num_buckets = bcache->num_buckets * 2;
|
||
for (i = 0; i < (sizeof (sizes) / sizeof (sizes[0])); i++)
|
||
if (sizes[i] > bcache->num_buckets)
|
||
{
|
||
new_num_buckets = sizes[i];
|
||
break;
|
||
}
|
||
|
||
/* Allocate the new table. */
|
||
{
|
||
size_t new_size = new_num_buckets * sizeof (new_buckets[0]);
|
||
|
||
new_buckets = (struct bstring **) xmalloc (new_size);
|
||
memset (new_buckets, 0, new_size);
|
||
|
||
bcache->structure_size -= (bcache->num_buckets
|
||
* sizeof (bcache->bucket[0]));
|
||
bcache->structure_size += new_size;
|
||
}
|
||
|
||
/* Rehash all existing strings. */
|
||
for (i = 0; i < bcache->num_buckets; i++)
|
||
{
|
||
struct bstring *s, *next;
|
||
|
||
for (s = bcache->bucket[i]; s; s = next)
|
||
{
|
||
struct bstring **new_bucket;
|
||
next = s->next;
|
||
|
||
new_bucket = &new_buckets[(bcache->hash_function (&s->d.data,
|
||
s->length)
|
||
% new_num_buckets)];
|
||
s->next = *new_bucket;
|
||
*new_bucket = s;
|
||
}
|
||
}
|
||
|
||
/* Plug in the new table. */
|
||
if (bcache->bucket)
|
||
xfree (bcache->bucket);
|
||
bcache->bucket = new_buckets;
|
||
bcache->num_buckets = new_num_buckets;
|
||
}
|
||
|
||
|
||
/* Looking up things in the bcache. */
|
||
|
||
/* The number of bytes needed to allocate a struct bstring whose data
|
||
is N bytes long. */
|
||
#define BSTRING_SIZE(n) (offsetof (struct bstring, d.data) + (n))
|
||
|
||
/* Find a copy of the LENGTH bytes at ADDR in BCACHE. If BCACHE has
|
||
never seen those bytes before, add a copy of them to BCACHE. In
|
||
either case, return a pointer to BCACHE's copy of that string. */
|
||
const void *
|
||
bcache (const void *addr, int length, struct bcache *cache)
|
||
{
|
||
return bcache_full (addr, length, cache, NULL);
|
||
}
|
||
|
||
/* Find a copy of the LENGTH bytes at ADDR in BCACHE. If BCACHE has
|
||
never seen those bytes before, add a copy of them to BCACHE. In
|
||
either case, return a pointer to BCACHE's copy of that string. If
|
||
optional ADDED is not NULL, return 1 in case of new entry or 0 if
|
||
returning an old entry. */
|
||
|
||
const void *
|
||
bcache_full (const void *addr, int length, struct bcache *bcache, int *added)
|
||
{
|
||
unsigned long full_hash;
|
||
unsigned short half_hash;
|
||
int hash_index;
|
||
struct bstring *s;
|
||
|
||
if (added)
|
||
*added = 0;
|
||
|
||
/* Lazily initialize the obstack. This can save quite a bit of
|
||
memory in some cases. */
|
||
if (bcache->total_count == 0)
|
||
{
|
||
/* We could use obstack_specify_allocation here instead, but
|
||
gdb_obstack.h specifies the allocation/deallocation
|
||
functions. */
|
||
obstack_init (&bcache->cache);
|
||
}
|
||
|
||
/* If our average chain length is too high, expand the hash table. */
|
||
if (bcache->unique_count >= bcache->num_buckets * CHAIN_LENGTH_THRESHOLD)
|
||
expand_hash_table (bcache);
|
||
|
||
bcache->total_count++;
|
||
bcache->total_size += length;
|
||
|
||
full_hash = bcache->hash_function (addr, length);
|
||
|
||
half_hash = (full_hash >> 16);
|
||
hash_index = full_hash % bcache->num_buckets;
|
||
|
||
/* Search the hash bucket for a string identical to the caller's.
|
||
As a short-circuit first compare the upper part of each hash
|
||
values. */
|
||
for (s = bcache->bucket[hash_index]; s; s = s->next)
|
||
{
|
||
if (s->half_hash == half_hash)
|
||
{
|
||
if (s->length == length
|
||
&& bcache->compare_function (&s->d.data, addr, length))
|
||
return &s->d.data;
|
||
else
|
||
bcache->half_hash_miss_count++;
|
||
}
|
||
}
|
||
|
||
/* The user's string isn't in the list. Insert it after *ps. */
|
||
{
|
||
struct bstring *newobj
|
||
= (struct bstring *) obstack_alloc (&bcache->cache,
|
||
BSTRING_SIZE (length));
|
||
|
||
memcpy (&newobj->d.data, addr, length);
|
||
newobj->length = length;
|
||
newobj->next = bcache->bucket[hash_index];
|
||
newobj->half_hash = half_hash;
|
||
bcache->bucket[hash_index] = newobj;
|
||
|
||
bcache->unique_count++;
|
||
bcache->unique_size += length;
|
||
bcache->structure_size += BSTRING_SIZE (length);
|
||
|
||
if (added)
|
||
*added = 1;
|
||
|
||
return &newobj->d.data;
|
||
}
|
||
}
|
||
|
||
|
||
/* Compare the byte string at ADDR1 of lenght LENGHT to the
|
||
string at ADDR2. Return 1 if they are equal. */
|
||
|
||
static int
|
||
bcache_compare (const void *addr1, const void *addr2, int length)
|
||
{
|
||
return memcmp (addr1, addr2, length) == 0;
|
||
}
|
||
|
||
/* Allocating and freeing bcaches. */
|
||
|
||
/* Allocated a bcache. HASH_FUNCTION and COMPARE_FUNCTION can be used
|
||
to pass in custom hash, and compare functions to be used by this
|
||
bcache. If HASH_FUNCTION is NULL hash() is used and if
|
||
COMPARE_FUNCTION is NULL memcmp() is used. */
|
||
|
||
struct bcache *
|
||
bcache_xmalloc (unsigned long (*hash_function)(const void *, int length),
|
||
int (*compare_function)(const void *,
|
||
const void *,
|
||
int length))
|
||
{
|
||
/* Allocate the bcache pre-zeroed. */
|
||
struct bcache *b = XCNEW (struct bcache);
|
||
|
||
if (hash_function)
|
||
b->hash_function = hash_function;
|
||
else
|
||
b->hash_function = hash;
|
||
|
||
if (compare_function)
|
||
b->compare_function = compare_function;
|
||
else
|
||
b->compare_function = bcache_compare;
|
||
return b;
|
||
}
|
||
|
||
/* Free all the storage associated with BCACHE. */
|
||
void
|
||
bcache_xfree (struct bcache *bcache)
|
||
{
|
||
if (bcache == NULL)
|
||
return;
|
||
/* Only free the obstack if we actually initialized it. */
|
||
if (bcache->total_count > 0)
|
||
obstack_free (&bcache->cache, 0);
|
||
xfree (bcache->bucket);
|
||
xfree (bcache);
|
||
}
|
||
|
||
|
||
|
||
/* Printing statistics. */
|
||
|
||
static void
|
||
print_percentage (int portion, int total)
|
||
{
|
||
if (total == 0)
|
||
/* i18n: Like "Percentage of duplicates, by count: (not applicable)". */
|
||
printf_filtered (_("(not applicable)\n"));
|
||
else
|
||
printf_filtered ("%3d%%\n", (int) (portion * 100.0 / total));
|
||
}
|
||
|
||
|
||
/* Print statistics on BCACHE's memory usage and efficacity at
|
||
eliminating duplication. NAME should describe the kind of data
|
||
BCACHE holds. Statistics are printed using `printf_filtered' and
|
||
its ilk. */
|
||
void
|
||
print_bcache_statistics (struct bcache *c, const char *type)
|
||
{
|
||
int occupied_buckets;
|
||
int max_chain_length;
|
||
int median_chain_length;
|
||
int max_entry_size;
|
||
int median_entry_size;
|
||
|
||
/* Count the number of occupied buckets, tally the various string
|
||
lengths, and measure chain lengths. */
|
||
{
|
||
unsigned int b;
|
||
int *chain_length = XCNEWVEC (int, c->num_buckets + 1);
|
||
int *entry_size = XCNEWVEC (int, c->unique_count + 1);
|
||
int stringi = 0;
|
||
|
||
occupied_buckets = 0;
|
||
|
||
for (b = 0; b < c->num_buckets; b++)
|
||
{
|
||
struct bstring *s = c->bucket[b];
|
||
|
||
chain_length[b] = 0;
|
||
|
||
if (s)
|
||
{
|
||
occupied_buckets++;
|
||
|
||
while (s)
|
||
{
|
||
gdb_assert (b < c->num_buckets);
|
||
chain_length[b]++;
|
||
gdb_assert (stringi < c->unique_count);
|
||
entry_size[stringi++] = s->length;
|
||
s = s->next;
|
||
}
|
||
}
|
||
}
|
||
|
||
/* To compute the median, we need the set of chain lengths
|
||
sorted. */
|
||
qsort (chain_length, c->num_buckets, sizeof (chain_length[0]),
|
||
compare_positive_ints);
|
||
qsort (entry_size, c->unique_count, sizeof (entry_size[0]),
|
||
compare_positive_ints);
|
||
|
||
if (c->num_buckets > 0)
|
||
{
|
||
max_chain_length = chain_length[c->num_buckets - 1];
|
||
median_chain_length = chain_length[c->num_buckets / 2];
|
||
}
|
||
else
|
||
{
|
||
max_chain_length = 0;
|
||
median_chain_length = 0;
|
||
}
|
||
if (c->unique_count > 0)
|
||
{
|
||
max_entry_size = entry_size[c->unique_count - 1];
|
||
median_entry_size = entry_size[c->unique_count / 2];
|
||
}
|
||
else
|
||
{
|
||
max_entry_size = 0;
|
||
median_entry_size = 0;
|
||
}
|
||
|
||
xfree (chain_length);
|
||
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: "));
|
||
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: "));
|
||
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: "));
|
||
if (c->unique_count > 0)
|
||
printf_filtered ("%ld\n", c->unique_size / c->unique_count);
|
||
else
|
||
/* 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"),
|
||
c->structure_size);
|
||
printf_filtered (_(" Percentage memory overhead: "));
|
||
print_percentage (c->structure_size - c->unique_size, c->unique_size);
|
||
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"),
|
||
c->expand_count);
|
||
printf_filtered (_(" Hash table hashes: %lu\n"),
|
||
c->total_count + c->expand_hash_count);
|
||
printf_filtered (_(" Half hash misses: %lu\n"),
|
||
c->half_hash_miss_count);
|
||
printf_filtered (_(" Hash table population: "));
|
||
print_percentage (occupied_buckets, c->num_buckets);
|
||
printf_filtered (_(" Median hash chain length: %3d\n"),
|
||
median_chain_length);
|
||
printf_filtered (_(" Average hash chain length: "));
|
||
if (c->num_buckets > 0)
|
||
printf_filtered ("%3lu\n", c->unique_count / c->num_buckets);
|
||
else
|
||
/* 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");
|
||
}
|
||
|
||
int
|
||
bcache_memory_used (struct bcache *bcache)
|
||
{
|
||
if (bcache->total_count == 0)
|
||
return 0;
|
||
return obstack_memory_used (&bcache->cache);
|
||
}
|