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