ld/ldexp.c

   1 /* This module handles expression trees.
   2    Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
   3    2001, 2002, 2003, 2004
   4    Free Software Foundation, Inc.
   5    Written by Steve Chamberlain of Cygnus Support <sac@cygnus.com>.
   6
   7    This file is part of GLD, the Gnu Linker.
   8
   9    GLD is free software; you can redistribute it and/or modify
  10    it under the terms of the GNU General Public License as published by
  11    the Free Software Foundation; either version 2, or (at your option)
  12    any later version.
  13
  14    GLD is distributed in the hope that it will be useful,
  15    but WITHOUT ANY WARRANTY; without even the implied warranty of
  16    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  17    GNU General Public License for more details.
  18
  19    You should have received a copy of the GNU General Public License
  20    along with GLD; see the file COPYING.  If not, write to the Free
  21    Software Foundation, 59 Temple Place - Suite 330, Boston, MA
  22    02111-1307, USA.  */
  23
  24 /* This module is in charge of working out the contents of expressions.
  25
  26    It has to keep track of the relative/absness of a symbol etc. This
  27    is done by keeping all values in a struct (an etree_value_type)
  28    which contains a value, a section to which it is relative and a
  29    valid bit.  */
  30
  31 #include "bfd.h"
  32 #include "sysdep.h"
  33 #include "bfdlink.h"
  34
  35 #include "ld.h"
  36 #include "ldmain.h"
  37 #include "ldmisc.h"
  38 #include "ldexp.h"
  39 #include <ldgram.h>
  40 #include "ldlang.h"
  41 #include "libiberty.h"
  42 #include "safe-ctype.h"
  43
  44 static etree_value_type exp_fold_tree_no_dot
  45   (etree_type *, lang_output_section_statement_type *, lang_phase_type);
  46 static bfd_vma align_n
  47   (bfd_vma, bfd_vma);
  48
  49 struct exp_data_seg exp_data_seg;
  50
  51 segment_type *segments;
  52
  53 /* Print the string representation of the given token.  Surround it
  54    with spaces if INFIX_P is TRUE.  */
  55
  56 static void
  57 exp_print_token (token_code_type code, int infix_p)
  58 {
  59   static const struct
  60   {
  61     token_code_type code;
  62     char * name;
  63   }
  64   table[] =
  65   {
  66     { INT, "int" },
  67     { NAME, "NAME" },
  68     { PLUSEQ, "+=" },
  69     { MINUSEQ, "-=" },
  70     { MULTEQ, "*=" },
  71     { DIVEQ, "/=" },
  72     { LSHIFTEQ, "<<=" },
  73     { RSHIFTEQ, ">>=" },
  74     { ANDEQ, "&=" },
  75     { OREQ, "|=" },
  76     { OROR, "||" },
  77     { ANDAND, "&&" },
  78     { EQ, "==" },
  79     { NE, "!=" },
  80     { LE, "<=" },
  81     { GE, ">=" },
  82     { LSHIFT, "<<" },
  83     { RSHIFT, ">>" },
  84     { ALIGN_K, "ALIGN" },
  85     { BLOCK, "BLOCK" },
  86     { QUAD, "QUAD" },
  87     { SQUAD, "SQUAD" },
  88     { LONG, "LONG" },
  89     { SHORT, "SHORT" },
  90     { BYTE, "BYTE" },
  91     { SECTIONS, "SECTIONS" },
  92     { SIZEOF_HEADERS, "SIZEOF_HEADERS" },
  93     { MEMORY, "MEMORY" },
  94     { DEFINED, "DEFINED" },
  95     { TARGET_K, "TARGET" },
  96     { SEARCH_DIR, "SEARCH_DIR" },
  97     { MAP, "MAP" },
  98     { ENTRY, "ENTRY" },
  99     { NEXT, "NEXT" },
 100     { SIZEOF, "SIZEOF" },
 101     { ADDR, "ADDR" },
 102     { LOADADDR, "LOADADDR" },
 103     { MAX_K, "MAX_K" },
 104     { REL, "relocatable" },
 105     { DATA_SEGMENT_ALIGN, "DATA_SEGMENT_ALIGN" },
 106     { DATA_SEGMENT_RELRO_END, "DATA_SEGMENT_RELRO_END" },
 107     { DATA_SEGMENT_END, "DATA_SEGMENT_END" },
 108     { ORIGIN, "ORIGIN" },
 109     { LENGTH, "LENGTH" },
 110     { SEGMENT_START, "SEGMENT_START" }
 111   };
 112   unsigned int idx;
 113
 114   for (idx = 0; idx < ARRAY_SIZE (table); idx++)
 115     if (table[idx].code == code)
 116       break;
 117
 118   if (infix_p)
 119     fputc (' ', config.map_file);
 120
 121   if (idx < ARRAY_SIZE (table))
 122     fputs (table[idx].name, config.map_file);
 123   else if (code < 127)
 124     fputc (code, config.map_file);
 125   else
 126     fprintf (config.map_file, "<code %d>", code);
 127
 128   if (infix_p)
 129     fputc (' ', config.map_file);
 130 }
 131
 132 static void
 133 make_abs (etree_value_type *ptr)
 134 {
 135   asection *s = ptr->section->bfd_section;
 136   ptr->value += s->vma;
 137   ptr->section = abs_output_section;
 138 }
 139
 140 static etree_value_type
 141 new_abs (bfd_vma value)
 142 {
 143   etree_value_type new;
 144   new.valid_p = TRUE;
 145   new.section = abs_output_section;
 146   new.value = value;
 147   return new;
 148 }
 149
 150 etree_type *
 151 exp_intop (bfd_vma value)
 152 {
 153   etree_type *new = stat_alloc (sizeof (new->value));
 154   new->type.node_code = INT;
 155   new->value.value = value;
 156   new->value.str = NULL;
 157   new->type.node_class = etree_value;
 158   return new;
 159 }
 160
 161 etree_type *
 162 exp_bigintop (bfd_vma value, char *str)
 163 {
 164   etree_type *new = stat_alloc (sizeof (new->value));
 165   new->type.node_code = INT;
 166   new->value.value = value;
 167   new->value.str = str;
 168   new->type.node_class = etree_value;
 169   return new;
 170 }
 171
 172 /* Build an expression representing an unnamed relocatable value.  */
 173
 174 etree_type *
 175 exp_relop (asection *section, bfd_vma value)
 176 {
 177   etree_type *new = stat_alloc (sizeof (new->rel));
 178   new->type.node_code = REL;
 179   new->type.node_class = etree_rel;
 180   new->rel.section = section;
 181   new->rel.value = value;
 182   return new;
 183 }
 184
 185 static etree_value_type
 186 new_rel (bfd_vma value,
 187          char *str,
 188          lang_output_section_statement_type *section)
 189 {
 190   etree_value_type new;
 191   new.valid_p = TRUE;
 192   new.value = value;
 193   new.str = str;
 194   new.section = section;
 195   return new;
 196 }
 197
 198 static etree_value_type
 199 new_rel_from_section (bfd_vma value,
 200                       lang_output_section_statement_type *section)
 201 {
 202   etree_value_type new;
 203   new.valid_p = TRUE;
 204   new.value = value;
 205   new.str = NULL;
 206   new.section = section;
 207
 208   new.value -= section->bfd_section->vma;
 209
 210   return new;
 211 }
 212
 213 static etree_value_type
 214 fold_unary (etree_type *tree,
 215             lang_output_section_statement_type *current_section,
 216             lang_phase_type allocation_done,
 217             bfd_vma dot,
 218             bfd_vma *dotp)
 219 {
 220   etree_value_type result;
 221
 222   result = exp_fold_tree (tree->unary.child,
 223                           current_section,
 224                           allocation_done, dot, dotp);
 225   if (result.valid_p)
 226     {
 227       switch (tree->type.node_code)
 228         {
 229         case ALIGN_K:
 230           if (allocation_done != lang_first_phase_enum)
 231             result = new_rel_from_section (align_n (dot, result.value),
 232                                            current_section);
 233           else
 234             result.valid_p = FALSE;
 235           break;
 236
 237         case ABSOLUTE:
 238           if (allocation_done != lang_first_phase_enum)
 239             {
 240               result.value += result.section->bfd_section->vma;
 241               result.section = abs_output_section;
 242             }
 243           else
 244             result.valid_p = FALSE;
 245           break;
 246
 247         case '~':
 248           make_abs (&result);
 249           result.value = ~result.value;
 250           break;
 251
 252         case '!':
 253           make_abs (&result);
 254           result.value = !result.value;
 255           break;
 256
 257         case '-':
 258           make_abs (&result);
 259           result.value = -result.value;
 260           break;
 261
 262         case NEXT:
 263           /* Return next place aligned to value.  */
 264           if (allocation_done == lang_allocating_phase_enum)
 265             {
 266               make_abs (&result);
 267               result.value = align_n (dot, result.value);
 268             }
 269           else
 270             result.valid_p = FALSE;
 271           break;
 272
 273         case DATA_SEGMENT_END:
 274           if (allocation_done != lang_first_phase_enum
 275               && current_section == abs_output_section
 276               && (exp_data_seg.phase == exp_dataseg_align_seen
 277                   || exp_data_seg.phase == exp_dataseg_relro_seen
 278                   || exp_data_seg.phase == exp_dataseg_adjust
 279                   || exp_data_seg.phase == exp_dataseg_relro_adjust
 280                   || allocation_done != lang_allocating_phase_enum))
 281             {
 282               if (exp_data_seg.phase == exp_dataseg_align_seen
 283                   || exp_data_seg.phase == exp_dataseg_relro_seen)
 284                 {
 285                   exp_data_seg.phase = exp_dataseg_end_seen;
 286                   exp_data_seg.end = result.value;
 287                 }
 288             }
 289           else
 290             result.valid_p = FALSE;
 291           break;
 292
 293         default:
 294           FAIL ();
 295           break;
 296         }
 297     }
 298
 299   return result;
 300 }
 301
 302 static etree_value_type
 303 fold_binary (etree_type *tree,
 304              lang_output_section_statement_type *current_section,
 305              lang_phase_type allocation_done,
 306              bfd_vma dot,
 307              bfd_vma *dotp)
 308 {
 309   etree_value_type result;
 310
 311   result = exp_fold_tree (tree->binary.lhs, current_section,
 312                           allocation_done, dot, dotp);
 313
 314   /* The SEGMENT_START operator is special because its first
 315      operand is a string, not the name of a symbol.  */
 316   if (result.valid_p && tree->type.node_code == SEGMENT_START)
 317     {
 318       const char *segment_name;
 319       segment_type *seg;
 320       /* Check to see if the user has overridden the default
 321          value.  */
 322       segment_name = tree->binary.rhs->name.name;
 323       for (seg = segments; seg; seg = seg->next)
 324         if (strcmp (seg->name, segment_name) == 0)
 325           {
 326             seg->used = TRUE;
 327             result.value = seg->value;
 328             result.str = NULL;
 329             result.section = NULL;
 330             break;
 331           }
 332     }
 333   else if (result.valid_p)
 334     {
 335       etree_value_type other;
 336
 337       other = exp_fold_tree (tree->binary.rhs,
 338                              current_section,
 339                              allocation_done, dot, dotp);
 340       if (other.valid_p)
 341         {
 342           /* If the values are from different sections, or this is an
 343              absolute expression, make both the source arguments
 344              absolute.  However, adding or subtracting an absolute
 345              value from a relative value is meaningful, and is an
 346              exception.  */
 347           if (current_section != abs_output_section
 348               && (other.section == abs_output_section
 349                   || (result.section == abs_output_section
 350                       && tree->type.node_code == '+'))
 351               && (tree->type.node_code == '+'
 352                   || tree->type.node_code == '-'))
 353             {
 354               if (other.section != abs_output_section)
 355                 {
 356                   /* Keep the section of the other term.  */
 357                   if (tree->type.node_code == '+')
 358                     other.value = result.value + other.value;
 359                   else
 360                     other.value = result.value - other.value;
 361                   return other;
 362                 }
 363             }
 364           else if (result.section != other.section
 365                    || current_section == abs_output_section)
 366             {
 367               make_abs (&result);
 368               make_abs (&other);
 369             }
 370
 371           switch (tree->type.node_code)
 372             {
 373             case '%':
 374               if (other.value == 0)
 375                 einfo (_("%F%S %% by zero\n"));
 376               result.value = ((bfd_signed_vma) result.value
 377                               % (bfd_signed_vma) other.value);
 378               break;
 379
 380             case '/':
 381               if (other.value == 0)
 382                 einfo (_("%F%S / by zero\n"));
 383               result.value = ((bfd_signed_vma) result.value
 384                               / (bfd_signed_vma) other.value);
 385               break;
 386
 387 #define BOP(x,y) case x : result.value = result.value y other.value; break;
 388               BOP ('+', +);
 389               BOP ('*', *);
 390               BOP ('-', -);
 391               BOP (LSHIFT, <<);
 392               BOP (RSHIFT, >>);
 393               BOP (EQ, ==);
 394               BOP (NE, !=);
 395               BOP ('<', <);
 396               BOP ('>', >);
 397               BOP (LE, <=);
 398               BOP (GE, >=);
 399               BOP ('&', &);
 400               BOP ('^', ^);
 401               BOP ('|', |);
 402               BOP (ANDAND, &&);
 403               BOP (OROR, ||);
 404
 405             case MAX_K:
 406               if (result.value < other.value)
 407                 result = other;
 408               break;
 409
 410             case MIN_K:
 411               if (result.value > other.value)
 412                 result = other;
 413               break;
 414
 415             case ALIGN_K:
 416               result.value = align_n (result.value, other.value);
 417               break;
 418
 419             case DATA_SEGMENT_ALIGN:
 420               if (allocation_done != lang_first_phase_enum
 421                   && current_section == abs_output_section
 422                   && (exp_data_seg.phase == exp_dataseg_none
 423                       || exp_data_seg.phase == exp_dataseg_adjust
 424                       || exp_data_seg.phase == exp_dataseg_relro_adjust
 425                       || allocation_done != lang_allocating_phase_enum))
 426                 {
 427                   bfd_vma maxpage = result.value;
 428
 429                   result.value = align_n (dot, maxpage);
 430                   if (exp_data_seg.phase == exp_dataseg_relro_adjust)
 431                     result.value = exp_data_seg.base;
 432                   else if (exp_data_seg.phase != exp_dataseg_adjust)
 433                     {
 434                       result.value += dot & (maxpage - 1);
 435                       if (allocation_done == lang_allocating_phase_enum)
 436                         {
 437                           exp_data_seg.phase = exp_dataseg_align_seen;
 438                           exp_data_seg.min_base = align_n (dot, maxpage);
 439                           exp_data_seg.base = result.value;
 440                           exp_data_seg.pagesize = other.value;
 441                           exp_data_seg.maxpagesize = maxpage;
 442                           exp_data_seg.relro_end = 0;
 443                         }
 444                     }
 445                   else if (other.value < maxpage)
 446                     result.value += (dot + other.value - 1)
 447                                     & (maxpage - other.value);
 448                 }
 449               else
 450                 result.valid_p = FALSE;
 451               break;
 452
 453             case DATA_SEGMENT_RELRO_END:
 454               if (allocation_done != lang_first_phase_enum
 455                   && (exp_data_seg.phase == exp_dataseg_align_seen
 456                       || exp_data_seg.phase == exp_dataseg_adjust
 457                       || exp_data_seg.phase == exp_dataseg_relro_adjust
 458                       || allocation_done != lang_allocating_phase_enum))
 459                 {
 460                   if (exp_data_seg.phase == exp_dataseg_align_seen
 461                       || exp_data_seg.phase == exp_dataseg_relro_adjust)
 462                     exp_data_seg.relro_end
 463                       = result.value + other.value;
 464                   if (exp_data_seg.phase == exp_dataseg_relro_adjust
 465                       && (exp_data_seg.relro_end
 466                           & (exp_data_seg.pagesize - 1)))
 467                     {
 468                       exp_data_seg.relro_end += exp_data_seg.pagesize - 1;
 469                       exp_data_seg.relro_end &= ~(exp_data_seg.pagesize - 1);
 470                       result.value = exp_data_seg.relro_end - other.value;
 471                     }
 472                   if (exp_data_seg.phase == exp_dataseg_align_seen)
 473                     exp_data_seg.phase = exp_dataseg_relro_seen;
 474                 }
 475               else
 476                 result.valid_p = FALSE;
 477               break;
 478
 479             default:
 480               FAIL ();
 481             }
 482         }
 483       else
 484         {
 485           result.valid_p = FALSE;
 486         }
 487     }
 488
 489   return result;
 490 }
 491
 492 static etree_value_type
 493 fold_trinary (etree_type *tree,
 494               lang_output_section_statement_type *current_section,
 495               lang_phase_type allocation_done,
 496               bfd_vma dot,
 497               bfd_vma *dotp)
 498 {
 499   etree_value_type result;
 500
 501   result = exp_fold_tree (tree->trinary.cond, current_section,
 502                           allocation_done, dot, dotp);
 503   if (result.valid_p)
 504     result = exp_fold_tree ((result.value
 505                              ? tree->trinary.lhs
 506                              : tree->trinary.rhs),
 507                             current_section,
 508                             allocation_done, dot, dotp);
 509
 510   return result;
 511 }
 512
 513 static etree_value_type
 514 fold_name (etree_type *tree,
 515            lang_output_section_statement_type *current_section,
 516            lang_phase_type allocation_done,
 517            bfd_vma dot)
 518 {
 519   etree_value_type result;
 520
 521   result.valid_p = FALSE;
 522
 523   switch (tree->type.node_code)
 524     {
 525     case SIZEOF_HEADERS:
 526       if (allocation_done != lang_first_phase_enum)
 527         result = new_abs (bfd_sizeof_headers (output_bfd,
 528                                               link_info.relocatable));
 529       break;
 530     case DEFINED:
 531       if (allocation_done == lang_first_phase_enum)
 532         lang_track_definedness (tree->name.name);
 533       else
 534         {
 535           struct bfd_link_hash_entry *h;
 536           int def_iteration
 537             = lang_symbol_definition_iteration (tree->name.name);
 538
 539           h = bfd_wrapped_link_hash_lookup (output_bfd, &link_info,
 540                                             tree->name.name,
 541                                             FALSE, FALSE, TRUE);
 542           result.value = (h != NULL
 543                           && (h->type == bfd_link_hash_defined
 544                               || h->type == bfd_link_hash_defweak
 545                               || h->type == bfd_link_hash_common)
 546                           && (def_iteration == lang_statement_iteration
 547                               || def_iteration == -1));
 548           result.section = abs_output_section;
 549           result.valid_p = TRUE;
 550         }
 551       break;
 552     case NAME:
 553       if (tree->name.name[0] == '.' && tree->name.name[1] == 0)
 554         {
 555           if (allocation_done != lang_first_phase_enum)
 556             result = new_rel_from_section (dot, current_section);
 557         }
 558       else if (allocation_done != lang_first_phase_enum)
 559         {
 560           struct bfd_link_hash_entry *h;
 561
 562           h = bfd_wrapped_link_hash_lookup (output_bfd, &link_info,
 563                                             tree->name.name,
 564                                             TRUE, FALSE, TRUE);
 565           if (!h)
 566             einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
 567           else if (h->type == bfd_link_hash_defined
 568                    || h->type == bfd_link_hash_defweak)
 569             {
 570               if (bfd_is_abs_section (h->u.def.section))
 571                 result = new_abs (h->u.def.value);
 572               else if (allocation_done == lang_final_phase_enum
 573                        || allocation_done == lang_allocating_phase_enum)
 574                 {
 575                   asection *output_section;
 576
 577                   output_section = h->u.def.section->output_section;
 578                   if (output_section == NULL)
 579                     einfo (_("%X%S: unresolvable symbol `%s' referenced in expression\n"),
 580                            tree->name.name);
 581                   else
 582                     {
 583                       lang_output_section_statement_type *os;
 584
 585                       os = (lang_output_section_statement_lookup
 586                             (bfd_get_section_name (output_bfd,
 587                                                    output_section)));
 588
 589                       /* FIXME: Is this correct if this section is
 590                          being linked with -R?  */
 591                       result = new_rel ((h->u.def.value
 592                                          + h->u.def.section->output_offset),
 593                                         NULL,
 594                                         os);
 595                     }
 596                 }
 597             }
 598           else if (allocation_done == lang_final_phase_enum)
 599             einfo (_("%F%S: undefined symbol `%s' referenced in expression\n"),
 600                    tree->name.name);
 601           else if (h->type == bfd_link_hash_new)
 602             {
 603               h->type = bfd_link_hash_undefined;
 604               h->u.undef.abfd = NULL;
 605               if (h->u.undef.next == NULL && h != link_info.hash->undefs_tail)
 606                 bfd_link_add_undef (link_info.hash, h);
 607             }
 608         }
 609       break;
 610
 611     case ADDR:
 612       if (allocation_done != lang_first_phase_enum)
 613         {
 614           lang_output_section_statement_type *os;
 615
 616           os = lang_output_section_find (tree->name.name);
 617           if (os && os->processed > 0)
 618             result = new_rel (0, NULL, os);
 619         }
 620       break;
 621
 622     case LOADADDR:
 623       if (allocation_done != lang_first_phase_enum)
 624         {
 625           lang_output_section_statement_type *os;
 626
 627           os = lang_output_section_find (tree->name.name);
 628           if (os && os->processed != 0)
 629             {
 630               if (os->load_base == NULL)
 631                 result = new_rel (0, NULL, os);
 632               else
 633                 result = exp_fold_tree_no_dot (os->load_base,
 634                                                abs_output_section,
 635                                                allocation_done);
 636             }
 637         }
 638       break;
 639
 640     case SIZEOF:
 641       if (allocation_done != lang_first_phase_enum)
 642         {
 643           int opb = bfd_octets_per_byte (output_bfd);
 644           lang_output_section_statement_type *os;
 645
 646           os = lang_output_section_find (tree->name.name);
 647           if (os && os->processed > 0)
 648             result = new_abs (os->bfd_section->size / opb);
 649         }
 650       break;
 651
 652     case LENGTH:
 653       {
 654         lang_memory_region_type *mem;
 655
 656         mem = lang_memory_region_lookup (tree->name.name, FALSE);
 657         if (mem != NULL)
 658           result = new_abs (mem->length);
 659         else
 660           einfo (_("%F%S: undefined MEMORY region `%s' referenced in expression\n"),
 661                    tree->name.name);
 662       }
 663       break;
 664
 665     case ORIGIN:
 666       {
 667         lang_memory_region_type *mem;
 668
 669         mem = lang_memory_region_lookup (tree->name.name, FALSE);
 670         if (mem != NULL)
 671           result = new_abs (mem->origin);
 672         else
 673           einfo (_("%F%S: undefined MEMORY region `%s' referenced in expression\n"),
 674                    tree->name.name);
 675       }
 676       break;
 677
 678     default:
 679       FAIL ();
 680       break;
 681     }
 682
 683   return result;
 684 }
 685
 686 etree_value_type
 687 exp_fold_tree (etree_type *tree,
 688                lang_output_section_statement_type *current_section,
 689                lang_phase_type allocation_done,
 690                bfd_vma dot,
 691                bfd_vma *dotp)
 692 {
 693   etree_value_type result;
 694
 695   if (tree == NULL)
 696     {
 697       result.valid_p = FALSE;
 698       return result;
 699     }
 700
 701   switch (tree->type.node_class)
 702     {
 703     case etree_value:
 704       result = new_rel (tree->value.value, tree->value.str, current_section);
 705       break;
 706
 707     case etree_rel:
 708       if (allocation_done != lang_final_phase_enum)
 709         result.valid_p = FALSE;
 710       else
 711         result = new_rel ((tree->rel.value
 712                            + tree->rel.section->output_section->vma
 713                            + tree->rel.section->output_offset),
 714                           NULL,
 715                           current_section);
 716       break;
 717
 718     case etree_assert:
 719       result = exp_fold_tree (tree->assert_s.child,
 720                               current_section,
 721                               allocation_done, dot, dotp);
 722       if (result.valid_p)
 723         {
 724           if (! result.value)
 725             einfo ("%X%P: %s\n", tree->assert_s.message);
 726           return result;
 727         }
 728       break;
 729
 730     case etree_unary:
 731       result = fold_unary (tree, current_section, allocation_done,
 732                            dot, dotp);
 733       break;
 734
 735     case etree_binary:
 736       result = fold_binary (tree, current_section, allocation_done,
 737                             dot, dotp);
 738       break;
 739
 740     case etree_trinary:
 741       result = fold_trinary (tree, current_section, allocation_done,
 742                              dot, dotp);
 743       break;
 744
 745     case etree_assign:
 746     case etree_provide:
 747     case etree_provided:
 748       if (tree->assign.dst[0] == '.' && tree->assign.dst[1] == 0)
 749         {
 750           /* Assignment to dot can only be done during allocation.  */
 751           if (tree->type.node_class != etree_assign)
 752             einfo (_("%F%S can not PROVIDE assignment to location counter\n"));
 753           if (allocation_done == lang_allocating_phase_enum
 754               || (allocation_done == lang_final_phase_enum
 755                   && current_section == abs_output_section))
 756             {
 757               result = exp_fold_tree (tree->assign.src,
 758                                       current_section,
 759                                       allocation_done, dot,
 760                                       dotp);
 761               if (! result.valid_p)
 762                 einfo (_("%F%S invalid assignment to location counter\n"));
 763               else
 764                 {
 765                   if (current_section == NULL)
 766                     einfo (_("%F%S assignment to location counter invalid outside of SECTION\n"));
 767                   else
 768                     {
 769                       bfd_vma nextdot;
 770
 771                       nextdot = (result.value
 772                                  + current_section->bfd_section->vma);
 773                       if (nextdot < dot
 774                           && current_section != abs_output_section)
 775                         einfo (_("%F%S cannot move location counter backwards (from %V to %V)\n"),
 776                                dot, nextdot);
 777                       else
 778                         *dotp = nextdot;
 779                     }
 780                 }
 781             }
 782         }
 783       else
 784         {
 785           result = exp_fold_tree (tree->assign.src,
 786                                   current_section, allocation_done,
 787                                   dot, dotp);
 788           if (result.valid_p)
 789             {
 790               bfd_boolean create;
 791               struct bfd_link_hash_entry *h;
 792
 793               if (tree->type.node_class == etree_assign)
 794                 create = TRUE;
 795               else
 796                 create = FALSE;
 797               h = bfd_link_hash_lookup (link_info.hash, tree->assign.dst,
 798                                         create, FALSE, TRUE);
 799               if (h == NULL)
 800                 {
 801                   if (create)
 802                     einfo (_("%P%F:%s: hash creation failed\n"),
 803                            tree->assign.dst);
 804                 }
 805               else if (tree->type.node_class == etree_provide
 806                        && h->type != bfd_link_hash_new
 807                        && h->type != bfd_link_hash_undefined
 808                        && h->type != bfd_link_hash_common)
 809                 {
 810                   /* Do nothing.  The symbol was defined by some
 811                      object.  */
 812                 }
 813               else
 814                 {
 815                   /* FIXME: Should we worry if the symbol is already
 816                      defined?  */
 817                   lang_update_definedness (tree->assign.dst, h);
 818                   h->type = bfd_link_hash_defined;
 819                   h->u.def.value = result.value;
 820                   h->u.def.section = result.section->bfd_section;
 821                   if (tree->type.node_class == etree_provide)
 822                     tree->type.node_class = etree_provided;
 823                 }
 824             }
 825         }
 826       break;
 827
 828     case etree_name:
 829       result = fold_name (tree, current_section, allocation_done, dot);
 830       break;
 831
 832     default:
 833       FAIL ();
 834       break;
 835     }
 836
 837   return result;
 838 }
 839
 840 static etree_value_type
 841 exp_fold_tree_no_dot (etree_type *tree,
 842                       lang_output_section_statement_type *current_section,
 843                       lang_phase_type allocation_done)
 844 {
 845   return exp_fold_tree (tree, current_section, allocation_done, 0, NULL);
 846 }
 847
 848 etree_type *
 849 exp_binop (int code, etree_type *lhs, etree_type *rhs)
 850 {
 851   etree_type value, *new;
 852   etree_value_type r;
 853
 854   value.type.node_code = code;
 855   value.binary.lhs = lhs;
 856   value.binary.rhs = rhs;
 857   value.type.node_class = etree_binary;
 858   r = exp_fold_tree_no_dot (&value,
 859                             abs_output_section,
 860                             lang_first_phase_enum);
 861   if (r.valid_p)
 862     {
 863       return exp_intop (r.value);
 864     }
 865   new = stat_alloc (sizeof (new->binary));
 866   memcpy (new, &value, sizeof (new->binary));
 867   return new;
 868 }
 869
 870 etree_type *
 871 exp_trinop (int code, etree_type *cond, etree_type *lhs, etree_type *rhs)
 872 {
 873   etree_type value, *new;
 874   etree_value_type r;
 875   value.type.node_code = code;
 876   value.trinary.lhs = lhs;
 877   value.trinary.cond = cond;
 878   value.trinary.rhs = rhs;
 879   value.type.node_class = etree_trinary;
 880   r = exp_fold_tree_no_dot (&value, NULL, lang_first_phase_enum);
 881   if (r.valid_p)
 882     return exp_intop (r.value);
 883
 884   new = stat_alloc (sizeof (new->trinary));
 885   memcpy (new, &value, sizeof (new->trinary));
 886   return new;
 887 }
 888
 889 etree_type *
 890 exp_unop (int code, etree_type *child)
 891 {
 892   etree_type value, *new;
 893
 894   etree_value_type r;
 895   value.unary.type.node_code = code;
 896   value.unary.child = child;
 897   value.unary.type.node_class = etree_unary;
 898   r = exp_fold_tree_no_dot (&value, abs_output_section,
 899                             lang_first_phase_enum);
 900   if (r.valid_p)
 901     return exp_intop (r.value);
 902
 903   new = stat_alloc (sizeof (new->unary));
 904   memcpy (new, &value, sizeof (new->unary));
 905   return new;
 906 }
 907
 908 etree_type *
 909 exp_nameop (int code, const char *name)
 910 {
 911   etree_type value, *new;
 912   etree_value_type r;
 913   value.name.type.node_code = code;
 914   value.name.name = name;
 915   value.name.type.node_class = etree_name;
 916
 917   r = exp_fold_tree_no_dot (&value, NULL, lang_first_phase_enum);
 918   if (r.valid_p)
 919     return exp_intop (r.value);
 920
 921   new = stat_alloc (sizeof (new->name));
 922   memcpy (new, &value, sizeof (new->name));
 923   return new;
 924
 925 }
 926
 927 etree_type *
 928 exp_assop (int code, const char *dst, etree_type *src)
 929 {
 930   etree_type value, *new;
 931
 932   value.assign.type.node_code = code;
 933
 934   value.assign.src = src;
 935   value.assign.dst = dst;
 936   value.assign.type.node_class = etree_assign;
 937
 938   new = stat_alloc (sizeof (new->assign));
 939   memcpy (new, &value, sizeof (new->assign));
 940   return new;
 941 }
 942
 943 /* Handle PROVIDE.  */
 944
 945 etree_type *
 946 exp_provide (const char *dst, etree_type *src)
 947 {
 948   etree_type *n;
 949
 950   n = stat_alloc (sizeof (n->assign));
 951   n->assign.type.node_code = '=';
 952   n->assign.type.node_class = etree_provide;
 953   n->assign.src = src;
 954   n->assign.dst = dst;
 955   return n;
 956 }
 957
 958 /* Handle ASSERT.  */
 959
 960 etree_type *
 961 exp_assert (etree_type *exp, const char *message)
 962 {
 963   etree_type *n;
 964
 965   n = stat_alloc (sizeof (n->assert_s));
 966   n->assert_s.type.node_code = '!';
 967   n->assert_s.type.node_class = etree_assert;
 968   n->assert_s.child = exp;
 969   n->assert_s.message = message;
 970   return n;
 971 }
 972
 973 void
 974 exp_print_tree (etree_type *tree)
 975 {
 976   if (config.map_file == NULL)
 977     config.map_file = stderr;
 978
 979   if (tree == NULL)
 980     {
 981       minfo ("NULL TREE\n");
 982       return;
 983     }
 984
 985   switch (tree->type.node_class)
 986     {
 987     case etree_value:
 988       minfo ("0x%v", tree->value.value);
 989       return;
 990     case etree_rel:
 991       if (tree->rel.section->owner != NULL)
 992         minfo ("%B:", tree->rel.section->owner);
 993       minfo ("%s+0x%v", tree->rel.section->name, tree->rel.value);
 994       return;
 995     case etree_assign:
 996       fprintf (config.map_file, "%s", tree->assign.dst);
 997       exp_print_token (tree->type.node_code, TRUE);
 998       exp_print_tree (tree->assign.src);
 999       break;
1000     case etree_provide:
1001     case etree_provided:
1002       fprintf (config.map_file, "PROVIDE (%s, ", tree->assign.dst);
1003       exp_print_tree (tree->assign.src);
1004       fprintf (config.map_file, ")");
1005       break;
1006     case etree_binary:
1007       fprintf (config.map_file, "(");
1008       exp_print_tree (tree->binary.lhs);
1009       exp_print_token (tree->type.node_code, TRUE);
1010       exp_print_tree (tree->binary.rhs);
1011       fprintf (config.map_file, ")");
1012       break;
1013     case etree_trinary:
1014       exp_print_tree (tree->trinary.cond);
1015       fprintf (config.map_file, "?");
1016       exp_print_tree (tree->trinary.lhs);
1017       fprintf (config.map_file, ":");
1018       exp_print_tree (tree->trinary.rhs);
1019       break;
1020     case etree_unary:
1021       exp_print_token (tree->unary.type.node_code, FALSE);
1022       if (tree->unary.child)
1023         {
1024           fprintf (config.map_file, " (");
1025           exp_print_tree (tree->unary.child);
1026           fprintf (config.map_file, ")");
1027         }
1028       break;
1029
1030     case etree_assert:
1031       fprintf (config.map_file, "ASSERT (");
1032       exp_print_tree (tree->assert_s.child);
1033       fprintf (config.map_file, ", %s)", tree->assert_s.message);
1034       break;
1035
1036     case etree_undef:
1037       fprintf (config.map_file, "????????");
1038       break;
1039     case etree_name:
1040       if (tree->type.node_code == NAME)
1041         {
1042           fprintf (config.map_file, "%s", tree->name.name);
1043         }
1044       else
1045         {
1046           exp_print_token (tree->type.node_code, FALSE);
1047           if (tree->name.name)
1048             fprintf (config.map_file, " (%s)", tree->name.name);
1049         }
1050       break;
1051     default:
1052       FAIL ();
1053       break;
1054     }
1055 }
1056
1057 bfd_vma
1058 exp_get_vma (etree_type *tree,
1059              bfd_vma def,
1060              char *name,
1061              lang_phase_type allocation_done)
1062 {
1063   etree_value_type r;
1064
1065   if (tree != NULL)
1066     {
1067       r = exp_fold_tree_no_dot (tree, abs_output_section, allocation_done);
1068       if (! r.valid_p && name != NULL)
1069         einfo (_("%F%S nonconstant expression for %s\n"), name);
1070       return r.value;
1071     }
1072   else
1073     return def;
1074 }
1075
1076 int
1077 exp_get_value_int (etree_type *tree,
1078                    int def,
1079                    char *name,
1080                    lang_phase_type allocation_done)
1081 {
1082   return exp_get_vma (tree, def, name, allocation_done);
1083 }
1084
1085 fill_type *
1086 exp_get_fill (etree_type *tree,
1087               fill_type *def,
1088               char *name,
1089               lang_phase_type allocation_done)
1090 {
1091   fill_type *fill;
1092   etree_value_type r;
1093   size_t len;
1094   unsigned int val;
1095
1096   if (tree == NULL)
1097     return def;
1098
1099   r = exp_fold_tree_no_dot (tree, abs_output_section, allocation_done);
1100   if (! r.valid_p && name != NULL)
1101     einfo (_("%F%S nonconstant expression for %s\n"), name);
1102
1103   if (r.str != NULL && (len = strlen (r.str)) != 0)
1104     {
1105       unsigned char *dst;
1106       unsigned char *s;
1107       fill = xmalloc ((len + 1) / 2 + sizeof (*fill) - 1);
1108       fill->size = (len + 1) / 2;
1109       dst = fill->data;
1110       s = r.str;
1111       val = 0;
1112       do
1113         {
1114           unsigned int digit;
1115
1116           digit = *s++ - '0';
1117           if (digit > 9)
1118             digit = (digit - 'A' + '0' + 10) & 0xf;
1119           val <<= 4;
1120           val += digit;
1121           --len;
1122           if ((len & 1) == 0)
1123             {
1124               *dst++ = val;
1125               val = 0;
1126             }
1127         }
1128       while (len != 0);
1129     }
1130   else
1131     {
1132       fill = xmalloc (4 + sizeof (*fill) - 1);
1133       val = r.value;
1134       fill->data[0] = (val >> 24) & 0xff;
1135       fill->data[1] = (val >> 16) & 0xff;
1136       fill->data[2] = (val >>  8) & 0xff;
1137       fill->data[3] = (val >>  0) & 0xff;
1138       fill->size = 4;
1139     }
1140   return fill;
1141 }
1142
1143 bfd_vma
1144 exp_get_abs_int (etree_type *tree,
1145                  int def ATTRIBUTE_UNUSED,
1146                  char *name,
1147                  lang_phase_type allocation_done)
1148 {
1149   etree_value_type res;
1150   res = exp_fold_tree_no_dot (tree, abs_output_section, allocation_done);
1151
1152   if (res.valid_p)
1153     res.value += res.section->bfd_section->vma;
1154   else
1155     einfo (_("%F%S non constant expression for %s\n"), name);
1156
1157   return res.value;
1158 }
1159
1160 static bfd_vma
1161 align_n (bfd_vma value, bfd_vma align)
1162 {
1163   if (align <= 1)
1164     return value;
1165
1166   value = (value + align - 1) / align;
1167   return value * align;
1168 }