ld/ldexp.h

   1 /* ldexp.h -
   2    Copyright 1991, 1992, 1993, 1994, 1995, 1998, 1999, 2000, 2001, 2002,
   3    2003, 2004, 2005, 2007, 2011 Free Software Foundation, Inc.
   4
   5    This file is part of the GNU Binutils.
   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 #ifndef LDEXP_H
  23 #define LDEXP_H
  24
  25 /* The result of an expression tree */
  26 typedef struct {
  27   bfd_vma value;
  28   char *str;
  29   asection *section;
  30   bfd_boolean valid_p;
  31 } etree_value_type;
  32
  33 enum node_tree_enum {
  34   etree_binary,
  35   etree_trinary,
  36   etree_unary,
  37   etree_name,
  38   etree_assign,
  39   etree_provide,
  40   etree_provided,
  41   etree_value,
  42   etree_assert,
  43   etree_rel
  44 };
  45
  46 typedef struct {
  47   int node_code;
  48   unsigned int lineno;
  49   enum  node_tree_enum node_class;
  50 } node_type;
  51
  52 typedef union etree_union {
  53   node_type type;
  54   struct {
  55     node_type type;
  56     union etree_union *lhs;
  57     union etree_union *rhs;
  58   } binary;
  59   struct {
  60     node_type type;
  61     union etree_union *cond;
  62     union etree_union *lhs;
  63     union etree_union *rhs;
  64   } trinary;
  65   struct {
  66     node_type type;
  67     const char *dst;
  68     union etree_union *src;
  69     bfd_boolean hidden;
  70   } assign;
  71   struct {
  72     node_type type;
  73     union etree_union *child;
  74   } unary;
  75   struct {
  76     node_type type;
  77     const char *name;
  78   } name;
  79   struct {
  80     node_type type;
  81     bfd_vma value;
  82     char *str;
  83   } value;
  84   struct {
  85     node_type type;
  86     asection *section;
  87     bfd_vma value;
  88   } rel;
  89   struct {
  90     node_type type;
  91     union etree_union *child;
  92     const char *message;
  93   } assert_s;
  94 } etree_type;
  95
  96 typedef enum {
  97   lang_first_phase_enum,
  98   lang_mark_phase_enum,
  99   lang_allocating_phase_enum,
 100   lang_final_phase_enum
 101 } lang_phase_type;
 102
 103 union lang_statement_union;
 104
 105 enum phase_enum {
 106   /* We step through the first four states here as we see the
 107      associated linker script tokens.  */
 108   exp_dataseg_none,
 109   exp_dataseg_align_seen,
 110   exp_dataseg_relro_seen,
 111   exp_dataseg_end_seen,
 112   /* The last three states are final, and affect the value returned
 113      by DATA_SEGMENT_ALIGN.  */
 114   exp_dataseg_relro_adjust,
 115   exp_dataseg_adjust,
 116   exp_dataseg_done
 117 };
 118
 119 enum relro_enum {
 120   exp_dataseg_relro_none,
 121   exp_dataseg_relro_start,
 122   exp_dataseg_relro_end,
 123 };
 124
 125 struct ldexp_control {
 126   /* Modify expression evaluation depending on this.  */
 127   lang_phase_type phase;
 128
 129   /* Principally used for diagnostics.  */
 130   bfd_boolean assigning_to_dot;
 131
 132   /* Working results.  */
 133   etree_value_type result;
 134   bfd_vma dot;
 135   /* Set if an expression contains DEFINED().  */
 136   bfd_boolean uses_defined;
 137
 138   /* Current dot and section passed to ldexp folder.  */
 139   bfd_vma *dotp;
 140   asection *section;
 141
 142   /* State machine and results for DATASEG.  */
 143   struct {
 144     enum phase_enum phase;
 145
 146     bfd_vma base, min_base, relro_end, end, pagesize, maxpagesize;
 147
 148     enum relro_enum relro;
 149
 150     union lang_statement_union *relro_start_stat;
 151     union lang_statement_union *relro_end_stat;
 152   } dataseg;
 153 };
 154
 155 extern struct ldexp_control expld;
 156
 157 /* A maps from a segment name to a base address.  */
 158 typedef struct segment_struct {
 159   /* The next segment in the linked list.  */
 160   struct segment_struct *next;
 161   /* The name of the sgement.  */
 162   const char *name;
 163   /* The base address for the segment.  */
 164   bfd_vma value;
 165   /* True if a SEGMENT_START directive corresponding to this segment
 166      has been seen.  */
 167   bfd_boolean used;
 168 } segment_type;
 169
 170 /* The segments specified by the user on the command-line.  */
 171 extern segment_type *segments;
 172
 173 typedef struct _fill_type fill_type;
 174
 175 etree_type *exp_intop
 176   (bfd_vma);
 177 etree_type *exp_bigintop
 178   (bfd_vma, char *);
 179 etree_type *exp_relop
 180   (asection *, bfd_vma);
 181 void exp_fold_tree
 182   (etree_type *, asection *, bfd_vma *);
 183 void exp_fold_tree_no_dot
 184   (etree_type *);
 185 etree_type *exp_binop
 186   (int, etree_type *, etree_type *);
 187 etree_type *exp_trinop
 188   (int,etree_type *, etree_type *, etree_type *);
 189 etree_type *exp_unop
 190   (int, etree_type *);
 191 etree_type *exp_nameop
 192   (int, const char *);
 193 etree_type *exp_assop
 194   (int, const char *, etree_type *);
 195 etree_type *exp_provide
 196   (const char *, etree_type *, bfd_boolean);
 197 etree_type *exp_assert
 198   (etree_type *, const char *);
 199 void exp_print_tree
 200   (etree_type *);
 201 bfd_vma exp_get_vma
 202   (etree_type *, bfd_vma, char *);
 203 int exp_get_value_int
 204   (etree_type *, int, char *);
 205 fill_type *exp_get_fill
 206   (etree_type *, fill_type *, char *);
 207 bfd_vma exp_get_abs_int
 208   (etree_type *, int, char *);
 209
 210 #endif