]> git.ipfire.org Git - thirdparty/binutils-gdb.git/blob - gdb/utils.c
Check return values of functions declared with warn_unused_result
[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 2009 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 four calls to abort(). */
866 default:
867 dejavu = 3;
868 /* Newer GLIBC versions put the warn_unused_result attribute
869 on write, but this is one of those rare cases where
870 ignoring the return value is correct. Casting to (void)
871 does not fix this problem. This is the solution suggested
872 at http://gcc.gnu.org/bugzilla/show_bug.cgi?id=25509. */
873 if (write (STDERR_FILENO, msg, sizeof (msg)) != sizeof (msg))
874 abort (); /* NOTE: GDB has only four calls to abort(). */
875 exit (1);
876 }
877 }
878
879 /* Try to get the message out and at the start of a new line. */
880 target_terminal_ours ();
881 begin_line ();
882
883 /* Create a string containing the full error/warning message. Need
884 to call query with this full string, as otherwize the reason
885 (error/warning) and question become separated. Format using a
886 style similar to a compiler error message. Include extra detail
887 so that the user knows that they are living on the edge. */
888 {
889 char *msg;
890 msg = xstrvprintf (fmt, ap);
891 reason = xstrprintf ("\
892 %s:%d: %s: %s\n\
893 A problem internal to GDB has been detected,\n\
894 further debugging may prove unreliable.", file, line, problem->name, msg);
895 xfree (msg);
896 make_cleanup (xfree, reason);
897 }
898
899 switch (problem->should_quit)
900 {
901 case AUTO_BOOLEAN_AUTO:
902 /* Default (yes/batch case) is to quit GDB. When in batch mode
903 this lessens the likelhood of GDB going into an infinate
904 loop. */
905 quit_p = query (_("%s\nQuit this debugging session? "), reason);
906 break;
907 case AUTO_BOOLEAN_TRUE:
908 quit_p = 1;
909 break;
910 case AUTO_BOOLEAN_FALSE:
911 quit_p = 0;
912 break;
913 default:
914 internal_error (__FILE__, __LINE__, _("bad switch"));
915 }
916
917 switch (problem->should_dump_core)
918 {
919 case AUTO_BOOLEAN_AUTO:
920 /* Default (yes/batch case) is to dump core. This leaves a GDB
921 `dropping' so that it is easier to see that something went
922 wrong in GDB. */
923 dump_core_p = query (_("%s\nCreate a core file of GDB? "), reason);
924 break;
925 break;
926 case AUTO_BOOLEAN_TRUE:
927 dump_core_p = 1;
928 break;
929 case AUTO_BOOLEAN_FALSE:
930 dump_core_p = 0;
931 break;
932 default:
933 internal_error (__FILE__, __LINE__, _("bad switch"));
934 }
935
936 if (quit_p)
937 {
938 if (dump_core_p)
939 abort (); /* NOTE: GDB has only four calls to abort(). */
940 else
941 exit (1);
942 }
943 else
944 {
945 if (dump_core_p)
946 {
947 #ifdef HAVE_WORKING_FORK
948 if (fork () == 0)
949 abort (); /* NOTE: GDB has only four calls to abort(). */
950 #endif
951 }
952 }
953
954 dejavu = 0;
955 }
956
957 static struct internal_problem internal_error_problem = {
958 "internal-error", AUTO_BOOLEAN_AUTO, AUTO_BOOLEAN_AUTO
959 };
960
961 NORETURN void
962 internal_verror (const char *file, int line, const char *fmt, va_list ap)
963 {
964 internal_vproblem (&internal_error_problem, file, line, fmt, ap);
965 deprecated_throw_reason (RETURN_ERROR);
966 }
967
968 NORETURN void
969 internal_error (const char *file, int line, const char *string, ...)
970 {
971 va_list ap;
972 va_start (ap, string);
973 internal_verror (file, line, string, ap);
974 va_end (ap);
975 }
976
977 static struct internal_problem internal_warning_problem = {
978 "internal-warning", AUTO_BOOLEAN_AUTO, AUTO_BOOLEAN_AUTO
979 };
980
981 void
982 internal_vwarning (const char *file, int line, const char *fmt, va_list ap)
983 {
984 internal_vproblem (&internal_warning_problem, file, line, fmt, ap);
985 }
986
987 void
988 internal_warning (const char *file, int line, const char *string, ...)
989 {
990 va_list ap;
991 va_start (ap, string);
992 internal_vwarning (file, line, string, ap);
993 va_end (ap);
994 }
995
996 /* Print the system error message for errno, and also mention STRING
997 as the file name for which the error was encountered.
998 Then return to command level. */
999
1000 NORETURN void
1001 perror_with_name (const char *string)
1002 {
1003 char *err;
1004 char *combined;
1005
1006 err = safe_strerror (errno);
1007 combined = (char *) alloca (strlen (err) + strlen (string) + 3);
1008 strcpy (combined, string);
1009 strcat (combined, ": ");
1010 strcat (combined, err);
1011
1012 /* I understand setting these is a matter of taste. Still, some people
1013 may clear errno but not know about bfd_error. Doing this here is not
1014 unreasonable. */
1015 bfd_set_error (bfd_error_no_error);
1016 errno = 0;
1017
1018 error (_("%s."), combined);
1019 }
1020
1021 /* Print the system error message for ERRCODE, and also mention STRING
1022 as the file name for which the error was encountered. */
1023
1024 void
1025 print_sys_errmsg (const char *string, int errcode)
1026 {
1027 char *err;
1028 char *combined;
1029
1030 err = safe_strerror (errcode);
1031 combined = (char *) alloca (strlen (err) + strlen (string) + 3);
1032 strcpy (combined, string);
1033 strcat (combined, ": ");
1034 strcat (combined, err);
1035
1036 /* We want anything which was printed on stdout to come out first, before
1037 this message. */
1038 gdb_flush (gdb_stdout);
1039 fprintf_unfiltered (gdb_stderr, "%s.\n", combined);
1040 }
1041
1042 /* Control C eventually causes this to be called, at a convenient time. */
1043
1044 void
1045 quit (void)
1046 {
1047 #ifdef __MSDOS__
1048 /* No steenking SIGINT will ever be coming our way when the
1049 program is resumed. Don't lie. */
1050 fatal ("Quit");
1051 #else
1052 if (job_control
1053 /* If there is no terminal switching for this target, then we can't
1054 possibly get screwed by the lack of job control. */
1055 || current_target.to_terminal_ours == NULL)
1056 fatal ("Quit");
1057 else
1058 fatal ("Quit (expect signal SIGINT when the program is resumed)");
1059 #endif
1060 }
1061
1062 \f
1063 /* Called when a memory allocation fails, with the number of bytes of
1064 memory requested in SIZE. */
1065
1066 NORETURN void
1067 nomem (long size)
1068 {
1069 if (size > 0)
1070 {
1071 internal_error (__FILE__, __LINE__,
1072 _("virtual memory exhausted: can't allocate %ld bytes."),
1073 size);
1074 }
1075 else
1076 {
1077 internal_error (__FILE__, __LINE__, _("virtual memory exhausted."));
1078 }
1079 }
1080
1081 /* The xmalloc() (libiberty.h) family of memory management routines.
1082
1083 These are like the ISO-C malloc() family except that they implement
1084 consistent semantics and guard against typical memory management
1085 problems. */
1086
1087 /* NOTE: These are declared using PTR to ensure consistency with
1088 "libiberty.h". xfree() is GDB local. */
1089
1090 PTR /* OK: PTR */
1091 xmalloc (size_t size)
1092 {
1093 void *val;
1094
1095 /* See libiberty/xmalloc.c. This function need's to match that's
1096 semantics. It never returns NULL. */
1097 if (size == 0)
1098 size = 1;
1099
1100 val = malloc (size); /* OK: malloc */
1101 if (val == NULL)
1102 nomem (size);
1103
1104 return (val);
1105 }
1106
1107 void *
1108 xzalloc (size_t size)
1109 {
1110 return xcalloc (1, size);
1111 }
1112
1113 PTR /* OK: PTR */
1114 xrealloc (PTR ptr, size_t size) /* OK: PTR */
1115 {
1116 void *val;
1117
1118 /* See libiberty/xmalloc.c. This function need's to match that's
1119 semantics. It never returns NULL. */
1120 if (size == 0)
1121 size = 1;
1122
1123 if (ptr != NULL)
1124 val = realloc (ptr, size); /* OK: realloc */
1125 else
1126 val = malloc (size); /* OK: malloc */
1127 if (val == NULL)
1128 nomem (size);
1129
1130 return (val);
1131 }
1132
1133 PTR /* OK: PTR */
1134 xcalloc (size_t number, size_t size)
1135 {
1136 void *mem;
1137
1138 /* See libiberty/xmalloc.c. This function need's to match that's
1139 semantics. It never returns NULL. */
1140 if (number == 0 || size == 0)
1141 {
1142 number = 1;
1143 size = 1;
1144 }
1145
1146 mem = calloc (number, size); /* OK: xcalloc */
1147 if (mem == NULL)
1148 nomem (number * size);
1149
1150 return mem;
1151 }
1152
1153 void
1154 xfree (void *ptr)
1155 {
1156 if (ptr != NULL)
1157 free (ptr); /* OK: free */
1158 }
1159 \f
1160
1161 /* Like asprintf/vasprintf but get an internal_error if the call
1162 fails. */
1163
1164 char *
1165 xstrprintf (const char *format, ...)
1166 {
1167 char *ret;
1168 va_list args;
1169 va_start (args, format);
1170 ret = xstrvprintf (format, args);
1171 va_end (args);
1172 return ret;
1173 }
1174
1175 void
1176 xasprintf (char **ret, const char *format, ...)
1177 {
1178 va_list args;
1179 va_start (args, format);
1180 (*ret) = xstrvprintf (format, args);
1181 va_end (args);
1182 }
1183
1184 void
1185 xvasprintf (char **ret, const char *format, va_list ap)
1186 {
1187 (*ret) = xstrvprintf (format, ap);
1188 }
1189
1190 char *
1191 xstrvprintf (const char *format, va_list ap)
1192 {
1193 char *ret = NULL;
1194 int status = vasprintf (&ret, format, ap);
1195 /* NULL is returned when there was a memory allocation problem, or
1196 any other error (for instance, a bad format string). A negative
1197 status (the printed length) with a non-NULL buffer should never
1198 happen, but just to be sure. */
1199 if (ret == NULL || status < 0)
1200 internal_error (__FILE__, __LINE__, _("vasprintf call failed"));
1201 return ret;
1202 }
1203
1204 int
1205 xsnprintf (char *str, size_t size, const char *format, ...)
1206 {
1207 va_list args;
1208 int ret;
1209
1210 va_start (args, format);
1211 ret = vsnprintf (str, size, format, args);
1212 gdb_assert (ret < size);
1213 va_end (args);
1214
1215 return ret;
1216 }
1217
1218 /* My replacement for the read system call.
1219 Used like `read' but keeps going if `read' returns too soon. */
1220
1221 int
1222 myread (int desc, char *addr, int len)
1223 {
1224 int val;
1225 int orglen = len;
1226
1227 while (len > 0)
1228 {
1229 val = read (desc, addr, len);
1230 if (val < 0)
1231 return val;
1232 if (val == 0)
1233 return orglen - len;
1234 len -= val;
1235 addr += val;
1236 }
1237 return orglen;
1238 }
1239 \f
1240 /* Make a copy of the string at PTR with SIZE characters
1241 (and add a null character at the end in the copy).
1242 Uses malloc to get the space. Returns the address of the copy. */
1243
1244 char *
1245 savestring (const char *ptr, size_t size)
1246 {
1247 char *p = (char *) xmalloc (size + 1);
1248 memcpy (p, ptr, size);
1249 p[size] = 0;
1250 return p;
1251 }
1252
1253 void
1254 print_spaces (int n, struct ui_file *file)
1255 {
1256 fputs_unfiltered (n_spaces (n), file);
1257 }
1258
1259 /* Print a host address. */
1260
1261 void
1262 gdb_print_host_address (const void *addr, struct ui_file *stream)
1263 {
1264
1265 /* We could use the %p conversion specifier to fprintf if we had any
1266 way of knowing whether this host supports it. But the following
1267 should work on the Alpha and on 32 bit machines. */
1268
1269 fprintf_filtered (stream, "0x%lx", (unsigned long) addr);
1270 }
1271 \f
1272
1273 /* This function supports the query, nquery, and yquery functions.
1274 Ask user a y-or-n question and return 0 if answer is no, 1 if
1275 answer is yes, or default the answer to the specified default
1276 (for yquery or nquery). DEFCHAR may be 'y' or 'n' to provide a
1277 default answer, or '\0' for no default.
1278 CTLSTR is the control string and should end in "? ". It should
1279 not say how to answer, because we do that.
1280 ARGS are the arguments passed along with the CTLSTR argument to
1281 printf. */
1282
1283 static int ATTR_FORMAT (printf, 1, 0)
1284 defaulted_query (const char *ctlstr, const char defchar, va_list args)
1285 {
1286 int answer;
1287 int ans2;
1288 int retval;
1289 int def_value;
1290 char def_answer, not_def_answer;
1291 char *y_string, *n_string, *question;
1292
1293 /* Set up according to which answer is the default. */
1294 if (defchar == '\0')
1295 {
1296 def_value = 1;
1297 def_answer = 'Y';
1298 not_def_answer = 'N';
1299 y_string = "y";
1300 n_string = "n";
1301 }
1302 else if (defchar == 'y')
1303 {
1304 def_value = 1;
1305 def_answer = 'Y';
1306 not_def_answer = 'N';
1307 y_string = "[y]";
1308 n_string = "n";
1309 }
1310 else
1311 {
1312 def_value = 0;
1313 def_answer = 'N';
1314 not_def_answer = 'Y';
1315 y_string = "y";
1316 n_string = "[n]";
1317 }
1318
1319 /* Automatically answer the default value if the user did not want
1320 prompts. */
1321 if (! caution)
1322 return def_value;
1323
1324 /* If input isn't coming from the user directly, just say what
1325 question we're asking, and then answer "yes" automatically. This
1326 way, important error messages don't get lost when talking to GDB
1327 over a pipe. */
1328 if (! input_from_terminal_p ())
1329 {
1330 wrap_here ("");
1331 vfprintf_filtered (gdb_stdout, ctlstr, args);
1332
1333 printf_filtered (_("(%s or %s) [answered %c; input not from terminal]\n"),
1334 y_string, n_string, def_answer);
1335 gdb_flush (gdb_stdout);
1336
1337 return def_value;
1338 }
1339
1340 /* Automatically answer the default value if input is not from the user
1341 directly, or if the user did not want prompts. */
1342 if (!input_from_terminal_p () || !caution)
1343 return def_value;
1344
1345 if (deprecated_query_hook)
1346 {
1347 return deprecated_query_hook (ctlstr, args);
1348 }
1349
1350 /* Format the question outside of the loop, to avoid reusing args. */
1351 question = xstrvprintf (ctlstr, args);
1352
1353 while (1)
1354 {
1355 wrap_here (""); /* Flush any buffered output */
1356 gdb_flush (gdb_stdout);
1357
1358 if (annotation_level > 1)
1359 printf_filtered (("\n\032\032pre-query\n"));
1360
1361 fputs_filtered (question, gdb_stdout);
1362 printf_filtered (_("(%s or %s) "), y_string, n_string);
1363
1364 if (annotation_level > 1)
1365 printf_filtered (("\n\032\032query\n"));
1366
1367 wrap_here ("");
1368 gdb_flush (gdb_stdout);
1369
1370 answer = fgetc (stdin);
1371 clearerr (stdin); /* in case of C-d */
1372 if (answer == EOF) /* C-d */
1373 {
1374 printf_filtered ("EOF [assumed %c]\n", def_answer);
1375 retval = def_value;
1376 break;
1377 }
1378 /* Eat rest of input line, to EOF or newline */
1379 if (answer != '\n')
1380 do
1381 {
1382 ans2 = fgetc (stdin);
1383 clearerr (stdin);
1384 }
1385 while (ans2 != EOF && ans2 != '\n' && ans2 != '\r');
1386
1387 if (answer >= 'a')
1388 answer -= 040;
1389 /* Check answer. For the non-default, the user must specify
1390 the non-default explicitly. */
1391 if (answer == not_def_answer)
1392 {
1393 retval = !def_value;
1394 break;
1395 }
1396 /* Otherwise, if a default was specified, the user may either
1397 specify the required input or have it default by entering
1398 nothing. */
1399 if (answer == def_answer
1400 || (defchar != '\0' &&
1401 (answer == '\n' || answer == '\r' || answer == EOF)))
1402 {
1403 retval = def_value;
1404 break;
1405 }
1406 /* Invalid entries are not defaulted and require another selection. */
1407 printf_filtered (_("Please answer %s or %s.\n"),
1408 y_string, n_string);
1409 }
1410
1411 xfree (question);
1412 if (annotation_level > 1)
1413 printf_filtered (("\n\032\032post-query\n"));
1414 return retval;
1415 }
1416 \f
1417
1418 /* Ask user a y-or-n question and return 0 if answer is no, 1 if
1419 answer is yes, or 0 if answer is defaulted.
1420 Takes three args which are given to printf to print the question.
1421 The first, a control string, should end in "? ".
1422 It should not say how to answer, because we do that. */
1423
1424 int
1425 nquery (const char *ctlstr, ...)
1426 {
1427 va_list args;
1428
1429 va_start (args, ctlstr);
1430 return defaulted_query (ctlstr, 'n', args);
1431 va_end (args);
1432 }
1433
1434 /* Ask user a y-or-n question and return 0 if answer is no, 1 if
1435 answer is yes, or 1 if answer is defaulted.
1436 Takes three args which are given to printf to print the question.
1437 The first, a control string, should end in "? ".
1438 It should not say how to answer, because we do that. */
1439
1440 int
1441 yquery (const char *ctlstr, ...)
1442 {
1443 va_list args;
1444
1445 va_start (args, ctlstr);
1446 return defaulted_query (ctlstr, 'y', args);
1447 va_end (args);
1448 }
1449
1450 /* Ask user a y-or-n question and return 1 iff answer is yes.
1451 Takes three args which are given to printf to print the question.
1452 The first, a control string, should end in "? ".
1453 It should not say how to answer, because we do that. */
1454
1455 int
1456 query (const char *ctlstr, ...)
1457 {
1458 va_list args;
1459
1460 va_start (args, ctlstr);
1461 return defaulted_query (ctlstr, '\0', args);
1462 va_end (args);
1463 }
1464
1465 /* Print an error message saying that we couldn't make sense of a
1466 \^mumble sequence in a string or character constant. START and END
1467 indicate a substring of some larger string that contains the
1468 erroneous backslash sequence, missing the initial backslash. */
1469 static NORETURN int
1470 no_control_char_error (const char *start, const char *end)
1471 {
1472 int len = end - start;
1473 char *copy = alloca (end - start + 1);
1474
1475 memcpy (copy, start, len);
1476 copy[len] = '\0';
1477
1478 error (_("There is no control character `\\%s' in the `%s' character set."),
1479 copy, target_charset ());
1480 }
1481
1482 /* Parse a C escape sequence. STRING_PTR points to a variable
1483 containing a pointer to the string to parse. That pointer
1484 should point to the character after the \. That pointer
1485 is updated past the characters we use. The value of the
1486 escape sequence is returned.
1487
1488 A negative value means the sequence \ newline was seen,
1489 which is supposed to be equivalent to nothing at all.
1490
1491 If \ is followed by a null character, we return a negative
1492 value and leave the string pointer pointing at the null character.
1493
1494 If \ is followed by 000, we return 0 and leave the string pointer
1495 after the zeros. A value of 0 does not mean end of string. */
1496
1497 int
1498 parse_escape (char **string_ptr)
1499 {
1500 int target_char;
1501 int c = *(*string_ptr)++;
1502 if (c_parse_backslash (c, &target_char))
1503 return target_char;
1504 else
1505 switch (c)
1506 {
1507 case '\n':
1508 return -2;
1509 case 0:
1510 (*string_ptr)--;
1511 return 0;
1512 case '^':
1513 {
1514 /* Remember where this escape sequence started, for reporting
1515 errors. */
1516 char *sequence_start_pos = *string_ptr - 1;
1517
1518 c = *(*string_ptr)++;
1519
1520 if (c == '?')
1521 {
1522 /* XXXCHARSET: What is `delete' in the host character set? */
1523 c = 0177;
1524
1525 if (!host_char_to_target (c, &target_char))
1526 error (_("There is no character corresponding to `Delete' "
1527 "in the target character set `%s'."), host_charset ());
1528
1529 return target_char;
1530 }
1531 else if (c == '\\')
1532 target_char = parse_escape (string_ptr);
1533 else
1534 {
1535 if (!host_char_to_target (c, &target_char))
1536 no_control_char_error (sequence_start_pos, *string_ptr);
1537 }
1538
1539 /* Now target_char is something like `c', and we want to find
1540 its control-character equivalent. */
1541 if (!target_char_to_control_char (target_char, &target_char))
1542 no_control_char_error (sequence_start_pos, *string_ptr);
1543
1544 return target_char;
1545 }
1546
1547 /* XXXCHARSET: we need to use isdigit and value-of-digit
1548 methods of the host character set here. */
1549
1550 case '0':
1551 case '1':
1552 case '2':
1553 case '3':
1554 case '4':
1555 case '5':
1556 case '6':
1557 case '7':
1558 {
1559 int i = c - '0';
1560 int count = 0;
1561 while (++count < 3)
1562 {
1563 c = (**string_ptr);
1564 if (c >= '0' && c <= '7')
1565 {
1566 (*string_ptr)++;
1567 i *= 8;
1568 i += c - '0';
1569 }
1570 else
1571 {
1572 break;
1573 }
1574 }
1575 return i;
1576 }
1577 default:
1578 if (!host_char_to_target (c, &target_char))
1579 error
1580 ("The escape sequence `\%c' is equivalent to plain `%c', which"
1581 " has no equivalent\n" "in the `%s' character set.", c, c,
1582 target_charset ());
1583 return target_char;
1584 }
1585 }
1586 \f
1587 /* Print the character C on STREAM as part of the contents of a literal
1588 string whose delimiter is QUOTER. Note that this routine should only
1589 be call for printing things which are independent of the language
1590 of the program being debugged. */
1591
1592 static void
1593 printchar (int c, void (*do_fputs) (const char *, struct ui_file *),
1594 void (*do_fprintf) (struct ui_file *, const char *, ...)
1595 ATTRIBUTE_FPTR_PRINTF_2, struct ui_file *stream, int quoter)
1596 {
1597
1598 c &= 0xFF; /* Avoid sign bit follies */
1599
1600 if (c < 0x20 || /* Low control chars */
1601 (c >= 0x7F && c < 0xA0) || /* DEL, High controls */
1602 (sevenbit_strings && c >= 0x80))
1603 { /* high order bit set */
1604 switch (c)
1605 {
1606 case '\n':
1607 do_fputs ("\\n", stream);
1608 break;
1609 case '\b':
1610 do_fputs ("\\b", stream);
1611 break;
1612 case '\t':
1613 do_fputs ("\\t", stream);
1614 break;
1615 case '\f':
1616 do_fputs ("\\f", stream);
1617 break;
1618 case '\r':
1619 do_fputs ("\\r", stream);
1620 break;
1621 case '\033':
1622 do_fputs ("\\e", stream);
1623 break;
1624 case '\007':
1625 do_fputs ("\\a", stream);
1626 break;
1627 default:
1628 do_fprintf (stream, "\\%.3o", (unsigned int) c);
1629 break;
1630 }
1631 }
1632 else
1633 {
1634 if (c == '\\' || c == quoter)
1635 do_fputs ("\\", stream);
1636 do_fprintf (stream, "%c", c);
1637 }
1638 }
1639
1640 /* Print the character C on STREAM as part of the contents of a
1641 literal string whose delimiter is QUOTER. Note that these routines
1642 should only be call for printing things which are independent of
1643 the language of the program being debugged. */
1644
1645 void
1646 fputstr_filtered (const char *str, int quoter, struct ui_file *stream)
1647 {
1648 while (*str)
1649 printchar (*str++, fputs_filtered, fprintf_filtered, stream, quoter);
1650 }
1651
1652 void
1653 fputstr_unfiltered (const char *str, int quoter, struct ui_file *stream)
1654 {
1655 while (*str)
1656 printchar (*str++, fputs_unfiltered, fprintf_unfiltered, stream, quoter);
1657 }
1658
1659 void
1660 fputstrn_filtered (const char *str, int n, int quoter,
1661 struct ui_file *stream)
1662 {
1663 int i;
1664 for (i = 0; i < n; i++)
1665 printchar (str[i], fputs_filtered, fprintf_filtered, stream, quoter);
1666 }
1667
1668 void
1669 fputstrn_unfiltered (const char *str, int n, int quoter,
1670 struct ui_file *stream)
1671 {
1672 int i;
1673 for (i = 0; i < n; i++)
1674 printchar (str[i], fputs_unfiltered, fprintf_unfiltered, stream, quoter);
1675 }
1676 \f
1677
1678 /* Number of lines per page or UINT_MAX if paging is disabled. */
1679 static unsigned int lines_per_page;
1680 static void
1681 show_lines_per_page (struct ui_file *file, int from_tty,
1682 struct cmd_list_element *c, const char *value)
1683 {
1684 fprintf_filtered (file, _("\
1685 Number of lines gdb thinks are in a page is %s.\n"),
1686 value);
1687 }
1688
1689 /* Number of chars per line or UINT_MAX if line folding is disabled. */
1690 static unsigned int chars_per_line;
1691 static void
1692 show_chars_per_line (struct ui_file *file, int from_tty,
1693 struct cmd_list_element *c, const char *value)
1694 {
1695 fprintf_filtered (file, _("\
1696 Number of characters gdb thinks are in a line is %s.\n"),
1697 value);
1698 }
1699
1700 /* Current count of lines printed on this page, chars on this line. */
1701 static unsigned int lines_printed, chars_printed;
1702
1703 /* Buffer and start column of buffered text, for doing smarter word-
1704 wrapping. When someone calls wrap_here(), we start buffering output
1705 that comes through fputs_filtered(). If we see a newline, we just
1706 spit it out and forget about the wrap_here(). If we see another
1707 wrap_here(), we spit it out and remember the newer one. If we see
1708 the end of the line, we spit out a newline, the indent, and then
1709 the buffered output. */
1710
1711 /* Malloc'd buffer with chars_per_line+2 bytes. Contains characters which
1712 are waiting to be output (they have already been counted in chars_printed).
1713 When wrap_buffer[0] is null, the buffer is empty. */
1714 static char *wrap_buffer;
1715
1716 /* Pointer in wrap_buffer to the next character to fill. */
1717 static char *wrap_pointer;
1718
1719 /* String to indent by if the wrap occurs. Must not be NULL if wrap_column
1720 is non-zero. */
1721 static char *wrap_indent;
1722
1723 /* Column number on the screen where wrap_buffer begins, or 0 if wrapping
1724 is not in effect. */
1725 static int wrap_column;
1726 \f
1727
1728 /* Inialize the number of lines per page and chars per line. */
1729
1730 void
1731 init_page_info (void)
1732 {
1733 #if defined(TUI)
1734 if (!tui_get_command_dimension (&chars_per_line, &lines_per_page))
1735 #endif
1736 {
1737 int rows, cols;
1738
1739 #if defined(__GO32__)
1740 rows = ScreenRows ();
1741 cols = ScreenCols ();
1742 lines_per_page = rows;
1743 chars_per_line = cols;
1744 #else
1745 /* Make sure Readline has initialized its terminal settings. */
1746 rl_reset_terminal (NULL);
1747
1748 /* Get the screen size from Readline. */
1749 rl_get_screen_size (&rows, &cols);
1750 lines_per_page = rows;
1751 chars_per_line = cols;
1752
1753 /* Readline should have fetched the termcap entry for us. */
1754 if (tgetnum ("li") < 0 || getenv ("EMACS"))
1755 {
1756 /* The number of lines per page is not mentioned in the
1757 terminal description. This probably means that paging is
1758 not useful (e.g. emacs shell window), so disable paging. */
1759 lines_per_page = UINT_MAX;
1760 }
1761
1762 /* FIXME: Get rid of this junk. */
1763 #if defined(SIGWINCH) && defined(SIGWINCH_HANDLER)
1764 SIGWINCH_HANDLER (SIGWINCH);
1765 #endif
1766
1767 /* If the output is not a terminal, don't paginate it. */
1768 if (!ui_file_isatty (gdb_stdout))
1769 lines_per_page = UINT_MAX;
1770 #endif
1771 }
1772
1773 set_screen_size ();
1774 set_width ();
1775 }
1776
1777 /* Set the screen size based on LINES_PER_PAGE and CHARS_PER_LINE. */
1778
1779 static void
1780 set_screen_size (void)
1781 {
1782 int rows = lines_per_page;
1783 int cols = chars_per_line;
1784
1785 if (rows <= 0)
1786 rows = INT_MAX;
1787
1788 if (cols <= 0)
1789 cols = INT_MAX;
1790
1791 /* Update Readline's idea of the terminal size. */
1792 rl_set_screen_size (rows, cols);
1793 }
1794
1795 /* Reinitialize WRAP_BUFFER according to the current value of
1796 CHARS_PER_LINE. */
1797
1798 static void
1799 set_width (void)
1800 {
1801 if (chars_per_line == 0)
1802 init_page_info ();
1803
1804 if (!wrap_buffer)
1805 {
1806 wrap_buffer = (char *) xmalloc (chars_per_line + 2);
1807 wrap_buffer[0] = '\0';
1808 }
1809 else
1810 wrap_buffer = (char *) xrealloc (wrap_buffer, chars_per_line + 2);
1811 wrap_pointer = wrap_buffer; /* Start it at the beginning. */
1812 }
1813
1814 static void
1815 set_width_command (char *args, int from_tty, struct cmd_list_element *c)
1816 {
1817 set_screen_size ();
1818 set_width ();
1819 }
1820
1821 static void
1822 set_height_command (char *args, int from_tty, struct cmd_list_element *c)
1823 {
1824 set_screen_size ();
1825 }
1826
1827 /* Wait, so the user can read what's on the screen. Prompt the user
1828 to continue by pressing RETURN. */
1829
1830 static void
1831 prompt_for_continue (void)
1832 {
1833 char *ignore;
1834 char cont_prompt[120];
1835
1836 if (annotation_level > 1)
1837 printf_unfiltered (("\n\032\032pre-prompt-for-continue\n"));
1838
1839 strcpy (cont_prompt,
1840 "---Type <return> to continue, or q <return> to quit---");
1841 if (annotation_level > 1)
1842 strcat (cont_prompt, "\n\032\032prompt-for-continue\n");
1843
1844 /* We must do this *before* we call gdb_readline, else it will eventually
1845 call us -- thinking that we're trying to print beyond the end of the
1846 screen. */
1847 reinitialize_more_filter ();
1848
1849 immediate_quit++;
1850 /* On a real operating system, the user can quit with SIGINT.
1851 But not on GO32.
1852
1853 'q' is provided on all systems so users don't have to change habits
1854 from system to system, and because telling them what to do in
1855 the prompt is more user-friendly than expecting them to think of
1856 SIGINT. */
1857 /* Call readline, not gdb_readline, because GO32 readline handles control-C
1858 whereas control-C to gdb_readline will cause the user to get dumped
1859 out to DOS. */
1860 ignore = gdb_readline_wrapper (cont_prompt);
1861
1862 if (annotation_level > 1)
1863 printf_unfiltered (("\n\032\032post-prompt-for-continue\n"));
1864
1865 if (ignore)
1866 {
1867 char *p = ignore;
1868 while (*p == ' ' || *p == '\t')
1869 ++p;
1870 if (p[0] == 'q')
1871 async_request_quit (0);
1872 xfree (ignore);
1873 }
1874 immediate_quit--;
1875
1876 /* Now we have to do this again, so that GDB will know that it doesn't
1877 need to save the ---Type <return>--- line at the top of the screen. */
1878 reinitialize_more_filter ();
1879
1880 dont_repeat (); /* Forget prev cmd -- CR won't repeat it. */
1881 }
1882
1883 /* Reinitialize filter; ie. tell it to reset to original values. */
1884
1885 void
1886 reinitialize_more_filter (void)
1887 {
1888 lines_printed = 0;
1889 chars_printed = 0;
1890 }
1891
1892 /* Indicate that if the next sequence of characters overflows the line,
1893 a newline should be inserted here rather than when it hits the end.
1894 If INDENT is non-null, it is a string to be printed to indent the
1895 wrapped part on the next line. INDENT must remain accessible until
1896 the next call to wrap_here() or until a newline is printed through
1897 fputs_filtered().
1898
1899 If the line is already overfull, we immediately print a newline and
1900 the indentation, and disable further wrapping.
1901
1902 If we don't know the width of lines, but we know the page height,
1903 we must not wrap words, but should still keep track of newlines
1904 that were explicitly printed.
1905
1906 INDENT should not contain tabs, as that will mess up the char count
1907 on the next line. FIXME.
1908
1909 This routine is guaranteed to force out any output which has been
1910 squirreled away in the wrap_buffer, so wrap_here ((char *)0) can be
1911 used to force out output from the wrap_buffer. */
1912
1913 void
1914 wrap_here (char *indent)
1915 {
1916 /* This should have been allocated, but be paranoid anyway. */
1917 if (!wrap_buffer)
1918 internal_error (__FILE__, __LINE__, _("failed internal consistency check"));
1919
1920 if (wrap_buffer[0])
1921 {
1922 *wrap_pointer = '\0';
1923 fputs_unfiltered (wrap_buffer, gdb_stdout);
1924 }
1925 wrap_pointer = wrap_buffer;
1926 wrap_buffer[0] = '\0';
1927 if (chars_per_line == UINT_MAX) /* No line overflow checking */
1928 {
1929 wrap_column = 0;
1930 }
1931 else if (chars_printed >= chars_per_line)
1932 {
1933 puts_filtered ("\n");
1934 if (indent != NULL)
1935 puts_filtered (indent);
1936 wrap_column = 0;
1937 }
1938 else
1939 {
1940 wrap_column = chars_printed;
1941 if (indent == NULL)
1942 wrap_indent = "";
1943 else
1944 wrap_indent = indent;
1945 }
1946 }
1947
1948 /* Print input string to gdb_stdout, filtered, with wrap,
1949 arranging strings in columns of n chars. String can be
1950 right or left justified in the column. Never prints
1951 trailing spaces. String should never be longer than
1952 width. FIXME: this could be useful for the EXAMINE
1953 command, which currently doesn't tabulate very well */
1954
1955 void
1956 puts_filtered_tabular (char *string, int width, int right)
1957 {
1958 int spaces = 0;
1959 int stringlen;
1960 char *spacebuf;
1961
1962 gdb_assert (chars_per_line > 0);
1963 if (chars_per_line == UINT_MAX)
1964 {
1965 fputs_filtered (string, gdb_stdout);
1966 fputs_filtered ("\n", gdb_stdout);
1967 return;
1968 }
1969
1970 if (((chars_printed - 1) / width + 2) * width >= chars_per_line)
1971 fputs_filtered ("\n", gdb_stdout);
1972
1973 if (width >= chars_per_line)
1974 width = chars_per_line - 1;
1975
1976 stringlen = strlen (string);
1977
1978 if (chars_printed > 0)
1979 spaces = width - (chars_printed - 1) % width - 1;
1980 if (right)
1981 spaces += width - stringlen;
1982
1983 spacebuf = alloca (spaces + 1);
1984 spacebuf[spaces] = '\0';
1985 while (spaces--)
1986 spacebuf[spaces] = ' ';
1987
1988 fputs_filtered (spacebuf, gdb_stdout);
1989 fputs_filtered (string, gdb_stdout);
1990 }
1991
1992
1993 /* Ensure that whatever gets printed next, using the filtered output
1994 commands, starts at the beginning of the line. I.E. if there is
1995 any pending output for the current line, flush it and start a new
1996 line. Otherwise do nothing. */
1997
1998 void
1999 begin_line (void)
2000 {
2001 if (chars_printed > 0)
2002 {
2003 puts_filtered ("\n");
2004 }
2005 }
2006
2007
2008 /* Like fputs but if FILTER is true, pause after every screenful.
2009
2010 Regardless of FILTER can wrap at points other than the final
2011 character of a line.
2012
2013 Unlike fputs, fputs_maybe_filtered does not return a value.
2014 It is OK for LINEBUFFER to be NULL, in which case just don't print
2015 anything.
2016
2017 Note that a longjmp to top level may occur in this routine (only if
2018 FILTER is true) (since prompt_for_continue may do so) so this
2019 routine should not be called when cleanups are not in place. */
2020
2021 static void
2022 fputs_maybe_filtered (const char *linebuffer, struct ui_file *stream,
2023 int filter)
2024 {
2025 const char *lineptr;
2026
2027 if (linebuffer == 0)
2028 return;
2029
2030 /* Don't do any filtering if it is disabled. */
2031 if ((stream != gdb_stdout) || !pagination_enabled
2032 || (lines_per_page == UINT_MAX && chars_per_line == UINT_MAX))
2033 {
2034 fputs_unfiltered (linebuffer, stream);
2035 return;
2036 }
2037
2038 /* Go through and output each character. Show line extension
2039 when this is necessary; prompt user for new page when this is
2040 necessary. */
2041
2042 lineptr = linebuffer;
2043 while (*lineptr)
2044 {
2045 /* Possible new page. */
2046 if (filter && (lines_printed >= lines_per_page - 1))
2047 prompt_for_continue ();
2048
2049 while (*lineptr && *lineptr != '\n')
2050 {
2051 /* Print a single line. */
2052 if (*lineptr == '\t')
2053 {
2054 if (wrap_column)
2055 *wrap_pointer++ = '\t';
2056 else
2057 fputc_unfiltered ('\t', stream);
2058 /* Shifting right by 3 produces the number of tab stops
2059 we have already passed, and then adding one and
2060 shifting left 3 advances to the next tab stop. */
2061 chars_printed = ((chars_printed >> 3) + 1) << 3;
2062 lineptr++;
2063 }
2064 else
2065 {
2066 if (wrap_column)
2067 *wrap_pointer++ = *lineptr;
2068 else
2069 fputc_unfiltered (*lineptr, stream);
2070 chars_printed++;
2071 lineptr++;
2072 }
2073
2074 if (chars_printed >= chars_per_line)
2075 {
2076 unsigned int save_chars = chars_printed;
2077
2078 chars_printed = 0;
2079 lines_printed++;
2080 /* If we aren't actually wrapping, don't output newline --
2081 if chars_per_line is right, we probably just overflowed
2082 anyway; if it's wrong, let us keep going. */
2083 if (wrap_column)
2084 fputc_unfiltered ('\n', stream);
2085
2086 /* Possible new page. */
2087 if (lines_printed >= lines_per_page - 1)
2088 prompt_for_continue ();
2089
2090 /* Now output indentation and wrapped string */
2091 if (wrap_column)
2092 {
2093 fputs_unfiltered (wrap_indent, stream);
2094 *wrap_pointer = '\0'; /* Null-terminate saved stuff */
2095 fputs_unfiltered (wrap_buffer, stream); /* and eject it */
2096 /* FIXME, this strlen is what prevents wrap_indent from
2097 containing tabs. However, if we recurse to print it
2098 and count its chars, we risk trouble if wrap_indent is
2099 longer than (the user settable) chars_per_line.
2100 Note also that this can set chars_printed > chars_per_line
2101 if we are printing a long string. */
2102 chars_printed = strlen (wrap_indent)
2103 + (save_chars - wrap_column);
2104 wrap_pointer = wrap_buffer; /* Reset buffer */
2105 wrap_buffer[0] = '\0';
2106 wrap_column = 0; /* And disable fancy wrap */
2107 }
2108 }
2109 }
2110
2111 if (*lineptr == '\n')
2112 {
2113 chars_printed = 0;
2114 wrap_here ((char *) 0); /* Spit out chars, cancel further wraps */
2115 lines_printed++;
2116 fputc_unfiltered ('\n', stream);
2117 lineptr++;
2118 }
2119 }
2120 }
2121
2122 void
2123 fputs_filtered (const char *linebuffer, struct ui_file *stream)
2124 {
2125 fputs_maybe_filtered (linebuffer, stream, 1);
2126 }
2127
2128 int
2129 putchar_unfiltered (int c)
2130 {
2131 char buf = c;
2132 ui_file_write (gdb_stdout, &buf, 1);
2133 return c;
2134 }
2135
2136 /* Write character C to gdb_stdout using GDB's paging mechanism and return C.
2137 May return nonlocally. */
2138
2139 int
2140 putchar_filtered (int c)
2141 {
2142 return fputc_filtered (c, gdb_stdout);
2143 }
2144
2145 int
2146 fputc_unfiltered (int c, struct ui_file *stream)
2147 {
2148 char buf = c;
2149 ui_file_write (stream, &buf, 1);
2150 return c;
2151 }
2152
2153 int
2154 fputc_filtered (int c, struct ui_file *stream)
2155 {
2156 char buf[2];
2157
2158 buf[0] = c;
2159 buf[1] = 0;
2160 fputs_filtered (buf, stream);
2161 return c;
2162 }
2163
2164 /* puts_debug is like fputs_unfiltered, except it prints special
2165 characters in printable fashion. */
2166
2167 void
2168 puts_debug (char *prefix, char *string, char *suffix)
2169 {
2170 int ch;
2171
2172 /* Print prefix and suffix after each line. */
2173 static int new_line = 1;
2174 static int return_p = 0;
2175 static char *prev_prefix = "";
2176 static char *prev_suffix = "";
2177
2178 if (*string == '\n')
2179 return_p = 0;
2180
2181 /* If the prefix is changing, print the previous suffix, a new line,
2182 and the new prefix. */
2183 if ((return_p || (strcmp (prev_prefix, prefix) != 0)) && !new_line)
2184 {
2185 fputs_unfiltered (prev_suffix, gdb_stdlog);
2186 fputs_unfiltered ("\n", gdb_stdlog);
2187 fputs_unfiltered (prefix, gdb_stdlog);
2188 }
2189
2190 /* Print prefix if we printed a newline during the previous call. */
2191 if (new_line)
2192 {
2193 new_line = 0;
2194 fputs_unfiltered (prefix, gdb_stdlog);
2195 }
2196
2197 prev_prefix = prefix;
2198 prev_suffix = suffix;
2199
2200 /* Output characters in a printable format. */
2201 while ((ch = *string++) != '\0')
2202 {
2203 switch (ch)
2204 {
2205 default:
2206 if (isprint (ch))
2207 fputc_unfiltered (ch, gdb_stdlog);
2208
2209 else
2210 fprintf_unfiltered (gdb_stdlog, "\\x%02x", ch & 0xff);
2211 break;
2212
2213 case '\\':
2214 fputs_unfiltered ("\\\\", gdb_stdlog);
2215 break;
2216 case '\b':
2217 fputs_unfiltered ("\\b", gdb_stdlog);
2218 break;
2219 case '\f':
2220 fputs_unfiltered ("\\f", gdb_stdlog);
2221 break;
2222 case '\n':
2223 new_line = 1;
2224 fputs_unfiltered ("\\n", gdb_stdlog);
2225 break;
2226 case '\r':
2227 fputs_unfiltered ("\\r", gdb_stdlog);
2228 break;
2229 case '\t':
2230 fputs_unfiltered ("\\t", gdb_stdlog);
2231 break;
2232 case '\v':
2233 fputs_unfiltered ("\\v", gdb_stdlog);
2234 break;
2235 }
2236
2237 return_p = ch == '\r';
2238 }
2239
2240 /* Print suffix if we printed a newline. */
2241 if (new_line)
2242 {
2243 fputs_unfiltered (suffix, gdb_stdlog);
2244 fputs_unfiltered ("\n", gdb_stdlog);
2245 }
2246 }
2247
2248
2249 /* Print a variable number of ARGS using format FORMAT. If this
2250 information is going to put the amount written (since the last call
2251 to REINITIALIZE_MORE_FILTER or the last page break) over the page size,
2252 call prompt_for_continue to get the users permision to continue.
2253
2254 Unlike fprintf, this function does not return a value.
2255
2256 We implement three variants, vfprintf (takes a vararg list and stream),
2257 fprintf (takes a stream to write on), and printf (the usual).
2258
2259 Note also that a longjmp to top level may occur in this routine
2260 (since prompt_for_continue may do so) so this routine should not be
2261 called when cleanups are not in place. */
2262
2263 static void
2264 vfprintf_maybe_filtered (struct ui_file *stream, const char *format,
2265 va_list args, int filter)
2266 {
2267 char *linebuffer;
2268 struct cleanup *old_cleanups;
2269
2270 linebuffer = xstrvprintf (format, args);
2271 old_cleanups = make_cleanup (xfree, linebuffer);
2272 fputs_maybe_filtered (linebuffer, stream, filter);
2273 do_cleanups (old_cleanups);
2274 }
2275
2276
2277 void
2278 vfprintf_filtered (struct ui_file *stream, const char *format, va_list args)
2279 {
2280 vfprintf_maybe_filtered (stream, format, args, 1);
2281 }
2282
2283 void
2284 vfprintf_unfiltered (struct ui_file *stream, const char *format, va_list args)
2285 {
2286 char *linebuffer;
2287 struct cleanup *old_cleanups;
2288
2289 linebuffer = xstrvprintf (format, args);
2290 old_cleanups = make_cleanup (xfree, linebuffer);
2291 if (debug_timestamp && stream == gdb_stdlog)
2292 {
2293 struct timeval tm;
2294 char *timestamp;
2295 int len, need_nl;
2296
2297 gettimeofday (&tm, NULL);
2298
2299 len = strlen (linebuffer);
2300 need_nl = (len > 0 && linebuffer[len - 1] != '\n');
2301
2302 timestamp = xstrprintf ("%ld:%ld %s%s",
2303 (long) tm.tv_sec, (long) tm.tv_usec,
2304 linebuffer,
2305 need_nl ? "\n": "");
2306 make_cleanup (xfree, timestamp);
2307 fputs_unfiltered (timestamp, stream);
2308 }
2309 else
2310 fputs_unfiltered (linebuffer, stream);
2311 do_cleanups (old_cleanups);
2312 }
2313
2314 void
2315 vprintf_filtered (const char *format, va_list args)
2316 {
2317 vfprintf_maybe_filtered (gdb_stdout, format, args, 1);
2318 }
2319
2320 void
2321 vprintf_unfiltered (const char *format, va_list args)
2322 {
2323 vfprintf_unfiltered (gdb_stdout, format, args);
2324 }
2325
2326 void
2327 fprintf_filtered (struct ui_file *stream, const char *format, ...)
2328 {
2329 va_list args;
2330 va_start (args, format);
2331 vfprintf_filtered (stream, format, args);
2332 va_end (args);
2333 }
2334
2335 void
2336 fprintf_unfiltered (struct ui_file *stream, const char *format, ...)
2337 {
2338 va_list args;
2339 va_start (args, format);
2340 vfprintf_unfiltered (stream, format, args);
2341 va_end (args);
2342 }
2343
2344 /* Like fprintf_filtered, but prints its result indented.
2345 Called as fprintfi_filtered (spaces, stream, format, ...); */
2346
2347 void
2348 fprintfi_filtered (int spaces, struct ui_file *stream, const char *format,
2349 ...)
2350 {
2351 va_list args;
2352 va_start (args, format);
2353 print_spaces_filtered (spaces, stream);
2354
2355 vfprintf_filtered (stream, format, args);
2356 va_end (args);
2357 }
2358
2359
2360 void
2361 printf_filtered (const char *format, ...)
2362 {
2363 va_list args;
2364 va_start (args, format);
2365 vfprintf_filtered (gdb_stdout, format, args);
2366 va_end (args);
2367 }
2368
2369
2370 void
2371 printf_unfiltered (const char *format, ...)
2372 {
2373 va_list args;
2374 va_start (args, format);
2375 vfprintf_unfiltered (gdb_stdout, format, args);
2376 va_end (args);
2377 }
2378
2379 /* Like printf_filtered, but prints it's result indented.
2380 Called as printfi_filtered (spaces, format, ...); */
2381
2382 void
2383 printfi_filtered (int spaces, const char *format, ...)
2384 {
2385 va_list args;
2386 va_start (args, format);
2387 print_spaces_filtered (spaces, gdb_stdout);
2388 vfprintf_filtered (gdb_stdout, format, args);
2389 va_end (args);
2390 }
2391
2392 /* Easy -- but watch out!
2393
2394 This routine is *not* a replacement for puts()! puts() appends a newline.
2395 This one doesn't, and had better not! */
2396
2397 void
2398 puts_filtered (const char *string)
2399 {
2400 fputs_filtered (string, gdb_stdout);
2401 }
2402
2403 void
2404 puts_unfiltered (const char *string)
2405 {
2406 fputs_unfiltered (string, gdb_stdout);
2407 }
2408
2409 /* Return a pointer to N spaces and a null. The pointer is good
2410 until the next call to here. */
2411 char *
2412 n_spaces (int n)
2413 {
2414 char *t;
2415 static char *spaces = 0;
2416 static int max_spaces = -1;
2417
2418 if (n > max_spaces)
2419 {
2420 if (spaces)
2421 xfree (spaces);
2422 spaces = (char *) xmalloc (n + 1);
2423 for (t = spaces + n; t != spaces;)
2424 *--t = ' ';
2425 spaces[n] = '\0';
2426 max_spaces = n;
2427 }
2428
2429 return spaces + max_spaces - n;
2430 }
2431
2432 /* Print N spaces. */
2433 void
2434 print_spaces_filtered (int n, struct ui_file *stream)
2435 {
2436 fputs_filtered (n_spaces (n), stream);
2437 }
2438 \f
2439 /* C++/ObjC demangler stuff. */
2440
2441 /* fprintf_symbol_filtered attempts to demangle NAME, a symbol in language
2442 LANG, using demangling args ARG_MODE, and print it filtered to STREAM.
2443 If the name is not mangled, or the language for the name is unknown, or
2444 demangling is off, the name is printed in its "raw" form. */
2445
2446 void
2447 fprintf_symbol_filtered (struct ui_file *stream, char *name,
2448 enum language lang, int arg_mode)
2449 {
2450 char *demangled;
2451
2452 if (name != NULL)
2453 {
2454 /* If user wants to see raw output, no problem. */
2455 if (!demangle)
2456 {
2457 fputs_filtered (name, stream);
2458 }
2459 else
2460 {
2461 demangled = language_demangle (language_def (lang), name, arg_mode);
2462 fputs_filtered (demangled ? demangled : name, stream);
2463 if (demangled != NULL)
2464 {
2465 xfree (demangled);
2466 }
2467 }
2468 }
2469 }
2470
2471 /* Do a strcmp() type operation on STRING1 and STRING2, ignoring any
2472 differences in whitespace. Returns 0 if they match, non-zero if they
2473 don't (slightly different than strcmp()'s range of return values).
2474
2475 As an extra hack, string1=="FOO(ARGS)" matches string2=="FOO".
2476 This "feature" is useful when searching for matching C++ function names
2477 (such as if the user types 'break FOO', where FOO is a mangled C++
2478 function). */
2479
2480 int
2481 strcmp_iw (const char *string1, const char *string2)
2482 {
2483 while ((*string1 != '\0') && (*string2 != '\0'))
2484 {
2485 while (isspace (*string1))
2486 {
2487 string1++;
2488 }
2489 while (isspace (*string2))
2490 {
2491 string2++;
2492 }
2493 if (*string1 != *string2)
2494 {
2495 break;
2496 }
2497 if (*string1 != '\0')
2498 {
2499 string1++;
2500 string2++;
2501 }
2502 }
2503 return (*string1 != '\0' && *string1 != '(') || (*string2 != '\0');
2504 }
2505
2506 /* This is like strcmp except that it ignores whitespace and treats
2507 '(' as the first non-NULL character in terms of ordering. Like
2508 strcmp (and unlike strcmp_iw), it returns negative if STRING1 <
2509 STRING2, 0 if STRING2 = STRING2, and positive if STRING1 > STRING2
2510 according to that ordering.
2511
2512 If a list is sorted according to this function and if you want to
2513 find names in the list that match some fixed NAME according to
2514 strcmp_iw(LIST_ELT, NAME), then the place to start looking is right
2515 where this function would put NAME.
2516
2517 Here are some examples of why using strcmp to sort is a bad idea:
2518
2519 Whitespace example:
2520
2521 Say your partial symtab contains: "foo<char *>", "goo". Then, if
2522 we try to do a search for "foo<char*>", strcmp will locate this
2523 after "foo<char *>" and before "goo". Then lookup_partial_symbol
2524 will start looking at strings beginning with "goo", and will never
2525 see the correct match of "foo<char *>".
2526
2527 Parenthesis example:
2528
2529 In practice, this is less like to be an issue, but I'll give it a
2530 shot. Let's assume that '$' is a legitimate character to occur in
2531 symbols. (Which may well even be the case on some systems.) Then
2532 say that the partial symbol table contains "foo$" and "foo(int)".
2533 strcmp will put them in this order, since '$' < '('. Now, if the
2534 user searches for "foo", then strcmp will sort "foo" before "foo$".
2535 Then lookup_partial_symbol will notice that strcmp_iw("foo$",
2536 "foo") is false, so it won't proceed to the actual match of
2537 "foo(int)" with "foo". */
2538
2539 int
2540 strcmp_iw_ordered (const char *string1, const char *string2)
2541 {
2542 while ((*string1 != '\0') && (*string2 != '\0'))
2543 {
2544 while (isspace (*string1))
2545 {
2546 string1++;
2547 }
2548 while (isspace (*string2))
2549 {
2550 string2++;
2551 }
2552 if (*string1 != *string2)
2553 {
2554 break;
2555 }
2556 if (*string1 != '\0')
2557 {
2558 string1++;
2559 string2++;
2560 }
2561 }
2562
2563 switch (*string1)
2564 {
2565 /* Characters are non-equal unless they're both '\0'; we want to
2566 make sure we get the comparison right according to our
2567 comparison in the cases where one of them is '\0' or '('. */
2568 case '\0':
2569 if (*string2 == '\0')
2570 return 0;
2571 else
2572 return -1;
2573 case '(':
2574 if (*string2 == '\0')
2575 return 1;
2576 else
2577 return -1;
2578 default:
2579 if (*string2 == '(')
2580 return 1;
2581 else
2582 return *string1 - *string2;
2583 }
2584 }
2585
2586 /* A simple comparison function with opposite semantics to strcmp. */
2587
2588 int
2589 streq (const char *lhs, const char *rhs)
2590 {
2591 return !strcmp (lhs, rhs);
2592 }
2593 \f
2594
2595 /*
2596 ** subset_compare()
2597 ** Answer whether string_to_compare is a full or partial match to
2598 ** template_string. The partial match must be in sequence starting
2599 ** at index 0.
2600 */
2601 int
2602 subset_compare (char *string_to_compare, char *template_string)
2603 {
2604 int match;
2605 if (template_string != (char *) NULL && string_to_compare != (char *) NULL
2606 && strlen (string_to_compare) <= strlen (template_string))
2607 match =
2608 (strncmp
2609 (template_string, string_to_compare, strlen (string_to_compare)) == 0);
2610 else
2611 match = 0;
2612 return match;
2613 }
2614
2615 static void
2616 pagination_on_command (char *arg, int from_tty)
2617 {
2618 pagination_enabled = 1;
2619 }
2620
2621 static void
2622 pagination_off_command (char *arg, int from_tty)
2623 {
2624 pagination_enabled = 0;
2625 }
2626
2627 static void
2628 show_debug_timestamp (struct ui_file *file, int from_tty,
2629 struct cmd_list_element *c, const char *value)
2630 {
2631 fprintf_filtered (file, _("Timestamping debugging messages is %s.\n"), value);
2632 }
2633 \f
2634
2635 void
2636 initialize_utils (void)
2637 {
2638 struct cmd_list_element *c;
2639
2640 add_setshow_uinteger_cmd ("width", class_support, &chars_per_line, _("\
2641 Set number of characters gdb thinks are in a line."), _("\
2642 Show number of characters gdb thinks are in a line."), NULL,
2643 set_width_command,
2644 show_chars_per_line,
2645 &setlist, &showlist);
2646
2647 add_setshow_uinteger_cmd ("height", class_support, &lines_per_page, _("\
2648 Set number of lines gdb thinks are in a page."), _("\
2649 Show number of lines gdb thinks are in a page."), NULL,
2650 set_height_command,
2651 show_lines_per_page,
2652 &setlist, &showlist);
2653
2654 init_page_info ();
2655
2656 add_setshow_boolean_cmd ("demangle", class_support, &demangle, _("\
2657 Set demangling of encoded C++/ObjC names when displaying symbols."), _("\
2658 Show demangling of encoded C++/ObjC names when displaying symbols."), NULL,
2659 NULL,
2660 show_demangle,
2661 &setprintlist, &showprintlist);
2662
2663 add_setshow_boolean_cmd ("pagination", class_support,
2664 &pagination_enabled, _("\
2665 Set state of pagination."), _("\
2666 Show state of pagination."), NULL,
2667 NULL,
2668 show_pagination_enabled,
2669 &setlist, &showlist);
2670
2671 if (xdb_commands)
2672 {
2673 add_com ("am", class_support, pagination_on_command,
2674 _("Enable pagination"));
2675 add_com ("sm", class_support, pagination_off_command,
2676 _("Disable pagination"));
2677 }
2678
2679 add_setshow_boolean_cmd ("sevenbit-strings", class_support,
2680 &sevenbit_strings, _("\
2681 Set printing of 8-bit characters in strings as \\nnn."), _("\
2682 Show printing of 8-bit characters in strings as \\nnn."), NULL,
2683 NULL,
2684 show_sevenbit_strings,
2685 &setprintlist, &showprintlist);
2686
2687 add_setshow_boolean_cmd ("asm-demangle", class_support, &asm_demangle, _("\
2688 Set demangling of C++/ObjC names in disassembly listings."), _("\
2689 Show demangling of C++/ObjC names in disassembly listings."), NULL,
2690 NULL,
2691 show_asm_demangle,
2692 &setprintlist, &showprintlist);
2693
2694 add_setshow_boolean_cmd ("timestamp", class_maintenance,
2695 &debug_timestamp, _("\
2696 Set timestamping of debugging messages."), _("\
2697 Show timestamping of debugging messages."), _("\
2698 When set, debugging messages will be marked with seconds and microseconds."),
2699 NULL,
2700 show_debug_timestamp,
2701 &setdebuglist, &showdebuglist);
2702 }
2703
2704 /* Machine specific function to handle SIGWINCH signal. */
2705
2706 #ifdef SIGWINCH_HANDLER_BODY
2707 SIGWINCH_HANDLER_BODY
2708 #endif
2709 /* print routines to handle variable size regs, etc. */
2710 /* temporary storage using circular buffer */
2711 #define NUMCELLS 16
2712 #define CELLSIZE 50
2713 static char *
2714 get_cell (void)
2715 {
2716 static char buf[NUMCELLS][CELLSIZE];
2717 static int cell = 0;
2718 if (++cell >= NUMCELLS)
2719 cell = 0;
2720 return buf[cell];
2721 }
2722
2723 int
2724 strlen_paddr (void)
2725 {
2726 return (gdbarch_addr_bit (current_gdbarch) / 8 * 2);
2727 }
2728
2729 char *
2730 paddr (CORE_ADDR addr)
2731 {
2732 return phex (addr, gdbarch_addr_bit (current_gdbarch) / 8);
2733 }
2734
2735 char *
2736 paddr_nz (CORE_ADDR addr)
2737 {
2738 return phex_nz (addr, gdbarch_addr_bit (current_gdbarch) / 8);
2739 }
2740
2741 const char *
2742 paddress (CORE_ADDR addr)
2743 {
2744 /* Truncate address to the size of a target address, avoiding shifts
2745 larger or equal than the width of a CORE_ADDR. The local
2746 variable ADDR_BIT stops the compiler reporting a shift overflow
2747 when it won't occur. */
2748 /* NOTE: This assumes that the significant address information is
2749 kept in the least significant bits of ADDR - the upper bits were
2750 either zero or sign extended. Should gdbarch_address_to_pointer or
2751 some ADDRESS_TO_PRINTABLE() be used to do the conversion? */
2752
2753 int addr_bit = gdbarch_addr_bit (current_gdbarch);
2754
2755 if (addr_bit < (sizeof (CORE_ADDR) * HOST_CHAR_BIT))
2756 addr &= ((CORE_ADDR) 1 << addr_bit) - 1;
2757 return hex_string (addr);
2758 }
2759
2760 static char *
2761 decimal2str (char *sign, ULONGEST addr, int width)
2762 {
2763 /* Steal code from valprint.c:print_decimal(). Should this worry
2764 about the real size of addr as the above does? */
2765 unsigned long temp[3];
2766 char *str = get_cell ();
2767
2768 int i = 0;
2769 do
2770 {
2771 temp[i] = addr % (1000 * 1000 * 1000);
2772 addr /= (1000 * 1000 * 1000);
2773 i++;
2774 width -= 9;
2775 }
2776 while (addr != 0 && i < (sizeof (temp) / sizeof (temp[0])));
2777
2778 width += 9;
2779 if (width < 0)
2780 width = 0;
2781
2782 switch (i)
2783 {
2784 case 1:
2785 xsnprintf (str, CELLSIZE, "%s%0*lu", sign, width, temp[0]);
2786 break;
2787 case 2:
2788 xsnprintf (str, CELLSIZE, "%s%0*lu%09lu", sign, width,
2789 temp[1], temp[0]);
2790 break;
2791 case 3:
2792 xsnprintf (str, CELLSIZE, "%s%0*lu%09lu%09lu", sign, width,
2793 temp[2], temp[1], temp[0]);
2794 break;
2795 default:
2796 internal_error (__FILE__, __LINE__,
2797 _("failed internal consistency check"));
2798 }
2799
2800 return str;
2801 }
2802
2803 static char *
2804 octal2str (ULONGEST addr, int width)
2805 {
2806 unsigned long temp[3];
2807 char *str = get_cell ();
2808
2809 int i = 0;
2810 do
2811 {
2812 temp[i] = addr % (0100000 * 0100000);
2813 addr /= (0100000 * 0100000);
2814 i++;
2815 width -= 10;
2816 }
2817 while (addr != 0 && i < (sizeof (temp) / sizeof (temp[0])));
2818
2819 width += 10;
2820 if (width < 0)
2821 width = 0;
2822
2823 switch (i)
2824 {
2825 case 1:
2826 if (temp[0] == 0)
2827 xsnprintf (str, CELLSIZE, "%*o", width, 0);
2828 else
2829 xsnprintf (str, CELLSIZE, "0%0*lo", width, temp[0]);
2830 break;
2831 case 2:
2832 xsnprintf (str, CELLSIZE, "0%0*lo%010lo", width, temp[1], temp[0]);
2833 break;
2834 case 3:
2835 xsnprintf (str, CELLSIZE, "0%0*lo%010lo%010lo", width,
2836 temp[2], temp[1], temp[0]);
2837 break;
2838 default:
2839 internal_error (__FILE__, __LINE__,
2840 _("failed internal consistency check"));
2841 }
2842
2843 return str;
2844 }
2845
2846 char *
2847 pulongest (ULONGEST u)
2848 {
2849 return decimal2str ("", u, 0);
2850 }
2851
2852 char *
2853 plongest (LONGEST l)
2854 {
2855 if (l < 0)
2856 return decimal2str ("-", -l, 0);
2857 else
2858 return decimal2str ("", l, 0);
2859 }
2860
2861 /* Eliminate warning from compiler on 32-bit systems. */
2862 static int thirty_two = 32;
2863
2864 char *
2865 phex (ULONGEST l, int sizeof_l)
2866 {
2867 char *str;
2868
2869 switch (sizeof_l)
2870 {
2871 case 8:
2872 str = get_cell ();
2873 xsnprintf (str, CELLSIZE, "%08lx%08lx",
2874 (unsigned long) (l >> thirty_two),
2875 (unsigned long) (l & 0xffffffff));
2876 break;
2877 case 4:
2878 str = get_cell ();
2879 xsnprintf (str, CELLSIZE, "%08lx", (unsigned long) l);
2880 break;
2881 case 2:
2882 str = get_cell ();
2883 xsnprintf (str, CELLSIZE, "%04x", (unsigned short) (l & 0xffff));
2884 break;
2885 default:
2886 str = phex (l, sizeof (l));
2887 break;
2888 }
2889
2890 return str;
2891 }
2892
2893 char *
2894 phex_nz (ULONGEST l, int sizeof_l)
2895 {
2896 char *str;
2897
2898 switch (sizeof_l)
2899 {
2900 case 8:
2901 {
2902 unsigned long high = (unsigned long) (l >> thirty_two);
2903 str = get_cell ();
2904 if (high == 0)
2905 xsnprintf (str, CELLSIZE, "%lx",
2906 (unsigned long) (l & 0xffffffff));
2907 else
2908 xsnprintf (str, CELLSIZE, "%lx%08lx", high,
2909 (unsigned long) (l & 0xffffffff));
2910 break;
2911 }
2912 case 4:
2913 str = get_cell ();
2914 xsnprintf (str, CELLSIZE, "%lx", (unsigned long) l);
2915 break;
2916 case 2:
2917 str = get_cell ();
2918 xsnprintf (str, CELLSIZE, "%x", (unsigned short) (l & 0xffff));
2919 break;
2920 default:
2921 str = phex_nz (l, sizeof (l));
2922 break;
2923 }
2924
2925 return str;
2926 }
2927
2928 /* Converts a LONGEST to a C-format hexadecimal literal and stores it
2929 in a static string. Returns a pointer to this string. */
2930 char *
2931 hex_string (LONGEST num)
2932 {
2933 char *result = get_cell ();
2934 xsnprintf (result, CELLSIZE, "0x%s", phex_nz (num, sizeof (num)));
2935 return result;
2936 }
2937
2938 /* Converts a LONGEST number to a C-format hexadecimal literal and
2939 stores it in a static string. Returns a pointer to this string
2940 that is valid until the next call. The number is padded on the
2941 left with 0s to at least WIDTH characters. */
2942 char *
2943 hex_string_custom (LONGEST num, int width)
2944 {
2945 char *result = get_cell ();
2946 char *result_end = result + CELLSIZE - 1;
2947 const char *hex = phex_nz (num, sizeof (num));
2948 int hex_len = strlen (hex);
2949
2950 if (hex_len > width)
2951 width = hex_len;
2952 if (width + 2 >= CELLSIZE)
2953 internal_error (__FILE__, __LINE__,
2954 _("hex_string_custom: insufficient space to store result"));
2955
2956 strcpy (result_end - width - 2, "0x");
2957 memset (result_end - width, '0', width);
2958 strcpy (result_end - hex_len, hex);
2959 return result_end - width - 2;
2960 }
2961
2962 /* Convert VAL to a numeral in the given radix. For
2963 * radix 10, IS_SIGNED may be true, indicating a signed quantity;
2964 * otherwise VAL is interpreted as unsigned. If WIDTH is supplied,
2965 * it is the minimum width (0-padded if needed). USE_C_FORMAT means
2966 * to use C format in all cases. If it is false, then 'x'
2967 * and 'o' formats do not include a prefix (0x or leading 0). */
2968
2969 char *
2970 int_string (LONGEST val, int radix, int is_signed, int width,
2971 int use_c_format)
2972 {
2973 switch (radix)
2974 {
2975 case 16:
2976 {
2977 char *result;
2978 if (width == 0)
2979 result = hex_string (val);
2980 else
2981 result = hex_string_custom (val, width);
2982 if (! use_c_format)
2983 result += 2;
2984 return result;
2985 }
2986 case 10:
2987 {
2988 if (is_signed && val < 0)
2989 return decimal2str ("-", -val, width);
2990 else
2991 return decimal2str ("", val, width);
2992 }
2993 case 8:
2994 {
2995 char *result = octal2str (val, width);
2996 if (use_c_format || val == 0)
2997 return result;
2998 else
2999 return result + 1;
3000 }
3001 default:
3002 internal_error (__FILE__, __LINE__,
3003 _("failed internal consistency check"));
3004 }
3005 }
3006
3007 /* Convert a CORE_ADDR into a string. */
3008 const char *
3009 core_addr_to_string (const CORE_ADDR addr)
3010 {
3011 char *str = get_cell ();
3012 strcpy (str, "0x");
3013 strcat (str, phex (addr, sizeof (addr)));
3014 return str;
3015 }
3016
3017 const char *
3018 core_addr_to_string_nz (const CORE_ADDR addr)
3019 {
3020 char *str = get_cell ();
3021 strcpy (str, "0x");
3022 strcat (str, phex_nz (addr, sizeof (addr)));
3023 return str;
3024 }
3025
3026 /* Convert a string back into a CORE_ADDR. */
3027 CORE_ADDR
3028 string_to_core_addr (const char *my_string)
3029 {
3030 int addr_bit = gdbarch_addr_bit (current_gdbarch);
3031 CORE_ADDR addr = 0;
3032
3033 if (my_string[0] == '0' && tolower (my_string[1]) == 'x')
3034 {
3035 /* Assume that it is in hex. */
3036 int i;
3037 for (i = 2; my_string[i] != '\0'; i++)
3038 {
3039 if (isdigit (my_string[i]))
3040 addr = (my_string[i] - '0') + (addr * 16);
3041 else if (isxdigit (my_string[i]))
3042 addr = (tolower (my_string[i]) - 'a' + 0xa) + (addr * 16);
3043 else
3044 error (_("invalid hex \"%s\""), my_string);
3045 }
3046
3047 /* Not very modular, but if the executable format expects
3048 addresses to be sign-extended, then do so if the address was
3049 specified with only 32 significant bits. Really this should
3050 be determined by the target architecture, not by the object
3051 file. */
3052 if (i - 2 == addr_bit / 4
3053 && exec_bfd
3054 && bfd_get_sign_extend_vma (exec_bfd))
3055 addr = (addr ^ ((CORE_ADDR) 1 << (addr_bit - 1)))
3056 - ((CORE_ADDR) 1 << (addr_bit - 1));
3057 }
3058 else
3059 {
3060 /* Assume that it is in decimal. */
3061 int i;
3062 for (i = 0; my_string[i] != '\0'; i++)
3063 {
3064 if (isdigit (my_string[i]))
3065 addr = (my_string[i] - '0') + (addr * 10);
3066 else
3067 error (_("invalid decimal \"%s\""), my_string);
3068 }
3069 }
3070
3071 return addr;
3072 }
3073
3074 const char *
3075 host_address_to_string (const void *addr)
3076 {
3077 char *str = get_cell ();
3078 sprintf (str, "0x%lx", (unsigned long) addr);
3079 return str;
3080 }
3081
3082 char *
3083 gdb_realpath (const char *filename)
3084 {
3085 /* Method 1: The system has a compile time upper bound on a filename
3086 path. Use that and realpath() to canonicalize the name. This is
3087 the most common case. Note that, if there isn't a compile time
3088 upper bound, you want to avoid realpath() at all costs. */
3089 #if defined(HAVE_REALPATH)
3090 {
3091 # if defined (PATH_MAX)
3092 char buf[PATH_MAX];
3093 # define USE_REALPATH
3094 # elif defined (MAXPATHLEN)
3095 char buf[MAXPATHLEN];
3096 # define USE_REALPATH
3097 # endif
3098 # if defined (USE_REALPATH)
3099 const char *rp = realpath (filename, buf);
3100 if (rp == NULL)
3101 rp = filename;
3102 return xstrdup (rp);
3103 # endif
3104 }
3105 #endif /* HAVE_REALPATH */
3106
3107 /* Method 2: The host system (i.e., GNU) has the function
3108 canonicalize_file_name() which malloc's a chunk of memory and
3109 returns that, use that. */
3110 #if defined(HAVE_CANONICALIZE_FILE_NAME)
3111 {
3112 char *rp = canonicalize_file_name (filename);
3113 if (rp == NULL)
3114 return xstrdup (filename);
3115 else
3116 return rp;
3117 }
3118 #endif
3119
3120 /* FIXME: cagney/2002-11-13:
3121
3122 Method 2a: Use realpath() with a NULL buffer. Some systems, due
3123 to the problems described in in method 3, have modified their
3124 realpath() implementation so that it will allocate a buffer when
3125 NULL is passed in. Before this can be used, though, some sort of
3126 configure time test would need to be added. Otherwize the code
3127 will likely core dump. */
3128
3129 /* Method 3: Now we're getting desperate! The system doesn't have a
3130 compile time buffer size and no alternative function. Query the
3131 OS, using pathconf(), for the buffer limit. Care is needed
3132 though, some systems do not limit PATH_MAX (return -1 for
3133 pathconf()) making it impossible to pass a correctly sized buffer
3134 to realpath() (it could always overflow). On those systems, we
3135 skip this. */
3136 #if defined (HAVE_REALPATH) && defined (HAVE_UNISTD_H) && defined(HAVE_ALLOCA)
3137 {
3138 /* Find out the max path size. */
3139 long path_max = pathconf ("/", _PC_PATH_MAX);
3140 if (path_max > 0)
3141 {
3142 /* PATH_MAX is bounded. */
3143 char *buf = alloca (path_max);
3144 char *rp = realpath (filename, buf);
3145 return xstrdup (rp ? rp : filename);
3146 }
3147 }
3148 #endif
3149
3150 /* This system is a lost cause, just dup the buffer. */
3151 return xstrdup (filename);
3152 }
3153
3154 /* Return a copy of FILENAME, with its directory prefix canonicalized
3155 by gdb_realpath. */
3156
3157 char *
3158 xfullpath (const char *filename)
3159 {
3160 const char *base_name = lbasename (filename);
3161 char *dir_name;
3162 char *real_path;
3163 char *result;
3164
3165 /* Extract the basename of filename, and return immediately
3166 a copy of filename if it does not contain any directory prefix. */
3167 if (base_name == filename)
3168 return xstrdup (filename);
3169
3170 dir_name = alloca ((size_t) (base_name - filename + 2));
3171 /* Allocate enough space to store the dir_name + plus one extra
3172 character sometimes needed under Windows (see below), and
3173 then the closing \000 character */
3174 strncpy (dir_name, filename, base_name - filename);
3175 dir_name[base_name - filename] = '\000';
3176
3177 #ifdef HAVE_DOS_BASED_FILE_SYSTEM
3178 /* We need to be careful when filename is of the form 'd:foo', which
3179 is equivalent of d:./foo, which is totally different from d:/foo. */
3180 if (strlen (dir_name) == 2 && isalpha (dir_name[0]) && dir_name[1] == ':')
3181 {
3182 dir_name[2] = '.';
3183 dir_name[3] = '\000';
3184 }
3185 #endif
3186
3187 /* Canonicalize the directory prefix, and build the resulting
3188 filename. If the dirname realpath already contains an ending
3189 directory separator, avoid doubling it. */
3190 real_path = gdb_realpath (dir_name);
3191 if (IS_DIR_SEPARATOR (real_path[strlen (real_path) - 1]))
3192 result = concat (real_path, base_name, (char *)NULL);
3193 else
3194 result = concat (real_path, SLASH_STRING, base_name, (char *)NULL);
3195
3196 xfree (real_path);
3197 return result;
3198 }
3199
3200
3201 /* This is the 32-bit CRC function used by the GNU separate debug
3202 facility. An executable may contain a section named
3203 .gnu_debuglink, which holds the name of a separate executable file
3204 containing its debug info, and a checksum of that file's contents,
3205 computed using this function. */
3206 unsigned long
3207 gnu_debuglink_crc32 (unsigned long crc, unsigned char *buf, size_t len)
3208 {
3209 static const unsigned long crc32_table[256] = {
3210 0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419,
3211 0x706af48f, 0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4,
3212 0xe0d5e91e, 0x97d2d988, 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07,
3213 0x90bf1d91, 0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de,
3214 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7, 0x136c9856,
3215 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
3216 0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4,
3217 0xa2677172, 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b,
3218 0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940, 0x32d86ce3,
3219 0x45df5c75, 0xdcd60dcf, 0xabd13d59, 0x26d930ac, 0x51de003a,
3220 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423, 0xcfba9599,
3221 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
3222 0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190,
3223 0x01db7106, 0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f,
3224 0x9fbfe4a5, 0xe8b8d433, 0x7807c9a2, 0x0f00f934, 0x9609a88e,
3225 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01,
3226 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e, 0x6c0695ed,
3227 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
3228 0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3,
3229 0xfbd44c65, 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2,
3230 0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a,
3231 0x346ed9fc, 0xad678846, 0xda60b8d0, 0x44042d73, 0x33031de5,
3232 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa, 0xbe0b1010,
3233 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
3234 0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17,
3235 0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6,
3236 0x03b6e20c, 0x74b1d29a, 0xead54739, 0x9dd277af, 0x04db2615,
3237 0x73dc1683, 0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8,
3238 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1, 0xf00f9344,
3239 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
3240 0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a,
3241 0x67dd4acc, 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5,
3242 0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252, 0xd1bb67f1,
3243 0xa6bc5767, 0x3fb506dd, 0x48b2364b, 0xd80d2bda, 0xaf0a1b4c,
3244 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55, 0x316e8eef,
3245 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
3246 0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe,
3247 0xb2bd0b28, 0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31,
3248 0x2cd99e8b, 0x5bdeae1d, 0x9b64c2b0, 0xec63f226, 0x756aa39c,
3249 0x026d930a, 0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713,
3250 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38, 0x92d28e9b,
3251 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
3252 0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1,
3253 0x18b74777, 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c,
3254 0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45, 0xa00ae278,
3255 0xd70dd2ee, 0x4e048354, 0x3903b3c2, 0xa7672661, 0xd06016f7,
3256 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc, 0x40df0b66,
3257 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
3258 0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605,
3259 0xcdd70693, 0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8,
3260 0x5d681b02, 0x2a6f2b94, 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b,
3261 0x2d02ef8d
3262 };
3263 unsigned char *end;
3264
3265 crc = ~crc & 0xffffffff;
3266 for (end = buf + len; buf < end; ++buf)
3267 crc = crc32_table[(crc ^ *buf) & 0xff] ^ (crc >> 8);
3268 return ~crc & 0xffffffff;;
3269 }
3270
3271 ULONGEST
3272 align_up (ULONGEST v, int n)
3273 {
3274 /* Check that N is really a power of two. */
3275 gdb_assert (n && (n & (n-1)) == 0);
3276 return (v + n - 1) & -n;
3277 }
3278
3279 ULONGEST
3280 align_down (ULONGEST v, int n)
3281 {
3282 /* Check that N is really a power of two. */
3283 gdb_assert (n && (n & (n-1)) == 0);
3284 return (v & -n);
3285 }
3286
3287 /* Allocation function for the libiberty hash table which uses an
3288 obstack. The obstack is passed as DATA. */
3289
3290 void *
3291 hashtab_obstack_allocate (void *data, size_t size, size_t count)
3292 {
3293 unsigned int total = size * count;
3294 void *ptr = obstack_alloc ((struct obstack *) data, total);
3295 memset (ptr, 0, total);
3296 return ptr;
3297 }
3298
3299 /* Trivial deallocation function for the libiberty splay tree and hash
3300 table - don't deallocate anything. Rely on later deletion of the
3301 obstack. DATA will be the obstack, although it is not needed
3302 here. */
3303
3304 void
3305 dummy_obstack_deallocate (void *object, void *data)
3306 {
3307 return;
3308 }
3309
3310 /* The bit offset of the highest byte in a ULONGEST, for overflow
3311 checking. */
3312
3313 #define HIGH_BYTE_POSN ((sizeof (ULONGEST) - 1) * HOST_CHAR_BIT)
3314
3315 /* True (non-zero) iff DIGIT is a valid digit in radix BASE,
3316 where 2 <= BASE <= 36. */
3317
3318 static int
3319 is_digit_in_base (unsigned char digit, int base)
3320 {
3321 if (!isalnum (digit))
3322 return 0;
3323 if (base <= 10)
3324 return (isdigit (digit) && digit < base + '0');
3325 else
3326 return (isdigit (digit) || tolower (digit) < base - 10 + 'a');
3327 }
3328
3329 static int
3330 digit_to_int (unsigned char c)
3331 {
3332 if (isdigit (c))
3333 return c - '0';
3334 else
3335 return tolower (c) - 'a' + 10;
3336 }
3337
3338 /* As for strtoul, but for ULONGEST results. */
3339
3340 ULONGEST
3341 strtoulst (const char *num, const char **trailer, int base)
3342 {
3343 unsigned int high_part;
3344 ULONGEST result;
3345 int minus = 0;
3346 int i = 0;
3347
3348 /* Skip leading whitespace. */
3349 while (isspace (num[i]))
3350 i++;
3351
3352 /* Handle prefixes. */
3353 if (num[i] == '+')
3354 i++;
3355 else if (num[i] == '-')
3356 {
3357 minus = 1;
3358 i++;
3359 }
3360
3361 if (base == 0 || base == 16)
3362 {
3363 if (num[i] == '0' && (num[i + 1] == 'x' || num[i + 1] == 'X'))
3364 {
3365 i += 2;
3366 if (base == 0)
3367 base = 16;
3368 }
3369 }
3370
3371 if (base == 0 && num[i] == '0')
3372 base = 8;
3373
3374 if (base == 0)
3375 base = 10;
3376
3377 if (base < 2 || base > 36)
3378 {
3379 errno = EINVAL;
3380 return 0;
3381 }
3382
3383 result = high_part = 0;
3384 for (; is_digit_in_base (num[i], base); i += 1)
3385 {
3386 result = result * base + digit_to_int (num[i]);
3387 high_part = high_part * base + (unsigned int) (result >> HIGH_BYTE_POSN);
3388 result &= ((ULONGEST) 1 << HIGH_BYTE_POSN) - 1;
3389 if (high_part > 0xff)
3390 {
3391 errno = ERANGE;
3392 result = ~ (ULONGEST) 0;
3393 high_part = 0;
3394 minus = 0;
3395 break;
3396 }
3397 }
3398
3399 if (trailer != NULL)
3400 *trailer = &num[i];
3401
3402 result = result + ((ULONGEST) high_part << HIGH_BYTE_POSN);
3403 if (minus)
3404 return -result;
3405 else
3406 return result;
3407 }
3408
3409 /* Simple, portable version of dirname that does not modify its
3410 argument. */
3411
3412 char *
3413 ldirname (const char *filename)
3414 {
3415 const char *base = lbasename (filename);
3416 char *dirname;
3417
3418 while (base > filename && IS_DIR_SEPARATOR (base[-1]))
3419 --base;
3420
3421 if (base == filename)
3422 return NULL;
3423
3424 dirname = xmalloc (base - filename + 2);
3425 memcpy (dirname, filename, base - filename);
3426
3427 /* On DOS based file systems, convert "d:foo" to "d:.", so that we
3428 create "d:./bar" later instead of the (different) "d:/bar". */
3429 if (base - filename == 2 && IS_ABSOLUTE_PATH (base)
3430 && !IS_DIR_SEPARATOR (filename[0]))
3431 dirname[base++ - filename] = '.';
3432
3433 dirname[base - filename] = '\0';
3434 return dirname;
3435 }
3436
3437 /* Call libiberty's buildargv, and return the result.
3438 If buildargv fails due to out-of-memory, call nomem.
3439 Therefore, the returned value is guaranteed to be non-NULL,
3440 unless the parameter itself is NULL. */
3441
3442 char **
3443 gdb_buildargv (const char *s)
3444 {
3445 char **argv = buildargv (s);
3446 if (s != NULL && argv == NULL)
3447 nomem (0);
3448 return argv;
3449 }