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