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