1 /* Program and address space management, for GDB, the GNU debugger.
3 Copyright (C) 2009-2013 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
23 #include "arch-utils.h"
26 #include "gdbthread.h"
28 /* The last program space number assigned. */
29 int last_program_space_num = 0;
31 /* The head of the program spaces list. */
32 struct program_space *program_spaces;
34 /* Pointer to the current program space. */
35 struct program_space *current_program_space;
37 /* The last address space number assigned. */
38 static int highest_address_space_num;
42 /* Keep a registry of per-program_space data-pointers required by other GDB
45 DEFINE_REGISTRY (program_space, REGISTRY_ACCESS_FIELD)
49 /* An address space. Currently this is not used for much other than
50 for comparing if pspaces/inferior/threads see the same address
58 /* Create a new address space object, and add it to the list. */
60 struct address_space *
61 new_address_space (void)
63 struct address_space *aspace;
65 aspace = XZALLOC (struct address_space);
66 aspace->num = ++highest_address_space_num;
71 /* Maybe create a new address space object, and add it to the list, or
72 return a pointer to an existing address space, in case inferiors
73 share an address space on this target system. */
75 struct address_space *
76 maybe_new_address_space (void)
78 int shared_aspace = gdbarch_has_shared_address_space (target_gdbarch ());
82 /* Just return the first in the list. */
83 return program_spaces->aspace;
86 return new_address_space ();
90 free_address_space (struct address_space *aspace)
96 address_space_num (struct address_space *aspace)
101 /* Start counting over from scratch. */
104 init_address_spaces (void)
106 highest_address_space_num = 0;
111 /* Adds a new empty program space to the program space list, and binds
112 it to ASPACE. Returns the pointer to the new object. */
114 struct program_space *
115 add_program_space (struct address_space *aspace)
117 struct program_space *pspace;
119 pspace = XZALLOC (struct program_space);
121 pspace->num = ++last_program_space_num;
122 pspace->aspace = aspace;
124 program_space_alloc_data (pspace);
126 pspace->next = program_spaces;
127 program_spaces = pspace;
132 /* Releases program space PSPACE, and all its contents (shared
133 libraries, objfiles, and any other references to the PSPACE in
134 other modules). It is an internal error to call this when PSPACE
135 is the current program space, since there should always be a
139 release_program_space (struct program_space *pspace)
141 struct cleanup *old_chain = save_current_program_space ();
143 gdb_assert (pspace != current_program_space);
145 set_current_program_space (pspace);
147 breakpoint_program_space_exit (pspace);
148 no_shared_libraries (NULL, 0);
150 free_all_objfiles ();
151 if (!gdbarch_has_shared_address_space (target_gdbarch ()))
152 free_address_space (pspace->aspace);
153 resize_section_table (&pspace->target_sections,
154 -resize_section_table (&pspace->target_sections, 0));
155 clear_program_space_solib_cache (pspace);
156 /* Discard any data modules have associated with the PSPACE. */
157 program_space_free_data (pspace);
160 do_cleanups (old_chain);
163 /* Unlinks PSPACE from the pspace list, and releases it. */
166 remove_program_space (struct program_space *pspace)
168 struct program_space *ss, **ss_link;
171 ss_link = &program_spaces;
182 release_program_space (ss);
187 /* Copies program space SRC to DEST. Copies the main executable file,
188 and the main symbol file. Returns DEST. */
190 struct program_space *
191 clone_program_space (struct program_space *dest, struct program_space *src)
193 struct cleanup *old_chain;
195 old_chain = save_current_program_space ();
197 set_current_program_space (dest);
199 if (src->ebfd != NULL)
200 exec_file_attach (bfd_get_filename (src->ebfd), 0);
202 if (src->symfile_object_file != NULL)
203 symbol_file_add_main (src->symfile_object_file->name, 0);
205 do_cleanups (old_chain);
209 /* Sets PSPACE as the current program space. It is the caller's
210 responsibility to make sure that the currently selected
211 inferior/thread matches the selected program space. */
214 set_current_program_space (struct program_space *pspace)
216 if (current_program_space == pspace)
219 gdb_assert (pspace != NULL);
221 current_program_space = pspace;
223 /* Different symbols change our view of the frame chain. */
224 reinit_frame_cache ();
227 /* A cleanups callback, helper for save_current_program_space
231 restore_program_space (void *arg)
233 struct program_space *saved_pspace = arg;
235 set_current_program_space (saved_pspace);
238 /* Save the current program space so that it may be restored by a later
239 call to do_cleanups. Returns the struct cleanup pointer needed for
240 later doing the cleanup. */
243 save_current_program_space (void)
245 struct cleanup *old_chain = make_cleanup (restore_program_space,
246 current_program_space);
251 /* Returns true iff there's no inferior bound to PSPACE. */
254 pspace_empty_p (struct program_space *pspace)
256 if (find_inferior_for_program_space (pspace) != NULL)
262 /* Prune away automatically added program spaces that aren't required
266 prune_program_spaces (void)
268 struct program_space *ss, **ss_link;
269 struct program_space *current = current_program_space;
272 ss_link = &program_spaces;
275 if (ss == current || !pspace_empty_p (ss))
283 release_program_space (ss);
288 /* Prints the list of program spaces and their details on UIOUT. If
289 REQUESTED is not -1, it's the ID of the pspace that should be
290 printed. Otherwise, all spaces are printed. */
293 print_program_space (struct ui_out *uiout, int requested)
295 struct program_space *pspace;
297 struct cleanup *old_chain;
299 /* Might as well prune away unneeded ones, so the user doesn't even
301 prune_program_spaces ();
303 /* Compute number of pspaces we will print. */
306 if (requested != -1 && pspace->num != requested)
312 /* There should always be at least one. */
313 gdb_assert (count > 0);
315 old_chain = make_cleanup_ui_out_table_begin_end (uiout, 3, count, "pspaces");
316 ui_out_table_header (uiout, 1, ui_left, "current", "");
317 ui_out_table_header (uiout, 4, ui_left, "id", "Id");
318 ui_out_table_header (uiout, 17, ui_left, "exec", "Executable");
319 ui_out_table_body (uiout);
323 struct cleanup *chain2;
324 struct inferior *inf;
327 if (requested != -1 && requested != pspace->num)
330 chain2 = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
332 if (pspace == current_program_space)
333 ui_out_field_string (uiout, "current", "*");
335 ui_out_field_skip (uiout, "current");
337 ui_out_field_int (uiout, "id", pspace->num);
340 ui_out_field_string (uiout, "exec",
341 bfd_get_filename (pspace->ebfd));
343 ui_out_field_skip (uiout, "exec");
345 /* Print extra info that doesn't really fit in tabular form.
346 Currently, we print the list of inferiors bound to a pspace.
347 There can be more than one inferior bound to the same pspace,
348 e.g., both parent/child inferiors in a vfork, or, on targets
349 that share pspaces between inferiors. */
351 for (inf = inferior_list; inf; inf = inf->next)
352 if (inf->pspace == pspace)
357 printf_filtered ("\n\tBound inferiors: ID %d (%s)",
359 target_pid_to_str (pid_to_ptid (inf->pid)));
362 printf_filtered (", ID %d (%s)",
364 target_pid_to_str (pid_to_ptid (inf->pid)));
367 ui_out_text (uiout, "\n");
368 do_cleanups (chain2);
371 do_cleanups (old_chain);
374 /* Boolean test for an already-known program space id. */
377 valid_program_space_id (int num)
379 struct program_space *pspace;
382 if (pspace->num == num)
388 /* If ARGS is NULL or empty, print information about all program
389 spaces. Otherwise, ARGS is a text representation of a LONG
390 indicating which the program space to print information about. */
393 maintenance_info_program_spaces_command (char *args, int from_tty)
399 requested = parse_and_eval_long (args);
400 if (!valid_program_space_id (requested))
401 error (_("program space ID %d not known."), requested);
404 print_program_space (current_uiout, requested);
407 /* Simply returns the count of program spaces. */
410 number_of_program_spaces (void)
412 struct program_space *pspace;
421 /* Update all program spaces matching to address spaces. The user may
422 have created several program spaces, and loaded executables into
423 them before connecting to the target interface that will create the
424 inferiors. All that happens before GDB has a chance to know if the
425 inferiors will share an address space or not. Call this after
426 having connected to the target interface and having fetched the
427 target description, to fixup the program/address spaces mappings.
429 It is assumed that there are no bound inferiors yet, otherwise,
430 they'd be left with stale referenced to released aspaces. */
433 update_address_spaces (void)
435 int shared_aspace = gdbarch_has_shared_address_space (target_gdbarch ());
436 struct program_space *pspace;
437 struct inferior *inf;
439 init_address_spaces ();
443 struct address_space *aspace = new_address_space ();
445 free_address_space (current_program_space->aspace);
447 pspace->aspace = aspace;
452 free_address_space (pspace->aspace);
453 pspace->aspace = new_address_space ();
456 for (inf = inferior_list; inf; inf = inf->next)
457 if (gdbarch_has_global_solist (target_gdbarch ()))
458 inf->aspace = maybe_new_address_space ();
460 inf->aspace = inf->pspace->aspace;
463 /* Save the current program space so that it may be restored by a later
464 call to do_cleanups. Returns the struct cleanup pointer needed for
465 later doing the cleanup. */
468 save_current_space_and_thread (void)
470 struct cleanup *old_chain;
472 /* If restoring to null thread, we need to restore the pspace as
473 well, hence, we need to save the current program space first. */
474 old_chain = save_current_program_space ();
475 save_current_inferior ();
476 make_cleanup_restore_current_thread ();
481 /* Switches full context to program space PSPACE. Switches to the
482 first thread found bound to PSPACE. */
485 switch_to_program_space_and_thread (struct program_space *pspace)
487 struct inferior *inf;
489 inf = find_inferior_for_program_space (pspace);
492 struct thread_info *tp;
494 tp = any_live_thread_of_process (inf->pid);
497 switch_to_thread (tp->ptid);
498 /* Switching thread switches pspace implicitly. We're
504 switch_to_thread (null_ptid);
505 set_current_program_space (pspace);
510 /* See progspace.h. */
513 clear_program_space_solib_cache (struct program_space *pspace)
515 VEC_free (so_list_ptr, pspace->added_solibs);
517 free_char_ptr_vec (pspace->deleted_solibs);
518 pspace->deleted_solibs = NULL;
524 initialize_progspace (void)
526 add_cmd ("program-spaces", class_maintenance,
527 maintenance_info_program_spaces_command,
528 _("Info about currently known program spaces."),
529 &maintenanceinfolist);
531 /* There's always one program space. Note that this function isn't
532 an automatic _initialize_foo function, since other
533 _initialize_foo routines may need to install their per-pspace
534 data keys. We can only allocate a progspace when all those
535 modules have done that. Do this before
536 initialize_current_architecture, because that accesses exec_bfd,
537 which in turn dereferences current_program_space. */
538 current_program_space = add_program_space (new_address_space ());