| 1 | /* read.c - read a source file - |
| 2 | Copyright (C) 1986-2020 Free Software Foundation, Inc. |
| 3 | |
| 4 | This file is part of GAS, the GNU Assembler. |
| 5 | |
| 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 3, or (at your option) |
| 9 | any later version. |
| 10 | |
| 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. |
| 15 | |
| 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 the Free |
| 18 | Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA |
| 19 | 02110-1301, USA. */ |
| 20 | |
| 21 | /* If your chars aren't 8 bits, you will change this a bit (eg. to 0xFF). |
| 22 | But then, GNU isn't supposed to run on your machine anyway. |
| 23 | (RMS is so shortsighted sometimes.) */ |
| 24 | #define MASK_CHAR ((int)(unsigned char) -1) |
| 25 | |
| 26 | /* This is the largest known floating point format (for now). It will |
| 27 | grow when we do 4361 style flonums. */ |
| 28 | #define MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT (16) |
| 29 | |
| 30 | /* Routines that read assembler source text to build spaghetti in memory. |
| 31 | Another group of these functions is in the expr.c module. */ |
| 32 | |
| 33 | #include "as.h" |
| 34 | #include "safe-ctype.h" |
| 35 | #include "subsegs.h" |
| 36 | #include "sb.h" |
| 37 | #include "macro.h" |
| 38 | #include "obstack.h" |
| 39 | #include "ecoff.h" |
| 40 | #include "dw2gencfi.h" |
| 41 | #include "wchar.h" |
| 42 | |
| 43 | #include <limits.h> |
| 44 | |
| 45 | #ifndef TC_START_LABEL |
| 46 | #define TC_START_LABEL(STR, NUL_CHAR, NEXT_CHAR) (NEXT_CHAR == ':') |
| 47 | #endif |
| 48 | |
| 49 | /* Set by the object-format or the target. */ |
| 50 | #ifndef TC_IMPLICIT_LCOMM_ALIGNMENT |
| 51 | #define TC_IMPLICIT_LCOMM_ALIGNMENT(SIZE, P2VAR) \ |
| 52 | do \ |
| 53 | { \ |
| 54 | if ((SIZE) >= 8) \ |
| 55 | (P2VAR) = 3; \ |
| 56 | else if ((SIZE) >= 4) \ |
| 57 | (P2VAR) = 2; \ |
| 58 | else if ((SIZE) >= 2) \ |
| 59 | (P2VAR) = 1; \ |
| 60 | else \ |
| 61 | (P2VAR) = 0; \ |
| 62 | } \ |
| 63 | while (0) |
| 64 | #endif |
| 65 | |
| 66 | char *input_line_pointer; /*->next char of source file to parse. */ |
| 67 | bfd_boolean input_from_string = FALSE; |
| 68 | |
| 69 | #if BITS_PER_CHAR != 8 |
| 70 | /* The following table is indexed by[(char)] and will break if |
| 71 | a char does not have exactly 256 states (hopefully 0:255!)! */ |
| 72 | die horribly; |
| 73 | #endif |
| 74 | |
| 75 | #ifndef LEX_AT |
| 76 | #define LEX_AT 0 |
| 77 | #endif |
| 78 | |
| 79 | #ifndef LEX_BR |
| 80 | /* The RS/6000 assembler uses {,},[,] as parts of symbol names. */ |
| 81 | #define LEX_BR 0 |
| 82 | #endif |
| 83 | |
| 84 | #ifndef LEX_PCT |
| 85 | /* The Delta 68k assembler permits % inside label names. */ |
| 86 | #define LEX_PCT 0 |
| 87 | #endif |
| 88 | |
| 89 | #ifndef LEX_QM |
| 90 | /* The PowerPC Windows NT assemblers permits ? inside label names. */ |
| 91 | #define LEX_QM 0 |
| 92 | #endif |
| 93 | |
| 94 | #ifndef LEX_HASH |
| 95 | /* The IA-64 assembler uses # as a suffix designating a symbol. We include |
| 96 | it in the symbol and strip it out in tc_canonicalize_symbol_name. */ |
| 97 | #define LEX_HASH 0 |
| 98 | #endif |
| 99 | |
| 100 | #ifndef LEX_DOLLAR |
| 101 | #define LEX_DOLLAR 3 |
| 102 | #endif |
| 103 | |
| 104 | #ifndef LEX_TILDE |
| 105 | /* The Delta 68k assembler permits ~ at start of label names. */ |
| 106 | #define LEX_TILDE 0 |
| 107 | #endif |
| 108 | |
| 109 | /* Used by is_... macros. our ctype[]. */ |
| 110 | char lex_type[256] = { |
| 111 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* @ABCDEFGHIJKLMNO */ |
| 112 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* PQRSTUVWXYZ[\]^_ */ |
| 113 | 0, 0, 0, LEX_HASH, LEX_DOLLAR, LEX_PCT, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, /* _!"#$%&'()*+,-./ */ |
| 114 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, LEX_QM, /* 0123456789:;<=>? */ |
| 115 | LEX_AT, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, /* @ABCDEFGHIJKLMNO */ |
| 116 | 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, LEX_BR, 0, LEX_BR, 0, 3, /* PQRSTUVWXYZ[\]^_ */ |
| 117 | 0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, /* `abcdefghijklmno */ |
| 118 | 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, LEX_BR, 0, LEX_BR, LEX_TILDE, 0, /* pqrstuvwxyz{|}~. */ |
| 119 | 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
| 120 | 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
| 121 | 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
| 122 | 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
| 123 | 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
| 124 | 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
| 125 | 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
| 126 | 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 |
| 127 | }; |
| 128 | |
| 129 | /* In: a character. |
| 130 | Out: 1 if this character ends a line. |
| 131 | 2 if this character is a line separator. */ |
| 132 | char is_end_of_line[256] = { |
| 133 | #ifdef CR_EOL |
| 134 | 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, /* @abcdefghijklmno */ |
| 135 | #else |
| 136 | 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, /* @abcdefghijklmno */ |
| 137 | #endif |
| 138 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 139 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* _!"#$%&'()*+,-./ */ |
| 140 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0123456789:;<=>? */ |
| 141 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 142 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 143 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 144 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 145 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 146 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 147 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 148 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 149 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 150 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 151 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */ |
| 152 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 /* */ |
| 153 | }; |
| 154 | |
| 155 | #ifndef TC_CASE_SENSITIVE |
| 156 | char original_case_string[128]; |
| 157 | #endif |
| 158 | |
| 159 | /* Functions private to this file. */ |
| 160 | |
| 161 | static char *buffer; /* 1st char of each buffer of lines is here. */ |
| 162 | static char *buffer_limit; /*->1 + last char in buffer. */ |
| 163 | |
| 164 | /* TARGET_BYTES_BIG_ENDIAN is required to be defined to either 0 or 1 |
| 165 | in the tc-<CPU>.h file. See the "Porting GAS" section of the |
| 166 | internals manual. */ |
| 167 | int target_big_endian = TARGET_BYTES_BIG_ENDIAN; |
| 168 | |
| 169 | /* Variables for handling include file directory table. */ |
| 170 | |
| 171 | /* Table of pointers to directories to search for .include's. */ |
| 172 | const char **include_dirs; |
| 173 | |
| 174 | /* How many are in the table. */ |
| 175 | int include_dir_count; |
| 176 | |
| 177 | /* Length of longest in table. */ |
| 178 | int include_dir_maxlen = 1; |
| 179 | |
| 180 | #ifndef WORKING_DOT_WORD |
| 181 | struct broken_word *broken_words; |
| 182 | int new_broken_words; |
| 183 | #endif |
| 184 | |
| 185 | /* The current offset into the absolute section. We don't try to |
| 186 | build frags in the absolute section, since no data can be stored |
| 187 | there. We just keep track of the current offset. */ |
| 188 | addressT abs_section_offset; |
| 189 | |
| 190 | /* If this line had an MRI style label, it is stored in this variable. |
| 191 | This is used by some of the MRI pseudo-ops. */ |
| 192 | symbolS *line_label; |
| 193 | |
| 194 | /* This global variable is used to support MRI common sections. We |
| 195 | translate such sections into a common symbol. This variable is |
| 196 | non-NULL when we are in an MRI common section. */ |
| 197 | symbolS *mri_common_symbol; |
| 198 | |
| 199 | /* In MRI mode, after a dc.b pseudo-op with an odd number of bytes, we |
| 200 | need to align to an even byte boundary unless the next pseudo-op is |
| 201 | dc.b, ds.b, or dcb.b. This variable is set to 1 if an alignment |
| 202 | may be needed. */ |
| 203 | static int mri_pending_align; |
| 204 | |
| 205 | #ifndef NO_LISTING |
| 206 | #ifdef OBJ_ELF |
| 207 | /* This variable is set to be non-zero if the next string we see might |
| 208 | be the name of the source file in DWARF debugging information. See |
| 209 | the comment in emit_expr for the format we look for. */ |
| 210 | static int dwarf_file_string; |
| 211 | #endif |
| 212 | #endif |
| 213 | |
| 214 | /* If the target defines the md_frag_max_var hook then we know |
| 215 | enough to implement the .bundle_align_mode features. */ |
| 216 | #ifdef md_frag_max_var |
| 217 | # define HANDLE_BUNDLE |
| 218 | #endif |
| 219 | |
| 220 | #ifdef HANDLE_BUNDLE |
| 221 | /* .bundle_align_mode sets this. Normally it's zero. When nonzero, |
| 222 | it's the exponent of the bundle size, and aligned instruction bundle |
| 223 | mode is in effect. */ |
| 224 | static unsigned int bundle_align_p2; |
| 225 | |
| 226 | /* These are set by .bundle_lock and .bundle_unlock. .bundle_lock sets |
| 227 | bundle_lock_frag to frag_now and then starts a new frag with |
| 228 | frag_align_code. At the same time, bundle_lock_frain gets frchain_now, |
| 229 | so that .bundle_unlock can verify that we didn't change segments. |
| 230 | .bundle_unlock resets both to NULL. If we detect a bundling violation, |
| 231 | then we reset bundle_lock_frchain to NULL as an indicator that we've |
| 232 | already diagnosed the error with as_bad and don't need a cascade of |
| 233 | redundant errors, but bundle_lock_frag remains set to indicate that |
| 234 | we are expecting to see .bundle_unlock. */ |
| 235 | static fragS *bundle_lock_frag; |
| 236 | static frchainS *bundle_lock_frchain; |
| 237 | |
| 238 | /* This is incremented by .bundle_lock and decremented by .bundle_unlock, |
| 239 | to allow nesting. */ |
| 240 | static unsigned int bundle_lock_depth; |
| 241 | #endif |
| 242 | |
| 243 | static void do_s_func (int end_p, const char *default_prefix); |
| 244 | static void s_align (int, int); |
| 245 | static void s_altmacro (int); |
| 246 | static void s_bad_end (int); |
| 247 | static void s_reloc (int); |
| 248 | static int hex_float (int, char *); |
| 249 | static segT get_known_segmented_expression (expressionS * expP); |
| 250 | static void pobegin (void); |
| 251 | static size_t get_non_macro_line_sb (sb *); |
| 252 | static void generate_file_debug (void); |
| 253 | static char *_find_end_of_line (char *, int, int, int); |
| 254 | \f |
| 255 | void |
| 256 | read_begin (void) |
| 257 | { |
| 258 | const char *p; |
| 259 | |
| 260 | pobegin (); |
| 261 | obj_read_begin_hook (); |
| 262 | |
| 263 | /* Something close -- but not too close -- to a multiple of 1024. |
| 264 | The debugging malloc I'm using has 24 bytes of overhead. */ |
| 265 | obstack_begin (¬es, chunksize); |
| 266 | obstack_begin (&cond_obstack, chunksize); |
| 267 | |
| 268 | #ifndef tc_line_separator_chars |
| 269 | #define tc_line_separator_chars line_separator_chars |
| 270 | #endif |
| 271 | /* Use machine dependent syntax. */ |
| 272 | for (p = tc_line_separator_chars; *p; p++) |
| 273 | is_end_of_line[(unsigned char) *p] = 2; |
| 274 | /* Use more. FIXME-SOMEDAY. */ |
| 275 | |
| 276 | if (flag_mri) |
| 277 | lex_type['?'] = 3; |
| 278 | } |
| 279 | \f |
| 280 | #ifndef TC_ADDRESS_BYTES |
| 281 | #define TC_ADDRESS_BYTES address_bytes |
| 282 | |
| 283 | static inline int |
| 284 | address_bytes (void) |
| 285 | { |
| 286 | /* Choose smallest of 1, 2, 4, 8 bytes that is large enough to |
| 287 | contain an address. */ |
| 288 | int n = (stdoutput->arch_info->bits_per_address - 1) / 8; |
| 289 | n |= n >> 1; |
| 290 | n |= n >> 2; |
| 291 | n += 1; |
| 292 | return n; |
| 293 | } |
| 294 | #endif |
| 295 | |
| 296 | /* Set up pseudo-op tables. */ |
| 297 | |
| 298 | struct po_entry |
| 299 | { |
| 300 | const char *poc_name; |
| 301 | |
| 302 | const pseudo_typeS *pop; |
| 303 | }; |
| 304 | |
| 305 | typedef struct po_entry po_entry_t; |
| 306 | |
| 307 | /* Hash function for a po_entry. */ |
| 308 | |
| 309 | static hashval_t |
| 310 | hash_po_entry (const void *e) |
| 311 | { |
| 312 | const po_entry_t *entry = (const po_entry_t *) e; |
| 313 | return htab_hash_string (entry->poc_name); |
| 314 | } |
| 315 | |
| 316 | /* Equality function for a po_entry. */ |
| 317 | |
| 318 | static int |
| 319 | eq_po_entry (const void *a, const void *b) |
| 320 | { |
| 321 | const po_entry_t *ea = (const po_entry_t *) a; |
| 322 | const po_entry_t *eb = (const po_entry_t *) b; |
| 323 | |
| 324 | return strcmp (ea->poc_name, eb->poc_name) == 0; |
| 325 | } |
| 326 | |
| 327 | static po_entry_t * |
| 328 | po_entry_alloc (const char *poc_name, const pseudo_typeS *pop) |
| 329 | { |
| 330 | po_entry_t *entry = XNEW (po_entry_t); |
| 331 | entry->poc_name = poc_name; |
| 332 | entry->pop = pop; |
| 333 | return entry; |
| 334 | } |
| 335 | |
| 336 | static const pseudo_typeS * |
| 337 | po_entry_find (htab_t table, const char *poc_name) |
| 338 | { |
| 339 | po_entry_t needle = { poc_name, NULL }; |
| 340 | po_entry_t *entry = htab_find (table, &needle); |
| 341 | return entry != NULL ? entry->pop : NULL; |
| 342 | } |
| 343 | |
| 344 | static struct htab *po_hash; |
| 345 | |
| 346 | static const pseudo_typeS potable[] = { |
| 347 | {"abort", s_abort, 0}, |
| 348 | {"align", s_align_ptwo, 0}, |
| 349 | {"altmacro", s_altmacro, 1}, |
| 350 | {"ascii", stringer, 8+0}, |
| 351 | {"asciz", stringer, 8+1}, |
| 352 | {"balign", s_align_bytes, 0}, |
| 353 | {"balignw", s_align_bytes, -2}, |
| 354 | {"balignl", s_align_bytes, -4}, |
| 355 | /* block */ |
| 356 | #ifdef HANDLE_BUNDLE |
| 357 | {"bundle_align_mode", s_bundle_align_mode, 0}, |
| 358 | {"bundle_lock", s_bundle_lock, 0}, |
| 359 | {"bundle_unlock", s_bundle_unlock, 0}, |
| 360 | #endif |
| 361 | {"byte", cons, 1}, |
| 362 | {"comm", s_comm, 0}, |
| 363 | {"common", s_mri_common, 0}, |
| 364 | {"common.s", s_mri_common, 1}, |
| 365 | {"data", s_data, 0}, |
| 366 | {"dc", cons, 2}, |
| 367 | #ifdef TC_ADDRESS_BYTES |
| 368 | {"dc.a", cons, 0}, |
| 369 | #endif |
| 370 | {"dc.b", cons, 1}, |
| 371 | {"dc.d", float_cons, 'd'}, |
| 372 | {"dc.l", cons, 4}, |
| 373 | {"dc.s", float_cons, 'f'}, |
| 374 | {"dc.w", cons, 2}, |
| 375 | {"dc.x", float_cons, 'x'}, |
| 376 | {"dcb", s_space, 2}, |
| 377 | {"dcb.b", s_space, 1}, |
| 378 | {"dcb.d", s_float_space, 'd'}, |
| 379 | {"dcb.l", s_space, 4}, |
| 380 | {"dcb.s", s_float_space, 'f'}, |
| 381 | {"dcb.w", s_space, 2}, |
| 382 | {"dcb.x", s_float_space, 'x'}, |
| 383 | {"ds", s_space, 2}, |
| 384 | {"ds.b", s_space, 1}, |
| 385 | {"ds.d", s_space, 8}, |
| 386 | {"ds.l", s_space, 4}, |
| 387 | {"ds.p", s_space, 12}, |
| 388 | {"ds.s", s_space, 4}, |
| 389 | {"ds.w", s_space, 2}, |
| 390 | {"ds.x", s_space, 12}, |
| 391 | {"debug", s_ignore, 0}, |
| 392 | #ifdef S_SET_DESC |
| 393 | {"desc", s_desc, 0}, |
| 394 | #endif |
| 395 | /* dim */ |
| 396 | {"double", float_cons, 'd'}, |
| 397 | /* dsect */ |
| 398 | {"eject", listing_eject, 0}, /* Formfeed listing. */ |
| 399 | {"else", s_else, 0}, |
| 400 | {"elsec", s_else, 0}, |
| 401 | {"elseif", s_elseif, (int) O_ne}, |
| 402 | {"end", s_end, 0}, |
| 403 | {"endc", s_endif, 0}, |
| 404 | {"endfunc", s_func, 1}, |
| 405 | {"endif", s_endif, 0}, |
| 406 | {"endm", s_bad_end, 0}, |
| 407 | {"endr", s_bad_end, 1}, |
| 408 | /* endef */ |
| 409 | {"equ", s_set, 0}, |
| 410 | {"equiv", s_set, 1}, |
| 411 | {"eqv", s_set, -1}, |
| 412 | {"err", s_err, 0}, |
| 413 | {"error", s_errwarn, 1}, |
| 414 | {"exitm", s_mexit, 0}, |
| 415 | /* extend */ |
| 416 | {"extern", s_ignore, 0}, /* We treat all undef as ext. */ |
| 417 | {"appfile", s_app_file, 1}, |
| 418 | {"appline", s_app_line, 1}, |
| 419 | {"fail", s_fail, 0}, |
| 420 | {"file", s_app_file, 0}, |
| 421 | {"fill", s_fill, 0}, |
| 422 | {"float", float_cons, 'f'}, |
| 423 | {"format", s_ignore, 0}, |
| 424 | {"func", s_func, 0}, |
| 425 | {"global", s_globl, 0}, |
| 426 | {"globl", s_globl, 0}, |
| 427 | {"hword", cons, 2}, |
| 428 | {"if", s_if, (int) O_ne}, |
| 429 | {"ifb", s_ifb, 1}, |
| 430 | {"ifc", s_ifc, 0}, |
| 431 | {"ifdef", s_ifdef, 0}, |
| 432 | {"ifeq", s_if, (int) O_eq}, |
| 433 | {"ifeqs", s_ifeqs, 0}, |
| 434 | {"ifge", s_if, (int) O_ge}, |
| 435 | {"ifgt", s_if, (int) O_gt}, |
| 436 | {"ifle", s_if, (int) O_le}, |
| 437 | {"iflt", s_if, (int) O_lt}, |
| 438 | {"ifnb", s_ifb, 0}, |
| 439 | {"ifnc", s_ifc, 1}, |
| 440 | {"ifndef", s_ifdef, 1}, |
| 441 | {"ifne", s_if, (int) O_ne}, |
| 442 | {"ifnes", s_ifeqs, 1}, |
| 443 | {"ifnotdef", s_ifdef, 1}, |
| 444 | {"incbin", s_incbin, 0}, |
| 445 | {"include", s_include, 0}, |
| 446 | {"int", cons, 4}, |
| 447 | {"irp", s_irp, 0}, |
| 448 | {"irep", s_irp, 0}, |
| 449 | {"irpc", s_irp, 1}, |
| 450 | {"irepc", s_irp, 1}, |
| 451 | {"lcomm", s_lcomm, 0}, |
| 452 | {"lflags", s_ignore, 0}, /* Listing flags. */ |
| 453 | {"linefile", s_app_line, 0}, |
| 454 | {"linkonce", s_linkonce, 0}, |
| 455 | {"list", listing_list, 1}, /* Turn listing on. */ |
| 456 | {"llen", listing_psize, 1}, |
| 457 | {"long", cons, 4}, |
| 458 | {"lsym", s_lsym, 0}, |
| 459 | {"macro", s_macro, 0}, |
| 460 | {"mexit", s_mexit, 0}, |
| 461 | {"mri", s_mri, 0}, |
| 462 | {".mri", s_mri, 0}, /* Special case so .mri works in MRI mode. */ |
| 463 | {"name", s_ignore, 0}, |
| 464 | {"noaltmacro", s_altmacro, 0}, |
| 465 | {"noformat", s_ignore, 0}, |
| 466 | {"nolist", listing_list, 0}, /* Turn listing off. */ |
| 467 | {"nopage", listing_nopage, 0}, |
| 468 | {"nop", s_nop, 0}, |
| 469 | {"nops", s_nops, 0}, |
| 470 | {"octa", cons, 16}, |
| 471 | {"offset", s_struct, 0}, |
| 472 | {"org", s_org, 0}, |
| 473 | {"p2align", s_align_ptwo, 0}, |
| 474 | {"p2alignw", s_align_ptwo, -2}, |
| 475 | {"p2alignl", s_align_ptwo, -4}, |
| 476 | {"page", listing_eject, 0}, |
| 477 | {"plen", listing_psize, 0}, |
| 478 | {"print", s_print, 0}, |
| 479 | {"psize", listing_psize, 0}, /* Set paper size. */ |
| 480 | {"purgem", s_purgem, 0}, |
| 481 | {"quad", cons, 8}, |
| 482 | {"reloc", s_reloc, 0}, |
| 483 | {"rep", s_rept, 0}, |
| 484 | {"rept", s_rept, 0}, |
| 485 | {"rva", s_rva, 4}, |
| 486 | {"sbttl", listing_title, 1}, /* Subtitle of listing. */ |
| 487 | /* scl */ |
| 488 | /* sect */ |
| 489 | {"set", s_set, 0}, |
| 490 | {"short", cons, 2}, |
| 491 | {"single", float_cons, 'f'}, |
| 492 | /* size */ |
| 493 | {"space", s_space, 0}, |
| 494 | {"skip", s_space, 0}, |
| 495 | {"sleb128", s_leb128, 1}, |
| 496 | {"spc", s_ignore, 0}, |
| 497 | {"stabd", s_stab, 'd'}, |
| 498 | {"stabn", s_stab, 'n'}, |
| 499 | {"stabs", s_stab, 's'}, |
| 500 | {"string", stringer, 8+1}, |
| 501 | {"string8", stringer, 8+1}, |
| 502 | {"string16", stringer, 16+1}, |
| 503 | {"string32", stringer, 32+1}, |
| 504 | {"string64", stringer, 64+1}, |
| 505 | {"struct", s_struct, 0}, |
| 506 | /* tag */ |
| 507 | {"text", s_text, 0}, |
| 508 | |
| 509 | /* This is for gcc to use. It's only just been added (2/94), so gcc |
| 510 | won't be able to use it for a while -- probably a year or more. |
| 511 | But once this has been released, check with gcc maintainers |
| 512 | before deleting it or even changing the spelling. */ |
| 513 | {"this_GCC_requires_the_GNU_assembler", s_ignore, 0}, |
| 514 | /* If we're folding case -- done for some targets, not necessarily |
| 515 | all -- the above string in an input file will be converted to |
| 516 | this one. Match it either way... */ |
| 517 | {"this_gcc_requires_the_gnu_assembler", s_ignore, 0}, |
| 518 | |
| 519 | {"title", listing_title, 0}, /* Listing title. */ |
| 520 | {"ttl", listing_title, 0}, |
| 521 | /* type */ |
| 522 | {"uleb128", s_leb128, 0}, |
| 523 | /* use */ |
| 524 | /* val */ |
| 525 | {"xcom", s_comm, 0}, |
| 526 | {"xdef", s_globl, 0}, |
| 527 | {"xref", s_ignore, 0}, |
| 528 | {"xstabs", s_xstab, 's'}, |
| 529 | {"warning", s_errwarn, 0}, |
| 530 | {"weakref", s_weakref, 0}, |
| 531 | {"word", cons, 2}, |
| 532 | {"zero", s_space, 0}, |
| 533 | {NULL, NULL, 0} /* End sentinel. */ |
| 534 | }; |
| 535 | |
| 536 | static offsetT |
| 537 | get_absolute_expr (expressionS *exp) |
| 538 | { |
| 539 | expression_and_evaluate (exp); |
| 540 | |
| 541 | if (exp->X_op != O_constant) |
| 542 | { |
| 543 | if (exp->X_op != O_absent) |
| 544 | as_bad (_("bad or irreducible absolute expression")); |
| 545 | exp->X_add_number = 0; |
| 546 | } |
| 547 | return exp->X_add_number; |
| 548 | } |
| 549 | |
| 550 | offsetT |
| 551 | get_absolute_expression (void) |
| 552 | { |
| 553 | expressionS exp; |
| 554 | |
| 555 | return get_absolute_expr (&exp); |
| 556 | } |
| 557 | |
| 558 | static int pop_override_ok = 0; |
| 559 | static const char *pop_table_name; |
| 560 | |
| 561 | void |
| 562 | pop_insert (const pseudo_typeS *table) |
| 563 | { |
| 564 | const pseudo_typeS *pop; |
| 565 | for (pop = table; pop->poc_name; pop++) |
| 566 | { |
| 567 | po_entry_t *elt = po_entry_alloc (pop->poc_name, pop); |
| 568 | if (htab_insert (po_hash, elt, 0) != NULL) |
| 569 | { |
| 570 | free (elt); |
| 571 | if (!pop_override_ok) |
| 572 | as_fatal (_("error constructing %s pseudo-op table"), |
| 573 | pop_table_name); |
| 574 | } |
| 575 | } |
| 576 | } |
| 577 | |
| 578 | #ifndef md_pop_insert |
| 579 | #define md_pop_insert() pop_insert(md_pseudo_table) |
| 580 | #endif |
| 581 | |
| 582 | #ifndef obj_pop_insert |
| 583 | #define obj_pop_insert() pop_insert(obj_pseudo_table) |
| 584 | #endif |
| 585 | |
| 586 | #ifndef cfi_pop_insert |
| 587 | #define cfi_pop_insert() pop_insert(cfi_pseudo_table) |
| 588 | #endif |
| 589 | |
| 590 | static void |
| 591 | pobegin (void) |
| 592 | { |
| 593 | po_hash = htab_create_alloc (16, hash_po_entry, eq_po_entry, NULL, |
| 594 | xcalloc, xfree); |
| 595 | |
| 596 | /* Do the target-specific pseudo ops. */ |
| 597 | pop_table_name = "md"; |
| 598 | md_pop_insert (); |
| 599 | |
| 600 | /* Now object specific. Skip any that were in the target table. */ |
| 601 | pop_table_name = "obj"; |
| 602 | pop_override_ok = 1; |
| 603 | obj_pop_insert (); |
| 604 | |
| 605 | /* Now portable ones. Skip any that we've seen already. */ |
| 606 | pop_table_name = "standard"; |
| 607 | pop_insert (potable); |
| 608 | |
| 609 | /* Now CFI ones. */ |
| 610 | pop_table_name = "cfi"; |
| 611 | pop_override_ok = 1; |
| 612 | cfi_pop_insert (); |
| 613 | } |
| 614 | \f |
| 615 | #define HANDLE_CONDITIONAL_ASSEMBLY(num_read) \ |
| 616 | if (ignore_input ()) \ |
| 617 | { \ |
| 618 | char *eol = find_end_of_line (input_line_pointer - (num_read), \ |
| 619 | flag_m68k_mri); \ |
| 620 | input_line_pointer = (input_line_pointer <= buffer_limit \ |
| 621 | && eol >= buffer_limit) \ |
| 622 | ? buffer_limit \ |
| 623 | : eol + 1; \ |
| 624 | continue; \ |
| 625 | } |
| 626 | |
| 627 | /* This function is used when scrubbing the characters between #APP |
| 628 | and #NO_APP. */ |
| 629 | |
| 630 | static char *scrub_string; |
| 631 | static char *scrub_string_end; |
| 632 | |
| 633 | static size_t |
| 634 | scrub_from_string (char *buf, size_t buflen) |
| 635 | { |
| 636 | size_t copy; |
| 637 | |
| 638 | copy = scrub_string_end - scrub_string; |
| 639 | if (copy > buflen) |
| 640 | copy = buflen; |
| 641 | memcpy (buf, scrub_string, copy); |
| 642 | scrub_string += copy; |
| 643 | return copy; |
| 644 | } |
| 645 | |
| 646 | /* Helper function of read_a_source_file, which tries to expand a macro. */ |
| 647 | static int |
| 648 | try_macro (char term, const char *line) |
| 649 | { |
| 650 | sb out; |
| 651 | const char *err; |
| 652 | macro_entry *macro; |
| 653 | |
| 654 | if (check_macro (line, &out, &err, ¯o)) |
| 655 | { |
| 656 | if (err != NULL) |
| 657 | as_bad ("%s", err); |
| 658 | *input_line_pointer++ = term; |
| 659 | input_scrub_include_sb (&out, |
| 660 | input_line_pointer, 1); |
| 661 | sb_kill (&out); |
| 662 | buffer_limit = |
| 663 | input_scrub_next_buffer (&input_line_pointer); |
| 664 | #ifdef md_macro_info |
| 665 | md_macro_info (macro); |
| 666 | #endif |
| 667 | return 1; |
| 668 | } |
| 669 | return 0; |
| 670 | } |
| 671 | |
| 672 | #ifdef HANDLE_BUNDLE |
| 673 | /* Start a new instruction bundle. Returns the rs_align_code frag that |
| 674 | will be used to align the new bundle. */ |
| 675 | static fragS * |
| 676 | start_bundle (void) |
| 677 | { |
| 678 | fragS *frag = frag_now; |
| 679 | |
| 680 | frag_align_code (0, 0); |
| 681 | |
| 682 | while (frag->fr_type != rs_align_code) |
| 683 | frag = frag->fr_next; |
| 684 | |
| 685 | gas_assert (frag != frag_now); |
| 686 | |
| 687 | return frag; |
| 688 | } |
| 689 | |
| 690 | /* Calculate the maximum size after relaxation of the region starting |
| 691 | at the given frag and extending through frag_now (which is unfinished). */ |
| 692 | static unsigned int |
| 693 | pending_bundle_size (fragS *frag) |
| 694 | { |
| 695 | unsigned int offset = frag->fr_fix; |
| 696 | unsigned int size = 0; |
| 697 | |
| 698 | gas_assert (frag != frag_now); |
| 699 | gas_assert (frag->fr_type == rs_align_code); |
| 700 | |
| 701 | while (frag != frag_now) |
| 702 | { |
| 703 | /* This should only happen in what will later become an error case. */ |
| 704 | if (frag == NULL) |
| 705 | return 0; |
| 706 | |
| 707 | size += frag->fr_fix; |
| 708 | if (frag->fr_type == rs_machine_dependent) |
| 709 | size += md_frag_max_var (frag); |
| 710 | |
| 711 | frag = frag->fr_next; |
| 712 | } |
| 713 | |
| 714 | gas_assert (frag == frag_now); |
| 715 | size += frag_now_fix (); |
| 716 | if (frag->fr_type == rs_machine_dependent) |
| 717 | size += md_frag_max_var (frag); |
| 718 | |
| 719 | gas_assert (size >= offset); |
| 720 | |
| 721 | return size - offset; |
| 722 | } |
| 723 | |
| 724 | /* Finish off the frag created to ensure bundle alignment. */ |
| 725 | static void |
| 726 | finish_bundle (fragS *frag, unsigned int size) |
| 727 | { |
| 728 | gas_assert (bundle_align_p2 > 0); |
| 729 | gas_assert (frag->fr_type == rs_align_code); |
| 730 | |
| 731 | if (size > 1) |
| 732 | { |
| 733 | /* If there is more than a single byte, then we need to set up the |
| 734 | alignment frag. Otherwise we leave it at its initial state from |
| 735 | calling frag_align_code (0, 0), so that it does nothing. */ |
| 736 | frag->fr_offset = bundle_align_p2; |
| 737 | frag->fr_subtype = size - 1; |
| 738 | } |
| 739 | |
| 740 | /* We do this every time rather than just in s_bundle_align_mode |
| 741 | so that we catch any affected section without needing hooks all |
| 742 | over for all paths that do section changes. It's cheap enough. */ |
| 743 | if (bundle_align_p2 > OCTETS_PER_BYTE_POWER) |
| 744 | record_alignment (now_seg, bundle_align_p2 - OCTETS_PER_BYTE_POWER); |
| 745 | } |
| 746 | |
| 747 | /* Assemble one instruction. This takes care of the bundle features |
| 748 | around calling md_assemble. */ |
| 749 | static void |
| 750 | assemble_one (char *line) |
| 751 | { |
| 752 | fragS *insn_start_frag = NULL; |
| 753 | |
| 754 | if (bundle_lock_frchain != NULL && bundle_lock_frchain != frchain_now) |
| 755 | { |
| 756 | as_bad (_("cannot change section or subsection inside .bundle_lock")); |
| 757 | /* Clearing this serves as a marker that we have already complained. */ |
| 758 | bundle_lock_frchain = NULL; |
| 759 | } |
| 760 | |
| 761 | if (bundle_lock_frchain == NULL && bundle_align_p2 > 0) |
| 762 | insn_start_frag = start_bundle (); |
| 763 | |
| 764 | md_assemble (line); |
| 765 | |
| 766 | if (bundle_lock_frchain != NULL) |
| 767 | { |
| 768 | /* Make sure this hasn't pushed the locked sequence |
| 769 | past the bundle size. */ |
| 770 | unsigned int bundle_size = pending_bundle_size (bundle_lock_frag); |
| 771 | if (bundle_size > 1U << bundle_align_p2) |
| 772 | as_bad (_ (".bundle_lock sequence at %u bytes, " |
| 773 | "but .bundle_align_mode limit is %u bytes"), |
| 774 | bundle_size, 1U << bundle_align_p2); |
| 775 | } |
| 776 | else if (bundle_align_p2 > 0) |
| 777 | { |
| 778 | unsigned int insn_size = pending_bundle_size (insn_start_frag); |
| 779 | |
| 780 | if (insn_size > 1U << bundle_align_p2) |
| 781 | as_bad (_("single instruction is %u bytes long, " |
| 782 | "but .bundle_align_mode limit is %u bytes"), |
| 783 | insn_size, 1U << bundle_align_p2); |
| 784 | |
| 785 | finish_bundle (insn_start_frag, insn_size); |
| 786 | } |
| 787 | } |
| 788 | |
| 789 | #else /* !HANDLE_BUNDLE */ |
| 790 | |
| 791 | # define assemble_one(line) md_assemble(line) |
| 792 | |
| 793 | #endif /* HANDLE_BUNDLE */ |
| 794 | |
| 795 | static bfd_boolean |
| 796 | in_bss (void) |
| 797 | { |
| 798 | flagword flags = bfd_section_flags (now_seg); |
| 799 | |
| 800 | return (flags & SEC_ALLOC) && !(flags & (SEC_LOAD | SEC_HAS_CONTENTS)); |
| 801 | } |
| 802 | |
| 803 | /* Guts of .align directive: |
| 804 | N is the power of two to which to align. A value of zero is accepted but |
| 805 | ignored: the default alignment of the section will be at least this. |
| 806 | FILL may be NULL, or it may point to the bytes of the fill pattern. |
| 807 | LEN is the length of whatever FILL points to, if anything. If LEN is zero |
| 808 | but FILL is not NULL then LEN is treated as if it were one. |
| 809 | MAX is the maximum number of characters to skip when doing the alignment, |
| 810 | or 0 if there is no maximum. */ |
| 811 | |
| 812 | void |
| 813 | do_align (unsigned int n, char *fill, unsigned int len, unsigned int max) |
| 814 | { |
| 815 | if (now_seg == absolute_section || in_bss ()) |
| 816 | { |
| 817 | if (fill != NULL) |
| 818 | while (len-- > 0) |
| 819 | if (*fill++ != '\0') |
| 820 | { |
| 821 | if (now_seg == absolute_section) |
| 822 | as_warn (_("ignoring fill value in absolute section")); |
| 823 | else |
| 824 | as_warn (_("ignoring fill value in section `%s'"), |
| 825 | segment_name (now_seg)); |
| 826 | break; |
| 827 | } |
| 828 | fill = NULL; |
| 829 | len = 0; |
| 830 | } |
| 831 | |
| 832 | #ifdef md_flush_pending_output |
| 833 | md_flush_pending_output (); |
| 834 | #endif |
| 835 | |
| 836 | #ifdef md_do_align |
| 837 | md_do_align (n, fill, len, max, just_record_alignment); |
| 838 | #endif |
| 839 | |
| 840 | /* Only make a frag if we HAVE to... */ |
| 841 | if ((n > OCTETS_PER_BYTE_POWER) && !need_pass_2) |
| 842 | { |
| 843 | if (fill == NULL) |
| 844 | { |
| 845 | if (subseg_text_p (now_seg)) |
| 846 | frag_align_code (n, max); |
| 847 | else |
| 848 | frag_align (n, 0, max); |
| 849 | } |
| 850 | else if (len <= 1) |
| 851 | frag_align (n, *fill, max); |
| 852 | else |
| 853 | frag_align_pattern (n, fill, len, max); |
| 854 | } |
| 855 | |
| 856 | #ifdef md_do_align |
| 857 | just_record_alignment: ATTRIBUTE_UNUSED_LABEL |
| 858 | #endif |
| 859 | |
| 860 | if (n > OCTETS_PER_BYTE_POWER) |
| 861 | record_alignment (now_seg, n - OCTETS_PER_BYTE_POWER); |
| 862 | } |
| 863 | |
| 864 | /* We read the file, putting things into a web that represents what we |
| 865 | have been reading. */ |
| 866 | void |
| 867 | read_a_source_file (const char *name) |
| 868 | { |
| 869 | char nul_char; |
| 870 | char next_char; |
| 871 | char *s; /* String of symbol, '\0' appended. */ |
| 872 | long temp; |
| 873 | const pseudo_typeS *pop; |
| 874 | |
| 875 | #ifdef WARN_COMMENTS |
| 876 | found_comment = 0; |
| 877 | #endif |
| 878 | |
| 879 | buffer = input_scrub_new_file (name); |
| 880 | |
| 881 | listing_file (name); |
| 882 | listing_newline (NULL); |
| 883 | register_dependency (name); |
| 884 | |
| 885 | /* Generate debugging information before we've read anything in to denote |
| 886 | this file as the "main" source file and not a subordinate one |
| 887 | (e.g. N_SO vs N_SOL in stabs). */ |
| 888 | generate_file_debug (); |
| 889 | |
| 890 | while ((buffer_limit = input_scrub_next_buffer (&input_line_pointer)) != 0) |
| 891 | { /* We have another line to parse. */ |
| 892 | #ifndef NO_LISTING |
| 893 | /* In order to avoid listing macro expansion lines with labels |
| 894 | multiple times, keep track of which line was last issued. */ |
| 895 | static char *last_eol; |
| 896 | |
| 897 | last_eol = NULL; |
| 898 | #endif |
| 899 | while (input_line_pointer < buffer_limit) |
| 900 | { |
| 901 | bfd_boolean was_new_line; |
| 902 | /* We have more of this buffer to parse. */ |
| 903 | |
| 904 | /* We now have input_line_pointer->1st char of next line. |
| 905 | If input_line_pointer [-1] == '\n' then we just |
| 906 | scanned another line: so bump line counters. */ |
| 907 | was_new_line = is_end_of_line[(unsigned char) input_line_pointer[-1]]; |
| 908 | if (was_new_line) |
| 909 | { |
| 910 | symbol_set_value_now (&dot_symbol); |
| 911 | #ifdef md_start_line_hook |
| 912 | md_start_line_hook (); |
| 913 | #endif |
| 914 | if (input_line_pointer[-1] == '\n') |
| 915 | bump_line_counters (); |
| 916 | } |
| 917 | |
| 918 | #ifndef NO_LISTING |
| 919 | /* If listing is on, and we are expanding a macro, then give |
| 920 | the listing code the contents of the expanded line. */ |
| 921 | if (listing) |
| 922 | { |
| 923 | if ((listing & LISTING_MACEXP) && macro_nest > 0) |
| 924 | { |
| 925 | /* Find the end of the current expanded macro line. */ |
| 926 | s = find_end_of_line (input_line_pointer, flag_m68k_mri); |
| 927 | |
| 928 | if (s != last_eol) |
| 929 | { |
| 930 | char *copy; |
| 931 | int len; |
| 932 | |
| 933 | last_eol = s; |
| 934 | /* Copy it for safe keeping. Also give an indication of |
| 935 | how much macro nesting is involved at this point. */ |
| 936 | len = s - input_line_pointer; |
| 937 | copy = XNEWVEC (char, len + macro_nest + 2); |
| 938 | memset (copy, '>', macro_nest); |
| 939 | copy[macro_nest] = ' '; |
| 940 | memcpy (copy + macro_nest + 1, input_line_pointer, len); |
| 941 | copy[macro_nest + 1 + len] = '\0'; |
| 942 | |
| 943 | /* Install the line with the listing facility. */ |
| 944 | listing_newline (copy); |
| 945 | } |
| 946 | } |
| 947 | else |
| 948 | listing_newline (NULL); |
| 949 | } |
| 950 | #endif |
| 951 | if (was_new_line) |
| 952 | { |
| 953 | line_label = NULL; |
| 954 | |
| 955 | if (LABELS_WITHOUT_COLONS || flag_m68k_mri) |
| 956 | { |
| 957 | next_char = * input_line_pointer; |
| 958 | /* Text at the start of a line must be a label, we |
| 959 | run down and stick a colon in. */ |
| 960 | if (is_name_beginner (next_char) || next_char == '"') |
| 961 | { |
| 962 | char *line_start; |
| 963 | int mri_line_macro; |
| 964 | |
| 965 | HANDLE_CONDITIONAL_ASSEMBLY (0); |
| 966 | |
| 967 | nul_char = get_symbol_name (& line_start); |
| 968 | next_char = (nul_char == '"' ? input_line_pointer[1] : nul_char); |
| 969 | |
| 970 | /* In MRI mode, the EQU and MACRO pseudoops must |
| 971 | be handled specially. */ |
| 972 | mri_line_macro = 0; |
| 973 | if (flag_m68k_mri) |
| 974 | { |
| 975 | char *rest = input_line_pointer + 1; |
| 976 | |
| 977 | if (*rest == ':') |
| 978 | ++rest; |
| 979 | if (*rest == ' ' || *rest == '\t') |
| 980 | ++rest; |
| 981 | if ((strncasecmp (rest, "EQU", 3) == 0 |
| 982 | || strncasecmp (rest, "SET", 3) == 0) |
| 983 | && (rest[3] == ' ' || rest[3] == '\t')) |
| 984 | { |
| 985 | input_line_pointer = rest + 3; |
| 986 | equals (line_start, |
| 987 | strncasecmp (rest, "SET", 3) == 0); |
| 988 | continue; |
| 989 | } |
| 990 | if (strncasecmp (rest, "MACRO", 5) == 0 |
| 991 | && (rest[5] == ' ' |
| 992 | || rest[5] == '\t' |
| 993 | || is_end_of_line[(unsigned char) rest[5]])) |
| 994 | mri_line_macro = 1; |
| 995 | } |
| 996 | |
| 997 | /* In MRI mode, we need to handle the MACRO |
| 998 | pseudo-op specially: we don't want to put the |
| 999 | symbol in the symbol table. */ |
| 1000 | if (!mri_line_macro |
| 1001 | #ifdef TC_START_LABEL_WITHOUT_COLON |
| 1002 | && TC_START_LABEL_WITHOUT_COLON (nul_char, next_char) |
| 1003 | #endif |
| 1004 | ) |
| 1005 | line_label = colon (line_start); |
| 1006 | else |
| 1007 | line_label = symbol_create (line_start, |
| 1008 | absolute_section, |
| 1009 | &zero_address_frag, 0); |
| 1010 | |
| 1011 | next_char = restore_line_pointer (nul_char); |
| 1012 | if (next_char == ':') |
| 1013 | input_line_pointer++; |
| 1014 | } |
| 1015 | } |
| 1016 | } |
| 1017 | |
| 1018 | /* We are at the beginning of a line, or similar place. |
| 1019 | We expect a well-formed assembler statement. |
| 1020 | A "symbol-name:" is a statement. |
| 1021 | |
| 1022 | Depending on what compiler is used, the order of these tests |
| 1023 | may vary to catch most common case 1st. |
| 1024 | Each test is independent of all other tests at the (top) |
| 1025 | level. */ |
| 1026 | do |
| 1027 | nul_char = next_char = *input_line_pointer++; |
| 1028 | while (next_char == '\t' || next_char == ' ' || next_char == '\f'); |
| 1029 | |
| 1030 | /* C is the 1st significant character. |
| 1031 | Input_line_pointer points after that character. */ |
| 1032 | if (is_name_beginner (next_char) || next_char == '"') |
| 1033 | { |
| 1034 | char *rest; |
| 1035 | |
| 1036 | /* Want user-defined label or pseudo/opcode. */ |
| 1037 | HANDLE_CONDITIONAL_ASSEMBLY (1); |
| 1038 | |
| 1039 | --input_line_pointer; |
| 1040 | nul_char = get_symbol_name (& s); /* name's delimiter. */ |
| 1041 | next_char = (nul_char == '"' ? input_line_pointer[1] : nul_char); |
| 1042 | rest = input_line_pointer + (nul_char == '"' ? 2 : 1); |
| 1043 | |
| 1044 | /* NEXT_CHAR is character after symbol. |
| 1045 | The end of symbol in the input line is now '\0'. |
| 1046 | S points to the beginning of the symbol. |
| 1047 | [In case of pseudo-op, s->'.'.] |
| 1048 | Input_line_pointer->'\0' where NUL_CHAR was. */ |
| 1049 | if (TC_START_LABEL (s, nul_char, next_char)) |
| 1050 | { |
| 1051 | if (flag_m68k_mri) |
| 1052 | { |
| 1053 | /* In MRI mode, \tsym: set 0 is permitted. */ |
| 1054 | if (*rest == ':') |
| 1055 | ++rest; |
| 1056 | |
| 1057 | if (*rest == ' ' || *rest == '\t') |
| 1058 | ++rest; |
| 1059 | |
| 1060 | if ((strncasecmp (rest, "EQU", 3) == 0 |
| 1061 | || strncasecmp (rest, "SET", 3) == 0) |
| 1062 | && (rest[3] == ' ' || rest[3] == '\t')) |
| 1063 | { |
| 1064 | input_line_pointer = rest + 3; |
| 1065 | equals (s, 1); |
| 1066 | continue; |
| 1067 | } |
| 1068 | } |
| 1069 | |
| 1070 | line_label = colon (s); /* User-defined label. */ |
| 1071 | restore_line_pointer (nul_char); |
| 1072 | ++ input_line_pointer; |
| 1073 | #ifdef tc_check_label |
| 1074 | tc_check_label (line_label); |
| 1075 | #endif |
| 1076 | /* Input_line_pointer->after ':'. */ |
| 1077 | SKIP_WHITESPACE (); |
| 1078 | } |
| 1079 | else if ((next_char == '=' && *rest == '=') |
| 1080 | || ((next_char == ' ' || next_char == '\t') |
| 1081 | && rest[0] == '=' |
| 1082 | && rest[1] == '=')) |
| 1083 | { |
| 1084 | equals (s, -1); |
| 1085 | demand_empty_rest_of_line (); |
| 1086 | } |
| 1087 | else if ((next_char == '=' |
| 1088 | || ((next_char == ' ' || next_char == '\t') |
| 1089 | && *rest == '=')) |
| 1090 | #ifdef TC_EQUAL_IN_INSN |
| 1091 | && !TC_EQUAL_IN_INSN (next_char, s) |
| 1092 | #endif |
| 1093 | ) |
| 1094 | { |
| 1095 | equals (s, 1); |
| 1096 | demand_empty_rest_of_line (); |
| 1097 | } |
| 1098 | else |
| 1099 | { |
| 1100 | /* Expect pseudo-op or machine instruction. */ |
| 1101 | pop = NULL; |
| 1102 | |
| 1103 | #ifndef TC_CASE_SENSITIVE |
| 1104 | { |
| 1105 | char *s2 = s; |
| 1106 | |
| 1107 | strncpy (original_case_string, s2, |
| 1108 | sizeof (original_case_string) - 1); |
| 1109 | original_case_string[sizeof (original_case_string) - 1] = 0; |
| 1110 | |
| 1111 | while (*s2) |
| 1112 | { |
| 1113 | *s2 = TOLOWER (*s2); |
| 1114 | s2++; |
| 1115 | } |
| 1116 | } |
| 1117 | #endif |
| 1118 | if (NO_PSEUDO_DOT || flag_m68k_mri) |
| 1119 | { |
| 1120 | /* The MRI assembler uses pseudo-ops without |
| 1121 | a period. */ |
| 1122 | pop = po_entry_find (po_hash, s); |
| 1123 | if (pop != NULL && pop->poc_handler == NULL) |
| 1124 | pop = NULL; |
| 1125 | } |
| 1126 | |
| 1127 | if (pop != NULL |
| 1128 | || (!flag_m68k_mri && *s == '.')) |
| 1129 | { |
| 1130 | /* PSEUDO - OP. |
| 1131 | |
| 1132 | WARNING: next_char may be end-of-line. |
| 1133 | We lookup the pseudo-op table with s+1 because we |
| 1134 | already know that the pseudo-op begins with a '.'. */ |
| 1135 | |
| 1136 | if (pop == NULL) |
| 1137 | pop = po_entry_find (po_hash, s + 1); |
| 1138 | if (pop && !pop->poc_handler) |
| 1139 | pop = NULL; |
| 1140 | |
| 1141 | /* In MRI mode, we may need to insert an |
| 1142 | automatic alignment directive. What a hack |
| 1143 | this is. */ |
| 1144 | if (mri_pending_align |
| 1145 | && (pop == NULL |
| 1146 | || !((pop->poc_handler == cons |
| 1147 | && pop->poc_val == 1) |
| 1148 | || (pop->poc_handler == s_space |
| 1149 | && pop->poc_val == 1) |
| 1150 | #ifdef tc_conditional_pseudoop |
| 1151 | || tc_conditional_pseudoop (pop) |
| 1152 | #endif |
| 1153 | || pop->poc_handler == s_if |
| 1154 | || pop->poc_handler == s_ifdef |
| 1155 | || pop->poc_handler == s_ifc |
| 1156 | || pop->poc_handler == s_ifeqs |
| 1157 | || pop->poc_handler == s_else |
| 1158 | || pop->poc_handler == s_endif |
| 1159 | || pop->poc_handler == s_globl |
| 1160 | || pop->poc_handler == s_ignore))) |
| 1161 | { |
| 1162 | do_align (1, (char *) NULL, 0, 0); |
| 1163 | mri_pending_align = 0; |
| 1164 | |
| 1165 | if (line_label != NULL) |
| 1166 | { |
| 1167 | symbol_set_frag (line_label, frag_now); |
| 1168 | S_SET_VALUE (line_label, frag_now_fix ()); |
| 1169 | } |
| 1170 | } |
| 1171 | |
| 1172 | /* Print the error msg now, while we still can. */ |
| 1173 | if (pop == NULL) |
| 1174 | { |
| 1175 | char *end = input_line_pointer; |
| 1176 | |
| 1177 | (void) restore_line_pointer (nul_char); |
| 1178 | s_ignore (0); |
| 1179 | nul_char = next_char = *--input_line_pointer; |
| 1180 | *input_line_pointer = '\0'; |
| 1181 | if (! macro_defined || ! try_macro (next_char, s)) |
| 1182 | { |
| 1183 | *end = '\0'; |
| 1184 | as_bad (_("unknown pseudo-op: `%s'"), s); |
| 1185 | *input_line_pointer++ = nul_char; |
| 1186 | } |
| 1187 | continue; |
| 1188 | } |
| 1189 | |
| 1190 | /* Put it back for error messages etc. */ |
| 1191 | next_char = restore_line_pointer (nul_char); |
| 1192 | /* The following skip of whitespace is compulsory. |
| 1193 | A well shaped space is sometimes all that separates |
| 1194 | keyword from operands. */ |
| 1195 | if (next_char == ' ' || next_char == '\t') |
| 1196 | input_line_pointer++; |
| 1197 | |
| 1198 | /* Input_line is restored. |
| 1199 | Input_line_pointer->1st non-blank char |
| 1200 | after pseudo-operation. */ |
| 1201 | (*pop->poc_handler) (pop->poc_val); |
| 1202 | |
| 1203 | /* If that was .end, just get out now. */ |
| 1204 | if (pop->poc_handler == s_end) |
| 1205 | goto quit; |
| 1206 | } |
| 1207 | else |
| 1208 | { |
| 1209 | /* WARNING: next_char may be end-of-line. */ |
| 1210 | /* Also: input_line_pointer->`\0` where nul_char was. */ |
| 1211 | (void) restore_line_pointer (nul_char); |
| 1212 | input_line_pointer = _find_end_of_line (input_line_pointer, flag_m68k_mri, 1, 0); |
| 1213 | next_char = nul_char = *input_line_pointer; |
| 1214 | *input_line_pointer = '\0'; |
| 1215 | |
| 1216 | generate_lineno_debug (); |
| 1217 | |
| 1218 | if (macro_defined && try_macro (next_char, s)) |
| 1219 | continue; |
| 1220 | |
| 1221 | if (mri_pending_align) |
| 1222 | { |
| 1223 | do_align (1, (char *) NULL, 0, 0); |
| 1224 | mri_pending_align = 0; |
| 1225 | if (line_label != NULL) |
| 1226 | { |
| 1227 | symbol_set_frag (line_label, frag_now); |
| 1228 | S_SET_VALUE (line_label, frag_now_fix ()); |
| 1229 | } |
| 1230 | } |
| 1231 | |
| 1232 | assemble_one (s); /* Assemble 1 instruction. */ |
| 1233 | |
| 1234 | /* PR 19630: The backend may have set ilp to NULL |
| 1235 | if it encountered a catastrophic failure. */ |
| 1236 | if (input_line_pointer == NULL) |
| 1237 | as_fatal (_("unable to continue with assembly.")); |
| 1238 | |
| 1239 | *input_line_pointer++ = nul_char; |
| 1240 | |
| 1241 | /* We resume loop AFTER the end-of-line from |
| 1242 | this instruction. */ |
| 1243 | } |
| 1244 | } |
| 1245 | continue; |
| 1246 | } |
| 1247 | |
| 1248 | /* Empty statement? */ |
| 1249 | if (is_end_of_line[(unsigned char) next_char]) |
| 1250 | continue; |
| 1251 | |
| 1252 | if ((LOCAL_LABELS_DOLLAR || LOCAL_LABELS_FB) && ISDIGIT (next_char)) |
| 1253 | { |
| 1254 | /* local label ("4:") */ |
| 1255 | char *backup = input_line_pointer; |
| 1256 | |
| 1257 | HANDLE_CONDITIONAL_ASSEMBLY (1); |
| 1258 | |
| 1259 | temp = next_char - '0'; |
| 1260 | |
| 1261 | if (nul_char == '"') |
| 1262 | ++ input_line_pointer; |
| 1263 | |
| 1264 | /* Read the whole number. */ |
| 1265 | while (ISDIGIT (*input_line_pointer)) |
| 1266 | { |
| 1267 | const long digit = *input_line_pointer - '0'; |
| 1268 | if (temp > (LONG_MAX - digit) / 10) |
| 1269 | { |
| 1270 | as_bad (_("local label too large near %s"), backup); |
| 1271 | temp = -1; |
| 1272 | break; |
| 1273 | } |
| 1274 | temp = temp * 10 + digit; |
| 1275 | ++input_line_pointer; |
| 1276 | } |
| 1277 | |
| 1278 | /* Overflow: stop processing the label. */ |
| 1279 | if (temp == -1) |
| 1280 | { |
| 1281 | ignore_rest_of_line (); |
| 1282 | continue; |
| 1283 | } |
| 1284 | |
| 1285 | if (LOCAL_LABELS_DOLLAR |
| 1286 | && *input_line_pointer == '$' |
| 1287 | && *(input_line_pointer + 1) == ':') |
| 1288 | { |
| 1289 | input_line_pointer += 2; |
| 1290 | |
| 1291 | if (dollar_label_defined (temp)) |
| 1292 | { |
| 1293 | as_fatal (_("label \"%ld$\" redefined"), temp); |
| 1294 | } |
| 1295 | |
| 1296 | define_dollar_label (temp); |
| 1297 | colon (dollar_label_name (temp, 0)); |
| 1298 | continue; |
| 1299 | } |
| 1300 | |
| 1301 | if (LOCAL_LABELS_FB |
| 1302 | && *input_line_pointer++ == ':') |
| 1303 | { |
| 1304 | fb_label_instance_inc (temp); |
| 1305 | colon (fb_label_name (temp, 0)); |
| 1306 | continue; |
| 1307 | } |
| 1308 | |
| 1309 | input_line_pointer = backup; |
| 1310 | } |
| 1311 | |
| 1312 | if (next_char && strchr (line_comment_chars, next_char)) |
| 1313 | { /* Its a comment. Better say APP or NO_APP. */ |
| 1314 | sb sbuf; |
| 1315 | char *ends; |
| 1316 | char *new_buf; |
| 1317 | char *new_tmp; |
| 1318 | unsigned int new_length; |
| 1319 | char *tmp_buf = 0; |
| 1320 | |
| 1321 | s = input_line_pointer; |
| 1322 | if (strncmp (s, "APP\n", 4)) |
| 1323 | { |
| 1324 | /* We ignore it. */ |
| 1325 | ignore_rest_of_line (); |
| 1326 | continue; |
| 1327 | } |
| 1328 | bump_line_counters (); |
| 1329 | s += 4; |
| 1330 | |
| 1331 | ends = strstr (s, "#NO_APP\n"); |
| 1332 | |
| 1333 | if (!ends) |
| 1334 | { |
| 1335 | unsigned int tmp_len; |
| 1336 | unsigned int num; |
| 1337 | |
| 1338 | /* The end of the #APP wasn't in this buffer. We |
| 1339 | keep reading in buffers until we find the #NO_APP |
| 1340 | that goes with this #APP There is one. The specs |
| 1341 | guarantee it... */ |
| 1342 | tmp_len = buffer_limit - s; |
| 1343 | tmp_buf = XNEWVEC (char, tmp_len + 1); |
| 1344 | memcpy (tmp_buf, s, tmp_len); |
| 1345 | do |
| 1346 | { |
| 1347 | new_tmp = input_scrub_next_buffer (&buffer); |
| 1348 | if (!new_tmp) |
| 1349 | break; |
| 1350 | else |
| 1351 | buffer_limit = new_tmp; |
| 1352 | input_line_pointer = buffer; |
| 1353 | ends = strstr (buffer, "#NO_APP\n"); |
| 1354 | if (ends) |
| 1355 | num = ends - buffer; |
| 1356 | else |
| 1357 | num = buffer_limit - buffer; |
| 1358 | |
| 1359 | tmp_buf = XRESIZEVEC (char, tmp_buf, tmp_len + num); |
| 1360 | memcpy (tmp_buf + tmp_len, buffer, num); |
| 1361 | tmp_len += num; |
| 1362 | } |
| 1363 | while (!ends); |
| 1364 | |
| 1365 | input_line_pointer = ends ? ends + 8 : NULL; |
| 1366 | |
| 1367 | s = tmp_buf; |
| 1368 | ends = s + tmp_len; |
| 1369 | |
| 1370 | } |
| 1371 | else |
| 1372 | { |
| 1373 | input_line_pointer = ends + 8; |
| 1374 | } |
| 1375 | |
| 1376 | scrub_string = s; |
| 1377 | scrub_string_end = ends; |
| 1378 | |
| 1379 | new_length = ends - s; |
| 1380 | new_buf = XNEWVEC (char, new_length); |
| 1381 | new_tmp = new_buf; |
| 1382 | for (;;) |
| 1383 | { |
| 1384 | size_t space; |
| 1385 | size_t size; |
| 1386 | |
| 1387 | space = (new_buf + new_length) - new_tmp; |
| 1388 | size = do_scrub_chars (scrub_from_string, new_tmp, space); |
| 1389 | |
| 1390 | if (size < space) |
| 1391 | { |
| 1392 | new_tmp[size] = 0; |
| 1393 | break; |
| 1394 | } |
| 1395 | |
| 1396 | new_buf = XRESIZEVEC (char, new_buf, new_length + 100); |
| 1397 | new_tmp = new_buf + new_length; |
| 1398 | new_length += 100; |
| 1399 | } |
| 1400 | |
| 1401 | free (tmp_buf); |
| 1402 | |
| 1403 | /* We've "scrubbed" input to the preferred format. In the |
| 1404 | process we may have consumed the whole of the remaining |
| 1405 | file (and included files). We handle this formatted |
| 1406 | input similar to that of macro expansion, letting |
| 1407 | actual macro expansion (possibly nested) and other |
| 1408 | input expansion work. Beware that in messages, line |
| 1409 | numbers and possibly file names will be incorrect. */ |
| 1410 | new_length = strlen (new_buf); |
| 1411 | sb_build (&sbuf, new_length); |
| 1412 | sb_add_buffer (&sbuf, new_buf, new_length); |
| 1413 | input_scrub_include_sb (&sbuf, input_line_pointer, 0); |
| 1414 | sb_kill (&sbuf); |
| 1415 | buffer_limit = input_scrub_next_buffer (&input_line_pointer); |
| 1416 | free (new_buf); |
| 1417 | continue; |
| 1418 | } |
| 1419 | |
| 1420 | HANDLE_CONDITIONAL_ASSEMBLY (1); |
| 1421 | |
| 1422 | #ifdef tc_unrecognized_line |
| 1423 | if (tc_unrecognized_line (next_char)) |
| 1424 | continue; |
| 1425 | #endif |
| 1426 | input_line_pointer--; |
| 1427 | /* Report unknown char as error. */ |
| 1428 | demand_empty_rest_of_line (); |
| 1429 | } |
| 1430 | } |
| 1431 | |
| 1432 | quit: |
| 1433 | symbol_set_value_now (&dot_symbol); |
| 1434 | |
| 1435 | #ifdef HANDLE_BUNDLE |
| 1436 | if (bundle_lock_frag != NULL) |
| 1437 | { |
| 1438 | as_bad_where (bundle_lock_frag->fr_file, bundle_lock_frag->fr_line, |
| 1439 | _(".bundle_lock with no matching .bundle_unlock")); |
| 1440 | bundle_lock_frag = NULL; |
| 1441 | bundle_lock_frchain = NULL; |
| 1442 | bundle_lock_depth = 0; |
| 1443 | } |
| 1444 | #endif |
| 1445 | |
| 1446 | #ifdef md_cleanup |
| 1447 | md_cleanup (); |
| 1448 | #endif |
| 1449 | /* Close the input file. */ |
| 1450 | input_scrub_close (); |
| 1451 | #ifdef WARN_COMMENTS |
| 1452 | { |
| 1453 | if (warn_comment && found_comment) |
| 1454 | as_warn_where (found_comment_file, found_comment, |
| 1455 | "first comment found here"); |
| 1456 | } |
| 1457 | #endif |
| 1458 | } |
| 1459 | |
| 1460 | /* Convert O_constant expression EXP into the equivalent O_big representation. |
| 1461 | Take the sign of the number from SIGN rather than X_add_number. */ |
| 1462 | |
| 1463 | static void |
| 1464 | convert_to_bignum (expressionS *exp, int sign) |
| 1465 | { |
| 1466 | valueT value; |
| 1467 | unsigned int i; |
| 1468 | |
| 1469 | value = exp->X_add_number; |
| 1470 | for (i = 0; i < sizeof (exp->X_add_number) / CHARS_PER_LITTLENUM; i++) |
| 1471 | { |
| 1472 | generic_bignum[i] = value & LITTLENUM_MASK; |
| 1473 | value >>= LITTLENUM_NUMBER_OF_BITS; |
| 1474 | } |
| 1475 | /* Add a sequence of sign bits if the top bit of X_add_number is not |
| 1476 | the sign of the original value. */ |
| 1477 | if ((exp->X_add_number < 0) == !sign) |
| 1478 | generic_bignum[i++] = sign ? LITTLENUM_MASK : 0; |
| 1479 | exp->X_op = O_big; |
| 1480 | exp->X_add_number = i; |
| 1481 | } |
| 1482 | |
| 1483 | /* For most MRI pseudo-ops, the line actually ends at the first |
| 1484 | nonquoted space. This function looks for that point, stuffs a null |
| 1485 | in, and sets *STOPCP to the character that used to be there, and |
| 1486 | returns the location. |
| 1487 | |
| 1488 | Until I hear otherwise, I am going to assume that this is only true |
| 1489 | for the m68k MRI assembler. */ |
| 1490 | |
| 1491 | char * |
| 1492 | mri_comment_field (char *stopcp) |
| 1493 | { |
| 1494 | char *s; |
| 1495 | #ifdef TC_M68K |
| 1496 | int inquote = 0; |
| 1497 | |
| 1498 | know (flag_m68k_mri); |
| 1499 | |
| 1500 | for (s = input_line_pointer; |
| 1501 | ((!is_end_of_line[(unsigned char) *s] && *s != ' ' && *s != '\t') |
| 1502 | || inquote); |
| 1503 | s++) |
| 1504 | { |
| 1505 | if (*s == '\'') |
| 1506 | inquote = !inquote; |
| 1507 | } |
| 1508 | #else |
| 1509 | for (s = input_line_pointer; |
| 1510 | !is_end_of_line[(unsigned char) *s]; |
| 1511 | s++) |
| 1512 | ; |
| 1513 | #endif |
| 1514 | *stopcp = *s; |
| 1515 | *s = '\0'; |
| 1516 | |
| 1517 | return s; |
| 1518 | } |
| 1519 | |
| 1520 | /* Skip to the end of an MRI comment field. */ |
| 1521 | |
| 1522 | void |
| 1523 | mri_comment_end (char *stop, int stopc) |
| 1524 | { |
| 1525 | know (flag_mri); |
| 1526 | |
| 1527 | input_line_pointer = stop; |
| 1528 | *stop = stopc; |
| 1529 | while (!is_end_of_line[(unsigned char) *input_line_pointer]) |
| 1530 | ++input_line_pointer; |
| 1531 | } |
| 1532 | |
| 1533 | void |
| 1534 | s_abort (int ignore ATTRIBUTE_UNUSED) |
| 1535 | { |
| 1536 | as_fatal (_(".abort detected. Abandoning ship.")); |
| 1537 | } |
| 1538 | |
| 1539 | /* Handle the .align pseudo-op. A positive ARG is a default alignment |
| 1540 | (in bytes). A negative ARG is the negative of the length of the |
| 1541 | fill pattern. BYTES_P is non-zero if the alignment value should be |
| 1542 | interpreted as the byte boundary, rather than the power of 2. */ |
| 1543 | #ifndef TC_ALIGN_LIMIT |
| 1544 | #define TC_ALIGN_LIMIT (stdoutput->arch_info->bits_per_address - 1) |
| 1545 | #endif |
| 1546 | |
| 1547 | static void |
| 1548 | s_align (signed int arg, int bytes_p) |
| 1549 | { |
| 1550 | unsigned int align_limit = TC_ALIGN_LIMIT; |
| 1551 | unsigned int align; |
| 1552 | char *stop = NULL; |
| 1553 | char stopc = 0; |
| 1554 | offsetT fill = 0; |
| 1555 | unsigned int max; |
| 1556 | int fill_p; |
| 1557 | |
| 1558 | if (flag_mri) |
| 1559 | stop = mri_comment_field (&stopc); |
| 1560 | |
| 1561 | if (is_end_of_line[(unsigned char) *input_line_pointer]) |
| 1562 | { |
| 1563 | if (arg < 0) |
| 1564 | align = 0; |
| 1565 | else |
| 1566 | align = arg; /* Default value from pseudo-op table. */ |
| 1567 | } |
| 1568 | else |
| 1569 | { |
| 1570 | align = get_absolute_expression (); |
| 1571 | SKIP_WHITESPACE (); |
| 1572 | |
| 1573 | #ifdef TC_ALIGN_ZERO_IS_DEFAULT |
| 1574 | if (arg > 0 && align == 0) |
| 1575 | align = arg; |
| 1576 | #endif |
| 1577 | } |
| 1578 | |
| 1579 | if (bytes_p) |
| 1580 | { |
| 1581 | /* Convert to a power of 2. */ |
| 1582 | if (align != 0) |
| 1583 | { |
| 1584 | unsigned int i; |
| 1585 | |
| 1586 | for (i = 0; (align & 1) == 0; align >>= 1, ++i) |
| 1587 | ; |
| 1588 | if (align != 1) |
| 1589 | as_bad (_("alignment not a power of 2")); |
| 1590 | |
| 1591 | align = i; |
| 1592 | } |
| 1593 | } |
| 1594 | |
| 1595 | if (align > align_limit) |
| 1596 | { |
| 1597 | align = align_limit; |
| 1598 | as_warn (_("alignment too large: %u assumed"), align); |
| 1599 | } |
| 1600 | |
| 1601 | if (*input_line_pointer != ',') |
| 1602 | { |
| 1603 | fill_p = 0; |
| 1604 | max = 0; |
| 1605 | } |
| 1606 | else |
| 1607 | { |
| 1608 | ++input_line_pointer; |
| 1609 | if (*input_line_pointer == ',') |
| 1610 | fill_p = 0; |
| 1611 | else |
| 1612 | { |
| 1613 | fill = get_absolute_expression (); |
| 1614 | SKIP_WHITESPACE (); |
| 1615 | fill_p = 1; |
| 1616 | } |
| 1617 | |
| 1618 | if (*input_line_pointer != ',') |
| 1619 | max = 0; |
| 1620 | else |
| 1621 | { |
| 1622 | ++input_line_pointer; |
| 1623 | max = get_absolute_expression (); |
| 1624 | } |
| 1625 | } |
| 1626 | |
| 1627 | if (!fill_p) |
| 1628 | { |
| 1629 | if (arg < 0) |
| 1630 | as_warn (_("expected fill pattern missing")); |
| 1631 | do_align (align, (char *) NULL, 0, max); |
| 1632 | } |
| 1633 | else |
| 1634 | { |
| 1635 | unsigned int fill_len; |
| 1636 | |
| 1637 | if (arg >= 0) |
| 1638 | fill_len = 1; |
| 1639 | else |
| 1640 | fill_len = -arg; |
| 1641 | |
| 1642 | if (fill_len <= 1) |
| 1643 | { |
| 1644 | char fill_char = 0; |
| 1645 | |
| 1646 | fill_char = fill; |
| 1647 | do_align (align, &fill_char, fill_len, max); |
| 1648 | } |
| 1649 | else |
| 1650 | { |
| 1651 | char ab[16]; |
| 1652 | |
| 1653 | if ((size_t) fill_len > sizeof ab) |
| 1654 | { |
| 1655 | as_warn (_("fill pattern too long, truncating to %u"), |
| 1656 | (unsigned) sizeof ab); |
| 1657 | fill_len = sizeof ab; |
| 1658 | } |
| 1659 | |
| 1660 | md_number_to_chars (ab, fill, fill_len); |
| 1661 | do_align (align, ab, fill_len, max); |
| 1662 | } |
| 1663 | } |
| 1664 | |
| 1665 | demand_empty_rest_of_line (); |
| 1666 | |
| 1667 | if (flag_mri) |
| 1668 | mri_comment_end (stop, stopc); |
| 1669 | } |
| 1670 | |
| 1671 | /* Handle the .align pseudo-op on machines where ".align 4" means |
| 1672 | align to a 4 byte boundary. */ |
| 1673 | |
| 1674 | void |
| 1675 | s_align_bytes (int arg) |
| 1676 | { |
| 1677 | s_align (arg, 1); |
| 1678 | } |
| 1679 | |
| 1680 | /* Handle the .align pseudo-op on machines where ".align 4" means align |
| 1681 | to a 2**4 boundary. */ |
| 1682 | |
| 1683 | void |
| 1684 | s_align_ptwo (int arg) |
| 1685 | { |
| 1686 | s_align (arg, 0); |
| 1687 | } |
| 1688 | |
| 1689 | /* Switch in and out of alternate macro mode. */ |
| 1690 | |
| 1691 | static void |
| 1692 | s_altmacro (int on) |
| 1693 | { |
| 1694 | demand_empty_rest_of_line (); |
| 1695 | macro_set_alternate (on); |
| 1696 | } |
| 1697 | |
| 1698 | /* Read a symbol name from input_line_pointer. |
| 1699 | |
| 1700 | Stores the symbol name in a buffer and returns a pointer to this buffer. |
| 1701 | The buffer is xalloc'ed. It is the caller's responsibility to free |
| 1702 | this buffer. |
| 1703 | |
| 1704 | The name is not left in the i_l_p buffer as it may need processing |
| 1705 | to handle escape characters. |
| 1706 | |
| 1707 | Advances i_l_p to the next non-whitespace character. |
| 1708 | |
| 1709 | If a symbol name could not be read, the routine issues an error |
| 1710 | messages, skips to the end of the line and returns NULL. */ |
| 1711 | |
| 1712 | char * |
| 1713 | read_symbol_name (void) |
| 1714 | { |
| 1715 | char * name; |
| 1716 | char * start; |
| 1717 | char c; |
| 1718 | |
| 1719 | c = *input_line_pointer++; |
| 1720 | |
| 1721 | if (c == '"') |
| 1722 | { |
| 1723 | #define SYM_NAME_CHUNK_LEN 128 |
| 1724 | ptrdiff_t len = SYM_NAME_CHUNK_LEN; |
| 1725 | char * name_end; |
| 1726 | unsigned int C; |
| 1727 | |
| 1728 | start = name = XNEWVEC (char, len + 1); |
| 1729 | |
| 1730 | name_end = name + SYM_NAME_CHUNK_LEN; |
| 1731 | |
| 1732 | while (is_a_char (C = next_char_of_string ())) |
| 1733 | { |
| 1734 | if (name >= name_end) |
| 1735 | { |
| 1736 | ptrdiff_t sofar; |
| 1737 | |
| 1738 | sofar = name - start; |
| 1739 | len += SYM_NAME_CHUNK_LEN; |
| 1740 | start = XRESIZEVEC (char, start, len + 1); |
| 1741 | name_end = start + len; |
| 1742 | name = start + sofar; |
| 1743 | } |
| 1744 | |
| 1745 | *name++ = (char) C; |
| 1746 | } |
| 1747 | *name = 0; |
| 1748 | |
| 1749 | /* Since quoted symbol names can contain non-ASCII characters, |
| 1750 | check the string and warn if it cannot be recognised by the |
| 1751 | current character set. */ |
| 1752 | if (mbstowcs (NULL, name, len) == (size_t) -1) |
| 1753 | as_warn (_("symbol name not recognised in the current locale")); |
| 1754 | } |
| 1755 | else if (is_name_beginner (c) || (input_from_string && c == FAKE_LABEL_CHAR)) |
| 1756 | { |
| 1757 | ptrdiff_t len; |
| 1758 | |
| 1759 | name = input_line_pointer - 1; |
| 1760 | |
| 1761 | /* We accept FAKE_LABEL_CHAR in a name in case this is |
| 1762 | being called with a constructed string. */ |
| 1763 | while (is_part_of_name (c = *input_line_pointer++) |
| 1764 | || (input_from_string && c == FAKE_LABEL_CHAR)) |
| 1765 | ; |
| 1766 | |
| 1767 | len = (input_line_pointer - name) - 1; |
| 1768 | start = XNEWVEC (char, len + 1); |
| 1769 | |
| 1770 | memcpy (start, name, len); |
| 1771 | start[len] = 0; |
| 1772 | |
| 1773 | /* Skip a name ender char if one is present. */ |
| 1774 | if (! is_name_ender (c)) |
| 1775 | --input_line_pointer; |
| 1776 | } |
| 1777 | else |
| 1778 | name = start = NULL; |
| 1779 | |
| 1780 | if (name == start) |
| 1781 | { |
| 1782 | as_bad (_("expected symbol name")); |
| 1783 | ignore_rest_of_line (); |
| 1784 | return NULL; |
| 1785 | } |
| 1786 | |
| 1787 | SKIP_WHITESPACE (); |
| 1788 | |
| 1789 | return start; |
| 1790 | } |
| 1791 | |
| 1792 | |
| 1793 | symbolS * |
| 1794 | s_comm_internal (int param, |
| 1795 | symbolS *(*comm_parse_extra) (int, symbolS *, addressT)) |
| 1796 | { |
| 1797 | char *name; |
| 1798 | offsetT temp, size; |
| 1799 | symbolS *symbolP = NULL; |
| 1800 | char *stop = NULL; |
| 1801 | char stopc = 0; |
| 1802 | expressionS exp; |
| 1803 | |
| 1804 | if (flag_mri) |
| 1805 | stop = mri_comment_field (&stopc); |
| 1806 | |
| 1807 | if ((name = read_symbol_name ()) == NULL) |
| 1808 | goto out; |
| 1809 | |
| 1810 | /* Accept an optional comma after the name. The comma used to be |
| 1811 | required, but Irix 5 cc does not generate it for .lcomm. */ |
| 1812 | if (*input_line_pointer == ',') |
| 1813 | input_line_pointer++; |
| 1814 | |
| 1815 | temp = get_absolute_expr (&exp); |
| 1816 | size = temp; |
| 1817 | size &= ((addressT) 2 << (stdoutput->arch_info->bits_per_address - 1)) - 1; |
| 1818 | if (exp.X_op == O_absent) |
| 1819 | { |
| 1820 | as_bad (_("missing size expression")); |
| 1821 | ignore_rest_of_line (); |
| 1822 | goto out; |
| 1823 | } |
| 1824 | else if (temp != size || !exp.X_unsigned) |
| 1825 | { |
| 1826 | as_warn (_("size (%ld) out of range, ignored"), (long) temp); |
| 1827 | ignore_rest_of_line (); |
| 1828 | goto out; |
| 1829 | } |
| 1830 | |
| 1831 | symbolP = symbol_find_or_make (name); |
| 1832 | if ((S_IS_DEFINED (symbolP) || symbol_equated_p (symbolP)) |
| 1833 | && !S_IS_COMMON (symbolP)) |
| 1834 | { |
| 1835 | if (!S_IS_VOLATILE (symbolP)) |
| 1836 | { |
| 1837 | symbolP = NULL; |
| 1838 | as_bad (_("symbol `%s' is already defined"), name); |
| 1839 | ignore_rest_of_line (); |
| 1840 | goto out; |
| 1841 | } |
| 1842 | symbolP = symbol_clone (symbolP, 1); |
| 1843 | S_SET_SEGMENT (symbolP, undefined_section); |
| 1844 | S_SET_VALUE (symbolP, 0); |
| 1845 | symbol_set_frag (symbolP, &zero_address_frag); |
| 1846 | S_CLEAR_VOLATILE (symbolP); |
| 1847 | } |
| 1848 | |
| 1849 | size = S_GET_VALUE (symbolP); |
| 1850 | if (size == 0) |
| 1851 | size = temp; |
| 1852 | else if (size != temp) |
| 1853 | as_warn (_("size of \"%s\" is already %ld; not changing to %ld"), |
| 1854 | name, (long) size, (long) temp); |
| 1855 | |
| 1856 | if (comm_parse_extra != NULL) |
| 1857 | symbolP = (*comm_parse_extra) (param, symbolP, size); |
| 1858 | else |
| 1859 | { |
| 1860 | S_SET_VALUE (symbolP, (valueT) size); |
| 1861 | S_SET_EXTERNAL (symbolP); |
| 1862 | S_SET_SEGMENT (symbolP, bfd_com_section_ptr); |
| 1863 | } |
| 1864 | |
| 1865 | demand_empty_rest_of_line (); |
| 1866 | out: |
| 1867 | if (flag_mri) |
| 1868 | mri_comment_end (stop, stopc); |
| 1869 | free (name); |
| 1870 | return symbolP; |
| 1871 | } |
| 1872 | |
| 1873 | void |
| 1874 | s_comm (int ignore) |
| 1875 | { |
| 1876 | s_comm_internal (ignore, NULL); |
| 1877 | } |
| 1878 | |
| 1879 | /* The MRI COMMON pseudo-op. We handle this by creating a common |
| 1880 | symbol with the appropriate name. We make s_space do the right |
| 1881 | thing by increasing the size. */ |
| 1882 | |
| 1883 | void |
| 1884 | s_mri_common (int small ATTRIBUTE_UNUSED) |
| 1885 | { |
| 1886 | char *name; |
| 1887 | char c; |
| 1888 | char *alc = NULL; |
| 1889 | symbolS *sym; |
| 1890 | offsetT align; |
| 1891 | char *stop = NULL; |
| 1892 | char stopc = 0; |
| 1893 | |
| 1894 | if (!flag_mri) |
| 1895 | { |
| 1896 | s_comm (0); |
| 1897 | return; |
| 1898 | } |
| 1899 | |
| 1900 | stop = mri_comment_field (&stopc); |
| 1901 | |
| 1902 | SKIP_WHITESPACE (); |
| 1903 | |
| 1904 | name = input_line_pointer; |
| 1905 | if (!ISDIGIT (*name)) |
| 1906 | c = get_symbol_name (& name); |
| 1907 | else |
| 1908 | { |
| 1909 | do |
| 1910 | { |
| 1911 | ++input_line_pointer; |
| 1912 | } |
| 1913 | while (ISDIGIT (*input_line_pointer)); |
| 1914 | |
| 1915 | c = *input_line_pointer; |
| 1916 | *input_line_pointer = '\0'; |
| 1917 | |
| 1918 | if (line_label != NULL) |
| 1919 | { |
| 1920 | alc = XNEWVEC (char, strlen (S_GET_NAME (line_label)) |
| 1921 | + (input_line_pointer - name) + 1); |
| 1922 | sprintf (alc, "%s%s", name, S_GET_NAME (line_label)); |
| 1923 | name = alc; |
| 1924 | } |
| 1925 | } |
| 1926 | |
| 1927 | sym = symbol_find_or_make (name); |
| 1928 | c = restore_line_pointer (c); |
| 1929 | free (alc); |
| 1930 | |
| 1931 | if (*input_line_pointer != ',') |
| 1932 | align = 0; |
| 1933 | else |
| 1934 | { |
| 1935 | ++input_line_pointer; |
| 1936 | align = get_absolute_expression (); |
| 1937 | } |
| 1938 | |
| 1939 | if (S_IS_DEFINED (sym) && !S_IS_COMMON (sym)) |
| 1940 | { |
| 1941 | as_bad (_("symbol `%s' is already defined"), S_GET_NAME (sym)); |
| 1942 | ignore_rest_of_line (); |
| 1943 | mri_comment_end (stop, stopc); |
| 1944 | return; |
| 1945 | } |
| 1946 | |
| 1947 | S_SET_EXTERNAL (sym); |
| 1948 | S_SET_SEGMENT (sym, bfd_com_section_ptr); |
| 1949 | mri_common_symbol = sym; |
| 1950 | |
| 1951 | #ifdef S_SET_ALIGN |
| 1952 | if (align != 0) |
| 1953 | S_SET_ALIGN (sym, align); |
| 1954 | #else |
| 1955 | (void) align; |
| 1956 | #endif |
| 1957 | |
| 1958 | if (line_label != NULL) |
| 1959 | { |
| 1960 | expressionS exp; |
| 1961 | exp.X_op = O_symbol; |
| 1962 | exp.X_add_symbol = sym; |
| 1963 | exp.X_add_number = 0; |
| 1964 | symbol_set_value_expression (line_label, &exp); |
| 1965 | symbol_set_frag (line_label, &zero_address_frag); |
| 1966 | S_SET_SEGMENT (line_label, expr_section); |
| 1967 | } |
| 1968 | |
| 1969 | /* FIXME: We just ignore the small argument, which distinguishes |
| 1970 | COMMON and COMMON.S. I don't know what we can do about it. */ |
| 1971 | |
| 1972 | /* Ignore the type and hptype. */ |
| 1973 | if (*input_line_pointer == ',') |
| 1974 | input_line_pointer += 2; |
| 1975 | if (*input_line_pointer == ',') |
| 1976 | input_line_pointer += 2; |
| 1977 | |
| 1978 | demand_empty_rest_of_line (); |
| 1979 | |
| 1980 | mri_comment_end (stop, stopc); |
| 1981 | } |
| 1982 | |
| 1983 | void |
| 1984 | s_data (int ignore ATTRIBUTE_UNUSED) |
| 1985 | { |
| 1986 | segT section; |
| 1987 | int temp; |
| 1988 | |
| 1989 | temp = get_absolute_expression (); |
| 1990 | if (flag_readonly_data_in_text) |
| 1991 | { |
| 1992 | section = text_section; |
| 1993 | temp += 1000; |
| 1994 | } |
| 1995 | else |
| 1996 | section = data_section; |
| 1997 | |
| 1998 | subseg_set (section, (subsegT) temp); |
| 1999 | |
| 2000 | demand_empty_rest_of_line (); |
| 2001 | } |
| 2002 | |
| 2003 | /* Handle the .appfile pseudo-op. This is automatically generated by |
| 2004 | do_scrub_chars when a preprocessor # line comment is seen with a |
| 2005 | file name. This default definition may be overridden by the object |
| 2006 | or CPU specific pseudo-ops. This function is also the default |
| 2007 | definition for .file; the APPFILE argument is 1 for .appfile, 0 for |
| 2008 | .file. */ |
| 2009 | |
| 2010 | void |
| 2011 | s_app_file_string (char *file, int appfile ATTRIBUTE_UNUSED) |
| 2012 | { |
| 2013 | #ifdef LISTING |
| 2014 | if (listing) |
| 2015 | listing_source_file (file); |
| 2016 | #endif |
| 2017 | register_dependency (file); |
| 2018 | #ifdef obj_app_file |
| 2019 | obj_app_file (file, appfile); |
| 2020 | #endif |
| 2021 | } |
| 2022 | |
| 2023 | void |
| 2024 | s_app_file (int appfile) |
| 2025 | { |
| 2026 | char *s; |
| 2027 | int length; |
| 2028 | |
| 2029 | /* Some assemblers tolerate immediately following '"'. */ |
| 2030 | if ((s = demand_copy_string (&length)) != 0) |
| 2031 | { |
| 2032 | int may_omit |
| 2033 | = (!new_logical_line_flags (s, -1, 1) && appfile); |
| 2034 | |
| 2035 | /* In MRI mode, the preprocessor may have inserted an extraneous |
| 2036 | backquote. */ |
| 2037 | if (flag_m68k_mri |
| 2038 | && *input_line_pointer == '\'' |
| 2039 | && is_end_of_line[(unsigned char) input_line_pointer[1]]) |
| 2040 | ++input_line_pointer; |
| 2041 | |
| 2042 | demand_empty_rest_of_line (); |
| 2043 | if (!may_omit) |
| 2044 | s_app_file_string (s, appfile); |
| 2045 | } |
| 2046 | } |
| 2047 | |
| 2048 | static int |
| 2049 | get_linefile_number (int *flag) |
| 2050 | { |
| 2051 | SKIP_WHITESPACE (); |
| 2052 | |
| 2053 | if (*input_line_pointer < '0' || *input_line_pointer > '9') |
| 2054 | return 0; |
| 2055 | |
| 2056 | *flag = get_absolute_expression (); |
| 2057 | |
| 2058 | return 1; |
| 2059 | } |
| 2060 | |
| 2061 | /* Handle the .appline pseudo-op. This is automatically generated by |
| 2062 | do_scrub_chars when a preprocessor # line comment is seen. This |
| 2063 | default definition may be overridden by the object or CPU specific |
| 2064 | pseudo-ops. */ |
| 2065 | |
| 2066 | void |
| 2067 | s_app_line (int appline) |
| 2068 | { |
| 2069 | char *file = NULL; |
| 2070 | int l; |
| 2071 | |
| 2072 | /* The given number is that of the next line. */ |
| 2073 | if (appline) |
| 2074 | l = get_absolute_expression (); |
| 2075 | else if (!get_linefile_number (&l)) |
| 2076 | { |
| 2077 | ignore_rest_of_line (); |
| 2078 | return; |
| 2079 | } |
| 2080 | |
| 2081 | l--; |
| 2082 | |
| 2083 | if (l < -1) |
| 2084 | /* Some of the back ends can't deal with non-positive line numbers. |
| 2085 | Besides, it's silly. GCC however will generate a line number of |
| 2086 | zero when it is pre-processing builtins for assembler-with-cpp files: |
| 2087 | |
| 2088 | # 0 "<built-in>" |
| 2089 | |
| 2090 | We do not want to barf on this, especially since such files are used |
| 2091 | in the GCC and GDB testsuites. So we check for negative line numbers |
| 2092 | rather than non-positive line numbers. */ |
| 2093 | as_warn (_("line numbers must be positive; line number %d rejected"), |
| 2094 | l + 1); |
| 2095 | else |
| 2096 | { |
| 2097 | int flags = 0; |
| 2098 | int length = 0; |
| 2099 | |
| 2100 | if (!appline) |
| 2101 | { |
| 2102 | SKIP_WHITESPACE (); |
| 2103 | |
| 2104 | if (*input_line_pointer == '"') |
| 2105 | file = demand_copy_string (&length); |
| 2106 | |
| 2107 | if (file) |
| 2108 | { |
| 2109 | int this_flag; |
| 2110 | |
| 2111 | while (get_linefile_number (&this_flag)) |
| 2112 | switch (this_flag) |
| 2113 | { |
| 2114 | /* From GCC's cpp documentation: |
| 2115 | 1: start of a new file. |
| 2116 | 2: returning to a file after having included |
| 2117 | another file. |
| 2118 | 3: following text comes from a system header file. |
| 2119 | 4: following text should be treated as extern "C". |
| 2120 | |
| 2121 | 4 is nonsensical for the assembler; 3, we don't |
| 2122 | care about, so we ignore it just in case a |
| 2123 | system header file is included while |
| 2124 | preprocessing assembly. So 1 and 2 are all we |
| 2125 | care about, and they are mutually incompatible. |
| 2126 | new_logical_line_flags() demands this. */ |
| 2127 | case 1: |
| 2128 | case 2: |
| 2129 | if (flags && flags != (1 << this_flag)) |
| 2130 | as_warn (_("incompatible flag %i in line directive"), |
| 2131 | this_flag); |
| 2132 | else |
| 2133 | flags |= 1 << this_flag; |
| 2134 | break; |
| 2135 | |
| 2136 | case 3: |
| 2137 | case 4: |
| 2138 | /* We ignore these. */ |
| 2139 | break; |
| 2140 | |
| 2141 | default: |
| 2142 | as_warn (_("unsupported flag %i in line directive"), |
| 2143 | this_flag); |
| 2144 | break; |
| 2145 | } |
| 2146 | |
| 2147 | if (!is_end_of_line[(unsigned char)*input_line_pointer]) |
| 2148 | file = 0; |
| 2149 | } |
| 2150 | } |
| 2151 | |
| 2152 | if (appline || file) |
| 2153 | { |
| 2154 | new_logical_line_flags (file, l, flags); |
| 2155 | #ifdef LISTING |
| 2156 | if (listing) |
| 2157 | listing_source_line (l); |
| 2158 | #endif |
| 2159 | } |
| 2160 | } |
| 2161 | if (appline || file) |
| 2162 | demand_empty_rest_of_line (); |
| 2163 | else |
| 2164 | ignore_rest_of_line (); |
| 2165 | } |
| 2166 | |
| 2167 | /* Handle the .end pseudo-op. Actually, the real work is done in |
| 2168 | read_a_source_file. */ |
| 2169 | |
| 2170 | void |
| 2171 | s_end (int ignore ATTRIBUTE_UNUSED) |
| 2172 | { |
| 2173 | if (flag_mri) |
| 2174 | { |
| 2175 | /* The MRI assembler permits the start symbol to follow .end, |
| 2176 | but we don't support that. */ |
| 2177 | SKIP_WHITESPACE (); |
| 2178 | if (!is_end_of_line[(unsigned char) *input_line_pointer] |
| 2179 | && *input_line_pointer != '*' |
| 2180 | && *input_line_pointer != '!') |
| 2181 | as_warn (_("start address not supported")); |
| 2182 | } |
| 2183 | } |
| 2184 | |
| 2185 | /* Handle the .err pseudo-op. */ |
| 2186 | |
| 2187 | void |
| 2188 | s_err (int ignore ATTRIBUTE_UNUSED) |
| 2189 | { |
| 2190 | as_bad (_(".err encountered")); |
| 2191 | demand_empty_rest_of_line (); |
| 2192 | } |
| 2193 | |
| 2194 | /* Handle the .error and .warning pseudo-ops. */ |
| 2195 | |
| 2196 | void |
| 2197 | s_errwarn (int err) |
| 2198 | { |
| 2199 | int len; |
| 2200 | /* The purpose for the conditional assignment is not to |
| 2201 | internationalize the directive itself, but that we need a |
| 2202 | self-contained message, one that can be passed like the |
| 2203 | demand_copy_C_string return value, and with no assumption on the |
| 2204 | location of the name of the directive within the message. */ |
| 2205 | const char *msg |
| 2206 | = (err ? _(".error directive invoked in source file") |
| 2207 | : _(".warning directive invoked in source file")); |
| 2208 | |
| 2209 | if (!is_it_end_of_statement ()) |
| 2210 | { |
| 2211 | if (*input_line_pointer != '\"') |
| 2212 | { |
| 2213 | as_bad (_("%s argument must be a string"), |
| 2214 | err ? ".error" : ".warning"); |
| 2215 | ignore_rest_of_line (); |
| 2216 | return; |
| 2217 | } |
| 2218 | |
| 2219 | msg = demand_copy_C_string (&len); |
| 2220 | if (msg == NULL) |
| 2221 | return; |
| 2222 | } |
| 2223 | |
| 2224 | if (err) |
| 2225 | as_bad ("%s", msg); |
| 2226 | else |
| 2227 | as_warn ("%s", msg); |
| 2228 | demand_empty_rest_of_line (); |
| 2229 | } |
| 2230 | |
| 2231 | /* Handle the MRI fail pseudo-op. */ |
| 2232 | |
| 2233 | void |
| 2234 | s_fail (int ignore ATTRIBUTE_UNUSED) |
| 2235 | { |
| 2236 | offsetT temp; |
| 2237 | char *stop = NULL; |
| 2238 | char stopc = 0; |
| 2239 | |
| 2240 | if (flag_mri) |
| 2241 | stop = mri_comment_field (&stopc); |
| 2242 | |
| 2243 | temp = get_absolute_expression (); |
| 2244 | if (temp >= 500) |
| 2245 | as_warn (_(".fail %ld encountered"), (long) temp); |
| 2246 | else |
| 2247 | as_bad (_(".fail %ld encountered"), (long) temp); |
| 2248 | |
| 2249 | demand_empty_rest_of_line (); |
| 2250 | |
| 2251 | if (flag_mri) |
| 2252 | mri_comment_end (stop, stopc); |
| 2253 | } |
| 2254 | |
| 2255 | void |
| 2256 | s_fill (int ignore ATTRIBUTE_UNUSED) |
| 2257 | { |
| 2258 | expressionS rep_exp; |
| 2259 | long size = 1; |
| 2260 | long fill = 0; |
| 2261 | char *p; |
| 2262 | |
| 2263 | #ifdef md_flush_pending_output |
| 2264 | md_flush_pending_output (); |
| 2265 | #endif |
| 2266 | |
| 2267 | #ifdef md_cons_align |
| 2268 | md_cons_align (1); |
| 2269 | #endif |
| 2270 | |
| 2271 | expression (&rep_exp); |
| 2272 | if (*input_line_pointer == ',') |
| 2273 | { |
| 2274 | input_line_pointer++; |
| 2275 | size = get_absolute_expression (); |
| 2276 | if (*input_line_pointer == ',') |
| 2277 | { |
| 2278 | input_line_pointer++; |
| 2279 | fill = get_absolute_expression (); |
| 2280 | } |
| 2281 | } |
| 2282 | |
| 2283 | /* This is to be compatible with BSD 4.2 AS, not for any rational reason. */ |
| 2284 | #define BSD_FILL_SIZE_CROCK_8 (8) |
| 2285 | if (size > BSD_FILL_SIZE_CROCK_8) |
| 2286 | { |
| 2287 | as_warn (_(".fill size clamped to %d"), BSD_FILL_SIZE_CROCK_8); |
| 2288 | size = BSD_FILL_SIZE_CROCK_8; |
| 2289 | } |
| 2290 | if (size < 0) |
| 2291 | { |
| 2292 | as_warn (_("size negative; .fill ignored")); |
| 2293 | size = 0; |
| 2294 | } |
| 2295 | else if (rep_exp.X_op == O_constant && rep_exp.X_add_number <= 0) |
| 2296 | { |
| 2297 | if (rep_exp.X_add_number < 0) |
| 2298 | as_warn (_("repeat < 0; .fill ignored")); |
| 2299 | size = 0; |
| 2300 | } |
| 2301 | |
| 2302 | if (size && !need_pass_2) |
| 2303 | { |
| 2304 | if (now_seg == absolute_section) |
| 2305 | { |
| 2306 | if (rep_exp.X_op != O_constant) |
| 2307 | as_bad (_("non-constant fill count for absolute section")); |
| 2308 | else if (fill && rep_exp.X_add_number != 0) |
| 2309 | as_bad (_("attempt to fill absolute section with non-zero value")); |
| 2310 | abs_section_offset += rep_exp.X_add_number * size; |
| 2311 | } |
| 2312 | else if (fill |
| 2313 | && (rep_exp.X_op != O_constant || rep_exp.X_add_number != 0) |
| 2314 | && in_bss ()) |
| 2315 | as_bad (_("attempt to fill section `%s' with non-zero value"), |
| 2316 | segment_name (now_seg)); |
| 2317 | |
| 2318 | if (rep_exp.X_op == O_constant) |
| 2319 | { |
| 2320 | p = frag_var (rs_fill, (int) size, (int) size, |
| 2321 | (relax_substateT) 0, (symbolS *) 0, |
| 2322 | (offsetT) rep_exp.X_add_number, |
| 2323 | (char *) 0); |
| 2324 | } |
| 2325 | else |
| 2326 | { |
| 2327 | /* We don't have a constant repeat count, so we can't use |
| 2328 | rs_fill. We can get the same results out of rs_space, |
| 2329 | but its argument is in bytes, so we must multiply the |
| 2330 | repeat count by size. */ |
| 2331 | |
| 2332 | symbolS *rep_sym; |
| 2333 | rep_sym = make_expr_symbol (&rep_exp); |
| 2334 | if (size != 1) |
| 2335 | { |
| 2336 | expressionS size_exp; |
| 2337 | size_exp.X_op = O_constant; |
| 2338 | size_exp.X_add_number = size; |
| 2339 | |
| 2340 | rep_exp.X_op = O_multiply; |
| 2341 | rep_exp.X_add_symbol = rep_sym; |
| 2342 | rep_exp.X_op_symbol = make_expr_symbol (&size_exp); |
| 2343 | rep_exp.X_add_number = 0; |
| 2344 | rep_sym = make_expr_symbol (&rep_exp); |
| 2345 | } |
| 2346 | |
| 2347 | p = frag_var (rs_space, (int) size, (int) size, |
| 2348 | (relax_substateT) 0, rep_sym, (offsetT) 0, (char *) 0); |
| 2349 | } |
| 2350 | |
| 2351 | memset (p, 0, (unsigned int) size); |
| 2352 | |
| 2353 | /* The magic number BSD_FILL_SIZE_CROCK_4 is from BSD 4.2 VAX |
| 2354 | flavoured AS. The following bizarre behaviour is to be |
| 2355 | compatible with above. I guess they tried to take up to 8 |
| 2356 | bytes from a 4-byte expression and they forgot to sign |
| 2357 | extend. */ |
| 2358 | #define BSD_FILL_SIZE_CROCK_4 (4) |
| 2359 | md_number_to_chars (p, (valueT) fill, |
| 2360 | (size > BSD_FILL_SIZE_CROCK_4 |
| 2361 | ? BSD_FILL_SIZE_CROCK_4 |
| 2362 | : (int) size)); |
| 2363 | /* Note: .fill (),0 emits no frag (since we are asked to .fill 0 bytes) |
| 2364 | but emits no error message because it seems a legal thing to do. |
| 2365 | It is a degenerate case of .fill but could be emitted by a |
| 2366 | compiler. */ |
| 2367 | } |
| 2368 | demand_empty_rest_of_line (); |
| 2369 | } |
| 2370 | |
| 2371 | void |
| 2372 | s_globl (int ignore ATTRIBUTE_UNUSED) |
| 2373 | { |
| 2374 | char *name; |
| 2375 | int c; |
| 2376 | symbolS *symbolP; |
| 2377 | char *stop = NULL; |
| 2378 | char stopc = 0; |
| 2379 | |
| 2380 | if (flag_mri) |
| 2381 | stop = mri_comment_field (&stopc); |
| 2382 | |
| 2383 | do |
| 2384 | { |
| 2385 | if ((name = read_symbol_name ()) == NULL) |
| 2386 | return; |
| 2387 | |
| 2388 | symbolP = symbol_find_or_make (name); |
| 2389 | S_SET_EXTERNAL (symbolP); |
| 2390 | |
| 2391 | SKIP_WHITESPACE (); |
| 2392 | c = *input_line_pointer; |
| 2393 | if (c == ',') |
| 2394 | { |
| 2395 | input_line_pointer++; |
| 2396 | SKIP_WHITESPACE (); |
| 2397 | if (is_end_of_line[(unsigned char) *input_line_pointer]) |
| 2398 | c = '\n'; |
| 2399 | } |
| 2400 | |
| 2401 | free (name); |
| 2402 | } |
| 2403 | while (c == ','); |
| 2404 | |
| 2405 | demand_empty_rest_of_line (); |
| 2406 | |
| 2407 | if (flag_mri) |
| 2408 | mri_comment_end (stop, stopc); |
| 2409 | } |
| 2410 | |
| 2411 | /* Handle the MRI IRP and IRPC pseudo-ops. */ |
| 2412 | |
| 2413 | void |
| 2414 | s_irp (int irpc) |
| 2415 | { |
| 2416 | char * eol; |
| 2417 | const char * file; |
| 2418 | unsigned int line; |
| 2419 | sb s; |
| 2420 | const char *err; |
| 2421 | sb out; |
| 2422 | |
| 2423 | file = as_where (&line); |
| 2424 | |
| 2425 | eol = find_end_of_line (input_line_pointer, 0); |
| 2426 | sb_build (&s, eol - input_line_pointer); |
| 2427 | sb_add_buffer (&s, input_line_pointer, eol - input_line_pointer); |
| 2428 | input_line_pointer = eol; |
| 2429 | |
| 2430 | sb_new (&out); |
| 2431 | |
| 2432 | err = expand_irp (irpc, 0, &s, &out, get_non_macro_line_sb); |
| 2433 | if (err != NULL) |
| 2434 | as_bad_where (file, line, "%s", err); |
| 2435 | |
| 2436 | sb_kill (&s); |
| 2437 | |
| 2438 | input_scrub_include_sb (&out, input_line_pointer, 1); |
| 2439 | sb_kill (&out); |
| 2440 | buffer_limit = input_scrub_next_buffer (&input_line_pointer); |
| 2441 | } |
| 2442 | |
| 2443 | /* Handle the .linkonce pseudo-op. This tells the assembler to mark |
| 2444 | the section to only be linked once. However, this is not supported |
| 2445 | by most object file formats. This takes an optional argument, |
| 2446 | which is what to do about duplicates. */ |
| 2447 | |
| 2448 | void |
| 2449 | s_linkonce (int ignore ATTRIBUTE_UNUSED) |
| 2450 | { |
| 2451 | enum linkonce_type type; |
| 2452 | |
| 2453 | SKIP_WHITESPACE (); |
| 2454 | |
| 2455 | type = LINKONCE_DISCARD; |
| 2456 | |
| 2457 | if (!is_end_of_line[(unsigned char) *input_line_pointer]) |
| 2458 | { |
| 2459 | char *s; |
| 2460 | char c; |
| 2461 | |
| 2462 | c = get_symbol_name (& s); |
| 2463 | if (strcasecmp (s, "discard") == 0) |
| 2464 | type = LINKONCE_DISCARD; |
| 2465 | else if (strcasecmp (s, "one_only") == 0) |
| 2466 | type = LINKONCE_ONE_ONLY; |
| 2467 | else if (strcasecmp (s, "same_size") == 0) |
| 2468 | type = LINKONCE_SAME_SIZE; |
| 2469 | else if (strcasecmp (s, "same_contents") == 0) |
| 2470 | type = LINKONCE_SAME_CONTENTS; |
| 2471 | else |
| 2472 | as_warn (_("unrecognized .linkonce type `%s'"), s); |
| 2473 | |
| 2474 | (void) restore_line_pointer (c); |
| 2475 | } |
| 2476 | |
| 2477 | #ifdef obj_handle_link_once |
| 2478 | obj_handle_link_once (type); |
| 2479 | #else /* ! defined (obj_handle_link_once) */ |
| 2480 | { |
| 2481 | flagword flags; |
| 2482 | |
| 2483 | if ((bfd_applicable_section_flags (stdoutput) & SEC_LINK_ONCE) == 0) |
| 2484 | as_warn (_(".linkonce is not supported for this object file format")); |
| 2485 | |
| 2486 | flags = bfd_section_flags (now_seg); |
| 2487 | flags |= SEC_LINK_ONCE; |
| 2488 | switch (type) |
| 2489 | { |
| 2490 | default: |
| 2491 | abort (); |
| 2492 | case LINKONCE_DISCARD: |
| 2493 | flags |= SEC_LINK_DUPLICATES_DISCARD; |
| 2494 | break; |
| 2495 | case LINKONCE_ONE_ONLY: |
| 2496 | flags |= SEC_LINK_DUPLICATES_ONE_ONLY; |
| 2497 | break; |
| 2498 | case LINKONCE_SAME_SIZE: |
| 2499 | flags |= SEC_LINK_DUPLICATES_SAME_SIZE; |
| 2500 | break; |
| 2501 | case LINKONCE_SAME_CONTENTS: |
| 2502 | flags |= SEC_LINK_DUPLICATES_SAME_CONTENTS; |
| 2503 | break; |
| 2504 | } |
| 2505 | if (!bfd_set_section_flags (now_seg, flags)) |
| 2506 | as_bad (_("bfd_set_section_flags: %s"), |
| 2507 | bfd_errmsg (bfd_get_error ())); |
| 2508 | } |
| 2509 | #endif /* ! defined (obj_handle_link_once) */ |
| 2510 | |
| 2511 | demand_empty_rest_of_line (); |
| 2512 | } |
| 2513 | |
| 2514 | void |
| 2515 | bss_alloc (symbolS *symbolP, addressT size, unsigned int align) |
| 2516 | { |
| 2517 | char *pfrag; |
| 2518 | segT current_seg = now_seg; |
| 2519 | subsegT current_subseg = now_subseg; |
| 2520 | segT bss_seg = bss_section; |
| 2521 | |
| 2522 | #if defined (TC_MIPS) || defined (TC_ALPHA) |
| 2523 | if (OUTPUT_FLAVOR == bfd_target_ecoff_flavour |
| 2524 | || OUTPUT_FLAVOR == bfd_target_elf_flavour) |
| 2525 | { |
| 2526 | /* For MIPS and Alpha ECOFF or ELF, small objects are put in .sbss. */ |
| 2527 | if (size <= bfd_get_gp_size (stdoutput)) |
| 2528 | { |
| 2529 | bss_seg = subseg_new (".sbss", 1); |
| 2530 | seg_info (bss_seg)->bss = 1; |
| 2531 | if (!bfd_set_section_flags (bss_seg, SEC_ALLOC | SEC_SMALL_DATA)) |
| 2532 | as_warn (_("error setting flags for \".sbss\": %s"), |
| 2533 | bfd_errmsg (bfd_get_error ())); |
| 2534 | } |
| 2535 | } |
| 2536 | #endif |
| 2537 | subseg_set (bss_seg, 1); |
| 2538 | |
| 2539 | if (align > OCTETS_PER_BYTE_POWER) |
| 2540 | { |
| 2541 | record_alignment (bss_seg, align); |
| 2542 | frag_align (align, 0, 0); |
| 2543 | } |
| 2544 | |
| 2545 | /* Detach from old frag. */ |
| 2546 | if (S_GET_SEGMENT (symbolP) == bss_seg) |
| 2547 | symbol_get_frag (symbolP)->fr_symbol = NULL; |
| 2548 | |
| 2549 | symbol_set_frag (symbolP, frag_now); |
| 2550 | pfrag = frag_var (rs_org, 1, 1, 0, symbolP, size * OCTETS_PER_BYTE, NULL); |
| 2551 | *pfrag = 0; |
| 2552 | |
| 2553 | #ifdef S_SET_SIZE |
| 2554 | S_SET_SIZE (symbolP, size); |
| 2555 | #endif |
| 2556 | S_SET_SEGMENT (symbolP, bss_seg); |
| 2557 | |
| 2558 | #ifdef OBJ_COFF |
| 2559 | /* The symbol may already have been created with a preceding |
| 2560 | ".globl" directive -- be careful not to step on storage class |
| 2561 | in that case. Otherwise, set it to static. */ |
| 2562 | if (S_GET_STORAGE_CLASS (symbolP) != C_EXT) |
| 2563 | S_SET_STORAGE_CLASS (symbolP, C_STAT); |
| 2564 | #endif /* OBJ_COFF */ |
| 2565 | |
| 2566 | subseg_set (current_seg, current_subseg); |
| 2567 | } |
| 2568 | |
| 2569 | offsetT |
| 2570 | parse_align (int align_bytes) |
| 2571 | { |
| 2572 | expressionS exp; |
| 2573 | addressT align; |
| 2574 | |
| 2575 | SKIP_WHITESPACE (); |
| 2576 | if (*input_line_pointer != ',') |
| 2577 | { |
| 2578 | no_align: |
| 2579 | as_bad (_("expected alignment after size")); |
| 2580 | ignore_rest_of_line (); |
| 2581 | return -1; |
| 2582 | } |
| 2583 | |
| 2584 | input_line_pointer++; |
| 2585 | SKIP_WHITESPACE (); |
| 2586 | |
| 2587 | align = get_absolute_expr (&exp); |
| 2588 | if (exp.X_op == O_absent) |
| 2589 | goto no_align; |
| 2590 | |
| 2591 | if (!exp.X_unsigned) |
| 2592 | { |
| 2593 | as_warn (_("alignment negative; 0 assumed")); |
| 2594 | align = 0; |
| 2595 | } |
| 2596 | |
| 2597 | if (align_bytes && align != 0) |
| 2598 | { |
| 2599 | /* convert to a power of 2 alignment */ |
| 2600 | unsigned int alignp2 = 0; |
| 2601 | while ((align & 1) == 0) |
| 2602 | align >>= 1, ++alignp2; |
| 2603 | if (align != 1) |
| 2604 | { |
| 2605 | as_bad (_("alignment not a power of 2")); |
| 2606 | ignore_rest_of_line (); |
| 2607 | return -1; |
| 2608 | } |
| 2609 | align = alignp2; |
| 2610 | } |
| 2611 | return align; |
| 2612 | } |
| 2613 | |
| 2614 | /* Called from s_comm_internal after symbol name and size have been |
| 2615 | parsed. NEEDS_ALIGN is 0 if it was an ".lcomm" (2 args only), |
| 2616 | 1 if this was a ".bss" directive which has a 3rd argument |
| 2617 | (alignment as a power of 2), or 2 if this was a ".bss" directive |
| 2618 | with alignment in bytes. */ |
| 2619 | |
| 2620 | symbolS * |
| 2621 | s_lcomm_internal (int needs_align, symbolS *symbolP, addressT size) |
| 2622 | { |
| 2623 | addressT align = 0; |
| 2624 | |
| 2625 | if (needs_align) |
| 2626 | { |
| 2627 | align = parse_align (needs_align - 1); |
| 2628 | if (align == (addressT) -1) |
| 2629 | return NULL; |
| 2630 | } |
| 2631 | else |
| 2632 | /* Assume some objects may require alignment on some systems. */ |
| 2633 | TC_IMPLICIT_LCOMM_ALIGNMENT (size, align); |
| 2634 | |
| 2635 | bss_alloc (symbolP, size, align); |
| 2636 | return symbolP; |
| 2637 | } |
| 2638 | |
| 2639 | void |
| 2640 | s_lcomm (int needs_align) |
| 2641 | { |
| 2642 | s_comm_internal (needs_align, s_lcomm_internal); |
| 2643 | } |
| 2644 | |
| 2645 | void |
| 2646 | s_lcomm_bytes (int needs_align) |
| 2647 | { |
| 2648 | s_comm_internal (needs_align * 2, s_lcomm_internal); |
| 2649 | } |
| 2650 | |
| 2651 | void |
| 2652 | s_lsym (int ignore ATTRIBUTE_UNUSED) |
| 2653 | { |
| 2654 | char *name; |
| 2655 | expressionS exp; |
| 2656 | symbolS *symbolP; |
| 2657 | |
| 2658 | /* We permit ANY defined expression: BSD4.2 demands constants. */ |
| 2659 | if ((name = read_symbol_name ()) == NULL) |
| 2660 | return; |
| 2661 | |
| 2662 | if (*input_line_pointer != ',') |
| 2663 | { |
| 2664 | as_bad (_("expected comma after \"%s\""), name); |
| 2665 | goto err_out; |
| 2666 | } |
| 2667 | |
| 2668 | input_line_pointer++; |
| 2669 | expression_and_evaluate (&exp); |
| 2670 | |
| 2671 | if (exp.X_op != O_constant |
| 2672 | && exp.X_op != O_register) |
| 2673 | { |
| 2674 | as_bad (_("bad expression")); |
| 2675 | goto err_out; |
| 2676 | } |
| 2677 | |
| 2678 | symbolP = symbol_find_or_make (name); |
| 2679 | |
| 2680 | if (S_GET_SEGMENT (symbolP) == undefined_section) |
| 2681 | { |
| 2682 | /* The name might be an undefined .global symbol; be sure to |
| 2683 | keep the "external" bit. */ |
| 2684 | S_SET_SEGMENT (symbolP, |
| 2685 | (exp.X_op == O_constant |
| 2686 | ? absolute_section |
| 2687 | : reg_section)); |
| 2688 | S_SET_VALUE (symbolP, (valueT) exp.X_add_number); |
| 2689 | } |
| 2690 | else |
| 2691 | { |
| 2692 | as_bad (_("symbol `%s' is already defined"), name); |
| 2693 | } |
| 2694 | |
| 2695 | demand_empty_rest_of_line (); |
| 2696 | free (name); |
| 2697 | return; |
| 2698 | |
| 2699 | err_out: |
| 2700 | ignore_rest_of_line (); |
| 2701 | free (name); |
| 2702 | return; |
| 2703 | } |
| 2704 | |
| 2705 | /* Read a line into an sb. Returns the character that ended the line |
| 2706 | or zero if there are no more lines. */ |
| 2707 | |
| 2708 | static int |
| 2709 | get_line_sb (sb *line, int in_macro) |
| 2710 | { |
| 2711 | char *eol; |
| 2712 | |
| 2713 | if (input_line_pointer[-1] == '\n') |
| 2714 | bump_line_counters (); |
| 2715 | |
| 2716 | if (input_line_pointer >= buffer_limit) |
| 2717 | { |
| 2718 | buffer_limit = input_scrub_next_buffer (&input_line_pointer); |
| 2719 | if (buffer_limit == 0) |
| 2720 | return 0; |
| 2721 | } |
| 2722 | |
| 2723 | eol = _find_end_of_line (input_line_pointer, flag_m68k_mri, 0, in_macro); |
| 2724 | sb_add_buffer (line, input_line_pointer, eol - input_line_pointer); |
| 2725 | input_line_pointer = eol; |
| 2726 | |
| 2727 | /* Don't skip multiple end-of-line characters, because that breaks support |
| 2728 | for the IA-64 stop bit (;;) which looks like two consecutive end-of-line |
| 2729 | characters but isn't. Instead just skip one end of line character and |
| 2730 | return the character skipped so that the caller can re-insert it if |
| 2731 | necessary. */ |
| 2732 | return *input_line_pointer++; |
| 2733 | } |
| 2734 | |
| 2735 | static size_t |
| 2736 | get_non_macro_line_sb (sb *line) |
| 2737 | { |
| 2738 | return get_line_sb (line, 0); |
| 2739 | } |
| 2740 | |
| 2741 | static size_t |
| 2742 | get_macro_line_sb (sb *line) |
| 2743 | { |
| 2744 | return get_line_sb (line, 1); |
| 2745 | } |
| 2746 | |
| 2747 | /* Define a macro. This is an interface to macro.c. */ |
| 2748 | |
| 2749 | void |
| 2750 | s_macro (int ignore ATTRIBUTE_UNUSED) |
| 2751 | { |
| 2752 | char *eol; |
| 2753 | const char * file; |
| 2754 | unsigned int line; |
| 2755 | sb s; |
| 2756 | const char *err; |
| 2757 | const char *name; |
| 2758 | |
| 2759 | file = as_where (&line); |
| 2760 | |
| 2761 | eol = find_end_of_line (input_line_pointer, 0); |
| 2762 | sb_build (&s, eol - input_line_pointer); |
| 2763 | sb_add_buffer (&s, input_line_pointer, eol - input_line_pointer); |
| 2764 | input_line_pointer = eol; |
| 2765 | |
| 2766 | if (line_label != NULL) |
| 2767 | { |
| 2768 | sb label; |
| 2769 | size_t len; |
| 2770 | |
| 2771 | name = S_GET_NAME (line_label); |
| 2772 | len = strlen (name); |
| 2773 | sb_build (&label, len); |
| 2774 | sb_add_buffer (&label, name, len); |
| 2775 | err = define_macro (0, &s, &label, get_macro_line_sb, file, line, &name); |
| 2776 | sb_kill (&label); |
| 2777 | } |
| 2778 | else |
| 2779 | err = define_macro (0, &s, NULL, get_macro_line_sb, file, line, &name); |
| 2780 | if (err != NULL) |
| 2781 | as_bad_where (file, line, err, name); |
| 2782 | else |
| 2783 | { |
| 2784 | if (line_label != NULL) |
| 2785 | { |
| 2786 | S_SET_SEGMENT (line_label, absolute_section); |
| 2787 | S_SET_VALUE (line_label, 0); |
| 2788 | symbol_set_frag (line_label, &zero_address_frag); |
| 2789 | } |
| 2790 | |
| 2791 | if (((NO_PSEUDO_DOT || flag_m68k_mri) |
| 2792 | && po_entry_find (po_hash, name) != NULL) |
| 2793 | || (!flag_m68k_mri |
| 2794 | && *name == '.' |
| 2795 | && po_entry_find (po_hash, name + 1) != NULL)) |
| 2796 | as_warn_where (file, |
| 2797 | line, |
| 2798 | _("attempt to redefine pseudo-op `%s' ignored"), |
| 2799 | name); |
| 2800 | } |
| 2801 | |
| 2802 | sb_kill (&s); |
| 2803 | } |
| 2804 | |
| 2805 | /* Handle the .mexit pseudo-op, which immediately exits a macro |
| 2806 | expansion. */ |
| 2807 | |
| 2808 | void |
| 2809 | s_mexit (int ignore ATTRIBUTE_UNUSED) |
| 2810 | { |
| 2811 | if (macro_nest) |
| 2812 | { |
| 2813 | cond_exit_macro (macro_nest); |
| 2814 | buffer_limit = input_scrub_next_buffer (&input_line_pointer); |
| 2815 | } |
| 2816 | else |
| 2817 | as_warn (_("ignoring macro exit outside a macro definition.")); |
| 2818 | } |
| 2819 | |
| 2820 | /* Switch in and out of MRI mode. */ |
| 2821 | |
| 2822 | void |
| 2823 | s_mri (int ignore ATTRIBUTE_UNUSED) |
| 2824 | { |
| 2825 | int on; |
| 2826 | #ifdef MRI_MODE_CHANGE |
| 2827 | int old_flag; |
| 2828 | #endif |
| 2829 | |
| 2830 | on = get_absolute_expression (); |
| 2831 | #ifdef MRI_MODE_CHANGE |
| 2832 | old_flag = flag_mri; |
| 2833 | #endif |
| 2834 | if (on != 0) |
| 2835 | { |
| 2836 | flag_mri = 1; |
| 2837 | #ifdef TC_M68K |
| 2838 | flag_m68k_mri = 1; |
| 2839 | #endif |
| 2840 | macro_mri_mode (1); |
| 2841 | } |
| 2842 | else |
| 2843 | { |
| 2844 | flag_mri = 0; |
| 2845 | #ifdef TC_M68K |
| 2846 | flag_m68k_mri = 0; |
| 2847 | #endif |
| 2848 | macro_mri_mode (0); |
| 2849 | } |
| 2850 | |
| 2851 | /* Operator precedence changes in m68k MRI mode, so we need to |
| 2852 | update the operator rankings. */ |
| 2853 | expr_set_precedence (); |
| 2854 | |
| 2855 | #ifdef MRI_MODE_CHANGE |
| 2856 | if (on != old_flag) |
| 2857 | MRI_MODE_CHANGE (on); |
| 2858 | #endif |
| 2859 | |
| 2860 | demand_empty_rest_of_line (); |
| 2861 | } |
| 2862 | |
| 2863 | /* Handle changing the location counter. */ |
| 2864 | |
| 2865 | static void |
| 2866 | do_org (segT segment, expressionS *exp, int fill) |
| 2867 | { |
| 2868 | if (segment != now_seg |
| 2869 | && segment != absolute_section |
| 2870 | && segment != expr_section) |
| 2871 | as_bad (_("invalid segment \"%s\""), segment_name (segment)); |
| 2872 | |
| 2873 | if (now_seg == absolute_section) |
| 2874 | { |
| 2875 | if (fill != 0) |
| 2876 | as_warn (_("ignoring fill value in absolute section")); |
| 2877 | if (exp->X_op != O_constant) |
| 2878 | { |
| 2879 | as_bad (_("only constant offsets supported in absolute section")); |
| 2880 | exp->X_add_number = 0; |
| 2881 | } |
| 2882 | abs_section_offset = exp->X_add_number; |
| 2883 | } |
| 2884 | else |
| 2885 | { |
| 2886 | char *p; |
| 2887 | symbolS *sym = exp->X_add_symbol; |
| 2888 | offsetT off = exp->X_add_number * OCTETS_PER_BYTE; |
| 2889 | |
| 2890 | if (fill && in_bss ()) |
| 2891 | as_warn (_("ignoring fill value in section `%s'"), |
| 2892 | segment_name (now_seg)); |
| 2893 | |
| 2894 | if (exp->X_op != O_constant && exp->X_op != O_symbol) |
| 2895 | { |
| 2896 | /* Handle complex expressions. */ |
| 2897 | sym = make_expr_symbol (exp); |
| 2898 | off = 0; |
| 2899 | } |
| 2900 | |
| 2901 | p = frag_var (rs_org, 1, 1, (relax_substateT) 0, sym, off, (char *) 0); |
| 2902 | *p = fill; |
| 2903 | } |
| 2904 | } |
| 2905 | |
| 2906 | void |
| 2907 | s_org (int ignore ATTRIBUTE_UNUSED) |
| 2908 | { |
| 2909 | segT segment; |
| 2910 | expressionS exp; |
| 2911 | long temp_fill; |
| 2912 | |
| 2913 | #ifdef md_flush_pending_output |
| 2914 | md_flush_pending_output (); |
| 2915 | #endif |
| 2916 | |
| 2917 | /* The m68k MRI assembler has a different meaning for .org. It |
| 2918 | means to create an absolute section at a given address. We can't |
| 2919 | support that--use a linker script instead. */ |
| 2920 | if (flag_m68k_mri) |
| 2921 | { |
| 2922 | as_bad (_("MRI style ORG pseudo-op not supported")); |
| 2923 | ignore_rest_of_line (); |
| 2924 | return; |
| 2925 | } |
| 2926 | |
| 2927 | /* Don't believe the documentation of BSD 4.2 AS. There is no such |
| 2928 | thing as a sub-segment-relative origin. Any absolute origin is |
| 2929 | given a warning, then assumed to be segment-relative. Any |
| 2930 | segmented origin expression ("foo+42") had better be in the right |
| 2931 | segment or the .org is ignored. |
| 2932 | |
| 2933 | BSD 4.2 AS warns if you try to .org backwards. We cannot because |
| 2934 | we never know sub-segment sizes when we are reading code. BSD |
| 2935 | will crash trying to emit negative numbers of filler bytes in |
| 2936 | certain .orgs. We don't crash, but see as-write for that code. |
| 2937 | |
| 2938 | Don't make frag if need_pass_2==1. */ |
| 2939 | segment = get_known_segmented_expression (&exp); |
| 2940 | if (*input_line_pointer == ',') |
| 2941 | { |
| 2942 | input_line_pointer++; |
| 2943 | temp_fill = get_absolute_expression (); |
| 2944 | } |
| 2945 | else |
| 2946 | temp_fill = 0; |
| 2947 | |
| 2948 | if (!need_pass_2) |
| 2949 | do_org (segment, &exp, temp_fill); |
| 2950 | |
| 2951 | demand_empty_rest_of_line (); |
| 2952 | } |
| 2953 | |
| 2954 | /* Handle parsing for the MRI SECT/SECTION pseudo-op. This should be |
| 2955 | called by the obj-format routine which handles section changing |
| 2956 | when in MRI mode. It will create a new section, and return it. It |
| 2957 | will set *TYPE to the section type: one of 'C' (code), 'D' (data), |
| 2958 | 'M' (mixed), or 'R' (romable). The flags will be set in the section. */ |
| 2959 | |
| 2960 | void |
| 2961 | s_mri_sect (char *type ATTRIBUTE_UNUSED) |
| 2962 | { |
| 2963 | #ifdef TC_M68K |
| 2964 | |
| 2965 | char *name; |
| 2966 | char c; |
| 2967 | segT seg; |
| 2968 | |
| 2969 | SKIP_WHITESPACE (); |
| 2970 | |
| 2971 | name = input_line_pointer; |
| 2972 | if (!ISDIGIT (*name)) |
| 2973 | c = get_symbol_name (& name); |
| 2974 | else |
| 2975 | { |
| 2976 | do |
| 2977 | { |
| 2978 | ++input_line_pointer; |
| 2979 | } |
| 2980 | while (ISDIGIT (*input_line_pointer)); |
| 2981 | |
| 2982 | c = *input_line_pointer; |
| 2983 | *input_line_pointer = '\0'; |
| 2984 | } |
| 2985 | |
| 2986 | name = xstrdup (name); |
| 2987 | |
| 2988 | c = restore_line_pointer (c); |
| 2989 | |
| 2990 | seg = subseg_new (name, 0); |
| 2991 | |
| 2992 | if (c == ',') |
| 2993 | { |
| 2994 | unsigned int align; |
| 2995 | |
| 2996 | ++input_line_pointer; |
| 2997 | align = get_absolute_expression (); |
| 2998 | record_alignment (seg, align); |
| 2999 | } |
| 3000 | |
| 3001 | *type = 'C'; |
| 3002 | if (*input_line_pointer == ',') |
| 3003 | { |
| 3004 | c = *++input_line_pointer; |
| 3005 | c = TOUPPER (c); |
| 3006 | if (c == 'C' || c == 'D' || c == 'M' || c == 'R') |
| 3007 | *type = c; |
| 3008 | else |
| 3009 | as_bad (_("unrecognized section type")); |
| 3010 | ++input_line_pointer; |
| 3011 | |
| 3012 | { |
| 3013 | flagword flags; |
| 3014 | |
| 3015 | flags = SEC_NO_FLAGS; |
| 3016 | if (*type == 'C') |
| 3017 | flags = SEC_ALLOC | SEC_LOAD | SEC_READONLY | SEC_CODE; |
| 3018 | else if (*type == 'D' || *type == 'M') |
| 3019 | flags = SEC_ALLOC | SEC_LOAD | SEC_DATA; |
| 3020 | else if (*type == 'R') |
| 3021 | flags = SEC_ALLOC | SEC_LOAD | SEC_DATA | SEC_READONLY | SEC_ROM; |
| 3022 | if (flags != SEC_NO_FLAGS) |
| 3023 | { |
| 3024 | if (!bfd_set_section_flags (seg, flags)) |
| 3025 | as_warn (_("error setting flags for \"%s\": %s"), |
| 3026 | bfd_section_name (seg), |
| 3027 | bfd_errmsg (bfd_get_error ())); |
| 3028 | } |
| 3029 | } |
| 3030 | } |
| 3031 | |
| 3032 | /* Ignore the HP type. */ |
| 3033 | if (*input_line_pointer == ',') |
| 3034 | input_line_pointer += 2; |
| 3035 | |
| 3036 | demand_empty_rest_of_line (); |
| 3037 | |
| 3038 | #else /* ! TC_M68K */ |
| 3039 | /* The MRI assembler seems to use different forms of .sect for |
| 3040 | different targets. */ |
| 3041 | as_bad ("MRI mode not supported for this target"); |
| 3042 | ignore_rest_of_line (); |
| 3043 | #endif /* ! TC_M68K */ |
| 3044 | } |
| 3045 | |
| 3046 | /* Handle the .print pseudo-op. */ |
| 3047 | |
| 3048 | void |
| 3049 | s_print (int ignore ATTRIBUTE_UNUSED) |
| 3050 | { |
| 3051 | char *s; |
| 3052 | int len; |
| 3053 | |
| 3054 | s = demand_copy_C_string (&len); |
| 3055 | if (s != NULL) |
| 3056 | printf ("%s\n", s); |
| 3057 | demand_empty_rest_of_line (); |
| 3058 | } |
| 3059 | |
| 3060 | /* Handle the .purgem pseudo-op. */ |
| 3061 | |
| 3062 | void |
| 3063 | s_purgem (int ignore ATTRIBUTE_UNUSED) |
| 3064 | { |
| 3065 | if (is_it_end_of_statement ()) |
| 3066 | { |
| 3067 | demand_empty_rest_of_line (); |
| 3068 | return; |
| 3069 | } |
| 3070 | |
| 3071 | do |
| 3072 | { |
| 3073 | char *name; |
| 3074 | char c; |
| 3075 | |
| 3076 | SKIP_WHITESPACE (); |
| 3077 | c = get_symbol_name (& name); |
| 3078 | delete_macro (name); |
| 3079 | *input_line_pointer = c; |
| 3080 | SKIP_WHITESPACE_AFTER_NAME (); |
| 3081 | } |
| 3082 | while (*input_line_pointer++ == ','); |
| 3083 | |
| 3084 | --input_line_pointer; |
| 3085 | demand_empty_rest_of_line (); |
| 3086 | } |
| 3087 | |
| 3088 | /* Handle the .endm/.endr pseudo-ops. */ |
| 3089 | |
| 3090 | static void |
| 3091 | s_bad_end (int endr) |
| 3092 | { |
| 3093 | as_warn (_(".end%c encountered without preceding %s"), |
| 3094 | endr ? 'r' : 'm', |
| 3095 | endr ? ".rept, .irp, or .irpc" : ".macro"); |
| 3096 | demand_empty_rest_of_line (); |
| 3097 | } |
| 3098 | |
| 3099 | /* Handle the .rept pseudo-op. */ |
| 3100 | |
| 3101 | void |
| 3102 | s_rept (int ignore ATTRIBUTE_UNUSED) |
| 3103 | { |
| 3104 | size_t count; |
| 3105 | |
| 3106 | count = (size_t) get_absolute_expression (); |
| 3107 | |
| 3108 | do_repeat (count, "REPT", "ENDR"); |
| 3109 | } |
| 3110 | |
| 3111 | /* This function provides a generic repeat block implementation. It allows |
| 3112 | different directives to be used as the start/end keys. */ |
| 3113 | |
| 3114 | void |
| 3115 | do_repeat (size_t count, const char *start, const char *end) |
| 3116 | { |
| 3117 | sb one; |
| 3118 | sb many; |
| 3119 | |
| 3120 | if (((ssize_t) count) < 0) |
| 3121 | { |
| 3122 | as_bad (_("negative count for %s - ignored"), start); |
| 3123 | count = 0; |
| 3124 | } |
| 3125 | |
| 3126 | sb_new (&one); |
| 3127 | if (!buffer_and_nest (start, end, &one, get_non_macro_line_sb)) |
| 3128 | { |
| 3129 | as_bad (_("%s without %s"), start, end); |
| 3130 | return; |
| 3131 | } |
| 3132 | |
| 3133 | sb_build (&many, count * one.len); |
| 3134 | while (count-- > 0) |
| 3135 | sb_add_sb (&many, &one); |
| 3136 | |
| 3137 | sb_kill (&one); |
| 3138 | |
| 3139 | input_scrub_include_sb (&many, input_line_pointer, 1); |
| 3140 | sb_kill (&many); |
| 3141 | buffer_limit = input_scrub_next_buffer (&input_line_pointer); |
| 3142 | } |
| 3143 | |
| 3144 | /* Like do_repeat except that any text matching EXPANDER in the |
| 3145 | block is replaced by the iteration count. */ |
| 3146 | |
| 3147 | void |
| 3148 | do_repeat_with_expander (size_t count, |
| 3149 | const char * start, |
| 3150 | const char * end, |
| 3151 | const char * expander) |
| 3152 | { |
| 3153 | sb one; |
| 3154 | sb many; |
| 3155 | |
| 3156 | if (((ssize_t) count) < 0) |
| 3157 | { |
| 3158 | as_bad (_("negative count for %s - ignored"), start); |
| 3159 | count = 0; |
| 3160 | } |
| 3161 | |
| 3162 | sb_new (&one); |
| 3163 | if (!buffer_and_nest (start, end, &one, get_non_macro_line_sb)) |
| 3164 | { |
| 3165 | as_bad (_("%s without %s"), start, end); |
| 3166 | return; |
| 3167 | } |
| 3168 | |
| 3169 | sb_new (&many); |
| 3170 | |
| 3171 | if (expander != NULL && strstr (one.ptr, expander) != NULL) |
| 3172 | { |
| 3173 | while (count -- > 0) |
| 3174 | { |
| 3175 | int len; |
| 3176 | char * sub; |
| 3177 | sb processed; |
| 3178 | |
| 3179 | sb_build (& processed, one.len); |
| 3180 | sb_add_sb (& processed, & one); |
| 3181 | sub = strstr (processed.ptr, expander); |
| 3182 | len = sprintf (sub, "%lu", (unsigned long) count); |
| 3183 | gas_assert (len < 8); |
| 3184 | memmove (sub + len, sub + 8, |
| 3185 | processed.ptr + processed.len - (sub + 8)); |
| 3186 | processed.len -= (8 - len); |
| 3187 | sb_add_sb (& many, & processed); |
| 3188 | sb_kill (& processed); |
| 3189 | } |
| 3190 | } |
| 3191 | else |
| 3192 | while (count-- > 0) |
| 3193 | sb_add_sb (&many, &one); |
| 3194 | |
| 3195 | sb_kill (&one); |
| 3196 | |
| 3197 | input_scrub_include_sb (&many, input_line_pointer, 1); |
| 3198 | sb_kill (&many); |
| 3199 | buffer_limit = input_scrub_next_buffer (&input_line_pointer); |
| 3200 | } |
| 3201 | |
| 3202 | /* Skip to end of current repeat loop; EXTRA indicates how many additional |
| 3203 | input buffers to skip. Assumes that conditionals preceding the loop end |
| 3204 | are properly nested. |
| 3205 | |
| 3206 | This function makes it easier to implement a premature "break" out of the |
| 3207 | loop. The EXTRA arg accounts for other buffers we might have inserted, |
| 3208 | such as line substitutions. */ |
| 3209 | |
| 3210 | void |
| 3211 | end_repeat (int extra) |
| 3212 | { |
| 3213 | cond_exit_macro (macro_nest); |
| 3214 | while (extra-- >= 0) |
| 3215 | buffer_limit = input_scrub_next_buffer (&input_line_pointer); |
| 3216 | } |
| 3217 | |
| 3218 | static void |
| 3219 | assign_symbol (char *name, int mode) |
| 3220 | { |
| 3221 | symbolS *symbolP; |
| 3222 | |
| 3223 | if (name[0] == '.' && name[1] == '\0') |
| 3224 | { |
| 3225 | /* Turn '. = mumble' into a .org mumble. */ |
| 3226 | segT segment; |
| 3227 | expressionS exp; |
| 3228 | |
| 3229 | segment = get_known_segmented_expression (&exp); |
| 3230 | |
| 3231 | if (!need_pass_2) |
| 3232 | do_org (segment, &exp, 0); |
| 3233 | |
| 3234 | return; |
| 3235 | } |
| 3236 | |
| 3237 | if ((symbolP = symbol_find (name)) == NULL |
| 3238 | && (symbolP = md_undefined_symbol (name)) == NULL) |
| 3239 | { |
| 3240 | symbolP = symbol_find_or_make (name); |
| 3241 | #ifndef NO_LISTING |
| 3242 | /* When doing symbol listings, play games with dummy fragments living |
| 3243 | outside the normal fragment chain to record the file and line info |
| 3244 | for this symbol. */ |
| 3245 | if (listing & LISTING_SYMBOLS) |
| 3246 | { |
| 3247 | extern struct list_info_struct *listing_tail; |
| 3248 | fragS *dummy_frag = XCNEW (fragS); |
| 3249 | dummy_frag->line = listing_tail; |
| 3250 | dummy_frag->fr_symbol = symbolP; |
| 3251 | symbol_set_frag (symbolP, dummy_frag); |
| 3252 | } |
| 3253 | #endif |
| 3254 | #if defined (OBJ_COFF) && !defined (TE_PE) |
| 3255 | /* "set" symbols are local unless otherwise specified. */ |
| 3256 | SF_SET_LOCAL (symbolP); |
| 3257 | #endif |
| 3258 | } |
| 3259 | |
| 3260 | if (S_IS_DEFINED (symbolP) || symbol_equated_p (symbolP)) |
| 3261 | { |
| 3262 | if ((mode != 0 || !S_IS_VOLATILE (symbolP)) |
| 3263 | && !S_CAN_BE_REDEFINED (symbolP)) |
| 3264 | { |
| 3265 | as_bad (_("symbol `%s' is already defined"), name); |
| 3266 | ignore_rest_of_line (); |
| 3267 | input_line_pointer--; |
| 3268 | return; |
| 3269 | } |
| 3270 | /* If the symbol is volatile, copy the symbol and replace the |
| 3271 | original with the copy, so that previous uses of the symbol will |
| 3272 | retain the value of the symbol at the point of use. */ |
| 3273 | else if (S_IS_VOLATILE (symbolP)) |
| 3274 | symbolP = symbol_clone (symbolP, 1); |
| 3275 | } |
| 3276 | |
| 3277 | if (mode == 0) |
| 3278 | S_SET_VOLATILE (symbolP); |
| 3279 | else if (mode < 0) |
| 3280 | S_SET_FORWARD_REF (symbolP); |
| 3281 | |
| 3282 | pseudo_set (symbolP); |
| 3283 | } |
| 3284 | |
| 3285 | /* Handle the .equ, .equiv, .eqv, and .set directives. If EQUIV is 1, |
| 3286 | then this is .equiv, and it is an error if the symbol is already |
| 3287 | defined. If EQUIV is -1, the symbol additionally is a forward |
| 3288 | reference. */ |
| 3289 | |
| 3290 | void |
| 3291 | s_set (int equiv) |
| 3292 | { |
| 3293 | char *name; |
| 3294 | |
| 3295 | /* Especial apologies for the random logic: |
| 3296 | this just grew, and could be parsed much more simply! |
| 3297 | Dean in haste. */ |
| 3298 | if ((name = read_symbol_name ()) == NULL) |
| 3299 | return; |
| 3300 | |
| 3301 | if (*input_line_pointer != ',') |
| 3302 | { |
| 3303 | as_bad (_("expected comma after \"%s\""), name); |
| 3304 | ignore_rest_of_line (); |
| 3305 | free (name); |
| 3306 | return; |
| 3307 | } |
| 3308 | |
| 3309 | input_line_pointer++; |
| 3310 | assign_symbol (name, equiv); |
| 3311 | demand_empty_rest_of_line (); |
| 3312 | free (name); |
| 3313 | } |
| 3314 | |
| 3315 | void |
| 3316 | s_space (int mult) |
| 3317 | { |
| 3318 | expressionS exp; |
| 3319 | expressionS val; |
| 3320 | char *p = 0; |
| 3321 | char *stop = NULL; |
| 3322 | char stopc = 0; |
| 3323 | int bytes; |
| 3324 | |
| 3325 | #ifdef md_flush_pending_output |
| 3326 | md_flush_pending_output (); |
| 3327 | #endif |
| 3328 | |
| 3329 | #ifdef md_cons_align |
| 3330 | md_cons_align (1); |
| 3331 | #endif |
| 3332 | |
| 3333 | if (flag_mri) |
| 3334 | stop = mri_comment_field (&stopc); |
| 3335 | |
| 3336 | /* In m68k MRI mode, we need to align to a word boundary, unless |
| 3337 | this is ds.b. */ |
| 3338 | if (flag_m68k_mri && mult > 1) |
| 3339 | { |
| 3340 | if (now_seg == absolute_section) |
| 3341 | { |
| 3342 | abs_section_offset += abs_section_offset & 1; |
| 3343 | if (line_label != NULL) |
| 3344 | S_SET_VALUE (line_label, abs_section_offset); |
| 3345 | } |
| 3346 | else if (mri_common_symbol != NULL) |
| 3347 | { |
| 3348 | valueT mri_val; |
| 3349 | |
| 3350 | mri_val = S_GET_VALUE (mri_common_symbol); |
| 3351 | if ((mri_val & 1) != 0) |
| 3352 | { |
| 3353 | S_SET_VALUE (mri_common_symbol, mri_val + 1); |
| 3354 | if (line_label != NULL) |
| 3355 | { |
| 3356 | expressionS *symexp; |
| 3357 | |
| 3358 | symexp = symbol_get_value_expression (line_label); |
| 3359 | know (symexp->X_op == O_symbol); |
| 3360 | know (symexp->X_add_symbol == mri_common_symbol); |
| 3361 | symexp->X_add_number += 1; |
| 3362 | } |
| 3363 | } |
| 3364 | } |
| 3365 | else |
| 3366 | { |
| 3367 | do_align (1, (char *) NULL, 0, 0); |
| 3368 | if (line_label != NULL) |
| 3369 | { |
| 3370 | symbol_set_frag (line_label, frag_now); |
| 3371 | S_SET_VALUE (line_label, frag_now_fix ()); |
| 3372 | } |
| 3373 | } |
| 3374 | } |
| 3375 | |
| 3376 | bytes = mult; |
| 3377 | |
| 3378 | expression (&exp); |
| 3379 | |
| 3380 | SKIP_WHITESPACE (); |
| 3381 | if (*input_line_pointer == ',') |
| 3382 | { |
| 3383 | ++input_line_pointer; |
| 3384 | expression (&val); |
| 3385 | } |
| 3386 | else |
| 3387 | { |
| 3388 | val.X_op = O_constant; |
| 3389 | val.X_add_number = 0; |
| 3390 | } |
| 3391 | |
| 3392 | if ((val.X_op != O_constant |
| 3393 | || val.X_add_number < - 0x80 |
| 3394 | || val.X_add_number > 0xff |
| 3395 | || (mult != 0 && mult != 1 && val.X_add_number != 0)) |
| 3396 | && (now_seg != absolute_section && !in_bss ())) |
| 3397 | { |
| 3398 | resolve_expression (&exp); |
| 3399 | if (exp.X_op != O_constant) |
| 3400 | as_bad (_("unsupported variable size or fill value")); |
| 3401 | else |
| 3402 | { |
| 3403 | offsetT i; |
| 3404 | |
| 3405 | /* PR 20901: Check for excessive values. |
| 3406 | FIXME: 1<<10 is an arbitrary limit. Maybe use maxpagesize instead ? */ |
| 3407 | if (exp.X_add_number < 0 || exp.X_add_number > (1 << 10)) |
| 3408 | as_bad (_("size value for space directive too large: %lx"), |
| 3409 | (long) exp.X_add_number); |
| 3410 | else |
| 3411 | { |
| 3412 | if (mult == 0) |
| 3413 | mult = 1; |
| 3414 | bytes = mult * exp.X_add_number; |
| 3415 | |
| 3416 | for (i = 0; i < exp.X_add_number; i++) |
| 3417 | emit_expr (&val, mult); |
| 3418 | } |
| 3419 | } |
| 3420 | } |
| 3421 | else |
| 3422 | { |
| 3423 | if (now_seg == absolute_section || mri_common_symbol != NULL) |
| 3424 | resolve_expression (&exp); |
| 3425 | |
| 3426 | if (exp.X_op == O_constant) |
| 3427 | { |
| 3428 | offsetT repeat; |
| 3429 | |
| 3430 | repeat = exp.X_add_number; |
| 3431 | if (mult) |
| 3432 | repeat *= mult; |
| 3433 | bytes = repeat; |
| 3434 | if (repeat <= 0) |
| 3435 | { |
| 3436 | if (!flag_mri) |
| 3437 | as_warn (_(".space repeat count is zero, ignored")); |
| 3438 | else if (repeat < 0) |
| 3439 | as_warn (_(".space repeat count is negative, ignored")); |
| 3440 | goto getout; |
| 3441 | } |
| 3442 | |
| 3443 | /* If we are in the absolute section, just bump the offset. */ |
| 3444 | if (now_seg == absolute_section) |
| 3445 | { |
| 3446 | if (val.X_op != O_constant || val.X_add_number != 0) |
| 3447 | as_warn (_("ignoring fill value in absolute section")); |
| 3448 | abs_section_offset += repeat; |
| 3449 | goto getout; |
| 3450 | } |
| 3451 | |
| 3452 | /* If we are secretly in an MRI common section, then |
| 3453 | creating space just increases the size of the common |
| 3454 | symbol. */ |
| 3455 | if (mri_common_symbol != NULL) |
| 3456 | { |
| 3457 | S_SET_VALUE (mri_common_symbol, |
| 3458 | S_GET_VALUE (mri_common_symbol) + repeat); |
| 3459 | goto getout; |
| 3460 | } |
| 3461 | |
| 3462 | if (!need_pass_2) |
| 3463 | p = frag_var (rs_fill, 1, 1, (relax_substateT) 0, (symbolS *) 0, |
| 3464 | (offsetT) repeat, (char *) 0); |
| 3465 | } |
| 3466 | else |
| 3467 | { |
| 3468 | if (now_seg == absolute_section) |
| 3469 | { |
| 3470 | as_bad (_("space allocation too complex in absolute section")); |
| 3471 | subseg_set (text_section, 0); |
| 3472 | } |
| 3473 | |
| 3474 | if (mri_common_symbol != NULL) |
| 3475 | { |
| 3476 | as_bad (_("space allocation too complex in common section")); |
| 3477 | mri_common_symbol = NULL; |
| 3478 | } |
| 3479 | |
| 3480 | if (!need_pass_2) |
| 3481 | p = frag_var (rs_space, 1, 1, (relax_substateT) 0, |
| 3482 | make_expr_symbol (&exp), (offsetT) 0, (char *) 0); |
| 3483 | } |
| 3484 | |
| 3485 | if ((val.X_op != O_constant || val.X_add_number != 0) && in_bss ()) |
| 3486 | as_warn (_("ignoring fill value in section `%s'"), |
| 3487 | segment_name (now_seg)); |
| 3488 | else if (p) |
| 3489 | *p = val.X_add_number; |
| 3490 | } |
| 3491 | |
| 3492 | getout: |
| 3493 | |
| 3494 | /* In MRI mode, after an odd number of bytes, we must align to an |
| 3495 | even word boundary, unless the next instruction is a dc.b, ds.b |
| 3496 | or dcb.b. */ |
| 3497 | if (flag_mri && (bytes & 1) != 0) |
| 3498 | mri_pending_align = 1; |
| 3499 | |
| 3500 | demand_empty_rest_of_line (); |
| 3501 | |
| 3502 | if (flag_mri) |
| 3503 | mri_comment_end (stop, stopc); |
| 3504 | } |
| 3505 | |
| 3506 | void |
| 3507 | s_nop (int ignore ATTRIBUTE_UNUSED) |
| 3508 | { |
| 3509 | expressionS exp; |
| 3510 | fragS *start; |
| 3511 | addressT start_off; |
| 3512 | offsetT frag_off; |
| 3513 | |
| 3514 | #ifdef md_flush_pending_output |
| 3515 | md_flush_pending_output (); |
| 3516 | #endif |
| 3517 | |
| 3518 | #ifdef md_cons_align |
| 3519 | md_cons_align (1); |
| 3520 | #endif |
| 3521 | |
| 3522 | SKIP_WHITESPACE (); |
| 3523 | expression (&exp); |
| 3524 | demand_empty_rest_of_line (); |
| 3525 | |
| 3526 | start = frag_now; |
| 3527 | start_off = frag_now_fix (); |
| 3528 | do |
| 3529 | { |
| 3530 | #ifdef md_emit_single_noop |
| 3531 | md_emit_single_noop; |
| 3532 | #else |
| 3533 | char *nop; |
| 3534 | |
| 3535 | #ifndef md_single_noop_insn |
| 3536 | #define md_single_noop_insn "nop" |
| 3537 | #endif |
| 3538 | /* md_assemble might modify its argument, so |
| 3539 | we must pass it a string that is writable. */ |
| 3540 | if (asprintf (&nop, "%s", md_single_noop_insn) < 0) |
| 3541 | as_fatal ("%s", xstrerror (errno)); |
| 3542 | |
| 3543 | /* Some targets assume that they can update input_line_pointer |
| 3544 | inside md_assemble, and, worse, that they can leave it |
| 3545 | assigned to the string pointer that was provided as an |
| 3546 | argument. So preserve ilp here. */ |
| 3547 | char *saved_ilp = input_line_pointer; |
| 3548 | md_assemble (nop); |
| 3549 | input_line_pointer = saved_ilp; |
| 3550 | free (nop); |
| 3551 | #endif |
| 3552 | #ifdef md_flush_pending_output |
| 3553 | md_flush_pending_output (); |
| 3554 | #endif |
| 3555 | } while (exp.X_op == O_constant |
| 3556 | && exp.X_add_number > 0 |
| 3557 | && frag_offset_ignore_align_p (start, frag_now, &frag_off) |
| 3558 | && frag_off + frag_now_fix () < start_off + exp.X_add_number); |
| 3559 | } |
| 3560 | |
| 3561 | void |
| 3562 | s_nops (int ignore ATTRIBUTE_UNUSED) |
| 3563 | { |
| 3564 | expressionS exp; |
| 3565 | expressionS val; |
| 3566 | |
| 3567 | #ifdef md_flush_pending_output |
| 3568 | md_flush_pending_output (); |
| 3569 | #endif |
| 3570 | |
| 3571 | #ifdef md_cons_align |
| 3572 | md_cons_align (1); |
| 3573 | #endif |
| 3574 | |
| 3575 | SKIP_WHITESPACE (); |
| 3576 | expression (&exp); |
| 3577 | /* Note - this expression is tested for an absolute value in |
| 3578 | write.c:relax_segment(). */ |
| 3579 | |
| 3580 | SKIP_WHITESPACE (); |
| 3581 | if (*input_line_pointer == ',') |
| 3582 | { |
| 3583 | ++input_line_pointer; |
| 3584 | expression (&val); |
| 3585 | } |
| 3586 | else |
| 3587 | { |
| 3588 | val.X_op = O_constant; |
| 3589 | val.X_add_number = 0; |
| 3590 | } |
| 3591 | |
| 3592 | if (val.X_op != O_constant) |
| 3593 | { |
| 3594 | as_bad (_("unsupported variable nop control in .nops directive")); |
| 3595 | val.X_op = O_constant; |
| 3596 | val.X_add_number = 0; |
| 3597 | } |
| 3598 | else if (val.X_add_number < 0) |
| 3599 | { |
| 3600 | as_warn (_("negative nop control byte, ignored")); |
| 3601 | val.X_add_number = 0; |
| 3602 | } |
| 3603 | |
| 3604 | demand_empty_rest_of_line (); |
| 3605 | |
| 3606 | if (need_pass_2) |
| 3607 | /* Ignore this directive if we are going to perform a second pass. */ |
| 3608 | return; |
| 3609 | |
| 3610 | /* Store the no-op instruction control byte in the first byte of frag. */ |
| 3611 | char *p; |
| 3612 | symbolS *sym = make_expr_symbol (&exp); |
| 3613 | p = frag_var (rs_space_nop, 1, 1, (relax_substateT) 0, |
| 3614 | sym, (offsetT) 0, (char *) 0); |
| 3615 | *p = val.X_add_number; |
| 3616 | } |
| 3617 | |
| 3618 | /* This is like s_space, but the value is a floating point number with |
| 3619 | the given precision. This is for the MRI dcb.s pseudo-op and |
| 3620 | friends. */ |
| 3621 | |
| 3622 | void |
| 3623 | s_float_space (int float_type) |
| 3624 | { |
| 3625 | offsetT count; |
| 3626 | int flen; |
| 3627 | char temp[MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT]; |
| 3628 | char *stop = NULL; |
| 3629 | char stopc = 0; |
| 3630 | |
| 3631 | #ifdef md_cons_align |
| 3632 | md_cons_align (1); |
| 3633 | #endif |
| 3634 | |
| 3635 | if (flag_mri) |
| 3636 | stop = mri_comment_field (&stopc); |
| 3637 | |
| 3638 | count = get_absolute_expression (); |
| 3639 | |
| 3640 | SKIP_WHITESPACE (); |
| 3641 | if (*input_line_pointer != ',') |
| 3642 | { |
| 3643 | as_bad (_("missing value")); |
| 3644 | ignore_rest_of_line (); |
| 3645 | if (flag_mri) |
| 3646 | mri_comment_end (stop, stopc); |
| 3647 | return; |
| 3648 | } |
| 3649 | |
| 3650 | ++input_line_pointer; |
| 3651 | |
| 3652 | SKIP_WHITESPACE (); |
| 3653 | |
| 3654 | /* Skip any 0{letter} that may be present. Don't even check if the |
| 3655 | * letter is legal. */ |
| 3656 | if (input_line_pointer[0] == '0' |
| 3657 | && ISALPHA (input_line_pointer[1])) |
| 3658 | input_line_pointer += 2; |
| 3659 | |
| 3660 | /* Accept :xxxx, where the x's are hex digits, for a floating point |
| 3661 | with the exact digits specified. */ |
| 3662 | if (input_line_pointer[0] == ':') |
| 3663 | { |
| 3664 | flen = hex_float (float_type, temp); |
| 3665 | if (flen < 0) |
| 3666 | { |
| 3667 | ignore_rest_of_line (); |
| 3668 | if (flag_mri) |
| 3669 | mri_comment_end (stop, stopc); |
| 3670 | return; |
| 3671 | } |
| 3672 | } |
| 3673 | else |
| 3674 | { |
| 3675 | const char *err; |
| 3676 | |
| 3677 | err = md_atof (float_type, temp, &flen); |
| 3678 | know (flen <= MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT); |
| 3679 | know (err != NULL || flen > 0); |
| 3680 | if (err) |
| 3681 | { |
| 3682 | as_bad (_("bad floating literal: %s"), err); |
| 3683 | ignore_rest_of_line (); |
| 3684 | if (flag_mri) |
| 3685 | mri_comment_end (stop, stopc); |
| 3686 | return; |
| 3687 | } |
| 3688 | } |
| 3689 | |
| 3690 | while (--count >= 0) |
| 3691 | { |
| 3692 | char *p; |
| 3693 | |
| 3694 | p = frag_more (flen); |
| 3695 | memcpy (p, temp, (unsigned int) flen); |
| 3696 | } |
| 3697 | |
| 3698 | demand_empty_rest_of_line (); |
| 3699 | |
| 3700 | if (flag_mri) |
| 3701 | mri_comment_end (stop, stopc); |
| 3702 | } |
| 3703 | |
| 3704 | /* Handle the .struct pseudo-op, as found in MIPS assemblers. */ |
| 3705 | |
| 3706 | void |
| 3707 | s_struct (int ignore ATTRIBUTE_UNUSED) |
| 3708 | { |
| 3709 | char *stop = NULL; |
| 3710 | char stopc = 0; |
| 3711 | |
| 3712 | if (flag_mri) |
| 3713 | stop = mri_comment_field (&stopc); |
| 3714 | abs_section_offset = get_absolute_expression (); |
| 3715 | #if defined (OBJ_ELF) || defined (OBJ_MAYBE_ELF) |
| 3716 | /* The ELF backend needs to know that we are changing sections, so |
| 3717 | that .previous works correctly. */ |
| 3718 | if (IS_ELF) |
| 3719 | obj_elf_section_change_hook (); |
| 3720 | #endif |
| 3721 | subseg_set (absolute_section, 0); |
| 3722 | demand_empty_rest_of_line (); |
| 3723 | if (flag_mri) |
| 3724 | mri_comment_end (stop, stopc); |
| 3725 | } |
| 3726 | |
| 3727 | void |
| 3728 | s_text (int ignore ATTRIBUTE_UNUSED) |
| 3729 | { |
| 3730 | int temp; |
| 3731 | |
| 3732 | temp = get_absolute_expression (); |
| 3733 | subseg_set (text_section, (subsegT) temp); |
| 3734 | demand_empty_rest_of_line (); |
| 3735 | } |
| 3736 | |
| 3737 | /* .weakref x, y sets x as an alias to y that, as long as y is not |
| 3738 | referenced directly, will cause y to become a weak symbol. */ |
| 3739 | void |
| 3740 | s_weakref (int ignore ATTRIBUTE_UNUSED) |
| 3741 | { |
| 3742 | char *name; |
| 3743 | symbolS *symbolP; |
| 3744 | symbolS *symbolP2; |
| 3745 | expressionS exp; |
| 3746 | |
| 3747 | if ((name = read_symbol_name ()) == NULL) |
| 3748 | return; |
| 3749 | |
| 3750 | symbolP = symbol_find_or_make (name); |
| 3751 | |
| 3752 | if (S_IS_DEFINED (symbolP) || symbol_equated_p (symbolP)) |
| 3753 | { |
| 3754 | if (!S_IS_VOLATILE (symbolP)) |
| 3755 | { |
| 3756 | as_bad (_("symbol `%s' is already defined"), name); |
| 3757 | goto err_out; |
| 3758 | } |
| 3759 | symbolP = symbol_clone (symbolP, 1); |
| 3760 | S_CLEAR_VOLATILE (symbolP); |
| 3761 | } |
| 3762 | |
| 3763 | SKIP_WHITESPACE (); |
| 3764 | |
| 3765 | if (*input_line_pointer != ',') |
| 3766 | { |
| 3767 | as_bad (_("expected comma after \"%s\""), name); |
| 3768 | goto err_out; |
| 3769 | } |
| 3770 | |
| 3771 | input_line_pointer++; |
| 3772 | |
| 3773 | SKIP_WHITESPACE (); |
| 3774 | free (name); |
| 3775 | |
| 3776 | if ((name = read_symbol_name ()) == NULL) |
| 3777 | return; |
| 3778 | |
| 3779 | if ((symbolP2 = symbol_find_noref (name, 1)) == NULL |
| 3780 | && (symbolP2 = md_undefined_symbol (name)) == NULL) |
| 3781 | { |
| 3782 | symbolP2 = symbol_find_or_make (name); |
| 3783 | S_SET_WEAKREFD (symbolP2); |
| 3784 | } |
| 3785 | else |
| 3786 | { |
| 3787 | symbolS *symp = symbolP2; |
| 3788 | |
| 3789 | while (S_IS_WEAKREFR (symp) && symp != symbolP) |
| 3790 | { |
| 3791 | expressionS *expP = symbol_get_value_expression (symp); |
| 3792 | |
| 3793 | gas_assert (expP->X_op == O_symbol |
| 3794 | && expP->X_add_number == 0); |
| 3795 | symp = expP->X_add_symbol; |
| 3796 | } |
| 3797 | if (symp == symbolP) |
| 3798 | { |
| 3799 | char *loop; |
| 3800 | |
| 3801 | loop = concat (S_GET_NAME (symbolP), |
| 3802 | " => ", S_GET_NAME (symbolP2), (const char *) NULL); |
| 3803 | |
| 3804 | symp = symbolP2; |
| 3805 | while (symp != symbolP) |
| 3806 | { |
| 3807 | char *old_loop = loop; |
| 3808 | |
| 3809 | symp = symbol_get_value_expression (symp)->X_add_symbol; |
| 3810 | loop = concat (loop, " => ", S_GET_NAME (symp), |
| 3811 | (const char *) NULL); |
| 3812 | free (old_loop); |
| 3813 | } |
| 3814 | |
| 3815 | as_bad (_("%s: would close weakref loop: %s"), |
| 3816 | S_GET_NAME (symbolP), loop); |
| 3817 | |
| 3818 | free (loop); |
| 3819 | free (name); |
| 3820 | ignore_rest_of_line (); |
| 3821 | return; |
| 3822 | } |
| 3823 | |
| 3824 | /* Short-circuiting instead of just checking here might speed |
| 3825 | things up a tiny little bit, but loop error messages would |
| 3826 | miss intermediate links. */ |
| 3827 | /* symbolP2 = symp; */ |
| 3828 | } |
| 3829 | |
| 3830 | memset (&exp, 0, sizeof (exp)); |
| 3831 | exp.X_op = O_symbol; |
| 3832 | exp.X_add_symbol = symbolP2; |
| 3833 | |
| 3834 | S_SET_SEGMENT (symbolP, undefined_section); |
| 3835 | symbol_set_value_expression (symbolP, &exp); |
| 3836 | symbol_set_frag (symbolP, &zero_address_frag); |
| 3837 | S_SET_WEAKREFR (symbolP); |
| 3838 | |
| 3839 | demand_empty_rest_of_line (); |
| 3840 | free (name); |
| 3841 | return; |
| 3842 | |
| 3843 | err_out: |
| 3844 | ignore_rest_of_line (); |
| 3845 | free (name); |
| 3846 | return; |
| 3847 | } |
| 3848 | \f |
| 3849 | |
| 3850 | /* Verify that we are at the end of a line. If not, issue an error and |
| 3851 | skip to EOL. */ |
| 3852 | |
| 3853 | void |
| 3854 | demand_empty_rest_of_line (void) |
| 3855 | { |
| 3856 | SKIP_WHITESPACE (); |
| 3857 | if (is_end_of_line[(unsigned char) *input_line_pointer]) |
| 3858 | input_line_pointer++; |
| 3859 | else |
| 3860 | { |
| 3861 | if (ISPRINT (*input_line_pointer)) |
| 3862 | as_bad (_("junk at end of line, first unrecognized character is `%c'"), |
| 3863 | *input_line_pointer); |
| 3864 | else |
| 3865 | as_bad (_("junk at end of line, first unrecognized character valued 0x%x"), |
| 3866 | *input_line_pointer); |
| 3867 | ignore_rest_of_line (); |
| 3868 | } |
| 3869 | |
| 3870 | /* Return pointing just after end-of-line. */ |
| 3871 | know (is_end_of_line[(unsigned char) input_line_pointer[-1]]); |
| 3872 | } |
| 3873 | |
| 3874 | /* Silently advance to the end of line. Use this after already having |
| 3875 | issued an error about something bad. */ |
| 3876 | |
| 3877 | void |
| 3878 | ignore_rest_of_line (void) |
| 3879 | { |
| 3880 | while (input_line_pointer < buffer_limit |
| 3881 | && !is_end_of_line[(unsigned char) *input_line_pointer]) |
| 3882 | input_line_pointer++; |
| 3883 | |
| 3884 | input_line_pointer++; |
| 3885 | |
| 3886 | /* Return pointing just after end-of-line. */ |
| 3887 | if (input_line_pointer <= buffer_limit) |
| 3888 | know (is_end_of_line[(unsigned char) input_line_pointer[-1]]); |
| 3889 | } |
| 3890 | |
| 3891 | /* Sets frag for given symbol to zero_address_frag, except when the |
| 3892 | symbol frag is already set to a dummy listing frag. */ |
| 3893 | |
| 3894 | static void |
| 3895 | set_zero_frag (symbolS *symbolP) |
| 3896 | { |
| 3897 | if (symbol_get_frag (symbolP)->fr_type != rs_dummy) |
| 3898 | symbol_set_frag (symbolP, &zero_address_frag); |
| 3899 | } |
| 3900 | |
| 3901 | /* In: Pointer to a symbol. |
| 3902 | Input_line_pointer->expression. |
| 3903 | |
| 3904 | Out: Input_line_pointer->just after any whitespace after expression. |
| 3905 | Tried to set symbol to value of expression. |
| 3906 | Will change symbols type, value, and frag; */ |
| 3907 | |
| 3908 | void |
| 3909 | pseudo_set (symbolS *symbolP) |
| 3910 | { |
| 3911 | expressionS exp; |
| 3912 | segT seg; |
| 3913 | |
| 3914 | know (symbolP); /* NULL pointer is logic error. */ |
| 3915 | |
| 3916 | if (!S_IS_FORWARD_REF (symbolP)) |
| 3917 | (void) expression (&exp); |
| 3918 | else |
| 3919 | (void) deferred_expression (&exp); |
| 3920 | |
| 3921 | if (exp.X_op == O_illegal) |
| 3922 | as_bad (_("illegal expression")); |
| 3923 | else if (exp.X_op == O_absent) |
| 3924 | as_bad (_("missing expression")); |
| 3925 | else if (exp.X_op == O_big) |
| 3926 | { |
| 3927 | if (exp.X_add_number > 0) |
| 3928 | as_bad (_("bignum invalid")); |
| 3929 | else |
| 3930 | as_bad (_("floating point number invalid")); |
| 3931 | } |
| 3932 | else if (exp.X_op == O_subtract |
| 3933 | && !S_IS_FORWARD_REF (symbolP) |
| 3934 | && SEG_NORMAL (S_GET_SEGMENT (exp.X_add_symbol)) |
| 3935 | && (symbol_get_frag (exp.X_add_symbol) |
| 3936 | == symbol_get_frag (exp.X_op_symbol))) |
| 3937 | { |
| 3938 | exp.X_op = O_constant; |
| 3939 | exp.X_add_number = (S_GET_VALUE (exp.X_add_symbol) |
| 3940 | - S_GET_VALUE (exp.X_op_symbol)); |
| 3941 | } |
| 3942 | |
| 3943 | if (symbol_section_p (symbolP)) |
| 3944 | { |
| 3945 | as_bad ("attempt to set value of section symbol"); |
| 3946 | return; |
| 3947 | } |
| 3948 | |
| 3949 | switch (exp.X_op) |
| 3950 | { |
| 3951 | case O_illegal: |
| 3952 | case O_absent: |
| 3953 | case O_big: |
| 3954 | exp.X_add_number = 0; |
| 3955 | /* Fall through. */ |
| 3956 | case O_constant: |
| 3957 | S_SET_SEGMENT (symbolP, absolute_section); |
| 3958 | S_SET_VALUE (symbolP, (valueT) exp.X_add_number); |
| 3959 | set_zero_frag (symbolP); |
| 3960 | break; |
| 3961 | |
| 3962 | case O_register: |
| 3963 | #ifndef TC_GLOBAL_REGISTER_SYMBOL_OK |
| 3964 | if (S_IS_EXTERNAL (symbolP)) |
| 3965 | { |
| 3966 | as_bad ("can't equate global symbol `%s' with register name", |
| 3967 | S_GET_NAME (symbolP)); |
| 3968 | return; |
| 3969 | } |
| 3970 | #endif |
| 3971 | S_SET_SEGMENT (symbolP, reg_section); |
| 3972 | S_SET_VALUE (symbolP, (valueT) exp.X_add_number); |
| 3973 | set_zero_frag (symbolP); |
| 3974 | symbol_get_value_expression (symbolP)->X_op = O_register; |
| 3975 | break; |
| 3976 | |
| 3977 | case O_symbol: |
| 3978 | seg = S_GET_SEGMENT (exp.X_add_symbol); |
| 3979 | /* For x=undef+const, create an expression symbol. |
| 3980 | For x=x+const, just update x except when x is an undefined symbol |
| 3981 | For x=defined+const, evaluate x. */ |
| 3982 | if (symbolP == exp.X_add_symbol |
| 3983 | && (seg != undefined_section |
| 3984 | || !symbol_constant_p (symbolP))) |
| 3985 | { |
| 3986 | *symbol_X_add_number (symbolP) += exp.X_add_number; |
| 3987 | break; |
| 3988 | } |
| 3989 | else if (!S_IS_FORWARD_REF (symbolP) && seg != undefined_section) |
| 3990 | { |
| 3991 | symbolS *s = exp.X_add_symbol; |
| 3992 | |
| 3993 | if (S_IS_COMMON (s)) |
| 3994 | as_bad (_("`%s' can't be equated to common symbol `%s'"), |
| 3995 | S_GET_NAME (symbolP), S_GET_NAME (s)); |
| 3996 | |
| 3997 | S_SET_SEGMENT (symbolP, seg); |
| 3998 | S_SET_VALUE (symbolP, exp.X_add_number + S_GET_VALUE (s)); |
| 3999 | symbol_set_frag (symbolP, symbol_get_frag (s)); |
| 4000 | copy_symbol_attributes (symbolP, s); |
| 4001 | break; |
| 4002 | } |
| 4003 | S_SET_SEGMENT (symbolP, undefined_section); |
| 4004 | symbol_set_value_expression (symbolP, &exp); |
| 4005 | copy_symbol_attributes (symbolP, exp.X_add_symbol); |
| 4006 | set_zero_frag (symbolP); |
| 4007 | break; |
| 4008 | |
| 4009 | default: |
| 4010 | /* The value is some complex expression. */ |
| 4011 | S_SET_SEGMENT (symbolP, expr_section); |
| 4012 | symbol_set_value_expression (symbolP, &exp); |
| 4013 | set_zero_frag (symbolP); |
| 4014 | break; |
| 4015 | } |
| 4016 | } |
| 4017 | \f |
| 4018 | /* cons() |
| 4019 | |
| 4020 | CONStruct more frag of .bytes, or .words etc. |
| 4021 | Should need_pass_2 be 1 then emit no frag(s). |
| 4022 | This understands EXPRESSIONS. |
| 4023 | |
| 4024 | Bug (?) |
| 4025 | |
| 4026 | This has a split personality. We use expression() to read the |
| 4027 | value. We can detect if the value won't fit in a byte or word. |
| 4028 | But we can't detect if expression() discarded significant digits |
| 4029 | in the case of a long. Not worth the crocks required to fix it. */ |
| 4030 | |
| 4031 | /* Select a parser for cons expressions. */ |
| 4032 | |
| 4033 | /* Some targets need to parse the expression in various fancy ways. |
| 4034 | You can define TC_PARSE_CONS_EXPRESSION to do whatever you like |
| 4035 | (for example, the HPPA does this). Otherwise, you can define |
| 4036 | REPEAT_CONS_EXPRESSIONS to permit repeat counts. If none of these |
| 4037 | are defined, which is the normal case, then only simple expressions |
| 4038 | are permitted. */ |
| 4039 | |
| 4040 | #ifdef TC_M68K |
| 4041 | static void |
| 4042 | parse_mri_cons (expressionS *exp, unsigned int nbytes); |
| 4043 | #endif |
| 4044 | |
| 4045 | #ifndef TC_PARSE_CONS_EXPRESSION |
| 4046 | #ifdef REPEAT_CONS_EXPRESSIONS |
| 4047 | #define TC_PARSE_CONS_EXPRESSION(EXP, NBYTES) \ |
| 4048 | (parse_repeat_cons (EXP, NBYTES), TC_PARSE_CONS_RETURN_NONE) |
| 4049 | static void |
| 4050 | parse_repeat_cons (expressionS *exp, unsigned int nbytes); |
| 4051 | #endif |
| 4052 | |
| 4053 | /* If we haven't gotten one yet, just call expression. */ |
| 4054 | #ifndef TC_PARSE_CONS_EXPRESSION |
| 4055 | #define TC_PARSE_CONS_EXPRESSION(EXP, NBYTES) \ |
| 4056 | (expression (EXP), TC_PARSE_CONS_RETURN_NONE) |
| 4057 | #endif |
| 4058 | #endif |
| 4059 | |
| 4060 | void |
| 4061 | do_parse_cons_expression (expressionS *exp, |
| 4062 | int nbytes ATTRIBUTE_UNUSED) |
| 4063 | { |
| 4064 | (void) TC_PARSE_CONS_EXPRESSION (exp, nbytes); |
| 4065 | } |
| 4066 | |
| 4067 | |
| 4068 | /* Worker to do .byte etc statements. |
| 4069 | Clobbers input_line_pointer and checks end-of-line. */ |
| 4070 | |
| 4071 | static void |
| 4072 | cons_worker (int nbytes, /* 1=.byte, 2=.word, 4=.long. */ |
| 4073 | int rva) |
| 4074 | { |
| 4075 | int c; |
| 4076 | expressionS exp; |
| 4077 | char *stop = NULL; |
| 4078 | char stopc = 0; |
| 4079 | |
| 4080 | #ifdef md_flush_pending_output |
| 4081 | md_flush_pending_output (); |
| 4082 | #endif |
| 4083 | |
| 4084 | if (flag_mri) |
| 4085 | stop = mri_comment_field (&stopc); |
| 4086 | |
| 4087 | if (is_it_end_of_statement ()) |
| 4088 | { |
| 4089 | demand_empty_rest_of_line (); |
| 4090 | if (flag_mri) |
| 4091 | mri_comment_end (stop, stopc); |
| 4092 | return; |
| 4093 | } |
| 4094 | |
| 4095 | #ifdef TC_ADDRESS_BYTES |
| 4096 | if (nbytes == 0) |
| 4097 | nbytes = TC_ADDRESS_BYTES (); |
| 4098 | #endif |
| 4099 | |
| 4100 | #ifdef md_cons_align |
| 4101 | md_cons_align (nbytes); |
| 4102 | #endif |
| 4103 | |
| 4104 | c = 0; |
| 4105 | do |
| 4106 | { |
| 4107 | TC_PARSE_CONS_RETURN_TYPE ret = TC_PARSE_CONS_RETURN_NONE; |
| 4108 | #ifdef TC_CONS_FIX_CHECK |
| 4109 | fixS **cur_fix = &frchain_now->fix_tail; |
| 4110 | |
| 4111 | if (*cur_fix != NULL) |
| 4112 | cur_fix = &(*cur_fix)->fx_next; |
| 4113 | #endif |
| 4114 | |
| 4115 | #ifdef TC_M68K |
| 4116 | if (flag_m68k_mri) |
| 4117 | parse_mri_cons (&exp, (unsigned int) nbytes); |
| 4118 | else |
| 4119 | #endif |
| 4120 | { |
| 4121 | #if 0 |
| 4122 | if (*input_line_pointer == '"') |
| 4123 | { |
| 4124 | as_bad (_("unexpected `\"' in expression")); |
| 4125 | ignore_rest_of_line (); |
| 4126 | return; |
| 4127 | } |
| 4128 | #endif |
| 4129 | ret = TC_PARSE_CONS_EXPRESSION (&exp, (unsigned int) nbytes); |
| 4130 | } |
| 4131 | |
| 4132 | if (rva) |
| 4133 | { |
| 4134 | if (exp.X_op == O_symbol) |
| 4135 | exp.X_op = O_symbol_rva; |
| 4136 | else |
| 4137 | as_fatal (_("rva without symbol")); |
| 4138 | } |
| 4139 | emit_expr_with_reloc (&exp, (unsigned int) nbytes, ret); |
| 4140 | #ifdef TC_CONS_FIX_CHECK |
| 4141 | TC_CONS_FIX_CHECK (&exp, nbytes, *cur_fix); |
| 4142 | #endif |
| 4143 | ++c; |
| 4144 | } |
| 4145 | while (*input_line_pointer++ == ','); |
| 4146 | |
| 4147 | /* In MRI mode, after an odd number of bytes, we must align to an |
| 4148 | even word boundary, unless the next instruction is a dc.b, ds.b |
| 4149 | or dcb.b. */ |
| 4150 | if (flag_mri && nbytes == 1 && (c & 1) != 0) |
| 4151 | mri_pending_align = 1; |
| 4152 | |
| 4153 | input_line_pointer--; /* Put terminator back into stream. */ |
| 4154 | |
| 4155 | demand_empty_rest_of_line (); |
| 4156 | |
| 4157 | if (flag_mri) |
| 4158 | mri_comment_end (stop, stopc); |
| 4159 | } |
| 4160 | |
| 4161 | void |
| 4162 | cons (int size) |
| 4163 | { |
| 4164 | cons_worker (size, 0); |
| 4165 | } |
| 4166 | |
| 4167 | void |
| 4168 | s_rva (int size) |
| 4169 | { |
| 4170 | cons_worker (size, 1); |
| 4171 | } |
| 4172 | |
| 4173 | /* .reloc offset, reloc_name, symbol+addend. */ |
| 4174 | |
| 4175 | static void |
| 4176 | s_reloc (int ignore ATTRIBUTE_UNUSED) |
| 4177 | { |
| 4178 | char *stop = NULL; |
| 4179 | char stopc = 0; |
| 4180 | expressionS exp; |
| 4181 | char *r_name; |
| 4182 | int c; |
| 4183 | struct reloc_list *reloc; |
| 4184 | struct _bfd_rel { const char * name; bfd_reloc_code_real_type code; }; |
| 4185 | static struct _bfd_rel bfd_relocs[] = |
| 4186 | { |
| 4187 | { "NONE", BFD_RELOC_NONE }, |
| 4188 | { "8", BFD_RELOC_8 }, |
| 4189 | { "16", BFD_RELOC_16 }, |
| 4190 | { "32", BFD_RELOC_32 }, |
| 4191 | { "64", BFD_RELOC_64 } |
| 4192 | }; |
| 4193 | |
| 4194 | reloc = XNEW (struct reloc_list); |
| 4195 | |
| 4196 | if (flag_mri) |
| 4197 | stop = mri_comment_field (&stopc); |
| 4198 | |
| 4199 | expression (&exp); |
| 4200 | switch (exp.X_op) |
| 4201 | { |
| 4202 | case O_illegal: |
| 4203 | case O_absent: |
| 4204 | case O_big: |
| 4205 | case O_register: |
| 4206 | as_bad (_("missing or bad offset expression")); |
| 4207 | goto err_out; |
| 4208 | case O_constant: |
| 4209 | exp.X_add_symbol = section_symbol (now_seg); |
| 4210 | exp.X_op = O_symbol; |
| 4211 | /* Fallthru */ |
| 4212 | case O_symbol: |
| 4213 | if (exp.X_add_number == 0) |
| 4214 | { |
| 4215 | reloc->u.a.offset_sym = exp.X_add_symbol; |
| 4216 | break; |
| 4217 | } |
| 4218 | /* Fallthru */ |
| 4219 | default: |
| 4220 | reloc->u.a.offset_sym = make_expr_symbol (&exp); |
| 4221 | break; |
| 4222 | } |
| 4223 | |
| 4224 | SKIP_WHITESPACE (); |
| 4225 | if (*input_line_pointer != ',') |
| 4226 | { |
| 4227 | as_bad (_("missing reloc type")); |
| 4228 | goto err_out; |
| 4229 | } |
| 4230 | |
| 4231 | ++input_line_pointer; |
| 4232 | SKIP_WHITESPACE (); |
| 4233 | c = get_symbol_name (& r_name); |
| 4234 | if (strncasecmp (r_name, "BFD_RELOC_", 10) == 0) |
| 4235 | { |
| 4236 | unsigned int i; |
| 4237 | |
| 4238 | for (reloc->u.a.howto = NULL, i = 0; i < ARRAY_SIZE (bfd_relocs); i++) |
| 4239 | if (strcasecmp (r_name + 10, bfd_relocs[i].name) == 0) |
| 4240 | { |
| 4241 | reloc->u.a.howto = bfd_reloc_type_lookup (stdoutput, |
| 4242 | bfd_relocs[i].code); |
| 4243 | break; |
| 4244 | } |
| 4245 | } |
| 4246 | else |
| 4247 | reloc->u.a.howto = bfd_reloc_name_lookup (stdoutput, r_name); |
| 4248 | *input_line_pointer = c; |
| 4249 | if (reloc->u.a.howto == NULL) |
| 4250 | { |
| 4251 | as_bad (_("unrecognized reloc type")); |
| 4252 | goto err_out; |
| 4253 | } |
| 4254 | |
| 4255 | exp.X_op = O_absent; |
| 4256 | SKIP_WHITESPACE_AFTER_NAME (); |
| 4257 | if (*input_line_pointer == ',') |
| 4258 | { |
| 4259 | ++input_line_pointer; |
| 4260 | expression (&exp); |
| 4261 | } |
| 4262 | switch (exp.X_op) |
| 4263 | { |
| 4264 | case O_illegal: |
| 4265 | case O_big: |
| 4266 | case O_register: |
| 4267 | as_bad (_("bad reloc expression")); |
| 4268 | err_out: |
| 4269 | ignore_rest_of_line (); |
| 4270 | free (reloc); |
| 4271 | if (flag_mri) |
| 4272 | mri_comment_end (stop, stopc); |
| 4273 | return; |
| 4274 | case O_absent: |
| 4275 | reloc->u.a.sym = NULL; |
| 4276 | reloc->u.a.addend = 0; |
| 4277 | break; |
| 4278 | case O_constant: |
| 4279 | reloc->u.a.sym = NULL; |
| 4280 | reloc->u.a.addend = exp.X_add_number; |
| 4281 | break; |
| 4282 | case O_symbol: |
| 4283 | reloc->u.a.sym = exp.X_add_symbol; |
| 4284 | reloc->u.a.addend = exp.X_add_number; |
| 4285 | break; |
| 4286 | default: |
| 4287 | reloc->u.a.sym = make_expr_symbol (&exp); |
| 4288 | reloc->u.a.addend = 0; |
| 4289 | break; |
| 4290 | } |
| 4291 | |
| 4292 | reloc->file = as_where (&reloc->line); |
| 4293 | reloc->next = reloc_list; |
| 4294 | reloc_list = reloc; |
| 4295 | |
| 4296 | demand_empty_rest_of_line (); |
| 4297 | if (flag_mri) |
| 4298 | mri_comment_end (stop, stopc); |
| 4299 | } |
| 4300 | |
| 4301 | /* Put the contents of expression EXP into the object file using |
| 4302 | NBYTES bytes. If need_pass_2 is 1, this does nothing. */ |
| 4303 | |
| 4304 | void |
| 4305 | emit_expr (expressionS *exp, unsigned int nbytes) |
| 4306 | { |
| 4307 | emit_expr_with_reloc (exp, nbytes, TC_PARSE_CONS_RETURN_NONE); |
| 4308 | } |
| 4309 | |
| 4310 | void |
| 4311 | emit_expr_with_reloc (expressionS *exp, |
| 4312 | unsigned int nbytes, |
| 4313 | TC_PARSE_CONS_RETURN_TYPE reloc) |
| 4314 | { |
| 4315 | operatorT op; |
| 4316 | char *p; |
| 4317 | valueT extra_digit = 0; |
| 4318 | |
| 4319 | /* Don't do anything if we are going to make another pass. */ |
| 4320 | if (need_pass_2) |
| 4321 | return; |
| 4322 | |
| 4323 | frag_grow (nbytes); |
| 4324 | dot_value = frag_now_fix (); |
| 4325 | dot_frag = frag_now; |
| 4326 | |
| 4327 | #ifndef NO_LISTING |
| 4328 | #ifdef OBJ_ELF |
| 4329 | /* When gcc emits DWARF 1 debugging pseudo-ops, a line number will |
| 4330 | appear as a four byte positive constant in the .line section, |
| 4331 | followed by a 2 byte 0xffff. Look for that case here. */ |
| 4332 | { |
| 4333 | static int dwarf_line = -1; |
| 4334 | |
| 4335 | if (strcmp (segment_name (now_seg), ".line") != 0) |
| 4336 | dwarf_line = -1; |
| 4337 | else if (dwarf_line >= 0 |
| 4338 | && nbytes == 2 |
| 4339 | && exp->X_op == O_constant |
| 4340 | && (exp->X_add_number == -1 || exp->X_add_number == 0xffff)) |
| 4341 | listing_source_line ((unsigned int) dwarf_line); |
| 4342 | else if (nbytes == 4 |
| 4343 | && exp->X_op == O_constant |
| 4344 | && exp->X_add_number >= 0) |
| 4345 | dwarf_line = exp->X_add_number; |
| 4346 | else |
| 4347 | dwarf_line = -1; |
| 4348 | } |
| 4349 | |
| 4350 | /* When gcc emits DWARF 1 debugging pseudo-ops, a file name will |
| 4351 | appear as a 2 byte TAG_compile_unit (0x11) followed by a 2 byte |
| 4352 | AT_sibling (0x12) followed by a four byte address of the sibling |
| 4353 | followed by a 2 byte AT_name (0x38) followed by the name of the |
| 4354 | file. We look for that case here. */ |
| 4355 | { |
| 4356 | static int dwarf_file = 0; |
| 4357 | |
| 4358 | if (strcmp (segment_name (now_seg), ".debug") != 0) |
| 4359 | dwarf_file = 0; |
| 4360 | else if (dwarf_file == 0 |
| 4361 | && nbytes == 2 |
| 4362 | && exp->X_op == O_constant |
| 4363 | && exp->X_add_number == 0x11) |
| 4364 | dwarf_file = 1; |
| 4365 | else if (dwarf_file == 1 |
| 4366 | && nbytes == 2 |
| 4367 | && exp->X_op == O_constant |
| 4368 | && exp->X_add_number == 0x12) |
| 4369 | dwarf_file = 2; |
| 4370 | else if (dwarf_file == 2 |
| 4371 | && nbytes == 4) |
| 4372 | dwarf_file = 3; |
| 4373 | else if (dwarf_file == 3 |
| 4374 | && nbytes == 2 |
| 4375 | && exp->X_op == O_constant |
| 4376 | && exp->X_add_number == 0x38) |
| 4377 | dwarf_file = 4; |
| 4378 | else |
| 4379 | dwarf_file = 0; |
| 4380 | |
| 4381 | /* The variable dwarf_file_string tells stringer that the string |
| 4382 | may be the name of the source file. */ |
| 4383 | if (dwarf_file == 4) |
| 4384 | dwarf_file_string = 1; |
| 4385 | else |
| 4386 | dwarf_file_string = 0; |
| 4387 | } |
| 4388 | #endif |
| 4389 | #endif |
| 4390 | |
| 4391 | if (check_eh_frame (exp, &nbytes)) |
| 4392 | return; |
| 4393 | |
| 4394 | op = exp->X_op; |
| 4395 | |
| 4396 | /* Handle a negative bignum. */ |
| 4397 | if (op == O_uminus |
| 4398 | && exp->X_add_number == 0 |
| 4399 | && symbol_get_value_expression (exp->X_add_symbol)->X_op == O_big |
| 4400 | && symbol_get_value_expression (exp->X_add_symbol)->X_add_number > 0) |
| 4401 | { |
| 4402 | int i; |
| 4403 | unsigned long carry; |
| 4404 | |
| 4405 | exp = symbol_get_value_expression (exp->X_add_symbol); |
| 4406 | |
| 4407 | /* Negate the bignum: one's complement each digit and add 1. */ |
| 4408 | carry = 1; |
| 4409 | for (i = 0; i < exp->X_add_number; i++) |
| 4410 | { |
| 4411 | unsigned long next; |
| 4412 | |
| 4413 | next = (((~(generic_bignum[i] & LITTLENUM_MASK)) |
| 4414 | & LITTLENUM_MASK) |
| 4415 | + carry); |
| 4416 | generic_bignum[i] = next & LITTLENUM_MASK; |
| 4417 | carry = next >> LITTLENUM_NUMBER_OF_BITS; |
| 4418 | } |
| 4419 | |
| 4420 | /* We can ignore any carry out, because it will be handled by |
| 4421 | extra_digit if it is needed. */ |
| 4422 | |
| 4423 | extra_digit = (valueT) -1; |
| 4424 | op = O_big; |
| 4425 | } |
| 4426 | |
| 4427 | if (op == O_absent || op == O_illegal) |
| 4428 | { |
| 4429 | as_warn (_("zero assumed for missing expression")); |
| 4430 | exp->X_add_number = 0; |
| 4431 | op = O_constant; |
| 4432 | } |
| 4433 | else if (op == O_big && exp->X_add_number <= 0) |
| 4434 | { |
| 4435 | as_bad (_("floating point number invalid")); |
| 4436 | exp->X_add_number = 0; |
| 4437 | op = O_constant; |
| 4438 | } |
| 4439 | else if (op == O_register) |
| 4440 | { |
| 4441 | as_warn (_("register value used as expression")); |
| 4442 | op = O_constant; |
| 4443 | } |
| 4444 | |
| 4445 | /* Allow `.word 0' in the absolute section. */ |
| 4446 | if (now_seg == absolute_section) |
| 4447 | { |
| 4448 | if (op != O_constant || exp->X_add_number != 0) |
| 4449 | as_bad (_("attempt to store value in absolute section")); |
| 4450 | abs_section_offset += nbytes; |
| 4451 | return; |
| 4452 | } |
| 4453 | |
| 4454 | /* Allow `.word 0' in BSS style sections. */ |
| 4455 | if ((op != O_constant || exp->X_add_number != 0) && in_bss ()) |
| 4456 | as_bad (_("attempt to store non-zero value in section `%s'"), |
| 4457 | segment_name (now_seg)); |
| 4458 | |
| 4459 | p = frag_more ((int) nbytes); |
| 4460 | |
| 4461 | if (reloc != TC_PARSE_CONS_RETURN_NONE) |
| 4462 | { |
| 4463 | emit_expr_fix (exp, nbytes, frag_now, p, reloc); |
| 4464 | return; |
| 4465 | } |
| 4466 | |
| 4467 | #ifndef WORKING_DOT_WORD |
| 4468 | /* If we have the difference of two symbols in a word, save it on |
| 4469 | the broken_words list. See the code in write.c. */ |
| 4470 | if (op == O_subtract && nbytes == 2) |
| 4471 | { |
| 4472 | struct broken_word *x; |
| 4473 | |
| 4474 | x = XNEW (struct broken_word); |
| 4475 | x->next_broken_word = broken_words; |
| 4476 | broken_words = x; |
| 4477 | x->seg = now_seg; |
| 4478 | x->subseg = now_subseg; |
| 4479 | x->frag = frag_now; |
| 4480 | x->word_goes_here = p; |
| 4481 | x->dispfrag = 0; |
| 4482 | x->add = exp->X_add_symbol; |
| 4483 | x->sub = exp->X_op_symbol; |
| 4484 | x->addnum = exp->X_add_number; |
| 4485 | x->added = 0; |
| 4486 | x->use_jump = 0; |
| 4487 | new_broken_words++; |
| 4488 | return; |
| 4489 | } |
| 4490 | #endif |
| 4491 | |
| 4492 | /* If we have an integer, but the number of bytes is too large to |
| 4493 | pass to md_number_to_chars, handle it as a bignum. */ |
| 4494 | if (op == O_constant && nbytes > sizeof (valueT)) |
| 4495 | { |
| 4496 | extra_digit = exp->X_unsigned ? 0 : -1; |
| 4497 | convert_to_bignum (exp, !exp->X_unsigned); |
| 4498 | op = O_big; |
| 4499 | } |
| 4500 | |
| 4501 | if (op == O_constant) |
| 4502 | { |
| 4503 | valueT get; |
| 4504 | valueT use; |
| 4505 | valueT mask; |
| 4506 | valueT hibit; |
| 4507 | valueT unmask; |
| 4508 | |
| 4509 | /* JF << of >= number of bits in the object is undefined. In |
| 4510 | particular SPARC (Sun 4) has problems. */ |
| 4511 | if (nbytes >= sizeof (valueT)) |
| 4512 | { |
| 4513 | mask = 0; |
| 4514 | if (nbytes > sizeof (valueT)) |
| 4515 | hibit = 0; |
| 4516 | else |
| 4517 | hibit = (valueT) 1 << (nbytes * BITS_PER_CHAR - 1); |
| 4518 | } |
| 4519 | else |
| 4520 | { |
| 4521 | /* Don't store these bits. */ |
| 4522 | mask = ~(valueT) 0 << (BITS_PER_CHAR * nbytes); |
| 4523 | hibit = (valueT) 1 << (nbytes * BITS_PER_CHAR - 1); |
| 4524 | } |
| 4525 | |
| 4526 | unmask = ~mask; /* Do store these bits. */ |
| 4527 | |
| 4528 | #ifdef NEVER |
| 4529 | "Do this mod if you want every overflow check to assume SIGNED 2's complement data."; |
| 4530 | mask = ~(unmask >> 1); /* Includes sign bit now. */ |
| 4531 | #endif |
| 4532 | |
| 4533 | get = exp->X_add_number; |
| 4534 | use = get & unmask; |
| 4535 | if ((get & mask) != 0 |
| 4536 | && ((get & mask) != mask |
| 4537 | || (get & hibit) == 0)) |
| 4538 | { |
| 4539 | /* Leading bits contain both 0s & 1s. */ |
| 4540 | #if defined (BFD64) && BFD_HOST_64BIT_LONG_LONG |
| 4541 | #ifndef __MSVCRT__ |
| 4542 | as_warn (_("value 0x%llx truncated to 0x%llx"), |
| 4543 | (unsigned long long) get, (unsigned long long) use); |
| 4544 | #else |
| 4545 | as_warn (_("value 0x%I64x truncated to 0x%I64x"), |
| 4546 | (unsigned long long) get, (unsigned long long) use); |
| 4547 | #endif |
| 4548 | #else |
| 4549 | as_warn (_("value 0x%lx truncated to 0x%lx"), |
| 4550 | (unsigned long) get, (unsigned long) use); |
| 4551 | #endif |
| 4552 | } |
| 4553 | /* Put bytes in right order. */ |
| 4554 | md_number_to_chars (p, use, (int) nbytes); |
| 4555 | } |
| 4556 | else if (op == O_big) |
| 4557 | { |
| 4558 | unsigned int size; |
| 4559 | LITTLENUM_TYPE *nums; |
| 4560 | |
| 4561 | size = exp->X_add_number * CHARS_PER_LITTLENUM; |
| 4562 | if (nbytes < size) |
| 4563 | { |
| 4564 | int i = nbytes / CHARS_PER_LITTLENUM; |
| 4565 | |
| 4566 | if (i != 0) |
| 4567 | { |
| 4568 | LITTLENUM_TYPE sign = 0; |
| 4569 | if ((generic_bignum[--i] |
| 4570 | & (1 << (LITTLENUM_NUMBER_OF_BITS - 1))) != 0) |
| 4571 | sign = ~(LITTLENUM_TYPE) 0; |
| 4572 | |
| 4573 | while (++i < exp->X_add_number) |
| 4574 | if (generic_bignum[i] != sign) |
| 4575 | break; |
| 4576 | } |
| 4577 | else if (nbytes == 1) |
| 4578 | { |
| 4579 | /* We have nbytes == 1 and CHARS_PER_LITTLENUM == 2 (probably). |
| 4580 | Check that bits 8.. of generic_bignum[0] match bit 7 |
| 4581 | and that they match all of generic_bignum[1..exp->X_add_number]. */ |
| 4582 | LITTLENUM_TYPE sign = (generic_bignum[0] & (1 << 7)) ? -1 : 0; |
| 4583 | LITTLENUM_TYPE himask = LITTLENUM_MASK & ~ 0xFF; |
| 4584 | |
| 4585 | if ((generic_bignum[0] & himask) == (sign & himask)) |
| 4586 | { |
| 4587 | while (++i < exp->X_add_number) |
| 4588 | if (generic_bignum[i] != sign) |
| 4589 | break; |
| 4590 | } |
| 4591 | } |
| 4592 | |
| 4593 | if (i < exp->X_add_number) |
| 4594 | as_warn (ngettext ("bignum truncated to %d byte", |
| 4595 | "bignum truncated to %d bytes", |
| 4596 | nbytes), |
| 4597 | nbytes); |
| 4598 | size = nbytes; |
| 4599 | } |
| 4600 | |
| 4601 | if (nbytes == 1) |
| 4602 | { |
| 4603 | md_number_to_chars (p, (valueT) generic_bignum[0], 1); |
| 4604 | return; |
| 4605 | } |
| 4606 | know (nbytes % CHARS_PER_LITTLENUM == 0); |
| 4607 | |
| 4608 | if (target_big_endian) |
| 4609 | { |
| 4610 | while (nbytes > size) |
| 4611 | { |
| 4612 | md_number_to_chars (p, extra_digit, CHARS_PER_LITTLENUM); |
| 4613 | nbytes -= CHARS_PER_LITTLENUM; |
| 4614 | p += CHARS_PER_LITTLENUM; |
| 4615 | } |
| 4616 | |
| 4617 | nums = generic_bignum + size / CHARS_PER_LITTLENUM; |
| 4618 | while (size >= CHARS_PER_LITTLENUM) |
| 4619 | { |
| 4620 | --nums; |
| 4621 | md_number_to_chars (p, (valueT) *nums, CHARS_PER_LITTLENUM); |
| 4622 | size -= CHARS_PER_LITTLENUM; |
| 4623 | p += CHARS_PER_LITTLENUM; |
| 4624 | } |
| 4625 | } |
| 4626 | else |
| 4627 | { |
| 4628 | nums = generic_bignum; |
| 4629 | while (size >= CHARS_PER_LITTLENUM) |
| 4630 | { |
| 4631 | md_number_to_chars (p, (valueT) *nums, CHARS_PER_LITTLENUM); |
| 4632 | ++nums; |
| 4633 | size -= CHARS_PER_LITTLENUM; |
| 4634 | p += CHARS_PER_LITTLENUM; |
| 4635 | nbytes -= CHARS_PER_LITTLENUM; |
| 4636 | } |
| 4637 | |
| 4638 | while (nbytes >= CHARS_PER_LITTLENUM) |
| 4639 | { |
| 4640 | md_number_to_chars (p, extra_digit, CHARS_PER_LITTLENUM); |
| 4641 | nbytes -= CHARS_PER_LITTLENUM; |
| 4642 | p += CHARS_PER_LITTLENUM; |
| 4643 | } |
| 4644 | } |
| 4645 | } |
| 4646 | else |
| 4647 | emit_expr_fix (exp, nbytes, frag_now, p, TC_PARSE_CONS_RETURN_NONE); |
| 4648 | } |
| 4649 | |
| 4650 | void |
| 4651 | emit_expr_fix (expressionS *exp, unsigned int nbytes, fragS *frag, char *p, |
| 4652 | TC_PARSE_CONS_RETURN_TYPE r ATTRIBUTE_UNUSED) |
| 4653 | { |
| 4654 | int offset = 0; |
| 4655 | unsigned int size = nbytes; |
| 4656 | |
| 4657 | memset (p, 0, size); |
| 4658 | |
| 4659 | /* Generate a fixS to record the symbol value. */ |
| 4660 | |
| 4661 | #ifdef TC_CONS_FIX_NEW |
| 4662 | TC_CONS_FIX_NEW (frag, p - frag->fr_literal + offset, size, exp, r); |
| 4663 | #else |
| 4664 | if (r != TC_PARSE_CONS_RETURN_NONE) |
| 4665 | { |
| 4666 | reloc_howto_type *reloc_howto; |
| 4667 | |
| 4668 | reloc_howto = bfd_reloc_type_lookup (stdoutput, r); |
| 4669 | size = bfd_get_reloc_size (reloc_howto); |
| 4670 | |
| 4671 | if (size > nbytes) |
| 4672 | { |
| 4673 | as_bad (ngettext ("%s relocations do not fit in %u byte", |
| 4674 | "%s relocations do not fit in %u bytes", |
| 4675 | nbytes), |
| 4676 | reloc_howto->name, nbytes); |
| 4677 | return; |
| 4678 | } |
| 4679 | else if (target_big_endian) |
| 4680 | offset = nbytes - size; |
| 4681 | } |
| 4682 | else |
| 4683 | switch (size) |
| 4684 | { |
| 4685 | case 1: |
| 4686 | r = BFD_RELOC_8; |
| 4687 | break; |
| 4688 | case 2: |
| 4689 | r = BFD_RELOC_16; |
| 4690 | break; |
| 4691 | case 3: |
| 4692 | r = BFD_RELOC_24; |
| 4693 | break; |
| 4694 | case 4: |
| 4695 | r = BFD_RELOC_32; |
| 4696 | break; |
| 4697 | case 8: |
| 4698 | r = BFD_RELOC_64; |
| 4699 | break; |
| 4700 | default: |
| 4701 | as_bad (_("unsupported BFD relocation size %u"), size); |
| 4702 | return; |
| 4703 | } |
| 4704 | fix_new_exp (frag, p - frag->fr_literal + offset, size, |
| 4705 | exp, 0, r); |
| 4706 | #endif |
| 4707 | } |
| 4708 | \f |
| 4709 | /* Handle an MRI style string expression. */ |
| 4710 | |
| 4711 | #ifdef TC_M68K |
| 4712 | static void |
| 4713 | parse_mri_cons (expressionS *exp, unsigned int nbytes) |
| 4714 | { |
| 4715 | if (*input_line_pointer != '\'' |
| 4716 | && (input_line_pointer[1] != '\'' |
| 4717 | || (*input_line_pointer != 'A' |
| 4718 | && *input_line_pointer != 'E'))) |
| 4719 | (void) TC_PARSE_CONS_EXPRESSION (exp, nbytes); |
| 4720 | else |
| 4721 | { |
| 4722 | unsigned int scan; |
| 4723 | unsigned int result = 0; |
| 4724 | |
| 4725 | /* An MRI style string. Cut into as many bytes as will fit into |
| 4726 | a nbyte chunk, left justify if necessary, and separate with |
| 4727 | commas so we can try again later. */ |
| 4728 | if (*input_line_pointer == 'A') |
| 4729 | ++input_line_pointer; |
| 4730 | else if (*input_line_pointer == 'E') |
| 4731 | { |
| 4732 | as_bad (_("EBCDIC constants are not supported")); |
| 4733 | ++input_line_pointer; |
| 4734 | } |
| 4735 | |
| 4736 | input_line_pointer++; |
| 4737 | for (scan = 0; scan < nbytes; scan++) |
| 4738 | { |
| 4739 | if (*input_line_pointer == '\'') |
| 4740 | { |
| 4741 | if (input_line_pointer[1] == '\'') |
| 4742 | { |
| 4743 | input_line_pointer++; |
| 4744 | } |
| 4745 | else |
| 4746 | break; |
| 4747 | } |
| 4748 | result = (result << 8) | (*input_line_pointer++); |
| 4749 | } |
| 4750 | |
| 4751 | /* Left justify. */ |
| 4752 | while (scan < nbytes) |
| 4753 | { |
| 4754 | result <<= 8; |
| 4755 | scan++; |
| 4756 | } |
| 4757 | |
| 4758 | /* Create correct expression. */ |
| 4759 | exp->X_op = O_constant; |
| 4760 | exp->X_add_number = result; |
| 4761 | |
| 4762 | /* Fake it so that we can read the next char too. */ |
| 4763 | if (input_line_pointer[0] != '\'' || |
| 4764 | (input_line_pointer[0] == '\'' && input_line_pointer[1] == '\'')) |
| 4765 | { |
| 4766 | input_line_pointer -= 2; |
| 4767 | input_line_pointer[0] = ','; |
| 4768 | input_line_pointer[1] = '\''; |
| 4769 | } |
| 4770 | else |
| 4771 | input_line_pointer++; |
| 4772 | } |
| 4773 | } |
| 4774 | #endif /* TC_M68K */ |
| 4775 | \f |
| 4776 | #ifdef REPEAT_CONS_EXPRESSIONS |
| 4777 | |
| 4778 | /* Parse a repeat expression for cons. This is used by the MIPS |
| 4779 | assembler. The format is NUMBER:COUNT; NUMBER appears in the |
| 4780 | object file COUNT times. |
| 4781 | |
| 4782 | To use this for a target, define REPEAT_CONS_EXPRESSIONS. */ |
| 4783 | |
| 4784 | static void |
| 4785 | parse_repeat_cons (expressionS *exp, unsigned int nbytes) |
| 4786 | { |
| 4787 | expressionS count; |
| 4788 | int i; |
| 4789 | |
| 4790 | expression (exp); |
| 4791 | |
| 4792 | if (*input_line_pointer != ':') |
| 4793 | { |
| 4794 | /* No repeat count. */ |
| 4795 | return; |
| 4796 | } |
| 4797 | |
| 4798 | ++input_line_pointer; |
| 4799 | expression (&count); |
| 4800 | if (count.X_op != O_constant |
| 4801 | || count.X_add_number <= 0) |
| 4802 | { |
| 4803 | as_warn (_("unresolvable or nonpositive repeat count; using 1")); |
| 4804 | return; |
| 4805 | } |
| 4806 | |
| 4807 | /* The cons function is going to output this expression once. So we |
| 4808 | output it count - 1 times. */ |
| 4809 | for (i = count.X_add_number - 1; i > 0; i--) |
| 4810 | emit_expr (exp, nbytes); |
| 4811 | } |
| 4812 | |
| 4813 | #endif /* REPEAT_CONS_EXPRESSIONS */ |
| 4814 | \f |
| 4815 | /* Parse a floating point number represented as a hex constant. This |
| 4816 | permits users to specify the exact bits they want in the floating |
| 4817 | point number. */ |
| 4818 | |
| 4819 | static int |
| 4820 | hex_float (int float_type, char *bytes) |
| 4821 | { |
| 4822 | int length; |
| 4823 | int i; |
| 4824 | |
| 4825 | switch (float_type) |
| 4826 | { |
| 4827 | case 'f': |
| 4828 | case 'F': |
| 4829 | case 's': |
| 4830 | case 'S': |
| 4831 | length = 4; |
| 4832 | break; |
| 4833 | |
| 4834 | case 'd': |
| 4835 | case 'D': |
| 4836 | case 'r': |
| 4837 | case 'R': |
| 4838 | length = 8; |
| 4839 | break; |
| 4840 | |
| 4841 | case 'x': |
| 4842 | case 'X': |
| 4843 | length = 12; |
| 4844 | break; |
| 4845 | |
| 4846 | case 'p': |
| 4847 | case 'P': |
| 4848 | length = 12; |
| 4849 | break; |
| 4850 | |
| 4851 | default: |
| 4852 | as_bad (_("unknown floating type type '%c'"), float_type); |
| 4853 | return -1; |
| 4854 | } |
| 4855 | |
| 4856 | /* It would be nice if we could go through expression to parse the |
| 4857 | hex constant, but if we get a bignum it's a pain to sort it into |
| 4858 | the buffer correctly. */ |
| 4859 | i = 0; |
| 4860 | while (hex_p (*input_line_pointer) || *input_line_pointer == '_') |
| 4861 | { |
| 4862 | int d; |
| 4863 | |
| 4864 | /* The MRI assembler accepts arbitrary underscores strewn about |
| 4865 | through the hex constant, so we ignore them as well. */ |
| 4866 | if (*input_line_pointer == '_') |
| 4867 | { |
| 4868 | ++input_line_pointer; |
| 4869 | continue; |
| 4870 | } |
| 4871 | |
| 4872 | if (i >= length) |
| 4873 | { |
| 4874 | as_warn (_("floating point constant too large")); |
| 4875 | return -1; |
| 4876 | } |
| 4877 | d = hex_value (*input_line_pointer) << 4; |
| 4878 | ++input_line_pointer; |
| 4879 | while (*input_line_pointer == '_') |
| 4880 | ++input_line_pointer; |
| 4881 | if (hex_p (*input_line_pointer)) |
| 4882 | { |
| 4883 | d += hex_value (*input_line_pointer); |
| 4884 | ++input_line_pointer; |
| 4885 | } |
| 4886 | if (target_big_endian) |
| 4887 | bytes[i] = d; |
| 4888 | else |
| 4889 | bytes[length - i - 1] = d; |
| 4890 | ++i; |
| 4891 | } |
| 4892 | |
| 4893 | if (i < length) |
| 4894 | { |
| 4895 | if (target_big_endian) |
| 4896 | memset (bytes + i, 0, length - i); |
| 4897 | else |
| 4898 | memset (bytes, 0, length - i); |
| 4899 | } |
| 4900 | |
| 4901 | return length; |
| 4902 | } |
| 4903 | |
| 4904 | /* float_cons() |
| 4905 | |
| 4906 | CONStruct some more frag chars of .floats .ffloats etc. |
| 4907 | Makes 0 or more new frags. |
| 4908 | If need_pass_2 == 1, no frags are emitted. |
| 4909 | This understands only floating literals, not expressions. Sorry. |
| 4910 | |
| 4911 | A floating constant is defined by atof_generic(), except it is preceded |
| 4912 | by 0d 0f 0g or 0h. After observing the STRANGE way my BSD AS does its |
| 4913 | reading, I decided to be incompatible. This always tries to give you |
| 4914 | rounded bits to the precision of the pseudo-op. Former AS did premature |
| 4915 | truncation, restored noisy bits instead of trailing 0s AND gave you |
| 4916 | a choice of 2 flavours of noise according to which of 2 floating-point |
| 4917 | scanners you directed AS to use. |
| 4918 | |
| 4919 | In: input_line_pointer->whitespace before, or '0' of flonum. */ |
| 4920 | |
| 4921 | void |
| 4922 | float_cons (/* Clobbers input_line-pointer, checks end-of-line. */ |
| 4923 | int float_type /* 'f':.ffloat ... 'F':.float ... */) |
| 4924 | { |
| 4925 | char *p; |
| 4926 | int length; /* Number of chars in an object. */ |
| 4927 | const char *err; /* Error from scanning floating literal. */ |
| 4928 | char temp[MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT]; |
| 4929 | |
| 4930 | if (is_it_end_of_statement ()) |
| 4931 | { |
| 4932 | demand_empty_rest_of_line (); |
| 4933 | return; |
| 4934 | } |
| 4935 | |
| 4936 | if (now_seg == absolute_section) |
| 4937 | { |
| 4938 | as_bad (_("attempt to store float in absolute section")); |
| 4939 | ignore_rest_of_line (); |
| 4940 | return; |
| 4941 | } |
| 4942 | |
| 4943 | if (in_bss ()) |
| 4944 | { |
| 4945 | as_bad (_("attempt to store float in section `%s'"), |
| 4946 | segment_name (now_seg)); |
| 4947 | ignore_rest_of_line (); |
| 4948 | return; |
| 4949 | } |
| 4950 | |
| 4951 | #ifdef md_flush_pending_output |
| 4952 | md_flush_pending_output (); |
| 4953 | #endif |
| 4954 | |
| 4955 | #ifdef md_cons_align |
| 4956 | md_cons_align (1); |
| 4957 | #endif |
| 4958 | |
| 4959 | do |
| 4960 | { |
| 4961 | /* input_line_pointer->1st char of a flonum (we hope!). */ |
| 4962 | SKIP_WHITESPACE (); |
| 4963 | |
| 4964 | /* Skip any 0{letter} that may be present. Don't even check if the |
| 4965 | letter is legal. Someone may invent a "z" format and this routine |
| 4966 | has no use for such information. Lusers beware: you get |
| 4967 | diagnostics if your input is ill-conditioned. */ |
| 4968 | if (input_line_pointer[0] == '0' |
| 4969 | && ISALPHA (input_line_pointer[1])) |
| 4970 | input_line_pointer += 2; |
| 4971 | |
| 4972 | /* Accept :xxxx, where the x's are hex digits, for a floating |
| 4973 | point with the exact digits specified. */ |
| 4974 | if (input_line_pointer[0] == ':') |
| 4975 | { |
| 4976 | ++input_line_pointer; |
| 4977 | length = hex_float (float_type, temp); |
| 4978 | if (length < 0) |
| 4979 | { |
| 4980 | ignore_rest_of_line (); |
| 4981 | return; |
| 4982 | } |
| 4983 | } |
| 4984 | else |
| 4985 | { |
| 4986 | err = md_atof (float_type, temp, &length); |
| 4987 | know (length <= MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT); |
| 4988 | know (err != NULL || length > 0); |
| 4989 | if (err) |
| 4990 | { |
| 4991 | as_bad (_("bad floating literal: %s"), err); |
| 4992 | ignore_rest_of_line (); |
| 4993 | return; |
| 4994 | } |
| 4995 | } |
| 4996 | |
| 4997 | if (!need_pass_2) |
| 4998 | { |
| 4999 | int count; |
| 5000 | |
| 5001 | count = 1; |
| 5002 | |
| 5003 | #ifdef REPEAT_CONS_EXPRESSIONS |
| 5004 | if (*input_line_pointer == ':') |
| 5005 | { |
| 5006 | expressionS count_exp; |
| 5007 | |
| 5008 | ++input_line_pointer; |
| 5009 | expression (&count_exp); |
| 5010 | |
| 5011 | if (count_exp.X_op != O_constant |
| 5012 | || count_exp.X_add_number <= 0) |
| 5013 | as_warn (_("unresolvable or nonpositive repeat count; using 1")); |
| 5014 | else |
| 5015 | count = count_exp.X_add_number; |
| 5016 | } |
| 5017 | #endif |
| 5018 | |
| 5019 | while (--count >= 0) |
| 5020 | { |
| 5021 | p = frag_more (length); |
| 5022 | memcpy (p, temp, (unsigned int) length); |
| 5023 | } |
| 5024 | } |
| 5025 | SKIP_WHITESPACE (); |
| 5026 | } |
| 5027 | while (*input_line_pointer++ == ','); |
| 5028 | |
| 5029 | /* Put terminator back into stream. */ |
| 5030 | --input_line_pointer; |
| 5031 | demand_empty_rest_of_line (); |
| 5032 | } |
| 5033 | \f |
| 5034 | /* LEB128 Encoding. |
| 5035 | |
| 5036 | Note - we are using the DWARF standard's definition of LEB128 encoding |
| 5037 | where each 7-bit value is a stored in a byte, *not* an octet. This |
| 5038 | means that on targets where a byte contains multiple octets there is |
| 5039 | a *huge waste of space*. (This also means that we do not have to |
| 5040 | have special versions of these functions for when OCTETS_PER_BYTE_POWER |
| 5041 | is non-zero). |
| 5042 | |
| 5043 | If the 7-bit values were to be packed into N-bit bytes (where N > 8) |
| 5044 | we would then have to consider whether multiple, successive LEB128 |
| 5045 | values should be packed into the bytes without padding (bad idea) or |
| 5046 | whether each LEB128 number is padded out to a whole number of bytes. |
| 5047 | Plus you have to decide on the endianness of packing octets into a |
| 5048 | byte. */ |
| 5049 | |
| 5050 | /* Return the size of a LEB128 value in bytes. */ |
| 5051 | |
| 5052 | static inline unsigned int |
| 5053 | sizeof_sleb128 (offsetT value) |
| 5054 | { |
| 5055 | int size = 0; |
| 5056 | unsigned byte; |
| 5057 | |
| 5058 | do |
| 5059 | { |
| 5060 | byte = (value & 0x7f); |
| 5061 | /* Sadly, we cannot rely on typical arithmetic right shift behaviour. |
| 5062 | Fortunately, we can structure things so that the extra work reduces |
| 5063 | to a noop on systems that do things "properly". */ |
| 5064 | value = (value >> 7) | ~(-(offsetT)1 >> 7); |
| 5065 | size += 1; |
| 5066 | } |
| 5067 | while (!(((value == 0) && ((byte & 0x40) == 0)) |
| 5068 | || ((value == -1) && ((byte & 0x40) != 0)))); |
| 5069 | |
| 5070 | return size; |
| 5071 | } |
| 5072 | |
| 5073 | static inline unsigned int |
| 5074 | sizeof_uleb128 (valueT value) |
| 5075 | { |
| 5076 | int size = 0; |
| 5077 | |
| 5078 | do |
| 5079 | { |
| 5080 | value >>= 7; |
| 5081 | size += 1; |
| 5082 | } |
| 5083 | while (value != 0); |
| 5084 | |
| 5085 | return size; |
| 5086 | } |
| 5087 | |
| 5088 | unsigned int |
| 5089 | sizeof_leb128 (valueT value, int sign) |
| 5090 | { |
| 5091 | if (sign) |
| 5092 | return sizeof_sleb128 ((offsetT) value); |
| 5093 | else |
| 5094 | return sizeof_uleb128 (value); |
| 5095 | } |
| 5096 | |
| 5097 | /* Output a LEB128 value. Returns the number of bytes used. */ |
| 5098 | |
| 5099 | static inline unsigned int |
| 5100 | output_sleb128 (char *p, offsetT value) |
| 5101 | { |
| 5102 | char *orig = p; |
| 5103 | int more; |
| 5104 | |
| 5105 | do |
| 5106 | { |
| 5107 | unsigned byte = (value & 0x7f); |
| 5108 | |
| 5109 | /* Sadly, we cannot rely on typical arithmetic right shift behaviour. |
| 5110 | Fortunately, we can structure things so that the extra work reduces |
| 5111 | to a noop on systems that do things "properly". */ |
| 5112 | value = (value >> 7) | ~(-(offsetT)1 >> 7); |
| 5113 | |
| 5114 | more = !((((value == 0) && ((byte & 0x40) == 0)) |
| 5115 | || ((value == -1) && ((byte & 0x40) != 0)))); |
| 5116 | if (more) |
| 5117 | byte |= 0x80; |
| 5118 | |
| 5119 | *p++ = byte; |
| 5120 | } |
| 5121 | while (more); |
| 5122 | |
| 5123 | return p - orig; |
| 5124 | } |
| 5125 | |
| 5126 | static inline unsigned int |
| 5127 | output_uleb128 (char *p, valueT value) |
| 5128 | { |
| 5129 | char *orig = p; |
| 5130 | |
| 5131 | do |
| 5132 | { |
| 5133 | unsigned byte = (value & 0x7f); |
| 5134 | |
| 5135 | value >>= 7; |
| 5136 | if (value != 0) |
| 5137 | /* More bytes to follow. */ |
| 5138 | byte |= 0x80; |
| 5139 | |
| 5140 | *p++ = byte; |
| 5141 | } |
| 5142 | while (value != 0); |
| 5143 | |
| 5144 | return p - orig; |
| 5145 | } |
| 5146 | |
| 5147 | unsigned int |
| 5148 | output_leb128 (char *p, valueT value, int sign) |
| 5149 | { |
| 5150 | if (sign) |
| 5151 | return output_sleb128 (p, (offsetT) value); |
| 5152 | else |
| 5153 | return output_uleb128 (p, value); |
| 5154 | } |
| 5155 | |
| 5156 | /* Do the same for bignums. We combine sizeof with output here in that |
| 5157 | we don't output for NULL values of P. It isn't really as critical as |
| 5158 | for "normal" values that this be streamlined. Returns the number of |
| 5159 | bytes used. */ |
| 5160 | |
| 5161 | static inline unsigned int |
| 5162 | output_big_sleb128 (char *p, LITTLENUM_TYPE *bignum, unsigned int size) |
| 5163 | { |
| 5164 | char *orig = p; |
| 5165 | valueT val = 0; |
| 5166 | int loaded = 0; |
| 5167 | unsigned byte; |
| 5168 | |
| 5169 | /* Strip leading sign extensions off the bignum. */ |
| 5170 | while (size > 1 |
| 5171 | && bignum[size - 1] == LITTLENUM_MASK |
| 5172 | && bignum[size - 2] > LITTLENUM_MASK / 2) |
| 5173 | size--; |
| 5174 | |
| 5175 | do |
| 5176 | { |
| 5177 | /* OR in the next part of the littlenum. */ |
| 5178 | val |= (*bignum << loaded); |
| 5179 | loaded += LITTLENUM_NUMBER_OF_BITS; |
| 5180 | size--; |
| 5181 | bignum++; |
| 5182 | |
| 5183 | /* Add bytes until there are less than 7 bits left in VAL |
| 5184 | or until every non-sign bit has been written. */ |
| 5185 | do |
| 5186 | { |
| 5187 | byte = val & 0x7f; |
| 5188 | loaded -= 7; |
| 5189 | val >>= 7; |
| 5190 | if (size > 0 |
| 5191 | || val != ((byte & 0x40) == 0 ? 0 : ((valueT) 1 << loaded) - 1)) |
| 5192 | byte |= 0x80; |
| 5193 | |
| 5194 | if (orig) |
| 5195 | *p = byte; |
| 5196 | p++; |
| 5197 | } |
| 5198 | while ((byte & 0x80) != 0 && loaded >= 7); |
| 5199 | } |
| 5200 | while (size > 0); |
| 5201 | |
| 5202 | /* Mop up any left-over bits (of which there will be less than 7). */ |
| 5203 | if ((byte & 0x80) != 0) |
| 5204 | { |
| 5205 | /* Sign-extend VAL. */ |
| 5206 | if (val & (1 << (loaded - 1))) |
| 5207 | val |= ~0U << loaded; |
| 5208 | if (orig) |
| 5209 | *p = val & 0x7f; |
| 5210 | p++; |
| 5211 | } |
| 5212 | |
| 5213 | return p - orig; |
| 5214 | } |
| 5215 | |
| 5216 | static inline unsigned int |
| 5217 | output_big_uleb128 (char *p, LITTLENUM_TYPE *bignum, unsigned int size) |
| 5218 | { |
| 5219 | char *orig = p; |
| 5220 | valueT val = 0; |
| 5221 | int loaded = 0; |
| 5222 | unsigned byte; |
| 5223 | |
| 5224 | /* Strip leading zeros off the bignum. */ |
| 5225 | /* XXX: Is this needed? */ |
| 5226 | while (size > 0 && bignum[size - 1] == 0) |
| 5227 | size--; |
| 5228 | |
| 5229 | do |
| 5230 | { |
| 5231 | if (loaded < 7 && size > 0) |
| 5232 | { |
| 5233 | val |= (*bignum << loaded); |
| 5234 | loaded += 8 * CHARS_PER_LITTLENUM; |
| 5235 | size--; |
| 5236 | bignum++; |
| 5237 | } |
| 5238 | |
| 5239 | byte = val & 0x7f; |
| 5240 | loaded -= 7; |
| 5241 | val >>= 7; |
| 5242 | |
| 5243 | if (size > 0 || val) |
| 5244 | byte |= 0x80; |
| 5245 | |
| 5246 | if (orig) |
| 5247 | *p = byte; |
| 5248 | p++; |
| 5249 | } |
| 5250 | while (byte & 0x80); |
| 5251 | |
| 5252 | return p - orig; |
| 5253 | } |
| 5254 | |
| 5255 | static unsigned int |
| 5256 | output_big_leb128 (char *p, LITTLENUM_TYPE *bignum, unsigned int size, int sign) |
| 5257 | { |
| 5258 | if (sign) |
| 5259 | return output_big_sleb128 (p, bignum, size); |
| 5260 | else |
| 5261 | return output_big_uleb128 (p, bignum, size); |
| 5262 | } |
| 5263 | |
| 5264 | /* Generate the appropriate fragments for a given expression to emit a |
| 5265 | leb128 value. SIGN is 1 for sleb, 0 for uleb. */ |
| 5266 | |
| 5267 | void |
| 5268 | emit_leb128_expr (expressionS *exp, int sign) |
| 5269 | { |
| 5270 | operatorT op = exp->X_op; |
| 5271 | unsigned int nbytes; |
| 5272 | |
| 5273 | if (op == O_absent || op == O_illegal) |
| 5274 | { |
| 5275 | as_warn (_("zero assumed for missing expression")); |
| 5276 | exp->X_add_number = 0; |
| 5277 | op = O_constant; |
| 5278 | } |
| 5279 | else if (op == O_big && exp->X_add_number <= 0) |
| 5280 | { |
| 5281 | as_bad (_("floating point number invalid")); |
| 5282 | exp->X_add_number = 0; |
| 5283 | op = O_constant; |
| 5284 | } |
| 5285 | else if (op == O_register) |
| 5286 | { |
| 5287 | as_warn (_("register value used as expression")); |
| 5288 | op = O_constant; |
| 5289 | } |
| 5290 | else if (op == O_constant |
| 5291 | && sign |
| 5292 | && (exp->X_add_number < 0) == !exp->X_extrabit) |
| 5293 | { |
| 5294 | /* We're outputting a signed leb128 and the sign of X_add_number |
| 5295 | doesn't reflect the sign of the original value. Convert EXP |
| 5296 | to a correctly-extended bignum instead. */ |
| 5297 | convert_to_bignum (exp, exp->X_extrabit); |
| 5298 | op = O_big; |
| 5299 | } |
| 5300 | |
| 5301 | if (now_seg == absolute_section) |
| 5302 | { |
| 5303 | if (op != O_constant || exp->X_add_number != 0) |
| 5304 | as_bad (_("attempt to store value in absolute section")); |
| 5305 | abs_section_offset++; |
| 5306 | return; |
| 5307 | } |
| 5308 | |
| 5309 | if ((op != O_constant || exp->X_add_number != 0) && in_bss ()) |
| 5310 | as_bad (_("attempt to store non-zero value in section `%s'"), |
| 5311 | segment_name (now_seg)); |
| 5312 | |
| 5313 | /* Let check_eh_frame know that data is being emitted. nbytes == -1 is |
| 5314 | a signal that this is leb128 data. It shouldn't optimize this away. */ |
| 5315 | nbytes = (unsigned int) -1; |
| 5316 | if (check_eh_frame (exp, &nbytes)) |
| 5317 | abort (); |
| 5318 | |
| 5319 | /* Let the backend know that subsequent data may be byte aligned. */ |
| 5320 | #ifdef md_cons_align |
| 5321 | md_cons_align (1); |
| 5322 | #endif |
| 5323 | |
| 5324 | if (op == O_constant) |
| 5325 | { |
| 5326 | /* If we've got a constant, emit the thing directly right now. */ |
| 5327 | |
| 5328 | valueT value = exp->X_add_number; |
| 5329 | unsigned int size; |
| 5330 | char *p; |
| 5331 | |
| 5332 | size = sizeof_leb128 (value, sign); |
| 5333 | p = frag_more (size); |
| 5334 | if (output_leb128 (p, value, sign) > size) |
| 5335 | abort (); |
| 5336 | } |
| 5337 | else if (op == O_big) |
| 5338 | { |
| 5339 | /* O_big is a different sort of constant. */ |
| 5340 | int nbr_digits = exp->X_add_number; |
| 5341 | unsigned int size; |
| 5342 | char *p; |
| 5343 | |
| 5344 | /* If the leading littenum is 0xffff, prepend a 0 to avoid confusion with |
| 5345 | a signed number. Unary operators like - or ~ always extend the |
| 5346 | bignum to its largest size. */ |
| 5347 | if (exp->X_unsigned |
| 5348 | && nbr_digits < SIZE_OF_LARGE_NUMBER |
| 5349 | && generic_bignum[nbr_digits - 1] == LITTLENUM_MASK) |
| 5350 | generic_bignum[nbr_digits++] = 0; |
| 5351 | |
| 5352 | size = output_big_leb128 (NULL, generic_bignum, nbr_digits, sign); |
| 5353 | p = frag_more (size); |
| 5354 | if (output_big_leb128 (p, generic_bignum, nbr_digits, sign) > size) |
| 5355 | abort (); |
| 5356 | } |
| 5357 | else |
| 5358 | { |
| 5359 | /* Otherwise, we have to create a variable sized fragment and |
| 5360 | resolve things later. */ |
| 5361 | |
| 5362 | frag_var (rs_leb128, sizeof_uleb128 (~(valueT) 0), 0, sign, |
| 5363 | make_expr_symbol (exp), 0, (char *) NULL); |
| 5364 | } |
| 5365 | } |
| 5366 | |
| 5367 | /* Parse the .sleb128 and .uleb128 pseudos. */ |
| 5368 | |
| 5369 | void |
| 5370 | s_leb128 (int sign) |
| 5371 | { |
| 5372 | expressionS exp; |
| 5373 | |
| 5374 | #ifdef md_flush_pending_output |
| 5375 | md_flush_pending_output (); |
| 5376 | #endif |
| 5377 | |
| 5378 | do |
| 5379 | { |
| 5380 | expression (&exp); |
| 5381 | emit_leb128_expr (&exp, sign); |
| 5382 | } |
| 5383 | while (*input_line_pointer++ == ','); |
| 5384 | |
| 5385 | input_line_pointer--; |
| 5386 | demand_empty_rest_of_line (); |
| 5387 | } |
| 5388 | \f |
| 5389 | static void |
| 5390 | stringer_append_char (int c, int bitsize) |
| 5391 | { |
| 5392 | if (c && in_bss ()) |
| 5393 | as_bad (_("attempt to store non-empty string in section `%s'"), |
| 5394 | segment_name (now_seg)); |
| 5395 | |
| 5396 | if (!target_big_endian) |
| 5397 | FRAG_APPEND_1_CHAR (c); |
| 5398 | |
| 5399 | switch (bitsize) |
| 5400 | { |
| 5401 | case 64: |
| 5402 | FRAG_APPEND_1_CHAR (0); |
| 5403 | FRAG_APPEND_1_CHAR (0); |
| 5404 | FRAG_APPEND_1_CHAR (0); |
| 5405 | FRAG_APPEND_1_CHAR (0); |
| 5406 | /* Fall through. */ |
| 5407 | case 32: |
| 5408 | FRAG_APPEND_1_CHAR (0); |
| 5409 | FRAG_APPEND_1_CHAR (0); |
| 5410 | /* Fall through. */ |
| 5411 | case 16: |
| 5412 | FRAG_APPEND_1_CHAR (0); |
| 5413 | /* Fall through. */ |
| 5414 | case 8: |
| 5415 | break; |
| 5416 | default: |
| 5417 | /* Called with invalid bitsize argument. */ |
| 5418 | abort (); |
| 5419 | break; |
| 5420 | } |
| 5421 | if (target_big_endian) |
| 5422 | FRAG_APPEND_1_CHAR (c); |
| 5423 | } |
| 5424 | |
| 5425 | /* Worker to do .ascii etc statements. |
| 5426 | Reads 0 or more ',' separated, double-quoted strings. |
| 5427 | Caller should have checked need_pass_2 is FALSE because we don't |
| 5428 | check it. |
| 5429 | Checks for end-of-line. |
| 5430 | BITS_APPENDZERO says how many bits are in a target char. |
| 5431 | The bottom bit is set if a NUL char should be appended to the strings. */ |
| 5432 | |
| 5433 | void |
| 5434 | stringer (int bits_appendzero) |
| 5435 | { |
| 5436 | const int bitsize = bits_appendzero & ~7; |
| 5437 | const int append_zero = bits_appendzero & 1; |
| 5438 | unsigned int c; |
| 5439 | #if !defined(NO_LISTING) && defined (OBJ_ELF) |
| 5440 | char *start; |
| 5441 | #endif |
| 5442 | |
| 5443 | #ifdef md_flush_pending_output |
| 5444 | md_flush_pending_output (); |
| 5445 | #endif |
| 5446 | |
| 5447 | #ifdef md_cons_align |
| 5448 | md_cons_align (1); |
| 5449 | #endif |
| 5450 | |
| 5451 | /* If we have been switched into the abs_section then we |
| 5452 | will not have an obstack onto which we can hang strings. */ |
| 5453 | if (now_seg == absolute_section) |
| 5454 | { |
| 5455 | as_bad (_("strings must be placed into a section")); |
| 5456 | ignore_rest_of_line (); |
| 5457 | return; |
| 5458 | } |
| 5459 | |
| 5460 | /* The following awkward logic is to parse ZERO or more strings, |
| 5461 | comma separated. Recall a string expression includes spaces |
| 5462 | before the opening '\"' and spaces after the closing '\"'. |
| 5463 | We fake a leading ',' if there is (supposed to be) |
| 5464 | a 1st, expression. We keep demanding expressions for each ','. */ |
| 5465 | if (is_it_end_of_statement ()) |
| 5466 | { |
| 5467 | c = 0; /* Skip loop. */ |
| 5468 | ++input_line_pointer; /* Compensate for end of loop. */ |
| 5469 | } |
| 5470 | else |
| 5471 | { |
| 5472 | c = ','; /* Do loop. */ |
| 5473 | } |
| 5474 | |
| 5475 | while (c == ',' || c == '<' || c == '"') |
| 5476 | { |
| 5477 | SKIP_WHITESPACE (); |
| 5478 | switch (*input_line_pointer) |
| 5479 | { |
| 5480 | case '\"': |
| 5481 | ++input_line_pointer; /*->1st char of string. */ |
| 5482 | #if !defined(NO_LISTING) && defined (OBJ_ELF) |
| 5483 | start = input_line_pointer; |
| 5484 | #endif |
| 5485 | |
| 5486 | while (is_a_char (c = next_char_of_string ())) |
| 5487 | stringer_append_char (c, bitsize); |
| 5488 | |
| 5489 | /* Treat "a" "b" as "ab". Even if we are appending zeros. */ |
| 5490 | SKIP_ALL_WHITESPACE (); |
| 5491 | if (*input_line_pointer == '"') |
| 5492 | break; |
| 5493 | |
| 5494 | if (append_zero) |
| 5495 | stringer_append_char (0, bitsize); |
| 5496 | |
| 5497 | #if !defined(NO_LISTING) && defined (OBJ_ELF) |
| 5498 | /* In ELF, when gcc is emitting DWARF 1 debugging output, it |
| 5499 | will emit .string with a filename in the .debug section |
| 5500 | after a sequence of constants. See the comment in |
| 5501 | emit_expr for the sequence. emit_expr will set |
| 5502 | dwarf_file_string to non-zero if this string might be a |
| 5503 | source file name. */ |
| 5504 | if (strcmp (segment_name (now_seg), ".debug") != 0) |
| 5505 | dwarf_file_string = 0; |
| 5506 | else if (dwarf_file_string) |
| 5507 | { |
| 5508 | c = input_line_pointer[-1]; |
| 5509 | input_line_pointer[-1] = '\0'; |
| 5510 | listing_source_file (start); |
| 5511 | input_line_pointer[-1] = c; |
| 5512 | } |
| 5513 | #endif |
| 5514 | |
| 5515 | break; |
| 5516 | case '<': |
| 5517 | input_line_pointer++; |
| 5518 | c = get_single_number (); |
| 5519 | stringer_append_char (c, bitsize); |
| 5520 | if (*input_line_pointer != '>') |
| 5521 | { |
| 5522 | as_bad (_("expected <nn>")); |
| 5523 | ignore_rest_of_line (); |
| 5524 | return; |
| 5525 | } |
| 5526 | input_line_pointer++; |
| 5527 | break; |
| 5528 | case ',': |
| 5529 | input_line_pointer++; |
| 5530 | break; |
| 5531 | } |
| 5532 | SKIP_WHITESPACE (); |
| 5533 | c = *input_line_pointer; |
| 5534 | } |
| 5535 | |
| 5536 | demand_empty_rest_of_line (); |
| 5537 | } |
| 5538 | \f |
| 5539 | /* FIXME-SOMEDAY: I had trouble here on characters with the |
| 5540 | high bits set. We'll probably also have trouble with |
| 5541 | multibyte chars, wide chars, etc. Also be careful about |
| 5542 | returning values bigger than 1 byte. xoxorich. */ |
| 5543 | |
| 5544 | unsigned int |
| 5545 | next_char_of_string (void) |
| 5546 | { |
| 5547 | unsigned int c; |
| 5548 | |
| 5549 | c = *input_line_pointer++ & CHAR_MASK; |
| 5550 | switch (c) |
| 5551 | { |
| 5552 | case 0: |
| 5553 | /* PR 20902: Do not advance past the end of the buffer. */ |
| 5554 | -- input_line_pointer; |
| 5555 | c = NOT_A_CHAR; |
| 5556 | break; |
| 5557 | |
| 5558 | case '\"': |
| 5559 | c = NOT_A_CHAR; |
| 5560 | break; |
| 5561 | |
| 5562 | case '\n': |
| 5563 | as_warn (_("unterminated string; newline inserted")); |
| 5564 | bump_line_counters (); |
| 5565 | break; |
| 5566 | |
| 5567 | case '\\': |
| 5568 | if (!TC_STRING_ESCAPES) |
| 5569 | break; |
| 5570 | switch (c = *input_line_pointer++ & CHAR_MASK) |
| 5571 | { |
| 5572 | case 'b': |
| 5573 | c = '\b'; |
| 5574 | break; |
| 5575 | |
| 5576 | case 'f': |
| 5577 | c = '\f'; |
| 5578 | break; |
| 5579 | |
| 5580 | case 'n': |
| 5581 | c = '\n'; |
| 5582 | break; |
| 5583 | |
| 5584 | case 'r': |
| 5585 | c = '\r'; |
| 5586 | break; |
| 5587 | |
| 5588 | case 't': |
| 5589 | c = '\t'; |
| 5590 | break; |
| 5591 | |
| 5592 | case 'v': |
| 5593 | c = '\013'; |
| 5594 | break; |
| 5595 | |
| 5596 | case '\\': |
| 5597 | case '"': |
| 5598 | break; /* As itself. */ |
| 5599 | |
| 5600 | case '0': |
| 5601 | case '1': |
| 5602 | case '2': |
| 5603 | case '3': |
| 5604 | case '4': |
| 5605 | case '5': |
| 5606 | case '6': |
| 5607 | case '7': |
| 5608 | case '8': |
| 5609 | case '9': |
| 5610 | { |
| 5611 | long number; |
| 5612 | int i; |
| 5613 | |
| 5614 | for (i = 0, number = 0; |
| 5615 | ISDIGIT (c) && i < 3; |
| 5616 | c = *input_line_pointer++, i++) |
| 5617 | { |
| 5618 | number = number * 8 + c - '0'; |
| 5619 | } |
| 5620 | |
| 5621 | c = number & CHAR_MASK; |
| 5622 | } |
| 5623 | --input_line_pointer; |
| 5624 | break; |
| 5625 | |
| 5626 | case 'x': |
| 5627 | case 'X': |
| 5628 | { |
| 5629 | long number; |
| 5630 | |
| 5631 | number = 0; |
| 5632 | c = *input_line_pointer++; |
| 5633 | while (ISXDIGIT (c)) |
| 5634 | { |
| 5635 | if (ISDIGIT (c)) |
| 5636 | number = number * 16 + c - '0'; |
| 5637 | else if (ISUPPER (c)) |
| 5638 | number = number * 16 + c - 'A' + 10; |
| 5639 | else |
| 5640 | number = number * 16 + c - 'a' + 10; |
| 5641 | c = *input_line_pointer++; |
| 5642 | } |
| 5643 | c = number & CHAR_MASK; |
| 5644 | --input_line_pointer; |
| 5645 | } |
| 5646 | break; |
| 5647 | |
| 5648 | case '\n': |
| 5649 | /* To be compatible with BSD 4.2 as: give the luser a linefeed!! */ |
| 5650 | as_warn (_("unterminated string; newline inserted")); |
| 5651 | c = '\n'; |
| 5652 | bump_line_counters (); |
| 5653 | break; |
| 5654 | |
| 5655 | case 0: |
| 5656 | /* Do not advance past the end of the buffer. */ |
| 5657 | -- input_line_pointer; |
| 5658 | c = NOT_A_CHAR; |
| 5659 | break; |
| 5660 | |
| 5661 | default: |
| 5662 | |
| 5663 | #ifdef ONLY_STANDARD_ESCAPES |
| 5664 | as_bad (_("bad escaped character in string")); |
| 5665 | c = '?'; |
| 5666 | #endif /* ONLY_STANDARD_ESCAPES */ |
| 5667 | |
| 5668 | break; |
| 5669 | } |
| 5670 | break; |
| 5671 | |
| 5672 | default: |
| 5673 | break; |
| 5674 | } |
| 5675 | return (c); |
| 5676 | } |
| 5677 | \f |
| 5678 | static segT |
| 5679 | get_segmented_expression (expressionS *expP) |
| 5680 | { |
| 5681 | segT retval; |
| 5682 | |
| 5683 | retval = expression (expP); |
| 5684 | if (expP->X_op == O_illegal |
| 5685 | || expP->X_op == O_absent |
| 5686 | || expP->X_op == O_big) |
| 5687 | { |
| 5688 | as_bad (_("expected address expression")); |
| 5689 | expP->X_op = O_constant; |
| 5690 | expP->X_add_number = 0; |
| 5691 | retval = absolute_section; |
| 5692 | } |
| 5693 | return retval; |
| 5694 | } |
| 5695 | |
| 5696 | static segT |
| 5697 | get_known_segmented_expression (expressionS *expP) |
| 5698 | { |
| 5699 | segT retval = get_segmented_expression (expP); |
| 5700 | |
| 5701 | if (retval == undefined_section) |
| 5702 | { |
| 5703 | /* There is no easy way to extract the undefined symbol from the |
| 5704 | expression. */ |
| 5705 | if (expP->X_add_symbol != NULL |
| 5706 | && S_GET_SEGMENT (expP->X_add_symbol) != expr_section) |
| 5707 | as_warn (_("symbol \"%s\" undefined; zero assumed"), |
| 5708 | S_GET_NAME (expP->X_add_symbol)); |
| 5709 | else |
| 5710 | as_warn (_("some symbol undefined; zero assumed")); |
| 5711 | retval = absolute_section; |
| 5712 | expP->X_op = O_constant; |
| 5713 | expP->X_add_number = 0; |
| 5714 | } |
| 5715 | return retval; |
| 5716 | } |
| 5717 | |
| 5718 | char /* Return terminator. */ |
| 5719 | get_absolute_expression_and_terminator (long *val_pointer /* Return value of expression. */) |
| 5720 | { |
| 5721 | /* FIXME: val_pointer should probably be offsetT *. */ |
| 5722 | *val_pointer = (long) get_absolute_expression (); |
| 5723 | return (*input_line_pointer++); |
| 5724 | } |
| 5725 | \f |
| 5726 | /* Like demand_copy_string, but return NULL if the string contains any '\0's. |
| 5727 | Give a warning if that happens. */ |
| 5728 | |
| 5729 | char * |
| 5730 | demand_copy_C_string (int *len_pointer) |
| 5731 | { |
| 5732 | char *s; |
| 5733 | |
| 5734 | if ((s = demand_copy_string (len_pointer)) != 0) |
| 5735 | { |
| 5736 | int len; |
| 5737 | |
| 5738 | for (len = *len_pointer; len > 0; len--) |
| 5739 | { |
| 5740 | if (*s == 0) |
| 5741 | { |
| 5742 | s = 0; |
| 5743 | len = 1; |
| 5744 | *len_pointer = 0; |
| 5745 | as_bad (_("this string may not contain \'\\0\'")); |
| 5746 | } |
| 5747 | } |
| 5748 | } |
| 5749 | |
| 5750 | return s; |
| 5751 | } |
| 5752 | \f |
| 5753 | /* Demand string, but return a safe (=private) copy of the string. |
| 5754 | Return NULL if we can't read a string here. */ |
| 5755 | |
| 5756 | char * |
| 5757 | demand_copy_string (int *lenP) |
| 5758 | { |
| 5759 | unsigned int c; |
| 5760 | int len; |
| 5761 | char *retval; |
| 5762 | |
| 5763 | len = 0; |
| 5764 | SKIP_WHITESPACE (); |
| 5765 | if (*input_line_pointer == '\"') |
| 5766 | { |
| 5767 | input_line_pointer++; /* Skip opening quote. */ |
| 5768 | |
| 5769 | while (is_a_char (c = next_char_of_string ())) |
| 5770 | { |
| 5771 | obstack_1grow (¬es, c); |
| 5772 | len++; |
| 5773 | } |
| 5774 | /* JF this next line is so demand_copy_C_string will return a |
| 5775 | null terminated string. */ |
| 5776 | obstack_1grow (¬es, '\0'); |
| 5777 | retval = (char *) obstack_finish (¬es); |
| 5778 | } |
| 5779 | else |
| 5780 | { |
| 5781 | as_bad (_("missing string")); |
| 5782 | retval = NULL; |
| 5783 | ignore_rest_of_line (); |
| 5784 | } |
| 5785 | *lenP = len; |
| 5786 | return (retval); |
| 5787 | } |
| 5788 | \f |
| 5789 | /* In: Input_line_pointer->next character. |
| 5790 | |
| 5791 | Do: Skip input_line_pointer over all whitespace. |
| 5792 | |
| 5793 | Out: 1 if input_line_pointer->end-of-line. */ |
| 5794 | |
| 5795 | int |
| 5796 | is_it_end_of_statement (void) |
| 5797 | { |
| 5798 | SKIP_WHITESPACE (); |
| 5799 | return (is_end_of_line[(unsigned char) *input_line_pointer]); |
| 5800 | } |
| 5801 | |
| 5802 | void |
| 5803 | equals (char *sym_name, int reassign) |
| 5804 | { |
| 5805 | char *stop = NULL; |
| 5806 | char stopc = 0; |
| 5807 | |
| 5808 | input_line_pointer++; |
| 5809 | if (*input_line_pointer == '=') |
| 5810 | input_line_pointer++; |
| 5811 | if (reassign < 0 && *input_line_pointer == '=') |
| 5812 | input_line_pointer++; |
| 5813 | |
| 5814 | while (*input_line_pointer == ' ' || *input_line_pointer == '\t') |
| 5815 | input_line_pointer++; |
| 5816 | |
| 5817 | if (flag_mri) |
| 5818 | stop = mri_comment_field (&stopc); |
| 5819 | |
| 5820 | assign_symbol (sym_name, reassign >= 0 ? !reassign : reassign); |
| 5821 | |
| 5822 | if (flag_mri) |
| 5823 | { |
| 5824 | demand_empty_rest_of_line (); |
| 5825 | mri_comment_end (stop, stopc); |
| 5826 | } |
| 5827 | } |
| 5828 | |
| 5829 | /* .incbin -- include a file verbatim at the current location. */ |
| 5830 | |
| 5831 | void |
| 5832 | s_incbin (int x ATTRIBUTE_UNUSED) |
| 5833 | { |
| 5834 | FILE * binfile; |
| 5835 | char * path; |
| 5836 | char * filename; |
| 5837 | char * binfrag; |
| 5838 | long skip = 0; |
| 5839 | long count = 0; |
| 5840 | long bytes; |
| 5841 | int len; |
| 5842 | |
| 5843 | #ifdef md_flush_pending_output |
| 5844 | md_flush_pending_output (); |
| 5845 | #endif |
| 5846 | |
| 5847 | #ifdef md_cons_align |
| 5848 | md_cons_align (1); |
| 5849 | #endif |
| 5850 | |
| 5851 | SKIP_WHITESPACE (); |
| 5852 | filename = demand_copy_string (& len); |
| 5853 | if (filename == NULL) |
| 5854 | return; |
| 5855 | |
| 5856 | SKIP_WHITESPACE (); |
| 5857 | |
| 5858 | /* Look for optional skip and count. */ |
| 5859 | if (* input_line_pointer == ',') |
| 5860 | { |
| 5861 | ++ input_line_pointer; |
| 5862 | skip = get_absolute_expression (); |
| 5863 | |
| 5864 | SKIP_WHITESPACE (); |
| 5865 | |
| 5866 | if (* input_line_pointer == ',') |
| 5867 | { |
| 5868 | ++ input_line_pointer; |
| 5869 | |
| 5870 | count = get_absolute_expression (); |
| 5871 | if (count == 0) |
| 5872 | as_warn (_(".incbin count zero, ignoring `%s'"), filename); |
| 5873 | |
| 5874 | SKIP_WHITESPACE (); |
| 5875 | } |
| 5876 | } |
| 5877 | |
| 5878 | demand_empty_rest_of_line (); |
| 5879 | |
| 5880 | /* Try opening absolute path first, then try include dirs. */ |
| 5881 | binfile = fopen (filename, FOPEN_RB); |
| 5882 | if (binfile == NULL) |
| 5883 | { |
| 5884 | int i; |
| 5885 | |
| 5886 | path = XNEWVEC (char, (unsigned long) len + include_dir_maxlen + 5); |
| 5887 | |
| 5888 | for (i = 0; i < include_dir_count; i++) |
| 5889 | { |
| 5890 | sprintf (path, "%s/%s", include_dirs[i], filename); |
| 5891 | |
| 5892 | binfile = fopen (path, FOPEN_RB); |
| 5893 | if (binfile != NULL) |
| 5894 | break; |
| 5895 | } |
| 5896 | |
| 5897 | if (binfile == NULL) |
| 5898 | as_bad (_("file not found: %s"), filename); |
| 5899 | } |
| 5900 | else |
| 5901 | path = xstrdup (filename); |
| 5902 | |
| 5903 | if (binfile) |
| 5904 | { |
| 5905 | long file_len; |
| 5906 | |
| 5907 | register_dependency (path); |
| 5908 | |
| 5909 | /* Compute the length of the file. */ |
| 5910 | if (fseek (binfile, 0, SEEK_END) != 0) |
| 5911 | { |
| 5912 | as_bad (_("seek to end of .incbin file failed `%s'"), path); |
| 5913 | goto done; |
| 5914 | } |
| 5915 | file_len = ftell (binfile); |
| 5916 | |
| 5917 | /* If a count was not specified use the remainder of the file. */ |
| 5918 | if (count == 0) |
| 5919 | count = file_len - skip; |
| 5920 | |
| 5921 | if (skip < 0 || count < 0 || file_len < 0 || skip + count > file_len) |
| 5922 | { |
| 5923 | as_bad (_("skip (%ld) or count (%ld) invalid for file size (%ld)"), |
| 5924 | skip, count, file_len); |
| 5925 | goto done; |
| 5926 | } |
| 5927 | |
| 5928 | if (fseek (binfile, skip, SEEK_SET) != 0) |
| 5929 | { |
| 5930 | as_bad (_("could not skip to %ld in file `%s'"), skip, path); |
| 5931 | goto done; |
| 5932 | } |
| 5933 | |
| 5934 | /* Allocate frag space and store file contents in it. */ |
| 5935 | binfrag = frag_more (count); |
| 5936 | |
| 5937 | bytes = fread (binfrag, 1, count, binfile); |
| 5938 | if (bytes < count) |
| 5939 | as_warn (_("truncated file `%s', %ld of %ld bytes read"), |
| 5940 | path, bytes, count); |
| 5941 | } |
| 5942 | done: |
| 5943 | if (binfile != NULL) |
| 5944 | fclose (binfile); |
| 5945 | free (path); |
| 5946 | } |
| 5947 | |
| 5948 | /* .include -- include a file at this point. */ |
| 5949 | |
| 5950 | void |
| 5951 | s_include (int arg ATTRIBUTE_UNUSED) |
| 5952 | { |
| 5953 | char *filename; |
| 5954 | int i; |
| 5955 | FILE *try_file; |
| 5956 | char *path; |
| 5957 | |
| 5958 | if (!flag_m68k_mri) |
| 5959 | { |
| 5960 | filename = demand_copy_string (&i); |
| 5961 | if (filename == NULL) |
| 5962 | { |
| 5963 | /* demand_copy_string has already printed an error and |
| 5964 | called ignore_rest_of_line. */ |
| 5965 | return; |
| 5966 | } |
| 5967 | } |
| 5968 | else |
| 5969 | { |
| 5970 | SKIP_WHITESPACE (); |
| 5971 | i = 0; |
| 5972 | while (!is_end_of_line[(unsigned char) *input_line_pointer] |
| 5973 | && *input_line_pointer != ' ' |
| 5974 | && *input_line_pointer != '\t') |
| 5975 | { |
| 5976 | obstack_1grow (¬es, *input_line_pointer); |
| 5977 | ++input_line_pointer; |
| 5978 | ++i; |
| 5979 | } |
| 5980 | |
| 5981 | obstack_1grow (¬es, '\0'); |
| 5982 | filename = (char *) obstack_finish (¬es); |
| 5983 | while (!is_end_of_line[(unsigned char) *input_line_pointer]) |
| 5984 | ++input_line_pointer; |
| 5985 | } |
| 5986 | |
| 5987 | demand_empty_rest_of_line (); |
| 5988 | path = XNEWVEC (char, (unsigned long) i |
| 5989 | + include_dir_maxlen + 5 /* slop */ ); |
| 5990 | |
| 5991 | for (i = 0; i < include_dir_count; i++) |
| 5992 | { |
| 5993 | strcpy (path, include_dirs[i]); |
| 5994 | strcat (path, "/"); |
| 5995 | strcat (path, filename); |
| 5996 | if (0 != (try_file = fopen (path, FOPEN_RT))) |
| 5997 | { |
| 5998 | fclose (try_file); |
| 5999 | goto gotit; |
| 6000 | } |
| 6001 | } |
| 6002 | |
| 6003 | free (path); |
| 6004 | path = filename; |
| 6005 | gotit: |
| 6006 | /* malloc Storage leak when file is found on path. FIXME-SOMEDAY. */ |
| 6007 | register_dependency (path); |
| 6008 | input_scrub_insert_file (path); |
| 6009 | } |
| 6010 | |
| 6011 | void |
| 6012 | add_include_dir (char *path) |
| 6013 | { |
| 6014 | int i; |
| 6015 | |
| 6016 | if (include_dir_count == 0) |
| 6017 | { |
| 6018 | include_dirs = XNEWVEC (const char *, 2); |
| 6019 | include_dirs[0] = "."; /* Current dir. */ |
| 6020 | include_dir_count = 2; |
| 6021 | } |
| 6022 | else |
| 6023 | { |
| 6024 | include_dir_count++; |
| 6025 | include_dirs = XRESIZEVEC (const char *, include_dirs, |
| 6026 | include_dir_count); |
| 6027 | } |
| 6028 | |
| 6029 | include_dirs[include_dir_count - 1] = path; /* New one. */ |
| 6030 | |
| 6031 | i = strlen (path); |
| 6032 | if (i > include_dir_maxlen) |
| 6033 | include_dir_maxlen = i; |
| 6034 | } |
| 6035 | \f |
| 6036 | /* Output debugging information to denote the source file. */ |
| 6037 | |
| 6038 | static void |
| 6039 | generate_file_debug (void) |
| 6040 | { |
| 6041 | if (debug_type == DEBUG_STABS) |
| 6042 | stabs_generate_asm_file (); |
| 6043 | } |
| 6044 | |
| 6045 | /* Output line number debugging information for the current source line. */ |
| 6046 | |
| 6047 | void |
| 6048 | generate_lineno_debug (void) |
| 6049 | { |
| 6050 | switch (debug_type) |
| 6051 | { |
| 6052 | case DEBUG_UNSPECIFIED: |
| 6053 | case DEBUG_NONE: |
| 6054 | case DEBUG_DWARF: |
| 6055 | break; |
| 6056 | case DEBUG_STABS: |
| 6057 | stabs_generate_asm_lineno (); |
| 6058 | break; |
| 6059 | case DEBUG_ECOFF: |
| 6060 | ecoff_generate_asm_lineno (); |
| 6061 | break; |
| 6062 | case DEBUG_DWARF2: |
| 6063 | /* ??? We could here indicate to dwarf2dbg.c that something |
| 6064 | has changed. However, since there is additional backend |
| 6065 | support that is required (calling dwarf2_emit_insn), we |
| 6066 | let dwarf2dbg.c call as_where on its own. */ |
| 6067 | break; |
| 6068 | } |
| 6069 | } |
| 6070 | |
| 6071 | /* Output debugging information to mark a function entry point or end point. |
| 6072 | END_P is zero for .func, and non-zero for .endfunc. */ |
| 6073 | |
| 6074 | void |
| 6075 | s_func (int end_p) |
| 6076 | { |
| 6077 | do_s_func (end_p, NULL); |
| 6078 | } |
| 6079 | |
| 6080 | /* Subroutine of s_func so targets can choose a different default prefix. |
| 6081 | If DEFAULT_PREFIX is NULL, use the target's "leading char". */ |
| 6082 | |
| 6083 | static void |
| 6084 | do_s_func (int end_p, const char *default_prefix) |
| 6085 | { |
| 6086 | /* Record the current function so that we can issue an error message for |
| 6087 | misplaced .func,.endfunc, and also so that .endfunc needs no |
| 6088 | arguments. */ |
| 6089 | static char *current_name; |
| 6090 | static char *current_label; |
| 6091 | |
| 6092 | if (end_p) |
| 6093 | { |
| 6094 | if (current_name == NULL) |
| 6095 | { |
| 6096 | as_bad (_("missing .func")); |
| 6097 | ignore_rest_of_line (); |
| 6098 | return; |
| 6099 | } |
| 6100 | |
| 6101 | if (debug_type == DEBUG_STABS) |
| 6102 | stabs_generate_asm_endfunc (current_name, current_label); |
| 6103 | |
| 6104 | current_name = current_label = NULL; |
| 6105 | } |
| 6106 | else /* ! end_p */ |
| 6107 | { |
| 6108 | char *name, *label; |
| 6109 | char delim1, delim2; |
| 6110 | |
| 6111 | if (current_name != NULL) |
| 6112 | { |
| 6113 | as_bad (_(".endfunc missing for previous .func")); |
| 6114 | ignore_rest_of_line (); |
| 6115 | return; |
| 6116 | } |
| 6117 | |
| 6118 | delim1 = get_symbol_name (& name); |
| 6119 | name = xstrdup (name); |
| 6120 | *input_line_pointer = delim1; |
| 6121 | SKIP_WHITESPACE_AFTER_NAME (); |
| 6122 | if (*input_line_pointer != ',') |
| 6123 | { |
| 6124 | if (default_prefix) |
| 6125 | { |
| 6126 | if (asprintf (&label, "%s%s", default_prefix, name) == -1) |
| 6127 | as_fatal ("%s", xstrerror (errno)); |
| 6128 | } |
| 6129 | else |
| 6130 | { |
| 6131 | char leading_char = bfd_get_symbol_leading_char (stdoutput); |
| 6132 | /* Missing entry point, use function's name with the leading |
| 6133 | char prepended. */ |
| 6134 | if (leading_char) |
| 6135 | { |
| 6136 | if (asprintf (&label, "%c%s", leading_char, name) == -1) |
| 6137 | as_fatal ("%s", xstrerror (errno)); |
| 6138 | } |
| 6139 | else |
| 6140 | label = name; |
| 6141 | } |
| 6142 | } |
| 6143 | else |
| 6144 | { |
| 6145 | ++input_line_pointer; |
| 6146 | SKIP_WHITESPACE (); |
| 6147 | delim2 = get_symbol_name (& label); |
| 6148 | label = xstrdup (label); |
| 6149 | restore_line_pointer (delim2); |
| 6150 | } |
| 6151 | |
| 6152 | if (debug_type == DEBUG_STABS) |
| 6153 | stabs_generate_asm_func (name, label); |
| 6154 | |
| 6155 | current_name = name; |
| 6156 | current_label = label; |
| 6157 | } |
| 6158 | |
| 6159 | demand_empty_rest_of_line (); |
| 6160 | } |
| 6161 | \f |
| 6162 | #ifdef HANDLE_BUNDLE |
| 6163 | |
| 6164 | void |
| 6165 | s_bundle_align_mode (int arg ATTRIBUTE_UNUSED) |
| 6166 | { |
| 6167 | unsigned int align = get_absolute_expression (); |
| 6168 | SKIP_WHITESPACE (); |
| 6169 | demand_empty_rest_of_line (); |
| 6170 | |
| 6171 | if (align > (unsigned int) TC_ALIGN_LIMIT) |
| 6172 | as_fatal (_(".bundle_align_mode alignment too large (maximum %u)"), |
| 6173 | (unsigned int) TC_ALIGN_LIMIT); |
| 6174 | |
| 6175 | if (bundle_lock_frag != NULL) |
| 6176 | { |
| 6177 | as_bad (_("cannot change .bundle_align_mode inside .bundle_lock")); |
| 6178 | return; |
| 6179 | } |
| 6180 | |
| 6181 | bundle_align_p2 = align; |
| 6182 | } |
| 6183 | |
| 6184 | void |
| 6185 | s_bundle_lock (int arg ATTRIBUTE_UNUSED) |
| 6186 | { |
| 6187 | demand_empty_rest_of_line (); |
| 6188 | |
| 6189 | if (bundle_align_p2 == 0) |
| 6190 | { |
| 6191 | as_bad (_(".bundle_lock is meaningless without .bundle_align_mode")); |
| 6192 | return; |
| 6193 | } |
| 6194 | |
| 6195 | if (bundle_lock_depth == 0) |
| 6196 | { |
| 6197 | bundle_lock_frchain = frchain_now; |
| 6198 | bundle_lock_frag = start_bundle (); |
| 6199 | } |
| 6200 | ++bundle_lock_depth; |
| 6201 | } |
| 6202 | |
| 6203 | void |
| 6204 | s_bundle_unlock (int arg ATTRIBUTE_UNUSED) |
| 6205 | { |
| 6206 | unsigned int size; |
| 6207 | |
| 6208 | demand_empty_rest_of_line (); |
| 6209 | |
| 6210 | if (bundle_lock_frag == NULL) |
| 6211 | { |
| 6212 | as_bad (_(".bundle_unlock without preceding .bundle_lock")); |
| 6213 | return; |
| 6214 | } |
| 6215 | |
| 6216 | gas_assert (bundle_align_p2 > 0); |
| 6217 | |
| 6218 | gas_assert (bundle_lock_depth > 0); |
| 6219 | if (--bundle_lock_depth > 0) |
| 6220 | return; |
| 6221 | |
| 6222 | size = pending_bundle_size (bundle_lock_frag); |
| 6223 | |
| 6224 | if (size > 1U << bundle_align_p2) |
| 6225 | as_bad (_(".bundle_lock sequence is %u bytes, " |
| 6226 | "but bundle size is only %u bytes"), |
| 6227 | size, 1u << bundle_align_p2); |
| 6228 | else |
| 6229 | finish_bundle (bundle_lock_frag, size); |
| 6230 | |
| 6231 | bundle_lock_frag = NULL; |
| 6232 | bundle_lock_frchain = NULL; |
| 6233 | } |
| 6234 | |
| 6235 | #endif /* HANDLE_BUNDLE */ |
| 6236 | \f |
| 6237 | void |
| 6238 | s_ignore (int arg ATTRIBUTE_UNUSED) |
| 6239 | { |
| 6240 | ignore_rest_of_line (); |
| 6241 | } |
| 6242 | |
| 6243 | void |
| 6244 | read_print_statistics (FILE *file) |
| 6245 | { |
| 6246 | htab_print_statistics (file, "pseudo-op table", po_hash); |
| 6247 | } |
| 6248 | |
| 6249 | /* Inserts the given line into the input stream. |
| 6250 | |
| 6251 | This call avoids macro/conditionals nesting checking, since the contents of |
| 6252 | the line are assumed to replace the contents of a line already scanned. |
| 6253 | |
| 6254 | An appropriate use of this function would be substitution of input lines when |
| 6255 | called by md_start_line_hook(). The given line is assumed to already be |
| 6256 | properly scrubbed. */ |
| 6257 | |
| 6258 | void |
| 6259 | input_scrub_insert_line (const char *line) |
| 6260 | { |
| 6261 | sb newline; |
| 6262 | size_t len = strlen (line); |
| 6263 | sb_build (&newline, len); |
| 6264 | sb_add_buffer (&newline, line, len); |
| 6265 | input_scrub_include_sb (&newline, input_line_pointer, 0); |
| 6266 | sb_kill (&newline); |
| 6267 | buffer_limit = input_scrub_next_buffer (&input_line_pointer); |
| 6268 | } |
| 6269 | |
| 6270 | /* Insert a file into the input stream; the path must resolve to an actual |
| 6271 | file; no include path searching or dependency registering is performed. */ |
| 6272 | |
| 6273 | void |
| 6274 | input_scrub_insert_file (char *path) |
| 6275 | { |
| 6276 | input_scrub_include_file (path, input_line_pointer); |
| 6277 | buffer_limit = input_scrub_next_buffer (&input_line_pointer); |
| 6278 | } |
| 6279 | |
| 6280 | /* Find the end of a line, considering quotation and escaping of quotes. */ |
| 6281 | |
| 6282 | #if !defined(TC_SINGLE_QUOTE_STRINGS) && defined(SINGLE_QUOTE_STRINGS) |
| 6283 | # define TC_SINGLE_QUOTE_STRINGS 1 |
| 6284 | #endif |
| 6285 | |
| 6286 | static char * |
| 6287 | _find_end_of_line (char *s, int mri_string, int insn ATTRIBUTE_UNUSED, |
| 6288 | int in_macro) |
| 6289 | { |
| 6290 | char inquote = '\0'; |
| 6291 | int inescape = 0; |
| 6292 | |
| 6293 | while (!is_end_of_line[(unsigned char) *s] |
| 6294 | || (inquote && !ISCNTRL (*s)) |
| 6295 | || (inquote == '\'' && flag_mri) |
| 6296 | #ifdef TC_EOL_IN_INSN |
| 6297 | || (insn && TC_EOL_IN_INSN (s)) |
| 6298 | #endif |
| 6299 | /* PR 6926: When we are parsing the body of a macro the sequence |
| 6300 | \@ is special - it refers to the invocation count. If the @ |
| 6301 | character happens to be registered as a line-separator character |
| 6302 | by the target, then the is_end_of_line[] test above will have |
| 6303 | returned true, but we need to ignore the line separating |
| 6304 | semantics in this particular case. */ |
| 6305 | || (in_macro && inescape && *s == '@') |
| 6306 | ) |
| 6307 | { |
| 6308 | if (mri_string && *s == '\'') |
| 6309 | inquote ^= *s; |
| 6310 | else if (inescape) |
| 6311 | inescape = 0; |
| 6312 | else if (*s == '\\') |
| 6313 | inescape = 1; |
| 6314 | else if (!inquote |
| 6315 | ? *s == '"' |
| 6316 | #ifdef TC_SINGLE_QUOTE_STRINGS |
| 6317 | || (TC_SINGLE_QUOTE_STRINGS && *s == '\'') |
| 6318 | #endif |
| 6319 | : *s == inquote) |
| 6320 | inquote ^= *s; |
| 6321 | ++s; |
| 6322 | } |
| 6323 | if (inquote) |
| 6324 | as_warn (_("missing closing `%c'"), inquote); |
| 6325 | if (inescape && !ignore_input ()) |
| 6326 | as_warn (_("stray `\\'")); |
| 6327 | return s; |
| 6328 | } |
| 6329 | |
| 6330 | char * |
| 6331 | find_end_of_line (char *s, int mri_string) |
| 6332 | { |
| 6333 | return _find_end_of_line (s, mri_string, 0, 0); |
| 6334 | } |
| 6335 | |
| 6336 | static char *saved_ilp = NULL; |
| 6337 | static char *saved_limit; |
| 6338 | |
| 6339 | /* Use BUF as a temporary input pointer for calling other functions in this |
| 6340 | file. BUF must be a C string, so that its end can be found by strlen. |
| 6341 | Also sets the buffer_limit variable (local to this file) so that buffer |
| 6342 | overruns should not occur. Saves the current input line pointer so that |
| 6343 | it can be restored by calling restore_ilp(). |
| 6344 | |
| 6345 | Does not support recursion. */ |
| 6346 | |
| 6347 | void |
| 6348 | temp_ilp (char *buf) |
| 6349 | { |
| 6350 | gas_assert (saved_ilp == NULL); |
| 6351 | gas_assert (buf != NULL); |
| 6352 | |
| 6353 | saved_ilp = input_line_pointer; |
| 6354 | saved_limit = buffer_limit; |
| 6355 | /* Prevent the assert in restore_ilp from triggering if |
| 6356 | the input_line_pointer has not yet been initialised. */ |
| 6357 | if (saved_ilp == NULL) |
| 6358 | saved_limit = saved_ilp = (char *) ""; |
| 6359 | |
| 6360 | input_line_pointer = buf; |
| 6361 | buffer_limit = buf + strlen (buf); |
| 6362 | input_from_string = TRUE; |
| 6363 | } |
| 6364 | |
| 6365 | /* Restore a saved input line pointer. */ |
| 6366 | |
| 6367 | void |
| 6368 | restore_ilp (void) |
| 6369 | { |
| 6370 | gas_assert (saved_ilp != NULL); |
| 6371 | |
| 6372 | input_line_pointer = saved_ilp; |
| 6373 | buffer_limit = saved_limit; |
| 6374 | input_from_string = FALSE; |
| 6375 | |
| 6376 | saved_ilp = NULL; |
| 6377 | } |