Add new 'z' format for print command.
[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
YQ
1165 struct cleanup *tuple_cleanup;
1166
c898adb7
YQ
1167 if (skip_unavailable && !value_entirely_available (val))
1168 return;
1169
1edebdbf
YQ
1170 tuple_cleanup = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
1171 ui_out_field_int (uiout, "number", regnum);
fb40c209 1172
fb40c209
AC
1173 if (format == 'N')
1174 format = 0;
1175
20622269 1176 if (value_optimized_out (val))
7ea6d463 1177 error (_("Optimized out"));
fb40c209 1178
fb40c209
AC
1179 if (format == 'r')
1180 {
1181 int j;
1182 char *ptr, buf[1024];
20622269 1183 const gdb_byte *valaddr = value_contents_for_printing (val);
fb40c209
AC
1184
1185 strcpy (buf, "0x");
1186 ptr = buf + 2;
7ccb0be9 1187 for (j = 0; j < register_size (gdbarch, regnum); j++)
fb40c209 1188 {
7ccb0be9
UW
1189 int idx = gdbarch_byte_order (gdbarch) == BFD_ENDIAN_BIG ?
1190 j : register_size (gdbarch, regnum) - 1 - j;
102040f0 1191
20622269 1192 sprintf (ptr, "%02x", (unsigned char) valaddr[idx]);
fb40c209
AC
1193 ptr += 2;
1194 }
1195 ui_out_field_string (uiout, "value", buf);
fb40c209
AC
1196 }
1197 else
1198 {
79a45b7d 1199 struct value_print_options opts;
f99d8bf4
PA
1200 struct ui_file *stb;
1201 struct cleanup *old_chain;
1202
1203 stb = mem_fileopen ();
1204 old_chain = make_cleanup_ui_file_delete (stb);
102040f0 1205
59669435 1206 get_formatted_print_options (&opts, format);
79a45b7d 1207 opts.deref_ref = 1;
20622269
PA
1208 val_print (value_type (val),
1209 value_contents_for_printing (val),
1210 value_embedded_offset (val), 0,
f99d8bf4 1211 stb, 0, val, &opts, current_language);
fb40c209 1212 ui_out_field_stream (uiout, "value", stb);
f99d8bf4 1213 do_cleanups (old_chain);
fb40c209 1214 }
1edebdbf
YQ
1215
1216 do_cleanups (tuple_cleanup);
fb40c209
AC
1217}
1218
24e8cecf 1219/* Write given values into registers. The registers and values are
41296c92 1220 given as pairs. The corresponding MI command is
9a2b4c1b
MS
1221 -data-write-register-values <format>
1222 [<regnum1> <value1>...<regnumN> <valueN>] */
ce8f13f8 1223void
24e8cecf
EZ
1224mi_cmd_data_write_register_values (char *command, char **argv, int argc)
1225{
7ccb0be9
UW
1226 struct regcache *regcache;
1227 struct gdbarch *gdbarch;
9f3a1602 1228 int numregs, i;
24e8cecf
EZ
1229
1230 /* Note that the test for a valid register must include checking the
2b03b41d
SS
1231 gdbarch_register_name because gdbarch_num_regs may be allocated
1232 for the union of the register sets within a family of related
1233 processors. In this case, some entries of gdbarch_register_name
1234 will change depending upon the particular processor being
1235 debugged. */
24e8cecf 1236
7ccb0be9
UW
1237 regcache = get_current_regcache ();
1238 gdbarch = get_regcache_arch (regcache);
1239 numregs = gdbarch_num_regs (gdbarch) + gdbarch_num_pseudo_regs (gdbarch);
24e8cecf
EZ
1240
1241 if (argc == 0)
7ea6d463
PM
1242 error (_("-data-write-register-values: Usage: -data-write-register-"
1243 "values <format> [<regnum1> <value1>...<regnumN> <valueN>]"));
24e8cecf 1244
24e8cecf 1245 if (!target_has_registers)
7ea6d463 1246 error (_("-data-write-register-values: No registers."));
24e8cecf
EZ
1247
1248 if (!(argc - 1))
7ea6d463 1249 error (_("-data-write-register-values: No regs and values specified."));
24e8cecf
EZ
1250
1251 if ((argc - 1) % 2)
7ea6d463
PM
1252 error (_("-data-write-register-values: "
1253 "Regs and vals are not in pairs."));
24e8cecf
EZ
1254
1255 for (i = 1; i < argc; i = i + 2)
1256 {
9f3a1602 1257 int regnum = atoi (argv[i]);
24e8cecf 1258
9f3a1602 1259 if (regnum >= 0 && regnum < numregs
7ccb0be9
UW
1260 && gdbarch_register_name (gdbarch, regnum)
1261 && *gdbarch_register_name (gdbarch, regnum))
24e8cecf 1262 {
9f3a1602 1263 LONGEST value;
d8bf3afa 1264
9f3a1602 1265 /* Get the value as a number. */
24e8cecf 1266 value = parse_and_eval_address (argv[i + 1]);
9f3a1602 1267
41296c92 1268 /* Write it down. */
7ccb0be9 1269 regcache_cooked_write_signed (regcache, regnum, value);
24e8cecf
EZ
1270 }
1271 else
7ea6d463 1272 error (_("bad register number"));
24e8cecf 1273 }
24e8cecf
EZ
1274}
1275
41296c92 1276/* Evaluate the value of the argument. The argument is an
fb40c209 1277 expression. If the expression contains spaces it needs to be
41296c92 1278 included in double quotes. */
2b03b41d 1279
ce8f13f8 1280void
fb40c209
AC
1281mi_cmd_data_evaluate_expression (char *command, char **argv, int argc)
1282{
1283 struct expression *expr;
f99d8bf4 1284 struct cleanup *old_chain;
96052a95 1285 struct value *val;
f99d8bf4 1286 struct ui_file *stb;
79a45b7d 1287 struct value_print_options opts;
79a45e25 1288 struct ui_out *uiout = current_uiout;
fb40c209 1289
f99d8bf4
PA
1290 stb = mem_fileopen ();
1291 old_chain = make_cleanup_ui_file_delete (stb);
fb40c209
AC
1292
1293 if (argc != 1)
f99d8bf4
PA
1294 error (_("-data-evaluate-expression: "
1295 "Usage: -data-evaluate-expression expression"));
fb40c209
AC
1296
1297 expr = parse_expression (argv[0]);
1298
f99d8bf4 1299 make_cleanup (free_current_contents, &expr);
fb40c209
AC
1300
1301 val = evaluate_expression (expr);
1302
41296c92 1303 /* Print the result of the expression evaluation. */
79a45b7d
TT
1304 get_user_print_options (&opts);
1305 opts.deref_ref = 0;
f99d8bf4 1306 common_val_print (val, stb, 0, &opts, current_language);
fb40c209
AC
1307
1308 ui_out_field_stream (uiout, "value", stb);
fb40c209
AC
1309
1310 do_cleanups (old_chain);
fb40c209
AC
1311}
1312
2b03b41d 1313/* This is the -data-read-memory command.
fb40c209
AC
1314
1315 ADDR: start address of data to be dumped.
41296c92 1316 WORD-FORMAT: a char indicating format for the ``word''. See
fb40c209 1317 the ``x'' command.
41296c92 1318 WORD-SIZE: size of each ``word''; 1,2,4, or 8 bytes.
fb40c209
AC
1319 NR_ROW: Number of rows.
1320 NR_COL: The number of colums (words per row).
1321 ASCHAR: (OPTIONAL) Append an ascii character dump to each row. Use
1322 ASCHAR for unprintable characters.
1323
1324 Reads SIZE*NR_ROW*NR_COL bytes starting at ADDR from memory and
1325 displayes them. Returns:
1326
1327 {addr="...",rowN={wordN="..." ,... [,ascii="..."]}, ...}
1328
1329 Returns:
2b03b41d 1330 The number of bytes read is SIZE*ROW*COL. */
fb40c209 1331
ce8f13f8 1332void
fb40c209
AC
1333mi_cmd_data_read_memory (char *command, char **argv, int argc)
1334{
e17c207e 1335 struct gdbarch *gdbarch = get_current_arch ();
79a45e25 1336 struct ui_out *uiout = current_uiout;
fb40c209
AC
1337 struct cleanup *cleanups = make_cleanup (null_cleanup, NULL);
1338 CORE_ADDR addr;
2b03b41d 1339 long total_bytes, nr_cols, nr_rows;
fb40c209
AC
1340 char word_format;
1341 struct type *word_type;
1342 long word_size;
1343 char word_asize;
1344 char aschar;
508416a1 1345 gdb_byte *mbuf;
fb40c209
AC
1346 int nr_bytes;
1347 long offset = 0;
56934ab1
AS
1348 int oind = 0;
1349 char *oarg;
fb40c209 1350 enum opt
fb40c209 1351 {
2b03b41d 1352 OFFSET_OPT
fb40c209 1353 };
2b03b41d
SS
1354 static const struct mi_opt opts[] =
1355 {
1356 {"o", OFFSET_OPT, 1},
1357 { 0, 0, 0 }
1358 };
fb40c209
AC
1359
1360 while (1)
1361 {
1b05df00 1362 int opt = mi_getopt ("-data-read-memory", argc, argv, opts,
56934ab1 1363 &oind, &oarg);
102040f0 1364
fb40c209
AC
1365 if (opt < 0)
1366 break;
1367 switch ((enum opt) opt)
1368 {
1369 case OFFSET_OPT:
56934ab1 1370 offset = atol (oarg);
fb40c209
AC
1371 break;
1372 }
1373 }
56934ab1
AS
1374 argv += oind;
1375 argc -= oind;
fb40c209
AC
1376
1377 if (argc < 5 || argc > 6)
7ea6d463
PM
1378 error (_("-data-read-memory: Usage: "
1379 "ADDR WORD-FORMAT WORD-SIZE NR-ROWS NR-COLS [ASCHAR]."));
fb40c209
AC
1380
1381 /* Extract all the arguments. */
1382
41296c92 1383 /* Start address of the memory dump. */
fb40c209 1384 addr = parse_and_eval_address (argv[0]) + offset;
41296c92 1385 /* The format character to use when displaying a memory word. See
2b03b41d 1386 the ``x'' command. */
fb40c209 1387 word_format = argv[1][0];
41296c92 1388 /* The size of the memory word. */
fb40c209
AC
1389 word_size = atol (argv[2]);
1390 switch (word_size)
1391 {
1392 case 1:
df4df182 1393 word_type = builtin_type (gdbarch)->builtin_int8;
fb40c209
AC
1394 word_asize = 'b';
1395 break;
1396 case 2:
df4df182 1397 word_type = builtin_type (gdbarch)->builtin_int16;
fb40c209
AC
1398 word_asize = 'h';
1399 break;
1400 case 4:
df4df182 1401 word_type = builtin_type (gdbarch)->builtin_int32;
fb40c209
AC
1402 word_asize = 'w';
1403 break;
1404 case 8:
df4df182 1405 word_type = builtin_type (gdbarch)->builtin_int64;
fb40c209
AC
1406 word_asize = 'g';
1407 break;
1408 default:
df4df182 1409 word_type = builtin_type (gdbarch)->builtin_int8;
fb40c209
AC
1410 word_asize = 'b';
1411 }
41296c92 1412 /* The number of rows. */
fb40c209
AC
1413 nr_rows = atol (argv[3]);
1414 if (nr_rows <= 0)
7ea6d463 1415 error (_("-data-read-memory: invalid number of rows."));
a13e061a 1416
41296c92 1417 /* Number of bytes per row. */
fb40c209
AC
1418 nr_cols = atol (argv[4]);
1419 if (nr_cols <= 0)
7ea6d463 1420 error (_("-data-read-memory: invalid number of columns."));
a13e061a 1421
41296c92 1422 /* The un-printable character when printing ascii. */
fb40c209
AC
1423 if (argc == 6)
1424 aschar = *argv[5];
1425 else
1426 aschar = 0;
1427
41296c92 1428 /* Create a buffer and read it in. */
fb40c209 1429 total_bytes = word_size * nr_rows * nr_cols;
2e94c453 1430 mbuf = xcalloc (total_bytes, 1);
b8c9b27d 1431 make_cleanup (xfree, mbuf);
cf7a04e8 1432
a4261689
PA
1433 /* Dispatch memory reads to the topmost target, not the flattened
1434 current_target. */
8dedea02
VP
1435 nr_bytes = target_read (current_target.beneath,
1436 TARGET_OBJECT_MEMORY, NULL, mbuf,
1437 addr, total_bytes);
cf7a04e8 1438 if (nr_bytes <= 0)
7ea6d463 1439 error (_("Unable to read memory."));
fb40c209 1440
41296c92 1441 /* Output the header information. */
5af949e3 1442 ui_out_field_core_addr (uiout, "addr", gdbarch, addr);
fb40c209
AC
1443 ui_out_field_int (uiout, "nr-bytes", nr_bytes);
1444 ui_out_field_int (uiout, "total-bytes", total_bytes);
5af949e3
UW
1445 ui_out_field_core_addr (uiout, "next-row",
1446 gdbarch, addr + word_size * nr_cols);
1447 ui_out_field_core_addr (uiout, "prev-row",
1448 gdbarch, addr - word_size * nr_cols);
1449 ui_out_field_core_addr (uiout, "next-page", gdbarch, addr + total_bytes);
1450 ui_out_field_core_addr (uiout, "prev-page", gdbarch, addr - total_bytes);
fb40c209 1451
41296c92 1452 /* Build the result as a two dimentional table. */
fb40c209 1453 {
f99d8bf4
PA
1454 struct ui_file *stream;
1455 struct cleanup *cleanup_stream;
fb40c209
AC
1456 int row;
1457 int row_byte;
102040f0 1458
f99d8bf4
PA
1459 stream = mem_fileopen ();
1460 cleanup_stream = make_cleanup_ui_file_delete (stream);
1461
1462 make_cleanup_ui_out_list_begin_end (uiout, "memory");
fb40c209
AC
1463 for (row = 0, row_byte = 0;
1464 row < nr_rows;
1465 row++, row_byte += nr_cols * word_size)
1466 {
1467 int col;
1468 int col_byte;
6ad4a2cf
JJ
1469 struct cleanup *cleanup_tuple;
1470 struct cleanup *cleanup_list_data;
79a45b7d
TT
1471 struct value_print_options opts;
1472
6ad4a2cf 1473 cleanup_tuple = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
5af949e3 1474 ui_out_field_core_addr (uiout, "addr", gdbarch, addr + row_byte);
9a2b4c1b
MS
1475 /* ui_out_field_core_addr_symbolic (uiout, "saddr", addr +
1476 row_byte); */
6ad4a2cf 1477 cleanup_list_data = make_cleanup_ui_out_list_begin_end (uiout, "data");
79a45b7d 1478 get_formatted_print_options (&opts, word_format);
fb40c209
AC
1479 for (col = 0, col_byte = row_byte;
1480 col < nr_cols;
1481 col++, col_byte += word_size)
1482 {
1483 if (col_byte + word_size > nr_bytes)
1484 {
1485 ui_out_field_string (uiout, NULL, "N/A");
1486 }
1487 else
1488 {
f99d8bf4 1489 ui_file_rewind (stream);
79a45b7d 1490 print_scalar_formatted (mbuf + col_byte, word_type, &opts,
f99d8bf4 1491 word_asize, stream);
fb40c209
AC
1492 ui_out_field_stream (uiout, NULL, stream);
1493 }
1494 }
6ad4a2cf 1495 do_cleanups (cleanup_list_data);
fb40c209
AC
1496 if (aschar)
1497 {
1498 int byte;
102040f0 1499
f99d8bf4 1500 ui_file_rewind (stream);
9a2b4c1b
MS
1501 for (byte = row_byte;
1502 byte < row_byte + word_size * nr_cols; byte++)
fb40c209
AC
1503 {
1504 if (byte >= nr_bytes)
f99d8bf4 1505 fputc_unfiltered ('X', stream);
fb40c209 1506 else if (mbuf[byte] < 32 || mbuf[byte] > 126)
f99d8bf4 1507 fputc_unfiltered (aschar, stream);
fb40c209 1508 else
f99d8bf4 1509 fputc_unfiltered (mbuf[byte], stream);
fb40c209
AC
1510 }
1511 ui_out_field_stream (uiout, "ascii", stream);
1512 }
6ad4a2cf 1513 do_cleanups (cleanup_tuple);
fb40c209 1514 }
f99d8bf4 1515 do_cleanups (cleanup_stream);
fb40c209
AC
1516 }
1517 do_cleanups (cleanups);
fb40c209
AC
1518}
1519
8dedea02
VP
1520void
1521mi_cmd_data_read_memory_bytes (char *command, char **argv, int argc)
1522{
1523 struct gdbarch *gdbarch = get_current_arch ();
79a45e25 1524 struct ui_out *uiout = current_uiout;
8dedea02
VP
1525 struct cleanup *cleanups;
1526 CORE_ADDR addr;
1527 LONGEST length;
1528 memory_read_result_s *read_result;
1529 int ix;
1530 VEC(memory_read_result_s) *result;
1531 long offset = 0;
56934ab1
AS
1532 int oind = 0;
1533 char *oarg;
8dedea02 1534 enum opt
8dedea02 1535 {
2b03b41d 1536 OFFSET_OPT
8dedea02 1537 };
2b03b41d
SS
1538 static const struct mi_opt opts[] =
1539 {
1540 {"o", OFFSET_OPT, 1},
1541 { 0, 0, 0 }
1542 };
8dedea02
VP
1543
1544 while (1)
1545 {
1b05df00 1546 int opt = mi_getopt ("-data-read-memory-bytes", argc, argv, opts,
56934ab1 1547 &oind, &oarg);
8dedea02
VP
1548 if (opt < 0)
1549 break;
1550 switch ((enum opt) opt)
1551 {
1552 case OFFSET_OPT:
56934ab1 1553 offset = atol (oarg);
8dedea02
VP
1554 break;
1555 }
1556 }
56934ab1
AS
1557 argv += oind;
1558 argc -= oind;
8dedea02
VP
1559
1560 if (argc != 2)
7ea6d463 1561 error (_("Usage: [ -o OFFSET ] ADDR LENGTH."));
8dedea02
VP
1562
1563 addr = parse_and_eval_address (argv[0]) + offset;
1564 length = atol (argv[1]);
1565
1566 result = read_memory_robust (current_target.beneath, addr, length);
1567
1568 cleanups = make_cleanup (free_memory_read_result_vector, result);
1569
1570 if (VEC_length (memory_read_result_s, result) == 0)
7ea6d463 1571 error (_("Unable to read memory."));
8dedea02
VP
1572
1573 make_cleanup_ui_out_list_begin_end (uiout, "memory");
1574 for (ix = 0;
1575 VEC_iterate (memory_read_result_s, result, ix, read_result);
1576 ++ix)
1577 {
1578 struct cleanup *t = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
1579 char *data, *p;
1580 int i;
1581
1582 ui_out_field_core_addr (uiout, "begin", gdbarch, read_result->begin);
1583 ui_out_field_core_addr (uiout, "offset", gdbarch, read_result->begin
1584 - addr);
1585 ui_out_field_core_addr (uiout, "end", gdbarch, read_result->end);
1586
1587 data = xmalloc ((read_result->end - read_result->begin) * 2 + 1);
1588
1589 for (i = 0, p = data;
1590 i < (read_result->end - read_result->begin);
1591 ++i, p += 2)
1592 {
1593 sprintf (p, "%02x", read_result->data[i]);
1594 }
1595 ui_out_field_string (uiout, "contents", data);
1596 xfree (data);
1597 do_cleanups (t);
1598 }
1599 do_cleanups (cleanups);
1600}
1601
2b03b41d 1602/* Implementation of the -data-write_memory command.
fb40c209 1603
177b42fe 1604 COLUMN_OFFSET: optional argument. Must be preceded by '-o'. The
fb40c209
AC
1605 offset from the beginning of the memory grid row where the cell to
1606 be written is.
1607 ADDR: start address of the row in the memory grid where the memory
41296c92 1608 cell is, if OFFSET_COLUMN is specified. Otherwise, the address of
fb40c209 1609 the location to write to.
41296c92 1610 FORMAT: a char indicating format for the ``word''. See
fb40c209
AC
1611 the ``x'' command.
1612 WORD_SIZE: size of each ``word''; 1,2,4, or 8 bytes
1613 VALUE: value to be written into the memory address.
1614
1615 Writes VALUE into ADDR + (COLUMN_OFFSET * WORD_SIZE).
1616
41296c92 1617 Prints nothing. */
2b03b41d 1618
ce8f13f8 1619void
fb40c209
AC
1620mi_cmd_data_write_memory (char *command, char **argv, int argc)
1621{
e17a4113
UW
1622 struct gdbarch *gdbarch = get_current_arch ();
1623 enum bfd_endian byte_order = gdbarch_byte_order (gdbarch);
fb40c209 1624 CORE_ADDR addr;
fb40c209
AC
1625 long word_size;
1626 /* FIXME: ezannoni 2000-02-17 LONGEST could possibly not be big
41296c92 1627 enough when using a compiler other than GCC. */
fb40c209 1628 LONGEST value;
d8bf3afa
KB
1629 void *buffer;
1630 struct cleanup *old_chain;
fb40c209 1631 long offset = 0;
56934ab1
AS
1632 int oind = 0;
1633 char *oarg;
fb40c209 1634 enum opt
fb40c209 1635 {
2b03b41d 1636 OFFSET_OPT
fb40c209 1637 };
2b03b41d
SS
1638 static const struct mi_opt opts[] =
1639 {
1640 {"o", OFFSET_OPT, 1},
1641 { 0, 0, 0 }
1642 };
fb40c209
AC
1643
1644 while (1)
1645 {
1b05df00 1646 int opt = mi_getopt ("-data-write-memory", argc, argv, opts,
56934ab1 1647 &oind, &oarg);
102040f0 1648
fb40c209
AC
1649 if (opt < 0)
1650 break;
1651 switch ((enum opt) opt)
1652 {
1653 case OFFSET_OPT:
56934ab1 1654 offset = atol (oarg);
fb40c209
AC
1655 break;
1656 }
1657 }
56934ab1
AS
1658 argv += oind;
1659 argc -= oind;
fb40c209
AC
1660
1661 if (argc != 4)
7ea6d463
PM
1662 error (_("-data-write-memory: Usage: "
1663 "[-o COLUMN_OFFSET] ADDR FORMAT WORD-SIZE VALUE."));
fb40c209 1664
41296c92
NR
1665 /* Extract all the arguments. */
1666 /* Start address of the memory dump. */
fb40c209 1667 addr = parse_and_eval_address (argv[0]);
2b03b41d 1668 /* The size of the memory word. */
fb40c209
AC
1669 word_size = atol (argv[2]);
1670
41296c92 1671 /* Calculate the real address of the write destination. */
fb40c209
AC
1672 addr += (offset * word_size);
1673
41296c92 1674 /* Get the value as a number. */
fb40c209 1675 value = parse_and_eval_address (argv[3]);
41296c92 1676 /* Get the value into an array. */
d8bf3afa
KB
1677 buffer = xmalloc (word_size);
1678 old_chain = make_cleanup (xfree, buffer);
e17a4113 1679 store_signed_integer (buffer, word_size, byte_order, value);
41296c92 1680 /* Write it down to memory. */
4c2786ba 1681 write_memory_with_notification (addr, buffer, word_size);
d8bf3afa
KB
1682 /* Free the buffer. */
1683 do_cleanups (old_chain);
fb40c209
AC
1684}
1685
2b03b41d 1686/* Implementation of the -data-write-memory-bytes command.
8dedea02
VP
1687
1688 ADDR: start address
62747a60
TT
1689 DATA: string of bytes to write at that address
1690 COUNT: number of bytes to be filled (decimal integer). */
2b03b41d 1691
8dedea02
VP
1692void
1693mi_cmd_data_write_memory_bytes (char *command, char **argv, int argc)
1694{
1695 CORE_ADDR addr;
1696 char *cdata;
1697 gdb_byte *data;
62747a60 1698 gdb_byte *databuf;
5799c0b9 1699 size_t len, i, steps, remainder;
62747a60 1700 long int count, j;
8dedea02
VP
1701 struct cleanup *back_to;
1702
62747a60
TT
1703 if (argc != 2 && argc != 3)
1704 error (_("Usage: ADDR DATA [COUNT]."));
8dedea02
VP
1705
1706 addr = parse_and_eval_address (argv[0]);
1707 cdata = argv[1];
1ae0c35e
YQ
1708 if (strlen (cdata) % 2)
1709 error (_("Hex-encoded '%s' must have an even number of characters."),
1710 cdata);
1711
8dedea02 1712 len = strlen (cdata)/2;
62747a60
TT
1713 if (argc == 3)
1714 count = strtoul (argv[2], NULL, 10);
1715 else
1716 count = len;
8dedea02 1717
62747a60
TT
1718 databuf = xmalloc (len * sizeof (gdb_byte));
1719 back_to = make_cleanup (xfree, databuf);
8dedea02
VP
1720
1721 for (i = 0; i < len; ++i)
1722 {
1723 int x;
62747a60
TT
1724 if (sscanf (cdata + i * 2, "%02x", &x) != 1)
1725 error (_("Invalid argument"));
1726 databuf[i] = (gdb_byte) x;
1727 }
1728
1729 if (len < count)
1730 {
1731 /* Pattern is made of less bytes than count:
1732 repeat pattern to fill memory. */
1733 data = xmalloc (count);
1734 make_cleanup (xfree, data);
1735
1736 steps = count / len;
1737 remainder = count % len;
1738 for (j = 0; j < steps; j++)
1739 memcpy (data + j * len, databuf, len);
1740
1741 if (remainder > 0)
1742 memcpy (data + steps * len, databuf, remainder);
1743 }
1744 else
1745 {
1746 /* Pattern is longer than or equal to count:
1747 just copy len bytes. */
1748 data = databuf;
8dedea02
VP
1749 }
1750
62747a60 1751 write_memory_with_notification (addr, data, count);
8dedea02
VP
1752
1753 do_cleanups (back_to);
1754}
1755
ce8f13f8 1756void
d8c83789
NR
1757mi_cmd_enable_timings (char *command, char **argv, int argc)
1758{
1759 if (argc == 0)
1760 do_timings = 1;
1761 else if (argc == 1)
1762 {
1763 if (strcmp (argv[0], "yes") == 0)
1764 do_timings = 1;
1765 else if (strcmp (argv[0], "no") == 0)
1766 do_timings = 0;
1767 else
1768 goto usage_error;
1769 }
1770 else
1771 goto usage_error;
1772
ce8f13f8 1773 return;
d8c83789
NR
1774
1775 usage_error:
7ea6d463 1776 error (_("-enable-timings: Usage: %s {yes|no}"), command);
d8c83789
NR
1777}
1778
ce8f13f8 1779void
084344da
VP
1780mi_cmd_list_features (char *command, char **argv, int argc)
1781{
1782 if (argc == 0)
1783 {
1784 struct cleanup *cleanup = NULL;
79a45e25 1785 struct ui_out *uiout = current_uiout;
084344da 1786
102040f0 1787 cleanup = make_cleanup_ui_out_list_begin_end (uiout, "features");
084344da 1788 ui_out_field_string (uiout, NULL, "frozen-varobjs");
8b4ed427 1789 ui_out_field_string (uiout, NULL, "pending-breakpoints");
8e8901c5 1790 ui_out_field_string (uiout, NULL, "thread-info");
8dedea02 1791 ui_out_field_string (uiout, NULL, "data-read-memory-bytes");
39c4d40a 1792 ui_out_field_string (uiout, NULL, "breakpoint-notifications");
75082e8c 1793 ui_out_field_string (uiout, NULL, "ada-task-info");
084344da 1794
b6313243 1795#if HAVE_PYTHON
0646da15
TT
1796 if (gdb_python_initialized)
1797 ui_out_field_string (uiout, NULL, "python");
b6313243
TT
1798#endif
1799
084344da 1800 do_cleanups (cleanup);
ce8f13f8 1801 return;
084344da
VP
1802 }
1803
7ea6d463 1804 error (_("-list-features should be passed no arguments"));
084344da 1805}
c6ebd6cf
VP
1806
1807void
1808mi_cmd_list_target_features (char *command, char **argv, int argc)
1809{
1810 if (argc == 0)
1811 {
1812 struct cleanup *cleanup = NULL;
79a45e25 1813 struct ui_out *uiout = current_uiout;
c6ebd6cf 1814
102040f0 1815 cleanup = make_cleanup_ui_out_list_begin_end (uiout, "features");
c6ebd6cf
VP
1816 if (target_can_async_p ())
1817 ui_out_field_string (uiout, NULL, "async");
f75d858b
MK
1818 if (target_can_execute_reverse)
1819 ui_out_field_string (uiout, NULL, "reverse");
c6ebd6cf
VP
1820
1821 do_cleanups (cleanup);
1822 return;
1823 }
1824
7ea6d463 1825 error (_("-list-target-features should be passed no arguments"));
c6ebd6cf
VP
1826}
1827
a79b8f6e
VP
1828void
1829mi_cmd_add_inferior (char *command, char **argv, int argc)
1830{
1831 struct inferior *inf;
1832
1833 if (argc != 0)
1834 error (_("-add-inferior should be passed no arguments"));
1835
1836 inf = add_inferior_with_spaces ();
1837
79a45e25 1838 ui_out_field_fmt (current_uiout, "inferior", "i%d", inf->num);
a79b8f6e
VP
1839}
1840
2b03b41d
SS
1841/* Callback used to find the first inferior other than the current
1842 one. */
57bf2d7e
MK
1843
1844static int
1845get_other_inferior (struct inferior *inf, void *arg)
1846{
1847 if (inf == current_inferior ())
1848 return 0;
1849
1850 return 1;
1851}
1852
a79b8f6e
VP
1853void
1854mi_cmd_remove_inferior (char *command, char **argv, int argc)
1855{
1856 int id;
1857 struct inferior *inf;
1858
1859 if (argc != 1)
7ea6d463 1860 error (_("-remove-inferior should be passed a single argument"));
a79b8f6e 1861
e2b4a699 1862 if (sscanf (argv[0], "i%d", &id) != 1)
7ea6d463 1863 error (_("the thread group id is syntactically invalid"));
a79b8f6e
VP
1864
1865 inf = find_inferior_id (id);
1866 if (!inf)
7ea6d463 1867 error (_("the specified thread group does not exist"));
a79b8f6e 1868
8fa067af 1869 if (inf->pid != 0)
81ec3cce 1870 error (_("cannot remove an active inferior"));
8fa067af 1871
57bf2d7e
MK
1872 if (inf == current_inferior ())
1873 {
1874 struct thread_info *tp = 0;
1875 struct inferior *new_inferior
1876 = iterate_over_inferiors (get_other_inferior, NULL);
1877
1878 if (new_inferior == NULL)
1879 error (_("Cannot remove last inferior"));
1880
1881 set_current_inferior (new_inferior);
1882 if (new_inferior->pid != 0)
1883 tp = any_thread_of_process (new_inferior->pid);
1884 switch_to_thread (tp ? tp->ptid : null_ptid);
1885 set_current_program_space (new_inferior->pspace);
1886 }
1887
a79b8f6e
VP
1888 delete_inferior_1 (inf, 1 /* silent */);
1889}
1890
1891\f
1892
8d34ea23
KS
1893/* Execute a command within a safe environment.
1894 Return <0 for error; >=0 for ok.
1895
1896 args->action will tell mi_execute_command what action
42972f50 1897 to perfrom after the given command has executed (display/suppress
2b03b41d 1898 prompt, display error). */
fb40c209 1899
f30f06b8 1900static void
04bd08de 1901captured_mi_execute_command (struct ui_out *uiout, struct mi_parse *context)
fb40c209 1902{
1f31650a 1903 struct cleanup *cleanup;
fb40c209 1904
4333ada3
VP
1905 if (do_timings)
1906 current_command_ts = context->cmd_start;
d8c83789 1907
1f31650a
VP
1908 current_token = xstrdup (context->token);
1909 cleanup = make_cleanup (free_current_contents, &current_token);
1910
a2840c35 1911 running_result_record_printed = 0;
f3b1572e 1912 mi_proceeded = 0;
fb40c209
AC
1913 switch (context->op)
1914 {
fb40c209 1915 case MI_COMMAND:
41296c92 1916 /* A MI command was read from the input stream. */
fb40c209
AC
1917 if (mi_debug_p)
1918 /* FIXME: gdb_???? */
1919 fprintf_unfiltered (raw_stdout, " token=`%s' command=`%s' args=`%s'\n",
1920 context->token, context->command, context->args);
d8c83789 1921
ce8f13f8 1922 mi_cmd_execute (context);
8d34ea23 1923
a2840c35 1924 /* Print the result if there were no errors.
4389a95a 1925
a2840c35 1926 Remember that on the way out of executing a command, you have
2b03b41d
SS
1927 to directly use the mi_interp's uiout, since the command
1928 could have reset the interpreter, in which case the current
1929 uiout will most likely crash in the mi_out_* routines. */
ce8f13f8 1930 if (!running_result_record_printed)
a2840c35
VP
1931 {
1932 fputs_unfiltered (context->token, raw_stdout);
ce8f13f8
VP
1933 /* There's no particularly good reason why target-connect results
1934 in not ^done. Should kill ^connected for MI3. */
1935 fputs_unfiltered (strcmp (context->command, "target-select") == 0
1936 ? "^connected" : "^done", raw_stdout);
a2840c35
VP
1937 mi_out_put (uiout, raw_stdout);
1938 mi_out_rewind (uiout);
4333ada3 1939 mi_print_timing_maybe ();
a2840c35
VP
1940 fputs_unfiltered ("\n", raw_stdout);
1941 }
1942 else
2b03b41d
SS
1943 /* The command does not want anything to be printed. In that
1944 case, the command probably should not have written anything
1945 to uiout, but in case it has written something, discard it. */
a2840c35 1946 mi_out_rewind (uiout);
fb40c209
AC
1947 break;
1948
1949 case CLI_COMMAND:
78f5381d
AC
1950 {
1951 char *argv[2];
102040f0 1952
78f5381d
AC
1953 /* A CLI command was read from the input stream. */
1954 /* This "feature" will be removed as soon as we have a
1955 complete set of mi commands. */
1956 /* Echo the command on the console. */
1957 fprintf_unfiltered (gdb_stdlog, "%s\n", context->command);
1958 /* Call the "console" interpreter. */
1959 argv[0] = "console";
1960 argv[1] = context->command;
ce8f13f8 1961 mi_cmd_interpreter_exec ("-interpreter-exec", argv, 2);
78f5381d 1962
eec01795 1963 /* If we changed interpreters, DON'T print out anything. */
78f5381d
AC
1964 if (current_interp_named_p (INTERP_MI)
1965 || current_interp_named_p (INTERP_MI1)
1966 || current_interp_named_p (INTERP_MI2)
1967 || current_interp_named_p (INTERP_MI3))
1968 {
ce8f13f8 1969 if (!running_result_record_printed)
eec01795
DJ
1970 {
1971 fputs_unfiltered (context->token, raw_stdout);
1972 fputs_unfiltered ("^done", raw_stdout);
1973 mi_out_put (uiout, raw_stdout);
1974 mi_out_rewind (uiout);
4333ada3
VP
1975 mi_print_timing_maybe ();
1976 fputs_unfiltered ("\n", raw_stdout);
eec01795 1977 }
eec01795
DJ
1978 else
1979 mi_out_rewind (uiout);
78f5381d
AC
1980 }
1981 break;
1982 }
fb40c209 1983 }
8d34ea23 1984
1f31650a 1985 do_cleanups (cleanup);
fb40c209
AC
1986}
1987
305aeedc
TT
1988/* Print a gdb exception to the MI output stream. */
1989
1990static void
1991mi_print_exception (const char *token, struct gdb_exception exception)
1992{
1993 fputs_unfiltered (token, raw_stdout);
1994 fputs_unfiltered ("^error,msg=\"", raw_stdout);
1995 if (exception.message == NULL)
1996 fputs_unfiltered ("unknown error", raw_stdout);
1997 else
1998 fputstr_unfiltered (exception.message, '"', raw_stdout);
1999 fputs_unfiltered ("\"\n", raw_stdout);
2000}
fb40c209
AC
2001
2002void
ee047554 2003mi_execute_command (const char *cmd, int from_tty)
fb40c209 2004{
305aeedc
TT
2005 char *token;
2006 struct mi_parse *command = NULL;
2007 volatile struct gdb_exception exception;
fb40c209 2008
41296c92
NR
2009 /* This is to handle EOF (^D). We just quit gdb. */
2010 /* FIXME: we should call some API function here. */
fb40c209
AC
2011 if (cmd == 0)
2012 quit_force (NULL, from_tty);
2013
11334b82
VP
2014 target_log_command (cmd);
2015
305aeedc
TT
2016 TRY_CATCH (exception, RETURN_MASK_ALL)
2017 {
2018 command = mi_parse (cmd, &token);
2019 }
2020 if (exception.reason < 0)
2021 {
2022 mi_print_exception (token, exception);
2023 xfree (token);
2024 }
2025 else
fb40c209 2026 {
04bd08de 2027 volatile struct gdb_exception result;
66bb093b 2028 ptid_t previous_ptid = inferior_ptid;
d8c83789 2029
305aeedc
TT
2030 command->token = token;
2031
d8c83789
NR
2032 if (do_timings)
2033 {
2034 command->cmd_start = (struct mi_timestamp *)
2035 xmalloc (sizeof (struct mi_timestamp));
2036 timestamp (command->cmd_start);
2037 }
2038
04bd08de
TT
2039 TRY_CATCH (result, RETURN_MASK_ALL)
2040 {
79a45e25 2041 captured_mi_execute_command (current_uiout, command);
04bd08de 2042 }
ce43223b 2043 if (result.reason < 0)
fb40c209 2044 {
fb40c209 2045 /* The command execution failed and error() was called
589e074d 2046 somewhere. */
305aeedc 2047 mi_print_exception (command->token, result);
79a45e25 2048 mi_out_rewind (current_uiout);
fb40c209 2049 }
a13e061a 2050
5d4e2b76
VP
2051 bpstat_do_actions ();
2052
66bb093b
VP
2053 if (/* The notifications are only output when the top-level
2054 interpreter (specified on the command line) is MI. */
2055 ui_out_is_mi_like_p (interp_ui_out (top_level_interpreter ()))
2056 /* Don't try report anything if there are no threads --
2057 the program is dead. */
2058 && thread_count () != 0
2059 /* -thread-select explicitly changes thread. If frontend uses that
2060 internally, we don't want to emit =thread-selected, since
2061 =thread-selected is supposed to indicate user's intentions. */
2062 && strcmp (command->command, "thread-select") != 0)
2063 {
2064 struct mi_interp *mi = top_level_interpreter_data ();
d729566a 2065 int report_change = 0;
66bb093b
VP
2066
2067 if (command->thread == -1)
2068 {
d729566a
PA
2069 report_change = (!ptid_equal (previous_ptid, null_ptid)
2070 && !ptid_equal (inferior_ptid, previous_ptid)
2071 && !ptid_equal (inferior_ptid, null_ptid));
66bb093b 2072 }
d729566a 2073 else if (!ptid_equal (inferior_ptid, null_ptid))
66bb093b 2074 {
d729566a 2075 struct thread_info *ti = inferior_thread ();
102040f0 2076
66bb093b
VP
2077 report_change = (ti->num != command->thread);
2078 }
2079
2080 if (report_change)
2081 {
d729566a 2082 struct thread_info *ti = inferior_thread ();
102040f0 2083
66bb093b
VP
2084 target_terminal_ours ();
2085 fprintf_unfiltered (mi->event_channel,
2086 "thread-selected,id=\"%d\"",
2087 ti->num);
2088 gdb_flush (mi->event_channel);
2089 }
2090 }
2091
fb40c209
AC
2092 mi_parse_free (command);
2093 }
fb40c209
AC
2094}
2095
ce8f13f8 2096static void
fb40c209
AC
2097mi_cmd_execute (struct mi_parse *parse)
2098{
f107f563 2099 struct cleanup *cleanup;
e23110bb 2100
028d0ed5 2101 cleanup = prepare_execute_command ();
1b98914a 2102
a79b8f6e
VP
2103 if (parse->all && parse->thread_group != -1)
2104 error (_("Cannot specify --thread-group together with --all"));
2105
2106 if (parse->all && parse->thread != -1)
2107 error (_("Cannot specify --thread together with --all"));
2108
2109 if (parse->thread_group != -1 && parse->thread != -1)
2110 error (_("Cannot specify --thread together with --thread-group"));
2111
1e92afda
VP
2112 if (parse->frame != -1 && parse->thread == -1)
2113 error (_("Cannot specify --frame without --thread"));
dcf4fbde 2114
a79b8f6e
VP
2115 if (parse->thread_group != -1)
2116 {
2117 struct inferior *inf = find_inferior_id (parse->thread_group);
2118 struct thread_info *tp = 0;
2119
2120 if (!inf)
46ef47e5 2121 error (_("Invalid thread group for the --thread-group option"));
a79b8f6e
VP
2122
2123 set_current_inferior (inf);
2124 /* This behaviour means that if --thread-group option identifies
2b03b41d
SS
2125 an inferior with multiple threads, then a random one will be
2126 picked. This is not a problem -- frontend should always
2127 provide --thread if it wishes to operate on a specific
2128 thread. */
a79b8f6e 2129 if (inf->pid != 0)
4734f50e 2130 tp = any_live_thread_of_process (inf->pid);
a79b8f6e
VP
2131 switch_to_thread (tp ? tp->ptid : null_ptid);
2132 set_current_program_space (inf->pspace);
2133 }
2134
1e92afda
VP
2135 if (parse->thread != -1)
2136 {
2137 struct thread_info *tp = find_thread_id (parse->thread);
102040f0 2138
1e92afda
VP
2139 if (!tp)
2140 error (_("Invalid thread id: %d"), parse->thread);
dcf4fbde
PA
2141
2142 if (is_exited (tp->ptid))
2143 error (_("Thread id: %d has terminated"), parse->thread);
2144
2145 switch_to_thread (tp->ptid);
1e92afda 2146 }
dcf4fbde 2147
1e92afda
VP
2148 if (parse->frame != -1)
2149 {
2150 struct frame_info *fid;
2151 int frame = parse->frame;
102040f0 2152
1e92afda
VP
2153 fid = find_relative_frame (get_current_frame (), &frame);
2154 if (frame == 0)
2155 /* find_relative_frame was successful */
2156 select_frame (fid);
2157 else
ea069267 2158 error (_("Invalid frame id: %d"), frame);
1e92afda 2159 }
dcf4fbde 2160
a79b8f6e
VP
2161 current_context = parse;
2162
648beb2b 2163 if (parse->cmd->suppress_notification != NULL)
8d3788bd 2164 {
648beb2b
YQ
2165 make_cleanup_restore_integer (parse->cmd->suppress_notification);
2166 *parse->cmd->suppress_notification = 1;
8d3788bd
VP
2167 }
2168
9e22b03a 2169 if (parse->cmd->argv_func != NULL)
8d3788bd
VP
2170 {
2171 parse->cmd->argv_func (parse->command, parse->argv, parse->argc);
2172 }
b2af646b 2173 else if (parse->cmd->cli.cmd != 0)
fb40c209
AC
2174 {
2175 /* FIXME: DELETE THIS. */
41296c92
NR
2176 /* The operation is still implemented by a cli command. */
2177 /* Must be a synchronous one. */
b2af646b
AC
2178 mi_execute_cli_command (parse->cmd->cli.cmd, parse->cmd->cli.args_p,
2179 parse->args);
fb40c209
AC
2180 }
2181 else
2182 {
41296c92 2183 /* FIXME: DELETE THIS. */
a13e061a
PA
2184 struct ui_file *stb;
2185
2186 stb = mem_fileopen ();
2187
2188 fputs_unfiltered ("Undefined mi command: ", stb);
2189 fputstr_unfiltered (parse->command, '"', stb);
2190 fputs_unfiltered (" (missing implementation)", stb);
2191
2192 make_cleanup_ui_file_delete (stb);
2193 error_stream (stb);
fb40c209 2194 }
1b98914a 2195 do_cleanups (cleanup);
fb40c209
AC
2196}
2197
fb40c209 2198/* FIXME: This is just a hack so we can get some extra commands going.
41296c92
NR
2199 We don't want to channel things through the CLI, but call libgdb directly.
2200 Use only for synchronous commands. */
fb40c209
AC
2201
2202void
b2af646b 2203mi_execute_cli_command (const char *cmd, int args_p, const char *args)
fb40c209 2204{
b2af646b 2205 if (cmd != 0)
fb40c209
AC
2206 {
2207 struct cleanup *old_cleanups;
2208 char *run;
102040f0 2209
b2af646b 2210 if (args_p)
c6902d46 2211 run = xstrprintf ("%s %s", cmd, args);
b2af646b
AC
2212 else
2213 run = xstrdup (cmd);
fb40c209
AC
2214 if (mi_debug_p)
2215 /* FIXME: gdb_???? */
2216 fprintf_unfiltered (gdb_stdout, "cli=%s run=%s\n",
b2af646b 2217 cmd, run);
b8c9b27d 2218 old_cleanups = make_cleanup (xfree, run);
2b03b41d 2219 execute_command (run, 0 /* from_tty */ );
fb40c209
AC
2220 do_cleanups (old_cleanups);
2221 return;
2222 }
2223}
2224
ce8f13f8 2225void
9e22b03a 2226mi_execute_async_cli_command (char *cli_command, char **argv, int argc)
fb40c209
AC
2227{
2228 struct cleanup *old_cleanups;
2229 char *run;
fb40c209
AC
2230
2231 if (target_can_async_p ())
9e22b03a 2232 run = xstrprintf ("%s %s&", cli_command, argc ? *argv : "");
fb40c209 2233 else
9e22b03a 2234 run = xstrprintf ("%s %s", cli_command, argc ? *argv : "");
f107f563 2235 old_cleanups = make_cleanup (xfree, run);
fb40c209 2236
2b03b41d 2237 execute_command (run, 0 /* from_tty */ );
fb40c209 2238
09cee04b
PA
2239 /* Do this before doing any printing. It would appear that some
2240 print code leaves garbage around in the buffer. */
2241 do_cleanups (old_cleanups);
fb40c209
AC
2242}
2243
2244void
fb40c209
AC
2245mi_load_progress (const char *section_name,
2246 unsigned long sent_so_far,
2247 unsigned long total_section,
2248 unsigned long total_sent,
2249 unsigned long grand_total)
2250{
2251 struct timeval time_now, delta, update_threshold;
2252 static struct timeval last_update;
2253 static char *previous_sect_name = NULL;
2254 int new_section;
0be75e02 2255 struct ui_out *saved_uiout;
79a45e25 2256 struct ui_out *uiout;
fb40c209 2257
0be75e02
AS
2258 /* This function is called through deprecated_show_load_progress
2259 which means uiout may not be correct. Fix it for the duration
2260 of this function. */
79a45e25 2261 saved_uiout = current_uiout;
0be75e02 2262
edff0c0a
DJ
2263 if (current_interp_named_p (INTERP_MI)
2264 || current_interp_named_p (INTERP_MI2))
79a45e25 2265 current_uiout = mi_out_new (2);
0be75e02 2266 else if (current_interp_named_p (INTERP_MI1))
79a45e25 2267 current_uiout = mi_out_new (1);
edff0c0a 2268 else if (current_interp_named_p (INTERP_MI3))
79a45e25 2269 current_uiout = mi_out_new (3);
0be75e02 2270 else
fb40c209
AC
2271 return;
2272
79a45e25
PA
2273 uiout = current_uiout;
2274
fb40c209
AC
2275 update_threshold.tv_sec = 0;
2276 update_threshold.tv_usec = 500000;
2277 gettimeofday (&time_now, NULL);
2278
2279 delta.tv_usec = time_now.tv_usec - last_update.tv_usec;
2280 delta.tv_sec = time_now.tv_sec - last_update.tv_sec;
2281
2282 if (delta.tv_usec < 0)
2283 {
2284 delta.tv_sec -= 1;
f2395593 2285 delta.tv_usec += 1000000L;
fb40c209
AC
2286 }
2287
2288 new_section = (previous_sect_name ?
2289 strcmp (previous_sect_name, section_name) : 1);
2290 if (new_section)
2291 {
6ad4a2cf 2292 struct cleanup *cleanup_tuple;
102040f0 2293
b8c9b27d 2294 xfree (previous_sect_name);
fb40c209
AC
2295 previous_sect_name = xstrdup (section_name);
2296
721c02de
VP
2297 if (current_token)
2298 fputs_unfiltered (current_token, raw_stdout);
fb40c209 2299 fputs_unfiltered ("+download", raw_stdout);
6ad4a2cf 2300 cleanup_tuple = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
fb40c209
AC
2301 ui_out_field_string (uiout, "section", section_name);
2302 ui_out_field_int (uiout, "section-size", total_section);
2303 ui_out_field_int (uiout, "total-size", grand_total);
6ad4a2cf 2304 do_cleanups (cleanup_tuple);
fb40c209
AC
2305 mi_out_put (uiout, raw_stdout);
2306 fputs_unfiltered ("\n", raw_stdout);
2307 gdb_flush (raw_stdout);
2308 }
2309
2310 if (delta.tv_sec >= update_threshold.tv_sec &&
2311 delta.tv_usec >= update_threshold.tv_usec)
2312 {
6ad4a2cf 2313 struct cleanup *cleanup_tuple;
102040f0 2314
fb40c209
AC
2315 last_update.tv_sec = time_now.tv_sec;
2316 last_update.tv_usec = time_now.tv_usec;
721c02de
VP
2317 if (current_token)
2318 fputs_unfiltered (current_token, raw_stdout);
fb40c209 2319 fputs_unfiltered ("+download", raw_stdout);
6ad4a2cf 2320 cleanup_tuple = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
fb40c209
AC
2321 ui_out_field_string (uiout, "section", section_name);
2322 ui_out_field_int (uiout, "section-sent", sent_so_far);
2323 ui_out_field_int (uiout, "section-size", total_section);
2324 ui_out_field_int (uiout, "total-sent", total_sent);
2325 ui_out_field_int (uiout, "total-size", grand_total);
6ad4a2cf 2326 do_cleanups (cleanup_tuple);
fb40c209
AC
2327 mi_out_put (uiout, raw_stdout);
2328 fputs_unfiltered ("\n", raw_stdout);
2329 gdb_flush (raw_stdout);
2330 }
0be75e02
AS
2331
2332 xfree (uiout);
67ba4e42 2333 current_uiout = saved_uiout;
fb40c209
AC
2334}
2335
d8c83789
NR
2336static void
2337timestamp (struct mi_timestamp *tv)
2b03b41d
SS
2338{
2339 gettimeofday (&tv->wallclock, NULL);
d8c83789 2340#ifdef HAVE_GETRUSAGE
2b03b41d
SS
2341 getrusage (RUSAGE_SELF, &rusage);
2342 tv->utime.tv_sec = rusage.ru_utime.tv_sec;
2343 tv->utime.tv_usec = rusage.ru_utime.tv_usec;
2344 tv->stime.tv_sec = rusage.ru_stime.tv_sec;
2345 tv->stime.tv_usec = rusage.ru_stime.tv_usec;
d8c83789 2346#else
2b03b41d
SS
2347 {
2348 long usec = get_run_time ();
a1b7d198 2349
2b03b41d
SS
2350 tv->utime.tv_sec = usec/1000000L;
2351 tv->utime.tv_usec = usec - 1000000L*tv->utime.tv_sec;
2352 tv->stime.tv_sec = 0;
2353 tv->stime.tv_usec = 0;
d8c83789 2354 }
2b03b41d
SS
2355#endif
2356}
d8c83789
NR
2357
2358static void
2359print_diff_now (struct mi_timestamp *start)
2b03b41d
SS
2360{
2361 struct mi_timestamp now;
102040f0 2362
2b03b41d
SS
2363 timestamp (&now);
2364 print_diff (start, &now);
2365}
d8c83789 2366
4333ada3
VP
2367void
2368mi_print_timing_maybe (void)
2369{
2b03b41d
SS
2370 /* If the command is -enable-timing then do_timings may be true
2371 whilst current_command_ts is not initialized. */
4333ada3
VP
2372 if (do_timings && current_command_ts)
2373 print_diff_now (current_command_ts);
2374}
2375
d8c83789
NR
2376static long
2377timeval_diff (struct timeval start, struct timeval end)
2b03b41d
SS
2378{
2379 return ((end.tv_sec - start.tv_sec) * 1000000L)
2380 + (end.tv_usec - start.tv_usec);
2381}
d8c83789
NR
2382
2383static void
2384print_diff (struct mi_timestamp *start, struct mi_timestamp *end)
2b03b41d
SS
2385{
2386 fprintf_unfiltered
2387 (raw_stdout,
2388 ",time={wallclock=\"%0.5f\",user=\"%0.5f\",system=\"%0.5f\"}",
2389 timeval_diff (start->wallclock, end->wallclock) / 1000000.0,
2390 timeval_diff (start->utime, end->utime) / 1000000.0,
2391 timeval_diff (start->stime, end->stime) / 1000000.0);
2392}
f224b49d 2393
40e1c229
VP
2394void
2395mi_cmd_trace_define_variable (char *command, char **argv, int argc)
2396{
2397 struct expression *expr;
40e1c229
VP
2398 LONGEST initval = 0;
2399 struct trace_state_variable *tsv;
2400 char *name = 0;
2401
2402 if (argc != 1 && argc != 2)
2403 error (_("Usage: -trace-define-variable VARIABLE [VALUE]"));
2404
1773c82c
HAQ
2405 name = argv[0];
2406 if (*name++ != '$')
2407 error (_("Name of trace variable should start with '$'"));
40e1c229 2408
1773c82c 2409 validate_trace_state_variable_name (name);
40e1c229
VP
2410
2411 tsv = find_trace_state_variable (name);
2412 if (!tsv)
2413 tsv = create_trace_state_variable (name);
2414
2415 if (argc == 2)
2416 initval = value_as_long (parse_and_eval (argv[1]));
2417
2418 tsv->initial_value = initval;
40e1c229
VP
2419}
2420
2421void
2422mi_cmd_trace_list_variables (char *command, char **argv, int argc)
2423{
2424 if (argc != 0)
2b03b41d 2425 error (_("-trace-list-variables: no arguments allowed"));
40e1c229
VP
2426
2427 tvariables_info_1 ();
2428}
2429
f197e0f1
VP
2430void
2431mi_cmd_trace_find (char *command, char **argv, int argc)
2432{
2433 char *mode;
2434
2435 if (argc == 0)
2436 error (_("trace selection mode is required"));
2437
2438 mode = argv[0];
2439
2440 if (strcmp (mode, "none") == 0)
2441 {
2442 tfind_1 (tfind_number, -1, 0, 0, 0);
2443 return;
2444 }
2445
2446 if (current_trace_status ()->running)
2447 error (_("May not look at trace frames while trace is running."));
2448
2449 if (strcmp (mode, "frame-number") == 0)
2450 {
2451 if (argc != 2)
2452 error (_("frame number is required"));
2453 tfind_1 (tfind_number, atoi (argv[1]), 0, 0, 0);
2454 }
2455 else if (strcmp (mode, "tracepoint-number") == 0)
2456 {
2457 if (argc != 2)
2458 error (_("tracepoint number is required"));
2459 tfind_1 (tfind_tp, atoi (argv[1]), 0, 0, 0);
2460 }
2461 else if (strcmp (mode, "pc") == 0)
2462 {
2463 if (argc != 2)
2464 error (_("PC is required"));
2465 tfind_1 (tfind_pc, 0, parse_and_eval_address (argv[1]), 0, 0);
2466 }
2467 else if (strcmp (mode, "pc-inside-range") == 0)
2468 {
2469 if (argc != 3)
2470 error (_("Start and end PC are required"));
2471 tfind_1 (tfind_range, 0, parse_and_eval_address (argv[1]),
2472 parse_and_eval_address (argv[2]), 0);
2473 }
2474 else if (strcmp (mode, "pc-outside-range") == 0)
2475 {
2476 if (argc != 3)
2477 error (_("Start and end PC are required"));
2478 tfind_1 (tfind_outside, 0, parse_and_eval_address (argv[1]),
2479 parse_and_eval_address (argv[2]), 0);
2480 }
2481 else if (strcmp (mode, "line") == 0)
2482 {
2483 struct symtabs_and_lines sals;
2484 struct symtab_and_line sal;
2485 static CORE_ADDR start_pc, end_pc;
2486 struct cleanup *back_to;
2487
2488 if (argc != 2)
2489 error (_("Line is required"));
2490
39cf75f7
DE
2491 sals = decode_line_with_current_source (argv[1],
2492 DECODE_LINE_FUNFIRSTLINE);
f197e0f1
VP
2493 back_to = make_cleanup (xfree, sals.sals);
2494
2495 sal = sals.sals[0];
2496
2497 if (sal.symtab == 0)
2498 error (_("Could not find the specified line"));
2499
2500 if (sal.line > 0 && find_line_pc_range (sal, &start_pc, &end_pc))
2501 tfind_1 (tfind_range, 0, start_pc, end_pc - 1, 0);
2502 else
2503 error (_("Could not find the specified line"));
2504
2505 do_cleanups (back_to);
2506 }
2507 else
2508 error (_("Invalid mode '%s'"), mode);
2509
2510 if (has_stack_frames () || get_traceframe_number () >= 0)
2b03b41d 2511 print_stack_frame (get_selected_frame (NULL), 1, SRC_AND_LOC);
f197e0f1
VP
2512}
2513
011aacb0
VP
2514void
2515mi_cmd_trace_save (char *command, char **argv, int argc)
2516{
2517 int target_saves = 0;
d0353e76 2518 int generate_ctf = 0;
011aacb0 2519 char *filename;
d0353e76
YQ
2520 int oind = 0;
2521 char *oarg;
011aacb0 2522
d0353e76
YQ
2523 enum opt
2524 {
2525 TARGET_SAVE_OPT, CTF_OPT
2526 };
2527 static const struct mi_opt opts[] =
011aacb0 2528 {
d0353e76
YQ
2529 {"r", TARGET_SAVE_OPT, 0},
2530 {"ctf", CTF_OPT, 0},
2531 { 0, 0, 0 }
2532 };
2533
2534 while (1)
011aacb0 2535 {
d0353e76
YQ
2536 int opt = mi_getopt ("-trace-save", argc, argv, opts,
2537 &oind, &oarg);
2538
2539 if (opt < 0)
2540 break;
2541 switch ((enum opt) opt)
2542 {
2543 case TARGET_SAVE_OPT:
2544 target_saves = 1;
2545 break;
2546 case CTF_OPT:
2547 generate_ctf = 1;
2548 break;
2549 }
011aacb0 2550 }
d0353e76 2551 filename = argv[oind];
011aacb0 2552
d0353e76
YQ
2553 if (generate_ctf)
2554 trace_save_ctf (filename, target_saves);
2555 else
2556 trace_save_tfile (filename, target_saves);
011aacb0
VP
2557}
2558
f224b49d
VP
2559void
2560mi_cmd_trace_start (char *command, char **argv, int argc)
2561{
f196051f 2562 start_tracing (NULL);
f224b49d
VP
2563}
2564
2565void
2566mi_cmd_trace_status (char *command, char **argv, int argc)
2567{
2568 trace_status_mi (0);
2569}
2570
2571void
2572mi_cmd_trace_stop (char *command, char **argv, int argc)
2573{
f196051f 2574 stop_tracing (NULL);
f224b49d
VP
2575 trace_status_mi (1);
2576}
75082e8c 2577
2b03b41d 2578/* Implement the "-ada-task-info" command. */
75082e8c
JB
2579
2580void
2581mi_cmd_ada_task_info (char *command, char **argv, int argc)
2582{
2583 if (argc != 0 && argc != 1)
2584 error (_("Invalid MI command"));
2585
2586 print_ada_task_info (current_uiout, argv[0], current_inferior ());
2587}
dc673c81
YQ
2588
2589/* Print EXPRESSION according to VALUES. */
2590
2591static void
2592print_variable_or_computed (char *expression, enum print_values values)
2593{
2594 struct expression *expr;
2595 struct cleanup *old_chain;
2596 struct value *val;
2597 struct ui_file *stb;
2598 struct value_print_options opts;
2599 struct type *type;
2600 struct ui_out *uiout = current_uiout;
2601
2602 stb = mem_fileopen ();
2603 old_chain = make_cleanup_ui_file_delete (stb);
2604
2605 expr = parse_expression (expression);
2606
2607 make_cleanup (free_current_contents, &expr);
2608
2609 if (values == PRINT_SIMPLE_VALUES)
2610 val = evaluate_type (expr);
2611 else
2612 val = evaluate_expression (expr);
2613
2614 if (values != PRINT_NO_VALUES)
2615 make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
2616 ui_out_field_string (uiout, "name", expression);
2617
2618 switch (values)
2619 {
2620 case PRINT_SIMPLE_VALUES:
2621 type = check_typedef (value_type (val));
2622 type_print (value_type (val), "", stb, -1);
2623 ui_out_field_stream (uiout, "type", stb);
2624 if (TYPE_CODE (type) != TYPE_CODE_ARRAY
2625 && TYPE_CODE (type) != TYPE_CODE_STRUCT
2626 && TYPE_CODE (type) != TYPE_CODE_UNION)
2627 {
2628 struct value_print_options opts;
2629
2a998fc0 2630 get_no_prettyformat_print_options (&opts);
dc673c81
YQ
2631 opts.deref_ref = 1;
2632 common_val_print (val, stb, 0, &opts, current_language);
2633 ui_out_field_stream (uiout, "value", stb);
2634 }
2635 break;
2636 case PRINT_ALL_VALUES:
2637 {
2638 struct value_print_options opts;
2639
2a998fc0 2640 get_no_prettyformat_print_options (&opts);
dc673c81
YQ
2641 opts.deref_ref = 1;
2642 common_val_print (val, stb, 0, &opts, current_language);
2643 ui_out_field_stream (uiout, "value", stb);
2644 }
2645 break;
2646 }
2647
2648 do_cleanups (old_chain);
2649}
2650
2651/* Implement the "-trace-frame-collected" command. */
2652
2653void
2654mi_cmd_trace_frame_collected (char *command, char **argv, int argc)
2655{
2656 struct cleanup *old_chain;
2657 struct bp_location *tloc;
2658 int stepping_frame;
2659 struct collection_list *clist;
2660 struct collection_list tracepoint_list, stepping_list;
2661 struct traceframe_info *tinfo;
2662 int oind = 0;
2663 int var_print_values = PRINT_ALL_VALUES;
2664 int comp_print_values = PRINT_ALL_VALUES;
2665 int registers_format = 'x';
2666 int memory_contents = 0;
2667 struct ui_out *uiout = current_uiout;
2668 enum opt
2669 {
2670 VAR_PRINT_VALUES,
2671 COMP_PRINT_VALUES,
2672 REGISTERS_FORMAT,
2673 MEMORY_CONTENTS,
2674 };
2675 static const struct mi_opt opts[] =
2676 {
2677 {"-var-print-values", VAR_PRINT_VALUES, 1},
2678 {"-comp-print-values", COMP_PRINT_VALUES, 1},
2679 {"-registers-format", REGISTERS_FORMAT, 1},
2680 {"-memory-contents", MEMORY_CONTENTS, 0},
2681 { 0, 0, 0 }
2682 };
2683
2684 while (1)
2685 {
2686 char *oarg;
2687 int opt = mi_getopt ("-trace-frame-collected", argc, argv, opts,
2688 &oind, &oarg);
2689 if (opt < 0)
2690 break;
2691 switch ((enum opt) opt)
2692 {
2693 case VAR_PRINT_VALUES:
2694 var_print_values = mi_parse_print_values (oarg);
2695 break;
2696 case COMP_PRINT_VALUES:
2697 comp_print_values = mi_parse_print_values (oarg);
2698 break;
2699 case REGISTERS_FORMAT:
2700 registers_format = oarg[0];
2701 case MEMORY_CONTENTS:
2702 memory_contents = 1;
2703 break;
2704 }
2705 }
2706
2707 if (oind != argc)
2708 error (_("Usage: -trace-frame-collected "
2709 "[--var-print-values PRINT_VALUES] "
2710 "[--comp-print-values PRINT_VALUES] "
2711 "[--registers-format FORMAT]"
2712 "[--memory-contents]"));
2713
2714 /* This throws an error is not inspecting a trace frame. */
2715 tloc = get_traceframe_location (&stepping_frame);
2716
2717 /* This command only makes sense for the current frame, not the
2718 selected frame. */
2719 old_chain = make_cleanup_restore_current_thread ();
2720 select_frame (get_current_frame ());
2721
2722 encode_actions_and_make_cleanup (tloc, &tracepoint_list,
2723 &stepping_list);
2724
2725 if (stepping_frame)
2726 clist = &stepping_list;
2727 else
2728 clist = &tracepoint_list;
2729
2730 tinfo = get_traceframe_info ();
2731
2732 /* Explicitly wholly collected variables. */
2733 {
2734 struct cleanup *list_cleanup;
2735 char *p;
2736 int i;
2737
2738 list_cleanup = make_cleanup_ui_out_list_begin_end (uiout,
2739 "explicit-variables");
2740 for (i = 0; VEC_iterate (char_ptr, clist->wholly_collected, i, p); i++)
2741 print_variable_or_computed (p, var_print_values);
2742 do_cleanups (list_cleanup);
2743 }
2744
2745 /* Computed expressions. */
2746 {
2747 struct cleanup *list_cleanup;
2748 char *p;
2749 int i;
2750
2751 list_cleanup
2752 = make_cleanup_ui_out_list_begin_end (uiout,
2753 "computed-expressions");
2754 for (i = 0; VEC_iterate (char_ptr, clist->computed, i, p); i++)
2755 print_variable_or_computed (p, comp_print_values);
2756 do_cleanups (list_cleanup);
2757 }
2758
2759 /* Registers. Given pseudo-registers, and that some architectures
2760 (like MIPS) actually hide the raw registers, we don't go through
2761 the trace frame info, but instead consult the register cache for
2762 register availability. */
2763 {
2764 struct cleanup *list_cleanup;
2765 struct frame_info *frame;
2766 struct gdbarch *gdbarch;
2767 int regnum;
2768 int numregs;
2769
2770 list_cleanup = make_cleanup_ui_out_list_begin_end (uiout, "registers");
2771
2772 frame = get_selected_frame (NULL);
2773 gdbarch = get_frame_arch (frame);
2774 numregs = gdbarch_num_regs (gdbarch) + gdbarch_num_pseudo_regs (gdbarch);
2775
2776 for (regnum = 0; regnum < numregs; regnum++)
2777 {
2778 if (gdbarch_register_name (gdbarch, regnum) == NULL
2779 || *(gdbarch_register_name (gdbarch, regnum)) == '\0')
2780 continue;
2781
2782 output_register (frame, regnum, registers_format, 1);
2783 }
2784
2785 do_cleanups (list_cleanup);
2786 }
2787
2788 /* Trace state variables. */
2789 {
2790 struct cleanup *list_cleanup;
2791 int tvar;
2792 char *tsvname;
2793 int i;
2794
2795 list_cleanup = make_cleanup_ui_out_list_begin_end (uiout, "tvars");
2796
2797 tsvname = NULL;
2798 make_cleanup (free_current_contents, &tsvname);
2799
2800 for (i = 0; VEC_iterate (int, tinfo->tvars, i, tvar); i++)
2801 {
2802 struct cleanup *cleanup_child;
2803 struct trace_state_variable *tsv;
2804
2805 tsv = find_trace_state_variable_by_number (tvar);
2806
2807 cleanup_child = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
2808
2809 if (tsv != NULL)
2810 {
2811 tsvname = xrealloc (tsvname, strlen (tsv->name) + 2);
2812 tsvname[0] = '$';
2813 strcpy (tsvname + 1, tsv->name);
2814 ui_out_field_string (uiout, "name", tsvname);
2815
2816 tsv->value_known = target_get_trace_state_variable_value (tsv->number,
2817 &tsv->value);
2818 ui_out_field_int (uiout, "current", tsv->value);
2819 }
2820 else
2821 {
2822 ui_out_field_skip (uiout, "name");
2823 ui_out_field_skip (uiout, "current");
2824 }
2825
2826 do_cleanups (cleanup_child);
2827 }
2828
2829 do_cleanups (list_cleanup);
2830 }
2831
2832 /* Memory. */
2833 {
2834 struct cleanup *list_cleanup;
2835 VEC(mem_range_s) *available_memory = NULL;
2836 struct mem_range *r;
2837 int i;
2838
2839 traceframe_available_memory (&available_memory, 0, ULONGEST_MAX);
2840 make_cleanup (VEC_cleanup(mem_range_s), &available_memory);
2841
2842 list_cleanup = make_cleanup_ui_out_list_begin_end (uiout, "memory");
2843
2844 for (i = 0; VEC_iterate (mem_range_s, available_memory, i, r); i++)
2845 {
2846 struct cleanup *cleanup_child;
2847 gdb_byte *data;
2848 struct gdbarch *gdbarch = target_gdbarch ();
2849
2850 cleanup_child = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
2851
2852 ui_out_field_core_addr (uiout, "address", gdbarch, r->start);
2853 ui_out_field_int (uiout, "length", r->length);
2854
2855 data = xmalloc (r->length);
2856 make_cleanup (xfree, data);
2857
2858 if (memory_contents)
2859 {
2860 if (target_read_memory (r->start, data, r->length) == 0)
2861 {
2862 int m;
2863 char *data_str, *p;
2864
2865 data_str = xmalloc (r->length * 2 + 1);
2866 make_cleanup (xfree, data_str);
2867
2868 for (m = 0, p = data_str; m < r->length; ++m, p += 2)
2869 sprintf (p, "%02x", data[m]);
2870 ui_out_field_string (uiout, "contents", data_str);
2871 }
2872 else
2873 ui_out_field_skip (uiout, "contents");
2874 }
2875 do_cleanups (cleanup_child);
2876 }
2877
2878 do_cleanups (list_cleanup);
2879 }
2880
2881 do_cleanups (old_chain);
2882}
This page took 1.456728 seconds and 4 git commands to generate.