* ser-e7kpc.c (e7000pc_setstopbits): New function.
[deliverable/binutils-gdb.git] / gdb / utils.c
1 /* General utility routines for GDB, the GNU debugger.
2 Copyright 1986, 1989, 1990-1992, 1995, 1996, 1998, 2000
3 Free Software Foundation, Inc.
4
5 This file is part of GDB.
6
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
11
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
21
22 #include "defs.h"
23 #include <ctype.h>
24 #include "gdb_string.h"
25 #include "event-top.h"
26
27 #ifdef HAVE_CURSES_H
28 #include <curses.h>
29 #endif
30 #ifdef HAVE_TERM_H
31 #include <term.h>
32 #endif
33
34 #ifdef __GO32__
35 #include <pc.h>
36 #endif
37
38 /* SunOS's curses.h has a '#define reg register' in it. Thank you Sun. */
39 #ifdef reg
40 #undef reg
41 #endif
42
43 #include "signals.h"
44 #include "gdbcmd.h"
45 #include "serial.h"
46 #include "bfd.h"
47 #include "target.h"
48 #include "demangle.h"
49 #include "expression.h"
50 #include "language.h"
51 #include "annotate.h"
52
53 #include "inferior.h" /* for signed_pointer_to_address */
54
55 #include <readline/readline.h>
56
57 #undef XMALLOC
58 #define XMALLOC(TYPE) ((TYPE*) xmalloc (sizeof (TYPE)))
59
60 /* readline defines this. */
61 #undef savestring
62
63 void (*error_begin_hook) (void);
64
65 /* Holds the last error message issued by gdb */
66
67 static struct ui_file *gdb_lasterr;
68
69 /* Prototypes for local functions */
70
71 static void vfprintf_maybe_filtered (struct ui_file *, const char *,
72 va_list, int);
73
74 static void fputs_maybe_filtered (const char *, struct ui_file *, int);
75
76 #if defined (USE_MMALLOC) && !defined (NO_MMCHECK)
77 static void malloc_botch (void);
78 #endif
79
80 static void prompt_for_continue (void);
81
82 static void set_width_command (char *, int, struct cmd_list_element *);
83
84 static void set_width (void);
85
86 /* Chain of cleanup actions established with make_cleanup,
87 to be executed if an error happens. */
88
89 static struct cleanup *cleanup_chain; /* cleaned up after a failed command */
90 static struct cleanup *final_cleanup_chain; /* cleaned up when gdb exits */
91 static struct cleanup *run_cleanup_chain; /* cleaned up on each 'run' */
92 static struct cleanup *exec_cleanup_chain; /* cleaned up on each execution command */
93 /* cleaned up on each error from within an execution command */
94 static struct cleanup *exec_error_cleanup_chain;
95
96 /* Pointer to what is left to do for an execution command after the
97 target stops. Used only in asynchronous mode, by targets that
98 support async execution. The finish and until commands use it. So
99 does the target extended-remote command. */
100 struct continuation *cmd_continuation;
101 struct continuation *intermediate_continuation;
102
103 /* Nonzero if we have job control. */
104
105 int job_control;
106
107 /* Nonzero means a quit has been requested. */
108
109 int quit_flag;
110
111 /* Nonzero means quit immediately if Control-C is typed now, rather
112 than waiting until QUIT is executed. Be careful in setting this;
113 code which executes with immediate_quit set has to be very careful
114 about being able to deal with being interrupted at any time. It is
115 almost always better to use QUIT; the only exception I can think of
116 is being able to quit out of a system call (using EINTR loses if
117 the SIGINT happens between the previous QUIT and the system call).
118 To immediately quit in the case in which a SIGINT happens between
119 the previous QUIT and setting immediate_quit (desirable anytime we
120 expect to block), call QUIT after setting immediate_quit. */
121
122 int immediate_quit;
123
124 /* Nonzero means that encoded C++ names should be printed out in their
125 C++ form rather than raw. */
126
127 int demangle = 1;
128
129 /* Nonzero means that encoded C++ names should be printed out in their
130 C++ form even in assembler language displays. If this is set, but
131 DEMANGLE is zero, names are printed raw, i.e. DEMANGLE controls. */
132
133 int asm_demangle = 0;
134
135 /* Nonzero means that strings with character values >0x7F should be printed
136 as octal escapes. Zero means just print the value (e.g. it's an
137 international character, and the terminal or window can cope.) */
138
139 int sevenbit_strings = 0;
140
141 /* String to be printed before error messages, if any. */
142
143 char *error_pre_print;
144
145 /* String to be printed before quit messages, if any. */
146
147 char *quit_pre_print;
148
149 /* String to be printed before warning messages, if any. */
150
151 char *warning_pre_print = "\nwarning: ";
152
153 int pagination_enabled = 1;
154 \f
155
156 /* Add a new cleanup to the cleanup_chain,
157 and return the previous chain pointer
158 to be passed later to do_cleanups or discard_cleanups.
159 Args are FUNCTION to clean up with, and ARG to pass to it. */
160
161 struct cleanup *
162 make_cleanup (make_cleanup_ftype *function, void *arg)
163 {
164 return make_my_cleanup (&cleanup_chain, function, arg);
165 }
166
167 struct cleanup *
168 make_final_cleanup (make_cleanup_ftype *function, void *arg)
169 {
170 return make_my_cleanup (&final_cleanup_chain, function, arg);
171 }
172
173 struct cleanup *
174 make_run_cleanup (make_cleanup_ftype *function, void *arg)
175 {
176 return make_my_cleanup (&run_cleanup_chain, function, arg);
177 }
178
179 struct cleanup *
180 make_exec_cleanup (make_cleanup_ftype *function, void *arg)
181 {
182 return make_my_cleanup (&exec_cleanup_chain, function, arg);
183 }
184
185 struct cleanup *
186 make_exec_error_cleanup (make_cleanup_ftype *function, void *arg)
187 {
188 return make_my_cleanup (&exec_error_cleanup_chain, function, arg);
189 }
190
191 static void
192 do_freeargv (void *arg)
193 {
194 freeargv ((char **) arg);
195 }
196
197 struct cleanup *
198 make_cleanup_freeargv (char **arg)
199 {
200 return make_my_cleanup (&cleanup_chain, do_freeargv, arg);
201 }
202
203 static void
204 do_bfd_close_cleanup (void *arg)
205 {
206 bfd_close (arg);
207 }
208
209 struct cleanup *
210 make_cleanup_bfd_close (bfd *abfd)
211 {
212 return make_cleanup (do_bfd_close_cleanup, abfd);
213 }
214
215 static void
216 do_close_cleanup (void *arg)
217 {
218 close ((int) arg);
219 }
220
221 struct cleanup *
222 make_cleanup_close (int fd)
223 {
224 /* int into void*. Outch!! */
225 return make_cleanup (do_close_cleanup, (void *) fd);
226 }
227
228 static void
229 do_ui_file_delete (void *arg)
230 {
231 ui_file_delete (arg);
232 }
233
234 struct cleanup *
235 make_cleanup_ui_file_delete (struct ui_file *arg)
236 {
237 return make_my_cleanup (&cleanup_chain, do_ui_file_delete, arg);
238 }
239
240 struct cleanup *
241 make_my_cleanup (struct cleanup **pmy_chain, make_cleanup_ftype *function,
242 void *arg)
243 {
244 register struct cleanup *new
245 = (struct cleanup *) xmalloc (sizeof (struct cleanup));
246 register struct cleanup *old_chain = *pmy_chain;
247
248 new->next = *pmy_chain;
249 new->function = function;
250 new->arg = arg;
251 *pmy_chain = new;
252
253 return old_chain;
254 }
255
256 /* Discard cleanups and do the actions they describe
257 until we get back to the point OLD_CHAIN in the cleanup_chain. */
258
259 void
260 do_cleanups (register struct cleanup *old_chain)
261 {
262 do_my_cleanups (&cleanup_chain, old_chain);
263 }
264
265 void
266 do_final_cleanups (register struct cleanup *old_chain)
267 {
268 do_my_cleanups (&final_cleanup_chain, old_chain);
269 }
270
271 void
272 do_run_cleanups (register struct cleanup *old_chain)
273 {
274 do_my_cleanups (&run_cleanup_chain, old_chain);
275 }
276
277 void
278 do_exec_cleanups (register struct cleanup *old_chain)
279 {
280 do_my_cleanups (&exec_cleanup_chain, old_chain);
281 }
282
283 void
284 do_exec_error_cleanups (register struct cleanup *old_chain)
285 {
286 do_my_cleanups (&exec_error_cleanup_chain, old_chain);
287 }
288
289 void
290 do_my_cleanups (register struct cleanup **pmy_chain,
291 register struct cleanup *old_chain)
292 {
293 register struct cleanup *ptr;
294 while ((ptr = *pmy_chain) != old_chain)
295 {
296 *pmy_chain = ptr->next; /* Do this first incase recursion */
297 (*ptr->function) (ptr->arg);
298 free (ptr);
299 }
300 }
301
302 /* Discard cleanups, not doing the actions they describe,
303 until we get back to the point OLD_CHAIN in the cleanup_chain. */
304
305 void
306 discard_cleanups (register struct cleanup *old_chain)
307 {
308 discard_my_cleanups (&cleanup_chain, old_chain);
309 }
310
311 void
312 discard_final_cleanups (register struct cleanup *old_chain)
313 {
314 discard_my_cleanups (&final_cleanup_chain, old_chain);
315 }
316
317 void
318 discard_exec_error_cleanups (register struct cleanup *old_chain)
319 {
320 discard_my_cleanups (&exec_error_cleanup_chain, old_chain);
321 }
322
323 void
324 discard_my_cleanups (register struct cleanup **pmy_chain,
325 register struct cleanup *old_chain)
326 {
327 register struct cleanup *ptr;
328 while ((ptr = *pmy_chain) != old_chain)
329 {
330 *pmy_chain = ptr->next;
331 free (ptr);
332 }
333 }
334
335 /* Set the cleanup_chain to 0, and return the old cleanup chain. */
336 struct cleanup *
337 save_cleanups (void)
338 {
339 return save_my_cleanups (&cleanup_chain);
340 }
341
342 struct cleanup *
343 save_final_cleanups (void)
344 {
345 return save_my_cleanups (&final_cleanup_chain);
346 }
347
348 struct cleanup *
349 save_my_cleanups (struct cleanup **pmy_chain)
350 {
351 struct cleanup *old_chain = *pmy_chain;
352
353 *pmy_chain = 0;
354 return old_chain;
355 }
356
357 /* Restore the cleanup chain from a previously saved chain. */
358 void
359 restore_cleanups (struct cleanup *chain)
360 {
361 restore_my_cleanups (&cleanup_chain, chain);
362 }
363
364 void
365 restore_final_cleanups (struct cleanup *chain)
366 {
367 restore_my_cleanups (&final_cleanup_chain, chain);
368 }
369
370 void
371 restore_my_cleanups (struct cleanup **pmy_chain, struct cleanup *chain)
372 {
373 *pmy_chain = chain;
374 }
375
376 /* This function is useful for cleanups.
377 Do
378
379 foo = xmalloc (...);
380 old_chain = make_cleanup (free_current_contents, &foo);
381
382 to arrange to free the object thus allocated. */
383
384 void
385 free_current_contents (void *ptr)
386 {
387 void **location = ptr;
388 if (location == NULL)
389 internal_error ("free_current_contents: NULL pointer");
390 if (*location != NULL)
391 {
392 free (*location);
393 *location = NULL;
394 }
395 }
396
397 /* Provide a known function that does nothing, to use as a base for
398 for a possibly long chain of cleanups. This is useful where we
399 use the cleanup chain for handling normal cleanups as well as dealing
400 with cleanups that need to be done as a result of a call to error().
401 In such cases, we may not be certain where the first cleanup is, unless
402 we have a do-nothing one to always use as the base. */
403
404 /* ARGSUSED */
405 void
406 null_cleanup (void *arg)
407 {
408 }
409
410 /* Add a continuation to the continuation list, the global list
411 cmd_continuation. The new continuation will be added at the front.*/
412 void
413 add_continuation (void (*continuation_hook) (struct continuation_arg *),
414 struct continuation_arg *arg_list)
415 {
416 struct continuation *continuation_ptr;
417
418 continuation_ptr = (struct continuation *) xmalloc (sizeof (struct continuation));
419 continuation_ptr->continuation_hook = continuation_hook;
420 continuation_ptr->arg_list = arg_list;
421 continuation_ptr->next = cmd_continuation;
422 cmd_continuation = continuation_ptr;
423 }
424
425 /* Walk down the cmd_continuation list, and execute all the
426 continuations. There is a problem though. In some cases new
427 continuations may be added while we are in the middle of this
428 loop. If this happens they will be added in the front, and done
429 before we have a chance of exhausting those that were already
430 there. We need to then save the beginning of the list in a pointer
431 and do the continuations from there on, instead of using the
432 global beginning of list as our iteration pointer.*/
433 void
434 do_all_continuations (void)
435 {
436 struct continuation *continuation_ptr;
437 struct continuation *saved_continuation;
438
439 /* Copy the list header into another pointer, and set the global
440 list header to null, so that the global list can change as a side
441 effect of invoking the continuations and the processing of
442 the preexisting continuations will not be affected. */
443 continuation_ptr = cmd_continuation;
444 cmd_continuation = NULL;
445
446 /* Work now on the list we have set aside. */
447 while (continuation_ptr)
448 {
449 (continuation_ptr->continuation_hook) (continuation_ptr->arg_list);
450 saved_continuation = continuation_ptr;
451 continuation_ptr = continuation_ptr->next;
452 free (saved_continuation);
453 }
454 }
455
456 /* Walk down the cmd_continuation list, and get rid of all the
457 continuations. */
458 void
459 discard_all_continuations (void)
460 {
461 struct continuation *continuation_ptr;
462
463 while (cmd_continuation)
464 {
465 continuation_ptr = cmd_continuation;
466 cmd_continuation = continuation_ptr->next;
467 free (continuation_ptr);
468 }
469 }
470
471 /* Add a continuation to the continuation list, the global list
472 intermediate_continuation. The new continuation will be added at the front.*/
473 void
474 add_intermediate_continuation (void (*continuation_hook)
475 (struct continuation_arg *),
476 struct continuation_arg *arg_list)
477 {
478 struct continuation *continuation_ptr;
479
480 continuation_ptr = (struct continuation *) xmalloc (sizeof (struct continuation));
481 continuation_ptr->continuation_hook = continuation_hook;
482 continuation_ptr->arg_list = arg_list;
483 continuation_ptr->next = intermediate_continuation;
484 intermediate_continuation = continuation_ptr;
485 }
486
487 /* Walk down the cmd_continuation list, and execute all the
488 continuations. There is a problem though. In some cases new
489 continuations may be added while we are in the middle of this
490 loop. If this happens they will be added in the front, and done
491 before we have a chance of exhausting those that were already
492 there. We need to then save the beginning of the list in a pointer
493 and do the continuations from there on, instead of using the
494 global beginning of list as our iteration pointer.*/
495 void
496 do_all_intermediate_continuations (void)
497 {
498 struct continuation *continuation_ptr;
499 struct continuation *saved_continuation;
500
501 /* Copy the list header into another pointer, and set the global
502 list header to null, so that the global list can change as a side
503 effect of invoking the continuations and the processing of
504 the preexisting continuations will not be affected. */
505 continuation_ptr = intermediate_continuation;
506 intermediate_continuation = NULL;
507
508 /* Work now on the list we have set aside. */
509 while (continuation_ptr)
510 {
511 (continuation_ptr->continuation_hook) (continuation_ptr->arg_list);
512 saved_continuation = continuation_ptr;
513 continuation_ptr = continuation_ptr->next;
514 free (saved_continuation);
515 }
516 }
517
518 /* Walk down the cmd_continuation list, and get rid of all the
519 continuations. */
520 void
521 discard_all_intermediate_continuations (void)
522 {
523 struct continuation *continuation_ptr;
524
525 while (intermediate_continuation)
526 {
527 continuation_ptr = intermediate_continuation;
528 intermediate_continuation = continuation_ptr->next;
529 free (continuation_ptr);
530 }
531 }
532
533 \f
534
535 /* Print a warning message. Way to use this is to call warning_begin,
536 output the warning message (use unfiltered output to gdb_stderr),
537 ending in a newline. There is not currently a warning_end that you
538 call afterwards, but such a thing might be added if it is useful
539 for a GUI to separate warning messages from other output.
540
541 FIXME: Why do warnings use unfiltered output and errors filtered?
542 Is this anything other than a historical accident? */
543
544 void
545 warning_begin (void)
546 {
547 target_terminal_ours ();
548 wrap_here (""); /* Force out any buffered output */
549 gdb_flush (gdb_stdout);
550 if (warning_pre_print)
551 fprintf_unfiltered (gdb_stderr, warning_pre_print);
552 }
553
554 /* Print a warning message.
555 The first argument STRING is the warning message, used as a fprintf string,
556 and the remaining args are passed as arguments to it.
557 The primary difference between warnings and errors is that a warning
558 does not force the return to command level. */
559
560 void
561 warning (const char *string,...)
562 {
563 va_list args;
564 va_start (args, string);
565 if (warning_hook)
566 (*warning_hook) (string, args);
567 else
568 {
569 warning_begin ();
570 vfprintf_unfiltered (gdb_stderr, string, args);
571 fprintf_unfiltered (gdb_stderr, "\n");
572 va_end (args);
573 }
574 }
575
576 /* Start the printing of an error message. Way to use this is to call
577 this, output the error message (use filtered output to gdb_stderr
578 (FIXME: Some callers, like memory_error, use gdb_stdout)), ending
579 in a newline, and then call return_to_top_level (RETURN_ERROR).
580 error() provides a convenient way to do this for the special case
581 that the error message can be formatted with a single printf call,
582 but this is more general. */
583 void
584 error_begin (void)
585 {
586 if (error_begin_hook)
587 error_begin_hook ();
588
589 target_terminal_ours ();
590 wrap_here (""); /* Force out any buffered output */
591 gdb_flush (gdb_stdout);
592
593 annotate_error_begin ();
594
595 if (error_pre_print)
596 fprintf_filtered (gdb_stderr, error_pre_print);
597 }
598
599 /* Print an error message and return to command level.
600 The first argument STRING is the error message, used as a fprintf string,
601 and the remaining args are passed as arguments to it. */
602
603 NORETURN void
604 verror (const char *string, va_list args)
605 {
606 char *err_string;
607 struct cleanup *err_string_cleanup;
608 /* FIXME: cagney/1999-11-10: All error calls should come here.
609 Unfortunately some code uses the sequence: error_begin(); print
610 error message; return_to_top_level. That code should be
611 flushed. */
612 error_begin ();
613 /* NOTE: It's tempting to just do the following...
614 vfprintf_filtered (gdb_stderr, string, args);
615 and then follow with a similar looking statement to cause the message
616 to also go to gdb_lasterr. But if we do this, we'll be traversing the
617 va_list twice which works on some platforms and fails miserably on
618 others. */
619 /* Save it as the last error */
620 ui_file_rewind (gdb_lasterr);
621 vfprintf_filtered (gdb_lasterr, string, args);
622 /* Retrieve the last error and print it to gdb_stderr */
623 err_string = error_last_message ();
624 err_string_cleanup = make_cleanup (free, err_string);
625 fputs_filtered (err_string, gdb_stderr);
626 fprintf_filtered (gdb_stderr, "\n");
627 do_cleanups (err_string_cleanup);
628 return_to_top_level (RETURN_ERROR);
629 }
630
631 NORETURN void
632 error (const char *string,...)
633 {
634 va_list args;
635 va_start (args, string);
636 verror (string, args);
637 va_end (args);
638 }
639
640 NORETURN void
641 error_stream (struct ui_file *stream)
642 {
643 long size;
644 char *msg = ui_file_xstrdup (stream, &size);
645 make_cleanup (free, msg);
646 error ("%s", msg);
647 }
648
649 /* Get the last error message issued by gdb */
650
651 char *
652 error_last_message (void)
653 {
654 long len;
655 return ui_file_xstrdup (gdb_lasterr, &len);
656 }
657
658 /* This is to be called by main() at the very beginning */
659
660 void
661 error_init (void)
662 {
663 gdb_lasterr = mem_fileopen ();
664 }
665
666 /* Print a message reporting an internal error. Ask the user if they
667 want to continue, dump core, or just exit. */
668
669 NORETURN void
670 internal_verror (const char *fmt, va_list ap)
671 {
672 static char msg[] = "Internal GDB error: recursive internal error.\n";
673 static int dejavu = 0;
674 int continue_p;
675 int dump_core_p;
676
677 /* don't allow infinite error recursion. */
678 switch (dejavu)
679 {
680 case 0:
681 dejavu = 1;
682 break;
683 case 1:
684 dejavu = 2;
685 fputs_unfiltered (msg, gdb_stderr);
686 abort ();
687 default:
688 dejavu = 3;
689 write (STDERR_FILENO, msg, sizeof (msg));
690 exit (1);
691 }
692
693 /* Try to get the message out */
694 target_terminal_ours ();
695 fputs_unfiltered ("gdb-internal-error: ", gdb_stderr);
696 vfprintf_unfiltered (gdb_stderr, fmt, ap);
697 fputs_unfiltered ("\n", gdb_stderr);
698
699 /* Default (no case) is to quit GDB. When in batch mode this
700 lessens the likelhood of GDB going into an infinate loop. */
701 continue_p = query ("\
702 An internal GDB error was detected. This may make make further\n\
703 debugging unreliable. Continue this debugging session? ");
704
705 /* Default (no case) is to not dump core. Lessen the chance of GDB
706 leaving random core files around. */
707 dump_core_p = query ("\
708 Create a core file containing the current state of GDB? ");
709
710 if (continue_p)
711 {
712 if (dump_core_p)
713 {
714 if (fork () == 0)
715 abort ();
716 }
717 }
718 else
719 {
720 if (dump_core_p)
721 abort ();
722 else
723 exit (1);
724 }
725
726 dejavu = 0;
727 return_to_top_level (RETURN_ERROR);
728 }
729
730 NORETURN void
731 internal_error (char *string, ...)
732 {
733 va_list ap;
734 va_start (ap, string);
735
736 internal_verror (string, ap);
737 va_end (ap);
738 }
739
740 /* The strerror() function can return NULL for errno values that are
741 out of range. Provide a "safe" version that always returns a
742 printable string. */
743
744 char *
745 safe_strerror (int errnum)
746 {
747 char *msg;
748 static char buf[32];
749
750 if ((msg = strerror (errnum)) == NULL)
751 {
752 sprintf (buf, "(undocumented errno %d)", errnum);
753 msg = buf;
754 }
755 return (msg);
756 }
757
758 /* Print the system error message for errno, and also mention STRING
759 as the file name for which the error was encountered.
760 Then return to command level. */
761
762 NORETURN void
763 perror_with_name (char *string)
764 {
765 char *err;
766 char *combined;
767
768 err = safe_strerror (errno);
769 combined = (char *) alloca (strlen (err) + strlen (string) + 3);
770 strcpy (combined, string);
771 strcat (combined, ": ");
772 strcat (combined, err);
773
774 /* I understand setting these is a matter of taste. Still, some people
775 may clear errno but not know about bfd_error. Doing this here is not
776 unreasonable. */
777 bfd_set_error (bfd_error_no_error);
778 errno = 0;
779
780 error ("%s.", combined);
781 }
782
783 /* Print the system error message for ERRCODE, and also mention STRING
784 as the file name for which the error was encountered. */
785
786 void
787 print_sys_errmsg (char *string, int errcode)
788 {
789 char *err;
790 char *combined;
791
792 err = safe_strerror (errcode);
793 combined = (char *) alloca (strlen (err) + strlen (string) + 3);
794 strcpy (combined, string);
795 strcat (combined, ": ");
796 strcat (combined, err);
797
798 /* We want anything which was printed on stdout to come out first, before
799 this message. */
800 gdb_flush (gdb_stdout);
801 fprintf_unfiltered (gdb_stderr, "%s.\n", combined);
802 }
803
804 /* Control C eventually causes this to be called, at a convenient time. */
805
806 void
807 quit (void)
808 {
809 serial_t gdb_stdout_serial = serial_fdopen (1);
810
811 target_terminal_ours ();
812
813 /* We want all output to appear now, before we print "Quit". We
814 have 3 levels of buffering we have to flush (it's possible that
815 some of these should be changed to flush the lower-level ones
816 too): */
817
818 /* 1. The _filtered buffer. */
819 wrap_here ((char *) 0);
820
821 /* 2. The stdio buffer. */
822 gdb_flush (gdb_stdout);
823 gdb_flush (gdb_stderr);
824
825 /* 3. The system-level buffer. */
826 SERIAL_DRAIN_OUTPUT (gdb_stdout_serial);
827 SERIAL_UN_FDOPEN (gdb_stdout_serial);
828
829 annotate_error_begin ();
830
831 /* Don't use *_filtered; we don't want to prompt the user to continue. */
832 if (quit_pre_print)
833 fprintf_unfiltered (gdb_stderr, quit_pre_print);
834
835 #ifdef __MSDOS__
836 /* No steenking SIGINT will ever be coming our way when the
837 program is resumed. Don't lie. */
838 fprintf_unfiltered (gdb_stderr, "Quit\n");
839 #else
840 if (job_control
841 /* If there is no terminal switching for this target, then we can't
842 possibly get screwed by the lack of job control. */
843 || current_target.to_terminal_ours == NULL)
844 fprintf_unfiltered (gdb_stderr, "Quit\n");
845 else
846 fprintf_unfiltered (gdb_stderr,
847 "Quit (expect signal SIGINT when the program is resumed)\n");
848 #endif
849 return_to_top_level (RETURN_QUIT);
850 }
851
852
853 #if defined(_MSC_VER) /* should test for wingdb instead? */
854
855 /*
856 * Windows translates all keyboard and mouse events
857 * into a message which is appended to the message
858 * queue for the process.
859 */
860
861 void
862 notice_quit (void)
863 {
864 int k = win32pollquit ();
865 if (k == 1)
866 quit_flag = 1;
867 else if (k == 2)
868 immediate_quit = 1;
869 }
870
871 #else /* !defined(_MSC_VER) */
872
873 void
874 notice_quit (void)
875 {
876 /* Done by signals */
877 }
878
879 #endif /* !defined(_MSC_VER) */
880
881 /* Control C comes here */
882 void
883 request_quit (int signo)
884 {
885 quit_flag = 1;
886 /* Restore the signal handler. Harmless with BSD-style signals, needed
887 for System V-style signals. So just always do it, rather than worrying
888 about USG defines and stuff like that. */
889 signal (signo, request_quit);
890
891 #ifdef REQUEST_QUIT
892 REQUEST_QUIT;
893 #else
894 if (immediate_quit)
895 quit ();
896 #endif
897 }
898 \f
899 /* Memory management stuff (malloc friends). */
900
901 /* Make a substitute size_t for non-ANSI compilers. */
902
903 #ifndef HAVE_STDDEF_H
904 #ifndef size_t
905 #define size_t unsigned int
906 #endif
907 #endif
908
909 #if !defined (USE_MMALLOC)
910
911 PTR
912 mcalloc (PTR md, size_t number, size_t size)
913 {
914 return calloc (number, size);
915 }
916
917 PTR
918 mmalloc (PTR md, size_t size)
919 {
920 return malloc (size);
921 }
922
923 PTR
924 mrealloc (PTR md, PTR ptr, size_t size)
925 {
926 if (ptr == 0) /* Guard against old realloc's */
927 return malloc (size);
928 else
929 return realloc (ptr, size);
930 }
931
932 void
933 mfree (PTR md, PTR ptr)
934 {
935 free (ptr);
936 }
937
938 #endif /* USE_MMALLOC */
939
940 #if !defined (USE_MMALLOC) || defined (NO_MMCHECK)
941
942 void
943 init_malloc (void *md)
944 {
945 }
946
947 #else /* Have mmalloc and want corruption checking */
948
949 static void
950 malloc_botch (void)
951 {
952 fprintf_unfiltered (gdb_stderr, "Memory corruption\n");
953 abort ();
954 }
955
956 /* Attempt to install hooks in mmalloc/mrealloc/mfree for the heap specified
957 by MD, to detect memory corruption. Note that MD may be NULL to specify
958 the default heap that grows via sbrk.
959
960 Note that for freshly created regions, we must call mmcheckf prior to any
961 mallocs in the region. Otherwise, any region which was allocated prior to
962 installing the checking hooks, which is later reallocated or freed, will
963 fail the checks! The mmcheck function only allows initial hooks to be
964 installed before the first mmalloc. However, anytime after we have called
965 mmcheck the first time to install the checking hooks, we can call it again
966 to update the function pointer to the memory corruption handler.
967
968 Returns zero on failure, non-zero on success. */
969
970 #ifndef MMCHECK_FORCE
971 #define MMCHECK_FORCE 0
972 #endif
973
974 void
975 init_malloc (void *md)
976 {
977 if (!mmcheckf (md, malloc_botch, MMCHECK_FORCE))
978 {
979 /* Don't use warning(), which relies on current_target being set
980 to something other than dummy_target, until after
981 initialize_all_files(). */
982
983 fprintf_unfiltered
984 (gdb_stderr, "warning: failed to install memory consistency checks; ");
985 fprintf_unfiltered
986 (gdb_stderr, "configuration should define NO_MMCHECK or MMCHECK_FORCE\n");
987 }
988
989 mmtrace ();
990 }
991
992 #endif /* Have mmalloc and want corruption checking */
993
994 /* Called when a memory allocation fails, with the number of bytes of
995 memory requested in SIZE. */
996
997 NORETURN void
998 nomem (long size)
999 {
1000 if (size > 0)
1001 {
1002 internal_error ("virtual memory exhausted: can't allocate %ld bytes.", size);
1003 }
1004 else
1005 {
1006 internal_error ("virtual memory exhausted.");
1007 }
1008 }
1009
1010 /* Like mmalloc but get error if no storage available, and protect against
1011 the caller wanting to allocate zero bytes. Whether to return NULL for
1012 a zero byte request, or translate the request into a request for one
1013 byte of zero'd storage, is a religious issue. */
1014
1015 PTR
1016 xmmalloc (PTR md, long size)
1017 {
1018 register PTR val;
1019
1020 if (size == 0)
1021 {
1022 val = NULL;
1023 }
1024 else if ((val = mmalloc (md, size)) == NULL)
1025 {
1026 nomem (size);
1027 }
1028 return (val);
1029 }
1030
1031 /* Like mrealloc but get error if no storage available. */
1032
1033 PTR
1034 xmrealloc (PTR md, PTR ptr, long size)
1035 {
1036 register PTR val;
1037
1038 if (ptr != NULL)
1039 {
1040 val = mrealloc (md, ptr, size);
1041 }
1042 else
1043 {
1044 val = mmalloc (md, size);
1045 }
1046 if (val == NULL)
1047 {
1048 nomem (size);
1049 }
1050 return (val);
1051 }
1052
1053 /* Like malloc but get error if no storage available, and protect against
1054 the caller wanting to allocate zero bytes. */
1055
1056 PTR
1057 xmalloc (size_t size)
1058 {
1059 return (xmmalloc ((PTR) NULL, size));
1060 }
1061
1062 /* Like calloc but get error if no storage available */
1063
1064 PTR
1065 xcalloc (size_t number, size_t size)
1066 {
1067 void *mem = mcalloc (NULL, number, size);
1068 if (mem == NULL)
1069 nomem (number * size);
1070 return mem;
1071 }
1072
1073 /* Like mrealloc but get error if no storage available. */
1074
1075 PTR
1076 xrealloc (PTR ptr, size_t size)
1077 {
1078 return (xmrealloc ((PTR) NULL, ptr, size));
1079 }
1080 \f
1081
1082 /* Like asprintf/vasprintf but get an internal_error if the call
1083 fails. */
1084
1085 void
1086 xasprintf (char **ret, const char *format, ...)
1087 {
1088 va_list args;
1089 va_start (args, format);
1090 xvasprintf (ret, format, args);
1091 va_end (args);
1092 }
1093
1094 void
1095 xvasprintf (char **ret, const char *format, va_list ap)
1096 {
1097 int status = vasprintf (ret, format, ap);
1098 /* NULL could be returned due to a memory allocation problem; a
1099 badly format string; or something else. */
1100 if ((*ret) == NULL)
1101 internal_error ("%s:%d: vasprintf returned NULL buffer (errno %d)",
1102 __FILE__, __LINE__, errno);
1103 /* A negative status with a non-NULL buffer shouldn't never
1104 happen. But to be sure. */
1105 if (status < 0)
1106 internal_error ("%s:%d: vasprintf call failed (errno %d)",
1107 __FILE__, __LINE__, errno);
1108 }
1109
1110
1111 /* My replacement for the read system call.
1112 Used like `read' but keeps going if `read' returns too soon. */
1113
1114 int
1115 myread (int desc, char *addr, int len)
1116 {
1117 register int val;
1118 int orglen = len;
1119
1120 while (len > 0)
1121 {
1122 val = read (desc, addr, len);
1123 if (val < 0)
1124 return val;
1125 if (val == 0)
1126 return orglen - len;
1127 len -= val;
1128 addr += val;
1129 }
1130 return orglen;
1131 }
1132 \f
1133 /* Make a copy of the string at PTR with SIZE characters
1134 (and add a null character at the end in the copy).
1135 Uses malloc to get the space. Returns the address of the copy. */
1136
1137 char *
1138 savestring (const char *ptr, int size)
1139 {
1140 register char *p = (char *) xmalloc (size + 1);
1141 memcpy (p, ptr, size);
1142 p[size] = 0;
1143 return p;
1144 }
1145
1146 char *
1147 msavestring (void *md, const char *ptr, int size)
1148 {
1149 register char *p = (char *) xmmalloc (md, size + 1);
1150 memcpy (p, ptr, size);
1151 p[size] = 0;
1152 return p;
1153 }
1154
1155 /* The "const" is so it compiles under DGUX (which prototypes strsave
1156 in <string.h>. FIXME: This should be named "xstrsave", shouldn't it?
1157 Doesn't real strsave return NULL if out of memory? */
1158 char *
1159 strsave (const char *ptr)
1160 {
1161 return savestring (ptr, strlen (ptr));
1162 }
1163
1164 char *
1165 mstrsave (void *md, const char *ptr)
1166 {
1167 return (msavestring (md, ptr, strlen (ptr)));
1168 }
1169
1170 void
1171 print_spaces (register int n, register struct ui_file *file)
1172 {
1173 fputs_unfiltered (n_spaces (n), file);
1174 }
1175
1176 /* Print a host address. */
1177
1178 void
1179 gdb_print_host_address (void *addr, struct ui_file *stream)
1180 {
1181
1182 /* We could use the %p conversion specifier to fprintf if we had any
1183 way of knowing whether this host supports it. But the following
1184 should work on the Alpha and on 32 bit machines. */
1185
1186 fprintf_filtered (stream, "0x%lx", (unsigned long) addr);
1187 }
1188
1189 /* Ask user a y-or-n question and return 1 iff answer is yes.
1190 Takes three args which are given to printf to print the question.
1191 The first, a control string, should end in "? ".
1192 It should not say how to answer, because we do that. */
1193
1194 /* VARARGS */
1195 int
1196 query (char *ctlstr,...)
1197 {
1198 va_list args;
1199 register int answer;
1200 register int ans2;
1201 int retval;
1202
1203 va_start (args, ctlstr);
1204
1205 if (query_hook)
1206 {
1207 return query_hook (ctlstr, args);
1208 }
1209
1210 /* Automatically answer "yes" if input is not from a terminal. */
1211 if (!input_from_terminal_p ())
1212 return 1;
1213 #ifdef MPW
1214 /* FIXME Automatically answer "yes" if called from MacGDB. */
1215 if (mac_app)
1216 return 1;
1217 #endif /* MPW */
1218
1219 while (1)
1220 {
1221 wrap_here (""); /* Flush any buffered output */
1222 gdb_flush (gdb_stdout);
1223
1224 if (annotation_level > 1)
1225 printf_filtered ("\n\032\032pre-query\n");
1226
1227 vfprintf_filtered (gdb_stdout, ctlstr, args);
1228 printf_filtered ("(y or n) ");
1229
1230 if (annotation_level > 1)
1231 printf_filtered ("\n\032\032query\n");
1232
1233 #ifdef MPW
1234 /* If not in MacGDB, move to a new line so the entered line doesn't
1235 have a prompt on the front of it. */
1236 if (!mac_app)
1237 fputs_unfiltered ("\n", gdb_stdout);
1238 #endif /* MPW */
1239
1240 wrap_here ("");
1241 gdb_flush (gdb_stdout);
1242
1243 #if defined(TUI)
1244 if (!tui_version || cmdWin == tuiWinWithFocus ())
1245 #endif
1246 answer = fgetc (stdin);
1247 #if defined(TUI)
1248 else
1249 answer = (unsigned char) tuiBufferGetc ();
1250
1251 #endif
1252 clearerr (stdin); /* in case of C-d */
1253 if (answer == EOF) /* C-d */
1254 {
1255 retval = 1;
1256 break;
1257 }
1258 /* Eat rest of input line, to EOF or newline */
1259 if ((answer != '\n') || (tui_version && answer != '\r'))
1260 do
1261 {
1262 #if defined(TUI)
1263 if (!tui_version || cmdWin == tuiWinWithFocus ())
1264 #endif
1265 ans2 = fgetc (stdin);
1266 #if defined(TUI)
1267 else
1268 ans2 = (unsigned char) tuiBufferGetc ();
1269 #endif
1270 clearerr (stdin);
1271 }
1272 while (ans2 != EOF && ans2 != '\n' && ans2 != '\r');
1273 TUIDO (((TuiOpaqueFuncPtr) tui_vStartNewLines, 1));
1274
1275 if (answer >= 'a')
1276 answer -= 040;
1277 if (answer == 'Y')
1278 {
1279 retval = 1;
1280 break;
1281 }
1282 if (answer == 'N')
1283 {
1284 retval = 0;
1285 break;
1286 }
1287 printf_filtered ("Please answer y or n.\n");
1288 }
1289
1290 if (annotation_level > 1)
1291 printf_filtered ("\n\032\032post-query\n");
1292 return retval;
1293 }
1294 \f
1295
1296 /* Parse a C escape sequence. STRING_PTR points to a variable
1297 containing a pointer to the string to parse. That pointer
1298 should point to the character after the \. That pointer
1299 is updated past the characters we use. The value of the
1300 escape sequence is returned.
1301
1302 A negative value means the sequence \ newline was seen,
1303 which is supposed to be equivalent to nothing at all.
1304
1305 If \ is followed by a null character, we return a negative
1306 value and leave the string pointer pointing at the null character.
1307
1308 If \ is followed by 000, we return 0 and leave the string pointer
1309 after the zeros. A value of 0 does not mean end of string. */
1310
1311 int
1312 parse_escape (char **string_ptr)
1313 {
1314 register int c = *(*string_ptr)++;
1315 switch (c)
1316 {
1317 case 'a':
1318 return 007; /* Bell (alert) char */
1319 case 'b':
1320 return '\b';
1321 case 'e': /* Escape character */
1322 return 033;
1323 case 'f':
1324 return '\f';
1325 case 'n':
1326 return '\n';
1327 case 'r':
1328 return '\r';
1329 case 't':
1330 return '\t';
1331 case 'v':
1332 return '\v';
1333 case '\n':
1334 return -2;
1335 case 0:
1336 (*string_ptr)--;
1337 return 0;
1338 case '^':
1339 c = *(*string_ptr)++;
1340 if (c == '\\')
1341 c = parse_escape (string_ptr);
1342 if (c == '?')
1343 return 0177;
1344 return (c & 0200) | (c & 037);
1345
1346 case '0':
1347 case '1':
1348 case '2':
1349 case '3':
1350 case '4':
1351 case '5':
1352 case '6':
1353 case '7':
1354 {
1355 register int i = c - '0';
1356 register int count = 0;
1357 while (++count < 3)
1358 {
1359 if ((c = *(*string_ptr)++) >= '0' && c <= '7')
1360 {
1361 i *= 8;
1362 i += c - '0';
1363 }
1364 else
1365 {
1366 (*string_ptr)--;
1367 break;
1368 }
1369 }
1370 return i;
1371 }
1372 default:
1373 return c;
1374 }
1375 }
1376 \f
1377 /* Print the character C on STREAM as part of the contents of a literal
1378 string whose delimiter is QUOTER. Note that this routine should only
1379 be call for printing things which are independent of the language
1380 of the program being debugged. */
1381
1382 static void
1383 printchar (int c, void (*do_fputs) (const char *, struct ui_file *),
1384 void (*do_fprintf) (struct ui_file *, const char *, ...),
1385 struct ui_file *stream, int quoter)
1386 {
1387
1388 c &= 0xFF; /* Avoid sign bit follies */
1389
1390 if (c < 0x20 || /* Low control chars */
1391 (c >= 0x7F && c < 0xA0) || /* DEL, High controls */
1392 (sevenbit_strings && c >= 0x80))
1393 { /* high order bit set */
1394 switch (c)
1395 {
1396 case '\n':
1397 do_fputs ("\\n", stream);
1398 break;
1399 case '\b':
1400 do_fputs ("\\b", stream);
1401 break;
1402 case '\t':
1403 do_fputs ("\\t", stream);
1404 break;
1405 case '\f':
1406 do_fputs ("\\f", stream);
1407 break;
1408 case '\r':
1409 do_fputs ("\\r", stream);
1410 break;
1411 case '\033':
1412 do_fputs ("\\e", stream);
1413 break;
1414 case '\007':
1415 do_fputs ("\\a", stream);
1416 break;
1417 default:
1418 do_fprintf (stream, "\\%.3o", (unsigned int) c);
1419 break;
1420 }
1421 }
1422 else
1423 {
1424 if (c == '\\' || c == quoter)
1425 do_fputs ("\\", stream);
1426 do_fprintf (stream, "%c", c);
1427 }
1428 }
1429
1430 /* Print the character C on STREAM as part of the contents of a
1431 literal string whose delimiter is QUOTER. Note that these routines
1432 should only be call for printing things which are independent of
1433 the language of the program being debugged. */
1434
1435 void
1436 fputstr_filtered (const char *str, int quoter, struct ui_file *stream)
1437 {
1438 while (*str)
1439 printchar (*str++, fputs_filtered, fprintf_filtered, stream, quoter);
1440 }
1441
1442 void
1443 fputstr_unfiltered (const char *str, int quoter, struct ui_file *stream)
1444 {
1445 while (*str)
1446 printchar (*str++, fputs_unfiltered, fprintf_unfiltered, stream, quoter);
1447 }
1448
1449 void
1450 fputstrn_unfiltered (const char *str, int n, int quoter, struct ui_file *stream)
1451 {
1452 int i;
1453 for (i = 0; i < n; i++)
1454 printchar (str[i], fputs_unfiltered, fprintf_unfiltered, stream, quoter);
1455 }
1456
1457 \f
1458
1459 /* Number of lines per page or UINT_MAX if paging is disabled. */
1460 static unsigned int lines_per_page;
1461 /* Number of chars per line or UINT_MAX if line folding is disabled. */
1462 static unsigned int chars_per_line;
1463 /* Current count of lines printed on this page, chars on this line. */
1464 static unsigned int lines_printed, chars_printed;
1465
1466 /* Buffer and start column of buffered text, for doing smarter word-
1467 wrapping. When someone calls wrap_here(), we start buffering output
1468 that comes through fputs_filtered(). If we see a newline, we just
1469 spit it out and forget about the wrap_here(). If we see another
1470 wrap_here(), we spit it out and remember the newer one. If we see
1471 the end of the line, we spit out a newline, the indent, and then
1472 the buffered output. */
1473
1474 /* Malloc'd buffer with chars_per_line+2 bytes. Contains characters which
1475 are waiting to be output (they have already been counted in chars_printed).
1476 When wrap_buffer[0] is null, the buffer is empty. */
1477 static char *wrap_buffer;
1478
1479 /* Pointer in wrap_buffer to the next character to fill. */
1480 static char *wrap_pointer;
1481
1482 /* String to indent by if the wrap occurs. Must not be NULL if wrap_column
1483 is non-zero. */
1484 static char *wrap_indent;
1485
1486 /* Column number on the screen where wrap_buffer begins, or 0 if wrapping
1487 is not in effect. */
1488 static int wrap_column;
1489 \f
1490
1491 /* Inialize the lines and chars per page */
1492 void
1493 init_page_info (void)
1494 {
1495 #if defined(TUI)
1496 if (tui_version && m_winPtrNotNull (cmdWin))
1497 {
1498 lines_per_page = cmdWin->generic.height;
1499 chars_per_line = cmdWin->generic.width;
1500 }
1501 else
1502 #endif
1503 {
1504 /* These defaults will be used if we are unable to get the correct
1505 values from termcap. */
1506 #if defined(__GO32__)
1507 lines_per_page = ScreenRows ();
1508 chars_per_line = ScreenCols ();
1509 #else
1510 lines_per_page = 24;
1511 chars_per_line = 80;
1512
1513 #if !defined (MPW) && !defined (_WIN32)
1514 /* No termcap under MPW, although might be cool to do something
1515 by looking at worksheet or console window sizes. */
1516 /* Initialize the screen height and width from termcap. */
1517 {
1518 char *termtype = getenv ("TERM");
1519
1520 /* Positive means success, nonpositive means failure. */
1521 int status;
1522
1523 /* 2048 is large enough for all known terminals, according to the
1524 GNU termcap manual. */
1525 char term_buffer[2048];
1526
1527 if (termtype)
1528 {
1529 status = tgetent (term_buffer, termtype);
1530 if (status > 0)
1531 {
1532 int val;
1533 int running_in_emacs = getenv ("EMACS") != NULL;
1534
1535 val = tgetnum ("li");
1536 if (val >= 0 && !running_in_emacs)
1537 lines_per_page = val;
1538 else
1539 /* The number of lines per page is not mentioned
1540 in the terminal description. This probably means
1541 that paging is not useful (e.g. emacs shell window),
1542 so disable paging. */
1543 lines_per_page = UINT_MAX;
1544
1545 val = tgetnum ("co");
1546 if (val >= 0)
1547 chars_per_line = val;
1548 }
1549 }
1550 }
1551 #endif /* MPW */
1552
1553 #if defined(SIGWINCH) && defined(SIGWINCH_HANDLER)
1554
1555 /* If there is a better way to determine the window size, use it. */
1556 SIGWINCH_HANDLER (SIGWINCH);
1557 #endif
1558 #endif
1559 /* If the output is not a terminal, don't paginate it. */
1560 if (!ui_file_isatty (gdb_stdout))
1561 lines_per_page = UINT_MAX;
1562 } /* the command_line_version */
1563 set_width ();
1564 }
1565
1566 static void
1567 set_width (void)
1568 {
1569 if (chars_per_line == 0)
1570 init_page_info ();
1571
1572 if (!wrap_buffer)
1573 {
1574 wrap_buffer = (char *) xmalloc (chars_per_line + 2);
1575 wrap_buffer[0] = '\0';
1576 }
1577 else
1578 wrap_buffer = (char *) xrealloc (wrap_buffer, chars_per_line + 2);
1579 wrap_pointer = wrap_buffer; /* Start it at the beginning */
1580 }
1581
1582 /* ARGSUSED */
1583 static void
1584 set_width_command (char *args, int from_tty, struct cmd_list_element *c)
1585 {
1586 set_width ();
1587 }
1588
1589 /* Wait, so the user can read what's on the screen. Prompt the user
1590 to continue by pressing RETURN. */
1591
1592 static void
1593 prompt_for_continue (void)
1594 {
1595 char *ignore;
1596 char cont_prompt[120];
1597
1598 if (annotation_level > 1)
1599 printf_unfiltered ("\n\032\032pre-prompt-for-continue\n");
1600
1601 strcpy (cont_prompt,
1602 "---Type <return> to continue, or q <return> to quit---");
1603 if (annotation_level > 1)
1604 strcat (cont_prompt, "\n\032\032prompt-for-continue\n");
1605
1606 /* We must do this *before* we call gdb_readline, else it will eventually
1607 call us -- thinking that we're trying to print beyond the end of the
1608 screen. */
1609 reinitialize_more_filter ();
1610
1611 immediate_quit++;
1612 /* On a real operating system, the user can quit with SIGINT.
1613 But not on GO32.
1614
1615 'q' is provided on all systems so users don't have to change habits
1616 from system to system, and because telling them what to do in
1617 the prompt is more user-friendly than expecting them to think of
1618 SIGINT. */
1619 /* Call readline, not gdb_readline, because GO32 readline handles control-C
1620 whereas control-C to gdb_readline will cause the user to get dumped
1621 out to DOS. */
1622 ignore = readline (cont_prompt);
1623
1624 if (annotation_level > 1)
1625 printf_unfiltered ("\n\032\032post-prompt-for-continue\n");
1626
1627 if (ignore)
1628 {
1629 char *p = ignore;
1630 while (*p == ' ' || *p == '\t')
1631 ++p;
1632 if (p[0] == 'q')
1633 {
1634 if (!event_loop_p)
1635 request_quit (SIGINT);
1636 else
1637 async_request_quit (0);
1638 }
1639 free (ignore);
1640 }
1641 immediate_quit--;
1642
1643 /* Now we have to do this again, so that GDB will know that it doesn't
1644 need to save the ---Type <return>--- line at the top of the screen. */
1645 reinitialize_more_filter ();
1646
1647 dont_repeat (); /* Forget prev cmd -- CR won't repeat it. */
1648 }
1649
1650 /* Reinitialize filter; ie. tell it to reset to original values. */
1651
1652 void
1653 reinitialize_more_filter (void)
1654 {
1655 lines_printed = 0;
1656 chars_printed = 0;
1657 }
1658
1659 /* Indicate that if the next sequence of characters overflows the line,
1660 a newline should be inserted here rather than when it hits the end.
1661 If INDENT is non-null, it is a string to be printed to indent the
1662 wrapped part on the next line. INDENT must remain accessible until
1663 the next call to wrap_here() or until a newline is printed through
1664 fputs_filtered().
1665
1666 If the line is already overfull, we immediately print a newline and
1667 the indentation, and disable further wrapping.
1668
1669 If we don't know the width of lines, but we know the page height,
1670 we must not wrap words, but should still keep track of newlines
1671 that were explicitly printed.
1672
1673 INDENT should not contain tabs, as that will mess up the char count
1674 on the next line. FIXME.
1675
1676 This routine is guaranteed to force out any output which has been
1677 squirreled away in the wrap_buffer, so wrap_here ((char *)0) can be
1678 used to force out output from the wrap_buffer. */
1679
1680 void
1681 wrap_here (char *indent)
1682 {
1683 /* This should have been allocated, but be paranoid anyway. */
1684 if (!wrap_buffer)
1685 abort ();
1686
1687 if (wrap_buffer[0])
1688 {
1689 *wrap_pointer = '\0';
1690 fputs_unfiltered (wrap_buffer, gdb_stdout);
1691 }
1692 wrap_pointer = wrap_buffer;
1693 wrap_buffer[0] = '\0';
1694 if (chars_per_line == UINT_MAX) /* No line overflow checking */
1695 {
1696 wrap_column = 0;
1697 }
1698 else if (chars_printed >= chars_per_line)
1699 {
1700 puts_filtered ("\n");
1701 if (indent != NULL)
1702 puts_filtered (indent);
1703 wrap_column = 0;
1704 }
1705 else
1706 {
1707 wrap_column = chars_printed;
1708 if (indent == NULL)
1709 wrap_indent = "";
1710 else
1711 wrap_indent = indent;
1712 }
1713 }
1714
1715 /* Ensure that whatever gets printed next, using the filtered output
1716 commands, starts at the beginning of the line. I.E. if there is
1717 any pending output for the current line, flush it and start a new
1718 line. Otherwise do nothing. */
1719
1720 void
1721 begin_line (void)
1722 {
1723 if (chars_printed > 0)
1724 {
1725 puts_filtered ("\n");
1726 }
1727 }
1728
1729
1730 /* Like fputs but if FILTER is true, pause after every screenful.
1731
1732 Regardless of FILTER can wrap at points other than the final
1733 character of a line.
1734
1735 Unlike fputs, fputs_maybe_filtered does not return a value.
1736 It is OK for LINEBUFFER to be NULL, in which case just don't print
1737 anything.
1738
1739 Note that a longjmp to top level may occur in this routine (only if
1740 FILTER is true) (since prompt_for_continue may do so) so this
1741 routine should not be called when cleanups are not in place. */
1742
1743 static void
1744 fputs_maybe_filtered (const char *linebuffer, struct ui_file *stream,
1745 int filter)
1746 {
1747 const char *lineptr;
1748
1749 if (linebuffer == 0)
1750 return;
1751
1752 /* Don't do any filtering if it is disabled. */
1753 if ((stream != gdb_stdout) || !pagination_enabled
1754 || (lines_per_page == UINT_MAX && chars_per_line == UINT_MAX))
1755 {
1756 fputs_unfiltered (linebuffer, stream);
1757 return;
1758 }
1759
1760 /* Go through and output each character. Show line extension
1761 when this is necessary; prompt user for new page when this is
1762 necessary. */
1763
1764 lineptr = linebuffer;
1765 while (*lineptr)
1766 {
1767 /* Possible new page. */
1768 if (filter &&
1769 (lines_printed >= lines_per_page - 1))
1770 prompt_for_continue ();
1771
1772 while (*lineptr && *lineptr != '\n')
1773 {
1774 /* Print a single line. */
1775 if (*lineptr == '\t')
1776 {
1777 if (wrap_column)
1778 *wrap_pointer++ = '\t';
1779 else
1780 fputc_unfiltered ('\t', stream);
1781 /* Shifting right by 3 produces the number of tab stops
1782 we have already passed, and then adding one and
1783 shifting left 3 advances to the next tab stop. */
1784 chars_printed = ((chars_printed >> 3) + 1) << 3;
1785 lineptr++;
1786 }
1787 else
1788 {
1789 if (wrap_column)
1790 *wrap_pointer++ = *lineptr;
1791 else
1792 fputc_unfiltered (*lineptr, stream);
1793 chars_printed++;
1794 lineptr++;
1795 }
1796
1797 if (chars_printed >= chars_per_line)
1798 {
1799 unsigned int save_chars = chars_printed;
1800
1801 chars_printed = 0;
1802 lines_printed++;
1803 /* If we aren't actually wrapping, don't output newline --
1804 if chars_per_line is right, we probably just overflowed
1805 anyway; if it's wrong, let us keep going. */
1806 if (wrap_column)
1807 fputc_unfiltered ('\n', stream);
1808
1809 /* Possible new page. */
1810 if (lines_printed >= lines_per_page - 1)
1811 prompt_for_continue ();
1812
1813 /* Now output indentation and wrapped string */
1814 if (wrap_column)
1815 {
1816 fputs_unfiltered (wrap_indent, stream);
1817 *wrap_pointer = '\0'; /* Null-terminate saved stuff */
1818 fputs_unfiltered (wrap_buffer, stream); /* and eject it */
1819 /* FIXME, this strlen is what prevents wrap_indent from
1820 containing tabs. However, if we recurse to print it
1821 and count its chars, we risk trouble if wrap_indent is
1822 longer than (the user settable) chars_per_line.
1823 Note also that this can set chars_printed > chars_per_line
1824 if we are printing a long string. */
1825 chars_printed = strlen (wrap_indent)
1826 + (save_chars - wrap_column);
1827 wrap_pointer = wrap_buffer; /* Reset buffer */
1828 wrap_buffer[0] = '\0';
1829 wrap_column = 0; /* And disable fancy wrap */
1830 }
1831 }
1832 }
1833
1834 if (*lineptr == '\n')
1835 {
1836 chars_printed = 0;
1837 wrap_here ((char *) 0); /* Spit out chars, cancel further wraps */
1838 lines_printed++;
1839 fputc_unfiltered ('\n', stream);
1840 lineptr++;
1841 }
1842 }
1843 }
1844
1845 void
1846 fputs_filtered (const char *linebuffer, struct ui_file *stream)
1847 {
1848 fputs_maybe_filtered (linebuffer, stream, 1);
1849 }
1850
1851 int
1852 putchar_unfiltered (int c)
1853 {
1854 char buf = c;
1855 ui_file_write (gdb_stdout, &buf, 1);
1856 return c;
1857 }
1858
1859 int
1860 fputc_unfiltered (int c, struct ui_file *stream)
1861 {
1862 char buf = c;
1863 ui_file_write (stream, &buf, 1);
1864 return c;
1865 }
1866
1867 int
1868 fputc_filtered (int c, struct ui_file *stream)
1869 {
1870 char buf[2];
1871
1872 buf[0] = c;
1873 buf[1] = 0;
1874 fputs_filtered (buf, stream);
1875 return c;
1876 }
1877
1878 /* puts_debug is like fputs_unfiltered, except it prints special
1879 characters in printable fashion. */
1880
1881 void
1882 puts_debug (char *prefix, char *string, char *suffix)
1883 {
1884 int ch;
1885
1886 /* Print prefix and suffix after each line. */
1887 static int new_line = 1;
1888 static int return_p = 0;
1889 static char *prev_prefix = "";
1890 static char *prev_suffix = "";
1891
1892 if (*string == '\n')
1893 return_p = 0;
1894
1895 /* If the prefix is changing, print the previous suffix, a new line,
1896 and the new prefix. */
1897 if ((return_p || (strcmp (prev_prefix, prefix) != 0)) && !new_line)
1898 {
1899 fputs_unfiltered (prev_suffix, gdb_stdlog);
1900 fputs_unfiltered ("\n", gdb_stdlog);
1901 fputs_unfiltered (prefix, gdb_stdlog);
1902 }
1903
1904 /* Print prefix if we printed a newline during the previous call. */
1905 if (new_line)
1906 {
1907 new_line = 0;
1908 fputs_unfiltered (prefix, gdb_stdlog);
1909 }
1910
1911 prev_prefix = prefix;
1912 prev_suffix = suffix;
1913
1914 /* Output characters in a printable format. */
1915 while ((ch = *string++) != '\0')
1916 {
1917 switch (ch)
1918 {
1919 default:
1920 if (isprint (ch))
1921 fputc_unfiltered (ch, gdb_stdlog);
1922
1923 else
1924 fprintf_unfiltered (gdb_stdlog, "\\x%02x", ch & 0xff);
1925 break;
1926
1927 case '\\':
1928 fputs_unfiltered ("\\\\", gdb_stdlog);
1929 break;
1930 case '\b':
1931 fputs_unfiltered ("\\b", gdb_stdlog);
1932 break;
1933 case '\f':
1934 fputs_unfiltered ("\\f", gdb_stdlog);
1935 break;
1936 case '\n':
1937 new_line = 1;
1938 fputs_unfiltered ("\\n", gdb_stdlog);
1939 break;
1940 case '\r':
1941 fputs_unfiltered ("\\r", gdb_stdlog);
1942 break;
1943 case '\t':
1944 fputs_unfiltered ("\\t", gdb_stdlog);
1945 break;
1946 case '\v':
1947 fputs_unfiltered ("\\v", gdb_stdlog);
1948 break;
1949 }
1950
1951 return_p = ch == '\r';
1952 }
1953
1954 /* Print suffix if we printed a newline. */
1955 if (new_line)
1956 {
1957 fputs_unfiltered (suffix, gdb_stdlog);
1958 fputs_unfiltered ("\n", gdb_stdlog);
1959 }
1960 }
1961
1962
1963 /* Print a variable number of ARGS using format FORMAT. If this
1964 information is going to put the amount written (since the last call
1965 to REINITIALIZE_MORE_FILTER or the last page break) over the page size,
1966 call prompt_for_continue to get the users permision to continue.
1967
1968 Unlike fprintf, this function does not return a value.
1969
1970 We implement three variants, vfprintf (takes a vararg list and stream),
1971 fprintf (takes a stream to write on), and printf (the usual).
1972
1973 Note also that a longjmp to top level may occur in this routine
1974 (since prompt_for_continue may do so) so this routine should not be
1975 called when cleanups are not in place. */
1976
1977 static void
1978 vfprintf_maybe_filtered (struct ui_file *stream, const char *format,
1979 va_list args, int filter)
1980 {
1981 char *linebuffer;
1982 struct cleanup *old_cleanups;
1983
1984 xvasprintf (&linebuffer, format, args);
1985 old_cleanups = make_cleanup (free, linebuffer);
1986 fputs_maybe_filtered (linebuffer, stream, filter);
1987 do_cleanups (old_cleanups);
1988 }
1989
1990
1991 void
1992 vfprintf_filtered (struct ui_file *stream, const char *format, va_list args)
1993 {
1994 vfprintf_maybe_filtered (stream, format, args, 1);
1995 }
1996
1997 void
1998 vfprintf_unfiltered (struct ui_file *stream, const char *format, va_list args)
1999 {
2000 char *linebuffer;
2001 struct cleanup *old_cleanups;
2002
2003 xvasprintf (&linebuffer, format, args);
2004 old_cleanups = make_cleanup (free, linebuffer);
2005 fputs_unfiltered (linebuffer, stream);
2006 do_cleanups (old_cleanups);
2007 }
2008
2009 void
2010 vprintf_filtered (const char *format, va_list args)
2011 {
2012 vfprintf_maybe_filtered (gdb_stdout, format, args, 1);
2013 }
2014
2015 void
2016 vprintf_unfiltered (const char *format, va_list args)
2017 {
2018 vfprintf_unfiltered (gdb_stdout, format, args);
2019 }
2020
2021 void
2022 fprintf_filtered (struct ui_file * stream, const char *format,...)
2023 {
2024 va_list args;
2025 va_start (args, format);
2026 vfprintf_filtered (stream, format, args);
2027 va_end (args);
2028 }
2029
2030 void
2031 fprintf_unfiltered (struct ui_file * stream, const char *format,...)
2032 {
2033 va_list args;
2034 va_start (args, format);
2035 vfprintf_unfiltered (stream, format, args);
2036 va_end (args);
2037 }
2038
2039 /* Like fprintf_filtered, but prints its result indented.
2040 Called as fprintfi_filtered (spaces, stream, format, ...); */
2041
2042 void
2043 fprintfi_filtered (int spaces, struct ui_file * stream, const char *format,...)
2044 {
2045 va_list args;
2046 va_start (args, format);
2047 print_spaces_filtered (spaces, stream);
2048
2049 vfprintf_filtered (stream, format, args);
2050 va_end (args);
2051 }
2052
2053
2054 void
2055 printf_filtered (const char *format,...)
2056 {
2057 va_list args;
2058 va_start (args, format);
2059 vfprintf_filtered (gdb_stdout, format, args);
2060 va_end (args);
2061 }
2062
2063
2064 void
2065 printf_unfiltered (const char *format,...)
2066 {
2067 va_list args;
2068 va_start (args, format);
2069 vfprintf_unfiltered (gdb_stdout, format, args);
2070 va_end (args);
2071 }
2072
2073 /* Like printf_filtered, but prints it's result indented.
2074 Called as printfi_filtered (spaces, format, ...); */
2075
2076 void
2077 printfi_filtered (int spaces, const char *format,...)
2078 {
2079 va_list args;
2080 va_start (args, format);
2081 print_spaces_filtered (spaces, gdb_stdout);
2082 vfprintf_filtered (gdb_stdout, format, args);
2083 va_end (args);
2084 }
2085
2086 /* Easy -- but watch out!
2087
2088 This routine is *not* a replacement for puts()! puts() appends a newline.
2089 This one doesn't, and had better not! */
2090
2091 void
2092 puts_filtered (const char *string)
2093 {
2094 fputs_filtered (string, gdb_stdout);
2095 }
2096
2097 void
2098 puts_unfiltered (const char *string)
2099 {
2100 fputs_unfiltered (string, gdb_stdout);
2101 }
2102
2103 /* Return a pointer to N spaces and a null. The pointer is good
2104 until the next call to here. */
2105 char *
2106 n_spaces (int n)
2107 {
2108 char *t;
2109 static char *spaces = 0;
2110 static int max_spaces = -1;
2111
2112 if (n > max_spaces)
2113 {
2114 if (spaces)
2115 free (spaces);
2116 spaces = (char *) xmalloc (n + 1);
2117 for (t = spaces + n; t != spaces;)
2118 *--t = ' ';
2119 spaces[n] = '\0';
2120 max_spaces = n;
2121 }
2122
2123 return spaces + max_spaces - n;
2124 }
2125
2126 /* Print N spaces. */
2127 void
2128 print_spaces_filtered (int n, struct ui_file *stream)
2129 {
2130 fputs_filtered (n_spaces (n), stream);
2131 }
2132 \f
2133 /* C++ demangler stuff. */
2134
2135 /* fprintf_symbol_filtered attempts to demangle NAME, a symbol in language
2136 LANG, using demangling args ARG_MODE, and print it filtered to STREAM.
2137 If the name is not mangled, or the language for the name is unknown, or
2138 demangling is off, the name is printed in its "raw" form. */
2139
2140 void
2141 fprintf_symbol_filtered (struct ui_file *stream, char *name, enum language lang,
2142 int arg_mode)
2143 {
2144 char *demangled;
2145
2146 if (name != NULL)
2147 {
2148 /* If user wants to see raw output, no problem. */
2149 if (!demangle)
2150 {
2151 fputs_filtered (name, stream);
2152 }
2153 else
2154 {
2155 switch (lang)
2156 {
2157 case language_cplus:
2158 demangled = cplus_demangle (name, arg_mode);
2159 break;
2160 case language_java:
2161 demangled = cplus_demangle (name, arg_mode | DMGL_JAVA);
2162 break;
2163 case language_chill:
2164 demangled = chill_demangle (name);
2165 break;
2166 default:
2167 demangled = NULL;
2168 break;
2169 }
2170 fputs_filtered (demangled ? demangled : name, stream);
2171 if (demangled != NULL)
2172 {
2173 free (demangled);
2174 }
2175 }
2176 }
2177 }
2178
2179 /* Do a strcmp() type operation on STRING1 and STRING2, ignoring any
2180 differences in whitespace. Returns 0 if they match, non-zero if they
2181 don't (slightly different than strcmp()'s range of return values).
2182
2183 As an extra hack, string1=="FOO(ARGS)" matches string2=="FOO".
2184 This "feature" is useful when searching for matching C++ function names
2185 (such as if the user types 'break FOO', where FOO is a mangled C++
2186 function). */
2187
2188 int
2189 strcmp_iw (const char *string1, const char *string2)
2190 {
2191 while ((*string1 != '\0') && (*string2 != '\0'))
2192 {
2193 while (isspace (*string1))
2194 {
2195 string1++;
2196 }
2197 while (isspace (*string2))
2198 {
2199 string2++;
2200 }
2201 if (*string1 != *string2)
2202 {
2203 break;
2204 }
2205 if (*string1 != '\0')
2206 {
2207 string1++;
2208 string2++;
2209 }
2210 }
2211 return (*string1 != '\0' && *string1 != '(') || (*string2 != '\0');
2212 }
2213 \f
2214
2215 /*
2216 ** subset_compare()
2217 ** Answer whether string_to_compare is a full or partial match to
2218 ** template_string. The partial match must be in sequence starting
2219 ** at index 0.
2220 */
2221 int
2222 subset_compare (char *string_to_compare, char *template_string)
2223 {
2224 int match;
2225 if (template_string != (char *) NULL && string_to_compare != (char *) NULL &&
2226 strlen (string_to_compare) <= strlen (template_string))
2227 match = (strncmp (template_string,
2228 string_to_compare,
2229 strlen (string_to_compare)) == 0);
2230 else
2231 match = 0;
2232 return match;
2233 }
2234
2235
2236 static void pagination_on_command (char *arg, int from_tty);
2237 static void
2238 pagination_on_command (char *arg, int from_tty)
2239 {
2240 pagination_enabled = 1;
2241 }
2242
2243 static void pagination_on_command (char *arg, int from_tty);
2244 static void
2245 pagination_off_command (char *arg, int from_tty)
2246 {
2247 pagination_enabled = 0;
2248 }
2249 \f
2250
2251 void
2252 initialize_utils (void)
2253 {
2254 struct cmd_list_element *c;
2255
2256 c = add_set_cmd ("width", class_support, var_uinteger,
2257 (char *) &chars_per_line,
2258 "Set number of characters gdb thinks are in a line.",
2259 &setlist);
2260 add_show_from_set (c, &showlist);
2261 c->function.sfunc = set_width_command;
2262
2263 add_show_from_set
2264 (add_set_cmd ("height", class_support,
2265 var_uinteger, (char *) &lines_per_page,
2266 "Set number of lines gdb thinks are in a page.", &setlist),
2267 &showlist);
2268
2269 init_page_info ();
2270
2271 /* If the output is not a terminal, don't paginate it. */
2272 if (!ui_file_isatty (gdb_stdout))
2273 lines_per_page = UINT_MAX;
2274
2275 set_width_command ((char *) NULL, 0, c);
2276
2277 add_show_from_set
2278 (add_set_cmd ("demangle", class_support, var_boolean,
2279 (char *) &demangle,
2280 "Set demangling of encoded C++ names when displaying symbols.",
2281 &setprintlist),
2282 &showprintlist);
2283
2284 add_show_from_set
2285 (add_set_cmd ("pagination", class_support,
2286 var_boolean, (char *) &pagination_enabled,
2287 "Set state of pagination.", &setlist),
2288 &showlist);
2289
2290 if (xdb_commands)
2291 {
2292 add_com ("am", class_support, pagination_on_command,
2293 "Enable pagination");
2294 add_com ("sm", class_support, pagination_off_command,
2295 "Disable pagination");
2296 }
2297
2298 add_show_from_set
2299 (add_set_cmd ("sevenbit-strings", class_support, var_boolean,
2300 (char *) &sevenbit_strings,
2301 "Set printing of 8-bit characters in strings as \\nnn.",
2302 &setprintlist),
2303 &showprintlist);
2304
2305 add_show_from_set
2306 (add_set_cmd ("asm-demangle", class_support, var_boolean,
2307 (char *) &asm_demangle,
2308 "Set demangling of C++ names in disassembly listings.",
2309 &setprintlist),
2310 &showprintlist);
2311 }
2312
2313 /* Machine specific function to handle SIGWINCH signal. */
2314
2315 #ifdef SIGWINCH_HANDLER_BODY
2316 SIGWINCH_HANDLER_BODY
2317 #endif
2318 \f
2319 /* Support for converting target fp numbers into host DOUBLEST format. */
2320
2321 /* XXX - This code should really be in libiberty/floatformat.c, however
2322 configuration issues with libiberty made this very difficult to do in the
2323 available time. */
2324
2325 #include "floatformat.h"
2326 #include <math.h> /* ldexp */
2327
2328 /* The odds that CHAR_BIT will be anything but 8 are low enough that I'm not
2329 going to bother with trying to muck around with whether it is defined in
2330 a system header, what we do if not, etc. */
2331 #define FLOATFORMAT_CHAR_BIT 8
2332
2333 static unsigned long get_field (unsigned char *,
2334 enum floatformat_byteorders,
2335 unsigned int, unsigned int, unsigned int);
2336
2337 /* Extract a field which starts at START and is LEN bytes long. DATA and
2338 TOTAL_LEN are the thing we are extracting it from, in byteorder ORDER. */
2339 static unsigned long
2340 get_field (unsigned char *data, enum floatformat_byteorders order,
2341 unsigned int total_len, unsigned int start, unsigned int len)
2342 {
2343 unsigned long result;
2344 unsigned int cur_byte;
2345 int cur_bitshift;
2346
2347 /* Start at the least significant part of the field. */
2348 if (order == floatformat_little || order == floatformat_littlebyte_bigword)
2349 {
2350 /* We start counting from the other end (i.e, from the high bytes
2351 rather than the low bytes). As such, we need to be concerned
2352 with what happens if bit 0 doesn't start on a byte boundary.
2353 I.e, we need to properly handle the case where total_len is
2354 not evenly divisible by 8. So we compute ``excess'' which
2355 represents the number of bits from the end of our starting
2356 byte needed to get to bit 0. */
2357 int excess = FLOATFORMAT_CHAR_BIT - (total_len % FLOATFORMAT_CHAR_BIT);
2358 cur_byte = (total_len / FLOATFORMAT_CHAR_BIT)
2359 - ((start + len + excess) / FLOATFORMAT_CHAR_BIT);
2360 cur_bitshift = ((start + len + excess) % FLOATFORMAT_CHAR_BIT)
2361 - FLOATFORMAT_CHAR_BIT;
2362 }
2363 else
2364 {
2365 cur_byte = (start + len) / FLOATFORMAT_CHAR_BIT;
2366 cur_bitshift =
2367 ((start + len) % FLOATFORMAT_CHAR_BIT) - FLOATFORMAT_CHAR_BIT;
2368 }
2369 if (cur_bitshift > -FLOATFORMAT_CHAR_BIT)
2370 result = *(data + cur_byte) >> (-cur_bitshift);
2371 else
2372 result = 0;
2373 cur_bitshift += FLOATFORMAT_CHAR_BIT;
2374 if (order == floatformat_little || order == floatformat_littlebyte_bigword)
2375 ++cur_byte;
2376 else
2377 --cur_byte;
2378
2379 /* Move towards the most significant part of the field. */
2380 while (cur_bitshift < len)
2381 {
2382 result |= (unsigned long)*(data + cur_byte) << cur_bitshift;
2383 cur_bitshift += FLOATFORMAT_CHAR_BIT;
2384 if (order == floatformat_little || order == floatformat_littlebyte_bigword)
2385 ++cur_byte;
2386 else
2387 --cur_byte;
2388 }
2389 if (len < sizeof(result) * FLOATFORMAT_CHAR_BIT)
2390 /* Mask out bits which are not part of the field */
2391 result &= ((1UL << len) - 1);
2392 return result;
2393 }
2394
2395 /* Convert from FMT to a DOUBLEST.
2396 FROM is the address of the extended float.
2397 Store the DOUBLEST in *TO. */
2398
2399 void
2400 floatformat_to_doublest (const struct floatformat *fmt, char *from,
2401 DOUBLEST *to)
2402 {
2403 unsigned char *ufrom = (unsigned char *) from;
2404 DOUBLEST dto;
2405 long exponent;
2406 unsigned long mant;
2407 unsigned int mant_bits, mant_off;
2408 int mant_bits_left;
2409 int special_exponent; /* It's a NaN, denorm or zero */
2410
2411 /* If the mantissa bits are not contiguous from one end of the
2412 mantissa to the other, we need to make a private copy of the
2413 source bytes that is in the right order since the unpacking
2414 algorithm assumes that the bits are contiguous.
2415
2416 Swap the bytes individually rather than accessing them through
2417 "long *" since we have no guarantee that they start on a long
2418 alignment, and also sizeof(long) for the host could be different
2419 than sizeof(long) for the target. FIXME: Assumes sizeof(long)
2420 for the target is 4. */
2421
2422 if (fmt->byteorder == floatformat_littlebyte_bigword)
2423 {
2424 static unsigned char *newfrom;
2425 unsigned char *swapin, *swapout;
2426 int longswaps;
2427
2428 longswaps = fmt->totalsize / FLOATFORMAT_CHAR_BIT;
2429 longswaps >>= 3;
2430
2431 if (newfrom == NULL)
2432 {
2433 newfrom = (unsigned char *) xmalloc (fmt->totalsize);
2434 }
2435 swapout = newfrom;
2436 swapin = ufrom;
2437 ufrom = newfrom;
2438 while (longswaps-- > 0)
2439 {
2440 /* This is ugly, but efficient */
2441 *swapout++ = swapin[4];
2442 *swapout++ = swapin[5];
2443 *swapout++ = swapin[6];
2444 *swapout++ = swapin[7];
2445 *swapout++ = swapin[0];
2446 *swapout++ = swapin[1];
2447 *swapout++ = swapin[2];
2448 *swapout++ = swapin[3];
2449 swapin += 8;
2450 }
2451 }
2452
2453 exponent = get_field (ufrom, fmt->byteorder, fmt->totalsize,
2454 fmt->exp_start, fmt->exp_len);
2455 /* Note that if exponent indicates a NaN, we can't really do anything useful
2456 (not knowing if the host has NaN's, or how to build one). So it will
2457 end up as an infinity or something close; that is OK. */
2458
2459 mant_bits_left = fmt->man_len;
2460 mant_off = fmt->man_start;
2461 dto = 0.0;
2462
2463 special_exponent = exponent == 0 || exponent == fmt->exp_nan;
2464
2465 /* Don't bias NaNs. Use minimum exponent for denorms. For simplicity,
2466 we don't check for zero as the exponent doesn't matter. */
2467 if (!special_exponent)
2468 exponent -= fmt->exp_bias;
2469 else if (exponent == 0)
2470 exponent = 1 - fmt->exp_bias;
2471
2472 /* Build the result algebraically. Might go infinite, underflow, etc;
2473 who cares. */
2474
2475 /* If this format uses a hidden bit, explicitly add it in now. Otherwise,
2476 increment the exponent by one to account for the integer bit. */
2477
2478 if (!special_exponent)
2479 {
2480 if (fmt->intbit == floatformat_intbit_no)
2481 dto = ldexp (1.0, exponent);
2482 else
2483 exponent++;
2484 }
2485
2486 while (mant_bits_left > 0)
2487 {
2488 mant_bits = min (mant_bits_left, 32);
2489
2490 mant = get_field (ufrom, fmt->byteorder, fmt->totalsize,
2491 mant_off, mant_bits);
2492
2493 dto += ldexp ((double) mant, exponent - mant_bits);
2494 exponent -= mant_bits;
2495 mant_off += mant_bits;
2496 mant_bits_left -= mant_bits;
2497 }
2498
2499 /* Negate it if negative. */
2500 if (get_field (ufrom, fmt->byteorder, fmt->totalsize, fmt->sign_start, 1))
2501 dto = -dto;
2502 *to = dto;
2503 }
2504 \f
2505 static void put_field (unsigned char *, enum floatformat_byteorders,
2506 unsigned int,
2507 unsigned int, unsigned int, unsigned long);
2508
2509 /* Set a field which starts at START and is LEN bytes long. DATA and
2510 TOTAL_LEN are the thing we are extracting it from, in byteorder ORDER. */
2511 static void
2512 put_field (unsigned char *data, enum floatformat_byteorders order,
2513 unsigned int total_len, unsigned int start, unsigned int len,
2514 unsigned long stuff_to_put)
2515 {
2516 unsigned int cur_byte;
2517 int cur_bitshift;
2518
2519 /* Start at the least significant part of the field. */
2520 if (order == floatformat_little || order == floatformat_littlebyte_bigword)
2521 {
2522 int excess = FLOATFORMAT_CHAR_BIT - (total_len % FLOATFORMAT_CHAR_BIT);
2523 cur_byte = (total_len / FLOATFORMAT_CHAR_BIT)
2524 - ((start + len + excess) / FLOATFORMAT_CHAR_BIT);
2525 cur_bitshift = ((start + len + excess) % FLOATFORMAT_CHAR_BIT)
2526 - FLOATFORMAT_CHAR_BIT;
2527 }
2528 else
2529 {
2530 cur_byte = (start + len) / FLOATFORMAT_CHAR_BIT;
2531 cur_bitshift =
2532 ((start + len) % FLOATFORMAT_CHAR_BIT) - FLOATFORMAT_CHAR_BIT;
2533 }
2534 if (cur_bitshift > -FLOATFORMAT_CHAR_BIT)
2535 {
2536 *(data + cur_byte) &=
2537 ~(((1 << ((start + len) % FLOATFORMAT_CHAR_BIT)) - 1)
2538 << (-cur_bitshift));
2539 *(data + cur_byte) |=
2540 (stuff_to_put & ((1 << FLOATFORMAT_CHAR_BIT) - 1)) << (-cur_bitshift);
2541 }
2542 cur_bitshift += FLOATFORMAT_CHAR_BIT;
2543 if (order == floatformat_little || order == floatformat_littlebyte_bigword)
2544 ++cur_byte;
2545 else
2546 --cur_byte;
2547
2548 /* Move towards the most significant part of the field. */
2549 while (cur_bitshift < len)
2550 {
2551 if (len - cur_bitshift < FLOATFORMAT_CHAR_BIT)
2552 {
2553 /* This is the last byte. */
2554 *(data + cur_byte) &=
2555 ~((1 << (len - cur_bitshift)) - 1);
2556 *(data + cur_byte) |= (stuff_to_put >> cur_bitshift);
2557 }
2558 else
2559 *(data + cur_byte) = ((stuff_to_put >> cur_bitshift)
2560 & ((1 << FLOATFORMAT_CHAR_BIT) - 1));
2561 cur_bitshift += FLOATFORMAT_CHAR_BIT;
2562 if (order == floatformat_little || order == floatformat_littlebyte_bigword)
2563 ++cur_byte;
2564 else
2565 --cur_byte;
2566 }
2567 }
2568
2569 #ifdef HAVE_LONG_DOUBLE
2570 /* Return the fractional part of VALUE, and put the exponent of VALUE in *EPTR.
2571 The range of the returned value is >= 0.5 and < 1.0. This is equivalent to
2572 frexp, but operates on the long double data type. */
2573
2574 static long double ldfrexp (long double value, int *eptr);
2575
2576 static long double
2577 ldfrexp (long double value, int *eptr)
2578 {
2579 long double tmp;
2580 int exp;
2581
2582 /* Unfortunately, there are no portable functions for extracting the exponent
2583 of a long double, so we have to do it iteratively by multiplying or dividing
2584 by two until the fraction is between 0.5 and 1.0. */
2585
2586 if (value < 0.0l)
2587 value = -value;
2588
2589 tmp = 1.0l;
2590 exp = 0;
2591
2592 if (value >= tmp) /* Value >= 1.0 */
2593 while (value >= tmp)
2594 {
2595 tmp *= 2.0l;
2596 exp++;
2597 }
2598 else if (value != 0.0l) /* Value < 1.0 and > 0.0 */
2599 {
2600 while (value < tmp)
2601 {
2602 tmp /= 2.0l;
2603 exp--;
2604 }
2605 tmp *= 2.0l;
2606 exp++;
2607 }
2608
2609 *eptr = exp;
2610 return value / tmp;
2611 }
2612 #endif /* HAVE_LONG_DOUBLE */
2613
2614
2615 /* The converse: convert the DOUBLEST *FROM to an extended float
2616 and store where TO points. Neither FROM nor TO have any alignment
2617 restrictions. */
2618
2619 void
2620 floatformat_from_doublest (CONST struct floatformat *fmt, DOUBLEST *from,
2621 char *to)
2622 {
2623 DOUBLEST dfrom;
2624 int exponent;
2625 DOUBLEST mant;
2626 unsigned int mant_bits, mant_off;
2627 int mant_bits_left;
2628 unsigned char *uto = (unsigned char *) to;
2629
2630 memcpy (&dfrom, from, sizeof (dfrom));
2631 memset (uto, 0, (fmt->totalsize + FLOATFORMAT_CHAR_BIT - 1)
2632 / FLOATFORMAT_CHAR_BIT);
2633 if (dfrom == 0)
2634 return; /* Result is zero */
2635 if (dfrom != dfrom) /* Result is NaN */
2636 {
2637 /* From is NaN */
2638 put_field (uto, fmt->byteorder, fmt->totalsize, fmt->exp_start,
2639 fmt->exp_len, fmt->exp_nan);
2640 /* Be sure it's not infinity, but NaN value is irrel */
2641 put_field (uto, fmt->byteorder, fmt->totalsize, fmt->man_start,
2642 32, 1);
2643 return;
2644 }
2645
2646 /* If negative, set the sign bit. */
2647 if (dfrom < 0)
2648 {
2649 put_field (uto, fmt->byteorder, fmt->totalsize, fmt->sign_start, 1, 1);
2650 dfrom = -dfrom;
2651 }
2652
2653 if (dfrom + dfrom == dfrom && dfrom != 0.0) /* Result is Infinity */
2654 {
2655 /* Infinity exponent is same as NaN's. */
2656 put_field (uto, fmt->byteorder, fmt->totalsize, fmt->exp_start,
2657 fmt->exp_len, fmt->exp_nan);
2658 /* Infinity mantissa is all zeroes. */
2659 put_field (uto, fmt->byteorder, fmt->totalsize, fmt->man_start,
2660 fmt->man_len, 0);
2661 return;
2662 }
2663
2664 #ifdef HAVE_LONG_DOUBLE
2665 mant = ldfrexp (dfrom, &exponent);
2666 #else
2667 mant = frexp (dfrom, &exponent);
2668 #endif
2669
2670 put_field (uto, fmt->byteorder, fmt->totalsize, fmt->exp_start, fmt->exp_len,
2671 exponent + fmt->exp_bias - 1);
2672
2673 mant_bits_left = fmt->man_len;
2674 mant_off = fmt->man_start;
2675 while (mant_bits_left > 0)
2676 {
2677 unsigned long mant_long;
2678 mant_bits = mant_bits_left < 32 ? mant_bits_left : 32;
2679
2680 mant *= 4294967296.0;
2681 mant_long = ((unsigned long) mant) & 0xffffffffL;
2682 mant -= mant_long;
2683
2684 /* If the integer bit is implicit, then we need to discard it.
2685 If we are discarding a zero, we should be (but are not) creating
2686 a denormalized number which means adjusting the exponent
2687 (I think). */
2688 if (mant_bits_left == fmt->man_len
2689 && fmt->intbit == floatformat_intbit_no)
2690 {
2691 mant_long <<= 1;
2692 mant_long &= 0xffffffffL;
2693 mant_bits -= 1;
2694 }
2695
2696 if (mant_bits < 32)
2697 {
2698 /* The bits we want are in the most significant MANT_BITS bits of
2699 mant_long. Move them to the least significant. */
2700 mant_long >>= 32 - mant_bits;
2701 }
2702
2703 put_field (uto, fmt->byteorder, fmt->totalsize,
2704 mant_off, mant_bits, mant_long);
2705 mant_off += mant_bits;
2706 mant_bits_left -= mant_bits;
2707 }
2708 if (fmt->byteorder == floatformat_littlebyte_bigword)
2709 {
2710 int count;
2711 unsigned char *swaplow = uto;
2712 unsigned char *swaphigh = uto + 4;
2713 unsigned char tmp;
2714
2715 for (count = 0; count < 4; count++)
2716 {
2717 tmp = *swaplow;
2718 *swaplow++ = *swaphigh;
2719 *swaphigh++ = tmp;
2720 }
2721 }
2722 }
2723
2724 /* print routines to handle variable size regs, etc. */
2725
2726 /* temporary storage using circular buffer */
2727 #define NUMCELLS 16
2728 #define CELLSIZE 32
2729 static char *
2730 get_cell (void)
2731 {
2732 static char buf[NUMCELLS][CELLSIZE];
2733 static int cell = 0;
2734 if (++cell >= NUMCELLS)
2735 cell = 0;
2736 return buf[cell];
2737 }
2738
2739 int
2740 strlen_paddr (void)
2741 {
2742 return (TARGET_ADDR_BIT / 8 * 2);
2743 }
2744
2745 char *
2746 paddr (CORE_ADDR addr)
2747 {
2748 return phex (addr, TARGET_ADDR_BIT / 8);
2749 }
2750
2751 char *
2752 paddr_nz (CORE_ADDR addr)
2753 {
2754 return phex_nz (addr, TARGET_ADDR_BIT / 8);
2755 }
2756
2757 static void
2758 decimal2str (char *paddr_str, char *sign, ULONGEST addr)
2759 {
2760 /* steal code from valprint.c:print_decimal(). Should this worry
2761 about the real size of addr as the above does? */
2762 unsigned long temp[3];
2763 int i = 0;
2764 do
2765 {
2766 temp[i] = addr % (1000 * 1000 * 1000);
2767 addr /= (1000 * 1000 * 1000);
2768 i++;
2769 }
2770 while (addr != 0 && i < (sizeof (temp) / sizeof (temp[0])));
2771 switch (i)
2772 {
2773 case 1:
2774 sprintf (paddr_str, "%s%lu",
2775 sign, temp[0]);
2776 break;
2777 case 2:
2778 sprintf (paddr_str, "%s%lu%09lu",
2779 sign, temp[1], temp[0]);
2780 break;
2781 case 3:
2782 sprintf (paddr_str, "%s%lu%09lu%09lu",
2783 sign, temp[2], temp[1], temp[0]);
2784 break;
2785 default:
2786 abort ();
2787 }
2788 }
2789
2790 char *
2791 paddr_u (CORE_ADDR addr)
2792 {
2793 char *paddr_str = get_cell ();
2794 decimal2str (paddr_str, "", addr);
2795 return paddr_str;
2796 }
2797
2798 char *
2799 paddr_d (LONGEST addr)
2800 {
2801 char *paddr_str = get_cell ();
2802 if (addr < 0)
2803 decimal2str (paddr_str, "-", -addr);
2804 else
2805 decimal2str (paddr_str, "", addr);
2806 return paddr_str;
2807 }
2808
2809 /* eliminate warning from compiler on 32-bit systems */
2810 static int thirty_two = 32;
2811
2812 char *
2813 phex (ULONGEST l, int sizeof_l)
2814 {
2815 char *str = get_cell ();
2816 switch (sizeof_l)
2817 {
2818 case 8:
2819 sprintf (str, "%08lx%08lx",
2820 (unsigned long) (l >> thirty_two),
2821 (unsigned long) (l & 0xffffffff));
2822 break;
2823 case 4:
2824 sprintf (str, "%08lx", (unsigned long) l);
2825 break;
2826 case 2:
2827 sprintf (str, "%04x", (unsigned short) (l & 0xffff));
2828 break;
2829 default:
2830 phex (l, sizeof (l));
2831 break;
2832 }
2833 return str;
2834 }
2835
2836 char *
2837 phex_nz (ULONGEST l, int sizeof_l)
2838 {
2839 char *str = get_cell ();
2840 switch (sizeof_l)
2841 {
2842 case 8:
2843 {
2844 unsigned long high = (unsigned long) (l >> thirty_two);
2845 if (high == 0)
2846 sprintf (str, "%lx", (unsigned long) (l & 0xffffffff));
2847 else
2848 sprintf (str, "%lx%08lx",
2849 high, (unsigned long) (l & 0xffffffff));
2850 break;
2851 }
2852 case 4:
2853 sprintf (str, "%lx", (unsigned long) l);
2854 break;
2855 case 2:
2856 sprintf (str, "%x", (unsigned short) (l & 0xffff));
2857 break;
2858 default:
2859 phex_nz (l, sizeof (l));
2860 break;
2861 }
2862 return str;
2863 }
2864
2865
2866 /* Convert to / from the hosts pointer to GDB's internal CORE_ADDR
2867 using the target's conversion routines. */
2868 CORE_ADDR
2869 host_pointer_to_address (void *ptr)
2870 {
2871 if (sizeof (ptr) != TYPE_LENGTH (builtin_type_ptr))
2872 internal_error ("core_addr_to_void_ptr: bad cast");
2873 return POINTER_TO_ADDRESS (builtin_type_ptr, &ptr);
2874 }
2875
2876 void *
2877 address_to_host_pointer (CORE_ADDR addr)
2878 {
2879 void *ptr;
2880 if (sizeof (ptr) != TYPE_LENGTH (builtin_type_ptr))
2881 internal_error ("core_addr_to_void_ptr: bad cast");
2882 ADDRESS_TO_POINTER (builtin_type_ptr, &ptr, addr);
2883 return ptr;
2884 }
This page took 0.0902 seconds and 4 git commands to generate.