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