f6ac5f3d63
I.e., use C++ virtual methods and inheritance instead of tables of
function pointers.
Unfortunately, there's no way to do a smooth transition. ALL native
targets in the tree must be converted at the same time. I've tested
all I could with cross compilers and with help from GCC compile farm,
but naturally I haven't been able to test many of the ports. Still, I
made a best effort to port everything over, and while I expect some
build problems due to typos and such, which should be trivial to fix,
I don't expect any design problems.
* Implementation notes:
- The flattened current_target is gone. References to current_target
or current_target.beneath are replaced with references to
target_stack (the top of the stack) directly.
- To keep "set debug target" working, this adds a new debug_stratum
layer that sits on top of the stack, prints the debug, and delegates
to the target beneath.
In addition, this makes the shortname and longname properties of
target_ops be virtual methods instead of data fields, and makes the
debug target defer those to the target beneath. This is so that
debug code sprinkled around that does "if (debugtarget) ..." can
transparently print the name of the target beneath.
A patch later in the series actually splits out the
shortname/longname methods to a separate structure, but I preferred
to keep that chance separate as it is associated with changing a bit
the design of how targets are registered and open.
- Since you can't check whether a C++ virtual method is overridden,
the old method of checking whether a target_ops implements a method
by comparing the function pointer must be replaced with something
else.
Some cases are fixed by adding a parallel "can_do_foo" target_ops
methods. E.g.,:
+ for (t = target_stack; t != NULL; t = t->beneath)
{
- if (t->to_create_inferior != NULL)
+ if (t->can_create_inferior ())
break;
}
Others are fixed by changing void return type to bool or int return
type, and have the default implementation return false or -1, to
indicate lack of support.
- make-target-delegates was adjusted to generate C++ classes and
methods.
It needed tweaks to grok "virtual" in front of the target method
name, and for the fact that methods are no longer function pointers.
(In particular, the current code parsing the return type was simple
because it could simply parse up until the '(' in '(*to_foo)'.
It now generates a couple C++ classes that inherit target_ops:
dummy_target and debug_target.
Since we need to generate the class declarations as well, i.e., we
need to emit methods twice, we now generate the code in two passes.
- The core_target global is renamed to avoid conflict with the
"core_target" class.
- ctf/tfile targets
init_tracefile_ops is replaced by a base class that is inherited by
both ctf and tfile.
- bsd-uthread
The bsd_uthread_ops_hack hack is gone. It's not needed because
nothing was extending a target created by bsd_uthread_target.
- remote/extended-remote targets
This is a first pass, just enough to C++ify target_ops.
A later pass will convert more free functions to methods, and make
remote_state be truly per remote instance, allowing multiple
simultaneous instances of remote targets.
- inf-child/"native" is converted to an actual base class
(inf_child_target), that is inherited by all native targets.
- GNU/Linux
The old weird double-target linux_ops mechanism in linux-nat.c, is
gone, replaced by adding a few virtual methods to linux-nat.h's
target_ops, called low_XXX, that the concrete linux-nat
implementations override. Sort of like gdbserver's
linux_target_ops, but simpler, for requiring only one
target_ops-like hierarchy, which spares implementing the same method
twice when we need to forward the method to a low implementation.
The low target simply reimplements the target_ops method directly in
that case.
There are a few remaining linux-nat.c hooks that would be better
converted to low_ methods like above too. E.g.:
linux_nat_set_new_thread (t, x86_linux_new_thread);
linux_nat_set_new_fork (t, x86_linux_new_fork);
linux_nat_set_forget_process
That'll be done in a follow up patch.
- We can no longer use functions like x86_use_watchpoints to install
custom methods on an arbitrary base target.
The patch replaces instances of such a pattern with template mixins.
For example memory_breakpoint_target defined in target.h, or
x86_nat_target in x86-nat.h.
- linux_trad_target, MIPS and Alpha GNU/Linux
The code in the new linux-nat-trad.h/c files which was split off of
inf-ptrace.h/c recently, is converted to a C++ base class, and used
by the MIPS and Alpha GNU/Linux ports.
- BSD targets
The
$architecture x NetBSD/OpenBSD/FreeBSD
support matrix complicates things a bit. There's common BSD target
code, and there's common architecture-specific code shared between
the different BSDs. Currently, all that is stiched together to form
a final target, via the i386bsd_target, x86bsd_target,
fbsd_nat_add_target functions etc.
This introduces new fbsd_nat_target, obsd_nat_target and
nbsd_nat_target classes that serve as base/prototype target for the
corresponding BSD variant.
And introduces generic i386/AMD64 BSD targets, to be used as
template mixin to build a final target. Similarly, a generic SPARC
target is added, used by both BSD and Linux ports.
- bsd_kvm_add_target, BSD libkvm target
I considered making bsd_kvm_supply_pcb a virtual method, and then
have each port inherit bsd_kvm_target and override that method, but
that was resulting in lots of unjustified churn, so I left the
function pointer mechanism alone.
gdb/ChangeLog:
2018-05-02 Pedro Alves <palves@redhat.com>
John Baldwin <jhb@freebsd.org>
* target.h (enum strata) <debug_stratum>: New.
(struct target_ops) <all delegation methods>: Replace by C++
virtual methods, and drop "to_" prefix. All references updated
throughout.
<to_shortname, to_longname, to_doc, to_data,
to_have_steppable_watchpoint, to_have_continuable_watchpoint,
to_has_thread_control, to_attach_no_wait>: Delete, replaced by
virtual methods. All references updated throughout.
<can_attach, supports_terminal_ours, can_create_inferior,
get_thread_control_capabilities, attach_no_wait>: New
virtual methods.
<insert_breakpoint, remove_breakpoint>: Now
TARGET_DEFAULT_NORETURN methods.
<info_proc>: Now returns bool.
<to_magic>: Delete.
(OPS_MAGIC): Delete.
(current_target): Delete. All references replaced by references
to ...
(target_stack): ... this. New.
(target_shortname, target_longname): Adjust.
(target_can_run): Now a function declaration.
(default_child_has_all_memory, default_child_has_memory)
(default_child_has_stack, default_child_has_registers)
(default_child_has_execution): Remove target_ops parameter.
(complete_target_initialization): Delete.
(memory_breakpoint_target): New template class.
(test_target_ops): Refactor as a C++ class with virtual methods.
* make-target-delegates (NAME_PART): Tighten.
(POINTER_PART, CP_SYMBOL): New.
(SIMPLE_RETURN_PART): Reimplement.
(VEC_RETURN_PART): Expect less.
(RETURN_PART, VIRTUAL_PART): New.
(METHOD): Adjust to C++ virtual methods.
(scan_target_h): Remove reference to C99.
(dname): Output "target_ops::" prefix.
(write_function_header): Adjust to output a C++ class method.
(write_declaration): New.
(write_delegator): Adjust to output a C++ class method.
(tdname): Output "dummy_target::" prefix.
(write_tdefault, write_debugmethod): Adjust to output a C++ class
method.
(tdefault_names, debug_names): Delete.
(return_types, tdefaults, styles, argtypes_array): New.
(top level): All methods are delegators.
(print_class): New.
(top level): Print dummy_target and debug_target classes.
* target-delegates.c: Regenerate.
* target-debug.h (target_debug_print_enum_info_proc_what)
(target_debug_print_thread_control_capabilities)
(target_debug_print_thread_info_p): New.
* target.c (dummy_target): Delete.
(the_dummy_target, the_debug_target): New.
(target_stack): Now extern.
(set_targetdebug): Push/unpush debug target.
(default_child_has_all_memory, default_child_has_memory)
(default_child_has_stack, default_child_has_registers)
(default_child_has_execution): Remove target_ops parameter.
(complete_target_initialization): Delete.
(add_target_with_completer): No longer call
complete_target_initialization.
(target_supports_terminal_ours): Use regular delegation.
(update_current_target): Delete.
(push_target): No longer check magic number. Don't call
update_current_target.
(unpush_target): Don't call update_current_target.
(target_is_pushed): No longer check magic number.
(target_require_runnable): Skip for all stratums over
process_stratum.
(target_ops::info_proc): New.
(target_info_proc): Use find_target_at and
find_default_run_target.
(target_supports_disable_randomization): Use regular delegation.
(target_get_osdata): Use find_target_at.
(target_ops::open, target_ops::close, target_ops::can_attach)
(target_ops::attach, target_ops::can_create_inferior)
(target_ops::create_inferior, target_ops::can_run)
(target_can_run): New.
(default_fileio_target): Use regular delegation.
(target_ops::fileio_open, target_ops::fileio_pwrite)
(target_ops::fileio_pread, target_ops::fileio_fstat)
(target_ops::fileio_close, target_ops::fileio_unlink)
(target_ops::fileio_readlink): New.
(target_fileio_open_1, target_fileio_unlink)
(target_fileio_readlink): Always call the target method. Handle
FILEIO_ENOSYS.
(return_zero, return_zero_has_execution): Delete.
(init_dummy_target): Delete.
(dummy_target::dummy_target, dummy_target::shortname)
(dummy_target::longname, dummy_target::doc)
(debug_target::debug_target, debug_target::shortname)
(debug_target::longname, debug_target::doc): New.
(target_supports_delete_record): Use regular delegation.
(setup_target_debug): Delete.
(maintenance_print_target_stack): Skip debug_stratum.
(initialize_targets): Instantiate the_dummy_target and
the_debug_target.
* auxv.c (target_auxv_parse): Remove 'ops' parameter. Adjust to
use target_stack.
(target_auxv_search, fprint_target_auxv): Adjust.
(info_auxv_command): Adjust to use target_stack.
* auxv.h (target_auxv_parse): Remove 'ops' parameter.
* exceptions.c (print_flush): Handle a NULL target_stack.
* regcache.c (target_ops_no_register): Refactor as class with
virtual methods.
* exec.c (exec_target): New class.
(exec_ops): Now an exec_target.
(exec_open, exec_close_1, exec_get_section_table)
(exec_xfer_partial, exec_files_info, exec_has_memory)
(exec_make_note_section): Refactor as exec_target methods.
(exec_file_clear, ignore, exec_remove_breakpoint, init_exec_ops):
Delete.
(exec_target::find_memory_regions): New.
(_initialize_exec): Don't call init_exec_ops.
* gdbcore.h (exec_file_clear): Delete.
* corefile.c (core_target): Delete.
(core_file_command): Adjust.
* corelow.c (core_target): New class.
(the_core_target): New.
(core_close): Remove target_ops parameter.
(core_close_cleanup): Adjust.
(core_target::close): New.
(core_open, core_detach, get_core_registers, core_files_info)
(core_xfer_partial, core_thread_alive, core_read_description)
(core_pid_to_str, core_thread_name, core_has_memory)
(core_has_stack, core_has_registers, core_info_proc): Rework as
core_target methods.
(ignore, core_remove_breakpoint, init_core_ops): Delete.
(_initialize_corelow): Initialize the_core_target.
* gdbcore.h (core_target): Delete.
(the_core_target): New.
* ctf.c: (ctf_target): New class.
(ctf_ops): Now a ctf_target.
(ctf_open, ctf_close, ctf_files_info, ctf_fetch_registers)
(ctf_xfer_partial, ctf_get_trace_state_variable_value)
(ctf_trace_find, ctf_traceframe_info): Refactor as ctf_target
methods.
(init_ctf_ops): Delete.
(_initialize_ctf): Don't call it.
* tracefile-tfile.c (tfile_target): New class.
(tfile_ops): Now a tfile_target.
(tfile_open, tfile_close, tfile_files_info)
(tfile_get_tracepoint_status, tfile_trace_find)
(tfile_fetch_registers, tfile_xfer_partial)
(tfile_get_trace_state_variable_value, tfile_traceframe_info):
Refactor as tfile_target methods.
(tfile_xfer_partial_features): Remove target_ops parameter.
(init_tfile_ops): Delete.
(_initialize_tracefile_tfile): Don't call it.
* tracefile.c (tracefile_has_all_memory, tracefile_has_memory)
(tracefile_has_stack, tracefile_has_registers)
(tracefile_thread_alive, tracefile_get_trace_status): Refactor as
tracefile_target methods.
(init_tracefile_ops): Delete.
(tracefile_target::tracefile_target): New.
* tracefile.h: Include "target.h".
(tracefile_target): New class.
(init_tracefile_ops): Delete.
* spu-multiarch.c (spu_multiarch_target): New class.
(spu_ops): Now a spu_multiarch_target.
(spu_thread_architecture, spu_region_ok_for_hw_watchpoint)
(spu_fetch_registers, spu_store_registers, spu_xfer_partial)
(spu_search_memory, spu_mourn_inferior): Refactor as
spu_multiarch_target methods.
(init_spu_ops): Delete.
(_initialize_spu_multiarch): Remove references to init_spu_ops,
complete_target_initialization.
* ravenscar-thread.c (ravenscar_thread_target): New class.
(ravenscar_ops): Now a ravenscar_thread_target.
(ravenscar_resume, ravenscar_wait, ravenscar_update_thread_list)
(ravenscar_thread_alive, ravenscar_pid_to_str)
(ravenscar_fetch_registers, ravenscar_store_registers)
(ravenscar_prepare_to_store, ravenscar_stopped_by_sw_breakpoint)
(ravenscar_stopped_by_hw_breakpoint)
(ravenscar_stopped_by_watchpoint, ravenscar_stopped_data_address)
(ravenscar_mourn_inferior, ravenscar_core_of_thread)
(ravenscar_get_ada_task_ptid): Refactor as ravenscar_thread_target
methods.
(init_ravenscar_thread_ops): Delete.
(_initialize_ravenscar): Remove references to
init_ravenscar_thread_ops and complete_target_initialization.
* bsd-uthread.c (bsd_uthread_ops_hack): Delete.
(bsd_uthread_target): New class.
(bsd_uthread_ops): Now a bsd_uthread_target.
(bsd_uthread_activate): Adjust to refer to bsd_uthread_ops.
(bsd_uthread_close, bsd_uthread_mourn_inferior)
(bsd_uthread_fetch_registers, bsd_uthread_store_registers)
(bsd_uthread_wait, bsd_uthread_resume, bsd_uthread_thread_alive)
(bsd_uthread_update_thread_list, bsd_uthread_extra_thread_info)
(bsd_uthread_pid_to_str): Refactor as bsd_uthread_target methods.
(bsd_uthread_target): Delete function.
(_initialize_bsd_uthread): Remove reference to
complete_target_initialization.
* bfd-target.c (target_bfd_data): Delete. Fields folded into ...
(target_bfd): ... this new class.
(target_bfd_xfer_partial, target_bfd_get_section_table)
(target_bfd_close): Refactor as target_bfd methods.
(target_bfd::~target_bfd): New.
(target_bfd_reopen): Adjust.
(target_bfd::close): New.
* record-btrace.c (record_btrace_target): New class.
(record_btrace_ops): Now a record_btrace_target.
(record_btrace_open, record_btrace_stop_recording)
(record_btrace_disconnect, record_btrace_close)
(record_btrace_async, record_btrace_info)
(record_btrace_insn_history, record_btrace_insn_history_range)
(record_btrace_insn_history_from, record_btrace_call_history)
(record_btrace_call_history_range)
(record_btrace_call_history_from, record_btrace_record_method)
(record_btrace_is_replaying, record_btrace_will_replay)
(record_btrace_xfer_partial, record_btrace_insert_breakpoint)
(record_btrace_remove_breakpoint, record_btrace_fetch_registers)
(record_btrace_store_registers, record_btrace_prepare_to_store)
(record_btrace_to_get_unwinder)
(record_btrace_to_get_tailcall_unwinder, record_btrace_resume)
(record_btrace_commit_resume, record_btrace_wait)
(record_btrace_stop, record_btrace_can_execute_reverse)
(record_btrace_stopped_by_sw_breakpoint)
(record_btrace_supports_stopped_by_sw_breakpoint)
(record_btrace_stopped_by_hw_breakpoint)
(record_btrace_supports_stopped_by_hw_breakpoint)
(record_btrace_update_thread_list, record_btrace_thread_alive)
(record_btrace_goto_begin, record_btrace_goto_end)
(record_btrace_goto, record_btrace_stop_replaying_all)
(record_btrace_execution_direction)
(record_btrace_prepare_to_generate_core)
(record_btrace_done_generating_core): Refactor as
record_btrace_target methods.
(init_record_btrace_ops): Delete.
(_initialize_record_btrace): Remove reference to
init_record_btrace_ops.
* record-full.c (RECORD_FULL_IS_REPLAY): Adjust to always refer to
the execution_direction global.
(record_full_base_target, record_full_target)
(record_full_core_target): New classes.
(record_full_ops): Now a record_full_target.
(record_full_core_ops): Now a record_full_core_target.
(record_full_target::detach, record_full_target::disconnect)
(record_full_core_target::disconnect)
(record_full_target::mourn_inferior, record_full_target::kill):
New.
(record_full_open, record_full_close, record_full_async): Refactor
as methods of the record_full_base_target class.
(record_full_resume, record_full_commit_resume): Refactor
as methods of the record_full_target class.
(record_full_wait, record_full_stopped_by_watchpoint)
(record_full_stopped_data_address)
(record_full_stopped_by_sw_breakpoint)
(record_full_supports_stopped_by_sw_breakpoint)
(record_full_stopped_by_hw_breakpoint)
(record_full_supports_stopped_by_hw_breakpoint): Refactor as
methods of the record_full_base_target class.
(record_full_store_registers, record_full_xfer_partial)
(record_full_insert_breakpoint, record_full_remove_breakpoint):
Refactor as methods of the record_full_target class.
(record_full_can_execute_reverse, record_full_get_bookmark)
(record_full_goto_bookmark, record_full_execution_direction)
(record_full_record_method, record_full_info, record_full_delete)
(record_full_is_replaying, record_full_will_replay)
(record_full_goto_begin, record_full_goto_end, record_full_goto)
(record_full_stop_replaying): Refactor as methods of the
record_full_base_target class.
(record_full_core_resume, record_full_core_kill)
(record_full_core_fetch_registers)
(record_full_core_prepare_to_store)
(record_full_core_store_registers, record_full_core_xfer_partial)
(record_full_core_insert_breakpoint)
(record_full_core_remove_breakpoint)
(record_full_core_has_execution): Refactor
as methods of the record_full_core_target class.
(record_full_base_target::supports_delete_record): New.
(init_record_full_ops): Delete.
(init_record_full_core_ops): Delete.
(record_full_save): Refactor as method of the
record_full_base_target class.
(_initialize_record_full): Remove references to
init_record_full_ops and init_record_full_core_ops.
* remote.c (remote_target, extended_remote_target): New classes.
(remote_ops): Now a remote_target.
(extended_remote_ops): Now an extended_remote_target.
(remote_insert_fork_catchpoint, remote_remove_fork_catchpoint)
(remote_insert_vfork_catchpoint, remote_remove_vfork_catchpoint)
(remote_insert_exec_catchpoint, remote_remove_exec_catchpoint)
(remote_pass_signals, remote_set_syscall_catchpoint)
(remote_program_signals, )
(remote_thread_always_alive): Remove target_ops parameter.
(remote_thread_alive, remote_thread_name)
(remote_update_thread_list, remote_threads_extra_info)
(remote_static_tracepoint_marker_at)
(remote_static_tracepoint_markers_by_strid)
(remote_get_ada_task_ptid, remote_close, remote_start_remote)
(remote_open): Refactor as methods of remote_target.
(extended_remote_open, extended_remote_detach)
(extended_remote_attach, extended_remote_post_attach):
(extended_remote_supports_disable_randomization)
(extended_remote_create_inferior): : Refactor as method of
extended_remote_target.
(remote_set_permissions, remote_open_1, remote_detach)
(remote_follow_fork, remote_follow_exec, remote_disconnect)
(remote_resume, remote_commit_resume, remote_stop)
(remote_interrupt, remote_pass_ctrlc, remote_terminal_inferior)
(remote_terminal_ours, remote_wait, remote_fetch_registers)
(remote_prepare_to_store, remote_store_registers)
(remote_flash_erase, remote_flash_done, remote_files_info)
(remote_kill, remote_mourn, remote_insert_breakpoint)
(remote_remove_breakpoint, remote_insert_watchpoint)
(remote_watchpoint_addr_within_range)
(remote_remove_watchpoint, remote_region_ok_for_hw_watchpoint)
(remote_check_watch_resources, remote_stopped_by_sw_breakpoint)
(remote_supports_stopped_by_sw_breakpoint)
(remote_stopped_by_hw_breakpoint)
(remote_supports_stopped_by_hw_breakpoint)
(remote_stopped_by_watchpoint, remote_stopped_data_address)
(remote_insert_hw_breakpoint, remote_remove_hw_breakpoint)
(remote_verify_memory): Refactor as methods of remote_target.
(remote_write_qxfer, remote_read_qxfer): Remove target_ops
parameter.
(remote_xfer_partial, remote_get_memory_xfer_limit)
(remote_search_memory, remote_rcmd, remote_memory_map)
(remote_pid_to_str, remote_get_thread_local_address)
(remote_get_tib_address, remote_read_description): Refactor as
methods of remote_target.
(remote_target::fileio_open, remote_target::fileio_pwrite)
(remote_target::fileio_pread, remote_target::fileio_close): New.
(remote_hostio_readlink, remote_hostio_fstat)
(remote_filesystem_is_local, remote_can_execute_reverse)
(remote_supports_non_stop, remote_supports_disable_randomization)
(remote_supports_multi_process, remote_supports_cond_breakpoints)
(remote_supports_enable_disable_tracepoint)
(remote_supports_string_tracing)
(remote_can_run_breakpoint_commands, remote_trace_init)
(remote_download_tracepoint, remote_can_download_tracepoint)
(remote_download_trace_state_variable, remote_enable_tracepoint)
(remote_disable_tracepoint, remote_trace_set_readonly_regions)
(remote_trace_start, remote_get_trace_status)
(remote_get_tracepoint_status, remote_trace_stop)
(remote_trace_find, remote_get_trace_state_variable_value)
(remote_save_trace_data, remote_get_raw_trace_data)
(remote_set_disconnected_tracing, remote_core_of_thread)
(remote_set_circular_trace_buffer, remote_traceframe_info)
(remote_get_min_fast_tracepoint_insn_len)
(remote_set_trace_buffer_size, remote_set_trace_notes)
(remote_use_agent, remote_can_use_agent, remote_enable_btrace)
(remote_disable_btrace, remote_teardown_btrace)
(remote_read_btrace, remote_btrace_conf)
(remote_augmented_libraries_svr4_read, remote_load)
(remote_pid_to_exec_file, remote_can_do_single_step)
(remote_execution_direction, remote_thread_handle_to_thread_info):
Refactor as methods of remote_target.
(init_remote_ops, init_extended_remote_ops): Delete.
(remote_can_async_p, remote_is_async_p, remote_async)
(remote_thread_events, remote_upload_tracepoints)
(remote_upload_trace_state_variables): Refactor as methods of
remote_target.
(_initialize_remote): Remove references to init_remote_ops and
init_extended_remote_ops.
* remote-sim.c (gdbsim_target): New class.
(gdbsim_fetch_register, gdbsim_store_register, gdbsim_kill)
(gdbsim_load, gdbsim_create_inferior, gdbsim_open, gdbsim_close)
(gdbsim_detach, gdbsim_resume, gdbsim_interrupt)
(gdbsim_wait, gdbsim_prepare_to_store, gdbsim_xfer_partial)
(gdbsim_files_info, gdbsim_mourn_inferior, gdbsim_thread_alive)
(gdbsim_pid_to_str, gdbsim_has_all_memory, gdbsim_has_memory):
Refactor as methods of gdbsim_target.
(gdbsim_ops): Now a gdbsim_target.
(init_gdbsim_ops): Delete.
(gdbsim_cntrl_c): Adjust.
(_initialize_remote_sim): Remove reference to init_gdbsim_ops.
* amd64-linux-nat.c (amd64_linux_nat_target): New class.
(the_amd64_linux_nat_target): New.
(amd64_linux_fetch_inferior_registers)
(amd64_linux_store_inferior_registers): Refactor as methods of
amd64_linux_nat_target.
(_initialize_amd64_linux_nat): Adjust. Set linux_target.
* i386-linux-nat.c: Don't include "linux-nat.h".
(i386_linux_nat_target): New class.
(the_i386_linux_nat_target): New.
(i386_linux_fetch_inferior_registers)
(i386_linux_store_inferior_registers, i386_linux_resume): Refactor
as methods of i386_linux_nat_target.
(_initialize_i386_linux_nat): Adjust. Set linux_target.
* inf-child.c (inf_child_ops): Delete.
(inf_child_fetch_inferior_registers)
(inf_child_store_inferior_registers): Delete.
(inf_child_post_attach, inf_child_prepare_to_store): Refactor as
methods of inf_child_target.
(inf_child_target::supports_terminal_ours)
(inf_child_target::terminal_init)
(inf_child_target::terminal_inferior)
(inf_child_target::terminal_ours_for_output)
(inf_child_target::terminal_ours, inf_child_target::interrupt)
(inf_child_target::pass_ctrlc, inf_child_target::terminal_info):
New.
(inf_child_open, inf_child_disconnect, inf_child_close)
(inf_child_mourn_inferior, inf_child_maybe_unpush_target)
(inf_child_post_startup_inferior, inf_child_can_run)
(inf_child_pid_to_exec_file): Refactor as methods of
inf_child_target.
(inf_child_follow_fork): Delete.
(inf_child_target::can_create_inferior)
(inf_child_target::can_attach): New.
(inf_child_target::has_all_memory, inf_child_target::has_memory)
(inf_child_target::has_stack, inf_child_target::has_registers)
(inf_child_target::has_execution): New.
(inf_child_fileio_open, inf_child_fileio_pwrite)
(inf_child_fileio_pread, inf_child_fileio_fstat)
(inf_child_fileio_close, inf_child_fileio_unlink)
(inf_child_fileio_readlink, inf_child_use_agent)
(inf_child_can_use_agent): Refactor as methods of
inf_child_target.
(return_zero, inf_child_target): Delete.
(inf_child_target::inf_child_target): New.
* inf-child.h: Include "target.h".
(inf_child_target): Delete function prototype.
(inf_child_target): New class.
(inf_child_open_target, inf_child_mourn_inferior)
(inf_child_maybe_unpush_target): Delete.
* inf-ptrace.c (inf_ptrace_target::~inf_ptrace_target): New.
(inf_ptrace_follow_fork, inf_ptrace_insert_fork_catchpoint)
(inf_ptrace_remove_fork_catchpoint, inf_ptrace_create_inferior)
(inf_ptrace_post_startup_inferior, inf_ptrace_mourn_inferior)
(inf_ptrace_attach, inf_ptrace_post_attach, inf_ptrace_detach)
(inf_ptrace_detach_success, inf_ptrace_kill, inf_ptrace_resume)
(inf_ptrace_wait, inf_ptrace_xfer_partial)
(inf_ptrace_thread_alive, inf_ptrace_files_info)
(inf_ptrace_pid_to_str, inf_ptrace_auxv_parse): Refactor as
methods of inf_ptrace_target.
(inf_ptrace_target): Delete function.
* inf-ptrace.h: Include "inf-child.h".
(inf_ptrace_target): Delete function declaration.
(inf_ptrace_target): New class.
(inf_ptrace_trad_target, inf_ptrace_detach_success): Delete.
* linux-nat.c (linux_target): New.
(linux_ops, linux_ops_saved, super_xfer_partial): Delete.
(linux_nat_target::~linux_nat_target): New.
(linux_child_post_attach, linux_child_post_startup_inferior)
(linux_child_follow_fork, linux_child_insert_fork_catchpoint)
(linux_child_remove_fork_catchpoint)
(linux_child_insert_vfork_catchpoint)
(linux_child_remove_vfork_catchpoint)
(linux_child_insert_exec_catchpoint)
(linux_child_remove_exec_catchpoint)
(linux_child_set_syscall_catchpoint, linux_nat_pass_signals)
(linux_nat_create_inferior, linux_nat_attach, linux_nat_detach)
(linux_nat_resume, linux_nat_stopped_by_watchpoint)
(linux_nat_stopped_data_address)
(linux_nat_stopped_by_sw_breakpoint)
(linux_nat_supports_stopped_by_sw_breakpoint)
(linux_nat_stopped_by_hw_breakpoint)
(linux_nat_supports_stopped_by_hw_breakpoint, linux_nat_wait)
(linux_nat_kill, linux_nat_mourn_inferior)
(linux_nat_xfer_partial, linux_nat_thread_alive)
(linux_nat_update_thread_list, linux_nat_pid_to_str)
(linux_nat_thread_name, linux_child_pid_to_exec_file)
(linux_child_static_tracepoint_markers_by_strid)
(linux_nat_is_async_p, linux_nat_can_async_p)
(linux_nat_supports_non_stop, linux_nat_always_non_stop_p)
(linux_nat_supports_multi_process)
(linux_nat_supports_disable_randomization, linux_nat_async)
(linux_nat_stop, linux_nat_close, linux_nat_thread_address_space)
(linux_nat_core_of_thread, linux_nat_filesystem_is_local)
(linux_nat_fileio_open, linux_nat_fileio_readlink)
(linux_nat_fileio_unlink, linux_nat_thread_events): Refactor as
methods of linux_nat_target.
(linux_nat_wait_1, linux_xfer_siginfo, linux_proc_xfer_partial)
(linux_proc_xfer_spu, linux_nat_xfer_osdata): Remove target_ops
parameter.
(check_stopped_by_watchpoint): Adjust.
(linux_xfer_partial): Delete.
(linux_target_install_ops, linux_target, linux_nat_add_target):
Delete.
(linux_nat_target::linux_nat_target): New.
* linux-nat.h: Include "inf-ptrace.h".
(linux_nat_target): New.
(linux_target, linux_target_install_ops, linux_nat_add_target):
Delete function declarations.
(linux_target): Declare global.
* linux-thread-db.c (thread_db_target): New.
(thread_db_target::thread_db_target): New.
(thread_db_ops): Delete.
(the_thread_db_target): New.
(thread_db_detach, thread_db_wait, thread_db_mourn_inferior)
(thread_db_update_thread_list, thread_db_pid_to_str)
(thread_db_extra_thread_info)
(thread_db_thread_handle_to_thread_info)
(thread_db_get_thread_local_address, thread_db_get_ada_task_ptid)
(thread_db_resume): Refactor as methods of thread_db_target.
(init_thread_db_ops): Delete.
(_initialize_thread_db): Remove reference to init_thread_db_ops.
* x86-linux-nat.c: Don't include "linux-nat.h".
(super_post_startup_inferior): Delete.
(x86_linux_nat_target::~x86_linux_nat_target): New.
(x86_linux_child_post_startup_inferior)
(x86_linux_read_description, x86_linux_enable_btrace)
(x86_linux_disable_btrace, x86_linux_teardown_btrace)
(x86_linux_read_btrace, x86_linux_btrace_conf): Refactor as
methods of x86_linux_nat_target.
(x86_linux_create_target): Delete. Bits folded ...
(x86_linux_add_target): ... here. Now takes a linux_nat_target
pointer.
* x86-linux-nat.h: Include "linux-nat.h" and "x86-nat.h".
(x86_linux_nat_target): New class.
(x86_linux_create_target): Delete.
(x86_linux_add_target): Now takes a linux_nat_target pointer.
* x86-nat.c (x86_insert_watchpoint, x86_remove_watchpoint)
(x86_region_ok_for_watchpoint, x86_stopped_data_address)
(x86_stopped_by_watchpoint, x86_insert_hw_breakpoint)
(x86_remove_hw_breakpoint, x86_can_use_hw_breakpoint)
(x86_stopped_by_hw_breakpoint): Remove target_ops parameter and
make extern.
(x86_use_watchpoints): Delete.
* x86-nat.h: Include "breakpoint.h" and "target.h".
(x86_use_watchpoints): Delete.
(x86_can_use_hw_breakpoint, x86_region_ok_for_hw_watchpoint)
(x86_stopped_by_watchpoint, x86_stopped_data_address)
(x86_insert_watchpoint, x86_remove_watchpoint)
(x86_insert_hw_breakpoint, x86_remove_hw_breakpoint)
(x86_stopped_by_hw_breakpoint): New declarations.
(x86_nat_target): New template class.
* ppc-linux-nat.c (ppc_linux_nat_target): New class.
(the_ppc_linux_nat_target): New.
(ppc_linux_fetch_inferior_registers)
(ppc_linux_can_use_hw_breakpoint)
(ppc_linux_region_ok_for_hw_watchpoint)
(ppc_linux_ranged_break_num_registers)
(ppc_linux_insert_hw_breakpoint, ppc_linux_remove_hw_breakpoint)
(ppc_linux_insert_mask_watchpoint)
(ppc_linux_remove_mask_watchpoint)
(ppc_linux_can_accel_watchpoint_condition)
(ppc_linux_insert_watchpoint, ppc_linux_remove_watchpoint)
(ppc_linux_stopped_data_address, ppc_linux_stopped_by_watchpoint)
(ppc_linux_watchpoint_addr_within_range)
(ppc_linux_masked_watch_num_registers)
(ppc_linux_store_inferior_registers, ppc_linux_auxv_parse)
(ppc_linux_read_description): Refactor as methods of
ppc_linux_nat_target.
(_initialize_ppc_linux_nat): Adjust. Set linux_target.
* procfs.c (procfs_xfer_partial): Delete forward declaration.
(procfs_target): New class.
(the_procfs_target): New.
(procfs_target): Delete function.
(procfs_auxv_parse, procfs_attach, procfs_detach)
(procfs_fetch_registers, procfs_store_registers, procfs_wait)
(procfs_xfer_partial, procfs_resume, procfs_pass_signals)
(procfs_files_info, procfs_kill_inferior, procfs_mourn_inferior)
(procfs_create_inferior, procfs_update_thread_list)
(procfs_thread_alive, procfs_pid_to_str)
(procfs_can_use_hw_breakpoint, procfs_stopped_by_watchpoint)
(procfs_stopped_data_address, procfs_insert_watchpoint)
(procfs_remove_watchpoint, procfs_region_ok_for_hw_watchpoint)
(proc_find_memory_regions, procfs_info_proc)
(procfs_make_note_section): Refactor as methods of procfs_target.
(_initialize_procfs): Adjust.
* sol-thread.c (sol_thread_target): New class.
(sol_thread_ops): Now a sol_thread_target.
(sol_thread_detach, sol_thread_resume, sol_thread_wait)
(sol_thread_fetch_registers, sol_thread_store_registers)
(sol_thread_xfer_partial, sol_thread_mourn_inferior)
(sol_thread_alive, solaris_pid_to_str, sol_update_thread_list)
(sol_get_ada_task_ptid): Refactor as methods of sol_thread_target.
(init_sol_thread_ops): Delete.
(_initialize_sol_thread): Adjust. Remove references to
init_sol_thread_ops and complete_target_initialization.
* windows-nat.c (windows_nat_target): New class.
(windows_fetch_inferior_registers)
(windows_store_inferior_registers, windows_resume, windows_wait)
(windows_attach, windows_detach, windows_pid_to_exec_file)
(windows_files_info, windows_create_inferior)
(windows_mourn_inferior, windows_interrupt, windows_kill_inferior)
(windows_close, windows_pid_to_str, windows_xfer_partial)
(windows_get_tib_address, windows_get_ada_task_ptid)
(windows_thread_name, windows_thread_alive): Refactor as
windows_nat_target methods.
(do_initial_windows_stuff): Adjust.
(windows_target): Delete function.
(_initialize_windows_nat): Adjust.
* darwin-nat.c (darwin_resume, darwin_wait_to, darwin_interrupt)
(darwin_mourn_inferior, darwin_kill_inferior)
(darwin_create_inferior, darwin_attach, darwin_detach)
(darwin_pid_to_str, darwin_thread_alive, darwin_xfer_partial)
(darwin_pid_to_exec_file, darwin_get_ada_task_ptid)
(darwin_supports_multi_process): Refactor as darwin_nat_target
methods.
(darwin_resume_to, darwin_files_info): Delete.
(_initialize_darwin_inferior): Rename to ...
(_initialize_darwin_nat): ... this. Adjust to C++ification.
* darwin-nat.h: Include "inf-child.h".
(darwin_nat_target): New class.
(darwin_complete_target): Delete.
* i386-darwin-nat.c (i386_darwin_nat_target): New class.
(darwin_target): New.
(i386_darwin_fetch_inferior_registers)
(i386_darwin_store_inferior_registers): Refactor as methods of
darwin_nat_target.
(darwin_complete_target): Delete, with ...
(_initialize_i386_darwin_nat): ... bits factored out here.
* alpha-linux-nat.c (alpha_linux_nat_target): New class.
(the_alpha_linux_nat_target): New.
(alpha_linux_register_u_offset): Refactor as
alpha_linux_nat_target method.
(_initialize_alpha_linux_nat): Adjust.
* linux-nat-trad.c (inf_ptrace_register_u_offset): Delete.
(inf_ptrace_fetch_register, inf_ptrace_fetch_registers)
(inf_ptrace_store_register, inf_ptrace_store_registers): Refact as
methods of linux_nat_trad_target.
(linux_trad_target): Delete.
* linux-nat-trad.h (linux_trad_target): Delete function.
(linux_nat_trad_target): New class.
* mips-linux-nat.c (mips_linux_nat_target): New class.
(super_fetch_registers, super_store_registers, super_close):
Delete.
(the_mips_linux_nat_target): New.
(mips64_linux_regsets_fetch_registers)
(mips64_linux_regsets_store_registers)
(mips64_linux_fetch_registers, mips64_linux_store_registers)
(mips_linux_register_u_offset, mips_linux_read_description)
(mips_linux_can_use_hw_breakpoint)
(mips_linux_stopped_by_watchpoint)
(mips_linux_stopped_data_address)
(mips_linux_region_ok_for_hw_watchpoint)
(mips_linux_insert_watchpoint, mips_linux_remove_watchpoint)
(mips_linux_close): Refactor as methods of mips_linux_nat.
(_initialize_mips_linux_nat): Adjust to C++ification.
* aix-thread.c (aix_thread_target): New class.
(aix_thread_ops): Now an aix_thread_target.
(aix_thread_detach, aix_thread_resume, aix_thread_wait)
(aix_thread_fetch_registers, aix_thread_store_registers)
(aix_thread_xfer_partial, aix_thread_mourn_inferior)
(aix_thread_thread_alive, aix_thread_pid_to_str)
(aix_thread_extra_thread_info, aix_thread_get_ada_task_ptid):
Refactor as methods of aix_thread_target.
(init_aix_thread_ops): Delete.
(_initialize_aix_thread): Remove references to init_aix_thread_ops
and complete_target_initialization.
* rs6000-nat.c (rs6000_xfer_shared_libraries): Delete.
(rs6000_nat_target): New class.
(the_rs6000_nat_target): New.
(rs6000_fetch_inferior_registers, rs6000_store_inferior_registers)
(rs6000_xfer_partial, rs6000_wait, rs6000_create_inferior)
(rs6000_xfer_shared_libraries): Refactor as rs6000_nat_target methods.
(super_create_inferior): Delete.
(_initialize_rs6000_nat): Adjust to C++ification.
* arm-linux-nat.c (arm_linux_nat_target): New class.
(the_arm_linux_nat_target): New.
(arm_linux_fetch_inferior_registers)
(arm_linux_store_inferior_registers, arm_linux_read_description)
(arm_linux_can_use_hw_breakpoint, arm_linux_insert_hw_breakpoint)
(arm_linux_remove_hw_breakpoint)
(arm_linux_region_ok_for_hw_watchpoint)
(arm_linux_insert_watchpoint, arm_linux_remove_watchpoint)
(arm_linux_stopped_data_address, arm_linux_stopped_by_watchpoint)
(arm_linux_watchpoint_addr_within_range): Refactor as methods of
arm_linux_nat_target.
(_initialize_arm_linux_nat): Adjust to C++ification.
* aarch64-linux-nat.c (aarch64_linux_nat_target): New class.
(the_aarch64_linux_nat_target): New.
(aarch64_linux_fetch_inferior_registers)
(aarch64_linux_store_inferior_registers)
(aarch64_linux_child_post_startup_inferior)
(aarch64_linux_read_description)
(aarch64_linux_can_use_hw_breakpoint)
(aarch64_linux_insert_hw_breakpoint)
(aarch64_linux_remove_hw_breakpoint)
(aarch64_linux_insert_watchpoint, aarch64_linux_remove_watchpoint)
(aarch64_linux_region_ok_for_hw_watchpoint)
(aarch64_linux_stopped_data_address)
(aarch64_linux_stopped_by_watchpoint)
(aarch64_linux_watchpoint_addr_within_range)
(aarch64_linux_can_do_single_step): Refactor as methods of
aarch64_linux_nat_target.
(super_post_startup_inferior): Delete.
(_initialize_aarch64_linux_nat): Adjust to C++ification.
* hppa-linux-nat.c (hppa_linux_nat_target): New class.
(the_hppa_linux_nat_target): New.
(hppa_linux_fetch_inferior_registers)
(hppa_linux_store_inferior_registers): Refactor as methods of
hppa_linux_nat_target.
(_initialize_hppa_linux_nat): Adjust to C++ification.
* ia64-linux-nat.c (ia64_linux_nat_target): New class.
(the_ia64_linux_nat_target): New.
(ia64_linux_insert_watchpoint, ia64_linux_remove_watchpoint)
(ia64_linux_stopped_data_address)
(ia64_linux_stopped_by_watchpoint, ia64_linux_fetch_registers)
(ia64_linux_store_registers, ia64_linux_xfer_partial): Refactor as
ia64_linux_nat_target methods.
(super_xfer_partial): Delete.
(_initialize_ia64_linux_nat): Adjust to C++ification.
* m32r-linux-nat.c (m32r_linux_nat_target): New class.
(the_m32r_linux_nat_target): New.
(m32r_linux_fetch_inferior_registers)
(m32r_linux_store_inferior_registers): Refactor as
m32r_linux_nat_target methods.
(_initialize_m32r_linux_nat): Adjust to C++ification.
* m68k-linux-nat.c (m68k_linux_nat_target): New class.
(the_m68k_linux_nat_target): New.
(m68k_linux_fetch_inferior_registers)
(m68k_linux_store_inferior_registers): Refactor as
m68k_linux_nat_target methods.
(_initialize_m68k_linux_nat): Adjust to C++ification.
* s390-linux-nat.c (s390_linux_nat_target): New class.
(the_s390_linux_nat_target): New.
(s390_linux_fetch_inferior_registers)
(s390_linux_store_inferior_registers, s390_stopped_by_watchpoint)
(s390_insert_watchpoint, s390_remove_watchpoint)
(s390_can_use_hw_breakpoint, s390_insert_hw_breakpoint)
(s390_remove_hw_breakpoint, s390_region_ok_for_hw_watchpoint)
(s390_auxv_parse, s390_read_description): Refactor as methods of
s390_linux_nat_target.
(_initialize_s390_nat): Adjust to C++ification.
* sparc-linux-nat.c (sparc_linux_nat_target): New class.
(the_sparc_linux_nat_target): New.
(_initialize_sparc_linux_nat): Adjust to C++ification.
* sparc-nat.c (sparc_fetch_inferior_registers)
(sparc_store_inferior_registers): Remove target_ops parameter.
* sparc-nat.h (sparc_fetch_inferior_registers)
(sparc_store_inferior_registers): Remove target_ops parameter.
* sparc64-linux-nat.c (sparc64_linux_nat_target): New class.
(the_sparc64_linux_nat_target): New.
(_initialize_sparc64_linux_nat): Adjust to C++ification.
* spu-linux-nat.c (spu_linux_nat_target): New class.
(the_spu_linux_nat_target): New.
(spu_child_post_startup_inferior, spu_child_post_attach)
(spu_child_wait, spu_fetch_inferior_registers)
(spu_store_inferior_registers, spu_xfer_partial)
(spu_can_use_hw_breakpoint): Refactor as spu_linux_nat_target
methods.
(_initialize_spu_nat): Adjust to C++ification.
* tilegx-linux-nat.c (tilegx_linux_nat_target): New class.
(the_tilegx_linux_nat_target): New.
(fetch_inferior_registers, store_inferior_registers):
Refactor as methods.
(_initialize_tile_linux_nat): Adjust to C++ification.
* xtensa-linux-nat.c (xtensa_linux_nat_target): New class.
(the_xtensa_linux_nat_target): New.
(xtensa_linux_fetch_inferior_registers)
(xtensa_linux_store_inferior_registers): Refactor as
xtensa_linux_nat_target methods.
(_initialize_xtensa_linux_nat): Adjust to C++ification.
* fbsd-nat.c (USE_SIGTRAP_SIGINFO): Delete.
(fbsd_pid_to_exec_file, fbsd_find_memory_regions)
(fbsd_find_memory_regions, fbsd_info_proc, fbsd_xfer_partial)
(fbsd_thread_alive, fbsd_pid_to_str, fbsd_thread_name)
(fbsd_update_thread_list, fbsd_resume, fbsd_wait)
(fbsd_stopped_by_sw_breakpoint)
(fbsd_supports_stopped_by_sw_breakpoint, fbsd_follow_fork)
(fbsd_insert_fork_catchpoint, fbsd_remove_fork_catchpoint)
(fbsd_insert_vfork_catchpoint, fbsd_remove_vfork_catchpoint)
(fbsd_post_startup_inferior, fbsd_post_attach)
(fbsd_insert_exec_catchpoint, fbsd_remove_exec_catchpoint)
(fbsd_set_syscall_catchpoint)
(super_xfer_partial, super_resume, super_wait)
(fbsd_supports_stopped_by_hw_breakpoint): Delete.
(fbsd_handle_debug_trap): Remove target_ops parameter.
(fbsd_nat_add_target): Delete.
* fbsd-nat.h: Include "inf-ptrace.h".
(fbsd_nat_add_target): Delete.
(USE_SIGTRAP_SIGINFO): Define.
(fbsd_nat_target): New class.
* amd64-bsd-nat.c (amd64bsd_fetch_inferior_registers)
(amd64bsd_store_inferior_registers): Remove target_ops parameter.
(amd64bsd_target): Delete.
* amd64-bsd-nat.h: New file.
* amd64-fbsd-nat.c: Include "amd64-bsd-nat.h" instead of
"x86-bsd-nat.h".
(amd64_fbsd_nat_target): New class.
(the_amd64_fbsd_nat_target): New.
(amd64fbsd_read_description): Refactor as method of
amd64_fbsd_nat_target.
(amd64_fbsd_nat_target::supports_stopped_by_hw_breakpoint): New.
(_initialize_amd64fbsd_nat): Adjust to C++ification.
* amd64-nat.h (amd64bsd_target): Delete function declaration.
* i386-bsd-nat.c (i386bsd_fetch_inferior_registers)
(i386bsd_store_inferior_registers): Remove target_ops parameter.
(i386bsd_target): Delete.
* i386-bsd-nat.h (i386bsd_target): Delete function declaration.
(i386bsd_fetch_inferior_registers)
(i386bsd_store_inferior_registers): Declare.
(i386_bsd_nat_target): New class.
* i386-fbsd-nat.c (i386_fbsd_nat_target): New class.
(the_i386_fbsd_nat_target): New.
(i386fbsd_resume, i386fbsd_read_description): Refactor as
i386_fbsd_nat_target methods.
(i386_fbsd_nat_target::supports_stopped_by_hw_breakpoint): New.
(_initialize_i386fbsd_nat): Adjust to C++ification.
* x86-bsd-nat.c (super_mourn_inferior): Delete.
(x86bsd_mourn_inferior, x86bsd_target): Delete.
(_initialize_x86_bsd_nat): Adjust to C++ification.
* x86-bsd-nat.h: Include "x86-nat.h".
(x86bsd_target): Delete declaration.
(x86bsd_nat_target): New class.
* aarch64-fbsd-nat.c (aarch64_fbsd_nat_target): New class.
(the_aarch64_fbsd_nat_target): New.
(aarch64_fbsd_fetch_inferior_registers)
(aarch64_fbsd_store_inferior_registers): Refactor as methods of
aarch64_fbsd_nat_target.
(_initialize_aarch64_fbsd_nat): Adjust to C++ification.
* alpha-bsd-nat.c (alpha_bsd_nat_target): New class.
(the_alpha_bsd_nat_target): New.
(alphabsd_fetch_inferior_registers)
(alphabsd_store_inferior_registers): Refactor as
alpha_bsd_nat_target methods.
(_initialize_alphabsd_nat): Refactor as methods of
alpha_bsd_nat_target.
* amd64-nbsd-nat.c: Include "amd64-bsd-nat.h".
(the_amd64_nbsd_nat_target): New.
(_initialize_amd64nbsd_nat): Adjust to C++ification.
* amd64-obsd-nat.c: Include "amd64-bsd-nat.h".
(the_amd64_obsd_nat_target): New.
(_initialize_amd64obsd_nat): Adjust to C++ification.
* arm-fbsd-nat.c (arm_fbsd_nat_target): New.
(the_arm_fbsd_nat_target): New.
(arm_fbsd_fetch_inferior_registers)
(arm_fbsd_store_inferior_registers, arm_fbsd_read_description):
(_initialize_arm_fbsd_nat): Refactor as methods of
arm_fbsd_nat_target.
(_initialize_arm_fbsd_nat): Adjust to C++ification.
* arm-nbsd-nat.c (arm_netbsd_nat_target): New class.
(the_arm_netbsd_nat_target): New.
(armnbsd_fetch_registers, armnbsd_store_registers): Refactor as
arm_netbsd_nat_target.
(_initialize_arm_netbsd_nat): Adjust to C++ification.
* hppa-nbsd-nat.c (hppa_nbsd_nat_target): New class.
(the_hppa_nbsd_nat_target): New.
(hppanbsd_fetch_registers, hppanbsd_store_registers): Refactor as
hppa_nbsd_nat_target methods.
(_initialize_hppanbsd_nat): Adjust to C++ification.
* hppa-obsd-nat.c (hppa_obsd_nat_target): New class.
(the_hppa_obsd_nat_target): New.
(hppaobsd_fetch_registers, hppaobsd_store_registers): Refactor as
methods of hppa_obsd_nat_target.
(_initialize_hppaobsd_nat): Adjust to C++ification. Use
add_target.
* i386-nbsd-nat.c (the_i386_nbsd_nat_target): New.
(_initialize_i386nbsd_nat): Adjust to C++ification. Use
add_target.
* i386-obsd-nat.c (the_i386_obsd_nat_target): New.
(_initialize_i386obsd_nat): Use add_target.
* m68k-bsd-nat.c (m68k_bsd_nat_target): New class.
(the_m68k_bsd_nat_target): New.
(m68kbsd_fetch_inferior_registers)
(m68kbsd_store_inferior_registers): Refactor as methods of
m68k_bsd_nat_target.
(_initialize_m68kbsd_nat): Adjust to C++ification.
* mips-fbsd-nat.c (mips_fbsd_nat_target): New class.
(the_mips_fbsd_nat_target): New.
(mips_fbsd_fetch_inferior_registers)
(mips_fbsd_store_inferior_registers): Refactor as methods of
mips_fbsd_nat_target.
(_initialize_mips_fbsd_nat): Adjust to C++ification. Use
add_target.
* mips-nbsd-nat.c (mips_nbsd_nat_target): New class.
(the_mips_nbsd_nat_target): New.
(mipsnbsd_fetch_inferior_registers)
(mipsnbsd_store_inferior_registers): Refactor as methods of
mips_nbsd_nat_target.
(_initialize_mipsnbsd_nat): Adjust to C++ification.
* mips64-obsd-nat.c (mips64_obsd_nat_target): New class.
(the_mips64_obsd_nat_target): New.
(mips64obsd_fetch_inferior_registers)
(mips64obsd_store_inferior_registers): Refactor as methods of
mips64_obsd_nat_target.
(_initialize_mips64obsd_nat): Adjust to C++ification. Use
add_target.
* nbsd-nat.c (nbsd_pid_to_exec_file): Refactor as method of
nbsd_nat_target.
* nbsd-nat.h: Include "inf-ptrace.h".
(nbsd_nat_target): New class.
* obsd-nat.c (obsd_pid_to_str, obsd_update_thread_list)
(obsd_wait): Refactor as methods of obsd_nat_target.
(obsd_add_target): Delete.
* obsd-nat.h: Include "inf-ptrace.h".
(obsd_nat_target): New class.
* ppc-fbsd-nat.c (ppc_fbsd_nat_target): New class.
(the_ppc_fbsd_nat_target): New.
(ppcfbsd_fetch_inferior_registers)
(ppcfbsd_store_inferior_registers): Refactor as methods of
ppc_fbsd_nat_target.
(_initialize_ppcfbsd_nat): Adjust to C++ification. Use
add_target.
* ppc-nbsd-nat.c (ppc_nbsd_nat_target): New class.
(the_ppc_nbsd_nat_target): New.
(ppcnbsd_fetch_inferior_registers)
(ppcnbsd_store_inferior_registers): Refactor as methods of
ppc_nbsd_nat_target.
(_initialize_ppcnbsd_nat): Adjust to C++ification.
* ppc-obsd-nat.c (ppc_obsd_nat_target): New class.
(the_ppc_obsd_nat_target): New.
(ppcobsd_fetch_registers, ppcobsd_store_registers): Refactor as
methods of ppc_obsd_nat_target.
(_initialize_ppcobsd_nat): Adjust to C++ification. Use
add_target.
* sh-nbsd-nat.c (sh_nbsd_nat_target): New class.
(the_sh_nbsd_nat_target): New.
(shnbsd_fetch_inferior_registers)
(shnbsd_store_inferior_registers): Refactor as methods of
sh_nbsd_nat_target.
(_initialize_shnbsd_nat): Adjust to C++ification.
* sparc-nat.c (sparc_xfer_wcookie): Make extern.
(inf_ptrace_xfer_partial): Delete.
(sparc_xfer_partial, sparc_target): Delete.
* sparc-nat.h (sparc_fetch_inferior_registers)
(sparc_store_inferior_registers, sparc_xfer_wcookie): Declare.
(sparc_target): Delete function declaration.
(sparc_target): New template class.
* sparc-nbsd-nat.c (the_sparc_nbsd_nat_target): New.
(_initialize_sparcnbsd_nat): Adjust to C++ification.
* sparc64-fbsd-nat.c (the_sparc64_fbsd_nat_target): New.
(_initialize_sparc64fbsd_nat): Adjust to C++ification. Use
add_target.
* sparc64-nbsd-nat.c (the_sparc64_nbsd_nat_target): New.
(_initialize_sparc64nbsd_nat): Adjust to C++ification.
* sparc64-obsd-nat.c (the_sparc64_obsd_nat_target): New.
(_initialize_sparc64obsd_nat): Adjust to C++ification. Use
add_target.
* vax-bsd-nat.c (vax_bsd_nat_target): New class.
(the_vax_bsd_nat_target): New.
(vaxbsd_fetch_inferior_registers)
(vaxbsd_store_inferior_registers): Refactor as vax_bsd_nat_target
methods.
(_initialize_vaxbsd_nat): Adjust to C++ification.
* bsd-kvm.c (bsd_kvm_target): New class.
(bsd_kvm_ops): Now a bsd_kvm_target.
(bsd_kvm_open, bsd_kvm_close, bsd_kvm_xfer_partial)
(bsd_kvm_files_info, bsd_kvm_fetch_registers)
(bsd_kvm_thread_alive, bsd_kvm_pid_to_str): Refactor as methods of
bsd_kvm_target.
(bsd_kvm_return_one): Delete.
(bsd_kvm_add_target): Adjust to C++ification.
* nto-procfs.c (nto_procfs_target, nto_procfs_target_native)
(nto_procfs_target_procfs): New classes.
(procfs_open_1, procfs_thread_alive, procfs_update_thread_list)
(procfs_files_info, procfs_pid_to_exec_file, procfs_attach)
(procfs_post_attach, procfs_wait, procfs_fetch_registers)
(procfs_xfer_partial, procfs_detach, procfs_insert_breakpoint)
(procfs_remove_breakpoint, procfs_insert_hw_breakpoint)
(procfs_remove_hw_breakpoint, procfs_resume)
(procfs_mourn_inferior, procfs_create_inferior, procfs_interrupt)
(procfs_kill_inferior, procfs_store_registers)
(procfs_pass_signals, procfs_pid_to_str, procfs_can_run): Refactor
as methods of nto_procfs_target.
(nto_procfs_ops): Now an nto_procfs_target_procfs.
(nto_native_ops): Delete.
(procfs_open, procfs_native_open): Delete.
(nto_native_ops): Now an nto_procfs_target_native.
(init_procfs_targets): Adjust to C++ification.
(procfs_can_use_hw_breakpoint, procfs_remove_hw_watchpoint)
(procfs_insert_hw_watchpoint, procfs_stopped_by_watchpoint):
Refactor as methods of nto_procfs_target.
* go32-nat.c (go32_nat_target): New class.
(the_go32_nat_target): New.
(go32_attach, go32_resume, go32_wait, go32_fetch_registers)
(go32_store_registers, go32_xfer_partial, go32_files_info)
(go32_kill_inferior, go32_create_inferior, go32_mourn_inferior)
(go32_terminal_init, go32_terminal_info, go32_terminal_inferior)
(go32_terminal_ours, go32_pass_ctrlc, go32_thread_alive)
(go32_pid_to_str): Refactor as methods of go32_nat_target.
(go32_target): Delete.
(_initialize_go32_nat): Adjust to C++ification.
* gnu-nat.c (gnu_wait, gnu_resume, gnu_kill_inferior)
(gnu_mourn_inferior, gnu_create_inferior, gnu_attach, gnu_detach)
(gnu_stop, gnu_thread_alive, gnu_xfer_partial)
(gnu_find_memory_regions, gnu_pid_to_str): Refactor as methods of
gnu_nat_target.
(gnu_target): Delete.
* gnu-nat.h (gnu_target): Delete.
(gnu_nat_target): New class.
* i386-gnu-nat.c (gnu_base_target): New.
(i386_gnu_nat_target): New class.
(the_i386_gnu_nat_target): New.
(_initialize_i386gnu_nat): Adjust to C++ification.
gdb/testsuite/ChangeLog:
2018-05-02 Pedro Alves <palves@redhat.com>
* gdb.base/breakpoint-in-ro-region.exp: Adjust to to_resume and
to_log_command renames.
* gdb.base/sss-bp-on-user-bp-2.exp: Likewise.
2979 lines
88 KiB
C
2979 lines
88 KiB
C
/* Cache and manage frames for GDB, the GNU debugger.
|
|
|
|
Copyright (C) 1986-2018 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 "frame.h"
|
|
#include "target.h"
|
|
#include "value.h"
|
|
#include "inferior.h" /* for inferior_ptid */
|
|
#include "regcache.h"
|
|
#include "user-regs.h"
|
|
#include "gdb_obstack.h"
|
|
#include "dummy-frame.h"
|
|
#include "sentinel-frame.h"
|
|
#include "gdbcore.h"
|
|
#include "annotate.h"
|
|
#include "language.h"
|
|
#include "frame-unwind.h"
|
|
#include "frame-base.h"
|
|
#include "command.h"
|
|
#include "gdbcmd.h"
|
|
#include "observable.h"
|
|
#include "objfiles.h"
|
|
#include "gdbthread.h"
|
|
#include "block.h"
|
|
#include "inline-frame.h"
|
|
#include "tracepoint.h"
|
|
#include "hashtab.h"
|
|
#include "valprint.h"
|
|
|
|
/* The sentinel frame terminates the innermost end of the frame chain.
|
|
If unwound, it returns the information needed to construct an
|
|
innermost frame.
|
|
|
|
The current frame, which is the innermost frame, can be found at
|
|
sentinel_frame->prev. */
|
|
|
|
static struct frame_info *sentinel_frame;
|
|
|
|
static struct frame_info *get_prev_frame_raw (struct frame_info *this_frame);
|
|
static const char *frame_stop_reason_symbol_string (enum unwind_stop_reason reason);
|
|
|
|
/* Status of some values cached in the frame_info object. */
|
|
|
|
enum cached_copy_status
|
|
{
|
|
/* Value is unknown. */
|
|
CC_UNKNOWN,
|
|
|
|
/* We have a value. */
|
|
CC_VALUE,
|
|
|
|
/* Value was not saved. */
|
|
CC_NOT_SAVED,
|
|
|
|
/* Value is unavailable. */
|
|
CC_UNAVAILABLE
|
|
};
|
|
|
|
/* We keep a cache of stack frames, each of which is a "struct
|
|
frame_info". The innermost one gets allocated (in
|
|
wait_for_inferior) each time the inferior stops; sentinel_frame
|
|
points to it. Additional frames get allocated (in get_prev_frame)
|
|
as needed, and are chained through the next and prev fields. Any
|
|
time that the frame cache becomes invalid (most notably when we
|
|
execute something, but also if we change how we interpret the
|
|
frames (e.g. "set heuristic-fence-post" in mips-tdep.c, or anything
|
|
which reads new symbols)), we should call reinit_frame_cache. */
|
|
|
|
struct frame_info
|
|
{
|
|
/* Level of this frame. The inner-most (youngest) frame is at level
|
|
0. As you move towards the outer-most (oldest) frame, the level
|
|
increases. This is a cached value. It could just as easily be
|
|
computed by counting back from the selected frame to the inner
|
|
most frame. */
|
|
/* NOTE: cagney/2002-04-05: Perhaps a level of ``-1'' should be
|
|
reserved to indicate a bogus frame - one that has been created
|
|
just to keep GDB happy (GDB always needs a frame). For the
|
|
moment leave this as speculation. */
|
|
int level;
|
|
|
|
/* The frame's program space. */
|
|
struct program_space *pspace;
|
|
|
|
/* The frame's address space. */
|
|
const address_space *aspace;
|
|
|
|
/* The frame's low-level unwinder and corresponding cache. The
|
|
low-level unwinder is responsible for unwinding register values
|
|
for the previous frame. The low-level unwind methods are
|
|
selected based on the presence, or otherwise, of register unwind
|
|
information such as CFI. */
|
|
void *prologue_cache;
|
|
const struct frame_unwind *unwind;
|
|
|
|
/* Cached copy of the previous frame's architecture. */
|
|
struct
|
|
{
|
|
int p;
|
|
struct gdbarch *arch;
|
|
} prev_arch;
|
|
|
|
/* Cached copy of the previous frame's resume address. */
|
|
struct {
|
|
enum cached_copy_status status;
|
|
CORE_ADDR value;
|
|
} prev_pc;
|
|
|
|
/* Cached copy of the previous frame's function address. */
|
|
struct
|
|
{
|
|
CORE_ADDR addr;
|
|
int p;
|
|
} prev_func;
|
|
|
|
/* This frame's ID. */
|
|
struct
|
|
{
|
|
int p;
|
|
struct frame_id value;
|
|
} this_id;
|
|
|
|
/* The frame's high-level base methods, and corresponding cache.
|
|
The high level base methods are selected based on the frame's
|
|
debug info. */
|
|
const struct frame_base *base;
|
|
void *base_cache;
|
|
|
|
/* Pointers to the next (down, inner, younger) and previous (up,
|
|
outer, older) frame_info's in the frame cache. */
|
|
struct frame_info *next; /* down, inner, younger */
|
|
int prev_p;
|
|
struct frame_info *prev; /* up, outer, older */
|
|
|
|
/* The reason why we could not set PREV, or UNWIND_NO_REASON if we
|
|
could. Only valid when PREV_P is set. */
|
|
enum unwind_stop_reason stop_reason;
|
|
|
|
/* A frame specific string describing the STOP_REASON in more detail.
|
|
Only valid when PREV_P is set, but even then may still be NULL. */
|
|
const char *stop_string;
|
|
};
|
|
|
|
/* A frame stash used to speed up frame lookups. Create a hash table
|
|
to stash frames previously accessed from the frame cache for
|
|
quicker subsequent retrieval. The hash table is emptied whenever
|
|
the frame cache is invalidated. */
|
|
|
|
static htab_t frame_stash;
|
|
|
|
/* Internal function to calculate a hash from the frame_id addresses,
|
|
using as many valid addresses as possible. Frames below level 0
|
|
are not stored in the hash table. */
|
|
|
|
static hashval_t
|
|
frame_addr_hash (const void *ap)
|
|
{
|
|
const struct frame_info *frame = (const struct frame_info *) ap;
|
|
const struct frame_id f_id = frame->this_id.value;
|
|
hashval_t hash = 0;
|
|
|
|
gdb_assert (f_id.stack_status != FID_STACK_INVALID
|
|
|| f_id.code_addr_p
|
|
|| f_id.special_addr_p);
|
|
|
|
if (f_id.stack_status == FID_STACK_VALID)
|
|
hash = iterative_hash (&f_id.stack_addr,
|
|
sizeof (f_id.stack_addr), hash);
|
|
if (f_id.code_addr_p)
|
|
hash = iterative_hash (&f_id.code_addr,
|
|
sizeof (f_id.code_addr), hash);
|
|
if (f_id.special_addr_p)
|
|
hash = iterative_hash (&f_id.special_addr,
|
|
sizeof (f_id.special_addr), hash);
|
|
|
|
return hash;
|
|
}
|
|
|
|
/* Internal equality function for the hash table. This function
|
|
defers equality operations to frame_id_eq. */
|
|
|
|
static int
|
|
frame_addr_hash_eq (const void *a, const void *b)
|
|
{
|
|
const struct frame_info *f_entry = (const struct frame_info *) a;
|
|
const struct frame_info *f_element = (const struct frame_info *) b;
|
|
|
|
return frame_id_eq (f_entry->this_id.value,
|
|
f_element->this_id.value);
|
|
}
|
|
|
|
/* Internal function to create the frame_stash hash table. 100 seems
|
|
to be a good compromise to start the hash table at. */
|
|
|
|
static void
|
|
frame_stash_create (void)
|
|
{
|
|
frame_stash = htab_create (100,
|
|
frame_addr_hash,
|
|
frame_addr_hash_eq,
|
|
NULL);
|
|
}
|
|
|
|
/* Internal function to add a frame to the frame_stash hash table.
|
|
Returns false if a frame with the same ID was already stashed, true
|
|
otherwise. */
|
|
|
|
static int
|
|
frame_stash_add (struct frame_info *frame)
|
|
{
|
|
struct frame_info **slot;
|
|
|
|
/* Do not try to stash the sentinel frame. */
|
|
gdb_assert (frame->level >= 0);
|
|
|
|
slot = (struct frame_info **) htab_find_slot (frame_stash,
|
|
frame,
|
|
INSERT);
|
|
|
|
/* If we already have a frame in the stack with the same id, we
|
|
either have a stack cycle (corrupted stack?), or some bug
|
|
elsewhere in GDB. In any case, ignore the duplicate and return
|
|
an indication to the caller. */
|
|
if (*slot != NULL)
|
|
return 0;
|
|
|
|
*slot = frame;
|
|
return 1;
|
|
}
|
|
|
|
/* Internal function to search the frame stash for an entry with the
|
|
given frame ID. If found, return that frame. Otherwise return
|
|
NULL. */
|
|
|
|
static struct frame_info *
|
|
frame_stash_find (struct frame_id id)
|
|
{
|
|
struct frame_info dummy;
|
|
struct frame_info *frame;
|
|
|
|
dummy.this_id.value = id;
|
|
frame = (struct frame_info *) htab_find (frame_stash, &dummy);
|
|
return frame;
|
|
}
|
|
|
|
/* Internal function to invalidate the frame stash by removing all
|
|
entries in it. This only occurs when the frame cache is
|
|
invalidated. */
|
|
|
|
static void
|
|
frame_stash_invalidate (void)
|
|
{
|
|
htab_empty (frame_stash);
|
|
}
|
|
|
|
/* Flag to control debugging. */
|
|
|
|
unsigned int frame_debug;
|
|
static void
|
|
show_frame_debug (struct ui_file *file, int from_tty,
|
|
struct cmd_list_element *c, const char *value)
|
|
{
|
|
fprintf_filtered (file, _("Frame debugging is %s.\n"), value);
|
|
}
|
|
|
|
/* Flag to indicate whether backtraces should stop at main et.al. */
|
|
|
|
static int backtrace_past_main;
|
|
static void
|
|
show_backtrace_past_main (struct ui_file *file, int from_tty,
|
|
struct cmd_list_element *c, const char *value)
|
|
{
|
|
fprintf_filtered (file,
|
|
_("Whether backtraces should "
|
|
"continue past \"main\" is %s.\n"),
|
|
value);
|
|
}
|
|
|
|
static int backtrace_past_entry;
|
|
static void
|
|
show_backtrace_past_entry (struct ui_file *file, int from_tty,
|
|
struct cmd_list_element *c, const char *value)
|
|
{
|
|
fprintf_filtered (file, _("Whether backtraces should continue past the "
|
|
"entry point of a program is %s.\n"),
|
|
value);
|
|
}
|
|
|
|
static unsigned int backtrace_limit = UINT_MAX;
|
|
static void
|
|
show_backtrace_limit (struct ui_file *file, int from_tty,
|
|
struct cmd_list_element *c, const char *value)
|
|
{
|
|
fprintf_filtered (file,
|
|
_("An upper bound on the number "
|
|
"of backtrace levels is %s.\n"),
|
|
value);
|
|
}
|
|
|
|
|
|
static void
|
|
fprint_field (struct ui_file *file, const char *name, int p, CORE_ADDR addr)
|
|
{
|
|
if (p)
|
|
fprintf_unfiltered (file, "%s=%s", name, hex_string (addr));
|
|
else
|
|
fprintf_unfiltered (file, "!%s", name);
|
|
}
|
|
|
|
void
|
|
fprint_frame_id (struct ui_file *file, struct frame_id id)
|
|
{
|
|
fprintf_unfiltered (file, "{");
|
|
|
|
if (id.stack_status == FID_STACK_INVALID)
|
|
fprintf_unfiltered (file, "!stack");
|
|
else if (id.stack_status == FID_STACK_UNAVAILABLE)
|
|
fprintf_unfiltered (file, "stack=<unavailable>");
|
|
else if (id.stack_status == FID_STACK_SENTINEL)
|
|
fprintf_unfiltered (file, "stack=<sentinel>");
|
|
else
|
|
fprintf_unfiltered (file, "stack=%s", hex_string (id.stack_addr));
|
|
fprintf_unfiltered (file, ",");
|
|
|
|
fprint_field (file, "code", id.code_addr_p, id.code_addr);
|
|
fprintf_unfiltered (file, ",");
|
|
|
|
fprint_field (file, "special", id.special_addr_p, id.special_addr);
|
|
|
|
if (id.artificial_depth)
|
|
fprintf_unfiltered (file, ",artificial=%d", id.artificial_depth);
|
|
|
|
fprintf_unfiltered (file, "}");
|
|
}
|
|
|
|
static void
|
|
fprint_frame_type (struct ui_file *file, enum frame_type type)
|
|
{
|
|
switch (type)
|
|
{
|
|
case NORMAL_FRAME:
|
|
fprintf_unfiltered (file, "NORMAL_FRAME");
|
|
return;
|
|
case DUMMY_FRAME:
|
|
fprintf_unfiltered (file, "DUMMY_FRAME");
|
|
return;
|
|
case INLINE_FRAME:
|
|
fprintf_unfiltered (file, "INLINE_FRAME");
|
|
return;
|
|
case TAILCALL_FRAME:
|
|
fprintf_unfiltered (file, "TAILCALL_FRAME");
|
|
return;
|
|
case SIGTRAMP_FRAME:
|
|
fprintf_unfiltered (file, "SIGTRAMP_FRAME");
|
|
return;
|
|
case ARCH_FRAME:
|
|
fprintf_unfiltered (file, "ARCH_FRAME");
|
|
return;
|
|
case SENTINEL_FRAME:
|
|
fprintf_unfiltered (file, "SENTINEL_FRAME");
|
|
return;
|
|
default:
|
|
fprintf_unfiltered (file, "<unknown type>");
|
|
return;
|
|
};
|
|
}
|
|
|
|
static void
|
|
fprint_frame (struct ui_file *file, struct frame_info *fi)
|
|
{
|
|
if (fi == NULL)
|
|
{
|
|
fprintf_unfiltered (file, "<NULL frame>");
|
|
return;
|
|
}
|
|
fprintf_unfiltered (file, "{");
|
|
fprintf_unfiltered (file, "level=%d", fi->level);
|
|
fprintf_unfiltered (file, ",");
|
|
fprintf_unfiltered (file, "type=");
|
|
if (fi->unwind != NULL)
|
|
fprint_frame_type (file, fi->unwind->type);
|
|
else
|
|
fprintf_unfiltered (file, "<unknown>");
|
|
fprintf_unfiltered (file, ",");
|
|
fprintf_unfiltered (file, "unwind=");
|
|
if (fi->unwind != NULL)
|
|
gdb_print_host_address (fi->unwind, file);
|
|
else
|
|
fprintf_unfiltered (file, "<unknown>");
|
|
fprintf_unfiltered (file, ",");
|
|
fprintf_unfiltered (file, "pc=");
|
|
if (fi->next == NULL || fi->next->prev_pc.status == CC_UNKNOWN)
|
|
fprintf_unfiltered (file, "<unknown>");
|
|
else if (fi->next->prev_pc.status == CC_VALUE)
|
|
fprintf_unfiltered (file, "%s",
|
|
hex_string (fi->next->prev_pc.value));
|
|
else if (fi->next->prev_pc.status == CC_NOT_SAVED)
|
|
val_print_not_saved (file);
|
|
else if (fi->next->prev_pc.status == CC_UNAVAILABLE)
|
|
val_print_unavailable (file);
|
|
fprintf_unfiltered (file, ",");
|
|
fprintf_unfiltered (file, "id=");
|
|
if (fi->this_id.p)
|
|
fprint_frame_id (file, fi->this_id.value);
|
|
else
|
|
fprintf_unfiltered (file, "<unknown>");
|
|
fprintf_unfiltered (file, ",");
|
|
fprintf_unfiltered (file, "func=");
|
|
if (fi->next != NULL && fi->next->prev_func.p)
|
|
fprintf_unfiltered (file, "%s", hex_string (fi->next->prev_func.addr));
|
|
else
|
|
fprintf_unfiltered (file, "<unknown>");
|
|
fprintf_unfiltered (file, "}");
|
|
}
|
|
|
|
/* Given FRAME, return the enclosing frame as found in real frames read-in from
|
|
inferior memory. Skip any previous frames which were made up by GDB.
|
|
Return FRAME if FRAME is a non-artificial frame.
|
|
Return NULL if FRAME is the start of an artificial-only chain. */
|
|
|
|
static struct frame_info *
|
|
skip_artificial_frames (struct frame_info *frame)
|
|
{
|
|
/* Note we use get_prev_frame_always, and not get_prev_frame. The
|
|
latter will truncate the frame chain, leading to this function
|
|
unintentionally returning a null_frame_id (e.g., when the user
|
|
sets a backtrace limit).
|
|
|
|
Note that for record targets we may get a frame chain that consists
|
|
of artificial frames only. */
|
|
while (get_frame_type (frame) == INLINE_FRAME
|
|
|| get_frame_type (frame) == TAILCALL_FRAME)
|
|
{
|
|
frame = get_prev_frame_always (frame);
|
|
if (frame == NULL)
|
|
break;
|
|
}
|
|
|
|
return frame;
|
|
}
|
|
|
|
struct frame_info *
|
|
skip_unwritable_frames (struct frame_info *frame)
|
|
{
|
|
while (gdbarch_code_of_frame_writable (get_frame_arch (frame), frame) == 0)
|
|
{
|
|
frame = get_prev_frame (frame);
|
|
if (frame == NULL)
|
|
break;
|
|
}
|
|
|
|
return frame;
|
|
}
|
|
|
|
/* See frame.h. */
|
|
|
|
struct frame_info *
|
|
skip_tailcall_frames (struct frame_info *frame)
|
|
{
|
|
while (get_frame_type (frame) == TAILCALL_FRAME)
|
|
{
|
|
/* Note that for record targets we may get a frame chain that consists of
|
|
tailcall frames only. */
|
|
frame = get_prev_frame (frame);
|
|
if (frame == NULL)
|
|
break;
|
|
}
|
|
|
|
return frame;
|
|
}
|
|
|
|
/* Compute the frame's uniq ID that can be used to, later, re-find the
|
|
frame. */
|
|
|
|
static void
|
|
compute_frame_id (struct frame_info *fi)
|
|
{
|
|
gdb_assert (!fi->this_id.p);
|
|
|
|
if (frame_debug)
|
|
fprintf_unfiltered (gdb_stdlog, "{ compute_frame_id (fi=%d) ",
|
|
fi->level);
|
|
/* Find the unwinder. */
|
|
if (fi->unwind == NULL)
|
|
frame_unwind_find_by_frame (fi, &fi->prologue_cache);
|
|
/* Find THIS frame's ID. */
|
|
/* Default to outermost if no ID is found. */
|
|
fi->this_id.value = outer_frame_id;
|
|
fi->unwind->this_id (fi, &fi->prologue_cache, &fi->this_id.value);
|
|
gdb_assert (frame_id_p (fi->this_id.value));
|
|
fi->this_id.p = 1;
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "-> ");
|
|
fprint_frame_id (gdb_stdlog, fi->this_id.value);
|
|
fprintf_unfiltered (gdb_stdlog, " }\n");
|
|
}
|
|
}
|
|
|
|
/* Return a frame uniq ID that can be used to, later, re-find the
|
|
frame. */
|
|
|
|
struct frame_id
|
|
get_frame_id (struct frame_info *fi)
|
|
{
|
|
if (fi == NULL)
|
|
return null_frame_id;
|
|
|
|
if (!fi->this_id.p)
|
|
{
|
|
int stashed;
|
|
|
|
/* If we haven't computed the frame id yet, then it must be that
|
|
this is the current frame. Compute it now, and stash the
|
|
result. The IDs of other frames are computed as soon as
|
|
they're created, in order to detect cycles. See
|
|
get_prev_frame_if_no_cycle. */
|
|
gdb_assert (fi->level == 0);
|
|
|
|
/* Compute. */
|
|
compute_frame_id (fi);
|
|
|
|
/* Since this is the first frame in the chain, this should
|
|
always succeed. */
|
|
stashed = frame_stash_add (fi);
|
|
gdb_assert (stashed);
|
|
}
|
|
|
|
return fi->this_id.value;
|
|
}
|
|
|
|
struct frame_id
|
|
get_stack_frame_id (struct frame_info *next_frame)
|
|
{
|
|
return get_frame_id (skip_artificial_frames (next_frame));
|
|
}
|
|
|
|
struct frame_id
|
|
frame_unwind_caller_id (struct frame_info *next_frame)
|
|
{
|
|
struct frame_info *this_frame;
|
|
|
|
/* Use get_prev_frame_always, and not get_prev_frame. The latter
|
|
will truncate the frame chain, leading to this function
|
|
unintentionally returning a null_frame_id (e.g., when a caller
|
|
requests the frame ID of "main()"s caller. */
|
|
|
|
next_frame = skip_artificial_frames (next_frame);
|
|
if (next_frame == NULL)
|
|
return null_frame_id;
|
|
|
|
this_frame = get_prev_frame_always (next_frame);
|
|
if (this_frame)
|
|
return get_frame_id (skip_artificial_frames (this_frame));
|
|
else
|
|
return null_frame_id;
|
|
}
|
|
|
|
const struct frame_id null_frame_id = { 0 }; /* All zeros. */
|
|
const struct frame_id sentinel_frame_id = { 0, 0, 0, FID_STACK_SENTINEL, 0, 1, 0 };
|
|
const struct frame_id outer_frame_id = { 0, 0, 0, FID_STACK_INVALID, 0, 1, 0 };
|
|
|
|
struct frame_id
|
|
frame_id_build_special (CORE_ADDR stack_addr, CORE_ADDR code_addr,
|
|
CORE_ADDR special_addr)
|
|
{
|
|
struct frame_id id = null_frame_id;
|
|
|
|
id.stack_addr = stack_addr;
|
|
id.stack_status = FID_STACK_VALID;
|
|
id.code_addr = code_addr;
|
|
id.code_addr_p = 1;
|
|
id.special_addr = special_addr;
|
|
id.special_addr_p = 1;
|
|
return id;
|
|
}
|
|
|
|
/* See frame.h. */
|
|
|
|
struct frame_id
|
|
frame_id_build_unavailable_stack (CORE_ADDR code_addr)
|
|
{
|
|
struct frame_id id = null_frame_id;
|
|
|
|
id.stack_status = FID_STACK_UNAVAILABLE;
|
|
id.code_addr = code_addr;
|
|
id.code_addr_p = 1;
|
|
return id;
|
|
}
|
|
|
|
/* See frame.h. */
|
|
|
|
struct frame_id
|
|
frame_id_build_unavailable_stack_special (CORE_ADDR code_addr,
|
|
CORE_ADDR special_addr)
|
|
{
|
|
struct frame_id id = null_frame_id;
|
|
|
|
id.stack_status = FID_STACK_UNAVAILABLE;
|
|
id.code_addr = code_addr;
|
|
id.code_addr_p = 1;
|
|
id.special_addr = special_addr;
|
|
id.special_addr_p = 1;
|
|
return id;
|
|
}
|
|
|
|
struct frame_id
|
|
frame_id_build (CORE_ADDR stack_addr, CORE_ADDR code_addr)
|
|
{
|
|
struct frame_id id = null_frame_id;
|
|
|
|
id.stack_addr = stack_addr;
|
|
id.stack_status = FID_STACK_VALID;
|
|
id.code_addr = code_addr;
|
|
id.code_addr_p = 1;
|
|
return id;
|
|
}
|
|
|
|
struct frame_id
|
|
frame_id_build_wild (CORE_ADDR stack_addr)
|
|
{
|
|
struct frame_id id = null_frame_id;
|
|
|
|
id.stack_addr = stack_addr;
|
|
id.stack_status = FID_STACK_VALID;
|
|
return id;
|
|
}
|
|
|
|
int
|
|
frame_id_p (struct frame_id l)
|
|
{
|
|
int p;
|
|
|
|
/* The frame is valid iff it has a valid stack address. */
|
|
p = l.stack_status != FID_STACK_INVALID;
|
|
/* outer_frame_id is also valid. */
|
|
if (!p && memcmp (&l, &outer_frame_id, sizeof (l)) == 0)
|
|
p = 1;
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "{ frame_id_p (l=");
|
|
fprint_frame_id (gdb_stdlog, l);
|
|
fprintf_unfiltered (gdb_stdlog, ") -> %d }\n", p);
|
|
}
|
|
return p;
|
|
}
|
|
|
|
int
|
|
frame_id_artificial_p (struct frame_id l)
|
|
{
|
|
if (!frame_id_p (l))
|
|
return 0;
|
|
|
|
return (l.artificial_depth != 0);
|
|
}
|
|
|
|
int
|
|
frame_id_eq (struct frame_id l, struct frame_id r)
|
|
{
|
|
int eq;
|
|
|
|
if (l.stack_status == FID_STACK_INVALID && l.special_addr_p
|
|
&& r.stack_status == FID_STACK_INVALID && r.special_addr_p)
|
|
/* The outermost frame marker is equal to itself. This is the
|
|
dodgy thing about outer_frame_id, since between execution steps
|
|
we might step into another function - from which we can't
|
|
unwind either. More thought required to get rid of
|
|
outer_frame_id. */
|
|
eq = 1;
|
|
else if (l.stack_status == FID_STACK_INVALID
|
|
|| r.stack_status == FID_STACK_INVALID)
|
|
/* Like a NaN, if either ID is invalid, the result is false.
|
|
Note that a frame ID is invalid iff it is the null frame ID. */
|
|
eq = 0;
|
|
else if (l.stack_status != r.stack_status || l.stack_addr != r.stack_addr)
|
|
/* If .stack addresses are different, the frames are different. */
|
|
eq = 0;
|
|
else if (l.code_addr_p && r.code_addr_p && l.code_addr != r.code_addr)
|
|
/* An invalid code addr is a wild card. If .code addresses are
|
|
different, the frames are different. */
|
|
eq = 0;
|
|
else if (l.special_addr_p && r.special_addr_p
|
|
&& l.special_addr != r.special_addr)
|
|
/* An invalid special addr is a wild card (or unused). Otherwise
|
|
if special addresses are different, the frames are different. */
|
|
eq = 0;
|
|
else if (l.artificial_depth != r.artificial_depth)
|
|
/* If artifical depths are different, the frames must be different. */
|
|
eq = 0;
|
|
else
|
|
/* Frames are equal. */
|
|
eq = 1;
|
|
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "{ frame_id_eq (l=");
|
|
fprint_frame_id (gdb_stdlog, l);
|
|
fprintf_unfiltered (gdb_stdlog, ",r=");
|
|
fprint_frame_id (gdb_stdlog, r);
|
|
fprintf_unfiltered (gdb_stdlog, ") -> %d }\n", eq);
|
|
}
|
|
return eq;
|
|
}
|
|
|
|
/* Safety net to check whether frame ID L should be inner to
|
|
frame ID R, according to their stack addresses.
|
|
|
|
This method cannot be used to compare arbitrary frames, as the
|
|
ranges of valid stack addresses may be discontiguous (e.g. due
|
|
to sigaltstack).
|
|
|
|
However, it can be used as safety net to discover invalid frame
|
|
IDs in certain circumstances. Assuming that NEXT is the immediate
|
|
inner frame to THIS and that NEXT and THIS are both NORMAL frames:
|
|
|
|
* The stack address of NEXT must be inner-than-or-equal to the stack
|
|
address of THIS.
|
|
|
|
Therefore, if frame_id_inner (THIS, NEXT) holds, some unwind
|
|
error has occurred.
|
|
|
|
* If NEXT and THIS have different stack addresses, no other frame
|
|
in the frame chain may have a stack address in between.
|
|
|
|
Therefore, if frame_id_inner (TEST, THIS) holds, but
|
|
frame_id_inner (TEST, NEXT) does not hold, TEST cannot refer
|
|
to a valid frame in the frame chain.
|
|
|
|
The sanity checks above cannot be performed when a SIGTRAMP frame
|
|
is involved, because signal handlers might be executed on a different
|
|
stack than the stack used by the routine that caused the signal
|
|
to be raised. This can happen for instance when a thread exceeds
|
|
its maximum stack size. In this case, certain compilers implement
|
|
a stack overflow strategy that cause the handler to be run on a
|
|
different stack. */
|
|
|
|
static int
|
|
frame_id_inner (struct gdbarch *gdbarch, struct frame_id l, struct frame_id r)
|
|
{
|
|
int inner;
|
|
|
|
if (l.stack_status != FID_STACK_VALID || r.stack_status != FID_STACK_VALID)
|
|
/* Like NaN, any operation involving an invalid ID always fails.
|
|
Likewise if either ID has an unavailable stack address. */
|
|
inner = 0;
|
|
else if (l.artificial_depth > r.artificial_depth
|
|
&& l.stack_addr == r.stack_addr
|
|
&& l.code_addr_p == r.code_addr_p
|
|
&& l.special_addr_p == r.special_addr_p
|
|
&& l.special_addr == r.special_addr)
|
|
{
|
|
/* Same function, different inlined functions. */
|
|
const struct block *lb, *rb;
|
|
|
|
gdb_assert (l.code_addr_p && r.code_addr_p);
|
|
|
|
lb = block_for_pc (l.code_addr);
|
|
rb = block_for_pc (r.code_addr);
|
|
|
|
if (lb == NULL || rb == NULL)
|
|
/* Something's gone wrong. */
|
|
inner = 0;
|
|
else
|
|
/* This will return true if LB and RB are the same block, or
|
|
if the block with the smaller depth lexically encloses the
|
|
block with the greater depth. */
|
|
inner = contained_in (lb, rb);
|
|
}
|
|
else
|
|
/* Only return non-zero when strictly inner than. Note that, per
|
|
comment in "frame.h", there is some fuzz here. Frameless
|
|
functions are not strictly inner than (same .stack but
|
|
different .code and/or .special address). */
|
|
inner = gdbarch_inner_than (gdbarch, l.stack_addr, r.stack_addr);
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "{ frame_id_inner (l=");
|
|
fprint_frame_id (gdb_stdlog, l);
|
|
fprintf_unfiltered (gdb_stdlog, ",r=");
|
|
fprint_frame_id (gdb_stdlog, r);
|
|
fprintf_unfiltered (gdb_stdlog, ") -> %d }\n", inner);
|
|
}
|
|
return inner;
|
|
}
|
|
|
|
struct frame_info *
|
|
frame_find_by_id (struct frame_id id)
|
|
{
|
|
struct frame_info *frame, *prev_frame;
|
|
|
|
/* ZERO denotes the null frame, let the caller decide what to do
|
|
about it. Should it instead return get_current_frame()? */
|
|
if (!frame_id_p (id))
|
|
return NULL;
|
|
|
|
/* Check for the sentinel frame. */
|
|
if (frame_id_eq (id, sentinel_frame_id))
|
|
return sentinel_frame;
|
|
|
|
/* Try using the frame stash first. Finding it there removes the need
|
|
to perform the search by looping over all frames, which can be very
|
|
CPU-intensive if the number of frames is very high (the loop is O(n)
|
|
and get_prev_frame performs a series of checks that are relatively
|
|
expensive). This optimization is particularly useful when this function
|
|
is called from another function (such as value_fetch_lazy, case
|
|
VALUE_LVAL (val) == lval_register) which already loops over all frames,
|
|
making the overall behavior O(n^2). */
|
|
frame = frame_stash_find (id);
|
|
if (frame)
|
|
return frame;
|
|
|
|
for (frame = get_current_frame (); ; frame = prev_frame)
|
|
{
|
|
struct frame_id self = get_frame_id (frame);
|
|
|
|
if (frame_id_eq (id, self))
|
|
/* An exact match. */
|
|
return frame;
|
|
|
|
prev_frame = get_prev_frame (frame);
|
|
if (!prev_frame)
|
|
return NULL;
|
|
|
|
/* As a safety net to avoid unnecessary backtracing while trying
|
|
to find an invalid ID, we check for a common situation where
|
|
we can detect from comparing stack addresses that no other
|
|
frame in the current frame chain can have this ID. See the
|
|
comment at frame_id_inner for details. */
|
|
if (get_frame_type (frame) == NORMAL_FRAME
|
|
&& !frame_id_inner (get_frame_arch (frame), id, self)
|
|
&& frame_id_inner (get_frame_arch (prev_frame), id,
|
|
get_frame_id (prev_frame)))
|
|
return NULL;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
static CORE_ADDR
|
|
frame_unwind_pc (struct frame_info *this_frame)
|
|
{
|
|
if (this_frame->prev_pc.status == CC_UNKNOWN)
|
|
{
|
|
if (gdbarch_unwind_pc_p (frame_unwind_arch (this_frame)))
|
|
{
|
|
struct gdbarch *prev_gdbarch;
|
|
CORE_ADDR pc = 0;
|
|
int pc_p = 0;
|
|
|
|
/* The right way. The `pure' way. The one true way. This
|
|
method depends solely on the register-unwind code to
|
|
determine the value of registers in THIS frame, and hence
|
|
the value of this frame's PC (resume address). A typical
|
|
implementation is no more than:
|
|
|
|
frame_unwind_register (this_frame, ISA_PC_REGNUM, buf);
|
|
return extract_unsigned_integer (buf, size of ISA_PC_REGNUM);
|
|
|
|
Note: this method is very heavily dependent on a correct
|
|
register-unwind implementation, it pays to fix that
|
|
method first; this method is frame type agnostic, since
|
|
it only deals with register values, it works with any
|
|
frame. This is all in stark contrast to the old
|
|
FRAME_SAVED_PC which would try to directly handle all the
|
|
different ways that a PC could be unwound. */
|
|
prev_gdbarch = frame_unwind_arch (this_frame);
|
|
|
|
TRY
|
|
{
|
|
pc = gdbarch_unwind_pc (prev_gdbarch, this_frame);
|
|
pc_p = 1;
|
|
}
|
|
CATCH (ex, RETURN_MASK_ERROR)
|
|
{
|
|
if (ex.error == NOT_AVAILABLE_ERROR)
|
|
{
|
|
this_frame->prev_pc.status = CC_UNAVAILABLE;
|
|
|
|
if (frame_debug)
|
|
fprintf_unfiltered (gdb_stdlog,
|
|
"{ frame_unwind_pc (this_frame=%d)"
|
|
" -> <unavailable> }\n",
|
|
this_frame->level);
|
|
}
|
|
else if (ex.error == OPTIMIZED_OUT_ERROR)
|
|
{
|
|
this_frame->prev_pc.status = CC_NOT_SAVED;
|
|
|
|
if (frame_debug)
|
|
fprintf_unfiltered (gdb_stdlog,
|
|
"{ frame_unwind_pc (this_frame=%d)"
|
|
" -> <not saved> }\n",
|
|
this_frame->level);
|
|
}
|
|
else
|
|
throw_exception (ex);
|
|
}
|
|
END_CATCH
|
|
|
|
if (pc_p)
|
|
{
|
|
this_frame->prev_pc.value = pc;
|
|
this_frame->prev_pc.status = CC_VALUE;
|
|
if (frame_debug)
|
|
fprintf_unfiltered (gdb_stdlog,
|
|
"{ frame_unwind_pc (this_frame=%d) "
|
|
"-> %s }\n",
|
|
this_frame->level,
|
|
hex_string (this_frame->prev_pc.value));
|
|
}
|
|
}
|
|
else
|
|
internal_error (__FILE__, __LINE__, _("No unwind_pc method"));
|
|
}
|
|
|
|
if (this_frame->prev_pc.status == CC_VALUE)
|
|
return this_frame->prev_pc.value;
|
|
else if (this_frame->prev_pc.status == CC_UNAVAILABLE)
|
|
throw_error (NOT_AVAILABLE_ERROR, _("PC not available"));
|
|
else if (this_frame->prev_pc.status == CC_NOT_SAVED)
|
|
throw_error (OPTIMIZED_OUT_ERROR, _("PC not saved"));
|
|
else
|
|
internal_error (__FILE__, __LINE__,
|
|
"unexpected prev_pc status: %d",
|
|
(int) this_frame->prev_pc.status);
|
|
}
|
|
|
|
CORE_ADDR
|
|
frame_unwind_caller_pc (struct frame_info *this_frame)
|
|
{
|
|
this_frame = skip_artificial_frames (this_frame);
|
|
|
|
/* We must have a non-artificial frame. The caller is supposed to check
|
|
the result of frame_unwind_caller_id (), which returns NULL_FRAME_ID
|
|
in this case. */
|
|
gdb_assert (this_frame != NULL);
|
|
|
|
return frame_unwind_pc (this_frame);
|
|
}
|
|
|
|
int
|
|
get_frame_func_if_available (struct frame_info *this_frame, CORE_ADDR *pc)
|
|
{
|
|
struct frame_info *next_frame = this_frame->next;
|
|
|
|
if (!next_frame->prev_func.p)
|
|
{
|
|
CORE_ADDR addr_in_block;
|
|
|
|
/* Make certain that this, and not the adjacent, function is
|
|
found. */
|
|
if (!get_frame_address_in_block_if_available (this_frame, &addr_in_block))
|
|
{
|
|
next_frame->prev_func.p = -1;
|
|
if (frame_debug)
|
|
fprintf_unfiltered (gdb_stdlog,
|
|
"{ get_frame_func (this_frame=%d)"
|
|
" -> unavailable }\n",
|
|
this_frame->level);
|
|
}
|
|
else
|
|
{
|
|
next_frame->prev_func.p = 1;
|
|
next_frame->prev_func.addr = get_pc_function_start (addr_in_block);
|
|
if (frame_debug)
|
|
fprintf_unfiltered (gdb_stdlog,
|
|
"{ get_frame_func (this_frame=%d) -> %s }\n",
|
|
this_frame->level,
|
|
hex_string (next_frame->prev_func.addr));
|
|
}
|
|
}
|
|
|
|
if (next_frame->prev_func.p < 0)
|
|
{
|
|
*pc = -1;
|
|
return 0;
|
|
}
|
|
else
|
|
{
|
|
*pc = next_frame->prev_func.addr;
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
CORE_ADDR
|
|
get_frame_func (struct frame_info *this_frame)
|
|
{
|
|
CORE_ADDR pc;
|
|
|
|
if (!get_frame_func_if_available (this_frame, &pc))
|
|
throw_error (NOT_AVAILABLE_ERROR, _("PC not available"));
|
|
|
|
return pc;
|
|
}
|
|
|
|
static enum register_status
|
|
do_frame_register_read (void *src, int regnum, gdb_byte *buf)
|
|
{
|
|
if (!deprecated_frame_register_read ((struct frame_info *) src, regnum, buf))
|
|
return REG_UNAVAILABLE;
|
|
else
|
|
return REG_VALID;
|
|
}
|
|
|
|
std::unique_ptr<readonly_detached_regcache>
|
|
frame_save_as_regcache (struct frame_info *this_frame)
|
|
{
|
|
std::unique_ptr<readonly_detached_regcache> regcache
|
|
(new readonly_detached_regcache (get_frame_arch (this_frame),
|
|
do_frame_register_read, this_frame));
|
|
|
|
return regcache;
|
|
}
|
|
|
|
void
|
|
frame_pop (struct frame_info *this_frame)
|
|
{
|
|
struct frame_info *prev_frame;
|
|
|
|
if (get_frame_type (this_frame) == DUMMY_FRAME)
|
|
{
|
|
/* Popping a dummy frame involves restoring more than just registers.
|
|
dummy_frame_pop does all the work. */
|
|
dummy_frame_pop (get_frame_id (this_frame), inferior_ptid);
|
|
return;
|
|
}
|
|
|
|
/* Ensure that we have a frame to pop to. */
|
|
prev_frame = get_prev_frame_always (this_frame);
|
|
|
|
if (!prev_frame)
|
|
error (_("Cannot pop the initial frame."));
|
|
|
|
/* Ignore TAILCALL_FRAME type frames, they were executed already before
|
|
entering THISFRAME. */
|
|
prev_frame = skip_tailcall_frames (prev_frame);
|
|
|
|
if (prev_frame == NULL)
|
|
error (_("Cannot find the caller frame."));
|
|
|
|
/* Make a copy of all the register values unwound from this frame.
|
|
Save them in a scratch buffer so that there isn't a race between
|
|
trying to extract the old values from the current regcache while
|
|
at the same time writing new values into that same cache. */
|
|
std::unique_ptr<readonly_detached_regcache> scratch
|
|
= frame_save_as_regcache (prev_frame);
|
|
|
|
/* FIXME: cagney/2003-03-16: It should be possible to tell the
|
|
target's register cache that it is about to be hit with a burst
|
|
register transfer and that the sequence of register writes should
|
|
be batched. The pair target_prepare_to_store() and
|
|
target_store_registers() kind of suggest this functionality.
|
|
Unfortunately, they don't implement it. Their lack of a formal
|
|
definition can lead to targets writing back bogus values
|
|
(arguably a bug in the target code mind). */
|
|
/* Now copy those saved registers into the current regcache. */
|
|
get_current_regcache ()->restore (scratch.get ());
|
|
|
|
/* We've made right mess of GDB's local state, just discard
|
|
everything. */
|
|
reinit_frame_cache ();
|
|
}
|
|
|
|
void
|
|
frame_register_unwind (struct frame_info *frame, int regnum,
|
|
int *optimizedp, int *unavailablep,
|
|
enum lval_type *lvalp, CORE_ADDR *addrp,
|
|
int *realnump, gdb_byte *bufferp)
|
|
{
|
|
struct value *value;
|
|
|
|
/* Require all but BUFFERP to be valid. A NULL BUFFERP indicates
|
|
that the value proper does not need to be fetched. */
|
|
gdb_assert (optimizedp != NULL);
|
|
gdb_assert (lvalp != NULL);
|
|
gdb_assert (addrp != NULL);
|
|
gdb_assert (realnump != NULL);
|
|
/* gdb_assert (bufferp != NULL); */
|
|
|
|
value = frame_unwind_register_value (frame, regnum);
|
|
|
|
gdb_assert (value != NULL);
|
|
|
|
*optimizedp = value_optimized_out (value);
|
|
*unavailablep = !value_entirely_available (value);
|
|
*lvalp = VALUE_LVAL (value);
|
|
*addrp = value_address (value);
|
|
if (*lvalp == lval_register)
|
|
*realnump = VALUE_REGNUM (value);
|
|
else
|
|
*realnump = -1;
|
|
|
|
if (bufferp)
|
|
{
|
|
if (!*optimizedp && !*unavailablep)
|
|
memcpy (bufferp, value_contents_all (value),
|
|
TYPE_LENGTH (value_type (value)));
|
|
else
|
|
memset (bufferp, 0, TYPE_LENGTH (value_type (value)));
|
|
}
|
|
|
|
/* Dispose of the new value. This prevents watchpoints from
|
|
trying to watch the saved frame pointer. */
|
|
release_value (value);
|
|
}
|
|
|
|
void
|
|
frame_register (struct frame_info *frame, int regnum,
|
|
int *optimizedp, int *unavailablep, enum lval_type *lvalp,
|
|
CORE_ADDR *addrp, int *realnump, gdb_byte *bufferp)
|
|
{
|
|
/* Require all but BUFFERP to be valid. A NULL BUFFERP indicates
|
|
that the value proper does not need to be fetched. */
|
|
gdb_assert (optimizedp != NULL);
|
|
gdb_assert (lvalp != NULL);
|
|
gdb_assert (addrp != NULL);
|
|
gdb_assert (realnump != NULL);
|
|
/* gdb_assert (bufferp != NULL); */
|
|
|
|
/* Obtain the register value by unwinding the register from the next
|
|
(more inner frame). */
|
|
gdb_assert (frame != NULL && frame->next != NULL);
|
|
frame_register_unwind (frame->next, regnum, optimizedp, unavailablep,
|
|
lvalp, addrp, realnump, bufferp);
|
|
}
|
|
|
|
void
|
|
frame_unwind_register (struct frame_info *frame, int regnum, gdb_byte *buf)
|
|
{
|
|
int optimized;
|
|
int unavailable;
|
|
CORE_ADDR addr;
|
|
int realnum;
|
|
enum lval_type lval;
|
|
|
|
frame_register_unwind (frame, regnum, &optimized, &unavailable,
|
|
&lval, &addr, &realnum, buf);
|
|
|
|
if (optimized)
|
|
throw_error (OPTIMIZED_OUT_ERROR,
|
|
_("Register %d was not saved"), regnum);
|
|
if (unavailable)
|
|
throw_error (NOT_AVAILABLE_ERROR,
|
|
_("Register %d is not available"), regnum);
|
|
}
|
|
|
|
void
|
|
get_frame_register (struct frame_info *frame,
|
|
int regnum, gdb_byte *buf)
|
|
{
|
|
frame_unwind_register (frame->next, regnum, buf);
|
|
}
|
|
|
|
struct value *
|
|
frame_unwind_register_value (struct frame_info *frame, int regnum)
|
|
{
|
|
struct gdbarch *gdbarch;
|
|
struct value *value;
|
|
|
|
gdb_assert (frame != NULL);
|
|
gdbarch = frame_unwind_arch (frame);
|
|
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog,
|
|
"{ frame_unwind_register_value "
|
|
"(frame=%d,regnum=%d(%s),...) ",
|
|
frame->level, regnum,
|
|
user_reg_map_regnum_to_name (gdbarch, regnum));
|
|
}
|
|
|
|
/* Find the unwinder. */
|
|
if (frame->unwind == NULL)
|
|
frame_unwind_find_by_frame (frame, &frame->prologue_cache);
|
|
|
|
/* Ask this frame to unwind its register. */
|
|
value = frame->unwind->prev_register (frame, &frame->prologue_cache, regnum);
|
|
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "->");
|
|
if (value_optimized_out (value))
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, " ");
|
|
val_print_optimized_out (value, gdb_stdlog);
|
|
}
|
|
else
|
|
{
|
|
if (VALUE_LVAL (value) == lval_register)
|
|
fprintf_unfiltered (gdb_stdlog, " register=%d",
|
|
VALUE_REGNUM (value));
|
|
else if (VALUE_LVAL (value) == lval_memory)
|
|
fprintf_unfiltered (gdb_stdlog, " address=%s",
|
|
paddress (gdbarch,
|
|
value_address (value)));
|
|
else
|
|
fprintf_unfiltered (gdb_stdlog, " computed");
|
|
|
|
if (value_lazy (value))
|
|
fprintf_unfiltered (gdb_stdlog, " lazy");
|
|
else
|
|
{
|
|
int i;
|
|
const gdb_byte *buf = value_contents (value);
|
|
|
|
fprintf_unfiltered (gdb_stdlog, " bytes=");
|
|
fprintf_unfiltered (gdb_stdlog, "[");
|
|
for (i = 0; i < register_size (gdbarch, regnum); i++)
|
|
fprintf_unfiltered (gdb_stdlog, "%02x", buf[i]);
|
|
fprintf_unfiltered (gdb_stdlog, "]");
|
|
}
|
|
}
|
|
|
|
fprintf_unfiltered (gdb_stdlog, " }\n");
|
|
}
|
|
|
|
return value;
|
|
}
|
|
|
|
struct value *
|
|
get_frame_register_value (struct frame_info *frame, int regnum)
|
|
{
|
|
return frame_unwind_register_value (frame->next, regnum);
|
|
}
|
|
|
|
LONGEST
|
|
frame_unwind_register_signed (struct frame_info *frame, int regnum)
|
|
{
|
|
struct gdbarch *gdbarch = frame_unwind_arch (frame);
|
|
enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
|
|
int size = register_size (gdbarch, regnum);
|
|
struct value *value = frame_unwind_register_value (frame, regnum);
|
|
|
|
gdb_assert (value != NULL);
|
|
|
|
if (value_optimized_out (value))
|
|
{
|
|
throw_error (OPTIMIZED_OUT_ERROR,
|
|
_("Register %d was not saved"), regnum);
|
|
}
|
|
if (!value_entirely_available (value))
|
|
{
|
|
throw_error (NOT_AVAILABLE_ERROR,
|
|
_("Register %d is not available"), regnum);
|
|
}
|
|
|
|
LONGEST r = extract_signed_integer (value_contents_all (value), size,
|
|
byte_order);
|
|
|
|
release_value (value);
|
|
return r;
|
|
}
|
|
|
|
LONGEST
|
|
get_frame_register_signed (struct frame_info *frame, int regnum)
|
|
{
|
|
return frame_unwind_register_signed (frame->next, regnum);
|
|
}
|
|
|
|
ULONGEST
|
|
frame_unwind_register_unsigned (struct frame_info *frame, int regnum)
|
|
{
|
|
struct gdbarch *gdbarch = frame_unwind_arch (frame);
|
|
enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
|
|
int size = register_size (gdbarch, regnum);
|
|
struct value *value = frame_unwind_register_value (frame, regnum);
|
|
|
|
gdb_assert (value != NULL);
|
|
|
|
if (value_optimized_out (value))
|
|
{
|
|
throw_error (OPTIMIZED_OUT_ERROR,
|
|
_("Register %d was not saved"), regnum);
|
|
}
|
|
if (!value_entirely_available (value))
|
|
{
|
|
throw_error (NOT_AVAILABLE_ERROR,
|
|
_("Register %d is not available"), regnum);
|
|
}
|
|
|
|
ULONGEST r = extract_unsigned_integer (value_contents_all (value), size,
|
|
byte_order);
|
|
|
|
release_value (value);
|
|
return r;
|
|
}
|
|
|
|
ULONGEST
|
|
get_frame_register_unsigned (struct frame_info *frame, int regnum)
|
|
{
|
|
return frame_unwind_register_unsigned (frame->next, regnum);
|
|
}
|
|
|
|
int
|
|
read_frame_register_unsigned (struct frame_info *frame, int regnum,
|
|
ULONGEST *val)
|
|
{
|
|
struct value *regval = get_frame_register_value (frame, regnum);
|
|
|
|
if (!value_optimized_out (regval)
|
|
&& value_entirely_available (regval))
|
|
{
|
|
struct gdbarch *gdbarch = get_frame_arch (frame);
|
|
enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
|
|
int size = register_size (gdbarch, VALUE_REGNUM (regval));
|
|
|
|
*val = extract_unsigned_integer (value_contents (regval), size, byte_order);
|
|
return 1;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
void
|
|
put_frame_register (struct frame_info *frame, int regnum,
|
|
const gdb_byte *buf)
|
|
{
|
|
struct gdbarch *gdbarch = get_frame_arch (frame);
|
|
int realnum;
|
|
int optim;
|
|
int unavail;
|
|
enum lval_type lval;
|
|
CORE_ADDR addr;
|
|
|
|
frame_register (frame, regnum, &optim, &unavail,
|
|
&lval, &addr, &realnum, NULL);
|
|
if (optim)
|
|
error (_("Attempt to assign to a register that was not saved."));
|
|
switch (lval)
|
|
{
|
|
case lval_memory:
|
|
{
|
|
write_memory (addr, buf, register_size (gdbarch, regnum));
|
|
break;
|
|
}
|
|
case lval_register:
|
|
regcache_cooked_write (get_current_regcache (), realnum, buf);
|
|
break;
|
|
default:
|
|
error (_("Attempt to assign to an unmodifiable value."));
|
|
}
|
|
}
|
|
|
|
/* This function is deprecated. Use get_frame_register_value instead,
|
|
which provides more accurate information.
|
|
|
|
Find and return the value of REGNUM for the specified stack frame.
|
|
The number of bytes copied is REGISTER_SIZE (REGNUM).
|
|
|
|
Returns 0 if the register value could not be found. */
|
|
|
|
int
|
|
deprecated_frame_register_read (struct frame_info *frame, int regnum,
|
|
gdb_byte *myaddr)
|
|
{
|
|
int optimized;
|
|
int unavailable;
|
|
enum lval_type lval;
|
|
CORE_ADDR addr;
|
|
int realnum;
|
|
|
|
frame_register (frame, regnum, &optimized, &unavailable,
|
|
&lval, &addr, &realnum, myaddr);
|
|
|
|
return !optimized && !unavailable;
|
|
}
|
|
|
|
int
|
|
get_frame_register_bytes (struct frame_info *frame, int regnum,
|
|
CORE_ADDR offset, int len, gdb_byte *myaddr,
|
|
int *optimizedp, int *unavailablep)
|
|
{
|
|
struct gdbarch *gdbarch = get_frame_arch (frame);
|
|
int i;
|
|
int maxsize;
|
|
int numregs;
|
|
|
|
/* Skip registers wholly inside of OFFSET. */
|
|
while (offset >= register_size (gdbarch, regnum))
|
|
{
|
|
offset -= register_size (gdbarch, regnum);
|
|
regnum++;
|
|
}
|
|
|
|
/* Ensure that we will not read beyond the end of the register file.
|
|
This can only ever happen if the debug information is bad. */
|
|
maxsize = -offset;
|
|
numregs = gdbarch_num_regs (gdbarch) + gdbarch_num_pseudo_regs (gdbarch);
|
|
for (i = regnum; i < numregs; i++)
|
|
{
|
|
int thissize = register_size (gdbarch, i);
|
|
|
|
if (thissize == 0)
|
|
break; /* This register is not available on this architecture. */
|
|
maxsize += thissize;
|
|
}
|
|
if (len > maxsize)
|
|
error (_("Bad debug information detected: "
|
|
"Attempt to read %d bytes from registers."), len);
|
|
|
|
/* Copy the data. */
|
|
while (len > 0)
|
|
{
|
|
int curr_len = register_size (gdbarch, regnum) - offset;
|
|
|
|
if (curr_len > len)
|
|
curr_len = len;
|
|
|
|
if (curr_len == register_size (gdbarch, regnum))
|
|
{
|
|
enum lval_type lval;
|
|
CORE_ADDR addr;
|
|
int realnum;
|
|
|
|
frame_register (frame, regnum, optimizedp, unavailablep,
|
|
&lval, &addr, &realnum, myaddr);
|
|
if (*optimizedp || *unavailablep)
|
|
return 0;
|
|
}
|
|
else
|
|
{
|
|
struct value *value = frame_unwind_register_value (frame->next,
|
|
regnum);
|
|
gdb_assert (value != NULL);
|
|
*optimizedp = value_optimized_out (value);
|
|
*unavailablep = !value_entirely_available (value);
|
|
|
|
if (*optimizedp || *unavailablep)
|
|
{
|
|
release_value (value);
|
|
return 0;
|
|
}
|
|
memcpy (myaddr, value_contents_all (value) + offset, curr_len);
|
|
release_value (value);
|
|
}
|
|
|
|
myaddr += curr_len;
|
|
len -= curr_len;
|
|
offset = 0;
|
|
regnum++;
|
|
}
|
|
|
|
*optimizedp = 0;
|
|
*unavailablep = 0;
|
|
return 1;
|
|
}
|
|
|
|
void
|
|
put_frame_register_bytes (struct frame_info *frame, int regnum,
|
|
CORE_ADDR offset, int len, const gdb_byte *myaddr)
|
|
{
|
|
struct gdbarch *gdbarch = get_frame_arch (frame);
|
|
|
|
/* Skip registers wholly inside of OFFSET. */
|
|
while (offset >= register_size (gdbarch, regnum))
|
|
{
|
|
offset -= register_size (gdbarch, regnum);
|
|
regnum++;
|
|
}
|
|
|
|
/* Copy the data. */
|
|
while (len > 0)
|
|
{
|
|
int curr_len = register_size (gdbarch, regnum) - offset;
|
|
|
|
if (curr_len > len)
|
|
curr_len = len;
|
|
|
|
if (curr_len == register_size (gdbarch, regnum))
|
|
{
|
|
put_frame_register (frame, regnum, myaddr);
|
|
}
|
|
else
|
|
{
|
|
struct value *value = frame_unwind_register_value (frame->next,
|
|
regnum);
|
|
gdb_assert (value != NULL);
|
|
|
|
memcpy ((char *) value_contents_writeable (value) + offset, myaddr,
|
|
curr_len);
|
|
put_frame_register (frame, regnum, value_contents_raw (value));
|
|
release_value (value);
|
|
}
|
|
|
|
myaddr += curr_len;
|
|
len -= curr_len;
|
|
offset = 0;
|
|
regnum++;
|
|
}
|
|
}
|
|
|
|
/* Create a sentinel frame. */
|
|
|
|
static struct frame_info *
|
|
create_sentinel_frame (struct program_space *pspace, struct regcache *regcache)
|
|
{
|
|
struct frame_info *frame = FRAME_OBSTACK_ZALLOC (struct frame_info);
|
|
|
|
frame->level = -1;
|
|
frame->pspace = pspace;
|
|
frame->aspace = regcache->aspace ();
|
|
/* Explicitly initialize the sentinel frame's cache. Provide it
|
|
with the underlying regcache. In the future additional
|
|
information, such as the frame's thread will be added. */
|
|
frame->prologue_cache = sentinel_frame_cache (regcache);
|
|
/* For the moment there is only one sentinel frame implementation. */
|
|
frame->unwind = &sentinel_frame_unwind;
|
|
/* Link this frame back to itself. The frame is self referential
|
|
(the unwound PC is the same as the pc), so make it so. */
|
|
frame->next = frame;
|
|
/* The sentinel frame has a special ID. */
|
|
frame->this_id.p = 1;
|
|
frame->this_id.value = sentinel_frame_id;
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "{ create_sentinel_frame (...) -> ");
|
|
fprint_frame (gdb_stdlog, frame);
|
|
fprintf_unfiltered (gdb_stdlog, " }\n");
|
|
}
|
|
return frame;
|
|
}
|
|
|
|
/* Cache for frame addresses already read by gdb. Valid only while
|
|
inferior is stopped. Control variables for the frame cache should
|
|
be local to this module. */
|
|
|
|
static struct obstack frame_cache_obstack;
|
|
|
|
void *
|
|
frame_obstack_zalloc (unsigned long size)
|
|
{
|
|
void *data = obstack_alloc (&frame_cache_obstack, size);
|
|
|
|
memset (data, 0, size);
|
|
return data;
|
|
}
|
|
|
|
static struct frame_info *get_prev_frame_always_1 (struct frame_info *this_frame);
|
|
|
|
struct frame_info *
|
|
get_current_frame (void)
|
|
{
|
|
struct frame_info *current_frame;
|
|
|
|
/* First check, and report, the lack of registers. Having GDB
|
|
report "No stack!" or "No memory" when the target doesn't even
|
|
have registers is very confusing. Besides, "printcmd.exp"
|
|
explicitly checks that ``print $pc'' with no registers prints "No
|
|
registers". */
|
|
if (!target_has_registers)
|
|
error (_("No registers."));
|
|
if (!target_has_stack)
|
|
error (_("No stack."));
|
|
if (!target_has_memory)
|
|
error (_("No memory."));
|
|
/* Traceframes are effectively a substitute for the live inferior. */
|
|
if (get_traceframe_number () < 0)
|
|
validate_registers_access ();
|
|
|
|
if (sentinel_frame == NULL)
|
|
sentinel_frame =
|
|
create_sentinel_frame (current_program_space, get_current_regcache ());
|
|
|
|
/* Set the current frame before computing the frame id, to avoid
|
|
recursion inside compute_frame_id, in case the frame's
|
|
unwinder decides to do a symbol lookup (which depends on the
|
|
selected frame's block).
|
|
|
|
This call must always succeed. In particular, nothing inside
|
|
get_prev_frame_always_1 should try to unwind from the
|
|
sentinel frame, because that could fail/throw, and we always
|
|
want to leave with the current frame created and linked in --
|
|
we should never end up with the sentinel frame as outermost
|
|
frame. */
|
|
current_frame = get_prev_frame_always_1 (sentinel_frame);
|
|
gdb_assert (current_frame != NULL);
|
|
|
|
return current_frame;
|
|
}
|
|
|
|
/* The "selected" stack frame is used by default for local and arg
|
|
access. May be zero, for no selected frame. */
|
|
|
|
static struct frame_info *selected_frame;
|
|
|
|
int
|
|
has_stack_frames (void)
|
|
{
|
|
if (!target_has_registers || !target_has_stack || !target_has_memory)
|
|
return 0;
|
|
|
|
/* Traceframes are effectively a substitute for the live inferior. */
|
|
if (get_traceframe_number () < 0)
|
|
{
|
|
/* No current inferior, no frame. */
|
|
if (ptid_equal (inferior_ptid, null_ptid))
|
|
return 0;
|
|
|
|
/* Don't try to read from a dead thread. */
|
|
if (is_exited (inferior_ptid))
|
|
return 0;
|
|
|
|
/* ... or from a spinning thread. */
|
|
if (is_executing (inferior_ptid))
|
|
return 0;
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|
|
/* Return the selected frame. Always non-NULL (unless there isn't an
|
|
inferior sufficient for creating a frame) in which case an error is
|
|
thrown. */
|
|
|
|
struct frame_info *
|
|
get_selected_frame (const char *message)
|
|
{
|
|
if (selected_frame == NULL)
|
|
{
|
|
if (message != NULL && !has_stack_frames ())
|
|
error (("%s"), message);
|
|
/* Hey! Don't trust this. It should really be re-finding the
|
|
last selected frame of the currently selected thread. This,
|
|
though, is better than nothing. */
|
|
select_frame (get_current_frame ());
|
|
}
|
|
/* There is always a frame. */
|
|
gdb_assert (selected_frame != NULL);
|
|
return selected_frame;
|
|
}
|
|
|
|
/* If there is a selected frame, return it. Otherwise, return NULL. */
|
|
|
|
struct frame_info *
|
|
get_selected_frame_if_set (void)
|
|
{
|
|
return selected_frame;
|
|
}
|
|
|
|
/* This is a variant of get_selected_frame() which can be called when
|
|
the inferior does not have a frame; in that case it will return
|
|
NULL instead of calling error(). */
|
|
|
|
struct frame_info *
|
|
deprecated_safe_get_selected_frame (void)
|
|
{
|
|
if (!has_stack_frames ())
|
|
return NULL;
|
|
return get_selected_frame (NULL);
|
|
}
|
|
|
|
/* Select frame FI (or NULL - to invalidate the current frame). */
|
|
|
|
void
|
|
select_frame (struct frame_info *fi)
|
|
{
|
|
selected_frame = fi;
|
|
/* NOTE: cagney/2002-05-04: FI can be NULL. This occurs when the
|
|
frame is being invalidated. */
|
|
|
|
/* FIXME: kseitz/2002-08-28: It would be nice to call
|
|
selected_frame_level_changed_event() right here, but due to limitations
|
|
in the current interfaces, we would end up flooding UIs with events
|
|
because select_frame() is used extensively internally.
|
|
|
|
Once we have frame-parameterized frame (and frame-related) commands,
|
|
the event notification can be moved here, since this function will only
|
|
be called when the user's selected frame is being changed. */
|
|
|
|
/* Ensure that symbols for this frame are read in. Also, determine the
|
|
source language of this frame, and switch to it if desired. */
|
|
if (fi)
|
|
{
|
|
CORE_ADDR pc;
|
|
|
|
/* We retrieve the frame's symtab by using the frame PC.
|
|
However we cannot use the frame PC as-is, because it usually
|
|
points to the instruction following the "call", which is
|
|
sometimes the first instruction of another function. So we
|
|
rely on get_frame_address_in_block() which provides us with a
|
|
PC which is guaranteed to be inside the frame's code
|
|
block. */
|
|
if (get_frame_address_in_block_if_available (fi, &pc))
|
|
{
|
|
struct compunit_symtab *cust = find_pc_compunit_symtab (pc);
|
|
|
|
if (cust != NULL
|
|
&& compunit_language (cust) != current_language->la_language
|
|
&& compunit_language (cust) != language_unknown
|
|
&& language_mode == language_mode_auto)
|
|
set_language (compunit_language (cust));
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Create an arbitrary (i.e. address specified by user) or innermost frame.
|
|
Always returns a non-NULL value. */
|
|
|
|
struct frame_info *
|
|
create_new_frame (CORE_ADDR addr, CORE_ADDR pc)
|
|
{
|
|
struct frame_info *fi;
|
|
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog,
|
|
"{ create_new_frame (addr=%s, pc=%s) ",
|
|
hex_string (addr), hex_string (pc));
|
|
}
|
|
|
|
fi = FRAME_OBSTACK_ZALLOC (struct frame_info);
|
|
|
|
fi->next = create_sentinel_frame (current_program_space,
|
|
get_current_regcache ());
|
|
|
|
/* Set/update this frame's cached PC value, found in the next frame.
|
|
Do this before looking for this frame's unwinder. A sniffer is
|
|
very likely to read this, and the corresponding unwinder is
|
|
entitled to rely that the PC doesn't magically change. */
|
|
fi->next->prev_pc.value = pc;
|
|
fi->next->prev_pc.status = CC_VALUE;
|
|
|
|
/* We currently assume that frame chain's can't cross spaces. */
|
|
fi->pspace = fi->next->pspace;
|
|
fi->aspace = fi->next->aspace;
|
|
|
|
/* Select/initialize both the unwind function and the frame's type
|
|
based on the PC. */
|
|
frame_unwind_find_by_frame (fi, &fi->prologue_cache);
|
|
|
|
fi->this_id.p = 1;
|
|
fi->this_id.value = frame_id_build (addr, pc);
|
|
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "-> ");
|
|
fprint_frame (gdb_stdlog, fi);
|
|
fprintf_unfiltered (gdb_stdlog, " }\n");
|
|
}
|
|
|
|
return fi;
|
|
}
|
|
|
|
/* Return the frame that THIS_FRAME calls (NULL if THIS_FRAME is the
|
|
innermost frame). Be careful to not fall off the bottom of the
|
|
frame chain and onto the sentinel frame. */
|
|
|
|
struct frame_info *
|
|
get_next_frame (struct frame_info *this_frame)
|
|
{
|
|
if (this_frame->level > 0)
|
|
return this_frame->next;
|
|
else
|
|
return NULL;
|
|
}
|
|
|
|
/* Return the frame that THIS_FRAME calls. If THIS_FRAME is the
|
|
innermost (i.e. current) frame, return the sentinel frame. Thus,
|
|
unlike get_next_frame(), NULL will never be returned. */
|
|
|
|
struct frame_info *
|
|
get_next_frame_sentinel_okay (struct frame_info *this_frame)
|
|
{
|
|
gdb_assert (this_frame != NULL);
|
|
|
|
/* Note that, due to the manner in which the sentinel frame is
|
|
constructed, this_frame->next still works even when this_frame
|
|
is the sentinel frame. But we disallow it here anyway because
|
|
calling get_next_frame_sentinel_okay() on the sentinel frame
|
|
is likely a coding error. */
|
|
gdb_assert (this_frame != sentinel_frame);
|
|
|
|
return this_frame->next;
|
|
}
|
|
|
|
/* Observer for the target_changed event. */
|
|
|
|
static void
|
|
frame_observer_target_changed (struct target_ops *target)
|
|
{
|
|
reinit_frame_cache ();
|
|
}
|
|
|
|
/* Flush the entire frame cache. */
|
|
|
|
void
|
|
reinit_frame_cache (void)
|
|
{
|
|
struct frame_info *fi;
|
|
|
|
/* Tear down all frame caches. */
|
|
for (fi = sentinel_frame; fi != NULL; fi = fi->prev)
|
|
{
|
|
if (fi->prologue_cache && fi->unwind->dealloc_cache)
|
|
fi->unwind->dealloc_cache (fi, fi->prologue_cache);
|
|
if (fi->base_cache && fi->base->unwind->dealloc_cache)
|
|
fi->base->unwind->dealloc_cache (fi, fi->base_cache);
|
|
}
|
|
|
|
/* Since we can't really be sure what the first object allocated was. */
|
|
obstack_free (&frame_cache_obstack, 0);
|
|
obstack_init (&frame_cache_obstack);
|
|
|
|
if (sentinel_frame != NULL)
|
|
annotate_frames_invalid ();
|
|
|
|
sentinel_frame = NULL; /* Invalidate cache */
|
|
select_frame (NULL);
|
|
frame_stash_invalidate ();
|
|
if (frame_debug)
|
|
fprintf_unfiltered (gdb_stdlog, "{ reinit_frame_cache () }\n");
|
|
}
|
|
|
|
/* Find where a register is saved (in memory or another register).
|
|
The result of frame_register_unwind is just where it is saved
|
|
relative to this particular frame. */
|
|
|
|
static void
|
|
frame_register_unwind_location (struct frame_info *this_frame, int regnum,
|
|
int *optimizedp, enum lval_type *lvalp,
|
|
CORE_ADDR *addrp, int *realnump)
|
|
{
|
|
gdb_assert (this_frame == NULL || this_frame->level >= 0);
|
|
|
|
while (this_frame != NULL)
|
|
{
|
|
int unavailable;
|
|
|
|
frame_register_unwind (this_frame, regnum, optimizedp, &unavailable,
|
|
lvalp, addrp, realnump, NULL);
|
|
|
|
if (*optimizedp)
|
|
break;
|
|
|
|
if (*lvalp != lval_register)
|
|
break;
|
|
|
|
regnum = *realnump;
|
|
this_frame = get_next_frame (this_frame);
|
|
}
|
|
}
|
|
|
|
/* Called during frame unwinding to remove a previous frame pointer from a
|
|
frame passed in ARG. */
|
|
|
|
static void
|
|
remove_prev_frame (void *arg)
|
|
{
|
|
struct frame_info *this_frame, *prev_frame;
|
|
|
|
this_frame = (struct frame_info *) arg;
|
|
prev_frame = this_frame->prev;
|
|
gdb_assert (prev_frame != NULL);
|
|
|
|
prev_frame->next = NULL;
|
|
this_frame->prev = NULL;
|
|
}
|
|
|
|
/* Get the previous raw frame, and check that it is not identical to
|
|
same other frame frame already in the chain. If it is, there is
|
|
most likely a stack cycle, so we discard it, and mark THIS_FRAME as
|
|
outermost, with UNWIND_SAME_ID stop reason. Unlike the other
|
|
validity tests, that compare THIS_FRAME and the next frame, we do
|
|
this right after creating the previous frame, to avoid ever ending
|
|
up with two frames with the same id in the frame chain. */
|
|
|
|
static struct frame_info *
|
|
get_prev_frame_if_no_cycle (struct frame_info *this_frame)
|
|
{
|
|
struct frame_info *prev_frame;
|
|
struct cleanup *prev_frame_cleanup;
|
|
|
|
prev_frame = get_prev_frame_raw (this_frame);
|
|
|
|
/* Don't compute the frame id of the current frame yet. Unwinding
|
|
the sentinel frame can fail (e.g., if the thread is gone and we
|
|
can't thus read its registers). If we let the cycle detection
|
|
code below try to compute a frame ID, then an error thrown from
|
|
within the frame ID computation would result in the sentinel
|
|
frame as outermost frame, which is bogus. Instead, we'll compute
|
|
the current frame's ID lazily in get_frame_id. Note that there's
|
|
no point in doing cycle detection when there's only one frame, so
|
|
nothing is lost here. */
|
|
if (prev_frame->level == 0)
|
|
return prev_frame;
|
|
|
|
/* The cleanup will remove the previous frame that get_prev_frame_raw
|
|
linked onto THIS_FRAME. */
|
|
prev_frame_cleanup = make_cleanup (remove_prev_frame, this_frame);
|
|
|
|
compute_frame_id (prev_frame);
|
|
if (!frame_stash_add (prev_frame))
|
|
{
|
|
/* Another frame with the same id was already in the stash. We just
|
|
detected a cycle. */
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "-> ");
|
|
fprint_frame (gdb_stdlog, NULL);
|
|
fprintf_unfiltered (gdb_stdlog, " // this frame has same ID }\n");
|
|
}
|
|
this_frame->stop_reason = UNWIND_SAME_ID;
|
|
/* Unlink. */
|
|
prev_frame->next = NULL;
|
|
this_frame->prev = NULL;
|
|
prev_frame = NULL;
|
|
}
|
|
|
|
discard_cleanups (prev_frame_cleanup);
|
|
return prev_frame;
|
|
}
|
|
|
|
/* Helper function for get_prev_frame_always, this is called inside a
|
|
TRY_CATCH block. Return the frame that called THIS_FRAME or NULL if
|
|
there is no such frame. This may throw an exception. */
|
|
|
|
static struct frame_info *
|
|
get_prev_frame_always_1 (struct frame_info *this_frame)
|
|
{
|
|
struct gdbarch *gdbarch;
|
|
|
|
gdb_assert (this_frame != NULL);
|
|
gdbarch = get_frame_arch (this_frame);
|
|
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "{ get_prev_frame_always (this_frame=");
|
|
if (this_frame != NULL)
|
|
fprintf_unfiltered (gdb_stdlog, "%d", this_frame->level);
|
|
else
|
|
fprintf_unfiltered (gdb_stdlog, "<NULL>");
|
|
fprintf_unfiltered (gdb_stdlog, ") ");
|
|
}
|
|
|
|
/* Only try to do the unwind once. */
|
|
if (this_frame->prev_p)
|
|
{
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "-> ");
|
|
fprint_frame (gdb_stdlog, this_frame->prev);
|
|
fprintf_unfiltered (gdb_stdlog, " // cached \n");
|
|
}
|
|
return this_frame->prev;
|
|
}
|
|
|
|
/* If the frame unwinder hasn't been selected yet, we must do so
|
|
before setting prev_p; otherwise the check for misbehaved
|
|
sniffers will think that this frame's sniffer tried to unwind
|
|
further (see frame_cleanup_after_sniffer). */
|
|
if (this_frame->unwind == NULL)
|
|
frame_unwind_find_by_frame (this_frame, &this_frame->prologue_cache);
|
|
|
|
this_frame->prev_p = 1;
|
|
this_frame->stop_reason = UNWIND_NO_REASON;
|
|
|
|
/* If we are unwinding from an inline frame, all of the below tests
|
|
were already performed when we unwound from the next non-inline
|
|
frame. We must skip them, since we can not get THIS_FRAME's ID
|
|
until we have unwound all the way down to the previous non-inline
|
|
frame. */
|
|
if (get_frame_type (this_frame) == INLINE_FRAME)
|
|
return get_prev_frame_if_no_cycle (this_frame);
|
|
|
|
/* Check that this frame is unwindable. If it isn't, don't try to
|
|
unwind to the prev frame. */
|
|
this_frame->stop_reason
|
|
= this_frame->unwind->stop_reason (this_frame,
|
|
&this_frame->prologue_cache);
|
|
|
|
if (this_frame->stop_reason != UNWIND_NO_REASON)
|
|
{
|
|
if (frame_debug)
|
|
{
|
|
enum unwind_stop_reason reason = this_frame->stop_reason;
|
|
|
|
fprintf_unfiltered (gdb_stdlog, "-> ");
|
|
fprint_frame (gdb_stdlog, NULL);
|
|
fprintf_unfiltered (gdb_stdlog, " // %s }\n",
|
|
frame_stop_reason_symbol_string (reason));
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
/* Check that this frame's ID isn't inner to (younger, below, next)
|
|
the next frame. This happens when a frame unwind goes backwards.
|
|
This check is valid only if this frame and the next frame are NORMAL.
|
|
See the comment at frame_id_inner for details. */
|
|
if (get_frame_type (this_frame) == NORMAL_FRAME
|
|
&& this_frame->next->unwind->type == NORMAL_FRAME
|
|
&& frame_id_inner (get_frame_arch (this_frame->next),
|
|
get_frame_id (this_frame),
|
|
get_frame_id (this_frame->next)))
|
|
{
|
|
CORE_ADDR this_pc_in_block;
|
|
struct minimal_symbol *morestack_msym;
|
|
const char *morestack_name = NULL;
|
|
|
|
/* gcc -fsplit-stack __morestack can continue the stack anywhere. */
|
|
this_pc_in_block = get_frame_address_in_block (this_frame);
|
|
morestack_msym = lookup_minimal_symbol_by_pc (this_pc_in_block).minsym;
|
|
if (morestack_msym)
|
|
morestack_name = MSYMBOL_LINKAGE_NAME (morestack_msym);
|
|
if (!morestack_name || strcmp (morestack_name, "__morestack") != 0)
|
|
{
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "-> ");
|
|
fprint_frame (gdb_stdlog, NULL);
|
|
fprintf_unfiltered (gdb_stdlog,
|
|
" // this frame ID is inner }\n");
|
|
}
|
|
this_frame->stop_reason = UNWIND_INNER_ID;
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
/* Check that this and the next frame do not unwind the PC register
|
|
to the same memory location. If they do, then even though they
|
|
have different frame IDs, the new frame will be bogus; two
|
|
functions can't share a register save slot for the PC. This can
|
|
happen when the prologue analyzer finds a stack adjustment, but
|
|
no PC save.
|
|
|
|
This check does assume that the "PC register" is roughly a
|
|
traditional PC, even if the gdbarch_unwind_pc method adjusts
|
|
it (we do not rely on the value, only on the unwound PC being
|
|
dependent on this value). A potential improvement would be
|
|
to have the frame prev_pc method and the gdbarch unwind_pc
|
|
method set the same lval and location information as
|
|
frame_register_unwind. */
|
|
if (this_frame->level > 0
|
|
&& gdbarch_pc_regnum (gdbarch) >= 0
|
|
&& get_frame_type (this_frame) == NORMAL_FRAME
|
|
&& (get_frame_type (this_frame->next) == NORMAL_FRAME
|
|
|| get_frame_type (this_frame->next) == INLINE_FRAME))
|
|
{
|
|
int optimized, realnum, nrealnum;
|
|
enum lval_type lval, nlval;
|
|
CORE_ADDR addr, naddr;
|
|
|
|
frame_register_unwind_location (this_frame,
|
|
gdbarch_pc_regnum (gdbarch),
|
|
&optimized, &lval, &addr, &realnum);
|
|
frame_register_unwind_location (get_next_frame (this_frame),
|
|
gdbarch_pc_regnum (gdbarch),
|
|
&optimized, &nlval, &naddr, &nrealnum);
|
|
|
|
if ((lval == lval_memory && lval == nlval && addr == naddr)
|
|
|| (lval == lval_register && lval == nlval && realnum == nrealnum))
|
|
{
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "-> ");
|
|
fprint_frame (gdb_stdlog, NULL);
|
|
fprintf_unfiltered (gdb_stdlog, " // no saved PC }\n");
|
|
}
|
|
|
|
this_frame->stop_reason = UNWIND_NO_SAVED_PC;
|
|
this_frame->prev = NULL;
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
return get_prev_frame_if_no_cycle (this_frame);
|
|
}
|
|
|
|
/* Return a "struct frame_info" corresponding to the frame that called
|
|
THIS_FRAME. Returns NULL if there is no such frame.
|
|
|
|
Unlike get_prev_frame, this function always tries to unwind the
|
|
frame. */
|
|
|
|
struct frame_info *
|
|
get_prev_frame_always (struct frame_info *this_frame)
|
|
{
|
|
struct frame_info *prev_frame = NULL;
|
|
|
|
TRY
|
|
{
|
|
prev_frame = get_prev_frame_always_1 (this_frame);
|
|
}
|
|
CATCH (ex, RETURN_MASK_ERROR)
|
|
{
|
|
if (ex.error == MEMORY_ERROR)
|
|
{
|
|
this_frame->stop_reason = UNWIND_MEMORY_ERROR;
|
|
if (ex.message != NULL)
|
|
{
|
|
char *stop_string;
|
|
size_t size;
|
|
|
|
/* The error needs to live as long as the frame does.
|
|
Allocate using stack local STOP_STRING then assign the
|
|
pointer to the frame, this allows the STOP_STRING on the
|
|
frame to be of type 'const char *'. */
|
|
size = strlen (ex.message) + 1;
|
|
stop_string = (char *) frame_obstack_zalloc (size);
|
|
memcpy (stop_string, ex.message, size);
|
|
this_frame->stop_string = stop_string;
|
|
}
|
|
prev_frame = NULL;
|
|
}
|
|
else
|
|
throw_exception (ex);
|
|
}
|
|
END_CATCH
|
|
|
|
return prev_frame;
|
|
}
|
|
|
|
/* Construct a new "struct frame_info" and link it previous to
|
|
this_frame. */
|
|
|
|
static struct frame_info *
|
|
get_prev_frame_raw (struct frame_info *this_frame)
|
|
{
|
|
struct frame_info *prev_frame;
|
|
|
|
/* Allocate the new frame but do not wire it in to the frame chain.
|
|
Some (bad) code in INIT_FRAME_EXTRA_INFO tries to look along
|
|
frame->next to pull some fancy tricks (of course such code is, by
|
|
definition, recursive). Try to prevent it.
|
|
|
|
There is no reason to worry about memory leaks, should the
|
|
remainder of the function fail. The allocated memory will be
|
|
quickly reclaimed when the frame cache is flushed, and the `we've
|
|
been here before' check above will stop repeated memory
|
|
allocation calls. */
|
|
prev_frame = FRAME_OBSTACK_ZALLOC (struct frame_info);
|
|
prev_frame->level = this_frame->level + 1;
|
|
|
|
/* For now, assume we don't have frame chains crossing address
|
|
spaces. */
|
|
prev_frame->pspace = this_frame->pspace;
|
|
prev_frame->aspace = this_frame->aspace;
|
|
|
|
/* Don't yet compute ->unwind (and hence ->type). It is computed
|
|
on-demand in get_frame_type, frame_register_unwind, and
|
|
get_frame_id. */
|
|
|
|
/* Don't yet compute the frame's ID. It is computed on-demand by
|
|
get_frame_id(). */
|
|
|
|
/* The unwound frame ID is validate at the start of this function,
|
|
as part of the logic to decide if that frame should be further
|
|
unwound, and not here while the prev frame is being created.
|
|
Doing this makes it possible for the user to examine a frame that
|
|
has an invalid frame ID.
|
|
|
|
Some very old VAX code noted: [...] For the sake of argument,
|
|
suppose that the stack is somewhat trashed (which is one reason
|
|
that "info frame" exists). So, return 0 (indicating we don't
|
|
know the address of the arglist) if we don't know what frame this
|
|
frame calls. */
|
|
|
|
/* Link it in. */
|
|
this_frame->prev = prev_frame;
|
|
prev_frame->next = this_frame;
|
|
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "-> ");
|
|
fprint_frame (gdb_stdlog, prev_frame);
|
|
fprintf_unfiltered (gdb_stdlog, " }\n");
|
|
}
|
|
|
|
return prev_frame;
|
|
}
|
|
|
|
/* Debug routine to print a NULL frame being returned. */
|
|
|
|
static void
|
|
frame_debug_got_null_frame (struct frame_info *this_frame,
|
|
const char *reason)
|
|
{
|
|
if (frame_debug)
|
|
{
|
|
fprintf_unfiltered (gdb_stdlog, "{ get_prev_frame (this_frame=");
|
|
if (this_frame != NULL)
|
|
fprintf_unfiltered (gdb_stdlog, "%d", this_frame->level);
|
|
else
|
|
fprintf_unfiltered (gdb_stdlog, "<NULL>");
|
|
fprintf_unfiltered (gdb_stdlog, ") -> // %s}\n", reason);
|
|
}
|
|
}
|
|
|
|
/* Is this (non-sentinel) frame in the "main"() function? */
|
|
|
|
static int
|
|
inside_main_func (struct frame_info *this_frame)
|
|
{
|
|
struct bound_minimal_symbol msymbol;
|
|
CORE_ADDR maddr;
|
|
|
|
if (symfile_objfile == 0)
|
|
return 0;
|
|
msymbol = lookup_minimal_symbol (main_name (), NULL, symfile_objfile);
|
|
if (msymbol.minsym == NULL)
|
|
return 0;
|
|
/* Make certain that the code, and not descriptor, address is
|
|
returned. */
|
|
maddr = gdbarch_convert_from_func_ptr_addr (get_frame_arch (this_frame),
|
|
BMSYMBOL_VALUE_ADDRESS (msymbol),
|
|
target_stack);
|
|
return maddr == get_frame_func (this_frame);
|
|
}
|
|
|
|
/* Test whether THIS_FRAME is inside the process entry point function. */
|
|
|
|
static int
|
|
inside_entry_func (struct frame_info *this_frame)
|
|
{
|
|
CORE_ADDR entry_point;
|
|
|
|
if (!entry_point_address_query (&entry_point))
|
|
return 0;
|
|
|
|
return get_frame_func (this_frame) == entry_point;
|
|
}
|
|
|
|
/* Return a structure containing various interesting information about
|
|
the frame that called THIS_FRAME. Returns NULL if there is entier
|
|
no such frame or the frame fails any of a set of target-independent
|
|
condition that should terminate the frame chain (e.g., as unwinding
|
|
past main()).
|
|
|
|
This function should not contain target-dependent tests, such as
|
|
checking whether the program-counter is zero. */
|
|
|
|
struct frame_info *
|
|
get_prev_frame (struct frame_info *this_frame)
|
|
{
|
|
CORE_ADDR frame_pc;
|
|
int frame_pc_p;
|
|
|
|
/* There is always a frame. If this assertion fails, suspect that
|
|
something should be calling get_selected_frame() or
|
|
get_current_frame(). */
|
|
gdb_assert (this_frame != NULL);
|
|
|
|
/* If this_frame is the current frame, then compute and stash
|
|
its frame id prior to fetching and computing the frame id of the
|
|
previous frame. Otherwise, the cycle detection code in
|
|
get_prev_frame_if_no_cycle() will not work correctly. When
|
|
get_frame_id() is called later on, an assertion error will
|
|
be triggered in the event of a cycle between the current
|
|
frame and its previous frame. */
|
|
if (this_frame->level == 0)
|
|
get_frame_id (this_frame);
|
|
|
|
frame_pc_p = get_frame_pc_if_available (this_frame, &frame_pc);
|
|
|
|
/* tausq/2004-12-07: Dummy frames are skipped because it doesn't make much
|
|
sense to stop unwinding at a dummy frame. One place where a dummy
|
|
frame may have an address "inside_main_func" is on HPUX. On HPUX, the
|
|
pcsqh register (space register for the instruction at the head of the
|
|
instruction queue) cannot be written directly; the only way to set it
|
|
is to branch to code that is in the target space. In order to implement
|
|
frame dummies on HPUX, the called function is made to jump back to where
|
|
the inferior was when the user function was called. If gdb was inside
|
|
the main function when we created the dummy frame, the dummy frame will
|
|
point inside the main function. */
|
|
if (this_frame->level >= 0
|
|
&& get_frame_type (this_frame) == NORMAL_FRAME
|
|
&& !backtrace_past_main
|
|
&& frame_pc_p
|
|
&& inside_main_func (this_frame))
|
|
/* Don't unwind past main(). Note, this is done _before_ the
|
|
frame has been marked as previously unwound. That way if the
|
|
user later decides to enable unwinds past main(), that will
|
|
automatically happen. */
|
|
{
|
|
frame_debug_got_null_frame (this_frame, "inside main func");
|
|
return NULL;
|
|
}
|
|
|
|
/* If the user's backtrace limit has been exceeded, stop. We must
|
|
add two to the current level; one of those accounts for backtrace_limit
|
|
being 1-based and the level being 0-based, and the other accounts for
|
|
the level of the new frame instead of the level of the current
|
|
frame. */
|
|
if (this_frame->level + 2 > backtrace_limit)
|
|
{
|
|
frame_debug_got_null_frame (this_frame, "backtrace limit exceeded");
|
|
return NULL;
|
|
}
|
|
|
|
/* If we're already inside the entry function for the main objfile,
|
|
then it isn't valid. Don't apply this test to a dummy frame -
|
|
dummy frame PCs typically land in the entry func. Don't apply
|
|
this test to the sentinel frame. Sentinel frames should always
|
|
be allowed to unwind. */
|
|
/* NOTE: cagney/2003-07-07: Fixed a bug in inside_main_func() -
|
|
wasn't checking for "main" in the minimal symbols. With that
|
|
fixed asm-source tests now stop in "main" instead of halting the
|
|
backtrace in weird and wonderful ways somewhere inside the entry
|
|
file. Suspect that tests for inside the entry file/func were
|
|
added to work around that (now fixed) case. */
|
|
/* NOTE: cagney/2003-07-15: danielj (if I'm reading it right)
|
|
suggested having the inside_entry_func test use the
|
|
inside_main_func() msymbol trick (along with entry_point_address()
|
|
I guess) to determine the address range of the start function.
|
|
That should provide a far better stopper than the current
|
|
heuristics. */
|
|
/* NOTE: tausq/2004-10-09: this is needed if, for example, the compiler
|
|
applied tail-call optimizations to main so that a function called
|
|
from main returns directly to the caller of main. Since we don't
|
|
stop at main, we should at least stop at the entry point of the
|
|
application. */
|
|
if (this_frame->level >= 0
|
|
&& get_frame_type (this_frame) == NORMAL_FRAME
|
|
&& !backtrace_past_entry
|
|
&& frame_pc_p
|
|
&& inside_entry_func (this_frame))
|
|
{
|
|
frame_debug_got_null_frame (this_frame, "inside entry func");
|
|
return NULL;
|
|
}
|
|
|
|
/* Assume that the only way to get a zero PC is through something
|
|
like a SIGSEGV or a dummy frame, and hence that NORMAL frames
|
|
will never unwind a zero PC. */
|
|
if (this_frame->level > 0
|
|
&& (get_frame_type (this_frame) == NORMAL_FRAME
|
|
|| get_frame_type (this_frame) == INLINE_FRAME)
|
|
&& get_frame_type (get_next_frame (this_frame)) == NORMAL_FRAME
|
|
&& frame_pc_p && frame_pc == 0)
|
|
{
|
|
frame_debug_got_null_frame (this_frame, "zero PC");
|
|
return NULL;
|
|
}
|
|
|
|
return get_prev_frame_always (this_frame);
|
|
}
|
|
|
|
struct frame_id
|
|
get_prev_frame_id_by_id (struct frame_id id)
|
|
{
|
|
struct frame_id prev_id;
|
|
struct frame_info *frame;
|
|
|
|
frame = frame_find_by_id (id);
|
|
|
|
if (frame != NULL)
|
|
prev_id = get_frame_id (get_prev_frame (frame));
|
|
else
|
|
prev_id = null_frame_id;
|
|
|
|
return prev_id;
|
|
}
|
|
|
|
CORE_ADDR
|
|
get_frame_pc (struct frame_info *frame)
|
|
{
|
|
gdb_assert (frame->next != NULL);
|
|
return frame_unwind_pc (frame->next);
|
|
}
|
|
|
|
int
|
|
get_frame_pc_if_available (struct frame_info *frame, CORE_ADDR *pc)
|
|
{
|
|
|
|
gdb_assert (frame->next != NULL);
|
|
|
|
TRY
|
|
{
|
|
*pc = frame_unwind_pc (frame->next);
|
|
}
|
|
CATCH (ex, RETURN_MASK_ERROR)
|
|
{
|
|
if (ex.error == NOT_AVAILABLE_ERROR)
|
|
return 0;
|
|
else
|
|
throw_exception (ex);
|
|
}
|
|
END_CATCH
|
|
|
|
return 1;
|
|
}
|
|
|
|
/* Return an address that falls within THIS_FRAME's code block. */
|
|
|
|
CORE_ADDR
|
|
get_frame_address_in_block (struct frame_info *this_frame)
|
|
{
|
|
/* A draft address. */
|
|
CORE_ADDR pc = get_frame_pc (this_frame);
|
|
|
|
struct frame_info *next_frame = this_frame->next;
|
|
|
|
/* Calling get_frame_pc returns the resume address for THIS_FRAME.
|
|
Normally the resume address is inside the body of the function
|
|
associated with THIS_FRAME, but there is a special case: when
|
|
calling a function which the compiler knows will never return
|
|
(for instance abort), the call may be the very last instruction
|
|
in the calling function. The resume address will point after the
|
|
call and may be at the beginning of a different function
|
|
entirely.
|
|
|
|
If THIS_FRAME is a signal frame or dummy frame, then we should
|
|
not adjust the unwound PC. For a dummy frame, GDB pushed the
|
|
resume address manually onto the stack. For a signal frame, the
|
|
OS may have pushed the resume address manually and invoked the
|
|
handler (e.g. GNU/Linux), or invoked the trampoline which called
|
|
the signal handler - but in either case the signal handler is
|
|
expected to return to the trampoline. So in both of these
|
|
cases we know that the resume address is executable and
|
|
related. So we only need to adjust the PC if THIS_FRAME
|
|
is a normal function.
|
|
|
|
If the program has been interrupted while THIS_FRAME is current,
|
|
then clearly the resume address is inside the associated
|
|
function. There are three kinds of interruption: debugger stop
|
|
(next frame will be SENTINEL_FRAME), operating system
|
|
signal or exception (next frame will be SIGTRAMP_FRAME),
|
|
or debugger-induced function call (next frame will be
|
|
DUMMY_FRAME). So we only need to adjust the PC if
|
|
NEXT_FRAME is a normal function.
|
|
|
|
We check the type of NEXT_FRAME first, since it is already
|
|
known; frame type is determined by the unwinder, and since
|
|
we have THIS_FRAME we've already selected an unwinder for
|
|
NEXT_FRAME.
|
|
|
|
If the next frame is inlined, we need to keep going until we find
|
|
the real function - for instance, if a signal handler is invoked
|
|
while in an inlined function, then the code address of the
|
|
"calling" normal function should not be adjusted either. */
|
|
|
|
while (get_frame_type (next_frame) == INLINE_FRAME)
|
|
next_frame = next_frame->next;
|
|
|
|
if ((get_frame_type (next_frame) == NORMAL_FRAME
|
|
|| get_frame_type (next_frame) == TAILCALL_FRAME)
|
|
&& (get_frame_type (this_frame) == NORMAL_FRAME
|
|
|| get_frame_type (this_frame) == TAILCALL_FRAME
|
|
|| get_frame_type (this_frame) == INLINE_FRAME))
|
|
return pc - 1;
|
|
|
|
return pc;
|
|
}
|
|
|
|
int
|
|
get_frame_address_in_block_if_available (struct frame_info *this_frame,
|
|
CORE_ADDR *pc)
|
|
{
|
|
|
|
TRY
|
|
{
|
|
*pc = get_frame_address_in_block (this_frame);
|
|
}
|
|
CATCH (ex, RETURN_MASK_ERROR)
|
|
{
|
|
if (ex.error == NOT_AVAILABLE_ERROR)
|
|
return 0;
|
|
throw_exception (ex);
|
|
}
|
|
END_CATCH
|
|
|
|
return 1;
|
|
}
|
|
|
|
symtab_and_line
|
|
find_frame_sal (frame_info *frame)
|
|
{
|
|
struct frame_info *next_frame;
|
|
int notcurrent;
|
|
CORE_ADDR pc;
|
|
|
|
/* If the next frame represents an inlined function call, this frame's
|
|
sal is the "call site" of that inlined function, which can not
|
|
be inferred from get_frame_pc. */
|
|
next_frame = get_next_frame (frame);
|
|
if (frame_inlined_callees (frame) > 0)
|
|
{
|
|
struct symbol *sym;
|
|
|
|
if (next_frame)
|
|
sym = get_frame_function (next_frame);
|
|
else
|
|
sym = inline_skipped_symbol (inferior_ptid);
|
|
|
|
/* If frame is inline, it certainly has symbols. */
|
|
gdb_assert (sym);
|
|
|
|
symtab_and_line sal;
|
|
if (SYMBOL_LINE (sym) != 0)
|
|
{
|
|
sal.symtab = symbol_symtab (sym);
|
|
sal.line = SYMBOL_LINE (sym);
|
|
}
|
|
else
|
|
/* If the symbol does not have a location, we don't know where
|
|
the call site is. Do not pretend to. This is jarring, but
|
|
we can't do much better. */
|
|
sal.pc = get_frame_pc (frame);
|
|
|
|
sal.pspace = get_frame_program_space (frame);
|
|
return sal;
|
|
}
|
|
|
|
/* If FRAME is not the innermost frame, that normally means that
|
|
FRAME->pc points at the return instruction (which is *after* the
|
|
call instruction), and we want to get the line containing the
|
|
call (because the call is where the user thinks the program is).
|
|
However, if the next frame is either a SIGTRAMP_FRAME or a
|
|
DUMMY_FRAME, then the next frame will contain a saved interrupt
|
|
PC and such a PC indicates the current (rather than next)
|
|
instruction/line, consequently, for such cases, want to get the
|
|
line containing fi->pc. */
|
|
if (!get_frame_pc_if_available (frame, &pc))
|
|
return {};
|
|
|
|
notcurrent = (pc != get_frame_address_in_block (frame));
|
|
return find_pc_line (pc, notcurrent);
|
|
}
|
|
|
|
/* Per "frame.h", return the ``address'' of the frame. Code should
|
|
really be using get_frame_id(). */
|
|
CORE_ADDR
|
|
get_frame_base (struct frame_info *fi)
|
|
{
|
|
return get_frame_id (fi).stack_addr;
|
|
}
|
|
|
|
/* High-level offsets into the frame. Used by the debug info. */
|
|
|
|
CORE_ADDR
|
|
get_frame_base_address (struct frame_info *fi)
|
|
{
|
|
if (get_frame_type (fi) != NORMAL_FRAME)
|
|
return 0;
|
|
if (fi->base == NULL)
|
|
fi->base = frame_base_find_by_frame (fi);
|
|
/* Sneaky: If the low-level unwind and high-level base code share a
|
|
common unwinder, let them share the prologue cache. */
|
|
if (fi->base->unwind == fi->unwind)
|
|
return fi->base->this_base (fi, &fi->prologue_cache);
|
|
return fi->base->this_base (fi, &fi->base_cache);
|
|
}
|
|
|
|
CORE_ADDR
|
|
get_frame_locals_address (struct frame_info *fi)
|
|
{
|
|
if (get_frame_type (fi) != NORMAL_FRAME)
|
|
return 0;
|
|
/* If there isn't a frame address method, find it. */
|
|
if (fi->base == NULL)
|
|
fi->base = frame_base_find_by_frame (fi);
|
|
/* Sneaky: If the low-level unwind and high-level base code share a
|
|
common unwinder, let them share the prologue cache. */
|
|
if (fi->base->unwind == fi->unwind)
|
|
return fi->base->this_locals (fi, &fi->prologue_cache);
|
|
return fi->base->this_locals (fi, &fi->base_cache);
|
|
}
|
|
|
|
CORE_ADDR
|
|
get_frame_args_address (struct frame_info *fi)
|
|
{
|
|
if (get_frame_type (fi) != NORMAL_FRAME)
|
|
return 0;
|
|
/* If there isn't a frame address method, find it. */
|
|
if (fi->base == NULL)
|
|
fi->base = frame_base_find_by_frame (fi);
|
|
/* Sneaky: If the low-level unwind and high-level base code share a
|
|
common unwinder, let them share the prologue cache. */
|
|
if (fi->base->unwind == fi->unwind)
|
|
return fi->base->this_args (fi, &fi->prologue_cache);
|
|
return fi->base->this_args (fi, &fi->base_cache);
|
|
}
|
|
|
|
/* Return true if the frame unwinder for frame FI is UNWINDER; false
|
|
otherwise. */
|
|
|
|
int
|
|
frame_unwinder_is (struct frame_info *fi, const struct frame_unwind *unwinder)
|
|
{
|
|
if (fi->unwind == NULL)
|
|
frame_unwind_find_by_frame (fi, &fi->prologue_cache);
|
|
return fi->unwind == unwinder;
|
|
}
|
|
|
|
/* Level of the selected frame: 0 for innermost, 1 for its caller, ...
|
|
or -1 for a NULL frame. */
|
|
|
|
int
|
|
frame_relative_level (struct frame_info *fi)
|
|
{
|
|
if (fi == NULL)
|
|
return -1;
|
|
else
|
|
return fi->level;
|
|
}
|
|
|
|
enum frame_type
|
|
get_frame_type (struct frame_info *frame)
|
|
{
|
|
if (frame->unwind == NULL)
|
|
/* Initialize the frame's unwinder because that's what
|
|
provides the frame's type. */
|
|
frame_unwind_find_by_frame (frame, &frame->prologue_cache);
|
|
return frame->unwind->type;
|
|
}
|
|
|
|
struct program_space *
|
|
get_frame_program_space (struct frame_info *frame)
|
|
{
|
|
return frame->pspace;
|
|
}
|
|
|
|
struct program_space *
|
|
frame_unwind_program_space (struct frame_info *this_frame)
|
|
{
|
|
gdb_assert (this_frame);
|
|
|
|
/* This is really a placeholder to keep the API consistent --- we
|
|
assume for now that we don't have frame chains crossing
|
|
spaces. */
|
|
return this_frame->pspace;
|
|
}
|
|
|
|
const address_space *
|
|
get_frame_address_space (struct frame_info *frame)
|
|
{
|
|
return frame->aspace;
|
|
}
|
|
|
|
/* Memory access methods. */
|
|
|
|
void
|
|
get_frame_memory (struct frame_info *this_frame, CORE_ADDR addr,
|
|
gdb_byte *buf, int len)
|
|
{
|
|
read_memory (addr, buf, len);
|
|
}
|
|
|
|
LONGEST
|
|
get_frame_memory_signed (struct frame_info *this_frame, CORE_ADDR addr,
|
|
int len)
|
|
{
|
|
struct gdbarch *gdbarch = get_frame_arch (this_frame);
|
|
enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
|
|
|
|
return read_memory_integer (addr, len, byte_order);
|
|
}
|
|
|
|
ULONGEST
|
|
get_frame_memory_unsigned (struct frame_info *this_frame, CORE_ADDR addr,
|
|
int len)
|
|
{
|
|
struct gdbarch *gdbarch = get_frame_arch (this_frame);
|
|
enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
|
|
|
|
return read_memory_unsigned_integer (addr, len, byte_order);
|
|
}
|
|
|
|
int
|
|
safe_frame_unwind_memory (struct frame_info *this_frame,
|
|
CORE_ADDR addr, gdb_byte *buf, int len)
|
|
{
|
|
/* NOTE: target_read_memory returns zero on success! */
|
|
return !target_read_memory (addr, buf, len);
|
|
}
|
|
|
|
/* Architecture methods. */
|
|
|
|
struct gdbarch *
|
|
get_frame_arch (struct frame_info *this_frame)
|
|
{
|
|
return frame_unwind_arch (this_frame->next);
|
|
}
|
|
|
|
struct gdbarch *
|
|
frame_unwind_arch (struct frame_info *next_frame)
|
|
{
|
|
if (!next_frame->prev_arch.p)
|
|
{
|
|
struct gdbarch *arch;
|
|
|
|
if (next_frame->unwind == NULL)
|
|
frame_unwind_find_by_frame (next_frame, &next_frame->prologue_cache);
|
|
|
|
if (next_frame->unwind->prev_arch != NULL)
|
|
arch = next_frame->unwind->prev_arch (next_frame,
|
|
&next_frame->prologue_cache);
|
|
else
|
|
arch = get_frame_arch (next_frame);
|
|
|
|
next_frame->prev_arch.arch = arch;
|
|
next_frame->prev_arch.p = 1;
|
|
if (frame_debug)
|
|
fprintf_unfiltered (gdb_stdlog,
|
|
"{ frame_unwind_arch (next_frame=%d) -> %s }\n",
|
|
next_frame->level,
|
|
gdbarch_bfd_arch_info (arch)->printable_name);
|
|
}
|
|
|
|
return next_frame->prev_arch.arch;
|
|
}
|
|
|
|
struct gdbarch *
|
|
frame_unwind_caller_arch (struct frame_info *next_frame)
|
|
{
|
|
next_frame = skip_artificial_frames (next_frame);
|
|
|
|
/* We must have a non-artificial frame. The caller is supposed to check
|
|
the result of frame_unwind_caller_id (), which returns NULL_FRAME_ID
|
|
in this case. */
|
|
gdb_assert (next_frame != NULL);
|
|
|
|
return frame_unwind_arch (next_frame);
|
|
}
|
|
|
|
/* Gets the language of FRAME. */
|
|
|
|
enum language
|
|
get_frame_language (struct frame_info *frame)
|
|
{
|
|
CORE_ADDR pc = 0;
|
|
int pc_p = 0;
|
|
|
|
gdb_assert (frame!= NULL);
|
|
|
|
/* We determine the current frame language by looking up its
|
|
associated symtab. To retrieve this symtab, we use the frame
|
|
PC. However we cannot use the frame PC as is, because it
|
|
usually points to the instruction following the "call", which
|
|
is sometimes the first instruction of another function. So
|
|
we rely on get_frame_address_in_block(), it provides us with
|
|
a PC that is guaranteed to be inside the frame's code
|
|
block. */
|
|
|
|
TRY
|
|
{
|
|
pc = get_frame_address_in_block (frame);
|
|
pc_p = 1;
|
|
}
|
|
CATCH (ex, RETURN_MASK_ERROR)
|
|
{
|
|
if (ex.error != NOT_AVAILABLE_ERROR)
|
|
throw_exception (ex);
|
|
}
|
|
END_CATCH
|
|
|
|
if (pc_p)
|
|
{
|
|
struct compunit_symtab *cust = find_pc_compunit_symtab (pc);
|
|
|
|
if (cust != NULL)
|
|
return compunit_language (cust);
|
|
}
|
|
|
|
return language_unknown;
|
|
}
|
|
|
|
/* Stack pointer methods. */
|
|
|
|
CORE_ADDR
|
|
get_frame_sp (struct frame_info *this_frame)
|
|
{
|
|
struct gdbarch *gdbarch = get_frame_arch (this_frame);
|
|
|
|
/* Normality - an architecture that provides a way of obtaining any
|
|
frame inner-most address. */
|
|
if (gdbarch_unwind_sp_p (gdbarch))
|
|
/* NOTE drow/2008-06-28: gdbarch_unwind_sp could be converted to
|
|
operate on THIS_FRAME now. */
|
|
return gdbarch_unwind_sp (gdbarch, this_frame->next);
|
|
/* Now things are really are grim. Hope that the value returned by
|
|
the gdbarch_sp_regnum register is meaningful. */
|
|
if (gdbarch_sp_regnum (gdbarch) >= 0)
|
|
return get_frame_register_unsigned (this_frame,
|
|
gdbarch_sp_regnum (gdbarch));
|
|
internal_error (__FILE__, __LINE__, _("Missing unwind SP method"));
|
|
}
|
|
|
|
/* Return the reason why we can't unwind past FRAME. */
|
|
|
|
enum unwind_stop_reason
|
|
get_frame_unwind_stop_reason (struct frame_info *frame)
|
|
{
|
|
/* Fill-in STOP_REASON. */
|
|
get_prev_frame_always (frame);
|
|
gdb_assert (frame->prev_p);
|
|
|
|
return frame->stop_reason;
|
|
}
|
|
|
|
/* Return a string explaining REASON. */
|
|
|
|
const char *
|
|
unwind_stop_reason_to_string (enum unwind_stop_reason reason)
|
|
{
|
|
switch (reason)
|
|
{
|
|
#define SET(name, description) \
|
|
case name: return _(description);
|
|
#include "unwind_stop_reasons.def"
|
|
#undef SET
|
|
|
|
default:
|
|
internal_error (__FILE__, __LINE__,
|
|
"Invalid frame stop reason");
|
|
}
|
|
}
|
|
|
|
const char *
|
|
frame_stop_reason_string (struct frame_info *fi)
|
|
{
|
|
gdb_assert (fi->prev_p);
|
|
gdb_assert (fi->prev == NULL);
|
|
|
|
/* Return the specific string if we have one. */
|
|
if (fi->stop_string != NULL)
|
|
return fi->stop_string;
|
|
|
|
/* Return the generic string if we have nothing better. */
|
|
return unwind_stop_reason_to_string (fi->stop_reason);
|
|
}
|
|
|
|
/* Return the enum symbol name of REASON as a string, to use in debug
|
|
output. */
|
|
|
|
static const char *
|
|
frame_stop_reason_symbol_string (enum unwind_stop_reason reason)
|
|
{
|
|
switch (reason)
|
|
{
|
|
#define SET(name, description) \
|
|
case name: return #name;
|
|
#include "unwind_stop_reasons.def"
|
|
#undef SET
|
|
|
|
default:
|
|
internal_error (__FILE__, __LINE__,
|
|
"Invalid frame stop reason");
|
|
}
|
|
}
|
|
|
|
/* Clean up after a failed (wrong unwinder) attempt to unwind past
|
|
FRAME. */
|
|
|
|
void
|
|
frame_cleanup_after_sniffer (struct frame_info *frame)
|
|
{
|
|
/* The sniffer should not allocate a prologue cache if it did not
|
|
match this frame. */
|
|
gdb_assert (frame->prologue_cache == NULL);
|
|
|
|
/* No sniffer should extend the frame chain; sniff based on what is
|
|
already certain. */
|
|
gdb_assert (!frame->prev_p);
|
|
|
|
/* The sniffer should not check the frame's ID; that's circular. */
|
|
gdb_assert (!frame->this_id.p);
|
|
|
|
/* Clear cached fields dependent on the unwinder.
|
|
|
|
The previous PC is independent of the unwinder, but the previous
|
|
function is not (see get_frame_address_in_block). */
|
|
frame->prev_func.p = 0;
|
|
frame->prev_func.addr = 0;
|
|
|
|
/* Discard the unwinder last, so that we can easily find it if an assertion
|
|
in this function triggers. */
|
|
frame->unwind = NULL;
|
|
}
|
|
|
|
/* Set FRAME's unwinder temporarily, so that we can call a sniffer.
|
|
If sniffing fails, the caller should be sure to call
|
|
frame_cleanup_after_sniffer. */
|
|
|
|
void
|
|
frame_prepare_for_sniffer (struct frame_info *frame,
|
|
const struct frame_unwind *unwind)
|
|
{
|
|
gdb_assert (frame->unwind == NULL);
|
|
frame->unwind = unwind;
|
|
}
|
|
|
|
static struct cmd_list_element *set_backtrace_cmdlist;
|
|
static struct cmd_list_element *show_backtrace_cmdlist;
|
|
|
|
static void
|
|
set_backtrace_cmd (const char *args, int from_tty)
|
|
{
|
|
help_list (set_backtrace_cmdlist, "set backtrace ", all_commands,
|
|
gdb_stdout);
|
|
}
|
|
|
|
static void
|
|
show_backtrace_cmd (const char *args, int from_tty)
|
|
{
|
|
cmd_show_list (show_backtrace_cmdlist, from_tty, "");
|
|
}
|
|
|
|
void
|
|
_initialize_frame (void)
|
|
{
|
|
obstack_init (&frame_cache_obstack);
|
|
|
|
frame_stash_create ();
|
|
|
|
gdb::observers::target_changed.attach (frame_observer_target_changed);
|
|
|
|
add_prefix_cmd ("backtrace", class_maintenance, set_backtrace_cmd, _("\
|
|
Set backtrace specific variables.\n\
|
|
Configure backtrace variables such as the backtrace limit"),
|
|
&set_backtrace_cmdlist, "set backtrace ",
|
|
0/*allow-unknown*/, &setlist);
|
|
add_prefix_cmd ("backtrace", class_maintenance, show_backtrace_cmd, _("\
|
|
Show backtrace specific variables\n\
|
|
Show backtrace variables such as the backtrace limit"),
|
|
&show_backtrace_cmdlist, "show backtrace ",
|
|
0/*allow-unknown*/, &showlist);
|
|
|
|
add_setshow_boolean_cmd ("past-main", class_obscure,
|
|
&backtrace_past_main, _("\
|
|
Set whether backtraces should continue past \"main\"."), _("\
|
|
Show whether backtraces should continue past \"main\"."), _("\
|
|
Normally the caller of \"main\" is not of interest, so GDB will terminate\n\
|
|
the backtrace at \"main\". Set this variable if you need to see the rest\n\
|
|
of the stack trace."),
|
|
NULL,
|
|
show_backtrace_past_main,
|
|
&set_backtrace_cmdlist,
|
|
&show_backtrace_cmdlist);
|
|
|
|
add_setshow_boolean_cmd ("past-entry", class_obscure,
|
|
&backtrace_past_entry, _("\
|
|
Set whether backtraces should continue past the entry point of a program."),
|
|
_("\
|
|
Show whether backtraces should continue past the entry point of a program."),
|
|
_("\
|
|
Normally there are no callers beyond the entry point of a program, so GDB\n\
|
|
will terminate the backtrace there. Set this variable if you need to see\n\
|
|
the rest of the stack trace."),
|
|
NULL,
|
|
show_backtrace_past_entry,
|
|
&set_backtrace_cmdlist,
|
|
&show_backtrace_cmdlist);
|
|
|
|
add_setshow_uinteger_cmd ("limit", class_obscure,
|
|
&backtrace_limit, _("\
|
|
Set an upper bound on the number of backtrace levels."), _("\
|
|
Show the upper bound on the number of backtrace levels."), _("\
|
|
No more than the specified number of frames can be displayed or examined.\n\
|
|
Literal \"unlimited\" or zero means no limit."),
|
|
NULL,
|
|
show_backtrace_limit,
|
|
&set_backtrace_cmdlist,
|
|
&show_backtrace_cmdlist);
|
|
|
|
/* Debug this files internals. */
|
|
add_setshow_zuinteger_cmd ("frame", class_maintenance, &frame_debug, _("\
|
|
Set frame debugging."), _("\
|
|
Show frame debugging."), _("\
|
|
When non-zero, frame specific internal debugging is enabled."),
|
|
NULL,
|
|
show_frame_debug,
|
|
&setdebuglist, &showdebuglist);
|
|
}
|