Commit | Line | Data |
---|---|---|
fb40c209 | 1 | /* MI Command Set. |
cd0bfa36 | 2 | |
28e7fd62 | 3 | Copyright (C) 2000-2013 Free Software Foundation, Inc. |
cd0bfa36 | 4 | |
ab91fdd5 | 5 | Contributed by Cygnus Solutions (a Red Hat company). |
fb40c209 AC |
6 | |
7 | This file is part of GDB. | |
8 | ||
9 | This program is free software; you can redistribute it and/or modify | |
10 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 11 | the Free Software Foundation; either version 3 of the License, or |
fb40c209 AC |
12 | (at your option) any later version. |
13 | ||
14 | This program is distributed in the hope that it will be useful, | |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
a9762ec7 | 20 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
fb40c209 | 21 | |
fb40c209 | 22 | #include "defs.h" |
e17c207e | 23 | #include "arch-utils.h" |
fb40c209 AC |
24 | #include "target.h" |
25 | #include "inferior.h" | |
26 | #include "gdb_string.h" | |
60250e8b | 27 | #include "exceptions.h" |
fb40c209 AC |
28 | #include "top.h" |
29 | #include "gdbthread.h" | |
30 | #include "mi-cmds.h" | |
31 | #include "mi-parse.h" | |
32 | #include "mi-getopt.h" | |
33 | #include "mi-console.h" | |
34 | #include "ui-out.h" | |
35 | #include "mi-out.h" | |
4389a95a | 36 | #include "interps.h" |
fb40c209 AC |
37 | #include "event-loop.h" |
38 | #include "event-top.h" | |
41296c92 | 39 | #include "gdbcore.h" /* For write_memory(). */ |
56178203 | 40 | #include "value.h" |
4e052eda | 41 | #include "regcache.h" |
5b7f31a4 | 42 | #include "gdb.h" |
36dc181b | 43 | #include "frame.h" |
b9362cc7 | 44 | #include "mi-main.h" |
66bb093b | 45 | #include "mi-common.h" |
d8ca156b | 46 | #include "language.h" |
79a45b7d | 47 | #include "valprint.h" |
3ee1c036 | 48 | #include "inferior.h" |
07e059b5 | 49 | #include "osdata.h" |
dc146f7c | 50 | #include "splay-tree.h" |
f224b49d | 51 | #include "tracepoint.h" |
d0353e76 | 52 | #include "ctf.h" |
75082e8c | 53 | #include "ada-lang.h" |
f8eba3c6 | 54 | #include "linespec.h" |
0646da15 TT |
55 | #ifdef HAVE_PYTHON |
56 | #include "python/python-internal.h" | |
57 | #endif | |
36dc181b | 58 | |
fb40c209 AC |
59 | #include <ctype.h> |
60 | #include <sys/time.h> | |
61 | ||
d8c83789 NR |
62 | #if defined HAVE_SYS_RESOURCE_H |
63 | #include <sys/resource.h> | |
64 | #endif | |
65 | ||
66 | #ifdef HAVE_GETRUSAGE | |
67 | struct rusage rusage; | |
68 | #endif | |
69 | ||
fb40c209 AC |
70 | enum |
71 | { | |
72 | FROM_TTY = 0 | |
73 | }; | |
74 | ||
fb40c209 | 75 | int mi_debug_p; |
2b03b41d | 76 | |
fb40c209 AC |
77 | struct ui_file *raw_stdout; |
78 | ||
2b03b41d SS |
79 | /* This is used to pass the current command timestamp down to |
80 | continuation routines. */ | |
d8c83789 NR |
81 | static struct mi_timestamp *current_command_ts; |
82 | ||
83 | static int do_timings = 0; | |
84 | ||
a2840c35 | 85 | char *current_token; |
2b03b41d SS |
86 | /* Few commands would like to know if options like --thread-group were |
87 | explicitly specified. This variable keeps the current parsed | |
88 | command including all option, and make it possible. */ | |
a79b8f6e VP |
89 | static struct mi_parse *current_context; |
90 | ||
a2840c35 | 91 | int running_result_record_printed = 1; |
fb40c209 | 92 | |
f3b1572e PA |
93 | /* Flag indicating that the target has proceeded since the last |
94 | command was issued. */ | |
95 | int mi_proceeded; | |
96 | ||
fb40c209 | 97 | extern void _initialize_mi_main (void); |
ce8f13f8 | 98 | static void mi_cmd_execute (struct mi_parse *parse); |
fb40c209 | 99 | |
b2af646b AC |
100 | static void mi_execute_cli_command (const char *cmd, int args_p, |
101 | const char *args); | |
ce8f13f8 | 102 | static void mi_execute_async_cli_command (char *cli_command, |
9a2b4c1b | 103 | char **argv, int argc); |
6ed7ea50 UW |
104 | static int register_changed_p (int regnum, struct regcache *, |
105 | struct regcache *); | |
c898adb7 YQ |
106 | static void output_register (struct frame_info *, int regnum, int format, |
107 | int skip_unavailable); | |
4389a95a | 108 | |
41296c92 | 109 | /* Command implementations. FIXME: Is this libgdb? No. This is the MI |
fb40c209 | 110 | layer that calls libgdb. Any operation used in the below should be |
41296c92 | 111 | formalized. */ |
fb40c209 | 112 | |
d8c83789 NR |
113 | static void timestamp (struct mi_timestamp *tv); |
114 | ||
115 | static void print_diff_now (struct mi_timestamp *start); | |
116 | static void print_diff (struct mi_timestamp *start, struct mi_timestamp *end); | |
117 | ||
ce8f13f8 | 118 | void |
fb40c209 AC |
119 | mi_cmd_gdb_exit (char *command, char **argv, int argc) |
120 | { | |
41296c92 | 121 | /* We have to print everything right here because we never return. */ |
721c02de VP |
122 | if (current_token) |
123 | fputs_unfiltered (current_token, raw_stdout); | |
fb40c209 | 124 | fputs_unfiltered ("^exit\n", raw_stdout); |
79a45e25 | 125 | mi_out_put (current_uiout, raw_stdout); |
a6b29f87 | 126 | gdb_flush (raw_stdout); |
41296c92 | 127 | /* FIXME: The function called is not yet a formal libgdb function. */ |
fb40c209 | 128 | quit_force (NULL, FROM_TTY); |
fb40c209 AC |
129 | } |
130 | ||
ce8f13f8 | 131 | void |
9e22b03a | 132 | mi_cmd_exec_next (char *command, char **argv, int argc) |
fb40c209 | 133 | { |
41296c92 | 134 | /* FIXME: Should call a libgdb function, not a cli wrapper. */ |
e5829bee MS |
135 | if (argc > 0 && strcmp(argv[0], "--reverse") == 0) |
136 | mi_execute_async_cli_command ("reverse-next", argv + 1, argc - 1); | |
137 | else | |
138 | mi_execute_async_cli_command ("next", argv, argc); | |
fb40c209 AC |
139 | } |
140 | ||
ce8f13f8 | 141 | void |
9e22b03a | 142 | mi_cmd_exec_next_instruction (char *command, char **argv, int argc) |
fb40c209 | 143 | { |
41296c92 | 144 | /* FIXME: Should call a libgdb function, not a cli wrapper. */ |
e5829bee MS |
145 | if (argc > 0 && strcmp(argv[0], "--reverse") == 0) |
146 | mi_execute_async_cli_command ("reverse-nexti", argv + 1, argc - 1); | |
147 | else | |
148 | mi_execute_async_cli_command ("nexti", argv, argc); | |
fb40c209 AC |
149 | } |
150 | ||
ce8f13f8 | 151 | void |
9e22b03a | 152 | mi_cmd_exec_step (char *command, char **argv, int argc) |
fb40c209 | 153 | { |
41296c92 | 154 | /* FIXME: Should call a libgdb function, not a cli wrapper. */ |
e5829bee MS |
155 | if (argc > 0 && strcmp(argv[0], "--reverse") == 0) |
156 | mi_execute_async_cli_command ("reverse-step", argv + 1, argc - 1); | |
157 | else | |
158 | mi_execute_async_cli_command ("step", argv, argc); | |
fb40c209 AC |
159 | } |
160 | ||
ce8f13f8 | 161 | void |
9e22b03a | 162 | mi_cmd_exec_step_instruction (char *command, char **argv, int argc) |
fb40c209 | 163 | { |
41296c92 | 164 | /* FIXME: Should call a libgdb function, not a cli wrapper. */ |
e5829bee MS |
165 | if (argc > 0 && strcmp(argv[0], "--reverse") == 0) |
166 | mi_execute_async_cli_command ("reverse-stepi", argv + 1, argc - 1); | |
167 | else | |
168 | mi_execute_async_cli_command ("stepi", argv, argc); | |
fb40c209 AC |
169 | } |
170 | ||
ce8f13f8 | 171 | void |
9e22b03a | 172 | mi_cmd_exec_finish (char *command, char **argv, int argc) |
fb40c209 | 173 | { |
41296c92 | 174 | /* FIXME: Should call a libgdb function, not a cli wrapper. */ |
e5829bee MS |
175 | if (argc > 0 && strcmp(argv[0], "--reverse") == 0) |
176 | mi_execute_async_cli_command ("reverse-finish", argv + 1, argc - 1); | |
177 | else | |
178 | mi_execute_async_cli_command ("finish", argv, argc); | |
fb40c209 AC |
179 | } |
180 | ||
ce8f13f8 | 181 | void |
9e22b03a | 182 | mi_cmd_exec_return (char *command, char **argv, int argc) |
fb40c209 | 183 | { |
fb40c209 | 184 | /* This command doesn't really execute the target, it just pops the |
2b03b41d | 185 | specified number of frames. */ |
9e22b03a | 186 | if (argc) |
fb40c209 | 187 | /* Call return_command with from_tty argument equal to 0 so as to |
41296c92 | 188 | avoid being queried. */ |
9e22b03a | 189 | return_command (*argv, 0); |
fb40c209 AC |
190 | else |
191 | /* Call return_command with from_tty argument equal to 0 so as to | |
41296c92 | 192 | avoid being queried. */ |
36dc181b | 193 | return_command (NULL, 0); |
fb40c209 AC |
194 | |
195 | /* Because we have called return_command with from_tty = 0, we need | |
41296c92 | 196 | to print the frame here. */ |
08d72866 | 197 | print_stack_frame (get_selected_frame (NULL), 1, LOC_AND_ADDRESS, 1); |
fb40c209 AC |
198 | } |
199 | ||
143260c9 VP |
200 | void |
201 | mi_cmd_exec_jump (char *args, char **argv, int argc) | |
202 | { | |
203 | /* FIXME: Should call a libgdb function, not a cli wrapper. */ | |
202b96c1 | 204 | mi_execute_async_cli_command ("jump", argv, argc); |
143260c9 VP |
205 | } |
206 | ||
a79b8f6e VP |
207 | static void |
208 | proceed_thread (struct thread_info *thread, int pid) | |
8dd4f202 | 209 | { |
8dd4f202 | 210 | if (!is_stopped (thread->ptid)) |
a79b8f6e | 211 | return; |
8dd4f202 | 212 | |
dfd4cc63 | 213 | if (pid != 0 && ptid_get_pid (thread->ptid) != pid) |
a79b8f6e | 214 | return; |
8dd4f202 VP |
215 | |
216 | switch_to_thread (thread->ptid); | |
217 | clear_proceed_status (); | |
a493e3e2 | 218 | proceed ((CORE_ADDR) -1, GDB_SIGNAL_DEFAULT, 0); |
a79b8f6e VP |
219 | } |
220 | ||
a79b8f6e VP |
221 | static int |
222 | proceed_thread_callback (struct thread_info *thread, void *arg) | |
223 | { | |
224 | int pid = *(int *)arg; | |
102040f0 | 225 | |
a79b8f6e | 226 | proceed_thread (thread, pid); |
8dd4f202 VP |
227 | return 0; |
228 | } | |
229 | ||
e5829bee MS |
230 | static void |
231 | exec_continue (char **argv, int argc) | |
fb40c209 | 232 | { |
a79b8f6e | 233 | if (non_stop) |
8dd4f202 | 234 | { |
2b03b41d SS |
235 | /* In non-stop mode, 'resume' always resumes a single thread. |
236 | Therefore, to resume all threads of the current inferior, or | |
237 | all threads in all inferiors, we need to iterate over | |
238 | threads. | |
a79b8f6e VP |
239 | |
240 | See comment on infcmd.c:proceed_thread_callback for rationale. */ | |
241 | if (current_context->all || current_context->thread_group != -1) | |
242 | { | |
243 | int pid = 0; | |
244 | struct cleanup *back_to = make_cleanup_restore_current_thread (); | |
8dd4f202 | 245 | |
a79b8f6e VP |
246 | if (!current_context->all) |
247 | { | |
9a2b4c1b MS |
248 | struct inferior *inf |
249 | = find_inferior_id (current_context->thread_group); | |
250 | ||
a79b8f6e VP |
251 | pid = inf->pid; |
252 | } | |
253 | iterate_over_threads (proceed_thread_callback, &pid); | |
254 | do_cleanups (back_to); | |
255 | } | |
256 | else | |
257 | { | |
258 | continue_1 (0); | |
259 | } | |
8dd4f202 | 260 | } |
77ebaa5a | 261 | else |
a79b8f6e VP |
262 | { |
263 | struct cleanup *back_to = make_cleanup_restore_integer (&sched_multi); | |
102040f0 | 264 | |
a79b8f6e VP |
265 | if (current_context->all) |
266 | { | |
267 | sched_multi = 1; | |
268 | continue_1 (0); | |
269 | } | |
270 | else | |
271 | { | |
2b03b41d SS |
272 | /* In all-stop mode, -exec-continue traditionally resumed |
273 | either all threads, or one thread, depending on the | |
274 | 'scheduler-locking' variable. Let's continue to do the | |
275 | same. */ | |
a79b8f6e VP |
276 | continue_1 (1); |
277 | } | |
278 | do_cleanups (back_to); | |
279 | } | |
e5829bee MS |
280 | } |
281 | ||
e5829bee | 282 | static void |
a79b8f6e | 283 | exec_direction_forward (void *notused) |
e5829bee | 284 | { |
e5829bee MS |
285 | execution_direction = EXEC_FORWARD; |
286 | } | |
287 | ||
288 | static void | |
289 | exec_reverse_continue (char **argv, int argc) | |
290 | { | |
291 | enum exec_direction_kind dir = execution_direction; | |
292 | struct cleanup *old_chain; | |
293 | ||
e5829bee MS |
294 | if (dir == EXEC_REVERSE) |
295 | error (_("Already in reverse mode.")); | |
296 | ||
297 | if (!target_can_execute_reverse) | |
298 | error (_("Target %s does not support this command."), target_shortname); | |
299 | ||
a79b8f6e | 300 | old_chain = make_cleanup (exec_direction_forward, NULL); |
e5829bee MS |
301 | execution_direction = EXEC_REVERSE; |
302 | exec_continue (argv, argc); | |
303 | do_cleanups (old_chain); | |
304 | } | |
305 | ||
306 | void | |
307 | mi_cmd_exec_continue (char *command, char **argv, int argc) | |
308 | { | |
a79b8f6e | 309 | if (argc > 0 && strcmp (argv[0], "--reverse") == 0) |
e5829bee MS |
310 | exec_reverse_continue (argv + 1, argc - 1); |
311 | else | |
312 | exec_continue (argv, argc); | |
8dd4f202 VP |
313 | } |
314 | ||
315 | static int | |
316 | interrupt_thread_callback (struct thread_info *thread, void *arg) | |
317 | { | |
318 | int pid = *(int *)arg; | |
319 | ||
320 | if (!is_running (thread->ptid)) | |
321 | return 0; | |
322 | ||
dfd4cc63 | 323 | if (ptid_get_pid (thread->ptid) != pid) |
8dd4f202 VP |
324 | return 0; |
325 | ||
326 | target_stop (thread->ptid); | |
327 | return 0; | |
fb40c209 AC |
328 | } |
329 | ||
2b03b41d SS |
330 | /* Interrupt the execution of the target. Note how we must play |
331 | around with the token variables, in order to display the current | |
332 | token in the result of the interrupt command, and the previous | |
333 | execution token when the target finally stops. See comments in | |
41296c92 | 334 | mi_cmd_execute. */ |
2b03b41d | 335 | |
ce8f13f8 | 336 | void |
9e22b03a | 337 | mi_cmd_exec_interrupt (char *command, char **argv, int argc) |
fb40c209 | 338 | { |
a79b8f6e VP |
339 | /* In all-stop mode, everything stops, so we don't need to try |
340 | anything specific. */ | |
341 | if (!non_stop) | |
77ebaa5a | 342 | { |
77ebaa5a | 343 | interrupt_target_1 (0); |
a79b8f6e | 344 | return; |
77ebaa5a | 345 | } |
a79b8f6e VP |
346 | |
347 | if (current_context->all) | |
77ebaa5a | 348 | { |
a79b8f6e | 349 | /* This will interrupt all threads in all inferiors. */ |
77ebaa5a VP |
350 | interrupt_target_1 (1); |
351 | } | |
a79b8f6e | 352 | else if (current_context->thread_group != -1) |
8dd4f202 | 353 | { |
a79b8f6e | 354 | struct inferior *inf = find_inferior_id (current_context->thread_group); |
102040f0 | 355 | |
a79b8f6e VP |
356 | iterate_over_threads (interrupt_thread_callback, &inf->pid); |
357 | } | |
358 | else | |
359 | { | |
360 | /* Interrupt just the current thread -- either explicitly | |
361 | specified via --thread or whatever was current before | |
362 | MI command was sent. */ | |
363 | interrupt_target_1 (0); | |
364 | } | |
365 | } | |
366 | ||
5713b9b5 JB |
367 | /* Callback for iterate_over_inferiors which starts the execution |
368 | of the given inferior. | |
369 | ||
370 | ARG is a pointer to an integer whose value, if non-zero, indicates | |
371 | that the program should be stopped when reaching the main subprogram | |
372 | (similar to what the CLI "start" command does). */ | |
373 | ||
a79b8f6e VP |
374 | static int |
375 | run_one_inferior (struct inferior *inf, void *arg) | |
376 | { | |
5713b9b5 JB |
377 | int start_p = *(int *) arg; |
378 | const char *run_cmd = start_p ? "start" : "run"; | |
379 | ||
a79b8f6e VP |
380 | if (inf->pid != 0) |
381 | { | |
382 | if (inf->pid != ptid_get_pid (inferior_ptid)) | |
383 | { | |
384 | struct thread_info *tp; | |
8dd4f202 | 385 | |
a79b8f6e VP |
386 | tp = any_thread_of_process (inf->pid); |
387 | if (!tp) | |
388 | error (_("Inferior has no threads.")); | |
389 | ||
390 | switch_to_thread (tp->ptid); | |
391 | } | |
8dd4f202 | 392 | } |
77ebaa5a | 393 | else |
a79b8f6e VP |
394 | { |
395 | set_current_inferior (inf); | |
396 | switch_to_thread (null_ptid); | |
397 | set_current_program_space (inf->pspace); | |
398 | } | |
5713b9b5 | 399 | mi_execute_cli_command (run_cmd, target_can_async_p (), |
a79b8f6e VP |
400 | target_can_async_p () ? "&" : NULL); |
401 | return 0; | |
fb40c209 AC |
402 | } |
403 | ||
115d30f9 VP |
404 | void |
405 | mi_cmd_exec_run (char *command, char **argv, int argc) | |
406 | { | |
5713b9b5 JB |
407 | int i; |
408 | int start_p = 0; | |
409 | ||
410 | /* Parse the command options. */ | |
411 | enum opt | |
412 | { | |
413 | START_OPT, | |
414 | }; | |
415 | static const struct mi_opt opts[] = | |
416 | { | |
417 | {"-start", START_OPT, 0}, | |
418 | {NULL, 0, 0}, | |
419 | }; | |
420 | ||
421 | int oind = 0; | |
422 | char *oarg; | |
423 | ||
424 | while (1) | |
425 | { | |
426 | int opt = mi_getopt ("-exec-run", argc, argv, opts, &oind, &oarg); | |
427 | ||
428 | if (opt < 0) | |
429 | break; | |
430 | switch ((enum opt) opt) | |
431 | { | |
432 | case START_OPT: | |
433 | start_p = 1; | |
434 | break; | |
435 | } | |
436 | } | |
437 | ||
438 | /* This command does not accept any argument. Make sure the user | |
439 | did not provide any. */ | |
440 | if (oind != argc) | |
441 | error (_("Invalid argument: %s"), argv[oind]); | |
442 | ||
a79b8f6e VP |
443 | if (current_context->all) |
444 | { | |
445 | struct cleanup *back_to = save_current_space_and_thread (); | |
102040f0 | 446 | |
5713b9b5 | 447 | iterate_over_inferiors (run_one_inferior, &start_p); |
a79b8f6e VP |
448 | do_cleanups (back_to); |
449 | } | |
450 | else | |
451 | { | |
5713b9b5 JB |
452 | const char *run_cmd = start_p ? "start" : "run"; |
453 | ||
454 | mi_execute_cli_command (run_cmd, target_can_async_p (), | |
a79b8f6e VP |
455 | target_can_async_p () ? "&" : NULL); |
456 | } | |
115d30f9 VP |
457 | } |
458 | ||
a79b8f6e | 459 | |
6418d433 VP |
460 | static int |
461 | find_thread_of_process (struct thread_info *ti, void *p) | |
462 | { | |
463 | int pid = *(int *)p; | |
102040f0 | 464 | |
dfd4cc63 | 465 | if (ptid_get_pid (ti->ptid) == pid && !is_exited (ti->ptid)) |
6418d433 VP |
466 | return 1; |
467 | ||
468 | return 0; | |
469 | } | |
470 | ||
471 | void | |
472 | mi_cmd_target_detach (char *command, char **argv, int argc) | |
473 | { | |
474 | if (argc != 0 && argc != 1) | |
9b20d036 | 475 | error (_("Usage: -target-detach [pid | thread-group]")); |
6418d433 VP |
476 | |
477 | if (argc == 1) | |
478 | { | |
479 | struct thread_info *tp; | |
480 | char *end = argv[0]; | |
f1b9e6e7 | 481 | int pid; |
102040f0 | 482 | |
f1b9e6e7 MK |
483 | /* First see if we are dealing with a thread-group id. */ |
484 | if (*argv[0] == 'i') | |
485 | { | |
486 | struct inferior *inf; | |
487 | int id = strtoul (argv[0] + 1, &end, 0); | |
488 | ||
489 | if (*end != '\0') | |
490 | error (_("Invalid syntax of thread-group id '%s'"), argv[0]); | |
491 | ||
492 | inf = find_inferior_id (id); | |
493 | if (!inf) | |
494 | error (_("Non-existent thread-group id '%d'"), id); | |
495 | ||
496 | pid = inf->pid; | |
497 | } | |
498 | else | |
499 | { | |
500 | /* We must be dealing with a pid. */ | |
501 | pid = strtol (argv[0], &end, 10); | |
502 | ||
503 | if (*end != '\0') | |
504 | error (_("Invalid identifier '%s'"), argv[0]); | |
505 | } | |
6418d433 VP |
506 | |
507 | /* Pick any thread in the desired process. Current | |
f1b9e6e7 | 508 | target_detach detaches from the parent of inferior_ptid. */ |
6418d433 VP |
509 | tp = iterate_over_threads (find_thread_of_process, &pid); |
510 | if (!tp) | |
511 | error (_("Thread group is empty")); | |
512 | ||
513 | switch_to_thread (tp->ptid); | |
514 | } | |
515 | ||
516 | detach_command (NULL, 0); | |
517 | } | |
518 | ||
ce8f13f8 | 519 | void |
fb40c209 AC |
520 | mi_cmd_thread_select (char *command, char **argv, int argc) |
521 | { | |
522 | enum gdb_rc rc; | |
a13e061a | 523 | char *mi_error_message; |
fb40c209 AC |
524 | |
525 | if (argc != 1) | |
1b05df00 | 526 | error (_("-thread-select: USAGE: threadnum.")); |
a13e061a | 527 | |
79a45e25 | 528 | rc = gdb_thread_select (current_uiout, argv[0], &mi_error_message); |
a13e061a PA |
529 | |
530 | if (rc == GDB_RC_FAIL) | |
fb40c209 | 531 | { |
a13e061a PA |
532 | make_cleanup (xfree, mi_error_message); |
533 | error ("%s", mi_error_message); | |
fb40c209 | 534 | } |
fb40c209 AC |
535 | } |
536 | ||
ce8f13f8 | 537 | void |
fb40c209 AC |
538 | mi_cmd_thread_list_ids (char *command, char **argv, int argc) |
539 | { | |
b0b13bb4 | 540 | enum gdb_rc rc; |
a13e061a | 541 | char *mi_error_message; |
fb40c209 AC |
542 | |
543 | if (argc != 0) | |
7ea6d463 | 544 | error (_("-thread-list-ids: No arguments required.")); |
a13e061a | 545 | |
79a45e25 | 546 | rc = gdb_list_thread_ids (current_uiout, &mi_error_message); |
a13e061a PA |
547 | |
548 | if (rc == GDB_RC_FAIL) | |
fb40c209 | 549 | { |
a13e061a PA |
550 | make_cleanup (xfree, mi_error_message); |
551 | error ("%s", mi_error_message); | |
fb40c209 | 552 | } |
fb40c209 AC |
553 | } |
554 | ||
ce8f13f8 | 555 | void |
8e8901c5 VP |
556 | mi_cmd_thread_info (char *command, char **argv, int argc) |
557 | { | |
8e8901c5 | 558 | if (argc != 0 && argc != 1) |
7ea6d463 | 559 | error (_("Invalid MI command")); |
8e8901c5 | 560 | |
79a45e25 | 561 | print_thread_info (current_uiout, argv[0], -1); |
3ee1c036 VP |
562 | } |
563 | ||
dc146f7c VP |
564 | struct collect_cores_data |
565 | { | |
566 | int pid; | |
567 | ||
568 | VEC (int) *cores; | |
569 | }; | |
570 | ||
3ee1c036 | 571 | static int |
dc146f7c | 572 | collect_cores (struct thread_info *ti, void *xdata) |
3ee1c036 | 573 | { |
dc146f7c VP |
574 | struct collect_cores_data *data = xdata; |
575 | ||
576 | if (ptid_get_pid (ti->ptid) == data->pid) | |
6c95b8df | 577 | { |
dc146f7c | 578 | int core = target_core_of_thread (ti->ptid); |
102040f0 | 579 | |
dc146f7c VP |
580 | if (core != -1) |
581 | VEC_safe_push (int, data->cores, core); | |
582 | } | |
583 | ||
584 | return 0; | |
585 | } | |
586 | ||
587 | static int * | |
588 | unique (int *b, int *e) | |
589 | { | |
590 | int *d = b; | |
102040f0 | 591 | |
dc146f7c VP |
592 | while (++b != e) |
593 | if (*d != *b) | |
594 | *++d = *b; | |
595 | return ++d; | |
596 | } | |
597 | ||
598 | struct print_one_inferior_data | |
599 | { | |
600 | int recurse; | |
601 | VEC (int) *inferiors; | |
602 | }; | |
603 | ||
604 | static int | |
605 | print_one_inferior (struct inferior *inferior, void *xdata) | |
606 | { | |
607 | struct print_one_inferior_data *top_data = xdata; | |
79a45e25 | 608 | struct ui_out *uiout = current_uiout; |
dc146f7c VP |
609 | |
610 | if (VEC_empty (int, top_data->inferiors) | |
611 | || bsearch (&(inferior->pid), VEC_address (int, top_data->inferiors), | |
612 | VEC_length (int, top_data->inferiors), sizeof (int), | |
613 | compare_positive_ints)) | |
614 | { | |
615 | struct collect_cores_data data; | |
6c95b8df PA |
616 | struct cleanup *back_to |
617 | = make_cleanup_ui_out_tuple_begin_end (uiout, NULL); | |
618 | ||
a79b8f6e | 619 | ui_out_field_fmt (uiout, "id", "i%d", inferior->num); |
6c95b8df | 620 | ui_out_field_string (uiout, "type", "process"); |
a79b8f6e VP |
621 | if (inferior->pid != 0) |
622 | ui_out_field_int (uiout, "pid", inferior->pid); | |
623 | ||
1f0c4988 | 624 | if (inferior->pspace->pspace_exec_filename != NULL) |
a79b8f6e VP |
625 | { |
626 | ui_out_field_string (uiout, "executable", | |
1f0c4988 | 627 | inferior->pspace->pspace_exec_filename); |
a79b8f6e | 628 | } |
6c95b8df | 629 | |
dc146f7c | 630 | data.cores = 0; |
a79b8f6e VP |
631 | if (inferior->pid != 0) |
632 | { | |
633 | data.pid = inferior->pid; | |
634 | iterate_over_threads (collect_cores, &data); | |
635 | } | |
dc146f7c VP |
636 | |
637 | if (!VEC_empty (int, data.cores)) | |
638 | { | |
dc146f7c VP |
639 | int *b, *e; |
640 | struct cleanup *back_to_2 = | |
641 | make_cleanup_ui_out_list_begin_end (uiout, "cores"); | |
642 | ||
643 | qsort (VEC_address (int, data.cores), | |
644 | VEC_length (int, data.cores), sizeof (int), | |
645 | compare_positive_ints); | |
646 | ||
647 | b = VEC_address (int, data.cores); | |
648 | e = b + VEC_length (int, data.cores); | |
649 | e = unique (b, e); | |
650 | ||
651 | for (; b != e; ++b) | |
652 | ui_out_field_int (uiout, NULL, *b); | |
653 | ||
654 | do_cleanups (back_to_2); | |
655 | } | |
656 | ||
657 | if (top_data->recurse) | |
aea5b279 | 658 | print_thread_info (uiout, NULL, inferior->pid); |
dc146f7c | 659 | |
6c95b8df PA |
660 | do_cleanups (back_to); |
661 | } | |
3ee1c036 | 662 | |
3ee1c036 VP |
663 | return 0; |
664 | } | |
665 | ||
2b03b41d SS |
666 | /* Output a field named 'cores' with a list as the value. The |
667 | elements of the list are obtained by splitting 'cores' on | |
668 | comma. */ | |
dc146f7c VP |
669 | |
670 | static void | |
671 | output_cores (struct ui_out *uiout, const char *field_name, const char *xcores) | |
3ee1c036 | 672 | { |
dc146f7c VP |
673 | struct cleanup *back_to = make_cleanup_ui_out_list_begin_end (uiout, |
674 | field_name); | |
675 | char *cores = xstrdup (xcores); | |
676 | char *p = cores; | |
3ee1c036 | 677 | |
dc146f7c | 678 | make_cleanup (xfree, cores); |
3ee1c036 | 679 | |
dc146f7c VP |
680 | for (p = strtok (p, ","); p; p = strtok (NULL, ",")) |
681 | ui_out_field_string (uiout, NULL, p); | |
3ee1c036 | 682 | |
dc146f7c VP |
683 | do_cleanups (back_to); |
684 | } | |
3ee1c036 | 685 | |
dc146f7c VP |
686 | static void |
687 | free_vector_of_ints (void *xvector) | |
688 | { | |
689 | VEC (int) **vector = xvector; | |
102040f0 | 690 | |
dc146f7c VP |
691 | VEC_free (int, *vector); |
692 | } | |
693 | ||
694 | static void | |
695 | do_nothing (splay_tree_key k) | |
696 | { | |
697 | } | |
07e059b5 | 698 | |
dc146f7c VP |
699 | static void |
700 | free_vector_of_osdata_items (splay_tree_value xvalue) | |
701 | { | |
702 | VEC (osdata_item_s) *value = (VEC (osdata_item_s) *) xvalue; | |
102040f0 | 703 | |
dc146f7c VP |
704 | /* We don't free the items itself, it will be done separately. */ |
705 | VEC_free (osdata_item_s, value); | |
706 | } | |
e0665bc8 | 707 | |
dc146f7c VP |
708 | static int |
709 | splay_tree_int_comparator (splay_tree_key xa, splay_tree_key xb) | |
710 | { | |
711 | int a = xa; | |
712 | int b = xb; | |
102040f0 | 713 | |
dc146f7c VP |
714 | return a - b; |
715 | } | |
716 | ||
717 | static void | |
718 | free_splay_tree (void *xt) | |
719 | { | |
720 | splay_tree t = xt; | |
721 | splay_tree_delete (t); | |
722 | } | |
723 | ||
724 | static void | |
725 | list_available_thread_groups (VEC (int) *ids, int recurse) | |
726 | { | |
727 | struct osdata *data; | |
728 | struct osdata_item *item; | |
729 | int ix_items; | |
79a45e25 | 730 | struct ui_out *uiout = current_uiout; |
b9635925 | 731 | struct cleanup *cleanup; |
102040f0 | 732 | |
dc146f7c | 733 | /* This keeps a map from integer (pid) to VEC (struct osdata_item *)* |
8eee9c5a DE |
734 | The vector contains information about all threads for the given pid. |
735 | This is assigned an initial value to avoid "may be used uninitialized" | |
736 | warning from gcc. */ | |
737 | splay_tree tree = NULL; | |
dc146f7c VP |
738 | |
739 | /* get_osdata will throw if it cannot return data. */ | |
740 | data = get_osdata ("processes"); | |
b9635925 | 741 | cleanup = make_cleanup_osdata_free (data); |
dc146f7c VP |
742 | |
743 | if (recurse) | |
744 | { | |
745 | struct osdata *threads = get_osdata ("threads"); | |
dc146f7c | 746 | |
102040f0 | 747 | make_cleanup_osdata_free (threads); |
dc146f7c VP |
748 | tree = splay_tree_new (splay_tree_int_comparator, |
749 | do_nothing, | |
750 | free_vector_of_osdata_items); | |
751 | make_cleanup (free_splay_tree, tree); | |
e0665bc8 | 752 | |
07e059b5 | 753 | for (ix_items = 0; |
dc146f7c | 754 | VEC_iterate (osdata_item_s, threads->items, |
e0665bc8 | 755 | ix_items, item); |
07e059b5 VP |
756 | ix_items++) |
757 | { | |
07e059b5 | 758 | const char *pid = get_osdata_column (item, "pid"); |
dc146f7c VP |
759 | int pid_i = strtoul (pid, NULL, 0); |
760 | VEC (osdata_item_s) *vec = 0; | |
761 | ||
762 | splay_tree_node n = splay_tree_lookup (tree, pid_i); | |
763 | if (!n) | |
764 | { | |
765 | VEC_safe_push (osdata_item_s, vec, item); | |
766 | splay_tree_insert (tree, pid_i, (splay_tree_value)vec); | |
767 | } | |
768 | else | |
769 | { | |
770 | vec = (VEC (osdata_item_s) *) n->value; | |
771 | VEC_safe_push (osdata_item_s, vec, item); | |
772 | n->value = (splay_tree_value) vec; | |
773 | } | |
774 | } | |
775 | } | |
776 | ||
777 | make_cleanup_ui_out_list_begin_end (uiout, "groups"); | |
07e059b5 | 778 | |
dc146f7c VP |
779 | for (ix_items = 0; |
780 | VEC_iterate (osdata_item_s, data->items, | |
781 | ix_items, item); | |
782 | ix_items++) | |
783 | { | |
784 | struct cleanup *back_to; | |
e0665bc8 | 785 | |
dc146f7c VP |
786 | const char *pid = get_osdata_column (item, "pid"); |
787 | const char *cmd = get_osdata_column (item, "command"); | |
788 | const char *user = get_osdata_column (item, "user"); | |
789 | const char *cores = get_osdata_column (item, "cores"); | |
790 | ||
791 | int pid_i = strtoul (pid, NULL, 0); | |
792 | ||
793 | /* At present, the target will return all available processes | |
794 | and if information about specific ones was required, we filter | |
795 | undesired processes here. */ | |
796 | if (ids && bsearch (&pid_i, VEC_address (int, ids), | |
797 | VEC_length (int, ids), | |
798 | sizeof (int), compare_positive_ints) == NULL) | |
799 | continue; | |
800 | ||
801 | ||
802 | back_to = make_cleanup_ui_out_tuple_begin_end (uiout, NULL); | |
803 | ||
804 | ui_out_field_fmt (uiout, "id", "%s", pid); | |
805 | ui_out_field_string (uiout, "type", "process"); | |
806 | if (cmd) | |
807 | ui_out_field_string (uiout, "description", cmd); | |
808 | if (user) | |
809 | ui_out_field_string (uiout, "user", user); | |
810 | if (cores) | |
811 | output_cores (uiout, "cores", cores); | |
812 | ||
813 | if (recurse) | |
814 | { | |
815 | splay_tree_node n = splay_tree_lookup (tree, pid_i); | |
816 | if (n) | |
817 | { | |
818 | VEC (osdata_item_s) *children = (VEC (osdata_item_s) *) n->value; | |
819 | struct osdata_item *child; | |
820 | int ix_child; | |
821 | ||
822 | make_cleanup_ui_out_list_begin_end (uiout, "threads"); | |
823 | ||
824 | for (ix_child = 0; | |
825 | VEC_iterate (osdata_item_s, children, ix_child, child); | |
826 | ++ix_child) | |
827 | { | |
828 | struct cleanup *back_to_2 = | |
829 | make_cleanup_ui_out_tuple_begin_end (uiout, NULL); | |
dc146f7c VP |
830 | const char *tid = get_osdata_column (child, "tid"); |
831 | const char *tcore = get_osdata_column (child, "core"); | |
102040f0 | 832 | |
dc146f7c VP |
833 | ui_out_field_string (uiout, "id", tid); |
834 | if (tcore) | |
835 | ui_out_field_string (uiout, "core", tcore); | |
836 | ||
837 | do_cleanups (back_to_2); | |
838 | } | |
839 | } | |
07e059b5 | 840 | } |
dc146f7c VP |
841 | |
842 | do_cleanups (back_to); | |
07e059b5 | 843 | } |
b9635925 TT |
844 | |
845 | do_cleanups (cleanup); | |
dc146f7c VP |
846 | } |
847 | ||
848 | void | |
849 | mi_cmd_list_thread_groups (char *command, char **argv, int argc) | |
850 | { | |
79a45e25 | 851 | struct ui_out *uiout = current_uiout; |
dc146f7c VP |
852 | struct cleanup *back_to; |
853 | int available = 0; | |
854 | int recurse = 0; | |
855 | VEC (int) *ids = 0; | |
856 | ||
857 | enum opt | |
dc146f7c | 858 | { |
2b03b41d | 859 | AVAILABLE_OPT, RECURSE_OPT |
dc146f7c | 860 | }; |
2b03b41d SS |
861 | static const struct mi_opt opts[] = |
862 | { | |
863 | {"-available", AVAILABLE_OPT, 0}, | |
864 | {"-recurse", RECURSE_OPT, 1}, | |
865 | { 0, 0, 0 } | |
866 | }; | |
dc146f7c | 867 | |
56934ab1 AS |
868 | int oind = 0; |
869 | char *oarg; | |
dc146f7c VP |
870 | |
871 | while (1) | |
872 | { | |
873 | int opt = mi_getopt ("-list-thread-groups", argc, argv, opts, | |
56934ab1 | 874 | &oind, &oarg); |
102040f0 | 875 | |
dc146f7c VP |
876 | if (opt < 0) |
877 | break; | |
878 | switch ((enum opt) opt) | |
879 | { | |
880 | case AVAILABLE_OPT: | |
881 | available = 1; | |
882 | break; | |
883 | case RECURSE_OPT: | |
56934ab1 | 884 | if (strcmp (oarg, "0") == 0) |
dc146f7c | 885 | ; |
56934ab1 | 886 | else if (strcmp (oarg, "1") == 0) |
dc146f7c VP |
887 | recurse = 1; |
888 | else | |
7ea6d463 PM |
889 | error (_("only '0' and '1' are valid values " |
890 | "for the '--recurse' option")); | |
dc146f7c VP |
891 | break; |
892 | } | |
893 | } | |
894 | ||
56934ab1 | 895 | for (; oind < argc; ++oind) |
dc146f7c VP |
896 | { |
897 | char *end; | |
2f296114 VP |
898 | int inf; |
899 | ||
56934ab1 AS |
900 | if (*(argv[oind]) != 'i') |
901 | error (_("invalid syntax of group id '%s'"), argv[oind]); | |
2f296114 | 902 | |
56934ab1 | 903 | inf = strtoul (argv[oind] + 1, &end, 0); |
102040f0 | 904 | |
dc146f7c | 905 | if (*end != '\0') |
56934ab1 | 906 | error (_("invalid syntax of group id '%s'"), argv[oind]); |
dc146f7c VP |
907 | VEC_safe_push (int, ids, inf); |
908 | } | |
909 | if (VEC_length (int, ids) > 1) | |
910 | qsort (VEC_address (int, ids), | |
911 | VEC_length (int, ids), | |
912 | sizeof (int), compare_positive_ints); | |
913 | ||
914 | back_to = make_cleanup (free_vector_of_ints, &ids); | |
915 | ||
916 | if (available) | |
917 | { | |
918 | list_available_thread_groups (ids, recurse); | |
919 | } | |
920 | else if (VEC_length (int, ids) == 1) | |
3ee1c036 | 921 | { |
2b03b41d | 922 | /* Local thread groups, single id. */ |
2f296114 VP |
923 | int id = *VEC_address (int, ids); |
924 | struct inferior *inf = find_inferior_id (id); | |
102040f0 | 925 | |
2f296114 | 926 | if (!inf) |
7ea6d463 | 927 | error (_("Non-existent thread group id '%d'"), id); |
2f296114 | 928 | |
aea5b279 | 929 | print_thread_info (uiout, NULL, inf->pid); |
3ee1c036 VP |
930 | } |
931 | else | |
932 | { | |
dc146f7c | 933 | struct print_one_inferior_data data; |
102040f0 | 934 | |
dc146f7c VP |
935 | data.recurse = recurse; |
936 | data.inferiors = ids; | |
937 | ||
938 | /* Local thread groups. Either no explicit ids -- and we | |
939 | print everything, or several explicit ids. In both cases, | |
940 | we print more than one group, and have to use 'groups' | |
941 | as the top-level element. */ | |
3ee1c036 | 942 | make_cleanup_ui_out_list_begin_end (uiout, "groups"); |
dc146f7c VP |
943 | update_thread_list (); |
944 | iterate_over_inferiors (print_one_inferior, &data); | |
3ee1c036 | 945 | } |
dc146f7c | 946 | |
3ee1c036 | 947 | do_cleanups (back_to); |
8e8901c5 VP |
948 | } |
949 | ||
ce8f13f8 | 950 | void |
fb40c209 AC |
951 | mi_cmd_data_list_register_names (char *command, char **argv, int argc) |
952 | { | |
7ccb0be9 | 953 | struct gdbarch *gdbarch; |
79a45e25 | 954 | struct ui_out *uiout = current_uiout; |
fb40c209 AC |
955 | int regnum, numregs; |
956 | int i; | |
4060713b | 957 | struct cleanup *cleanup; |
fb40c209 AC |
958 | |
959 | /* Note that the test for a valid register must include checking the | |
2b03b41d SS |
960 | gdbarch_register_name because gdbarch_num_regs may be allocated |
961 | for the union of the register sets within a family of related | |
962 | processors. In this case, some entries of gdbarch_register_name | |
963 | will change depending upon the particular processor being | |
964 | debugged. */ | |
fb40c209 | 965 | |
441b986a | 966 | gdbarch = get_current_arch (); |
7ccb0be9 | 967 | numregs = gdbarch_num_regs (gdbarch) + gdbarch_num_pseudo_regs (gdbarch); |
fb40c209 | 968 | |
4060713b | 969 | cleanup = make_cleanup_ui_out_list_begin_end (uiout, "register-names"); |
fb40c209 | 970 | |
41296c92 | 971 | if (argc == 0) /* No args, just do all the regs. */ |
fb40c209 AC |
972 | { |
973 | for (regnum = 0; | |
974 | regnum < numregs; | |
975 | regnum++) | |
976 | { | |
7ccb0be9 UW |
977 | if (gdbarch_register_name (gdbarch, regnum) == NULL |
978 | || *(gdbarch_register_name (gdbarch, regnum)) == '\0') | |
173d6894 AC |
979 | ui_out_field_string (uiout, NULL, ""); |
980 | else | |
c9f4d572 | 981 | ui_out_field_string (uiout, NULL, |
7ccb0be9 | 982 | gdbarch_register_name (gdbarch, regnum)); |
fb40c209 AC |
983 | } |
984 | } | |
985 | ||
41296c92 | 986 | /* Else, list of register #s, just do listed regs. */ |
fb40c209 AC |
987 | for (i = 0; i < argc; i++) |
988 | { | |
989 | regnum = atoi (argv[i]); | |
173d6894 | 990 | if (regnum < 0 || regnum >= numregs) |
7ea6d463 | 991 | error (_("bad register number")); |
a13e061a | 992 | |
7ccb0be9 UW |
993 | if (gdbarch_register_name (gdbarch, regnum) == NULL |
994 | || *(gdbarch_register_name (gdbarch, regnum)) == '\0') | |
173d6894 AC |
995 | ui_out_field_string (uiout, NULL, ""); |
996 | else | |
c9f4d572 | 997 | ui_out_field_string (uiout, NULL, |
7ccb0be9 | 998 | gdbarch_register_name (gdbarch, regnum)); |
fb40c209 | 999 | } |
4060713b | 1000 | do_cleanups (cleanup); |
fb40c209 AC |
1001 | } |
1002 | ||
ce8f13f8 | 1003 | void |
fb40c209 AC |
1004 | mi_cmd_data_list_changed_registers (char *command, char **argv, int argc) |
1005 | { | |
6ed7ea50 | 1006 | static struct regcache *this_regs = NULL; |
79a45e25 | 1007 | struct ui_out *uiout = current_uiout; |
6ed7ea50 | 1008 | struct regcache *prev_regs; |
7ccb0be9 | 1009 | struct gdbarch *gdbarch; |
fb40c209 AC |
1010 | int regnum, numregs, changed; |
1011 | int i; | |
4060713b | 1012 | struct cleanup *cleanup; |
fb40c209 | 1013 | |
2b03b41d SS |
1014 | /* The last time we visited this function, the current frame's |
1015 | register contents were saved in THIS_REGS. Move THIS_REGS over | |
1016 | to PREV_REGS, and refresh THIS_REGS with the now-current register | |
1017 | contents. */ | |
6ed7ea50 UW |
1018 | |
1019 | prev_regs = this_regs; | |
1020 | this_regs = frame_save_as_regcache (get_selected_frame (NULL)); | |
1021 | cleanup = make_cleanup_regcache_xfree (prev_regs); | |
1022 | ||
fb40c209 | 1023 | /* Note that the test for a valid register must include checking the |
2b03b41d SS |
1024 | gdbarch_register_name because gdbarch_num_regs may be allocated |
1025 | for the union of the register sets within a family of related | |
1026 | processors. In this case, some entries of gdbarch_register_name | |
1027 | will change depending upon the particular processor being | |
1028 | debugged. */ | |
fb40c209 | 1029 | |
7ccb0be9 UW |
1030 | gdbarch = get_regcache_arch (this_regs); |
1031 | numregs = gdbarch_num_regs (gdbarch) + gdbarch_num_pseudo_regs (gdbarch); | |
fb40c209 | 1032 | |
6ed7ea50 | 1033 | make_cleanup_ui_out_list_begin_end (uiout, "changed-registers"); |
fb40c209 | 1034 | |
2b03b41d | 1035 | if (argc == 0) |
fb40c209 | 1036 | { |
2b03b41d | 1037 | /* No args, just do all the regs. */ |
fb40c209 AC |
1038 | for (regnum = 0; |
1039 | regnum < numregs; | |
1040 | regnum++) | |
1041 | { | |
7ccb0be9 UW |
1042 | if (gdbarch_register_name (gdbarch, regnum) == NULL |
1043 | || *(gdbarch_register_name (gdbarch, regnum)) == '\0') | |
fb40c209 | 1044 | continue; |
6ed7ea50 | 1045 | changed = register_changed_p (regnum, prev_regs, this_regs); |
fb40c209 | 1046 | if (changed < 0) |
7ea6d463 PM |
1047 | error (_("-data-list-changed-registers: " |
1048 | "Unable to read register contents.")); | |
fb40c209 AC |
1049 | else if (changed) |
1050 | ui_out_field_int (uiout, NULL, regnum); | |
1051 | } | |
1052 | } | |
1053 | ||
41296c92 | 1054 | /* Else, list of register #s, just do listed regs. */ |
fb40c209 AC |
1055 | for (i = 0; i < argc; i++) |
1056 | { | |
1057 | regnum = atoi (argv[i]); | |
1058 | ||
1059 | if (regnum >= 0 | |
1060 | && regnum < numregs | |
7ccb0be9 UW |
1061 | && gdbarch_register_name (gdbarch, regnum) != NULL |
1062 | && *gdbarch_register_name (gdbarch, regnum) != '\000') | |
fb40c209 | 1063 | { |
6ed7ea50 | 1064 | changed = register_changed_p (regnum, prev_regs, this_regs); |
fb40c209 | 1065 | if (changed < 0) |
7ea6d463 PM |
1066 | error (_("-data-list-changed-registers: " |
1067 | "Unable to read register contents.")); | |
fb40c209 AC |
1068 | else if (changed) |
1069 | ui_out_field_int (uiout, NULL, regnum); | |
1070 | } | |
1071 | else | |
7ea6d463 | 1072 | error (_("bad register number")); |
fb40c209 | 1073 | } |
4060713b | 1074 | do_cleanups (cleanup); |
fb40c209 AC |
1075 | } |
1076 | ||
1077 | static int | |
6ed7ea50 UW |
1078 | register_changed_p (int regnum, struct regcache *prev_regs, |
1079 | struct regcache *this_regs) | |
fb40c209 | 1080 | { |
6ed7ea50 UW |
1081 | struct gdbarch *gdbarch = get_regcache_arch (this_regs); |
1082 | gdb_byte prev_buffer[MAX_REGISTER_SIZE]; | |
1083 | gdb_byte this_buffer[MAX_REGISTER_SIZE]; | |
e69aa73e PA |
1084 | enum register_status prev_status; |
1085 | enum register_status this_status; | |
fb40c209 | 1086 | |
e69aa73e PA |
1087 | /* First time through or after gdbarch change consider all registers |
1088 | as changed. */ | |
1089 | if (!prev_regs || get_regcache_arch (prev_regs) != gdbarch) | |
6ed7ea50 | 1090 | return 1; |
fb40c209 | 1091 | |
6ed7ea50 | 1092 | /* Get register contents and compare. */ |
e69aa73e PA |
1093 | prev_status = regcache_cooked_read (prev_regs, regnum, prev_buffer); |
1094 | this_status = regcache_cooked_read (this_regs, regnum, this_buffer); | |
fb40c209 | 1095 | |
e69aa73e PA |
1096 | if (this_status != prev_status) |
1097 | return 1; | |
1098 | else if (this_status == REG_VALID) | |
1099 | return memcmp (prev_buffer, this_buffer, | |
1100 | register_size (gdbarch, regnum)) != 0; | |
1101 | else | |
1102 | return 0; | |
fb40c209 AC |
1103 | } |
1104 | ||
41296c92 | 1105 | /* Return a list of register number and value pairs. The valid |
fb40c209 | 1106 | arguments expected are: a letter indicating the format in which to |
2b03b41d SS |
1107 | display the registers contents. This can be one of: x |
1108 | (hexadecimal), d (decimal), N (natural), t (binary), o (octal), r | |
1109 | (raw). After the format argument there can be a sequence of | |
1110 | numbers, indicating which registers to fetch the content of. If | |
1111 | the format is the only argument, a list of all the registers with | |
1112 | their values is returned. */ | |
1113 | ||
ce8f13f8 | 1114 | void |
fb40c209 AC |
1115 | mi_cmd_data_list_register_values (char *command, char **argv, int argc) |
1116 | { | |
79a45e25 | 1117 | struct ui_out *uiout = current_uiout; |
7ccb0be9 UW |
1118 | struct frame_info *frame; |
1119 | struct gdbarch *gdbarch; | |
a13e061a | 1120 | int regnum, numregs, format; |
fb40c209 | 1121 | int i; |
1edebdbf | 1122 | struct cleanup *list_cleanup; |
c898adb7 YQ |
1123 | int skip_unavailable = 0; |
1124 | int oind = 0; | |
1125 | enum opt | |
1126 | { | |
1127 | SKIP_UNAVAILABLE, | |
1128 | }; | |
1129 | static const struct mi_opt opts[] = | |
1130 | { | |
1131 | {"-skip-unavailable", SKIP_UNAVAILABLE, 0}, | |
1132 | { 0, 0, 0 } | |
1133 | }; | |
fb40c209 AC |
1134 | |
1135 | /* Note that the test for a valid register must include checking the | |
2b03b41d SS |
1136 | gdbarch_register_name because gdbarch_num_regs may be allocated |
1137 | for the union of the register sets within a family of related | |
1138 | processors. In this case, some entries of gdbarch_register_name | |
1139 | will change depending upon the particular processor being | |
1140 | debugged. */ | |
fb40c209 | 1141 | |
c898adb7 YQ |
1142 | while (1) |
1143 | { | |
1144 | char *oarg; | |
1145 | int opt = mi_getopt ("-data-list-register-values", argc, argv, | |
1146 | opts, &oind, &oarg); | |
1147 | ||
1148 | if (opt < 0) | |
1149 | break; | |
1150 | switch ((enum opt) opt) | |
1151 | { | |
1152 | case SKIP_UNAVAILABLE: | |
1153 | skip_unavailable = 1; | |
1154 | break; | |
1155 | } | |
1156 | } | |
1157 | ||
1158 | if (argc - oind < 1) | |
7ea6d463 | 1159 | error (_("-data-list-register-values: Usage: " |
c898adb7 YQ |
1160 | "-data-list-register-values [--skip-unavailable] <format>" |
1161 | " [<regnum1>...<regnumN>]")); | |
fb40c209 | 1162 | |
c898adb7 | 1163 | format = (int) argv[oind][0]; |
fb40c209 | 1164 | |
7ccb0be9 UW |
1165 | frame = get_selected_frame (NULL); |
1166 | gdbarch = get_frame_arch (frame); | |
1167 | numregs = gdbarch_num_regs (gdbarch) + gdbarch_num_pseudo_regs (gdbarch); | |
1168 | ||
4060713b | 1169 | list_cleanup = make_cleanup_ui_out_list_begin_end (uiout, "register-values"); |
fb40c209 | 1170 | |
c898adb7 | 1171 | if (argc - oind == 1) |
fb40c209 | 1172 | { |
2b03b41d | 1173 | /* No args, beside the format: do all the regs. */ |
fb40c209 AC |
1174 | for (regnum = 0; |
1175 | regnum < numregs; | |
1176 | regnum++) | |
1177 | { | |
7ccb0be9 UW |
1178 | if (gdbarch_register_name (gdbarch, regnum) == NULL |
1179 | || *(gdbarch_register_name (gdbarch, regnum)) == '\0') | |
fb40c209 | 1180 | continue; |
1edebdbf | 1181 | |
c898adb7 | 1182 | output_register (frame, regnum, format, skip_unavailable); |
fb40c209 AC |
1183 | } |
1184 | } | |
1185 | ||
41296c92 | 1186 | /* Else, list of register #s, just do listed regs. */ |
c898adb7 | 1187 | for (i = 1 + oind; i < argc; i++) |
fb40c209 AC |
1188 | { |
1189 | regnum = atoi (argv[i]); | |
1190 | ||
1191 | if (regnum >= 0 | |
1192 | && regnum < numregs | |
7ccb0be9 UW |
1193 | && gdbarch_register_name (gdbarch, regnum) != NULL |
1194 | && *gdbarch_register_name (gdbarch, regnum) != '\000') | |
c898adb7 | 1195 | output_register (frame, regnum, format, skip_unavailable); |
fb40c209 | 1196 | else |
7ea6d463 | 1197 | error (_("bad register number")); |
fb40c209 | 1198 | } |
4060713b | 1199 | do_cleanups (list_cleanup); |
fb40c209 AC |
1200 | } |
1201 | ||
c898adb7 YQ |
1202 | /* Output one register REGNUM's contents in the desired FORMAT. If |
1203 | SKIP_UNAVAILABLE is true, skip the register if it is | |
1204 | unavailable. */ | |
2b03b41d | 1205 | |
a13e061a | 1206 | static void |
c898adb7 YQ |
1207 | output_register (struct frame_info *frame, int regnum, int format, |
1208 | int skip_unavailable) | |
fb40c209 | 1209 | { |
7ccb0be9 | 1210 | struct gdbarch *gdbarch = get_frame_arch (frame); |
79a45e25 | 1211 | struct ui_out *uiout = current_uiout; |
901461f8 | 1212 | struct value *val = value_of_register (regnum, frame); |
1edebdbf | 1213 | struct cleanup *tuple_cleanup; |
fdc8aae8 AB |
1214 | struct value_print_options opts; |
1215 | struct ui_file *stb; | |
1edebdbf | 1216 | |
c898adb7 YQ |
1217 | if (skip_unavailable && !value_entirely_available (val)) |
1218 | return; | |
1219 | ||
1edebdbf YQ |
1220 | tuple_cleanup = make_cleanup_ui_out_tuple_begin_end (uiout, NULL); |
1221 | ui_out_field_int (uiout, "number", regnum); | |
fb40c209 | 1222 | |
fb40c209 AC |
1223 | if (format == 'N') |
1224 | format = 0; | |
1225 | ||
fb40c209 | 1226 | if (format == 'r') |
fdc8aae8 AB |
1227 | format = 'z'; |
1228 | ||
1229 | stb = mem_fileopen (); | |
1230 | make_cleanup_ui_file_delete (stb); | |
1231 | ||
1232 | get_formatted_print_options (&opts, format); | |
1233 | opts.deref_ref = 1; | |
1234 | val_print (value_type (val), | |
1235 | value_contents_for_printing (val), | |
1236 | value_embedded_offset (val), 0, | |
1237 | stb, 0, val, &opts, current_language); | |
1238 | ui_out_field_stream (uiout, "value", stb); | |
1edebdbf YQ |
1239 | |
1240 | do_cleanups (tuple_cleanup); | |
fb40c209 AC |
1241 | } |
1242 | ||
24e8cecf | 1243 | /* Write given values into registers. The registers and values are |
41296c92 | 1244 | given as pairs. The corresponding MI command is |
9a2b4c1b MS |
1245 | -data-write-register-values <format> |
1246 | [<regnum1> <value1>...<regnumN> <valueN>] */ | |
ce8f13f8 | 1247 | void |
24e8cecf EZ |
1248 | mi_cmd_data_write_register_values (char *command, char **argv, int argc) |
1249 | { | |
7ccb0be9 UW |
1250 | struct regcache *regcache; |
1251 | struct gdbarch *gdbarch; | |
9f3a1602 | 1252 | int numregs, i; |
24e8cecf EZ |
1253 | |
1254 | /* Note that the test for a valid register must include checking the | |
2b03b41d SS |
1255 | gdbarch_register_name because gdbarch_num_regs may be allocated |
1256 | for the union of the register sets within a family of related | |
1257 | processors. In this case, some entries of gdbarch_register_name | |
1258 | will change depending upon the particular processor being | |
1259 | debugged. */ | |
24e8cecf | 1260 | |
7ccb0be9 UW |
1261 | regcache = get_current_regcache (); |
1262 | gdbarch = get_regcache_arch (regcache); | |
1263 | numregs = gdbarch_num_regs (gdbarch) + gdbarch_num_pseudo_regs (gdbarch); | |
24e8cecf EZ |
1264 | |
1265 | if (argc == 0) | |
7ea6d463 PM |
1266 | error (_("-data-write-register-values: Usage: -data-write-register-" |
1267 | "values <format> [<regnum1> <value1>...<regnumN> <valueN>]")); | |
24e8cecf | 1268 | |
24e8cecf | 1269 | if (!target_has_registers) |
7ea6d463 | 1270 | error (_("-data-write-register-values: No registers.")); |
24e8cecf EZ |
1271 | |
1272 | if (!(argc - 1)) | |
7ea6d463 | 1273 | error (_("-data-write-register-values: No regs and values specified.")); |
24e8cecf EZ |
1274 | |
1275 | if ((argc - 1) % 2) | |
7ea6d463 PM |
1276 | error (_("-data-write-register-values: " |
1277 | "Regs and vals are not in pairs.")); | |
24e8cecf EZ |
1278 | |
1279 | for (i = 1; i < argc; i = i + 2) | |
1280 | { | |
9f3a1602 | 1281 | int regnum = atoi (argv[i]); |
24e8cecf | 1282 | |
9f3a1602 | 1283 | if (regnum >= 0 && regnum < numregs |
7ccb0be9 UW |
1284 | && gdbarch_register_name (gdbarch, regnum) |
1285 | && *gdbarch_register_name (gdbarch, regnum)) | |
24e8cecf | 1286 | { |
9f3a1602 | 1287 | LONGEST value; |
d8bf3afa | 1288 | |
9f3a1602 | 1289 | /* Get the value as a number. */ |
24e8cecf | 1290 | value = parse_and_eval_address (argv[i + 1]); |
9f3a1602 | 1291 | |
41296c92 | 1292 | /* Write it down. */ |
7ccb0be9 | 1293 | regcache_cooked_write_signed (regcache, regnum, value); |
24e8cecf EZ |
1294 | } |
1295 | else | |
7ea6d463 | 1296 | error (_("bad register number")); |
24e8cecf | 1297 | } |
24e8cecf EZ |
1298 | } |
1299 | ||
41296c92 | 1300 | /* Evaluate the value of the argument. The argument is an |
fb40c209 | 1301 | expression. If the expression contains spaces it needs to be |
41296c92 | 1302 | included in double quotes. */ |
2b03b41d | 1303 | |
ce8f13f8 | 1304 | void |
fb40c209 AC |
1305 | mi_cmd_data_evaluate_expression (char *command, char **argv, int argc) |
1306 | { | |
1307 | struct expression *expr; | |
f99d8bf4 | 1308 | struct cleanup *old_chain; |
96052a95 | 1309 | struct value *val; |
f99d8bf4 | 1310 | struct ui_file *stb; |
79a45b7d | 1311 | struct value_print_options opts; |
79a45e25 | 1312 | struct ui_out *uiout = current_uiout; |
fb40c209 | 1313 | |
f99d8bf4 PA |
1314 | stb = mem_fileopen (); |
1315 | old_chain = make_cleanup_ui_file_delete (stb); | |
fb40c209 AC |
1316 | |
1317 | if (argc != 1) | |
f99d8bf4 PA |
1318 | error (_("-data-evaluate-expression: " |
1319 | "Usage: -data-evaluate-expression expression")); | |
fb40c209 AC |
1320 | |
1321 | expr = parse_expression (argv[0]); | |
1322 | ||
f99d8bf4 | 1323 | make_cleanup (free_current_contents, &expr); |
fb40c209 AC |
1324 | |
1325 | val = evaluate_expression (expr); | |
1326 | ||
41296c92 | 1327 | /* Print the result of the expression evaluation. */ |
79a45b7d TT |
1328 | get_user_print_options (&opts); |
1329 | opts.deref_ref = 0; | |
f99d8bf4 | 1330 | common_val_print (val, stb, 0, &opts, current_language); |
fb40c209 AC |
1331 | |
1332 | ui_out_field_stream (uiout, "value", stb); | |
fb40c209 AC |
1333 | |
1334 | do_cleanups (old_chain); | |
fb40c209 AC |
1335 | } |
1336 | ||
2b03b41d | 1337 | /* This is the -data-read-memory command. |
fb40c209 AC |
1338 | |
1339 | ADDR: start address of data to be dumped. | |
41296c92 | 1340 | WORD-FORMAT: a char indicating format for the ``word''. See |
fb40c209 | 1341 | the ``x'' command. |
41296c92 | 1342 | WORD-SIZE: size of each ``word''; 1,2,4, or 8 bytes. |
fb40c209 AC |
1343 | NR_ROW: Number of rows. |
1344 | NR_COL: The number of colums (words per row). | |
1345 | ASCHAR: (OPTIONAL) Append an ascii character dump to each row. Use | |
1346 | ASCHAR for unprintable characters. | |
1347 | ||
1348 | Reads SIZE*NR_ROW*NR_COL bytes starting at ADDR from memory and | |
1349 | displayes them. Returns: | |
1350 | ||
1351 | {addr="...",rowN={wordN="..." ,... [,ascii="..."]}, ...} | |
1352 | ||
1353 | Returns: | |
2b03b41d | 1354 | The number of bytes read is SIZE*ROW*COL. */ |
fb40c209 | 1355 | |
ce8f13f8 | 1356 | void |
fb40c209 AC |
1357 | mi_cmd_data_read_memory (char *command, char **argv, int argc) |
1358 | { | |
e17c207e | 1359 | struct gdbarch *gdbarch = get_current_arch (); |
79a45e25 | 1360 | struct ui_out *uiout = current_uiout; |
fb40c209 AC |
1361 | struct cleanup *cleanups = make_cleanup (null_cleanup, NULL); |
1362 | CORE_ADDR addr; | |
2b03b41d | 1363 | long total_bytes, nr_cols, nr_rows; |
fb40c209 AC |
1364 | char word_format; |
1365 | struct type *word_type; | |
1366 | long word_size; | |
1367 | char word_asize; | |
1368 | char aschar; | |
508416a1 | 1369 | gdb_byte *mbuf; |
fb40c209 AC |
1370 | int nr_bytes; |
1371 | long offset = 0; | |
56934ab1 AS |
1372 | int oind = 0; |
1373 | char *oarg; | |
fb40c209 | 1374 | enum opt |
fb40c209 | 1375 | { |
2b03b41d | 1376 | OFFSET_OPT |
fb40c209 | 1377 | }; |
2b03b41d SS |
1378 | static const struct mi_opt opts[] = |
1379 | { | |
1380 | {"o", OFFSET_OPT, 1}, | |
1381 | { 0, 0, 0 } | |
1382 | }; | |
fb40c209 AC |
1383 | |
1384 | while (1) | |
1385 | { | |
1b05df00 | 1386 | int opt = mi_getopt ("-data-read-memory", argc, argv, opts, |
56934ab1 | 1387 | &oind, &oarg); |
102040f0 | 1388 | |
fb40c209 AC |
1389 | if (opt < 0) |
1390 | break; | |
1391 | switch ((enum opt) opt) | |
1392 | { | |
1393 | case OFFSET_OPT: | |
56934ab1 | 1394 | offset = atol (oarg); |
fb40c209 AC |
1395 | break; |
1396 | } | |
1397 | } | |
56934ab1 AS |
1398 | argv += oind; |
1399 | argc -= oind; | |
fb40c209 AC |
1400 | |
1401 | if (argc < 5 || argc > 6) | |
7ea6d463 PM |
1402 | error (_("-data-read-memory: Usage: " |
1403 | "ADDR WORD-FORMAT WORD-SIZE NR-ROWS NR-COLS [ASCHAR].")); | |
fb40c209 AC |
1404 | |
1405 | /* Extract all the arguments. */ | |
1406 | ||
41296c92 | 1407 | /* Start address of the memory dump. */ |
fb40c209 | 1408 | addr = parse_and_eval_address (argv[0]) + offset; |
41296c92 | 1409 | /* The format character to use when displaying a memory word. See |
2b03b41d | 1410 | the ``x'' command. */ |
fb40c209 | 1411 | word_format = argv[1][0]; |
41296c92 | 1412 | /* The size of the memory word. */ |
fb40c209 AC |
1413 | word_size = atol (argv[2]); |
1414 | switch (word_size) | |
1415 | { | |
1416 | case 1: | |
df4df182 | 1417 | word_type = builtin_type (gdbarch)->builtin_int8; |
fb40c209 AC |
1418 | word_asize = 'b'; |
1419 | break; | |
1420 | case 2: | |
df4df182 | 1421 | word_type = builtin_type (gdbarch)->builtin_int16; |
fb40c209 AC |
1422 | word_asize = 'h'; |
1423 | break; | |
1424 | case 4: | |
df4df182 | 1425 | word_type = builtin_type (gdbarch)->builtin_int32; |
fb40c209 AC |
1426 | word_asize = 'w'; |
1427 | break; | |
1428 | case 8: | |
df4df182 | 1429 | word_type = builtin_type (gdbarch)->builtin_int64; |
fb40c209 AC |
1430 | word_asize = 'g'; |
1431 | break; | |
1432 | default: | |
df4df182 | 1433 | word_type = builtin_type (gdbarch)->builtin_int8; |
fb40c209 AC |
1434 | word_asize = 'b'; |
1435 | } | |
41296c92 | 1436 | /* The number of rows. */ |
fb40c209 AC |
1437 | nr_rows = atol (argv[3]); |
1438 | if (nr_rows <= 0) | |
7ea6d463 | 1439 | error (_("-data-read-memory: invalid number of rows.")); |
a13e061a | 1440 | |
41296c92 | 1441 | /* Number of bytes per row. */ |
fb40c209 AC |
1442 | nr_cols = atol (argv[4]); |
1443 | if (nr_cols <= 0) | |
7ea6d463 | 1444 | error (_("-data-read-memory: invalid number of columns.")); |
a13e061a | 1445 | |
41296c92 | 1446 | /* The un-printable character when printing ascii. */ |
fb40c209 AC |
1447 | if (argc == 6) |
1448 | aschar = *argv[5]; | |
1449 | else | |
1450 | aschar = 0; | |
1451 | ||
41296c92 | 1452 | /* Create a buffer and read it in. */ |
fb40c209 | 1453 | total_bytes = word_size * nr_rows * nr_cols; |
2e94c453 | 1454 | mbuf = xcalloc (total_bytes, 1); |
b8c9b27d | 1455 | make_cleanup (xfree, mbuf); |
cf7a04e8 | 1456 | |
a4261689 PA |
1457 | /* Dispatch memory reads to the topmost target, not the flattened |
1458 | current_target. */ | |
8dedea02 VP |
1459 | nr_bytes = target_read (current_target.beneath, |
1460 | TARGET_OBJECT_MEMORY, NULL, mbuf, | |
1461 | addr, total_bytes); | |
cf7a04e8 | 1462 | if (nr_bytes <= 0) |
7ea6d463 | 1463 | error (_("Unable to read memory.")); |
fb40c209 | 1464 | |
41296c92 | 1465 | /* Output the header information. */ |
5af949e3 | 1466 | ui_out_field_core_addr (uiout, "addr", gdbarch, addr); |
fb40c209 AC |
1467 | ui_out_field_int (uiout, "nr-bytes", nr_bytes); |
1468 | ui_out_field_int (uiout, "total-bytes", total_bytes); | |
5af949e3 UW |
1469 | ui_out_field_core_addr (uiout, "next-row", |
1470 | gdbarch, addr + word_size * nr_cols); | |
1471 | ui_out_field_core_addr (uiout, "prev-row", | |
1472 | gdbarch, addr - word_size * nr_cols); | |
1473 | ui_out_field_core_addr (uiout, "next-page", gdbarch, addr + total_bytes); | |
1474 | ui_out_field_core_addr (uiout, "prev-page", gdbarch, addr - total_bytes); | |
fb40c209 | 1475 | |
41296c92 | 1476 | /* Build the result as a two dimentional table. */ |
fb40c209 | 1477 | { |
f99d8bf4 PA |
1478 | struct ui_file *stream; |
1479 | struct cleanup *cleanup_stream; | |
fb40c209 AC |
1480 | int row; |
1481 | int row_byte; | |
102040f0 | 1482 | |
f99d8bf4 PA |
1483 | stream = mem_fileopen (); |
1484 | cleanup_stream = make_cleanup_ui_file_delete (stream); | |
1485 | ||
1486 | make_cleanup_ui_out_list_begin_end (uiout, "memory"); | |
fb40c209 AC |
1487 | for (row = 0, row_byte = 0; |
1488 | row < nr_rows; | |
1489 | row++, row_byte += nr_cols * word_size) | |
1490 | { | |
1491 | int col; | |
1492 | int col_byte; | |
6ad4a2cf JJ |
1493 | struct cleanup *cleanup_tuple; |
1494 | struct cleanup *cleanup_list_data; | |
79a45b7d TT |
1495 | struct value_print_options opts; |
1496 | ||
6ad4a2cf | 1497 | cleanup_tuple = make_cleanup_ui_out_tuple_begin_end (uiout, NULL); |
5af949e3 | 1498 | ui_out_field_core_addr (uiout, "addr", gdbarch, addr + row_byte); |
9a2b4c1b MS |
1499 | /* ui_out_field_core_addr_symbolic (uiout, "saddr", addr + |
1500 | row_byte); */ | |
6ad4a2cf | 1501 | cleanup_list_data = make_cleanup_ui_out_list_begin_end (uiout, "data"); |
79a45b7d | 1502 | get_formatted_print_options (&opts, word_format); |
fb40c209 AC |
1503 | for (col = 0, col_byte = row_byte; |
1504 | col < nr_cols; | |
1505 | col++, col_byte += word_size) | |
1506 | { | |
1507 | if (col_byte + word_size > nr_bytes) | |
1508 | { | |
1509 | ui_out_field_string (uiout, NULL, "N/A"); | |
1510 | } | |
1511 | else | |
1512 | { | |
f99d8bf4 | 1513 | ui_file_rewind (stream); |
79a45b7d | 1514 | print_scalar_formatted (mbuf + col_byte, word_type, &opts, |
f99d8bf4 | 1515 | word_asize, stream); |
fb40c209 AC |
1516 | ui_out_field_stream (uiout, NULL, stream); |
1517 | } | |
1518 | } | |
6ad4a2cf | 1519 | do_cleanups (cleanup_list_data); |
fb40c209 AC |
1520 | if (aschar) |
1521 | { | |
1522 | int byte; | |
102040f0 | 1523 | |
f99d8bf4 | 1524 | ui_file_rewind (stream); |
9a2b4c1b MS |
1525 | for (byte = row_byte; |
1526 | byte < row_byte + word_size * nr_cols; byte++) | |
fb40c209 AC |
1527 | { |
1528 | if (byte >= nr_bytes) | |
f99d8bf4 | 1529 | fputc_unfiltered ('X', stream); |
fb40c209 | 1530 | else if (mbuf[byte] < 32 || mbuf[byte] > 126) |
f99d8bf4 | 1531 | fputc_unfiltered (aschar, stream); |
fb40c209 | 1532 | else |
f99d8bf4 | 1533 | fputc_unfiltered (mbuf[byte], stream); |
fb40c209 AC |
1534 | } |
1535 | ui_out_field_stream (uiout, "ascii", stream); | |
1536 | } | |
6ad4a2cf | 1537 | do_cleanups (cleanup_tuple); |
fb40c209 | 1538 | } |
f99d8bf4 | 1539 | do_cleanups (cleanup_stream); |
fb40c209 AC |
1540 | } |
1541 | do_cleanups (cleanups); | |
fb40c209 AC |
1542 | } |
1543 | ||
8dedea02 VP |
1544 | void |
1545 | mi_cmd_data_read_memory_bytes (char *command, char **argv, int argc) | |
1546 | { | |
1547 | struct gdbarch *gdbarch = get_current_arch (); | |
79a45e25 | 1548 | struct ui_out *uiout = current_uiout; |
8dedea02 VP |
1549 | struct cleanup *cleanups; |
1550 | CORE_ADDR addr; | |
1551 | LONGEST length; | |
1552 | memory_read_result_s *read_result; | |
1553 | int ix; | |
1554 | VEC(memory_read_result_s) *result; | |
1555 | long offset = 0; | |
56934ab1 AS |
1556 | int oind = 0; |
1557 | char *oarg; | |
8dedea02 | 1558 | enum opt |
8dedea02 | 1559 | { |
2b03b41d | 1560 | OFFSET_OPT |
8dedea02 | 1561 | }; |
2b03b41d SS |
1562 | static const struct mi_opt opts[] = |
1563 | { | |
1564 | {"o", OFFSET_OPT, 1}, | |
1565 | { 0, 0, 0 } | |
1566 | }; | |
8dedea02 VP |
1567 | |
1568 | while (1) | |
1569 | { | |
1b05df00 | 1570 | int opt = mi_getopt ("-data-read-memory-bytes", argc, argv, opts, |
56934ab1 | 1571 | &oind, &oarg); |
8dedea02 VP |
1572 | if (opt < 0) |
1573 | break; | |
1574 | switch ((enum opt) opt) | |
1575 | { | |
1576 | case OFFSET_OPT: | |
56934ab1 | 1577 | offset = atol (oarg); |
8dedea02 VP |
1578 | break; |
1579 | } | |
1580 | } | |
56934ab1 AS |
1581 | argv += oind; |
1582 | argc -= oind; | |
8dedea02 VP |
1583 | |
1584 | if (argc != 2) | |
7ea6d463 | 1585 | error (_("Usage: [ -o OFFSET ] ADDR LENGTH.")); |
8dedea02 VP |
1586 | |
1587 | addr = parse_and_eval_address (argv[0]) + offset; | |
1588 | length = atol (argv[1]); | |
1589 | ||
1590 | result = read_memory_robust (current_target.beneath, addr, length); | |
1591 | ||
1592 | cleanups = make_cleanup (free_memory_read_result_vector, result); | |
1593 | ||
1594 | if (VEC_length (memory_read_result_s, result) == 0) | |
7ea6d463 | 1595 | error (_("Unable to read memory.")); |
8dedea02 VP |
1596 | |
1597 | make_cleanup_ui_out_list_begin_end (uiout, "memory"); | |
1598 | for (ix = 0; | |
1599 | VEC_iterate (memory_read_result_s, result, ix, read_result); | |
1600 | ++ix) | |
1601 | { | |
1602 | struct cleanup *t = make_cleanup_ui_out_tuple_begin_end (uiout, NULL); | |
1603 | char *data, *p; | |
1604 | int i; | |
1605 | ||
1606 | ui_out_field_core_addr (uiout, "begin", gdbarch, read_result->begin); | |
1607 | ui_out_field_core_addr (uiout, "offset", gdbarch, read_result->begin | |
1608 | - addr); | |
1609 | ui_out_field_core_addr (uiout, "end", gdbarch, read_result->end); | |
1610 | ||
1611 | data = xmalloc ((read_result->end - read_result->begin) * 2 + 1); | |
1612 | ||
1613 | for (i = 0, p = data; | |
1614 | i < (read_result->end - read_result->begin); | |
1615 | ++i, p += 2) | |
1616 | { | |
1617 | sprintf (p, "%02x", read_result->data[i]); | |
1618 | } | |
1619 | ui_out_field_string (uiout, "contents", data); | |
1620 | xfree (data); | |
1621 | do_cleanups (t); | |
1622 | } | |
1623 | do_cleanups (cleanups); | |
1624 | } | |
1625 | ||
2b03b41d | 1626 | /* Implementation of the -data-write_memory command. |
fb40c209 | 1627 | |
177b42fe | 1628 | COLUMN_OFFSET: optional argument. Must be preceded by '-o'. The |
fb40c209 AC |
1629 | offset from the beginning of the memory grid row where the cell to |
1630 | be written is. | |
1631 | ADDR: start address of the row in the memory grid where the memory | |
41296c92 | 1632 | cell is, if OFFSET_COLUMN is specified. Otherwise, the address of |
fb40c209 | 1633 | the location to write to. |
41296c92 | 1634 | FORMAT: a char indicating format for the ``word''. See |
fb40c209 AC |
1635 | the ``x'' command. |
1636 | WORD_SIZE: size of each ``word''; 1,2,4, or 8 bytes | |
1637 | VALUE: value to be written into the memory address. | |
1638 | ||
1639 | Writes VALUE into ADDR + (COLUMN_OFFSET * WORD_SIZE). | |
1640 | ||
41296c92 | 1641 | Prints nothing. */ |
2b03b41d | 1642 | |
ce8f13f8 | 1643 | void |
fb40c209 AC |
1644 | mi_cmd_data_write_memory (char *command, char **argv, int argc) |
1645 | { | |
e17a4113 UW |
1646 | struct gdbarch *gdbarch = get_current_arch (); |
1647 | enum bfd_endian byte_order = gdbarch_byte_order (gdbarch); | |
fb40c209 | 1648 | CORE_ADDR addr; |
fb40c209 AC |
1649 | long word_size; |
1650 | /* FIXME: ezannoni 2000-02-17 LONGEST could possibly not be big | |
41296c92 | 1651 | enough when using a compiler other than GCC. */ |
fb40c209 | 1652 | LONGEST value; |
d8bf3afa KB |
1653 | void *buffer; |
1654 | struct cleanup *old_chain; | |
fb40c209 | 1655 | long offset = 0; |
56934ab1 AS |
1656 | int oind = 0; |
1657 | char *oarg; | |
fb40c209 | 1658 | enum opt |
fb40c209 | 1659 | { |
2b03b41d | 1660 | OFFSET_OPT |
fb40c209 | 1661 | }; |
2b03b41d SS |
1662 | static const struct mi_opt opts[] = |
1663 | { | |
1664 | {"o", OFFSET_OPT, 1}, | |
1665 | { 0, 0, 0 } | |
1666 | }; | |
fb40c209 AC |
1667 | |
1668 | while (1) | |
1669 | { | |
1b05df00 | 1670 | int opt = mi_getopt ("-data-write-memory", argc, argv, opts, |
56934ab1 | 1671 | &oind, &oarg); |
102040f0 | 1672 | |
fb40c209 AC |
1673 | if (opt < 0) |
1674 | break; | |
1675 | switch ((enum opt) opt) | |
1676 | { | |
1677 | case OFFSET_OPT: | |
56934ab1 | 1678 | offset = atol (oarg); |
fb40c209 AC |
1679 | break; |
1680 | } | |
1681 | } | |
56934ab1 AS |
1682 | argv += oind; |
1683 | argc -= oind; | |
fb40c209 AC |
1684 | |
1685 | if (argc != 4) | |
7ea6d463 PM |
1686 | error (_("-data-write-memory: Usage: " |
1687 | "[-o COLUMN_OFFSET] ADDR FORMAT WORD-SIZE VALUE.")); | |
fb40c209 | 1688 | |
41296c92 NR |
1689 | /* Extract all the arguments. */ |
1690 | /* Start address of the memory dump. */ | |
fb40c209 | 1691 | addr = parse_and_eval_address (argv[0]); |
2b03b41d | 1692 | /* The size of the memory word. */ |
fb40c209 AC |
1693 | word_size = atol (argv[2]); |
1694 | ||
41296c92 | 1695 | /* Calculate the real address of the write destination. */ |
fb40c209 AC |
1696 | addr += (offset * word_size); |
1697 | ||
41296c92 | 1698 | /* Get the value as a number. */ |
fb40c209 | 1699 | value = parse_and_eval_address (argv[3]); |
41296c92 | 1700 | /* Get the value into an array. */ |
d8bf3afa KB |
1701 | buffer = xmalloc (word_size); |
1702 | old_chain = make_cleanup (xfree, buffer); | |
e17a4113 | 1703 | store_signed_integer (buffer, word_size, byte_order, value); |
41296c92 | 1704 | /* Write it down to memory. */ |
4c2786ba | 1705 | write_memory_with_notification (addr, buffer, word_size); |
d8bf3afa KB |
1706 | /* Free the buffer. */ |
1707 | do_cleanups (old_chain); | |
fb40c209 AC |
1708 | } |
1709 | ||
2b03b41d | 1710 | /* Implementation of the -data-write-memory-bytes command. |
8dedea02 VP |
1711 | |
1712 | ADDR: start address | |
62747a60 TT |
1713 | DATA: string of bytes to write at that address |
1714 | COUNT: number of bytes to be filled (decimal integer). */ | |
2b03b41d | 1715 | |
8dedea02 VP |
1716 | void |
1717 | mi_cmd_data_write_memory_bytes (char *command, char **argv, int argc) | |
1718 | { | |
1719 | CORE_ADDR addr; | |
1720 | char *cdata; | |
1721 | gdb_byte *data; | |
62747a60 | 1722 | gdb_byte *databuf; |
5799c0b9 | 1723 | size_t len, i, steps, remainder; |
62747a60 | 1724 | long int count, j; |
8dedea02 VP |
1725 | struct cleanup *back_to; |
1726 | ||
62747a60 TT |
1727 | if (argc != 2 && argc != 3) |
1728 | error (_("Usage: ADDR DATA [COUNT].")); | |
8dedea02 VP |
1729 | |
1730 | addr = parse_and_eval_address (argv[0]); | |
1731 | cdata = argv[1]; | |
1ae0c35e YQ |
1732 | if (strlen (cdata) % 2) |
1733 | error (_("Hex-encoded '%s' must have an even number of characters."), | |
1734 | cdata); | |
1735 | ||
8dedea02 | 1736 | len = strlen (cdata)/2; |
62747a60 TT |
1737 | if (argc == 3) |
1738 | count = strtoul (argv[2], NULL, 10); | |
1739 | else | |
1740 | count = len; | |
8dedea02 | 1741 | |
62747a60 TT |
1742 | databuf = xmalloc (len * sizeof (gdb_byte)); |
1743 | back_to = make_cleanup (xfree, databuf); | |
8dedea02 VP |
1744 | |
1745 | for (i = 0; i < len; ++i) | |
1746 | { | |
1747 | int x; | |
62747a60 TT |
1748 | if (sscanf (cdata + i * 2, "%02x", &x) != 1) |
1749 | error (_("Invalid argument")); | |
1750 | databuf[i] = (gdb_byte) x; | |
1751 | } | |
1752 | ||
1753 | if (len < count) | |
1754 | { | |
1755 | /* Pattern is made of less bytes than count: | |
1756 | repeat pattern to fill memory. */ | |
1757 | data = xmalloc (count); | |
1758 | make_cleanup (xfree, data); | |
1759 | ||
1760 | steps = count / len; | |
1761 | remainder = count % len; | |
1762 | for (j = 0; j < steps; j++) | |
1763 | memcpy (data + j * len, databuf, len); | |
1764 | ||
1765 | if (remainder > 0) | |
1766 | memcpy (data + steps * len, databuf, remainder); | |
1767 | } | |
1768 | else | |
1769 | { | |
1770 | /* Pattern is longer than or equal to count: | |
1771 | just copy len bytes. */ | |
1772 | data = databuf; | |
8dedea02 VP |
1773 | } |
1774 | ||
62747a60 | 1775 | write_memory_with_notification (addr, data, count); |
8dedea02 VP |
1776 | |
1777 | do_cleanups (back_to); | |
1778 | } | |
1779 | ||
ce8f13f8 | 1780 | void |
d8c83789 NR |
1781 | mi_cmd_enable_timings (char *command, char **argv, int argc) |
1782 | { | |
1783 | if (argc == 0) | |
1784 | do_timings = 1; | |
1785 | else if (argc == 1) | |
1786 | { | |
1787 | if (strcmp (argv[0], "yes") == 0) | |
1788 | do_timings = 1; | |
1789 | else if (strcmp (argv[0], "no") == 0) | |
1790 | do_timings = 0; | |
1791 | else | |
1792 | goto usage_error; | |
1793 | } | |
1794 | else | |
1795 | goto usage_error; | |
1796 | ||
ce8f13f8 | 1797 | return; |
d8c83789 NR |
1798 | |
1799 | usage_error: | |
7ea6d463 | 1800 | error (_("-enable-timings: Usage: %s {yes|no}"), command); |
d8c83789 NR |
1801 | } |
1802 | ||
ce8f13f8 | 1803 | void |
084344da VP |
1804 | mi_cmd_list_features (char *command, char **argv, int argc) |
1805 | { | |
1806 | if (argc == 0) | |
1807 | { | |
1808 | struct cleanup *cleanup = NULL; | |
79a45e25 | 1809 | struct ui_out *uiout = current_uiout; |
084344da | 1810 | |
102040f0 | 1811 | cleanup = make_cleanup_ui_out_list_begin_end (uiout, "features"); |
084344da | 1812 | ui_out_field_string (uiout, NULL, "frozen-varobjs"); |
8b4ed427 | 1813 | ui_out_field_string (uiout, NULL, "pending-breakpoints"); |
8e8901c5 | 1814 | ui_out_field_string (uiout, NULL, "thread-info"); |
8dedea02 | 1815 | ui_out_field_string (uiout, NULL, "data-read-memory-bytes"); |
39c4d40a | 1816 | ui_out_field_string (uiout, NULL, "breakpoint-notifications"); |
75082e8c | 1817 | ui_out_field_string (uiout, NULL, "ada-task-info"); |
084344da | 1818 | |
b6313243 | 1819 | #if HAVE_PYTHON |
0646da15 TT |
1820 | if (gdb_python_initialized) |
1821 | ui_out_field_string (uiout, NULL, "python"); | |
b6313243 TT |
1822 | #endif |
1823 | ||
084344da | 1824 | do_cleanups (cleanup); |
ce8f13f8 | 1825 | return; |
084344da VP |
1826 | } |
1827 | ||
7ea6d463 | 1828 | error (_("-list-features should be passed no arguments")); |
084344da | 1829 | } |
c6ebd6cf VP |
1830 | |
1831 | void | |
1832 | mi_cmd_list_target_features (char *command, char **argv, int argc) | |
1833 | { | |
1834 | if (argc == 0) | |
1835 | { | |
1836 | struct cleanup *cleanup = NULL; | |
79a45e25 | 1837 | struct ui_out *uiout = current_uiout; |
c6ebd6cf | 1838 | |
102040f0 | 1839 | cleanup = make_cleanup_ui_out_list_begin_end (uiout, "features"); |
c6ebd6cf VP |
1840 | if (target_can_async_p ()) |
1841 | ui_out_field_string (uiout, NULL, "async"); | |
f75d858b MK |
1842 | if (target_can_execute_reverse) |
1843 | ui_out_field_string (uiout, NULL, "reverse"); | |
c6ebd6cf VP |
1844 | |
1845 | do_cleanups (cleanup); | |
1846 | return; | |
1847 | } | |
1848 | ||
7ea6d463 | 1849 | error (_("-list-target-features should be passed no arguments")); |
c6ebd6cf VP |
1850 | } |
1851 | ||
a79b8f6e VP |
1852 | void |
1853 | mi_cmd_add_inferior (char *command, char **argv, int argc) | |
1854 | { | |
1855 | struct inferior *inf; | |
1856 | ||
1857 | if (argc != 0) | |
1858 | error (_("-add-inferior should be passed no arguments")); | |
1859 | ||
1860 | inf = add_inferior_with_spaces (); | |
1861 | ||
79a45e25 | 1862 | ui_out_field_fmt (current_uiout, "inferior", "i%d", inf->num); |
a79b8f6e VP |
1863 | } |
1864 | ||
2b03b41d SS |
1865 | /* Callback used to find the first inferior other than the current |
1866 | one. */ | |
57bf2d7e MK |
1867 | |
1868 | static int | |
1869 | get_other_inferior (struct inferior *inf, void *arg) | |
1870 | { | |
1871 | if (inf == current_inferior ()) | |
1872 | return 0; | |
1873 | ||
1874 | return 1; | |
1875 | } | |
1876 | ||
a79b8f6e VP |
1877 | void |
1878 | mi_cmd_remove_inferior (char *command, char **argv, int argc) | |
1879 | { | |
1880 | int id; | |
1881 | struct inferior *inf; | |
1882 | ||
1883 | if (argc != 1) | |
7ea6d463 | 1884 | error (_("-remove-inferior should be passed a single argument")); |
a79b8f6e | 1885 | |
e2b4a699 | 1886 | if (sscanf (argv[0], "i%d", &id) != 1) |
7ea6d463 | 1887 | error (_("the thread group id is syntactically invalid")); |
a79b8f6e VP |
1888 | |
1889 | inf = find_inferior_id (id); | |
1890 | if (!inf) | |
7ea6d463 | 1891 | error (_("the specified thread group does not exist")); |
a79b8f6e | 1892 | |
8fa067af | 1893 | if (inf->pid != 0) |
81ec3cce | 1894 | error (_("cannot remove an active inferior")); |
8fa067af | 1895 | |
57bf2d7e MK |
1896 | if (inf == current_inferior ()) |
1897 | { | |
1898 | struct thread_info *tp = 0; | |
1899 | struct inferior *new_inferior | |
1900 | = iterate_over_inferiors (get_other_inferior, NULL); | |
1901 | ||
1902 | if (new_inferior == NULL) | |
1903 | error (_("Cannot remove last inferior")); | |
1904 | ||
1905 | set_current_inferior (new_inferior); | |
1906 | if (new_inferior->pid != 0) | |
1907 | tp = any_thread_of_process (new_inferior->pid); | |
1908 | switch_to_thread (tp ? tp->ptid : null_ptid); | |
1909 | set_current_program_space (new_inferior->pspace); | |
1910 | } | |
1911 | ||
a79b8f6e VP |
1912 | delete_inferior_1 (inf, 1 /* silent */); |
1913 | } | |
1914 | ||
1915 | \f | |
1916 | ||
8d34ea23 KS |
1917 | /* Execute a command within a safe environment. |
1918 | Return <0 for error; >=0 for ok. | |
1919 | ||
1920 | args->action will tell mi_execute_command what action | |
42972f50 | 1921 | to perfrom after the given command has executed (display/suppress |
2b03b41d | 1922 | prompt, display error). */ |
fb40c209 | 1923 | |
f30f06b8 | 1924 | static void |
04bd08de | 1925 | captured_mi_execute_command (struct ui_out *uiout, struct mi_parse *context) |
fb40c209 | 1926 | { |
1f31650a | 1927 | struct cleanup *cleanup; |
fb40c209 | 1928 | |
4333ada3 VP |
1929 | if (do_timings) |
1930 | current_command_ts = context->cmd_start; | |
d8c83789 | 1931 | |
1f31650a VP |
1932 | current_token = xstrdup (context->token); |
1933 | cleanup = make_cleanup (free_current_contents, ¤t_token); | |
1934 | ||
a2840c35 | 1935 | running_result_record_printed = 0; |
f3b1572e | 1936 | mi_proceeded = 0; |
fb40c209 AC |
1937 | switch (context->op) |
1938 | { | |
fb40c209 | 1939 | case MI_COMMAND: |
41296c92 | 1940 | /* A MI command was read from the input stream. */ |
fb40c209 AC |
1941 | if (mi_debug_p) |
1942 | /* FIXME: gdb_???? */ | |
1943 | fprintf_unfiltered (raw_stdout, " token=`%s' command=`%s' args=`%s'\n", | |
1944 | context->token, context->command, context->args); | |
d8c83789 | 1945 | |
ce8f13f8 | 1946 | mi_cmd_execute (context); |
8d34ea23 | 1947 | |
a2840c35 | 1948 | /* Print the result if there were no errors. |
4389a95a | 1949 | |
a2840c35 | 1950 | Remember that on the way out of executing a command, you have |
2b03b41d SS |
1951 | to directly use the mi_interp's uiout, since the command |
1952 | could have reset the interpreter, in which case the current | |
1953 | uiout will most likely crash in the mi_out_* routines. */ | |
ce8f13f8 | 1954 | if (!running_result_record_printed) |
a2840c35 VP |
1955 | { |
1956 | fputs_unfiltered (context->token, raw_stdout); | |
ce8f13f8 VP |
1957 | /* There's no particularly good reason why target-connect results |
1958 | in not ^done. Should kill ^connected for MI3. */ | |
1959 | fputs_unfiltered (strcmp (context->command, "target-select") == 0 | |
1960 | ? "^connected" : "^done", raw_stdout); | |
a2840c35 VP |
1961 | mi_out_put (uiout, raw_stdout); |
1962 | mi_out_rewind (uiout); | |
4333ada3 | 1963 | mi_print_timing_maybe (); |
a2840c35 VP |
1964 | fputs_unfiltered ("\n", raw_stdout); |
1965 | } | |
1966 | else | |
2b03b41d SS |
1967 | /* The command does not want anything to be printed. In that |
1968 | case, the command probably should not have written anything | |
1969 | to uiout, but in case it has written something, discard it. */ | |
a2840c35 | 1970 | mi_out_rewind (uiout); |
fb40c209 AC |
1971 | break; |
1972 | ||
1973 | case CLI_COMMAND: | |
78f5381d AC |
1974 | { |
1975 | char *argv[2]; | |
102040f0 | 1976 | |
78f5381d AC |
1977 | /* A CLI command was read from the input stream. */ |
1978 | /* This "feature" will be removed as soon as we have a | |
1979 | complete set of mi commands. */ | |
1980 | /* Echo the command on the console. */ | |
1981 | fprintf_unfiltered (gdb_stdlog, "%s\n", context->command); | |
1982 | /* Call the "console" interpreter. */ | |
1983 | argv[0] = "console"; | |
1984 | argv[1] = context->command; | |
ce8f13f8 | 1985 | mi_cmd_interpreter_exec ("-interpreter-exec", argv, 2); |
78f5381d | 1986 | |
eec01795 | 1987 | /* If we changed interpreters, DON'T print out anything. */ |
78f5381d AC |
1988 | if (current_interp_named_p (INTERP_MI) |
1989 | || current_interp_named_p (INTERP_MI1) | |
1990 | || current_interp_named_p (INTERP_MI2) | |
1991 | || current_interp_named_p (INTERP_MI3)) | |
1992 | { | |
ce8f13f8 | 1993 | if (!running_result_record_printed) |
eec01795 DJ |
1994 | { |
1995 | fputs_unfiltered (context->token, raw_stdout); | |
1996 | fputs_unfiltered ("^done", raw_stdout); | |
1997 | mi_out_put (uiout, raw_stdout); | |
1998 | mi_out_rewind (uiout); | |
4333ada3 VP |
1999 | mi_print_timing_maybe (); |
2000 | fputs_unfiltered ("\n", raw_stdout); | |
eec01795 | 2001 | } |
eec01795 DJ |
2002 | else |
2003 | mi_out_rewind (uiout); | |
78f5381d AC |
2004 | } |
2005 | break; | |
2006 | } | |
fb40c209 | 2007 | } |
8d34ea23 | 2008 | |
1f31650a | 2009 | do_cleanups (cleanup); |
fb40c209 AC |
2010 | } |
2011 | ||
305aeedc TT |
2012 | /* Print a gdb exception to the MI output stream. */ |
2013 | ||
2014 | static void | |
2015 | mi_print_exception (const char *token, struct gdb_exception exception) | |
2016 | { | |
2017 | fputs_unfiltered (token, raw_stdout); | |
2018 | fputs_unfiltered ("^error,msg=\"", raw_stdout); | |
2019 | if (exception.message == NULL) | |
2020 | fputs_unfiltered ("unknown error", raw_stdout); | |
2021 | else | |
2022 | fputstr_unfiltered (exception.message, '"', raw_stdout); | |
2023 | fputs_unfiltered ("\"\n", raw_stdout); | |
2024 | } | |
fb40c209 AC |
2025 | |
2026 | void | |
ee047554 | 2027 | mi_execute_command (const char *cmd, int from_tty) |
fb40c209 | 2028 | { |
305aeedc TT |
2029 | char *token; |
2030 | struct mi_parse *command = NULL; | |
2031 | volatile struct gdb_exception exception; | |
fb40c209 | 2032 | |
41296c92 NR |
2033 | /* This is to handle EOF (^D). We just quit gdb. */ |
2034 | /* FIXME: we should call some API function here. */ | |
fb40c209 AC |
2035 | if (cmd == 0) |
2036 | quit_force (NULL, from_tty); | |
2037 | ||
11334b82 VP |
2038 | target_log_command (cmd); |
2039 | ||
305aeedc TT |
2040 | TRY_CATCH (exception, RETURN_MASK_ALL) |
2041 | { | |
2042 | command = mi_parse (cmd, &token); | |
2043 | } | |
2044 | if (exception.reason < 0) | |
2045 | { | |
2046 | mi_print_exception (token, exception); | |
2047 | xfree (token); | |
2048 | } | |
2049 | else | |
fb40c209 | 2050 | { |
04bd08de | 2051 | volatile struct gdb_exception result; |
66bb093b | 2052 | ptid_t previous_ptid = inferior_ptid; |
d8c83789 | 2053 | |
305aeedc TT |
2054 | command->token = token; |
2055 | ||
d8c83789 NR |
2056 | if (do_timings) |
2057 | { | |
2058 | command->cmd_start = (struct mi_timestamp *) | |
2059 | xmalloc (sizeof (struct mi_timestamp)); | |
2060 | timestamp (command->cmd_start); | |
2061 | } | |
2062 | ||
04bd08de TT |
2063 | TRY_CATCH (result, RETURN_MASK_ALL) |
2064 | { | |
79a45e25 | 2065 | captured_mi_execute_command (current_uiout, command); |
04bd08de | 2066 | } |
ce43223b | 2067 | if (result.reason < 0) |
fb40c209 | 2068 | { |
fb40c209 | 2069 | /* The command execution failed and error() was called |
589e074d | 2070 | somewhere. */ |
305aeedc | 2071 | mi_print_exception (command->token, result); |
79a45e25 | 2072 | mi_out_rewind (current_uiout); |
fb40c209 | 2073 | } |
a13e061a | 2074 | |
5d4e2b76 VP |
2075 | bpstat_do_actions (); |
2076 | ||
66bb093b VP |
2077 | if (/* The notifications are only output when the top-level |
2078 | interpreter (specified on the command line) is MI. */ | |
2079 | ui_out_is_mi_like_p (interp_ui_out (top_level_interpreter ())) | |
2080 | /* Don't try report anything if there are no threads -- | |
2081 | the program is dead. */ | |
2082 | && thread_count () != 0 | |
2083 | /* -thread-select explicitly changes thread. If frontend uses that | |
2084 | internally, we don't want to emit =thread-selected, since | |
2085 | =thread-selected is supposed to indicate user's intentions. */ | |
2086 | && strcmp (command->command, "thread-select") != 0) | |
2087 | { | |
2088 | struct mi_interp *mi = top_level_interpreter_data (); | |
d729566a | 2089 | int report_change = 0; |
66bb093b VP |
2090 | |
2091 | if (command->thread == -1) | |
2092 | { | |
d729566a PA |
2093 | report_change = (!ptid_equal (previous_ptid, null_ptid) |
2094 | && !ptid_equal (inferior_ptid, previous_ptid) | |
2095 | && !ptid_equal (inferior_ptid, null_ptid)); | |
66bb093b | 2096 | } |
d729566a | 2097 | else if (!ptid_equal (inferior_ptid, null_ptid)) |
66bb093b | 2098 | { |
d729566a | 2099 | struct thread_info *ti = inferior_thread (); |
102040f0 | 2100 | |
66bb093b VP |
2101 | report_change = (ti->num != command->thread); |
2102 | } | |
2103 | ||
2104 | if (report_change) | |
2105 | { | |
d729566a | 2106 | struct thread_info *ti = inferior_thread (); |
102040f0 | 2107 | |
66bb093b VP |
2108 | target_terminal_ours (); |
2109 | fprintf_unfiltered (mi->event_channel, | |
2110 | "thread-selected,id=\"%d\"", | |
2111 | ti->num); | |
2112 | gdb_flush (mi->event_channel); | |
2113 | } | |
2114 | } | |
2115 | ||
fb40c209 AC |
2116 | mi_parse_free (command); |
2117 | } | |
fb40c209 AC |
2118 | } |
2119 | ||
ce8f13f8 | 2120 | static void |
fb40c209 AC |
2121 | mi_cmd_execute (struct mi_parse *parse) |
2122 | { | |
f107f563 | 2123 | struct cleanup *cleanup; |
e23110bb | 2124 | |
028d0ed5 | 2125 | cleanup = prepare_execute_command (); |
1b98914a | 2126 | |
a79b8f6e VP |
2127 | if (parse->all && parse->thread_group != -1) |
2128 | error (_("Cannot specify --thread-group together with --all")); | |
2129 | ||
2130 | if (parse->all && parse->thread != -1) | |
2131 | error (_("Cannot specify --thread together with --all")); | |
2132 | ||
2133 | if (parse->thread_group != -1 && parse->thread != -1) | |
2134 | error (_("Cannot specify --thread together with --thread-group")); | |
2135 | ||
1e92afda VP |
2136 | if (parse->frame != -1 && parse->thread == -1) |
2137 | error (_("Cannot specify --frame without --thread")); | |
dcf4fbde | 2138 | |
a79b8f6e VP |
2139 | if (parse->thread_group != -1) |
2140 | { | |
2141 | struct inferior *inf = find_inferior_id (parse->thread_group); | |
2142 | struct thread_info *tp = 0; | |
2143 | ||
2144 | if (!inf) | |
46ef47e5 | 2145 | error (_("Invalid thread group for the --thread-group option")); |
a79b8f6e VP |
2146 | |
2147 | set_current_inferior (inf); | |
2148 | /* This behaviour means that if --thread-group option identifies | |
2b03b41d SS |
2149 | an inferior with multiple threads, then a random one will be |
2150 | picked. This is not a problem -- frontend should always | |
2151 | provide --thread if it wishes to operate on a specific | |
2152 | thread. */ | |
a79b8f6e | 2153 | if (inf->pid != 0) |
4734f50e | 2154 | tp = any_live_thread_of_process (inf->pid); |
a79b8f6e VP |
2155 | switch_to_thread (tp ? tp->ptid : null_ptid); |
2156 | set_current_program_space (inf->pspace); | |
2157 | } | |
2158 | ||
1e92afda VP |
2159 | if (parse->thread != -1) |
2160 | { | |
2161 | struct thread_info *tp = find_thread_id (parse->thread); | |
102040f0 | 2162 | |
1e92afda VP |
2163 | if (!tp) |
2164 | error (_("Invalid thread id: %d"), parse->thread); | |
dcf4fbde PA |
2165 | |
2166 | if (is_exited (tp->ptid)) | |
2167 | error (_("Thread id: %d has terminated"), parse->thread); | |
2168 | ||
2169 | switch_to_thread (tp->ptid); | |
1e92afda | 2170 | } |
dcf4fbde | 2171 | |
1e92afda VP |
2172 | if (parse->frame != -1) |
2173 | { | |
2174 | struct frame_info *fid; | |
2175 | int frame = parse->frame; | |
102040f0 | 2176 | |
1e92afda VP |
2177 | fid = find_relative_frame (get_current_frame (), &frame); |
2178 | if (frame == 0) | |
2179 | /* find_relative_frame was successful */ | |
2180 | select_frame (fid); | |
2181 | else | |
ea069267 | 2182 | error (_("Invalid frame id: %d"), frame); |
1e92afda | 2183 | } |
dcf4fbde | 2184 | |
a79b8f6e VP |
2185 | current_context = parse; |
2186 | ||
648beb2b | 2187 | if (parse->cmd->suppress_notification != NULL) |
8d3788bd | 2188 | { |
648beb2b YQ |
2189 | make_cleanup_restore_integer (parse->cmd->suppress_notification); |
2190 | *parse->cmd->suppress_notification = 1; | |
8d3788bd VP |
2191 | } |
2192 | ||
9e22b03a | 2193 | if (parse->cmd->argv_func != NULL) |
8d3788bd VP |
2194 | { |
2195 | parse->cmd->argv_func (parse->command, parse->argv, parse->argc); | |
2196 | } | |
b2af646b | 2197 | else if (parse->cmd->cli.cmd != 0) |
fb40c209 AC |
2198 | { |
2199 | /* FIXME: DELETE THIS. */ | |
41296c92 NR |
2200 | /* The operation is still implemented by a cli command. */ |
2201 | /* Must be a synchronous one. */ | |
b2af646b AC |
2202 | mi_execute_cli_command (parse->cmd->cli.cmd, parse->cmd->cli.args_p, |
2203 | parse->args); | |
fb40c209 AC |
2204 | } |
2205 | else | |
2206 | { | |
41296c92 | 2207 | /* FIXME: DELETE THIS. */ |
a13e061a PA |
2208 | struct ui_file *stb; |
2209 | ||
2210 | stb = mem_fileopen (); | |
2211 | ||
2212 | fputs_unfiltered ("Undefined mi command: ", stb); | |
2213 | fputstr_unfiltered (parse->command, '"', stb); | |
2214 | fputs_unfiltered (" (missing implementation)", stb); | |
2215 | ||
2216 | make_cleanup_ui_file_delete (stb); | |
2217 | error_stream (stb); | |
fb40c209 | 2218 | } |
1b98914a | 2219 | do_cleanups (cleanup); |
fb40c209 AC |
2220 | } |
2221 | ||
fb40c209 | 2222 | /* FIXME: This is just a hack so we can get some extra commands going. |
41296c92 NR |
2223 | We don't want to channel things through the CLI, but call libgdb directly. |
2224 | Use only for synchronous commands. */ | |
fb40c209 AC |
2225 | |
2226 | void | |
b2af646b | 2227 | mi_execute_cli_command (const char *cmd, int args_p, const char *args) |
fb40c209 | 2228 | { |
b2af646b | 2229 | if (cmd != 0) |
fb40c209 AC |
2230 | { |
2231 | struct cleanup *old_cleanups; | |
2232 | char *run; | |
102040f0 | 2233 | |
b2af646b | 2234 | if (args_p) |
c6902d46 | 2235 | run = xstrprintf ("%s %s", cmd, args); |
b2af646b AC |
2236 | else |
2237 | run = xstrdup (cmd); | |
fb40c209 AC |
2238 | if (mi_debug_p) |
2239 | /* FIXME: gdb_???? */ | |
2240 | fprintf_unfiltered (gdb_stdout, "cli=%s run=%s\n", | |
b2af646b | 2241 | cmd, run); |
b8c9b27d | 2242 | old_cleanups = make_cleanup (xfree, run); |
2b03b41d | 2243 | execute_command (run, 0 /* from_tty */ ); |
fb40c209 AC |
2244 | do_cleanups (old_cleanups); |
2245 | return; | |
2246 | } | |
2247 | } | |
2248 | ||
ce8f13f8 | 2249 | void |
9e22b03a | 2250 | mi_execute_async_cli_command (char *cli_command, char **argv, int argc) |
fb40c209 AC |
2251 | { |
2252 | struct cleanup *old_cleanups; | |
2253 | char *run; | |
fb40c209 AC |
2254 | |
2255 | if (target_can_async_p ()) | |
9e22b03a | 2256 | run = xstrprintf ("%s %s&", cli_command, argc ? *argv : ""); |
fb40c209 | 2257 | else |
9e22b03a | 2258 | run = xstrprintf ("%s %s", cli_command, argc ? *argv : ""); |
f107f563 | 2259 | old_cleanups = make_cleanup (xfree, run); |
fb40c209 | 2260 | |
2b03b41d | 2261 | execute_command (run, 0 /* from_tty */ ); |
fb40c209 | 2262 | |
09cee04b PA |
2263 | /* Do this before doing any printing. It would appear that some |
2264 | print code leaves garbage around in the buffer. */ | |
2265 | do_cleanups (old_cleanups); | |
fb40c209 AC |
2266 | } |
2267 | ||
2268 | void | |
fb40c209 AC |
2269 | mi_load_progress (const char *section_name, |
2270 | unsigned long sent_so_far, | |
2271 | unsigned long total_section, | |
2272 | unsigned long total_sent, | |
2273 | unsigned long grand_total) | |
2274 | { | |
2275 | struct timeval time_now, delta, update_threshold; | |
2276 | static struct timeval last_update; | |
2277 | static char *previous_sect_name = NULL; | |
2278 | int new_section; | |
0be75e02 | 2279 | struct ui_out *saved_uiout; |
79a45e25 | 2280 | struct ui_out *uiout; |
fb40c209 | 2281 | |
0be75e02 AS |
2282 | /* This function is called through deprecated_show_load_progress |
2283 | which means uiout may not be correct. Fix it for the duration | |
2284 | of this function. */ | |
79a45e25 | 2285 | saved_uiout = current_uiout; |
0be75e02 | 2286 | |
edff0c0a DJ |
2287 | if (current_interp_named_p (INTERP_MI) |
2288 | || current_interp_named_p (INTERP_MI2)) | |
79a45e25 | 2289 | current_uiout = mi_out_new (2); |
0be75e02 | 2290 | else if (current_interp_named_p (INTERP_MI1)) |
79a45e25 | 2291 | current_uiout = mi_out_new (1); |
edff0c0a | 2292 | else if (current_interp_named_p (INTERP_MI3)) |
79a45e25 | 2293 | current_uiout = mi_out_new (3); |
0be75e02 | 2294 | else |
fb40c209 AC |
2295 | return; |
2296 | ||
79a45e25 PA |
2297 | uiout = current_uiout; |
2298 | ||
fb40c209 AC |
2299 | update_threshold.tv_sec = 0; |
2300 | update_threshold.tv_usec = 500000; | |
2301 | gettimeofday (&time_now, NULL); | |
2302 | ||
2303 | delta.tv_usec = time_now.tv_usec - last_update.tv_usec; | |
2304 | delta.tv_sec = time_now.tv_sec - last_update.tv_sec; | |
2305 | ||
2306 | if (delta.tv_usec < 0) | |
2307 | { | |
2308 | delta.tv_sec -= 1; | |
f2395593 | 2309 | delta.tv_usec += 1000000L; |
fb40c209 AC |
2310 | } |
2311 | ||
2312 | new_section = (previous_sect_name ? | |
2313 | strcmp (previous_sect_name, section_name) : 1); | |
2314 | if (new_section) | |
2315 | { | |
6ad4a2cf | 2316 | struct cleanup *cleanup_tuple; |
102040f0 | 2317 | |
b8c9b27d | 2318 | xfree (previous_sect_name); |
fb40c209 AC |
2319 | previous_sect_name = xstrdup (section_name); |
2320 | ||
721c02de VP |
2321 | if (current_token) |
2322 | fputs_unfiltered (current_token, raw_stdout); | |
fb40c209 | 2323 | fputs_unfiltered ("+download", raw_stdout); |
6ad4a2cf | 2324 | cleanup_tuple = make_cleanup_ui_out_tuple_begin_end (uiout, NULL); |
fb40c209 AC |
2325 | ui_out_field_string (uiout, "section", section_name); |
2326 | ui_out_field_int (uiout, "section-size", total_section); | |
2327 | ui_out_field_int (uiout, "total-size", grand_total); | |
6ad4a2cf | 2328 | do_cleanups (cleanup_tuple); |
fb40c209 AC |
2329 | mi_out_put (uiout, raw_stdout); |
2330 | fputs_unfiltered ("\n", raw_stdout); | |
2331 | gdb_flush (raw_stdout); | |
2332 | } | |
2333 | ||
2334 | if (delta.tv_sec >= update_threshold.tv_sec && | |
2335 | delta.tv_usec >= update_threshold.tv_usec) | |
2336 | { | |
6ad4a2cf | 2337 | struct cleanup *cleanup_tuple; |
102040f0 | 2338 | |
fb40c209 AC |
2339 | last_update.tv_sec = time_now.tv_sec; |
2340 | last_update.tv_usec = time_now.tv_usec; | |
721c02de VP |
2341 | if (current_token) |
2342 | fputs_unfiltered (current_token, raw_stdout); | |
fb40c209 | 2343 | fputs_unfiltered ("+download", raw_stdout); |
6ad4a2cf | 2344 | cleanup_tuple = make_cleanup_ui_out_tuple_begin_end (uiout, NULL); |
fb40c209 AC |
2345 | ui_out_field_string (uiout, "section", section_name); |
2346 | ui_out_field_int (uiout, "section-sent", sent_so_far); | |
2347 | ui_out_field_int (uiout, "section-size", total_section); | |
2348 | ui_out_field_int (uiout, "total-sent", total_sent); | |
2349 | ui_out_field_int (uiout, "total-size", grand_total); | |
6ad4a2cf | 2350 | do_cleanups (cleanup_tuple); |
fb40c209 AC |
2351 | mi_out_put (uiout, raw_stdout); |
2352 | fputs_unfiltered ("\n", raw_stdout); | |
2353 | gdb_flush (raw_stdout); | |
2354 | } | |
0be75e02 AS |
2355 | |
2356 | xfree (uiout); | |
67ba4e42 | 2357 | current_uiout = saved_uiout; |
fb40c209 AC |
2358 | } |
2359 | ||
d8c83789 NR |
2360 | static void |
2361 | timestamp (struct mi_timestamp *tv) | |
2b03b41d SS |
2362 | { |
2363 | gettimeofday (&tv->wallclock, NULL); | |
d8c83789 | 2364 | #ifdef HAVE_GETRUSAGE |
2b03b41d SS |
2365 | getrusage (RUSAGE_SELF, &rusage); |
2366 | tv->utime.tv_sec = rusage.ru_utime.tv_sec; | |
2367 | tv->utime.tv_usec = rusage.ru_utime.tv_usec; | |
2368 | tv->stime.tv_sec = rusage.ru_stime.tv_sec; | |
2369 | tv->stime.tv_usec = rusage.ru_stime.tv_usec; | |
d8c83789 | 2370 | #else |
2b03b41d SS |
2371 | { |
2372 | long usec = get_run_time (); | |
a1b7d198 | 2373 | |
2b03b41d SS |
2374 | tv->utime.tv_sec = usec/1000000L; |
2375 | tv->utime.tv_usec = usec - 1000000L*tv->utime.tv_sec; | |
2376 | tv->stime.tv_sec = 0; | |
2377 | tv->stime.tv_usec = 0; | |
d8c83789 | 2378 | } |
2b03b41d SS |
2379 | #endif |
2380 | } | |
d8c83789 NR |
2381 | |
2382 | static void | |
2383 | print_diff_now (struct mi_timestamp *start) | |
2b03b41d SS |
2384 | { |
2385 | struct mi_timestamp now; | |
102040f0 | 2386 | |
2b03b41d SS |
2387 | timestamp (&now); |
2388 | print_diff (start, &now); | |
2389 | } | |
d8c83789 | 2390 | |
4333ada3 VP |
2391 | void |
2392 | mi_print_timing_maybe (void) | |
2393 | { | |
2b03b41d SS |
2394 | /* If the command is -enable-timing then do_timings may be true |
2395 | whilst current_command_ts is not initialized. */ | |
4333ada3 VP |
2396 | if (do_timings && current_command_ts) |
2397 | print_diff_now (current_command_ts); | |
2398 | } | |
2399 | ||
d8c83789 NR |
2400 | static long |
2401 | timeval_diff (struct timeval start, struct timeval end) | |
2b03b41d SS |
2402 | { |
2403 | return ((end.tv_sec - start.tv_sec) * 1000000L) | |
2404 | + (end.tv_usec - start.tv_usec); | |
2405 | } | |
d8c83789 NR |
2406 | |
2407 | static void | |
2408 | print_diff (struct mi_timestamp *start, struct mi_timestamp *end) | |
2b03b41d SS |
2409 | { |
2410 | fprintf_unfiltered | |
2411 | (raw_stdout, | |
2412 | ",time={wallclock=\"%0.5f\",user=\"%0.5f\",system=\"%0.5f\"}", | |
2413 | timeval_diff (start->wallclock, end->wallclock) / 1000000.0, | |
2414 | timeval_diff (start->utime, end->utime) / 1000000.0, | |
2415 | timeval_diff (start->stime, end->stime) / 1000000.0); | |
2416 | } | |
f224b49d | 2417 | |
40e1c229 VP |
2418 | void |
2419 | mi_cmd_trace_define_variable (char *command, char **argv, int argc) | |
2420 | { | |
2421 | struct expression *expr; | |
40e1c229 VP |
2422 | LONGEST initval = 0; |
2423 | struct trace_state_variable *tsv; | |
2424 | char *name = 0; | |
2425 | ||
2426 | if (argc != 1 && argc != 2) | |
2427 | error (_("Usage: -trace-define-variable VARIABLE [VALUE]")); | |
2428 | ||
1773c82c HAQ |
2429 | name = argv[0]; |
2430 | if (*name++ != '$') | |
2431 | error (_("Name of trace variable should start with '$'")); | |
40e1c229 | 2432 | |
1773c82c | 2433 | validate_trace_state_variable_name (name); |
40e1c229 VP |
2434 | |
2435 | tsv = find_trace_state_variable (name); | |
2436 | if (!tsv) | |
2437 | tsv = create_trace_state_variable (name); | |
2438 | ||
2439 | if (argc == 2) | |
2440 | initval = value_as_long (parse_and_eval (argv[1])); | |
2441 | ||
2442 | tsv->initial_value = initval; | |
40e1c229 VP |
2443 | } |
2444 | ||
2445 | void | |
2446 | mi_cmd_trace_list_variables (char *command, char **argv, int argc) | |
2447 | { | |
2448 | if (argc != 0) | |
2b03b41d | 2449 | error (_("-trace-list-variables: no arguments allowed")); |
40e1c229 VP |
2450 | |
2451 | tvariables_info_1 (); | |
2452 | } | |
2453 | ||
f197e0f1 VP |
2454 | void |
2455 | mi_cmd_trace_find (char *command, char **argv, int argc) | |
2456 | { | |
2457 | char *mode; | |
2458 | ||
2459 | if (argc == 0) | |
2460 | error (_("trace selection mode is required")); | |
2461 | ||
2462 | mode = argv[0]; | |
2463 | ||
2464 | if (strcmp (mode, "none") == 0) | |
2465 | { | |
2466 | tfind_1 (tfind_number, -1, 0, 0, 0); | |
2467 | return; | |
2468 | } | |
2469 | ||
2470 | if (current_trace_status ()->running) | |
2471 | error (_("May not look at trace frames while trace is running.")); | |
2472 | ||
2473 | if (strcmp (mode, "frame-number") == 0) | |
2474 | { | |
2475 | if (argc != 2) | |
2476 | error (_("frame number is required")); | |
2477 | tfind_1 (tfind_number, atoi (argv[1]), 0, 0, 0); | |
2478 | } | |
2479 | else if (strcmp (mode, "tracepoint-number") == 0) | |
2480 | { | |
2481 | if (argc != 2) | |
2482 | error (_("tracepoint number is required")); | |
2483 | tfind_1 (tfind_tp, atoi (argv[1]), 0, 0, 0); | |
2484 | } | |
2485 | else if (strcmp (mode, "pc") == 0) | |
2486 | { | |
2487 | if (argc != 2) | |
2488 | error (_("PC is required")); | |
2489 | tfind_1 (tfind_pc, 0, parse_and_eval_address (argv[1]), 0, 0); | |
2490 | } | |
2491 | else if (strcmp (mode, "pc-inside-range") == 0) | |
2492 | { | |
2493 | if (argc != 3) | |
2494 | error (_("Start and end PC are required")); | |
2495 | tfind_1 (tfind_range, 0, parse_and_eval_address (argv[1]), | |
2496 | parse_and_eval_address (argv[2]), 0); | |
2497 | } | |
2498 | else if (strcmp (mode, "pc-outside-range") == 0) | |
2499 | { | |
2500 | if (argc != 3) | |
2501 | error (_("Start and end PC are required")); | |
2502 | tfind_1 (tfind_outside, 0, parse_and_eval_address (argv[1]), | |
2503 | parse_and_eval_address (argv[2]), 0); | |
2504 | } | |
2505 | else if (strcmp (mode, "line") == 0) | |
2506 | { | |
2507 | struct symtabs_and_lines sals; | |
2508 | struct symtab_and_line sal; | |
2509 | static CORE_ADDR start_pc, end_pc; | |
2510 | struct cleanup *back_to; | |
2511 | ||
2512 | if (argc != 2) | |
2513 | error (_("Line is required")); | |
2514 | ||
39cf75f7 DE |
2515 | sals = decode_line_with_current_source (argv[1], |
2516 | DECODE_LINE_FUNFIRSTLINE); | |
f197e0f1 VP |
2517 | back_to = make_cleanup (xfree, sals.sals); |
2518 | ||
2519 | sal = sals.sals[0]; | |
2520 | ||
2521 | if (sal.symtab == 0) | |
2522 | error (_("Could not find the specified line")); | |
2523 | ||
2524 | if (sal.line > 0 && find_line_pc_range (sal, &start_pc, &end_pc)) | |
2525 | tfind_1 (tfind_range, 0, start_pc, end_pc - 1, 0); | |
2526 | else | |
2527 | error (_("Could not find the specified line")); | |
2528 | ||
2529 | do_cleanups (back_to); | |
2530 | } | |
2531 | else | |
2532 | error (_("Invalid mode '%s'"), mode); | |
2533 | ||
2534 | if (has_stack_frames () || get_traceframe_number () >= 0) | |
08d72866 | 2535 | print_stack_frame (get_selected_frame (NULL), 1, LOC_AND_ADDRESS, 1); |
f197e0f1 VP |
2536 | } |
2537 | ||
011aacb0 VP |
2538 | void |
2539 | mi_cmd_trace_save (char *command, char **argv, int argc) | |
2540 | { | |
2541 | int target_saves = 0; | |
d0353e76 | 2542 | int generate_ctf = 0; |
011aacb0 | 2543 | char *filename; |
d0353e76 YQ |
2544 | int oind = 0; |
2545 | char *oarg; | |
011aacb0 | 2546 | |
d0353e76 YQ |
2547 | enum opt |
2548 | { | |
2549 | TARGET_SAVE_OPT, CTF_OPT | |
2550 | }; | |
2551 | static const struct mi_opt opts[] = | |
011aacb0 | 2552 | { |
d0353e76 YQ |
2553 | {"r", TARGET_SAVE_OPT, 0}, |
2554 | {"ctf", CTF_OPT, 0}, | |
2555 | { 0, 0, 0 } | |
2556 | }; | |
2557 | ||
2558 | while (1) | |
011aacb0 | 2559 | { |
d0353e76 YQ |
2560 | int opt = mi_getopt ("-trace-save", argc, argv, opts, |
2561 | &oind, &oarg); | |
2562 | ||
2563 | if (opt < 0) | |
2564 | break; | |
2565 | switch ((enum opt) opt) | |
2566 | { | |
2567 | case TARGET_SAVE_OPT: | |
2568 | target_saves = 1; | |
2569 | break; | |
2570 | case CTF_OPT: | |
2571 | generate_ctf = 1; | |
2572 | break; | |
2573 | } | |
011aacb0 | 2574 | } |
d0353e76 | 2575 | filename = argv[oind]; |
011aacb0 | 2576 | |
d0353e76 YQ |
2577 | if (generate_ctf) |
2578 | trace_save_ctf (filename, target_saves); | |
2579 | else | |
2580 | trace_save_tfile (filename, target_saves); | |
011aacb0 VP |
2581 | } |
2582 | ||
f224b49d VP |
2583 | void |
2584 | mi_cmd_trace_start (char *command, char **argv, int argc) | |
2585 | { | |
f196051f | 2586 | start_tracing (NULL); |
f224b49d VP |
2587 | } |
2588 | ||
2589 | void | |
2590 | mi_cmd_trace_status (char *command, char **argv, int argc) | |
2591 | { | |
2592 | trace_status_mi (0); | |
2593 | } | |
2594 | ||
2595 | void | |
2596 | mi_cmd_trace_stop (char *command, char **argv, int argc) | |
2597 | { | |
f196051f | 2598 | stop_tracing (NULL); |
f224b49d VP |
2599 | trace_status_mi (1); |
2600 | } | |
75082e8c | 2601 | |
2b03b41d | 2602 | /* Implement the "-ada-task-info" command. */ |
75082e8c JB |
2603 | |
2604 | void | |
2605 | mi_cmd_ada_task_info (char *command, char **argv, int argc) | |
2606 | { | |
2607 | if (argc != 0 && argc != 1) | |
2608 | error (_("Invalid MI command")); | |
2609 | ||
2610 | print_ada_task_info (current_uiout, argv[0], current_inferior ()); | |
2611 | } | |
dc673c81 YQ |
2612 | |
2613 | /* Print EXPRESSION according to VALUES. */ | |
2614 | ||
2615 | static void | |
2616 | print_variable_or_computed (char *expression, enum print_values values) | |
2617 | { | |
2618 | struct expression *expr; | |
2619 | struct cleanup *old_chain; | |
2620 | struct value *val; | |
2621 | struct ui_file *stb; | |
2622 | struct value_print_options opts; | |
2623 | struct type *type; | |
2624 | struct ui_out *uiout = current_uiout; | |
2625 | ||
2626 | stb = mem_fileopen (); | |
2627 | old_chain = make_cleanup_ui_file_delete (stb); | |
2628 | ||
2629 | expr = parse_expression (expression); | |
2630 | ||
2631 | make_cleanup (free_current_contents, &expr); | |
2632 | ||
2633 | if (values == PRINT_SIMPLE_VALUES) | |
2634 | val = evaluate_type (expr); | |
2635 | else | |
2636 | val = evaluate_expression (expr); | |
2637 | ||
2638 | if (values != PRINT_NO_VALUES) | |
2639 | make_cleanup_ui_out_tuple_begin_end (uiout, NULL); | |
2640 | ui_out_field_string (uiout, "name", expression); | |
2641 | ||
2642 | switch (values) | |
2643 | { | |
2644 | case PRINT_SIMPLE_VALUES: | |
2645 | type = check_typedef (value_type (val)); | |
2646 | type_print (value_type (val), "", stb, -1); | |
2647 | ui_out_field_stream (uiout, "type", stb); | |
2648 | if (TYPE_CODE (type) != TYPE_CODE_ARRAY | |
2649 | && TYPE_CODE (type) != TYPE_CODE_STRUCT | |
2650 | && TYPE_CODE (type) != TYPE_CODE_UNION) | |
2651 | { | |
2652 | struct value_print_options opts; | |
2653 | ||
2a998fc0 | 2654 | get_no_prettyformat_print_options (&opts); |
dc673c81 YQ |
2655 | opts.deref_ref = 1; |
2656 | common_val_print (val, stb, 0, &opts, current_language); | |
2657 | ui_out_field_stream (uiout, "value", stb); | |
2658 | } | |
2659 | break; | |
2660 | case PRINT_ALL_VALUES: | |
2661 | { | |
2662 | struct value_print_options opts; | |
2663 | ||
2a998fc0 | 2664 | get_no_prettyformat_print_options (&opts); |
dc673c81 YQ |
2665 | opts.deref_ref = 1; |
2666 | common_val_print (val, stb, 0, &opts, current_language); | |
2667 | ui_out_field_stream (uiout, "value", stb); | |
2668 | } | |
2669 | break; | |
2670 | } | |
2671 | ||
2672 | do_cleanups (old_chain); | |
2673 | } | |
2674 | ||
2675 | /* Implement the "-trace-frame-collected" command. */ | |
2676 | ||
2677 | void | |
2678 | mi_cmd_trace_frame_collected (char *command, char **argv, int argc) | |
2679 | { | |
2680 | struct cleanup *old_chain; | |
2681 | struct bp_location *tloc; | |
2682 | int stepping_frame; | |
2683 | struct collection_list *clist; | |
2684 | struct collection_list tracepoint_list, stepping_list; | |
2685 | struct traceframe_info *tinfo; | |
2686 | int oind = 0; | |
2687 | int var_print_values = PRINT_ALL_VALUES; | |
2688 | int comp_print_values = PRINT_ALL_VALUES; | |
2689 | int registers_format = 'x'; | |
2690 | int memory_contents = 0; | |
2691 | struct ui_out *uiout = current_uiout; | |
2692 | enum opt | |
2693 | { | |
2694 | VAR_PRINT_VALUES, | |
2695 | COMP_PRINT_VALUES, | |
2696 | REGISTERS_FORMAT, | |
2697 | MEMORY_CONTENTS, | |
2698 | }; | |
2699 | static const struct mi_opt opts[] = | |
2700 | { | |
2701 | {"-var-print-values", VAR_PRINT_VALUES, 1}, | |
2702 | {"-comp-print-values", COMP_PRINT_VALUES, 1}, | |
2703 | {"-registers-format", REGISTERS_FORMAT, 1}, | |
2704 | {"-memory-contents", MEMORY_CONTENTS, 0}, | |
2705 | { 0, 0, 0 } | |
2706 | }; | |
2707 | ||
2708 | while (1) | |
2709 | { | |
2710 | char *oarg; | |
2711 | int opt = mi_getopt ("-trace-frame-collected", argc, argv, opts, | |
2712 | &oind, &oarg); | |
2713 | if (opt < 0) | |
2714 | break; | |
2715 | switch ((enum opt) opt) | |
2716 | { | |
2717 | case VAR_PRINT_VALUES: | |
2718 | var_print_values = mi_parse_print_values (oarg); | |
2719 | break; | |
2720 | case COMP_PRINT_VALUES: | |
2721 | comp_print_values = mi_parse_print_values (oarg); | |
2722 | break; | |
2723 | case REGISTERS_FORMAT: | |
2724 | registers_format = oarg[0]; | |
2725 | case MEMORY_CONTENTS: | |
2726 | memory_contents = 1; | |
2727 | break; | |
2728 | } | |
2729 | } | |
2730 | ||
2731 | if (oind != argc) | |
2732 | error (_("Usage: -trace-frame-collected " | |
2733 | "[--var-print-values PRINT_VALUES] " | |
2734 | "[--comp-print-values PRINT_VALUES] " | |
2735 | "[--registers-format FORMAT]" | |
2736 | "[--memory-contents]")); | |
2737 | ||
2738 | /* This throws an error is not inspecting a trace frame. */ | |
2739 | tloc = get_traceframe_location (&stepping_frame); | |
2740 | ||
2741 | /* This command only makes sense for the current frame, not the | |
2742 | selected frame. */ | |
2743 | old_chain = make_cleanup_restore_current_thread (); | |
2744 | select_frame (get_current_frame ()); | |
2745 | ||
2746 | encode_actions_and_make_cleanup (tloc, &tracepoint_list, | |
2747 | &stepping_list); | |
2748 | ||
2749 | if (stepping_frame) | |
2750 | clist = &stepping_list; | |
2751 | else | |
2752 | clist = &tracepoint_list; | |
2753 | ||
2754 | tinfo = get_traceframe_info (); | |
2755 | ||
2756 | /* Explicitly wholly collected variables. */ | |
2757 | { | |
2758 | struct cleanup *list_cleanup; | |
2759 | char *p; | |
2760 | int i; | |
2761 | ||
2762 | list_cleanup = make_cleanup_ui_out_list_begin_end (uiout, | |
2763 | "explicit-variables"); | |
2764 | for (i = 0; VEC_iterate (char_ptr, clist->wholly_collected, i, p); i++) | |
2765 | print_variable_or_computed (p, var_print_values); | |
2766 | do_cleanups (list_cleanup); | |
2767 | } | |
2768 | ||
2769 | /* Computed expressions. */ | |
2770 | { | |
2771 | struct cleanup *list_cleanup; | |
2772 | char *p; | |
2773 | int i; | |
2774 | ||
2775 | list_cleanup | |
2776 | = make_cleanup_ui_out_list_begin_end (uiout, | |
2777 | "computed-expressions"); | |
2778 | for (i = 0; VEC_iterate (char_ptr, clist->computed, i, p); i++) | |
2779 | print_variable_or_computed (p, comp_print_values); | |
2780 | do_cleanups (list_cleanup); | |
2781 | } | |
2782 | ||
2783 | /* Registers. Given pseudo-registers, and that some architectures | |
2784 | (like MIPS) actually hide the raw registers, we don't go through | |
2785 | the trace frame info, but instead consult the register cache for | |
2786 | register availability. */ | |
2787 | { | |
2788 | struct cleanup *list_cleanup; | |
2789 | struct frame_info *frame; | |
2790 | struct gdbarch *gdbarch; | |
2791 | int regnum; | |
2792 | int numregs; | |
2793 | ||
2794 | list_cleanup = make_cleanup_ui_out_list_begin_end (uiout, "registers"); | |
2795 | ||
2796 | frame = get_selected_frame (NULL); | |
2797 | gdbarch = get_frame_arch (frame); | |
2798 | numregs = gdbarch_num_regs (gdbarch) + gdbarch_num_pseudo_regs (gdbarch); | |
2799 | ||
2800 | for (regnum = 0; regnum < numregs; regnum++) | |
2801 | { | |
2802 | if (gdbarch_register_name (gdbarch, regnum) == NULL | |
2803 | || *(gdbarch_register_name (gdbarch, regnum)) == '\0') | |
2804 | continue; | |
2805 | ||
2806 | output_register (frame, regnum, registers_format, 1); | |
2807 | } | |
2808 | ||
2809 | do_cleanups (list_cleanup); | |
2810 | } | |
2811 | ||
2812 | /* Trace state variables. */ | |
2813 | { | |
2814 | struct cleanup *list_cleanup; | |
2815 | int tvar; | |
2816 | char *tsvname; | |
2817 | int i; | |
2818 | ||
2819 | list_cleanup = make_cleanup_ui_out_list_begin_end (uiout, "tvars"); | |
2820 | ||
2821 | tsvname = NULL; | |
2822 | make_cleanup (free_current_contents, &tsvname); | |
2823 | ||
2824 | for (i = 0; VEC_iterate (int, tinfo->tvars, i, tvar); i++) | |
2825 | { | |
2826 | struct cleanup *cleanup_child; | |
2827 | struct trace_state_variable *tsv; | |
2828 | ||
2829 | tsv = find_trace_state_variable_by_number (tvar); | |
2830 | ||
2831 | cleanup_child = make_cleanup_ui_out_tuple_begin_end (uiout, NULL); | |
2832 | ||
2833 | if (tsv != NULL) | |
2834 | { | |
2835 | tsvname = xrealloc (tsvname, strlen (tsv->name) + 2); | |
2836 | tsvname[0] = '$'; | |
2837 | strcpy (tsvname + 1, tsv->name); | |
2838 | ui_out_field_string (uiout, "name", tsvname); | |
2839 | ||
2840 | tsv->value_known = target_get_trace_state_variable_value (tsv->number, | |
2841 | &tsv->value); | |
2842 | ui_out_field_int (uiout, "current", tsv->value); | |
2843 | } | |
2844 | else | |
2845 | { | |
2846 | ui_out_field_skip (uiout, "name"); | |
2847 | ui_out_field_skip (uiout, "current"); | |
2848 | } | |
2849 | ||
2850 | do_cleanups (cleanup_child); | |
2851 | } | |
2852 | ||
2853 | do_cleanups (list_cleanup); | |
2854 | } | |
2855 | ||
2856 | /* Memory. */ | |
2857 | { | |
2858 | struct cleanup *list_cleanup; | |
2859 | VEC(mem_range_s) *available_memory = NULL; | |
2860 | struct mem_range *r; | |
2861 | int i; | |
2862 | ||
2863 | traceframe_available_memory (&available_memory, 0, ULONGEST_MAX); | |
2864 | make_cleanup (VEC_cleanup(mem_range_s), &available_memory); | |
2865 | ||
2866 | list_cleanup = make_cleanup_ui_out_list_begin_end (uiout, "memory"); | |
2867 | ||
2868 | for (i = 0; VEC_iterate (mem_range_s, available_memory, i, r); i++) | |
2869 | { | |
2870 | struct cleanup *cleanup_child; | |
2871 | gdb_byte *data; | |
2872 | struct gdbarch *gdbarch = target_gdbarch (); | |
2873 | ||
2874 | cleanup_child = make_cleanup_ui_out_tuple_begin_end (uiout, NULL); | |
2875 | ||
2876 | ui_out_field_core_addr (uiout, "address", gdbarch, r->start); | |
2877 | ui_out_field_int (uiout, "length", r->length); | |
2878 | ||
2879 | data = xmalloc (r->length); | |
2880 | make_cleanup (xfree, data); | |
2881 | ||
2882 | if (memory_contents) | |
2883 | { | |
2884 | if (target_read_memory (r->start, data, r->length) == 0) | |
2885 | { | |
2886 | int m; | |
2887 | char *data_str, *p; | |
2888 | ||
2889 | data_str = xmalloc (r->length * 2 + 1); | |
2890 | make_cleanup (xfree, data_str); | |
2891 | ||
2892 | for (m = 0, p = data_str; m < r->length; ++m, p += 2) | |
2893 | sprintf (p, "%02x", data[m]); | |
2894 | ui_out_field_string (uiout, "contents", data_str); | |
2895 | } | |
2896 | else | |
2897 | ui_out_field_skip (uiout, "contents"); | |
2898 | } | |
2899 | do_cleanups (cleanup_child); | |
2900 | } | |
2901 | ||
2902 | do_cleanups (list_cleanup); | |
2903 | } | |
2904 | ||
2905 | do_cleanups (old_chain); | |
2906 | } |