1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326
|
/* Definitions for BFD wrappers used by GDB.
Copyright (C) 2011-2024 Free Software Foundation, Inc.
This file is part of GDB.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include "gdb_bfd.h"
#include "event-top.h"
#include "ui-out.h"
#include "cli/cli-cmds.h"
#include "hashtab.h"
#include "gdbsupport/filestuff.h"
#ifdef HAVE_MMAP
#include <sys/mman.h>
#ifndef MAP_FAILED
#define MAP_FAILED ((void *) -1)
#endif
#endif
#include "target.h"
#include "gdbsupport/fileio.h"
#include "inferior.h"
#include "cli/cli-style.h"
#include <unordered_map>
#include "gdbsupport/unordered_set.h"
#if CXX_STD_THREAD
#include <mutex>
/* Lock held when doing BFD operations. A recursive mutex is used
because we use this mutex internally and also for BFD, just to make
life a bit simpler, and we may sometimes hold it while calling into
BFD. */
static std::recursive_mutex gdb_bfd_mutex;
/* BFD locking function. */
static bool
gdb_bfd_lock (void *ignore)
{
gdb_bfd_mutex.lock ();
return true;
}
/* BFD unlocking function. */
static bool
gdb_bfd_unlock (void *ignore)
{
gdb_bfd_mutex.unlock ();
return true;
}
#endif /* CXX_STD_THREAD */
/* An object of this type is stored in the section's user data when
mapping a section. */
struct gdb_bfd_section_data
{
/* Size of the data. */
size_t size;
/* If the data was mmapped, this is the length of the map. */
size_t map_len;
/* The data. If NULL, the section data has not been read. */
void *data;
/* If the data was mmapped, this is the map address. */
void *map_addr;
};
/* A hash set holding every BFD that gdb knows about. This is not
to be confused with 'gdb_bfd_cache', which is used for sharing
BFDs; in contrast, this hash is used just to implement
"maint info bfd". */
static gdb::unordered_set<bfd *> all_bfds;
/* An object of this type is stored in each BFD's user data. */
struct gdb_bfd_data
{
/* Note that if ST is nullptr, then we simply fill in zeroes. */
gdb_bfd_data (bfd *abfd, struct stat *st)
: mtime (st == nullptr ? 0 : st->st_mtime),
size (st == nullptr ? 0 : st->st_size),
inode (st == nullptr ? 0 : st->st_ino),
device_id (st == nullptr ? 0 : st->st_dev),
relocation_computed (0),
needs_relocations (0),
crc_computed (0)
{
}
~gdb_bfd_data ()
{
}
/* The reference count. */
int refc = 1;
/* The mtime of the BFD at the point the cache entry was made. */
time_t mtime;
/* The file size (in bytes) at the point the cache entry was made. */
off_t size;
/* The inode of the file at the point the cache entry was made. */
ino_t inode;
/* The device id of the file at the point the cache entry was made. */
dev_t device_id;
/* This is true if we have determined whether this BFD has any
sections requiring relocation. */
unsigned int relocation_computed : 1;
/* This is true if any section needs relocation. */
unsigned int needs_relocations : 1;
/* This is true if we have successfully computed the file's CRC. */
unsigned int crc_computed : 1;
/* The file's CRC. */
unsigned long crc = 0;
/* If the BFD comes from an archive, this points to the archive's
BFD. Otherwise, this is NULL. */
bfd *archive_bfd = nullptr;
/* Table of all the bfds this bfd has included. */
std::vector<gdb_bfd_ref_ptr> included_bfds;
/* The registry. */
registry<bfd> registry_fields;
#if CXX_STD_THREAD
/* Most of the locking needed for multi-threaded operation is
handled by BFD itself. However, the current BFD model is that
locking is only needed for global operations -- but it turned out
that the background DWARF reader could race with the auto-load
code reading the .debug_gdb_scripts section from the same BFD.
This lock is the fix: wrappers for important BFD functions will
acquire this lock before performing operations that might modify
the state of this BFD. */
std::mutex per_bfd_mutex;
#endif
};
registry<bfd> *
registry_accessor<bfd>::get (bfd *abfd)
{
struct gdb_bfd_data *gdata = (struct gdb_bfd_data *) bfd_usrdata (abfd);
return &gdata->registry_fields;
}
/* When true gdb will reuse an existing bfd object if the filename,
modification time, and file size all match. */
static bool bfd_sharing = true;
static void
show_bfd_sharing (struct ui_file *file, int from_tty,
struct cmd_list_element *c, const char *value)
{
gdb_printf (file, _("BFD sharing is %s.\n"), value);
}
/* When true debugging of the bfd caches is enabled. */
static bool debug_bfd_cache;
/* Print an "bfd-cache" debug statement. */
#define bfd_cache_debug_printf(fmt, ...) \
debug_prefixed_printf_cond (debug_bfd_cache, "bfd-cache", fmt, ##__VA_ARGS__)
static void
show_bfd_cache_debug (struct ui_file *file, int from_tty,
struct cmd_list_element *c, const char *value)
{
gdb_printf (file, _("BFD cache debugging is %s.\n"), value);
}
/* The type of an object being looked up in gdb_bfd_cache. We use
htab's capability of storing one kind of object (BFD in this case)
and using a different sort of object for searching. */
struct gdb_bfd_cache_search
{
/* The filename. */
const char *filename;
/* The mtime. */
time_t mtime;
/* The file size (in bytes). */
off_t size;
/* The inode of the file. */
ino_t inode;
/* The device id of the file. */
dev_t device_id;
};
struct bfd_cache_hash
{
using is_transparent = void;
std::size_t operator() (bfd *abfd) const noexcept
{
/* It is simplest to just hash the filename. */
return htab_hash_string (bfd_get_filename (abfd));
}
std::size_t operator() (const gdb_bfd_cache_search &search) const noexcept
{ return htab_hash_string (search.filename); }
};
struct bfd_cache_eq
{
using is_transparent = void;
bool operator() (bfd *lhs, bfd *rhs) const noexcept
{ return lhs == rhs; }
bool operator() (const gdb_bfd_cache_search &s, bfd *abfd) const noexcept
{
auto gdata = static_cast<gdb_bfd_data *> (bfd_usrdata (abfd));
return (gdata->mtime == s.mtime
&& gdata->size == s.size
&& gdata->inode == s.inode
&& gdata->device_id == s.device_id
&& strcmp (bfd_get_filename (abfd), s.filename) == 0);
}
};
/* A hash set storing all the BFDs maintained in the cache. */
static gdb::unordered_set<bfd *, bfd_cache_hash, bfd_cache_eq> gdb_bfd_cache;
/* See gdb_bfd.h. */
int
is_target_filename (const char *name)
{
return startswith (name, TARGET_SYSROOT_PREFIX);
}
/* See gdb_bfd.h. */
int
gdb_bfd_has_target_filename (struct bfd *abfd)
{
return is_target_filename (bfd_get_filename (abfd));
}
/* For `gdb_bfd_open_from_target_memory`. An object that manages the
details of a BFD in target memory. */
struct target_buffer : public gdb_bfd_iovec_base
{
/* Constructor. BASE and SIZE define where the BFD can be found in
target memory. */
target_buffer (CORE_ADDR base, ULONGEST size)
: m_base (base),
m_size (size),
m_filename (xstrprintf ("<in-memory@%s-%s>",
core_addr_to_string_nz (m_base),
core_addr_to_string_nz (m_base + m_size)))
{
}
/* Return the size of the in-memory BFD file. */
ULONGEST size () const
{ return m_size; }
/* Return the base address of the in-memory BFD file. */
CORE_ADDR base () const
{ return m_base; }
/* Return a generated filename for the in-memory BFD file. The generated
name will include the begin and end address of the in-memory file. */
const char *filename () const
{ return m_filename.get (); }
file_ptr read (bfd *abfd, void *buffer, file_ptr nbytes,
file_ptr offset) override;
int stat (struct bfd *abfd, struct stat *sb) override;
private:
/* The base address of the in-memory BFD file. */
CORE_ADDR m_base;
/* The size (in-bytes) of the in-memory BFD file. */
ULONGEST m_size;
/* Holds the generated name of the in-memory BFD file. */
gdb::unique_xmalloc_ptr<char> m_filename;
};
/* For `gdb_bfd_open_from_target_memory`. For reading the file, we just need to
pass through to target_read_memory and fix up the arguments and return
values. */
file_ptr
target_buffer::read (struct bfd *abfd, void *buf,
file_ptr nbytes, file_ptr offset)
{
/* If this read will read all of the file, limit it to just the rest. */
if (offset + nbytes > size ())
nbytes = size () - offset;
/* If there are no more bytes left, we've reached EOF. */
if (nbytes == 0)
return 0;
int err = target_read_memory (base () + offset, (gdb_byte *) buf, nbytes);
if (err)
return -1;
return nbytes;
}
/* For `gdb_bfd_open_from_target_memory`. For statting the file, we only
support the st_size attribute. */
int
target_buffer::stat (struct bfd *abfd, struct stat *sb)
{
memset (sb, 0, sizeof (struct stat));
sb->st_size = size ();
return 0;
}
/* See gdb_bfd.h. */
gdb_bfd_ref_ptr
gdb_bfd_open_from_target_memory (CORE_ADDR addr, ULONGEST size,
const char *target)
{
std::unique_ptr<target_buffer> buffer
= std::make_unique<target_buffer> (addr, size);
return gdb_bfd_openr_iovec (buffer->filename (), target,
[&] (bfd *nbfd)
{
return buffer.release ();
});
}
/* An object that manages the underlying stream for a BFD, using
target file I/O. */
struct target_fileio_stream : public gdb_bfd_iovec_base
{
target_fileio_stream (bfd *nbfd, int fd)
: m_bfd (nbfd),
m_fd (fd)
{
}
~target_fileio_stream ();
file_ptr read (bfd *abfd, void *buffer, file_ptr nbytes,
file_ptr offset) override;
int stat (struct bfd *abfd, struct stat *sb) override;
private:
/* The BFD. Saved for the destructor. */
bfd *m_bfd;
/* The file descriptor. */
int m_fd;
};
/* Wrapper for target_fileio_open suitable for use as a helper
function for gdb_bfd_openr_iovec. */
static target_fileio_stream *
gdb_bfd_iovec_fileio_open (struct bfd *abfd, inferior *inf, bool warn_if_slow)
{
const char *filename = bfd_get_filename (abfd);
int fd;
fileio_error target_errno;
gdb_assert (is_target_filename (filename));
fd = target_fileio_open (inf,
filename + strlen (TARGET_SYSROOT_PREFIX),
FILEIO_O_RDONLY, 0, warn_if_slow,
&target_errno);
if (fd == -1)
{
errno = fileio_error_to_host (target_errno);
bfd_set_error (bfd_error_system_call);
return NULL;
}
return new target_fileio_stream (abfd, fd);
}
/* Wrapper for target_fileio_pread. */
file_ptr
target_fileio_stream::read (struct bfd *abfd, void *buf,
file_ptr nbytes, file_ptr offset)
{
fileio_error target_errno;
file_ptr pos, bytes;
pos = 0;
while (nbytes > pos)
{
QUIT;
bytes = target_fileio_pread (m_fd, (gdb_byte *) buf + pos,
nbytes - pos, offset + pos,
&target_errno);
if (bytes == 0)
/* Success, but no bytes, means end-of-file. */
break;
if (bytes == -1)
{
errno = fileio_error_to_host (target_errno);
bfd_set_error (bfd_error_system_call);
return -1;
}
pos += bytes;
}
return pos;
}
/* Warn that it wasn't possible to close a bfd for file NAME, because
of REASON. */
static void
gdb_bfd_close_warning (const char *name, const char *reason)
{
warning (_("cannot close \"%s\": %s"), name, reason);
}
/* Wrapper for target_fileio_close. */
target_fileio_stream::~target_fileio_stream ()
{
fileio_error target_errno;
/* Ignore errors on close. These may happen with remote
targets if the connection has already been torn down. */
try
{
target_fileio_close (m_fd, &target_errno);
}
catch (const gdb_exception &ex)
{
/* Also avoid crossing exceptions over bfd. */
gdb_bfd_close_warning (bfd_get_filename (m_bfd),
ex.message->c_str ());
}
}
/* Wrapper for target_fileio_fstat. */
int
target_fileio_stream::stat (struct bfd *abfd, struct stat *sb)
{
fileio_error target_errno;
int result;
result = target_fileio_fstat (m_fd, sb, &target_errno);
if (result == -1)
{
errno = fileio_error_to_host (target_errno);
bfd_set_error (bfd_error_system_call);
}
return result;
}
/* A helper function to initialize the data that gdb attaches to each
BFD. */
static void
gdb_bfd_init_data (struct bfd *abfd, struct stat *st)
{
struct gdb_bfd_data *gdata;
gdb_assert (bfd_usrdata (abfd) == nullptr);
/* Ask BFD to decompress sections in bfd_get_full_section_contents. */
abfd->flags |= BFD_DECOMPRESS;
gdata = new gdb_bfd_data (abfd, st);
bfd_set_usrdata (abfd, gdata);
/* This is the first we've seen it, so add it to the hash table. */
bool inserted = all_bfds.emplace (abfd).second;
gdb_assert (inserted);
}
/* See gdb_bfd.h. */
gdb_bfd_ref_ptr
gdb_bfd_open (const char *name, const char *target, int fd,
bool warn_if_slow)
{
bfd *abfd;
struct stat st;
if (is_target_filename (name))
{
if (!target_filesystem_is_local ())
{
gdb_assert (fd == -1);
auto open = [&] (bfd *nbfd) -> gdb_bfd_iovec_base *
{
return gdb_bfd_iovec_fileio_open (nbfd, current_inferior (),
warn_if_slow);
};
return gdb_bfd_openr_iovec (name, target, open);
}
name += strlen (TARGET_SYSROOT_PREFIX);
}
#if CXX_STD_THREAD
std::lock_guard<std::recursive_mutex> guard (gdb_bfd_mutex);
#endif
if (fd == -1)
{
fd = gdb_open_cloexec (name, O_RDONLY | O_BINARY, 0).release ();
if (fd == -1)
{
bfd_set_error (bfd_error_system_call);
return NULL;
}
}
if (fstat (fd, &st) < 0)
{
/* Weird situation here -- don't cache if we can't stat. */
bfd_cache_debug_printf ("Could not stat %s - not caching", name);
abfd = bfd_fopen (name, target, FOPEN_RB, fd);
if (abfd == nullptr)
return nullptr;
return gdb_bfd_ref_ptr::new_reference (abfd);
}
gdb_bfd_cache_search search;
search.filename = name;
search.mtime = st.st_mtime;
search.size = st.st_size;
search.inode = st.st_ino;
search.device_id = st.st_dev;
if (bfd_sharing)
{
if (auto iter = gdb_bfd_cache.find (search);
iter != gdb_bfd_cache.end ())
{
abfd = *iter;
bfd_cache_debug_printf ("Reusing cached bfd %s for %s",
host_address_to_string (abfd),
bfd_get_filename (abfd));
close (fd);
return gdb_bfd_ref_ptr::new_reference (abfd);
}
}
abfd = bfd_fopen (name, target, FOPEN_RB, fd);
if (abfd == NULL)
return NULL;
bfd_set_cacheable (abfd, 1);
bfd_cache_debug_printf ("Creating new bfd %s for %s",
host_address_to_string (abfd),
bfd_get_filename (abfd));
/* It's important to pass the already-computed stat info here,
rather than, say, calling gdb_bfd_ref_ptr::new_reference. BFD by
default will "stat" the file each time bfd_get_mtime is called --
and since we will enter it into the hash table using this
mtime, if the file changed at the wrong moment, the race would
lead to a hash table corruption. */
gdb_bfd_init_data (abfd, &st);
if (bfd_sharing)
{
bool inserted = gdb_bfd_cache.emplace (abfd).second;
gdb_assert (inserted);
}
return gdb_bfd_ref_ptr (abfd);
}
/* A helper function that releases any section data attached to the
BFD. */
static void
free_one_bfd_section (asection *sectp)
{
struct gdb_bfd_section_data *sect
= (struct gdb_bfd_section_data *) bfd_section_userdata (sectp);
if (sect != NULL && sect->data != NULL)
{
#ifdef HAVE_MMAP
if (sect->map_addr != NULL)
{
int res;
res = munmap (sect->map_addr, sect->map_len);
gdb_assert (res == 0);
}
else
#endif
xfree (sect->data);
}
}
/* Close ABFD, and warn if that fails. */
static int
gdb_bfd_close_or_warn (struct bfd *abfd)
{
int ret;
gdb::unique_xmalloc_ptr<char> name
= make_unique_xstrdup (bfd_get_filename (abfd));
for (asection *sect : gdb_bfd_sections (abfd))
free_one_bfd_section (sect);
ret = bfd_close (abfd);
if (!ret)
gdb_bfd_close_warning (name.get (),
bfd_errmsg (bfd_get_error ()));
return ret;
}
/* See gdb_bfd.h. */
void
gdb_bfd_ref (struct bfd *abfd)
{
struct gdb_bfd_data *gdata;
if (abfd == NULL)
return;
#if CXX_STD_THREAD
std::lock_guard<std::recursive_mutex> guard (gdb_bfd_mutex);
#endif
gdata = (struct gdb_bfd_data *) bfd_usrdata (abfd);
bfd_cache_debug_printf ("Increase reference count on bfd %s (%s)",
host_address_to_string (abfd),
bfd_get_filename (abfd));
if (gdata != NULL)
{
gdata->refc += 1;
return;
}
/* Caching only happens via gdb_bfd_open, so passing nullptr here is
fine. */
gdb_bfd_init_data (abfd, nullptr);
}
/* See gdb_bfd.h. */
void
gdb_bfd_unref (struct bfd *abfd)
{
struct gdb_bfd_data *gdata;
bfd *archive_bfd;
if (abfd == NULL)
return;
#if CXX_STD_THREAD
std::lock_guard<std::recursive_mutex> guard (gdb_bfd_mutex);
#endif
gdata = (struct gdb_bfd_data *) bfd_usrdata (abfd);
gdb_assert (gdata->refc >= 1);
gdata->refc -= 1;
if (gdata->refc > 0)
{
bfd_cache_debug_printf ("Decrease reference count on bfd %s (%s)",
host_address_to_string (abfd),
bfd_get_filename (abfd));
return;
}
bfd_cache_debug_printf ("Delete final reference count on bfd %s (%s)",
host_address_to_string (abfd),
bfd_get_filename (abfd));
archive_bfd = gdata->archive_bfd;
if (bfd_get_filename (abfd) != nullptr)
gdb_bfd_cache.erase (abfd);
delete gdata;
bfd_set_usrdata (abfd, NULL); /* Paranoia. */
all_bfds.erase (abfd);
gdb_bfd_close_or_warn (abfd);
gdb_bfd_unref (archive_bfd);
}
/* A helper function that returns the section data descriptor
associated with SECTION. If no such descriptor exists, a new one
is allocated and cleared. */
static struct gdb_bfd_section_data *
get_section_descriptor (asection *section)
{
struct gdb_bfd_section_data *result;
result = (struct gdb_bfd_section_data *) bfd_section_userdata (section);
if (result == NULL)
{
result = ((struct gdb_bfd_section_data *)
bfd_zalloc (section->owner, sizeof (*result)));
bfd_set_section_userdata (section, result);
}
return result;
}
/* See gdb_bfd.h. */
const gdb_byte *
gdb_bfd_map_section (asection *sectp, bfd_size_type *size)
{
bfd *abfd;
struct gdb_bfd_section_data *descriptor;
bfd_byte *data;
gdb_assert ((sectp->flags & SEC_RELOC) == 0);
gdb_assert (size != NULL);
abfd = sectp->owner;
#if CXX_STD_THREAD
gdb_bfd_data *gdata = (gdb_bfd_data *) bfd_usrdata (abfd);
std::lock_guard<std::mutex> guard (gdata->per_bfd_mutex);
#endif
descriptor = get_section_descriptor (sectp);
/* If the data was already read for this BFD, just reuse it. */
if (descriptor->data != NULL)
goto done;
#ifdef HAVE_MMAP
if (!bfd_is_section_compressed (abfd, sectp))
{
/* The page size, used when mmapping. */
static int pagesize;
if (pagesize == 0)
pagesize = getpagesize ();
/* Only try to mmap sections which are large enough: we don't want
to waste space due to fragmentation. */
if (bfd_section_size (sectp) > 4 * pagesize)
{
descriptor->size = bfd_section_size (sectp);
descriptor->data = bfd_mmap (abfd, 0, descriptor->size, PROT_READ,
MAP_PRIVATE, sectp->filepos,
&descriptor->map_addr,
&descriptor->map_len);
if ((caddr_t)descriptor->data != MAP_FAILED)
{
#if HAVE_POSIX_MADVISE
posix_madvise (descriptor->map_addr, descriptor->map_len,
POSIX_MADV_WILLNEED);
#endif
goto done;
}
/* On failure, clear out the section data and try again. */
memset (descriptor, 0, sizeof (*descriptor));
}
}
#endif /* HAVE_MMAP */
/* Handle compressed sections, or ordinary uncompressed sections in
the no-mmap case. */
descriptor->size = bfd_section_size (sectp);
descriptor->data = NULL;
data = NULL;
if (!bfd_get_full_section_contents (abfd, sectp, &data))
{
warning (_("Can't read data for section '%s' in file '%s'"),
bfd_section_name (sectp),
bfd_get_filename (abfd));
/* Set size to 0 to prevent further attempts to read the invalid
section. */
*size = 0;
return NULL;
}
descriptor->data = data;
done:
gdb_assert (descriptor->data != NULL);
*size = descriptor->size;
return (const gdb_byte *) descriptor->data;
}
/* Return 32-bit CRC for ABFD. If successful store it to *FILE_CRC_RETURN and
return 1. Otherwise print a warning and return 0. ABFD seek position is
not preserved. */
static int
get_file_crc (bfd *abfd, unsigned long *file_crc_return)
{
uint32_t file_crc = 0;
if (bfd_seek (abfd, 0, SEEK_SET) != 0)
{
warning (_("Problem reading \"%s\" for CRC: %s"),
bfd_get_filename (abfd), bfd_errmsg (bfd_get_error ()));
return 0;
}
for (;;)
{
gdb_byte buffer[8 * 1024];
bfd_size_type count;
count = bfd_read (buffer, sizeof (buffer), abfd);
if (count == (bfd_size_type) -1)
{
warning (_("Problem reading \"%s\" for CRC: %s"),
bfd_get_filename (abfd), bfd_errmsg (bfd_get_error ()));
return 0;
}
if (count == 0)
break;
file_crc = bfd_calc_gnu_debuglink_crc32 (file_crc, buffer, count);
}
*file_crc_return = file_crc;
return 1;
}
/* See gdb_bfd.h. */
int
gdb_bfd_crc (struct bfd *abfd, unsigned long *crc_out)
{
struct gdb_bfd_data *gdata = (struct gdb_bfd_data *) bfd_usrdata (abfd);
if (!gdata->crc_computed)
gdata->crc_computed = get_file_crc (abfd, &gdata->crc);
if (gdata->crc_computed)
*crc_out = gdata->crc;
return gdata->crc_computed;
}
/* See gdb_bfd.h. */
gdb_bfd_ref_ptr
gdb_bfd_fopen (const char *filename, const char *target, const char *mode,
int fd)
{
bfd *result = bfd_fopen (filename, target, mode, fd);
if (result != nullptr)
bfd_set_cacheable (result, 1);
return gdb_bfd_ref_ptr::new_reference (result);
}
/* See gdb_bfd.h. */
gdb_bfd_ref_ptr
gdb_bfd_openr (const char *filename, const char *target)
{
bfd *result = bfd_openr (filename, target);
return gdb_bfd_ref_ptr::new_reference (result);
}
/* See gdb_bfd.h. */
gdb_bfd_ref_ptr
gdb_bfd_openw (const char *filename, const char *target)
{
bfd *result = bfd_openw (filename, target);
return gdb_bfd_ref_ptr::new_reference (result);
}
/* See gdb_bfd.h. */
gdb_bfd_ref_ptr
gdb_bfd_openr_iovec (const char *filename, const char *target,
gdb_iovec_opener_ftype open_fn)
{
auto do_open = [] (bfd *nbfd, void *closure) -> void *
{
auto real_opener = static_cast<gdb_iovec_opener_ftype *> (closure);
/* Prevent exceptions from escaping to C code and triggering an abort. */
auto res = catch_exceptions<gdb_bfd_iovec_base *, nullptr> ([&]
{
return (*real_opener) (nbfd);
});
if (res == nullptr)
{
errno = EIO;
bfd_set_error (bfd_error_system_call);
}
return res;
};
auto read_trampoline = [] (bfd *nbfd, void *stream, void *buf,
file_ptr nbytes, file_ptr offset) -> file_ptr
{
gdb_bfd_iovec_base *obj = static_cast<gdb_bfd_iovec_base *> (stream);
/* Prevent exceptions from escaping to C code and triggering an abort. */
auto res = catch_exceptions<long int, -1> ([&]
{
return obj->read (nbfd, buf, nbytes, offset);
});
if (res == -1)
{
errno = EIO;
bfd_set_error (bfd_error_system_call);
}
return res;
};
auto stat_trampoline = [] (struct bfd *abfd, void *stream,
struct stat *sb) -> int
{
gdb_bfd_iovec_base *obj = static_cast<gdb_bfd_iovec_base *> (stream);
/* Prevent exceptions from escaping to C code and triggering an abort. */
auto res = catch_exceptions<int, -1> ([&]
{
return obj->stat (abfd, sb);
});
if (res == -1)
{
errno = EIO;
bfd_set_error (bfd_error_system_call);
}
return res;
};
auto close_trampoline = [] (struct bfd *nbfd, void *stream) -> int
{
gdb_bfd_iovec_base *obj = static_cast<gdb_bfd_iovec_base *> (stream);
delete obj;
/* Success. */
return 0;
};
bfd *result = bfd_openr_iovec (filename, target,
do_open, &open_fn,
read_trampoline, close_trampoline,
stat_trampoline);
return gdb_bfd_ref_ptr::new_reference (result);
}
/* See gdb_bfd.h. */
void
gdb_bfd_mark_parent (bfd *child, bfd *parent)
{
struct gdb_bfd_data *gdata;
gdb_bfd_ref (child);
/* No need to stash the filename here, because we also keep a
reference on the parent archive. */
gdata = (struct gdb_bfd_data *) bfd_usrdata (child);
if (gdata->archive_bfd == NULL)
{
gdata->archive_bfd = parent;
gdb_bfd_ref (parent);
}
else
gdb_assert (gdata->archive_bfd == parent);
}
/* See gdb_bfd.h. */
gdb_bfd_ref_ptr
gdb_bfd_openr_next_archived_file (bfd *archive, bfd *previous)
{
bfd *result = bfd_openr_next_archived_file (archive, previous);
if (result)
gdb_bfd_mark_parent (result, archive);
return gdb_bfd_ref_ptr (result);
}
/* See gdb_bfd.h. */
void
gdb_bfd_record_inclusion (bfd *includer, bfd *includee)
{
struct gdb_bfd_data *gdata;
gdata = (struct gdb_bfd_data *) bfd_usrdata (includer);
gdata->included_bfds.push_back (gdb_bfd_ref_ptr::new_reference (includee));
}
static_assert (ARRAY_SIZE (_bfd_std_section) == 4);
/* See gdb_bfd.h. */
int
gdb_bfd_section_index (bfd *abfd, asection *section)
{
if (section == NULL)
return -1;
else if (section == bfd_com_section_ptr)
return bfd_count_sections (abfd);
else if (section == bfd_und_section_ptr)
return bfd_count_sections (abfd) + 1;
else if (section == bfd_abs_section_ptr)
return bfd_count_sections (abfd) + 2;
else if (section == bfd_ind_section_ptr)
return bfd_count_sections (abfd) + 3;
return section->index;
}
/* See gdb_bfd.h. */
int
gdb_bfd_count_sections (bfd *abfd)
{
return bfd_count_sections (abfd) + 4;
}
/* See gdb_bfd.h. */
int
gdb_bfd_requires_relocations (bfd *abfd)
{
struct gdb_bfd_data *gdata = (struct gdb_bfd_data *) bfd_usrdata (abfd);
if (gdata->relocation_computed == 0)
{
asection *sect;
for (sect = abfd->sections; sect != NULL; sect = sect->next)
if ((sect->flags & SEC_RELOC) != 0)
{
gdata->needs_relocations = 1;
break;
}
gdata->relocation_computed = 1;
}
return gdata->needs_relocations;
}
/* See gdb_bfd.h. */
bool
gdb_bfd_get_full_section_contents (bfd *abfd, asection *section,
gdb::byte_vector *contents)
{
#if CXX_STD_THREAD
gdb_bfd_data *gdata = (gdb_bfd_data *) bfd_usrdata (abfd);
std::lock_guard<std::mutex> guard (gdata->per_bfd_mutex);
#endif
bfd_size_type section_size = bfd_section_size (section);
contents->resize (section_size);
return bfd_get_section_contents (abfd, section, contents->data (), 0,
section_size);
}
/* See gdb_bfd.h. */
int
gdb_bfd_stat (bfd *abfd, struct stat *sbuf)
{
#if CXX_STD_THREAD
gdb_bfd_data *gdata = (gdb_bfd_data *) bfd_usrdata (abfd);
std::lock_guard<std::mutex> guard (gdata->per_bfd_mutex);
#endif
return bfd_stat (abfd, sbuf);
}
/* See gdb_bfd.h. */
long
gdb_bfd_get_mtime (bfd *abfd)
{
#if CXX_STD_THREAD
gdb_bfd_data *gdata = (gdb_bfd_data *) bfd_usrdata (abfd);
std::lock_guard<std::mutex> guard (gdata->per_bfd_mutex);
#endif
return bfd_get_mtime (abfd);
}
#define AMBIGUOUS_MESS1 ".\nMatching formats:"
#define AMBIGUOUS_MESS2 \
".\nUse \"set gnutarget format-name\" to specify the format."
/* See gdb_bfd.h. */
std::string
gdb_bfd_errmsg (bfd_error_type error_tag, char **matching)
{
char **p;
/* Check if errmsg just need simple return. */
if (error_tag != bfd_error_file_ambiguously_recognized || matching == NULL)
return bfd_errmsg (error_tag);
std::string ret (bfd_errmsg (error_tag));
ret += AMBIGUOUS_MESS1;
for (p = matching; *p; p++)
{
ret += " ";
ret += *p;
}
ret += AMBIGUOUS_MESS2;
xfree (matching);
return ret;
}
/* Implement the 'maint info bfd' command. */
static void
maintenance_info_bfds (const char *arg, int from_tty)
{
struct ui_out *uiout = current_uiout;
ui_out_emit_table table_emitter (uiout, 3, -1, "bfds");
uiout->table_header (10, ui_left, "refcount", "Refcount");
uiout->table_header (18, ui_left, "addr", "Address");
uiout->table_header (40, ui_left, "filename", "Filename");
uiout->table_body ();
for (auto abfd : all_bfds)
{
auto gdata = static_cast<gdb_bfd_data *> (bfd_usrdata (abfd));
ui_out_emit_tuple tuple_emitter (uiout, nullptr);
uiout->field_signed ("refcount", gdata->refc);
uiout->field_string ("addr", host_address_to_string (abfd));
uiout->field_string ("filename", bfd_get_filename (abfd),
file_name_style.style ());
uiout->text ("\n");
}
}
/* BFD related per-inferior data. */
struct bfd_inferior_data
{
std::unordered_map<std::string, unsigned long> bfd_error_string_counts;
};
/* Per-inferior data key. */
static const registry<inferior>::key<bfd_inferior_data> bfd_inferior_data_key;
/* Fetch per-inferior BFD data. It always returns a valid pointer to
a bfd_inferior_data struct. */
static struct bfd_inferior_data *
get_bfd_inferior_data (struct inferior *inf)
{
struct bfd_inferior_data *data;
data = bfd_inferior_data_key.get (inf);
if (data == nullptr)
data = bfd_inferior_data_key.emplace (inf);
return data;
}
/* Increment the BFD error count for STR and return the updated
count. */
static unsigned long
increment_bfd_error_count (const std::string &str)
{
#if CXX_STD_THREAD
std::lock_guard<std::recursive_mutex> guard (gdb_bfd_mutex);
#endif
struct bfd_inferior_data *bid = get_bfd_inferior_data (current_inferior ());
auto &map = bid->bfd_error_string_counts;
return ++map[str];
}
/* A print callback for bfd_print_error. */
static int ATTRIBUTE_PRINTF (2, 0)
print_error_callback (void *stream, const char *fmt, ...)
{
string_file *file = (string_file *) stream;
size_t in_size = file->size ();
va_list ap;
va_start (ap, fmt);
file->vprintf (fmt, ap);
va_end (ap);
return file->size () - in_size;
}
/* Define a BFD error handler which will suppress the printing of
messages which have been printed once already. This is done on a
per-inferior basis. */
static void
gdb_bfd_error_handler (const char *fmt, va_list ap)
{
string_file output;
bfd_print_error (print_error_callback, &output, fmt, ap);
std::string str = output.release ();
if (increment_bfd_error_count (str) > 1)
return;
warning ("%s", str.c_str ());
}
/* See gdb_bfd.h. */
void
gdb_bfd_init ()
{
if (bfd_init () == BFD_INIT_MAGIC)
{
#if CXX_STD_THREAD
if (bfd_thread_init (gdb_bfd_lock, gdb_bfd_unlock, nullptr))
#endif
return;
}
error (_("fatal error: libbfd ABI mismatch"));
}
void _initialize_gdb_bfd ();
void
_initialize_gdb_bfd ()
{
add_cmd ("bfds", class_maintenance, maintenance_info_bfds, _("\
List the BFDs that are currently open."),
&maintenanceinfolist);
add_setshow_boolean_cmd ("bfd-sharing", no_class,
&bfd_sharing, _("\
Set whether gdb will share bfds that appear to be the same file."), _("\
Show whether gdb will share bfds that appear to be the same file."), _("\
When enabled gdb will reuse existing bfds rather than reopening the\n\
same file. To decide if two files are the same then gdb compares the\n\
filename, file size, file modification time, and file inode."),
NULL,
&show_bfd_sharing,
&maintenance_set_cmdlist,
&maintenance_show_cmdlist);
add_setshow_boolean_cmd ("bfd-cache", class_maintenance,
&debug_bfd_cache,
_("Set bfd cache debugging."),
_("Show bfd cache debugging."),
_("\
When non-zero, bfd cache specific debugging is enabled."),
NULL,
&show_bfd_cache_debug,
&setdebuglist, &showdebuglist);
/* Hook the BFD error/warning handler to limit amount of output. */
bfd_set_error_handler (gdb_bfd_error_handler);
}
|