| 1 | /* frags.c - manage frags -
|
|---|
| 2 | Copyright 1987, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
|
|---|
| 3 | 1999, 2000
|
|---|
| 4 | Free Software Foundation, Inc.
|
|---|
| 5 |
|
|---|
| 6 | This file is part of GAS, the GNU Assembler.
|
|---|
| 7 |
|
|---|
| 8 | GAS is free software; you can redistribute it and/or modify
|
|---|
| 9 | it under the terms of the GNU General Public License as published by
|
|---|
| 10 | the Free Software Foundation; either version 2, or (at your option)
|
|---|
| 11 | any later version.
|
|---|
| 12 |
|
|---|
| 13 | GAS is distributed in the hope that it will be useful,
|
|---|
| 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 16 | GNU General Public License for more details.
|
|---|
| 17 |
|
|---|
| 18 | You should have received a copy of the GNU General Public License
|
|---|
| 19 | along with GAS; see the file COPYING. If not, write to the Free
|
|---|
| 20 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA
|
|---|
| 21 | 02111-1307, USA. */
|
|---|
| 22 |
|
|---|
| 23 | #include "as.h"
|
|---|
| 24 | #include "subsegs.h"
|
|---|
| 25 | #include "obstack.h"
|
|---|
| 26 |
|
|---|
| 27 | extern fragS zero_address_frag;
|
|---|
| 28 | extern fragS bss_address_frag;
|
|---|
| 29 | |
|---|
| 30 |
|
|---|
| 31 | /* Initialization for frag routines. */
|
|---|
| 32 |
|
|---|
| 33 | void
|
|---|
| 34 | frag_init ()
|
|---|
| 35 | {
|
|---|
| 36 | zero_address_frag.fr_type = rs_fill;
|
|---|
| 37 | bss_address_frag.fr_type = rs_fill;
|
|---|
| 38 | }
|
|---|
| 39 | |
|---|
| 40 |
|
|---|
| 41 | /* Allocate a frag on the specified obstack.
|
|---|
| 42 | Call this routine from everywhere else, so that all the weird alignment
|
|---|
| 43 | hackery can be done in just one place. */
|
|---|
| 44 |
|
|---|
| 45 | fragS *
|
|---|
| 46 | frag_alloc (ob)
|
|---|
| 47 | struct obstack *ob;
|
|---|
| 48 | {
|
|---|
| 49 | fragS *ptr;
|
|---|
| 50 | int oalign;
|
|---|
| 51 |
|
|---|
| 52 | (void) obstack_alloc (ob, 0);
|
|---|
| 53 | oalign = obstack_alignment_mask (ob);
|
|---|
| 54 | obstack_alignment_mask (ob) = 0;
|
|---|
| 55 | ptr = (fragS *) obstack_alloc (ob, SIZEOF_STRUCT_FRAG);
|
|---|
| 56 | obstack_alignment_mask (ob) = oalign;
|
|---|
| 57 | memset (ptr, 0, SIZEOF_STRUCT_FRAG);
|
|---|
| 58 | return ptr;
|
|---|
| 59 | }
|
|---|
| 60 | |
|---|
| 61 |
|
|---|
| 62 | /* Try to augment current frag by nchars chars.
|
|---|
| 63 | If there is no room, close of the current frag with a ".fill 0"
|
|---|
| 64 | and begin a new frag. Unless the new frag has nchars chars available
|
|---|
| 65 | do not return. Do not set up any fields of *now_frag. */
|
|---|
| 66 |
|
|---|
| 67 | void
|
|---|
| 68 | frag_grow (nchars)
|
|---|
| 69 | unsigned int nchars;
|
|---|
| 70 | {
|
|---|
| 71 | if (obstack_room (&frchain_now->frch_obstack) < nchars)
|
|---|
| 72 | {
|
|---|
| 73 | unsigned int n;
|
|---|
| 74 | long oldc;
|
|---|
| 75 |
|
|---|
| 76 | frag_wane (frag_now);
|
|---|
| 77 | frag_new (0);
|
|---|
| 78 | oldc = frchain_now->frch_obstack.chunk_size;
|
|---|
| 79 | frchain_now->frch_obstack.chunk_size = 2 * nchars + SIZEOF_STRUCT_FRAG;
|
|---|
| 80 | if (frchain_now->frch_obstack.chunk_size > 0)
|
|---|
| 81 | while ((n = obstack_room (&frchain_now->frch_obstack)) < nchars
|
|---|
| 82 | && (unsigned long) frchain_now->frch_obstack.chunk_size > nchars)
|
|---|
| 83 | {
|
|---|
| 84 | frag_wane (frag_now);
|
|---|
| 85 | frag_new (0);
|
|---|
| 86 | }
|
|---|
| 87 | frchain_now->frch_obstack.chunk_size = oldc;
|
|---|
| 88 | }
|
|---|
| 89 | if (obstack_room (&frchain_now->frch_obstack) < nchars)
|
|---|
| 90 | as_fatal (_("can't extend frag %u chars"), nchars);
|
|---|
| 91 | }
|
|---|
| 92 | |
|---|
| 93 |
|
|---|
| 94 | /* Call this to close off a completed frag, and start up a new (empty)
|
|---|
| 95 | frag, in the same subsegment as the old frag.
|
|---|
| 96 | [frchain_now remains the same but frag_now is updated.]
|
|---|
| 97 | Because this calculates the correct value of fr_fix by
|
|---|
| 98 | looking at the obstack 'frags', it needs to know how many
|
|---|
| 99 | characters at the end of the old frag belong to the maximal
|
|---|
| 100 | variable part; The rest must belong to fr_fix.
|
|---|
| 101 | It doesn't actually set up the old frag's fr_var. You may have
|
|---|
| 102 | set fr_var == 1, but allocated 10 chars to the end of the frag;
|
|---|
| 103 | In this case you pass old_frags_var_max_size == 10.
|
|---|
| 104 | In fact, you may use fr_var for something totally unrelated to the
|
|---|
| 105 | size of the variable part of the frag; None of the generic frag
|
|---|
| 106 | handling code makes use of fr_var.
|
|---|
| 107 |
|
|---|
| 108 | Make a new frag, initialising some components. Link new frag at end
|
|---|
| 109 | of frchain_now. */
|
|---|
| 110 |
|
|---|
| 111 | void
|
|---|
| 112 | frag_new (old_frags_var_max_size)
|
|---|
| 113 | /* Number of chars (already allocated on obstack frags) in
|
|---|
| 114 | variable_length part of frag. */
|
|---|
| 115 | int old_frags_var_max_size;
|
|---|
| 116 | {
|
|---|
| 117 | fragS *former_last_fragP;
|
|---|
| 118 | frchainS *frchP;
|
|---|
| 119 |
|
|---|
| 120 | assert (frchain_now->frch_last == frag_now);
|
|---|
| 121 |
|
|---|
| 122 | /* Fix up old frag's fr_fix. */
|
|---|
| 123 | frag_now->fr_fix = frag_now_fix_octets () - old_frags_var_max_size;
|
|---|
| 124 | /* Make sure its type is valid. */
|
|---|
| 125 | assert (frag_now->fr_type != 0);
|
|---|
| 126 |
|
|---|
| 127 | /* This will align the obstack so the next struct we allocate on it
|
|---|
| 128 | will begin at a correct boundary. */
|
|---|
| 129 | obstack_finish (&frchain_now->frch_obstack);
|
|---|
| 130 | frchP = frchain_now;
|
|---|
| 131 | know (frchP);
|
|---|
| 132 | former_last_fragP = frchP->frch_last;
|
|---|
| 133 | assert (former_last_fragP != 0);
|
|---|
| 134 | assert (former_last_fragP == frag_now);
|
|---|
| 135 | frag_now = frag_alloc (&frchP->frch_obstack);
|
|---|
| 136 |
|
|---|
| 137 | as_where (&frag_now->fr_file, &frag_now->fr_line);
|
|---|
| 138 |
|
|---|
| 139 | /* Generally, frag_now->points to an address rounded up to next
|
|---|
| 140 | alignment. However, characters will add to obstack frags
|
|---|
| 141 | IMMEDIATELY after the struct frag, even if they are not starting
|
|---|
| 142 | at an alignment address. */
|
|---|
| 143 | former_last_fragP->fr_next = frag_now;
|
|---|
| 144 | frchP->frch_last = frag_now;
|
|---|
| 145 |
|
|---|
| 146 | #ifndef NO_LISTING
|
|---|
| 147 | {
|
|---|
| 148 | extern struct list_info_struct *listing_tail;
|
|---|
| 149 | frag_now->line = listing_tail;
|
|---|
| 150 | }
|
|---|
| 151 | #endif
|
|---|
| 152 |
|
|---|
| 153 | assert (frchain_now->frch_last == frag_now);
|
|---|
| 154 |
|
|---|
| 155 | frag_now->fr_next = NULL;
|
|---|
| 156 | }
|
|---|
| 157 | |
|---|
| 158 |
|
|---|
| 159 | /* Start a new frag unless we have n more chars of room in the current frag.
|
|---|
| 160 | Close off the old frag with a .fill 0.
|
|---|
| 161 |
|
|---|
| 162 | Return the address of the 1st char to write into. Advance
|
|---|
| 163 | frag_now_growth past the new chars. */
|
|---|
| 164 |
|
|---|
| 165 | char *
|
|---|
| 166 | frag_more (nchars)
|
|---|
| 167 | int nchars;
|
|---|
| 168 | {
|
|---|
| 169 | register char *retval;
|
|---|
| 170 |
|
|---|
| 171 | if (now_seg == absolute_section)
|
|---|
| 172 | {
|
|---|
| 173 | as_bad (_("attempt to allocate data in absolute section"));
|
|---|
| 174 | subseg_set (text_section, 0);
|
|---|
| 175 | }
|
|---|
| 176 |
|
|---|
| 177 | if (mri_common_symbol != NULL)
|
|---|
| 178 | {
|
|---|
| 179 | as_bad (_("attempt to allocate data in common section"));
|
|---|
| 180 | mri_common_symbol = NULL;
|
|---|
| 181 | }
|
|---|
| 182 |
|
|---|
| 183 | frag_grow (nchars);
|
|---|
| 184 | retval = obstack_next_free (&frchain_now->frch_obstack);
|
|---|
| 185 | obstack_blank_fast (&frchain_now->frch_obstack, nchars);
|
|---|
| 186 | return (retval);
|
|---|
| 187 | }
|
|---|
| 188 | |
|---|
| 189 |
|
|---|
| 190 | /* Start a new frag unless we have max_chars more chars of room in the
|
|---|
| 191 | current frag. Close off the old frag with a .fill 0.
|
|---|
| 192 |
|
|---|
| 193 | Set up a machine_dependent relaxable frag, then start a new frag.
|
|---|
| 194 | Return the address of the 1st char of the var part of the old frag
|
|---|
| 195 | to write into. */
|
|---|
| 196 |
|
|---|
| 197 | char *
|
|---|
| 198 | frag_var (type, max_chars, var, subtype, symbol, offset, opcode)
|
|---|
| 199 | relax_stateT type;
|
|---|
| 200 | int max_chars;
|
|---|
| 201 | int var;
|
|---|
| 202 | relax_substateT subtype;
|
|---|
| 203 | symbolS *symbol;
|
|---|
| 204 | offsetT offset;
|
|---|
| 205 | char *opcode;
|
|---|
| 206 | {
|
|---|
| 207 | register char *retval;
|
|---|
| 208 |
|
|---|
| 209 | frag_grow (max_chars);
|
|---|
| 210 | retval = obstack_next_free (&frchain_now->frch_obstack);
|
|---|
| 211 | obstack_blank_fast (&frchain_now->frch_obstack, max_chars);
|
|---|
| 212 | frag_now->fr_var = var;
|
|---|
| 213 | frag_now->fr_type = type;
|
|---|
| 214 | frag_now->fr_subtype = subtype;
|
|---|
| 215 | frag_now->fr_symbol = symbol;
|
|---|
| 216 | frag_now->fr_offset = offset;
|
|---|
| 217 | frag_now->fr_opcode = opcode;
|
|---|
| 218 | #ifdef USING_CGEN
|
|---|
| 219 | frag_now->fr_cgen.insn = 0;
|
|---|
| 220 | frag_now->fr_cgen.opindex = 0;
|
|---|
| 221 | frag_now->fr_cgen.opinfo = 0;
|
|---|
| 222 | #endif
|
|---|
| 223 | #ifdef TC_FRAG_INIT
|
|---|
| 224 | TC_FRAG_INIT (frag_now);
|
|---|
| 225 | #endif
|
|---|
| 226 | as_where (&frag_now->fr_file, &frag_now->fr_line);
|
|---|
| 227 | frag_new (max_chars);
|
|---|
| 228 | return (retval);
|
|---|
| 229 | }
|
|---|
| 230 | |
|---|
| 231 |
|
|---|
| 232 | /* OVE: This variant of frag_var assumes that space for the tail has been
|
|---|
| 233 | allocated by caller.
|
|---|
| 234 | No call to frag_grow is done. */
|
|---|
| 235 |
|
|---|
| 236 | char *
|
|---|
| 237 | frag_variant (type, max_chars, var, subtype, symbol, offset, opcode)
|
|---|
| 238 | relax_stateT type;
|
|---|
| 239 | int max_chars;
|
|---|
| 240 | int var;
|
|---|
| 241 | relax_substateT subtype;
|
|---|
| 242 | symbolS *symbol;
|
|---|
| 243 | offsetT offset;
|
|---|
| 244 | char *opcode;
|
|---|
| 245 | {
|
|---|
| 246 | register char *retval;
|
|---|
| 247 |
|
|---|
| 248 | retval = obstack_next_free (&frchain_now->frch_obstack);
|
|---|
| 249 | frag_now->fr_var = var;
|
|---|
| 250 | frag_now->fr_type = type;
|
|---|
| 251 | frag_now->fr_subtype = subtype;
|
|---|
| 252 | frag_now->fr_symbol = symbol;
|
|---|
| 253 | frag_now->fr_offset = offset;
|
|---|
| 254 | frag_now->fr_opcode = opcode;
|
|---|
| 255 | #ifdef USING_CGEN
|
|---|
| 256 | frag_now->fr_cgen.insn = 0;
|
|---|
| 257 | frag_now->fr_cgen.opindex = 0;
|
|---|
| 258 | frag_now->fr_cgen.opinfo = 0;
|
|---|
| 259 | #endif
|
|---|
| 260 | #ifdef TC_FRAG_INIT
|
|---|
| 261 | TC_FRAG_INIT (frag_now);
|
|---|
| 262 | #endif
|
|---|
| 263 | as_where (&frag_now->fr_file, &frag_now->fr_line);
|
|---|
| 264 | frag_new (max_chars);
|
|---|
| 265 | return (retval);
|
|---|
| 266 | }
|
|---|
| 267 | |
|---|
| 268 |
|
|---|
| 269 | /* Reduce the variable end of a frag to a harmless state. */
|
|---|
| 270 |
|
|---|
| 271 | void
|
|---|
| 272 | frag_wane (fragP)
|
|---|
| 273 | register fragS *fragP;
|
|---|
| 274 | {
|
|---|
| 275 | fragP->fr_type = rs_fill;
|
|---|
| 276 | fragP->fr_offset = 0;
|
|---|
| 277 | fragP->fr_var = 0;
|
|---|
| 278 | }
|
|---|
| 279 | |
|---|
| 280 |
|
|---|
| 281 | /* Make an alignment frag. The size of this frag will be adjusted to
|
|---|
| 282 | force the next frag to have the appropriate alignment. ALIGNMENT
|
|---|
| 283 | is the power of two to which to align. FILL_CHARACTER is the
|
|---|
| 284 | character to use to fill in any bytes which are skipped. MAX is
|
|---|
| 285 | the maximum number of characters to skip when doing the alignment,
|
|---|
| 286 | or 0 if there is no maximum. */
|
|---|
| 287 |
|
|---|
| 288 | void
|
|---|
| 289 | frag_align (alignment, fill_character, max)
|
|---|
| 290 | int alignment;
|
|---|
| 291 | int fill_character;
|
|---|
| 292 | int max;
|
|---|
| 293 | {
|
|---|
| 294 | if (now_seg == absolute_section)
|
|---|
| 295 | {
|
|---|
| 296 | addressT new_off;
|
|---|
| 297 | addressT mask;
|
|---|
| 298 |
|
|---|
| 299 | mask = (~(addressT) 0) << alignment;
|
|---|
| 300 | new_off = (abs_section_offset + ~mask) & mask;
|
|---|
| 301 | if (max == 0 || new_off - abs_section_offset <= (addressT) max)
|
|---|
| 302 | abs_section_offset = new_off;
|
|---|
| 303 | }
|
|---|
| 304 | else
|
|---|
| 305 | {
|
|---|
| 306 | char *p;
|
|---|
| 307 |
|
|---|
| 308 | p = frag_var (rs_align, 1, 1, (relax_substateT) max,
|
|---|
| 309 | (symbolS *) 0, (offsetT) alignment, (char *) 0);
|
|---|
| 310 | *p = fill_character;
|
|---|
| 311 | }
|
|---|
| 312 | }
|
|---|
| 313 |
|
|---|
| 314 | /* Make an alignment frag like frag_align, but fill with a repeating
|
|---|
| 315 | pattern rather than a single byte. ALIGNMENT is the power of two
|
|---|
| 316 | to which to align. FILL_PATTERN is the fill pattern to repeat in
|
|---|
| 317 | the bytes which are skipped. N_FILL is the number of bytes in
|
|---|
| 318 | FILL_PATTERN. MAX is the maximum number of characters to skip when
|
|---|
| 319 | doing the alignment, or 0 if there is no maximum. */
|
|---|
| 320 |
|
|---|
| 321 | void
|
|---|
| 322 | frag_align_pattern (alignment, fill_pattern, n_fill, max)
|
|---|
| 323 | int alignment;
|
|---|
| 324 | const char *fill_pattern;
|
|---|
| 325 | int n_fill;
|
|---|
| 326 | int max;
|
|---|
| 327 | {
|
|---|
| 328 | char *p;
|
|---|
| 329 |
|
|---|
| 330 | p = frag_var (rs_align, n_fill, n_fill, (relax_substateT) max,
|
|---|
| 331 | (symbolS *) 0, (offsetT) alignment, (char *) 0);
|
|---|
| 332 | memcpy (p, fill_pattern, n_fill);
|
|---|
| 333 | }
|
|---|
| 334 |
|
|---|
| 335 | /* The NOP_OPCODE is for the alignment fill value. Fill it with a nop
|
|---|
| 336 | instruction so that the disassembler does not choke on it. */
|
|---|
| 337 | #ifndef NOP_OPCODE
|
|---|
| 338 | #define NOP_OPCODE 0x00
|
|---|
| 339 | #endif
|
|---|
| 340 |
|
|---|
| 341 | /* Use this to restrict the amount of memory allocated for representing
|
|---|
| 342 | the alignment code. Needs to be large enough to hold any fixed sized
|
|---|
| 343 | prologue plus the replicating portion. */
|
|---|
| 344 | #ifndef MAX_MEM_FOR_RS_ALIGN_CODE
|
|---|
| 345 | /* Assume that if HANDLE_ALIGN is not defined then no special action
|
|---|
| 346 | is required to code fill, which means that we get just repeat the
|
|---|
| 347 | one NOP_OPCODE byte. */
|
|---|
| 348 | # ifndef HANDLE_ALIGN
|
|---|
| 349 | # define MAX_MEM_FOR_RS_ALIGN_CODE 1
|
|---|
| 350 | # else
|
|---|
| 351 | # define MAX_MEM_FOR_RS_ALIGN_CODE ((1 << alignment) - 1)
|
|---|
| 352 | # endif
|
|---|
| 353 | #endif
|
|---|
| 354 |
|
|---|
| 355 | void
|
|---|
| 356 | frag_align_code (alignment, max)
|
|---|
| 357 | int alignment;
|
|---|
| 358 | int max;
|
|---|
| 359 | {
|
|---|
| 360 | char *p;
|
|---|
| 361 |
|
|---|
| 362 | p = frag_var (rs_align_code, MAX_MEM_FOR_RS_ALIGN_CODE, 1,
|
|---|
| 363 | (relax_substateT) max, (symbolS *) 0,
|
|---|
| 364 | (offsetT) alignment, (char *) 0);
|
|---|
| 365 | *p = NOP_OPCODE;
|
|---|
| 366 | }
|
|---|
| 367 |
|
|---|
| 368 | addressT
|
|---|
| 369 | frag_now_fix_octets ()
|
|---|
| 370 | {
|
|---|
| 371 | if (now_seg == absolute_section)
|
|---|
| 372 | return abs_section_offset;
|
|---|
| 373 |
|
|---|
| 374 | return ((char *) obstack_next_free (&frchain_now->frch_obstack)
|
|---|
| 375 | - frag_now->fr_literal);
|
|---|
| 376 | }
|
|---|
| 377 |
|
|---|
| 378 | addressT
|
|---|
| 379 | frag_now_fix ()
|
|---|
| 380 | {
|
|---|
| 381 | return frag_now_fix_octets () / OCTETS_PER_BYTE;
|
|---|
| 382 | }
|
|---|
| 383 |
|
|---|
| 384 | void
|
|---|
| 385 | frag_append_1_char (datum)
|
|---|
| 386 | int datum;
|
|---|
| 387 | {
|
|---|
| 388 | if (obstack_room (&frchain_now->frch_obstack) <= 1)
|
|---|
| 389 | {
|
|---|
| 390 | frag_wane (frag_now);
|
|---|
| 391 | frag_new (0);
|
|---|
| 392 | }
|
|---|
| 393 | obstack_1grow (&frchain_now->frch_obstack, datum);
|
|---|
| 394 | }
|
|---|