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