Subversion Repositories Kolibri OS

Rev

Rev 5197 | Blame | Compare with Previous | Last modification | View Log | RSS feed

  1. /* linker.c -- BFD linker routines
  2.    Copyright (C) 1993-2015 Free Software Foundation, Inc.
  3.    Written by Steve Chamberlain and Ian Lance Taylor, Cygnus Support
  4.  
  5.    This file is part of BFD, the Binary File Descriptor library.
  6.  
  7.    This program 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 of the License, or
  10.    (at your option) any later version.
  11.  
  12.    This program 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 this program; if not, write to the Free Software
  19.    Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
  20.    MA 02110-1301, USA.  */
  21.  
  22. #include "sysdep.h"
  23. #include "bfd.h"
  24. #include "libbfd.h"
  25. #include "bfdlink.h"
  26. #include "genlink.h"
  27.  
  28. /*
  29. SECTION
  30.         Linker Functions
  31.  
  32. @cindex Linker
  33.         The linker uses three special entry points in the BFD target
  34.         vector.  It is not necessary to write special routines for
  35.         these entry points when creating a new BFD back end, since
  36.         generic versions are provided.  However, writing them can
  37.         speed up linking and make it use significantly less runtime
  38.         memory.
  39.  
  40.         The first routine creates a hash table used by the other
  41.         routines.  The second routine adds the symbols from an object
  42.         file to the hash table.  The third routine takes all the
  43.         object files and links them together to create the output
  44.         file.  These routines are designed so that the linker proper
  45.         does not need to know anything about the symbols in the object
  46.         files that it is linking.  The linker merely arranges the
  47.         sections as directed by the linker script and lets BFD handle
  48.         the details of symbols and relocs.
  49.  
  50.         The second routine and third routines are passed a pointer to
  51.         a <<struct bfd_link_info>> structure (defined in
  52.         <<bfdlink.h>>) which holds information relevant to the link,
  53.         including the linker hash table (which was created by the
  54.         first routine) and a set of callback functions to the linker
  55.         proper.
  56.  
  57.         The generic linker routines are in <<linker.c>>, and use the
  58.         header file <<genlink.h>>.  As of this writing, the only back
  59.         ends which have implemented versions of these routines are
  60.         a.out (in <<aoutx.h>>) and ECOFF (in <<ecoff.c>>).  The a.out
  61.         routines are used as examples throughout this section.
  62.  
  63. @menu
  64. @* Creating a Linker Hash Table::
  65. @* Adding Symbols to the Hash Table::
  66. @* Performing the Final Link::
  67. @end menu
  68.  
  69. INODE
  70. Creating a Linker Hash Table, Adding Symbols to the Hash Table, Linker Functions, Linker Functions
  71. SUBSECTION
  72.         Creating a linker hash table
  73.  
  74. @cindex _bfd_link_hash_table_create in target vector
  75. @cindex target vector (_bfd_link_hash_table_create)
  76.         The linker routines must create a hash table, which must be
  77.         derived from <<struct bfd_link_hash_table>> described in
  78.         <<bfdlink.c>>.  @xref{Hash Tables}, for information on how to
  79.         create a derived hash table.  This entry point is called using
  80.         the target vector of the linker output file.
  81.  
  82.         The <<_bfd_link_hash_table_create>> entry point must allocate
  83.         and initialize an instance of the desired hash table.  If the
  84.         back end does not require any additional information to be
  85.         stored with the entries in the hash table, the entry point may
  86.         simply create a <<struct bfd_link_hash_table>>.  Most likely,
  87.         however, some additional information will be needed.
  88.  
  89.         For example, with each entry in the hash table the a.out
  90.         linker keeps the index the symbol has in the final output file
  91.         (this index number is used so that when doing a relocatable
  92.         link the symbol index used in the output file can be quickly
  93.         filled in when copying over a reloc).  The a.out linker code
  94.         defines the required structures and functions for a hash table
  95.         derived from <<struct bfd_link_hash_table>>.  The a.out linker
  96.         hash table is created by the function
  97.         <<NAME(aout,link_hash_table_create)>>; it simply allocates
  98.         space for the hash table, initializes it, and returns a
  99.         pointer to it.
  100.  
  101.         When writing the linker routines for a new back end, you will
  102.         generally not know exactly which fields will be required until
  103.         you have finished.  You should simply create a new hash table
  104.         which defines no additional fields, and then simply add fields
  105.         as they become necessary.
  106.  
  107. INODE
  108. Adding Symbols to the Hash Table, Performing the Final Link, Creating a Linker Hash Table, Linker Functions
  109. SUBSECTION
  110.         Adding symbols to the hash table
  111.  
  112. @cindex _bfd_link_add_symbols in target vector
  113. @cindex target vector (_bfd_link_add_symbols)
  114.         The linker proper will call the <<_bfd_link_add_symbols>>
  115.         entry point for each object file or archive which is to be
  116.         linked (typically these are the files named on the command
  117.         line, but some may also come from the linker script).  The
  118.         entry point is responsible for examining the file.  For an
  119.         object file, BFD must add any relevant symbol information to
  120.         the hash table.  For an archive, BFD must determine which
  121.         elements of the archive should be used and adding them to the
  122.         link.
  123.  
  124.         The a.out version of this entry point is
  125.         <<NAME(aout,link_add_symbols)>>.
  126.  
  127. @menu
  128. @* Differing file formats::
  129. @* Adding symbols from an object file::
  130. @* Adding symbols from an archive::
  131. @end menu
  132.  
  133. INODE
  134. Differing file formats, Adding symbols from an object file, Adding Symbols to the Hash Table, Adding Symbols to the Hash Table
  135. SUBSUBSECTION
  136.         Differing file formats
  137.  
  138.         Normally all the files involved in a link will be of the same
  139.         format, but it is also possible to link together different
  140.         format object files, and the back end must support that.  The
  141.         <<_bfd_link_add_symbols>> entry point is called via the target
  142.         vector of the file to be added.  This has an important
  143.         consequence: the function may not assume that the hash table
  144.         is the type created by the corresponding
  145.         <<_bfd_link_hash_table_create>> vector.  All the
  146.         <<_bfd_link_add_symbols>> function can assume about the hash
  147.         table is that it is derived from <<struct
  148.         bfd_link_hash_table>>.
  149.  
  150.         Sometimes the <<_bfd_link_add_symbols>> function must store
  151.         some information in the hash table entry to be used by the
  152.         <<_bfd_final_link>> function.  In such a case the output bfd
  153.         xvec must be checked to make sure that the hash table was
  154.         created by an object file of the same format.
  155.  
  156.         The <<_bfd_final_link>> routine must be prepared to handle a
  157.         hash entry without any extra information added by the
  158.         <<_bfd_link_add_symbols>> function.  A hash entry without
  159.         extra information will also occur when the linker script
  160.         directs the linker to create a symbol.  Note that, regardless
  161.         of how a hash table entry is added, all the fields will be
  162.         initialized to some sort of null value by the hash table entry
  163.         initialization function.
  164.  
  165.         See <<ecoff_link_add_externals>> for an example of how to
  166.         check the output bfd before saving information (in this
  167.         case, the ECOFF external symbol debugging information) in a
  168.         hash table entry.
  169.  
  170. INODE
  171. Adding symbols from an object file, Adding symbols from an archive, Differing file formats, Adding Symbols to the Hash Table
  172. SUBSUBSECTION
  173.         Adding symbols from an object file
  174.  
  175.         When the <<_bfd_link_add_symbols>> routine is passed an object
  176.         file, it must add all externally visible symbols in that
  177.         object file to the hash table.  The actual work of adding the
  178.         symbol to the hash table is normally handled by the function
  179.         <<_bfd_generic_link_add_one_symbol>>.  The
  180.         <<_bfd_link_add_symbols>> routine is responsible for reading
  181.         all the symbols from the object file and passing the correct
  182.         information to <<_bfd_generic_link_add_one_symbol>>.
  183.  
  184.         The <<_bfd_link_add_symbols>> routine should not use
  185.         <<bfd_canonicalize_symtab>> to read the symbols.  The point of
  186.         providing this routine is to avoid the overhead of converting
  187.         the symbols into generic <<asymbol>> structures.
  188.  
  189. @findex _bfd_generic_link_add_one_symbol
  190.         <<_bfd_generic_link_add_one_symbol>> handles the details of
  191.         combining common symbols, warning about multiple definitions,
  192.         and so forth.  It takes arguments which describe the symbol to
  193.         add, notably symbol flags, a section, and an offset.  The
  194.         symbol flags include such things as <<BSF_WEAK>> or
  195.         <<BSF_INDIRECT>>.  The section is a section in the object
  196.         file, or something like <<bfd_und_section_ptr>> for an undefined
  197.         symbol or <<bfd_com_section_ptr>> for a common symbol.
  198.  
  199.         If the <<_bfd_final_link>> routine is also going to need to
  200.         read the symbol information, the <<_bfd_link_add_symbols>>
  201.         routine should save it somewhere attached to the object file
  202.         BFD.  However, the information should only be saved if the
  203.         <<keep_memory>> field of the <<info>> argument is TRUE, so
  204.         that the <<-no-keep-memory>> linker switch is effective.
  205.  
  206.         The a.out function which adds symbols from an object file is
  207.         <<aout_link_add_object_symbols>>, and most of the interesting
  208.         work is in <<aout_link_add_symbols>>.  The latter saves
  209.         pointers to the hash tables entries created by
  210.         <<_bfd_generic_link_add_one_symbol>> indexed by symbol number,
  211.         so that the <<_bfd_final_link>> routine does not have to call
  212.         the hash table lookup routine to locate the entry.
  213.  
  214. INODE
  215. Adding symbols from an archive, , Adding symbols from an object file, Adding Symbols to the Hash Table
  216. SUBSUBSECTION
  217.         Adding symbols from an archive
  218.  
  219.         When the <<_bfd_link_add_symbols>> routine is passed an
  220.         archive, it must look through the symbols defined by the
  221.         archive and decide which elements of the archive should be
  222.         included in the link.  For each such element it must call the
  223.         <<add_archive_element>> linker callback, and it must add the
  224.         symbols from the object file to the linker hash table.  (The
  225.         callback may in fact indicate that a replacement BFD should be
  226.         used, in which case the symbols from that BFD should be added
  227.         to the linker hash table instead.)
  228.  
  229. @findex _bfd_generic_link_add_archive_symbols
  230.         In most cases the work of looking through the symbols in the
  231.         archive should be done by the
  232.         <<_bfd_generic_link_add_archive_symbols>> function.
  233.         <<_bfd_generic_link_add_archive_symbols>> is passed a function
  234.         to call to make the final decision about adding an archive
  235.         element to the link and to do the actual work of adding the
  236.         symbols to the linker hash table.  If the element is to
  237.         be included, the <<add_archive_element>> linker callback
  238.         routine must be called with the element as an argument, and
  239.         the element's symbols must be added to the linker hash table
  240.         just as though the element had itself been passed to the
  241.         <<_bfd_link_add_symbols>> function.
  242.  
  243.         When the a.out <<_bfd_link_add_symbols>> function receives an
  244.         archive, it calls <<_bfd_generic_link_add_archive_symbols>>
  245.         passing <<aout_link_check_archive_element>> as the function
  246.         argument. <<aout_link_check_archive_element>> calls
  247.         <<aout_link_check_ar_symbols>>.  If the latter decides to add
  248.         the element (an element is only added if it provides a real,
  249.         non-common, definition for a previously undefined or common
  250.         symbol) it calls the <<add_archive_element>> callback and then
  251.         <<aout_link_check_archive_element>> calls
  252.         <<aout_link_add_symbols>> to actually add the symbols to the
  253.         linker hash table - possibly those of a substitute BFD, if the
  254.         <<add_archive_element>> callback avails itself of that option.
  255.  
  256.         The ECOFF back end is unusual in that it does not normally
  257.         call <<_bfd_generic_link_add_archive_symbols>>, because ECOFF
  258.         archives already contain a hash table of symbols.  The ECOFF
  259.         back end searches the archive itself to avoid the overhead of
  260.         creating a new hash table.
  261.  
  262. INODE
  263. Performing the Final Link, , Adding Symbols to the Hash Table, Linker Functions
  264. SUBSECTION
  265.         Performing the final link
  266.  
  267. @cindex _bfd_link_final_link in target vector
  268. @cindex target vector (_bfd_final_link)
  269.         When all the input files have been processed, the linker calls
  270.         the <<_bfd_final_link>> entry point of the output BFD.  This
  271.         routine is responsible for producing the final output file,
  272.         which has several aspects.  It must relocate the contents of
  273.         the input sections and copy the data into the output sections.
  274.         It must build an output symbol table including any local
  275.         symbols from the input files and the global symbols from the
  276.         hash table.  When producing relocatable output, it must
  277.         modify the input relocs and write them into the output file.
  278.         There may also be object format dependent work to be done.
  279.  
  280.         The linker will also call the <<write_object_contents>> entry
  281.         point when the BFD is closed.  The two entry points must work
  282.         together in order to produce the correct output file.
  283.  
  284.         The details of how this works are inevitably dependent upon
  285.         the specific object file format.  The a.out
  286.         <<_bfd_final_link>> routine is <<NAME(aout,final_link)>>.
  287.  
  288. @menu
  289. @* Information provided by the linker::
  290. @* Relocating the section contents::
  291. @* Writing the symbol table::
  292. @end menu
  293.  
  294. INODE
  295. Information provided by the linker, Relocating the section contents, Performing the Final Link, Performing the Final Link
  296. SUBSUBSECTION
  297.         Information provided by the linker
  298.  
  299.         Before the linker calls the <<_bfd_final_link>> entry point,
  300.         it sets up some data structures for the function to use.
  301.  
  302.         The <<input_bfds>> field of the <<bfd_link_info>> structure
  303.         will point to a list of all the input files included in the
  304.         link.  These files are linked through the <<link.next>> field
  305.         of the <<bfd>> structure.
  306.  
  307.         Each section in the output file will have a list of
  308.         <<link_order>> structures attached to the <<map_head.link_order>>
  309.         field (the <<link_order>> structure is defined in
  310.         <<bfdlink.h>>).  These structures describe how to create the
  311.         contents of the output section in terms of the contents of
  312.         various input sections, fill constants, and, eventually, other
  313.         types of information.  They also describe relocs that must be
  314.         created by the BFD backend, but do not correspond to any input
  315.         file; this is used to support -Ur, which builds constructors
  316.         while generating a relocatable object file.
  317.  
  318. INODE
  319. Relocating the section contents, Writing the symbol table, Information provided by the linker, Performing the Final Link
  320. SUBSUBSECTION
  321.         Relocating the section contents
  322.  
  323.         The <<_bfd_final_link>> function should look through the
  324.         <<link_order>> structures attached to each section of the
  325.         output file.  Each <<link_order>> structure should either be
  326.         handled specially, or it should be passed to the function
  327.         <<_bfd_default_link_order>> which will do the right thing
  328.         (<<_bfd_default_link_order>> is defined in <<linker.c>>).
  329.  
  330.         For efficiency, a <<link_order>> of type
  331.         <<bfd_indirect_link_order>> whose associated section belongs
  332.         to a BFD of the same format as the output BFD must be handled
  333.         specially.  This type of <<link_order>> describes part of an
  334.         output section in terms of a section belonging to one of the
  335.         input files.  The <<_bfd_final_link>> function should read the
  336.         contents of the section and any associated relocs, apply the
  337.         relocs to the section contents, and write out the modified
  338.         section contents.  If performing a relocatable link, the
  339.         relocs themselves must also be modified and written out.
  340.  
  341. @findex _bfd_relocate_contents
  342. @findex _bfd_final_link_relocate
  343.         The functions <<_bfd_relocate_contents>> and
  344.         <<_bfd_final_link_relocate>> provide some general support for
  345.         performing the actual relocations, notably overflow checking.
  346.         Their arguments include information about the symbol the
  347.         relocation is against and a <<reloc_howto_type>> argument
  348.         which describes the relocation to perform.  These functions
  349.         are defined in <<reloc.c>>.
  350.  
  351.         The a.out function which handles reading, relocating, and
  352.         writing section contents is <<aout_link_input_section>>.  The
  353.         actual relocation is done in <<aout_link_input_section_std>>
  354.         and <<aout_link_input_section_ext>>.
  355.  
  356. INODE
  357. Writing the symbol table, , Relocating the section contents, Performing the Final Link
  358. SUBSUBSECTION
  359.         Writing the symbol table
  360.  
  361.         The <<_bfd_final_link>> function must gather all the symbols
  362.         in the input files and write them out.  It must also write out
  363.         all the symbols in the global hash table.  This must be
  364.         controlled by the <<strip>> and <<discard>> fields of the
  365.         <<bfd_link_info>> structure.
  366.  
  367.         The local symbols of the input files will not have been
  368.         entered into the linker hash table.  The <<_bfd_final_link>>
  369.         routine must consider each input file and include the symbols
  370.         in the output file.  It may be convenient to do this when
  371.         looking through the <<link_order>> structures, or it may be
  372.         done by stepping through the <<input_bfds>> list.
  373.  
  374.         The <<_bfd_final_link>> routine must also traverse the global
  375.         hash table to gather all the externally visible symbols.  It
  376.         is possible that most of the externally visible symbols may be
  377.         written out when considering the symbols of each input file,
  378.         but it is still necessary to traverse the hash table since the
  379.         linker script may have defined some symbols that are not in
  380.         any of the input files.
  381.  
  382.         The <<strip>> field of the <<bfd_link_info>> structure
  383.         controls which symbols are written out.  The possible values
  384.         are listed in <<bfdlink.h>>.  If the value is <<strip_some>>,
  385.         then the <<keep_hash>> field of the <<bfd_link_info>>
  386.         structure is a hash table of symbols to keep; each symbol
  387.         should be looked up in this hash table, and only symbols which
  388.         are present should be included in the output file.
  389.  
  390.         If the <<strip>> field of the <<bfd_link_info>> structure
  391.         permits local symbols to be written out, the <<discard>> field
  392.         is used to further controls which local symbols are included
  393.         in the output file.  If the value is <<discard_l>>, then all
  394.         local symbols which begin with a certain prefix are discarded;
  395.         this is controlled by the <<bfd_is_local_label_name>> entry point.
  396.  
  397.         The a.out backend handles symbols by calling
  398.         <<aout_link_write_symbols>> on each input BFD and then
  399.         traversing the global hash table with the function
  400.         <<aout_link_write_other_symbol>>.  It builds a string table
  401.         while writing out the symbols, which is written to the output
  402.         file at the end of <<NAME(aout,final_link)>>.
  403. */
  404.  
  405. static bfd_boolean generic_link_add_object_symbols
  406.   (bfd *, struct bfd_link_info *, bfd_boolean collect);
  407. static bfd_boolean generic_link_add_symbols
  408.   (bfd *, struct bfd_link_info *, bfd_boolean);
  409. static bfd_boolean generic_link_check_archive_element_no_collect
  410.   (bfd *, struct bfd_link_info *, struct bfd_link_hash_entry *, const char *,
  411.    bfd_boolean *);
  412. static bfd_boolean generic_link_check_archive_element_collect
  413.   (bfd *, struct bfd_link_info *, struct bfd_link_hash_entry *, const char *,
  414.    bfd_boolean *);
  415. static bfd_boolean generic_link_check_archive_element
  416.   (bfd *, struct bfd_link_info *, struct bfd_link_hash_entry *, const char *,
  417.    bfd_boolean *, bfd_boolean);
  418. static bfd_boolean generic_link_add_symbol_list
  419.   (bfd *, struct bfd_link_info *, bfd_size_type count, asymbol **,
  420.    bfd_boolean);
  421. static bfd_boolean generic_add_output_symbol
  422.   (bfd *, size_t *psymalloc, asymbol *);
  423. static bfd_boolean default_data_link_order
  424.   (bfd *, struct bfd_link_info *, asection *, struct bfd_link_order *);
  425. static bfd_boolean default_indirect_link_order
  426.   (bfd *, struct bfd_link_info *, asection *, struct bfd_link_order *,
  427.    bfd_boolean);
  428.  
  429. /* The link hash table structure is defined in bfdlink.h.  It provides
  430.    a base hash table which the backend specific hash tables are built
  431.    upon.  */
  432.  
  433. /* Routine to create an entry in the link hash table.  */
  434.  
  435. struct bfd_hash_entry *
  436. _bfd_link_hash_newfunc (struct bfd_hash_entry *entry,
  437.                         struct bfd_hash_table *table,
  438.                         const char *string)
  439. {
  440.   /* Allocate the structure if it has not already been allocated by a
  441.      subclass.  */
  442.   if (entry == NULL)
  443.     {
  444.       entry = (struct bfd_hash_entry *)
  445.           bfd_hash_allocate (table, sizeof (struct bfd_link_hash_entry));
  446.       if (entry == NULL)
  447.         return entry;
  448.     }
  449.  
  450.   /* Call the allocation method of the superclass.  */
  451.   entry = bfd_hash_newfunc (entry, table, string);
  452.   if (entry)
  453.     {
  454.       struct bfd_link_hash_entry *h = (struct bfd_link_hash_entry *) entry;
  455.  
  456.       /* Initialize the local fields.  */
  457.       memset ((char *) &h->root + sizeof (h->root), 0,
  458.               sizeof (*h) - sizeof (h->root));
  459.     }
  460.  
  461.   return entry;
  462. }
  463.  
  464. /* Initialize a link hash table.  The BFD argument is the one
  465.    responsible for creating this table.  */
  466.  
  467. bfd_boolean
  468. _bfd_link_hash_table_init
  469.   (struct bfd_link_hash_table *table,
  470.    bfd *abfd ATTRIBUTE_UNUSED,
  471.    struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *,
  472.                                       struct bfd_hash_table *,
  473.                                       const char *),
  474.    unsigned int entsize)
  475. {
  476.   bfd_boolean ret;
  477.  
  478.   BFD_ASSERT (!abfd->is_linker_output && !abfd->link.hash);
  479.   table->undefs = NULL;
  480.   table->undefs_tail = NULL;
  481.   table->type = bfd_link_generic_hash_table;
  482.  
  483.   ret = bfd_hash_table_init (&table->table, newfunc, entsize);
  484.   if (ret)
  485.     {
  486.       /* Arrange for destruction of this hash table on closing ABFD.  */
  487.       table->hash_table_free = _bfd_generic_link_hash_table_free;
  488.       abfd->link.hash = table;
  489.       abfd->is_linker_output = TRUE;
  490.     }
  491.   return ret;
  492. }
  493.  
  494. /* Look up a symbol in a link hash table.  If follow is TRUE, we
  495.    follow bfd_link_hash_indirect and bfd_link_hash_warning links to
  496.    the real symbol.  */
  497.  
  498. struct bfd_link_hash_entry *
  499. bfd_link_hash_lookup (struct bfd_link_hash_table *table,
  500.                       const char *string,
  501.                       bfd_boolean create,
  502.                       bfd_boolean copy,
  503.                       bfd_boolean follow)
  504. {
  505.   struct bfd_link_hash_entry *ret;
  506.  
  507.   ret = ((struct bfd_link_hash_entry *)
  508.          bfd_hash_lookup (&table->table, string, create, copy));
  509.  
  510.   if (follow && ret != NULL)
  511.     {
  512.       while (ret->type == bfd_link_hash_indirect
  513.              || ret->type == bfd_link_hash_warning)
  514.         ret = ret->u.i.link;
  515.     }
  516.  
  517.   return ret;
  518. }
  519.  
  520. /* Look up a symbol in the main linker hash table if the symbol might
  521.    be wrapped.  This should only be used for references to an
  522.    undefined symbol, not for definitions of a symbol.  */
  523.  
  524. struct bfd_link_hash_entry *
  525. bfd_wrapped_link_hash_lookup (bfd *abfd,
  526.                               struct bfd_link_info *info,
  527.                               const char *string,
  528.                               bfd_boolean create,
  529.                               bfd_boolean copy,
  530.                               bfd_boolean follow)
  531. {
  532.   bfd_size_type amt;
  533.  
  534.   if (info->wrap_hash != NULL)
  535.     {
  536.       const char *l;
  537.       char prefix = '\0';
  538.  
  539.       l = string;
  540.       if (*l == bfd_get_symbol_leading_char (abfd) || *l == info->wrap_char)
  541.         {
  542.           prefix = *l;
  543.           ++l;
  544.         }
  545.  
  546. #undef WRAP
  547. #define WRAP "__wrap_"
  548.  
  549.       if (bfd_hash_lookup (info->wrap_hash, l, FALSE, FALSE) != NULL)
  550.         {
  551.           char *n;
  552.           struct bfd_link_hash_entry *h;
  553.  
  554.           /* This symbol is being wrapped.  We want to replace all
  555.              references to SYM with references to __wrap_SYM.  */
  556.  
  557.           amt = strlen (l) + sizeof WRAP + 1;
  558.           n = (char *) bfd_malloc (amt);
  559.           if (n == NULL)
  560.             return NULL;
  561.  
  562.           n[0] = prefix;
  563.           n[1] = '\0';
  564.           strcat (n, WRAP);
  565.           strcat (n, l);
  566.           h = bfd_link_hash_lookup (info->hash, n, create, TRUE, follow);
  567.           free (n);
  568.           return h;
  569.         }
  570.  
  571. #undef  REAL
  572. #define REAL "__real_"
  573.  
  574.       if (*l == '_'
  575.           && CONST_STRNEQ (l, REAL)
  576.           && bfd_hash_lookup (info->wrap_hash, l + sizeof REAL - 1,
  577.                               FALSE, FALSE) != NULL)
  578.         {
  579.           char *n;
  580.           struct bfd_link_hash_entry *h;
  581.  
  582.           /* This is a reference to __real_SYM, where SYM is being
  583.              wrapped.  We want to replace all references to __real_SYM
  584.              with references to SYM.  */
  585.  
  586.           amt = strlen (l + sizeof REAL - 1) + 2;
  587.           n = (char *) bfd_malloc (amt);
  588.           if (n == NULL)
  589.             return NULL;
  590.  
  591.           n[0] = prefix;
  592.           n[1] = '\0';
  593.           strcat (n, l + sizeof REAL - 1);
  594.           h = bfd_link_hash_lookup (info->hash, n, create, TRUE, follow);
  595.           free (n);
  596.           return h;
  597.         }
  598.  
  599. #undef REAL
  600.     }
  601.  
  602.   return bfd_link_hash_lookup (info->hash, string, create, copy, follow);
  603. }
  604.  
  605. /* If H is a wrapped symbol, ie. the symbol name starts with "__wrap_"
  606.    and the remainder is found in wrap_hash, return the real symbol.  */
  607.  
  608. struct bfd_link_hash_entry *
  609. unwrap_hash_lookup (struct bfd_link_info *info,
  610.                     bfd *input_bfd,
  611.                     struct bfd_link_hash_entry *h)
  612. {
  613.   const char *l = h->root.string;
  614.  
  615.   if (*l == bfd_get_symbol_leading_char (input_bfd)
  616.       || *l == info->wrap_char)
  617.     ++l;
  618.  
  619.   if (CONST_STRNEQ (l, WRAP))
  620.     {
  621.       l += sizeof WRAP - 1;
  622.  
  623.       if (bfd_hash_lookup (info->wrap_hash, l, FALSE, FALSE) != NULL)
  624.         {
  625.           char save = 0;
  626.           if (l - (sizeof WRAP - 1) != h->root.string)
  627.             {
  628.               --l;
  629.               save = *l;
  630.               *(char *) l = *h->root.string;
  631.             }
  632.           h = bfd_link_hash_lookup (info->hash, l, FALSE, FALSE, FALSE);
  633.           if (save)
  634.             *(char *) l = save;
  635.         }
  636.     }
  637.   return h;
  638. }
  639. #undef WRAP
  640.  
  641. /* Traverse a generic link hash table.  Differs from bfd_hash_traverse
  642.    in the treatment of warning symbols.  When warning symbols are
  643.    created they replace the real symbol, so you don't get to see the
  644.    real symbol in a bfd_hash_travere.  This traversal calls func with
  645.    the real symbol.  */
  646.  
  647. void
  648. bfd_link_hash_traverse
  649.   (struct bfd_link_hash_table *htab,
  650.    bfd_boolean (*func) (struct bfd_link_hash_entry *, void *),
  651.    void *info)
  652. {
  653.   unsigned int i;
  654.  
  655.   htab->table.frozen = 1;
  656.   for (i = 0; i < htab->table.size; i++)
  657.     {
  658.       struct bfd_link_hash_entry *p;
  659.  
  660.       p = (struct bfd_link_hash_entry *) htab->table.table[i];
  661.       for (; p != NULL; p = (struct bfd_link_hash_entry *) p->root.next)
  662.         if (!(*func) (p->type == bfd_link_hash_warning ? p->u.i.link : p, info))
  663.           goto out;
  664.     }
  665.  out:
  666.   htab->table.frozen = 0;
  667. }
  668.  
  669. /* Add a symbol to the linker hash table undefs list.  */
  670.  
  671. void
  672. bfd_link_add_undef (struct bfd_link_hash_table *table,
  673.                     struct bfd_link_hash_entry *h)
  674. {
  675.   BFD_ASSERT (h->u.undef.next == NULL);
  676.   if (table->undefs_tail != NULL)
  677.     table->undefs_tail->u.undef.next = h;
  678.   if (table->undefs == NULL)
  679.     table->undefs = h;
  680.   table->undefs_tail = h;
  681. }
  682.  
  683. /* The undefs list was designed so that in normal use we don't need to
  684.    remove entries.  However, if symbols on the list are changed from
  685.    bfd_link_hash_undefined to either bfd_link_hash_undefweak or
  686.    bfd_link_hash_new for some reason, then they must be removed from the
  687.    list.  Failure to do so might result in the linker attempting to add
  688.    the symbol to the list again at a later stage.  */
  689.  
  690. void
  691. bfd_link_repair_undef_list (struct bfd_link_hash_table *table)
  692. {
  693.   struct bfd_link_hash_entry **pun;
  694.  
  695.   pun = &table->undefs;
  696.   while (*pun != NULL)
  697.     {
  698.       struct bfd_link_hash_entry *h = *pun;
  699.  
  700.       if (h->type == bfd_link_hash_new
  701.           || h->type == bfd_link_hash_undefweak)
  702.         {
  703.           *pun = h->u.undef.next;
  704.           h->u.undef.next = NULL;
  705.           if (h == table->undefs_tail)
  706.             {
  707.               if (pun == &table->undefs)
  708.                 table->undefs_tail = NULL;
  709.               else
  710.                 /* pun points at an u.undef.next field.  Go back to
  711.                    the start of the link_hash_entry.  */
  712.                 table->undefs_tail = (struct bfd_link_hash_entry *)
  713.                   ((char *) pun - ((char *) &h->u.undef.next - (char *) h));
  714.               break;
  715.             }
  716.         }
  717.       else
  718.         pun = &h->u.undef.next;
  719.     }
  720. }
  721. /* Routine to create an entry in a generic link hash table.  */
  722.  
  723. struct bfd_hash_entry *
  724. _bfd_generic_link_hash_newfunc (struct bfd_hash_entry *entry,
  725.                                 struct bfd_hash_table *table,
  726.                                 const char *string)
  727. {
  728.   /* Allocate the structure if it has not already been allocated by a
  729.      subclass.  */
  730.   if (entry == NULL)
  731.     {
  732.       entry = (struct bfd_hash_entry *)
  733.         bfd_hash_allocate (table, sizeof (struct generic_link_hash_entry));
  734.       if (entry == NULL)
  735.         return entry;
  736.     }
  737.  
  738.   /* Call the allocation method of the superclass.  */
  739.   entry = _bfd_link_hash_newfunc (entry, table, string);
  740.   if (entry)
  741.     {
  742.       struct generic_link_hash_entry *ret;
  743.  
  744.       /* Set local fields.  */
  745.       ret = (struct generic_link_hash_entry *) entry;
  746.       ret->written = FALSE;
  747.       ret->sym = NULL;
  748.     }
  749.  
  750.   return entry;
  751. }
  752.  
  753. /* Create a generic link hash table.  */
  754.  
  755. struct bfd_link_hash_table *
  756. _bfd_generic_link_hash_table_create (bfd *abfd)
  757. {
  758.   struct generic_link_hash_table *ret;
  759.   bfd_size_type amt = sizeof (struct generic_link_hash_table);
  760.  
  761.   ret = (struct generic_link_hash_table *) bfd_malloc (amt);
  762.   if (ret == NULL)
  763.     return NULL;
  764.   if (! _bfd_link_hash_table_init (&ret->root, abfd,
  765.                                    _bfd_generic_link_hash_newfunc,
  766.                                    sizeof (struct generic_link_hash_entry)))
  767.     {
  768.       free (ret);
  769.       return NULL;
  770.     }
  771.   return &ret->root;
  772. }
  773.  
  774. void
  775. _bfd_generic_link_hash_table_free (bfd *obfd)
  776. {
  777.   struct generic_link_hash_table *ret;
  778.  
  779.   BFD_ASSERT (obfd->is_linker_output && obfd->link.hash);
  780.   ret = (struct generic_link_hash_table *) obfd->link.hash;
  781.   bfd_hash_table_free (&ret->root.table);
  782.   free (ret);
  783.   obfd->link.hash = NULL;
  784.   obfd->is_linker_output = FALSE;
  785. }
  786.  
  787. /* Grab the symbols for an object file when doing a generic link.  We
  788.    store the symbols in the outsymbols field.  We need to keep them
  789.    around for the entire link to ensure that we only read them once.
  790.    If we read them multiple times, we might wind up with relocs and
  791.    the hash table pointing to different instances of the symbol
  792.    structure.  */
  793.  
  794. bfd_boolean
  795. bfd_generic_link_read_symbols (bfd *abfd)
  796. {
  797.   if (bfd_get_outsymbols (abfd) == NULL)
  798.     {
  799.       long symsize;
  800.       long symcount;
  801.  
  802.       symsize = bfd_get_symtab_upper_bound (abfd);
  803.       if (symsize < 0)
  804.         return FALSE;
  805.       bfd_get_outsymbols (abfd) = (struct bfd_symbol **) bfd_alloc (abfd,
  806.                                                                     symsize);
  807.       if (bfd_get_outsymbols (abfd) == NULL && symsize != 0)
  808.         return FALSE;
  809.       symcount = bfd_canonicalize_symtab (abfd, bfd_get_outsymbols (abfd));
  810.       if (symcount < 0)
  811.         return FALSE;
  812.       bfd_get_symcount (abfd) = symcount;
  813.     }
  814.  
  815.   return TRUE;
  816. }
  817. /* Generic function to add symbols to from an object file to the
  818.    global hash table.  This version does not automatically collect
  819.    constructors by name.  */
  820.  
  821. bfd_boolean
  822. _bfd_generic_link_add_symbols (bfd *abfd, struct bfd_link_info *info)
  823. {
  824.   return generic_link_add_symbols (abfd, info, FALSE);
  825. }
  826.  
  827. /* Generic function to add symbols from an object file to the global
  828.    hash table.  This version automatically collects constructors by
  829.    name, as the collect2 program does.  It should be used for any
  830.    target which does not provide some other mechanism for setting up
  831.    constructors and destructors; these are approximately those targets
  832.    for which gcc uses collect2 and do not support stabs.  */
  833.  
  834. bfd_boolean
  835. _bfd_generic_link_add_symbols_collect (bfd *abfd, struct bfd_link_info *info)
  836. {
  837.   return generic_link_add_symbols (abfd, info, TRUE);
  838. }
  839.  
  840. /* Indicate that we are only retrieving symbol values from this
  841.    section.  We want the symbols to act as though the values in the
  842.    file are absolute.  */
  843.  
  844. void
  845. _bfd_generic_link_just_syms (asection *sec,
  846.                              struct bfd_link_info *info ATTRIBUTE_UNUSED)
  847. {
  848.   sec->sec_info_type = SEC_INFO_TYPE_JUST_SYMS;
  849.   sec->output_section = bfd_abs_section_ptr;
  850.   sec->output_offset = sec->vma;
  851. }
  852.  
  853. /* Copy the symbol type and other attributes for a linker script
  854.    assignment from HSRC to HDEST.
  855.    The default implementation does nothing.  */
  856. void
  857. _bfd_generic_copy_link_hash_symbol_type (bfd *abfd ATTRIBUTE_UNUSED,
  858.     struct bfd_link_hash_entry *hdest ATTRIBUTE_UNUSED,
  859.     struct bfd_link_hash_entry *hsrc ATTRIBUTE_UNUSED)
  860. {
  861. }
  862.  
  863. /* Add symbols from an object file to the global hash table.  */
  864.  
  865. static bfd_boolean
  866. generic_link_add_symbols (bfd *abfd,
  867.                           struct bfd_link_info *info,
  868.                           bfd_boolean collect)
  869. {
  870.   bfd_boolean ret;
  871.  
  872.   switch (bfd_get_format (abfd))
  873.     {
  874.     case bfd_object:
  875.       ret = generic_link_add_object_symbols (abfd, info, collect);
  876.       break;
  877.     case bfd_archive:
  878.       ret = (_bfd_generic_link_add_archive_symbols
  879.              (abfd, info,
  880.               (collect
  881.                ? generic_link_check_archive_element_collect
  882.                : generic_link_check_archive_element_no_collect)));
  883.       break;
  884.     default:
  885.       bfd_set_error (bfd_error_wrong_format);
  886.       ret = FALSE;
  887.     }
  888.  
  889.   return ret;
  890. }
  891.  
  892. /* Add symbols from an object file to the global hash table.  */
  893.  
  894. static bfd_boolean
  895. generic_link_add_object_symbols (bfd *abfd,
  896.                                  struct bfd_link_info *info,
  897.                                  bfd_boolean collect)
  898. {
  899.   bfd_size_type symcount;
  900.   struct bfd_symbol **outsyms;
  901.  
  902.   if (!bfd_generic_link_read_symbols (abfd))
  903.     return FALSE;
  904.   symcount = _bfd_generic_link_get_symcount (abfd);
  905.   outsyms = _bfd_generic_link_get_symbols (abfd);
  906.   return generic_link_add_symbol_list (abfd, info, symcount, outsyms, collect);
  907. }
  908. /* Generic function to add symbols from an archive file to the global
  909.    hash file.  This function presumes that the archive symbol table
  910.    has already been read in (this is normally done by the
  911.    bfd_check_format entry point).  It looks through the archive symbol
  912.    table for symbols that are undefined or common in the linker global
  913.    symbol hash table.  When one is found, the CHECKFN argument is used
  914.    to see if an object file should be included.  This allows targets
  915.    to customize common symbol behaviour.  CHECKFN should set *PNEEDED
  916.    to TRUE if the object file should be included, and must also call
  917.    the bfd_link_info add_archive_element callback function and handle
  918.    adding the symbols to the global hash table.  CHECKFN must notice
  919.    if the callback indicates a substitute BFD, and arrange to add
  920.    those symbols instead if it does so.  CHECKFN should only return
  921.    FALSE if some sort of error occurs.  */
  922.  
  923. bfd_boolean
  924. _bfd_generic_link_add_archive_symbols
  925.   (bfd *abfd,
  926.    struct bfd_link_info *info,
  927.    bfd_boolean (*checkfn) (bfd *, struct bfd_link_info *,
  928.                            struct bfd_link_hash_entry *, const char *,
  929.                            bfd_boolean *))
  930. {
  931.   bfd_boolean loop;
  932.   bfd_size_type amt;
  933.   unsigned char *included;
  934.  
  935.   if (! bfd_has_map (abfd))
  936.     {
  937.       /* An empty archive is a special case.  */
  938.       if (bfd_openr_next_archived_file (abfd, NULL) == NULL)
  939.         return TRUE;
  940.       bfd_set_error (bfd_error_no_armap);
  941.       return FALSE;
  942.     }
  943.  
  944.   amt = bfd_ardata (abfd)->symdef_count;
  945.   if (amt == 0)
  946.     return TRUE;
  947.   amt *= sizeof (*included);
  948.   included = (unsigned char *) bfd_zmalloc (amt);
  949.   if (included == NULL)
  950.     return FALSE;
  951.  
  952.   do
  953.     {
  954.       carsym *arsyms;
  955.       carsym *arsym_end;
  956.       carsym *arsym;
  957.       unsigned int indx;
  958.       file_ptr last_ar_offset = -1;
  959.       bfd_boolean needed = FALSE;
  960.       bfd *element = NULL;
  961.  
  962.       loop = FALSE;
  963.   arsyms = bfd_ardata (abfd)->symdefs;
  964.   arsym_end = arsyms + bfd_ardata (abfd)->symdef_count;
  965.   for (arsym = arsyms, indx = 0; arsym < arsym_end; arsym++, indx++)
  966.     {
  967.       struct bfd_link_hash_entry *h;
  968.           struct bfd_link_hash_entry *undefs_tail;
  969.  
  970.           if (included[indx])
  971.             continue;
  972.           if (needed && arsym->file_offset == last_ar_offset)
  973.         {
  974.               included[indx] = 1;
  975.           continue;
  976.         }
  977.  
  978.           h = bfd_link_hash_lookup (info->hash, arsym->name,
  979.                                     FALSE, FALSE, TRUE);
  980.  
  981.           if (h == NULL
  982.               && info->pei386_auto_import
  983.               && CONST_STRNEQ (arsym->name, "__imp_"))
  984.             h = bfd_link_hash_lookup (info->hash, arsym->name + 6,
  985.                                       FALSE, FALSE, TRUE);
  986.           if (h == NULL)
  987.               continue;
  988.  
  989.           if (h->type != bfd_link_hash_undefined
  990.               && h->type != bfd_link_hash_common)
  991.             {
  992.               if (h->type != bfd_link_hash_undefweak)
  993.                 /* Symbol must be defined.  Don't check it again.  */
  994.                 included[indx] = 1;
  995.             continue;
  996.             }
  997.  
  998.           if (last_ar_offset != arsym->file_offset)
  999.             {
  1000.               last_ar_offset = arsym->file_offset;
  1001.               element = _bfd_get_elt_at_filepos (abfd, last_ar_offset);
  1002.               if (element == NULL
  1003.                   || !bfd_check_format (element, bfd_object))
  1004.                 goto error_return;
  1005.             }
  1006.  
  1007.           undefs_tail = info->hash->undefs_tail;
  1008.  
  1009.           /* CHECKFN will see if this element should be included, and
  1010.              go ahead and include it if appropriate.  */
  1011.           if (! (*checkfn) (element, info, h, arsym->name, &needed))
  1012.             goto error_return;
  1013.  
  1014.           if (needed)
  1015.             {
  1016.               unsigned int mark;
  1017.  
  1018.               /* Look backward to mark all symbols from this object file
  1019.                  which we have already seen in this pass.  */
  1020.               mark = indx;
  1021.               do
  1022.                 {
  1023.                   included[mark] = 1;
  1024.                   if (mark == 0)
  1025.                     break;
  1026.                   --mark;
  1027.             }
  1028.               while (arsyms[mark].file_offset == last_ar_offset);
  1029.  
  1030.               if (undefs_tail != info->hash->undefs_tail)
  1031.                 loop = TRUE;
  1032.         }
  1033.     }
  1034.     } while (loop);
  1035.  
  1036.   free (included);
  1037.   return TRUE;
  1038.  
  1039.  error_return:
  1040.   free (included);
  1041.   return FALSE;
  1042. }
  1043. /* See if we should include an archive element.  This version is used
  1044.    when we do not want to automatically collect constructors based on
  1045.    the symbol name, presumably because we have some other mechanism
  1046.    for finding them.  */
  1047.  
  1048. static bfd_boolean
  1049. generic_link_check_archive_element_no_collect (bfd *abfd,
  1050.                                                struct bfd_link_info *info,
  1051.                                                struct bfd_link_hash_entry *h,
  1052.                                                const char *name,
  1053.                                                bfd_boolean *pneeded)
  1054. {
  1055.   return generic_link_check_archive_element (abfd, info, h, name, pneeded,
  1056.                                              FALSE);
  1057. }
  1058.  
  1059. /* See if we should include an archive element.  This version is used
  1060.    when we want to automatically collect constructors based on the
  1061.    symbol name, as collect2 does.  */
  1062.  
  1063. static bfd_boolean
  1064. generic_link_check_archive_element_collect (bfd *abfd,
  1065.                                             struct bfd_link_info *info,
  1066.                                             struct bfd_link_hash_entry *h,
  1067.                                             const char *name,
  1068.                                             bfd_boolean *pneeded)
  1069. {
  1070.   return generic_link_check_archive_element (abfd, info, h, name, pneeded,
  1071.                                              TRUE);
  1072. }
  1073.  
  1074. /* See if we should include an archive element.  Optionally collect
  1075.    constructors.  */
  1076.  
  1077. static bfd_boolean
  1078. generic_link_check_archive_element (bfd *abfd,
  1079.                                     struct bfd_link_info *info,
  1080.                                     struct bfd_link_hash_entry *h,
  1081.                                     const char *name ATTRIBUTE_UNUSED,
  1082.                                     bfd_boolean *pneeded,
  1083.                                     bfd_boolean collect)
  1084. {
  1085.   asymbol **pp, **ppend;
  1086.  
  1087.   *pneeded = FALSE;
  1088.  
  1089.   if (!bfd_generic_link_read_symbols (abfd))
  1090.     return FALSE;
  1091.  
  1092.   pp = _bfd_generic_link_get_symbols (abfd);
  1093.   ppend = pp + _bfd_generic_link_get_symcount (abfd);
  1094.   for (; pp < ppend; pp++)
  1095.     {
  1096.       asymbol *p;
  1097.  
  1098.       p = *pp;
  1099.  
  1100.       /* We are only interested in globally visible symbols.  */
  1101.       if (! bfd_is_com_section (p->section)
  1102.           && (p->flags & (BSF_GLOBAL | BSF_INDIRECT | BSF_WEAK)) == 0)
  1103.         continue;
  1104.  
  1105.       /* We are only interested if we know something about this
  1106.          symbol, and it is undefined or common.  An undefined weak
  1107.          symbol (type bfd_link_hash_undefweak) is not considered to be
  1108.          a reference when pulling files out of an archive.  See the
  1109.          SVR4 ABI, p. 4-27.  */
  1110.       h = bfd_link_hash_lookup (info->hash, bfd_asymbol_name (p), FALSE,
  1111.                                 FALSE, TRUE);
  1112.       if (h == NULL
  1113.           || (h->type != bfd_link_hash_undefined
  1114.               && h->type != bfd_link_hash_common))
  1115.         continue;
  1116.  
  1117.       /* P is a symbol we are looking for.  */
  1118.  
  1119.       if (! bfd_is_com_section (p->section)
  1120.           || (h->type == bfd_link_hash_undefined
  1121.               && h->u.undef.abfd == NULL))
  1122.         {
  1123.           /* P is not a common symbol, or an undefined reference was
  1124.              created from outside BFD such as from a linker -u option.
  1125.              This object file defines the symbol, so pull it in.  */
  1126.           *pneeded = TRUE;
  1127.           if (!(*info->callbacks
  1128.                 ->add_archive_element) (info, abfd, bfd_asymbol_name (p),
  1129.                                         &abfd))
  1130.             return FALSE;
  1131.           /* Potentially, the add_archive_element hook may have set a
  1132.              substitute BFD for us.  */
  1133.           return generic_link_add_object_symbols (abfd, info, collect);
  1134.         }
  1135.  
  1136.       /* P is a common symbol.  */
  1137.  
  1138.       if (h->type == bfd_link_hash_undefined)
  1139.         {
  1140.           bfd *symbfd;
  1141.           bfd_vma size;
  1142.           unsigned int power;
  1143.  
  1144.           /* Turn the symbol into a common symbol but do not link in
  1145.              the object file.  This is how a.out works.  Object
  1146.              formats that require different semantics must implement
  1147.              this function differently.  This symbol is already on the
  1148.              undefs list.  We add the section to a common section
  1149.              attached to symbfd to ensure that it is in a BFD which
  1150.              will be linked in.  */
  1151.           symbfd = h->u.undef.abfd;
  1152.           h->type = bfd_link_hash_common;
  1153.           h->u.c.p = (struct bfd_link_hash_common_entry *)
  1154.             bfd_hash_allocate (&info->hash->table,
  1155.                                sizeof (struct bfd_link_hash_common_entry));
  1156.           if (h->u.c.p == NULL)
  1157.             return FALSE;
  1158.  
  1159.           size = bfd_asymbol_value (p);
  1160.           h->u.c.size = size;
  1161.  
  1162.           power = bfd_log2 (size);
  1163.           if (power > 4)
  1164.             power = 4;
  1165.           h->u.c.p->alignment_power = power;
  1166.  
  1167.           if (p->section == bfd_com_section_ptr)
  1168.             h->u.c.p->section = bfd_make_section_old_way (symbfd, "COMMON");
  1169.           else
  1170.             h->u.c.p->section = bfd_make_section_old_way (symbfd,
  1171.                                                           p->section->name);
  1172.           h->u.c.p->section->flags |= SEC_ALLOC;
  1173.         }
  1174.       else
  1175.         {
  1176.           /* Adjust the size of the common symbol if necessary.  This
  1177.              is how a.out works.  Object formats that require
  1178.              different semantics must implement this function
  1179.              differently.  */
  1180.           if (bfd_asymbol_value (p) > h->u.c.size)
  1181.             h->u.c.size = bfd_asymbol_value (p);
  1182.         }
  1183.     }
  1184.  
  1185.   /* This archive element is not needed.  */
  1186.   return TRUE;
  1187. }
  1188.  
  1189. /* Add the symbols from an object file to the global hash table.  ABFD
  1190.    is the object file.  INFO is the linker information.  SYMBOL_COUNT
  1191.    is the number of symbols.  SYMBOLS is the list of symbols.  COLLECT
  1192.    is TRUE if constructors should be automatically collected by name
  1193.    as is done by collect2.  */
  1194.  
  1195. static bfd_boolean
  1196. generic_link_add_symbol_list (bfd *abfd,
  1197.                               struct bfd_link_info *info,
  1198.                               bfd_size_type symbol_count,
  1199.                               asymbol **symbols,
  1200.                               bfd_boolean collect)
  1201. {
  1202.   asymbol **pp, **ppend;
  1203.  
  1204.   pp = symbols;
  1205.   ppend = symbols + symbol_count;
  1206.   for (; pp < ppend; pp++)
  1207.     {
  1208.       asymbol *p;
  1209.  
  1210.       p = *pp;
  1211.  
  1212.       if ((p->flags & (BSF_INDIRECT
  1213.                        | BSF_WARNING
  1214.                        | BSF_GLOBAL
  1215.                        | BSF_CONSTRUCTOR
  1216.                        | BSF_WEAK)) != 0
  1217.           || bfd_is_und_section (bfd_get_section (p))
  1218.           || bfd_is_com_section (bfd_get_section (p))
  1219.           || bfd_is_ind_section (bfd_get_section (p)))
  1220.         {
  1221.           const char *name;
  1222.           const char *string;
  1223.           struct generic_link_hash_entry *h;
  1224.           struct bfd_link_hash_entry *bh;
  1225.  
  1226.           string = name = bfd_asymbol_name (p);
  1227.           if (((p->flags & BSF_INDIRECT) != 0
  1228.                || bfd_is_ind_section (p->section))
  1229.               && pp + 1 < ppend)
  1230.             {
  1231.               pp++;
  1232.               string = bfd_asymbol_name (*pp);
  1233.             }
  1234.           else if ((p->flags & BSF_WARNING) != 0
  1235.                    && pp + 1 < ppend)
  1236.             {
  1237.               /* The name of P is actually the warning string, and the
  1238.                  next symbol is the one to warn about.  */
  1239.               pp++;
  1240.               name = bfd_asymbol_name (*pp);
  1241.             }
  1242.  
  1243.           bh = NULL;
  1244.           if (! (_bfd_generic_link_add_one_symbol
  1245.                  (info, abfd, name, p->flags, bfd_get_section (p),
  1246.                   p->value, string, FALSE, collect, &bh)))
  1247.             return FALSE;
  1248.           h = (struct generic_link_hash_entry *) bh;
  1249.  
  1250.           /* If this is a constructor symbol, and the linker didn't do
  1251.              anything with it, then we want to just pass the symbol
  1252.              through to the output file.  This will happen when
  1253.              linking with -r.  */
  1254.           if ((p->flags & BSF_CONSTRUCTOR) != 0
  1255.               && (h == NULL || h->root.type == bfd_link_hash_new))
  1256.             {
  1257.               p->udata.p = NULL;
  1258.               continue;
  1259.             }
  1260.  
  1261.           /* Save the BFD symbol so that we don't lose any backend
  1262.              specific information that may be attached to it.  We only
  1263.              want this one if it gives more information than the
  1264.              existing one; we don't want to replace a defined symbol
  1265.              with an undefined one.  This routine may be called with a
  1266.              hash table other than the generic hash table, so we only
  1267.              do this if we are certain that the hash table is a
  1268.              generic one.  */
  1269.           if (info->output_bfd->xvec == abfd->xvec)
  1270.             {
  1271.               if (h->sym == NULL
  1272.                   || (! bfd_is_und_section (bfd_get_section (p))
  1273.                       && (! bfd_is_com_section (bfd_get_section (p))
  1274.                           || bfd_is_und_section (bfd_get_section (h->sym)))))
  1275.                 {
  1276.                   h->sym = p;
  1277.                   /* BSF_OLD_COMMON is a hack to support COFF reloc
  1278.                      reading, and it should go away when the COFF
  1279.                      linker is switched to the new version.  */
  1280.                   if (bfd_is_com_section (bfd_get_section (p)))
  1281.                     p->flags |= BSF_OLD_COMMON;
  1282.                 }
  1283.             }
  1284.  
  1285.           /* Store a back pointer from the symbol to the hash
  1286.              table entry for the benefit of relaxation code until
  1287.              it gets rewritten to not use asymbol structures.
  1288.              Setting this is also used to check whether these
  1289.              symbols were set up by the generic linker.  */
  1290.           p->udata.p = h;
  1291.         }
  1292.     }
  1293.  
  1294.   return TRUE;
  1295. }
  1296. /* We use a state table to deal with adding symbols from an object
  1297.    file.  The first index into the state table describes the symbol
  1298.    from the object file.  The second index into the state table is the
  1299.    type of the symbol in the hash table.  */
  1300.  
  1301. /* The symbol from the object file is turned into one of these row
  1302.    values.  */
  1303.  
  1304. enum link_row
  1305. {
  1306.   UNDEF_ROW,            /* Undefined.  */
  1307.   UNDEFW_ROW,           /* Weak undefined.  */
  1308.   DEF_ROW,              /* Defined.  */
  1309.   DEFW_ROW,             /* Weak defined.  */
  1310.   COMMON_ROW,           /* Common.  */
  1311.   INDR_ROW,             /* Indirect.  */
  1312.   WARN_ROW,             /* Warning.  */
  1313.   SET_ROW               /* Member of set.  */
  1314. };
  1315.  
  1316. /* apparently needed for Hitachi 3050R(HI-UX/WE2)? */
  1317. #undef FAIL
  1318.  
  1319. /* The actions to take in the state table.  */
  1320.  
  1321. enum link_action
  1322. {
  1323.   FAIL,         /* Abort.  */
  1324.   UND,          /* Mark symbol undefined.  */
  1325.   WEAK,         /* Mark symbol weak undefined.  */
  1326.   DEF,          /* Mark symbol defined.  */
  1327.   DEFW,         /* Mark symbol weak defined.  */
  1328.   COM,          /* Mark symbol common.  */
  1329.   REF,          /* Mark defined symbol referenced.  */
  1330.   CREF,         /* Possibly warn about common reference to defined symbol.  */
  1331.   CDEF,         /* Define existing common symbol.  */
  1332.   NOACT,        /* No action.  */
  1333.   BIG,          /* Mark symbol common using largest size.  */
  1334.   MDEF,         /* Multiple definition error.  */
  1335.   MIND,         /* Multiple indirect symbols.  */
  1336.   IND,          /* Make indirect symbol.  */
  1337.   CIND,         /* Make indirect symbol from existing common symbol.  */
  1338.   SET,          /* Add value to set.  */
  1339.   MWARN,        /* Make warning symbol.  */
  1340.   WARN,         /* Warn if referenced, else MWARN.  */
  1341.   CYCLE,        /* Repeat with symbol pointed to.  */
  1342.   REFC,         /* Mark indirect symbol referenced and then CYCLE.  */
  1343.   WARNC         /* Issue warning and then CYCLE.  */
  1344. };
  1345.  
  1346. /* The state table itself.  The first index is a link_row and the
  1347.    second index is a bfd_link_hash_type.  */
  1348.  
  1349. static const enum link_action link_action[8][8] =
  1350. {
  1351.   /* current\prev    new    undef  undefw def    defw   com    indr   warn  */
  1352.   /* UNDEF_ROW  */  {UND,   NOACT, UND,   REF,   REF,   NOACT, REFC,  WARNC },
  1353.   /* UNDEFW_ROW */  {WEAK,  NOACT, NOACT, REF,   REF,   NOACT, REFC,  WARNC },
  1354.   /* DEF_ROW    */  {DEF,   DEF,   DEF,   MDEF,  DEF,   CDEF,  MDEF,  CYCLE },
  1355.   /* DEFW_ROW   */  {DEFW,  DEFW,  DEFW,  NOACT, NOACT, NOACT, NOACT, CYCLE },
  1356.   /* COMMON_ROW */  {COM,   COM,   COM,   CREF,  COM,   BIG,   REFC,  WARNC },
  1357.   /* INDR_ROW   */  {IND,   IND,   IND,   MDEF,  IND,   CIND,  MIND,  CYCLE },
  1358.   /* WARN_ROW   */  {MWARN, WARN,  WARN,  WARN,  WARN,  WARN,  WARN,  NOACT },
  1359.   /* SET_ROW    */  {SET,   SET,   SET,   SET,   SET,   SET,   CYCLE, CYCLE }
  1360. };
  1361.  
  1362. /* Most of the entries in the LINK_ACTION table are straightforward,
  1363.    but a few are somewhat subtle.
  1364.  
  1365.    A reference to an indirect symbol (UNDEF_ROW/indr or
  1366.    UNDEFW_ROW/indr) is counted as a reference both to the indirect
  1367.    symbol and to the symbol the indirect symbol points to.
  1368.  
  1369.    A reference to a warning symbol (UNDEF_ROW/warn or UNDEFW_ROW/warn)
  1370.    causes the warning to be issued.
  1371.  
  1372.    A common definition of an indirect symbol (COMMON_ROW/indr) is
  1373.    treated as a multiple definition error.  Likewise for an indirect
  1374.    definition of a common symbol (INDR_ROW/com).
  1375.  
  1376.    An indirect definition of a warning (INDR_ROW/warn) does not cause
  1377.    the warning to be issued.
  1378.  
  1379.    If a warning is created for an indirect symbol (WARN_ROW/indr) no
  1380.    warning is created for the symbol the indirect symbol points to.
  1381.  
  1382.    Adding an entry to a set does not count as a reference to a set,
  1383.    and no warning is issued (SET_ROW/warn).  */
  1384.  
  1385. /* Return the BFD in which a hash entry has been defined, if known.  */
  1386.  
  1387. static bfd *
  1388. hash_entry_bfd (struct bfd_link_hash_entry *h)
  1389. {
  1390.   while (h->type == bfd_link_hash_warning)
  1391.     h = h->u.i.link;
  1392.   switch (h->type)
  1393.     {
  1394.     default:
  1395.       return NULL;
  1396.     case bfd_link_hash_undefined:
  1397.     case bfd_link_hash_undefweak:
  1398.       return h->u.undef.abfd;
  1399.     case bfd_link_hash_defined:
  1400.     case bfd_link_hash_defweak:
  1401.       return h->u.def.section->owner;
  1402.     case bfd_link_hash_common:
  1403.       return h->u.c.p->section->owner;
  1404.     }
  1405.   /*NOTREACHED*/
  1406. }
  1407.  
  1408. /* Add a symbol to the global hash table.
  1409.    ABFD is the BFD the symbol comes from.
  1410.    NAME is the name of the symbol.
  1411.    FLAGS is the BSF_* bits associated with the symbol.
  1412.    SECTION is the section in which the symbol is defined; this may be
  1413.      bfd_und_section_ptr or bfd_com_section_ptr.
  1414.    VALUE is the value of the symbol, relative to the section.
  1415.    STRING is used for either an indirect symbol, in which case it is
  1416.      the name of the symbol to indirect to, or a warning symbol, in
  1417.      which case it is the warning string.
  1418.    COPY is TRUE if NAME or STRING must be copied into locally
  1419.      allocated memory if they need to be saved.
  1420.    COLLECT is TRUE if we should automatically collect gcc constructor
  1421.      or destructor names as collect2 does.
  1422.    HASHP, if not NULL, is a place to store the created hash table
  1423.      entry; if *HASHP is not NULL, the caller has already looked up
  1424.      the hash table entry, and stored it in *HASHP.  */
  1425.  
  1426. bfd_boolean
  1427. _bfd_generic_link_add_one_symbol (struct bfd_link_info *info,
  1428.                                   bfd *abfd,
  1429.                                   const char *name,
  1430.                                   flagword flags,
  1431.                                   asection *section,
  1432.                                   bfd_vma value,
  1433.                                   const char *string,
  1434.                                   bfd_boolean copy,
  1435.                                   bfd_boolean collect,
  1436.                                   struct bfd_link_hash_entry **hashp)
  1437. {
  1438.   enum link_row row;
  1439.   struct bfd_link_hash_entry *h;
  1440.   struct bfd_link_hash_entry *inh = NULL;
  1441.   bfd_boolean cycle;
  1442.  
  1443.   BFD_ASSERT (section != NULL);
  1444.  
  1445.   if (bfd_is_ind_section (section)
  1446.       || (flags & BSF_INDIRECT) != 0)
  1447.     {
  1448.     row = INDR_ROW;
  1449.       /* Create the indirect symbol here.  This is for the benefit of
  1450.          the plugin "notice" function.
  1451.          STRING is the name of the symbol we want to indirect to.  */
  1452.       inh = bfd_wrapped_link_hash_lookup (abfd, info, string, TRUE,
  1453.                                           copy, FALSE);
  1454.       if (inh == NULL)
  1455.         return FALSE;
  1456.     }
  1457.   else if ((flags & BSF_WARNING) != 0)
  1458.     row = WARN_ROW;
  1459.   else if ((flags & BSF_CONSTRUCTOR) != 0)
  1460.     row = SET_ROW;
  1461.   else if (bfd_is_und_section (section))
  1462.     {
  1463.       if ((flags & BSF_WEAK) != 0)
  1464.         row = UNDEFW_ROW;
  1465.       else
  1466.         row = UNDEF_ROW;
  1467.     }
  1468.   else if ((flags & BSF_WEAK) != 0)
  1469.     row = DEFW_ROW;
  1470.   else if (bfd_is_com_section (section))
  1471.     {
  1472.     row = COMMON_ROW;
  1473.       if (strcmp (name, "__gnu_lto_slim") == 0)
  1474.         (*_bfd_error_handler)
  1475.           (_("%s: plugin needed to handle lto object"),
  1476.            bfd_get_filename (abfd));
  1477.     }
  1478.   else
  1479.     row = DEF_ROW;
  1480.  
  1481.   if (hashp != NULL && *hashp != NULL)
  1482.     h = *hashp;
  1483.   else
  1484.     {
  1485.       if (row == UNDEF_ROW || row == UNDEFW_ROW)
  1486.         h = bfd_wrapped_link_hash_lookup (abfd, info, name, TRUE, copy, FALSE);
  1487.       else
  1488.         h = bfd_link_hash_lookup (info->hash, name, TRUE, copy, FALSE);
  1489.       if (h == NULL)
  1490.         {
  1491.           if (hashp != NULL)
  1492.             *hashp = NULL;
  1493.           return FALSE;
  1494.         }
  1495.     }
  1496.  
  1497.   if (info->notice_all
  1498.       || (info->notice_hash != NULL
  1499.           && bfd_hash_lookup (info->notice_hash, name, FALSE, FALSE) != NULL))
  1500.     {
  1501.       if (! (*info->callbacks->notice) (info, h, inh,
  1502.                                         abfd, section, value, flags))
  1503.         return FALSE;
  1504.     }
  1505.  
  1506.   if (hashp != NULL)
  1507.     *hashp = h;
  1508.  
  1509.   do
  1510.     {
  1511.       enum link_action action;
  1512.  
  1513.       cycle = FALSE;
  1514.       action = link_action[(int) row][(int) h->type];
  1515.       switch (action)
  1516.         {
  1517.         case FAIL:
  1518.           abort ();
  1519.  
  1520.         case NOACT:
  1521.           /* Do nothing.  */
  1522.           break;
  1523.  
  1524.         case UND:
  1525.           /* Make a new undefined symbol.  */
  1526.           h->type = bfd_link_hash_undefined;
  1527.           h->u.undef.abfd = abfd;
  1528.           bfd_link_add_undef (info->hash, h);
  1529.           break;
  1530.  
  1531.         case WEAK:
  1532.           /* Make a new weak undefined symbol.  */
  1533.           h->type = bfd_link_hash_undefweak;
  1534.           h->u.undef.abfd = abfd;
  1535.           break;
  1536.  
  1537.         case CDEF:
  1538.           /* We have found a definition for a symbol which was
  1539.              previously common.  */
  1540.           BFD_ASSERT (h->type == bfd_link_hash_common);
  1541.           if (! ((*info->callbacks->multiple_common)
  1542.                  (info, h, abfd, bfd_link_hash_defined, 0)))
  1543.             return FALSE;
  1544.           /* Fall through.  */
  1545.         case DEF:
  1546.         case DEFW:
  1547.           {
  1548.             enum bfd_link_hash_type oldtype;
  1549.  
  1550.             /* Define a symbol.  */
  1551.             oldtype = h->type;
  1552.             if (action == DEFW)
  1553.               h->type = bfd_link_hash_defweak;
  1554.             else
  1555.               h->type = bfd_link_hash_defined;
  1556.             h->u.def.section = section;
  1557.             h->u.def.value = value;
  1558.             h->linker_def = 0;
  1559.  
  1560.             /* If we have been asked to, we act like collect2 and
  1561.                identify all functions that might be global
  1562.                constructors and destructors and pass them up in a
  1563.                callback.  We only do this for certain object file
  1564.                types, since many object file types can handle this
  1565.                automatically.  */
  1566.             if (collect && name[0] == '_')
  1567.               {
  1568.                 const char *s;
  1569.  
  1570.                 /* A constructor or destructor name starts like this:
  1571.                    _+GLOBAL_[_.$][ID][_.$] where the first [_.$] and
  1572.                    the second are the same character (we accept any
  1573.                    character there, in case a new object file format
  1574.                    comes along with even worse naming restrictions).  */
  1575.  
  1576. #define CONS_PREFIX "GLOBAL_"
  1577. #define CONS_PREFIX_LEN (sizeof CONS_PREFIX - 1)
  1578.  
  1579.                 s = name + 1;
  1580.                 while (*s == '_')
  1581.                   ++s;
  1582.                 if (s[0] == 'G' && CONST_STRNEQ (s, CONS_PREFIX))
  1583.                   {
  1584.                     char c;
  1585.  
  1586.                     c = s[CONS_PREFIX_LEN + 1];
  1587.                     if ((c == 'I' || c == 'D')
  1588.                         && s[CONS_PREFIX_LEN] == s[CONS_PREFIX_LEN + 2])
  1589.                       {
  1590.                         /* If this is a definition of a symbol which
  1591.                            was previously weakly defined, we are in
  1592.                            trouble.  We have already added a
  1593.                            constructor entry for the weak defined
  1594.                            symbol, and now we are trying to add one
  1595.                            for the new symbol.  Fortunately, this case
  1596.                            should never arise in practice.  */
  1597.                         if (oldtype == bfd_link_hash_defweak)
  1598.                           abort ();
  1599.  
  1600.                         if (! ((*info->callbacks->constructor)
  1601.                                (info, c == 'I',
  1602.                                 h->root.string, abfd, section, value)))
  1603.                           return FALSE;
  1604.                       }
  1605.                   }
  1606.               }
  1607.           }
  1608.  
  1609.           break;
  1610.  
  1611.         case COM:
  1612.           /* We have found a common definition for a symbol.  */
  1613.           if (h->type == bfd_link_hash_new)
  1614.             bfd_link_add_undef (info->hash, h);
  1615.           h->type = bfd_link_hash_common;
  1616.           h->u.c.p = (struct bfd_link_hash_common_entry *)
  1617.             bfd_hash_allocate (&info->hash->table,
  1618.                                sizeof (struct bfd_link_hash_common_entry));
  1619.           if (h->u.c.p == NULL)
  1620.             return FALSE;
  1621.  
  1622.           h->u.c.size = value;
  1623.  
  1624.           /* Select a default alignment based on the size.  This may
  1625.              be overridden by the caller.  */
  1626.           {
  1627.             unsigned int power;
  1628.  
  1629.             power = bfd_log2 (value);
  1630.             if (power > 4)
  1631.               power = 4;
  1632.             h->u.c.p->alignment_power = power;
  1633.           }
  1634.  
  1635.           /* The section of a common symbol is only used if the common
  1636.              symbol is actually allocated.  It basically provides a
  1637.              hook for the linker script to decide which output section
  1638.              the common symbols should be put in.  In most cases, the
  1639.              section of a common symbol will be bfd_com_section_ptr,
  1640.              the code here will choose a common symbol section named
  1641.              "COMMON", and the linker script will contain *(COMMON) in
  1642.              the appropriate place.  A few targets use separate common
  1643.              sections for small symbols, and they require special
  1644.              handling.  */
  1645.           if (section == bfd_com_section_ptr)
  1646.             {
  1647.               h->u.c.p->section = bfd_make_section_old_way (abfd, "COMMON");
  1648.               h->u.c.p->section->flags |= SEC_ALLOC;
  1649.             }
  1650.           else if (section->owner != abfd)
  1651.             {
  1652.               h->u.c.p->section = bfd_make_section_old_way (abfd,
  1653.                                                             section->name);
  1654.               h->u.c.p->section->flags |= SEC_ALLOC;
  1655.             }
  1656.           else
  1657.             h->u.c.p->section = section;
  1658.           h->linker_def = 0;
  1659.           break;
  1660.  
  1661.         case REF:
  1662.           /* A reference to a defined symbol.  */
  1663.           if (h->u.undef.next == NULL && info->hash->undefs_tail != h)
  1664.             h->u.undef.next = h;
  1665.           break;
  1666.  
  1667.         case BIG:
  1668.           /* We have found a common definition for a symbol which
  1669.              already had a common definition.  Use the maximum of the
  1670.              two sizes, and use the section required by the larger symbol.  */
  1671.           BFD_ASSERT (h->type == bfd_link_hash_common);
  1672.           if (! ((*info->callbacks->multiple_common)
  1673.                  (info, h, abfd, bfd_link_hash_common, value)))
  1674.             return FALSE;
  1675.           if (value > h->u.c.size)
  1676.             {
  1677.               unsigned int power;
  1678.  
  1679.               h->u.c.size = value;
  1680.  
  1681.               /* Select a default alignment based on the size.  This may
  1682.                  be overridden by the caller.  */
  1683.               power = bfd_log2 (value);
  1684.               if (power > 4)
  1685.                 power = 4;
  1686.               h->u.c.p->alignment_power = power;
  1687.  
  1688.               /* Some systems have special treatment for small commons,
  1689.                  hence we want to select the section used by the larger
  1690.                  symbol.  This makes sure the symbol does not go in a
  1691.                  small common section if it is now too large.  */
  1692.               if (section == bfd_com_section_ptr)
  1693.                 {
  1694.                   h->u.c.p->section
  1695.                     = bfd_make_section_old_way (abfd, "COMMON");
  1696.                   h->u.c.p->section->flags |= SEC_ALLOC;
  1697.                 }
  1698.               else if (section->owner != abfd)
  1699.                 {
  1700.                   h->u.c.p->section
  1701.                     = bfd_make_section_old_way (abfd, section->name);
  1702.                   h->u.c.p->section->flags |= SEC_ALLOC;
  1703.                 }
  1704.               else
  1705.                 h->u.c.p->section = section;
  1706.             }
  1707.           break;
  1708.  
  1709.         case CREF:
  1710.           /* We have found a common definition for a symbol which
  1711.              was already defined.  */
  1712.           if (! ((*info->callbacks->multiple_common)
  1713.                  (info, h, abfd, bfd_link_hash_common, value)))
  1714.             return FALSE;
  1715.           break;
  1716.  
  1717.         case MIND:
  1718.           /* Multiple indirect symbols.  This is OK if they both point
  1719.              to the same symbol.  */
  1720.           if (strcmp (h->u.i.link->root.string, string) == 0)
  1721.             break;
  1722.           /* Fall through.  */
  1723.         case MDEF:
  1724.           /* Handle a multiple definition.  */
  1725.           if (! ((*info->callbacks->multiple_definition)
  1726.                  (info, h, abfd, section, value)))
  1727.             return FALSE;
  1728.           break;
  1729.  
  1730.         case CIND:
  1731.           /* Create an indirect symbol from an existing common symbol.  */
  1732.           BFD_ASSERT (h->type == bfd_link_hash_common);
  1733.           if (! ((*info->callbacks->multiple_common)
  1734.                  (info, h, abfd, bfd_link_hash_indirect, 0)))
  1735.             return FALSE;
  1736.           /* Fall through.  */
  1737.         case IND:
  1738.             if (inh->type == bfd_link_hash_indirect
  1739.                 && inh->u.i.link == h)
  1740.               {
  1741.                 (*_bfd_error_handler)
  1742.                   (_("%B: indirect symbol `%s' to `%s' is a loop"),
  1743.                    abfd, name, string);
  1744.                 bfd_set_error (bfd_error_invalid_operation);
  1745.                 return FALSE;
  1746.               }
  1747.             if (inh->type == bfd_link_hash_new)
  1748.               {
  1749.                 inh->type = bfd_link_hash_undefined;
  1750.                 inh->u.undef.abfd = abfd;
  1751.                 bfd_link_add_undef (info->hash, inh);
  1752.               }
  1753.  
  1754.             /* If the indirect symbol has been referenced, we need to
  1755.              push the reference down to the symbol we are referencing.  */
  1756.             if (h->type != bfd_link_hash_new)
  1757.               {
  1758.               /* ??? If inh->type == bfd_link_hash_undefweak this
  1759.                  converts inh to bfd_link_hash_undefined.  */
  1760.                 row = UNDEF_ROW;
  1761.                 cycle = TRUE;
  1762.               }
  1763.  
  1764.             h->type = bfd_link_hash_indirect;
  1765.             h->u.i.link = inh;
  1766.           /* Not setting h = h->u.i.link here means that when cycle is
  1767.              set above we'll always go to REFC, and then cycle again
  1768.              to the indirected symbol.  This means that any successful
  1769.              change of an existing symbol to indirect counts as a
  1770.              reference.  ??? That may not be correct when the existing
  1771.              symbol was defweak.  */
  1772.           break;
  1773.  
  1774.         case SET:
  1775.           /* Add an entry to a set.  */
  1776.           if (! (*info->callbacks->add_to_set) (info, h, BFD_RELOC_CTOR,
  1777.                                                 abfd, section, value))
  1778.             return FALSE;
  1779.           break;
  1780.  
  1781.         case WARNC:
  1782.           /* Issue a warning and cycle, except when the reference is
  1783.              in LTO IR.  */
  1784.           if (h->u.i.warning != NULL
  1785.               && (abfd->flags & BFD_PLUGIN) == 0)
  1786.             {
  1787.               if (! (*info->callbacks->warning) (info, h->u.i.warning,
  1788.                                                  h->root.string, abfd,
  1789.                                                  NULL, 0))
  1790.                 return FALSE;
  1791.               /* Only issue a warning once.  */
  1792.               h->u.i.warning = NULL;
  1793.             }
  1794.           /* Fall through.  */
  1795.         case CYCLE:
  1796.           /* Try again with the referenced symbol.  */
  1797.           h = h->u.i.link;
  1798.           cycle = TRUE;
  1799.           break;
  1800.  
  1801.         case REFC:
  1802.           /* A reference to an indirect symbol.  */
  1803.           if (h->u.undef.next == NULL && info->hash->undefs_tail != h)
  1804.             h->u.undef.next = h;
  1805.           h = h->u.i.link;
  1806.           cycle = TRUE;
  1807.           break;
  1808.  
  1809.         case WARN:
  1810.           /* Warn if this symbol has been referenced already from non-IR,
  1811.              otherwise add a warning.  */
  1812.           if ((!info->lto_plugin_active
  1813.                && (h->u.undef.next != NULL || info->hash->undefs_tail == h))
  1814.               || h->non_ir_ref)
  1815.             {
  1816.               if (! (*info->callbacks->warning) (info, string, h->root.string,
  1817.                                                  hash_entry_bfd (h), NULL, 0))
  1818.                 return FALSE;
  1819.               break;
  1820.             }
  1821.           /* Fall through.  */
  1822.         case MWARN:
  1823.           /* Make a warning symbol.  */
  1824.           {
  1825.             struct bfd_link_hash_entry *sub;
  1826.  
  1827.             /* STRING is the warning to give.  */
  1828.             sub = ((struct bfd_link_hash_entry *)
  1829.                    ((*info->hash->table.newfunc)
  1830.                     (NULL, &info->hash->table, h->root.string)));
  1831.             if (sub == NULL)
  1832.               return FALSE;
  1833.             *sub = *h;
  1834.             sub->type = bfd_link_hash_warning;
  1835.             sub->u.i.link = h;
  1836.             if (! copy)
  1837.               sub->u.i.warning = string;
  1838.             else
  1839.               {
  1840.                 char *w;
  1841.                 size_t len = strlen (string) + 1;
  1842.  
  1843.                 w = (char *) bfd_hash_allocate (&info->hash->table, len);
  1844.                 if (w == NULL)
  1845.                   return FALSE;
  1846.                 memcpy (w, string, len);
  1847.                 sub->u.i.warning = w;
  1848.               }
  1849.  
  1850.             bfd_hash_replace (&info->hash->table,
  1851.                               (struct bfd_hash_entry *) h,
  1852.                               (struct bfd_hash_entry *) sub);
  1853.             if (hashp != NULL)
  1854.               *hashp = sub;
  1855.           }
  1856.           break;
  1857.         }
  1858.     }
  1859.   while (cycle);
  1860.  
  1861.   return TRUE;
  1862. }
  1863. /* Generic final link routine.  */
  1864.  
  1865. bfd_boolean
  1866. _bfd_generic_final_link (bfd *abfd, struct bfd_link_info *info)
  1867. {
  1868.   bfd *sub;
  1869.   asection *o;
  1870.   struct bfd_link_order *p;
  1871.   size_t outsymalloc;
  1872.   struct generic_write_global_symbol_info wginfo;
  1873.  
  1874.   bfd_get_outsymbols (abfd) = NULL;
  1875.   bfd_get_symcount (abfd) = 0;
  1876.   outsymalloc = 0;
  1877.  
  1878.   /* Mark all sections which will be included in the output file.  */
  1879.   for (o = abfd->sections; o != NULL; o = o->next)
  1880.     for (p = o->map_head.link_order; p != NULL; p = p->next)
  1881.       if (p->type == bfd_indirect_link_order)
  1882.         p->u.indirect.section->linker_mark = TRUE;
  1883.  
  1884.   /* Build the output symbol table.  */
  1885.   for (sub = info->input_bfds; sub != NULL; sub = sub->link.next)
  1886.     if (! _bfd_generic_link_output_symbols (abfd, sub, info, &outsymalloc))
  1887.       return FALSE;
  1888.  
  1889.   /* Accumulate the global symbols.  */
  1890.   wginfo.info = info;
  1891.   wginfo.output_bfd = abfd;
  1892.   wginfo.psymalloc = &outsymalloc;
  1893.   _bfd_generic_link_hash_traverse (_bfd_generic_hash_table (info),
  1894.                                    _bfd_generic_link_write_global_symbol,
  1895.                                    &wginfo);
  1896.  
  1897.   /* Make sure we have a trailing NULL pointer on OUTSYMBOLS.  We
  1898.      shouldn't really need one, since we have SYMCOUNT, but some old
  1899.      code still expects one.  */
  1900.   if (! generic_add_output_symbol (abfd, &outsymalloc, NULL))
  1901.     return FALSE;
  1902.  
  1903.   if (bfd_link_relocatable (info))
  1904.     {
  1905.       /* Allocate space for the output relocs for each section.  */
  1906.       for (o = abfd->sections; o != NULL; o = o->next)
  1907.         {
  1908.           o->reloc_count = 0;
  1909.           for (p = o->map_head.link_order; p != NULL; p = p->next)
  1910.             {
  1911.               if (p->type == bfd_section_reloc_link_order
  1912.                   || p->type == bfd_symbol_reloc_link_order)
  1913.                 ++o->reloc_count;
  1914.               else if (p->type == bfd_indirect_link_order)
  1915.                 {
  1916.                   asection *input_section;
  1917.                   bfd *input_bfd;
  1918.                   long relsize;
  1919.                   arelent **relocs;
  1920.                   asymbol **symbols;
  1921.                   long reloc_count;
  1922.  
  1923.                   input_section = p->u.indirect.section;
  1924.                   input_bfd = input_section->owner;
  1925.                   relsize = bfd_get_reloc_upper_bound (input_bfd,
  1926.                                                        input_section);
  1927.                   if (relsize < 0)
  1928.                     return FALSE;
  1929.                   relocs = (arelent **) bfd_malloc (relsize);
  1930.                   if (!relocs && relsize != 0)
  1931.                     return FALSE;
  1932.                   symbols = _bfd_generic_link_get_symbols (input_bfd);
  1933.                   reloc_count = bfd_canonicalize_reloc (input_bfd,
  1934.                                                         input_section,
  1935.                                                         relocs,
  1936.                                                         symbols);
  1937.                   free (relocs);
  1938.                   if (reloc_count < 0)
  1939.                     return FALSE;
  1940.                   BFD_ASSERT ((unsigned long) reloc_count
  1941.                               == input_section->reloc_count);
  1942.                   o->reloc_count += reloc_count;
  1943.                 }
  1944.             }
  1945.           if (o->reloc_count > 0)
  1946.             {
  1947.               bfd_size_type amt;
  1948.  
  1949.               amt = o->reloc_count;
  1950.               amt *= sizeof (arelent *);
  1951.               o->orelocation = (struct reloc_cache_entry **) bfd_alloc (abfd, amt);
  1952.               if (!o->orelocation)
  1953.                 return FALSE;
  1954.               o->flags |= SEC_RELOC;
  1955.               /* Reset the count so that it can be used as an index
  1956.                  when putting in the output relocs.  */
  1957.               o->reloc_count = 0;
  1958.             }
  1959.         }
  1960.     }
  1961.  
  1962.   /* Handle all the link order information for the sections.  */
  1963.   for (o = abfd->sections; o != NULL; o = o->next)
  1964.     {
  1965.       for (p = o->map_head.link_order; p != NULL; p = p->next)
  1966.         {
  1967.           switch (p->type)
  1968.             {
  1969.             case bfd_section_reloc_link_order:
  1970.             case bfd_symbol_reloc_link_order:
  1971.               if (! _bfd_generic_reloc_link_order (abfd, info, o, p))
  1972.                 return FALSE;
  1973.               break;
  1974.             case bfd_indirect_link_order:
  1975.               if (! default_indirect_link_order (abfd, info, o, p, TRUE))
  1976.                 return FALSE;
  1977.               break;
  1978.             default:
  1979.               if (! _bfd_default_link_order (abfd, info, o, p))
  1980.                 return FALSE;
  1981.               break;
  1982.             }
  1983.         }
  1984.     }
  1985.  
  1986.   return TRUE;
  1987. }
  1988.  
  1989. /* Add an output symbol to the output BFD.  */
  1990.  
  1991. static bfd_boolean
  1992. generic_add_output_symbol (bfd *output_bfd, size_t *psymalloc, asymbol *sym)
  1993. {
  1994.   if (bfd_get_symcount (output_bfd) >= *psymalloc)
  1995.     {
  1996.       asymbol **newsyms;
  1997.       bfd_size_type amt;
  1998.  
  1999.       if (*psymalloc == 0)
  2000.         *psymalloc = 124;
  2001.       else
  2002.         *psymalloc *= 2;
  2003.       amt = *psymalloc;
  2004.       amt *= sizeof (asymbol *);
  2005.       newsyms = (asymbol **) bfd_realloc (bfd_get_outsymbols (output_bfd), amt);
  2006.       if (newsyms == NULL)
  2007.         return FALSE;
  2008.       bfd_get_outsymbols (output_bfd) = newsyms;
  2009.     }
  2010.  
  2011.   bfd_get_outsymbols (output_bfd) [bfd_get_symcount (output_bfd)] = sym;
  2012.   if (sym != NULL)
  2013.     ++ bfd_get_symcount (output_bfd);
  2014.  
  2015.   return TRUE;
  2016. }
  2017.  
  2018. /* Handle the symbols for an input BFD.  */
  2019.  
  2020. bfd_boolean
  2021. _bfd_generic_link_output_symbols (bfd *output_bfd,
  2022.                                   bfd *input_bfd,
  2023.                                   struct bfd_link_info *info,
  2024.                                   size_t *psymalloc)
  2025. {
  2026.   asymbol **sym_ptr;
  2027.   asymbol **sym_end;
  2028.  
  2029.   if (!bfd_generic_link_read_symbols (input_bfd))
  2030.     return FALSE;
  2031.  
  2032.   /* Create a filename symbol if we are supposed to.  */
  2033.   if (info->create_object_symbols_section != NULL)
  2034.     {
  2035.       asection *sec;
  2036.  
  2037.       for (sec = input_bfd->sections; sec != NULL; sec = sec->next)
  2038.         {
  2039.           if (sec->output_section == info->create_object_symbols_section)
  2040.             {
  2041.               asymbol *newsym;
  2042.  
  2043.               newsym = bfd_make_empty_symbol (input_bfd);
  2044.               if (!newsym)
  2045.                 return FALSE;
  2046.               newsym->name = input_bfd->filename;
  2047.               newsym->value = 0;
  2048.               newsym->flags = BSF_LOCAL | BSF_FILE;
  2049.               newsym->section = sec;
  2050.  
  2051.               if (! generic_add_output_symbol (output_bfd, psymalloc,
  2052.                                                newsym))
  2053.                 return FALSE;
  2054.  
  2055.               break;
  2056.             }
  2057.         }
  2058.     }
  2059.  
  2060.   /* Adjust the values of the globally visible symbols, and write out
  2061.      local symbols.  */
  2062.   sym_ptr = _bfd_generic_link_get_symbols (input_bfd);
  2063.   sym_end = sym_ptr + _bfd_generic_link_get_symcount (input_bfd);
  2064.   for (; sym_ptr < sym_end; sym_ptr++)
  2065.     {
  2066.       asymbol *sym;
  2067.       struct generic_link_hash_entry *h;
  2068.       bfd_boolean output;
  2069.  
  2070.       h = NULL;
  2071.       sym = *sym_ptr;
  2072.       if ((sym->flags & (BSF_INDIRECT
  2073.                          | BSF_WARNING
  2074.                          | BSF_GLOBAL
  2075.                          | BSF_CONSTRUCTOR
  2076.                          | BSF_WEAK)) != 0
  2077.           || bfd_is_und_section (bfd_get_section (sym))
  2078.           || bfd_is_com_section (bfd_get_section (sym))
  2079.           || bfd_is_ind_section (bfd_get_section (sym)))
  2080.         {
  2081.           if (sym->udata.p != NULL)
  2082.             h = (struct generic_link_hash_entry *) sym->udata.p;
  2083.           else if ((sym->flags & BSF_CONSTRUCTOR) != 0)
  2084.             {
  2085.               /* This case normally means that the main linker code
  2086.                  deliberately ignored this constructor symbol.  We
  2087.                  should just pass it through.  This will screw up if
  2088.                  the constructor symbol is from a different,
  2089.                  non-generic, object file format, but the case will
  2090.                  only arise when linking with -r, which will probably
  2091.                  fail anyhow, since there will be no way to represent
  2092.                  the relocs in the output format being used.  */
  2093.               h = NULL;
  2094.             }
  2095.           else if (bfd_is_und_section (bfd_get_section (sym)))
  2096.             h = ((struct generic_link_hash_entry *)
  2097.                  bfd_wrapped_link_hash_lookup (output_bfd, info,
  2098.                                                bfd_asymbol_name (sym),
  2099.                                                FALSE, FALSE, TRUE));
  2100.           else
  2101.             h = _bfd_generic_link_hash_lookup (_bfd_generic_hash_table (info),
  2102.                                                bfd_asymbol_name (sym),
  2103.                                                FALSE, FALSE, TRUE);
  2104.  
  2105.           if (h != NULL)
  2106.             {
  2107.               /* Force all references to this symbol to point to
  2108.                  the same area in memory.  It is possible that
  2109.                  this routine will be called with a hash table
  2110.                  other than a generic hash table, so we double
  2111.                  check that.  */
  2112.               if (info->output_bfd->xvec == input_bfd->xvec)
  2113.                 {
  2114.                   if (h->sym != NULL)
  2115.                     *sym_ptr = sym = h->sym;
  2116.                 }
  2117.  
  2118.               switch (h->root.type)
  2119.                 {
  2120.                 default:
  2121.                 case bfd_link_hash_new:
  2122.                   abort ();
  2123.                 case bfd_link_hash_undefined:
  2124.                   break;
  2125.                 case bfd_link_hash_undefweak:
  2126.                   sym->flags |= BSF_WEAK;
  2127.                   break;
  2128.                 case bfd_link_hash_indirect:
  2129.                   h = (struct generic_link_hash_entry *) h->root.u.i.link;
  2130.                   /* fall through */
  2131.                 case bfd_link_hash_defined:
  2132.                   sym->flags |= BSF_GLOBAL;
  2133.                   sym->flags &=~ (BSF_WEAK | BSF_CONSTRUCTOR);
  2134.                   sym->value = h->root.u.def.value;
  2135.                   sym->section = h->root.u.def.section;
  2136.                   break;
  2137.                 case bfd_link_hash_defweak:
  2138.                   sym->flags |= BSF_WEAK;
  2139.                   sym->flags &=~ BSF_CONSTRUCTOR;
  2140.                   sym->value = h->root.u.def.value;
  2141.                   sym->section = h->root.u.def.section;
  2142.                   break;
  2143.                 case bfd_link_hash_common:
  2144.                   sym->value = h->root.u.c.size;
  2145.                   sym->flags |= BSF_GLOBAL;
  2146.                   if (! bfd_is_com_section (sym->section))
  2147.                     {
  2148.                       BFD_ASSERT (bfd_is_und_section (sym->section));
  2149.                       sym->section = bfd_com_section_ptr;
  2150.                     }
  2151.                   /* We do not set the section of the symbol to
  2152.                      h->root.u.c.p->section.  That value was saved so
  2153.                      that we would know where to allocate the symbol
  2154.                      if it was defined.  In this case the type is
  2155.                      still bfd_link_hash_common, so we did not define
  2156.                      it, so we do not want to use that section.  */
  2157.                   break;
  2158.                 }
  2159.             }
  2160.         }
  2161.  
  2162.       /* This switch is straight from the old code in
  2163.          write_file_locals in ldsym.c.  */
  2164.       if (info->strip == strip_all
  2165.           || (info->strip == strip_some
  2166.               && bfd_hash_lookup (info->keep_hash, bfd_asymbol_name (sym),
  2167.                                   FALSE, FALSE) == NULL))
  2168.         output = FALSE;
  2169.       else if ((sym->flags & (BSF_GLOBAL | BSF_WEAK)) != 0)
  2170.         {
  2171.           /* If this symbol is marked as occurring now, rather
  2172.              than at the end, output it now.  This is used for
  2173.              COFF C_EXT FCN symbols.  FIXME: There must be a
  2174.              better way.  */
  2175.           if (bfd_asymbol_bfd (sym) == input_bfd
  2176.               && (sym->flags & BSF_NOT_AT_END) != 0)
  2177.             output = TRUE;
  2178.           else
  2179.             output = FALSE;
  2180.         }
  2181.       else if (bfd_is_ind_section (sym->section))
  2182.         output = FALSE;
  2183.       else if ((sym->flags & BSF_DEBUGGING) != 0)
  2184.         {
  2185.           if (info->strip == strip_none)
  2186.             output = TRUE;
  2187.           else
  2188.             output = FALSE;
  2189.         }
  2190.       else if (bfd_is_und_section (sym->section)
  2191.                || bfd_is_com_section (sym->section))
  2192.         output = FALSE;
  2193.       else if ((sym->flags & BSF_LOCAL) != 0)
  2194.         {
  2195.           if ((sym->flags & BSF_WARNING) != 0)
  2196.             output = FALSE;
  2197.           else
  2198.             {
  2199.               switch (info->discard)
  2200.                 {
  2201.                 default:
  2202.                 case discard_all:
  2203.                   output = FALSE;
  2204.                   break;
  2205.                 case discard_sec_merge:
  2206.                   output = TRUE;
  2207.                   if (bfd_link_relocatable (info)
  2208.                       || ! (sym->section->flags & SEC_MERGE))
  2209.                     break;
  2210.                   /* FALLTHROUGH */
  2211.                 case discard_l:
  2212.                   if (bfd_is_local_label (input_bfd, sym))
  2213.                     output = FALSE;
  2214.                   else
  2215.                     output = TRUE;
  2216.                   break;
  2217.                 case discard_none:
  2218.                   output = TRUE;
  2219.                   break;
  2220.                 }
  2221.             }
  2222.         }
  2223.       else if ((sym->flags & BSF_CONSTRUCTOR))
  2224.         {
  2225.           if (info->strip != strip_all)
  2226.             output = TRUE;
  2227.           else
  2228.             output = FALSE;
  2229.         }
  2230.       else if (sym->flags == 0
  2231.                && (sym->section->owner->flags & BFD_PLUGIN) != 0)
  2232.         /* LTO doesn't set symbol information.  We get here with the
  2233.            generic linker for a symbol that was "common" but no longer
  2234.            needs to be global.  */
  2235.         output = FALSE;
  2236.       else
  2237.         abort ();
  2238.  
  2239.       /* If this symbol is in a section which is not being included
  2240.          in the output file, then we don't want to output the
  2241.          symbol.  */
  2242.       if (!bfd_is_abs_section (sym->section)
  2243.           && bfd_section_removed_from_list (output_bfd,
  2244.                                             sym->section->output_section))
  2245.         output = FALSE;
  2246.  
  2247.       if (output)
  2248.         {
  2249.           if (! generic_add_output_symbol (output_bfd, psymalloc, sym))
  2250.             return FALSE;
  2251.           if (h != NULL)
  2252.             h->written = TRUE;
  2253.         }
  2254.     }
  2255.  
  2256.   return TRUE;
  2257. }
  2258.  
  2259. /* Set the section and value of a generic BFD symbol based on a linker
  2260.    hash table entry.  */
  2261.  
  2262. static void
  2263. set_symbol_from_hash (asymbol *sym, struct bfd_link_hash_entry *h)
  2264. {
  2265.   switch (h->type)
  2266.     {
  2267.     default:
  2268.       abort ();
  2269.       break;
  2270.     case bfd_link_hash_new:
  2271.       /* This can happen when a constructor symbol is seen but we are
  2272.          not building constructors.  */
  2273.       if (sym->section != NULL)
  2274.         {
  2275.           BFD_ASSERT ((sym->flags & BSF_CONSTRUCTOR) != 0);
  2276.         }
  2277.       else
  2278.         {
  2279.           sym->flags |= BSF_CONSTRUCTOR;
  2280.           sym->section = bfd_abs_section_ptr;
  2281.           sym->value = 0;
  2282.         }
  2283.       break;
  2284.     case bfd_link_hash_undefined:
  2285.       sym->section = bfd_und_section_ptr;
  2286.       sym->value = 0;
  2287.       break;
  2288.     case bfd_link_hash_undefweak:
  2289.       sym->section = bfd_und_section_ptr;
  2290.       sym->value = 0;
  2291.       sym->flags |= BSF_WEAK;
  2292.       break;
  2293.     case bfd_link_hash_defined:
  2294.       sym->section = h->u.def.section;
  2295.       sym->value = h->u.def.value;
  2296.       break;
  2297.     case bfd_link_hash_defweak:
  2298.       sym->flags |= BSF_WEAK;
  2299.       sym->section = h->u.def.section;
  2300.       sym->value = h->u.def.value;
  2301.       break;
  2302.     case bfd_link_hash_common:
  2303.       sym->value = h->u.c.size;
  2304.       if (sym->section == NULL)
  2305.         sym->section = bfd_com_section_ptr;
  2306.       else if (! bfd_is_com_section (sym->section))
  2307.         {
  2308.           BFD_ASSERT (bfd_is_und_section (sym->section));
  2309.           sym->section = bfd_com_section_ptr;
  2310.         }
  2311.       /* Do not set the section; see _bfd_generic_link_output_symbols.  */
  2312.       break;
  2313.     case bfd_link_hash_indirect:
  2314.     case bfd_link_hash_warning:
  2315.       /* FIXME: What should we do here?  */
  2316.       break;
  2317.     }
  2318. }
  2319.  
  2320. /* Write out a global symbol, if it hasn't already been written out.
  2321.    This is called for each symbol in the hash table.  */
  2322.  
  2323. bfd_boolean
  2324. _bfd_generic_link_write_global_symbol (struct generic_link_hash_entry *h,
  2325.                                        void *data)
  2326. {
  2327.   struct generic_write_global_symbol_info *wginfo =
  2328.       (struct generic_write_global_symbol_info *) data;
  2329.   asymbol *sym;
  2330.  
  2331.   if (h->written)
  2332.     return TRUE;
  2333.  
  2334.   h->written = TRUE;
  2335.  
  2336.   if (wginfo->info->strip == strip_all
  2337.       || (wginfo->info->strip == strip_some
  2338.           && bfd_hash_lookup (wginfo->info->keep_hash, h->root.root.string,
  2339.                               FALSE, FALSE) == NULL))
  2340.     return TRUE;
  2341.  
  2342.   if (h->sym != NULL)
  2343.     sym = h->sym;
  2344.   else
  2345.     {
  2346.       sym = bfd_make_empty_symbol (wginfo->output_bfd);
  2347.       if (!sym)
  2348.         return FALSE;
  2349.       sym->name = h->root.root.string;
  2350.       sym->flags = 0;
  2351.     }
  2352.  
  2353.   set_symbol_from_hash (sym, &h->root);
  2354.  
  2355.   sym->flags |= BSF_GLOBAL;
  2356.  
  2357.   if (! generic_add_output_symbol (wginfo->output_bfd, wginfo->psymalloc,
  2358.                                    sym))
  2359.     {
  2360.       /* FIXME: No way to return failure.  */
  2361.       abort ();
  2362.     }
  2363.  
  2364.   return TRUE;
  2365. }
  2366.  
  2367. /* Create a relocation.  */
  2368.  
  2369. bfd_boolean
  2370. _bfd_generic_reloc_link_order (bfd *abfd,
  2371.                                struct bfd_link_info *info,
  2372.                                asection *sec,
  2373.                                struct bfd_link_order *link_order)
  2374. {
  2375.   arelent *r;
  2376.  
  2377.   if (! bfd_link_relocatable (info))
  2378.     abort ();
  2379.   if (sec->orelocation == NULL)
  2380.     abort ();
  2381.  
  2382.   r = (arelent *) bfd_alloc (abfd, sizeof (arelent));
  2383.   if (r == NULL)
  2384.     return FALSE;
  2385.  
  2386.   r->address = link_order->offset;
  2387.   r->howto = bfd_reloc_type_lookup (abfd, link_order->u.reloc.p->reloc);
  2388.   if (r->howto == 0)
  2389.     {
  2390.       bfd_set_error (bfd_error_bad_value);
  2391.       return FALSE;
  2392.     }
  2393.  
  2394.   /* Get the symbol to use for the relocation.  */
  2395.   if (link_order->type == bfd_section_reloc_link_order)
  2396.     r->sym_ptr_ptr = link_order->u.reloc.p->u.section->symbol_ptr_ptr;
  2397.   else
  2398.     {
  2399.       struct generic_link_hash_entry *h;
  2400.  
  2401.       h = ((struct generic_link_hash_entry *)
  2402.            bfd_wrapped_link_hash_lookup (abfd, info,
  2403.                                          link_order->u.reloc.p->u.name,
  2404.                                          FALSE, FALSE, TRUE));
  2405.       if (h == NULL
  2406.           || ! h->written)
  2407.         {
  2408.           if (! ((*info->callbacks->unattached_reloc)
  2409.                  (info, link_order->u.reloc.p->u.name, NULL, NULL, 0)))
  2410.             return FALSE;
  2411.           bfd_set_error (bfd_error_bad_value);
  2412.           return FALSE;
  2413.         }
  2414.       r->sym_ptr_ptr = &h->sym;
  2415.     }
  2416.  
  2417.   /* If this is an inplace reloc, write the addend to the object file.
  2418.      Otherwise, store it in the reloc addend.  */
  2419.   if (! r->howto->partial_inplace)
  2420.     r->addend = link_order->u.reloc.p->addend;
  2421.   else
  2422.     {
  2423.       bfd_size_type size;
  2424.       bfd_reloc_status_type rstat;
  2425.       bfd_byte *buf;
  2426.       bfd_boolean ok;
  2427.       file_ptr loc;
  2428.  
  2429.       size = bfd_get_reloc_size (r->howto);
  2430.       buf = (bfd_byte *) bfd_zmalloc (size);
  2431.       if (buf == NULL && size != 0)
  2432.         return FALSE;
  2433.       rstat = _bfd_relocate_contents (r->howto, abfd,
  2434.                                       (bfd_vma) link_order->u.reloc.p->addend,
  2435.                                       buf);
  2436.       switch (rstat)
  2437.         {
  2438.         case bfd_reloc_ok:
  2439.           break;
  2440.         default:
  2441.         case bfd_reloc_outofrange:
  2442.           abort ();
  2443.         case bfd_reloc_overflow:
  2444.           if (! ((*info->callbacks->reloc_overflow)
  2445.                  (info, NULL,
  2446.                   (link_order->type == bfd_section_reloc_link_order
  2447.                    ? bfd_section_name (abfd, link_order->u.reloc.p->u.section)
  2448.                    : link_order->u.reloc.p->u.name),
  2449.                   r->howto->name, link_order->u.reloc.p->addend,
  2450.                   NULL, NULL, 0)))
  2451.             {
  2452.               free (buf);
  2453.               return FALSE;
  2454.             }
  2455.           break;
  2456.         }
  2457.       loc = link_order->offset * bfd_octets_per_byte (abfd);
  2458.       ok = bfd_set_section_contents (abfd, sec, buf, loc, size);
  2459.       free (buf);
  2460.       if (! ok)
  2461.         return FALSE;
  2462.  
  2463.       r->addend = 0;
  2464.     }
  2465.  
  2466.   sec->orelocation[sec->reloc_count] = r;
  2467.   ++sec->reloc_count;
  2468.  
  2469.   return TRUE;
  2470. }
  2471. /* Allocate a new link_order for a section.  */
  2472.  
  2473. struct bfd_link_order *
  2474. bfd_new_link_order (bfd *abfd, asection *section)
  2475. {
  2476.   bfd_size_type amt = sizeof (struct bfd_link_order);
  2477.   struct bfd_link_order *new_lo;
  2478.  
  2479.   new_lo = (struct bfd_link_order *) bfd_zalloc (abfd, amt);
  2480.   if (!new_lo)
  2481.     return NULL;
  2482.  
  2483.   new_lo->type = bfd_undefined_link_order;
  2484.  
  2485.   if (section->map_tail.link_order != NULL)
  2486.     section->map_tail.link_order->next = new_lo;
  2487.   else
  2488.     section->map_head.link_order = new_lo;
  2489.   section->map_tail.link_order = new_lo;
  2490.  
  2491.   return new_lo;
  2492. }
  2493.  
  2494. /* Default link order processing routine.  Note that we can not handle
  2495.    the reloc_link_order types here, since they depend upon the details
  2496.    of how the particular backends generates relocs.  */
  2497.  
  2498. bfd_boolean
  2499. _bfd_default_link_order (bfd *abfd,
  2500.                          struct bfd_link_info *info,
  2501.                          asection *sec,
  2502.                          struct bfd_link_order *link_order)
  2503. {
  2504.   switch (link_order->type)
  2505.     {
  2506.     case bfd_undefined_link_order:
  2507.     case bfd_section_reloc_link_order:
  2508.     case bfd_symbol_reloc_link_order:
  2509.     default:
  2510.       abort ();
  2511.     case bfd_indirect_link_order:
  2512.       return default_indirect_link_order (abfd, info, sec, link_order,
  2513.                                           FALSE);
  2514.     case bfd_data_link_order:
  2515.       return default_data_link_order (abfd, info, sec, link_order);
  2516.     }
  2517. }
  2518.  
  2519. /* Default routine to handle a bfd_data_link_order.  */
  2520.  
  2521. static bfd_boolean
  2522. default_data_link_order (bfd *abfd,
  2523.                          struct bfd_link_info *info ATTRIBUTE_UNUSED,
  2524.                          asection *sec,
  2525.                          struct bfd_link_order *link_order)
  2526. {
  2527.   bfd_size_type size;
  2528.   size_t fill_size;
  2529.   bfd_byte *fill;
  2530.   file_ptr loc;
  2531.   bfd_boolean result;
  2532.  
  2533.   BFD_ASSERT ((sec->flags & SEC_HAS_CONTENTS) != 0);
  2534.  
  2535.   size = link_order->size;
  2536.   if (size == 0)
  2537.     return TRUE;
  2538.  
  2539.   fill = link_order->u.data.contents;
  2540.   fill_size = link_order->u.data.size;
  2541.   if (fill_size == 0)
  2542.     {
  2543.       fill = abfd->arch_info->fill (size, bfd_big_endian (abfd),
  2544.                                     (sec->flags & SEC_CODE) != 0);
  2545.       if (fill == NULL)
  2546.         return FALSE;
  2547.     }
  2548.   else if (fill_size < size)
  2549.     {
  2550.       bfd_byte *p;
  2551.       fill = (bfd_byte *) bfd_malloc (size);
  2552.       if (fill == NULL)
  2553.         return FALSE;
  2554.       p = fill;
  2555.       if (fill_size == 1)
  2556.         memset (p, (int) link_order->u.data.contents[0], (size_t) size);
  2557.       else
  2558.         {
  2559.           do
  2560.             {
  2561.               memcpy (p, link_order->u.data.contents, fill_size);
  2562.               p += fill_size;
  2563.               size -= fill_size;
  2564.             }
  2565.           while (size >= fill_size);
  2566.           if (size != 0)
  2567.             memcpy (p, link_order->u.data.contents, (size_t) size);
  2568.           size = link_order->size;
  2569.         }
  2570.     }
  2571.  
  2572.   loc = link_order->offset * bfd_octets_per_byte (abfd);
  2573.   result = bfd_set_section_contents (abfd, sec, fill, loc, size);
  2574.  
  2575.   if (fill != link_order->u.data.contents)
  2576.     free (fill);
  2577.   return result;
  2578. }
  2579.  
  2580. /* Default routine to handle a bfd_indirect_link_order.  */
  2581.  
  2582. static bfd_boolean
  2583. default_indirect_link_order (bfd *output_bfd,
  2584.                              struct bfd_link_info *info,
  2585.                              asection *output_section,
  2586.                              struct bfd_link_order *link_order,
  2587.                              bfd_boolean generic_linker)
  2588. {
  2589.   asection *input_section;
  2590.   bfd *input_bfd;
  2591.   bfd_byte *contents = NULL;
  2592.   bfd_byte *new_contents;
  2593.   bfd_size_type sec_size;
  2594.   file_ptr loc;
  2595.  
  2596.   BFD_ASSERT ((output_section->flags & SEC_HAS_CONTENTS) != 0);
  2597.  
  2598.   input_section = link_order->u.indirect.section;
  2599.   input_bfd = input_section->owner;
  2600.   if (input_section->size == 0)
  2601.     return TRUE;
  2602.  
  2603.   BFD_ASSERT (input_section->output_section == output_section);
  2604.   BFD_ASSERT (input_section->output_offset == link_order->offset);
  2605.   BFD_ASSERT (input_section->size == link_order->size);
  2606.  
  2607.   if (bfd_link_relocatable (info)
  2608.       && input_section->reloc_count > 0
  2609.       && output_section->orelocation == NULL)
  2610.     {
  2611.       /* Space has not been allocated for the output relocations.
  2612.          This can happen when we are called by a specific backend
  2613.          because somebody is attempting to link together different
  2614.          types of object files.  Handling this case correctly is
  2615.          difficult, and sometimes impossible.  */
  2616.       (*_bfd_error_handler)
  2617.         (_("Attempt to do relocatable link with %s input and %s output"),
  2618.          bfd_get_target (input_bfd), bfd_get_target (output_bfd));
  2619.       bfd_set_error (bfd_error_wrong_format);
  2620.       return FALSE;
  2621.     }
  2622.  
  2623.   if (! generic_linker)
  2624.     {
  2625.       asymbol **sympp;
  2626.       asymbol **symppend;
  2627.  
  2628.       /* Get the canonical symbols.  The generic linker will always
  2629.          have retrieved them by this point, but we are being called by
  2630.          a specific linker, presumably because we are linking
  2631.          different types of object files together.  */
  2632.       if (!bfd_generic_link_read_symbols (input_bfd))
  2633.         return FALSE;
  2634.  
  2635.       /* Since we have been called by a specific linker, rather than
  2636.          the generic linker, the values of the symbols will not be
  2637.          right.  They will be the values as seen in the input file,
  2638.          not the values of the final link.  We need to fix them up
  2639.          before we can relocate the section.  */
  2640.       sympp = _bfd_generic_link_get_symbols (input_bfd);
  2641.       symppend = sympp + _bfd_generic_link_get_symcount (input_bfd);
  2642.       for (; sympp < symppend; sympp++)
  2643.         {
  2644.           asymbol *sym;
  2645.           struct bfd_link_hash_entry *h;
  2646.  
  2647.           sym = *sympp;
  2648.  
  2649.           if ((sym->flags & (BSF_INDIRECT
  2650.                              | BSF_WARNING
  2651.                              | BSF_GLOBAL
  2652.                              | BSF_CONSTRUCTOR
  2653.                              | BSF_WEAK)) != 0
  2654.               || bfd_is_und_section (bfd_get_section (sym))
  2655.               || bfd_is_com_section (bfd_get_section (sym))
  2656.               || bfd_is_ind_section (bfd_get_section (sym)))
  2657.             {
  2658.               /* sym->udata may have been set by
  2659.                  generic_link_add_symbol_list.  */
  2660.               if (sym->udata.p != NULL)
  2661.                 h = (struct bfd_link_hash_entry *) sym->udata.p;
  2662.               else if (bfd_is_und_section (bfd_get_section (sym)))
  2663.                 h = bfd_wrapped_link_hash_lookup (output_bfd, info,
  2664.                                                   bfd_asymbol_name (sym),
  2665.                                                   FALSE, FALSE, TRUE);
  2666.               else
  2667.                 h = bfd_link_hash_lookup (info->hash,
  2668.                                           bfd_asymbol_name (sym),
  2669.                                           FALSE, FALSE, TRUE);
  2670.               if (h != NULL)
  2671.                 set_symbol_from_hash (sym, h);
  2672.             }
  2673.         }
  2674.     }
  2675.  
  2676.   if ((output_section->flags & (SEC_GROUP | SEC_LINKER_CREATED)) == SEC_GROUP
  2677.       && input_section->size != 0)
  2678.     {
  2679.       /* Group section contents are set by bfd_elf_set_group_contents.  */
  2680.       if (!output_bfd->output_has_begun)
  2681.         {
  2682.           /* FIXME: This hack ensures bfd_elf_set_group_contents is called.  */
  2683.           if (!bfd_set_section_contents (output_bfd, output_section, "", 0, 1))
  2684.             goto error_return;
  2685.         }
  2686.       new_contents = output_section->contents;
  2687.       BFD_ASSERT (new_contents != NULL);
  2688.       BFD_ASSERT (input_section->output_offset == 0);
  2689.     }
  2690.   else
  2691.     {
  2692.       /* Get and relocate the section contents.  */
  2693.       sec_size = (input_section->rawsize > input_section->size
  2694.                   ? input_section->rawsize
  2695.                   : input_section->size);
  2696.       contents = (bfd_byte *) bfd_malloc (sec_size);
  2697.       if (contents == NULL && sec_size != 0)
  2698.         goto error_return;
  2699.       new_contents = (bfd_get_relocated_section_contents
  2700.                       (output_bfd, info, link_order, contents,
  2701.                        bfd_link_relocatable (info),
  2702.                        _bfd_generic_link_get_symbols (input_bfd)));
  2703.       if (!new_contents)
  2704.         goto error_return;
  2705.     }
  2706.  
  2707.   /* Output the section contents.  */
  2708.   loc = input_section->output_offset * bfd_octets_per_byte (output_bfd);
  2709.   if (! bfd_set_section_contents (output_bfd, output_section,
  2710.                                   new_contents, loc, input_section->size))
  2711.     goto error_return;
  2712.  
  2713.   if (contents != NULL)
  2714.     free (contents);
  2715.   return TRUE;
  2716.  
  2717.  error_return:
  2718.   if (contents != NULL)
  2719.     free (contents);
  2720.   return FALSE;
  2721. }
  2722.  
  2723. /* A little routine to count the number of relocs in a link_order
  2724.    list.  */
  2725.  
  2726. unsigned int
  2727. _bfd_count_link_order_relocs (struct bfd_link_order *link_order)
  2728. {
  2729.   register unsigned int c;
  2730.   register struct bfd_link_order *l;
  2731.  
  2732.   c = 0;
  2733.   for (l = link_order; l != NULL; l = l->next)
  2734.     {
  2735.       if (l->type == bfd_section_reloc_link_order
  2736.           || l->type == bfd_symbol_reloc_link_order)
  2737.         ++c;
  2738.     }
  2739.  
  2740.   return c;
  2741. }
  2742.  
  2743. /*
  2744. FUNCTION
  2745.         bfd_link_split_section
  2746.  
  2747. SYNOPSIS
  2748.         bfd_boolean bfd_link_split_section (bfd *abfd, asection *sec);
  2749.  
  2750. DESCRIPTION
  2751.         Return nonzero if @var{sec} should be split during a
  2752.         reloceatable or final link.
  2753.  
  2754. .#define bfd_link_split_section(abfd, sec) \
  2755. .       BFD_SEND (abfd, _bfd_link_split_section, (abfd, sec))
  2756. .
  2757.  
  2758. */
  2759.  
  2760. bfd_boolean
  2761. _bfd_generic_link_split_section (bfd *abfd ATTRIBUTE_UNUSED,
  2762.                                  asection *sec ATTRIBUTE_UNUSED)
  2763. {
  2764.   return FALSE;
  2765. }
  2766.  
  2767. /*
  2768. FUNCTION
  2769.         bfd_section_already_linked
  2770.  
  2771. SYNOPSIS
  2772.         bfd_boolean bfd_section_already_linked (bfd *abfd,
  2773.                                                 asection *sec,
  2774.                                                 struct bfd_link_info *info);
  2775.  
  2776. DESCRIPTION
  2777.         Check if @var{data} has been already linked during a reloceatable
  2778.         or final link.  Return TRUE if it has.
  2779.  
  2780. .#define bfd_section_already_linked(abfd, sec, info) \
  2781. .       BFD_SEND (abfd, _section_already_linked, (abfd, sec, info))
  2782. .
  2783.  
  2784. */
  2785.  
  2786. /* Sections marked with the SEC_LINK_ONCE flag should only be linked
  2787.    once into the output.  This routine checks each section, and
  2788.    arrange to discard it if a section of the same name has already
  2789.    been linked.  This code assumes that all relevant sections have the
  2790.    SEC_LINK_ONCE flag set; that is, it does not depend solely upon the
  2791.    section name.  bfd_section_already_linked is called via
  2792.    bfd_map_over_sections.  */
  2793.  
  2794. /* The hash table.  */
  2795.  
  2796. static struct bfd_hash_table _bfd_section_already_linked_table;
  2797.  
  2798. /* Support routines for the hash table used by section_already_linked,
  2799.    initialize the table, traverse, lookup, fill in an entry and remove
  2800.    the table.  */
  2801.  
  2802. void
  2803. bfd_section_already_linked_table_traverse
  2804.   (bfd_boolean (*func) (struct bfd_section_already_linked_hash_entry *,
  2805.                         void *), void *info)
  2806. {
  2807.   bfd_hash_traverse (&_bfd_section_already_linked_table,
  2808.                      (bfd_boolean (*) (struct bfd_hash_entry *,
  2809.                                        void *)) func,
  2810.                      info);
  2811. }
  2812.  
  2813. struct bfd_section_already_linked_hash_entry *
  2814. bfd_section_already_linked_table_lookup (const char *name)
  2815. {
  2816.   return ((struct bfd_section_already_linked_hash_entry *)
  2817.           bfd_hash_lookup (&_bfd_section_already_linked_table, name,
  2818.                            TRUE, FALSE));
  2819. }
  2820.  
  2821. bfd_boolean
  2822. bfd_section_already_linked_table_insert
  2823.   (struct bfd_section_already_linked_hash_entry *already_linked_list,
  2824.    asection *sec)
  2825. {
  2826.   struct bfd_section_already_linked *l;
  2827.  
  2828.   /* Allocate the memory from the same obstack as the hash table is
  2829.      kept in.  */
  2830.   l = (struct bfd_section_already_linked *)
  2831.       bfd_hash_allocate (&_bfd_section_already_linked_table, sizeof *l);
  2832.   if (l == NULL)
  2833.     return FALSE;
  2834.   l->sec = sec;
  2835.   l->next = already_linked_list->entry;
  2836.   already_linked_list->entry = l;
  2837.   return TRUE;
  2838. }
  2839.  
  2840. static struct bfd_hash_entry *
  2841. already_linked_newfunc (struct bfd_hash_entry *entry ATTRIBUTE_UNUSED,
  2842.                         struct bfd_hash_table *table,
  2843.                         const char *string ATTRIBUTE_UNUSED)
  2844. {
  2845.   struct bfd_section_already_linked_hash_entry *ret =
  2846.     (struct bfd_section_already_linked_hash_entry *)
  2847.       bfd_hash_allocate (table, sizeof *ret);
  2848.  
  2849.   if (ret == NULL)
  2850.     return NULL;
  2851.  
  2852.   ret->entry = NULL;
  2853.  
  2854.   return &ret->root;
  2855. }
  2856.  
  2857. bfd_boolean
  2858. bfd_section_already_linked_table_init (void)
  2859. {
  2860.   return bfd_hash_table_init_n (&_bfd_section_already_linked_table,
  2861.                                 already_linked_newfunc,
  2862.                                 sizeof (struct bfd_section_already_linked_hash_entry),
  2863.                                 42);
  2864. }
  2865.  
  2866. void
  2867. bfd_section_already_linked_table_free (void)
  2868. {
  2869.   bfd_hash_table_free (&_bfd_section_already_linked_table);
  2870. }
  2871.  
  2872. /* Report warnings as appropriate for duplicate section SEC.
  2873.    Return FALSE if we decide to keep SEC after all.  */
  2874.  
  2875. bfd_boolean
  2876. _bfd_handle_already_linked (asection *sec,
  2877.                             struct bfd_section_already_linked *l,
  2878.                             struct bfd_link_info *info)
  2879. {
  2880.   switch (sec->flags & SEC_LINK_DUPLICATES)
  2881.     {
  2882.     default:
  2883.       abort ();
  2884.  
  2885.     case SEC_LINK_DUPLICATES_DISCARD:
  2886.       /* If we found an LTO IR match for this comdat group on
  2887.          the first pass, replace it with the LTO output on the
  2888.          second pass.  We can't simply choose real object
  2889.          files over IR because the first pass may contain a
  2890.          mix of LTO and normal objects and we must keep the
  2891.          first match, be it IR or real.  */
  2892.       if (sec->owner->lto_output
  2893.           && (l->sec->owner->flags & BFD_PLUGIN) != 0)
  2894.         {
  2895.           l->sec = sec;
  2896.           return FALSE;
  2897.         }
  2898.       break;
  2899.  
  2900.     case SEC_LINK_DUPLICATES_ONE_ONLY:
  2901.       info->callbacks->einfo
  2902.         (_("%B: ignoring duplicate section `%A'\n"),
  2903.          sec->owner, sec);
  2904.       break;
  2905.  
  2906.     case SEC_LINK_DUPLICATES_SAME_SIZE:
  2907.       if ((l->sec->owner->flags & BFD_PLUGIN) != 0)
  2908.         ;
  2909.       else if (sec->size != l->sec->size)
  2910.         info->callbacks->einfo
  2911.           (_("%B: duplicate section `%A' has different size\n"),
  2912.            sec->owner, sec);
  2913.       break;
  2914.  
  2915.     case SEC_LINK_DUPLICATES_SAME_CONTENTS:
  2916.       if ((l->sec->owner->flags & BFD_PLUGIN) != 0)
  2917.         ;
  2918.       else if (sec->size != l->sec->size)
  2919.         info->callbacks->einfo
  2920.           (_("%B: duplicate section `%A' has different size\n"),
  2921.            sec->owner, sec);
  2922.       else if (sec->size != 0)
  2923.         {
  2924.           bfd_byte *sec_contents, *l_sec_contents = NULL;
  2925.  
  2926.           if (!bfd_malloc_and_get_section (sec->owner, sec, &sec_contents))
  2927.             info->callbacks->einfo
  2928.               (_("%B: could not read contents of section `%A'\n"),
  2929.                sec->owner, sec);
  2930.           else if (!bfd_malloc_and_get_section (l->sec->owner, l->sec,
  2931.                                                 &l_sec_contents))
  2932.             info->callbacks->einfo
  2933.               (_("%B: could not read contents of section `%A'\n"),
  2934.                l->sec->owner, l->sec);
  2935.           else if (memcmp (sec_contents, l_sec_contents, sec->size) != 0)
  2936.             info->callbacks->einfo
  2937.               (_("%B: duplicate section `%A' has different contents\n"),
  2938.                sec->owner, sec);
  2939.  
  2940.           if (sec_contents)
  2941.             free (sec_contents);
  2942.           if (l_sec_contents)
  2943.             free (l_sec_contents);
  2944.         }
  2945.       break;
  2946.     }
  2947.  
  2948.   /* Set the output_section field so that lang_add_section
  2949.      does not create a lang_input_section structure for this
  2950.      section.  Since there might be a symbol in the section
  2951.      being discarded, we must retain a pointer to the section
  2952.      which we are really going to use.  */
  2953.   sec->output_section = bfd_abs_section_ptr;
  2954.   sec->kept_section = l->sec;
  2955.   return TRUE;
  2956. }
  2957.  
  2958. /* This is used on non-ELF inputs.  */
  2959.  
  2960. bfd_boolean
  2961. _bfd_generic_section_already_linked (bfd *abfd ATTRIBUTE_UNUSED,
  2962.                                      asection *sec,
  2963.                                      struct bfd_link_info *info)
  2964. {
  2965.   const char *name;
  2966.   struct bfd_section_already_linked *l;
  2967.   struct bfd_section_already_linked_hash_entry *already_linked_list;
  2968.  
  2969.   if ((sec->flags & SEC_LINK_ONCE) == 0)
  2970.     return FALSE;
  2971.  
  2972.   /* The generic linker doesn't handle section groups.  */
  2973.   if ((sec->flags & SEC_GROUP) != 0)
  2974.     return FALSE;
  2975.  
  2976.   /* FIXME: When doing a relocatable link, we may have trouble
  2977.      copying relocations in other sections that refer to local symbols
  2978.      in the section being discarded.  Those relocations will have to
  2979.      be converted somehow; as of this writing I'm not sure that any of
  2980.      the backends handle that correctly.
  2981.  
  2982.      It is tempting to instead not discard link once sections when
  2983.      doing a relocatable link (technically, they should be discarded
  2984.      whenever we are building constructors).  However, that fails,
  2985.      because the linker winds up combining all the link once sections
  2986.      into a single large link once section, which defeats the purpose
  2987.      of having link once sections in the first place.  */
  2988.  
  2989.   name = bfd_get_section_name (abfd, sec);
  2990.  
  2991.   already_linked_list = bfd_section_already_linked_table_lookup (name);
  2992.  
  2993.   l = already_linked_list->entry;
  2994.   if (l != NULL)
  2995.     {
  2996.       /* The section has already been linked.  See if we should
  2997.          issue a warning.  */
  2998.       return _bfd_handle_already_linked (sec, l, info);
  2999.     }
  3000.  
  3001.   /* This is the first section with this name.  Record it.  */
  3002.   if (!bfd_section_already_linked_table_insert (already_linked_list, sec))
  3003.     info->callbacks->einfo (_("%F%P: already_linked_table: %E\n"));
  3004.   return FALSE;
  3005. }
  3006.  
  3007. /* Choose a neighbouring section to S in OBFD that will be output, or
  3008.    the absolute section if ADDR is out of bounds of the neighbours.  */
  3009.  
  3010. asection *
  3011. _bfd_nearby_section (bfd *obfd, asection *s, bfd_vma addr)
  3012. {
  3013.   asection *next, *prev, *best;
  3014.  
  3015.   /* Find preceding kept section.  */
  3016.   for (prev = s->prev; prev != NULL; prev = prev->prev)
  3017.     if ((prev->flags & SEC_EXCLUDE) == 0
  3018.         && !bfd_section_removed_from_list (obfd, prev))
  3019.       break;
  3020.  
  3021.   /* Find following kept section.  Start at prev->next because
  3022.      other sections may have been added after S was removed.  */
  3023.   if (s->prev != NULL)
  3024.     next = s->prev->next;
  3025.   else
  3026.     next = s->owner->sections;
  3027.   for (; next != NULL; next = next->next)
  3028.     if ((next->flags & SEC_EXCLUDE) == 0
  3029.         && !bfd_section_removed_from_list (obfd, next))
  3030.       break;
  3031.  
  3032.   /* Choose better of two sections, based on flags.  The idea
  3033.      is to choose a section that will be in the same segment
  3034.      as S would have been if it was kept.  */
  3035.   best = next;
  3036.   if (prev == NULL)
  3037.     {
  3038.       if (next == NULL)
  3039.         best = bfd_abs_section_ptr;
  3040.     }
  3041.   else if (next == NULL)
  3042.     best = prev;
  3043.   else if (((prev->flags ^ next->flags)
  3044.             & (SEC_ALLOC | SEC_THREAD_LOCAL | SEC_LOAD)) != 0)
  3045.     {
  3046.       if (((next->flags ^ s->flags)
  3047.            & (SEC_ALLOC | SEC_THREAD_LOCAL)) != 0
  3048.           /* We prefer to choose a loaded section.  Section S
  3049.              doesn't have SEC_LOAD set (it being excluded, that
  3050.              part of the flag processing didn't happen) so we
  3051.              can't compare that flag to those of NEXT and PREV.  */
  3052.           || ((prev->flags & SEC_LOAD) != 0
  3053.               && (next->flags & SEC_LOAD) == 0))
  3054.         best = prev;
  3055.     }
  3056.   else if (((prev->flags ^ next->flags) & SEC_READONLY) != 0)
  3057.     {
  3058.       if (((next->flags ^ s->flags) & SEC_READONLY) != 0)
  3059.         best = prev;
  3060.     }
  3061.   else if (((prev->flags ^ next->flags) & SEC_CODE) != 0)
  3062.     {
  3063.       if (((next->flags ^ s->flags) & SEC_CODE) != 0)
  3064.         best = prev;
  3065.     }
  3066.   else
  3067.     {
  3068.       /* Flags we care about are the same.  Prefer the following
  3069.          section if that will result in a positive valued sym.  */
  3070.       if (addr < next->vma)
  3071.         best = prev;
  3072.     }
  3073.  
  3074.   return best;
  3075. }
  3076.  
  3077. /* Convert symbols in excluded output sections to use a kept section.  */
  3078.  
  3079. static bfd_boolean
  3080. fix_syms (struct bfd_link_hash_entry *h, void *data)
  3081. {
  3082.   bfd *obfd = (bfd *) data;
  3083.  
  3084.   if (h->type == bfd_link_hash_defined
  3085.       || h->type == bfd_link_hash_defweak)
  3086.     {
  3087.       asection *s = h->u.def.section;
  3088.       if (s != NULL
  3089.           && s->output_section != NULL
  3090.           && (s->output_section->flags & SEC_EXCLUDE) != 0
  3091.           && bfd_section_removed_from_list (obfd, s->output_section))
  3092.         {
  3093.           asection *op;
  3094.  
  3095.           h->u.def.value += s->output_offset + s->output_section->vma;
  3096.           op = _bfd_nearby_section (obfd, s->output_section, h->u.def.value);
  3097.           h->u.def.value -= op->vma;
  3098.           h->u.def.section = op;
  3099.         }
  3100.     }
  3101.  
  3102.   return TRUE;
  3103. }
  3104.  
  3105. void
  3106. _bfd_fix_excluded_sec_syms (bfd *obfd, struct bfd_link_info *info)
  3107. {
  3108.   bfd_link_hash_traverse (info->hash, fix_syms, obfd);
  3109. }
  3110.  
  3111. /*
  3112. FUNCTION
  3113.         bfd_generic_define_common_symbol
  3114.  
  3115. SYNOPSIS
  3116.         bfd_boolean bfd_generic_define_common_symbol
  3117.           (bfd *output_bfd, struct bfd_link_info *info,
  3118.            struct bfd_link_hash_entry *h);
  3119.  
  3120. DESCRIPTION
  3121.         Convert common symbol @var{h} into a defined symbol.
  3122.         Return TRUE on success and FALSE on failure.
  3123.  
  3124. .#define bfd_define_common_symbol(output_bfd, info, h) \
  3125. .       BFD_SEND (output_bfd, _bfd_define_common_symbol, (output_bfd, info, h))
  3126. .
  3127. */
  3128.  
  3129. bfd_boolean
  3130. bfd_generic_define_common_symbol (bfd *output_bfd,
  3131.                                   struct bfd_link_info *info ATTRIBUTE_UNUSED,
  3132.                                   struct bfd_link_hash_entry *h)
  3133. {
  3134.   unsigned int power_of_two;
  3135.   bfd_vma alignment, size;
  3136.   asection *section;
  3137.  
  3138.   BFD_ASSERT (h != NULL && h->type == bfd_link_hash_common);
  3139.  
  3140.   size = h->u.c.size;
  3141.   power_of_two = h->u.c.p->alignment_power;
  3142.   section = h->u.c.p->section;
  3143.  
  3144.   /* Increase the size of the section to align the common symbol.
  3145.      The alignment must be a power of two.  */
  3146.   alignment = bfd_octets_per_byte (output_bfd) << power_of_two;
  3147.   BFD_ASSERT (alignment != 0 && (alignment & -alignment) == alignment);
  3148.   section->size += alignment - 1;
  3149.   section->size &= -alignment;
  3150.  
  3151.   /* Adjust the section's overall alignment if necessary.  */
  3152.   if (power_of_two > section->alignment_power)
  3153.     section->alignment_power = power_of_two;
  3154.  
  3155.   /* Change the symbol from common to defined.  */
  3156.   h->type = bfd_link_hash_defined;
  3157.   h->u.def.section = section;
  3158.   h->u.def.value = section->size;
  3159.  
  3160.   /* Increase the size of the section.  */
  3161.   section->size += size;
  3162.  
  3163.   /* Make sure the section is allocated in memory, and make sure that
  3164.      it is no longer a common section.  */
  3165.   section->flags |= SEC_ALLOC;
  3166.   section->flags &= ~SEC_IS_COMMON;
  3167.   return TRUE;
  3168. }
  3169.  
  3170. /*
  3171. FUNCTION
  3172.         bfd_find_version_for_sym
  3173.  
  3174. SYNOPSIS
  3175.         struct bfd_elf_version_tree * bfd_find_version_for_sym
  3176.           (struct bfd_elf_version_tree *verdefs,
  3177.            const char *sym_name, bfd_boolean *hide);
  3178.  
  3179. DESCRIPTION
  3180.         Search an elf version script tree for symbol versioning
  3181.         info and export / don't-export status for a given symbol.
  3182.         Return non-NULL on success and NULL on failure; also sets
  3183.         the output @samp{hide} boolean parameter.
  3184.  
  3185. */
  3186.  
  3187. struct bfd_elf_version_tree *
  3188. bfd_find_version_for_sym (struct bfd_elf_version_tree *verdefs,
  3189.                           const char *sym_name,
  3190.                           bfd_boolean *hide)
  3191. {
  3192.   struct bfd_elf_version_tree *t;
  3193.   struct bfd_elf_version_tree *local_ver, *global_ver, *exist_ver;
  3194.   struct bfd_elf_version_tree *star_local_ver, *star_global_ver;
  3195.  
  3196.   local_ver = NULL;
  3197.   global_ver = NULL;
  3198.   star_local_ver = NULL;
  3199.   star_global_ver = NULL;
  3200.   exist_ver = NULL;
  3201.   for (t = verdefs; t != NULL; t = t->next)
  3202.     {
  3203.       if (t->globals.list != NULL)
  3204.         {
  3205.           struct bfd_elf_version_expr *d = NULL;
  3206.  
  3207.           while ((d = (*t->match) (&t->globals, d, sym_name)) != NULL)
  3208.             {
  3209.               if (d->literal || strcmp (d->pattern, "*") != 0)
  3210.                 global_ver = t;
  3211.               else
  3212.                 star_global_ver = t;
  3213.               if (d->symver)
  3214.                 exist_ver = t;
  3215.               d->script = 1;
  3216.               /* If the match is a wildcard pattern, keep looking for
  3217.                  a more explicit, perhaps even local, match.  */
  3218.               if (d->literal)
  3219.                 break;
  3220.             }
  3221.  
  3222.           if (d != NULL)
  3223.             break;
  3224.         }
  3225.  
  3226.       if (t->locals.list != NULL)
  3227.         {
  3228.           struct bfd_elf_version_expr *d = NULL;
  3229.  
  3230.           while ((d = (*t->match) (&t->locals, d, sym_name)) != NULL)
  3231.             {
  3232.               if (d->literal || strcmp (d->pattern, "*") != 0)
  3233.                 local_ver = t;
  3234.               else
  3235.                 star_local_ver = t;
  3236.               /* If the match is a wildcard pattern, keep looking for
  3237.                  a more explicit, perhaps even global, match.  */
  3238.               if (d->literal)
  3239.                 {
  3240.                   /* An exact match overrides a global wildcard.  */
  3241.                   global_ver = NULL;
  3242.                   star_global_ver = NULL;
  3243.                   break;
  3244.                 }
  3245.             }
  3246.  
  3247.           if (d != NULL)
  3248.             break;
  3249.         }
  3250.     }
  3251.  
  3252.   if (global_ver == NULL && local_ver == NULL)
  3253.     global_ver = star_global_ver;
  3254.  
  3255.   if (global_ver != NULL)
  3256.     {
  3257.       /* If we already have a versioned symbol that matches the
  3258.          node for this symbol, then we don't want to create a
  3259.          duplicate from the unversioned symbol.  Instead hide the
  3260.          unversioned symbol.  */
  3261.       *hide = exist_ver == global_ver;
  3262.       return global_ver;
  3263.     }
  3264.  
  3265.   if (local_ver == NULL)
  3266.     local_ver = star_local_ver;
  3267.  
  3268.   if (local_ver != NULL)
  3269.     {
  3270.       *hide = TRUE;
  3271.       return local_ver;
  3272.     }
  3273.  
  3274.   return NULL;
  3275. }
  3276.  
  3277. /*
  3278. FUNCTION
  3279.         bfd_hide_sym_by_version
  3280.  
  3281. SYNOPSIS
  3282.         bfd_boolean bfd_hide_sym_by_version
  3283.           (struct bfd_elf_version_tree *verdefs, const char *sym_name);
  3284.  
  3285. DESCRIPTION
  3286.         Search an elf version script tree for symbol versioning
  3287.         info for a given symbol.  Return TRUE if the symbol is hidden.
  3288.  
  3289. */
  3290.  
  3291. bfd_boolean
  3292. bfd_hide_sym_by_version (struct bfd_elf_version_tree *verdefs,
  3293.                          const char *sym_name)
  3294. {
  3295.   bfd_boolean hidden = FALSE;
  3296.   bfd_find_version_for_sym (verdefs, sym_name, &hidden);
  3297.   return hidden;
  3298. }
  3299.