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