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