1*fae548d3Szrj /* ldcref.c -- output a cross reference table
2*fae548d3Szrj Copyright (C) 1996-2020 Free Software Foundation, Inc.
3*fae548d3Szrj Written by Ian Lance Taylor <ian@cygnus.com>
4*fae548d3Szrj
5*fae548d3Szrj This file is part of the GNU Binutils.
6*fae548d3Szrj
7*fae548d3Szrj This program is free software; you can redistribute it and/or modify
8*fae548d3Szrj it under the terms of the GNU General Public License as published by
9*fae548d3Szrj the Free Software Foundation; either version 3 of the License, or
10*fae548d3Szrj (at your option) any later version.
11*fae548d3Szrj
12*fae548d3Szrj This program is distributed in the hope that it will be useful,
13*fae548d3Szrj but WITHOUT ANY WARRANTY; without even the implied warranty of
14*fae548d3Szrj MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15*fae548d3Szrj GNU General Public License for more details.
16*fae548d3Szrj
17*fae548d3Szrj You should have received a copy of the GNU General Public License
18*fae548d3Szrj along with this program; if not, write to the Free Software
19*fae548d3Szrj Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
20*fae548d3Szrj MA 02110-1301, USA. */
21*fae548d3Szrj
22*fae548d3Szrj
23*fae548d3Szrj /* This file holds routines that manage the cross reference table.
24*fae548d3Szrj The table is used to generate cross reference reports. It is also
25*fae548d3Szrj used to implement the NOCROSSREFS command in the linker script. */
26*fae548d3Szrj
27*fae548d3Szrj #include "sysdep.h"
28*fae548d3Szrj #include "bfd.h"
29*fae548d3Szrj #include "bfdlink.h"
30*fae548d3Szrj #include "ctf-api.h"
31*fae548d3Szrj #include "libiberty.h"
32*fae548d3Szrj #include "demangle.h"
33*fae548d3Szrj #include "objalloc.h"
34*fae548d3Szrj
35*fae548d3Szrj #include "ld.h"
36*fae548d3Szrj #include "ldmain.h"
37*fae548d3Szrj #include "ldmisc.h"
38*fae548d3Szrj #include "ldexp.h"
39*fae548d3Szrj #include "ldlang.h"
40*fae548d3Szrj
41*fae548d3Szrj /* We keep an instance of this structure for each reference to a
42*fae548d3Szrj symbol from a given object. */
43*fae548d3Szrj
44*fae548d3Szrj struct cref_ref
45*fae548d3Szrj {
46*fae548d3Szrj /* The next reference. */
47*fae548d3Szrj struct cref_ref *next;
48*fae548d3Szrj /* The object. */
49*fae548d3Szrj bfd *abfd;
50*fae548d3Szrj /* True if the symbol is defined. */
51*fae548d3Szrj unsigned int def : 1;
52*fae548d3Szrj /* True if the symbol is common. */
53*fae548d3Szrj unsigned int common : 1;
54*fae548d3Szrj /* True if the symbol is undefined. */
55*fae548d3Szrj unsigned int undef : 1;
56*fae548d3Szrj };
57*fae548d3Szrj
58*fae548d3Szrj /* We keep a hash table of symbols. Each entry looks like this. */
59*fae548d3Szrj
60*fae548d3Szrj struct cref_hash_entry
61*fae548d3Szrj {
62*fae548d3Szrj struct bfd_hash_entry root;
63*fae548d3Szrj /* The demangled name. */
64*fae548d3Szrj const char *demangled;
65*fae548d3Szrj /* References to and definitions of this symbol. */
66*fae548d3Szrj struct cref_ref *refs;
67*fae548d3Szrj };
68*fae548d3Szrj
69*fae548d3Szrj /* This is what the hash table looks like. */
70*fae548d3Szrj
71*fae548d3Szrj struct cref_hash_table
72*fae548d3Szrj {
73*fae548d3Szrj struct bfd_hash_table root;
74*fae548d3Szrj };
75*fae548d3Szrj
76*fae548d3Szrj /* Forward declarations. */
77*fae548d3Szrj
78*fae548d3Szrj static void output_one_cref (FILE *, struct cref_hash_entry *);
79*fae548d3Szrj static void check_local_sym_xref (lang_input_statement_type *);
80*fae548d3Szrj static bfd_boolean check_nocrossref (struct cref_hash_entry *, void *);
81*fae548d3Szrj static void check_refs (const char *, bfd_boolean, asection *, bfd *,
82*fae548d3Szrj struct lang_nocrossrefs *);
83*fae548d3Szrj static void check_reloc_refs (bfd *, asection *, void *);
84*fae548d3Szrj
85*fae548d3Szrj /* Look up an entry in the cref hash table. */
86*fae548d3Szrj
87*fae548d3Szrj #define cref_hash_lookup(table, string, create, copy) \
88*fae548d3Szrj ((struct cref_hash_entry *) \
89*fae548d3Szrj bfd_hash_lookup (&(table)->root, (string), (create), (copy)))
90*fae548d3Szrj
91*fae548d3Szrj /* Traverse the cref hash table. */
92*fae548d3Szrj
93*fae548d3Szrj #define cref_hash_traverse(table, func, info) \
94*fae548d3Szrj (bfd_hash_traverse \
95*fae548d3Szrj (&(table)->root, \
96*fae548d3Szrj (bfd_boolean (*) (struct bfd_hash_entry *, void *)) (func), \
97*fae548d3Szrj (info)))
98*fae548d3Szrj
99*fae548d3Szrj /* The cref hash table. */
100*fae548d3Szrj
101*fae548d3Szrj static struct cref_hash_table cref_table;
102*fae548d3Szrj
103*fae548d3Szrj /* Whether the cref hash table has been initialized. */
104*fae548d3Szrj
105*fae548d3Szrj static bfd_boolean cref_initialized;
106*fae548d3Szrj
107*fae548d3Szrj /* The number of symbols seen so far. */
108*fae548d3Szrj
109*fae548d3Szrj static size_t cref_symcount;
110*fae548d3Szrj
111*fae548d3Szrj /* Used to take a snapshot of the cref hash table when starting to
112*fae548d3Szrj add syms from an as-needed library. */
113*fae548d3Szrj static struct bfd_hash_entry **old_table;
114*fae548d3Szrj static unsigned int old_size;
115*fae548d3Szrj static unsigned int old_count;
116*fae548d3Szrj static void *old_tab;
117*fae548d3Szrj static void *alloc_mark;
118*fae548d3Szrj static size_t tabsize, entsize, refsize;
119*fae548d3Szrj static size_t old_symcount;
120*fae548d3Szrj
121*fae548d3Szrj /* Create an entry in a cref hash table. */
122*fae548d3Szrj
123*fae548d3Szrj static struct bfd_hash_entry *
cref_hash_newfunc(struct bfd_hash_entry * entry,struct bfd_hash_table * table,const char * string)124*fae548d3Szrj cref_hash_newfunc (struct bfd_hash_entry *entry,
125*fae548d3Szrj struct bfd_hash_table *table,
126*fae548d3Szrj const char *string)
127*fae548d3Szrj {
128*fae548d3Szrj struct cref_hash_entry *ret = (struct cref_hash_entry *) entry;
129*fae548d3Szrj
130*fae548d3Szrj /* Allocate the structure if it has not already been allocated by a
131*fae548d3Szrj subclass. */
132*fae548d3Szrj if (ret == NULL)
133*fae548d3Szrj ret = ((struct cref_hash_entry *)
134*fae548d3Szrj bfd_hash_allocate (table, sizeof (struct cref_hash_entry)));
135*fae548d3Szrj if (ret == NULL)
136*fae548d3Szrj return NULL;
137*fae548d3Szrj
138*fae548d3Szrj /* Call the allocation method of the superclass. */
139*fae548d3Szrj ret = ((struct cref_hash_entry *)
140*fae548d3Szrj bfd_hash_newfunc ((struct bfd_hash_entry *) ret, table, string));
141*fae548d3Szrj if (ret != NULL)
142*fae548d3Szrj {
143*fae548d3Szrj /* Set local fields. */
144*fae548d3Szrj ret->demangled = NULL;
145*fae548d3Szrj ret->refs = NULL;
146*fae548d3Szrj
147*fae548d3Szrj /* Keep a count of the number of entries created in the hash
148*fae548d3Szrj table. */
149*fae548d3Szrj ++cref_symcount;
150*fae548d3Szrj }
151*fae548d3Szrj
152*fae548d3Szrj return &ret->root;
153*fae548d3Szrj }
154*fae548d3Szrj
155*fae548d3Szrj /* Add a symbol to the cref hash table. This is called for every
156*fae548d3Szrj global symbol that is seen during the link. */
157*fae548d3Szrj
158*fae548d3Szrj void
add_cref(const char * name,bfd * abfd,asection * section,bfd_vma value ATTRIBUTE_UNUSED)159*fae548d3Szrj add_cref (const char *name,
160*fae548d3Szrj bfd *abfd,
161*fae548d3Szrj asection *section,
162*fae548d3Szrj bfd_vma value ATTRIBUTE_UNUSED)
163*fae548d3Szrj {
164*fae548d3Szrj struct cref_hash_entry *h;
165*fae548d3Szrj struct cref_ref *r;
166*fae548d3Szrj
167*fae548d3Szrj if (!cref_initialized)
168*fae548d3Szrj {
169*fae548d3Szrj if (!bfd_hash_table_init (&cref_table.root, cref_hash_newfunc,
170*fae548d3Szrj sizeof (struct cref_hash_entry)))
171*fae548d3Szrj einfo (_("%X%P: bfd_hash_table_init of cref table failed: %E\n"));
172*fae548d3Szrj cref_initialized = TRUE;
173*fae548d3Szrj }
174*fae548d3Szrj
175*fae548d3Szrj h = cref_hash_lookup (&cref_table, name, TRUE, FALSE);
176*fae548d3Szrj if (h == NULL)
177*fae548d3Szrj einfo (_("%X%P: cref_hash_lookup failed: %E\n"));
178*fae548d3Szrj
179*fae548d3Szrj for (r = h->refs; r != NULL; r = r->next)
180*fae548d3Szrj if (r->abfd == abfd)
181*fae548d3Szrj break;
182*fae548d3Szrj
183*fae548d3Szrj if (r == NULL)
184*fae548d3Szrj {
185*fae548d3Szrj r = (struct cref_ref *) bfd_hash_allocate (&cref_table.root, sizeof *r);
186*fae548d3Szrj if (r == NULL)
187*fae548d3Szrj einfo (_("%X%P: cref alloc failed: %E\n"));
188*fae548d3Szrj r->next = h->refs;
189*fae548d3Szrj h->refs = r;
190*fae548d3Szrj r->abfd = abfd;
191*fae548d3Szrj r->def = FALSE;
192*fae548d3Szrj r->common = FALSE;
193*fae548d3Szrj r->undef = FALSE;
194*fae548d3Szrj }
195*fae548d3Szrj
196*fae548d3Szrj if (bfd_is_und_section (section))
197*fae548d3Szrj r->undef = TRUE;
198*fae548d3Szrj else if (bfd_is_com_section (section))
199*fae548d3Szrj r->common = TRUE;
200*fae548d3Szrj else
201*fae548d3Szrj r->def = TRUE;
202*fae548d3Szrj }
203*fae548d3Szrj
204*fae548d3Szrj /* Called before loading an as-needed library to take a snapshot of
205*fae548d3Szrj the cref hash table, and after we have loaded or found that the
206*fae548d3Szrj library was not needed. */
207*fae548d3Szrj
208*fae548d3Szrj bfd_boolean
handle_asneeded_cref(bfd * abfd ATTRIBUTE_UNUSED,enum notice_asneeded_action act)209*fae548d3Szrj handle_asneeded_cref (bfd *abfd ATTRIBUTE_UNUSED,
210*fae548d3Szrj enum notice_asneeded_action act)
211*fae548d3Szrj {
212*fae548d3Szrj unsigned int i;
213*fae548d3Szrj
214*fae548d3Szrj if (!cref_initialized)
215*fae548d3Szrj return TRUE;
216*fae548d3Szrj
217*fae548d3Szrj if (act == notice_as_needed)
218*fae548d3Szrj {
219*fae548d3Szrj char *old_ent, *old_ref;
220*fae548d3Szrj
221*fae548d3Szrj for (i = 0; i < cref_table.root.size; i++)
222*fae548d3Szrj {
223*fae548d3Szrj struct bfd_hash_entry *p;
224*fae548d3Szrj struct cref_hash_entry *c;
225*fae548d3Szrj struct cref_ref *r;
226*fae548d3Szrj
227*fae548d3Szrj for (p = cref_table.root.table[i]; p != NULL; p = p->next)
228*fae548d3Szrj {
229*fae548d3Szrj entsize += cref_table.root.entsize;
230*fae548d3Szrj c = (struct cref_hash_entry *) p;
231*fae548d3Szrj for (r = c->refs; r != NULL; r = r->next)
232*fae548d3Szrj refsize += sizeof (struct cref_ref);
233*fae548d3Szrj }
234*fae548d3Szrj }
235*fae548d3Szrj
236*fae548d3Szrj tabsize = cref_table.root.size * sizeof (struct bfd_hash_entry *);
237*fae548d3Szrj old_tab = xmalloc (tabsize + entsize + refsize);
238*fae548d3Szrj
239*fae548d3Szrj alloc_mark = bfd_hash_allocate (&cref_table.root, 1);
240*fae548d3Szrj if (alloc_mark == NULL)
241*fae548d3Szrj return FALSE;
242*fae548d3Szrj
243*fae548d3Szrj memcpy (old_tab, cref_table.root.table, tabsize);
244*fae548d3Szrj old_ent = (char *) old_tab + tabsize;
245*fae548d3Szrj old_ref = (char *) old_ent + entsize;
246*fae548d3Szrj old_table = cref_table.root.table;
247*fae548d3Szrj old_size = cref_table.root.size;
248*fae548d3Szrj old_count = cref_table.root.count;
249*fae548d3Szrj old_symcount = cref_symcount;
250*fae548d3Szrj
251*fae548d3Szrj for (i = 0; i < cref_table.root.size; i++)
252*fae548d3Szrj {
253*fae548d3Szrj struct bfd_hash_entry *p;
254*fae548d3Szrj struct cref_hash_entry *c;
255*fae548d3Szrj struct cref_ref *r;
256*fae548d3Szrj
257*fae548d3Szrj for (p = cref_table.root.table[i]; p != NULL; p = p->next)
258*fae548d3Szrj {
259*fae548d3Szrj memcpy (old_ent, p, cref_table.root.entsize);
260*fae548d3Szrj old_ent = (char *) old_ent + cref_table.root.entsize;
261*fae548d3Szrj c = (struct cref_hash_entry *) p;
262*fae548d3Szrj for (r = c->refs; r != NULL; r = r->next)
263*fae548d3Szrj {
264*fae548d3Szrj memcpy (old_ref, r, sizeof (struct cref_ref));
265*fae548d3Szrj old_ref = (char *) old_ref + sizeof (struct cref_ref);
266*fae548d3Szrj }
267*fae548d3Szrj }
268*fae548d3Szrj }
269*fae548d3Szrj return TRUE;
270*fae548d3Szrj }
271*fae548d3Szrj
272*fae548d3Szrj if (act == notice_not_needed)
273*fae548d3Szrj {
274*fae548d3Szrj char *old_ent, *old_ref;
275*fae548d3Szrj
276*fae548d3Szrj if (old_tab == NULL)
277*fae548d3Szrj {
278*fae548d3Szrj /* The only way old_tab can be NULL is if the cref hash table
279*fae548d3Szrj had not been initialised when notice_as_needed. */
280*fae548d3Szrj bfd_hash_table_free (&cref_table.root);
281*fae548d3Szrj cref_initialized = FALSE;
282*fae548d3Szrj return TRUE;
283*fae548d3Szrj }
284*fae548d3Szrj
285*fae548d3Szrj old_ent = (char *) old_tab + tabsize;
286*fae548d3Szrj old_ref = (char *) old_ent + entsize;
287*fae548d3Szrj cref_table.root.table = old_table;
288*fae548d3Szrj cref_table.root.size = old_size;
289*fae548d3Szrj cref_table.root.count = old_count;
290*fae548d3Szrj memcpy (cref_table.root.table, old_tab, tabsize);
291*fae548d3Szrj cref_symcount = old_symcount;
292*fae548d3Szrj
293*fae548d3Szrj for (i = 0; i < cref_table.root.size; i++)
294*fae548d3Szrj {
295*fae548d3Szrj struct bfd_hash_entry *p;
296*fae548d3Szrj struct cref_hash_entry *c;
297*fae548d3Szrj struct cref_ref *r;
298*fae548d3Szrj
299*fae548d3Szrj for (p = cref_table.root.table[i]; p != NULL; p = p->next)
300*fae548d3Szrj {
301*fae548d3Szrj memcpy (p, old_ent, cref_table.root.entsize);
302*fae548d3Szrj old_ent = (char *) old_ent + cref_table.root.entsize;
303*fae548d3Szrj c = (struct cref_hash_entry *) p;
304*fae548d3Szrj for (r = c->refs; r != NULL; r = r->next)
305*fae548d3Szrj {
306*fae548d3Szrj memcpy (r, old_ref, sizeof (struct cref_ref));
307*fae548d3Szrj old_ref = (char *) old_ref + sizeof (struct cref_ref);
308*fae548d3Szrj }
309*fae548d3Szrj }
310*fae548d3Szrj }
311*fae548d3Szrj
312*fae548d3Szrj objalloc_free_block ((struct objalloc *) cref_table.root.memory,
313*fae548d3Szrj alloc_mark);
314*fae548d3Szrj }
315*fae548d3Szrj else if (act != notice_needed)
316*fae548d3Szrj return FALSE;
317*fae548d3Szrj
318*fae548d3Szrj free (old_tab);
319*fae548d3Szrj old_tab = NULL;
320*fae548d3Szrj return TRUE;
321*fae548d3Szrj }
322*fae548d3Szrj
323*fae548d3Szrj /* Copy the addresses of the hash table entries into an array. This
324*fae548d3Szrj is called via cref_hash_traverse. We also fill in the demangled
325*fae548d3Szrj name. */
326*fae548d3Szrj
327*fae548d3Szrj static bfd_boolean
cref_fill_array(struct cref_hash_entry * h,void * data)328*fae548d3Szrj cref_fill_array (struct cref_hash_entry *h, void *data)
329*fae548d3Szrj {
330*fae548d3Szrj struct cref_hash_entry ***pph = (struct cref_hash_entry ***) data;
331*fae548d3Szrj
332*fae548d3Szrj ASSERT (h->demangled == NULL);
333*fae548d3Szrj h->demangled = bfd_demangle (link_info.output_bfd, h->root.string,
334*fae548d3Szrj DMGL_ANSI | DMGL_PARAMS);
335*fae548d3Szrj if (h->demangled == NULL)
336*fae548d3Szrj h->demangled = h->root.string;
337*fae548d3Szrj
338*fae548d3Szrj **pph = h;
339*fae548d3Szrj
340*fae548d3Szrj ++*pph;
341*fae548d3Szrj
342*fae548d3Szrj return TRUE;
343*fae548d3Szrj }
344*fae548d3Szrj
345*fae548d3Szrj /* Sort an array of cref hash table entries by name. */
346*fae548d3Szrj
347*fae548d3Szrj static int
cref_sort_array(const void * a1,const void * a2)348*fae548d3Szrj cref_sort_array (const void *a1, const void *a2)
349*fae548d3Szrj {
350*fae548d3Szrj const struct cref_hash_entry *const *p1
351*fae548d3Szrj = (const struct cref_hash_entry *const *) a1;
352*fae548d3Szrj const struct cref_hash_entry *const *p2
353*fae548d3Szrj = (const struct cref_hash_entry *const *) a2;
354*fae548d3Szrj
355*fae548d3Szrj if (demangling)
356*fae548d3Szrj return strcmp ((*p1)->demangled, (*p2)->demangled);
357*fae548d3Szrj else
358*fae548d3Szrj return strcmp ((*p1)->root.string, (*p2)->root.string);
359*fae548d3Szrj }
360*fae548d3Szrj
361*fae548d3Szrj /* Write out the cref table. */
362*fae548d3Szrj
363*fae548d3Szrj #define FILECOL (50)
364*fae548d3Szrj
365*fae548d3Szrj void
output_cref(FILE * fp)366*fae548d3Szrj output_cref (FILE *fp)
367*fae548d3Szrj {
368*fae548d3Szrj int len;
369*fae548d3Szrj struct cref_hash_entry **csyms, **csym_fill, **csym, **csym_end;
370*fae548d3Szrj const char *msg;
371*fae548d3Szrj
372*fae548d3Szrj fprintf (fp, _("\nCross Reference Table\n\n"));
373*fae548d3Szrj msg = _("Symbol");
374*fae548d3Szrj fprintf (fp, "%s", msg);
375*fae548d3Szrj len = strlen (msg);
376*fae548d3Szrj while (len < FILECOL)
377*fae548d3Szrj {
378*fae548d3Szrj putc (' ', fp);
379*fae548d3Szrj ++len;
380*fae548d3Szrj }
381*fae548d3Szrj fprintf (fp, _("File\n"));
382*fae548d3Szrj
383*fae548d3Szrj if (!cref_initialized)
384*fae548d3Szrj {
385*fae548d3Szrj fprintf (fp, _("No symbols\n"));
386*fae548d3Szrj return;
387*fae548d3Szrj }
388*fae548d3Szrj
389*fae548d3Szrj csyms = (struct cref_hash_entry **) xmalloc (cref_symcount * sizeof (*csyms));
390*fae548d3Szrj
391*fae548d3Szrj csym_fill = csyms;
392*fae548d3Szrj cref_hash_traverse (&cref_table, cref_fill_array, &csym_fill);
393*fae548d3Szrj ASSERT ((size_t) (csym_fill - csyms) == cref_symcount);
394*fae548d3Szrj
395*fae548d3Szrj qsort (csyms, cref_symcount, sizeof (*csyms), cref_sort_array);
396*fae548d3Szrj
397*fae548d3Szrj csym_end = csyms + cref_symcount;
398*fae548d3Szrj for (csym = csyms; csym < csym_end; csym++)
399*fae548d3Szrj output_one_cref (fp, *csym);
400*fae548d3Szrj }
401*fae548d3Szrj
402*fae548d3Szrj /* Output one entry in the cross reference table. */
403*fae548d3Szrj
404*fae548d3Szrj static void
output_one_cref(FILE * fp,struct cref_hash_entry * h)405*fae548d3Szrj output_one_cref (FILE *fp, struct cref_hash_entry *h)
406*fae548d3Szrj {
407*fae548d3Szrj int len;
408*fae548d3Szrj struct bfd_link_hash_entry *hl;
409*fae548d3Szrj struct cref_ref *r;
410*fae548d3Szrj
411*fae548d3Szrj hl = bfd_link_hash_lookup (link_info.hash, h->root.string, FALSE,
412*fae548d3Szrj FALSE, TRUE);
413*fae548d3Szrj if (hl == NULL)
414*fae548d3Szrj einfo (_("%P: symbol `%pT' missing from main hash table\n"),
415*fae548d3Szrj h->root.string);
416*fae548d3Szrj else
417*fae548d3Szrj {
418*fae548d3Szrj /* If this symbol is defined in a dynamic object but never
419*fae548d3Szrj referenced by a normal object, then don't print it. */
420*fae548d3Szrj if (hl->type == bfd_link_hash_defined)
421*fae548d3Szrj {
422*fae548d3Szrj if (hl->u.def.section->output_section == NULL)
423*fae548d3Szrj return;
424*fae548d3Szrj if (hl->u.def.section->owner != NULL
425*fae548d3Szrj && (hl->u.def.section->owner->flags & DYNAMIC) != 0)
426*fae548d3Szrj {
427*fae548d3Szrj for (r = h->refs; r != NULL; r = r->next)
428*fae548d3Szrj if ((r->abfd->flags & DYNAMIC) == 0)
429*fae548d3Szrj break;
430*fae548d3Szrj if (r == NULL)
431*fae548d3Szrj return;
432*fae548d3Szrj }
433*fae548d3Szrj }
434*fae548d3Szrj }
435*fae548d3Szrj
436*fae548d3Szrj if (demangling)
437*fae548d3Szrj {
438*fae548d3Szrj fprintf (fp, "%s ", h->demangled);
439*fae548d3Szrj len = strlen (h->demangled) + 1;
440*fae548d3Szrj }
441*fae548d3Szrj else
442*fae548d3Szrj {
443*fae548d3Szrj fprintf (fp, "%s ", h->root.string);
444*fae548d3Szrj len = strlen (h->root.string) + 1;
445*fae548d3Szrj }
446*fae548d3Szrj
447*fae548d3Szrj for (r = h->refs; r != NULL; r = r->next)
448*fae548d3Szrj {
449*fae548d3Szrj if (r->def)
450*fae548d3Szrj {
451*fae548d3Szrj while (len < FILECOL)
452*fae548d3Szrj {
453*fae548d3Szrj putc (' ', fp);
454*fae548d3Szrj ++len;
455*fae548d3Szrj }
456*fae548d3Szrj lfinfo (fp, "%pB\n", r->abfd);
457*fae548d3Szrj len = 0;
458*fae548d3Szrj }
459*fae548d3Szrj }
460*fae548d3Szrj
461*fae548d3Szrj for (r = h->refs; r != NULL; r = r->next)
462*fae548d3Szrj {
463*fae548d3Szrj if (r->common)
464*fae548d3Szrj {
465*fae548d3Szrj while (len < FILECOL)
466*fae548d3Szrj {
467*fae548d3Szrj putc (' ', fp);
468*fae548d3Szrj ++len;
469*fae548d3Szrj }
470*fae548d3Szrj lfinfo (fp, "%pB\n", r->abfd);
471*fae548d3Szrj len = 0;
472*fae548d3Szrj }
473*fae548d3Szrj }
474*fae548d3Szrj
475*fae548d3Szrj for (r = h->refs; r != NULL; r = r->next)
476*fae548d3Szrj {
477*fae548d3Szrj if (!r->def && !r->common)
478*fae548d3Szrj {
479*fae548d3Szrj while (len < FILECOL)
480*fae548d3Szrj {
481*fae548d3Szrj putc (' ', fp);
482*fae548d3Szrj ++len;
483*fae548d3Szrj }
484*fae548d3Szrj lfinfo (fp, "%pB\n", r->abfd);
485*fae548d3Szrj len = 0;
486*fae548d3Szrj }
487*fae548d3Szrj }
488*fae548d3Szrj
489*fae548d3Szrj ASSERT (len == 0);
490*fae548d3Szrj }
491*fae548d3Szrj
492*fae548d3Szrj /* Check for prohibited cross references. */
493*fae548d3Szrj
494*fae548d3Szrj void
check_nocrossrefs(void)495*fae548d3Szrj check_nocrossrefs (void)
496*fae548d3Szrj {
497*fae548d3Szrj if (!cref_initialized)
498*fae548d3Szrj return;
499*fae548d3Szrj
500*fae548d3Szrj cref_hash_traverse (&cref_table, check_nocrossref, NULL);
501*fae548d3Szrj
502*fae548d3Szrj lang_for_each_file (check_local_sym_xref);
503*fae548d3Szrj }
504*fae548d3Szrj
505*fae548d3Szrj /* Check for prohibited cross references to local and section symbols. */
506*fae548d3Szrj
507*fae548d3Szrj static void
check_local_sym_xref(lang_input_statement_type * statement)508*fae548d3Szrj check_local_sym_xref (lang_input_statement_type *statement)
509*fae548d3Szrj {
510*fae548d3Szrj bfd *abfd;
511*fae548d3Szrj asymbol **syms;
512*fae548d3Szrj
513*fae548d3Szrj abfd = statement->the_bfd;
514*fae548d3Szrj if (abfd == NULL)
515*fae548d3Szrj return;
516*fae548d3Szrj
517*fae548d3Szrj if (!bfd_generic_link_read_symbols (abfd))
518*fae548d3Szrj einfo (_("%F%P: %pB: could not read symbols: %E\n"), abfd);
519*fae548d3Szrj
520*fae548d3Szrj for (syms = bfd_get_outsymbols (abfd); *syms; ++syms)
521*fae548d3Szrj {
522*fae548d3Szrj asymbol *sym = *syms;
523*fae548d3Szrj if (sym->flags & (BSF_GLOBAL | BSF_WARNING | BSF_INDIRECT | BSF_FILE))
524*fae548d3Szrj continue;
525*fae548d3Szrj if ((sym->flags & (BSF_LOCAL | BSF_SECTION_SYM)) != 0
526*fae548d3Szrj && sym->section->output_section != NULL)
527*fae548d3Szrj {
528*fae548d3Szrj const char *outsecname, *symname;
529*fae548d3Szrj struct lang_nocrossrefs *ncrs;
530*fae548d3Szrj struct lang_nocrossref *ncr;
531*fae548d3Szrj
532*fae548d3Szrj outsecname = sym->section->output_section->name;
533*fae548d3Szrj symname = NULL;
534*fae548d3Szrj if ((sym->flags & BSF_SECTION_SYM) == 0)
535*fae548d3Szrj symname = sym->name;
536*fae548d3Szrj for (ncrs = nocrossref_list; ncrs != NULL; ncrs = ncrs->next)
537*fae548d3Szrj for (ncr = ncrs->list; ncr != NULL; ncr = ncr->next)
538*fae548d3Szrj {
539*fae548d3Szrj if (strcmp (ncr->name, outsecname) == 0)
540*fae548d3Szrj check_refs (symname, FALSE, sym->section, abfd, ncrs);
541*fae548d3Szrj /* The NOCROSSREFS_TO command only checks symbols defined in
542*fae548d3Szrj the first section in the list. */
543*fae548d3Szrj if (ncrs->onlyfirst)
544*fae548d3Szrj break;
545*fae548d3Szrj }
546*fae548d3Szrj }
547*fae548d3Szrj }
548*fae548d3Szrj }
549*fae548d3Szrj
550*fae548d3Szrj /* Check one symbol to see if it is a prohibited cross reference. */
551*fae548d3Szrj
552*fae548d3Szrj static bfd_boolean
check_nocrossref(struct cref_hash_entry * h,void * ignore ATTRIBUTE_UNUSED)553*fae548d3Szrj check_nocrossref (struct cref_hash_entry *h, void *ignore ATTRIBUTE_UNUSED)
554*fae548d3Szrj {
555*fae548d3Szrj struct bfd_link_hash_entry *hl;
556*fae548d3Szrj asection *defsec;
557*fae548d3Szrj const char *defsecname;
558*fae548d3Szrj struct lang_nocrossrefs *ncrs;
559*fae548d3Szrj struct lang_nocrossref *ncr;
560*fae548d3Szrj struct cref_ref *ref;
561*fae548d3Szrj
562*fae548d3Szrj hl = bfd_link_hash_lookup (link_info.hash, h->root.string, FALSE,
563*fae548d3Szrj FALSE, TRUE);
564*fae548d3Szrj if (hl == NULL)
565*fae548d3Szrj {
566*fae548d3Szrj einfo (_("%P: symbol `%pT' missing from main hash table\n"),
567*fae548d3Szrj h->root.string);
568*fae548d3Szrj return TRUE;
569*fae548d3Szrj }
570*fae548d3Szrj
571*fae548d3Szrj if (hl->type != bfd_link_hash_defined
572*fae548d3Szrj && hl->type != bfd_link_hash_defweak)
573*fae548d3Szrj return TRUE;
574*fae548d3Szrj
575*fae548d3Szrj defsec = hl->u.def.section->output_section;
576*fae548d3Szrj if (defsec == NULL)
577*fae548d3Szrj return TRUE;
578*fae548d3Szrj defsecname = bfd_section_name (defsec);
579*fae548d3Szrj
580*fae548d3Szrj for (ncrs = nocrossref_list; ncrs != NULL; ncrs = ncrs->next)
581*fae548d3Szrj for (ncr = ncrs->list; ncr != NULL; ncr = ncr->next)
582*fae548d3Szrj {
583*fae548d3Szrj if (strcmp (ncr->name, defsecname) == 0)
584*fae548d3Szrj for (ref = h->refs; ref != NULL; ref = ref->next)
585*fae548d3Szrj check_refs (hl->root.string, TRUE, hl->u.def.section,
586*fae548d3Szrj ref->abfd, ncrs);
587*fae548d3Szrj /* The NOCROSSREFS_TO command only checks symbols defined in the first
588*fae548d3Szrj section in the list. */
589*fae548d3Szrj if (ncrs->onlyfirst)
590*fae548d3Szrj break;
591*fae548d3Szrj }
592*fae548d3Szrj
593*fae548d3Szrj return TRUE;
594*fae548d3Szrj }
595*fae548d3Szrj
596*fae548d3Szrj /* The struct is used to pass information from check_refs to
597*fae548d3Szrj check_reloc_refs through bfd_map_over_sections. */
598*fae548d3Szrj
599*fae548d3Szrj struct check_refs_info
600*fae548d3Szrj {
601*fae548d3Szrj const char *sym_name;
602*fae548d3Szrj asection *defsec;
603*fae548d3Szrj struct lang_nocrossrefs *ncrs;
604*fae548d3Szrj asymbol **asymbols;
605*fae548d3Szrj bfd_boolean global;
606*fae548d3Szrj };
607*fae548d3Szrj
608*fae548d3Szrj /* This function is called for each symbol defined in a section which
609*fae548d3Szrj prohibits cross references. We need to look through all references
610*fae548d3Szrj to this symbol, and ensure that the references are not from
611*fae548d3Szrj prohibited sections. */
612*fae548d3Szrj
613*fae548d3Szrj static void
check_refs(const char * name,bfd_boolean global,asection * sec,bfd * abfd,struct lang_nocrossrefs * ncrs)614*fae548d3Szrj check_refs (const char *name,
615*fae548d3Szrj bfd_boolean global,
616*fae548d3Szrj asection *sec,
617*fae548d3Szrj bfd *abfd,
618*fae548d3Szrj struct lang_nocrossrefs *ncrs)
619*fae548d3Szrj {
620*fae548d3Szrj struct check_refs_info info;
621*fae548d3Szrj
622*fae548d3Szrj /* We need to look through the relocations for this BFD, to see
623*fae548d3Szrj if any of the relocations which refer to this symbol are from
624*fae548d3Szrj a prohibited section. Note that we need to do this even for
625*fae548d3Szrj the BFD in which the symbol is defined, since even a single
626*fae548d3Szrj BFD might contain a prohibited cross reference. */
627*fae548d3Szrj
628*fae548d3Szrj if (!bfd_generic_link_read_symbols (abfd))
629*fae548d3Szrj einfo (_("%F%P: %pB: could not read symbols: %E\n"), abfd);
630*fae548d3Szrj
631*fae548d3Szrj info.sym_name = name;
632*fae548d3Szrj info.global = global;
633*fae548d3Szrj info.defsec = sec;
634*fae548d3Szrj info.ncrs = ncrs;
635*fae548d3Szrj info.asymbols = bfd_get_outsymbols (abfd);
636*fae548d3Szrj bfd_map_over_sections (abfd, check_reloc_refs, &info);
637*fae548d3Szrj }
638*fae548d3Szrj
639*fae548d3Szrj /* This is called via bfd_map_over_sections. INFO->SYM_NAME is a symbol
640*fae548d3Szrj defined in INFO->DEFSECNAME. If this section maps into any of the
641*fae548d3Szrj sections listed in INFO->NCRS, other than INFO->DEFSECNAME, then we
642*fae548d3Szrj look through the relocations. If any of the relocations are to
643*fae548d3Szrj INFO->SYM_NAME, then we report a prohibited cross reference error. */
644*fae548d3Szrj
645*fae548d3Szrj static void
check_reloc_refs(bfd * abfd,asection * sec,void * iarg)646*fae548d3Szrj check_reloc_refs (bfd *abfd, asection *sec, void *iarg)
647*fae548d3Szrj {
648*fae548d3Szrj struct check_refs_info *info = (struct check_refs_info *) iarg;
649*fae548d3Szrj asection *outsec;
650*fae548d3Szrj const char *outsecname;
651*fae548d3Szrj asection *outdefsec;
652*fae548d3Szrj const char *outdefsecname;
653*fae548d3Szrj struct lang_nocrossref *ncr;
654*fae548d3Szrj const char *symname;
655*fae548d3Szrj bfd_boolean global;
656*fae548d3Szrj long relsize;
657*fae548d3Szrj arelent **relpp;
658*fae548d3Szrj long relcount;
659*fae548d3Szrj arelent **p, **pend;
660*fae548d3Szrj
661*fae548d3Szrj outsec = sec->output_section;
662*fae548d3Szrj outsecname = bfd_section_name (outsec);
663*fae548d3Szrj
664*fae548d3Szrj outdefsec = info->defsec->output_section;
665*fae548d3Szrj outdefsecname = bfd_section_name (outdefsec);
666*fae548d3Szrj
667*fae548d3Szrj /* The section where the symbol is defined is permitted. */
668*fae548d3Szrj if (strcmp (outsecname, outdefsecname) == 0)
669*fae548d3Szrj return;
670*fae548d3Szrj
671*fae548d3Szrj for (ncr = info->ncrs->list; ncr != NULL; ncr = ncr->next)
672*fae548d3Szrj if (strcmp (outsecname, ncr->name) == 0)
673*fae548d3Szrj break;
674*fae548d3Szrj
675*fae548d3Szrj if (ncr == NULL)
676*fae548d3Szrj return;
677*fae548d3Szrj
678*fae548d3Szrj /* This section is one for which cross references are prohibited.
679*fae548d3Szrj Look through the relocations, and see if any of them are to
680*fae548d3Szrj INFO->SYM_NAME. If INFO->SYMNAME is NULL, check for relocations
681*fae548d3Szrj against the section symbol. If INFO->GLOBAL is TRUE, the
682*fae548d3Szrj definition is global, check for relocations against the global
683*fae548d3Szrj symbols. Otherwise check for relocations against the local and
684*fae548d3Szrj section symbols. */
685*fae548d3Szrj
686*fae548d3Szrj symname = info->sym_name;
687*fae548d3Szrj global = info->global;
688*fae548d3Szrj
689*fae548d3Szrj relsize = bfd_get_reloc_upper_bound (abfd, sec);
690*fae548d3Szrj if (relsize < 0)
691*fae548d3Szrj einfo (_("%F%P: %pB: could not read relocs: %E\n"), abfd);
692*fae548d3Szrj if (relsize == 0)
693*fae548d3Szrj return;
694*fae548d3Szrj
695*fae548d3Szrj relpp = (arelent **) xmalloc (relsize);
696*fae548d3Szrj relcount = bfd_canonicalize_reloc (abfd, sec, relpp, info->asymbols);
697*fae548d3Szrj if (relcount < 0)
698*fae548d3Szrj einfo (_("%F%P: %pB: could not read relocs: %E\n"), abfd);
699*fae548d3Szrj
700*fae548d3Szrj p = relpp;
701*fae548d3Szrj pend = p + relcount;
702*fae548d3Szrj for (; p < pend && *p != NULL; p++)
703*fae548d3Szrj {
704*fae548d3Szrj arelent *q = *p;
705*fae548d3Szrj
706*fae548d3Szrj if (q->sym_ptr_ptr != NULL
707*fae548d3Szrj && *q->sym_ptr_ptr != NULL
708*fae548d3Szrj && ((global
709*fae548d3Szrj && (bfd_is_und_section (bfd_asymbol_section (*q->sym_ptr_ptr))
710*fae548d3Szrj || bfd_is_com_section (bfd_asymbol_section (*q->sym_ptr_ptr))
711*fae548d3Szrj || ((*q->sym_ptr_ptr)->flags & (BSF_GLOBAL
712*fae548d3Szrj | BSF_WEAK)) != 0))
713*fae548d3Szrj || (!global
714*fae548d3Szrj && ((*q->sym_ptr_ptr)->flags & (BSF_LOCAL
715*fae548d3Szrj | BSF_SECTION_SYM)) != 0
716*fae548d3Szrj && bfd_asymbol_section (*q->sym_ptr_ptr) == info->defsec))
717*fae548d3Szrj && (symname != NULL
718*fae548d3Szrj ? strcmp (bfd_asymbol_name (*q->sym_ptr_ptr), symname) == 0
719*fae548d3Szrj : ((*q->sym_ptr_ptr)->flags & BSF_SECTION_SYM) != 0))
720*fae548d3Szrj {
721*fae548d3Szrj /* We found a reloc for the symbol. The symbol is defined
722*fae548d3Szrj in OUTSECNAME. This reloc is from a section which is
723*fae548d3Szrj mapped into a section from which references to OUTSECNAME
724*fae548d3Szrj are prohibited. We must report an error. */
725*fae548d3Szrj einfo (_("%X%P: %C: prohibited cross reference from %s to `%pT' in %s\n"),
726*fae548d3Szrj abfd, sec, q->address, outsecname,
727*fae548d3Szrj bfd_asymbol_name (*q->sym_ptr_ptr), outdefsecname);
728*fae548d3Szrj }
729*fae548d3Szrj }
730*fae548d3Szrj
731*fae548d3Szrj free (relpp);
732*fae548d3Szrj }
733