Commit | Line | Data |
---|---|---|
c906108c | 1 | /* General utility routines for GDB, the GNU debugger. |
1bac305b | 2 | |
197e01b6 | 3 | Copyright (C) 1986, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, |
46e9880c DJ |
4 | 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 |
5 | Free Software Foundation, Inc. | |
c906108c | 6 | |
c5aa993b | 7 | This file is part of GDB. |
c906108c | 8 | |
c5aa993b JM |
9 | This program is free software; you can redistribute it and/or modify |
10 | it under the terms of the GNU General Public License as published by | |
11 | the Free Software Foundation; either version 2 of the License, or | |
12 | (at your option) any later version. | |
c906108c | 13 | |
c5aa993b JM |
14 | This program is distributed in the hope that it will be useful, |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
c906108c | 18 | |
c5aa993b JM |
19 | You should have received a copy of the GNU General Public License |
20 | along with this program; if not, write to the Free Software | |
197e01b6 EZ |
21 | Foundation, Inc., 51 Franklin Street, Fifth Floor, |
22 | Boston, MA 02110-1301, USA. */ | |
c906108c | 23 | |
4e8f7a8b DJ |
24 | #include "defs.h" |
25 | #include "gdb_assert.h" | |
26 | #include <ctype.h> | |
27 | #include "gdb_string.h" | |
28 | #include "event-top.h" | |
60250e8b | 29 | #include "exceptions.h" |
4e8f7a8b | 30 | |
6a83354a AC |
31 | #ifdef TUI |
32 | #include "tui/tui.h" /* For tui_get_command_dimension. */ | |
33 | #endif | |
34 | ||
9d271fd8 AC |
35 | #ifdef __GO32__ |
36 | #include <pc.h> | |
37 | #endif | |
38 | ||
c906108c SS |
39 | /* SunOS's curses.h has a '#define reg register' in it. Thank you Sun. */ |
40 | #ifdef reg | |
41 | #undef reg | |
42 | #endif | |
43 | ||
042be3a9 | 44 | #include <signal.h> |
c906108c SS |
45 | #include "gdbcmd.h" |
46 | #include "serial.h" | |
47 | #include "bfd.h" | |
48 | #include "target.h" | |
49 | #include "demangle.h" | |
50 | #include "expression.h" | |
51 | #include "language.h" | |
234b45d4 | 52 | #include "charset.h" |
c906108c | 53 | #include "annotate.h" |
303c8ebd | 54 | #include "filenames.h" |
7b90c3f9 | 55 | #include "symfile.h" |
ae5a43e0 | 56 | #include "gdb_obstack.h" |
c906108c | 57 | |
8731e58e | 58 | #include "inferior.h" /* for signed_pointer_to_address */ |
ac2e2ef7 | 59 | |
2d1b2124 AC |
60 | #include <sys/param.h> /* For MAXPATHLEN */ |
61 | ||
3b78cdbb | 62 | #include "gdb_curses.h" |
020cc13c | 63 | |
dbda9972 | 64 | #include "readline/readline.h" |
c906108c | 65 | |
a3828db0 | 66 | #if !HAVE_DECL_MALLOC |
8dbb1c65 | 67 | extern PTR malloc (); /* OK: PTR */ |
3c37485b | 68 | #endif |
a3828db0 | 69 | #if !HAVE_DECL_REALLOC |
8dbb1c65 | 70 | extern PTR realloc (); /* OK: PTR */ |
0e52036f | 71 | #endif |
a3828db0 | 72 | #if !HAVE_DECL_FREE |
81b8eb80 AC |
73 | extern void free (); |
74 | #endif | |
81b8eb80 | 75 | |
c906108c SS |
76 | /* readline defines this. */ |
77 | #undef savestring | |
78 | ||
9a4105ab | 79 | void (*deprecated_error_begin_hook) (void); |
c906108c SS |
80 | |
81 | /* Prototypes for local functions */ | |
82 | ||
d9fcf2fb | 83 | static void vfprintf_maybe_filtered (struct ui_file *, const char *, |
bee0189a | 84 | va_list, int) ATTR_FORMAT (printf, 2, 0); |
c906108c | 85 | |
d9fcf2fb | 86 | static void fputs_maybe_filtered (const char *, struct ui_file *, int); |
c906108c | 87 | |
e42c9534 AC |
88 | static void do_my_cleanups (struct cleanup **, struct cleanup *); |
89 | ||
a14ed312 | 90 | static void prompt_for_continue (void); |
c906108c | 91 | |
eb0d3137 | 92 | static void set_screen_size (void); |
a14ed312 | 93 | static void set_width (void); |
c906108c | 94 | |
c906108c SS |
95 | /* Chain of cleanup actions established with make_cleanup, |
96 | to be executed if an error happens. */ | |
97 | ||
c5aa993b JM |
98 | static struct cleanup *cleanup_chain; /* cleaned up after a failed command */ |
99 | static struct cleanup *final_cleanup_chain; /* cleaned up when gdb exits */ | |
100 | static struct cleanup *run_cleanup_chain; /* cleaned up on each 'run' */ | |
101 | static struct cleanup *exec_cleanup_chain; /* cleaned up on each execution command */ | |
6426a772 | 102 | /* cleaned up on each error from within an execution command */ |
8731e58e | 103 | static struct cleanup *exec_error_cleanup_chain; |
43ff13b4 JM |
104 | |
105 | /* Pointer to what is left to do for an execution command after the | |
106 | target stops. Used only in asynchronous mode, by targets that | |
107 | support async execution. The finish and until commands use it. So | |
108 | does the target extended-remote command. */ | |
109 | struct continuation *cmd_continuation; | |
c2d11a7d | 110 | struct continuation *intermediate_continuation; |
c906108c SS |
111 | |
112 | /* Nonzero if we have job control. */ | |
113 | ||
114 | int job_control; | |
115 | ||
116 | /* Nonzero means a quit has been requested. */ | |
117 | ||
118 | int quit_flag; | |
119 | ||
120 | /* Nonzero means quit immediately if Control-C is typed now, rather | |
121 | than waiting until QUIT is executed. Be careful in setting this; | |
122 | code which executes with immediate_quit set has to be very careful | |
123 | about being able to deal with being interrupted at any time. It is | |
124 | almost always better to use QUIT; the only exception I can think of | |
125 | is being able to quit out of a system call (using EINTR loses if | |
126 | the SIGINT happens between the previous QUIT and the system call). | |
127 | To immediately quit in the case in which a SIGINT happens between | |
128 | the previous QUIT and setting immediate_quit (desirable anytime we | |
129 | expect to block), call QUIT after setting immediate_quit. */ | |
130 | ||
131 | int immediate_quit; | |
132 | ||
4a351cef AF |
133 | /* Nonzero means that encoded C++/ObjC names should be printed out in their |
134 | C++/ObjC form rather than raw. */ | |
c906108c SS |
135 | |
136 | int demangle = 1; | |
920d2a44 AC |
137 | static void |
138 | show_demangle (struct ui_file *file, int from_tty, | |
139 | struct cmd_list_element *c, const char *value) | |
140 | { | |
141 | fprintf_filtered (file, _("\ | |
142 | Demangling of encoded C++/ObjC names when displaying symbols is %s.\n"), | |
143 | value); | |
144 | } | |
c906108c | 145 | |
4a351cef AF |
146 | /* Nonzero means that encoded C++/ObjC names should be printed out in their |
147 | C++/ObjC form even in assembler language displays. If this is set, but | |
c906108c SS |
148 | DEMANGLE is zero, names are printed raw, i.e. DEMANGLE controls. */ |
149 | ||
150 | int asm_demangle = 0; | |
920d2a44 AC |
151 | static void |
152 | show_asm_demangle (struct ui_file *file, int from_tty, | |
153 | struct cmd_list_element *c, const char *value) | |
154 | { | |
155 | fprintf_filtered (file, _("\ | |
156 | Demangling of C++/ObjC names in disassembly listings is %s.\n"), | |
157 | value); | |
158 | } | |
c906108c SS |
159 | |
160 | /* Nonzero means that strings with character values >0x7F should be printed | |
161 | as octal escapes. Zero means just print the value (e.g. it's an | |
162 | international character, and the terminal or window can cope.) */ | |
163 | ||
164 | int sevenbit_strings = 0; | |
920d2a44 AC |
165 | static void |
166 | show_sevenbit_strings (struct ui_file *file, int from_tty, | |
167 | struct cmd_list_element *c, const char *value) | |
168 | { | |
169 | fprintf_filtered (file, _("\ | |
170 | Printing of 8-bit characters in strings as \\nnn is %s.\n"), | |
171 | value); | |
172 | } | |
c906108c SS |
173 | |
174 | /* String to be printed before error messages, if any. */ | |
175 | ||
176 | char *error_pre_print; | |
177 | ||
178 | /* String to be printed before quit messages, if any. */ | |
179 | ||
180 | char *quit_pre_print; | |
181 | ||
182 | /* String to be printed before warning messages, if any. */ | |
183 | ||
184 | char *warning_pre_print = "\nwarning: "; | |
185 | ||
186 | int pagination_enabled = 1; | |
920d2a44 AC |
187 | static void |
188 | show_pagination_enabled (struct ui_file *file, int from_tty, | |
189 | struct cmd_list_element *c, const char *value) | |
190 | { | |
191 | fprintf_filtered (file, _("State of pagination is %s.\n"), value); | |
192 | } | |
193 | ||
c906108c | 194 | \f |
c5aa993b | 195 | |
c906108c SS |
196 | /* Add a new cleanup to the cleanup_chain, |
197 | and return the previous chain pointer | |
198 | to be passed later to do_cleanups or discard_cleanups. | |
199 | Args are FUNCTION to clean up with, and ARG to pass to it. */ | |
200 | ||
201 | struct cleanup * | |
e4005526 | 202 | make_cleanup (make_cleanup_ftype *function, void *arg) |
c906108c | 203 | { |
c5aa993b | 204 | return make_my_cleanup (&cleanup_chain, function, arg); |
c906108c SS |
205 | } |
206 | ||
207 | struct cleanup * | |
e4005526 | 208 | make_final_cleanup (make_cleanup_ftype *function, void *arg) |
c906108c | 209 | { |
c5aa993b | 210 | return make_my_cleanup (&final_cleanup_chain, function, arg); |
c906108c | 211 | } |
7a292a7a | 212 | |
c906108c | 213 | struct cleanup * |
e4005526 | 214 | make_run_cleanup (make_cleanup_ftype *function, void *arg) |
c906108c | 215 | { |
c5aa993b | 216 | return make_my_cleanup (&run_cleanup_chain, function, arg); |
c906108c | 217 | } |
7a292a7a | 218 | |
43ff13b4 | 219 | struct cleanup * |
e4005526 | 220 | make_exec_cleanup (make_cleanup_ftype *function, void *arg) |
43ff13b4 | 221 | { |
c5aa993b | 222 | return make_my_cleanup (&exec_cleanup_chain, function, arg); |
43ff13b4 JM |
223 | } |
224 | ||
6426a772 | 225 | struct cleanup * |
e4005526 | 226 | make_exec_error_cleanup (make_cleanup_ftype *function, void *arg) |
6426a772 JM |
227 | { |
228 | return make_my_cleanup (&exec_error_cleanup_chain, function, arg); | |
229 | } | |
230 | ||
7a292a7a | 231 | static void |
fba45db2 | 232 | do_freeargv (void *arg) |
7a292a7a | 233 | { |
c5aa993b | 234 | freeargv ((char **) arg); |
7a292a7a SS |
235 | } |
236 | ||
237 | struct cleanup * | |
fba45db2 | 238 | make_cleanup_freeargv (char **arg) |
7a292a7a SS |
239 | { |
240 | return make_my_cleanup (&cleanup_chain, do_freeargv, arg); | |
241 | } | |
242 | ||
5c65bbb6 AC |
243 | static void |
244 | do_bfd_close_cleanup (void *arg) | |
245 | { | |
246 | bfd_close (arg); | |
247 | } | |
248 | ||
249 | struct cleanup * | |
250 | make_cleanup_bfd_close (bfd *abfd) | |
251 | { | |
252 | return make_cleanup (do_bfd_close_cleanup, abfd); | |
253 | } | |
254 | ||
f5ff8c83 AC |
255 | static void |
256 | do_close_cleanup (void *arg) | |
257 | { | |
f042532c AC |
258 | int *fd = arg; |
259 | close (*fd); | |
260 | xfree (fd); | |
f5ff8c83 AC |
261 | } |
262 | ||
263 | struct cleanup * | |
264 | make_cleanup_close (int fd) | |
265 | { | |
f042532c AC |
266 | int *saved_fd = xmalloc (sizeof (fd)); |
267 | *saved_fd = fd; | |
268 | return make_cleanup (do_close_cleanup, saved_fd); | |
f5ff8c83 AC |
269 | } |
270 | ||
11cf8741 | 271 | static void |
d9fcf2fb | 272 | do_ui_file_delete (void *arg) |
11cf8741 | 273 | { |
d9fcf2fb | 274 | ui_file_delete (arg); |
11cf8741 JM |
275 | } |
276 | ||
277 | struct cleanup * | |
d9fcf2fb | 278 | make_cleanup_ui_file_delete (struct ui_file *arg) |
11cf8741 | 279 | { |
d9fcf2fb | 280 | return make_my_cleanup (&cleanup_chain, do_ui_file_delete, arg); |
11cf8741 JM |
281 | } |
282 | ||
7b90c3f9 JB |
283 | static void |
284 | do_free_section_addr_info (void *arg) | |
285 | { | |
286 | free_section_addr_info (arg); | |
287 | } | |
288 | ||
289 | struct cleanup * | |
290 | make_cleanup_free_section_addr_info (struct section_addr_info *addrs) | |
291 | { | |
292 | return make_my_cleanup (&cleanup_chain, do_free_section_addr_info, addrs); | |
293 | } | |
294 | ||
295 | ||
c906108c | 296 | struct cleanup * |
e4005526 AC |
297 | make_my_cleanup (struct cleanup **pmy_chain, make_cleanup_ftype *function, |
298 | void *arg) | |
c906108c | 299 | { |
52f0bd74 | 300 | struct cleanup *new |
8731e58e | 301 | = (struct cleanup *) xmalloc (sizeof (struct cleanup)); |
52f0bd74 | 302 | struct cleanup *old_chain = *pmy_chain; |
c906108c SS |
303 | |
304 | new->next = *pmy_chain; | |
305 | new->function = function; | |
306 | new->arg = arg; | |
307 | *pmy_chain = new; | |
308 | ||
309 | return old_chain; | |
310 | } | |
311 | ||
312 | /* Discard cleanups and do the actions they describe | |
313 | until we get back to the point OLD_CHAIN in the cleanup_chain. */ | |
314 | ||
315 | void | |
aa1ee363 | 316 | do_cleanups (struct cleanup *old_chain) |
c906108c | 317 | { |
c5aa993b | 318 | do_my_cleanups (&cleanup_chain, old_chain); |
c906108c SS |
319 | } |
320 | ||
321 | void | |
aa1ee363 | 322 | do_final_cleanups (struct cleanup *old_chain) |
c906108c | 323 | { |
c5aa993b | 324 | do_my_cleanups (&final_cleanup_chain, old_chain); |
c906108c SS |
325 | } |
326 | ||
327 | void | |
aa1ee363 | 328 | do_run_cleanups (struct cleanup *old_chain) |
c906108c | 329 | { |
c5aa993b | 330 | do_my_cleanups (&run_cleanup_chain, old_chain); |
c906108c SS |
331 | } |
332 | ||
43ff13b4 | 333 | void |
aa1ee363 | 334 | do_exec_cleanups (struct cleanup *old_chain) |
43ff13b4 | 335 | { |
c5aa993b | 336 | do_my_cleanups (&exec_cleanup_chain, old_chain); |
43ff13b4 JM |
337 | } |
338 | ||
6426a772 | 339 | void |
aa1ee363 | 340 | do_exec_error_cleanups (struct cleanup *old_chain) |
6426a772 JM |
341 | { |
342 | do_my_cleanups (&exec_error_cleanup_chain, old_chain); | |
343 | } | |
344 | ||
e42c9534 | 345 | static void |
aa1ee363 AC |
346 | do_my_cleanups (struct cleanup **pmy_chain, |
347 | struct cleanup *old_chain) | |
c906108c | 348 | { |
52f0bd74 | 349 | struct cleanup *ptr; |
c906108c SS |
350 | while ((ptr = *pmy_chain) != old_chain) |
351 | { | |
352 | *pmy_chain = ptr->next; /* Do this first incase recursion */ | |
353 | (*ptr->function) (ptr->arg); | |
b8c9b27d | 354 | xfree (ptr); |
c906108c SS |
355 | } |
356 | } | |
357 | ||
358 | /* Discard cleanups, not doing the actions they describe, | |
359 | until we get back to the point OLD_CHAIN in the cleanup_chain. */ | |
360 | ||
361 | void | |
aa1ee363 | 362 | discard_cleanups (struct cleanup *old_chain) |
c906108c | 363 | { |
c5aa993b | 364 | discard_my_cleanups (&cleanup_chain, old_chain); |
c906108c SS |
365 | } |
366 | ||
367 | void | |
aa1ee363 | 368 | discard_final_cleanups (struct cleanup *old_chain) |
c906108c | 369 | { |
c5aa993b | 370 | discard_my_cleanups (&final_cleanup_chain, old_chain); |
c906108c SS |
371 | } |
372 | ||
6426a772 | 373 | void |
aa1ee363 | 374 | discard_exec_error_cleanups (struct cleanup *old_chain) |
6426a772 JM |
375 | { |
376 | discard_my_cleanups (&exec_error_cleanup_chain, old_chain); | |
377 | } | |
378 | ||
c906108c | 379 | void |
aa1ee363 AC |
380 | discard_my_cleanups (struct cleanup **pmy_chain, |
381 | struct cleanup *old_chain) | |
c906108c | 382 | { |
52f0bd74 | 383 | struct cleanup *ptr; |
c906108c SS |
384 | while ((ptr = *pmy_chain) != old_chain) |
385 | { | |
386 | *pmy_chain = ptr->next; | |
b8c9b27d | 387 | xfree (ptr); |
c906108c SS |
388 | } |
389 | } | |
390 | ||
391 | /* Set the cleanup_chain to 0, and return the old cleanup chain. */ | |
392 | struct cleanup * | |
fba45db2 | 393 | save_cleanups (void) |
c906108c | 394 | { |
c5aa993b | 395 | return save_my_cleanups (&cleanup_chain); |
c906108c SS |
396 | } |
397 | ||
398 | struct cleanup * | |
fba45db2 | 399 | save_final_cleanups (void) |
c906108c | 400 | { |
c5aa993b | 401 | return save_my_cleanups (&final_cleanup_chain); |
c906108c SS |
402 | } |
403 | ||
404 | struct cleanup * | |
fba45db2 | 405 | save_my_cleanups (struct cleanup **pmy_chain) |
c906108c SS |
406 | { |
407 | struct cleanup *old_chain = *pmy_chain; | |
408 | ||
409 | *pmy_chain = 0; | |
410 | return old_chain; | |
411 | } | |
412 | ||
413 | /* Restore the cleanup chain from a previously saved chain. */ | |
414 | void | |
fba45db2 | 415 | restore_cleanups (struct cleanup *chain) |
c906108c | 416 | { |
c5aa993b | 417 | restore_my_cleanups (&cleanup_chain, chain); |
c906108c SS |
418 | } |
419 | ||
420 | void | |
fba45db2 | 421 | restore_final_cleanups (struct cleanup *chain) |
c906108c | 422 | { |
c5aa993b | 423 | restore_my_cleanups (&final_cleanup_chain, chain); |
c906108c SS |
424 | } |
425 | ||
426 | void | |
fba45db2 | 427 | restore_my_cleanups (struct cleanup **pmy_chain, struct cleanup *chain) |
c906108c SS |
428 | { |
429 | *pmy_chain = chain; | |
430 | } | |
431 | ||
432 | /* This function is useful for cleanups. | |
433 | Do | |
434 | ||
c5aa993b JM |
435 | foo = xmalloc (...); |
436 | old_chain = make_cleanup (free_current_contents, &foo); | |
c906108c SS |
437 | |
438 | to arrange to free the object thus allocated. */ | |
439 | ||
440 | void | |
2f9429ae | 441 | free_current_contents (void *ptr) |
c906108c | 442 | { |
2f9429ae | 443 | void **location = ptr; |
e2f9c474 | 444 | if (location == NULL) |
8e65ff28 | 445 | internal_error (__FILE__, __LINE__, |
e2e0b3e5 | 446 | _("free_current_contents: NULL pointer")); |
2f9429ae | 447 | if (*location != NULL) |
e2f9c474 | 448 | { |
b8c9b27d | 449 | xfree (*location); |
e2f9c474 AC |
450 | *location = NULL; |
451 | } | |
c906108c SS |
452 | } |
453 | ||
454 | /* Provide a known function that does nothing, to use as a base for | |
455 | for a possibly long chain of cleanups. This is useful where we | |
456 | use the cleanup chain for handling normal cleanups as well as dealing | |
457 | with cleanups that need to be done as a result of a call to error(). | |
458 | In such cases, we may not be certain where the first cleanup is, unless | |
459 | we have a do-nothing one to always use as the base. */ | |
460 | ||
c906108c | 461 | void |
e4005526 | 462 | null_cleanup (void *arg) |
c906108c SS |
463 | { |
464 | } | |
465 | ||
74f832da | 466 | /* Add a continuation to the continuation list, the global list |
c2d11a7d | 467 | cmd_continuation. The new continuation will be added at the front.*/ |
43ff13b4 | 468 | void |
74f832da KB |
469 | add_continuation (void (*continuation_hook) (struct continuation_arg *), |
470 | struct continuation_arg *arg_list) | |
43ff13b4 | 471 | { |
c5aa993b | 472 | struct continuation *continuation_ptr; |
43ff13b4 | 473 | |
8731e58e AC |
474 | continuation_ptr = |
475 | (struct continuation *) xmalloc (sizeof (struct continuation)); | |
c5aa993b JM |
476 | continuation_ptr->continuation_hook = continuation_hook; |
477 | continuation_ptr->arg_list = arg_list; | |
478 | continuation_ptr->next = cmd_continuation; | |
479 | cmd_continuation = continuation_ptr; | |
43ff13b4 JM |
480 | } |
481 | ||
482 | /* Walk down the cmd_continuation list, and execute all the | |
c2d11a7d JM |
483 | continuations. There is a problem though. In some cases new |
484 | continuations may be added while we are in the middle of this | |
485 | loop. If this happens they will be added in the front, and done | |
486 | before we have a chance of exhausting those that were already | |
487 | there. We need to then save the beginning of the list in a pointer | |
488 | and do the continuations from there on, instead of using the | |
0a4a0819 | 489 | global beginning of list as our iteration pointer. */ |
c5aa993b | 490 | void |
fba45db2 | 491 | do_all_continuations (void) |
c2d11a7d JM |
492 | { |
493 | struct continuation *continuation_ptr; | |
494 | struct continuation *saved_continuation; | |
495 | ||
496 | /* Copy the list header into another pointer, and set the global | |
497 | list header to null, so that the global list can change as a side | |
498 | effect of invoking the continuations and the processing of | |
499 | the preexisting continuations will not be affected. */ | |
500 | continuation_ptr = cmd_continuation; | |
501 | cmd_continuation = NULL; | |
502 | ||
0a4a0819 | 503 | /* Work now on the list we have set aside. */ |
c2d11a7d | 504 | while (continuation_ptr) |
8731e58e AC |
505 | { |
506 | (continuation_ptr->continuation_hook) (continuation_ptr->arg_list); | |
507 | saved_continuation = continuation_ptr; | |
508 | continuation_ptr = continuation_ptr->next; | |
509 | xfree (saved_continuation); | |
510 | } | |
c2d11a7d JM |
511 | } |
512 | ||
513 | /* Walk down the cmd_continuation list, and get rid of all the | |
514 | continuations. */ | |
515 | void | |
fba45db2 | 516 | discard_all_continuations (void) |
43ff13b4 | 517 | { |
c5aa993b | 518 | struct continuation *continuation_ptr; |
43ff13b4 | 519 | |
c5aa993b JM |
520 | while (cmd_continuation) |
521 | { | |
c5aa993b JM |
522 | continuation_ptr = cmd_continuation; |
523 | cmd_continuation = continuation_ptr->next; | |
b8c9b27d | 524 | xfree (continuation_ptr); |
c5aa993b | 525 | } |
43ff13b4 | 526 | } |
c2c6d25f | 527 | |
57e687d9 | 528 | /* Add a continuation to the continuation list, the global list |
0a4a0819 MS |
529 | intermediate_continuation. The new continuation will be added at |
530 | the front. */ | |
c2d11a7d | 531 | void |
74f832da KB |
532 | add_intermediate_continuation (void (*continuation_hook) |
533 | (struct continuation_arg *), | |
534 | struct continuation_arg *arg_list) | |
c2d11a7d JM |
535 | { |
536 | struct continuation *continuation_ptr; | |
537 | ||
8731e58e AC |
538 | continuation_ptr = |
539 | (struct continuation *) xmalloc (sizeof (struct continuation)); | |
c2d11a7d JM |
540 | continuation_ptr->continuation_hook = continuation_hook; |
541 | continuation_ptr->arg_list = arg_list; | |
542 | continuation_ptr->next = intermediate_continuation; | |
543 | intermediate_continuation = continuation_ptr; | |
544 | } | |
545 | ||
546 | /* Walk down the cmd_continuation list, and execute all the | |
547 | continuations. There is a problem though. In some cases new | |
548 | continuations may be added while we are in the middle of this | |
549 | loop. If this happens they will be added in the front, and done | |
550 | before we have a chance of exhausting those that were already | |
551 | there. We need to then save the beginning of the list in a pointer | |
552 | and do the continuations from there on, instead of using the | |
553 | global beginning of list as our iteration pointer.*/ | |
554 | void | |
fba45db2 | 555 | do_all_intermediate_continuations (void) |
c2d11a7d JM |
556 | { |
557 | struct continuation *continuation_ptr; | |
558 | struct continuation *saved_continuation; | |
559 | ||
560 | /* Copy the list header into another pointer, and set the global | |
561 | list header to null, so that the global list can change as a side | |
562 | effect of invoking the continuations and the processing of | |
563 | the preexisting continuations will not be affected. */ | |
564 | continuation_ptr = intermediate_continuation; | |
565 | intermediate_continuation = NULL; | |
566 | ||
0a4a0819 | 567 | /* Work now on the list we have set aside. */ |
c2d11a7d | 568 | while (continuation_ptr) |
8731e58e AC |
569 | { |
570 | (continuation_ptr->continuation_hook) (continuation_ptr->arg_list); | |
571 | saved_continuation = continuation_ptr; | |
572 | continuation_ptr = continuation_ptr->next; | |
573 | xfree (saved_continuation); | |
574 | } | |
c2d11a7d JM |
575 | } |
576 | ||
c2c6d25f JM |
577 | /* Walk down the cmd_continuation list, and get rid of all the |
578 | continuations. */ | |
579 | void | |
fba45db2 | 580 | discard_all_intermediate_continuations (void) |
c2c6d25f JM |
581 | { |
582 | struct continuation *continuation_ptr; | |
583 | ||
c2d11a7d | 584 | while (intermediate_continuation) |
c2c6d25f | 585 | { |
c2d11a7d JM |
586 | continuation_ptr = intermediate_continuation; |
587 | intermediate_continuation = continuation_ptr->next; | |
b8c9b27d | 588 | xfree (continuation_ptr); |
c2c6d25f JM |
589 | } |
590 | } | |
c906108c | 591 | \f |
c5aa993b | 592 | |
8731e58e | 593 | |
f5a96129 AC |
594 | /* Print a warning message. The first argument STRING is the warning |
595 | message, used as an fprintf format string, the second is the | |
596 | va_list of arguments for that string. A warning is unfiltered (not | |
597 | paginated) so that the user does not need to page through each | |
598 | screen full of warnings when there are lots of them. */ | |
c906108c SS |
599 | |
600 | void | |
f5a96129 | 601 | vwarning (const char *string, va_list args) |
c906108c | 602 | { |
9a4105ab AC |
603 | if (deprecated_warning_hook) |
604 | (*deprecated_warning_hook) (string, args); | |
f5a96129 AC |
605 | else |
606 | { | |
607 | target_terminal_ours (); | |
608 | wrap_here (""); /* Force out any buffered output */ | |
609 | gdb_flush (gdb_stdout); | |
610 | if (warning_pre_print) | |
306d9ac5 | 611 | fputs_unfiltered (warning_pre_print, gdb_stderr); |
f5a96129 AC |
612 | vfprintf_unfiltered (gdb_stderr, string, args); |
613 | fprintf_unfiltered (gdb_stderr, "\n"); | |
614 | va_end (args); | |
615 | } | |
c906108c SS |
616 | } |
617 | ||
618 | /* Print a warning message. | |
619 | The first argument STRING is the warning message, used as a fprintf string, | |
620 | and the remaining args are passed as arguments to it. | |
621 | The primary difference between warnings and errors is that a warning | |
622 | does not force the return to command level. */ | |
623 | ||
c906108c | 624 | void |
8731e58e | 625 | warning (const char *string, ...) |
c906108c SS |
626 | { |
627 | va_list args; | |
c906108c | 628 | va_start (args, string); |
f5a96129 AC |
629 | vwarning (string, args); |
630 | va_end (args); | |
c906108c SS |
631 | } |
632 | ||
c906108c SS |
633 | /* Print an error message and return to command level. |
634 | The first argument STRING is the error message, used as a fprintf string, | |
635 | and the remaining args are passed as arguments to it. */ | |
636 | ||
4ce44c66 JM |
637 | NORETURN void |
638 | verror (const char *string, va_list args) | |
639 | { | |
6b1b7650 | 640 | throw_verror (GENERIC_ERROR, string, args); |
4ce44c66 JM |
641 | } |
642 | ||
c906108c | 643 | NORETURN void |
8731e58e | 644 | error (const char *string, ...) |
c906108c SS |
645 | { |
646 | va_list args; | |
c906108c | 647 | va_start (args, string); |
6b1b7650 | 648 | throw_verror (GENERIC_ERROR, string, args); |
4ce44c66 | 649 | va_end (args); |
c906108c SS |
650 | } |
651 | ||
d75e3c94 JJ |
652 | /* Print an error message and quit. |
653 | The first argument STRING is the error message, used as a fprintf string, | |
654 | and the remaining args are passed as arguments to it. */ | |
655 | ||
656 | NORETURN void | |
657 | vfatal (const char *string, va_list args) | |
658 | { | |
6b1b7650 | 659 | throw_vfatal (string, args); |
d75e3c94 JJ |
660 | } |
661 | ||
662 | NORETURN void | |
663 | fatal (const char *string, ...) | |
664 | { | |
665 | va_list args; | |
666 | va_start (args, string); | |
6b1b7650 | 667 | throw_vfatal (string, args); |
d75e3c94 JJ |
668 | va_end (args); |
669 | } | |
670 | ||
d75e3c94 JJ |
671 | NORETURN void |
672 | error_stream (struct ui_file *stream) | |
2acceee2 | 673 | { |
4ce44c66 | 674 | long len; |
6b1b7650 AC |
675 | char *message = ui_file_xstrdup (stream, &len); |
676 | make_cleanup (xfree, message); | |
8a3fe4f8 | 677 | error (("%s"), message); |
2acceee2 | 678 | } |
c906108c | 679 | |
dec43320 AC |
680 | /* Print a message reporting an internal error/warning. Ask the user |
681 | if they want to continue, dump core, or just exit. Return | |
682 | something to indicate a quit. */ | |
c906108c | 683 | |
dec43320 | 684 | struct internal_problem |
c906108c | 685 | { |
dec43320 AC |
686 | const char *name; |
687 | /* FIXME: cagney/2002-08-15: There should be ``maint set/show'' | |
688 | commands available for controlling these variables. */ | |
689 | enum auto_boolean should_quit; | |
690 | enum auto_boolean should_dump_core; | |
691 | }; | |
692 | ||
693 | /* Report a problem, internal to GDB, to the user. Once the problem | |
694 | has been reported, and assuming GDB didn't quit, the caller can | |
695 | either allow execution to resume or throw an error. */ | |
696 | ||
bee0189a | 697 | static void ATTR_FORMAT (printf, 4, 0) |
dec43320 | 698 | internal_vproblem (struct internal_problem *problem, |
8731e58e | 699 | const char *file, int line, const char *fmt, va_list ap) |
dec43320 | 700 | { |
dec43320 | 701 | static int dejavu; |
375fc983 | 702 | int quit_p; |
7be570e7 | 703 | int dump_core_p; |
714b1282 | 704 | char *reason; |
c906108c | 705 | |
dec43320 | 706 | /* Don't allow infinite error/warning recursion. */ |
714b1282 AC |
707 | { |
708 | static char msg[] = "Recursive internal problem.\n"; | |
709 | switch (dejavu) | |
710 | { | |
711 | case 0: | |
712 | dejavu = 1; | |
713 | break; | |
714 | case 1: | |
715 | dejavu = 2; | |
716 | fputs_unfiltered (msg, gdb_stderr); | |
717 | abort (); /* NOTE: GDB has only three calls to abort(). */ | |
718 | default: | |
719 | dejavu = 3; | |
720 | write (STDERR_FILENO, msg, sizeof (msg)); | |
721 | exit (1); | |
722 | } | |
723 | } | |
c906108c | 724 | |
dec43320 | 725 | /* Try to get the message out and at the start of a new line. */ |
4261bedc | 726 | target_terminal_ours (); |
dec43320 AC |
727 | begin_line (); |
728 | ||
714b1282 AC |
729 | /* Create a string containing the full error/warning message. Need |
730 | to call query with this full string, as otherwize the reason | |
731 | (error/warning) and question become separated. Format using a | |
732 | style similar to a compiler error message. Include extra detail | |
733 | so that the user knows that they are living on the edge. */ | |
734 | { | |
735 | char *msg; | |
e623b504 | 736 | msg = xstrvprintf (fmt, ap); |
b435e160 | 737 | reason = xstrprintf ("\ |
714b1282 AC |
738 | %s:%d: %s: %s\n\ |
739 | A problem internal to GDB has been detected,\n\ | |
740 | further debugging may prove unreliable.", file, line, problem->name, msg); | |
741 | xfree (msg); | |
742 | make_cleanup (xfree, reason); | |
743 | } | |
7be570e7 | 744 | |
dec43320 AC |
745 | switch (problem->should_quit) |
746 | { | |
747 | case AUTO_BOOLEAN_AUTO: | |
748 | /* Default (yes/batch case) is to quit GDB. When in batch mode | |
8731e58e AC |
749 | this lessens the likelhood of GDB going into an infinate |
750 | loop. */ | |
e2e0b3e5 | 751 | quit_p = query (_("%s\nQuit this debugging session? "), reason); |
dec43320 AC |
752 | break; |
753 | case AUTO_BOOLEAN_TRUE: | |
754 | quit_p = 1; | |
755 | break; | |
756 | case AUTO_BOOLEAN_FALSE: | |
757 | quit_p = 0; | |
758 | break; | |
759 | default: | |
e2e0b3e5 | 760 | internal_error (__FILE__, __LINE__, _("bad switch")); |
dec43320 AC |
761 | } |
762 | ||
763 | switch (problem->should_dump_core) | |
764 | { | |
765 | case AUTO_BOOLEAN_AUTO: | |
766 | /* Default (yes/batch case) is to dump core. This leaves a GDB | |
8731e58e AC |
767 | `dropping' so that it is easier to see that something went |
768 | wrong in GDB. */ | |
e2e0b3e5 | 769 | dump_core_p = query (_("%s\nCreate a core file of GDB? "), reason); |
dec43320 AC |
770 | break; |
771 | break; | |
772 | case AUTO_BOOLEAN_TRUE: | |
773 | dump_core_p = 1; | |
774 | break; | |
775 | case AUTO_BOOLEAN_FALSE: | |
776 | dump_core_p = 0; | |
777 | break; | |
778 | default: | |
e2e0b3e5 | 779 | internal_error (__FILE__, __LINE__, _("bad switch")); |
dec43320 | 780 | } |
7be570e7 | 781 | |
375fc983 | 782 | if (quit_p) |
7be570e7 JM |
783 | { |
784 | if (dump_core_p) | |
8731e58e | 785 | abort (); /* NOTE: GDB has only three calls to abort(). */ |
375fc983 AC |
786 | else |
787 | exit (1); | |
7be570e7 JM |
788 | } |
789 | else | |
790 | { | |
791 | if (dump_core_p) | |
375fc983 | 792 | { |
9b265ec2 | 793 | #ifdef HAVE_WORKING_FORK |
375fc983 | 794 | if (fork () == 0) |
8731e58e | 795 | abort (); /* NOTE: GDB has only three calls to abort(). */ |
9b265ec2 | 796 | #endif |
375fc983 | 797 | } |
7be570e7 | 798 | } |
96baa820 JM |
799 | |
800 | dejavu = 0; | |
dec43320 AC |
801 | } |
802 | ||
803 | static struct internal_problem internal_error_problem = { | |
804 | "internal-error", AUTO_BOOLEAN_AUTO, AUTO_BOOLEAN_AUTO | |
805 | }; | |
806 | ||
807 | NORETURN void | |
8731e58e | 808 | internal_verror (const char *file, int line, const char *fmt, va_list ap) |
dec43320 AC |
809 | { |
810 | internal_vproblem (&internal_error_problem, file, line, fmt, ap); | |
315a522e | 811 | deprecated_throw_reason (RETURN_ERROR); |
c906108c SS |
812 | } |
813 | ||
4ce44c66 | 814 | NORETURN void |
8e65ff28 | 815 | internal_error (const char *file, int line, const char *string, ...) |
4ce44c66 JM |
816 | { |
817 | va_list ap; | |
818 | va_start (ap, string); | |
8e65ff28 | 819 | internal_verror (file, line, string, ap); |
4ce44c66 JM |
820 | va_end (ap); |
821 | } | |
822 | ||
dec43320 | 823 | static struct internal_problem internal_warning_problem = { |
d833db3b | 824 | "internal-warning", AUTO_BOOLEAN_AUTO, AUTO_BOOLEAN_AUTO |
dec43320 AC |
825 | }; |
826 | ||
827 | void | |
8731e58e | 828 | internal_vwarning (const char *file, int line, const char *fmt, va_list ap) |
dec43320 AC |
829 | { |
830 | internal_vproblem (&internal_warning_problem, file, line, fmt, ap); | |
831 | } | |
832 | ||
833 | void | |
834 | internal_warning (const char *file, int line, const char *string, ...) | |
835 | { | |
836 | va_list ap; | |
837 | va_start (ap, string); | |
838 | internal_vwarning (file, line, string, ap); | |
839 | va_end (ap); | |
840 | } | |
841 | ||
c906108c SS |
842 | /* Print the system error message for errno, and also mention STRING |
843 | as the file name for which the error was encountered. | |
844 | Then return to command level. */ | |
845 | ||
846 | NORETURN void | |
6972bc8b | 847 | perror_with_name (const char *string) |
c906108c SS |
848 | { |
849 | char *err; | |
850 | char *combined; | |
851 | ||
852 | err = safe_strerror (errno); | |
853 | combined = (char *) alloca (strlen (err) + strlen (string) + 3); | |
854 | strcpy (combined, string); | |
855 | strcat (combined, ": "); | |
856 | strcat (combined, err); | |
857 | ||
858 | /* I understand setting these is a matter of taste. Still, some people | |
859 | may clear errno but not know about bfd_error. Doing this here is not | |
860 | unreasonable. */ | |
861 | bfd_set_error (bfd_error_no_error); | |
862 | errno = 0; | |
863 | ||
8a3fe4f8 | 864 | error (_("%s."), combined); |
c906108c SS |
865 | } |
866 | ||
867 | /* Print the system error message for ERRCODE, and also mention STRING | |
868 | as the file name for which the error was encountered. */ | |
869 | ||
870 | void | |
6972bc8b | 871 | print_sys_errmsg (const char *string, int errcode) |
c906108c SS |
872 | { |
873 | char *err; | |
874 | char *combined; | |
875 | ||
876 | err = safe_strerror (errcode); | |
877 | combined = (char *) alloca (strlen (err) + strlen (string) + 3); | |
878 | strcpy (combined, string); | |
879 | strcat (combined, ": "); | |
880 | strcat (combined, err); | |
881 | ||
882 | /* We want anything which was printed on stdout to come out first, before | |
883 | this message. */ | |
884 | gdb_flush (gdb_stdout); | |
885 | fprintf_unfiltered (gdb_stderr, "%s.\n", combined); | |
886 | } | |
887 | ||
888 | /* Control C eventually causes this to be called, at a convenient time. */ | |
889 | ||
890 | void | |
fba45db2 | 891 | quit (void) |
c906108c | 892 | { |
7be570e7 JM |
893 | #ifdef __MSDOS__ |
894 | /* No steenking SIGINT will ever be coming our way when the | |
895 | program is resumed. Don't lie. */ | |
e06e2353 | 896 | fatal ("Quit"); |
7be570e7 | 897 | #else |
c906108c | 898 | if (job_control |
8731e58e AC |
899 | /* If there is no terminal switching for this target, then we can't |
900 | possibly get screwed by the lack of job control. */ | |
c906108c | 901 | || current_target.to_terminal_ours == NULL) |
e06e2353 | 902 | fatal ("Quit"); |
c906108c | 903 | else |
e06e2353 | 904 | fatal ("Quit (expect signal SIGINT when the program is resumed)"); |
7be570e7 | 905 | #endif |
c906108c SS |
906 | } |
907 | ||
c906108c | 908 | /* Control C comes here */ |
c906108c | 909 | void |
fba45db2 | 910 | request_quit (int signo) |
c906108c SS |
911 | { |
912 | quit_flag = 1; | |
1f04aa62 AC |
913 | /* Restore the signal handler. Harmless with BSD-style signals, |
914 | needed for System V-style signals. */ | |
c906108c SS |
915 | signal (signo, request_quit); |
916 | ||
c5aa993b | 917 | if (immediate_quit) |
c906108c | 918 | quit (); |
c906108c | 919 | } |
c906108c | 920 | \f |
c906108c SS |
921 | /* Called when a memory allocation fails, with the number of bytes of |
922 | memory requested in SIZE. */ | |
923 | ||
924 | NORETURN void | |
fba45db2 | 925 | nomem (long size) |
c906108c SS |
926 | { |
927 | if (size > 0) | |
928 | { | |
8e65ff28 | 929 | internal_error (__FILE__, __LINE__, |
e2e0b3e5 | 930 | _("virtual memory exhausted: can't allocate %ld bytes."), |
8731e58e | 931 | size); |
c906108c SS |
932 | } |
933 | else | |
934 | { | |
e2e0b3e5 | 935 | internal_error (__FILE__, __LINE__, _("virtual memory exhausted.")); |
c906108c SS |
936 | } |
937 | } | |
938 | ||
c0e61796 AC |
939 | /* The xmalloc() (libiberty.h) family of memory management routines. |
940 | ||
941 | These are like the ISO-C malloc() family except that they implement | |
942 | consistent semantics and guard against typical memory management | |
7936743b | 943 | problems. */ |
c0e61796 AC |
944 | |
945 | /* NOTE: These are declared using PTR to ensure consistency with | |
946 | "libiberty.h". xfree() is GDB local. */ | |
947 | ||
8dbb1c65 | 948 | PTR /* OK: PTR */ |
c0e61796 AC |
949 | xmalloc (size_t size) |
950 | { | |
7936743b AC |
951 | void *val; |
952 | ||
953 | /* See libiberty/xmalloc.c. This function need's to match that's | |
954 | semantics. It never returns NULL. */ | |
955 | if (size == 0) | |
956 | size = 1; | |
957 | ||
958 | val = malloc (size); /* OK: malloc */ | |
959 | if (val == NULL) | |
960 | nomem (size); | |
961 | ||
962 | return (val); | |
c0e61796 | 963 | } |
c906108c | 964 | |
5b90c7b5 AC |
965 | void * |
966 | xzalloc (size_t size) | |
967 | { | |
968 | return xcalloc (1, size); | |
969 | } | |
970 | ||
8dbb1c65 AC |
971 | PTR /* OK: PTR */ |
972 | xrealloc (PTR ptr, size_t size) /* OK: PTR */ | |
c906108c | 973 | { |
0efffb96 AC |
974 | void *val; |
975 | ||
976 | /* See libiberty/xmalloc.c. This function need's to match that's | |
977 | semantics. It never returns NULL. */ | |
978 | if (size == 0) | |
979 | size = 1; | |
980 | ||
981 | if (ptr != NULL) | |
982 | val = realloc (ptr, size); /* OK: realloc */ | |
983 | else | |
984 | val = malloc (size); /* OK: malloc */ | |
985 | if (val == NULL) | |
986 | nomem (size); | |
987 | ||
988 | return (val); | |
c906108c | 989 | } |
b8c9b27d | 990 | |
8dbb1c65 | 991 | PTR /* OK: PTR */ |
c0e61796 AC |
992 | xcalloc (size_t number, size_t size) |
993 | { | |
aa2ee5f6 AC |
994 | void *mem; |
995 | ||
996 | /* See libiberty/xmalloc.c. This function need's to match that's | |
997 | semantics. It never returns NULL. */ | |
998 | if (number == 0 || size == 0) | |
999 | { | |
1000 | number = 1; | |
1001 | size = 1; | |
1002 | } | |
1003 | ||
1004 | mem = calloc (number, size); /* OK: xcalloc */ | |
1005 | if (mem == NULL) | |
1006 | nomem (number * size); | |
1007 | ||
1008 | return mem; | |
c0e61796 | 1009 | } |
b8c9b27d KB |
1010 | |
1011 | void | |
1012 | xfree (void *ptr) | |
1013 | { | |
2dc74dc1 AC |
1014 | if (ptr != NULL) |
1015 | free (ptr); /* OK: free */ | |
b8c9b27d | 1016 | } |
c906108c | 1017 | \f |
c5aa993b | 1018 | |
76995688 AC |
1019 | /* Like asprintf/vasprintf but get an internal_error if the call |
1020 | fails. */ | |
1021 | ||
9ebf4acf AC |
1022 | char * |
1023 | xstrprintf (const char *format, ...) | |
1024 | { | |
1025 | char *ret; | |
1026 | va_list args; | |
1027 | va_start (args, format); | |
e623b504 | 1028 | ret = xstrvprintf (format, args); |
9ebf4acf AC |
1029 | va_end (args); |
1030 | return ret; | |
1031 | } | |
1032 | ||
76995688 AC |
1033 | void |
1034 | xasprintf (char **ret, const char *format, ...) | |
1035 | { | |
1036 | va_list args; | |
1037 | va_start (args, format); | |
e623b504 | 1038 | (*ret) = xstrvprintf (format, args); |
76995688 AC |
1039 | va_end (args); |
1040 | } | |
1041 | ||
1042 | void | |
1043 | xvasprintf (char **ret, const char *format, va_list ap) | |
1044 | { | |
a552edd9 | 1045 | (*ret) = xstrvprintf (format, ap); |
76995688 AC |
1046 | } |
1047 | ||
e623b504 AC |
1048 | char * |
1049 | xstrvprintf (const char *format, va_list ap) | |
1050 | { | |
1051 | char *ret = NULL; | |
1052 | int status = vasprintf (&ret, format, ap); | |
46e9880c DJ |
1053 | /* NULL is returned when there was a memory allocation problem, or |
1054 | any other error (for instance, a bad format string). A negative | |
1055 | status (the printed length) with a non-NULL buffer should never | |
1056 | happen, but just to be sure. */ | |
1057 | if (ret == NULL || status < 0) | |
1058 | internal_error (__FILE__, __LINE__, _("vasprintf call failed")); | |
e623b504 AC |
1059 | return ret; |
1060 | } | |
76995688 | 1061 | |
bde2058d MK |
1062 | int |
1063 | xsnprintf (char *str, size_t size, const char *format, ...) | |
1064 | { | |
1065 | va_list args; | |
1066 | int ret; | |
1067 | ||
1068 | va_start (args, format); | |
1069 | ret = vsnprintf (str, size, format, args); | |
1070 | gdb_assert (ret < size); | |
1071 | va_end (args); | |
1072 | ||
1073 | return ret; | |
1074 | } | |
1075 | ||
c906108c SS |
1076 | /* My replacement for the read system call. |
1077 | Used like `read' but keeps going if `read' returns too soon. */ | |
1078 | ||
1079 | int | |
fba45db2 | 1080 | myread (int desc, char *addr, int len) |
c906108c | 1081 | { |
52f0bd74 | 1082 | int val; |
c906108c SS |
1083 | int orglen = len; |
1084 | ||
1085 | while (len > 0) | |
1086 | { | |
1087 | val = read (desc, addr, len); | |
1088 | if (val < 0) | |
1089 | return val; | |
1090 | if (val == 0) | |
1091 | return orglen - len; | |
1092 | len -= val; | |
1093 | addr += val; | |
1094 | } | |
1095 | return orglen; | |
1096 | } | |
1097 | \f | |
1098 | /* Make a copy of the string at PTR with SIZE characters | |
1099 | (and add a null character at the end in the copy). | |
1100 | Uses malloc to get the space. Returns the address of the copy. */ | |
1101 | ||
1102 | char * | |
5565b556 | 1103 | savestring (const char *ptr, size_t size) |
c906108c | 1104 | { |
52f0bd74 | 1105 | char *p = (char *) xmalloc (size + 1); |
c906108c SS |
1106 | memcpy (p, ptr, size); |
1107 | p[size] = 0; | |
1108 | return p; | |
1109 | } | |
1110 | ||
c906108c | 1111 | void |
aa1ee363 | 1112 | print_spaces (int n, struct ui_file *file) |
c906108c | 1113 | { |
392a587b | 1114 | fputs_unfiltered (n_spaces (n), file); |
c906108c SS |
1115 | } |
1116 | ||
1117 | /* Print a host address. */ | |
1118 | ||
1119 | void | |
ac16bf07 | 1120 | gdb_print_host_address (const void *addr, struct ui_file *stream) |
c906108c SS |
1121 | { |
1122 | ||
1123 | /* We could use the %p conversion specifier to fprintf if we had any | |
1124 | way of knowing whether this host supports it. But the following | |
1125 | should work on the Alpha and on 32 bit machines. */ | |
1126 | ||
c5aa993b | 1127 | fprintf_filtered (stream, "0x%lx", (unsigned long) addr); |
c906108c SS |
1128 | } |
1129 | ||
1130 | /* Ask user a y-or-n question and return 1 iff answer is yes. | |
1131 | Takes three args which are given to printf to print the question. | |
1132 | The first, a control string, should end in "? ". | |
1133 | It should not say how to answer, because we do that. */ | |
1134 | ||
1135 | /* VARARGS */ | |
1136 | int | |
8731e58e | 1137 | query (const char *ctlstr, ...) |
c906108c SS |
1138 | { |
1139 | va_list args; | |
52f0bd74 AC |
1140 | int answer; |
1141 | int ans2; | |
c906108c SS |
1142 | int retval; |
1143 | ||
9a4105ab | 1144 | if (deprecated_query_hook) |
c906108c | 1145 | { |
3e6bb910 | 1146 | va_start (args, ctlstr); |
9a4105ab | 1147 | return deprecated_query_hook (ctlstr, args); |
c906108c SS |
1148 | } |
1149 | ||
1150 | /* Automatically answer "yes" if input is not from a terminal. */ | |
1151 | if (!input_from_terminal_p ()) | |
1152 | return 1; | |
c906108c SS |
1153 | |
1154 | while (1) | |
1155 | { | |
1156 | wrap_here (""); /* Flush any buffered output */ | |
1157 | gdb_flush (gdb_stdout); | |
1158 | ||
1159 | if (annotation_level > 1) | |
a3f17187 | 1160 | printf_filtered (("\n\032\032pre-query\n")); |
c906108c | 1161 | |
3e6bb910 | 1162 | va_start (args, ctlstr); |
c906108c | 1163 | vfprintf_filtered (gdb_stdout, ctlstr, args); |
3e6bb910 | 1164 | va_end (args); |
a3f17187 | 1165 | printf_filtered (_("(y or n) ")); |
c906108c SS |
1166 | |
1167 | if (annotation_level > 1) | |
a3f17187 | 1168 | printf_filtered (("\n\032\032query\n")); |
c906108c | 1169 | |
c5aa993b | 1170 | wrap_here (""); |
c906108c SS |
1171 | gdb_flush (gdb_stdout); |
1172 | ||
37767e42 | 1173 | answer = fgetc (stdin); |
c906108c SS |
1174 | clearerr (stdin); /* in case of C-d */ |
1175 | if (answer == EOF) /* C-d */ | |
c5aa993b | 1176 | { |
c906108c SS |
1177 | retval = 1; |
1178 | break; | |
1179 | } | |
1180 | /* Eat rest of input line, to EOF or newline */ | |
37767e42 | 1181 | if (answer != '\n') |
c5aa993b | 1182 | do |
c906108c | 1183 | { |
8731e58e | 1184 | ans2 = fgetc (stdin); |
c906108c SS |
1185 | clearerr (stdin); |
1186 | } | |
c5aa993b | 1187 | while (ans2 != EOF && ans2 != '\n' && ans2 != '\r'); |
c906108c SS |
1188 | |
1189 | if (answer >= 'a') | |
1190 | answer -= 040; | |
1191 | if (answer == 'Y') | |
1192 | { | |
1193 | retval = 1; | |
1194 | break; | |
1195 | } | |
1196 | if (answer == 'N') | |
1197 | { | |
1198 | retval = 0; | |
1199 | break; | |
1200 | } | |
a3f17187 | 1201 | printf_filtered (_("Please answer y or n.\n")); |
c906108c SS |
1202 | } |
1203 | ||
1204 | if (annotation_level > 1) | |
a3f17187 | 1205 | printf_filtered (("\n\032\032post-query\n")); |
c906108c SS |
1206 | return retval; |
1207 | } | |
c906108c | 1208 | \f |
c5aa993b | 1209 | |
cbdeadca JJ |
1210 | /* This function supports the nquery() and yquery() functions. |
1211 | Ask user a y-or-n question and return 0 if answer is no, 1 if | |
1212 | answer is yes, or default the answer to the specified default. | |
1213 | DEFCHAR is either 'y' or 'n' and refers to the default answer. | |
1214 | CTLSTR is the control string and should end in "? ". It should | |
1215 | not say how to answer, because we do that. | |
1216 | ARGS are the arguments passed along with the CTLSTR argument to | |
1217 | printf. */ | |
1218 | ||
bee0189a | 1219 | static int ATTR_FORMAT (printf, 1, 0) |
cbdeadca JJ |
1220 | defaulted_query (const char *ctlstr, const char defchar, va_list args) |
1221 | { | |
1222 | int answer; | |
1223 | int ans2; | |
1224 | int retval; | |
1225 | int def_value; | |
1226 | char def_answer, not_def_answer; | |
1227 | char *y_string, *n_string; | |
1228 | ||
1229 | /* Set up according to which answer is the default. */ | |
1230 | if (defchar == 'y') | |
1231 | { | |
1232 | def_value = 1; | |
1233 | def_answer = 'Y'; | |
1234 | not_def_answer = 'N'; | |
1235 | y_string = "[y]"; | |
1236 | n_string = "n"; | |
1237 | } | |
1238 | else | |
1239 | { | |
1240 | def_value = 0; | |
1241 | def_answer = 'N'; | |
1242 | not_def_answer = 'Y'; | |
1243 | y_string = "y"; | |
1244 | n_string = "[n]"; | |
1245 | } | |
1246 | ||
9a4105ab | 1247 | if (deprecated_query_hook) |
cbdeadca | 1248 | { |
9a4105ab | 1249 | return deprecated_query_hook (ctlstr, args); |
cbdeadca JJ |
1250 | } |
1251 | ||
1252 | /* Automatically answer default value if input is not from a terminal. */ | |
1253 | if (!input_from_terminal_p ()) | |
1254 | return def_value; | |
1255 | ||
1256 | while (1) | |
1257 | { | |
1258 | wrap_here (""); /* Flush any buffered output */ | |
1259 | gdb_flush (gdb_stdout); | |
1260 | ||
1261 | if (annotation_level > 1) | |
a3f17187 | 1262 | printf_filtered (("\n\032\032pre-query\n")); |
cbdeadca JJ |
1263 | |
1264 | vfprintf_filtered (gdb_stdout, ctlstr, args); | |
a3f17187 | 1265 | printf_filtered (_("(%s or %s) "), y_string, n_string); |
cbdeadca JJ |
1266 | |
1267 | if (annotation_level > 1) | |
a3f17187 | 1268 | printf_filtered (("\n\032\032query\n")); |
cbdeadca JJ |
1269 | |
1270 | wrap_here (""); | |
1271 | gdb_flush (gdb_stdout); | |
1272 | ||
1273 | answer = fgetc (stdin); | |
1274 | clearerr (stdin); /* in case of C-d */ | |
1275 | if (answer == EOF) /* C-d */ | |
1276 | { | |
1277 | retval = def_value; | |
1278 | break; | |
1279 | } | |
1280 | /* Eat rest of input line, to EOF or newline */ | |
1281 | if (answer != '\n') | |
1282 | do | |
1283 | { | |
1284 | ans2 = fgetc (stdin); | |
1285 | clearerr (stdin); | |
1286 | } | |
1287 | while (ans2 != EOF && ans2 != '\n' && ans2 != '\r'); | |
1288 | ||
1289 | if (answer >= 'a') | |
1290 | answer -= 040; | |
1291 | /* Check answer. For the non-default, the user must specify | |
1292 | the non-default explicitly. */ | |
1293 | if (answer == not_def_answer) | |
1294 | { | |
1295 | retval = !def_value; | |
1296 | break; | |
1297 | } | |
1298 | /* Otherwise, for the default, the user may either specify | |
1299 | the required input or have it default by entering nothing. */ | |
1300 | if (answer == def_answer || answer == '\n' || | |
1301 | answer == '\r' || answer == EOF) | |
1302 | { | |
1303 | retval = def_value; | |
1304 | break; | |
1305 | } | |
1306 | /* Invalid entries are not defaulted and require another selection. */ | |
a3f17187 | 1307 | printf_filtered (_("Please answer %s or %s.\n"), |
cbdeadca JJ |
1308 | y_string, n_string); |
1309 | } | |
1310 | ||
1311 | if (annotation_level > 1) | |
a3f17187 | 1312 | printf_filtered (("\n\032\032post-query\n")); |
cbdeadca JJ |
1313 | return retval; |
1314 | } | |
1315 | \f | |
1316 | ||
1317 | /* Ask user a y-or-n question and return 0 if answer is no, 1 if | |
1318 | answer is yes, or 0 if answer is defaulted. | |
1319 | Takes three args which are given to printf to print the question. | |
1320 | The first, a control string, should end in "? ". | |
1321 | It should not say how to answer, because we do that. */ | |
1322 | ||
1323 | int | |
1324 | nquery (const char *ctlstr, ...) | |
1325 | { | |
1326 | va_list args; | |
1327 | ||
1328 | va_start (args, ctlstr); | |
1329 | return defaulted_query (ctlstr, 'n', args); | |
1330 | va_end (args); | |
1331 | } | |
1332 | ||
1333 | /* Ask user a y-or-n question and return 0 if answer is no, 1 if | |
1334 | answer is yes, or 1 if answer is defaulted. | |
1335 | Takes three args which are given to printf to print the question. | |
1336 | The first, a control string, should end in "? ". | |
1337 | It should not say how to answer, because we do that. */ | |
1338 | ||
1339 | int | |
1340 | yquery (const char *ctlstr, ...) | |
1341 | { | |
1342 | va_list args; | |
1343 | ||
1344 | va_start (args, ctlstr); | |
1345 | return defaulted_query (ctlstr, 'y', args); | |
1346 | va_end (args); | |
1347 | } | |
1348 | ||
234b45d4 KB |
1349 | /* Print an error message saying that we couldn't make sense of a |
1350 | \^mumble sequence in a string or character constant. START and END | |
1351 | indicate a substring of some larger string that contains the | |
1352 | erroneous backslash sequence, missing the initial backslash. */ | |
1353 | static NORETURN int | |
1354 | no_control_char_error (const char *start, const char *end) | |
1355 | { | |
1356 | int len = end - start; | |
1357 | char *copy = alloca (end - start + 1); | |
1358 | ||
1359 | memcpy (copy, start, len); | |
1360 | copy[len] = '\0'; | |
1361 | ||
8a3fe4f8 | 1362 | error (_("There is no control character `\\%s' in the `%s' character set."), |
8731e58e | 1363 | copy, target_charset ()); |
234b45d4 KB |
1364 | } |
1365 | ||
c906108c SS |
1366 | /* Parse a C escape sequence. STRING_PTR points to a variable |
1367 | containing a pointer to the string to parse. That pointer | |
1368 | should point to the character after the \. That pointer | |
1369 | is updated past the characters we use. The value of the | |
1370 | escape sequence is returned. | |
1371 | ||
1372 | A negative value means the sequence \ newline was seen, | |
1373 | which is supposed to be equivalent to nothing at all. | |
1374 | ||
1375 | If \ is followed by a null character, we return a negative | |
1376 | value and leave the string pointer pointing at the null character. | |
1377 | ||
1378 | If \ is followed by 000, we return 0 and leave the string pointer | |
1379 | after the zeros. A value of 0 does not mean end of string. */ | |
1380 | ||
1381 | int | |
fba45db2 | 1382 | parse_escape (char **string_ptr) |
c906108c | 1383 | { |
234b45d4 | 1384 | int target_char; |
52f0bd74 | 1385 | int c = *(*string_ptr)++; |
234b45d4 KB |
1386 | if (c_parse_backslash (c, &target_char)) |
1387 | return target_char; | |
8731e58e AC |
1388 | else |
1389 | switch (c) | |
234b45d4 | 1390 | { |
8731e58e AC |
1391 | case '\n': |
1392 | return -2; | |
1393 | case 0: | |
1394 | (*string_ptr)--; | |
1395 | return 0; | |
1396 | case '^': | |
1397 | { | |
1398 | /* Remember where this escape sequence started, for reporting | |
1399 | errors. */ | |
1400 | char *sequence_start_pos = *string_ptr - 1; | |
234b45d4 | 1401 | |
8731e58e AC |
1402 | c = *(*string_ptr)++; |
1403 | ||
1404 | if (c == '?') | |
1405 | { | |
1406 | /* XXXCHARSET: What is `delete' in the host character set? */ | |
1407 | c = 0177; | |
1408 | ||
1409 | if (!host_char_to_target (c, &target_char)) | |
8a3fe4f8 AC |
1410 | error (_("There is no character corresponding to `Delete' " |
1411 | "in the target character set `%s'."), host_charset ()); | |
8731e58e AC |
1412 | |
1413 | return target_char; | |
1414 | } | |
1415 | else if (c == '\\') | |
1416 | target_char = parse_escape (string_ptr); | |
1417 | else | |
1418 | { | |
1419 | if (!host_char_to_target (c, &target_char)) | |
1420 | no_control_char_error (sequence_start_pos, *string_ptr); | |
1421 | } | |
1422 | ||
1423 | /* Now target_char is something like `c', and we want to find | |
1424 | its control-character equivalent. */ | |
1425 | if (!target_char_to_control_char (target_char, &target_char)) | |
1426 | no_control_char_error (sequence_start_pos, *string_ptr); | |
1427 | ||
1428 | return target_char; | |
1429 | } | |
1430 | ||
1431 | /* XXXCHARSET: we need to use isdigit and value-of-digit | |
1432 | methods of the host character set here. */ | |
1433 | ||
1434 | case '0': | |
1435 | case '1': | |
1436 | case '2': | |
1437 | case '3': | |
1438 | case '4': | |
1439 | case '5': | |
1440 | case '6': | |
1441 | case '7': | |
1442 | { | |
aa1ee363 AC |
1443 | int i = c - '0'; |
1444 | int count = 0; | |
8731e58e AC |
1445 | while (++count < 3) |
1446 | { | |
5cb316ef AC |
1447 | c = (**string_ptr); |
1448 | if (c >= '0' && c <= '7') | |
8731e58e | 1449 | { |
5cb316ef | 1450 | (*string_ptr)++; |
8731e58e AC |
1451 | i *= 8; |
1452 | i += c - '0'; | |
1453 | } | |
1454 | else | |
1455 | { | |
8731e58e AC |
1456 | break; |
1457 | } | |
1458 | } | |
1459 | return i; | |
1460 | } | |
1461 | default: | |
1462 | if (!host_char_to_target (c, &target_char)) | |
1463 | error | |
1464 | ("The escape sequence `\%c' is equivalent to plain `%c', which" | |
1465 | " has no equivalent\n" "in the `%s' character set.", c, c, | |
1466 | target_charset ()); | |
1467 | return target_char; | |
c906108c | 1468 | } |
c906108c SS |
1469 | } |
1470 | \f | |
1471 | /* Print the character C on STREAM as part of the contents of a literal | |
1472 | string whose delimiter is QUOTER. Note that this routine should only | |
1473 | be call for printing things which are independent of the language | |
1474 | of the program being debugged. */ | |
1475 | ||
43e526b9 | 1476 | static void |
74f832da | 1477 | printchar (int c, void (*do_fputs) (const char *, struct ui_file *), |
bee0189a DJ |
1478 | void (*do_fprintf) (struct ui_file *, const char *, ...) |
1479 | ATTRIBUTE_FPTR_PRINTF_2, struct ui_file *stream, int quoter) | |
c906108c SS |
1480 | { |
1481 | ||
1482 | c &= 0xFF; /* Avoid sign bit follies */ | |
1483 | ||
c5aa993b JM |
1484 | if (c < 0x20 || /* Low control chars */ |
1485 | (c >= 0x7F && c < 0xA0) || /* DEL, High controls */ | |
1486 | (sevenbit_strings && c >= 0x80)) | |
1487 | { /* high order bit set */ | |
1488 | switch (c) | |
1489 | { | |
1490 | case '\n': | |
43e526b9 | 1491 | do_fputs ("\\n", stream); |
c5aa993b JM |
1492 | break; |
1493 | case '\b': | |
43e526b9 | 1494 | do_fputs ("\\b", stream); |
c5aa993b JM |
1495 | break; |
1496 | case '\t': | |
43e526b9 | 1497 | do_fputs ("\\t", stream); |
c5aa993b JM |
1498 | break; |
1499 | case '\f': | |
43e526b9 | 1500 | do_fputs ("\\f", stream); |
c5aa993b JM |
1501 | break; |
1502 | case '\r': | |
43e526b9 | 1503 | do_fputs ("\\r", stream); |
c5aa993b JM |
1504 | break; |
1505 | case '\033': | |
43e526b9 | 1506 | do_fputs ("\\e", stream); |
c5aa993b JM |
1507 | break; |
1508 | case '\007': | |
43e526b9 | 1509 | do_fputs ("\\a", stream); |
c5aa993b JM |
1510 | break; |
1511 | default: | |
43e526b9 | 1512 | do_fprintf (stream, "\\%.3o", (unsigned int) c); |
c5aa993b JM |
1513 | break; |
1514 | } | |
1515 | } | |
1516 | else | |
1517 | { | |
1518 | if (c == '\\' || c == quoter) | |
43e526b9 JM |
1519 | do_fputs ("\\", stream); |
1520 | do_fprintf (stream, "%c", c); | |
c5aa993b | 1521 | } |
c906108c | 1522 | } |
43e526b9 JM |
1523 | |
1524 | /* Print the character C on STREAM as part of the contents of a | |
1525 | literal string whose delimiter is QUOTER. Note that these routines | |
1526 | should only be call for printing things which are independent of | |
1527 | the language of the program being debugged. */ | |
1528 | ||
1529 | void | |
fba45db2 | 1530 | fputstr_filtered (const char *str, int quoter, struct ui_file *stream) |
43e526b9 JM |
1531 | { |
1532 | while (*str) | |
1533 | printchar (*str++, fputs_filtered, fprintf_filtered, stream, quoter); | |
1534 | } | |
1535 | ||
1536 | void | |
fba45db2 | 1537 | fputstr_unfiltered (const char *str, int quoter, struct ui_file *stream) |
43e526b9 JM |
1538 | { |
1539 | while (*str) | |
1540 | printchar (*str++, fputs_unfiltered, fprintf_unfiltered, stream, quoter); | |
1541 | } | |
1542 | ||
1543 | void | |
8731e58e AC |
1544 | fputstrn_unfiltered (const char *str, int n, int quoter, |
1545 | struct ui_file *stream) | |
43e526b9 JM |
1546 | { |
1547 | int i; | |
1548 | for (i = 0; i < n; i++) | |
1549 | printchar (str[i], fputs_unfiltered, fprintf_unfiltered, stream, quoter); | |
1550 | } | |
c906108c | 1551 | \f |
c5aa993b | 1552 | |
c906108c SS |
1553 | /* Number of lines per page or UINT_MAX if paging is disabled. */ |
1554 | static unsigned int lines_per_page; | |
920d2a44 AC |
1555 | static void |
1556 | show_lines_per_page (struct ui_file *file, int from_tty, | |
1557 | struct cmd_list_element *c, const char *value) | |
1558 | { | |
1559 | fprintf_filtered (file, _("\ | |
1560 | Number of lines gdb thinks are in a page is %s.\n"), | |
1561 | value); | |
1562 | } | |
eb0d3137 | 1563 | |
cbfbd72a | 1564 | /* Number of chars per line or UINT_MAX if line folding is disabled. */ |
c906108c | 1565 | static unsigned int chars_per_line; |
920d2a44 AC |
1566 | static void |
1567 | show_chars_per_line (struct ui_file *file, int from_tty, | |
1568 | struct cmd_list_element *c, const char *value) | |
1569 | { | |
1570 | fprintf_filtered (file, _("\ | |
1571 | Number of characters gdb thinks are in a line is %s.\n"), | |
1572 | value); | |
1573 | } | |
eb0d3137 | 1574 | |
c906108c SS |
1575 | /* Current count of lines printed on this page, chars on this line. */ |
1576 | static unsigned int lines_printed, chars_printed; | |
1577 | ||
1578 | /* Buffer and start column of buffered text, for doing smarter word- | |
1579 | wrapping. When someone calls wrap_here(), we start buffering output | |
1580 | that comes through fputs_filtered(). If we see a newline, we just | |
1581 | spit it out and forget about the wrap_here(). If we see another | |
1582 | wrap_here(), we spit it out and remember the newer one. If we see | |
1583 | the end of the line, we spit out a newline, the indent, and then | |
1584 | the buffered output. */ | |
1585 | ||
1586 | /* Malloc'd buffer with chars_per_line+2 bytes. Contains characters which | |
1587 | are waiting to be output (they have already been counted in chars_printed). | |
1588 | When wrap_buffer[0] is null, the buffer is empty. */ | |
1589 | static char *wrap_buffer; | |
1590 | ||
1591 | /* Pointer in wrap_buffer to the next character to fill. */ | |
1592 | static char *wrap_pointer; | |
1593 | ||
1594 | /* String to indent by if the wrap occurs. Must not be NULL if wrap_column | |
1595 | is non-zero. */ | |
1596 | static char *wrap_indent; | |
1597 | ||
1598 | /* Column number on the screen where wrap_buffer begins, or 0 if wrapping | |
1599 | is not in effect. */ | |
1600 | static int wrap_column; | |
c906108c | 1601 | \f |
c5aa993b | 1602 | |
eb0d3137 MK |
1603 | /* Inialize the number of lines per page and chars per line. */ |
1604 | ||
c906108c | 1605 | void |
fba45db2 | 1606 | init_page_info (void) |
c906108c SS |
1607 | { |
1608 | #if defined(TUI) | |
5ecb1806 | 1609 | if (!tui_get_command_dimension (&chars_per_line, &lines_per_page)) |
c906108c SS |
1610 | #endif |
1611 | { | |
eb0d3137 | 1612 | int rows, cols; |
c906108c | 1613 | |
ec145965 EZ |
1614 | #if defined(__GO32__) |
1615 | rows = ScreenRows (); | |
1616 | cols = ScreenCols (); | |
1617 | lines_per_page = rows; | |
1618 | chars_per_line = cols; | |
1619 | #else | |
eb0d3137 MK |
1620 | /* Make sure Readline has initialized its terminal settings. */ |
1621 | rl_reset_terminal (NULL); | |
c906108c | 1622 | |
eb0d3137 MK |
1623 | /* Get the screen size from Readline. */ |
1624 | rl_get_screen_size (&rows, &cols); | |
1625 | lines_per_page = rows; | |
1626 | chars_per_line = cols; | |
c906108c | 1627 | |
eb0d3137 MK |
1628 | /* Readline should have fetched the termcap entry for us. */ |
1629 | if (tgetnum ("li") < 0 || getenv ("EMACS")) | |
1630 | { | |
1631 | /* The number of lines per page is not mentioned in the | |
1632 | terminal description. This probably means that paging is | |
1633 | not useful (e.g. emacs shell window), so disable paging. */ | |
1634 | lines_per_page = UINT_MAX; | |
1635 | } | |
c906108c | 1636 | |
eb0d3137 | 1637 | /* FIXME: Get rid of this junk. */ |
c906108c | 1638 | #if defined(SIGWINCH) && defined(SIGWINCH_HANDLER) |
c906108c SS |
1639 | SIGWINCH_HANDLER (SIGWINCH); |
1640 | #endif | |
eb0d3137 | 1641 | |
c906108c | 1642 | /* If the output is not a terminal, don't paginate it. */ |
d9fcf2fb | 1643 | if (!ui_file_isatty (gdb_stdout)) |
c5aa993b | 1644 | lines_per_page = UINT_MAX; |
eb0d3137 | 1645 | #endif |
ec145965 | 1646 | } |
eb0d3137 MK |
1647 | |
1648 | set_screen_size (); | |
c5aa993b | 1649 | set_width (); |
c906108c SS |
1650 | } |
1651 | ||
eb0d3137 MK |
1652 | /* Set the screen size based on LINES_PER_PAGE and CHARS_PER_LINE. */ |
1653 | ||
1654 | static void | |
1655 | set_screen_size (void) | |
1656 | { | |
1657 | int rows = lines_per_page; | |
1658 | int cols = chars_per_line; | |
1659 | ||
1660 | if (rows <= 0) | |
1661 | rows = INT_MAX; | |
1662 | ||
1663 | if (cols <= 0) | |
1664 | rl_get_screen_size (NULL, &cols); | |
1665 | ||
1666 | /* Update Readline's idea of the terminal size. */ | |
1667 | rl_set_screen_size (rows, cols); | |
1668 | } | |
1669 | ||
1670 | /* Reinitialize WRAP_BUFFER according to the current value of | |
1671 | CHARS_PER_LINE. */ | |
1672 | ||
c906108c | 1673 | static void |
fba45db2 | 1674 | set_width (void) |
c906108c SS |
1675 | { |
1676 | if (chars_per_line == 0) | |
c5aa993b | 1677 | init_page_info (); |
c906108c SS |
1678 | |
1679 | if (!wrap_buffer) | |
1680 | { | |
1681 | wrap_buffer = (char *) xmalloc (chars_per_line + 2); | |
1682 | wrap_buffer[0] = '\0'; | |
1683 | } | |
1684 | else | |
1685 | wrap_buffer = (char *) xrealloc (wrap_buffer, chars_per_line + 2); | |
eb0d3137 | 1686 | wrap_pointer = wrap_buffer; /* Start it at the beginning. */ |
c906108c SS |
1687 | } |
1688 | ||
c5aa993b | 1689 | static void |
fba45db2 | 1690 | set_width_command (char *args, int from_tty, struct cmd_list_element *c) |
c906108c | 1691 | { |
eb0d3137 | 1692 | set_screen_size (); |
c906108c SS |
1693 | set_width (); |
1694 | } | |
1695 | ||
eb0d3137 MK |
1696 | static void |
1697 | set_height_command (char *args, int from_tty, struct cmd_list_element *c) | |
1698 | { | |
1699 | set_screen_size (); | |
1700 | } | |
1701 | ||
c906108c SS |
1702 | /* Wait, so the user can read what's on the screen. Prompt the user |
1703 | to continue by pressing RETURN. */ | |
1704 | ||
1705 | static void | |
fba45db2 | 1706 | prompt_for_continue (void) |
c906108c SS |
1707 | { |
1708 | char *ignore; | |
1709 | char cont_prompt[120]; | |
1710 | ||
1711 | if (annotation_level > 1) | |
a3f17187 | 1712 | printf_unfiltered (("\n\032\032pre-prompt-for-continue\n")); |
c906108c SS |
1713 | |
1714 | strcpy (cont_prompt, | |
1715 | "---Type <return> to continue, or q <return> to quit---"); | |
1716 | if (annotation_level > 1) | |
1717 | strcat (cont_prompt, "\n\032\032prompt-for-continue\n"); | |
1718 | ||
1719 | /* We must do this *before* we call gdb_readline, else it will eventually | |
1720 | call us -- thinking that we're trying to print beyond the end of the | |
1721 | screen. */ | |
1722 | reinitialize_more_filter (); | |
1723 | ||
1724 | immediate_quit++; | |
1725 | /* On a real operating system, the user can quit with SIGINT. | |
1726 | But not on GO32. | |
1727 | ||
1728 | 'q' is provided on all systems so users don't have to change habits | |
1729 | from system to system, and because telling them what to do in | |
1730 | the prompt is more user-friendly than expecting them to think of | |
1731 | SIGINT. */ | |
1732 | /* Call readline, not gdb_readline, because GO32 readline handles control-C | |
1733 | whereas control-C to gdb_readline will cause the user to get dumped | |
1734 | out to DOS. */ | |
b4f5539f | 1735 | ignore = gdb_readline_wrapper (cont_prompt); |
c906108c SS |
1736 | |
1737 | if (annotation_level > 1) | |
a3f17187 | 1738 | printf_unfiltered (("\n\032\032post-prompt-for-continue\n")); |
c906108c SS |
1739 | |
1740 | if (ignore) | |
1741 | { | |
1742 | char *p = ignore; | |
1743 | while (*p == ' ' || *p == '\t') | |
1744 | ++p; | |
1745 | if (p[0] == 'q') | |
362646f5 | 1746 | async_request_quit (0); |
b8c9b27d | 1747 | xfree (ignore); |
c906108c SS |
1748 | } |
1749 | immediate_quit--; | |
1750 | ||
1751 | /* Now we have to do this again, so that GDB will know that it doesn't | |
1752 | need to save the ---Type <return>--- line at the top of the screen. */ | |
1753 | reinitialize_more_filter (); | |
1754 | ||
1755 | dont_repeat (); /* Forget prev cmd -- CR won't repeat it. */ | |
1756 | } | |
1757 | ||
1758 | /* Reinitialize filter; ie. tell it to reset to original values. */ | |
1759 | ||
1760 | void | |
fba45db2 | 1761 | reinitialize_more_filter (void) |
c906108c SS |
1762 | { |
1763 | lines_printed = 0; | |
1764 | chars_printed = 0; | |
1765 | } | |
1766 | ||
1767 | /* Indicate that if the next sequence of characters overflows the line, | |
1768 | a newline should be inserted here rather than when it hits the end. | |
1769 | If INDENT is non-null, it is a string to be printed to indent the | |
1770 | wrapped part on the next line. INDENT must remain accessible until | |
1771 | the next call to wrap_here() or until a newline is printed through | |
1772 | fputs_filtered(). | |
1773 | ||
1774 | If the line is already overfull, we immediately print a newline and | |
1775 | the indentation, and disable further wrapping. | |
1776 | ||
1777 | If we don't know the width of lines, but we know the page height, | |
1778 | we must not wrap words, but should still keep track of newlines | |
1779 | that were explicitly printed. | |
1780 | ||
1781 | INDENT should not contain tabs, as that will mess up the char count | |
1782 | on the next line. FIXME. | |
1783 | ||
1784 | This routine is guaranteed to force out any output which has been | |
1785 | squirreled away in the wrap_buffer, so wrap_here ((char *)0) can be | |
1786 | used to force out output from the wrap_buffer. */ | |
1787 | ||
1788 | void | |
fba45db2 | 1789 | wrap_here (char *indent) |
c906108c SS |
1790 | { |
1791 | /* This should have been allocated, but be paranoid anyway. */ | |
1792 | if (!wrap_buffer) | |
e2e0b3e5 | 1793 | internal_error (__FILE__, __LINE__, _("failed internal consistency check")); |
c906108c SS |
1794 | |
1795 | if (wrap_buffer[0]) | |
1796 | { | |
1797 | *wrap_pointer = '\0'; | |
1798 | fputs_unfiltered (wrap_buffer, gdb_stdout); | |
1799 | } | |
1800 | wrap_pointer = wrap_buffer; | |
1801 | wrap_buffer[0] = '\0'; | |
c5aa993b | 1802 | if (chars_per_line == UINT_MAX) /* No line overflow checking */ |
c906108c SS |
1803 | { |
1804 | wrap_column = 0; | |
1805 | } | |
1806 | else if (chars_printed >= chars_per_line) | |
1807 | { | |
1808 | puts_filtered ("\n"); | |
1809 | if (indent != NULL) | |
1810 | puts_filtered (indent); | |
1811 | wrap_column = 0; | |
1812 | } | |
1813 | else | |
1814 | { | |
1815 | wrap_column = chars_printed; | |
1816 | if (indent == NULL) | |
1817 | wrap_indent = ""; | |
1818 | else | |
1819 | wrap_indent = indent; | |
1820 | } | |
1821 | } | |
1822 | ||
4a351cef AF |
1823 | /* Print input string to gdb_stdout, filtered, with wrap, |
1824 | arranging strings in columns of n chars. String can be | |
1825 | right or left justified in the column. Never prints | |
1826 | trailing spaces. String should never be longer than | |
1827 | width. FIXME: this could be useful for the EXAMINE | |
1828 | command, which currently doesn't tabulate very well */ | |
1829 | ||
1830 | void | |
1831 | puts_filtered_tabular (char *string, int width, int right) | |
1832 | { | |
1833 | int spaces = 0; | |
1834 | int stringlen; | |
1835 | char *spacebuf; | |
1836 | ||
1837 | gdb_assert (chars_per_line > 0); | |
1838 | if (chars_per_line == UINT_MAX) | |
1839 | { | |
1840 | fputs_filtered (string, gdb_stdout); | |
1841 | fputs_filtered ("\n", gdb_stdout); | |
1842 | return; | |
1843 | } | |
1844 | ||
1845 | if (((chars_printed - 1) / width + 2) * width >= chars_per_line) | |
1846 | fputs_filtered ("\n", gdb_stdout); | |
1847 | ||
1848 | if (width >= chars_per_line) | |
1849 | width = chars_per_line - 1; | |
1850 | ||
1851 | stringlen = strlen (string); | |
1852 | ||
1853 | if (chars_printed > 0) | |
1854 | spaces = width - (chars_printed - 1) % width - 1; | |
1855 | if (right) | |
1856 | spaces += width - stringlen; | |
1857 | ||
1858 | spacebuf = alloca (spaces + 1); | |
1859 | spacebuf[spaces] = '\0'; | |
1860 | while (spaces--) | |
1861 | spacebuf[spaces] = ' '; | |
1862 | ||
1863 | fputs_filtered (spacebuf, gdb_stdout); | |
1864 | fputs_filtered (string, gdb_stdout); | |
1865 | } | |
1866 | ||
1867 | ||
c906108c SS |
1868 | /* Ensure that whatever gets printed next, using the filtered output |
1869 | commands, starts at the beginning of the line. I.E. if there is | |
1870 | any pending output for the current line, flush it and start a new | |
1871 | line. Otherwise do nothing. */ | |
1872 | ||
1873 | void | |
fba45db2 | 1874 | begin_line (void) |
c906108c SS |
1875 | { |
1876 | if (chars_printed > 0) | |
1877 | { | |
1878 | puts_filtered ("\n"); | |
1879 | } | |
1880 | } | |
1881 | ||
ac9a91a7 | 1882 | |
c906108c SS |
1883 | /* Like fputs but if FILTER is true, pause after every screenful. |
1884 | ||
1885 | Regardless of FILTER can wrap at points other than the final | |
1886 | character of a line. | |
1887 | ||
1888 | Unlike fputs, fputs_maybe_filtered does not return a value. | |
1889 | It is OK for LINEBUFFER to be NULL, in which case just don't print | |
1890 | anything. | |
1891 | ||
1892 | Note that a longjmp to top level may occur in this routine (only if | |
1893 | FILTER is true) (since prompt_for_continue may do so) so this | |
1894 | routine should not be called when cleanups are not in place. */ | |
1895 | ||
1896 | static void | |
fba45db2 KB |
1897 | fputs_maybe_filtered (const char *linebuffer, struct ui_file *stream, |
1898 | int filter) | |
c906108c SS |
1899 | { |
1900 | const char *lineptr; | |
1901 | ||
1902 | if (linebuffer == 0) | |
1903 | return; | |
1904 | ||
1905 | /* Don't do any filtering if it is disabled. */ | |
7a292a7a | 1906 | if ((stream != gdb_stdout) || !pagination_enabled |
c5aa993b | 1907 | || (lines_per_page == UINT_MAX && chars_per_line == UINT_MAX)) |
c906108c SS |
1908 | { |
1909 | fputs_unfiltered (linebuffer, stream); | |
1910 | return; | |
1911 | } | |
1912 | ||
1913 | /* Go through and output each character. Show line extension | |
1914 | when this is necessary; prompt user for new page when this is | |
1915 | necessary. */ | |
c5aa993b | 1916 | |
c906108c SS |
1917 | lineptr = linebuffer; |
1918 | while (*lineptr) | |
1919 | { | |
1920 | /* Possible new page. */ | |
8731e58e | 1921 | if (filter && (lines_printed >= lines_per_page - 1)) |
c906108c SS |
1922 | prompt_for_continue (); |
1923 | ||
1924 | while (*lineptr && *lineptr != '\n') | |
1925 | { | |
1926 | /* Print a single line. */ | |
1927 | if (*lineptr == '\t') | |
1928 | { | |
1929 | if (wrap_column) | |
1930 | *wrap_pointer++ = '\t'; | |
1931 | else | |
1932 | fputc_unfiltered ('\t', stream); | |
1933 | /* Shifting right by 3 produces the number of tab stops | |
1934 | we have already passed, and then adding one and | |
c5aa993b | 1935 | shifting left 3 advances to the next tab stop. */ |
c906108c SS |
1936 | chars_printed = ((chars_printed >> 3) + 1) << 3; |
1937 | lineptr++; | |
1938 | } | |
1939 | else | |
1940 | { | |
1941 | if (wrap_column) | |
1942 | *wrap_pointer++ = *lineptr; | |
1943 | else | |
c5aa993b | 1944 | fputc_unfiltered (*lineptr, stream); |
c906108c SS |
1945 | chars_printed++; |
1946 | lineptr++; | |
1947 | } | |
c5aa993b | 1948 | |
c906108c SS |
1949 | if (chars_printed >= chars_per_line) |
1950 | { | |
1951 | unsigned int save_chars = chars_printed; | |
1952 | ||
1953 | chars_printed = 0; | |
1954 | lines_printed++; | |
1955 | /* If we aren't actually wrapping, don't output newline -- | |
c5aa993b JM |
1956 | if chars_per_line is right, we probably just overflowed |
1957 | anyway; if it's wrong, let us keep going. */ | |
c906108c SS |
1958 | if (wrap_column) |
1959 | fputc_unfiltered ('\n', stream); | |
1960 | ||
1961 | /* Possible new page. */ | |
1962 | if (lines_printed >= lines_per_page - 1) | |
1963 | prompt_for_continue (); | |
1964 | ||
1965 | /* Now output indentation and wrapped string */ | |
1966 | if (wrap_column) | |
1967 | { | |
1968 | fputs_unfiltered (wrap_indent, stream); | |
8731e58e | 1969 | *wrap_pointer = '\0'; /* Null-terminate saved stuff */ |
c5aa993b | 1970 | fputs_unfiltered (wrap_buffer, stream); /* and eject it */ |
c906108c SS |
1971 | /* FIXME, this strlen is what prevents wrap_indent from |
1972 | containing tabs. However, if we recurse to print it | |
1973 | and count its chars, we risk trouble if wrap_indent is | |
1974 | longer than (the user settable) chars_per_line. | |
1975 | Note also that this can set chars_printed > chars_per_line | |
1976 | if we are printing a long string. */ | |
1977 | chars_printed = strlen (wrap_indent) | |
c5aa993b | 1978 | + (save_chars - wrap_column); |
c906108c SS |
1979 | wrap_pointer = wrap_buffer; /* Reset buffer */ |
1980 | wrap_buffer[0] = '\0'; | |
c5aa993b JM |
1981 | wrap_column = 0; /* And disable fancy wrap */ |
1982 | } | |
c906108c SS |
1983 | } |
1984 | } | |
1985 | ||
1986 | if (*lineptr == '\n') | |
1987 | { | |
1988 | chars_printed = 0; | |
c5aa993b | 1989 | wrap_here ((char *) 0); /* Spit out chars, cancel further wraps */ |
c906108c SS |
1990 | lines_printed++; |
1991 | fputc_unfiltered ('\n', stream); | |
1992 | lineptr++; | |
1993 | } | |
1994 | } | |
1995 | } | |
1996 | ||
1997 | void | |
fba45db2 | 1998 | fputs_filtered (const char *linebuffer, struct ui_file *stream) |
c906108c SS |
1999 | { |
2000 | fputs_maybe_filtered (linebuffer, stream, 1); | |
2001 | } | |
2002 | ||
2003 | int | |
fba45db2 | 2004 | putchar_unfiltered (int c) |
c906108c | 2005 | { |
11cf8741 | 2006 | char buf = c; |
d9fcf2fb | 2007 | ui_file_write (gdb_stdout, &buf, 1); |
c906108c SS |
2008 | return c; |
2009 | } | |
2010 | ||
d1f4cff8 AC |
2011 | /* Write character C to gdb_stdout using GDB's paging mechanism and return C. |
2012 | May return nonlocally. */ | |
2013 | ||
2014 | int | |
2015 | putchar_filtered (int c) | |
2016 | { | |
2017 | return fputc_filtered (c, gdb_stdout); | |
2018 | } | |
2019 | ||
c906108c | 2020 | int |
fba45db2 | 2021 | fputc_unfiltered (int c, struct ui_file *stream) |
c906108c | 2022 | { |
11cf8741 | 2023 | char buf = c; |
d9fcf2fb | 2024 | ui_file_write (stream, &buf, 1); |
c906108c SS |
2025 | return c; |
2026 | } | |
2027 | ||
2028 | int | |
fba45db2 | 2029 | fputc_filtered (int c, struct ui_file *stream) |
c906108c SS |
2030 | { |
2031 | char buf[2]; | |
2032 | ||
2033 | buf[0] = c; | |
2034 | buf[1] = 0; | |
2035 | fputs_filtered (buf, stream); | |
2036 | return c; | |
2037 | } | |
2038 | ||
2039 | /* puts_debug is like fputs_unfiltered, except it prints special | |
2040 | characters in printable fashion. */ | |
2041 | ||
2042 | void | |
fba45db2 | 2043 | puts_debug (char *prefix, char *string, char *suffix) |
c906108c SS |
2044 | { |
2045 | int ch; | |
2046 | ||
2047 | /* Print prefix and suffix after each line. */ | |
2048 | static int new_line = 1; | |
2049 | static int return_p = 0; | |
2050 | static char *prev_prefix = ""; | |
2051 | static char *prev_suffix = ""; | |
2052 | ||
2053 | if (*string == '\n') | |
2054 | return_p = 0; | |
2055 | ||
2056 | /* If the prefix is changing, print the previous suffix, a new line, | |
2057 | and the new prefix. */ | |
c5aa993b | 2058 | if ((return_p || (strcmp (prev_prefix, prefix) != 0)) && !new_line) |
c906108c | 2059 | { |
9846de1b JM |
2060 | fputs_unfiltered (prev_suffix, gdb_stdlog); |
2061 | fputs_unfiltered ("\n", gdb_stdlog); | |
2062 | fputs_unfiltered (prefix, gdb_stdlog); | |
c906108c SS |
2063 | } |
2064 | ||
2065 | /* Print prefix if we printed a newline during the previous call. */ | |
2066 | if (new_line) | |
2067 | { | |
2068 | new_line = 0; | |
9846de1b | 2069 | fputs_unfiltered (prefix, gdb_stdlog); |
c906108c SS |
2070 | } |
2071 | ||
2072 | prev_prefix = prefix; | |
2073 | prev_suffix = suffix; | |
2074 | ||
2075 | /* Output characters in a printable format. */ | |
2076 | while ((ch = *string++) != '\0') | |
2077 | { | |
2078 | switch (ch) | |
c5aa993b | 2079 | { |
c906108c SS |
2080 | default: |
2081 | if (isprint (ch)) | |
9846de1b | 2082 | fputc_unfiltered (ch, gdb_stdlog); |
c906108c SS |
2083 | |
2084 | else | |
9846de1b | 2085 | fprintf_unfiltered (gdb_stdlog, "\\x%02x", ch & 0xff); |
c906108c SS |
2086 | break; |
2087 | ||
c5aa993b JM |
2088 | case '\\': |
2089 | fputs_unfiltered ("\\\\", gdb_stdlog); | |
2090 | break; | |
2091 | case '\b': | |
2092 | fputs_unfiltered ("\\b", gdb_stdlog); | |
2093 | break; | |
2094 | case '\f': | |
2095 | fputs_unfiltered ("\\f", gdb_stdlog); | |
2096 | break; | |
2097 | case '\n': | |
2098 | new_line = 1; | |
2099 | fputs_unfiltered ("\\n", gdb_stdlog); | |
2100 | break; | |
2101 | case '\r': | |
2102 | fputs_unfiltered ("\\r", gdb_stdlog); | |
2103 | break; | |
2104 | case '\t': | |
2105 | fputs_unfiltered ("\\t", gdb_stdlog); | |
2106 | break; | |
2107 | case '\v': | |
2108 | fputs_unfiltered ("\\v", gdb_stdlog); | |
2109 | break; | |
2110 | } | |
c906108c SS |
2111 | |
2112 | return_p = ch == '\r'; | |
2113 | } | |
2114 | ||
2115 | /* Print suffix if we printed a newline. */ | |
2116 | if (new_line) | |
2117 | { | |
9846de1b JM |
2118 | fputs_unfiltered (suffix, gdb_stdlog); |
2119 | fputs_unfiltered ("\n", gdb_stdlog); | |
c906108c SS |
2120 | } |
2121 | } | |
2122 | ||
2123 | ||
2124 | /* Print a variable number of ARGS using format FORMAT. If this | |
2125 | information is going to put the amount written (since the last call | |
2126 | to REINITIALIZE_MORE_FILTER or the last page break) over the page size, | |
2127 | call prompt_for_continue to get the users permision to continue. | |
2128 | ||
2129 | Unlike fprintf, this function does not return a value. | |
2130 | ||
2131 | We implement three variants, vfprintf (takes a vararg list and stream), | |
2132 | fprintf (takes a stream to write on), and printf (the usual). | |
2133 | ||
2134 | Note also that a longjmp to top level may occur in this routine | |
2135 | (since prompt_for_continue may do so) so this routine should not be | |
2136 | called when cleanups are not in place. */ | |
2137 | ||
2138 | static void | |
fba45db2 KB |
2139 | vfprintf_maybe_filtered (struct ui_file *stream, const char *format, |
2140 | va_list args, int filter) | |
c906108c SS |
2141 | { |
2142 | char *linebuffer; | |
2143 | struct cleanup *old_cleanups; | |
2144 | ||
e623b504 | 2145 | linebuffer = xstrvprintf (format, args); |
b8c9b27d | 2146 | old_cleanups = make_cleanup (xfree, linebuffer); |
c906108c SS |
2147 | fputs_maybe_filtered (linebuffer, stream, filter); |
2148 | do_cleanups (old_cleanups); | |
2149 | } | |
2150 | ||
2151 | ||
2152 | void | |
fba45db2 | 2153 | vfprintf_filtered (struct ui_file *stream, const char *format, va_list args) |
c906108c SS |
2154 | { |
2155 | vfprintf_maybe_filtered (stream, format, args, 1); | |
2156 | } | |
2157 | ||
2158 | void | |
fba45db2 | 2159 | vfprintf_unfiltered (struct ui_file *stream, const char *format, va_list args) |
c906108c SS |
2160 | { |
2161 | char *linebuffer; | |
2162 | struct cleanup *old_cleanups; | |
2163 | ||
e623b504 | 2164 | linebuffer = xstrvprintf (format, args); |
b8c9b27d | 2165 | old_cleanups = make_cleanup (xfree, linebuffer); |
c906108c SS |
2166 | fputs_unfiltered (linebuffer, stream); |
2167 | do_cleanups (old_cleanups); | |
2168 | } | |
2169 | ||
2170 | void | |
fba45db2 | 2171 | vprintf_filtered (const char *format, va_list args) |
c906108c SS |
2172 | { |
2173 | vfprintf_maybe_filtered (gdb_stdout, format, args, 1); | |
2174 | } | |
2175 | ||
2176 | void | |
fba45db2 | 2177 | vprintf_unfiltered (const char *format, va_list args) |
c906108c SS |
2178 | { |
2179 | vfprintf_unfiltered (gdb_stdout, format, args); | |
2180 | } | |
2181 | ||
c906108c | 2182 | void |
8731e58e | 2183 | fprintf_filtered (struct ui_file *stream, const char *format, ...) |
c906108c SS |
2184 | { |
2185 | va_list args; | |
c906108c | 2186 | va_start (args, format); |
c906108c SS |
2187 | vfprintf_filtered (stream, format, args); |
2188 | va_end (args); | |
2189 | } | |
2190 | ||
c906108c | 2191 | void |
8731e58e | 2192 | fprintf_unfiltered (struct ui_file *stream, const char *format, ...) |
c906108c SS |
2193 | { |
2194 | va_list args; | |
c906108c | 2195 | va_start (args, format); |
c906108c SS |
2196 | vfprintf_unfiltered (stream, format, args); |
2197 | va_end (args); | |
2198 | } | |
2199 | ||
2200 | /* Like fprintf_filtered, but prints its result indented. | |
2201 | Called as fprintfi_filtered (spaces, stream, format, ...); */ | |
2202 | ||
c906108c | 2203 | void |
8731e58e AC |
2204 | fprintfi_filtered (int spaces, struct ui_file *stream, const char *format, |
2205 | ...) | |
c906108c SS |
2206 | { |
2207 | va_list args; | |
c906108c | 2208 | va_start (args, format); |
c906108c SS |
2209 | print_spaces_filtered (spaces, stream); |
2210 | ||
2211 | vfprintf_filtered (stream, format, args); | |
2212 | va_end (args); | |
2213 | } | |
2214 | ||
2215 | ||
c906108c | 2216 | void |
8731e58e | 2217 | printf_filtered (const char *format, ...) |
c906108c SS |
2218 | { |
2219 | va_list args; | |
c906108c | 2220 | va_start (args, format); |
c906108c SS |
2221 | vfprintf_filtered (gdb_stdout, format, args); |
2222 | va_end (args); | |
2223 | } | |
2224 | ||
2225 | ||
c906108c | 2226 | void |
8731e58e | 2227 | printf_unfiltered (const char *format, ...) |
c906108c SS |
2228 | { |
2229 | va_list args; | |
c906108c | 2230 | va_start (args, format); |
c906108c SS |
2231 | vfprintf_unfiltered (gdb_stdout, format, args); |
2232 | va_end (args); | |
2233 | } | |
2234 | ||
2235 | /* Like printf_filtered, but prints it's result indented. | |
2236 | Called as printfi_filtered (spaces, format, ...); */ | |
2237 | ||
c906108c | 2238 | void |
8731e58e | 2239 | printfi_filtered (int spaces, const char *format, ...) |
c906108c SS |
2240 | { |
2241 | va_list args; | |
c906108c | 2242 | va_start (args, format); |
c906108c SS |
2243 | print_spaces_filtered (spaces, gdb_stdout); |
2244 | vfprintf_filtered (gdb_stdout, format, args); | |
2245 | va_end (args); | |
2246 | } | |
2247 | ||
2248 | /* Easy -- but watch out! | |
2249 | ||
2250 | This routine is *not* a replacement for puts()! puts() appends a newline. | |
2251 | This one doesn't, and had better not! */ | |
2252 | ||
2253 | void | |
fba45db2 | 2254 | puts_filtered (const char *string) |
c906108c SS |
2255 | { |
2256 | fputs_filtered (string, gdb_stdout); | |
2257 | } | |
2258 | ||
2259 | void | |
fba45db2 | 2260 | puts_unfiltered (const char *string) |
c906108c SS |
2261 | { |
2262 | fputs_unfiltered (string, gdb_stdout); | |
2263 | } | |
2264 | ||
2265 | /* Return a pointer to N spaces and a null. The pointer is good | |
2266 | until the next call to here. */ | |
2267 | char * | |
fba45db2 | 2268 | n_spaces (int n) |
c906108c | 2269 | { |
392a587b JM |
2270 | char *t; |
2271 | static char *spaces = 0; | |
2272 | static int max_spaces = -1; | |
c906108c SS |
2273 | |
2274 | if (n > max_spaces) | |
2275 | { | |
2276 | if (spaces) | |
b8c9b27d | 2277 | xfree (spaces); |
c5aa993b JM |
2278 | spaces = (char *) xmalloc (n + 1); |
2279 | for (t = spaces + n; t != spaces;) | |
c906108c SS |
2280 | *--t = ' '; |
2281 | spaces[n] = '\0'; | |
2282 | max_spaces = n; | |
2283 | } | |
2284 | ||
2285 | return spaces + max_spaces - n; | |
2286 | } | |
2287 | ||
2288 | /* Print N spaces. */ | |
2289 | void | |
fba45db2 | 2290 | print_spaces_filtered (int n, struct ui_file *stream) |
c906108c SS |
2291 | { |
2292 | fputs_filtered (n_spaces (n), stream); | |
2293 | } | |
2294 | \f | |
4a351cef | 2295 | /* C++/ObjC demangler stuff. */ |
c906108c | 2296 | |
389e51db AC |
2297 | /* fprintf_symbol_filtered attempts to demangle NAME, a symbol in language |
2298 | LANG, using demangling args ARG_MODE, and print it filtered to STREAM. | |
2299 | If the name is not mangled, or the language for the name is unknown, or | |
2300 | demangling is off, the name is printed in its "raw" form. */ | |
c906108c SS |
2301 | |
2302 | void | |
8731e58e AC |
2303 | fprintf_symbol_filtered (struct ui_file *stream, char *name, |
2304 | enum language lang, int arg_mode) | |
c906108c SS |
2305 | { |
2306 | char *demangled; | |
2307 | ||
2308 | if (name != NULL) | |
2309 | { | |
2310 | /* If user wants to see raw output, no problem. */ | |
2311 | if (!demangle) | |
2312 | { | |
2313 | fputs_filtered (name, stream); | |
2314 | } | |
2315 | else | |
2316 | { | |
9a3d7dfd | 2317 | demangled = language_demangle (language_def (lang), name, arg_mode); |
c906108c SS |
2318 | fputs_filtered (demangled ? demangled : name, stream); |
2319 | if (demangled != NULL) | |
2320 | { | |
b8c9b27d | 2321 | xfree (demangled); |
c906108c SS |
2322 | } |
2323 | } | |
2324 | } | |
2325 | } | |
2326 | ||
2327 | /* Do a strcmp() type operation on STRING1 and STRING2, ignoring any | |
2328 | differences in whitespace. Returns 0 if they match, non-zero if they | |
2329 | don't (slightly different than strcmp()'s range of return values). | |
c5aa993b | 2330 | |
c906108c SS |
2331 | As an extra hack, string1=="FOO(ARGS)" matches string2=="FOO". |
2332 | This "feature" is useful when searching for matching C++ function names | |
2333 | (such as if the user types 'break FOO', where FOO is a mangled C++ | |
2334 | function). */ | |
2335 | ||
2336 | int | |
fba45db2 | 2337 | strcmp_iw (const char *string1, const char *string2) |
c906108c SS |
2338 | { |
2339 | while ((*string1 != '\0') && (*string2 != '\0')) | |
2340 | { | |
2341 | while (isspace (*string1)) | |
2342 | { | |
2343 | string1++; | |
2344 | } | |
2345 | while (isspace (*string2)) | |
2346 | { | |
2347 | string2++; | |
2348 | } | |
2349 | if (*string1 != *string2) | |
2350 | { | |
2351 | break; | |
2352 | } | |
2353 | if (*string1 != '\0') | |
2354 | { | |
2355 | string1++; | |
2356 | string2++; | |
2357 | } | |
2358 | } | |
2359 | return (*string1 != '\0' && *string1 != '(') || (*string2 != '\0'); | |
2360 | } | |
2de7ced7 | 2361 | |
0fe19209 DC |
2362 | /* This is like strcmp except that it ignores whitespace and treats |
2363 | '(' as the first non-NULL character in terms of ordering. Like | |
2364 | strcmp (and unlike strcmp_iw), it returns negative if STRING1 < | |
2365 | STRING2, 0 if STRING2 = STRING2, and positive if STRING1 > STRING2 | |
2366 | according to that ordering. | |
2367 | ||
2368 | If a list is sorted according to this function and if you want to | |
2369 | find names in the list that match some fixed NAME according to | |
2370 | strcmp_iw(LIST_ELT, NAME), then the place to start looking is right | |
2371 | where this function would put NAME. | |
2372 | ||
2373 | Here are some examples of why using strcmp to sort is a bad idea: | |
2374 | ||
2375 | Whitespace example: | |
2376 | ||
2377 | Say your partial symtab contains: "foo<char *>", "goo". Then, if | |
2378 | we try to do a search for "foo<char*>", strcmp will locate this | |
2379 | after "foo<char *>" and before "goo". Then lookup_partial_symbol | |
2380 | will start looking at strings beginning with "goo", and will never | |
2381 | see the correct match of "foo<char *>". | |
2382 | ||
2383 | Parenthesis example: | |
2384 | ||
2385 | In practice, this is less like to be an issue, but I'll give it a | |
2386 | shot. Let's assume that '$' is a legitimate character to occur in | |
2387 | symbols. (Which may well even be the case on some systems.) Then | |
2388 | say that the partial symbol table contains "foo$" and "foo(int)". | |
2389 | strcmp will put them in this order, since '$' < '('. Now, if the | |
2390 | user searches for "foo", then strcmp will sort "foo" before "foo$". | |
2391 | Then lookup_partial_symbol will notice that strcmp_iw("foo$", | |
2392 | "foo") is false, so it won't proceed to the actual match of | |
2393 | "foo(int)" with "foo". */ | |
2394 | ||
2395 | int | |
2396 | strcmp_iw_ordered (const char *string1, const char *string2) | |
2397 | { | |
2398 | while ((*string1 != '\0') && (*string2 != '\0')) | |
2399 | { | |
2400 | while (isspace (*string1)) | |
2401 | { | |
2402 | string1++; | |
2403 | } | |
2404 | while (isspace (*string2)) | |
2405 | { | |
2406 | string2++; | |
2407 | } | |
2408 | if (*string1 != *string2) | |
2409 | { | |
2410 | break; | |
2411 | } | |
2412 | if (*string1 != '\0') | |
2413 | { | |
2414 | string1++; | |
2415 | string2++; | |
2416 | } | |
2417 | } | |
2418 | ||
2419 | switch (*string1) | |
2420 | { | |
2421 | /* Characters are non-equal unless they're both '\0'; we want to | |
2422 | make sure we get the comparison right according to our | |
2423 | comparison in the cases where one of them is '\0' or '('. */ | |
2424 | case '\0': | |
2425 | if (*string2 == '\0') | |
2426 | return 0; | |
2427 | else | |
2428 | return -1; | |
2429 | case '(': | |
2430 | if (*string2 == '\0') | |
2431 | return 1; | |
2432 | else | |
2433 | return -1; | |
2434 | default: | |
2435 | if (*string2 == '(') | |
2436 | return 1; | |
2437 | else | |
2438 | return *string1 - *string2; | |
2439 | } | |
2440 | } | |
2441 | ||
2de7ced7 DJ |
2442 | /* A simple comparison function with opposite semantics to strcmp. */ |
2443 | ||
2444 | int | |
2445 | streq (const char *lhs, const char *rhs) | |
2446 | { | |
2447 | return !strcmp (lhs, rhs); | |
2448 | } | |
c906108c | 2449 | \f |
c5aa993b | 2450 | |
c906108c | 2451 | /* |
c5aa993b JM |
2452 | ** subset_compare() |
2453 | ** Answer whether string_to_compare is a full or partial match to | |
2454 | ** template_string. The partial match must be in sequence starting | |
2455 | ** at index 0. | |
2456 | */ | |
c906108c | 2457 | int |
fba45db2 | 2458 | subset_compare (char *string_to_compare, char *template_string) |
7a292a7a SS |
2459 | { |
2460 | int match; | |
8731e58e AC |
2461 | if (template_string != (char *) NULL && string_to_compare != (char *) NULL |
2462 | && strlen (string_to_compare) <= strlen (template_string)) | |
2463 | match = | |
2464 | (strncmp | |
2465 | (template_string, string_to_compare, strlen (string_to_compare)) == 0); | |
7a292a7a SS |
2466 | else |
2467 | match = 0; | |
2468 | return match; | |
2469 | } | |
c906108c SS |
2470 | |
2471 | ||
a14ed312 | 2472 | static void pagination_on_command (char *arg, int from_tty); |
7a292a7a | 2473 | static void |
fba45db2 | 2474 | pagination_on_command (char *arg, int from_tty) |
c906108c SS |
2475 | { |
2476 | pagination_enabled = 1; | |
2477 | } | |
2478 | ||
a14ed312 | 2479 | static void pagination_on_command (char *arg, int from_tty); |
7a292a7a | 2480 | static void |
fba45db2 | 2481 | pagination_off_command (char *arg, int from_tty) |
c906108c SS |
2482 | { |
2483 | pagination_enabled = 0; | |
2484 | } | |
c906108c | 2485 | \f |
c5aa993b | 2486 | |
c906108c | 2487 | void |
fba45db2 | 2488 | initialize_utils (void) |
c906108c SS |
2489 | { |
2490 | struct cmd_list_element *c; | |
2491 | ||
35096d9d AC |
2492 | add_setshow_uinteger_cmd ("width", class_support, &chars_per_line, _("\ |
2493 | Set number of characters gdb thinks are in a line."), _("\ | |
2494 | Show number of characters gdb thinks are in a line."), NULL, | |
2495 | set_width_command, | |
920d2a44 | 2496 | show_chars_per_line, |
35096d9d AC |
2497 | &setlist, &showlist); |
2498 | ||
2499 | add_setshow_uinteger_cmd ("height", class_support, &lines_per_page, _("\ | |
2500 | Set number of lines gdb thinks are in a page."), _("\ | |
2501 | Show number of lines gdb thinks are in a page."), NULL, | |
2502 | set_height_command, | |
920d2a44 | 2503 | show_lines_per_page, |
35096d9d | 2504 | &setlist, &showlist); |
c5aa993b | 2505 | |
c906108c SS |
2506 | init_page_info (); |
2507 | ||
5bf193a2 AC |
2508 | add_setshow_boolean_cmd ("demangle", class_support, &demangle, _("\ |
2509 | Set demangling of encoded C++/ObjC names when displaying symbols."), _("\ | |
2510 | Show demangling of encoded C++/ObjC names when displaying symbols."), NULL, | |
2511 | NULL, | |
920d2a44 | 2512 | show_demangle, |
5bf193a2 AC |
2513 | &setprintlist, &showprintlist); |
2514 | ||
2515 | add_setshow_boolean_cmd ("pagination", class_support, | |
2516 | &pagination_enabled, _("\ | |
2517 | Set state of pagination."), _("\ | |
2518 | Show state of pagination."), NULL, | |
2519 | NULL, | |
920d2a44 | 2520 | show_pagination_enabled, |
5bf193a2 | 2521 | &setlist, &showlist); |
4261bedc | 2522 | |
c906108c SS |
2523 | if (xdb_commands) |
2524 | { | |
c5aa993b | 2525 | add_com ("am", class_support, pagination_on_command, |
1bedd215 | 2526 | _("Enable pagination")); |
c5aa993b | 2527 | add_com ("sm", class_support, pagination_off_command, |
1bedd215 | 2528 | _("Disable pagination")); |
c906108c SS |
2529 | } |
2530 | ||
5bf193a2 AC |
2531 | add_setshow_boolean_cmd ("sevenbit-strings", class_support, |
2532 | &sevenbit_strings, _("\ | |
2533 | Set printing of 8-bit characters in strings as \\nnn."), _("\ | |
2534 | Show printing of 8-bit characters in strings as \\nnn."), NULL, | |
2535 | NULL, | |
920d2a44 | 2536 | show_sevenbit_strings, |
5bf193a2 AC |
2537 | &setprintlist, &showprintlist); |
2538 | ||
2539 | add_setshow_boolean_cmd ("asm-demangle", class_support, &asm_demangle, _("\ | |
2540 | Set demangling of C++/ObjC names in disassembly listings."), _("\ | |
2541 | Show demangling of C++/ObjC names in disassembly listings."), NULL, | |
2542 | NULL, | |
920d2a44 | 2543 | show_asm_demangle, |
5bf193a2 | 2544 | &setprintlist, &showprintlist); |
c906108c SS |
2545 | } |
2546 | ||
2547 | /* Machine specific function to handle SIGWINCH signal. */ | |
2548 | ||
2549 | #ifdef SIGWINCH_HANDLER_BODY | |
c5aa993b | 2550 | SIGWINCH_HANDLER_BODY |
c906108c | 2551 | #endif |
5683e87a | 2552 | /* print routines to handle variable size regs, etc. */ |
c906108c SS |
2553 | /* temporary storage using circular buffer */ |
2554 | #define NUMCELLS 16 | |
0759e0bf | 2555 | #define CELLSIZE 50 |
c5aa993b | 2556 | static char * |
fba45db2 | 2557 | get_cell (void) |
c906108c SS |
2558 | { |
2559 | static char buf[NUMCELLS][CELLSIZE]; | |
c5aa993b JM |
2560 | static int cell = 0; |
2561 | if (++cell >= NUMCELLS) | |
2562 | cell = 0; | |
c906108c SS |
2563 | return buf[cell]; |
2564 | } | |
2565 | ||
d4f3574e SS |
2566 | int |
2567 | strlen_paddr (void) | |
2568 | { | |
79496e2f | 2569 | return (TARGET_ADDR_BIT / 8 * 2); |
d4f3574e SS |
2570 | } |
2571 | ||
c5aa993b | 2572 | char * |
104c1213 | 2573 | paddr (CORE_ADDR addr) |
c906108c | 2574 | { |
79496e2f | 2575 | return phex (addr, TARGET_ADDR_BIT / 8); |
c906108c SS |
2576 | } |
2577 | ||
c5aa993b | 2578 | char * |
104c1213 | 2579 | paddr_nz (CORE_ADDR addr) |
c906108c | 2580 | { |
79496e2f | 2581 | return phex_nz (addr, TARGET_ADDR_BIT / 8); |
c906108c SS |
2582 | } |
2583 | ||
66bf4b3a AC |
2584 | const char * |
2585 | paddress (CORE_ADDR addr) | |
2586 | { | |
2587 | /* Truncate address to the size of a target address, avoiding shifts | |
2588 | larger or equal than the width of a CORE_ADDR. The local | |
2589 | variable ADDR_BIT stops the compiler reporting a shift overflow | |
2590 | when it won't occur. */ | |
2591 | /* NOTE: This assumes that the significant address information is | |
2592 | kept in the least significant bits of ADDR - the upper bits were | |
2593 | either zero or sign extended. Should ADDRESS_TO_POINTER() or | |
2594 | some ADDRESS_TO_PRINTABLE() be used to do the conversion? */ | |
2595 | ||
2596 | int addr_bit = TARGET_ADDR_BIT; | |
2597 | ||
2598 | if (addr_bit < (sizeof (CORE_ADDR) * HOST_CHAR_BIT)) | |
2599 | addr &= ((CORE_ADDR) 1 << addr_bit) - 1; | |
2600 | return hex_string (addr); | |
2601 | } | |
2602 | ||
8cf46f62 MK |
2603 | static char * |
2604 | decimal2str (char *sign, ULONGEST addr, int width) | |
104c1213 | 2605 | { |
8cf46f62 | 2606 | /* Steal code from valprint.c:print_decimal(). Should this worry |
104c1213 JM |
2607 | about the real size of addr as the above does? */ |
2608 | unsigned long temp[3]; | |
8cf46f62 MK |
2609 | char *str = get_cell (); |
2610 | ||
104c1213 JM |
2611 | int i = 0; |
2612 | do | |
2613 | { | |
2614 | temp[i] = addr % (1000 * 1000 * 1000); | |
2615 | addr /= (1000 * 1000 * 1000); | |
2616 | i++; | |
bb599908 | 2617 | width -= 9; |
104c1213 JM |
2618 | } |
2619 | while (addr != 0 && i < (sizeof (temp) / sizeof (temp[0]))); | |
8cf46f62 | 2620 | |
bb599908 PH |
2621 | width += 9; |
2622 | if (width < 0) | |
2623 | width = 0; | |
8cf46f62 | 2624 | |
104c1213 JM |
2625 | switch (i) |
2626 | { | |
2627 | case 1: | |
8cf46f62 | 2628 | xsnprintf (str, CELLSIZE, "%s%0*lu", sign, width, temp[0]); |
104c1213 JM |
2629 | break; |
2630 | case 2: | |
8cf46f62 MK |
2631 | xsnprintf (str, CELLSIZE, "%s%0*lu%09lu", sign, width, |
2632 | temp[1], temp[0]); | |
104c1213 JM |
2633 | break; |
2634 | case 3: | |
8cf46f62 MK |
2635 | xsnprintf (str, CELLSIZE, "%s%0*lu%09lu%09lu", sign, width, |
2636 | temp[2], temp[1], temp[0]); | |
bb599908 PH |
2637 | break; |
2638 | default: | |
2639 | internal_error (__FILE__, __LINE__, | |
e2e0b3e5 | 2640 | _("failed internal consistency check")); |
bb599908 | 2641 | } |
8cf46f62 MK |
2642 | |
2643 | return str; | |
bb599908 PH |
2644 | } |
2645 | ||
8cf46f62 MK |
2646 | static char * |
2647 | octal2str (ULONGEST addr, int width) | |
bb599908 PH |
2648 | { |
2649 | unsigned long temp[3]; | |
8cf46f62 MK |
2650 | char *str = get_cell (); |
2651 | ||
bb599908 PH |
2652 | int i = 0; |
2653 | do | |
2654 | { | |
2655 | temp[i] = addr % (0100000 * 0100000); | |
2656 | addr /= (0100000 * 0100000); | |
2657 | i++; | |
2658 | width -= 10; | |
2659 | } | |
2660 | while (addr != 0 && i < (sizeof (temp) / sizeof (temp[0]))); | |
8cf46f62 | 2661 | |
bb599908 PH |
2662 | width += 10; |
2663 | if (width < 0) | |
2664 | width = 0; | |
8cf46f62 | 2665 | |
bb599908 PH |
2666 | switch (i) |
2667 | { | |
2668 | case 1: | |
2669 | if (temp[0] == 0) | |
8cf46f62 | 2670 | xsnprintf (str, CELLSIZE, "%*o", width, 0); |
bb599908 | 2671 | else |
8cf46f62 | 2672 | xsnprintf (str, CELLSIZE, "0%0*lo", width, temp[0]); |
bb599908 PH |
2673 | break; |
2674 | case 2: | |
8cf46f62 | 2675 | xsnprintf (str, CELLSIZE, "0%0*lo%010lo", width, temp[1], temp[0]); |
bb599908 PH |
2676 | break; |
2677 | case 3: | |
8cf46f62 MK |
2678 | xsnprintf (str, CELLSIZE, "0%0*lo%010lo%010lo", width, |
2679 | temp[2], temp[1], temp[0]); | |
104c1213 JM |
2680 | break; |
2681 | default: | |
8731e58e | 2682 | internal_error (__FILE__, __LINE__, |
e2e0b3e5 | 2683 | _("failed internal consistency check")); |
104c1213 | 2684 | } |
8cf46f62 MK |
2685 | |
2686 | return str; | |
104c1213 JM |
2687 | } |
2688 | ||
2689 | char * | |
2690 | paddr_u (CORE_ADDR addr) | |
2691 | { | |
8cf46f62 | 2692 | return decimal2str ("", addr, 0); |
104c1213 JM |
2693 | } |
2694 | ||
2695 | char * | |
2696 | paddr_d (LONGEST addr) | |
2697 | { | |
104c1213 | 2698 | if (addr < 0) |
8cf46f62 | 2699 | return decimal2str ("-", -addr, 0); |
104c1213 | 2700 | else |
8cf46f62 | 2701 | return decimal2str ("", addr, 0); |
104c1213 JM |
2702 | } |
2703 | ||
8cf46f62 | 2704 | /* Eliminate warning from compiler on 32-bit systems. */ |
5683e87a AC |
2705 | static int thirty_two = 32; |
2706 | ||
104c1213 | 2707 | char * |
5683e87a | 2708 | phex (ULONGEST l, int sizeof_l) |
104c1213 | 2709 | { |
45a1e866 | 2710 | char *str; |
8cf46f62 | 2711 | |
5683e87a | 2712 | switch (sizeof_l) |
104c1213 JM |
2713 | { |
2714 | case 8: | |
45a1e866 | 2715 | str = get_cell (); |
8cf46f62 MK |
2716 | xsnprintf (str, CELLSIZE, "%08lx%08lx", |
2717 | (unsigned long) (l >> thirty_two), | |
2718 | (unsigned long) (l & 0xffffffff)); | |
104c1213 JM |
2719 | break; |
2720 | case 4: | |
45a1e866 | 2721 | str = get_cell (); |
8cf46f62 | 2722 | xsnprintf (str, CELLSIZE, "%08lx", (unsigned long) l); |
104c1213 JM |
2723 | break; |
2724 | case 2: | |
45a1e866 | 2725 | str = get_cell (); |
8cf46f62 | 2726 | xsnprintf (str, CELLSIZE, "%04x", (unsigned short) (l & 0xffff)); |
104c1213 JM |
2727 | break; |
2728 | default: | |
45a1e866 | 2729 | str = phex (l, sizeof (l)); |
5683e87a | 2730 | break; |
104c1213 | 2731 | } |
8cf46f62 | 2732 | |
5683e87a | 2733 | return str; |
104c1213 JM |
2734 | } |
2735 | ||
c5aa993b | 2736 | char * |
5683e87a | 2737 | phex_nz (ULONGEST l, int sizeof_l) |
c906108c | 2738 | { |
faf833ca | 2739 | char *str; |
8cf46f62 | 2740 | |
5683e87a | 2741 | switch (sizeof_l) |
c906108c | 2742 | { |
c5aa993b JM |
2743 | case 8: |
2744 | { | |
5683e87a | 2745 | unsigned long high = (unsigned long) (l >> thirty_two); |
faf833ca | 2746 | str = get_cell (); |
c5aa993b | 2747 | if (high == 0) |
8cf46f62 MK |
2748 | xsnprintf (str, CELLSIZE, "%lx", |
2749 | (unsigned long) (l & 0xffffffff)); | |
c5aa993b | 2750 | else |
8cf46f62 MK |
2751 | xsnprintf (str, CELLSIZE, "%lx%08lx", high, |
2752 | (unsigned long) (l & 0xffffffff)); | |
c906108c | 2753 | break; |
c5aa993b JM |
2754 | } |
2755 | case 4: | |
faf833ca | 2756 | str = get_cell (); |
8cf46f62 | 2757 | xsnprintf (str, CELLSIZE, "%lx", (unsigned long) l); |
c5aa993b JM |
2758 | break; |
2759 | case 2: | |
faf833ca | 2760 | str = get_cell (); |
8cf46f62 | 2761 | xsnprintf (str, CELLSIZE, "%x", (unsigned short) (l & 0xffff)); |
c5aa993b JM |
2762 | break; |
2763 | default: | |
faf833ca | 2764 | str = phex_nz (l, sizeof (l)); |
5683e87a | 2765 | break; |
c906108c | 2766 | } |
8cf46f62 | 2767 | |
5683e87a | 2768 | return str; |
c906108c | 2769 | } |
ac2e2ef7 | 2770 | |
0759e0bf AC |
2771 | /* Converts a LONGEST to a C-format hexadecimal literal and stores it |
2772 | in a static string. Returns a pointer to this string. */ | |
2773 | char * | |
2774 | hex_string (LONGEST num) | |
2775 | { | |
2776 | char *result = get_cell (); | |
8cf46f62 | 2777 | xsnprintf (result, CELLSIZE, "0x%s", phex_nz (num, sizeof (num))); |
0759e0bf AC |
2778 | return result; |
2779 | } | |
2780 | ||
2781 | /* Converts a LONGEST number to a C-format hexadecimal literal and | |
2782 | stores it in a static string. Returns a pointer to this string | |
2783 | that is valid until the next call. The number is padded on the | |
2784 | left with 0s to at least WIDTH characters. */ | |
2785 | char * | |
2786 | hex_string_custom (LONGEST num, int width) | |
2787 | { | |
2788 | char *result = get_cell (); | |
2789 | char *result_end = result + CELLSIZE - 1; | |
2790 | const char *hex = phex_nz (num, sizeof (num)); | |
2791 | int hex_len = strlen (hex); | |
2792 | ||
2793 | if (hex_len > width) | |
2794 | width = hex_len; | |
2795 | if (width + 2 >= CELLSIZE) | |
2796 | internal_error (__FILE__, __LINE__, | |
e2e0b3e5 | 2797 | _("hex_string_custom: insufficient space to store result")); |
0759e0bf AC |
2798 | |
2799 | strcpy (result_end - width - 2, "0x"); | |
2800 | memset (result_end - width, '0', width); | |
2801 | strcpy (result_end - hex_len, hex); | |
2802 | return result_end - width - 2; | |
2803 | } | |
ac2e2ef7 | 2804 | |
bb599908 PH |
2805 | /* Convert VAL to a numeral in the given radix. For |
2806 | * radix 10, IS_SIGNED may be true, indicating a signed quantity; | |
2807 | * otherwise VAL is interpreted as unsigned. If WIDTH is supplied, | |
2808 | * it is the minimum width (0-padded if needed). USE_C_FORMAT means | |
2809 | * to use C format in all cases. If it is false, then 'x' | |
2810 | * and 'o' formats do not include a prefix (0x or leading 0). */ | |
2811 | ||
2812 | char * | |
2813 | int_string (LONGEST val, int radix, int is_signed, int width, | |
2814 | int use_c_format) | |
2815 | { | |
2816 | switch (radix) | |
2817 | { | |
2818 | case 16: | |
2819 | { | |
2820 | char *result; | |
2821 | if (width == 0) | |
2822 | result = hex_string (val); | |
2823 | else | |
2824 | result = hex_string_custom (val, width); | |
2825 | if (! use_c_format) | |
2826 | result += 2; | |
2827 | return result; | |
2828 | } | |
2829 | case 10: | |
2830 | { | |
bb599908 | 2831 | if (is_signed && val < 0) |
8cf46f62 | 2832 | return decimal2str ("-", -val, width); |
bb599908 | 2833 | else |
8cf46f62 | 2834 | return decimal2str ("", val, width); |
bb599908 PH |
2835 | } |
2836 | case 8: | |
2837 | { | |
8cf46f62 | 2838 | char *result = octal2str (val, width); |
bb599908 PH |
2839 | if (use_c_format || val == 0) |
2840 | return result; | |
2841 | else | |
2842 | return result + 1; | |
2843 | } | |
2844 | default: | |
2845 | internal_error (__FILE__, __LINE__, | |
e2e0b3e5 | 2846 | _("failed internal consistency check")); |
bb599908 PH |
2847 | } |
2848 | } | |
2849 | ||
03dd37c3 AC |
2850 | /* Convert a CORE_ADDR into a string. */ |
2851 | const char * | |
2852 | core_addr_to_string (const CORE_ADDR addr) | |
49b563f9 KS |
2853 | { |
2854 | char *str = get_cell (); | |
2855 | strcpy (str, "0x"); | |
2856 | strcat (str, phex (addr, sizeof (addr))); | |
2857 | return str; | |
2858 | } | |
2859 | ||
2860 | const char * | |
2861 | core_addr_to_string_nz (const CORE_ADDR addr) | |
03dd37c3 AC |
2862 | { |
2863 | char *str = get_cell (); | |
2864 | strcpy (str, "0x"); | |
2865 | strcat (str, phex_nz (addr, sizeof (addr))); | |
2866 | return str; | |
2867 | } | |
2868 | ||
2869 | /* Convert a string back into a CORE_ADDR. */ | |
2870 | CORE_ADDR | |
2871 | string_to_core_addr (const char *my_string) | |
2872 | { | |
2873 | CORE_ADDR addr = 0; | |
2874 | if (my_string[0] == '0' && tolower (my_string[1]) == 'x') | |
2875 | { | |
2876 | /* Assume that it is in decimal. */ | |
2877 | int i; | |
2878 | for (i = 2; my_string[i] != '\0'; i++) | |
2879 | { | |
2880 | if (isdigit (my_string[i])) | |
2881 | addr = (my_string[i] - '0') + (addr * 16); | |
8731e58e | 2882 | else if (isxdigit (my_string[i])) |
03dd37c3 AC |
2883 | addr = (tolower (my_string[i]) - 'a' + 0xa) + (addr * 16); |
2884 | else | |
e2e0b3e5 | 2885 | internal_error (__FILE__, __LINE__, _("invalid hex")); |
03dd37c3 AC |
2886 | } |
2887 | } | |
2888 | else | |
2889 | { | |
2890 | /* Assume that it is in decimal. */ | |
2891 | int i; | |
2892 | for (i = 0; my_string[i] != '\0'; i++) | |
2893 | { | |
2894 | if (isdigit (my_string[i])) | |
2895 | addr = (my_string[i] - '0') + (addr * 10); | |
2896 | else | |
e2e0b3e5 | 2897 | internal_error (__FILE__, __LINE__, _("invalid decimal")); |
03dd37c3 AC |
2898 | } |
2899 | } | |
2900 | return addr; | |
2901 | } | |
58d370e0 TT |
2902 | |
2903 | char * | |
2904 | gdb_realpath (const char *filename) | |
2905 | { | |
70d35819 AC |
2906 | /* Method 1: The system has a compile time upper bound on a filename |
2907 | path. Use that and realpath() to canonicalize the name. This is | |
2908 | the most common case. Note that, if there isn't a compile time | |
2909 | upper bound, you want to avoid realpath() at all costs. */ | |
a4db0f07 | 2910 | #if defined(HAVE_REALPATH) |
70d35819 | 2911 | { |
a4db0f07 | 2912 | # if defined (PATH_MAX) |
70d35819 | 2913 | char buf[PATH_MAX]; |
a4db0f07 RH |
2914 | # define USE_REALPATH |
2915 | # elif defined (MAXPATHLEN) | |
70d35819 | 2916 | char buf[MAXPATHLEN]; |
a4db0f07 RH |
2917 | # define USE_REALPATH |
2918 | # endif | |
70d35819 | 2919 | # if defined (USE_REALPATH) |
82c0260e | 2920 | const char *rp = realpath (filename, buf); |
70d35819 AC |
2921 | if (rp == NULL) |
2922 | rp = filename; | |
2923 | return xstrdup (rp); | |
70d35819 | 2924 | # endif |
6f88d630 | 2925 | } |
a4db0f07 RH |
2926 | #endif /* HAVE_REALPATH */ |
2927 | ||
70d35819 AC |
2928 | /* Method 2: The host system (i.e., GNU) has the function |
2929 | canonicalize_file_name() which malloc's a chunk of memory and | |
2930 | returns that, use that. */ | |
2931 | #if defined(HAVE_CANONICALIZE_FILE_NAME) | |
2932 | { | |
2933 | char *rp = canonicalize_file_name (filename); | |
2934 | if (rp == NULL) | |
2935 | return xstrdup (filename); | |
2936 | else | |
2937 | return rp; | |
2938 | } | |
58d370e0 | 2939 | #endif |
70d35819 | 2940 | |
6411e720 AC |
2941 | /* FIXME: cagney/2002-11-13: |
2942 | ||
2943 | Method 2a: Use realpath() with a NULL buffer. Some systems, due | |
2944 | to the problems described in in method 3, have modified their | |
2945 | realpath() implementation so that it will allocate a buffer when | |
2946 | NULL is passed in. Before this can be used, though, some sort of | |
2947 | configure time test would need to be added. Otherwize the code | |
2948 | will likely core dump. */ | |
2949 | ||
70d35819 AC |
2950 | /* Method 3: Now we're getting desperate! The system doesn't have a |
2951 | compile time buffer size and no alternative function. Query the | |
2952 | OS, using pathconf(), for the buffer limit. Care is needed | |
2953 | though, some systems do not limit PATH_MAX (return -1 for | |
2954 | pathconf()) making it impossible to pass a correctly sized buffer | |
2955 | to realpath() (it could always overflow). On those systems, we | |
2956 | skip this. */ | |
2957 | #if defined (HAVE_REALPATH) && defined (HAVE_UNISTD_H) && defined(HAVE_ALLOCA) | |
2958 | { | |
2959 | /* Find out the max path size. */ | |
2960 | long path_max = pathconf ("/", _PC_PATH_MAX); | |
2961 | if (path_max > 0) | |
2962 | { | |
2963 | /* PATH_MAX is bounded. */ | |
2964 | char *buf = alloca (path_max); | |
2965 | char *rp = realpath (filename, buf); | |
2966 | return xstrdup (rp ? rp : filename); | |
2967 | } | |
2968 | } | |
2969 | #endif | |
2970 | ||
2971 | /* This system is a lost cause, just dup the buffer. */ | |
2972 | return xstrdup (filename); | |
58d370e0 | 2973 | } |
303c8ebd JB |
2974 | |
2975 | /* Return a copy of FILENAME, with its directory prefix canonicalized | |
2976 | by gdb_realpath. */ | |
2977 | ||
2978 | char * | |
2979 | xfullpath (const char *filename) | |
2980 | { | |
2981 | const char *base_name = lbasename (filename); | |
2982 | char *dir_name; | |
2983 | char *real_path; | |
2984 | char *result; | |
2985 | ||
2986 | /* Extract the basename of filename, and return immediately | |
2987 | a copy of filename if it does not contain any directory prefix. */ | |
2988 | if (base_name == filename) | |
2989 | return xstrdup (filename); | |
2990 | ||
2991 | dir_name = alloca ((size_t) (base_name - filename + 2)); | |
2992 | /* Allocate enough space to store the dir_name + plus one extra | |
2993 | character sometimes needed under Windows (see below), and | |
2994 | then the closing \000 character */ | |
2995 | strncpy (dir_name, filename, base_name - filename); | |
2996 | dir_name[base_name - filename] = '\000'; | |
2997 | ||
2998 | #ifdef HAVE_DOS_BASED_FILE_SYSTEM | |
2999 | /* We need to be careful when filename is of the form 'd:foo', which | |
3000 | is equivalent of d:./foo, which is totally different from d:/foo. */ | |
8731e58e | 3001 | if (strlen (dir_name) == 2 && isalpha (dir_name[0]) && dir_name[1] == ':') |
303c8ebd JB |
3002 | { |
3003 | dir_name[2] = '.'; | |
3004 | dir_name[3] = '\000'; | |
3005 | } | |
3006 | #endif | |
3007 | ||
3008 | /* Canonicalize the directory prefix, and build the resulting | |
3009 | filename. If the dirname realpath already contains an ending | |
3010 | directory separator, avoid doubling it. */ | |
3011 | real_path = gdb_realpath (dir_name); | |
3012 | if (IS_DIR_SEPARATOR (real_path[strlen (real_path) - 1])) | |
1754f103 | 3013 | result = concat (real_path, base_name, (char *)NULL); |
303c8ebd | 3014 | else |
1754f103 | 3015 | result = concat (real_path, SLASH_STRING, base_name, (char *)NULL); |
303c8ebd JB |
3016 | |
3017 | xfree (real_path); | |
3018 | return result; | |
3019 | } | |
5b5d99cf JB |
3020 | |
3021 | ||
3022 | /* This is the 32-bit CRC function used by the GNU separate debug | |
3023 | facility. An executable may contain a section named | |
3024 | .gnu_debuglink, which holds the name of a separate executable file | |
3025 | containing its debug info, and a checksum of that file's contents, | |
3026 | computed using this function. */ | |
3027 | unsigned long | |
3028 | gnu_debuglink_crc32 (unsigned long crc, unsigned char *buf, size_t len) | |
3029 | { | |
8731e58e AC |
3030 | static const unsigned long crc32_table[256] = { |
3031 | 0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, | |
3032 | 0x706af48f, 0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, | |
3033 | 0xe0d5e91e, 0x97d2d988, 0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, | |
3034 | 0x90bf1d91, 0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de, | |
3035 | 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7, 0x136c9856, | |
3036 | 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9, | |
3037 | 0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, | |
3038 | 0xa2677172, 0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, | |
3039 | 0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, | |
3040 | 0x45df5c75, 0xdcd60dcf, 0xabd13d59, 0x26d930ac, 0x51de003a, | |
3041 | 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423, 0xcfba9599, | |
3042 | 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924, | |
3043 | 0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, | |
3044 | 0x01db7106, 0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, | |
3045 | 0x9fbfe4a5, 0xe8b8d433, 0x7807c9a2, 0x0f00f934, 0x9609a88e, | |
3046 | 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01, | |
3047 | 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e, 0x6c0695ed, | |
3048 | 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950, | |
3049 | 0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, | |
3050 | 0xfbd44c65, 0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, | |
3051 | 0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, | |
3052 | 0x346ed9fc, 0xad678846, 0xda60b8d0, 0x44042d73, 0x33031de5, | |
3053 | 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa, 0xbe0b1010, | |
3054 | 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f, | |
3055 | 0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, | |
3056 | 0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, | |
3057 | 0x03b6e20c, 0x74b1d29a, 0xead54739, 0x9dd277af, 0x04db2615, | |
3058 | 0x73dc1683, 0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8, | |
3059 | 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1, 0xf00f9344, | |
3060 | 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb, | |
3061 | 0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, | |
3062 | 0x67dd4acc, 0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, | |
3063 | 0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, | |
3064 | 0xa6bc5767, 0x3fb506dd, 0x48b2364b, 0xd80d2bda, 0xaf0a1b4c, | |
3065 | 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55, 0x316e8eef, | |
3066 | 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236, | |
3067 | 0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, | |
3068 | 0xb2bd0b28, 0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, | |
3069 | 0x2cd99e8b, 0x5bdeae1d, 0x9b64c2b0, 0xec63f226, 0x756aa39c, | |
3070 | 0x026d930a, 0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713, | |
3071 | 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38, 0x92d28e9b, | |
3072 | 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242, | |
3073 | 0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, | |
3074 | 0x18b74777, 0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, | |
3075 | 0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45, 0xa00ae278, | |
3076 | 0xd70dd2ee, 0x4e048354, 0x3903b3c2, 0xa7672661, 0xd06016f7, | |
3077 | 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc, 0x40df0b66, | |
3078 | 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9, | |
3079 | 0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, | |
3080 | 0xcdd70693, 0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, | |
3081 | 0x5d681b02, 0x2a6f2b94, 0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, | |
3082 | 0x2d02ef8d | |
3083 | }; | |
5b5d99cf JB |
3084 | unsigned char *end; |
3085 | ||
3086 | crc = ~crc & 0xffffffff; | |
3087 | for (end = buf + len; buf < end; ++buf) | |
3088 | crc = crc32_table[(crc ^ *buf) & 0xff] ^ (crc >> 8); | |
3089 | return ~crc & 0xffffffff;; | |
3090 | } | |
5b03f266 AC |
3091 | |
3092 | ULONGEST | |
3093 | align_up (ULONGEST v, int n) | |
3094 | { | |
3095 | /* Check that N is really a power of two. */ | |
3096 | gdb_assert (n && (n & (n-1)) == 0); | |
3097 | return (v + n - 1) & -n; | |
3098 | } | |
3099 | ||
3100 | ULONGEST | |
3101 | align_down (ULONGEST v, int n) | |
3102 | { | |
3103 | /* Check that N is really a power of two. */ | |
3104 | gdb_assert (n && (n & (n-1)) == 0); | |
3105 | return (v & -n); | |
3106 | } | |
ae5a43e0 DJ |
3107 | |
3108 | /* Allocation function for the libiberty hash table which uses an | |
3109 | obstack. The obstack is passed as DATA. */ | |
3110 | ||
3111 | void * | |
3112 | hashtab_obstack_allocate (void *data, size_t size, size_t count) | |
3113 | { | |
3114 | unsigned int total = size * count; | |
3115 | void *ptr = obstack_alloc ((struct obstack *) data, total); | |
3116 | memset (ptr, 0, total); | |
3117 | return ptr; | |
3118 | } | |
3119 | ||
3120 | /* Trivial deallocation function for the libiberty splay tree and hash | |
3121 | table - don't deallocate anything. Rely on later deletion of the | |
3122 | obstack. DATA will be the obstack, although it is not needed | |
3123 | here. */ | |
3124 | ||
3125 | void | |
3126 | dummy_obstack_deallocate (void *object, void *data) | |
3127 | { | |
3128 | return; | |
3129 | } |