| 1 | /* dwarf2dbg.c - DWARF2 debug support |
| 2 | Copyright (C) 1999-2020 Free Software Foundation, Inc. |
| 3 | Contributed by David Mosberger-Tang <davidm@hpl.hp.com> |
| 4 | |
| 5 | This file is part of GAS, the GNU Assembler. |
| 6 | |
| 7 | GAS is free software; you can redistribute it and/or modify |
| 8 | it under the terms of the GNU General Public License as published by |
| 9 | the Free Software Foundation; either version 3, or (at your option) |
| 10 | any later version. |
| 11 | |
| 12 | GAS is distributed in the hope that it will be useful, |
| 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 | GNU General Public License for more details. |
| 16 | |
| 17 | You should have received a copy of the GNU General Public License |
| 18 | along with GAS; see the file COPYING. If not, write to the Free |
| 19 | Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA |
| 20 | 02110-1301, USA. */ |
| 21 | |
| 22 | /* Logical line numbers can be controlled by the compiler via the |
| 23 | following directives: |
| 24 | |
| 25 | .file FILENO "file.c" |
| 26 | .loc FILENO LINENO [COLUMN] [basic_block] [prologue_end] \ |
| 27 | [epilogue_begin] [is_stmt VALUE] [isa VALUE] \ |
| 28 | [discriminator VALUE] |
| 29 | */ |
| 30 | |
| 31 | #include "as.h" |
| 32 | #include "safe-ctype.h" |
| 33 | |
| 34 | #ifdef HAVE_LIMITS_H |
| 35 | #include <limits.h> |
| 36 | #else |
| 37 | #ifdef HAVE_SYS_PARAM_H |
| 38 | #include <sys/param.h> |
| 39 | #endif |
| 40 | #ifndef INT_MAX |
| 41 | #define INT_MAX (int) (((unsigned) (-1)) >> 1) |
| 42 | #endif |
| 43 | #endif |
| 44 | |
| 45 | #include "dwarf2dbg.h" |
| 46 | #include <filenames.h> |
| 47 | |
| 48 | #ifdef HAVE_DOS_BASED_FILE_SYSTEM |
| 49 | /* We need to decide which character to use as a directory separator. |
| 50 | Just because HAVE_DOS_BASED_FILE_SYSTEM is defined, it does not |
| 51 | necessarily mean that the backslash character is the one to use. |
| 52 | Some environments, eg Cygwin, can support both naming conventions. |
| 53 | So we use the heuristic that we only need to use the backslash if |
| 54 | the path is an absolute path starting with a DOS style drive |
| 55 | selector. eg C: or D: */ |
| 56 | # define INSERT_DIR_SEPARATOR(string, offset) \ |
| 57 | do \ |
| 58 | { \ |
| 59 | if (offset > 1 \ |
| 60 | && string[0] != 0 \ |
| 61 | && string[1] == ':') \ |
| 62 | string [offset] = '\\'; \ |
| 63 | else \ |
| 64 | string [offset] = '/'; \ |
| 65 | } \ |
| 66 | while (0) |
| 67 | #else |
| 68 | # define INSERT_DIR_SEPARATOR(string, offset) string[offset] = '/' |
| 69 | #endif |
| 70 | |
| 71 | #ifndef DWARF2_FORMAT |
| 72 | # define DWARF2_FORMAT(SEC) dwarf2_format_32bit |
| 73 | #endif |
| 74 | |
| 75 | #ifndef DWARF2_ADDR_SIZE |
| 76 | # define DWARF2_ADDR_SIZE(bfd) (bfd_arch_bits_per_address (bfd) / 8) |
| 77 | #endif |
| 78 | |
| 79 | #ifndef DWARF2_FILE_NAME |
| 80 | #define DWARF2_FILE_NAME(FILENAME, DIRNAME) FILENAME |
| 81 | #endif |
| 82 | |
| 83 | #ifndef DWARF2_FILE_TIME_NAME |
| 84 | #define DWARF2_FILE_TIME_NAME(FILENAME,DIRNAME) -1 |
| 85 | #endif |
| 86 | |
| 87 | #ifndef DWARF2_FILE_SIZE_NAME |
| 88 | #define DWARF2_FILE_SIZE_NAME(FILENAME,DIRNAME) -1 |
| 89 | #endif |
| 90 | |
| 91 | #ifndef DWARF2_VERSION |
| 92 | #define DWARF2_VERSION dwarf_level |
| 93 | #endif |
| 94 | |
| 95 | /* The .debug_aranges version has been 2 in DWARF version 2, 3 and 4. */ |
| 96 | #ifndef DWARF2_ARANGES_VERSION |
| 97 | #define DWARF2_ARANGES_VERSION 2 |
| 98 | #endif |
| 99 | |
| 100 | /* This implementation outputs version 3 .debug_line information. */ |
| 101 | #ifndef DWARF2_LINE_VERSION |
| 102 | #define DWARF2_LINE_VERSION (dwarf_level > 3 ? dwarf_level : 3) |
| 103 | #endif |
| 104 | |
| 105 | #include "subsegs.h" |
| 106 | |
| 107 | #include "dwarf2.h" |
| 108 | |
| 109 | /* Since we can't generate the prolog until the body is complete, we |
| 110 | use three different subsegments for .debug_line: one holding the |
| 111 | prolog, one for the directory and filename info, and one for the |
| 112 | body ("statement program"). */ |
| 113 | #define DL_PROLOG 0 |
| 114 | #define DL_FILES 1 |
| 115 | #define DL_BODY 2 |
| 116 | |
| 117 | /* If linker relaxation might change offsets in the code, the DWARF special |
| 118 | opcodes and variable-length operands cannot be used. If this macro is |
| 119 | nonzero, use the DW_LNS_fixed_advance_pc opcode instead. */ |
| 120 | #ifndef DWARF2_USE_FIXED_ADVANCE_PC |
| 121 | # define DWARF2_USE_FIXED_ADVANCE_PC linkrelax |
| 122 | #endif |
| 123 | |
| 124 | /* First special line opcode - leave room for the standard opcodes. |
| 125 | Note: If you want to change this, you'll have to update the |
| 126 | "standard_opcode_lengths" table that is emitted below in |
| 127 | out_debug_line(). */ |
| 128 | #define DWARF2_LINE_OPCODE_BASE 13 |
| 129 | |
| 130 | #ifndef DWARF2_LINE_BASE |
| 131 | /* Minimum line offset in a special line info. opcode. This value |
| 132 | was chosen to give a reasonable range of values. */ |
| 133 | # define DWARF2_LINE_BASE -5 |
| 134 | #endif |
| 135 | |
| 136 | /* Range of line offsets in a special line info. opcode. */ |
| 137 | #ifndef DWARF2_LINE_RANGE |
| 138 | # define DWARF2_LINE_RANGE 14 |
| 139 | #endif |
| 140 | |
| 141 | #ifndef DWARF2_LINE_MIN_INSN_LENGTH |
| 142 | /* Define the architecture-dependent minimum instruction length (in |
| 143 | bytes). This value should be rather too small than too big. */ |
| 144 | # define DWARF2_LINE_MIN_INSN_LENGTH 1 |
| 145 | #endif |
| 146 | |
| 147 | /* Flag that indicates the initial value of the is_stmt_start flag. */ |
| 148 | #define DWARF2_LINE_DEFAULT_IS_STMT 1 |
| 149 | |
| 150 | #ifndef DWARF2_LINE_MAX_OPS_PER_INSN |
| 151 | #define DWARF2_LINE_MAX_OPS_PER_INSN 1 |
| 152 | #endif |
| 153 | |
| 154 | /* Given a special op, return the line skip amount. */ |
| 155 | #define SPECIAL_LINE(op) \ |
| 156 | (((op) - DWARF2_LINE_OPCODE_BASE)%DWARF2_LINE_RANGE + DWARF2_LINE_BASE) |
| 157 | |
| 158 | /* Given a special op, return the address skip amount (in units of |
| 159 | DWARF2_LINE_MIN_INSN_LENGTH. */ |
| 160 | #define SPECIAL_ADDR(op) (((op) - DWARF2_LINE_OPCODE_BASE)/DWARF2_LINE_RANGE) |
| 161 | |
| 162 | /* The maximum address skip amount that can be encoded with a special op. */ |
| 163 | #define MAX_SPECIAL_ADDR_DELTA SPECIAL_ADDR(255) |
| 164 | |
| 165 | #ifndef TC_PARSE_CONS_RETURN_NONE |
| 166 | #define TC_PARSE_CONS_RETURN_NONE BFD_RELOC_NONE |
| 167 | #endif |
| 168 | |
| 169 | struct line_entry |
| 170 | { |
| 171 | struct line_entry *next; |
| 172 | symbolS *label; |
| 173 | struct dwarf2_line_info loc; |
| 174 | }; |
| 175 | |
| 176 | /* Don't change the offset of next in line_entry. set_or_check_view |
| 177 | calls in dwarf2_gen_line_info_1 depend on it. */ |
| 178 | static char unused[offsetof(struct line_entry, next) ? -1 : 1] |
| 179 | ATTRIBUTE_UNUSED; |
| 180 | |
| 181 | struct line_subseg |
| 182 | { |
| 183 | struct line_subseg *next; |
| 184 | subsegT subseg; |
| 185 | struct line_entry *head; |
| 186 | struct line_entry **ptail; |
| 187 | struct line_entry **pmove_tail; |
| 188 | }; |
| 189 | |
| 190 | struct line_seg |
| 191 | { |
| 192 | struct line_seg *next; |
| 193 | segT seg; |
| 194 | struct line_subseg *head; |
| 195 | symbolS *text_start; |
| 196 | symbolS *text_end; |
| 197 | }; |
| 198 | |
| 199 | /* Collects data for all line table entries during assembly. */ |
| 200 | static struct line_seg *all_segs; |
| 201 | static struct line_seg **last_seg_ptr; |
| 202 | |
| 203 | #define NUM_MD5_BYTES 16 |
| 204 | |
| 205 | struct file_entry |
| 206 | { |
| 207 | const char * filename; |
| 208 | unsigned int dir; |
| 209 | bfd_boolean auto_assigned; |
| 210 | unsigned char md5[NUM_MD5_BYTES]; |
| 211 | }; |
| 212 | |
| 213 | /* Table of files used by .debug_line. */ |
| 214 | static struct file_entry *files; |
| 215 | static unsigned int files_in_use; |
| 216 | static unsigned int files_allocated; |
| 217 | |
| 218 | /* Table of directories used by .debug_line. */ |
| 219 | static char ** dirs = NULL; |
| 220 | static unsigned int dirs_in_use = 0; |
| 221 | static unsigned int dirs_allocated = 0; |
| 222 | |
| 223 | /* TRUE when we've seen a .loc directive recently. Used to avoid |
| 224 | doing work when there's nothing to do. */ |
| 225 | bfd_boolean dwarf2_loc_directive_seen; |
| 226 | |
| 227 | /* TRUE when we're supposed to set the basic block mark whenever a |
| 228 | label is seen. */ |
| 229 | bfd_boolean dwarf2_loc_mark_labels; |
| 230 | |
| 231 | /* Current location as indicated by the most recent .loc directive. */ |
| 232 | static struct dwarf2_line_info current = |
| 233 | { |
| 234 | 1, 1, 0, 0, |
| 235 | DWARF2_LINE_DEFAULT_IS_STMT ? DWARF2_FLAG_IS_STMT : 0, |
| 236 | 0, NULL |
| 237 | }; |
| 238 | |
| 239 | /* This symbol is used to recognize view number forced resets in loc |
| 240 | lists. */ |
| 241 | static symbolS *force_reset_view; |
| 242 | |
| 243 | /* This symbol evaluates to an expression that, if nonzero, indicates |
| 244 | some view assert check failed. */ |
| 245 | static symbolS *view_assert_failed; |
| 246 | |
| 247 | /* The size of an address on the target. */ |
| 248 | static unsigned int sizeof_address; |
| 249 | \f |
| 250 | #ifndef TC_DWARF2_EMIT_OFFSET |
| 251 | #define TC_DWARF2_EMIT_OFFSET generic_dwarf2_emit_offset |
| 252 | |
| 253 | /* Create an offset to .dwarf2_*. */ |
| 254 | |
| 255 | static void |
| 256 | generic_dwarf2_emit_offset (symbolS *symbol, unsigned int size) |
| 257 | { |
| 258 | expressionS exp; |
| 259 | |
| 260 | memset (&exp, 0, sizeof exp); |
| 261 | exp.X_op = O_symbol; |
| 262 | exp.X_add_symbol = symbol; |
| 263 | exp.X_add_number = 0; |
| 264 | emit_expr (&exp, size); |
| 265 | } |
| 266 | #endif |
| 267 | |
| 268 | /* Find or create (if CREATE_P) an entry for SEG+SUBSEG in ALL_SEGS. */ |
| 269 | |
| 270 | static struct line_subseg * |
| 271 | get_line_subseg (segT seg, subsegT subseg, bfd_boolean create_p) |
| 272 | { |
| 273 | struct line_seg *s = seg_info (seg)->dwarf2_line_seg; |
| 274 | struct line_subseg **pss, *lss; |
| 275 | |
| 276 | if (s == NULL) |
| 277 | { |
| 278 | if (!create_p) |
| 279 | return NULL; |
| 280 | |
| 281 | s = XNEW (struct line_seg); |
| 282 | s->next = NULL; |
| 283 | s->seg = seg; |
| 284 | s->head = NULL; |
| 285 | *last_seg_ptr = s; |
| 286 | last_seg_ptr = &s->next; |
| 287 | seg_info (seg)->dwarf2_line_seg = s; |
| 288 | } |
| 289 | |
| 290 | gas_assert (seg == s->seg); |
| 291 | |
| 292 | for (pss = &s->head; (lss = *pss) != NULL ; pss = &lss->next) |
| 293 | { |
| 294 | if (lss->subseg == subseg) |
| 295 | goto found_subseg; |
| 296 | if (lss->subseg > subseg) |
| 297 | break; |
| 298 | } |
| 299 | |
| 300 | lss = XNEW (struct line_subseg); |
| 301 | lss->next = *pss; |
| 302 | lss->subseg = subseg; |
| 303 | lss->head = NULL; |
| 304 | lss->ptail = &lss->head; |
| 305 | lss->pmove_tail = &lss->head; |
| 306 | *pss = lss; |
| 307 | |
| 308 | found_subseg: |
| 309 | return lss; |
| 310 | } |
| 311 | |
| 312 | /* (Un)reverse the line_entry list starting from H. */ |
| 313 | |
| 314 | static struct line_entry * |
| 315 | reverse_line_entry_list (struct line_entry *h) |
| 316 | { |
| 317 | struct line_entry *p = NULL, *e, *n; |
| 318 | |
| 319 | for (e = h; e; e = n) |
| 320 | { |
| 321 | n = e->next; |
| 322 | e->next = p; |
| 323 | p = e; |
| 324 | } |
| 325 | return p; |
| 326 | } |
| 327 | |
| 328 | /* Compute the view for E based on the previous entry P. If we |
| 329 | introduce an (undefined) view symbol for P, and H is given (P must |
| 330 | be the tail in this case), introduce view symbols for earlier list |
| 331 | entries as well, until one of them is constant. */ |
| 332 | |
| 333 | static void |
| 334 | set_or_check_view (struct line_entry *e, struct line_entry *p, |
| 335 | struct line_entry *h) |
| 336 | { |
| 337 | expressionS viewx; |
| 338 | |
| 339 | memset (&viewx, 0, sizeof (viewx)); |
| 340 | viewx.X_unsigned = 1; |
| 341 | |
| 342 | /* First, compute !(E->label > P->label), to tell whether or not |
| 343 | we're to reset the view number. If we can't resolve it to a |
| 344 | constant, keep it symbolic. */ |
| 345 | if (!p || (e->loc.view == force_reset_view && force_reset_view)) |
| 346 | { |
| 347 | viewx.X_op = O_constant; |
| 348 | viewx.X_add_number = 0; |
| 349 | viewx.X_add_symbol = NULL; |
| 350 | viewx.X_op_symbol = NULL; |
| 351 | } |
| 352 | else |
| 353 | { |
| 354 | viewx.X_op = O_gt; |
| 355 | viewx.X_add_number = 0; |
| 356 | viewx.X_add_symbol = e->label; |
| 357 | viewx.X_op_symbol = p->label; |
| 358 | resolve_expression (&viewx); |
| 359 | if (viewx.X_op == O_constant) |
| 360 | viewx.X_add_number = !viewx.X_add_number; |
| 361 | else |
| 362 | { |
| 363 | viewx.X_add_symbol = make_expr_symbol (&viewx); |
| 364 | viewx.X_add_number = 0; |
| 365 | viewx.X_op_symbol = NULL; |
| 366 | viewx.X_op = O_logical_not; |
| 367 | } |
| 368 | } |
| 369 | |
| 370 | if (S_IS_DEFINED (e->loc.view) && symbol_constant_p (e->loc.view)) |
| 371 | { |
| 372 | expressionS *value = symbol_get_value_expression (e->loc.view); |
| 373 | /* We can't compare the view numbers at this point, because in |
| 374 | VIEWX we've only determined whether we're to reset it so |
| 375 | far. */ |
| 376 | if (viewx.X_op == O_constant) |
| 377 | { |
| 378 | if (!value->X_add_number != !viewx.X_add_number) |
| 379 | as_bad (_("view number mismatch")); |
| 380 | } |
| 381 | /* Record the expression to check it later. It is the result of |
| 382 | a logical not, thus 0 or 1. We just add up all such deferred |
| 383 | expressions, and resolve it at the end. */ |
| 384 | else if (!value->X_add_number) |
| 385 | { |
| 386 | symbolS *deferred = make_expr_symbol (&viewx); |
| 387 | if (view_assert_failed) |
| 388 | { |
| 389 | expressionS chk; |
| 390 | |
| 391 | memset (&chk, 0, sizeof (chk)); |
| 392 | chk.X_unsigned = 1; |
| 393 | chk.X_op = O_add; |
| 394 | chk.X_add_number = 0; |
| 395 | chk.X_add_symbol = view_assert_failed; |
| 396 | chk.X_op_symbol = deferred; |
| 397 | deferred = make_expr_symbol (&chk); |
| 398 | } |
| 399 | view_assert_failed = deferred; |
| 400 | } |
| 401 | } |
| 402 | |
| 403 | if (viewx.X_op != O_constant || viewx.X_add_number) |
| 404 | { |
| 405 | expressionS incv; |
| 406 | |
| 407 | if (!p->loc.view) |
| 408 | { |
| 409 | p->loc.view = symbol_temp_make (); |
| 410 | gas_assert (!S_IS_DEFINED (p->loc.view)); |
| 411 | } |
| 412 | |
| 413 | memset (&incv, 0, sizeof (incv)); |
| 414 | incv.X_unsigned = 1; |
| 415 | incv.X_op = O_symbol; |
| 416 | incv.X_add_symbol = p->loc.view; |
| 417 | incv.X_add_number = 1; |
| 418 | |
| 419 | if (viewx.X_op == O_constant) |
| 420 | { |
| 421 | gas_assert (viewx.X_add_number == 1); |
| 422 | viewx = incv; |
| 423 | } |
| 424 | else |
| 425 | { |
| 426 | viewx.X_add_symbol = make_expr_symbol (&viewx); |
| 427 | viewx.X_add_number = 0; |
| 428 | viewx.X_op_symbol = make_expr_symbol (&incv); |
| 429 | viewx.X_op = O_multiply; |
| 430 | } |
| 431 | } |
| 432 | |
| 433 | if (!S_IS_DEFINED (e->loc.view)) |
| 434 | { |
| 435 | symbol_set_value_expression (e->loc.view, &viewx); |
| 436 | S_SET_SEGMENT (e->loc.view, expr_section); |
| 437 | symbol_set_frag (e->loc.view, &zero_address_frag); |
| 438 | } |
| 439 | |
| 440 | /* Define and attempt to simplify any earlier views needed to |
| 441 | compute E's. */ |
| 442 | if (h && p && p->loc.view && !S_IS_DEFINED (p->loc.view)) |
| 443 | { |
| 444 | struct line_entry *h2; |
| 445 | /* Reverse the list to avoid quadratic behavior going backwards |
| 446 | in a single-linked list. */ |
| 447 | struct line_entry *r = reverse_line_entry_list (h); |
| 448 | |
| 449 | gas_assert (r == p); |
| 450 | /* Set or check views until we find a defined or absent view. */ |
| 451 | do |
| 452 | { |
| 453 | /* Do not define the head of a (sub?)segment view while |
| 454 | handling others. It would be defined too early, without |
| 455 | regard to the last view of other subsegments. |
| 456 | set_or_check_view will be called for every head segment |
| 457 | that needs it. */ |
| 458 | if (r == h) |
| 459 | break; |
| 460 | set_or_check_view (r, r->next, NULL); |
| 461 | } |
| 462 | while (r->next && r->next->loc.view && !S_IS_DEFINED (r->next->loc.view) |
| 463 | && (r = r->next)); |
| 464 | |
| 465 | /* Unreverse the list, so that we can go forward again. */ |
| 466 | h2 = reverse_line_entry_list (p); |
| 467 | gas_assert (h2 == h); |
| 468 | |
| 469 | /* Starting from the last view we just defined, attempt to |
| 470 | simplify the view expressions, until we do so to P. */ |
| 471 | do |
| 472 | { |
| 473 | /* The head view of a subsegment may remain undefined while |
| 474 | handling other elements, before it is linked to the last |
| 475 | view of the previous subsegment. */ |
| 476 | if (r == h) |
| 477 | continue; |
| 478 | gas_assert (S_IS_DEFINED (r->loc.view)); |
| 479 | resolve_expression (symbol_get_value_expression (r->loc.view)); |
| 480 | } |
| 481 | while (r != p && (r = r->next)); |
| 482 | |
| 483 | /* Now that we've defined and computed all earlier views that might |
| 484 | be needed to compute E's, attempt to simplify it. */ |
| 485 | resolve_expression (symbol_get_value_expression (e->loc.view)); |
| 486 | } |
| 487 | } |
| 488 | |
| 489 | /* Record an entry for LOC occurring at LABEL. */ |
| 490 | |
| 491 | static void |
| 492 | dwarf2_gen_line_info_1 (symbolS *label, struct dwarf2_line_info *loc) |
| 493 | { |
| 494 | struct line_subseg *lss; |
| 495 | struct line_entry *e; |
| 496 | |
| 497 | e = XNEW (struct line_entry); |
| 498 | e->next = NULL; |
| 499 | e->label = label; |
| 500 | e->loc = *loc; |
| 501 | |
| 502 | lss = get_line_subseg (now_seg, now_subseg, TRUE); |
| 503 | |
| 504 | /* Subseg heads are chained to previous subsegs in |
| 505 | dwarf2_finish. */ |
| 506 | if (loc->view && lss->head) |
| 507 | set_or_check_view (e, |
| 508 | (struct line_entry *)lss->ptail, |
| 509 | lss->head); |
| 510 | |
| 511 | *lss->ptail = e; |
| 512 | lss->ptail = &e->next; |
| 513 | } |
| 514 | |
| 515 | /* Record an entry for LOC occurring at OFS within the current fragment. */ |
| 516 | |
| 517 | void |
| 518 | dwarf2_gen_line_info (addressT ofs, struct dwarf2_line_info *loc) |
| 519 | { |
| 520 | static unsigned int line = -1; |
| 521 | static unsigned int filenum = -1; |
| 522 | |
| 523 | symbolS *sym; |
| 524 | |
| 525 | /* Early out for as-yet incomplete location information. */ |
| 526 | if (loc->line == 0) |
| 527 | return; |
| 528 | if (loc->filenum == 0 && DWARF2_LINE_VERSION < 5) |
| 529 | return; |
| 530 | |
| 531 | /* Don't emit sequences of line symbols for the same line when the |
| 532 | symbols apply to assembler code. It is necessary to emit |
| 533 | duplicate line symbols when a compiler asks for them, because GDB |
| 534 | uses them to determine the end of the prologue. */ |
| 535 | if (debug_type == DEBUG_DWARF2 |
| 536 | && line == loc->line && filenum == loc->filenum) |
| 537 | return; |
| 538 | |
| 539 | line = loc->line; |
| 540 | filenum = loc->filenum; |
| 541 | |
| 542 | if (linkrelax) |
| 543 | { |
| 544 | char name[120]; |
| 545 | |
| 546 | /* Use a non-fake name for the line number location, |
| 547 | so that it can be referred to by relocations. */ |
| 548 | sprintf (name, ".Loc.%u.%u", line, filenum); |
| 549 | sym = symbol_new (name, now_seg, ofs, frag_now); |
| 550 | } |
| 551 | else |
| 552 | sym = symbol_temp_new (now_seg, ofs, frag_now); |
| 553 | dwarf2_gen_line_info_1 (sym, loc); |
| 554 | } |
| 555 | |
| 556 | static const char * |
| 557 | get_basename (const char * pathname) |
| 558 | { |
| 559 | const char * file; |
| 560 | |
| 561 | file = lbasename (pathname); |
| 562 | /* Don't make empty string from / or A: from A:/ . */ |
| 563 | #ifdef HAVE_DOS_BASED_FILE_SYSTEM |
| 564 | if (file <= pathname + 3) |
| 565 | file = pathname; |
| 566 | #else |
| 567 | if (file == pathname + 1) |
| 568 | file = pathname; |
| 569 | #endif |
| 570 | return file; |
| 571 | } |
| 572 | |
| 573 | static unsigned int |
| 574 | get_directory_table_entry (const char * dirname, |
| 575 | size_t dirlen, |
| 576 | bfd_boolean can_use_zero) |
| 577 | { |
| 578 | unsigned int d; |
| 579 | |
| 580 | if (dirlen == 0) |
| 581 | return 0; |
| 582 | |
| 583 | #ifndef DWARF2_DIR_SHOULD_END_WITH_SEPARATOR |
| 584 | if (IS_DIR_SEPARATOR (dirname[dirlen - 1])) |
| 585 | { |
| 586 | -- dirlen; |
| 587 | if (dirlen == 0) |
| 588 | return 0; |
| 589 | } |
| 590 | #endif |
| 591 | |
| 592 | for (d = 0; d < dirs_in_use; ++d) |
| 593 | { |
| 594 | if (dirs[d] != NULL |
| 595 | && filename_ncmp (dirname, dirs[d], dirlen) == 0 |
| 596 | && dirs[d][dirlen] == '\0') |
| 597 | return d; |
| 598 | } |
| 599 | |
| 600 | if (can_use_zero) |
| 601 | { |
| 602 | if (dirs == NULL || dirs[0] == NULL) |
| 603 | d = 0; |
| 604 | } |
| 605 | else if (d == 0) |
| 606 | d = 1; |
| 607 | |
| 608 | if (d >= dirs_allocated) |
| 609 | { |
| 610 | unsigned int old = dirs_allocated; |
| 611 | |
| 612 | dirs_allocated = d + 32; |
| 613 | dirs = XRESIZEVEC (char *, dirs, dirs_allocated); |
| 614 | memset (dirs + old, 0, (dirs_allocated - old) * sizeof (char *)); |
| 615 | } |
| 616 | |
| 617 | dirs[d] = xmemdup0 (dirname, dirlen); |
| 618 | if (dirs_in_use <= d) |
| 619 | dirs_in_use = d + 1; |
| 620 | |
| 621 | return d; |
| 622 | } |
| 623 | |
| 624 | static bfd_boolean |
| 625 | assign_file_to_slot (unsigned long i, const char *file, unsigned int dir, bfd_boolean auto_assign) |
| 626 | { |
| 627 | if (i >= files_allocated) |
| 628 | { |
| 629 | unsigned int old = files_allocated; |
| 630 | |
| 631 | files_allocated = i + 32; |
| 632 | /* Catch wraparound. */ |
| 633 | if (files_allocated <= old) |
| 634 | { |
| 635 | as_bad (_("file number %lu is too big"), (unsigned long) i); |
| 636 | return FALSE; |
| 637 | } |
| 638 | |
| 639 | files = XRESIZEVEC (struct file_entry, files, files_allocated); |
| 640 | memset (files + old, 0, (i + 32 - old) * sizeof (struct file_entry)); |
| 641 | } |
| 642 | |
| 643 | files[i].filename = file; |
| 644 | files[i].dir = dir; |
| 645 | files[i].auto_assigned = auto_assign; |
| 646 | memset (files[i].md5, 0, NUM_MD5_BYTES); |
| 647 | |
| 648 | if (files_in_use < i + 1) |
| 649 | files_in_use = i + 1; |
| 650 | |
| 651 | return TRUE; |
| 652 | } |
| 653 | |
| 654 | /* Get a .debug_line file number for PATHNAME. If there is a |
| 655 | directory component to PATHNAME, then this will be stored |
| 656 | in the directory table, if it is not already present. |
| 657 | Returns the slot number allocated to that filename or -1 |
| 658 | if there was a problem. */ |
| 659 | |
| 660 | static signed int |
| 661 | allocate_filenum (const char * pathname) |
| 662 | { |
| 663 | static signed int last_used = -1, last_used_dir_len = 0; |
| 664 | const char *file; |
| 665 | size_t dir_len; |
| 666 | unsigned int i, dir; |
| 667 | |
| 668 | /* Short circuit the common case of adding the same pathname |
| 669 | as last time. */ |
| 670 | if (last_used != -1) |
| 671 | { |
| 672 | const char * dirname = NULL; |
| 673 | |
| 674 | if (dirs != NULL) |
| 675 | dirname = dirs[files[last_used].dir]; |
| 676 | |
| 677 | if (dirname == NULL) |
| 678 | { |
| 679 | if (filename_cmp (pathname, files[last_used].filename) == 0) |
| 680 | return last_used; |
| 681 | } |
| 682 | else |
| 683 | { |
| 684 | if (filename_ncmp (pathname, dirname, last_used_dir_len) == 0 |
| 685 | && IS_DIR_SEPARATOR (pathname [last_used_dir_len]) |
| 686 | && filename_cmp (pathname + last_used_dir_len + 1, |
| 687 | files[last_used].filename) == 0) |
| 688 | return last_used; |
| 689 | } |
| 690 | } |
| 691 | |
| 692 | file = get_basename (pathname); |
| 693 | dir_len = file - pathname; |
| 694 | |
| 695 | dir = get_directory_table_entry (pathname, dir_len, FALSE); |
| 696 | |
| 697 | /* Do not use slot-0. That is specifically reserved for use by |
| 698 | the '.file 0 "name"' directive. */ |
| 699 | for (i = 1; i < files_in_use; ++i) |
| 700 | if (files[i].dir == dir |
| 701 | && files[i].filename |
| 702 | && filename_cmp (file, files[i].filename) == 0) |
| 703 | { |
| 704 | last_used = i; |
| 705 | last_used_dir_len = dir_len; |
| 706 | return i; |
| 707 | } |
| 708 | |
| 709 | if (!assign_file_to_slot (i, file, dir, TRUE)) |
| 710 | return -1; |
| 711 | |
| 712 | last_used = i; |
| 713 | last_used_dir_len = dir_len; |
| 714 | |
| 715 | return i; |
| 716 | } |
| 717 | |
| 718 | /* Allocate slot NUM in the .debug_line file table to FILENAME. |
| 719 | If DIRNAME is not NULL or there is a directory component to FILENAME |
| 720 | then this will be stored in the directory table, if not already present. |
| 721 | if WITH_MD5 is TRUE then there is a md5 value in generic_bignum. |
| 722 | Returns TRUE if allocation succeeded, FALSE otherwise. */ |
| 723 | |
| 724 | static bfd_boolean |
| 725 | allocate_filename_to_slot (const char * dirname, |
| 726 | const char * filename, |
| 727 | unsigned int num, |
| 728 | bfd_boolean with_md5) |
| 729 | { |
| 730 | const char *file; |
| 731 | size_t dirlen; |
| 732 | unsigned int i, d; |
| 733 | |
| 734 | /* Short circuit the common case of adding the same pathname |
| 735 | as last time. */ |
| 736 | if (num < files_allocated && files[num].filename != NULL) |
| 737 | { |
| 738 | const char * dir = NULL; |
| 739 | |
| 740 | if (dirs) |
| 741 | dir = dirs[files[num].dir]; |
| 742 | |
| 743 | if (with_md5 |
| 744 | && memcmp (generic_bignum, files[num].md5, NUM_MD5_BYTES) != 0) |
| 745 | goto fail; |
| 746 | |
| 747 | if (dirname != NULL) |
| 748 | { |
| 749 | if (dir != NULL && filename_cmp (dir, dirname) != 0) |
| 750 | goto fail; |
| 751 | |
| 752 | if (filename_cmp (filename, files[num].filename) != 0) |
| 753 | goto fail; |
| 754 | |
| 755 | /* If the filenames match, but the directory table entry was |
| 756 | empty, then fill it with the provided directory name. */ |
| 757 | if (dir == NULL) |
| 758 | dirs[files[num].dir] = xmemdup0 (dirname, strlen (dirname)); |
| 759 | |
| 760 | return TRUE; |
| 761 | } |
| 762 | else if (dir != NULL) |
| 763 | { |
| 764 | dirlen = strlen (dir); |
| 765 | if (filename_ncmp (filename, dir, dirlen) == 0 |
| 766 | && IS_DIR_SEPARATOR (filename [dirlen]) |
| 767 | && filename_cmp (filename + dirlen + 1, files[num].filename) == 0) |
| 768 | return TRUE; |
| 769 | } |
| 770 | else /* dir == NULL */ |
| 771 | { |
| 772 | file = get_basename (filename); |
| 773 | if (filename_cmp (file, files[num].filename) == 0) |
| 774 | { |
| 775 | if (file > filename) |
| 776 | /* The filenames match, but the directory table entry is empty. |
| 777 | Fill it with the provided directory name. */ |
| 778 | dirs[files[num].dir] = xmemdup0 (filename, file - filename); |
| 779 | return TRUE; |
| 780 | } |
| 781 | } |
| 782 | |
| 783 | fail: |
| 784 | /* If NUM was previously allocated automatically then |
| 785 | choose another slot for it, so that we can reuse NUM. */ |
| 786 | if (files[num].auto_assigned) |
| 787 | { |
| 788 | /* Find an unused slot. */ |
| 789 | for (i = 1; i < files_in_use; ++i) |
| 790 | if (files[i].filename == NULL) |
| 791 | break; |
| 792 | if (! assign_file_to_slot (i, files[num].filename, files[num].dir, TRUE)) |
| 793 | return FALSE; |
| 794 | files[num].filename = NULL; |
| 795 | } |
| 796 | else |
| 797 | { |
| 798 | as_bad (_("file table slot %u is already occupied by a different file (%s%s%s vs %s%s%s)"), |
| 799 | num, |
| 800 | dir == NULL ? "" : dir, |
| 801 | dir == NULL ? "" : "/", |
| 802 | files[num].filename, |
| 803 | dirname == NULL ? "" : dirname, |
| 804 | dirname == NULL ? "" : "/", |
| 805 | filename); |
| 806 | return FALSE; |
| 807 | } |
| 808 | } |
| 809 | |
| 810 | if (dirname == NULL) |
| 811 | { |
| 812 | dirname = filename; |
| 813 | file = get_basename (filename); |
| 814 | dirlen = file - filename; |
| 815 | } |
| 816 | else |
| 817 | { |
| 818 | dirlen = strlen (dirname); |
| 819 | file = filename; |
| 820 | } |
| 821 | |
| 822 | d = get_directory_table_entry (dirname, dirlen, num == 0); |
| 823 | i = num; |
| 824 | |
| 825 | if (! assign_file_to_slot (i, file, d, FALSE)) |
| 826 | return FALSE; |
| 827 | |
| 828 | if (with_md5) |
| 829 | { |
| 830 | if (target_big_endian) |
| 831 | { |
| 832 | /* md5's are stored in litte endian format. */ |
| 833 | unsigned int bits_remaining = NUM_MD5_BYTES * BITS_PER_CHAR; |
| 834 | unsigned int byte = NUM_MD5_BYTES; |
| 835 | unsigned int bignum_index = 0; |
| 836 | |
| 837 | while (bits_remaining) |
| 838 | { |
| 839 | unsigned int bignum_bits_remaining = LITTLENUM_NUMBER_OF_BITS; |
| 840 | valueT bignum_value = generic_bignum [bignum_index]; |
| 841 | bignum_index ++; |
| 842 | |
| 843 | while (bignum_bits_remaining) |
| 844 | { |
| 845 | files[i].md5[--byte] = bignum_value & 0xff; |
| 846 | bignum_value >>= 8; |
| 847 | bignum_bits_remaining -= 8; |
| 848 | bits_remaining -= 8; |
| 849 | } |
| 850 | } |
| 851 | } |
| 852 | else |
| 853 | { |
| 854 | unsigned int bits_remaining = NUM_MD5_BYTES * BITS_PER_CHAR; |
| 855 | unsigned int byte = 0; |
| 856 | unsigned int bignum_index = 0; |
| 857 | |
| 858 | while (bits_remaining) |
| 859 | { |
| 860 | unsigned int bignum_bits_remaining = LITTLENUM_NUMBER_OF_BITS; |
| 861 | valueT bignum_value = generic_bignum [bignum_index]; |
| 862 | |
| 863 | bignum_index ++; |
| 864 | |
| 865 | while (bignum_bits_remaining) |
| 866 | { |
| 867 | files[i].md5[byte++] = bignum_value & 0xff; |
| 868 | bignum_value >>= 8; |
| 869 | bignum_bits_remaining -= 8; |
| 870 | bits_remaining -= 8; |
| 871 | } |
| 872 | } |
| 873 | } |
| 874 | } |
| 875 | else |
| 876 | memset (files[i].md5, 0, NUM_MD5_BYTES); |
| 877 | |
| 878 | return TRUE; |
| 879 | } |
| 880 | |
| 881 | /* Returns the current source information. If .file directives have |
| 882 | been encountered, the info for the corresponding source file is |
| 883 | returned. Otherwise, the info for the assembly source file is |
| 884 | returned. */ |
| 885 | |
| 886 | void |
| 887 | dwarf2_where (struct dwarf2_line_info *line) |
| 888 | { |
| 889 | if (debug_type == DEBUG_DWARF2) |
| 890 | { |
| 891 | const char *filename; |
| 892 | |
| 893 | memset (line, 0, sizeof (*line)); |
| 894 | filename = as_where (&line->line); |
| 895 | line->filenum = allocate_filenum (filename); |
| 896 | /* FIXME: We should check the return value from allocate_filenum. */ |
| 897 | line->column = 0; |
| 898 | line->flags = DWARF2_FLAG_IS_STMT; |
| 899 | line->isa = current.isa; |
| 900 | line->discriminator = current.discriminator; |
| 901 | line->view = NULL; |
| 902 | } |
| 903 | else |
| 904 | *line = current; |
| 905 | } |
| 906 | |
| 907 | /* A hook to allow the target backend to inform the line number state |
| 908 | machine of isa changes when assembler debug info is enabled. */ |
| 909 | |
| 910 | void |
| 911 | dwarf2_set_isa (unsigned int isa) |
| 912 | { |
| 913 | current.isa = isa; |
| 914 | } |
| 915 | |
| 916 | /* Called for each machine instruction, or relatively atomic group of |
| 917 | machine instructions (ie built-in macro). The instruction or group |
| 918 | is SIZE bytes in length. If dwarf2 line number generation is called |
| 919 | for, emit a line statement appropriately. */ |
| 920 | |
| 921 | void |
| 922 | dwarf2_emit_insn (int size) |
| 923 | { |
| 924 | struct dwarf2_line_info loc; |
| 925 | |
| 926 | if (debug_type != DEBUG_DWARF2 |
| 927 | ? !dwarf2_loc_directive_seen |
| 928 | : !seen_at_least_1_file ()) |
| 929 | return; |
| 930 | |
| 931 | dwarf2_where (&loc); |
| 932 | |
| 933 | dwarf2_gen_line_info ((frag_now_fix_octets () - size) / OCTETS_PER_BYTE, &loc); |
| 934 | dwarf2_consume_line_info (); |
| 935 | } |
| 936 | |
| 937 | /* Move all previously-emitted line entries for the current position by |
| 938 | DELTA bytes. This function cannot be used to move the same entries |
| 939 | twice. */ |
| 940 | |
| 941 | void |
| 942 | dwarf2_move_insn (int delta) |
| 943 | { |
| 944 | struct line_subseg *lss; |
| 945 | struct line_entry *e; |
| 946 | valueT now; |
| 947 | |
| 948 | if (delta == 0) |
| 949 | return; |
| 950 | |
| 951 | lss = get_line_subseg (now_seg, now_subseg, FALSE); |
| 952 | if (!lss) |
| 953 | return; |
| 954 | |
| 955 | now = frag_now_fix (); |
| 956 | while ((e = *lss->pmove_tail)) |
| 957 | { |
| 958 | if (S_GET_VALUE (e->label) == now) |
| 959 | S_SET_VALUE (e->label, now + delta); |
| 960 | lss->pmove_tail = &e->next; |
| 961 | } |
| 962 | } |
| 963 | |
| 964 | /* Called after the current line information has been either used with |
| 965 | dwarf2_gen_line_info or saved with a machine instruction for later use. |
| 966 | This resets the state of the line number information to reflect that |
| 967 | it has been used. */ |
| 968 | |
| 969 | void |
| 970 | dwarf2_consume_line_info (void) |
| 971 | { |
| 972 | /* Unless we generate DWARF2 debugging information for each |
| 973 | assembler line, we only emit one line symbol for one LOC. */ |
| 974 | dwarf2_loc_directive_seen = FALSE; |
| 975 | |
| 976 | current.flags &= ~(DWARF2_FLAG_BASIC_BLOCK |
| 977 | | DWARF2_FLAG_PROLOGUE_END |
| 978 | | DWARF2_FLAG_EPILOGUE_BEGIN); |
| 979 | current.discriminator = 0; |
| 980 | current.view = NULL; |
| 981 | } |
| 982 | |
| 983 | /* Called for each (preferably code) label. If dwarf2_loc_mark_labels |
| 984 | is enabled, emit a basic block marker. */ |
| 985 | |
| 986 | void |
| 987 | dwarf2_emit_label (symbolS *label) |
| 988 | { |
| 989 | struct dwarf2_line_info loc; |
| 990 | |
| 991 | if (!dwarf2_loc_mark_labels) |
| 992 | return; |
| 993 | if (S_GET_SEGMENT (label) != now_seg) |
| 994 | return; |
| 995 | if (!(bfd_section_flags (now_seg) & SEC_CODE)) |
| 996 | return; |
| 997 | if (files_in_use == 0 && debug_type != DEBUG_DWARF2) |
| 998 | return; |
| 999 | |
| 1000 | dwarf2_where (&loc); |
| 1001 | |
| 1002 | loc.flags |= DWARF2_FLAG_BASIC_BLOCK; |
| 1003 | |
| 1004 | dwarf2_gen_line_info_1 (label, &loc); |
| 1005 | dwarf2_consume_line_info (); |
| 1006 | } |
| 1007 | |
| 1008 | /* Handle two forms of .file directive: |
| 1009 | - Pass .file "source.c" to s_app_file |
| 1010 | - Handle .file 1 "source.c" by adding an entry to the DWARF-2 file table |
| 1011 | |
| 1012 | If an entry is added to the file table, return a pointer to the filename. */ |
| 1013 | |
| 1014 | char * |
| 1015 | dwarf2_directive_filename (void) |
| 1016 | { |
| 1017 | bfd_boolean with_md5 = TRUE; |
| 1018 | valueT num; |
| 1019 | char *filename; |
| 1020 | const char * dirname = NULL; |
| 1021 | int filename_len; |
| 1022 | |
| 1023 | /* Continue to accept a bare string and pass it off. */ |
| 1024 | SKIP_WHITESPACE (); |
| 1025 | if (*input_line_pointer == '"') |
| 1026 | { |
| 1027 | s_app_file (0); |
| 1028 | return NULL; |
| 1029 | } |
| 1030 | |
| 1031 | num = get_absolute_expression (); |
| 1032 | |
| 1033 | if ((offsetT) num < 1 && DWARF2_LINE_VERSION < 5) |
| 1034 | { |
| 1035 | as_bad (_("file number less than one")); |
| 1036 | ignore_rest_of_line (); |
| 1037 | return NULL; |
| 1038 | } |
| 1039 | |
| 1040 | /* FIXME: Should we allow ".file <N>\n" as an expression meaning |
| 1041 | "switch back to the already allocated file <N> as the current |
| 1042 | file" ? */ |
| 1043 | |
| 1044 | filename = demand_copy_C_string (&filename_len); |
| 1045 | if (filename == NULL) |
| 1046 | /* demand_copy_C_string will have already generated an error message. */ |
| 1047 | return NULL; |
| 1048 | |
| 1049 | /* For DWARF-5 support we also accept: |
| 1050 | .file <NUM> ["<dir>"] "<file>" [md5 <NUM>] */ |
| 1051 | if (DWARF2_LINE_VERSION > 4) |
| 1052 | { |
| 1053 | SKIP_WHITESPACE (); |
| 1054 | if (*input_line_pointer == '"') |
| 1055 | { |
| 1056 | dirname = filename; |
| 1057 | filename = demand_copy_C_string (&filename_len); |
| 1058 | SKIP_WHITESPACE (); |
| 1059 | } |
| 1060 | |
| 1061 | if (strncmp (input_line_pointer, "md5", 3) == 0) |
| 1062 | { |
| 1063 | input_line_pointer += 3; |
| 1064 | SKIP_WHITESPACE (); |
| 1065 | |
| 1066 | expressionS exp; |
| 1067 | expression_and_evaluate (& exp); |
| 1068 | if (exp.X_op != O_big) |
| 1069 | as_bad (_("md5 value too small or not a constant")); |
| 1070 | else |
| 1071 | with_md5 = TRUE; |
| 1072 | } |
| 1073 | } |
| 1074 | |
| 1075 | demand_empty_rest_of_line (); |
| 1076 | |
| 1077 | /* A .file directive implies compiler generated debug information is |
| 1078 | being supplied. Turn off gas generated debug info. */ |
| 1079 | debug_type = DEBUG_NONE; |
| 1080 | |
| 1081 | if (num != (unsigned int) num |
| 1082 | || num >= (size_t) -1 / sizeof (struct file_entry) - 32) |
| 1083 | { |
| 1084 | as_bad (_("file number %lu is too big"), (unsigned long) num); |
| 1085 | return NULL; |
| 1086 | } |
| 1087 | |
| 1088 | if (! allocate_filename_to_slot (dirname, filename, (unsigned int) num, |
| 1089 | with_md5)) |
| 1090 | return NULL; |
| 1091 | |
| 1092 | return filename; |
| 1093 | } |
| 1094 | |
| 1095 | /* Calls dwarf2_directive_filename, but discards its result. |
| 1096 | Used in pseudo-op tables where the function result is ignored. */ |
| 1097 | |
| 1098 | void |
| 1099 | dwarf2_directive_file (int dummy ATTRIBUTE_UNUSED) |
| 1100 | { |
| 1101 | (void) dwarf2_directive_filename (); |
| 1102 | } |
| 1103 | |
| 1104 | void |
| 1105 | dwarf2_directive_loc (int dummy ATTRIBUTE_UNUSED) |
| 1106 | { |
| 1107 | offsetT filenum, line; |
| 1108 | |
| 1109 | /* If we see two .loc directives in a row, force the first one to be |
| 1110 | output now. */ |
| 1111 | if (dwarf2_loc_directive_seen) |
| 1112 | dwarf2_emit_insn (0); |
| 1113 | |
| 1114 | filenum = get_absolute_expression (); |
| 1115 | SKIP_WHITESPACE (); |
| 1116 | line = get_absolute_expression (); |
| 1117 | |
| 1118 | if (filenum < 1) |
| 1119 | { |
| 1120 | if (filenum != 0 || DWARF2_LINE_VERSION < 5) |
| 1121 | { |
| 1122 | as_bad (_("file number less than one")); |
| 1123 | return; |
| 1124 | } |
| 1125 | } |
| 1126 | |
| 1127 | if (filenum >= (int) files_in_use || files[filenum].filename == NULL) |
| 1128 | { |
| 1129 | as_bad (_("unassigned file number %ld"), (long) filenum); |
| 1130 | return; |
| 1131 | } |
| 1132 | |
| 1133 | current.filenum = filenum; |
| 1134 | current.line = line; |
| 1135 | current.discriminator = 0; |
| 1136 | |
| 1137 | #ifndef NO_LISTING |
| 1138 | if (listing) |
| 1139 | { |
| 1140 | if (files[filenum].dir) |
| 1141 | { |
| 1142 | size_t dir_len = strlen (dirs[files[filenum].dir]); |
| 1143 | size_t file_len = strlen (files[filenum].filename); |
| 1144 | char *cp = XNEWVEC (char, dir_len + 1 + file_len + 1); |
| 1145 | |
| 1146 | memcpy (cp, dirs[files[filenum].dir], dir_len); |
| 1147 | INSERT_DIR_SEPARATOR (cp, dir_len); |
| 1148 | memcpy (cp + dir_len + 1, files[filenum].filename, file_len); |
| 1149 | cp[dir_len + file_len + 1] = '\0'; |
| 1150 | listing_source_file (cp); |
| 1151 | free (cp); |
| 1152 | } |
| 1153 | else |
| 1154 | listing_source_file (files[filenum].filename); |
| 1155 | listing_source_line (line); |
| 1156 | } |
| 1157 | #endif |
| 1158 | |
| 1159 | SKIP_WHITESPACE (); |
| 1160 | if (ISDIGIT (*input_line_pointer)) |
| 1161 | { |
| 1162 | current.column = get_absolute_expression (); |
| 1163 | SKIP_WHITESPACE (); |
| 1164 | } |
| 1165 | |
| 1166 | while (ISALPHA (*input_line_pointer)) |
| 1167 | { |
| 1168 | char *p, c; |
| 1169 | offsetT value; |
| 1170 | |
| 1171 | c = get_symbol_name (& p); |
| 1172 | |
| 1173 | if (strcmp (p, "basic_block") == 0) |
| 1174 | { |
| 1175 | current.flags |= DWARF2_FLAG_BASIC_BLOCK; |
| 1176 | *input_line_pointer = c; |
| 1177 | } |
| 1178 | else if (strcmp (p, "prologue_end") == 0) |
| 1179 | { |
| 1180 | current.flags |= DWARF2_FLAG_PROLOGUE_END; |
| 1181 | *input_line_pointer = c; |
| 1182 | } |
| 1183 | else if (strcmp (p, "epilogue_begin") == 0) |
| 1184 | { |
| 1185 | current.flags |= DWARF2_FLAG_EPILOGUE_BEGIN; |
| 1186 | *input_line_pointer = c; |
| 1187 | } |
| 1188 | else if (strcmp (p, "is_stmt") == 0) |
| 1189 | { |
| 1190 | (void) restore_line_pointer (c); |
| 1191 | value = get_absolute_expression (); |
| 1192 | if (value == 0) |
| 1193 | current.flags &= ~DWARF2_FLAG_IS_STMT; |
| 1194 | else if (value == 1) |
| 1195 | current.flags |= DWARF2_FLAG_IS_STMT; |
| 1196 | else |
| 1197 | { |
| 1198 | as_bad (_("is_stmt value not 0 or 1")); |
| 1199 | return; |
| 1200 | } |
| 1201 | } |
| 1202 | else if (strcmp (p, "isa") == 0) |
| 1203 | { |
| 1204 | (void) restore_line_pointer (c); |
| 1205 | value = get_absolute_expression (); |
| 1206 | if (value >= 0) |
| 1207 | current.isa = value; |
| 1208 | else |
| 1209 | { |
| 1210 | as_bad (_("isa number less than zero")); |
| 1211 | return; |
| 1212 | } |
| 1213 | } |
| 1214 | else if (strcmp (p, "discriminator") == 0) |
| 1215 | { |
| 1216 | (void) restore_line_pointer (c); |
| 1217 | value = get_absolute_expression (); |
| 1218 | if (value >= 0) |
| 1219 | current.discriminator = value; |
| 1220 | else |
| 1221 | { |
| 1222 | as_bad (_("discriminator less than zero")); |
| 1223 | return; |
| 1224 | } |
| 1225 | } |
| 1226 | else if (strcmp (p, "view") == 0) |
| 1227 | { |
| 1228 | symbolS *sym; |
| 1229 | |
| 1230 | (void) restore_line_pointer (c); |
| 1231 | SKIP_WHITESPACE (); |
| 1232 | |
| 1233 | if (ISDIGIT (*input_line_pointer) |
| 1234 | || *input_line_pointer == '-') |
| 1235 | { |
| 1236 | bfd_boolean force_reset = *input_line_pointer == '-'; |
| 1237 | |
| 1238 | value = get_absolute_expression (); |
| 1239 | if (value != 0) |
| 1240 | { |
| 1241 | as_bad (_("numeric view can only be asserted to zero")); |
| 1242 | return; |
| 1243 | } |
| 1244 | if (force_reset && force_reset_view) |
| 1245 | sym = force_reset_view; |
| 1246 | else |
| 1247 | { |
| 1248 | sym = symbol_temp_new (absolute_section, value, |
| 1249 | &zero_address_frag); |
| 1250 | if (force_reset) |
| 1251 | force_reset_view = sym; |
| 1252 | } |
| 1253 | } |
| 1254 | else |
| 1255 | { |
| 1256 | char *name = read_symbol_name (); |
| 1257 | |
| 1258 | if (!name) |
| 1259 | return; |
| 1260 | sym = symbol_find_or_make (name); |
| 1261 | if (S_IS_DEFINED (sym) || symbol_equated_p (sym)) |
| 1262 | { |
| 1263 | if (S_IS_VOLATILE (sym)) |
| 1264 | sym = symbol_clone (sym, 1); |
| 1265 | else if (!S_CAN_BE_REDEFINED (sym)) |
| 1266 | { |
| 1267 | as_bad (_("symbol `%s' is already defined"), name); |
| 1268 | return; |
| 1269 | } |
| 1270 | } |
| 1271 | S_SET_SEGMENT (sym, undefined_section); |
| 1272 | S_SET_VALUE (sym, 0); |
| 1273 | symbol_set_frag (sym, &zero_address_frag); |
| 1274 | } |
| 1275 | current.view = sym; |
| 1276 | } |
| 1277 | else |
| 1278 | { |
| 1279 | as_bad (_("unknown .loc sub-directive `%s'"), p); |
| 1280 | (void) restore_line_pointer (c); |
| 1281 | return; |
| 1282 | } |
| 1283 | |
| 1284 | SKIP_WHITESPACE_AFTER_NAME (); |
| 1285 | } |
| 1286 | |
| 1287 | demand_empty_rest_of_line (); |
| 1288 | dwarf2_loc_directive_seen = TRUE; |
| 1289 | debug_type = DEBUG_NONE; |
| 1290 | |
| 1291 | /* If we were given a view id, emit the row right away. */ |
| 1292 | if (current.view) |
| 1293 | dwarf2_emit_insn (0); |
| 1294 | } |
| 1295 | |
| 1296 | void |
| 1297 | dwarf2_directive_loc_mark_labels (int dummy ATTRIBUTE_UNUSED) |
| 1298 | { |
| 1299 | offsetT value = get_absolute_expression (); |
| 1300 | |
| 1301 | if (value != 0 && value != 1) |
| 1302 | { |
| 1303 | as_bad (_("expected 0 or 1")); |
| 1304 | ignore_rest_of_line (); |
| 1305 | } |
| 1306 | else |
| 1307 | { |
| 1308 | dwarf2_loc_mark_labels = value != 0; |
| 1309 | demand_empty_rest_of_line (); |
| 1310 | } |
| 1311 | } |
| 1312 | \f |
| 1313 | static struct frag * |
| 1314 | first_frag_for_seg (segT seg) |
| 1315 | { |
| 1316 | return seg_info (seg)->frchainP->frch_root; |
| 1317 | } |
| 1318 | |
| 1319 | static struct frag * |
| 1320 | last_frag_for_seg (segT seg) |
| 1321 | { |
| 1322 | frchainS *f = seg_info (seg)->frchainP; |
| 1323 | |
| 1324 | while (f->frch_next != NULL) |
| 1325 | f = f->frch_next; |
| 1326 | |
| 1327 | return f->frch_last; |
| 1328 | } |
| 1329 | \f |
| 1330 | /* Emit a single byte into the current segment. */ |
| 1331 | |
| 1332 | static inline void |
| 1333 | out_byte (int byte) |
| 1334 | { |
| 1335 | FRAG_APPEND_1_CHAR (byte); |
| 1336 | } |
| 1337 | |
| 1338 | /* Emit a statement program opcode into the current segment. */ |
| 1339 | |
| 1340 | static inline void |
| 1341 | out_opcode (int opc) |
| 1342 | { |
| 1343 | out_byte (opc); |
| 1344 | } |
| 1345 | |
| 1346 | /* Emit a two-byte word into the current segment. */ |
| 1347 | |
| 1348 | static inline void |
| 1349 | out_two (int data) |
| 1350 | { |
| 1351 | md_number_to_chars (frag_more (2), data, 2); |
| 1352 | } |
| 1353 | |
| 1354 | /* Emit a four byte word into the current segment. */ |
| 1355 | |
| 1356 | static inline void |
| 1357 | out_four (int data) |
| 1358 | { |
| 1359 | md_number_to_chars (frag_more (4), data, 4); |
| 1360 | } |
| 1361 | |
| 1362 | /* Emit an unsigned "little-endian base 128" number. */ |
| 1363 | |
| 1364 | static void |
| 1365 | out_uleb128 (addressT value) |
| 1366 | { |
| 1367 | output_leb128 (frag_more (sizeof_leb128 (value, 0)), value, 0); |
| 1368 | } |
| 1369 | |
| 1370 | /* Emit a signed "little-endian base 128" number. */ |
| 1371 | |
| 1372 | static void |
| 1373 | out_leb128 (addressT value) |
| 1374 | { |
| 1375 | output_leb128 (frag_more (sizeof_leb128 (value, 1)), value, 1); |
| 1376 | } |
| 1377 | |
| 1378 | /* Emit a tuple for .debug_abbrev. */ |
| 1379 | |
| 1380 | static inline void |
| 1381 | out_abbrev (int name, int form) |
| 1382 | { |
| 1383 | out_uleb128 (name); |
| 1384 | out_uleb128 (form); |
| 1385 | } |
| 1386 | |
| 1387 | /* Get the size of a fragment. */ |
| 1388 | |
| 1389 | static offsetT |
| 1390 | get_frag_fix (fragS *frag, segT seg) |
| 1391 | { |
| 1392 | frchainS *fr; |
| 1393 | |
| 1394 | if (frag->fr_next) |
| 1395 | return frag->fr_fix; |
| 1396 | |
| 1397 | /* If a fragment is the last in the chain, special measures must be |
| 1398 | taken to find its size before relaxation, since it may be pending |
| 1399 | on some subsegment chain. */ |
| 1400 | for (fr = seg_info (seg)->frchainP; fr; fr = fr->frch_next) |
| 1401 | if (fr->frch_last == frag) |
| 1402 | return (char *) obstack_next_free (&fr->frch_obstack) - frag->fr_literal; |
| 1403 | |
| 1404 | abort (); |
| 1405 | } |
| 1406 | |
| 1407 | /* Set an absolute address (may result in a relocation entry). */ |
| 1408 | |
| 1409 | static void |
| 1410 | out_set_addr (symbolS *sym) |
| 1411 | { |
| 1412 | expressionS exp; |
| 1413 | |
| 1414 | memset (&exp, 0, sizeof exp); |
| 1415 | out_opcode (DW_LNS_extended_op); |
| 1416 | out_uleb128 (sizeof_address + 1); |
| 1417 | |
| 1418 | out_opcode (DW_LNE_set_address); |
| 1419 | exp.X_op = O_symbol; |
| 1420 | exp.X_add_symbol = sym; |
| 1421 | exp.X_add_number = 0; |
| 1422 | emit_expr (&exp, sizeof_address); |
| 1423 | } |
| 1424 | |
| 1425 | static void scale_addr_delta (addressT *); |
| 1426 | |
| 1427 | static void |
| 1428 | scale_addr_delta (addressT *addr_delta) |
| 1429 | { |
| 1430 | static int printed_this = 0; |
| 1431 | if (DWARF2_LINE_MIN_INSN_LENGTH > 1) |
| 1432 | { |
| 1433 | if (*addr_delta % DWARF2_LINE_MIN_INSN_LENGTH != 0 && !printed_this) |
| 1434 | { |
| 1435 | as_bad("unaligned opcodes detected in executable segment"); |
| 1436 | printed_this = 1; |
| 1437 | } |
| 1438 | *addr_delta /= DWARF2_LINE_MIN_INSN_LENGTH; |
| 1439 | } |
| 1440 | } |
| 1441 | |
| 1442 | /* Encode a pair of line and address skips as efficiently as possible. |
| 1443 | Note that the line skip is signed, whereas the address skip is unsigned. |
| 1444 | |
| 1445 | The following two routines *must* be kept in sync. This is |
| 1446 | enforced by making emit_inc_line_addr abort if we do not emit |
| 1447 | exactly the expected number of bytes. */ |
| 1448 | |
| 1449 | static int |
| 1450 | size_inc_line_addr (int line_delta, addressT addr_delta) |
| 1451 | { |
| 1452 | unsigned int tmp, opcode; |
| 1453 | int len = 0; |
| 1454 | |
| 1455 | /* Scale the address delta by the minimum instruction length. */ |
| 1456 | scale_addr_delta (&addr_delta); |
| 1457 | |
| 1458 | /* INT_MAX is a signal that this is actually a DW_LNE_end_sequence. |
| 1459 | We cannot use special opcodes here, since we want the end_sequence |
| 1460 | to emit the matrix entry. */ |
| 1461 | if (line_delta == INT_MAX) |
| 1462 | { |
| 1463 | if (addr_delta == MAX_SPECIAL_ADDR_DELTA) |
| 1464 | len = 1; |
| 1465 | else if (addr_delta) |
| 1466 | len = 1 + sizeof_leb128 (addr_delta, 0); |
| 1467 | return len + 3; |
| 1468 | } |
| 1469 | |
| 1470 | /* Bias the line delta by the base. */ |
| 1471 | tmp = line_delta - DWARF2_LINE_BASE; |
| 1472 | |
| 1473 | /* If the line increment is out of range of a special opcode, we |
| 1474 | must encode it with DW_LNS_advance_line. */ |
| 1475 | if (tmp >= DWARF2_LINE_RANGE) |
| 1476 | { |
| 1477 | len = 1 + sizeof_leb128 (line_delta, 1); |
| 1478 | line_delta = 0; |
| 1479 | tmp = 0 - DWARF2_LINE_BASE; |
| 1480 | } |
| 1481 | |
| 1482 | /* Bias the opcode by the special opcode base. */ |
| 1483 | tmp += DWARF2_LINE_OPCODE_BASE; |
| 1484 | |
| 1485 | /* Avoid overflow when addr_delta is large. */ |
| 1486 | if (addr_delta < 256 + MAX_SPECIAL_ADDR_DELTA) |
| 1487 | { |
| 1488 | /* Try using a special opcode. */ |
| 1489 | opcode = tmp + addr_delta * DWARF2_LINE_RANGE; |
| 1490 | if (opcode <= 255) |
| 1491 | return len + 1; |
| 1492 | |
| 1493 | /* Try using DW_LNS_const_add_pc followed by special op. */ |
| 1494 | opcode = tmp + (addr_delta - MAX_SPECIAL_ADDR_DELTA) * DWARF2_LINE_RANGE; |
| 1495 | if (opcode <= 255) |
| 1496 | return len + 2; |
| 1497 | } |
| 1498 | |
| 1499 | /* Otherwise use DW_LNS_advance_pc. */ |
| 1500 | len += 1 + sizeof_leb128 (addr_delta, 0); |
| 1501 | |
| 1502 | /* DW_LNS_copy or special opcode. */ |
| 1503 | len += 1; |
| 1504 | |
| 1505 | return len; |
| 1506 | } |
| 1507 | |
| 1508 | static void |
| 1509 | emit_inc_line_addr (int line_delta, addressT addr_delta, char *p, int len) |
| 1510 | { |
| 1511 | unsigned int tmp, opcode; |
| 1512 | int need_copy = 0; |
| 1513 | char *end = p + len; |
| 1514 | |
| 1515 | /* Line number sequences cannot go backward in addresses. This means |
| 1516 | we've incorrectly ordered the statements in the sequence. */ |
| 1517 | gas_assert ((offsetT) addr_delta >= 0); |
| 1518 | |
| 1519 | /* Scale the address delta by the minimum instruction length. */ |
| 1520 | scale_addr_delta (&addr_delta); |
| 1521 | |
| 1522 | /* INT_MAX is a signal that this is actually a DW_LNE_end_sequence. |
| 1523 | We cannot use special opcodes here, since we want the end_sequence |
| 1524 | to emit the matrix entry. */ |
| 1525 | if (line_delta == INT_MAX) |
| 1526 | { |
| 1527 | if (addr_delta == MAX_SPECIAL_ADDR_DELTA) |
| 1528 | *p++ = DW_LNS_const_add_pc; |
| 1529 | else if (addr_delta) |
| 1530 | { |
| 1531 | *p++ = DW_LNS_advance_pc; |
| 1532 | p += output_leb128 (p, addr_delta, 0); |
| 1533 | } |
| 1534 | |
| 1535 | *p++ = DW_LNS_extended_op; |
| 1536 | *p++ = 1; |
| 1537 | *p++ = DW_LNE_end_sequence; |
| 1538 | goto done; |
| 1539 | } |
| 1540 | |
| 1541 | /* Bias the line delta by the base. */ |
| 1542 | tmp = line_delta - DWARF2_LINE_BASE; |
| 1543 | |
| 1544 | /* If the line increment is out of range of a special opcode, we |
| 1545 | must encode it with DW_LNS_advance_line. */ |
| 1546 | if (tmp >= DWARF2_LINE_RANGE) |
| 1547 | { |
| 1548 | *p++ = DW_LNS_advance_line; |
| 1549 | p += output_leb128 (p, line_delta, 1); |
| 1550 | |
| 1551 | line_delta = 0; |
| 1552 | tmp = 0 - DWARF2_LINE_BASE; |
| 1553 | need_copy = 1; |
| 1554 | } |
| 1555 | |
| 1556 | /* Prettier, I think, to use DW_LNS_copy instead of a "line +0, addr +0" |
| 1557 | special opcode. */ |
| 1558 | if (line_delta == 0 && addr_delta == 0) |
| 1559 | { |
| 1560 | *p++ = DW_LNS_copy; |
| 1561 | goto done; |
| 1562 | } |
| 1563 | |
| 1564 | /* Bias the opcode by the special opcode base. */ |
| 1565 | tmp += DWARF2_LINE_OPCODE_BASE; |
| 1566 | |
| 1567 | /* Avoid overflow when addr_delta is large. */ |
| 1568 | if (addr_delta < 256 + MAX_SPECIAL_ADDR_DELTA) |
| 1569 | { |
| 1570 | /* Try using a special opcode. */ |
| 1571 | opcode = tmp + addr_delta * DWARF2_LINE_RANGE; |
| 1572 | if (opcode <= 255) |
| 1573 | { |
| 1574 | *p++ = opcode; |
| 1575 | goto done; |
| 1576 | } |
| 1577 | |
| 1578 | /* Try using DW_LNS_const_add_pc followed by special op. */ |
| 1579 | opcode = tmp + (addr_delta - MAX_SPECIAL_ADDR_DELTA) * DWARF2_LINE_RANGE; |
| 1580 | if (opcode <= 255) |
| 1581 | { |
| 1582 | *p++ = DW_LNS_const_add_pc; |
| 1583 | *p++ = opcode; |
| 1584 | goto done; |
| 1585 | } |
| 1586 | } |
| 1587 | |
| 1588 | /* Otherwise use DW_LNS_advance_pc. */ |
| 1589 | *p++ = DW_LNS_advance_pc; |
| 1590 | p += output_leb128 (p, addr_delta, 0); |
| 1591 | |
| 1592 | if (need_copy) |
| 1593 | *p++ = DW_LNS_copy; |
| 1594 | else |
| 1595 | *p++ = tmp; |
| 1596 | |
| 1597 | done: |
| 1598 | gas_assert (p == end); |
| 1599 | } |
| 1600 | |
| 1601 | /* Handy routine to combine calls to the above two routines. */ |
| 1602 | |
| 1603 | static void |
| 1604 | out_inc_line_addr (int line_delta, addressT addr_delta) |
| 1605 | { |
| 1606 | int len = size_inc_line_addr (line_delta, addr_delta); |
| 1607 | emit_inc_line_addr (line_delta, addr_delta, frag_more (len), len); |
| 1608 | } |
| 1609 | |
| 1610 | /* Write out an alternative form of line and address skips using |
| 1611 | DW_LNS_fixed_advance_pc opcodes. This uses more space than the default |
| 1612 | line and address information, but it is required if linker relaxation |
| 1613 | could change the code offsets. The following two routines *must* be |
| 1614 | kept in sync. */ |
| 1615 | #define ADDR_DELTA_LIMIT 50000 |
| 1616 | |
| 1617 | static int |
| 1618 | size_fixed_inc_line_addr (int line_delta, addressT addr_delta) |
| 1619 | { |
| 1620 | int len = 0; |
| 1621 | |
| 1622 | /* INT_MAX is a signal that this is actually a DW_LNE_end_sequence. */ |
| 1623 | if (line_delta != INT_MAX) |
| 1624 | len = 1 + sizeof_leb128 (line_delta, 1); |
| 1625 | |
| 1626 | if (addr_delta > ADDR_DELTA_LIMIT) |
| 1627 | { |
| 1628 | /* DW_LNS_extended_op */ |
| 1629 | len += 1 + sizeof_leb128 (sizeof_address + 1, 0); |
| 1630 | /* DW_LNE_set_address */ |
| 1631 | len += 1 + sizeof_address; |
| 1632 | } |
| 1633 | else |
| 1634 | /* DW_LNS_fixed_advance_pc */ |
| 1635 | len += 3; |
| 1636 | |
| 1637 | if (line_delta == INT_MAX) |
| 1638 | /* DW_LNS_extended_op + DW_LNE_end_sequence */ |
| 1639 | len += 3; |
| 1640 | else |
| 1641 | /* DW_LNS_copy */ |
| 1642 | len += 1; |
| 1643 | |
| 1644 | return len; |
| 1645 | } |
| 1646 | |
| 1647 | static void |
| 1648 | emit_fixed_inc_line_addr (int line_delta, addressT addr_delta, fragS *frag, |
| 1649 | char *p, int len) |
| 1650 | { |
| 1651 | expressionS *pexp; |
| 1652 | char *end = p + len; |
| 1653 | |
| 1654 | /* Line number sequences cannot go backward in addresses. This means |
| 1655 | we've incorrectly ordered the statements in the sequence. */ |
| 1656 | gas_assert ((offsetT) addr_delta >= 0); |
| 1657 | |
| 1658 | /* Verify that we have kept in sync with size_fixed_inc_line_addr. */ |
| 1659 | gas_assert (len == size_fixed_inc_line_addr (line_delta, addr_delta)); |
| 1660 | |
| 1661 | /* INT_MAX is a signal that this is actually a DW_LNE_end_sequence. */ |
| 1662 | if (line_delta != INT_MAX) |
| 1663 | { |
| 1664 | *p++ = DW_LNS_advance_line; |
| 1665 | p += output_leb128 (p, line_delta, 1); |
| 1666 | } |
| 1667 | |
| 1668 | pexp = symbol_get_value_expression (frag->fr_symbol); |
| 1669 | |
| 1670 | /* The DW_LNS_fixed_advance_pc opcode has a 2-byte operand so it can |
| 1671 | advance the address by at most 64K. Linker relaxation (without |
| 1672 | which this function would not be used) could change the operand by |
| 1673 | an unknown amount. If the address increment is getting close to |
| 1674 | the limit, just reset the address. */ |
| 1675 | if (addr_delta > ADDR_DELTA_LIMIT) |
| 1676 | { |
| 1677 | symbolS *to_sym; |
| 1678 | expressionS exp; |
| 1679 | |
| 1680 | memset (&exp, 0, sizeof exp); |
| 1681 | gas_assert (pexp->X_op == O_subtract); |
| 1682 | to_sym = pexp->X_add_symbol; |
| 1683 | |
| 1684 | *p++ = DW_LNS_extended_op; |
| 1685 | p += output_leb128 (p, sizeof_address + 1, 0); |
| 1686 | *p++ = DW_LNE_set_address; |
| 1687 | exp.X_op = O_symbol; |
| 1688 | exp.X_add_symbol = to_sym; |
| 1689 | exp.X_add_number = 0; |
| 1690 | emit_expr_fix (&exp, sizeof_address, frag, p, TC_PARSE_CONS_RETURN_NONE); |
| 1691 | p += sizeof_address; |
| 1692 | } |
| 1693 | else |
| 1694 | { |
| 1695 | *p++ = DW_LNS_fixed_advance_pc; |
| 1696 | emit_expr_fix (pexp, 2, frag, p, TC_PARSE_CONS_RETURN_NONE); |
| 1697 | p += 2; |
| 1698 | } |
| 1699 | |
| 1700 | if (line_delta == INT_MAX) |
| 1701 | { |
| 1702 | *p++ = DW_LNS_extended_op; |
| 1703 | *p++ = 1; |
| 1704 | *p++ = DW_LNE_end_sequence; |
| 1705 | } |
| 1706 | else |
| 1707 | *p++ = DW_LNS_copy; |
| 1708 | |
| 1709 | gas_assert (p == end); |
| 1710 | } |
| 1711 | |
| 1712 | /* Generate a variant frag that we can use to relax address/line |
| 1713 | increments between fragments of the target segment. */ |
| 1714 | |
| 1715 | static void |
| 1716 | relax_inc_line_addr (int line_delta, symbolS *to_sym, symbolS *from_sym) |
| 1717 | { |
| 1718 | expressionS exp; |
| 1719 | int max_chars; |
| 1720 | |
| 1721 | memset (&exp, 0, sizeof exp); |
| 1722 | exp.X_op = O_subtract; |
| 1723 | exp.X_add_symbol = to_sym; |
| 1724 | exp.X_op_symbol = from_sym; |
| 1725 | exp.X_add_number = 0; |
| 1726 | |
| 1727 | /* The maximum size of the frag is the line delta with a maximum |
| 1728 | sized address delta. */ |
| 1729 | if (DWARF2_USE_FIXED_ADVANCE_PC) |
| 1730 | max_chars = size_fixed_inc_line_addr (line_delta, |
| 1731 | -DWARF2_LINE_MIN_INSN_LENGTH); |
| 1732 | else |
| 1733 | max_chars = size_inc_line_addr (line_delta, -DWARF2_LINE_MIN_INSN_LENGTH); |
| 1734 | |
| 1735 | frag_var (rs_dwarf2dbg, max_chars, max_chars, 1, |
| 1736 | make_expr_symbol (&exp), line_delta, NULL); |
| 1737 | } |
| 1738 | |
| 1739 | /* The function estimates the size of a rs_dwarf2dbg variant frag |
| 1740 | based on the current values of the symbols. It is called before |
| 1741 | the relaxation loop. We set fr_subtype to the expected length. */ |
| 1742 | |
| 1743 | int |
| 1744 | dwarf2dbg_estimate_size_before_relax (fragS *frag) |
| 1745 | { |
| 1746 | offsetT addr_delta; |
| 1747 | int size; |
| 1748 | |
| 1749 | addr_delta = resolve_symbol_value (frag->fr_symbol); |
| 1750 | if (DWARF2_USE_FIXED_ADVANCE_PC) |
| 1751 | size = size_fixed_inc_line_addr (frag->fr_offset, addr_delta); |
| 1752 | else |
| 1753 | size = size_inc_line_addr (frag->fr_offset, addr_delta); |
| 1754 | |
| 1755 | frag->fr_subtype = size; |
| 1756 | |
| 1757 | return size; |
| 1758 | } |
| 1759 | |
| 1760 | /* This function relaxes a rs_dwarf2dbg variant frag based on the |
| 1761 | current values of the symbols. fr_subtype is the current length |
| 1762 | of the frag. This returns the change in frag length. */ |
| 1763 | |
| 1764 | int |
| 1765 | dwarf2dbg_relax_frag (fragS *frag) |
| 1766 | { |
| 1767 | int old_size, new_size; |
| 1768 | |
| 1769 | old_size = frag->fr_subtype; |
| 1770 | new_size = dwarf2dbg_estimate_size_before_relax (frag); |
| 1771 | |
| 1772 | return new_size - old_size; |
| 1773 | } |
| 1774 | |
| 1775 | /* This function converts a rs_dwarf2dbg variant frag into a normal |
| 1776 | fill frag. This is called after all relaxation has been done. |
| 1777 | fr_subtype will be the desired length of the frag. */ |
| 1778 | |
| 1779 | void |
| 1780 | dwarf2dbg_convert_frag (fragS *frag) |
| 1781 | { |
| 1782 | offsetT addr_diff; |
| 1783 | |
| 1784 | if (DWARF2_USE_FIXED_ADVANCE_PC) |
| 1785 | { |
| 1786 | /* If linker relaxation is enabled then the distance between the two |
| 1787 | symbols in the frag->fr_symbol expression might change. Hence we |
| 1788 | cannot rely upon the value computed by resolve_symbol_value. |
| 1789 | Instead we leave the expression unfinalized and allow |
| 1790 | emit_fixed_inc_line_addr to create a fixup (which later becomes a |
| 1791 | relocation) that will allow the linker to correctly compute the |
| 1792 | actual address difference. We have to use a fixed line advance for |
| 1793 | this as we cannot (easily) relocate leb128 encoded values. */ |
| 1794 | int saved_finalize_syms = finalize_syms; |
| 1795 | |
| 1796 | finalize_syms = 0; |
| 1797 | addr_diff = resolve_symbol_value (frag->fr_symbol); |
| 1798 | finalize_syms = saved_finalize_syms; |
| 1799 | } |
| 1800 | else |
| 1801 | addr_diff = resolve_symbol_value (frag->fr_symbol); |
| 1802 | |
| 1803 | /* fr_var carries the max_chars that we created the fragment with. |
| 1804 | fr_subtype carries the current expected length. We must, of |
| 1805 | course, have allocated enough memory earlier. */ |
| 1806 | gas_assert (frag->fr_var >= (int) frag->fr_subtype); |
| 1807 | |
| 1808 | if (DWARF2_USE_FIXED_ADVANCE_PC) |
| 1809 | emit_fixed_inc_line_addr (frag->fr_offset, addr_diff, frag, |
| 1810 | frag->fr_literal + frag->fr_fix, |
| 1811 | frag->fr_subtype); |
| 1812 | else |
| 1813 | emit_inc_line_addr (frag->fr_offset, addr_diff, |
| 1814 | frag->fr_literal + frag->fr_fix, frag->fr_subtype); |
| 1815 | |
| 1816 | frag->fr_fix += frag->fr_subtype; |
| 1817 | frag->fr_type = rs_fill; |
| 1818 | frag->fr_var = 0; |
| 1819 | frag->fr_offset = 0; |
| 1820 | } |
| 1821 | |
| 1822 | /* Generate .debug_line content for the chain of line number entries |
| 1823 | beginning at E, for segment SEG. */ |
| 1824 | |
| 1825 | static void |
| 1826 | process_entries (segT seg, struct line_entry *e) |
| 1827 | { |
| 1828 | unsigned filenum = 1; |
| 1829 | unsigned line = 1; |
| 1830 | unsigned column = 0; |
| 1831 | unsigned isa = 0; |
| 1832 | unsigned flags = DWARF2_LINE_DEFAULT_IS_STMT ? DWARF2_FLAG_IS_STMT : 0; |
| 1833 | fragS *last_frag = NULL, *frag; |
| 1834 | addressT last_frag_ofs = 0, frag_ofs; |
| 1835 | symbolS *last_lab = NULL, *lab; |
| 1836 | struct line_entry *next; |
| 1837 | |
| 1838 | if (flag_dwarf_sections) |
| 1839 | { |
| 1840 | char * name; |
| 1841 | const char * sec_name; |
| 1842 | |
| 1843 | /* Switch to the relevant sub-section before we start to emit |
| 1844 | the line number table. |
| 1845 | |
| 1846 | FIXME: These sub-sections do not have a normal Line Number |
| 1847 | Program Header, thus strictly speaking they are not valid |
| 1848 | DWARF sections. Unfortunately the DWARF standard assumes |
| 1849 | a one-to-one relationship between compilation units and |
| 1850 | line number tables. Thus we have to have a .debug_line |
| 1851 | section, as well as our sub-sections, and we have to ensure |
| 1852 | that all of the sub-sections are merged into a proper |
| 1853 | .debug_line section before a debugger sees them. */ |
| 1854 | |
| 1855 | sec_name = bfd_section_name (seg); |
| 1856 | if (strcmp (sec_name, ".text") != 0) |
| 1857 | { |
| 1858 | name = concat (".debug_line", sec_name, (char *) NULL); |
| 1859 | subseg_set (subseg_get (name, FALSE), 0); |
| 1860 | } |
| 1861 | else |
| 1862 | /* Don't create a .debug_line.text section - |
| 1863 | that is redundant. Instead just switch back to the |
| 1864 | normal .debug_line section. */ |
| 1865 | subseg_set (subseg_get (".debug_line", FALSE), 0); |
| 1866 | } |
| 1867 | |
| 1868 | do |
| 1869 | { |
| 1870 | int line_delta; |
| 1871 | |
| 1872 | if (filenum != e->loc.filenum) |
| 1873 | { |
| 1874 | filenum = e->loc.filenum; |
| 1875 | out_opcode (DW_LNS_set_file); |
| 1876 | out_uleb128 (filenum); |
| 1877 | } |
| 1878 | |
| 1879 | if (column != e->loc.column) |
| 1880 | { |
| 1881 | column = e->loc.column; |
| 1882 | out_opcode (DW_LNS_set_column); |
| 1883 | out_uleb128 (column); |
| 1884 | } |
| 1885 | |
| 1886 | if (e->loc.discriminator != 0) |
| 1887 | { |
| 1888 | out_opcode (DW_LNS_extended_op); |
| 1889 | out_leb128 (1 + sizeof_leb128 (e->loc.discriminator, 0)); |
| 1890 | out_opcode (DW_LNE_set_discriminator); |
| 1891 | out_uleb128 (e->loc.discriminator); |
| 1892 | } |
| 1893 | |
| 1894 | if (isa != e->loc.isa) |
| 1895 | { |
| 1896 | isa = e->loc.isa; |
| 1897 | out_opcode (DW_LNS_set_isa); |
| 1898 | out_uleb128 (isa); |
| 1899 | } |
| 1900 | |
| 1901 | if ((e->loc.flags ^ flags) & DWARF2_FLAG_IS_STMT) |
| 1902 | { |
| 1903 | flags = e->loc.flags; |
| 1904 | out_opcode (DW_LNS_negate_stmt); |
| 1905 | } |
| 1906 | |
| 1907 | if (e->loc.flags & DWARF2_FLAG_BASIC_BLOCK) |
| 1908 | out_opcode (DW_LNS_set_basic_block); |
| 1909 | |
| 1910 | if (e->loc.flags & DWARF2_FLAG_PROLOGUE_END) |
| 1911 | out_opcode (DW_LNS_set_prologue_end); |
| 1912 | |
| 1913 | if (e->loc.flags & DWARF2_FLAG_EPILOGUE_BEGIN) |
| 1914 | out_opcode (DW_LNS_set_epilogue_begin); |
| 1915 | |
| 1916 | /* Don't try to optimize away redundant entries; gdb wants two |
| 1917 | entries for a function where the code starts on the same line as |
| 1918 | the {, and there's no way to identify that case here. Trust gcc |
| 1919 | to optimize appropriately. */ |
| 1920 | line_delta = e->loc.line - line; |
| 1921 | lab = e->label; |
| 1922 | frag = symbol_get_frag (lab); |
| 1923 | frag_ofs = S_GET_VALUE (lab); |
| 1924 | |
| 1925 | if (last_frag == NULL |
| 1926 | || (e->loc.view == force_reset_view && force_reset_view |
| 1927 | /* If we're going to reset the view, but we know we're |
| 1928 | advancing the PC, we don't have to force with |
| 1929 | set_address. We know we do when we're at the same |
| 1930 | address of the same frag, and we know we might when |
| 1931 | we're in the beginning of a frag, and we were at the |
| 1932 | end of the previous frag. */ |
| 1933 | && (frag == last_frag |
| 1934 | ? (last_frag_ofs == frag_ofs) |
| 1935 | : (frag_ofs == 0 |
| 1936 | && ((offsetT)last_frag_ofs |
| 1937 | >= get_frag_fix (last_frag, seg)))))) |
| 1938 | { |
| 1939 | out_set_addr (lab); |
| 1940 | out_inc_line_addr (line_delta, 0); |
| 1941 | } |
| 1942 | else if (frag == last_frag && ! DWARF2_USE_FIXED_ADVANCE_PC) |
| 1943 | out_inc_line_addr (line_delta, frag_ofs - last_frag_ofs); |
| 1944 | else |
| 1945 | relax_inc_line_addr (line_delta, lab, last_lab); |
| 1946 | |
| 1947 | line = e->loc.line; |
| 1948 | last_lab = lab; |
| 1949 | last_frag = frag; |
| 1950 | last_frag_ofs = frag_ofs; |
| 1951 | |
| 1952 | next = e->next; |
| 1953 | free (e); |
| 1954 | e = next; |
| 1955 | } |
| 1956 | while (e); |
| 1957 | |
| 1958 | /* Emit a DW_LNE_end_sequence for the end of the section. */ |
| 1959 | frag = last_frag_for_seg (seg); |
| 1960 | frag_ofs = get_frag_fix (frag, seg); |
| 1961 | if (frag == last_frag && ! DWARF2_USE_FIXED_ADVANCE_PC) |
| 1962 | out_inc_line_addr (INT_MAX, frag_ofs - last_frag_ofs); |
| 1963 | else |
| 1964 | { |
| 1965 | lab = symbol_temp_new (seg, frag_ofs, frag); |
| 1966 | relax_inc_line_addr (INT_MAX, lab, last_lab); |
| 1967 | } |
| 1968 | } |
| 1969 | |
| 1970 | /* Emit the directory and file tables for .debug_line. */ |
| 1971 | |
| 1972 | static void |
| 1973 | out_dir_and_file_list (void) |
| 1974 | { |
| 1975 | size_t size; |
| 1976 | const char *dir; |
| 1977 | char *cp; |
| 1978 | unsigned int i; |
| 1979 | bfd_boolean emit_md5 = FALSE; |
| 1980 | bfd_boolean emit_timestamps = TRUE; |
| 1981 | bfd_boolean emit_filesize = TRUE; |
| 1982 | |
| 1983 | /* Output the Directory Table. */ |
| 1984 | |
| 1985 | if (DWARF2_LINE_VERSION >= 5) |
| 1986 | { |
| 1987 | out_byte (1); |
| 1988 | out_uleb128 (DW_LNCT_path); |
| 1989 | /* FIXME: it would be better to store these strings in |
| 1990 | the .debug_line_str section and reference them here. */ |
| 1991 | out_uleb128 (DW_FORM_string); |
| 1992 | out_uleb128 (dirs_in_use); |
| 1993 | } |
| 1994 | |
| 1995 | /* Emit directory list. */ |
| 1996 | if (DWARF2_LINE_VERSION >= 5) |
| 1997 | { |
| 1998 | if (dirs == NULL || dirs[0] == NULL) |
| 1999 | dir = remap_debug_filename ("."); |
| 2000 | else |
| 2001 | dir = remap_debug_filename (dirs[0]); |
| 2002 | |
| 2003 | size = strlen (dir) + 1; |
| 2004 | cp = frag_more (size); |
| 2005 | memcpy (cp, dir, size); |
| 2006 | } |
| 2007 | for (i = 1; i < dirs_in_use; ++i) |
| 2008 | { |
| 2009 | dir = remap_debug_filename (dirs[i]); |
| 2010 | size = strlen (dir) + 1; |
| 2011 | cp = frag_more (size); |
| 2012 | memcpy (cp, dir, size); |
| 2013 | } |
| 2014 | |
| 2015 | if (DWARF2_LINE_VERSION < 5) |
| 2016 | /* Terminate it. */ |
| 2017 | out_byte ('\0'); |
| 2018 | |
| 2019 | /* Output the File Name Table. */ |
| 2020 | |
| 2021 | if (DWARF2_LINE_VERSION >= 5) |
| 2022 | { |
| 2023 | unsigned int columns = 4; |
| 2024 | |
| 2025 | if (((unsigned long) DWARF2_FILE_TIME_NAME ("", "")) == -1UL) |
| 2026 | { |
| 2027 | emit_timestamps = FALSE; |
| 2028 | -- columns; |
| 2029 | } |
| 2030 | |
| 2031 | if (DWARF2_FILE_SIZE_NAME ("", "") == -1) |
| 2032 | { |
| 2033 | emit_filesize = FALSE; |
| 2034 | -- columns; |
| 2035 | } |
| 2036 | |
| 2037 | for (i = 0; i < files_in_use; ++i) |
| 2038 | if (files[i].md5[0] != 0) |
| 2039 | break; |
| 2040 | if (i < files_in_use) |
| 2041 | { |
| 2042 | emit_md5 = TRUE; |
| 2043 | ++ columns; |
| 2044 | } |
| 2045 | |
| 2046 | /* The number of format entries to follow. */ |
| 2047 | out_byte (columns); |
| 2048 | |
| 2049 | /* The format of the file name. */ |
| 2050 | out_uleb128 (DW_LNCT_path); |
| 2051 | /* FIXME: it would be better to store these strings in |
| 2052 | the .debug_line_str section and reference them here. */ |
| 2053 | out_uleb128 (DW_FORM_string); |
| 2054 | |
| 2055 | /* The format of the directory index. */ |
| 2056 | out_uleb128 (DW_LNCT_directory_index); |
| 2057 | out_uleb128 (DW_FORM_udata); |
| 2058 | |
| 2059 | if (emit_timestamps) |
| 2060 | { |
| 2061 | /* The format of the timestamp. */ |
| 2062 | out_uleb128 (DW_LNCT_timestamp); |
| 2063 | out_uleb128 (DW_FORM_udata); |
| 2064 | } |
| 2065 | |
| 2066 | if (emit_filesize) |
| 2067 | { |
| 2068 | /* The format of the file size. */ |
| 2069 | out_uleb128 (DW_LNCT_size); |
| 2070 | out_uleb128 (DW_FORM_udata); |
| 2071 | } |
| 2072 | |
| 2073 | if (emit_md5) |
| 2074 | { |
| 2075 | /* The format of the MD5 sum. */ |
| 2076 | out_uleb128 (DW_LNCT_MD5); |
| 2077 | out_uleb128 (DW_FORM_data16); |
| 2078 | } |
| 2079 | |
| 2080 | /* The number of entries in the table. */ |
| 2081 | out_uleb128 (files_in_use); |
| 2082 | } |
| 2083 | |
| 2084 | for (i = DWARF2_LINE_VERSION > 4 ? 0 : 1; i < files_in_use; ++i) |
| 2085 | { |
| 2086 | const char *fullfilename; |
| 2087 | |
| 2088 | if (files[i].filename == NULL) |
| 2089 | { |
| 2090 | /* Prevent a crash later, particularly for file 1. */ |
| 2091 | files[i].filename = ""; |
| 2092 | if (DWARF2_LINE_VERSION < 5 || i != 0) |
| 2093 | { |
| 2094 | as_bad (_("unassigned file number %ld"), (long) i); |
| 2095 | continue; |
| 2096 | } |
| 2097 | } |
| 2098 | |
| 2099 | fullfilename = DWARF2_FILE_NAME (files[i].filename, |
| 2100 | files[i].dir ? dirs [files [i].dir] : ""); |
| 2101 | size = strlen (fullfilename) + 1; |
| 2102 | cp = frag_more (size); |
| 2103 | memcpy (cp, fullfilename, size); |
| 2104 | |
| 2105 | /* Directory number. */ |
| 2106 | out_uleb128 (files[i].dir); |
| 2107 | |
| 2108 | /* Output the last modification timestamp. */ |
| 2109 | if (emit_timestamps) |
| 2110 | { |
| 2111 | offsetT timestamp; |
| 2112 | |
| 2113 | timestamp = DWARF2_FILE_TIME_NAME (files[i].filename, |
| 2114 | files[i].dir ? dirs [files [i].dir] : ""); |
| 2115 | if (timestamp == -1) |
| 2116 | timestamp = 0; |
| 2117 | out_uleb128 (timestamp); |
| 2118 | } |
| 2119 | |
| 2120 | /* Output the filesize. */ |
| 2121 | if (emit_filesize) |
| 2122 | { |
| 2123 | offsetT filesize; |
| 2124 | filesize = DWARF2_FILE_SIZE_NAME (files[i].filename, |
| 2125 | files[i].dir ? dirs [files [i].dir] : ""); |
| 2126 | if (filesize == -1) |
| 2127 | filesize = 0; |
| 2128 | out_uleb128 (filesize); |
| 2129 | } |
| 2130 | |
| 2131 | /* Output the md5 sum. */ |
| 2132 | if (emit_md5) |
| 2133 | { |
| 2134 | int b; |
| 2135 | |
| 2136 | for (b = 0; b < NUM_MD5_BYTES; b++) |
| 2137 | out_byte (files[i].md5[b]); |
| 2138 | } |
| 2139 | } |
| 2140 | |
| 2141 | if (DWARF2_LINE_VERSION < 5) |
| 2142 | /* Terminate filename list. */ |
| 2143 | out_byte (0); |
| 2144 | } |
| 2145 | |
| 2146 | /* Switch to SEC and output a header length field. Return the size of |
| 2147 | offsets used in SEC. The caller must set EXPR->X_add_symbol value |
| 2148 | to the end of the section. EXPR->X_add_number will be set to the |
| 2149 | negative size of the header. */ |
| 2150 | |
| 2151 | static int |
| 2152 | out_header (asection *sec, expressionS *exp) |
| 2153 | { |
| 2154 | symbolS *start_sym; |
| 2155 | symbolS *end_sym; |
| 2156 | |
| 2157 | subseg_set (sec, 0); |
| 2158 | |
| 2159 | if (flag_dwarf_sections) |
| 2160 | { |
| 2161 | /* If we are going to put the start and end symbols in different |
| 2162 | sections, then we need real symbols, not just fake, local ones. */ |
| 2163 | frag_now_fix (); |
| 2164 | start_sym = symbol_make (".Ldebug_line_start"); |
| 2165 | end_sym = symbol_make (".Ldebug_line_end"); |
| 2166 | symbol_set_value_now (start_sym); |
| 2167 | } |
| 2168 | else |
| 2169 | { |
| 2170 | start_sym = symbol_temp_new_now_octets (); |
| 2171 | end_sym = symbol_temp_make (); |
| 2172 | } |
| 2173 | |
| 2174 | /* Total length of the information. */ |
| 2175 | exp->X_op = O_subtract; |
| 2176 | exp->X_add_symbol = end_sym; |
| 2177 | exp->X_op_symbol = start_sym; |
| 2178 | |
| 2179 | switch (DWARF2_FORMAT (sec)) |
| 2180 | { |
| 2181 | case dwarf2_format_32bit: |
| 2182 | exp->X_add_number = -4; |
| 2183 | emit_expr (exp, 4); |
| 2184 | return 4; |
| 2185 | |
| 2186 | case dwarf2_format_64bit: |
| 2187 | exp->X_add_number = -12; |
| 2188 | out_four (-1); |
| 2189 | emit_expr (exp, 8); |
| 2190 | return 8; |
| 2191 | |
| 2192 | case dwarf2_format_64bit_irix: |
| 2193 | exp->X_add_number = -8; |
| 2194 | emit_expr (exp, 8); |
| 2195 | return 8; |
| 2196 | } |
| 2197 | |
| 2198 | as_fatal (_("internal error: unknown dwarf2 format")); |
| 2199 | return 0; |
| 2200 | } |
| 2201 | |
| 2202 | /* Emit the collected .debug_line data. */ |
| 2203 | |
| 2204 | static void |
| 2205 | out_debug_line (segT line_seg) |
| 2206 | { |
| 2207 | expressionS exp; |
| 2208 | symbolS *prologue_start, *prologue_end; |
| 2209 | symbolS *line_end; |
| 2210 | struct line_seg *s; |
| 2211 | int sizeof_offset; |
| 2212 | |
| 2213 | memset (&exp, 0, sizeof exp); |
| 2214 | sizeof_offset = out_header (line_seg, &exp); |
| 2215 | line_end = exp.X_add_symbol; |
| 2216 | |
| 2217 | /* Version. */ |
| 2218 | out_two (DWARF2_LINE_VERSION); |
| 2219 | |
| 2220 | if (DWARF2_LINE_VERSION >= 5) |
| 2221 | { |
| 2222 | out_byte (sizeof_address); |
| 2223 | out_byte (0); /* Segment Selector size. */ |
| 2224 | } |
| 2225 | /* Length of the prologue following this length. */ |
| 2226 | prologue_start = symbol_temp_make (); |
| 2227 | prologue_end = symbol_temp_make (); |
| 2228 | exp.X_op = O_subtract; |
| 2229 | exp.X_add_symbol = prologue_end; |
| 2230 | exp.X_op_symbol = prologue_start; |
| 2231 | exp.X_add_number = 0; |
| 2232 | emit_expr (&exp, sizeof_offset); |
| 2233 | symbol_set_value_now (prologue_start); |
| 2234 | |
| 2235 | /* Parameters of the state machine. */ |
| 2236 | out_byte (DWARF2_LINE_MIN_INSN_LENGTH); |
| 2237 | if (DWARF2_LINE_VERSION >= 4) |
| 2238 | out_byte (DWARF2_LINE_MAX_OPS_PER_INSN); |
| 2239 | out_byte (DWARF2_LINE_DEFAULT_IS_STMT); |
| 2240 | out_byte (DWARF2_LINE_BASE); |
| 2241 | out_byte (DWARF2_LINE_RANGE); |
| 2242 | out_byte (DWARF2_LINE_OPCODE_BASE); |
| 2243 | |
| 2244 | /* Standard opcode lengths. */ |
| 2245 | out_byte (0); /* DW_LNS_copy */ |
| 2246 | out_byte (1); /* DW_LNS_advance_pc */ |
| 2247 | out_byte (1); /* DW_LNS_advance_line */ |
| 2248 | out_byte (1); /* DW_LNS_set_file */ |
| 2249 | out_byte (1); /* DW_LNS_set_column */ |
| 2250 | out_byte (0); /* DW_LNS_negate_stmt */ |
| 2251 | out_byte (0); /* DW_LNS_set_basic_block */ |
| 2252 | out_byte (0); /* DW_LNS_const_add_pc */ |
| 2253 | out_byte (1); /* DW_LNS_fixed_advance_pc */ |
| 2254 | out_byte (0); /* DW_LNS_set_prologue_end */ |
| 2255 | out_byte (0); /* DW_LNS_set_epilogue_begin */ |
| 2256 | out_byte (1); /* DW_LNS_set_isa */ |
| 2257 | /* We have emitted 12 opcode lengths, so make that this |
| 2258 | matches up to the opcode base value we have been using. */ |
| 2259 | gas_assert (DWARF2_LINE_OPCODE_BASE == 13); |
| 2260 | |
| 2261 | out_dir_and_file_list (); |
| 2262 | |
| 2263 | symbol_set_value_now (prologue_end); |
| 2264 | |
| 2265 | /* For each section, emit a statement program. */ |
| 2266 | for (s = all_segs; s; s = s->next) |
| 2267 | if (SEG_NORMAL (s->seg)) |
| 2268 | process_entries (s->seg, s->head->head); |
| 2269 | else |
| 2270 | as_warn ("dwarf line number information for %s ignored", |
| 2271 | segment_name (s->seg)); |
| 2272 | |
| 2273 | if (flag_dwarf_sections) |
| 2274 | /* We have to switch to the special .debug_line_end section |
| 2275 | before emitting the end-of-debug_line symbol. The linker |
| 2276 | script arranges for this section to be placed after all the |
| 2277 | (potentially garbage collected) .debug_line.<foo> sections. |
| 2278 | This section contains the line_end symbol which is used to |
| 2279 | compute the size of the linked .debug_line section, as seen |
| 2280 | in the DWARF Line Number header. */ |
| 2281 | subseg_set (subseg_get (".debug_line_end", FALSE), 0); |
| 2282 | |
| 2283 | symbol_set_value_now (line_end); |
| 2284 | } |
| 2285 | |
| 2286 | static void |
| 2287 | out_debug_ranges (segT ranges_seg) |
| 2288 | { |
| 2289 | unsigned int addr_size = sizeof_address; |
| 2290 | struct line_seg *s; |
| 2291 | expressionS exp; |
| 2292 | unsigned int i; |
| 2293 | |
| 2294 | memset (&exp, 0, sizeof exp); |
| 2295 | subseg_set (ranges_seg, 0); |
| 2296 | |
| 2297 | /* Base Address Entry. */ |
| 2298 | for (i = 0; i < addr_size; i++) |
| 2299 | out_byte (0xff); |
| 2300 | for (i = 0; i < addr_size; i++) |
| 2301 | out_byte (0); |
| 2302 | |
| 2303 | /* Range List Entry. */ |
| 2304 | for (s = all_segs; s; s = s->next) |
| 2305 | { |
| 2306 | fragS *frag; |
| 2307 | symbolS *beg, *end; |
| 2308 | |
| 2309 | frag = first_frag_for_seg (s->seg); |
| 2310 | beg = symbol_temp_new (s->seg, 0, frag); |
| 2311 | s->text_start = beg; |
| 2312 | |
| 2313 | frag = last_frag_for_seg (s->seg); |
| 2314 | end = symbol_temp_new (s->seg, get_frag_fix (frag, s->seg), frag); |
| 2315 | s->text_end = end; |
| 2316 | |
| 2317 | exp.X_op = O_symbol; |
| 2318 | exp.X_add_symbol = beg; |
| 2319 | exp.X_add_number = 0; |
| 2320 | emit_expr (&exp, addr_size); |
| 2321 | |
| 2322 | exp.X_op = O_symbol; |
| 2323 | exp.X_add_symbol = end; |
| 2324 | exp.X_add_number = 0; |
| 2325 | emit_expr (&exp, addr_size); |
| 2326 | } |
| 2327 | |
| 2328 | /* End of Range Entry. */ |
| 2329 | for (i = 0; i < addr_size; i++) |
| 2330 | out_byte (0); |
| 2331 | for (i = 0; i < addr_size; i++) |
| 2332 | out_byte (0); |
| 2333 | } |
| 2334 | |
| 2335 | /* Emit data for .debug_aranges. */ |
| 2336 | |
| 2337 | static void |
| 2338 | out_debug_aranges (segT aranges_seg, segT info_seg) |
| 2339 | { |
| 2340 | unsigned int addr_size = sizeof_address; |
| 2341 | offsetT size; |
| 2342 | struct line_seg *s; |
| 2343 | expressionS exp; |
| 2344 | symbolS *aranges_end; |
| 2345 | char *p; |
| 2346 | int sizeof_offset; |
| 2347 | |
| 2348 | memset (&exp, 0, sizeof exp); |
| 2349 | sizeof_offset = out_header (aranges_seg, &exp); |
| 2350 | aranges_end = exp.X_add_symbol; |
| 2351 | size = -exp.X_add_number; |
| 2352 | |
| 2353 | /* Version. */ |
| 2354 | out_two (DWARF2_ARANGES_VERSION); |
| 2355 | size += 2; |
| 2356 | |
| 2357 | /* Offset to .debug_info. */ |
| 2358 | TC_DWARF2_EMIT_OFFSET (section_symbol (info_seg), sizeof_offset); |
| 2359 | size += sizeof_offset; |
| 2360 | |
| 2361 | /* Size of an address (offset portion). */ |
| 2362 | out_byte (addr_size); |
| 2363 | size++; |
| 2364 | |
| 2365 | /* Size of a segment descriptor. */ |
| 2366 | out_byte (0); |
| 2367 | size++; |
| 2368 | |
| 2369 | /* Align the header. */ |
| 2370 | while ((size++ % (2 * addr_size)) > 0) |
| 2371 | out_byte (0); |
| 2372 | |
| 2373 | for (s = all_segs; s; s = s->next) |
| 2374 | { |
| 2375 | fragS *frag; |
| 2376 | symbolS *beg, *end; |
| 2377 | |
| 2378 | frag = first_frag_for_seg (s->seg); |
| 2379 | beg = symbol_temp_new (s->seg, 0, frag); |
| 2380 | s->text_start = beg; |
| 2381 | |
| 2382 | frag = last_frag_for_seg (s->seg); |
| 2383 | end = symbol_temp_new (s->seg, get_frag_fix (frag, s->seg), frag); |
| 2384 | s->text_end = end; |
| 2385 | |
| 2386 | exp.X_op = O_symbol; |
| 2387 | exp.X_add_symbol = beg; |
| 2388 | exp.X_add_number = 0; |
| 2389 | emit_expr (&exp, addr_size); |
| 2390 | |
| 2391 | exp.X_op = O_subtract; |
| 2392 | exp.X_add_symbol = end; |
| 2393 | exp.X_op_symbol = beg; |
| 2394 | exp.X_add_number = 0; |
| 2395 | emit_expr (&exp, addr_size); |
| 2396 | } |
| 2397 | |
| 2398 | p = frag_more (2 * addr_size); |
| 2399 | md_number_to_chars (p, 0, addr_size); |
| 2400 | md_number_to_chars (p + addr_size, 0, addr_size); |
| 2401 | |
| 2402 | symbol_set_value_now (aranges_end); |
| 2403 | } |
| 2404 | |
| 2405 | /* Emit data for .debug_abbrev. Note that this must be kept in |
| 2406 | sync with out_debug_info below. */ |
| 2407 | |
| 2408 | static void |
| 2409 | out_debug_abbrev (segT abbrev_seg, |
| 2410 | segT info_seg ATTRIBUTE_UNUSED, |
| 2411 | segT line_seg ATTRIBUTE_UNUSED) |
| 2412 | { |
| 2413 | subseg_set (abbrev_seg, 0); |
| 2414 | |
| 2415 | out_uleb128 (1); |
| 2416 | out_uleb128 (DW_TAG_compile_unit); |
| 2417 | out_byte (DW_CHILDREN_no); |
| 2418 | if (DWARF2_FORMAT (line_seg) == dwarf2_format_32bit) |
| 2419 | out_abbrev (DW_AT_stmt_list, DW_FORM_data4); |
| 2420 | else |
| 2421 | out_abbrev (DW_AT_stmt_list, DW_FORM_data8); |
| 2422 | if (all_segs->next == NULL) |
| 2423 | { |
| 2424 | out_abbrev (DW_AT_low_pc, DW_FORM_addr); |
| 2425 | if (DWARF2_VERSION < 4) |
| 2426 | out_abbrev (DW_AT_high_pc, DW_FORM_addr); |
| 2427 | else |
| 2428 | out_abbrev (DW_AT_high_pc, (sizeof_address == 4 |
| 2429 | ? DW_FORM_data4 : DW_FORM_data8)); |
| 2430 | } |
| 2431 | else |
| 2432 | { |
| 2433 | if (DWARF2_FORMAT (info_seg) == dwarf2_format_32bit) |
| 2434 | out_abbrev (DW_AT_ranges, DW_FORM_data4); |
| 2435 | else |
| 2436 | out_abbrev (DW_AT_ranges, DW_FORM_data8); |
| 2437 | } |
| 2438 | out_abbrev (DW_AT_name, DW_FORM_strp); |
| 2439 | out_abbrev (DW_AT_comp_dir, DW_FORM_strp); |
| 2440 | out_abbrev (DW_AT_producer, DW_FORM_strp); |
| 2441 | out_abbrev (DW_AT_language, DW_FORM_data2); |
| 2442 | out_abbrev (0, 0); |
| 2443 | |
| 2444 | /* Terminate the abbreviations for this compilation unit. */ |
| 2445 | out_byte (0); |
| 2446 | } |
| 2447 | |
| 2448 | /* Emit a description of this compilation unit for .debug_info. */ |
| 2449 | |
| 2450 | static void |
| 2451 | out_debug_info (segT info_seg, segT abbrev_seg, segT line_seg, segT ranges_seg, |
| 2452 | symbolS *name_sym, symbolS *comp_dir_sym, symbolS *producer_sym) |
| 2453 | { |
| 2454 | expressionS exp; |
| 2455 | symbolS *info_end; |
| 2456 | int sizeof_offset; |
| 2457 | |
| 2458 | memset (&exp, 0, sizeof exp); |
| 2459 | sizeof_offset = out_header (info_seg, &exp); |
| 2460 | info_end = exp.X_add_symbol; |
| 2461 | |
| 2462 | /* DWARF version. */ |
| 2463 | out_two (DWARF2_VERSION); |
| 2464 | |
| 2465 | /* .debug_abbrev offset */ |
| 2466 | TC_DWARF2_EMIT_OFFSET (section_symbol (abbrev_seg), sizeof_offset); |
| 2467 | |
| 2468 | /* Target address size. */ |
| 2469 | out_byte (sizeof_address); |
| 2470 | |
| 2471 | /* DW_TAG_compile_unit DIE abbrev */ |
| 2472 | out_uleb128 (1); |
| 2473 | |
| 2474 | /* DW_AT_stmt_list */ |
| 2475 | TC_DWARF2_EMIT_OFFSET (section_symbol (line_seg), |
| 2476 | (DWARF2_FORMAT (line_seg) == dwarf2_format_32bit |
| 2477 | ? 4 : 8)); |
| 2478 | |
| 2479 | /* These two attributes are emitted if all of the code is contiguous. */ |
| 2480 | if (all_segs->next == NULL) |
| 2481 | { |
| 2482 | /* DW_AT_low_pc */ |
| 2483 | exp.X_op = O_symbol; |
| 2484 | exp.X_add_symbol = all_segs->text_start; |
| 2485 | exp.X_add_number = 0; |
| 2486 | emit_expr (&exp, sizeof_address); |
| 2487 | |
| 2488 | /* DW_AT_high_pc */ |
| 2489 | if (DWARF2_VERSION < 4) |
| 2490 | exp.X_op = O_symbol; |
| 2491 | else |
| 2492 | { |
| 2493 | exp.X_op = O_subtract; |
| 2494 | exp.X_op_symbol = all_segs->text_start; |
| 2495 | } |
| 2496 | exp.X_add_symbol = all_segs->text_end; |
| 2497 | exp.X_add_number = 0; |
| 2498 | emit_expr (&exp, sizeof_address); |
| 2499 | } |
| 2500 | else |
| 2501 | { |
| 2502 | /* This attribute is emitted if the code is disjoint. */ |
| 2503 | /* DW_AT_ranges. */ |
| 2504 | TC_DWARF2_EMIT_OFFSET (section_symbol (ranges_seg), sizeof_offset); |
| 2505 | } |
| 2506 | |
| 2507 | /* DW_AT_name, DW_AT_comp_dir and DW_AT_producer. Symbols in .debug_str |
| 2508 | setup in out_debug_str below. */ |
| 2509 | TC_DWARF2_EMIT_OFFSET (name_sym, sizeof_offset); |
| 2510 | TC_DWARF2_EMIT_OFFSET (comp_dir_sym, sizeof_offset); |
| 2511 | TC_DWARF2_EMIT_OFFSET (producer_sym, sizeof_offset); |
| 2512 | |
| 2513 | /* DW_AT_language. Yes, this is probably not really MIPS, but the |
| 2514 | dwarf2 draft has no standard code for assembler. */ |
| 2515 | out_two (DW_LANG_Mips_Assembler); |
| 2516 | |
| 2517 | symbol_set_value_now (info_end); |
| 2518 | } |
| 2519 | |
| 2520 | /* Emit the three debug strings needed in .debug_str and setup symbols |
| 2521 | to them for use in out_debug_info. */ |
| 2522 | static void |
| 2523 | out_debug_str (segT str_seg, symbolS **name_sym, symbolS **comp_dir_sym, |
| 2524 | symbolS **producer_sym) |
| 2525 | { |
| 2526 | char producer[128]; |
| 2527 | const char *comp_dir; |
| 2528 | const char *dirname; |
| 2529 | char *p; |
| 2530 | int len; |
| 2531 | int first_file = DWARF2_LINE_VERSION > 4 ? 0 : 1; |
| 2532 | |
| 2533 | subseg_set (str_seg, 0); |
| 2534 | |
| 2535 | /* DW_AT_name. We don't have the actual file name that was present |
| 2536 | on the command line, so assume files[first_file] is the main input file. |
| 2537 | We're not supposed to get called unless at least one line number |
| 2538 | entry was emitted, so this should always be defined. */ |
| 2539 | *name_sym = symbol_temp_new_now_octets (); |
| 2540 | if (files_in_use == 0) |
| 2541 | abort (); |
| 2542 | if (files[first_file].dir) |
| 2543 | { |
| 2544 | dirname = remap_debug_filename (dirs[files[first_file].dir]); |
| 2545 | len = strlen (dirname); |
| 2546 | #ifdef TE_VMS |
| 2547 | /* Already has trailing slash. */ |
| 2548 | p = frag_more (len); |
| 2549 | memcpy (p, dirname, len); |
| 2550 | #else |
| 2551 | p = frag_more (len + 1); |
| 2552 | memcpy (p, dirname, len); |
| 2553 | INSERT_DIR_SEPARATOR (p, len); |
| 2554 | #endif |
| 2555 | } |
| 2556 | len = strlen (files[first_file].filename) + 1; |
| 2557 | p = frag_more (len); |
| 2558 | memcpy (p, files[first_file].filename, len); |
| 2559 | |
| 2560 | /* DW_AT_comp_dir */ |
| 2561 | *comp_dir_sym = symbol_temp_new_now_octets (); |
| 2562 | comp_dir = remap_debug_filename (getpwd ()); |
| 2563 | len = strlen (comp_dir) + 1; |
| 2564 | p = frag_more (len); |
| 2565 | memcpy (p, comp_dir, len); |
| 2566 | |
| 2567 | /* DW_AT_producer */ |
| 2568 | *producer_sym = symbol_temp_new_now_octets (); |
| 2569 | sprintf (producer, "GNU AS %s", VERSION); |
| 2570 | len = strlen (producer) + 1; |
| 2571 | p = frag_more (len); |
| 2572 | memcpy (p, producer, len); |
| 2573 | } |
| 2574 | |
| 2575 | void |
| 2576 | dwarf2_init (void) |
| 2577 | { |
| 2578 | last_seg_ptr = &all_segs; |
| 2579 | |
| 2580 | /* Select the default CIE version to produce here. The global |
| 2581 | starts with a value of -1 and will be modified to a valid value |
| 2582 | either by the user providing a command line option, or some |
| 2583 | targets will select their own default in md_after_parse_args. If |
| 2584 | we get here and the global still contains -1 then it is up to us |
| 2585 | to pick a sane default. The default we choose is 1, this is the |
| 2586 | CIE version gas has produced for a long time, and there seems no |
| 2587 | reason to change it yet. */ |
| 2588 | if (flag_dwarf_cie_version == -1) |
| 2589 | flag_dwarf_cie_version = 1; |
| 2590 | } |
| 2591 | |
| 2592 | |
| 2593 | /* Finish the dwarf2 debug sections. We emit .debug.line if there |
| 2594 | were any .file/.loc directives, or --gdwarf2 was given, or if the |
| 2595 | file has a non-empty .debug_info section and an empty .debug_line |
| 2596 | section. If we emit .debug_line, and the .debug_info section is |
| 2597 | empty, we also emit .debug_info, .debug_aranges and .debug_abbrev. |
| 2598 | ALL_SEGS will be non-null if there were any .file/.loc directives, |
| 2599 | or --gdwarf2 was given and there were any located instructions |
| 2600 | emitted. */ |
| 2601 | |
| 2602 | void |
| 2603 | dwarf2_finish (void) |
| 2604 | { |
| 2605 | segT line_seg; |
| 2606 | struct line_seg *s; |
| 2607 | segT info_seg; |
| 2608 | int emit_other_sections = 0; |
| 2609 | int empty_debug_line = 0; |
| 2610 | |
| 2611 | info_seg = bfd_get_section_by_name (stdoutput, ".debug_info"); |
| 2612 | emit_other_sections = info_seg == NULL || !seg_not_empty_p (info_seg); |
| 2613 | |
| 2614 | line_seg = bfd_get_section_by_name (stdoutput, ".debug_line"); |
| 2615 | empty_debug_line = line_seg == NULL || !seg_not_empty_p (line_seg); |
| 2616 | |
| 2617 | /* We can't construct a new debug_line section if we already have one. |
| 2618 | Give an error. */ |
| 2619 | if (all_segs && !empty_debug_line) |
| 2620 | as_fatal ("duplicate .debug_line sections"); |
| 2621 | |
| 2622 | if ((!all_segs && emit_other_sections) |
| 2623 | || (!emit_other_sections && !empty_debug_line)) |
| 2624 | /* If there is no line information and no non-empty .debug_info |
| 2625 | section, or if there is both a non-empty .debug_info and a non-empty |
| 2626 | .debug_line, then we do nothing. */ |
| 2627 | return; |
| 2628 | |
| 2629 | /* Calculate the size of an address for the target machine. */ |
| 2630 | sizeof_address = DWARF2_ADDR_SIZE (stdoutput); |
| 2631 | |
| 2632 | /* Create and switch to the line number section. */ |
| 2633 | line_seg = subseg_new (".debug_line", 0); |
| 2634 | bfd_set_section_flags (line_seg, SEC_READONLY | SEC_DEBUGGING | SEC_OCTETS); |
| 2635 | |
| 2636 | /* For each subsection, chain the debug entries together. */ |
| 2637 | for (s = all_segs; s; s = s->next) |
| 2638 | { |
| 2639 | struct line_subseg *lss = s->head; |
| 2640 | struct line_entry **ptail = lss->ptail; |
| 2641 | |
| 2642 | /* Reset the initial view of the first subsection of the |
| 2643 | section. */ |
| 2644 | if (lss->head && lss->head->loc.view) |
| 2645 | set_or_check_view (lss->head, NULL, NULL); |
| 2646 | |
| 2647 | while ((lss = lss->next) != NULL) |
| 2648 | { |
| 2649 | /* Link the first view of subsequent subsections to the |
| 2650 | previous view. */ |
| 2651 | if (lss->head && lss->head->loc.view) |
| 2652 | set_or_check_view (lss->head, |
| 2653 | !s->head ? NULL : (struct line_entry *)ptail, |
| 2654 | s->head ? s->head->head : NULL); |
| 2655 | *ptail = lss->head; |
| 2656 | ptail = lss->ptail; |
| 2657 | } |
| 2658 | } |
| 2659 | |
| 2660 | out_debug_line (line_seg); |
| 2661 | |
| 2662 | /* If this is assembler generated line info, and there is no |
| 2663 | debug_info already, we need .debug_info, .debug_abbrev and |
| 2664 | .debug_str sections as well. */ |
| 2665 | if (emit_other_sections) |
| 2666 | { |
| 2667 | segT abbrev_seg; |
| 2668 | segT aranges_seg; |
| 2669 | segT ranges_seg; |
| 2670 | segT str_seg; |
| 2671 | symbolS *name_sym, *comp_dir_sym, *producer_sym; |
| 2672 | |
| 2673 | gas_assert (all_segs); |
| 2674 | |
| 2675 | info_seg = subseg_new (".debug_info", 0); |
| 2676 | abbrev_seg = subseg_new (".debug_abbrev", 0); |
| 2677 | aranges_seg = subseg_new (".debug_aranges", 0); |
| 2678 | str_seg = subseg_new (".debug_str", 0); |
| 2679 | |
| 2680 | bfd_set_section_flags (info_seg, |
| 2681 | SEC_READONLY | SEC_DEBUGGING | SEC_OCTETS); |
| 2682 | bfd_set_section_flags (abbrev_seg, |
| 2683 | SEC_READONLY | SEC_DEBUGGING | SEC_OCTETS); |
| 2684 | bfd_set_section_flags (aranges_seg, |
| 2685 | SEC_READONLY | SEC_DEBUGGING | SEC_OCTETS); |
| 2686 | bfd_set_section_flags (str_seg, |
| 2687 | SEC_READONLY | SEC_DEBUGGING | SEC_OCTETS |
| 2688 | | SEC_MERGE | SEC_STRINGS); |
| 2689 | str_seg->entsize = 1; |
| 2690 | |
| 2691 | record_alignment (aranges_seg, ffs (2 * sizeof_address) - 1); |
| 2692 | |
| 2693 | if (all_segs->next == NULL) |
| 2694 | ranges_seg = NULL; |
| 2695 | else |
| 2696 | { |
| 2697 | ranges_seg = subseg_new (".debug_ranges", 0); |
| 2698 | bfd_set_section_flags (ranges_seg, |
| 2699 | SEC_READONLY | SEC_DEBUGGING | SEC_OCTETS); |
| 2700 | record_alignment (ranges_seg, ffs (2 * sizeof_address) - 1); |
| 2701 | out_debug_ranges (ranges_seg); |
| 2702 | } |
| 2703 | |
| 2704 | out_debug_aranges (aranges_seg, info_seg); |
| 2705 | out_debug_abbrev (abbrev_seg, info_seg, line_seg); |
| 2706 | out_debug_str (str_seg, &name_sym, &comp_dir_sym, &producer_sym); |
| 2707 | out_debug_info (info_seg, abbrev_seg, line_seg, ranges_seg, |
| 2708 | name_sym, comp_dir_sym, producer_sym); |
| 2709 | } |
| 2710 | } |
| 2711 | |
| 2712 | /* Perform any deferred checks pertaining to debug information. */ |
| 2713 | |
| 2714 | void |
| 2715 | dwarf2dbg_final_check (void) |
| 2716 | { |
| 2717 | /* Perform reset-view checks. Don't evaluate view_assert_failed |
| 2718 | recursively: it could be very deep. It's a chain of adds, with |
| 2719 | each chain element pointing to the next in X_add_symbol, and |
| 2720 | holding the check value in X_op_symbol. */ |
| 2721 | while (view_assert_failed) |
| 2722 | { |
| 2723 | expressionS *exp; |
| 2724 | symbolS *sym; |
| 2725 | offsetT failed; |
| 2726 | |
| 2727 | gas_assert (!symbol_resolved_p (view_assert_failed)); |
| 2728 | |
| 2729 | exp = symbol_get_value_expression (view_assert_failed); |
| 2730 | sym = view_assert_failed; |
| 2731 | |
| 2732 | /* If view_assert_failed looks like a compound check in the |
| 2733 | chain, break it up. */ |
| 2734 | if (exp->X_op == O_add && exp->X_add_number == 0 && exp->X_unsigned) |
| 2735 | { |
| 2736 | view_assert_failed = exp->X_add_symbol; |
| 2737 | sym = exp->X_op_symbol; |
| 2738 | } |
| 2739 | else |
| 2740 | view_assert_failed = NULL; |
| 2741 | |
| 2742 | failed = resolve_symbol_value (sym); |
| 2743 | if (!symbol_resolved_p (sym) || failed) |
| 2744 | { |
| 2745 | as_bad (_("view number mismatch")); |
| 2746 | break; |
| 2747 | } |
| 2748 | } |
| 2749 | } |