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