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