1 /* Program and address space management, for GDB, the GNU debugger.
3 Copyright (C) 2009-2014 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)
47 /* An address space. It is used for comparing if pspaces/inferior/threads
48 see the same address space and for associating caches to each address
55 /* Per aspace data-pointers required by other GDB modules. */
59 /* Keep a registry of per-address_space data-pointers required by other GDB
62 DEFINE_REGISTRY (address_space, REGISTRY_ACCESS_FIELD)
66 /* Create a new address space object, and add it to the list. */
68 struct address_space *
69 new_address_space (void)
71 struct address_space *aspace;
73 aspace = XCNEW (struct address_space);
74 aspace->num = ++highest_address_space_num;
75 address_space_alloc_data (aspace);
80 /* Maybe create a new address space object, and add it to the list, or
81 return a pointer to an existing address space, in case inferiors
82 share an address space on this target system. */
84 struct address_space *
85 maybe_new_address_space (void)
87 int shared_aspace = gdbarch_has_shared_address_space (target_gdbarch ());
91 /* Just return the first in the list. */
92 return program_spaces->aspace;
95 return new_address_space ();
99 free_address_space (struct address_space *aspace)
101 address_space_free_data (aspace);
106 address_space_num (struct address_space *aspace)
111 /* Start counting over from scratch. */
114 init_address_spaces (void)
116 highest_address_space_num = 0;
121 /* Adds a new empty program space to the program space list, and binds
122 it to ASPACE. Returns the pointer to the new object. */
124 struct program_space *
125 add_program_space (struct address_space *aspace)
127 struct program_space *pspace;
129 pspace = XCNEW (struct program_space);
131 pspace->num = ++last_program_space_num;
132 pspace->aspace = aspace;
134 program_space_alloc_data (pspace);
136 pspace->next = program_spaces;
137 program_spaces = pspace;
142 /* Releases program space PSPACE, and all its contents (shared
143 libraries, objfiles, and any other references to the PSPACE in
144 other modules). It is an internal error to call this when PSPACE
145 is the current program space, since there should always be a
149 release_program_space (struct program_space *pspace)
151 struct cleanup *old_chain = save_current_program_space ();
153 gdb_assert (pspace != current_program_space);
155 set_current_program_space (pspace);
157 breakpoint_program_space_exit (pspace);
158 no_shared_libraries (NULL, 0);
160 free_all_objfiles ();
161 if (!gdbarch_has_shared_address_space (target_gdbarch ()))
162 free_address_space (pspace->aspace);
163 resize_section_table (&pspace->target_sections,
164 -resize_section_table (&pspace->target_sections, 0));
165 clear_program_space_solib_cache (pspace);
166 /* Discard any data modules have associated with the PSPACE. */
167 program_space_free_data (pspace);
170 do_cleanups (old_chain);
173 /* Copies program space SRC to DEST. Copies the main executable file,
174 and the main symbol file. Returns DEST. */
176 struct program_space *
177 clone_program_space (struct program_space *dest, struct program_space *src)
179 struct cleanup *old_chain;
181 old_chain = save_current_program_space ();
183 set_current_program_space (dest);
185 if (src->pspace_exec_filename != NULL)
186 exec_file_attach (src->pspace_exec_filename, 0);
188 if (src->symfile_object_file != NULL)
189 symbol_file_add_main (objfile_name (src->symfile_object_file), 0);
191 do_cleanups (old_chain);
195 /* Sets PSPACE as the current program space. It is the caller's
196 responsibility to make sure that the currently selected
197 inferior/thread matches the selected program space. */
200 set_current_program_space (struct program_space *pspace)
202 if (current_program_space == pspace)
205 gdb_assert (pspace != NULL);
207 current_program_space = pspace;
209 /* Different symbols change our view of the frame chain. */
210 reinit_frame_cache ();
213 /* A cleanups callback, helper for save_current_program_space
217 restore_program_space (void *arg)
219 struct program_space *saved_pspace = arg;
221 set_current_program_space (saved_pspace);
224 /* Save the current program space so that it may be restored by a later
225 call to do_cleanups. Returns the struct cleanup pointer needed for
226 later doing the cleanup. */
229 save_current_program_space (void)
231 struct cleanup *old_chain = make_cleanup (restore_program_space,
232 current_program_space);
237 /* Returns true iff there's no inferior bound to PSPACE. */
240 pspace_empty_p (struct program_space *pspace)
242 if (find_inferior_for_program_space (pspace) != NULL)
248 /* Prune away automatically added program spaces that aren't required
252 prune_program_spaces (void)
254 struct program_space *ss, **ss_link;
255 struct program_space *current = current_program_space;
258 ss_link = &program_spaces;
261 if (ss == current || !pspace_empty_p (ss))
269 release_program_space (ss);
274 /* Prints the list of program spaces and their details on UIOUT. If
275 REQUESTED is not -1, it's the ID of the pspace that should be
276 printed. Otherwise, all spaces are printed. */
279 print_program_space (struct ui_out *uiout, int requested)
281 struct program_space *pspace;
283 struct cleanup *old_chain;
285 /* Might as well prune away unneeded ones, so the user doesn't even
287 prune_program_spaces ();
289 /* Compute number of pspaces we will print. */
292 if (requested != -1 && pspace->num != requested)
298 /* There should always be at least one. */
299 gdb_assert (count > 0);
301 old_chain = make_cleanup_ui_out_table_begin_end (uiout, 3, count, "pspaces");
302 ui_out_table_header (uiout, 1, ui_left, "current", "");
303 ui_out_table_header (uiout, 4, ui_left, "id", "Id");
304 ui_out_table_header (uiout, 17, ui_left, "exec", "Executable");
305 ui_out_table_body (uiout);
309 struct cleanup *chain2;
310 struct inferior *inf;
313 if (requested != -1 && requested != pspace->num)
316 chain2 = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
318 if (pspace == current_program_space)
319 ui_out_field_string (uiout, "current", "*");
321 ui_out_field_skip (uiout, "current");
323 ui_out_field_int (uiout, "id", pspace->num);
325 if (pspace->pspace_exec_filename)
326 ui_out_field_string (uiout, "exec", pspace->pspace_exec_filename);
328 ui_out_field_skip (uiout, "exec");
330 /* Print extra info that doesn't really fit in tabular form.
331 Currently, we print the list of inferiors bound to a pspace.
332 There can be more than one inferior bound to the same pspace,
333 e.g., both parent/child inferiors in a vfork, or, on targets
334 that share pspaces between inferiors. */
336 for (inf = inferior_list; inf; inf = inf->next)
337 if (inf->pspace == pspace)
342 printf_filtered ("\n\tBound inferiors: ID %d (%s)",
344 target_pid_to_str (pid_to_ptid (inf->pid)));
347 printf_filtered (", ID %d (%s)",
349 target_pid_to_str (pid_to_ptid (inf->pid)));
352 ui_out_text (uiout, "\n");
353 do_cleanups (chain2);
356 do_cleanups (old_chain);
359 /* Boolean test for an already-known program space id. */
362 valid_program_space_id (int num)
364 struct program_space *pspace;
367 if (pspace->num == num)
373 /* If ARGS is NULL or empty, print information about all program
374 spaces. Otherwise, ARGS is a text representation of a LONG
375 indicating which the program space to print information about. */
378 maintenance_info_program_spaces_command (char *args, int from_tty)
384 requested = parse_and_eval_long (args);
385 if (!valid_program_space_id (requested))
386 error (_("program space ID %d not known."), requested);
389 print_program_space (current_uiout, requested);
392 /* Simply returns the count of program spaces. */
395 number_of_program_spaces (void)
397 struct program_space *pspace;
406 /* Update all program spaces matching to address spaces. The user may
407 have created several program spaces, and loaded executables into
408 them before connecting to the target interface that will create the
409 inferiors. All that happens before GDB has a chance to know if the
410 inferiors will share an address space or not. Call this after
411 having connected to the target interface and having fetched the
412 target description, to fixup the program/address spaces mappings.
414 It is assumed that there are no bound inferiors yet, otherwise,
415 they'd be left with stale referenced to released aspaces. */
418 update_address_spaces (void)
420 int shared_aspace = gdbarch_has_shared_address_space (target_gdbarch ());
421 struct program_space *pspace;
422 struct inferior *inf;
424 init_address_spaces ();
428 struct address_space *aspace = new_address_space ();
430 free_address_space (current_program_space->aspace);
432 pspace->aspace = aspace;
437 free_address_space (pspace->aspace);
438 pspace->aspace = new_address_space ();
441 for (inf = inferior_list; inf; inf = inf->next)
442 if (gdbarch_has_global_solist (target_gdbarch ()))
443 inf->aspace = maybe_new_address_space ();
445 inf->aspace = inf->pspace->aspace;
448 /* Save the current program space so that it may be restored by a later
449 call to do_cleanups. Returns the struct cleanup pointer needed for
450 later doing the cleanup. */
453 save_current_space_and_thread (void)
455 struct cleanup *old_chain;
457 /* If restoring to null thread, we need to restore the pspace as
458 well, hence, we need to save the current program space first. */
459 old_chain = save_current_program_space ();
460 /* There's no need to save the current inferior here.
461 That is handled by make_cleanup_restore_current_thread. */
462 make_cleanup_restore_current_thread ();
467 /* Switches full context to program space PSPACE. Switches to the
468 first thread found bound to PSPACE. */
471 switch_to_program_space_and_thread (struct program_space *pspace)
473 struct inferior *inf;
475 inf = find_inferior_for_program_space (pspace);
478 struct thread_info *tp;
480 tp = any_live_thread_of_process (inf->pid);
483 switch_to_thread (tp->ptid);
484 /* Switching thread switches pspace implicitly. We're
490 switch_to_thread (null_ptid);
491 set_current_program_space (pspace);
496 /* See progspace.h. */
499 clear_program_space_solib_cache (struct program_space *pspace)
501 VEC_free (so_list_ptr, pspace->added_solibs);
503 free_char_ptr_vec (pspace->deleted_solibs);
504 pspace->deleted_solibs = NULL;
510 initialize_progspace (void)
512 add_cmd ("program-spaces", class_maintenance,
513 maintenance_info_program_spaces_command,
514 _("Info about currently known program spaces."),
515 &maintenanceinfolist);
517 /* There's always one program space. Note that this function isn't
518 an automatic _initialize_foo function, since other
519 _initialize_foo routines may need to install their per-pspace
520 data keys. We can only allocate a progspace when all those
521 modules have done that. Do this before
522 initialize_current_architecture, because that accesses exec_bfd,
523 which in turn dereferences current_program_space. */
524 current_program_space = add_program_space (new_address_space ());