Change various calls (e.g., to symbol_new, md_number_to_chars) to cast
[deliverable/binutils-gdb.git] / gas / write.c
CommitLineData
fecd2382 1/* write.c - emit .o file
43ca9aa6 2 Copyright (C) 1986, 1987, 1990, 1991, 1992, 1993 Free Software Foundation, Inc.
6efd877d 3
a39116f1 4 This file is part of GAS, the GNU Assembler.
6efd877d 5
a39116f1
RP
6 GAS is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
9 any later version.
6efd877d 10
a39116f1
RP
11 GAS is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
6efd877d 15
a39116f1
RP
16 You should have received a copy of the GNU General Public License
17 along with GAS; see the file COPYING. If not, write to
18 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
fecd2382 19
c593cf41 20/* This thing should be set up to do byteordering correctly. But... */
fecd2382
RP
21
22#include "as.h"
fecd2382
RP
23#include "subsegs.h"
24#include "obstack.h"
25#include "output-file.h"
26
43ca9aa6
KR
27/* The NOP_OPCODE is for the alignment fill value. Fill it with a nop
28 instruction so that the disassembler does not choke on it. */
6d5460ab
RP
29#ifndef NOP_OPCODE
30#define NOP_OPCODE 0x00
31#endif
32
43ca9aa6
KR
33#ifndef WORKING_DOT_WORD
34extern CONST int md_short_jump_size;
35extern CONST int md_long_jump_size;
36#endif
37
38#ifndef BFD_ASSEMBLER
39
45432836 40#ifndef MANY_SEGMENTS
09952cd9
KR
41struct frag *text_frag_root;
42struct frag *data_frag_root;
43struct frag *bss_frag_root;
fecd2382 44
09952cd9
KR
45struct frag *text_last_frag; /* Last frag in segment. */
46struct frag *data_last_frag; /* Last frag in segment. */
65bfcf2e 47static struct frag *bss_last_frag; /* Last frag in segment. */
45432836 48#endif
fecd2382
RP
49
50static object_headers headers;
fecd2382 51long string_byte_count;
fecd2382 52static char *the_object_file;
fecd2382
RP
53char *next_object_file_charP; /* Tracks object file bytes. */
54
3eb802b5 55#ifndef OBJ_VMS
fecd2382 56int magic_number_for_object_file = DEFAULT_MAGIC_NUMBER_FOR_OBJECT_FILE;
3eb802b5 57#endif
fecd2382 58
43ca9aa6
KR
59#endif /* BFD_ASSEMBLER */
60
6efd877d 61static long fixup_segment PARAMS ((fixS * fixP, segT this_segment_type));
d5364748 62static relax_addressT relax_align PARAMS ((relax_addressT addr, int align));
6efd877d 63void relax_segment PARAMS ((struct frag * seg_frag_root, segT seg_type));
fecd2382
RP
64
65/*
66 * fix_new()
67 *
68 * Create a fixS in obstack 'notes'.
69 */
6efd877d
KR
70fixS *
71fix_new (frag, where, size, add_symbol, sub_symbol, offset, pcrel, r_type)
72 fragS *frag; /* Which frag? */
73 int where; /* Where in that frag? */
74 short int size; /* 1, 2, or 4 usually. */
75 symbolS *add_symbol; /* X_add_symbol. */
76 symbolS *sub_symbol; /* X_subtract_symbol. */
d5364748 77 offsetT offset; /* X_add_number. */
6efd877d 78 int pcrel; /* TRUE if PC-relative relocation. */
43ca9aa6
KR
79#ifdef BFD_ASSEMBLER
80 bfd_reloc_code_real_type r_type; /* Relocation type */
81#else
6efd877d 82 int r_type; /* Relocation type */
43ca9aa6 83#endif
fecd2382 84{
6efd877d
KR
85 fixS *fixP;
86
87 fixP = (fixS *) obstack_alloc (&notes, sizeof (fixS));
88
89 fixP->fx_frag = frag;
90 fixP->fx_where = where;
91 fixP->fx_size = size;
92 fixP->fx_addsy = add_symbol;
93 fixP->fx_subsy = sub_symbol;
94 fixP->fx_offset = offset;
95 fixP->fx_pcrel = pcrel;
43ca9aa6 96#if defined(NEED_FX_R_TYPE) || defined (BFD_ASSEMBLER)
6efd877d 97 fixP->fx_r_type = r_type;
c593cf41 98#endif
6efd877d
KR
99 fixP->fx_im_disp = 0;
100 fixP->fx_pcrel_adjust = 0;
6efd877d 101 fixP->fx_bit_fixP = 0;
43ca9aa6
KR
102 fixP->fx_addnumber = 0;
103
104#ifdef TC_something
105 fixP->fx_bsr = 0;
106#endif
107#ifdef TC_I960
108 fixP->fx_callj = 0;
109#endif
110
111 /* Usually, we want relocs sorted numerically, but while
112 comparing to older versions of gas that have relocs
113 reverse sorted, it is convenient to have this compile
114 time option. xoxorich. */
115
116 {
6efd877d 117
43ca9aa6
KR
118#ifdef BFD_ASSEMBLER
119 fixS **seg_fix_rootP = & (seg_info (now_seg)->fix_root);
120 fixS **seg_fix_tailP = & (seg_info (now_seg)->fix_tail);
121#endif
09952cd9 122
f6e504fe 123#ifdef REVERSE_SORT_RELOCS
6efd877d 124
43ca9aa6
KR
125 fixP->fx_next = *seg_fix_rootP;
126 *seg_fix_rootP = fixP;
6efd877d 127
f6e504fe 128#else /* REVERSE_SORT_RELOCS */
6efd877d 129
43ca9aa6 130 fixP->fx_next = NULL;
6efd877d 131
43ca9aa6
KR
132 if (*seg_fix_tailP)
133 (*seg_fix_tailP)->fx_next = fixP;
134 else
135 *seg_fix_rootP = fixP;
136 *seg_fix_tailP = fixP;
6efd877d 137
f6e504fe 138#endif /* REVERSE_SORT_RELOCS */
6efd877d 139
43ca9aa6
KR
140 }
141
142 return fixP;
143}
144
145/* Append a string onto another string, bumping the pointer along. */
146void
147append (charPP, fromP, length)
148 char **charPP;
149 char *fromP;
150 unsigned long length;
151{
152 /* Don't trust memcpy() of 0 chars. */
153 if (length == 0)
154 return;
155
156 memcpy (*charPP, fromP, (int) length);
157 *charPP += length;
158}
159
160#ifndef BFD_ASSEMBLER
161int section_alignment[SEG_MAXIMUM_ORDINAL];
162#endif
163
164/*
165 * This routine records the largest alignment seen for each segment.
166 * If the beginning of the segment is aligned on the worst-case
167 * boundary, all of the other alignments within it will work. At
168 * least one object format really uses this info.
169 */
170void
171record_alignment (seg, align)
172 /* Segment to which alignment pertains */
173 segT seg;
174 /* Alignment, as a power of 2 (e.g., 1 => 2-byte boundary, 2 => 4-byte
175 boundary, etc.) */
176 int align;
177{
178#ifdef BFD_ASSEMBLER
179 if (align > bfd_get_section_alignment (stdoutput, seg))
180 bfd_set_section_alignment (stdoutput, seg, align);
181#else
182 if (align > section_alignment[(int) seg])
183 section_alignment[(int) seg] = align;
184#endif
185}
186
187#if defined (BFD_ASSEMBLER) || ! defined (BFD)
188
189static fragS *
190chain_frchains_together_1 (section, frchp)
191 segT section;
192 struct frchain *frchp;
193{
194 fragS dummy, *prev_frag = &dummy;
195 for (; frchp && frchp->frch_seg == section; frchp = frchp->frch_next)
196 {
197 prev_frag->fr_next = frchp->frch_root;
198 prev_frag = frchp->frch_last;
199 }
200 prev_frag->fr_next = 0;
201 return prev_frag;
202}
203
204#endif
205
206#ifdef BFD_ASSEMBLER
207
208static void
209chain_frchains_together (abfd, section, xxx)
210 bfd *abfd; /* unused */
211 segT section;
212 char *xxx; /* unused */
213{
f2f7d044
ILT
214 segment_info_type *info;
215
216 /* BFD may have introduced its own sections without using
217 subseg_new, so it is possible that seg_info is NULL. */
218 info = seg_info (section);
219 if (info != (segment_info_type *) NULL)
220 chain_frchains_together_1 (section, info->frchainP);
43ca9aa6
KR
221}
222
223#endif
542e1629 224
d5364748 225#if !defined (BFD) && !defined (BFD_ASSEMBLER)
65bfcf2e 226
6efd877d
KR
227void
228remove_subsegs (head, seg, root, last)
229 frchainS *head;
230 int seg;
231 fragS **root;
232 fragS **last;
65bfcf2e 233{
65bfcf2e 234 *root = head->frch_root;
43ca9aa6
KR
235 *last = chain_frchains_together_1 (seg, head);
236}
237
238#endif /* BFD */
239
43ca9aa6
KR
240static void
241cvt_frag_to_fill (x, fragP)
242#ifdef BFD_ASSEMBLER
243 segT x;
244#else
245 object_headers *x;
246#endif
247 fragS *fragP;
248{
249#ifdef BFD_ASSEMBLER
250 segT sec = x;
251#else
252 object_headers *headers = x;
253#endif
254
255 switch (fragP->fr_type)
6efd877d 256 {
43ca9aa6
KR
257 case rs_align:
258 case rs_org:
259#ifdef HANDLE_ALIGN
260 HANDLE_ALIGN (fragP);
261#endif
262 fragP->fr_type = rs_fill;
263 know (fragP->fr_var == 1);
264 know (fragP->fr_next != NULL);
265
266 fragP->fr_offset = (fragP->fr_next->fr_address
267 - fragP->fr_address
268 - fragP->fr_fix);
269 break;
65bfcf2e 270
43ca9aa6
KR
271 case rs_fill:
272 break;
273
274 case rs_machine_dependent:
275#ifdef BFD_ASSEMBLER
276 md_convert_frag (stdoutput, sec, fragP);
277#else
278 md_convert_frag (headers, fragP);
279#endif
280
d5364748 281 assert (fragP->fr_next == NULL || (fragP->fr_next->fr_address - fragP->fr_address == fragP->fr_fix));
43ca9aa6
KR
282
283 /*
284 * After md_convert_frag, we make the frag into a ".space 0".
285 * Md_convert_frag() should set up any fixSs and constants
286 * required.
287 */
288 frag_wane (fragP);
289 break;
290
291#ifndef WORKING_DOT_WORD
292 case rs_broken_word:
293 {
294 struct broken_word *lie;
295
296 if (fragP->fr_subtype)
297 {
298 fragP->fr_fix += md_short_jump_size;
299 for (lie = (struct broken_word *) (fragP->fr_symbol);
300 lie && lie->dispfrag == fragP;
301 lie = lie->next_broken_word)
302 if (lie->added == 1)
303 fragP->fr_fix += md_long_jump_size;
304 }
305 frag_wane (fragP);
306 }
307 break;
308#endif
309
310 default:
311 BAD_CASE (fragP->fr_type);
312 break;
6efd877d 313 }
65bfcf2e 314}
6efd877d 315
43ca9aa6
KR
316#ifdef BFD_ASSEMBLER
317static void
318relax_and_size_seg (abfd, sec, xxx)
319 bfd *abfd;
320 asection *sec;
321 char *xxx;
322{
323 flagword flags;
324
325 flags = bfd_get_section_flags (abfd, sec);
326
d5364748 327 if (/*flags & SEC_ALLOC*/ 1)
43ca9aa6
KR
328 {
329 fragS *fragp;
330 segment_info_type *seginfo;
331 int x;
d5364748 332 valueT size, newsize;
43ca9aa6
KR
333
334 seginfo = (segment_info_type *) bfd_get_section_userdata (abfd, sec);
d5364748
KR
335 if (seginfo && seginfo->frchainP)
336 {
337 relax_segment (seginfo->frchainP->frch_root, sec);
338 for (fragp = seginfo->frchainP->frch_root; fragp; fragp = fragp->fr_next)
339 cvt_frag_to_fill (sec, fragp);
340 for (fragp = seginfo->frchainP->frch_root;
341 fragp->fr_next;
342 fragp = fragp->fr_next)
343 /* walk to last elt */;
344 size = fragp->fr_address + fragp->fr_fix;
345 }
346 else
347 size = 0;
43ca9aa6
KR
348 if (size > 0)
349 {
350 flags |= SEC_HAS_CONTENTS;
351 /* @@ This is just an approximation. */
352 if (seginfo->fix_root)
353 flags |= SEC_RELOC;
d5364748
KR
354 else
355 flags &= ~SEC_RELOC;
43ca9aa6
KR
356 x = bfd_set_section_flags (abfd, sec, flags);
357 assert (x == true);
358 }
359 size = md_section_align (sec, size);
360 x = bfd_set_section_size (abfd, sec, size);
361 assert (x == true);
362
363 /* If the size had to be rounded up, add some padding in the last
364 non-empty frag. */
365 newsize = bfd_get_section_size_before_reloc (sec);
366 assert (newsize >= size);
367 if (size != newsize)
368 {
369 fragS *last = seginfo->frchainP->frch_last;
370 fragp = seginfo->frchainP->frch_root;
371 while (fragp->fr_next != last)
372 fragp = fragp->fr_next;
373 last->fr_address = size;
374 fragp->fr_offset += newsize - size;
375 }
376 }
377#ifdef tc_frob_section
378 tc_frob_section (sec);
379#endif
380#ifdef obj_frob_section
381 obj_frob_section (sec);
382#endif
383}
384
d5364748
KR
385#ifdef DEBUG2
386static void
387dump_section_relocs (abfd, sec, stream_)
388 bfd *abfd;
389 asection *sec;
390 char *stream_;
391{
392 FILE *stream = (FILE *) stream_;
393 segment_info_type *seginfo = seg_info (sec);
394 fixS *fixp = seginfo->fix_root;
395
396 if (!fixp)
397 return;
398
399 fprintf (stream, "sec %s relocs:\n", sec->name);
400 while (fixp)
401 {
402 symbolS *s = fixp->fx_addsy;
403 if (s)
404 fprintf (stream, " %08x: %s(%s+%x)+%x\n", fixp,
405 S_GET_NAME (s), s->bsym->section->name,
406 S_GET_VALUE (s), fixp->fx_offset);
407 else
408 fprintf (stream, " %08x: type %d no sym\n", fixp, fixp->fx_r_type);
409 fixp = fixp->fx_next;
410 }
411}
412#else
413#define dump_section_relocs(ABFD,SEC,STREAM) (void)(ABFD,SEC,STREAM)
414#endif
415
416static void
417adjust_reloc_syms (abfd, sec, xxx)
418 bfd *abfd;
419 asection *sec;
420 char *xxx;
421{
422 segment_info_type *seginfo = seg_info (sec);
423 fixS *fixp;
424
425 if (seginfo == NULL)
426 return;
427
428 dump_section_relocs (abfd, sec, stderr);
429
430 for (fixp = seginfo->fix_root; fixp; fixp = fixp->fx_next)
431 if (fixp->fx_addsy)
432 {
433 symbolS *sym = fixp->fx_addsy;
434 asection *symsec = sym->bsym->section;
435 segment_info_type *symseginfo = seg_info (symsec);
436
437 /* If it's one of these sections, assume the symbol is definitely
438 going to be output. */
439 if (symsec == &bfd_und_section
440 || symsec == &bfd_abs_section
441 || bfd_is_com_section (symsec))
442 continue;
443
444 /* Since we're reducing to section symbols, don't attempt to reduce
445 anything that's already using one. */
446 if (sym->bsym == symsec->symbol)
447 continue;
448
449 /* Is there some other reason we can't adjust this one? (E.g.,
450 call/bal links in i960-bout symbols.) */
451#ifdef obj_fix_adjustable
452 if (! obj_fix_adjustable (fixp))
453 continue;
454#endif
455 /* If the section symbol isn't going to be output, the relocs
456 at least should still work. If not, figure out what to do
457 when we run into that case. */
458 fixp->fx_offset += S_GET_VALUE (sym);
459 if (sym->sy_frag)
460 fixp->fx_offset += sym->sy_frag->fr_address;
461 if (symseginfo->sym)
462 fixp->fx_addsy = symseginfo->sym;
463 else
464 {
465 fixp->fx_addsy = symbol_find (symsec->name);
466 if (!fixp->fx_addsy)
467 {
468 fixp->fx_addsy = symbol_make (symsec->name);
469 fixp->fx_addsy->bsym = symsec->symbol;
470 }
471 symseginfo->sym = fixp->fx_addsy;
472 }
473 }
474
475 dump_section_relocs (abfd, sec, stderr);
476}
477
43ca9aa6
KR
478static void
479write_contents (abfd, sec, xxx)
480 bfd *abfd;
481 asection *sec;
482 char *xxx;
483{
484 segment_info_type *seginfo = seg_info (sec);
485 unsigned long offset = 0;
486 fragS *frags;
487 int i, n;
488 arelent **relocs;
489 fixS *fixp;
490
d5364748
KR
491 /* If seginfo is NULL, we did not create this section; don't do
492 anything with it. */
493 if (seginfo == NULL)
43ca9aa6
KR
494 return;
495
496 fixup_segment (seginfo->fix_root, sec);
497
3d3c5039 498 n = 0;
d5364748
KR
499 for (fixp = seginfo->fix_root; fixp; fixp = fixp->fx_next)
500 n++;
43ca9aa6 501
d5364748 502#ifndef RELOC_EXPANSION_POSSIBLE
43ca9aa6 503 /* Set up reloc information as well. */
43ca9aa6
KR
504 relocs = (arelent **) bfd_alloc_by_size_t (stdoutput,
505 n * sizeof (arelent *));
d5364748 506 bzero ((char*)relocs, n * sizeof (arelent*));
43ca9aa6 507
3d3c5039
ILT
508 i = 0;
509 for (fixp = seginfo->fix_root; fixp != (fixS *) NULL; fixp = fixp->fx_next)
510 {
511 arelent *reloc;
512 extern arelent *tc_gen_reloc ();
513 char *data;
514 bfd_reloc_status_type s;
515
516 if (fixp->fx_addsy == 0)
517 {
518 /* @@ Need some other flag to indicate which have already
519 been performed... */
520 n--;
521 continue;
522 }
523 reloc = tc_gen_reloc (sec, fixp);
524 if (!reloc)
525 {
526 n--;
527 continue;
528 }
529 data = fixp->fx_frag->fr_literal + fixp->fx_where;
530 if (fixp->fx_where + 4
531 > fixp->fx_frag->fr_fix + fixp->fx_frag->fr_offset)
532 abort ();
d5364748
KR
533 /* Pass bogus address so that when bfd_perform_relocation adds
534 `address' back in, it'll come up with `data', which is where
535 we want it to operate. */
3d3c5039
ILT
536 s = bfd_perform_relocation (stdoutput, reloc, data - reloc->address,
537 sec, stdoutput);
538 switch (s)
539 {
540 case bfd_reloc_ok:
541 break;
542 default:
543 as_fatal ("bad return from bfd_perform_relocation");
544 }
545 relocs[i++] = reloc;
546 }
d5364748
KR
547#else
548 n = n * MAX_RELOC_EXPANSION;
549 /* Set up reloc information as well. */
550 relocs = (arelent **) bfd_alloc_by_size_t (stdoutput,
551 n * sizeof (arelent *));
552
553 i = 0;
554 for (fixp = seginfo->fix_root; fixp != (fixS *) NULL; fixp = fixp->fx_next)
555 {
556 arelent **reloc;
557 extern arelent *tc_gen_reloc ();
558 char *data;
559 bfd_reloc_status_type s;
560 int j;
561
562 if (fixp->fx_addsy == 0)
563 {
564 /* @@ Need some other flag to indicate which have already
565 been performed... */
566 n--;
567 continue;
568 }
569 reloc = tc_gen_reloc (sec, fixp);
570
571 for (j = 0; reloc[j]; j++)
572 {
573 relocs[i++] = reloc[j];
574 assert(i <= n);
575 }
576 data = fixp->fx_frag->fr_literal + fixp->fx_where;
577 if (fixp->fx_where + 4
578 > fixp->fx_frag->fr_fix + fixp->fx_frag->fr_offset)
579 abort ();
580 for (j = 0; reloc[j]; j++)
581 {
582 s = bfd_perform_relocation (stdoutput, reloc[j], data - reloc[j]->address,
583 sec, stdoutput);
584 switch (s)
585 {
586 case bfd_reloc_ok:
587 break;
588 default:
589 as_fatal ("bad return from bfd_perform_relocation");
590 }
591 }
592 }
593 n = i;
594#endif
595
3d3c5039
ILT
596 if (n)
597 bfd_set_reloc (stdoutput, sec, relocs, n);
d5364748
KR
598 else
599 bfd_set_section_flags (abfd, sec,
600 bfd_get_section_flags (abfd, sec) & ~SEC_RELOC);
601#ifdef DEBUG2
602 {
603 int i;
604 arelent *r;
605 asymbol *s;
606 fprintf (stderr, "relocs for sec %s\n", sec->name);
607 for (i = 0; i < n; i++)
608 {
609 r = relocs[i];
610 s = *r->sym_ptr_ptr;
611 fprintf (stderr, " reloc %2d @%08x off %4x : sym %-10s addend %x\n",
612 i, r, r->address, s->name, r->addend);
613 }
614 }
615#endif
616
617 /* Force calculations (size, vma) to get done. */
618 bfd_set_section_contents (stdoutput, sec, "", 0, (addressT) 0);
3d3c5039
ILT
619
620 /* Write out the frags. */
d5364748
KR
621 if (! (bfd_get_section_flags (abfd, sec) & SEC_HAS_CONTENTS))
622 return;
623
3d3c5039 624 for (frags = seginfo->frchainP->frch_root;
43ca9aa6
KR
625 frags;
626 frags = frags->fr_next)
627 {
628 int x;
629 unsigned long fill_size;
630 char *fill_literal;
631 long count;
632
633 assert (frags->fr_type == rs_fill);
43ca9aa6
KR
634 if (frags->fr_fix)
635 {
636 x = bfd_set_section_contents (stdoutput, sec,
637 frags->fr_literal, offset,
638 frags->fr_fix);
639 assert (x == true);
640 offset += frags->fr_fix;
641 }
642 fill_literal = frags->fr_literal + frags->fr_fix;
643 fill_size = frags->fr_var;
644 count = frags->fr_offset;
645 assert (count >= 0);
646 if (fill_size && count)
647 while (count--)
648 {
649 x = bfd_set_section_contents (stdoutput, sec,
d5364748
KR
650 fill_literal, offset,
651 (bfd_size_type) fill_size);
43ca9aa6
KR
652 assert (x == true);
653 offset += fill_size;
654 }
655 }
43ca9aa6
KR
656}
657#endif
658
d5364748
KR
659#if defined (BFD_ASSEMBLER) || !defined (BFD)
660
6efd877d
KR
661void
662write_object_file ()
45432836 663{
6efd877d
KR
664 register struct frchain *frchainP; /* Track along all frchains. */
665 register fragS *fragP; /* Track along all frags. */
6efd877d 666
d5364748 667#if !defined (BFD_ASSEMBLER) && !defined (OBJ_VMS)
6efd877d 668 long object_file_size;
d5364748 669#endif
6efd877d 670
43ca9aa6
KR
671 /* Do we really want to write it? */
672 {
673 int n_warns, n_errs;
674 n_warns = had_warnings ();
675 n_errs = had_errors ();
676 /* The -Z flag indicates that an object file should be generated,
677 regardless of warnings and errors. */
678 if (flagseen['Z'])
679 {
680 if (n_warns || n_errs)
681 as_warn ("%d error%s, %d warning%s, generating bad object file.\n",
682 n_errs, n_errs == 1 ? "" : "s",
683 n_warns, n_warns == 1 ? "" : "s");
684 }
685 else
686 {
687 if (n_errs)
688 as_fatal ("%d error%s, %d warning%s, no object file generated.\n",
689 n_errs, n_errs == 1 ? "" : "s",
690 n_warns, n_warns == 1 ? "" : "s");
691 }
692 }
693
3eb802b5 694#ifdef OBJ_VMS
6efd877d 695 /*
3eb802b5
ILT
696 * Under VMS we try to be compatible with VAX-11 "C". Thus, we
697 * call a routine to check for the definition of the procedure
698 * "_main", and if so -- fix it up so that it can be program
699 * entry point.
700 */
6efd877d 701 VMS_Check_For_Main ();
fecd2382 702#endif /* VMS */
43ca9aa6
KR
703
704 /* After every sub-segment, we fake an ".align ...". This conforms to
705 BSD4.2 brane-damage. We then fake ".fill 0" because that is the kind of
706 frag that requires least thought. ".align" frags like to have a
707 following frag since that makes calculating their intended length
708 trivial.
709
710 @@ Is this really necessary?? */
3eb802b5 711#ifndef SUB_SEGMENT_ALIGN
43ca9aa6 712#ifdef BFD_ASSEMBLER
f2f7d044 713#define SUB_SEGMENT_ALIGN(SEG) (0)
43ca9aa6 714#else
f2f7d044 715#define SUB_SEGMENT_ALIGN(SEG) (2)
43ca9aa6 716#endif
3eb802b5 717#endif
6efd877d
KR
718 for (frchainP = frchain_root; frchainP; frchainP = frchainP->frch_next)
719 {
43ca9aa6
KR
720#ifdef BFD_ASSEMBLER
721 subseg_set (frchainP->frch_seg, frchainP->frch_subseg);
722#else
6efd877d 723 subseg_new (frchainP->frch_seg, frchainP->frch_subseg);
43ca9aa6 724#endif
f2f7d044 725 frag_align (SUB_SEGMENT_ALIGN (now_seg), NOP_OPCODE);
43ca9aa6
KR
726 /* frag_align will have left a new frag.
727 Use this last frag for an empty ".fill".
728
729 For this segment ...
730 Create a last frag. Do not leave a "being filled in frag". */
6efd877d
KR
731 frag_wane (frag_now);
732 frag_now->fr_fix = 0;
733 know (frag_now->fr_next == NULL);
734 /* know( frags . obstack_c_base == frags . obstack_c_next_free ); */
735 /* Above shows we haven't left a half-completed object on obstack. */
43ca9aa6 736 }
6efd877d 737
43ca9aa6
KR
738 /* From now on, we don't care about sub-segments. Build one frag chain
739 for each segment. Linked thru fr_next. */
65bfcf2e 740
43ca9aa6
KR
741#ifdef BFD_ASSEMBLER
742 /* Remove the sections created by gas for its own purposes. */
743 {
744 asection **seclist, *sec;
745 seclist = &stdoutput->sections;
746 while (seclist && *seclist)
747 {
748 sec = *seclist;
749 while (sec == big_section
750 || sec == reg_section
751 || sec == pass1_section
752 || sec == diff_section
753 || sec == absent_section)
754 {
755 sec = sec->next;
756 *seclist = sec;
757 stdoutput->section_count--;
758 if (!sec)
759 break;
760 }
761 if (*seclist)
762 seclist = &(*seclist)->next;
763 }
764 }
765
766 bfd_map_over_sections (stdoutput, chain_frchains_together, (char *) 0);
767#else
6efd877d
KR
768 remove_subsegs (frchain_root, SEG_TEXT, &text_frag_root, &text_last_frag);
769 remove_subsegs (data0_frchainP, SEG_DATA, &data_frag_root, &data_last_frag);
770 remove_subsegs (bss0_frchainP, SEG_BSS, &bss_frag_root, &bss_last_frag);
43ca9aa6 771#endif
6efd877d 772
43ca9aa6
KR
773 /* We have two segments. If user gave -R flag, then we must put the
774 data frags into the text segment. Do this before relaxing so
775 we know to take advantage of -R and make shorter addresses. */
776#if !defined (OBJ_AOUT) || defined (BFD_ASSEMBLER)
6efd877d
KR
777 if (flagseen['R'])
778 {
43ca9aa6
KR
779#ifdef BFD_ASSEMBLER
780 seg_info (text_section)->frchainP->frch_last->fr_next =
781 seg_info (data_section)->frchainP->frch_root;
782 seg_info (text_section)->frchainP->frch_last =
783 seg_info (data_section)->frchainP->frch_last;
784 seg_info (data_section)->frchainP = 0;
785#else
6efd877d
KR
786 fixS *tmp;
787
788 text_last_frag->fr_next = data_frag_root;
789 text_last_frag = data_last_frag;
790 data_last_frag = NULL;
791 data_frag_root = NULL;
792 if (text_fix_root)
793 {
794 for (tmp = text_fix_root; tmp->fx_next; tmp = tmp->fx_next);;
795 tmp->fx_next = data_fix_root;
796 text_fix_tail = data_fix_tail;
a39116f1 797 }
6efd877d
KR
798 else
799 text_fix_root = data_fix_root;
800 data_fix_root = NULL;
43ca9aa6 801#endif
6efd877d
KR
802 }
803#endif
43ca9aa6
KR
804
805#ifdef BFD_ASSEMBLER
d5364748 806
43ca9aa6
KR
807 bfd_map_over_sections (stdoutput, relax_and_size_seg, (char *) 0);
808#else
6efd877d
KR
809 relax_segment (text_frag_root, SEG_TEXT);
810 relax_segment (data_frag_root, SEG_DATA);
811 relax_segment (bss_frag_root, SEG_BSS);
812 /*
7f2cb270
KR
813 * Now the addresses of frags are correct within the segment.
814 */
6efd877d
KR
815
816 know (text_last_frag->fr_type == rs_fill && text_last_frag->fr_offset == 0);
817 H_SET_TEXT_SIZE (&headers, text_last_frag->fr_address);
818 text_last_frag->fr_address = H_GET_TEXT_SIZE (&headers);
819
820 /*
7f2cb270
KR
821 * Join the 2 segments into 1 huge segment.
822 * To do this, re-compute every rn_address in the SEG_DATA frags.
823 * Then join the data frags after the text frags.
824 *
825 * Determine a_data [length of data segment].
826 */
6efd877d
KR
827 if (data_frag_root)
828 {
829 register relax_addressT slide;
830
831 know ((text_last_frag->fr_type == rs_fill) && (text_last_frag->fr_offset == 0));
832
833 H_SET_DATA_SIZE (&headers, data_last_frag->fr_address);
834 data_last_frag->fr_address = H_GET_DATA_SIZE (&headers);
835 slide = H_GET_TEXT_SIZE (&headers); /* & in file of the data segment. */
ebfb4167
MT
836#ifdef OBJ_BOUT
837#define RoundUp(N,S) (((N)+(S)-1)&-(S))
6efd877d 838 /* For b.out: If the data section has a strict alignment
7f2cb270
KR
839 requirement, its load address in the .o file will be
840 rounded up from the size of the text section. These
841 two values are *not* the same! Similarly for the bss
842 section.... */
6efd877d 843 slide = RoundUp (slide, 1 << section_alignment[SEG_DATA]);
ebfb4167
MT
844#endif
845
6efd877d
KR
846 for (fragP = data_frag_root; fragP; fragP = fragP->fr_next)
847 {
848 fragP->fr_address += slide;
849 } /* for each data frag */
850
851 know (text_last_frag != 0);
852 text_last_frag->fr_next = data_frag_root;
853 }
854 else
855 {
856 H_SET_DATA_SIZE (&headers, 0);
6efd877d 857 }
ebfb4167
MT
858
859#ifdef OBJ_BOUT
6efd877d
KR
860 /* See above comments on b.out data section address. */
861 {
862 long bss_vma;
863 if (data_last_frag == 0)
864 bss_vma = H_GET_TEXT_SIZE (&headers);
865 else
866 bss_vma = data_last_frag->fr_address;
867 bss_vma = RoundUp (bss_vma, 1 << section_alignment[SEG_BSS]);
868 bss_address_frag.fr_address = bss_vma;
869 }
43ca9aa6 870#else /* ! OBJ_BOUT */
6efd877d
KR
871 bss_address_frag.fr_address = (H_GET_TEXT_SIZE (&headers) +
872 H_GET_DATA_SIZE (&headers));
873
65bfcf2e 874
6efd877d
KR
875 /* Slide all the frags */
876 if (bss_frag_root)
877 {
85825401 878 relax_addressT slide = bss_address_frag.fr_address;
09952cd9 879
6efd877d 880 for (fragP = bss_frag_root; fragP; fragP = fragP->fr_next)
65bfcf2e 881 {
6efd877d
KR
882 fragP->fr_address += slide;
883 } /* for each bss frag */
884 }
65bfcf2e 885
43ca9aa6 886#endif /* ! OBJ_BOUT */
85825401 887
6efd877d 888 if (bss_last_frag)
85825401
ILT
889 H_SET_BSS_SIZE (&headers,
890 bss_last_frag->fr_address - bss_frag_root->fr_address);
891 else
892 H_SET_BSS_SIZE (&headers, 0);
43ca9aa6 893#endif /* BFD_ASSEMBLER */
65bfcf2e 894
43ca9aa6 895#ifndef BFD_ASSEMBLER
6efd877d 896 /*
7f2cb270
KR
897 *
898 * Crawl the symbol chain.
899 *
900 * For each symbol whose value depends on a frag, take the address of
901 * that frag and subsume it into the value of the symbol.
902 * After this, there is just one way to lookup a symbol value.
903 * Values are left in their final state for object file emission.
904 * We adjust the values of 'L' local symbols, even if we do
905 * not intend to emit them to the object file, because their values
906 * are needed for fix-ups.
907 *
908 * Unless we saw a -L flag, remove all symbols that begin with 'L'
909 * from the symbol chain. (They are still pointed to by the fixes.)
910 *
911 * Count the remaining symbols.
912 * Assign a symbol number to each symbol.
913 * Count the number of string-table chars we will emit.
914 * Put this info into the headers as appropriate.
915 *
916 */
6efd877d
KR
917 know (zero_address_frag.fr_address == 0);
918 string_byte_count = sizeof (string_byte_count);
919
920 obj_crawl_symbol_chain (&headers);
921
922 if (string_byte_count == sizeof (string_byte_count))
43ca9aa6 923 string_byte_count = 0;
6efd877d
KR
924
925 H_SET_STRING_SIZE (&headers, string_byte_count);
926
927 /*
7f2cb270
KR
928 * Addresses of frags now reflect addresses we use in the object file.
929 * Symbol values are correct.
930 * Scan the frags, converting any ".org"s and ".align"s to ".fill"s.
931 * Also converting any machine-dependent frags using md_convert_frag();
932 */
6efd877d
KR
933 subseg_change (SEG_TEXT, 0);
934
935 for (fragP = text_frag_root; fragP; fragP = fragP->fr_next)
936 {
43ca9aa6 937 cvt_frag_to_fill (&headers, fragP);
6efd877d 938
43ca9aa6
KR
939 /* Some assert macros don't work with # directives mixed in. */
940#ifndef NDEBUG
941 if (!(fragP->fr_next == NULL
ebfb4167 942#ifdef OBJ_BOUT
43ca9aa6 943 || fragP->fr_next == data_frag_root
ebfb4167 944#endif
6efd877d 945 || ((fragP->fr_next->fr_address - fragP->fr_address)
43ca9aa6
KR
946 == (fragP->fr_fix + fragP->fr_offset * fragP->fr_var))))
947 abort ();
948#endif
949 }
950#endif /* ! BFD_ASSEMBLER */
6efd877d 951
fecd2382 952#ifndef WORKING_DOT_WORD
6efd877d
KR
953 {
954 struct broken_word *lie;
955 struct broken_word **prevP;
956
957 prevP = &broken_words;
958 for (lie = broken_words; lie; lie = lie->next_broken_word)
959 if (!lie->added)
a39116f1 960 {
43ca9aa6
KR
961#ifdef BFD_ASSEMBLER
962 fix_new (lie->frag, lie->word_goes_here - lie->frag->fr_literal,
d5364748
KR
963 2, lie->add, lie->sub, lie->addnum, 0,
964 BFD_RELOC_NONE);
43ca9aa6
KR
965#else
966#if defined(TC_SPARC) || defined(TC_A29K) || defined(NEED_FX_R_TYPE)
967 fix_new (lie->frag, lie->word_goes_here - lie->frag->fr_literal,
968 2, lie->add,
969 lie->sub, lie->addnum,
970 0, NO_RELOC);
971#else
fecd2382 972#ifdef TC_NS32K
6efd877d
KR
973 fix_new_ns32k (lie->frag,
974 lie->word_goes_here - lie->frag->fr_literal,
975 2,
976 lie->add,
977 lie->sub,
978 lie->addnum,
979 0, 0, 2, 0, 0);
343fb08d 980#else
6efd877d
KR
981 fix_new (lie->frag, lie->word_goes_here - lie->frag->fr_literal,
982 2, lie->add,
983 lie->sub, lie->addnum,
984 0, 0);
fecd2382 985#endif /* TC_NS32K */
43ca9aa6
KR
986#endif /* TC_SPARC|TC_A29K|NEED_FX_R_TYPE */
987#endif /* BFD_ASSEMBLER */
6efd877d 988 *prevP = lie->next_broken_word;
a39116f1 989 }
6efd877d
KR
990 else
991 prevP = &(lie->next_broken_word);
992
993 for (lie = broken_words; lie;)
994 {
995 struct broken_word *untruth;
996 char *table_ptr;
d5364748
KR
997 addressT table_addr;
998 addressT from_addr, to_addr;
6efd877d
KR
999 int n, m;
1000
6efd877d
KR
1001 fragP = lie->dispfrag;
1002
43ca9aa6 1003 /* Find out how many broken_words go here. */
6efd877d
KR
1004 n = 0;
1005 for (untruth = lie; untruth && untruth->dispfrag == fragP; untruth = untruth->next_broken_word)
1006 if (untruth->added == 1)
1007 n++;
1008
1009 table_ptr = lie->dispfrag->fr_opcode;
1010 table_addr = lie->dispfrag->fr_address + (table_ptr - lie->dispfrag->fr_literal);
43ca9aa6
KR
1011 /* Create the jump around the long jumps. This is a short
1012 jump from table_ptr+0 to table_ptr+n*long_jump_size. */
6efd877d
KR
1013 from_addr = table_addr;
1014 to_addr = table_addr + md_short_jump_size + n * md_long_jump_size;
1015 md_create_short_jump (table_ptr, from_addr, to_addr, lie->dispfrag, lie->add);
1016 table_ptr += md_short_jump_size;
1017 table_addr += md_short_jump_size;
1018
1019 for (m = 0; lie && lie->dispfrag == fragP; m++, lie = lie->next_broken_word)
1020 {
1021 if (lie->added == 2)
1022 continue;
1023 /* Patch the jump table */
1024 /* This is the offset from ??? to table_ptr+0 */
d5364748 1025 to_addr = table_addr - S_GET_VALUE (lie->sub);
6efd877d
KR
1026 md_number_to_chars (lie->word_goes_here, to_addr, 2);
1027 for (untruth = lie->next_broken_word; untruth && untruth->dispfrag == fragP; untruth = untruth->next_broken_word)
1028 {
1029 if (untruth->use_jump == lie)
1030 md_number_to_chars (untruth->word_goes_here, to_addr, 2);
1031 }
1032
1033 /* Install the long jump */
1034 /* this is a long jump from table_ptr+0 to the final target */
1035 from_addr = table_addr;
1036 to_addr = S_GET_VALUE (lie->add) + lie->addnum;
1037 md_create_long_jump (table_ptr, from_addr, to_addr, lie->dispfrag, lie->add);
1038 table_ptr += md_long_jump_size;
1039 table_addr += md_long_jump_size;
1040 }
1041 }
1042 }
fecd2382 1043#endif /* not WORKING_DOT_WORD */
6efd877d 1044
43ca9aa6 1045#ifndef BFD_ASSEMBLER
3eb802b5 1046#ifndef OBJ_VMS
6efd877d
KR
1047 { /* not vms */
1048 /*
3eb802b5
ILT
1049 * Scan every FixS performing fixups. We had to wait until now to do
1050 * this because md_convert_frag() may have made some fixSs.
1051 */
6efd877d
KR
1052 int trsize, drsize;
1053
1054 subseg_change (SEG_TEXT, 0);
d5364748 1055 trsize = md_reloc_size * fixup_segment (text_fix_root, SEG_TEXT);
6efd877d 1056 subseg_change (SEG_DATA, 0);
d5364748 1057 drsize = md_reloc_size * fixup_segment (data_fix_root, SEG_DATA);
6efd877d
KR
1058 H_SET_RELOCATION_SIZE (&headers, trsize, drsize);
1059
1060 /* FIXME move this stuff into the pre-write-hook */
1061 H_SET_MAGIC_NUMBER (&headers, magic_number_for_object_file);
1062 H_SET_ENTRY_POINT (&headers, 0);
1063
1064 obj_pre_write_hook (&headers); /* extra coff stuff */
6efd877d
KR
1065
1066 object_file_size = H_GET_FILE_SIZE (&headers);
1067 next_object_file_charP = the_object_file = xmalloc (object_file_size);
1068
1069 output_file_create (out_file_name);
1070
1071 obj_header_append (&next_object_file_charP, &headers);
1072
1073 know ((next_object_file_charP - the_object_file) == H_GET_HEADER_SIZE (&headers));
1074
1075 /*
43ca9aa6
KR
1076 * Emit code.
1077 */
6efd877d
KR
1078 for (fragP = text_frag_root; fragP; fragP = fragP->fr_next)
1079 {
1080 register long count;
1081 register char *fill_literal;
1082 register long fill_size;
1083
1084 know (fragP->fr_type == rs_fill);
1085 append (&next_object_file_charP, fragP->fr_literal, (unsigned long) fragP->fr_fix);
1086 fill_literal = fragP->fr_literal + fragP->fr_fix;
1087 fill_size = fragP->fr_var;
1088 know (fragP->fr_offset >= 0);
1089
1090 for (count = fragP->fr_offset; count; count--)
1091 {
1092 append (&next_object_file_charP, fill_literal, (unsigned long) fill_size);
1093 } /* for each */
1094
1095 } /* for each code frag. */
1096
1097 know ((next_object_file_charP - the_object_file) == (H_GET_HEADER_SIZE (&headers) + H_GET_TEXT_SIZE (&headers) + H_GET_DATA_SIZE (&headers)));
1098
1099 /*
43ca9aa6
KR
1100 * Emit relocations.
1101 */
6efd877d
KR
1102 obj_emit_relocations (&next_object_file_charP, text_fix_root, (relax_addressT) 0);
1103 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 1104#ifdef TC_I960
6efd877d 1105 /* Make addresses in data relocation directives relative to beginning of
43ca9aa6
KR
1106 * first data fragment, not end of last text fragment: alignment of the
1107 * start of the data segment may place a gap between the segments.
1108 */
6efd877d 1109 obj_emit_relocations (&next_object_file_charP, data_fix_root, data0_frchainP->frch_root->fr_address);
fecd2382 1110#else /* TC_I960 */
6efd877d 1111 obj_emit_relocations (&next_object_file_charP, data_fix_root, text_last_frag->fr_address);
fecd2382 1112#endif /* TC_I960 */
6efd877d
KR
1113
1114 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)));
1115
1116 /*
43ca9aa6
KR
1117 * Emit line number entries.
1118 */
6efd877d
KR
1119 OBJ_EMIT_LINENO (&next_object_file_charP, lineno_rootP, the_object_file);
1120 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)));
1121
1122 /*
3eb802b5
ILT
1123 * Emit symbols.
1124 */
6efd877d
KR
1125 obj_emit_symbols (&next_object_file_charP, symbol_rootP);
1126 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)));
1127
1128 /*
3eb802b5
ILT
1129 * Emit strings.
1130 */
6efd877d
KR
1131
1132 if (string_byte_count > 0)
1133 {
1134 obj_emit_strings (&next_object_file_charP);
1135 } /* only if we have a string table */
1136
45432836 1137#ifdef BFD_HEADERS
6efd877d
KR
1138 bfd_seek (stdoutput, 0, 0);
1139 bfd_write (the_object_file, 1, object_file_size, stdoutput);
45432836 1140#else
6efd877d
KR
1141
1142 /* Write the data to the file */
1143 output_file_append (the_object_file, object_file_size, out_file_name);
45432836 1144#endif
6efd877d
KR
1145
1146 output_file_close (out_file_name);
1147 } /* non vms output */
1148#else /* VMS */
1149 /*
3eb802b5
ILT
1150 * Now do the VMS-dependent part of writing the object file
1151 */
85825401
ILT
1152 VMS_write_object_file (H_GET_TEXT_SIZE (&headers),
1153 H_GET_DATA_SIZE (&headers),
1154 H_GET_BSS_SIZE (&headers),
3eb802b5 1155 text_frag_root, data_frag_root);
6efd877d 1156#endif /* VMS */
43ca9aa6 1157#else /* BFD_ASSEMBLER */
6efd877d 1158
d5364748
KR
1159#ifdef obj_check_file_symbols
1160 obj_check_file_symbols ();
1161#endif
1162
1163 bfd_map_over_sections (stdoutput, adjust_reloc_syms, (char *)0);
1164
43ca9aa6
KR
1165 /* Set up symbol table, and write it out. */
1166 if (symbol_rootP)
1167 {
1168 int i = 0, n;
1169 symbolS *symp;
1170
1171 for (symp = symbol_rootP; symp; symp = symbol_next (symp))
1172 {
d5364748
KR
1173 int keep = 0;
1174
43ca9aa6
KR
1175 S_SET_VALUE (symp, S_GET_VALUE (symp) + symp->sy_frag->fr_address);
1176 /* So far, common symbols have been treated like undefined symbols.
1177 Put them in the common section now. */
1178 if (S_IS_DEFINED (symp) == 0
1179 && S_GET_VALUE (symp) != 0)
1180 S_SET_SEGMENT (symp, &bfd_com_section);
1181#if 0
d5364748 1182 printf ("symbol `%s'\n\t@%x: value=%d flags=%x forward=%x seg=%s\n",
43ca9aa6
KR
1183 S_GET_NAME (symp), symp,
1184 S_GET_VALUE (symp),
d5364748 1185 symp->bsym->flags,
43ca9aa6
KR
1186 symp->sy_forward,
1187 segment_name (symp->bsym->section));
1188#endif
1189 {
1190 int punt = 0;
1191#ifdef obj_frob_symbol
1192 obj_frob_symbol (symp, punt);
1193 if (punt)
1194 goto punt_it;
1195#endif
1196#ifdef tc_frob_symbol
1197 tc_frob_symbol (symp, punt);
1198 if (punt)
1199 goto punt_it;
1200#endif
1201 }
1202 /* If we don't want to keep this symbol, splice it out of the
1203 chain now. */
1204 if (S_IS_LOCAL (symp))
1205 {
1206 symbolS *prev, *next;
1207 punt_it:
1208 prev = symbol_previous (symp);
1209 next = symbol_next (symp);
1210#ifdef DEBUG
d5364748 1211 verify_symbol_chain_2 (symp);
43ca9aa6
KR
1212#endif
1213 if (prev)
1214 {
1215 symbol_next (prev) = next;
1216 symp = prev;
1217 }
d5364748
KR
1218 else if (symp == symbol_rootP)
1219 symbol_rootP = next;
43ca9aa6
KR
1220 else
1221 abort ();
1222 if (next)
1223 symbol_previous (next) = prev;
1224 else
1225 symbol_lastP = prev;
1226#ifdef DEBUG
d5364748
KR
1227 if (prev)
1228 verify_symbol_chain_2 (prev);
1229 else if (next)
1230 verify_symbol_chain_2 (next);
45432836 1231#endif
43ca9aa6
KR
1232 continue;
1233 }
1234 i++;
1235 }
1236 n = i;
1237 if (n)
1238 {
1239 asymbol **asympp;
1240 boolean result;
d5364748 1241 extern PTR bfd_alloc PARAMS ((bfd *, size_t));
43ca9aa6 1242
d5364748
KR
1243 asympp = (asymbol **) bfd_alloc (stdoutput,
1244 n * sizeof (asymbol *));
43ca9aa6
KR
1245 symp = symbol_rootP;
1246 for (i = 0; i < n; i++, symp = symbol_next (symp))
1247 {
1248 asympp[i] = symp->bsym;
1249 symp->written = 1;
1250 }
1251 result = bfd_set_symtab (stdoutput, asympp, n);
1252 assert (result == true);
1253 }
1254 }
1255
d5364748 1256
f2f7d044
ILT
1257#ifdef obj_frob_file
1258 obj_frob_file ();
1259#endif
1260
43ca9aa6
KR
1261 /* Now that all the sizes are known, and contents correct, we can
1262 start writing the file. */
1263 bfd_map_over_sections (stdoutput, write_contents, (char *) 0);
1264
1265 output_file_close (out_file_name);
1266#endif /* BFD_ASSEMBLER */
1267}
d5364748 1268#endif /* ! BFD */
fecd2382
RP
1269
1270/*
1271 * relax_segment()
1272 *
1273 * Now we have a segment, not a crowd of sub-segments, we can make fr_address
1274 * values.
1275 *
1276 * Relax the frags.
1277 *
1278 * After this, all frags in this segment have addresses that are correct
1279 * within the segment. Since segments live in different file addresses,
1280 * these frag addresses may not be the same as final object-file addresses.
1281 */
45432836 1282
d5364748 1283/* Subroutines of relax_segment. */
43ca9aa6
KR
1284static int
1285is_dnrange (f1, f2)
1286 struct frag *f1;
1287 struct frag *f2;
1288{
1289 for (; f1; f1 = f1->fr_next)
1290 if (f1->fr_next == f2)
1291 return 1;
1292 return 0;
1293}
1294
1295/* Relax_align. Advance location counter to next address that has 'alignment'
d5364748 1296 lowest order bits all 0s, return size of adjustment made. */
43ca9aa6
KR
1297static relax_addressT
1298relax_align (address, alignment)
1299 register relax_addressT address; /* Address now. */
d5364748 1300 register int alignment; /* Alignment (binary). */
43ca9aa6
KR
1301{
1302 relax_addressT mask;
1303 relax_addressT new_address;
1304
1305 mask = ~((~0) << alignment);
1306 new_address = (address + mask) & (~mask);
1307 if (linkrelax)
1308 /* We must provide lots of padding, so the linker can discard it
1309 when needed. The linker will not add extra space, ever. */
1310 new_address += (1 << alignment);
1311 return (new_address - address);
1312}
45432836 1313
6efd877d
KR
1314void
1315relax_segment (segment_frag_root, segment)
1316 struct frag *segment_frag_root;
43ca9aa6 1317 segT segment;
fecd2382 1318{
6efd877d
KR
1319 register struct frag *fragP;
1320 register relax_addressT address;
43ca9aa6 1321#if !defined (MANY_SEGMENTS) && !defined (BFD_ASSEMBLER)
6efd877d 1322 know (segment == SEG_DATA || segment == SEG_TEXT || segment == SEG_BSS);
45432836 1323#endif
6efd877d
KR
1324 /* In case md_estimate_size_before_relax() wants to make fixSs. */
1325 subseg_change (segment, 0);
1326
7f2cb270
KR
1327 /* For each frag in segment: count and store (a 1st guess of)
1328 fr_address. */
6efd877d
KR
1329 address = 0;
1330 for (fragP = segment_frag_root; fragP; fragP = fragP->fr_next)
1331 {
1332 fragP->fr_address = address;
1333 address += fragP->fr_fix;
1334
1335 switch (fragP->fr_type)
1336 {
1337 case rs_fill:
1338 address += fragP->fr_offset * fragP->fr_var;
1339 break;
1340
1341 case rs_align:
d5364748 1342 address += relax_align (address, (int) fragP->fr_offset);
6efd877d
KR
1343 break;
1344
1345 case rs_org:
7f2cb270 1346 /* Assume .org is nugatory. It will grow with 1st relax. */
6efd877d
KR
1347 break;
1348
1349 case rs_machine_dependent:
1350 address += md_estimate_size_before_relax (fragP, segment);
1351 break;
1352
fecd2382 1353#ifndef WORKING_DOT_WORD
6efd877d
KR
1354 /* Broken words don't concern us yet */
1355 case rs_broken_word:
1356 break;
fecd2382 1357#endif
6efd877d
KR
1358
1359 default:
1360 BAD_CASE (fragP->fr_type);
1361 break;
1362 } /* switch(fr_type) */
1363 } /* for each frag in the segment */
1364
7f2cb270 1365 /* Do relax(). */
6efd877d 1366 {
7f2cb270 1367 long stretch; /* May be any size, 0 or negative. */
6efd877d
KR
1368 /* Cumulative number of addresses we have */
1369 /* relaxed this pass. */
1370 /* We may have relaxed more than one address. */
7f2cb270
KR
1371 long stretched; /* Have we stretched on this pass? */
1372 /* This is 'cuz stretch may be zero, when, in fact some piece of code
1373 grew, and another shrank. If a branch instruction doesn't fit anymore,
1374 we could be scrod. */
6efd877d
KR
1375
1376 do
1377 {
1378 stretch = stretched = 0;
1379 for (fragP = segment_frag_root; fragP; fragP = fragP->fr_next)
1380 {
7f2cb270
KR
1381 long growth = 0;
1382 unsigned long was_address;
1383 long offset;
1384 symbolS *symbolP;
1385 long target;
1386 long after;
1387 long aim;
6efd877d
KR
1388
1389 was_address = fragP->fr_address;
1390 address = fragP->fr_address += stretch;
1391 symbolP = fragP->fr_symbol;
1392 offset = fragP->fr_offset;
6efd877d
KR
1393
1394 switch (fragP->fr_type)
1395 {
1396 case rs_fill: /* .fill never relaxes. */
1397 growth = 0;
1398 break;
1399
fecd2382 1400#ifndef WORKING_DOT_WORD
6efd877d 1401 /* JF: This is RMS's idea. I do *NOT* want to be blamed
7f2cb270
KR
1402 for it I do not want to write it. I do not want to have
1403 anything to do with it. This is not the proper way to
1404 implement this misfeature. */
6efd877d
KR
1405 case rs_broken_word:
1406 {
1407 struct broken_word *lie;
1408 struct broken_word *untruth;
6efd877d
KR
1409
1410 /* Yes this is ugly (storing the broken_word pointer
7f2cb270
KR
1411 in the symbol slot). Still, this whole chunk of
1412 code is ugly, and I don't feel like doing anything
1413 about it. Think of it as stubbornness in action. */
6efd877d
KR
1414 growth = 0;
1415 for (lie = (struct broken_word *) (fragP->fr_symbol);
1416 lie && lie->dispfrag == fragP;
1417 lie = lie->next_broken_word)
1418 {
1419
1420 if (lie->added)
1421 continue;
1422
7f2cb270
KR
1423 offset = (lie->add->sy_frag->fr_address
1424 + S_GET_VALUE (lie->add)
1425 + lie->addnum
1426 - (lie->sub->sy_frag->fr_address
1427 + S_GET_VALUE (lie->sub)));
6efd877d
KR
1428 if (offset <= -32768 || offset >= 32767)
1429 {
1430 if (flagseen['K'])
d5364748
KR
1431 {
1432 char buf[50];
1433 sprint_value (buf, lie->addnum);
1434 as_warn (".word %s-%s+%s didn't fit",
1435 S_GET_NAME (lie->add),
1436 S_GET_NAME (lie->sub),
1437 buf);
1438 }
6efd877d
KR
1439 lie->added = 1;
1440 if (fragP->fr_subtype == 0)
1441 {
1442 fragP->fr_subtype++;
1443 growth += md_short_jump_size;
1444 }
7f2cb270
KR
1445 for (untruth = lie->next_broken_word;
1446 untruth && untruth->dispfrag == lie->dispfrag;
1447 untruth = untruth->next_broken_word)
6efd877d
KR
1448 if ((untruth->add->sy_frag == lie->add->sy_frag)
1449 && S_GET_VALUE (untruth->add) == S_GET_VALUE (lie->add))
1450 {
1451 untruth->added = 2;
1452 untruth->use_jump = lie;
1453 }
1454 growth += md_long_jump_size;
1455 }
1456 }
1457
1458 break;
1459 } /* case rs_broken_word */
fecd2382 1460#endif
6efd877d 1461 case rs_align:
43ca9aa6
KR
1462 growth = (relax_align ((relax_addressT) (address
1463 + fragP->fr_fix),
d5364748 1464 (int) offset)
43ca9aa6
KR
1465 - relax_align ((relax_addressT) (was_address
1466 + fragP->fr_fix),
d5364748 1467 (int) offset));
6efd877d
KR
1468 break;
1469
1470 case rs_org:
1471 target = offset;
1472
1473 if (symbolP)
1474 {
43ca9aa6
KR
1475#if !defined (MANY_SEGMENTS) && !defined (BFD_ASSEMBLER)
1476 know ((S_GET_SEGMENT (symbolP) == SEG_ABSOLUTE)
1477 || (S_GET_SEGMENT (symbolP) == SEG_DATA)
1478 || (S_GET_SEGMENT (symbolP) == SEG_TEXT)
1479 || S_GET_SEGMENT (symbolP) == SEG_BSS);
6efd877d 1480 know (symbolP->sy_frag);
43ca9aa6
KR
1481 know (!(S_GET_SEGMENT (symbolP) == SEG_ABSOLUTE)
1482 || (symbolP->sy_frag == &zero_address_frag));
45432836 1483#endif
6efd877d
KR
1484 target += S_GET_VALUE (symbolP)
1485 + symbolP->sy_frag->fr_address;
1486 } /* if we have a symbol */
1487
1488 know (fragP->fr_next);
1489 after = fragP->fr_next->fr_address;
1490 growth = ((target - after) > 0) ? (target - after) : 0;
43ca9aa6
KR
1491 /* Growth may be negative, but variable part of frag
1492 cannot have fewer than 0 chars. That is, we can't
1493 .org backwards. */
6efd877d
KR
1494
1495 growth -= stretch; /* This is an absolute growth factor */
1496 break;
1497
1498 case rs_machine_dependent:
1499 {
7f2cb270
KR
1500 const relax_typeS *this_type;
1501 const relax_typeS *start_type;
1502 relax_substateT next_state;
1503 relax_substateT this_state;
6efd877d 1504
7f2cb270
KR
1505 this_state = fragP->fr_subtype;
1506 start_type = this_type = md_relax_table + this_state;
6efd877d
KR
1507 target = offset;
1508
1509 if (symbolP)
1510 {
43ca9aa6
KR
1511#if !defined (MANY_SEGMENTS) && !defined (BFD_ASSEMBLER)
1512 know ((S_GET_SEGMENT (symbolP) == SEG_ABSOLUTE)
1513 || (S_GET_SEGMENT (symbolP) == SEG_DATA)
1514 || (S_GET_SEGMENT (symbolP) == SEG_BSS)
1515 || (S_GET_SEGMENT (symbolP) == SEG_TEXT));
45432836 1516#endif
6efd877d 1517 know (symbolP->sy_frag);
43ca9aa6
KR
1518 know (!(S_GET_SEGMENT (symbolP) == absolute_section)
1519 || symbolP->sy_frag == &zero_address_frag);
6efd877d
KR
1520 target +=
1521 S_GET_VALUE (symbolP)
1522 + symbolP->sy_frag->fr_address;
1523
1524 /* If frag has yet to be reached on this pass,
7f2cb270
KR
1525 assume it will move by STRETCH just as we did.
1526 If this is not so, it will be because some frag
d5364748
KR
1527 between grows, and that will force another pass.
1528
1529 Beware zero-length frags.
1530
1531 There should be a faster way to do this. */
6efd877d
KR
1532
1533 if (symbolP->sy_frag->fr_address >= was_address
1534 && is_dnrange (fragP, symbolP->sy_frag))
1535 {
1536 target += stretch;
7f2cb270 1537 }
d5364748 1538 }
6efd877d
KR
1539
1540 aim = target - address - fragP->fr_fix;
1541 /* The displacement is affected by the instruction size
7f2cb270
KR
1542 for the 32k architecture. I think we ought to be able
1543 to add fragP->fr_pcrel_adjust in all cases (it should be
1544 zero if not used), but just in case it breaks something
1545 else we'll put this inside #ifdef NS32K ... #endif */
d5364748
KR
1546#ifndef TC_NS32K
1547 if (fragP->fr_pcrel_adjust)
1548 abort ();
1549#endif
6efd877d 1550 aim += fragP->fr_pcrel_adjust;
6efd877d
KR
1551
1552 if (aim < 0)
1553 {
1554 /* Look backwards. */
1555 for (next_state = this_type->rlx_more; next_state;)
7f2cb270
KR
1556 if (aim >= this_type->rlx_backward)
1557 next_state = 0;
1558 else
1559 {
1560 /* Grow to next state. */
1561 this_state = next_state;
1562 this_type = md_relax_table + this_state;
1563 next_state = this_type->rlx_more;
1564 }
6efd877d
KR
1565 }
1566 else
1567 {
a39116f1 1568#ifdef M68K_AIM_KLUDGE
6efd877d 1569 M68K_AIM_KLUDGE (aim, this_state, this_type);
fecd2382 1570#endif
6efd877d
KR
1571 /* Look forwards. */
1572 for (next_state = this_type->rlx_more; next_state;)
7f2cb270
KR
1573 if (aim <= this_type->rlx_forward)
1574 next_state = 0;
1575 else
1576 {
1577 /* Grow to next state. */
1578 this_state = next_state;
1579 this_type = md_relax_table + this_state;
1580 next_state = this_type->rlx_more;
1581 }
6efd877d
KR
1582 }
1583
7f2cb270
KR
1584 growth = this_type->rlx_length - start_type->rlx_length;
1585 if (growth != 0)
6efd877d 1586 fragP->fr_subtype = this_state;
7f2cb270
KR
1587 }
1588 break;
6efd877d
KR
1589
1590 default:
1591 BAD_CASE (fragP->fr_type);
1592 break;
1593 }
1594 if (growth)
1595 {
1596 stretch += growth;
1597 stretched++;
1598 }
1599 } /* For each frag in the segment. */
1600 }
1601 while (stretched); /* Until nothing further to relax. */
1602 } /* do_relax */
1603
1604 /*
7f2cb270
KR
1605 * We now have valid fr_address'es for each frag.
1606 */
6efd877d
KR
1607
1608 /*
7f2cb270
KR
1609 * All fr_address's are correct, relative to their own segment.
1610 * We have made all the fixS we will ever make.
1611 */
6efd877d 1612} /* relax_segment() */
fecd2382 1613
fecd2382 1614/* fixup_segment()
6efd877d 1615
fecd2382
RP
1616 Go through all the fixS's in a segment and see which ones can be
1617 handled now. (These consist of fixS where we have since discovered
1618 the value of a symbol, or the address of the frag involved.)
1619 For each one, call md_apply_fix to put the fix into the frag data.
6efd877d 1620
fecd2382
RP
1621 Result is a count of how many relocation structs will be needed to
1622 handle the remaining fixS's that we couldn't completely handle here.
1623 These will be output later by emit_relocations(). */
1624
09952cd9 1625static long
6efd877d 1626fixup_segment (fixP, this_segment_type)
09952cd9 1627 register fixS *fixP;
6efd877d 1628 segT this_segment_type; /* N_TYPE bits for segment. */
fecd2382 1629{
6efd877d
KR
1630 register long seg_reloc_count;
1631 register symbolS *add_symbolP;
1632 register symbolS *sub_symbolP;
d5364748 1633 valueT add_number;
6efd877d
KR
1634 register int size;
1635 register char *place;
1636 register long where;
1637 register char pcrel;
1638 register fragS *fragP;
43ca9aa6 1639 register segT add_symbol_segment = absolute_section;
6efd877d 1640
6efd877d 1641 seg_reloc_count = 0;
6efd877d
KR
1642 /* If the linker is doing the relaxing, we must not do any fixups */
1643 if (linkrelax)
43ca9aa6
KR
1644 for (; fixP; fixP = fixP->fx_next)
1645 seg_reloc_count++;
6efd877d 1646 else
6efd877d
KR
1647 for (; fixP; fixP = fixP->fx_next)
1648 {
1649 fragP = fixP->fx_frag;
1650 know (fragP);
1651 where = fixP->fx_where;
1652 place = fragP->fr_literal + where;
1653 size = fixP->fx_size;
1654 add_symbolP = fixP->fx_addsy;
fecd2382 1655#ifdef TC_I960
6efd877d
KR
1656 if (fixP->fx_callj && TC_S_IS_CALLNAME (add_symbolP))
1657 {
43ca9aa6
KR
1658 /* Relocation should be done via the associated 'bal'
1659 entry point symbol. */
6efd877d
KR
1660
1661 if (!TC_S_IS_BALNAME (tc_get_bal_of_call (add_symbolP)))
1662 {
1663 as_bad ("No 'bal' entry point for leafproc %s",
1664 S_GET_NAME (add_symbolP));
1665 continue;
1666 }
1667 fixP->fx_addsy = add_symbolP = tc_get_bal_of_call (add_symbolP);
43ca9aa6 1668 }
fecd2382 1669#endif
6efd877d
KR
1670 sub_symbolP = fixP->fx_subsy;
1671 add_number = fixP->fx_offset;
1672 pcrel = fixP->fx_pcrel;
1673
1674 if (add_symbolP)
43ca9aa6 1675 add_symbol_segment = S_GET_SEGMENT (add_symbolP);
6efd877d
KR
1676
1677 if (sub_symbolP)
1678 {
1679 if (!add_symbolP)
1680 {
1681 /* Its just -sym */
43ca9aa6
KR
1682 if (S_GET_SEGMENT (sub_symbolP) != absolute_section)
1683 as_bad ("Negative of non-absolute symbol %s",
1684 S_GET_NAME (sub_symbolP));
6efd877d
KR
1685
1686 add_number -= S_GET_VALUE (sub_symbolP);
6efd877d
KR
1687 }
1688 else if ((S_GET_SEGMENT (sub_symbolP) == add_symbol_segment)
1689 && (SEG_NORMAL (add_symbol_segment)
43ca9aa6 1690 || (add_symbol_segment == absolute_section)))
6efd877d 1691 {
43ca9aa6
KR
1692 /* Difference of 2 symbols from same segment.
1693 Can't make difference of 2 undefineds: 'value' means
1694 something different for N_UNDF. */
fecd2382 1695#ifdef TC_I960
6efd877d 1696 /* Makes no sense to use the difference of 2 arbitrary symbols
43ca9aa6 1697 as the target of a call instruction. */
6efd877d
KR
1698 if (fixP->fx_callj)
1699 {
1700 as_bad ("callj to difference of 2 symbols");
1701 }
1702#endif /* TC_I960 */
1703 add_number += S_GET_VALUE (add_symbolP) -
1704 S_GET_VALUE (sub_symbolP);
1705
1706 add_symbolP = NULL;
1707 fixP->fx_addsy = NULL;
1708 }
1709 else
1710 {
1711 /* Different segments in subtraction. */
43ca9aa6
KR
1712 know (!(S_IS_EXTERNAL (sub_symbolP)
1713 && (S_GET_SEGMENT (sub_symbolP) == absolute_section)));
6efd877d 1714
43ca9aa6 1715 if ((S_GET_SEGMENT (sub_symbolP) == absolute_section))
6efd877d
KR
1716 {
1717 add_number -= S_GET_VALUE (sub_symbolP);
1718 }
1719 else
1720 {
d5364748
KR
1721 char buf[50];
1722 sprint_value (buf, fragP->fr_address + where);
1723 as_bad ("Can't emit reloc {- %s-seg symbol \"%s\"} @ file address %s.",
6efd877d 1724 segment_name (S_GET_SEGMENT (sub_symbolP)),
d5364748
KR
1725 S_GET_NAME (sub_symbolP), buf);
1726 }
6efd877d 1727 }
d5364748 1728 }
6efd877d
KR
1729
1730 if (add_symbolP)
1731 {
1732 if (add_symbol_segment == this_segment_type && pcrel)
1733 {
1734 /*
43ca9aa6
KR
1735 * This fixup was made when the symbol's segment was
1736 * SEG_UNKNOWN, but it is now in the local segment.
1737 * So we know how to do the address without relocation.
1738 */
fecd2382 1739#ifdef TC_I960
43ca9aa6
KR
1740 /* reloc_callj() may replace a 'call' with a 'calls' or a
1741 'bal', in which cases it modifies *fixP as appropriate.
1742 In the case of a 'calls', no further work is required,
1743 and *fixP has been set up to make the rest of the code
1744 below a no-op. */
6efd877d 1745 reloc_callj (fixP);
fecd2382 1746#endif /* TC_I960 */
6efd877d
KR
1747
1748 add_number += S_GET_VALUE (add_symbolP);
1749 add_number -= md_pcrel_from (fixP);
1750 pcrel = 0; /* Lie. Don't want further pcrel processing. */
1751 fixP->fx_addsy = NULL; /* No relocations please. */
1752 }
1753 else
1754 {
43ca9aa6 1755 if (add_symbol_segment == absolute_section)
6efd877d 1756 {
fecd2382 1757#ifdef TC_I960
43ca9aa6
KR
1758 /* See comment about reloc_callj() above. */
1759 reloc_callj (fixP);
fecd2382 1760#endif /* TC_I960 */
6efd877d
KR
1761 add_number += S_GET_VALUE (add_symbolP);
1762 fixP->fx_addsy = NULL;
1763 add_symbolP = NULL;
43ca9aa6
KR
1764 }
1765 else if (add_symbol_segment == undefined_section
1766#ifdef BFD_ASSEMBLER
1767 || add_symbol_segment == &bfd_com_section
1768#endif
1769 )
1770 {
fecd2382 1771#ifdef TC_I960
6efd877d
KR
1772 if ((int) fixP->fx_bit_fixP == 13)
1773 {
1774 /* This is a COBR instruction. They have only a
43ca9aa6
KR
1775 * 13-bit displacement and are only to be used
1776 * for local branches: flag as error, don't generate
1777 * relocation.
1778 */
6efd877d
KR
1779 as_bad ("can't use COBR format with external label");
1780 fixP->fx_addsy = NULL; /* No relocations please. */
1781 continue;
1782 } /* COBR */
fecd2382 1783#endif /* TC_I960 */
6d5460ab 1784
fecd2382 1785#ifdef OBJ_COFF
c593cf41 1786#ifdef TE_I386AIX
6efd877d
KR
1787 if (S_IS_COMMON (add_symbolP))
1788 add_number += S_GET_VALUE (add_symbolP);
c593cf41 1789#endif /* TE_I386AIX */
fecd2382 1790#endif /* OBJ_COFF */
6efd877d 1791 ++seg_reloc_count;
43ca9aa6
KR
1792 }
1793 else
1794 {
1795 seg_reloc_count++;
1796 add_number += S_GET_VALUE (add_symbolP);
1797 }
6efd877d
KR
1798 } /* if not in local seg */
1799 } /* if there was a + symbol */
1800
1801 if (pcrel)
1802 {
1803 add_number -= md_pcrel_from (fixP);
1804 if (add_symbolP == 0)
1805 {
1806 fixP->fx_addsy = &abs_symbol;
1807 ++seg_reloc_count;
1808 } /* if there's an add_symbol */
1809 } /* if pcrel */
1810
1811 if (!fixP->fx_bit_fixP)
1812 {
d5364748
KR
1813 if ((size == 1
1814 && (add_number & ~0xFF)
43ca9aa6
KR
1815 && ((add_number & ~0xFF) != (-1 & ~0xFF)))
1816 || (size == 2
1817 && (add_number & ~0xFFFF)
d5364748
KR
1818 && ((add_number & ~0xFFFF) != (-1 & ~0xFFFF)))
1819 || (size == 4
1820 && (add_number & ~(valueT)0xFFFFFFFF)
1821 && ((add_number & ~(valueT)0xFFFFFFFF) != (-1 & ~(valueT)0xFFFFFFFF)))
1822 )
6efd877d 1823 {
d5364748
KR
1824 char buf[50];
1825 sprint_value (buf, fragP->fr_address + where);
1826 as_bad ("Value of %d too large for field of %d bytes at %s",
1827 add_number, size, buf);
6efd877d
KR
1828 } /* generic error checking */
1829#ifdef WARN_SIGNED_OVERFLOW_WORD
43ca9aa6
KR
1830 /* Warn if a .word value is too large when treated as a signed
1831 number. We already know it is not too negative. This is to
1832 catch over-large switches generated by gcc on the 68k. */
6efd877d
KR
1833 if (!flagseen['J']
1834 && size == 2
1835 && add_number > 0x7fff)
1836 as_bad ("Signed .word overflow; switch may be too large; %d at 0x%x",
1837 add_number, fragP->fr_address + where);
1838#endif
1839 } /* not a bit fix */
1840
43ca9aa6
KR
1841#ifdef BFD_ASSEMBLER
1842 md_apply_fix (fixP, &add_number);
1843#else
6efd877d 1844 md_apply_fix (fixP, add_number);
43ca9aa6 1845#endif
6efd877d
KR
1846 } /* For each fixS in this segment. */
1847
fecd2382
RP
1848#ifdef OBJ_COFF
1849#ifdef TC_I960
6efd877d
KR
1850 {
1851 fixS *topP = fixP;
1852
1853 /* two relocs per callj under coff. */
1854 for (fixP = topP; fixP; fixP = fixP->fx_next)
1855 {
1856 if (fixP->fx_callj && fixP->fx_addsy != 0)
1857 {
1858 ++seg_reloc_count;
1859 } /* if callj and not already fixed. */
1860 } /* for each fix */
1861 }
fecd2382 1862#endif /* TC_I960 */
6efd877d 1863
fecd2382 1864#endif /* OBJ_COFF */
6efd877d 1865 return (seg_reloc_count);
d5364748 1866}
fecd2382 1867
fecd2382 1868/* end of write.c */
This page took 0.157698 seconds and 4 git commands to generate.