1 /* 8 and 16 bit COFF relocation functions, for BFD.
2 Copyright 1990, 91, 92, 93, 94, 95, 96, 97, 98, 2000
3 Free Software Foundation, Inc.
4 Written by Cygnus Support.
6 This file is part of BFD, the Binary File Descriptor library.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
22 /* Most of this hacked by Steve Chamberlain <sac@cygnus.com>. */
24 /* These routines are used by coff-h8300 and coff-z8k to do
27 FIXME: This code should be rewritten to support the new COFF
28 linker. Basically, they need to deal with COFF relocs rather than
29 BFD generic relocs. They should store the relocs in some location
30 where coff_link_input_bfd can find them (and coff_link_input_bfd
31 should be changed to use this location rather than rereading the
32 file) (unless info->keep_memory is false, in which case they should
33 free up the relocs after dealing with them). */
40 #include "coff/internal.h"
44 bfd_coff_reloc16_get_value (reloc
, link_info
, input_section
)
46 struct bfd_link_info
*link_info
;
47 asection
*input_section
;
50 asymbol
*symbol
= *(reloc
->sym_ptr_ptr
);
51 /* A symbol holds a pointer to a section, and an offset from the
52 base of the section. To relocate, we find where the section will
53 live in the output and add that in. */
55 if (bfd_is_und_section (symbol
->section
)
56 || bfd_is_com_section (symbol
->section
))
58 struct bfd_link_hash_entry
*h
;
60 /* The symbol is undefined in this BFD. Look it up in the
61 global linker hash table. FIXME: This should be changed when
62 we convert this stuff to use a specific final_link function
63 and change the interface to bfd_relax_section to not require
64 the generic symbols. */
65 h
= bfd_wrapped_link_hash_lookup (input_section
->owner
, link_info
,
66 bfd_asymbol_name (symbol
),
68 if (h
!= (struct bfd_link_hash_entry
*) NULL
69 && (h
->type
== bfd_link_hash_defined
70 || h
->type
== bfd_link_hash_defweak
))
71 value
= (h
->u
.def
.value
72 + h
->u
.def
.section
->output_section
->vma
73 + h
->u
.def
.section
->output_offset
);
74 else if (h
!= (struct bfd_link_hash_entry
*) NULL
75 && h
->type
== bfd_link_hash_common
)
79 if (!((*link_info
->callbacks
->undefined_symbol
)
80 (link_info
, bfd_asymbol_name (symbol
),
81 input_section
->owner
, input_section
, reloc
->address
,
90 + symbol
->section
->output_offset
91 + symbol
->section
->output_section
->vma
;
94 /* Add the value contained in the relocation. */
95 value
+= reloc
->addend
;
101 bfd_perform_slip (abfd
, slip
, input_section
, value
)
104 asection
*input_section
;
109 s
= _bfd_generic_link_get_symbols (abfd
);
110 BFD_ASSERT (s
!= (asymbol
**) NULL
);
112 /* Find all symbols past this point, and make them know
117 if (p
->section
== input_section
)
119 /* This was pointing into this section, so mangle it. */
120 if (p
->value
> value
)
123 if (p
->udata
.p
!= NULL
)
125 struct generic_link_hash_entry
*h
;
127 h
= (struct generic_link_hash_entry
*) p
->udata
.p
;
128 BFD_ASSERT (h
->root
.type
== bfd_link_hash_defined
129 || h
->root
.type
== bfd_link_hash_defweak
);
130 h
->root
.u
.def
.value
-= slip
;
131 BFD_ASSERT (h
->root
.u
.def
.value
== p
->value
);
140 bfd_coff_reloc16_relax_section (abfd
, i
, link_info
, again
)
143 struct bfd_link_info
*link_info
;
146 /* Get enough memory to hold the stuff. */
147 bfd
*input_bfd
= i
->owner
;
148 asection
*input_section
= i
;
151 long reloc_size
= bfd_get_reloc_upper_bound (input_bfd
, input_section
);
152 arelent
**reloc_vector
= NULL
;
155 /* We only do global relaxation once. It is not safe to do it multiple
156 times (see discussion of the "shrinks" array below). */
162 reloc_vector
= (arelent
**) bfd_malloc (reloc_size
);
163 if (!reloc_vector
&& reloc_size
> 0)
166 /* Get the relocs and think about them. */
168 bfd_canonicalize_reloc (input_bfd
, input_section
, reloc_vector
,
169 _bfd_generic_link_get_symbols (input_bfd
));
176 /* The reloc16.c and related relaxing code is very simple, the price
177 for that simplicity is we can only call this function once for
180 So, to get the best results within that limitation, we do multiple
181 relaxing passes over each section here. That involves keeping track
182 of the "shrink" at each reloc in the section. This allows us to
183 accurately determine the relative location of two relocs within
186 In theory, if we kept the "shrinks" array for each section for the
187 entire link, we could use the generic relaxing code in the linker
188 and get better results, particularly for jsr->bsr and 24->16 bit
189 memory reference relaxations. */
193 int another_pass
= 0;
195 /* Allocate and initialize the shrinks array for this section.
196 The last element is used as an accumlator of shrinks. */
197 shrinks
= (int *) bfd_malloc ((reloc_count
+ 1) * sizeof (int));
198 memset (shrinks
, 0, (reloc_count
+ 1) * sizeof (int));
200 /* Loop until nothing changes in this section. */
208 for (i
= 0, parent
= reloc_vector
; *parent
; parent
++, i
++)
210 /* Let the target/machine dependent code examine each reloc
211 in this section and attempt to shrink it. */
212 shrink
= bfd_coff_reloc16_estimate (abfd
, input_section
, *parent
,
213 shrinks
[i
], link_info
);
215 /* If it shrunk, note it in the shrinks array and set up for
217 if (shrink
!= shrinks
[i
])
220 for (j
= i
+ 1; j
<= reloc_count
; j
++)
221 shrinks
[j
] += shrink
- shrinks
[i
];
225 while (another_pass
);
227 shrink
= shrinks
[reloc_count
];
228 free ((char *) shrinks
);
231 input_section
->_cooked_size
-= shrink
;
232 free ((char *) reloc_vector
);
237 bfd_coff_reloc16_get_relocated_section_contents(in_abfd
,
244 struct bfd_link_info
*link_info
;
245 struct bfd_link_order
*link_order
;
247 boolean relocateable
;
250 /* Get enough memory to hold the stuff. */
251 bfd
*input_bfd
= link_order
->u
.indirect
.section
->owner
;
252 asection
*input_section
= link_order
->u
.indirect
.section
;
253 long reloc_size
= bfd_get_reloc_upper_bound (input_bfd
, input_section
);
254 arelent
**reloc_vector
;
260 /* If producing relocateable output, don't bother to relax. */
262 return bfd_generic_get_relocated_section_contents (in_abfd
, link_info
,
267 /* Read in the section. */
268 if (!bfd_get_section_contents(input_bfd
,
272 input_section
->_raw_size
))
275 reloc_vector
= (arelent
**) bfd_malloc ((size_t) reloc_size
);
276 if (!reloc_vector
&& reloc_size
!= 0)
279 reloc_count
= bfd_canonicalize_reloc (input_bfd
,
291 arelent
**parent
= reloc_vector
;
293 unsigned int dst_address
= 0;
294 unsigned int src_address
= 0;
298 /* Find how long a run we can do. */
299 while (dst_address
< link_order
->size
)
304 /* Note that the relaxing didn't tie up the addresses in the
305 relocation, so we use the original address to work out the
306 run of non-relocated data. */
307 run
= reloc
->address
- src_address
;
312 run
= link_order
->size
- dst_address
;
315 /* Copy the bytes. */
316 for (idx
= 0; idx
< run
; idx
++)
317 data
[dst_address
++] = data
[src_address
++];
319 /* Now do the relocation. */
322 bfd_coff_reloc16_extra_cases (input_bfd
, link_info
, link_order
,
323 reloc
, data
, &src_address
,
328 free ((char *) reloc_vector
);
This page took 0.034832 seconds and 4 git commands to generate.