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