Commit | Line | Data |
---|---|---|
fecd2382 | 1 | /* write.c - emit .o file |
3340f7e5 RP |
2 | |
3 | Copyright (C) 1986, 1987, 1990, 1991, 1992 Free Software Foundation, Inc. | |
a39116f1 RP |
4 | |
5 | This file is part of GAS, the GNU Assembler. | |
6 | ||
7 | GAS is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GAS is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GAS; see the file COPYING. If not, write to | |
19 | the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
fecd2382 | 20 | |
c593cf41 | 21 | /* This thing should be set up to do byteordering correctly. But... */ |
fecd2382 RP |
22 | |
23 | #include "as.h" | |
fecd2382 RP |
24 | #include "subsegs.h" |
25 | #include "obstack.h" | |
26 | #include "output-file.h" | |
27 | ||
6d5460ab RP |
28 | /* The NOP_OPCODE is for the alignment fill value. |
29 | * fill it a nop instruction so that the disassembler does not choke | |
30 | * on it | |
31 | */ | |
32 | #ifndef NOP_OPCODE | |
33 | #define NOP_OPCODE 0x00 | |
34 | #endif | |
35 | ||
45432836 | 36 | #ifndef MANY_SEGMENTS |
fecd2382 RP |
37 | static struct frag *text_frag_root; |
38 | static struct frag *data_frag_root; | |
39 | ||
40 | static struct frag *text_last_frag; /* Last frag in segment. */ | |
41 | static struct frag *data_last_frag; /* Last frag in segment. */ | |
45432836 | 42 | #endif |
fecd2382 RP |
43 | |
44 | static object_headers headers; | |
45 | ||
46 | long string_byte_count; | |
47 | ||
48 | static char *the_object_file; | |
49 | ||
50 | char *next_object_file_charP; /* Tracks object file bytes. */ | |
51 | ||
52 | int magic_number_for_object_file = DEFAULT_MAGIC_NUMBER_FOR_OBJECT_FILE; | |
53 | ||
54 | /* static long length; JF unused */ /* String length, including trailing '\0'. */ | |
55 | ||
56 | ||
3340f7e5 | 57 | #if __STDC__ == 1 |
fecd2382 RP |
58 | |
59 | static int is_dnrange(struct frag *f1, struct frag *f2); | |
60 | static long fixup_segment(fixS *fixP, segT this_segment_type); | |
61 | static relax_addressT relax_align(relax_addressT address, long alignment); | |
a39116f1 | 62 | void relax_segment(struct frag *segment_frag_root, segT segment_type); |
fecd2382 RP |
63 | |
64 | #else | |
65 | ||
66 | static int is_dnrange(); | |
67 | static long fixup_segment(); | |
68 | static relax_addressT relax_align(); | |
a39116f1 | 69 | void relax_segment(); |
fecd2382 | 70 | |
3340f7e5 | 71 | #endif /* not __STDC__ */ |
fecd2382 RP |
72 | |
73 | /* | |
74 | * fix_new() | |
75 | * | |
76 | * Create a fixS in obstack 'notes'. | |
77 | */ | |
343fb08d | 78 | fixS *fix_new(frag, where, size, add_symbol, sub_symbol, offset, pcrel, r_type) |
fecd2382 RP |
79 | fragS *frag; /* Which frag? */ |
80 | int where; /* Where in that frag? */ | |
6d5460ab | 81 | short int size; /* 1, 2, or 4 usually. */ |
fecd2382 RP |
82 | symbolS *add_symbol; /* X_add_symbol. */ |
83 | symbolS *sub_symbol; /* X_subtract_symbol. */ | |
84 | long offset; /* X_add_number. */ | |
85 | int pcrel; /* TRUE if PC-relative relocation. */ | |
c593cf41 | 86 | int r_type; /* Relocation type */ |
fecd2382 | 87 | { |
542e1629 | 88 | fixS *fixP; |
a39116f1 | 89 | |
542e1629 | 90 | fixP = (fixS *) obstack_alloc(¬es, sizeof(fixS)); |
a39116f1 RP |
91 | |
92 | fixP->fx_frag = frag; | |
93 | fixP->fx_where = where; | |
94 | fixP->fx_size = size; | |
95 | fixP->fx_addsy = add_symbol; | |
96 | fixP->fx_subsy = sub_symbol; | |
97 | fixP->fx_offset = offset; | |
98 | fixP->fx_pcrel = pcrel; | |
961815e4 | 99 | #if defined(TC_SPARC) || defined(TC_A29K) || defined( NEED_FX_R_TYPE) |
a39116f1 | 100 | fixP->fx_r_type = r_type; |
c593cf41 | 101 | #endif |
a39116f1 | 102 | /* JF these 'cuz of the NS32K stuff */ |
542e1629 | 103 | fixP->fx_im_disp = 0; |
a39116f1 | 104 | fixP->fx_pcrel_adjust = 0; |
542e1629 RP |
105 | fixP->fx_bsr = 0; |
106 | fixP->fx_bit_fixP = 0; | |
a39116f1 RP |
107 | |
108 | /* usually, we want relocs sorted numerically, but while | |
109 | comparing to older versions of gas that have relocs | |
110 | reverse sorted, it is convenient to have this compile | |
111 | time option. xoxorich. */ | |
112 | ||
f6e504fe | 113 | #ifdef REVERSE_SORT_RELOCS |
a39116f1 RP |
114 | |
115 | fixP->fx_next = *seg_fix_rootP; | |
116 | *seg_fix_rootP = fixP; | |
117 | ||
f6e504fe | 118 | #else /* REVERSE_SORT_RELOCS */ |
a39116f1 RP |
119 | |
120 | fixP->fx_next = NULL; | |
121 | ||
122 | if (*seg_fix_tailP) | |
123 | (*seg_fix_tailP)->fx_next = fixP; | |
124 | else | |
125 | *seg_fix_rootP = fixP; | |
126 | *seg_fix_tailP = fixP; | |
127 | ||
f6e504fe | 128 | #endif /* REVERSE_SORT_RELOCS */ |
a39116f1 RP |
129 | |
130 | fixP->fx_callj = 0; | |
542e1629 RP |
131 | return(fixP); |
132 | } /* fix_new() */ | |
133 | ||
45432836 JG |
134 | #ifndef BFD |
135 | void write_object_file() | |
136 | { | |
a39116f1 RP |
137 | register struct frchain * frchainP; /* Track along all frchains. */ |
138 | register fragS * fragP; /* Track along all frags. */ | |
139 | register struct frchain * next_frchainP; | |
140 | register fragS * * prev_fragPP; | |
141 | /* register char * name; */ | |
142 | /* symbolS *symbolP; */ | |
143 | /* register symbolS ** symbolPP; */ | |
144 | /* register fixS * fixP; JF unused */ | |
145 | unsigned int data_siz; | |
146 | ||
a39116f1 RP |
147 | long object_file_size; |
148 | ||
fecd2382 | 149 | #ifdef VMS |
a39116f1 RP |
150 | /* |
151 | * Under VMS we try to be compatible with VAX-11 "C". Thus, we | |
152 | * call a routine to check for the definition of the procedure | |
153 | * "_main", and if so -- fix it up so that it can be program | |
154 | * entry point. | |
155 | */ | |
156 | VMS_Check_For_Main(); | |
fecd2382 | 157 | #endif /* VMS */ |
a39116f1 RP |
158 | /* |
159 | * After every sub-segment, we fake an ".align ...". This conforms to BSD4.2 | |
160 | * brane-damage. We then fake ".fill 0" because that is the kind of frag | |
161 | * that requires least thought. ".align" frags like to have a following | |
162 | * frag since that makes calculating their intended length trivial. | |
163 | */ | |
fecd2382 | 164 | #define SUB_SEGMENT_ALIGN (2) |
a39116f1 | 165 | for (frchainP = frchain_root; frchainP; frchainP = frchainP->frch_next) { |
fecd2382 | 166 | #ifdef VMS |
a39116f1 RP |
167 | /* |
168 | * Under VAX/VMS, the linker (and PSECT specifications) | |
169 | * take care of correctly aligning the segments. | |
170 | * Doing the alignment here (on initialized data) can | |
171 | * mess up the calculation of global data PSECT sizes. | |
172 | */ | |
fecd2382 RP |
173 | #undef SUB_SEGMENT_ALIGN |
174 | #define SUB_SEGMENT_ALIGN ((frchainP->frch_seg != SEG_DATA) ? 2 : 0) | |
175 | #endif /* VMS */ | |
a39116f1 | 176 | subseg_new (frchainP->frch_seg, frchainP->frch_subseg); |
6d5460ab | 177 | frag_align (SUB_SEGMENT_ALIGN, NOP_OPCODE); |
a39116f1 RP |
178 | /* frag_align will have left a new frag. */ |
179 | /* Use this last frag for an empty ".fill". */ | |
180 | /* | |
181 | * For this segment ... | |
182 | * Create a last frag. Do not leave a "being filled in frag". | |
183 | */ | |
184 | frag_wane (frag_now); | |
185 | frag_now->fr_fix = 0; | |
186 | know( frag_now->fr_next == NULL ); | |
187 | /* know( frags . obstack_c_base == frags . obstack_c_next_free ); */ | |
188 | /* Above shows we haven't left a half-completed object on obstack. */ | |
189 | } /* walk the frag chain */ | |
190 | ||
191 | /* | |
192 | * From now on, we don't care about sub-segments. | |
193 | * Build one frag chain for each segment. Linked thru fr_next. | |
194 | * We know that there is at least 1 text frchain & at least 1 data frchain. | |
195 | */ | |
196 | prev_fragPP = &text_frag_root; | |
197 | for (frchainP = frchain_root; frchainP; frchainP = next_frchainP) { | |
198 | know( frchainP->frch_root ); | |
199 | * prev_fragPP = frchainP->frch_root; | |
c593cf41 SC |
200 | prev_fragPP = & frchainP->frch_last->fr_next; |
201 | ||
202 | if (((next_frchainP = frchainP->frch_next) == NULL) | |
203 | || next_frchainP == data0_frchainP) { | |
204 | prev_fragPP = & data_frag_root; | |
205 | if (next_frchainP) { | |
206 | text_last_frag = frchainP->frch_last; | |
207 | } else { | |
208 | data_last_frag = frchainP->frch_last; | |
209 | } | |
210 | } | |
a39116f1 RP |
211 | } /* walk the frag chain */ |
212 | ||
213 | /* | |
214 | * We have two segments. If user gave -R flag, then we must put the | |
215 | * data frags into the text segment. Do this before relaxing so | |
216 | * we know to take advantage of -R and make shorter addresses. | |
217 | */ | |
218 | if (flagseen[ 'R' ]) { | |
219 | fixS *tmp; | |
220 | ||
221 | text_last_frag->fr_next = data_frag_root; | |
222 | text_last_frag = data_last_frag; | |
223 | data_last_frag = NULL; | |
224 | data_frag_root = NULL; | |
225 | if (text_fix_root) { | |
226 | for (tmp = text_fix_root; tmp->fx_next; tmp = tmp->fx_next) ;; | |
227 | tmp->fx_next=data_fix_root; | |
228 | } else | |
229 | text_fix_root=data_fix_root; | |
230 | data_fix_root=NULL; | |
231 | } | |
232 | ||
233 | relax_segment(text_frag_root, SEG_TEXT); | |
234 | relax_segment(data_frag_root, SEG_DATA); | |
235 | /* | |
236 | * Now the addresses of frags are correct within the segment. | |
237 | */ | |
238 | ||
239 | know(text_last_frag->fr_type == rs_fill && text_last_frag->fr_offset == 0); | |
240 | H_SET_TEXT_SIZE(&headers, text_last_frag->fr_address); | |
241 | text_last_frag->fr_address = H_GET_TEXT_SIZE(&headers); | |
242 | ||
243 | /* | |
244 | * Join the 2 segments into 1 huge segment. | |
245 | * To do this, re-compute every rn_address in the SEG_DATA frags. | |
246 | * Then join the data frags after the text frags. | |
247 | * | |
248 | * Determine a_data [length of data segment]. | |
249 | */ | |
250 | if (data_frag_root) { | |
251 | register relax_addressT slide; | |
252 | ||
253 | know((text_last_frag->fr_type == rs_fill) && (text_last_frag->fr_offset == 0)); | |
254 | ||
255 | H_SET_DATA_SIZE(&headers, data_last_frag->fr_address); | |
256 | data_last_frag->fr_address = H_GET_DATA_SIZE(&headers); | |
257 | slide = H_GET_TEXT_SIZE(&headers); /* & in file of the data segment. */ | |
258 | ||
259 | for (fragP = data_frag_root; fragP; fragP = fragP->fr_next) { | |
260 | fragP->fr_address += slide; | |
261 | } /* for each data frag */ | |
262 | ||
263 | know(text_last_frag != 0); | |
264 | text_last_frag->fr_next = data_frag_root; | |
265 | } else { | |
266 | H_SET_DATA_SIZE(&headers,0); | |
267 | data_siz = 0; | |
268 | } | |
269 | ||
6d5460ab RP |
270 | bss_address_frag.fr_address = (H_GET_TEXT_SIZE(&headers) + |
271 | H_GET_DATA_SIZE(&headers)); | |
a39116f1 | 272 | |
c593cf41 | 273 | H_SET_BSS_SIZE(&headers,local_bss_counter); |
a39116f1 RP |
274 | |
275 | /* | |
276 | * | |
277 | * Crawl the symbol chain. | |
278 | * | |
279 | * For each symbol whose value depends on a frag, take the address of | |
280 | * that frag and subsume it into the value of the symbol. | |
281 | * After this, there is just one way to lookup a symbol value. | |
282 | * Values are left in their final state for object file emission. | |
283 | * We adjust the values of 'L' local symbols, even if we do | |
284 | * not intend to emit them to the object file, because their values | |
285 | * are needed for fix-ups. | |
286 | * | |
287 | * Unless we saw a -L flag, remove all symbols that begin with 'L' | |
288 | * from the symbol chain. (They are still pointed to by the fixes.) | |
289 | * | |
290 | * Count the remaining symbols. | |
291 | * Assign a symbol number to each symbol. | |
292 | * Count the number of string-table chars we will emit. | |
293 | * Put this info into the headers as appropriate. | |
294 | * | |
295 | */ | |
296 | know(zero_address_frag.fr_address == 0); | |
297 | string_byte_count = sizeof(string_byte_count); | |
298 | ||
299 | obj_crawl_symbol_chain(&headers); | |
300 | ||
301 | if (string_byte_count == sizeof(string_byte_count)) { | |
302 | string_byte_count = 0; | |
303 | } /* if no strings, then no count. */ | |
304 | ||
305 | H_SET_STRING_SIZE(&headers, string_byte_count); | |
306 | ||
307 | /* | |
308 | * Addresses of frags now reflect addresses we use in the object file. | |
309 | * Symbol values are correct. | |
310 | * Scan the frags, converting any ".org"s and ".align"s to ".fill"s. | |
311 | * Also converting any machine-dependent frags using md_convert_frag(); | |
312 | */ | |
313 | subseg_change(SEG_TEXT, 0); | |
314 | ||
315 | for (fragP = text_frag_root; fragP; fragP = fragP->fr_next) { | |
316 | switch (fragP->fr_type) { | |
317 | case rs_align: | |
318 | case rs_org: | |
319 | fragP->fr_type = rs_fill; | |
320 | know(fragP->fr_var == 1); | |
321 | know(fragP->fr_next != NULL); | |
322 | ||
323 | fragP->fr_offset = (fragP->fr_next->fr_address | |
324 | - fragP->fr_address | |
325 | - fragP->fr_fix); | |
326 | break; | |
327 | ||
328 | case rs_fill: | |
329 | break; | |
330 | ||
331 | case rs_machine_dependent: | |
332 | md_convert_frag(&headers, fragP); | |
333 | ||
334 | know((fragP->fr_next == NULL) || ((fragP->fr_next->fr_address - fragP->fr_address) == fragP->fr_fix)); | |
335 | ||
336 | /* | |
337 | * After md_convert_frag, we make the frag into a ".space 0". | |
338 | * Md_convert_frag() should set up any fixSs and constants | |
339 | * required. | |
340 | */ | |
341 | frag_wane(fragP); | |
342 | break; | |
343 | ||
fecd2382 | 344 | #ifndef WORKING_DOT_WORD |
a39116f1 RP |
345 | case rs_broken_word: { |
346 | struct broken_word *lie; | |
347 | extern md_short_jump_size; | |
348 | extern md_long_jump_size; | |
349 | ||
350 | if (fragP->fr_subtype) { | |
351 | fragP->fr_fix+=md_short_jump_size; | |
352 | for (lie=(struct broken_word *)(fragP->fr_symbol);lie && lie->dispfrag==fragP;lie=lie->next_broken_word) | |
353 | if (lie->added==1) | |
354 | fragP->fr_fix+=md_long_jump_size; | |
355 | } | |
356 | frag_wane(fragP); | |
357 | } | |
358 | break; | |
fecd2382 | 359 | #endif |
a39116f1 RP |
360 | |
361 | default: | |
362 | BAD_CASE( fragP->fr_type ); | |
363 | break; | |
364 | } /* switch (fr_type) */ | |
365 | ||
366 | know((fragP->fr_next == NULL) || ((fragP->fr_next->fr_address - fragP->fr_address) == (fragP->fr_fix + (fragP->fr_offset * fragP->fr_var)))); | |
367 | } /* for each frag. */ | |
368 | ||
fecd2382 | 369 | #ifndef WORKING_DOT_WORD |
a39116f1 RP |
370 | { |
371 | struct broken_word *lie; | |
372 | struct broken_word **prevP; | |
373 | ||
374 | prevP= &broken_words; | |
375 | for (lie=broken_words; lie; lie=lie->next_broken_word) | |
376 | if (!lie->added) { | |
fecd2382 | 377 | #ifdef TC_NS32K |
a39116f1 RP |
378 | fix_new_ns32k(lie->frag, |
379 | lie->word_goes_here - lie->frag->fr_literal, | |
380 | 2, | |
381 | lie->add, | |
382 | lie->sub, | |
383 | lie->addnum, | |
384 | 0, 0, 2, 0, 0); | |
343fb08d SEF |
385 | #else |
386 | # if defined(TC_SPARC) || defined(TC_A29K) || defined(NEED_FX_R_TYPE) | |
a39116f1 RP |
387 | fix_new( lie->frag, lie->word_goes_here - lie->frag->fr_literal, |
388 | 2, lie->add, | |
389 | lie->sub, lie->addnum, | |
390 | 0, NO_RELOC); | |
343fb08d | 391 | # else |
c593cf41 SC |
392 | fix_new( lie->frag, lie->word_goes_here - lie->frag->fr_literal, |
393 | 2, lie->add, | |
394 | lie->sub, lie->addnum, | |
395 | 0, 0); | |
396 | ||
343fb08d | 397 | # endif /* tc_sparc|tc_a29k|need_fx_r_type */ |
fecd2382 | 398 | #endif /* TC_NS32K */ |
a39116f1 RP |
399 | /* md_number_to_chars(lie->word_goes_here, |
400 | S_GET_VALUE(lie->add) | |
401 | + lie->addnum | |
402 | - S_GET_VALUE(lie->sub), | |
403 | 2); */ | |
404 | *prevP=lie->next_broken_word; | |
405 | } else | |
406 | prevP= &(lie->next_broken_word); | |
407 | ||
408 | for (lie=broken_words;lie;) { | |
409 | struct broken_word *untruth; | |
410 | char *table_ptr; | |
411 | long table_addr; | |
412 | long from_addr, | |
413 | to_addr; | |
414 | int n, | |
415 | m; | |
416 | ||
417 | extern md_short_jump_size; | |
418 | extern md_long_jump_size; | |
419 | ||
420 | fragP=lie->dispfrag; | |
421 | ||
422 | /* Find out how many broken_words go here */ | |
423 | n=0; | |
424 | for (untruth=lie;untruth && untruth->dispfrag==fragP;untruth=untruth->next_broken_word) | |
425 | if (untruth->added==1) | |
426 | n++; | |
427 | ||
428 | table_ptr=lie->dispfrag->fr_opcode; | |
429 | table_addr=lie->dispfrag->fr_address+(table_ptr - lie->dispfrag->fr_literal); | |
430 | /* Create the jump around the long jumps */ | |
431 | /* This is a short jump from table_ptr+0 to table_ptr+n*long_jump_size */ | |
432 | from_addr=table_addr; | |
433 | to_addr = table_addr + md_short_jump_size + n * md_long_jump_size; | |
434 | md_create_short_jump(table_ptr, from_addr, to_addr, lie->dispfrag, lie->add); | |
435 | table_ptr+=md_short_jump_size; | |
436 | table_addr+=md_short_jump_size; | |
437 | ||
438 | for (m=0;lie && lie->dispfrag==fragP;m++,lie=lie->next_broken_word) { | |
439 | if (lie->added==2) | |
440 | continue; | |
441 | /* Patch the jump table */ | |
442 | /* This is the offset from ??? to table_ptr+0 */ | |
443 | to_addr = table_addr | |
444 | - S_GET_VALUE(lie->sub); | |
445 | md_number_to_chars(lie->word_goes_here,to_addr,2); | |
446 | for (untruth=lie->next_broken_word;untruth && untruth->dispfrag==fragP;untruth=untruth->next_broken_word) { | |
447 | if (untruth->use_jump==lie) | |
448 | md_number_to_chars(untruth->word_goes_here,to_addr,2); | |
449 | } | |
450 | ||
451 | /* Install the long jump */ | |
452 | /* this is a long jump from table_ptr+0 to the final target */ | |
453 | from_addr=table_addr; | |
454 | to_addr=S_GET_VALUE(lie->add) + lie->addnum; | |
455 | md_create_long_jump(table_ptr,from_addr,to_addr,lie->dispfrag,lie->add); | |
456 | table_ptr+=md_long_jump_size; | |
457 | table_addr+=md_long_jump_size; | |
458 | } | |
459 | } | |
460 | } | |
fecd2382 | 461 | #endif /* not WORKING_DOT_WORD */ |
a39116f1 | 462 | |
fecd2382 | 463 | #ifndef VMS |
a39116f1 RP |
464 | { /* not vms */ |
465 | /* | |
466 | * Scan every FixS performing fixups. We had to wait until now to do | |
467 | * this because md_convert_frag() may have made some fixSs. | |
468 | */ | |
469 | ||
470 | H_SET_RELOCATION_SIZE(&headers, | |
471 | md_reloc_size * fixup_segment(text_fix_root, SEG_TEXT), | |
472 | md_reloc_size * fixup_segment(data_fix_root, SEG_DATA)); | |
473 | ||
474 | ||
475 | /* FIXME move this stuff into the pre-write-hook */ | |
476 | H_SET_MAGIC_NUMBER(&headers, magic_number_for_object_file); | |
477 | H_SET_ENTRY_POINT(&headers, 0); | |
478 | ||
479 | obj_pre_write_hook(&headers); /* extra coff stuff */ | |
480 | if ((had_warnings() && flagseen['Z']) | |
481 | || had_errors() > 0) { | |
482 | if (flagseen['Z']) { | |
483 | as_warn("%d error%s, %d warning%s, generating bad object file.\n", | |
484 | had_errors(), had_errors() == 1 ? "" : "s", | |
485 | had_warnings(), had_warnings() == 1 ? "" : "s"); | |
486 | } else { | |
487 | as_fatal("%d error%s, %d warning%s, no object file generated.\n", | |
488 | had_errors(), had_errors() == 1 ? "" : "s", | |
489 | had_warnings(), had_warnings() == 1 ? "" : "s"); | |
490 | } /* on want output */ | |
491 | } /* on error condition */ | |
492 | ||
493 | object_file_size = H_GET_FILE_SIZE(&headers); | |
494 | next_object_file_charP = the_object_file = xmalloc(object_file_size); | |
495 | ||
496 | output_file_create(out_file_name); | |
497 | ||
498 | obj_header_append(&next_object_file_charP, &headers); | |
499 | ||
500 | know((next_object_file_charP - the_object_file) == H_GET_HEADER_SIZE(&headers)); | |
501 | ||
502 | /* | |
503 | * Emit code. | |
504 | */ | |
505 | for (fragP = text_frag_root; fragP; fragP = fragP->fr_next) { | |
506 | register long count; | |
507 | register char *fill_literal; | |
508 | register long fill_size; | |
509 | ||
510 | know(fragP->fr_type == rs_fill); | |
511 | append(&next_object_file_charP, fragP->fr_literal, (unsigned long) fragP->fr_fix); | |
512 | fill_literal = fragP->fr_literal + fragP->fr_fix; | |
513 | fill_size = fragP->fr_var; | |
514 | know(fragP->fr_offset >= 0); | |
515 | ||
516 | for (count = fragP->fr_offset; count; count--) { | |
517 | append(&next_object_file_charP, fill_literal, (unsigned long) fill_size); | |
518 | } /* for each */ | |
519 | ||
520 | } /* for each code frag. */ | |
521 | ||
522 | know((next_object_file_charP - the_object_file) == (H_GET_HEADER_SIZE(&headers) + H_GET_TEXT_SIZE(&headers) + H_GET_DATA_SIZE(&headers))); | |
523 | ||
524 | /* | |
525 | * Emit relocations. | |
526 | */ | |
527 | obj_emit_relocations(&next_object_file_charP, text_fix_root, (relax_addressT)0); | |
528 | know((next_object_file_charP - the_object_file) == (H_GET_HEADER_SIZE(&headers) + H_GET_TEXT_SIZE(&headers) + H_GET_DATA_SIZE(&headers) + H_GET_TEXT_RELOCATION_SIZE(&headers))); | |
fecd2382 | 529 | #ifdef TC_I960 |
a39116f1 RP |
530 | /* Make addresses in data relocation directives relative to beginning of |
531 | * first data fragment, not end of last text fragment: alignment of the | |
532 | * start of the data segment may place a gap between the segments. | |
533 | */ | |
534 | obj_emit_relocations(&next_object_file_charP, data_fix_root, data0_frchainP->frch_root->fr_address); | |
fecd2382 | 535 | #else /* TC_I960 */ |
a39116f1 | 536 | obj_emit_relocations(&next_object_file_charP, data_fix_root, text_last_frag->fr_address); |
fecd2382 | 537 | #endif /* TC_I960 */ |
a39116f1 RP |
538 | |
539 | know((next_object_file_charP - the_object_file) == (H_GET_HEADER_SIZE(&headers) + H_GET_TEXT_SIZE(&headers) + H_GET_DATA_SIZE(&headers) + H_GET_TEXT_RELOCATION_SIZE(&headers) + H_GET_DATA_RELOCATION_SIZE(&headers))); | |
540 | ||
541 | /* | |
542 | * Emit line number entries. | |
543 | */ | |
544 | OBJ_EMIT_LINENO(&next_object_file_charP, lineno_rootP, the_object_file); | |
545 | know((next_object_file_charP - the_object_file) == (H_GET_HEADER_SIZE(&headers) + H_GET_TEXT_SIZE(&headers) + H_GET_DATA_SIZE(&headers) + H_GET_TEXT_RELOCATION_SIZE(&headers) + H_GET_DATA_RELOCATION_SIZE(&headers) + H_GET_LINENO_SIZE(&headers))); | |
546 | ||
547 | /* | |
548 | * Emit symbols. | |
549 | */ | |
550 | obj_emit_symbols(&next_object_file_charP, symbol_rootP); | |
551 | know((next_object_file_charP - the_object_file) == (H_GET_HEADER_SIZE(&headers) + H_GET_TEXT_SIZE(&headers) + H_GET_DATA_SIZE(&headers) + H_GET_TEXT_RELOCATION_SIZE(&headers) + H_GET_DATA_RELOCATION_SIZE(&headers) + H_GET_LINENO_SIZE(&headers) + H_GET_SYMBOL_TABLE_SIZE(&headers))); | |
552 | ||
553 | /* | |
554 | * Emit strings. | |
555 | */ | |
556 | ||
557 | if (string_byte_count > 0) { | |
558 | obj_emit_strings(&next_object_file_charP); | |
559 | } /* only if we have a string table */ | |
560 | ||
561 | /* know((next_object_file_charP - the_object_file) == (H_GET_HEADER_SIZE(&headers) + H_GET_TEXT_SIZE(&headers) + H_GET_DATA_SIZE(&headers) + H_GET_TEXT_RELOCATION_SIZE(&headers) + H_GET_DATA_RELOCATION_SIZE(&headers) + H_GET_LINENO_SIZE(&headers) + H_GET_SYMBOL_TABLE_SIZE(&headers) + H_GET_STRING_SIZE(&headers))); | |
562 | */ | |
563 | /* know(next_object_file_charP == the_object_file + object_file_size);*/ | |
564 | ||
45432836 | 565 | #ifdef BFD_HEADERS |
a39116f1 RP |
566 | bfd_seek(stdoutput, 0, 0); |
567 | bfd_write(the_object_file, 1, object_file_size, stdoutput); | |
45432836 | 568 | #else |
a39116f1 RP |
569 | |
570 | /* Write the data to the file */ | |
571 | output_file_append(the_object_file,object_file_size,out_file_name); | |
45432836 | 572 | #endif |
a39116f1 | 573 | |
a39116f1 RP |
574 | output_file_close(out_file_name); |
575 | } /* non vms output */ | |
fecd2382 | 576 | #else /* VMS */ |
a39116f1 RP |
577 | /* |
578 | * Now do the VMS-dependent part of writing the object file | |
579 | */ | |
580 | VMS_write_object_file(text_siz, data_siz, text_frag_root, data_frag_root); | |
fecd2382 RP |
581 | #endif /* VMS */ |
582 | } /* write_object_file() */ | |
45432836 JG |
583 | #else |
584 | #endif | |
fecd2382 RP |
585 | |
586 | /* | |
587 | * relax_segment() | |
588 | * | |
589 | * Now we have a segment, not a crowd of sub-segments, we can make fr_address | |
590 | * values. | |
591 | * | |
592 | * Relax the frags. | |
593 | * | |
594 | * After this, all frags in this segment have addresses that are correct | |
595 | * within the segment. Since segments live in different file addresses, | |
596 | * these frag addresses may not be the same as final object-file addresses. | |
597 | */ | |
45432836 JG |
598 | |
599 | ||
600 | ||
f6e504fe | 601 | void relax_segment(segment_frag_root, segment) |
a39116f1 | 602 | struct frag * segment_frag_root; |
c593cf41 | 603 | segT segment; /* SEG_DATA or SEG_TEXT */ |
fecd2382 | 604 | { |
f6e504fe RP |
605 | register struct frag * fragP; |
606 | register relax_addressT address; | |
607 | /* register relax_addressT old_address; JF unused */ | |
608 | /* register relax_addressT new_address; JF unused */ | |
45432836 | 609 | #ifndef MANY_SEGMENTS |
c593cf41 | 610 | know(segment == SEG_DATA || segment == SEG_TEXT); |
45432836 | 611 | #endif |
f6e504fe RP |
612 | /* In case md_estimate_size_before_relax() wants to make fixSs. */ |
613 | subseg_change(segment, 0); | |
614 | ||
615 | /* | |
616 | * For each frag in segment: count and store (a 1st guess of) fr_address. | |
617 | */ | |
618 | address = 0; | |
619 | for (fragP = segment_frag_root; fragP; fragP = fragP->fr_next) { | |
620 | fragP->fr_address = address; | |
621 | address += fragP->fr_fix; | |
622 | ||
623 | switch (fragP->fr_type) { | |
624 | case rs_fill: | |
45432836 | 625 | address += fragP->fr_offset * fragP->fr_var ; |
f6e504fe RP |
626 | break; |
627 | ||
628 | case rs_align: | |
629 | address += relax_align(address, fragP->fr_offset); | |
630 | break; | |
631 | ||
632 | case rs_org: | |
633 | /* | |
634 | * Assume .org is nugatory. It will grow with 1st relax. | |
635 | */ | |
636 | break; | |
637 | ||
638 | case rs_machine_dependent: | |
639 | address += md_estimate_size_before_relax(fragP, segment); | |
640 | break; | |
641 | ||
fecd2382 | 642 | #ifndef WORKING_DOT_WORD |
f6e504fe RP |
643 | /* Broken words don't concern us yet */ |
644 | case rs_broken_word: | |
645 | break; | |
fecd2382 | 646 | #endif |
f6e504fe RP |
647 | |
648 | default: | |
649 | BAD_CASE(fragP->fr_type); | |
650 | break; | |
651 | } /* switch(fr_type) */ | |
652 | } /* for each frag in the segment */ | |
653 | ||
654 | /* | |
655 | * Do relax(). | |
656 | */ | |
657 | { | |
658 | register long stretch; /* May be any size, 0 or negative. */ | |
659 | /* Cumulative number of addresses we have */ | |
660 | /* relaxed this pass. */ | |
661 | /* We may have relaxed more than one address. */ | |
662 | register long stretched; /* Have we stretched on this pass? */ | |
663 | /* This is 'cuz stretch may be zero, when, | |
664 | in fact some piece of code grew, and | |
665 | another shrank. If a branch instruction | |
666 | doesn't fit anymore, we could be scrod */ | |
667 | ||
668 | do { | |
669 | stretch = stretched = 0; | |
670 | for (fragP = segment_frag_root; fragP; fragP = fragP->fr_next) { | |
671 | register long growth = 0; | |
672 | register unsigned long was_address; | |
673 | /* register long var; */ | |
674 | register long offset; | |
675 | register symbolS *symbolP; | |
676 | register long target; | |
677 | register long after; | |
678 | register long aim; | |
679 | ||
680 | was_address = fragP->fr_address; | |
681 | address = fragP->fr_address += stretch; | |
682 | symbolP = fragP->fr_symbol; | |
683 | offset = fragP->fr_offset; | |
684 | /* var = fragP->fr_var; */ | |
a39116f1 | 685 | |
f6e504fe RP |
686 | switch (fragP->fr_type) { |
687 | case rs_fill: /* .fill never relaxes. */ | |
688 | growth = 0; | |
689 | break; | |
690 | ||
fecd2382 | 691 | #ifndef WORKING_DOT_WORD |
f6e504fe RP |
692 | /* JF: This is RMS's idea. I do *NOT* want to be blamed |
693 | for it I do not want to write it. I do not want to have | |
694 | anything to do with it. This is not the proper way to | |
695 | implement this misfeature. */ | |
696 | case rs_broken_word: { | |
697 | struct broken_word *lie; | |
698 | struct broken_word *untruth; | |
699 | extern int md_short_jump_size; | |
700 | extern int md_long_jump_size; | |
701 | ||
702 | /* Yes this is ugly (storing the broken_word pointer | |
703 | in the symbol slot). Still, this whole chunk of | |
704 | code is ugly, and I don't feel like doing anything | |
705 | about it. Think of it as stubbornness in action */ | |
706 | growth=0; | |
707 | for (lie=(struct broken_word *)(fragP->fr_symbol); | |
708 | lie && lie->dispfrag==fragP; | |
709 | lie=lie->next_broken_word) { | |
710 | ||
711 | if (lie->added) | |
712 | continue; | |
a39116f1 | 713 | |
f6e504fe RP |
714 | offset= lie->add->sy_frag->fr_address+ S_GET_VALUE(lie->add) + lie->addnum - |
715 | (lie->sub->sy_frag->fr_address+ S_GET_VALUE(lie->sub)); | |
716 | if (offset<=-32768 || offset>=32767) { | |
717 | if (flagseen['k']) | |
718 | as_warn(".word %s-%s+%ld didn't fit", | |
719 | S_GET_NAME(lie->add), | |
720 | S_GET_NAME(lie->sub), | |
721 | lie->addnum); | |
722 | lie->added=1; | |
723 | if (fragP->fr_subtype==0) { | |
724 | fragP->fr_subtype++; | |
725 | growth+=md_short_jump_size; | |
726 | } | |
727 | for (untruth=lie->next_broken_word;untruth && untruth->dispfrag==lie->dispfrag;untruth=untruth->next_broken_word) | |
728 | if ((untruth->add->sy_frag == lie->add->sy_frag) | |
729 | && S_GET_VALUE(untruth->add) == S_GET_VALUE(lie->add)) { | |
730 | untruth->added=2; | |
731 | untruth->use_jump=lie; | |
732 | } | |
733 | growth+=md_long_jump_size; | |
734 | } | |
fecd2382 | 735 | } |
f6e504fe RP |
736 | |
737 | break; | |
738 | } /* case rs_broken_word */ | |
fecd2382 | 739 | #endif |
f6e504fe RP |
740 | case rs_align: |
741 | growth = relax_align((relax_addressT) (address + fragP->fr_fix), offset) | |
742 | - relax_align((relax_addressT) (was_address + fragP->fr_fix), offset); | |
743 | break; | |
744 | ||
745 | case rs_org: | |
746 | target = offset; | |
a39116f1 | 747 | |
f6e504fe | 748 | if (symbolP) { |
45432836 JG |
749 | #ifdef MANY_SEGMENTS |
750 | #else | |
c593cf41 | 751 | know((S_GET_SEGMENT(symbolP) == SEG_ABSOLUTE) || (S_GET_SEGMENT(symbolP) == SEG_DATA) || (S_GET_SEGMENT(symbolP) == SEG_TEXT)); |
f6e504fe | 752 | know(symbolP->sy_frag); |
45432836 JG |
753 | know(!(S_GET_SEGMENT(symbolP) == SEG_ABSOLUTE) || (symbolP->sy_frag == &zero_address_frag)); |
754 | #endif | |
f6e504fe RP |
755 | target += S_GET_VALUE(symbolP) |
756 | + symbolP->sy_frag->fr_address; | |
757 | } /* if we have a symbol */ | |
a39116f1 | 758 | |
f6e504fe RP |
759 | know(fragP->fr_next); |
760 | after = fragP->fr_next->fr_address; | |
761 | growth = ((target - after ) > 0) ? (target - after) : 0; | |
762 | /* Growth may be -ve, but variable part */ | |
763 | /* of frag cannot have < 0 chars. */ | |
764 | /* That is, we can't .org backwards. */ | |
765 | ||
766 | growth -= stretch; /* This is an absolute growth factor */ | |
767 | break; | |
768 | ||
769 | case rs_machine_dependent: { | |
770 | register const relax_typeS * this_type; | |
771 | register const relax_typeS * start_type; | |
772 | register relax_substateT next_state; | |
773 | register relax_substateT this_state; | |
774 | ||
775 | start_type = this_type = md_relax_table + (this_state = fragP->fr_subtype); | |
776 | target = offset; | |
a39116f1 | 777 | |
f6e504fe | 778 | if (symbolP) { |
45432836 | 779 | #ifndef MANY_SEGMENTS |
a39116f1 | 780 | know((S_GET_SEGMENT(symbolP) == SEG_ABSOLUTE) || (S_GET_SEGMENT(symbolP) == SEG_DATA) || (S_GET_SEGMENT(symbolP) == SEG_TEXT)); |
45432836 | 781 | #endif |
f6e504fe | 782 | know(symbolP->sy_frag); |
45432836 | 783 | know(!(S_GET_SEGMENT(symbolP) == SEG_ABSOLUTE) || symbolP->sy_frag==&zero_address_frag ); |
f6e504fe RP |
784 | target += |
785 | S_GET_VALUE(symbolP) | |
786 | + symbolP->sy_frag->fr_address; | |
787 | ||
788 | /* If frag has yet to be reached on this pass, | |
789 | assume it will move by STRETCH just as we did. | |
790 | If this is not so, it will be because some frag | |
791 | between grows, and that will force another pass. */ | |
792 | ||
793 | /* JF was just address */ | |
794 | /* JF also added is_dnrange hack */ | |
795 | /* There's gotta be a better/faster/etc way | |
796 | to do this. . . */ | |
797 | /* gnu@cygnus.com: I changed this from > to >= | |
798 | because I ran into a zero-length frag (fr_fix=0) | |
799 | which was created when the obstack needed a new | |
800 | chunk JUST AFTER the opcode of a branch. Since | |
801 | fr_fix is zero, fr_address of this frag is the same | |
802 | as fr_address of the next frag. This | |
803 | zero-length frag was variable and jumped to .+2 | |
804 | (in the next frag), but since the > comparison | |
805 | below failed (the two were =, not >), "stretch" | |
806 | was not added to the target. Stretch was 178, so | |
807 | the offset appeared to be .-176 instead, which did | |
808 | not fit into a byte branch, so the assembler | |
809 | relaxed the branch to a word. This didn't compare | |
810 | with what happened when the same source file was | |
811 | assembled on other machines, which is how I found it. | |
812 | You might want to think about what other places have | |
813 | trouble with zero length frags... */ | |
814 | ||
815 | if (symbolP->sy_frag->fr_address >= was_address | |
816 | && is_dnrange(fragP,symbolP->sy_frag)) { | |
817 | target += stretch; | |
818 | } /* */ | |
819 | ||
820 | } /* if there's a symbol attached */ | |
a39116f1 | 821 | |
f6e504fe RP |
822 | aim = target - address - fragP->fr_fix; |
823 | /* The displacement is affected by the instruction size | |
824 | * for the 32k architecture. I think we ought to be able | |
825 | * to add fragP->fr_pcrel_adjust in all cases (it should be | |
826 | * zero if not used), but just in case it breaks something | |
827 | * else we'll put this inside #ifdef NS32K ... #endif | |
828 | */ | |
fecd2382 | 829 | #ifdef TC_NS32K |
f6e504fe | 830 | aim += fragP->fr_pcrel_adjust; |
fecd2382 | 831 | #endif /* TC_NS32K */ |
f6e504fe RP |
832 | |
833 | if (aim < 0) { | |
834 | /* Look backwards. */ | |
835 | for (next_state = this_type->rlx_more; next_state; ) { | |
836 | if (aim >= this_type->rlx_backward) { | |
837 | next_state = 0; | |
838 | } else { /* Grow to next state. */ | |
839 | this_type = md_relax_table + (this_state = next_state); | |
840 | next_state = this_type->rlx_more; | |
841 | } | |
842 | } | |
843 | } else { | |
fecd2382 | 844 | #ifdef DONTDEF |
f6e504fe RP |
845 | /* JF these next few lines of code are for the mc68020 which can't handle short |
846 | offsets of zero in branch instructions. What a kludge! */ | |
847 | if (aim==0 && this_state==(1<<2+0)) { /* FOO hard encoded from m.c */ | |
848 | aim=this_type->rlx_forward+1; /* Force relaxation into word mode */ | |
849 | } | |
a39116f1 RP |
850 | #endif |
851 | #ifdef M68K_AIM_KLUDGE | |
852 | M68K_AIM_KLUDGE(aim, this_state, this_type); | |
fecd2382 | 853 | #endif |
f6e504fe RP |
854 | /* JF end of 68020 code */ |
855 | /* Look forwards. */ | |
856 | for (next_state = this_type->rlx_more; next_state; ) { | |
857 | if (aim <= this_type->rlx_forward) { | |
858 | next_state = 0; | |
859 | } else { /* Grow to next state. */ | |
860 | this_type = md_relax_table + (this_state = next_state); | |
861 | next_state = this_type->rlx_more; | |
862 | } | |
863 | } | |
864 | } | |
a39116f1 | 865 | |
f6e504fe RP |
866 | if ((growth = this_type->rlx_length - start_type->rlx_length) != 0) |
867 | fragP->fr_subtype = this_state; | |
a39116f1 | 868 | |
f6e504fe RP |
869 | break; |
870 | } /* case rs_machine_dependent */ | |
871 | ||
872 | default: | |
873 | BAD_CASE( fragP->fr_type ); | |
874 | break; | |
875 | } | |
876 | if (growth) { | |
877 | stretch += growth; | |
878 | stretched++; | |
879 | } | |
880 | } /* For each frag in the segment. */ | |
881 | } while (stretched); /* Until nothing further to relax. */ | |
882 | } /* do_relax */ | |
883 | ||
884 | /* | |
885 | * We now have valid fr_address'es for each frag. | |
886 | */ | |
887 | ||
888 | /* | |
889 | * All fr_address's are correct, relative to their own segment. | |
890 | * We have made all the fixS we will ever make. | |
891 | */ | |
892 | } /* relax_segment() */ | |
fecd2382 | 893 | |
fecd2382 RP |
894 | /* |
895 | * Relax_align. Advance location counter to next address that has 'alignment' | |
896 | * lowest order bits all 0s. | |
897 | */ | |
898 | ||
a39116f1 | 899 | /* How many addresses does the .align take? */ |
fecd2382 RP |
900 | static relax_addressT relax_align(address, alignment) |
901 | register relax_addressT address; /* Address now. */ | |
902 | register long alignment; /* Alignment (binary). */ | |
903 | { | |
a39116f1 RP |
904 | relax_addressT mask; |
905 | relax_addressT new_address; | |
906 | ||
907 | mask = ~ ( (~0) << alignment ); | |
908 | new_address = (address + mask) & (~ mask); | |
909 | return (new_address - address); | |
fecd2382 | 910 | } /* relax_align() */ |
f6e504fe | 911 | |
fecd2382 | 912 | /* fixup_segment() |
a39116f1 | 913 | |
fecd2382 RP |
914 | Go through all the fixS's in a segment and see which ones can be |
915 | handled now. (These consist of fixS where we have since discovered | |
916 | the value of a symbol, or the address of the frag involved.) | |
917 | For each one, call md_apply_fix to put the fix into the frag data. | |
a39116f1 | 918 | |
fecd2382 RP |
919 | Result is a count of how many relocation structs will be needed to |
920 | handle the remaining fixS's that we couldn't completely handle here. | |
921 | These will be output later by emit_relocations(). */ | |
922 | ||
923 | static long fixup_segment(fixP, this_segment_type) | |
924 | register fixS * fixP; | |
925 | segT this_segment_type; /* N_TYPE bits for segment. */ | |
926 | { | |
927 | register long seg_reloc_count; | |
928 | register symbolS *add_symbolP; | |
929 | register symbolS *sub_symbolP; | |
930 | register long add_number; | |
931 | register int size; | |
932 | register char *place; | |
933 | register long where; | |
934 | register char pcrel; | |
935 | register fragS *fragP; | |
936 | register segT add_symbol_segment = SEG_ABSOLUTE; | |
fecd2382 | 937 | |
a39116f1 | 938 | /* FIXME: remove this line */ /* fixS *orig = fixP; */ |
fecd2382 RP |
939 | seg_reloc_count = 0; |
940 | ||
941 | for ( ; fixP; fixP = fixP->fx_next) { | |
942 | fragP = fixP->fx_frag; | |
943 | know(fragP); | |
944 | where = fixP->fx_where; | |
945 | place = fragP->fr_literal + where; | |
946 | size = fixP->fx_size; | |
947 | add_symbolP = fixP->fx_addsy; | |
948 | #ifdef TC_I960 | |
949 | if (fixP->fx_callj && TC_S_IS_CALLNAME(add_symbolP)) { | |
950 | /* Relocation should be done via the | |
951 | associated 'bal' entry point | |
952 | symbol. */ | |
a39116f1 | 953 | |
fecd2382 RP |
954 | if (!TC_S_IS_BALNAME(tc_get_bal_of_call(add_symbolP))) { |
955 | as_bad("No 'bal' entry point for leafproc %s", | |
a39116f1 | 956 | S_GET_NAME(add_symbolP)); |
fecd2382 RP |
957 | continue; |
958 | } | |
959 | fixP->fx_addsy = add_symbolP = tc_get_bal_of_call(add_symbolP); | |
960 | } /* callj relocation */ | |
961 | #endif | |
962 | sub_symbolP = fixP->fx_subsy; | |
963 | add_number = fixP->fx_offset; | |
964 | pcrel = fixP->fx_pcrel; | |
a39116f1 | 965 | |
fecd2382 RP |
966 | if (add_symbolP) { |
967 | add_symbol_segment = S_GET_SEGMENT(add_symbolP); | |
968 | } /* if there is an addend */ | |
969 | ||
970 | if (sub_symbolP) { | |
971 | if (!add_symbolP) { | |
972 | /* Its just -sym */ | |
973 | if (S_GET_SEGMENT(sub_symbolP) != SEG_ABSOLUTE) { | |
974 | as_bad("Negative of non-absolute symbol %s", S_GET_NAME(sub_symbolP)); | |
975 | } /* not absolute */ | |
976 | ||
977 | add_number -= S_GET_VALUE(sub_symbolP); | |
978 | ||
979 | /* if sub_symbol is in the same segment that add_symbol | |
980 | and add_symbol is either in DATA, TEXT, BSS or ABSOLUTE */ | |
981 | } else if ((S_GET_SEGMENT(sub_symbolP) == add_symbol_segment) | |
a39116f1 RP |
982 | && (SEG_NORMAL(add_symbol_segment) |
983 | || (add_symbol_segment == SEG_ABSOLUTE))) { | |
fecd2382 RP |
984 | /* Difference of 2 symbols from same segment. */ |
985 | /* Can't make difference of 2 undefineds: 'value' means */ | |
986 | /* something different for N_UNDF. */ | |
987 | #ifdef TC_I960 | |
988 | /* Makes no sense to use the difference of 2 arbitrary symbols | |
989 | * as the target of a call instruction. | |
990 | */ | |
991 | if (fixP->fx_callj) { | |
992 | as_bad("callj to difference of 2 symbols"); | |
993 | } | |
994 | #endif /* TC_I960 */ | |
995 | add_number += S_GET_VALUE(add_symbolP) - | |
996 | S_GET_VALUE(sub_symbolP); | |
997 | ||
998 | add_symbolP = NULL; | |
999 | fixP->fx_addsy = NULL; | |
1000 | } else { | |
1001 | /* Different segments in subtraction. */ | |
1002 | know(!(S_IS_EXTERNAL(sub_symbolP) && (S_GET_SEGMENT(sub_symbolP) == SEG_ABSOLUTE))); | |
1003 | ||
1004 | if ((S_GET_SEGMENT(sub_symbolP) == SEG_ABSOLUTE)) { | |
1005 | add_number -= S_GET_VALUE(sub_symbolP); | |
1006 | } else { | |
1007 | as_bad("Can't emit reloc {- %s-seg symbol \"%s\"} @ file address %d.", | |
a39116f1 RP |
1008 | segment_name(S_GET_SEGMENT(sub_symbolP)), |
1009 | S_GET_NAME(sub_symbolP), fragP->fr_address + where); | |
fecd2382 RP |
1010 | } /* if absolute */ |
1011 | } | |
1012 | } /* if sub_symbolP */ | |
a39116f1 | 1013 | |
fecd2382 RP |
1014 | if (add_symbolP) { |
1015 | if (add_symbol_segment == this_segment_type && pcrel) { | |
1016 | /* | |
1017 | * This fixup was made when the symbol's segment was | |
1018 | * SEG_UNKNOWN, but it is now in the local segment. | |
1019 | * So we know how to do the address without relocation. | |
1020 | */ | |
1021 | #ifdef TC_I960 | |
1022 | /* reloc_callj() may replace a 'call' with a 'calls' or a 'bal', | |
1023 | * in which cases it modifies *fixP as appropriate. In the case | |
1024 | * of a 'calls', no further work is required, and *fixP has been | |
1025 | * set up to make the rest of the code below a no-op. | |
1026 | */ | |
1027 | reloc_callj(fixP); | |
1028 | #endif /* TC_I960 */ | |
1029 | ||
1030 | add_number += S_GET_VALUE(add_symbolP); | |
1031 | add_number -= md_pcrel_from (fixP); | |
1032 | pcrel = 0; /* Lie. Don't want further pcrel processing. */ | |
1033 | fixP->fx_addsy = NULL; /* No relocations please. */ | |
1034 | } else { | |
1035 | switch (add_symbol_segment) { | |
1036 | case SEG_ABSOLUTE: | |
1037 | #ifdef TC_I960 | |
1038 | reloc_callj(fixP); /* See comment about reloc_callj() above*/ | |
1039 | #endif /* TC_I960 */ | |
1040 | add_number += S_GET_VALUE(add_symbolP); | |
1041 | fixP->fx_addsy = NULL; | |
1042 | add_symbolP = NULL; | |
1043 | break; | |
45432836 | 1044 | default: |
fecd2382 RP |
1045 | seg_reloc_count ++; |
1046 | add_number += S_GET_VALUE(add_symbolP); | |
1047 | break; | |
1048 | ||
1049 | case SEG_UNKNOWN: | |
1050 | #ifdef TC_I960 | |
1051 | if ((int)fixP->fx_bit_fixP == 13) { | |
1052 | /* This is a COBR instruction. They have only a | |
1053 | * 13-bit displacement and are only to be used | |
1054 | * for local branches: flag as error, don't generate | |
1055 | * relocation. | |
1056 | */ | |
1057 | as_bad("can't use COBR format with external label"); | |
1058 | fixP->fx_addsy = NULL; /* No relocations please. */ | |
1059 | continue; | |
1060 | } /* COBR */ | |
1061 | #endif /* TC_I960 */ | |
6d5460ab | 1062 | |
fecd2382 | 1063 | #ifdef OBJ_COFF |
c593cf41 | 1064 | #ifdef TE_I386AIX |
fecd2382 RP |
1065 | if (S_IS_COMMON(add_symbolP)) |
1066 | add_number += S_GET_VALUE(add_symbolP); | |
c593cf41 | 1067 | #endif /* TE_I386AIX */ |
fecd2382 | 1068 | #endif /* OBJ_COFF */ |
fecd2382 | 1069 | ++seg_reloc_count; |
a39116f1 | 1070 | |
fecd2382 RP |
1071 | break; |
1072 | ||
a39116f1 | 1073 | |
fecd2382 RP |
1074 | } /* switch on symbol seg */ |
1075 | } /* if not in local seg */ | |
1076 | } /* if there was a + symbol */ | |
a39116f1 | 1077 | |
fecd2382 RP |
1078 | if (pcrel) { |
1079 | add_number -= md_pcrel_from(fixP); | |
1080 | if (add_symbolP == 0) { | |
1081 | fixP->fx_addsy = & abs_symbol; | |
1082 | ++seg_reloc_count; | |
1083 | } /* if there's an add_symbol */ | |
1084 | } /* if pcrel */ | |
1085 | ||
1086 | if (!fixP->fx_bit_fixP) { | |
1087 | if ((size==1 && | |
1088 | (add_number& ~0xFF) && (add_number&~0xFF!=(-1&~0xFF))) || | |
1089 | (size==2 && | |
1090 | (add_number& ~0xFFFF) && (add_number&~0xFFFF!=(-1&~0xFFFF)))) { | |
1091 | as_bad("Value of %d too large for field of %d bytes at 0x%x", | |
a39116f1 | 1092 | add_number, size, fragP->fr_address + where); |
fecd2382 RP |
1093 | } /* generic error checking */ |
1094 | } /* not a bit fix */ | |
1095 | ||
1096 | md_apply_fix(fixP, add_number); | |
1097 | } /* For each fixS in this segment. */ | |
1098 | ||
1099 | #ifdef OBJ_COFF | |
1100 | #ifdef TC_I960 | |
f6e504fe RP |
1101 | { |
1102 | fixS *topP = fixP; | |
1103 | ||
1104 | /* two relocs per callj under coff. */ | |
1105 | for (fixP = topP; fixP; fixP = fixP->fx_next) { | |
1106 | if (fixP->fx_callj && fixP->fx_addsy != 0) { | |
1107 | ++seg_reloc_count; | |
1108 | } /* if callj and not already fixed. */ | |
1109 | } /* for each fix */ | |
1110 | } | |
fecd2382 | 1111 | #endif /* TC_I960 */ |
a39116f1 | 1112 | |
fecd2382 RP |
1113 | #endif /* OBJ_COFF */ |
1114 | return(seg_reloc_count); | |
1115 | } /* fixup_segment() */ | |
1116 | ||
1117 | ||
1118 | static int is_dnrange(f1,f2) | |
1119 | struct frag *f1; | |
1120 | struct frag *f2; | |
1121 | { | |
1122 | while (f1) { | |
1123 | if (f1->fr_next==f2) | |
a39116f1 | 1124 | return 1; |
fecd2382 RP |
1125 | f1=f1->fr_next; |
1126 | } | |
1127 | return 0; | |
1128 | } /* is_dnrange() */ | |
1129 | ||
1130 | /* Append a string onto another string, bumping the pointer along. */ | |
1131 | void | |
a39116f1 | 1132 | append (charPP, fromP, length) |
fecd2382 RP |
1133 | char **charPP; |
1134 | char *fromP; | |
1135 | unsigned long length; | |
1136 | { | |
542e1629 RP |
1137 | if (length) { /* Don't trust memcpy() of 0 chars. */ |
1138 | memcpy(*charPP, fromP, (int) length); | |
fecd2382 RP |
1139 | *charPP += length; |
1140 | } | |
1141 | } | |
1142 | ||
1143 | int section_alignment[SEG_MAXIMUM_ORDINAL]; | |
1144 | ||
1145 | /* | |
1146 | * This routine records the largest alignment seen for each segment. | |
1147 | * If the beginning of the segment is aligned on the worst-case | |
1148 | * boundary, all of the other alignments within it will work. At | |
1149 | * least one object format really uses this info. | |
1150 | */ | |
1151 | void record_alignment(seg, align) | |
1152 | segT seg; /* Segment to which alignment pertains */ | |
1153 | int align; /* Alignment, as a power of 2 | |
1154 | * (e.g., 1 => 2-byte boundary, 2 => 4-byte boundary, etc.) | |
1155 | */ | |
1156 | { | |
1157 | ||
1158 | if ( align > section_alignment[(int) seg] ){ | |
1159 | section_alignment[(int) seg] = align; | |
1160 | } /* if highest yet */ | |
1161 | ||
1162 | return; | |
1163 | } /* record_alignment() */ | |
1164 | ||
1165 | /* | |
1166 | * Local Variables: | |
1167 | * comment-column: 0 | |
1168 | * fill-column: 131 | |
1169 | * End: | |
1170 | */ | |
1171 | ||
1172 | /* end of write.c */ |