1 // dwarf_reader.cc -- parse dwarf2/3 debug information
3 // Copyright 2007 Free Software Foundation, Inc.
4 // Written by Ian Lance Taylor <iant@google.com>.
6 // This file is part of gold.
8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
10 // the Free Software Foundation; either version 3 of the License, or
11 // (at your option) any later version.
13 // This program is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License
19 // along with this program; if not, write to the Free Software
20 // Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 // MA 02110-1301, USA.
25 #include "elfcpp_swap.h"
28 #include "parameters.h"
30 #include "dwarf_reader.h"
34 // Read an unsigned LEB128 number. Each byte contains 7 bits of
35 // information, plus one bit saying whether the number continues or
39 read_unsigned_LEB_128(const unsigned char* buffer
, size_t* len
)
43 unsigned int shift
= 0;
50 result
|= (static_cast<uint64_t>(byte
& 0x7f)) << shift
;
60 // Read a signed LEB128 number. These are like regular LEB128
61 // numbers, except the last byte may have a sign bit set.
64 read_signed_LEB_128(const unsigned char* buffer
, size_t* len
)
75 result
|= (static_cast<uint64_t>(byte
& 0x7f) << shift
);
80 if ((shift
< 8 * static_cast<int>(sizeof(result
))) && (byte
& 0x40))
81 result
|= -((static_cast<int64_t>(1)) << shift
);
86 } // End anonymous namespace.
91 // This is the format of a DWARF2/3 line state machine that we process
92 // opcodes using. There is no need for anything outside the lineinfo
93 // processor to know how this works.
95 struct LineStateMachine
101 unsigned int shndx
; // the section address refers to
102 bool is_stmt
; // stmt means statement.
108 ResetLineStateMachine(struct LineStateMachine
* lsm
, bool default_is_stmt
)
115 lsm
->is_stmt
= default_is_stmt
;
116 lsm
->basic_block
= false;
117 lsm
->end_sequence
= false;
120 template<int size
, bool big_endian
>
121 Sized_dwarf_line_info
<size
, big_endian
>::Sized_dwarf_line_info(Object
* object
)
122 : data_valid_(false), buffer_(NULL
), symtab_buffer_(NULL
),
123 directories_(), files_(), current_header_index_(-1)
125 unsigned int debug_shndx
;
126 for (debug_shndx
= 0; debug_shndx
< object
->shnum(); ++debug_shndx
)
127 if (object
->section_name(debug_shndx
) == ".debug_line")
130 this->buffer_
= object
->section_contents(
131 debug_shndx
, &buffer_size
, false);
132 this->buffer_end_
= this->buffer_
+ buffer_size
;
135 if (this->buffer_
== NULL
)
138 // Find the relocation section for ".debug_line".
139 // We expect these for relobjs (.o's) but not dynobjs (.so's).
140 bool got_relocs
= false;
141 for (unsigned int reloc_shndx
= 0;
142 reloc_shndx
< object
->shnum();
145 unsigned int reloc_sh_type
= object
->section_type(reloc_shndx
);
146 if ((reloc_sh_type
== elfcpp::SHT_REL
147 || reloc_sh_type
== elfcpp::SHT_RELA
)
148 && object
->section_info(reloc_shndx
) == debug_shndx
)
150 got_relocs
= this->track_relocs_
.initialize(object
, reloc_shndx
,
156 // Finally, we need the symtab section to interpret the relocs.
159 unsigned int symtab_shndx
;
160 for (symtab_shndx
= 0; symtab_shndx
< object
->shnum(); ++symtab_shndx
)
161 if (object
->section_type(symtab_shndx
) == elfcpp::SHT_SYMTAB
)
163 this->symtab_buffer_
= object
->section_contents(
164 symtab_shndx
, &this->symtab_buffer_size_
, false);
167 if (this->symtab_buffer_
== NULL
)
171 // Now that we have successfully read all the data, parse the debug
173 this->data_valid_
= true;
174 this->read_line_mappings();
177 // Read the DWARF header.
179 template<int size
, bool big_endian
>
181 Sized_dwarf_line_info
<size
, big_endian
>::read_header_prolog(
182 const unsigned char* lineptr
)
184 uint32_t initial_length
= elfcpp::Swap
<32, big_endian
>::readval(lineptr
);
187 // In DWARF2/3, if the initial length is all 1 bits, then the offset
188 // size is 8 and we need to read the next 8 bytes for the real length.
189 if (initial_length
== 0xffffffff)
191 header_
.offset_size
= 8;
192 initial_length
= elfcpp::Swap
<64, big_endian
>::readval(lineptr
);
196 header_
.offset_size
= 4;
198 header_
.total_length
= initial_length
;
200 gold_assert(lineptr
+ header_
.total_length
<= buffer_end_
);
202 header_
.version
= elfcpp::Swap
<16, big_endian
>::readval(lineptr
);
205 if (header_
.offset_size
== 4)
206 header_
.prologue_length
= elfcpp::Swap
<32, big_endian
>::readval(lineptr
);
208 header_
.prologue_length
= elfcpp::Swap
<64, big_endian
>::readval(lineptr
);
209 lineptr
+= header_
.offset_size
;
211 header_
.min_insn_length
= *lineptr
;
214 header_
.default_is_stmt
= *lineptr
;
217 header_
.line_base
= *reinterpret_cast<const signed char*>(lineptr
);
220 header_
.line_range
= *lineptr
;
223 header_
.opcode_base
= *lineptr
;
226 header_
.std_opcode_lengths
.reserve(header_
.opcode_base
+ 1);
227 header_
.std_opcode_lengths
[0] = 0;
228 for (int i
= 1; i
< header_
.opcode_base
; i
++)
230 header_
.std_opcode_lengths
[i
] = *lineptr
;
237 // The header for a debug_line section is mildly complicated, because
238 // the line info is very tightly encoded.
240 template<int size
, bool big_endian
>
242 Sized_dwarf_line_info
<size
, big_endian
>::read_header_tables(
243 const unsigned char* lineptr
)
245 ++this->current_header_index_
;
247 // Create a new directories_ entry and a new files_ entry for our new
248 // header. We initialize each with a single empty element, because
249 // dwarf indexes directory and filenames starting at 1.
250 gold_assert(static_cast<int>(this->directories_
.size())
251 == this->current_header_index_
);
252 gold_assert(static_cast<int>(this->files_
.size())
253 == this->current_header_index_
);
254 this->directories_
.push_back(std::vector
<std::string
>(1));
255 this->files_
.push_back(std::vector
<std::pair
<int, std::string
> >(1));
257 // It is legal for the directory entry table to be empty.
263 const char* dirname
= reinterpret_cast<const char*>(lineptr
);
265 == static_cast<int>(this->directories_
.back().size()));
266 this->directories_
.back().push_back(dirname
);
267 lineptr
+= this->directories_
.back().back().size() + 1;
273 // It is also legal for the file entry table to be empty.
280 const char* filename
= reinterpret_cast<const char*>(lineptr
);
281 lineptr
+= strlen(filename
) + 1;
283 uint64_t dirindex
= read_unsigned_LEB_128(lineptr
, &len
);
286 if (dirindex
>= this->directories_
.back().size())
288 int dirindexi
= static_cast<int>(dirindex
);
290 read_unsigned_LEB_128(lineptr
, &len
); // mod_time
293 read_unsigned_LEB_128(lineptr
, &len
); // filelength
296 gold_assert(fileindex
297 == static_cast<int>(this->files_
.back().size()));
298 this->files_
.back().push_back(std::make_pair(dirindexi
, filename
));
307 // Process a single opcode in the .debug.line structure.
309 // Templating on size and big_endian would yield more efficient (and
310 // simpler) code, but would bloat the binary. Speed isn't important
313 template<int size
, bool big_endian
>
315 Sized_dwarf_line_info
<size
, big_endian
>::process_one_opcode(
316 const unsigned char* start
, struct LineStateMachine
* lsm
, size_t* len
)
320 unsigned char opcode
= *start
;
324 // If the opcode is great than the opcode_base, it is a special
325 // opcode. Most line programs consist mainly of special opcodes.
326 if (opcode
>= header_
.opcode_base
)
328 opcode
-= header_
.opcode_base
;
329 const int advance_address
= ((opcode
/ header_
.line_range
)
330 * header_
.min_insn_length
);
331 lsm
->address
+= advance_address
;
333 const int advance_line
= ((opcode
% header_
.line_range
)
334 + header_
.line_base
);
335 lsm
->line_num
+= advance_line
;
336 lsm
->basic_block
= true;
341 // Otherwise, we have the regular opcodes
344 case elfcpp::DW_LNS_copy
:
345 lsm
->basic_block
= false;
349 case elfcpp::DW_LNS_advance_pc
:
351 const uint64_t advance_address
352 = read_unsigned_LEB_128(start
, &templen
);
354 lsm
->address
+= header_
.min_insn_length
* advance_address
;
358 case elfcpp::DW_LNS_advance_line
:
360 const uint64_t advance_line
= read_signed_LEB_128(start
, &templen
);
362 lsm
->line_num
+= advance_line
;
366 case elfcpp::DW_LNS_set_file
:
368 const uint64_t fileno
= read_unsigned_LEB_128(start
, &templen
);
370 lsm
->file_num
= fileno
;
374 case elfcpp::DW_LNS_set_column
:
376 const uint64_t colno
= read_unsigned_LEB_128(start
, &templen
);
378 lsm
->column_num
= colno
;
382 case elfcpp::DW_LNS_negate_stmt
:
383 lsm
->is_stmt
= !lsm
->is_stmt
;
386 case elfcpp::DW_LNS_set_basic_block
:
387 lsm
->basic_block
= true;
390 case elfcpp::DW_LNS_fixed_advance_pc
:
393 advance_address
= elfcpp::Swap
<16, big_endian
>::readval(start
);
395 lsm
->address
+= advance_address
;
399 case elfcpp::DW_LNS_const_add_pc
:
401 const int advance_address
= (header_
.min_insn_length
402 * ((255 - header_
.opcode_base
)
403 / header_
.line_range
));
404 lsm
->address
+= advance_address
;
408 case elfcpp::DW_LNS_extended_op
:
410 const uint64_t extended_op_len
411 = read_unsigned_LEB_128(start
, &templen
);
413 oplen
+= templen
+ extended_op_len
;
415 const unsigned char extended_op
= *start
;
420 case elfcpp::DW_LNE_end_sequence
:
421 // This means that the current byte is the one immediately
422 // after a set of instructions. Record the current line
423 // for up to one less than the current address.
425 lsm
->end_sequence
= true;
429 case elfcpp::DW_LNE_set_address
:
431 lsm
->address
= elfcpp::Swap
<size
, big_endian
>::readval(start
);
432 typename
Reloc_map::const_iterator it
433 = reloc_map_
.find(start
- this->buffer_
);
434 if (it
!= reloc_map_
.end())
437 lsm
->address
+= it
->second
.second
;
438 lsm
->shndx
= it
->second
.first
;
442 // If we're a normal .o file, with relocs, every
443 // set_address should have an associated relocation.
444 if (this->input_is_relobj())
445 this->data_valid_
= false;
449 case elfcpp::DW_LNE_define_file
:
451 const char* filename
= reinterpret_cast<const char*>(start
);
452 templen
= strlen(filename
) + 1;
455 uint64_t dirindex
= read_unsigned_LEB_128(start
, &templen
);
458 if (dirindex
>= this->directories_
.back().size())
460 int dirindexi
= static_cast<int>(dirindex
);
462 read_unsigned_LEB_128(start
, &templen
); // mod_time
465 read_unsigned_LEB_128(start
, &templen
); // filelength
468 this->files_
.back().push_back(std::make_pair(dirindexi
,
478 // Ignore unknown opcode silently
479 for (int i
= 0; i
< header_
.std_opcode_lengths
[opcode
]; i
++)
482 read_unsigned_LEB_128(start
, &templen
);
493 // Read the debug information at LINEPTR and store it in the line
496 template<int size
, bool big_endian
>
498 Sized_dwarf_line_info
<size
, big_endian
>::read_lines(unsigned const char* lineptr
)
500 struct LineStateMachine lsm
;
502 // LENGTHSTART is the place the length field is based on. It is the
503 // point in the header after the initial length field.
504 const unsigned char* lengthstart
= buffer_
;
506 // In 64 bit dwarf, the initial length is 12 bytes, because of the
507 // 0xffffffff at the start.
508 if (header_
.offset_size
== 8)
513 while (lineptr
< lengthstart
+ header_
.total_length
)
515 ResetLineStateMachine(&lsm
, header_
.default_is_stmt
);
516 while (!lsm
.end_sequence
)
519 bool add_line
= this->process_one_opcode(lineptr
, &lsm
, &oplength
);
522 Offset_to_lineno_entry entry
523 = { lsm
.address
, this->current_header_index_
,
524 lsm
.file_num
, lsm
.line_num
};
525 line_number_map_
[lsm
.shndx
].push_back(entry
);
531 return lengthstart
+ header_
.total_length
;
534 // Looks in the symtab to see what section a symbol is in.
536 template<int size
, bool big_endian
>
538 Sized_dwarf_line_info
<size
, big_endian
>::symbol_section(
540 typename
elfcpp::Elf_types
<size
>::Elf_Addr
* value
)
542 const int symsize
= elfcpp::Elf_sizes
<size
>::sym_size
;
543 gold_assert(sym
* symsize
< this->symtab_buffer_size_
);
544 elfcpp::Sym
<size
, big_endian
> elfsym(this->symtab_buffer_
+ sym
* symsize
);
545 *value
= elfsym
.get_st_value();
546 return elfsym
.get_st_shndx();
549 // Read the relocations into a Reloc_map.
551 template<int size
, bool big_endian
>
553 Sized_dwarf_line_info
<size
, big_endian
>::read_relocs()
555 if (this->symtab_buffer_
== NULL
)
558 typename
elfcpp::Elf_types
<size
>::Elf_Addr value
;
560 while ((reloc_offset
= this->track_relocs_
.next_offset()) != -1)
562 const unsigned int sym
= this->track_relocs_
.next_symndx();
563 const unsigned int shndx
= this->symbol_section(sym
, &value
);
564 this->reloc_map_
[reloc_offset
] = std::make_pair(shndx
, value
);
565 this->track_relocs_
.advance(reloc_offset
+ 1);
569 // Read the line number info.
571 template<int size
, bool big_endian
>
573 Sized_dwarf_line_info
<size
, big_endian
>::read_line_mappings()
575 gold_assert(this->data_valid_
== true);
578 while (this->buffer_
< this->buffer_end_
)
580 const unsigned char* lineptr
= this->buffer_
;
581 lineptr
= this->read_header_prolog(lineptr
);
582 lineptr
= this->read_header_tables(lineptr
);
583 lineptr
= this->read_lines(lineptr
);
584 this->buffer_
= lineptr
;
587 // Sort the lines numbers, so addr2line can use binary search.
588 for (typename
Lineno_map::iterator it
= line_number_map_
.begin();
589 it
!= line_number_map_
.end();
591 // Each vector needs to be sorted by offset.
592 std::sort(it
->second
.begin(), it
->second
.end());
595 // Some processing depends on whether the input is a .o file or not.
596 // For instance, .o files have relocs, and have .debug_lines
597 // information on a per section basis. .so files, on the other hand,
598 // lack relocs, and offsets are unique, so we can ignore the section
601 template<int size
, bool big_endian
>
603 Sized_dwarf_line_info
<size
, big_endian
>::input_is_relobj()
605 // Only .o files have relocs and the symtab buffer that goes with them.
606 return this->symtab_buffer_
!= NULL
;
609 // Given an Offset_to_lineno_entry vector, and an offset, figure out
610 // if the offset points into a function according to the vector (see
611 // comments below for the algorithm). If it does, return an iterator
612 // into the vector that points to the line-number that contains that
613 // offset. If not, it returns vector::end().
615 static std::vector
<Offset_to_lineno_entry
>::const_iterator
616 offset_to_iterator(const std::vector
<Offset_to_lineno_entry
>* offsets
,
619 const Offset_to_lineno_entry lookup_key
= { offset
, 0, 0, 0 };
621 // lower_bound() returns the smallest offset which is >= lookup_key.
622 // If no offset in offsets is >= lookup_key, returns end().
623 std::vector
<Offset_to_lineno_entry
>::const_iterator it
624 = std::lower_bound(offsets
->begin(), offsets
->end(), lookup_key
);
626 // This code is easiest to understand with a concrete example.
627 // Here's a possible offsets array:
628 // {{offset = 3211, header_num = 0, file_num = 1, line_num = 16}, // 0
629 // {offset = 3224, header_num = 0, file_num = 1, line_num = 20}, // 1
630 // {offset = 3226, header_num = 0, file_num = 1, line_num = 22}, // 2
631 // {offset = 3231, header_num = 0, file_num = 1, line_num = 25}, // 3
632 // {offset = 3232, header_num = 0, file_num = 1, line_num = -1}, // 4
633 // {offset = 3232, header_num = 0, file_num = 1, line_num = 65}, // 5
634 // {offset = 3235, header_num = 0, file_num = 1, line_num = 66}, // 6
635 // {offset = 3236, header_num = 0, file_num = 1, line_num = -1}, // 7
636 // {offset = 5764, header_num = 0, file_num = 1, line_num = 47}, // 8
637 // {offset = 5765, header_num = 0, file_num = 1, line_num = 48}, // 9
638 // {offset = 5767, header_num = 0, file_num = 1, line_num = 49}, // 10
639 // {offset = 5768, header_num = 0, file_num = 1, line_num = 50}, // 11
640 // {offset = 5773, header_num = 0, file_num = 1, line_num = -1}, // 12
641 // {offset = 5787, header_num = 1, file_num = 1, line_num = 19}, // 13
642 // {offset = 5790, header_num = 1, file_num = 1, line_num = 20}, // 14
643 // {offset = 5793, header_num = 1, file_num = 1, line_num = 67}, // 15
644 // {offset = 5793, header_num = 1, file_num = 1, line_num = -1}, // 16
645 // {offset = 5795, header_num = 1, file_num = 1, line_num = 68}, // 17
646 // {offset = 5798, header_num = 1, file_num = 1, line_num = -1}, // 18
647 // The entries with line_num == -1 mark the end of a function: the
648 // associated offset is one past the last instruction in the
649 // function. This can correspond to the beginning of the next
650 // function (as is true for offset 3232); alternately, there can be
651 // a gap between the end of one function and the start of the next
652 // (as is true for some others, most obviously from 3236->5764).
654 // Case 1: lookup_key has offset == 10. lower_bound returns
655 // offsets[0]. Since it's not an exact match and we're
656 // at the beginning of offsets, we return end() (invalid).
657 // Case 2: lookup_key has offset 10000. lower_bound returns
658 // offset[19] (end()). We return end() (invalid).
659 // Case 3: lookup_key has offset == 3211. lower_bound matches
660 // offsets[0] exactly, and that's the entry we return.
661 // Case 4: lookup_key has offset == 3232. lower_bound returns
662 // offsets[4]. That's an exact match, but indicates
663 // end-of-function. We check if offsets[5] is also an
664 // exact match but not end-of-function. It is, so we
665 // return offsets[5].
666 // Case 5: lookup_key has offset == 3214. lower_bound returns
667 // offsets[1]. Since it's not an exact match, we back
668 // up to the offset that's < lookup_key, offsets[0].
669 // We note offsets[0] is a valid entry (not end-of-function),
670 // so that's the entry we return.
671 // Case 6: lookup_key has offset == 4000. lower_bound returns
672 // offsets[8]. Since it's not an exact match, we back
673 // up to offsets[7]. Since offsets[7] indicates
674 // end-of-function, we know lookup_key is between
675 // functions, so we return end() (not a valid offset).
676 // Case 7: lookup_key has offset == 5794. lower_bound returns
677 // offsets[17]. Since it's not an exact match, we back
678 // up to offsets[15]. Note we back up to the *first*
679 // entry with offset 5793, not just offsets[17-1].
680 // We note offsets[15] is a valid entry, so we return it.
681 // If offsets[15] had had line_num == -1, we would have
682 // checked offsets[16]. The reason for this is that
683 // 15 and 16 can be in an arbitrary order, since we sort
684 // only by offset. (Note it doesn't help to use line_number
685 // as a secondary sort key, since sometimes we want the -1
686 // to be first and sometimes we want it to be last.)
688 // This deals with cases (1) and (2).
689 if ((it
== offsets
->begin() && offset
< it
->offset
)
690 || it
== offsets
->end())
691 return offsets
->end();
693 // This deals with cases (3) and (4).
694 if (offset
== it
->offset
)
696 while (it
!= offsets
->end()
697 && it
->offset
== offset
698 && it
->line_num
== -1)
700 if (it
== offsets
->end() || it
->offset
!= offset
)
701 return offsets
->end();
706 // This handles the first part of case (7) -- we back up to the
707 // *first* entry that has the offset that's behind us.
708 gold_assert(it
!= offsets
->begin());
709 std::vector
<Offset_to_lineno_entry
>::const_iterator range_end
= it
;
711 const off_t range_value
= it
->offset
;
712 while (it
!= offsets
->begin() && (it
-1)->offset
== range_value
)
715 // This handles cases (5), (6), and (7): if any entry in the
716 // equal_range [it, range_end) has a line_num != -1, it's a valid
717 // match. If not, we're not in a function.
718 for (; it
!= range_end
; ++it
)
719 if (it
->line_num
!= -1)
721 return offsets
->end();
724 // Return a string for a file name and line number.
726 template<int size
, bool big_endian
>
728 Sized_dwarf_line_info
<size
, big_endian
>::do_addr2line(unsigned int shndx
,
731 if (this->data_valid_
== false)
734 const std::vector
<Offset_to_lineno_entry
>* offsets
;
735 // If we do not have reloc information, then our input is a .so or
736 // some similar data structure where all the information is held in
737 // the offset. In that case, we ignore the input shndx.
738 if (this->input_is_relobj())
739 offsets
= &this->line_number_map_
[shndx
];
741 offsets
= &this->line_number_map_
[-1U];
742 if (offsets
->empty())
745 typename
std::vector
<Offset_to_lineno_entry
>::const_iterator it
746 = offset_to_iterator(offsets
, offset
);
747 if (it
== offsets
->end())
750 // Convert the file_num + line_num into a string.
753 gold_assert(it
->header_num
< static_cast<int>(this->files_
.size()));
754 gold_assert(it
->file_num
755 < static_cast<int>(this->files_
[it
->header_num
].size()));
756 const std::pair
<int, std::string
>& filename_pair
757 = this->files_
[it
->header_num
][it
->file_num
];
758 const std::string
& filename
= filename_pair
.second
;
760 gold_assert(it
->header_num
< static_cast<int>(this->directories_
.size()));
761 gold_assert(filename_pair
.first
762 < static_cast<int>(this->directories_
[it
->header_num
].size()));
763 const std::string
& dirname
764 = this->directories_
[it
->header_num
][filename_pair
.first
];
766 if (!dirname
.empty())
775 char buffer
[64]; // enough to hold a line number
776 snprintf(buffer
, sizeof(buffer
), "%d", it
->line_num
);
783 // Dwarf_line_info routines.
786 Dwarf_line_info::one_addr2line(Object
* object
,
787 unsigned int shndx
, off_t offset
)
789 if (parameters
->get_size() == 32 && !parameters
->is_big_endian())
790 #ifdef HAVE_TARGET_32_LITTLE
791 return Sized_dwarf_line_info
<32, false>(object
).addr2line(shndx
, offset
);
795 else if (parameters
->get_size() == 32 && parameters
->is_big_endian())
796 #ifdef HAVE_TARGET_32_BIG
797 return Sized_dwarf_line_info
<32, true>(object
).addr2line(shndx
, offset
);
801 else if (parameters
->get_size() == 64 && !parameters
->is_big_endian())
802 #ifdef HAVE_TARGET_64_LITTLE
803 return Sized_dwarf_line_info
<64, false>(object
).addr2line(shndx
, offset
);
807 else if (parameters
->get_size() == 64 && parameters
->is_big_endian())
808 #ifdef HAVE_TARGET_64_BIT
809 return Sized_dwarf_line_info
<64, true>(object
).addr2line(shndx
, offset
);
817 #ifdef HAVE_TARGET_32_LITTLE
819 class Sized_dwarf_line_info
<32, false>;
822 #ifdef HAVE_TARGET_32_BIG
824 class Sized_dwarf_line_info
<32, true>;
827 #ifdef HAVE_TARGET_64_LITTLE
829 class Sized_dwarf_line_info
<64, false>;
832 #ifdef HAVE_TARGET_64_BIG
834 class Sized_dwarf_line_info
<64, true>;
837 } // End namespace gold.