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