1*3d8817e4Smiod /* ldctor.h - linker constructor support 2*3d8817e4Smiod Copyright 1991, 1992, 1993, 1994, 1995, 1998, 2000, 2002, 2003 3*3d8817e4Smiod Free Software Foundation, Inc. 4*3d8817e4Smiod 5*3d8817e4Smiod This file is part of GLD, the Gnu Linker. 6*3d8817e4Smiod 7*3d8817e4Smiod GLD is free software; you can redistribute it and/or modify 8*3d8817e4Smiod it under the terms of the GNU General Public License as published by 9*3d8817e4Smiod the Free Software Foundation; either version 2, or (at your option) 10*3d8817e4Smiod any later version. 11*3d8817e4Smiod 12*3d8817e4Smiod GLD is distributed in the hope that it will be useful, 13*3d8817e4Smiod but WITHOUT ANY WARRANTY; without even the implied warranty of 14*3d8817e4Smiod MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15*3d8817e4Smiod GNU General Public License for more details. 16*3d8817e4Smiod 17*3d8817e4Smiod You should have received a copy of the GNU General Public License 18*3d8817e4Smiod along with GLD; see the file COPYING. If not, write to the Free 19*3d8817e4Smiod Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA 20*3d8817e4Smiod 02110-1301, USA. */ 21*3d8817e4Smiod 22*3d8817e4Smiod #ifndef LDCTOR_H 23*3d8817e4Smiod #define LDCTOR_H 24*3d8817e4Smiod 25*3d8817e4Smiod /* List of statements needed to handle constructors */ 26*3d8817e4Smiod extern lang_statement_list_type constructor_list; 27*3d8817e4Smiod 28*3d8817e4Smiod /* Whether the constructors should be sorted. Note that this is 29*3d8817e4Smiod global for the entire link; we assume that there is only a single 30*3d8817e4Smiod CONSTRUCTORS command in the linker script. */ 31*3d8817e4Smiod extern bfd_boolean constructors_sorted; 32*3d8817e4Smiod 33*3d8817e4Smiod /* We keep a list of these structures for each set we build. */ 34*3d8817e4Smiod 35*3d8817e4Smiod struct set_info { 36*3d8817e4Smiod struct set_info *next; /* Next set. */ 37*3d8817e4Smiod struct bfd_link_hash_entry *h; /* Hash table entry. */ 38*3d8817e4Smiod bfd_reloc_code_real_type reloc; /* Reloc to use for an entry. */ 39*3d8817e4Smiod size_t count; /* Number of elements. */ 40*3d8817e4Smiod struct set_element *elements; /* Elements in set. */ 41*3d8817e4Smiod }; 42*3d8817e4Smiod 43*3d8817e4Smiod struct set_element { 44*3d8817e4Smiod struct set_element *next; /* Next element. */ 45*3d8817e4Smiod const char *name; /* Name in set (may be NULL). */ 46*3d8817e4Smiod asection *section; /* Section of value in set. */ 47*3d8817e4Smiod bfd_vma value; /* Value in set. */ 48*3d8817e4Smiod }; 49*3d8817e4Smiod 50*3d8817e4Smiod /* The sets we have seen. */ 51*3d8817e4Smiod 52*3d8817e4Smiod extern struct set_info *sets; 53*3d8817e4Smiod 54*3d8817e4Smiod extern void ldctor_add_set_entry 55*3d8817e4Smiod (struct bfd_link_hash_entry *, bfd_reloc_code_real_type, const char *, 56*3d8817e4Smiod asection *, bfd_vma); 57*3d8817e4Smiod extern void ldctor_build_sets 58*3d8817e4Smiod (void); 59*3d8817e4Smiod 60*3d8817e4Smiod #endif 61