2006-11-03 19:26:11 +01:00
|
|
|
// common.cc -- handle common symbols for gold
|
|
|
|
|
2008-03-13 22:04:21 +01:00
|
|
|
// Copyright 2006, 2007, 2008 Free Software Foundation, Inc.
|
2007-09-22 23:02:10 +02:00
|
|
|
// Written by Ian Lance Taylor <iant@google.com>.
|
|
|
|
|
|
|
|
// This file is part of gold.
|
|
|
|
|
|
|
|
// This program is free software; you can redistribute it and/or modify
|
|
|
|
// it under the terms of the GNU General Public License as published by
|
|
|
|
// the Free Software Foundation; either version 3 of the License, or
|
|
|
|
// (at your option) any later version.
|
|
|
|
|
|
|
|
// This program is distributed in the hope that it will be useful,
|
|
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
// GNU General Public License for more details.
|
|
|
|
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
|
|
// along with this program; if not, write to the Free Software
|
|
|
|
// Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
|
|
|
|
// MA 02110-1301, USA.
|
|
|
|
|
2006-11-03 19:26:11 +01:00
|
|
|
#include "gold.h"
|
|
|
|
|
|
|
|
#include <algorithm>
|
|
|
|
|
|
|
|
#include "workqueue.h"
|
2008-05-21 23:37:44 +02:00
|
|
|
#include "mapfile.h"
|
2006-11-03 19:26:11 +01:00
|
|
|
#include "layout.h"
|
|
|
|
#include "output.h"
|
2006-11-06 23:46:08 +01:00
|
|
|
#include "symtab.h"
|
2006-11-03 19:26:11 +01:00
|
|
|
#include "common.h"
|
|
|
|
|
|
|
|
namespace gold
|
|
|
|
{
|
|
|
|
|
|
|
|
// Allocate_commons_task methods.
|
|
|
|
|
|
|
|
// This task allocates the common symbols. We need a lock on the
|
|
|
|
// symbol table.
|
|
|
|
|
2007-12-14 20:00:21 +01:00
|
|
|
Task_token*
|
|
|
|
Allocate_commons_task::is_runnable()
|
2006-11-03 19:26:11 +01:00
|
|
|
{
|
|
|
|
if (!this->symtab_lock_->is_writable())
|
2007-12-14 20:00:21 +01:00
|
|
|
return this->symtab_lock_;
|
|
|
|
return NULL;
|
2006-11-03 19:26:11 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Return the locks we hold: one on the symbol table, and one blocker.
|
|
|
|
|
2007-12-14 20:00:21 +01:00
|
|
|
void
|
|
|
|
Allocate_commons_task::locks(Task_locker* tl)
|
2006-11-03 19:26:11 +01:00
|
|
|
{
|
2007-12-14 20:00:21 +01:00
|
|
|
tl->add(this, this->blocker_);
|
|
|
|
tl->add(this, this->symtab_lock_);
|
2006-11-03 19:26:11 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Allocate the common symbols.
|
|
|
|
|
|
|
|
void
|
|
|
|
Allocate_commons_task::run(Workqueue*)
|
|
|
|
{
|
2008-05-21 23:37:44 +02:00
|
|
|
this->symtab_->allocate_commons(this->layout_, this->mapfile_);
|
2006-11-03 19:26:11 +01:00
|
|
|
}
|
|
|
|
|
2009-12-31 02:57:55 +01:00
|
|
|
// This class is used to sort the common symbol. We normally put the
|
|
|
|
// larger common symbols first. This can be changed by using
|
|
|
|
// --sort-commons, which tells the linker to sort by alignment.
|
2006-11-03 19:26:11 +01:00
|
|
|
|
|
|
|
template<int size>
|
|
|
|
class Sort_commons
|
|
|
|
{
|
|
|
|
public:
|
2009-12-31 02:57:55 +01:00
|
|
|
Sort_commons(const Symbol_table* symtab,
|
|
|
|
Symbol_table::Sort_commons_order sort_order)
|
|
|
|
: symtab_(symtab), sort_order_(sort_order)
|
2006-11-03 19:26:11 +01:00
|
|
|
{ }
|
|
|
|
|
|
|
|
bool operator()(const Symbol* a, const Symbol* b) const;
|
|
|
|
|
|
|
|
private:
|
2009-12-31 02:57:55 +01:00
|
|
|
// The symbol table.
|
2006-11-03 19:26:11 +01:00
|
|
|
const Symbol_table* symtab_;
|
2009-12-31 02:57:55 +01:00
|
|
|
// How to sort.
|
|
|
|
Symbol_table::Sort_commons_order sort_order_;
|
2006-11-03 19:26:11 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
template<int size>
|
|
|
|
bool
|
|
|
|
Sort_commons<size>::operator()(const Symbol* pa, const Symbol* pb) const
|
|
|
|
{
|
|
|
|
if (pa == NULL)
|
2009-12-31 06:07:22 +01:00
|
|
|
{
|
|
|
|
if (pb == NULL)
|
|
|
|
{
|
|
|
|
// Stabilize sort. The order really doesn't matter, because
|
|
|
|
// these entries will be discarded, but we want to return
|
|
|
|
// the same result every time we compare pa and pb.
|
|
|
|
return pa < pb;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
2006-11-03 19:26:11 +01:00
|
|
|
if (pb == NULL)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
const Symbol_table* symtab = this->symtab_;
|
2008-02-29 20:19:17 +01:00
|
|
|
const Sized_symbol<size>* psa = symtab->get_sized_symbol<size>(pa);
|
|
|
|
const Sized_symbol<size>* psb = symtab->get_sized_symbol<size>(pb);
|
2006-11-03 19:26:11 +01:00
|
|
|
|
2009-12-31 02:57:55 +01:00
|
|
|
// The size.
|
2006-11-03 19:26:11 +01:00
|
|
|
typename Sized_symbol<size>::Size_type sa = psa->symsize();
|
|
|
|
typename Sized_symbol<size>::Size_type sb = psb->symsize();
|
2009-12-31 02:57:55 +01:00
|
|
|
|
|
|
|
// The alignment.
|
|
|
|
typename Sized_symbol<size>::Value_type aa = psa->value();
|
|
|
|
typename Sized_symbol<size>::Value_type ab = psb->value();
|
|
|
|
|
|
|
|
if (this->sort_order_ == Symbol_table::SORT_COMMONS_BY_ALIGNMENT_DESCENDING)
|
|
|
|
{
|
|
|
|
if (aa < ab)
|
|
|
|
return false;
|
|
|
|
else if (ab < aa)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
else if (this->sort_order_
|
|
|
|
== Symbol_table::SORT_COMMONS_BY_ALIGNMENT_ASCENDING)
|
|
|
|
{
|
|
|
|
if (aa < ab)
|
|
|
|
return true;
|
|
|
|
else if (ab < aa)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
gold_assert(this->sort_order_
|
|
|
|
== Symbol_table::SORT_COMMONS_BY_SIZE_DESCENDING);
|
|
|
|
|
|
|
|
// Sort by descending size.
|
2006-11-03 19:26:11 +01:00
|
|
|
if (sa < sb)
|
|
|
|
return false;
|
2008-03-27 20:57:41 +01:00
|
|
|
else if (sb < sa)
|
2006-11-03 19:26:11 +01:00
|
|
|
return true;
|
|
|
|
|
2009-12-31 02:57:55 +01:00
|
|
|
if (this->sort_order_ == Symbol_table::SORT_COMMONS_BY_SIZE_DESCENDING)
|
|
|
|
{
|
|
|
|
// When the symbols are the same size, we sort them by
|
|
|
|
// alignment, largest alignment first.
|
|
|
|
if (aa < ab)
|
|
|
|
return false;
|
|
|
|
else if (ab < aa)
|
|
|
|
return true;
|
|
|
|
}
|
2006-11-03 19:26:11 +01:00
|
|
|
|
|
|
|
// Otherwise we stabilize the sort by sorting by name.
|
|
|
|
return strcmp(psa->name(), psb->name()) < 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Allocate the common symbols.
|
|
|
|
|
|
|
|
void
|
2008-05-21 23:37:44 +02:00
|
|
|
Symbol_table::allocate_commons(Layout* layout, Mapfile* mapfile)
|
2006-11-03 19:26:11 +01:00
|
|
|
{
|
2009-12-31 02:57:55 +01:00
|
|
|
Sort_commons_order sort_order;
|
|
|
|
if (!parameters->options().user_set_sort_common())
|
|
|
|
sort_order = SORT_COMMONS_BY_SIZE_DESCENDING;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
const char* order = parameters->options().sort_common();
|
|
|
|
if (*order == '\0' || strcmp(order, "descending") == 0)
|
|
|
|
sort_order = SORT_COMMONS_BY_ALIGNMENT_DESCENDING;
|
|
|
|
else if (strcmp(order, "ascending") == 0)
|
|
|
|
sort_order = SORT_COMMONS_BY_ALIGNMENT_ASCENDING;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
gold_error("invalid --sort-common argument: %s", order);
|
|
|
|
sort_order = SORT_COMMONS_BY_SIZE_DESCENDING;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-02-28 01:18:24 +01:00
|
|
|
if (parameters->target().get_size() == 32)
|
2007-09-19 08:01:35 +02:00
|
|
|
{
|
|
|
|
#if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
|
2009-12-31 02:57:55 +01:00
|
|
|
this->do_allocate_commons<32>(layout, mapfile, sort_order);
|
2007-09-19 08:01:35 +02:00
|
|
|
#else
|
|
|
|
gold_unreachable();
|
|
|
|
#endif
|
|
|
|
}
|
2008-02-28 01:18:24 +01:00
|
|
|
else if (parameters->target().get_size() == 64)
|
2007-09-19 08:01:35 +02:00
|
|
|
{
|
|
|
|
#if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
|
2009-12-31 02:57:55 +01:00
|
|
|
this->do_allocate_commons<64>(layout, mapfile, sort_order);
|
2007-09-19 08:01:35 +02:00
|
|
|
#else
|
|
|
|
gold_unreachable();
|
|
|
|
#endif
|
|
|
|
}
|
2006-11-03 19:26:11 +01:00
|
|
|
else
|
2006-11-29 18:56:40 +01:00
|
|
|
gold_unreachable();
|
2006-11-03 19:26:11 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Allocated the common symbols, sized version.
|
|
|
|
|
|
|
|
template<int size>
|
|
|
|
void
|
2009-12-31 02:57:55 +01:00
|
|
|
Symbol_table::do_allocate_commons(Layout* layout, Mapfile* mapfile,
|
|
|
|
Sort_commons_order sort_order)
|
2008-04-17 09:12:00 +02:00
|
|
|
{
|
2009-06-22 08:51:53 +02:00
|
|
|
if (!this->commons_.empty())
|
|
|
|
this->do_allocate_commons_list<size>(layout, COMMONS_NORMAL,
|
2009-12-31 02:57:55 +01:00
|
|
|
&this->commons_, mapfile,
|
|
|
|
sort_order);
|
2009-06-22 08:51:53 +02:00
|
|
|
if (!this->tls_commons_.empty())
|
|
|
|
this->do_allocate_commons_list<size>(layout, COMMONS_TLS,
|
2009-12-31 02:57:55 +01:00
|
|
|
&this->tls_commons_, mapfile,
|
|
|
|
sort_order);
|
2009-06-22 08:51:53 +02:00
|
|
|
if (!this->small_commons_.empty())
|
|
|
|
this->do_allocate_commons_list<size>(layout, COMMONS_SMALL,
|
2009-12-31 02:57:55 +01:00
|
|
|
&this->small_commons_, mapfile,
|
|
|
|
sort_order);
|
2009-06-22 08:51:53 +02:00
|
|
|
if (!this->large_commons_.empty())
|
|
|
|
this->do_allocate_commons_list<size>(layout, COMMONS_LARGE,
|
2009-12-31 02:57:55 +01:00
|
|
|
&this->large_commons_, mapfile,
|
|
|
|
sort_order);
|
2008-04-17 09:12:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Allocate the common symbols in a list. IS_TLS indicates whether
|
|
|
|
// these are TLS common symbols.
|
|
|
|
|
|
|
|
template<int size>
|
|
|
|
void
|
2009-06-22 08:51:53 +02:00
|
|
|
Symbol_table::do_allocate_commons_list(
|
|
|
|
Layout* layout,
|
|
|
|
Commons_section_type commons_section_type,
|
|
|
|
Commons_type* commons,
|
2009-12-31 02:57:55 +01:00
|
|
|
Mapfile* mapfile,
|
|
|
|
Sort_commons_order sort_order)
|
2006-11-03 19:26:11 +01:00
|
|
|
{
|
|
|
|
typedef typename Sized_symbol<size>::Value_type Value_type;
|
|
|
|
typedef typename Sized_symbol<size>::Size_type Size_type;
|
|
|
|
|
|
|
|
// We've kept a list of all the common symbols. But the symbol may
|
|
|
|
// have been resolved to a defined symbol by now. And it may be a
|
|
|
|
// forwarder. First remove all non-common symbols.
|
|
|
|
bool any = false;
|
|
|
|
uint64_t addralign = 0;
|
2008-04-17 09:12:00 +02:00
|
|
|
for (Commons_type::iterator p = commons->begin();
|
|
|
|
p != commons->end();
|
2006-11-03 19:26:11 +01:00
|
|
|
++p)
|
|
|
|
{
|
|
|
|
Symbol* sym = *p;
|
|
|
|
if (sym->is_forwarder())
|
|
|
|
{
|
|
|
|
sym = this->resolve_forwards(sym);
|
|
|
|
*p = sym;
|
|
|
|
}
|
|
|
|
if (!sym->is_common())
|
|
|
|
*p = NULL;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
any = true;
|
2008-02-29 20:19:17 +01:00
|
|
|
Sized_symbol<size>* ssym = this->get_sized_symbol<size>(sym);
|
2006-11-03 19:26:11 +01:00
|
|
|
if (ssym->value() > addralign)
|
|
|
|
addralign = ssym->value();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!any)
|
|
|
|
return;
|
|
|
|
|
2009-12-31 02:57:55 +01:00
|
|
|
// Sort the common symbols.
|
2008-04-17 09:12:00 +02:00
|
|
|
std::sort(commons->begin(), commons->end(),
|
2009-12-31 02:57:55 +01:00
|
|
|
Sort_commons<size>(this, sort_order));
|
2006-11-03 19:26:11 +01:00
|
|
|
|
2008-04-17 09:12:00 +02:00
|
|
|
// Place them in a newly allocated BSS section.
|
|
|
|
elfcpp::Elf_Xword flags = elfcpp::SHF_WRITE | elfcpp::SHF_ALLOC;
|
2009-06-22 08:51:53 +02:00
|
|
|
const char* name;
|
|
|
|
const char* ds_name;
|
|
|
|
switch (commons_section_type)
|
2008-04-17 09:12:00 +02:00
|
|
|
{
|
2009-06-22 08:51:53 +02:00
|
|
|
case COMMONS_NORMAL:
|
|
|
|
name = ".bss";
|
|
|
|
ds_name = "** common";
|
|
|
|
break;
|
|
|
|
case COMMONS_TLS:
|
2008-04-17 09:12:00 +02:00
|
|
|
flags |= elfcpp::SHF_TLS;
|
2009-06-22 08:51:53 +02:00
|
|
|
name = ".tbss";
|
|
|
|
ds_name = "** tls common";
|
|
|
|
break;
|
|
|
|
case COMMONS_SMALL:
|
|
|
|
flags |= parameters->target().small_common_section_flags();
|
|
|
|
name = ".sbss";
|
|
|
|
ds_name = "** small common";
|
|
|
|
break;
|
|
|
|
case COMMONS_LARGE:
|
|
|
|
flags |= parameters->target().large_common_section_flags();
|
|
|
|
name = ".lbss";
|
|
|
|
ds_name = "** large common";
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
gold_unreachable();
|
|
|
|
}
|
|
|
|
|
|
|
|
Output_data_space *poc = new Output_data_space(addralign, ds_name);
|
|
|
|
Output_section *os = layout->add_output_section_data(name,
|
|
|
|
elfcpp::SHT_NOBITS,
|
2009-12-30 07:57:17 +01:00
|
|
|
flags, poc, false,
|
|
|
|
false, false, false);
|
2009-06-22 08:51:53 +02:00
|
|
|
if (os != NULL)
|
|
|
|
{
|
|
|
|
if (commons_section_type == COMMONS_SMALL)
|
|
|
|
os->set_is_small_section();
|
|
|
|
else if (commons_section_type == COMMONS_LARGE)
|
|
|
|
os->set_is_large_section();
|
2008-04-17 09:12:00 +02:00
|
|
|
}
|
2006-11-03 19:26:11 +01:00
|
|
|
|
|
|
|
// Allocate them all.
|
|
|
|
|
|
|
|
off_t off = 0;
|
2008-04-17 09:12:00 +02:00
|
|
|
for (Commons_type::iterator p = commons->begin();
|
|
|
|
p != commons->end();
|
2006-11-03 19:26:11 +01:00
|
|
|
++p)
|
|
|
|
{
|
|
|
|
Symbol* sym = *p;
|
|
|
|
if (sym == NULL)
|
|
|
|
break;
|
2009-12-31 06:07:22 +01:00
|
|
|
|
|
|
|
// Because we followed forwarding symbols above, but we didn't
|
|
|
|
// do it reliably before adding symbols to the list, it is
|
|
|
|
// possible for us to have the same symbol on the list twice.
|
|
|
|
// This can happen in the horrible case where a program defines
|
|
|
|
// a common symbol with the same name as a versioned libc
|
|
|
|
// symbol. That will show up here as a symbol which has already
|
|
|
|
// been allocated and is therefore no longer a common symbol.
|
|
|
|
if (!sym->is_common())
|
|
|
|
continue;
|
|
|
|
|
2008-02-29 20:19:17 +01:00
|
|
|
Sized_symbol<size>* ssym = this->get_sized_symbol<size>(sym);
|
2008-05-21 23:37:44 +02:00
|
|
|
|
|
|
|
// Record the symbol in the map file now, before we change its
|
|
|
|
// value. Pass the size in separately so that we don't have to
|
|
|
|
// templatize the map code, which is not performance sensitive.
|
|
|
|
if (mapfile != NULL)
|
|
|
|
mapfile->report_allocate_common(sym, ssym->symsize());
|
|
|
|
|
2006-11-03 19:26:11 +01:00
|
|
|
off = align_address(off, ssym->value());
|
2007-11-22 01:05:51 +01:00
|
|
|
ssym->allocate_common(poc, off);
|
|
|
|
off += ssym->symsize();
|
2006-11-03 19:26:11 +01:00
|
|
|
}
|
|
|
|
|
2007-11-29 21:10:17 +01:00
|
|
|
poc->set_current_data_size(off);
|
2006-11-03 19:26:11 +01:00
|
|
|
|
2008-04-17 09:12:00 +02:00
|
|
|
commons->clear();
|
2006-11-03 19:26:11 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
} // End namespace gold.
|