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