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
|
/* GDB routines for manipulating objfiles.
Copyright (C) 1992-2024 Free Software Foundation, Inc.
Contributed by Cygnus Support, using pieces from other GDB modules.
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/>. */
/* This file contains support routines for creating, manipulating, and
destroying objfile structures. */
#include "bfd.h"
#include "symtab.h"
#include "symfile.h"
#include "objfiles.h"
#include "target.h"
#include "expression.h"
#include "parser-defs.h"
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include "gdbsupport/gdb_obstack.h"
#include "hashtab.h"
#include "breakpoint.h"
#include "block.h"
#include "dictionary.h"
#include "source.h"
#include "addrmap.h"
#include "arch-utils.h"
#include "exec.h"
#include "observable.h"
#include "complaints.h"
#include "gdb_bfd.h"
#include "btrace.h"
#include "gdbsupport/pathstuff.h"
#include <algorithm>
/* Externally visible variables that are owned by this module.
See declarations in objfile.h for more info. */
struct objfile_pspace_info
{
objfile_pspace_info () = default;
~objfile_pspace_info ();
struct obj_section **sections = nullptr;
int num_sections = 0;
/* Nonzero if object files have been added since the section map
was last updated. */
int new_objfiles_available = 0;
/* Nonzero if the section map MUST be updated before use. */
int section_map_dirty = 0;
/* Nonzero if section map updates should be inhibited if possible. */
int inhibit_updates = 0;
};
/* Per-program-space data key. */
static const registry<program_space>::key<objfile_pspace_info>
objfiles_pspace_data;
objfile_pspace_info::~objfile_pspace_info ()
{
xfree (sections);
}
/* Get the current svr4 data. If none is found yet, add it now. This
function always returns a valid object. */
static struct objfile_pspace_info *
get_objfile_pspace_data (struct program_space *pspace)
{
struct objfile_pspace_info *info;
info = objfiles_pspace_data.get (pspace);
if (info == NULL)
info = objfiles_pspace_data.emplace (pspace);
return info;
}
/* Per-BFD data key. */
static const registry<bfd>::key<objfile_per_bfd_storage> objfiles_bfd_data;
objfile_per_bfd_storage::~objfile_per_bfd_storage ()
{
}
/* Create the per-BFD storage object for OBJFILE. If ABFD is not
NULL, and it already has a per-BFD storage object, use that.
Otherwise, allocate a new per-BFD storage object. */
void
set_objfile_per_bfd (struct objfile *objfile)
{
bfd *abfd = objfile->obfd.get ();
struct objfile_per_bfd_storage *storage = NULL;
if (abfd != NULL)
storage = objfiles_bfd_data.get (abfd);
if (storage == NULL)
{
storage = new objfile_per_bfd_storage (abfd);
/* If the object requires gdb to do relocations, we simply fall
back to not sharing data across users. These cases are rare
enough that this seems reasonable. */
if (abfd != NULL && !gdb_bfd_requires_relocations (abfd))
objfiles_bfd_data.set (abfd, storage);
else
objfile->per_bfd_storage.reset (storage);
/* Look up the gdbarch associated with the BFD. */
if (abfd != NULL)
storage->gdbarch = gdbarch_from_bfd (abfd);
}
objfile->per_bfd = storage;
}
/* Set the objfile's per-BFD notion of the "main" name and
language. */
void
set_objfile_main_name (struct objfile *objfile,
const char *name, enum language lang)
{
if (objfile->per_bfd->name_of_main == NULL
|| strcmp (objfile->per_bfd->name_of_main, name) != 0)
objfile->per_bfd->name_of_main
= obstack_strdup (&objfile->per_bfd->storage_obstack, name);
objfile->per_bfd->language_of_main = lang;
}
/* Helper structure to map blocks to static link properties in hash tables. */
struct static_link_htab_entry
{
const struct block *block;
const struct dynamic_prop *static_link;
};
/* Return a hash code for struct static_link_htab_entry *P. */
static hashval_t
static_link_htab_entry_hash (const void *p)
{
const struct static_link_htab_entry *e
= (const struct static_link_htab_entry *) p;
return htab_hash_pointer (e->block);
}
/* Return whether P1 an P2 (pointers to struct static_link_htab_entry) are
mappings for the same block. */
static int
static_link_htab_entry_eq (const void *p1, const void *p2)
{
const struct static_link_htab_entry *e1
= (const struct static_link_htab_entry *) p1;
const struct static_link_htab_entry *e2
= (const struct static_link_htab_entry *) p2;
return e1->block == e2->block;
}
/* Register STATIC_LINK as the static link for BLOCK, which is part of OBJFILE.
Must not be called more than once for each BLOCK. */
void
objfile_register_static_link (struct objfile *objfile,
const struct block *block,
const struct dynamic_prop *static_link)
{
void **slot;
struct static_link_htab_entry lookup_entry;
struct static_link_htab_entry *entry;
if (objfile->static_links == NULL)
objfile->static_links.reset (htab_create_alloc
(1, &static_link_htab_entry_hash, static_link_htab_entry_eq, NULL,
xcalloc, xfree));
/* Create a slot for the mapping, make sure it's the first mapping for this
block and then create the mapping itself. */
lookup_entry.block = block;
slot = htab_find_slot (objfile->static_links.get (), &lookup_entry, INSERT);
gdb_assert (*slot == NULL);
entry = XOBNEW (&objfile->objfile_obstack, static_link_htab_entry);
entry->block = block;
entry->static_link = static_link;
*slot = (void *) entry;
}
/* Look for a static link for BLOCK, which is part of OBJFILE. Return NULL if
none was found. */
const struct dynamic_prop *
objfile_lookup_static_link (struct objfile *objfile,
const struct block *block)
{
struct static_link_htab_entry *entry;
struct static_link_htab_entry lookup_entry;
if (objfile->static_links == NULL)
return NULL;
lookup_entry.block = block;
entry = ((struct static_link_htab_entry *)
htab_find (objfile->static_links.get (), &lookup_entry));
if (entry == NULL)
return NULL;
gdb_assert (entry->block == block);
return entry->static_link;
}
/* Build up the section table that the objfile references. The
objfile contains pointers to the start of the table
(objfile->sections) and to the first location after the end of the
table (objfile->sections_end). */
static void
add_to_objfile_sections (struct bfd *abfd, struct bfd_section *asect,
struct objfile *objfile, int force)
{
struct obj_section *section;
if (!force)
{
flagword aflag;
aflag = bfd_section_flags (asect);
if (!(aflag & SEC_ALLOC))
return;
}
section = &objfile->sections_start[gdb_bfd_section_index (abfd, asect)];
section->objfile = objfile;
section->the_bfd_section = asect;
section->ovly_mapped = 0;
}
/* Builds a section table for OBJFILE.
Note that the OFFSET and OVLY_MAPPED in each table entry are
initialized to zero. */
void
build_objfile_section_table (struct objfile *objfile)
{
int count = gdb_bfd_count_sections (objfile->obfd.get ());
objfile->sections_start = OBSTACK_CALLOC (&objfile->objfile_obstack,
count,
struct obj_section);
objfile->sections_end = (objfile->sections_start + count);
for (asection *sect : gdb_bfd_sections (objfile->obfd))
add_to_objfile_sections (objfile->obfd.get (), sect, objfile, 0);
/* See gdb_bfd_section_index. */
add_to_objfile_sections (objfile->obfd.get (), bfd_com_section_ptr,
objfile, 1);
add_to_objfile_sections (objfile->obfd.get (), bfd_und_section_ptr,
objfile, 1);
add_to_objfile_sections (objfile->obfd.get (), bfd_abs_section_ptr,
objfile, 1);
add_to_objfile_sections (objfile->obfd.get (), bfd_ind_section_ptr,
objfile, 1);
}
/* Given a pointer to an initialized bfd (ABFD) and some flag bits,
initialize the new objfile as best we can and link it into the list
of all known objfiles.
NAME should contain original non-canonicalized filename or other
identifier as entered by user. If there is no better source use
bfd_get_filename (ABFD). NAME may be NULL only if ABFD is NULL.
NAME content is copied into returned objfile.
The FLAGS word contains various bits (OBJF_*) that can be taken as
requests for specific operations. Other bits like OBJF_SHARED are
simply copied through to the new objfile flags member. */
objfile::objfile (gdb_bfd_ref_ptr bfd_, const char *name, objfile_flags flags_)
: flags (flags_),
m_pspace (current_program_space),
obfd (std::move (bfd_))
{
const char *expanded_name;
std::string name_holder;
if (name == NULL)
{
gdb_assert (obfd == nullptr);
gdb_assert ((flags & OBJF_NOT_FILENAME) != 0);
expanded_name = "<<anonymous objfile>>";
}
else if ((flags & OBJF_NOT_FILENAME) != 0
|| is_target_filename (name))
expanded_name = name;
else
{
name_holder = gdb_abspath (name);
expanded_name = name_holder.c_str ();
}
original_name = obstack_strdup (&objfile_obstack, expanded_name);
/* Update the per-objfile information that comes from the bfd, ensuring
that any data that is reference is saved in the per-objfile data
region. */
if (obfd != nullptr)
{
mtime = bfd_get_mtime (obfd.get ());
/* Build section table. */
build_objfile_section_table (this);
}
set_objfile_per_bfd (this);
}
/* If there is a valid and known entry point, function fills *ENTRY_P with it
and returns non-zero; otherwise it returns zero. */
int
entry_point_address_query (CORE_ADDR *entry_p)
{
objfile *objf = current_program_space->symfile_object_file;
if (objf == NULL || !objf->per_bfd->ei.entry_point_p)
return 0;
int idx = objf->per_bfd->ei.the_bfd_section_index;
*entry_p = objf->per_bfd->ei.entry_point + objf->section_offsets[idx];
return 1;
}
/* Get current entry point address. Call error if it is not known. */
CORE_ADDR
entry_point_address (void)
{
CORE_ADDR retval;
if (!entry_point_address_query (&retval))
error (_("Entry point address is not known."));
return retval;
}
separate_debug_iterator &
separate_debug_iterator::operator++ ()
{
gdb_assert (m_objfile != nullptr);
struct objfile *res;
/* If any, return the first child. */
res = m_objfile->separate_debug_objfile;
if (res != nullptr)
{
m_objfile = res;
return *this;
}
/* Common case where there is no separate debug objfile. */
if (m_objfile == m_parent)
{
m_objfile = nullptr;
return *this;
}
/* Return the brother if any. Note that we don't iterate on brothers of
the parents. */
res = m_objfile->separate_debug_objfile_link;
if (res != nullptr)
{
m_objfile = res;
return *this;
}
for (res = m_objfile->separate_debug_objfile_backlink;
res != m_parent;
res = res->separate_debug_objfile_backlink)
{
gdb_assert (res != nullptr);
if (res->separate_debug_objfile_link != nullptr)
{
m_objfile = res->separate_debug_objfile_link;
return *this;
}
}
m_objfile = nullptr;
return *this;
}
/* Add OBJFILE as a separate debug objfile of PARENT. */
static void
add_separate_debug_objfile (struct objfile *objfile, struct objfile *parent)
{
gdb_assert (objfile && parent);
/* Must not be already in a list. */
gdb_assert (objfile->separate_debug_objfile_backlink == NULL);
gdb_assert (objfile->separate_debug_objfile_link == NULL);
gdb_assert (objfile->separate_debug_objfile == NULL);
gdb_assert (parent->separate_debug_objfile_backlink == NULL);
gdb_assert (parent->separate_debug_objfile_link == NULL);
objfile->separate_debug_objfile_backlink = parent;
objfile->separate_debug_objfile_link = parent->separate_debug_objfile;
parent->separate_debug_objfile = objfile;
}
/* See objfiles.h. */
objfile *
objfile::make (gdb_bfd_ref_ptr bfd_, const char *name_, objfile_flags flags_,
objfile *parent)
{
objfile *result = new objfile (std::move (bfd_), name_, flags_);
if (parent != nullptr)
add_separate_debug_objfile (result, parent);
current_program_space->add_objfile (std::unique_ptr<objfile> (result),
parent);
/* Rebuild section map next time we need it. */
get_objfile_pspace_data (current_program_space)->new_objfiles_available = 1;
return result;
}
/* See objfiles.h. */
void
objfile::unlink ()
{
this->pspace ()->remove_objfile (this);
}
/* Free all separate debug objfile of OBJFILE, but don't free OBJFILE
itself. */
void
free_objfile_separate_debug (struct objfile *objfile)
{
struct objfile *child;
for (child = objfile->separate_debug_objfile; child;)
{
struct objfile *next_child = child->separate_debug_objfile_link;
child->unlink ();
child = next_child;
}
}
/* Destroy an objfile and all the symtabs and psymtabs under it. */
objfile::~objfile ()
{
/* First notify observers that this objfile is about to be freed. */
gdb::observers::free_objfile.notify (this);
/* Free all separate debug objfiles. */
free_objfile_separate_debug (this);
if (separate_debug_objfile_backlink)
{
/* We freed the separate debug file, make sure the base objfile
doesn't reference it. */
struct objfile *child;
child = separate_debug_objfile_backlink->separate_debug_objfile;
if (child == this)
{
/* THIS is the first child. */
separate_debug_objfile_backlink->separate_debug_objfile =
separate_debug_objfile_link;
}
else
{
/* Find THIS in the list. */
while (1)
{
if (child->separate_debug_objfile_link == this)
{
child->separate_debug_objfile_link =
separate_debug_objfile_link;
break;
}
child = child->separate_debug_objfile_link;
gdb_assert (child);
}
}
}
/* Remove any references to this objfile in the global value
lists. */
preserve_values (this);
/* It still may reference data modules have associated with the objfile and
the symbol file data. */
forget_cached_source_info ();
for (compunit_symtab *cu : compunits ())
cu->finalize ();
breakpoint_free_objfile (this);
btrace_free_objfile (this);
/* First do any symbol file specific actions required when we are
finished with a particular symbol file. Note that if the objfile
is using reusable symbol information (via mmalloc) then each of
these routines is responsible for doing the correct thing, either
freeing things which are valid only during this particular gdb
execution, or leaving them to be reused during the next one. */
if (sf != NULL)
(*sf->sym_finish) (this);
/* Before the symbol table code was redone to make it easier to
selectively load and remove information particular to a specific
linkage unit, gdb used to do these things whenever the monolithic
symbol table was blown away. How much still needs to be done
is unknown, but we play it safe for now and keep each action until
it is shown to be no longer needed. */
/* Not all our callers call clear_symtab_users (objfile_purge_solibs,
for example), so we need to call this here. */
clear_pc_function_cache ();
/* Check to see if the current_source_symtab belongs to this objfile,
and if so, call clear_current_source_symtab_and_line. */
{
struct symtab_and_line cursal = get_current_source_symtab_and_line ();
if (cursal.symtab && cursal.symtab->compunit ()->objfile () == this)
clear_current_source_symtab_and_line (this->pspace ());
}
/* Rebuild section map next time we need it. */
get_objfile_pspace_data (m_pspace)->section_map_dirty = 1;
}
/* A helper function for objfile_relocate1 that relocates a single
symbol. */
static void
relocate_one_symbol (struct symbol *sym, struct objfile *objfile,
const section_offsets &delta)
{
/* The RS6000 code from which this was taken skipped
any symbols in STRUCT_DOMAIN or UNDEF_DOMAIN.
But I'm leaving out that test, on the theory that
they can't possibly pass the tests below. */
if ((sym->aclass () == LOC_LABEL
|| sym->aclass () == LOC_STATIC)
&& sym->section_index () >= 0)
sym->set_value_address (sym->value_address ()
+ delta[sym->section_index ()]);
}
/* Relocate OBJFILE to NEW_OFFSETS. There should be OBJFILE->NUM_SECTIONS
entries in new_offsets. SEPARATE_DEBUG_OBJFILE is not touched here.
Return non-zero iff any change happened. */
static int
objfile_relocate1 (struct objfile *objfile,
const section_offsets &new_offsets)
{
section_offsets delta (objfile->section_offsets.size ());
int something_changed = 0;
for (int i = 0; i < objfile->section_offsets.size (); ++i)
{
delta[i] = new_offsets[i] - objfile->section_offsets[i];
if (delta[i] != 0)
something_changed = 1;
}
if (!something_changed)
return 0;
/* OK, get all the symtabs. */
for (compunit_symtab *cust : objfile->compunits ())
{
struct blockvector *bv = cust->blockvector ();
int block_line_section = SECT_OFF_TEXT (objfile);
if (bv->map () != nullptr)
bv->map ()->relocate (delta[block_line_section]);
for (block *b : bv->blocks ())
{
b->set_start (b->start () + delta[block_line_section]);
b->set_end (b->end () + delta[block_line_section]);
for (blockrange &r : b->ranges ())
{
r.set_start (r.start () + delta[block_line_section]);
r.set_end (r.end () + delta[block_line_section]);
}
/* We only want to iterate over the local symbols, not any
symbols in included symtabs. */
for (struct symbol *sym : b->multidict_symbols ())
relocate_one_symbol (sym, objfile, delta);
}
}
/* Relocate isolated symbols. */
for (symbol *iter = objfile->template_symbols; iter; iter = iter->hash_next)
relocate_one_symbol (iter, objfile, delta);
for (int i = 0; i < objfile->section_offsets.size (); ++i)
objfile->section_offsets[i] = new_offsets[i];
/* Rebuild section map next time we need it. */
get_objfile_pspace_data (objfile->pspace ())->section_map_dirty = 1;
/* Update the table in exec_ops, used to read memory. */
for (obj_section *s : objfile->sections ())
{
int idx = s - objfile->sections_start;
exec_set_section_address (bfd_get_filename (objfile->obfd.get ()), idx,
s->addr ());
}
/* Data changed. */
return 1;
}
/* Relocate OBJFILE to NEW_OFFSETS. There should be OBJFILE->NUM_SECTIONS
entries in new_offsets. Process also OBJFILE's SEPARATE_DEBUG_OBJFILEs.
The number and ordering of sections does differ between the two objfiles.
Only their names match. Also the file offsets will differ (objfile being
possibly prelinked but separate_debug_objfile is probably not prelinked) but
the in-memory absolute address as specified by NEW_OFFSETS must match both
files. */
void
objfile_relocate (struct objfile *objfile,
const section_offsets &new_offsets)
{
int changed = 0;
changed |= objfile_relocate1 (objfile, new_offsets);
for (::objfile *debug_objfile : objfile->separate_debug_objfiles ())
{
if (debug_objfile == objfile)
continue;
section_addr_info objfile_addrs
= build_section_addr_info_from_objfile (objfile);
/* Here OBJFILE_ADDRS contain the correct absolute addresses, the
relative ones must be already created according to debug_objfile. */
addr_info_make_relative (&objfile_addrs, debug_objfile->obfd.get ());
gdb_assert (debug_objfile->section_offsets.size ()
== gdb_bfd_count_sections (debug_objfile->obfd.get ()));
section_offsets new_debug_offsets
(debug_objfile->section_offsets.size ());
relative_addr_info_to_section_offsets (new_debug_offsets, objfile_addrs);
changed |= objfile_relocate1 (debug_objfile, new_debug_offsets);
}
/* Relocate breakpoints as necessary, after things are relocated. */
if (changed)
breakpoint_re_set ();
}
/* Rebase (add to the offsets) OBJFILE by SLIDE. SEPARATE_DEBUG_OBJFILE is
not touched here.
Return non-zero iff any change happened. */
static int
objfile_rebase1 (struct objfile *objfile, CORE_ADDR slide)
{
section_offsets new_offsets (objfile->section_offsets.size (), slide);
return objfile_relocate1 (objfile, new_offsets);
}
/* Rebase (add to the offsets) OBJFILE by SLIDE. Process also OBJFILE's
SEPARATE_DEBUG_OBJFILEs. */
void
objfile_rebase (struct objfile *objfile, CORE_ADDR slide)
{
int changed = 0;
for (::objfile *debug_objfile : objfile->separate_debug_objfiles ())
changed |= objfile_rebase1 (debug_objfile, slide);
/* Relocate breakpoints as necessary, after things are relocated. */
if (changed)
breakpoint_re_set ();
}
/* See objfiles.h. */
bool
objfile_has_full_symbols (objfile *objfile)
{
return objfile->compunit_symtabs != nullptr;
}
/* See objfiles.h. */
bool
objfile_has_symbols (objfile *objfile)
{
for (::objfile *o : objfile->separate_debug_objfiles ())
if (o->has_partial_symbols () || objfile_has_full_symbols (o))
return true;
return false;
}
/* See objfiles.h. */
bool
have_partial_symbols ()
{
for (objfile *ofp : current_program_space->objfiles ())
if (ofp->has_partial_symbols ())
return true;
return false;
}
/* See objfiles.h. */
bool
have_full_symbols ()
{
for (objfile *ofp : current_program_space->objfiles ())
if (objfile_has_full_symbols (ofp))
return true;
return false;
}
/* See objfiles.h. */
void
objfile_purge_solibs (program_space *pspace)
{
for (objfile *objf : pspace->objfiles_safe ())
{
/* We assume that the solib package has been purged already, or will
be soon. */
if (!(objf->flags & OBJF_USERLOADED) && (objf->flags & OBJF_SHARED))
objf->unlink ();
}
}
/* See objfiles.h. */
bool
have_minimal_symbols ()
{
for (objfile *ofp : current_program_space->objfiles ())
if (ofp->per_bfd->minimal_symbol_count > 0)
return true;
return false;
}
/* Qsort comparison function. */
static bool
sort_cmp (const struct obj_section *sect1, const obj_section *sect2)
{
const CORE_ADDR sect1_addr = sect1->addr ();
const CORE_ADDR sect2_addr = sect2->addr ();
if (sect1_addr < sect2_addr)
return true;
else if (sect1_addr > sect2_addr)
return false;
else
{
/* Sections are at the same address. This could happen if
A) we have an objfile and a separate debuginfo.
B) we are confused, and have added sections without proper relocation,
or something like that. */
const struct objfile *const objfile1 = sect1->objfile;
const struct objfile *const objfile2 = sect2->objfile;
if (objfile1->separate_debug_objfile == objfile2
|| objfile2->separate_debug_objfile == objfile1)
{
/* Case A. The ordering doesn't matter: separate debuginfo files
will be filtered out later. */
return false;
}
/* Case B. Maintain stable sort order, so bugs in GDB are easier to
triage. This section could be slow (since we iterate over all
objfiles in each call to sort_cmp), but this shouldn't happen
very often (GDB is already in a confused state; one hopes this
doesn't happen at all). If you discover that significant time is
spent in the loops below, do 'set complaints 100' and examine the
resulting complaints. */
if (objfile1 == objfile2)
{
/* Both sections came from the same objfile. We are really
confused. Sort on sequence order of sections within the
objfile. The order of checks is important here, if we find a
match on SECT2 first then either SECT2 is before SECT1, or,
SECT2 == SECT1, in both cases we should return false. The
second case shouldn't occur during normal use, but std::sort
does check that '!(a < a)' when compiled in debug mode. */
for (const obj_section *osect : objfile1->sections ())
if (osect == sect2)
return false;
else if (osect == sect1)
return true;
/* We should have found one of the sections before getting here. */
gdb_assert_not_reached ("section not found");
}
else
{
/* Sort on sequence number of the objfile in the chain. */
for (objfile *objfile : current_program_space->objfiles ())
if (objfile == objfile1)
return true;
else if (objfile == objfile2)
return false;
/* We should have found one of the objfiles before getting here. */
gdb_assert_not_reached ("objfile not found");
}
}
/* Unreachable. */
gdb_assert_not_reached ("unexpected code path");
return false;
}
/* Select "better" obj_section to keep. We prefer the one that came from
the real object, rather than the one from separate debuginfo.
Most of the time the two sections are exactly identical, but with
prelinking the .rel.dyn section in the real object may have different
size. */
static struct obj_section *
preferred_obj_section (struct obj_section *a, struct obj_section *b)
{
gdb_assert (a->addr () == b->addr ());
gdb_assert ((a->objfile->separate_debug_objfile == b->objfile)
|| (b->objfile->separate_debug_objfile == a->objfile));
gdb_assert ((a->objfile->separate_debug_objfile_backlink == b->objfile)
|| (b->objfile->separate_debug_objfile_backlink == a->objfile));
if (a->objfile->separate_debug_objfile != NULL)
return a;
return b;
}
/* Return 1 if SECTION should be inserted into the section map.
We want to insert only non-overlay non-TLS non-empty sections. */
static int
insert_section_p (const struct bfd *abfd,
const struct bfd_section *section)
{
const bfd_vma lma = bfd_section_lma (section);
if (overlay_debugging && lma != 0 && lma != bfd_section_vma (section)
&& (bfd_get_file_flags (abfd) & BFD_IN_MEMORY) == 0)
/* This is an overlay section. IN_MEMORY check is needed to avoid
discarding sections from the "system supplied DSO" (aka vdso)
on some Linux systems (e.g. Fedora 11). */
return 0;
if ((bfd_section_flags (section) & SEC_THREAD_LOCAL) != 0)
/* This is a TLS section. */
return 0;
if (bfd_section_size (section) == 0)
{
/* This is an empty section. It has no PCs for find_pc_section (), so
there is no reason to insert it into the section map. */
return 0;
}
return 1;
}
/* Filter out overlapping sections where one section came from the real
objfile, and the other from a separate debuginfo file.
Return the size of table after redundant sections have been eliminated. */
static int
filter_debuginfo_sections (struct obj_section **map, int map_size)
{
int i, j;
for (i = 0, j = 0; i < map_size - 1; i++)
{
struct obj_section *const sect1 = map[i];
struct obj_section *const sect2 = map[i + 1];
const struct objfile *const objfile1 = sect1->objfile;
const struct objfile *const objfile2 = sect2->objfile;
const CORE_ADDR sect1_addr = sect1->addr ();
const CORE_ADDR sect2_addr = sect2->addr ();
if (sect1_addr == sect2_addr
&& (objfile1->separate_debug_objfile == objfile2
|| objfile2->separate_debug_objfile == objfile1))
{
map[j++] = preferred_obj_section (sect1, sect2);
++i;
}
else
map[j++] = sect1;
}
if (i < map_size)
{
gdb_assert (i == map_size - 1);
map[j++] = map[i];
}
/* The map should not have shrunk to less than half the original size. */
gdb_assert (map_size / 2 <= j);
return j;
}
/* Filter out overlapping sections, issuing a warning if any are found.
Overlapping sections could really be overlay sections which we didn't
classify as such in insert_section_p, or we could be dealing with a
corrupt binary. */
static int
filter_overlapping_sections (struct obj_section **map, int map_size)
{
int i, j;
for (i = 0, j = 0; i < map_size - 1; )
{
int k;
map[j++] = map[i];
for (k = i + 1; k < map_size; k++)
{
struct obj_section *const sect1 = map[i];
struct obj_section *const sect2 = map[k];
const CORE_ADDR sect1_addr = sect1->addr ();
const CORE_ADDR sect2_addr = sect2->addr ();
const CORE_ADDR sect1_endaddr = sect1->endaddr ();
gdb_assert (sect1_addr <= sect2_addr);
if (sect1_endaddr <= sect2_addr)
break;
else
{
/* We have an overlap. Report it. */
struct objfile *const objf1 = sect1->objfile;
struct objfile *const objf2 = sect2->objfile;
const struct bfd_section *const bfds1 = sect1->the_bfd_section;
const struct bfd_section *const bfds2 = sect2->the_bfd_section;
const CORE_ADDR sect2_endaddr = sect2->endaddr ();
struct gdbarch *const gdbarch = objf1->arch ();
complaint (_("unexpected overlap between:\n"
" (A) section `%s' from `%s' [%s, %s)\n"
" (B) section `%s' from `%s' [%s, %s).\n"
"Will ignore section B"),
bfd_section_name (bfds1), objfile_name (objf1),
paddress (gdbarch, sect1_addr),
paddress (gdbarch, sect1_endaddr),
bfd_section_name (bfds2), objfile_name (objf2),
paddress (gdbarch, sect2_addr),
paddress (gdbarch, sect2_endaddr));
}
}
i = k;
}
if (i < map_size)
{
gdb_assert (i == map_size - 1);
map[j++] = map[i];
}
return j;
}
/* Update PMAP, PMAP_SIZE with sections from all objfiles, excluding any
TLS, overlay and overlapping sections. */
static void
update_section_map (struct program_space *pspace,
struct obj_section ***pmap, int *pmap_size)
{
struct objfile_pspace_info *pspace_info;
int alloc_size, map_size, i;
struct obj_section **map;
pspace_info = get_objfile_pspace_data (pspace);
gdb_assert (pspace_info->section_map_dirty != 0
|| pspace_info->new_objfiles_available != 0);
map = *pmap;
xfree (map);
alloc_size = 0;
for (objfile *objfile : pspace->objfiles ())
for (obj_section *s : objfile->sections ())
if (insert_section_p (objfile->obfd.get (), s->the_bfd_section))
alloc_size += 1;
/* This happens on detach/attach (e.g. in gdb.base/attach.exp). */
if (alloc_size == 0)
{
*pmap = NULL;
*pmap_size = 0;
return;
}
map = XNEWVEC (struct obj_section *, alloc_size);
i = 0;
for (objfile *objfile : pspace->objfiles ())
for (obj_section *s : objfile->sections ())
if (insert_section_p (objfile->obfd.get (), s->the_bfd_section))
map[i++] = s;
std::sort (map, map + alloc_size, sort_cmp);
map_size = filter_debuginfo_sections(map, alloc_size);
map_size = filter_overlapping_sections(map, map_size);
if (map_size < alloc_size)
/* Some sections were eliminated. Trim excess space. */
map = XRESIZEVEC (struct obj_section *, map, map_size);
else
gdb_assert (alloc_size == map_size);
*pmap = map;
*pmap_size = map_size;
}
/* Bsearch comparison function. */
static int
bsearch_cmp (const void *key, const void *elt)
{
const CORE_ADDR pc = *(CORE_ADDR *) key;
const struct obj_section *section = *(const struct obj_section **) elt;
if (pc < section->addr ())
return -1;
if (pc < section->endaddr ())
return 0;
return 1;
}
/* Returns a section whose range includes PC or NULL if none found. */
struct obj_section *
find_pc_section (CORE_ADDR pc)
{
struct objfile_pspace_info *pspace_info;
struct obj_section *s, **sp;
/* Check for mapped overlay section first. */
s = find_pc_mapped_section (pc);
if (s)
return s;
pspace_info = get_objfile_pspace_data (current_program_space);
if (pspace_info->section_map_dirty
|| (pspace_info->new_objfiles_available
&& !pspace_info->inhibit_updates))
{
update_section_map (current_program_space,
&pspace_info->sections,
&pspace_info->num_sections);
/* Don't need updates to section map until objfiles are added,
removed or relocated. */
pspace_info->new_objfiles_available = 0;
pspace_info->section_map_dirty = 0;
}
/* The C standard (ISO/IEC 9899:TC2) requires the BASE argument to
bsearch be non-NULL. */
if (pspace_info->sections == NULL)
{
gdb_assert (pspace_info->num_sections == 0);
return NULL;
}
sp = (struct obj_section **) bsearch (&pc,
pspace_info->sections,
pspace_info->num_sections,
sizeof (*pspace_info->sections),
bsearch_cmp);
if (sp != NULL)
return *sp;
return NULL;
}
/* Return non-zero if PC is in a section called NAME. */
bool
pc_in_section (CORE_ADDR pc, const char *name)
{
struct obj_section *s = find_pc_section (pc);
return (s != nullptr
&& s->the_bfd_section->name != nullptr
&& strcmp (s->the_bfd_section->name, name) == 0);
}
/* Set section_map_dirty so section map will be rebuilt next time it
is used. Called by reread_symbols. */
void
objfiles_changed (void)
{
/* Rebuild section map next time we need it. */
get_objfile_pspace_data (current_program_space)->section_map_dirty = 1;
}
/* See comments in objfiles.h. */
scoped_restore_tmpl<int>
inhibit_section_map_updates (struct program_space *pspace)
{
return scoped_restore_tmpl<int>
(&get_objfile_pspace_data (pspace)->inhibit_updates, 1);
}
/* See objfiles.h. */
bool
is_addr_in_objfile (CORE_ADDR addr, const struct objfile *objfile)
{
if (objfile == NULL)
return false;
for (obj_section *osect : objfile->sections ())
{
if (section_is_overlay (osect) && !section_is_mapped (osect))
continue;
if (osect->contains (addr))
return true;
}
return false;
}
/* See objfiles.h. */
bool
shared_objfile_contains_address_p (struct program_space *pspace,
CORE_ADDR address)
{
for (objfile *objfile : pspace->objfiles ())
{
if ((objfile->flags & OBJF_SHARED) != 0
&& is_addr_in_objfile (address, objfile))
return true;
}
return false;
}
/* The default implementation for the "iterate_over_objfiles_in_search_order"
gdbarch method. It is equivalent to use the objfiles iterable,
searching the objfiles in the order they are stored internally,
ignoring CURRENT_OBJFILE.
On most platforms, it should be close enough to doing the best
we can without some knowledge specific to the architecture. */
void
default_iterate_over_objfiles_in_search_order
(gdbarch *gdbarch, iterate_over_objfiles_in_search_order_cb_ftype cb,
objfile *current_objfile)
{
for (objfile *objfile : current_program_space->objfiles ())
if (cb (objfile))
return;
}
/* See objfiles.h. */
const char *
objfile_name (const struct objfile *objfile)
{
if (objfile->obfd != NULL)
return bfd_get_filename (objfile->obfd.get ());
return objfile->original_name;
}
/* See objfiles.h. */
const char *
objfile_filename (const struct objfile *objfile)
{
if (objfile->obfd != NULL)
return bfd_get_filename (objfile->obfd.get ());
return NULL;
}
/* See objfiles.h. */
const char *
objfile_debug_name (const struct objfile *objfile)
{
return lbasename (objfile->original_name);
}
/* See objfiles.h. */
const char *
objfile_flavour_name (struct objfile *objfile)
{
if (objfile->obfd != NULL)
return bfd_flavour_name (bfd_get_flavour (objfile->obfd.get ()));
return NULL;
}
/* See objfiles.h. */
struct type *
objfile_int_type (struct objfile *of, int size_in_bytes, bool unsigned_p)
{
struct type *int_type;
/* Helper macro to examine the various builtin types. */
#define TRY_TYPE(F) \
int_type = (unsigned_p \
? builtin_type (of)->builtin_unsigned_ ## F \
: builtin_type (of)->builtin_ ## F); \
if (int_type != NULL && int_type->length () == size_in_bytes) \
return int_type
TRY_TYPE (char);
TRY_TYPE (short);
TRY_TYPE (int);
TRY_TYPE (long);
TRY_TYPE (long_long);
#undef TRY_TYPE
gdb_assert_not_reached ("unable to find suitable integer type");
}
|