1 // script.cc -- handle linker scripts for gold.
3 // Copyright (C) 2006-2016 Free Software Foundation, Inc.
4 // Written by Ian Lance Taylor <iant@google.com>.
6 // This file is part of gold.
8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
10 // the Free Software Foundation; either version 3 of the License, or
11 // (at your option) any later version.
13 // This program is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License
19 // along with this program; if not, write to the Free Software
20 // Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 // MA 02110-1301, USA.
31 #include "filenames.h"
35 #include "dirsearch.h"
38 #include "workqueue.h"
40 #include "parameters.h"
43 #include "target-select.h"
46 #include "incremental.h"
51 // A token read from a script file. We don't implement keywords here;
52 // all keywords are simply represented as a string.
57 // Token classification.
62 // Token indicates end of input.
64 // Token is a string of characters.
66 // Token is a quoted string of characters.
68 // Token is an operator.
70 // Token is a number (an integer).
74 // We need an empty constructor so that we can put this STL objects.
76 : classification_(TOKEN_INVALID), value_(NULL), value_length_(0),
77 opcode_(0), lineno_(0), charpos_(0)
80 // A general token with no value.
81 Token(Classification classification, int lineno, int charpos)
82 : classification_(classification), value_(NULL), value_length_(0),
83 opcode_(0), lineno_(lineno), charpos_(charpos)
85 gold_assert(classification == TOKEN_INVALID
86 || classification == TOKEN_EOF);
89 // A general token with a value.
90 Token(Classification classification, const char* value, size_t length,
91 int lineno, int charpos)
92 : classification_(classification), value_(value), value_length_(length),
93 opcode_(0), lineno_(lineno), charpos_(charpos)
95 gold_assert(classification != TOKEN_INVALID
96 && classification != TOKEN_EOF);
99 // A token representing an operator.
100 Token(int opcode, int lineno, int charpos)
101 : classification_(TOKEN_OPERATOR), value_(NULL), value_length_(0),
102 opcode_(opcode), lineno_(lineno), charpos_(charpos)
105 // Return whether the token is invalid.
108 { return this->classification_ == TOKEN_INVALID; }
110 // Return whether this is an EOF token.
113 { return this->classification_ == TOKEN_EOF; }
115 // Return the token classification.
117 classification() const
118 { return this->classification_; }
120 // Return the line number at which the token starts.
123 { return this->lineno_; }
125 // Return the character position at this the token starts.
128 { return this->charpos_; }
130 // Get the value of a token.
133 string_value(size_t* length) const
135 gold_assert(this->classification_ == TOKEN_STRING
136 || this->classification_ == TOKEN_QUOTED_STRING);
137 *length = this->value_length_;
142 operator_value() const
144 gold_assert(this->classification_ == TOKEN_OPERATOR);
145 return this->opcode_;
149 integer_value() const;
152 // The token classification.
153 Classification classification_;
154 // The token value, for TOKEN_STRING or TOKEN_QUOTED_STRING or
157 // The length of the token value.
158 size_t value_length_;
159 // The token value, for TOKEN_OPERATOR.
161 // The line number where this token started (one based).
163 // The character position within the line where this token started
168 // Return the value of a TOKEN_INTEGER.
171 Token::integer_value() const
173 gold_assert(this->classification_ == TOKEN_INTEGER);
175 size_t len = this->value_length_;
177 uint64_t multiplier = 1;
178 char last = this->value_[len - 1];
179 if (last == 'm' || last == 'M')
181 multiplier = 1024 * 1024;
184 else if (last == 'k' || last == 'K')
191 uint64_t ret = strtoull(this->value_, &end, 0);
192 gold_assert(static_cast<size_t>(end - this->value_) == len);
194 return ret * multiplier;
197 // This class handles lexing a file into a sequence of tokens.
202 // We unfortunately have to support different lexing modes, because
203 // when reading different parts of a linker script we need to parse
204 // things differently.
207 // Reading an ordinary linker script.
209 // Reading an expression in a linker script.
211 // Reading a version script.
213 // Reading a --dynamic-list file.
217 Lex(const char* input_string, size_t input_length, int parsing_token)
218 : input_string_(input_string), input_length_(input_length),
219 current_(input_string), mode_(LINKER_SCRIPT),
220 first_token_(parsing_token), token_(),
221 lineno_(1), linestart_(input_string)
224 // Read a file into a string.
226 read_file(Input_file*, std::string*);
228 // Return the next token.
232 // Return the current lexing mode.
235 { return this->mode_; }
237 // Set the lexing mode.
240 { this->mode_ = mode; }
244 Lex& operator=(const Lex&);
246 // Make a general token with no value at the current location.
248 make_token(Token::Classification c, const char* start) const
249 { return Token(c, this->lineno_, start - this->linestart_ + 1); }
251 // Make a general token with a value at the current location.
253 make_token(Token::Classification c, const char* v, size_t len,
256 { return Token(c, v, len, this->lineno_, start - this->linestart_ + 1); }
258 // Make an operator token at the current location.
260 make_token(int opcode, const char* start) const
261 { return Token(opcode, this->lineno_, start - this->linestart_ + 1); }
263 // Make an invalid token at the current location.
265 make_invalid_token(const char* start)
266 { return this->make_token(Token::TOKEN_INVALID, start); }
268 // Make an EOF token at the current location.
270 make_eof_token(const char* start)
271 { return this->make_token(Token::TOKEN_EOF, start); }
273 // Return whether C can be the first character in a name. C2 is the
274 // next character, since we sometimes need that.
276 can_start_name(char c, char c2);
278 // If C can appear in a name which has already started, return a
279 // pointer to a character later in the token or just past
280 // it. Otherwise, return NULL.
282 can_continue_name(const char* c);
284 // Return whether C, C2, C3 can start a hex number.
286 can_start_hex(char c, char c2, char c3);
288 // If C can appear in a hex number which has already started, return
289 // a pointer to a character later in the token or just past
290 // it. Otherwise, return NULL.
292 can_continue_hex(const char* c);
294 // Return whether C can start a non-hex number.
296 can_start_number(char c);
298 // If C can appear in a decimal number which has already started,
299 // return a pointer to a character later in the token or just past
300 // it. Otherwise, return NULL.
302 can_continue_number(const char* c)
303 { return Lex::can_start_number(*c) ? c + 1 : NULL; }
305 // If C1 C2 C3 form a valid three character operator, return the
306 // opcode. Otherwise return 0.
308 three_char_operator(char c1, char c2, char c3);
310 // If C1 C2 form a valid two character operator, return the opcode.
311 // Otherwise return 0.
313 two_char_operator(char c1, char c2);
315 // If C1 is a valid one character operator, return the opcode.
316 // Otherwise return 0.
318 one_char_operator(char c1);
320 // Read the next token.
322 get_token(const char**);
324 // Skip a C style /* */ comment. Return false if the comment did
327 skip_c_comment(const char**);
329 // Skip a line # comment. Return false if there was no newline.
331 skip_line_comment(const char**);
333 // Build a token CLASSIFICATION from all characters that match
334 // CAN_CONTINUE_FN. The token starts at START. Start matching from
335 // MATCH. Set *PP to the character following the token.
337 gather_token(Token::Classification,
338 const char* (Lex::*can_continue_fn)(const char*),
339 const char* start, const char* match, const char** pp);
341 // Build a token from a quoted string.
343 gather_quoted_string(const char** pp);
345 // The string we are tokenizing.
346 const char* input_string_;
347 // The length of the string.
348 size_t input_length_;
349 // The current offset into the string.
350 const char* current_;
351 // The current lexing mode.
353 // The code to use for the first token. This is set to 0 after it
356 // The current token.
358 // The current line number.
360 // The start of the current line in the string.
361 const char* linestart_;
364 // Read the whole file into memory. We don't expect linker scripts to
365 // be large, so we just use a std::string as a buffer. We ignore the
366 // data we've already read, so that we read aligned buffers.
369 Lex::read_file(Input_file* input_file, std::string* contents)
371 off_t filesize = input_file->file().filesize();
373 contents->reserve(filesize);
376 unsigned char buf[BUFSIZ];
377 while (off < filesize)
380 if (get > filesize - off)
381 get = filesize - off;
382 input_file->file().read(off, get, buf);
383 contents->append(reinterpret_cast<char*>(&buf[0]), get);
388 // Return whether C can be the start of a name, if the next character
389 // is C2. A name can being with a letter, underscore, period, or
390 // dollar sign. Because a name can be a file name, we also permit
391 // forward slash, backslash, and tilde. Tilde is the tricky case
392 // here; GNU ld also uses it as a bitwise not operator. It is only
393 // recognized as the operator if it is not immediately followed by
394 // some character which can appear in a symbol. That is, when we
395 // don't know that we are looking at an expression, "~0" is a file
396 // name, and "~ 0" is an expression using bitwise not. We are
400 Lex::can_start_name(char c, char c2)
404 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
405 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
406 case 'M': case 'N': case 'O': case 'Q': case 'P': case 'R':
407 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
409 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
410 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
411 case 'm': case 'n': case 'o': case 'q': case 'p': case 'r':
412 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
414 case '_': case '.': case '$':
418 return this->mode_ == LINKER_SCRIPT;
421 return this->mode_ == LINKER_SCRIPT && can_continue_name(&c2);
424 return (this->mode_ == VERSION_SCRIPT
425 || this->mode_ == DYNAMIC_LIST
426 || (this->mode_ == LINKER_SCRIPT
427 && can_continue_name(&c2)));
434 // Return whether C can continue a name which has already started.
435 // Subsequent characters in a name are the same as the leading
436 // characters, plus digits and "=+-:[],?*". So in general the linker
437 // script language requires spaces around operators, unless we know
438 // that we are parsing an expression.
441 Lex::can_continue_name(const char* c)
445 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
446 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
447 case 'M': case 'N': case 'O': case 'Q': case 'P': case 'R':
448 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
450 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
451 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
452 case 'm': case 'n': case 'o': case 'q': case 'p': case 'r':
453 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
455 case '_': case '.': case '$':
456 case '0': case '1': case '2': case '3': case '4':
457 case '5': case '6': case '7': case '8': case '9':
460 // TODO(csilvers): why not allow ~ in names for version-scripts?
461 case '/': case '\\': case '~':
464 if (this->mode_ == LINKER_SCRIPT)
468 case '[': case ']': case '*': case '?': case '-':
469 if (this->mode_ == LINKER_SCRIPT || this->mode_ == VERSION_SCRIPT
470 || this->mode_ == DYNAMIC_LIST)
474 // TODO(csilvers): why allow this? ^ is meaningless in version scripts.
476 if (this->mode_ == VERSION_SCRIPT || this->mode_ == DYNAMIC_LIST)
481 if (this->mode_ == LINKER_SCRIPT)
483 else if ((this->mode_ == VERSION_SCRIPT || this->mode_ == DYNAMIC_LIST)
486 // A name can have '::' in it, as that's a c++ namespace
487 // separator. But a single colon is not part of a name.
497 // For a number we accept 0x followed by hex digits, or any sequence
498 // of digits. The old linker accepts leading '$' for hex, and
499 // trailing HXBOD. Those are for MRI compatibility and we don't
502 // Return whether C1 C2 C3 can start a hex number.
505 Lex::can_start_hex(char c1, char c2, char c3)
507 if (c1 == '0' && (c2 == 'x' || c2 == 'X'))
508 return this->can_continue_hex(&c3);
512 // Return whether C can appear in a hex number.
515 Lex::can_continue_hex(const char* c)
519 case '0': case '1': case '2': case '3': case '4':
520 case '5': case '6': case '7': case '8': case '9':
521 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
522 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
530 // Return whether C can start a non-hex number.
533 Lex::can_start_number(char c)
537 case '0': case '1': case '2': case '3': case '4':
538 case '5': case '6': case '7': case '8': case '9':
546 // If C1 C2 C3 form a valid three character operator, return the
547 // opcode (defined in the yyscript.h file generated from yyscript.y).
548 // Otherwise return 0.
551 Lex::three_char_operator(char c1, char c2, char c3)
556 if (c2 == '<' && c3 == '=')
560 if (c2 == '>' && c3 == '=')
569 // If C1 C2 form a valid two character operator, return the opcode
570 // (defined in the yyscript.h file generated from yyscript.y).
571 // Otherwise return 0.
574 Lex::two_char_operator(char c1, char c2)
632 // If C1 is a valid operator, return the opcode. Otherwise return 0.
635 Lex::one_char_operator(char c1)
668 // Skip a C style comment. *PP points to just after the "/*". Return
669 // false if the comment did not end.
672 Lex::skip_c_comment(const char** pp)
675 while (p[0] != '*' || p[1] != '/')
686 this->linestart_ = p + 1;
695 // Skip a line # comment. Return false if there was no newline.
698 Lex::skip_line_comment(const char** pp)
701 size_t skip = strcspn(p, "\n");
710 this->linestart_ = p;
716 // Build a token CLASSIFICATION from all characters that match
717 // CAN_CONTINUE_FN. Update *PP.
720 Lex::gather_token(Token::Classification classification,
721 const char* (Lex::*can_continue_fn)(const char*),
726 const char* new_match = NULL;
727 while ((new_match = (this->*can_continue_fn)(match)) != NULL)
730 // A special case: integers may be followed by a single M or K,
732 if (classification == Token::TOKEN_INTEGER
733 && (*match == 'm' || *match == 'M' || *match == 'k' || *match == 'K'))
737 return this->make_token(classification, start, match - start, start);
740 // Build a token from a quoted string.
743 Lex::gather_quoted_string(const char** pp)
745 const char* start = *pp;
746 const char* p = start;
748 size_t skip = strcspn(p, "\"\n");
750 return this->make_invalid_token(start);
752 return this->make_token(Token::TOKEN_QUOTED_STRING, p, skip, start);
755 // Return the next token at *PP. Update *PP. General guideline: we
756 // require linker scripts to be simple ASCII. No unicode linker
757 // scripts. In particular we can assume that any '\0' is the end of
761 Lex::get_token(const char** pp)
770 return this->make_eof_token(p);
773 // Skip whitespace quickly.
774 while (*p == ' ' || *p == '\t' || *p == '\r')
781 this->linestart_ = p;
785 // Skip C style comments.
786 if (p[0] == '/' && p[1] == '*')
788 int lineno = this->lineno_;
789 int charpos = p - this->linestart_ + 1;
792 if (!this->skip_c_comment(pp))
793 return Token(Token::TOKEN_INVALID, lineno, charpos);
799 // Skip line comments.
803 if (!this->skip_line_comment(pp))
804 return this->make_eof_token(p);
810 if (this->can_start_name(p[0], p[1]))
811 return this->gather_token(Token::TOKEN_STRING,
812 &Lex::can_continue_name,
815 // We accept any arbitrary name in double quotes, as long as it
816 // does not cross a line boundary.
820 return this->gather_quoted_string(pp);
823 // Check for a number.
825 if (this->can_start_hex(p[0], p[1], p[2]))
826 return this->gather_token(Token::TOKEN_INTEGER,
827 &Lex::can_continue_hex,
830 if (Lex::can_start_number(p[0]))
831 return this->gather_token(Token::TOKEN_INTEGER,
832 &Lex::can_continue_number,
835 // Check for operators.
837 int opcode = Lex::three_char_operator(p[0], p[1], p[2]);
841 return this->make_token(opcode, p);
844 opcode = Lex::two_char_operator(p[0], p[1]);
848 return this->make_token(opcode, p);
851 opcode = Lex::one_char_operator(p[0]);
855 return this->make_token(opcode, p);
858 return this->make_token(Token::TOKEN_INVALID, p);
862 // Return the next token.
867 // The first token is special.
868 if (this->first_token_ != 0)
870 this->token_ = Token(this->first_token_, 0, 0);
871 this->first_token_ = 0;
872 return &this->token_;
875 this->token_ = this->get_token(&this->current_);
877 // Don't let an early null byte fool us into thinking that we've
878 // reached the end of the file.
879 if (this->token_.is_eof()
880 && (static_cast<size_t>(this->current_ - this->input_string_)
881 < this->input_length_))
882 this->token_ = this->make_invalid_token(this->current_);
884 return &this->token_;
887 // class Symbol_assignment.
889 // Add the symbol to the symbol table. This makes sure the symbol is
890 // there and defined. The actual value is stored later. We can't
891 // determine the actual value at this point, because we can't
892 // necessarily evaluate the expression until all ordinary symbols have
895 // The GNU linker lets symbol assignments in the linker script
896 // silently override defined symbols in object files. We are
897 // compatible. FIXME: Should we issue a warning?
900 Symbol_assignment::add_to_table(Symbol_table* symtab)
902 elfcpp::STV vis = this->hidden_ ? elfcpp::STV_HIDDEN : elfcpp::STV_DEFAULT;
903 this->sym_ = symtab->define_as_constant(this->name_.c_str(),
906 ? Symbol_table::DEFSYM
907 : Symbol_table::SCRIPT),
915 true); // force_override
918 // Finalize a symbol value.
921 Symbol_assignment::finalize(Symbol_table* symtab, const Layout* layout)
923 this->finalize_maybe_dot(symtab, layout, false, 0, NULL);
926 // Finalize a symbol value which can refer to the dot symbol.
929 Symbol_assignment::finalize_with_dot(Symbol_table* symtab,
930 const Layout* layout,
932 Output_section* dot_section)
934 this->finalize_maybe_dot(symtab, layout, true, dot_value, dot_section);
937 // Finalize a symbol value, internal version.
940 Symbol_assignment::finalize_maybe_dot(Symbol_table* symtab,
941 const Layout* layout,
942 bool is_dot_available,
944 Output_section* dot_section)
946 // If we were only supposed to provide this symbol, the sym_ field
947 // will be NULL if the symbol was not referenced.
948 if (this->sym_ == NULL)
950 gold_assert(this->provide_);
954 if (parameters->target().get_size() == 32)
956 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
957 this->sized_finalize<32>(symtab, layout, is_dot_available, dot_value,
963 else if (parameters->target().get_size() == 64)
965 #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
966 this->sized_finalize<64>(symtab, layout, is_dot_available, dot_value,
978 Symbol_assignment::sized_finalize(Symbol_table* symtab, const Layout* layout,
979 bool is_dot_available, uint64_t dot_value,
980 Output_section* dot_section)
982 Output_section* section;
983 elfcpp::STT type = elfcpp::STT_NOTYPE;
984 elfcpp::STV vis = elfcpp::STV_DEFAULT;
985 unsigned char nonvis = 0;
986 uint64_t final_val = this->val_->eval_maybe_dot(symtab, layout, true,
988 dot_value, dot_section,
989 §ion, NULL, &type,
990 &vis, &nonvis, false, NULL);
991 Sized_symbol<size>* ssym = symtab->get_sized_symbol<size>(this->sym_);
992 ssym->set_value(final_val);
993 ssym->set_type(type);
994 ssym->set_visibility(vis);
995 ssym->set_nonvis(nonvis);
997 ssym->set_output_section(section);
1000 // Set the symbol value if the expression yields an absolute value or
1001 // a value relative to DOT_SECTION.
1004 Symbol_assignment::set_if_absolute(Symbol_table* symtab, const Layout* layout,
1005 bool is_dot_available, uint64_t dot_value,
1006 Output_section* dot_section)
1008 if (this->sym_ == NULL)
1011 Output_section* val_section;
1013 uint64_t val = this->val_->eval_maybe_dot(symtab, layout, false,
1014 is_dot_available, dot_value,
1015 dot_section, &val_section, NULL,
1016 NULL, NULL, NULL, false, &is_valid);
1017 if (!is_valid || (val_section != NULL && val_section != dot_section))
1020 if (parameters->target().get_size() == 32)
1022 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
1023 Sized_symbol<32>* ssym = symtab->get_sized_symbol<32>(this->sym_);
1024 ssym->set_value(val);
1029 else if (parameters->target().get_size() == 64)
1031 #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
1032 Sized_symbol<64>* ssym = symtab->get_sized_symbol<64>(this->sym_);
1033 ssym->set_value(val);
1040 if (val_section != NULL)
1041 this->sym_->set_output_section(val_section);
1044 // Print for debugging.
1047 Symbol_assignment::print(FILE* f) const
1049 if (this->provide_ && this->hidden_)
1050 fprintf(f, "PROVIDE_HIDDEN(");
1051 else if (this->provide_)
1052 fprintf(f, "PROVIDE(");
1053 else if (this->hidden_)
1056 fprintf(f, "%s = ", this->name_.c_str());
1057 this->val_->print(f);
1059 if (this->provide_ || this->hidden_)
1065 // Class Script_assertion.
1067 // Check the assertion.
1070 Script_assertion::check(const Symbol_table* symtab, const Layout* layout)
1072 if (!this->check_->eval(symtab, layout, true))
1073 gold_error("%s", this->message_.c_str());
1076 // Print for debugging.
1079 Script_assertion::print(FILE* f) const
1081 fprintf(f, "ASSERT(");
1082 this->check_->print(f);
1083 fprintf(f, ", \"%s\")\n", this->message_.c_str());
1086 // Class Script_options.
1088 Script_options::Script_options()
1089 : entry_(), symbol_assignments_(), symbol_definitions_(),
1090 symbol_references_(), version_script_info_(), script_sections_()
1094 // Returns true if NAME is on the list of symbol assignments waiting
1098 Script_options::is_pending_assignment(const char* name)
1100 for (Symbol_assignments::iterator p = this->symbol_assignments_.begin();
1101 p != this->symbol_assignments_.end();
1103 if ((*p)->name() == name)
1108 // Add a symbol to be defined.
1111 Script_options::add_symbol_assignment(const char* name, size_t length,
1112 bool is_defsym, Expression* value,
1113 bool provide, bool hidden)
1115 if (length != 1 || name[0] != '.')
1117 if (this->script_sections_.in_sections_clause())
1119 gold_assert(!is_defsym);
1120 this->script_sections_.add_symbol_assignment(name, length, value,
1125 Symbol_assignment* p = new Symbol_assignment(name, length, is_defsym,
1126 value, provide, hidden);
1127 this->symbol_assignments_.push_back(p);
1132 std::string n(name, length);
1133 this->symbol_definitions_.insert(n);
1134 this->symbol_references_.erase(n);
1139 if (provide || hidden)
1140 gold_error(_("invalid use of PROVIDE for dot symbol"));
1142 // The GNU linker permits assignments to dot outside of SECTIONS
1143 // clauses and treats them as occurring inside, so we don't
1144 // check in_sections_clause here.
1145 this->script_sections_.add_dot_assignment(value);
1149 // Add a reference to a symbol.
1152 Script_options::add_symbol_reference(const char* name, size_t length)
1154 if (length != 1 || name[0] != '.')
1156 std::string n(name, length);
1157 if (this->symbol_definitions_.find(n) == this->symbol_definitions_.end())
1158 this->symbol_references_.insert(n);
1162 // Add an assertion.
1165 Script_options::add_assertion(Expression* check, const char* message,
1168 if (this->script_sections_.in_sections_clause())
1169 this->script_sections_.add_assertion(check, message, messagelen);
1172 Script_assertion* p = new Script_assertion(check, message, messagelen);
1173 this->assertions_.push_back(p);
1177 // Create sections required by any linker scripts.
1180 Script_options::create_script_sections(Layout* layout)
1182 if (this->saw_sections_clause())
1183 this->script_sections_.create_sections(layout);
1186 // Add any symbols we are defining to the symbol table.
1189 Script_options::add_symbols_to_table(Symbol_table* symtab)
1191 for (Symbol_assignments::iterator p = this->symbol_assignments_.begin();
1192 p != this->symbol_assignments_.end();
1194 (*p)->add_to_table(symtab);
1195 this->script_sections_.add_symbols_to_table(symtab);
1198 // Finalize symbol values. Also check assertions.
1201 Script_options::finalize_symbols(Symbol_table* symtab, const Layout* layout)
1203 // We finalize the symbols defined in SECTIONS first, because they
1204 // are the ones which may have changed. This way if symbol outside
1205 // SECTIONS are defined in terms of symbols inside SECTIONS, they
1206 // will get the right value.
1207 this->script_sections_.finalize_symbols(symtab, layout);
1209 for (Symbol_assignments::iterator p = this->symbol_assignments_.begin();
1210 p != this->symbol_assignments_.end();
1212 (*p)->finalize(symtab, layout);
1214 for (Assertions::iterator p = this->assertions_.begin();
1215 p != this->assertions_.end();
1217 (*p)->check(symtab, layout);
1220 // Set section addresses. We set all the symbols which have absolute
1221 // values. Then we let the SECTIONS clause do its thing. This
1222 // returns the segment which holds the file header and segment
1226 Script_options::set_section_addresses(Symbol_table* symtab, Layout* layout)
1228 for (Symbol_assignments::iterator p = this->symbol_assignments_.begin();
1229 p != this->symbol_assignments_.end();
1231 (*p)->set_if_absolute(symtab, layout, false, 0, NULL);
1233 return this->script_sections_.set_section_addresses(symtab, layout);
1236 // This class holds data passed through the parser to the lexer and to
1237 // the parser support functions. This avoids global variables. We
1238 // can't use global variables because we need not be called by a
1239 // singleton thread.
1241 class Parser_closure
1244 Parser_closure(const char* filename,
1245 const Position_dependent_options& posdep_options,
1246 bool parsing_defsym, bool in_group, bool is_in_sysroot,
1247 Command_line* command_line,
1248 Script_options* script_options,
1250 bool skip_on_incompatible_target,
1251 Script_info* script_info)
1252 : filename_(filename), posdep_options_(posdep_options),
1253 parsing_defsym_(parsing_defsym), in_group_(in_group),
1254 is_in_sysroot_(is_in_sysroot),
1255 skip_on_incompatible_target_(skip_on_incompatible_target),
1256 found_incompatible_target_(false),
1257 command_line_(command_line), script_options_(script_options),
1258 version_script_info_(script_options->version_script_info()),
1259 lex_(lex), lineno_(0), charpos_(0), lex_mode_stack_(), inputs_(NULL),
1260 script_info_(script_info)
1262 // We start out processing C symbols in the default lex mode.
1263 this->language_stack_.push_back(Version_script_info::LANGUAGE_C);
1264 this->lex_mode_stack_.push_back(lex->mode());
1267 // Return the file name.
1270 { return this->filename_; }
1272 // Return the position dependent options. The caller may modify
1274 Position_dependent_options&
1275 position_dependent_options()
1276 { return this->posdep_options_; }
1278 // Whether we are parsing a --defsym.
1280 parsing_defsym() const
1281 { return this->parsing_defsym_; }
1283 // Return whether this script is being run in a group.
1286 { return this->in_group_; }
1288 // Return whether this script was found using a directory in the
1291 is_in_sysroot() const
1292 { return this->is_in_sysroot_; }
1294 // Whether to skip to the next file with the same name if we find an
1295 // incompatible target in an OUTPUT_FORMAT statement.
1297 skip_on_incompatible_target() const
1298 { return this->skip_on_incompatible_target_; }
1300 // Stop skipping to the next file on an incompatible target. This
1301 // is called when we make some unrevocable change to the data
1304 clear_skip_on_incompatible_target()
1305 { this->skip_on_incompatible_target_ = false; }
1307 // Whether we found an incompatible target in an OUTPUT_FORMAT
1310 found_incompatible_target() const
1311 { return this->found_incompatible_target_; }
1313 // Note that we found an incompatible target.
1315 set_found_incompatible_target()
1316 { this->found_incompatible_target_ = true; }
1318 // Returns the Command_line structure passed in at constructor time.
1319 // This value may be NULL. The caller may modify this, which modifies
1320 // the passed-in Command_line object (not a copy).
1323 { return this->command_line_; }
1325 // Return the options which may be set by a script.
1328 { return this->script_options_; }
1330 // Return the object in which version script information should be stored.
1331 Version_script_info*
1333 { return this->version_script_info_; }
1335 // Return the next token, and advance.
1339 const Token* token = this->lex_->next_token();
1340 this->lineno_ = token->lineno();
1341 this->charpos_ = token->charpos();
1345 // Set a new lexer mode, pushing the current one.
1347 push_lex_mode(Lex::Mode mode)
1349 this->lex_mode_stack_.push_back(this->lex_->mode());
1350 this->lex_->set_mode(mode);
1353 // Pop the lexer mode.
1357 gold_assert(!this->lex_mode_stack_.empty());
1358 this->lex_->set_mode(this->lex_mode_stack_.back());
1359 this->lex_mode_stack_.pop_back();
1362 // Return the current lexer mode.
1365 { return this->lex_mode_stack_.back(); }
1367 // Return the line number of the last token.
1370 { return this->lineno_; }
1372 // Return the character position in the line of the last token.
1375 { return this->charpos_; }
1377 // Return the list of input files, creating it if necessary. This
1378 // is a space leak--we never free the INPUTS_ pointer.
1382 if (this->inputs_ == NULL)
1383 this->inputs_ = new Input_arguments();
1384 return this->inputs_;
1387 // Return whether we saw any input files.
1390 { return this->inputs_ != NULL && !this->inputs_->empty(); }
1392 // Return the current language being processed in a version script
1393 // (eg, "C++"). The empty string represents unmangled C names.
1394 Version_script_info::Language
1395 get_current_language() const
1396 { return this->language_stack_.back(); }
1398 // Push a language onto the stack when entering an extern block.
1400 push_language(Version_script_info::Language lang)
1401 { this->language_stack_.push_back(lang); }
1403 // Pop a language off of the stack when exiting an extern block.
1407 gold_assert(!this->language_stack_.empty());
1408 this->language_stack_.pop_back();
1411 // Return a pointer to the incremental info.
1414 { return this->script_info_; }
1417 // The name of the file we are reading.
1418 const char* filename_;
1419 // The position dependent options.
1420 Position_dependent_options posdep_options_;
1421 // True if we are parsing a --defsym.
1422 bool parsing_defsym_;
1423 // Whether we are currently in a --start-group/--end-group.
1425 // Whether the script was found in a sysrooted directory.
1426 bool is_in_sysroot_;
1427 // If this is true, then if we find an OUTPUT_FORMAT with an
1428 // incompatible target, then we tell the parser to abort so that we
1429 // can search for the next file with the same name.
1430 bool skip_on_incompatible_target_;
1431 // True if we found an OUTPUT_FORMAT with an incompatible target.
1432 bool found_incompatible_target_;
1433 // May be NULL if the user chooses not to pass one in.
1434 Command_line* command_line_;
1435 // Options which may be set from any linker script.
1436 Script_options* script_options_;
1437 // Information parsed from a version script.
1438 Version_script_info* version_script_info_;
1441 // The line number of the last token returned by next_token.
1443 // The column number of the last token returned by next_token.
1445 // A stack of lexer modes.
1446 std::vector<Lex::Mode> lex_mode_stack_;
1447 // A stack of which extern/language block we're inside. Can be C++,
1448 // java, or empty for C.
1449 std::vector<Version_script_info::Language> language_stack_;
1450 // New input files found to add to the link.
1451 Input_arguments* inputs_;
1452 // Pointer to incremental linking info.
1453 Script_info* script_info_;
1456 // FILE was found as an argument on the command line. Try to read it
1457 // as a script. Return true if the file was handled.
1460 read_input_script(Workqueue* workqueue, Symbol_table* symtab, Layout* layout,
1461 Dirsearch* dirsearch, int dirindex,
1462 Input_objects* input_objects, Mapfile* mapfile,
1463 Input_group* input_group,
1464 const Input_argument* input_argument,
1465 Input_file* input_file, Task_token* next_blocker,
1466 bool* used_next_blocker)
1468 *used_next_blocker = false;
1470 std::string input_string;
1471 Lex::read_file(input_file, &input_string);
1473 Lex lex(input_string.c_str(), input_string.length(), PARSING_LINKER_SCRIPT);
1475 Script_info* script_info = NULL;
1476 if (layout->incremental_inputs() != NULL)
1478 const std::string& filename = input_file->filename();
1479 Timespec mtime = input_file->file().get_mtime();
1480 unsigned int arg_serial = input_argument->file().arg_serial();
1481 script_info = new Script_info(filename);
1482 layout->incremental_inputs()->report_script(script_info, arg_serial,
1486 Parser_closure closure(input_file->filename().c_str(),
1487 input_argument->file().options(),
1489 input_group != NULL,
1490 input_file->is_in_sysroot(),
1492 layout->script_options(),
1494 input_file->will_search_for(),
1497 bool old_saw_sections_clause =
1498 layout->script_options()->saw_sections_clause();
1500 if (yyparse(&closure) != 0)
1502 if (closure.found_incompatible_target())
1504 Read_symbols::incompatible_warning(input_argument, input_file);
1505 Read_symbols::requeue(workqueue, input_objects, symtab, layout,
1506 dirsearch, dirindex, mapfile, input_argument,
1507 input_group, next_blocker);
1513 if (!old_saw_sections_clause
1514 && layout->script_options()->saw_sections_clause()
1515 && layout->have_added_input_section())
1516 gold_error(_("%s: SECTIONS seen after other input files; try -T/--script"),
1517 input_file->filename().c_str());
1519 if (!closure.saw_inputs())
1522 Task_token* this_blocker = NULL;
1523 for (Input_arguments::const_iterator p = closure.inputs()->begin();
1524 p != closure.inputs()->end();
1528 if (p + 1 == closure.inputs()->end())
1532 nb = new Task_token(true);
1535 workqueue->queue_soon(new Read_symbols(input_objects, symtab,
1536 layout, dirsearch, 0, mapfile, &*p,
1537 input_group, NULL, this_blocker, nb));
1541 *used_next_blocker = true;
1546 // Helper function for read_version_script(), read_commandline_script() and
1547 // script_include_directive(). Processes the given file in the mode indicated
1548 // by first_token and lex_mode.
1551 read_script_file(const char* filename, Command_line* cmdline,
1552 Script_options* script_options,
1553 int first_token, Lex::Mode lex_mode)
1555 Dirsearch dirsearch;
1556 std::string name = filename;
1558 // If filename is a relative filename, search for it manually using "." +
1559 // cmdline->options()->library_path() -- not dirsearch.
1560 if (!IS_ABSOLUTE_PATH(filename))
1562 const General_options::Dir_list& search_path =
1563 cmdline->options().library_path();
1564 name = Dirsearch::find_file_in_dir_list(name, search_path, ".");
1567 // The file locking code wants to record a Task, but we haven't
1568 // started the workqueue yet. This is only for debugging purposes,
1569 // so we invent a fake value.
1570 const Task* task = reinterpret_cast<const Task*>(-1);
1572 // We don't want this file to be opened in binary mode.
1573 Position_dependent_options posdep = cmdline->position_dependent_options();
1574 if (posdep.format_enum() == General_options::OBJECT_FORMAT_BINARY)
1575 posdep.set_format_enum(General_options::OBJECT_FORMAT_ELF);
1576 Input_file_argument input_argument(name.c_str(),
1577 Input_file_argument::INPUT_FILE_TYPE_FILE,
1579 Input_file input_file(&input_argument);
1581 if (!input_file.open(dirsearch, task, &dummy))
1584 std::string input_string;
1585 Lex::read_file(&input_file, &input_string);
1587 Lex lex(input_string.c_str(), input_string.length(), first_token);
1588 lex.set_mode(lex_mode);
1590 Parser_closure closure(filename,
1591 cmdline->position_dependent_options(),
1592 first_token == Lex::DYNAMIC_LIST,
1594 input_file.is_in_sysroot(),
1600 if (yyparse(&closure) != 0)
1602 input_file.file().unlock(task);
1606 input_file.file().unlock(task);
1608 gold_assert(!closure.saw_inputs());
1613 // FILENAME was found as an argument to --script (-T).
1614 // Read it as a script, and execute its contents immediately.
1617 read_commandline_script(const char* filename, Command_line* cmdline)
1619 return read_script_file(filename, cmdline, &cmdline->script_options(),
1620 PARSING_LINKER_SCRIPT, Lex::LINKER_SCRIPT);
1623 // FILENAME was found as an argument to --version-script. Read it as
1624 // a version script, and store its contents in
1625 // cmdline->script_options()->version_script_info().
1628 read_version_script(const char* filename, Command_line* cmdline)
1630 return read_script_file(filename, cmdline, &cmdline->script_options(),
1631 PARSING_VERSION_SCRIPT, Lex::VERSION_SCRIPT);
1634 // FILENAME was found as an argument to --dynamic-list. Read it as a
1635 // list of symbols, and store its contents in DYNAMIC_LIST.
1638 read_dynamic_list(const char* filename, Command_line* cmdline,
1639 Script_options* dynamic_list)
1641 return read_script_file(filename, cmdline, dynamic_list,
1642 PARSING_DYNAMIC_LIST, Lex::DYNAMIC_LIST);
1645 // Implement the --defsym option on the command line. Return true if
1649 Script_options::define_symbol(const char* definition)
1651 Lex lex(definition, strlen(definition), PARSING_DEFSYM);
1652 lex.set_mode(Lex::EXPRESSION);
1655 Position_dependent_options posdep_options;
1657 Parser_closure closure("command line", posdep_options, true,
1658 false, false, NULL, this, &lex, false, NULL);
1660 if (yyparse(&closure) != 0)
1663 gold_assert(!closure.saw_inputs());
1668 // Print the script to F for debugging.
1671 Script_options::print(FILE* f) const
1673 fprintf(f, "%s: Dumping linker script\n", program_name);
1675 if (!this->entry_.empty())
1676 fprintf(f, "ENTRY(%s)\n", this->entry_.c_str());
1678 for (Symbol_assignments::const_iterator p =
1679 this->symbol_assignments_.begin();
1680 p != this->symbol_assignments_.end();
1684 for (Assertions::const_iterator p = this->assertions_.begin();
1685 p != this->assertions_.end();
1689 this->script_sections_.print(f);
1691 this->version_script_info_.print(f);
1694 // Manage mapping from keywords to the codes expected by the bison
1695 // parser. We construct one global object for each lex mode with
1698 class Keyword_to_parsecode
1701 // The structure which maps keywords to parsecodes.
1702 struct Keyword_parsecode
1705 const char* keyword;
1706 // Corresponding parsecode.
1710 Keyword_to_parsecode(const Keyword_parsecode* keywords,
1712 : keyword_parsecodes_(keywords), keyword_count_(keyword_count)
1715 // Return the parsecode corresponding KEYWORD, or 0 if it is not a
1718 keyword_to_parsecode(const char* keyword, size_t len) const;
1721 const Keyword_parsecode* keyword_parsecodes_;
1722 const int keyword_count_;
1725 // Mapping from keyword string to keyword parsecode. This array must
1726 // be kept in sorted order. Parsecodes are looked up using bsearch.
1727 // This array must correspond to the list of parsecodes in yyscript.y.
1729 static const Keyword_to_parsecode::Keyword_parsecode
1730 script_keyword_parsecodes[] =
1732 { "ABSOLUTE", ABSOLUTE },
1734 { "ALIGN", ALIGN_K },
1735 { "ALIGNOF", ALIGNOF },
1736 { "ASSERT", ASSERT_K },
1737 { "AS_NEEDED", AS_NEEDED },
1742 { "CONSTANT", CONSTANT },
1743 { "CONSTRUCTORS", CONSTRUCTORS },
1745 { "CREATE_OBJECT_SYMBOLS", CREATE_OBJECT_SYMBOLS },
1746 { "DATA_SEGMENT_ALIGN", DATA_SEGMENT_ALIGN },
1747 { "DATA_SEGMENT_END", DATA_SEGMENT_END },
1748 { "DATA_SEGMENT_RELRO_END", DATA_SEGMENT_RELRO_END },
1749 { "DEFINED", DEFINED },
1752 { "EXCLUDE_FILE", EXCLUDE_FILE },
1753 { "EXTERN", EXTERN },
1756 { "FORCE_COMMON_ALLOCATION", FORCE_COMMON_ALLOCATION },
1758 { "HIDDEN", HIDDEN },
1760 { "INCLUDE", INCLUDE },
1762 { "INHIBIT_COMMON_ALLOCATION", INHIBIT_COMMON_ALLOCATION },
1765 { "LENGTH", LENGTH },
1766 { "LOADADDR", LOADADDR },
1770 { "MEMORY", MEMORY },
1773 { "NOCROSSREFS", NOCROSSREFS },
1774 { "NOFLOAT", NOFLOAT },
1775 { "NOLOAD", NOLOAD },
1776 { "ONLY_IF_RO", ONLY_IF_RO },
1777 { "ONLY_IF_RW", ONLY_IF_RW },
1778 { "OPTION", OPTION },
1779 { "ORIGIN", ORIGIN },
1780 { "OUTPUT", OUTPUT },
1781 { "OUTPUT_ARCH", OUTPUT_ARCH },
1782 { "OUTPUT_FORMAT", OUTPUT_FORMAT },
1783 { "OVERLAY", OVERLAY },
1785 { "PROVIDE", PROVIDE },
1786 { "PROVIDE_HIDDEN", PROVIDE_HIDDEN },
1788 { "SEARCH_DIR", SEARCH_DIR },
1789 { "SECTIONS", SECTIONS },
1790 { "SEGMENT_START", SEGMENT_START },
1792 { "SIZEOF", SIZEOF },
1793 { "SIZEOF_HEADERS", SIZEOF_HEADERS },
1794 { "SORT", SORT_BY_NAME },
1795 { "SORT_BY_ALIGNMENT", SORT_BY_ALIGNMENT },
1796 { "SORT_BY_INIT_PRIORITY", SORT_BY_INIT_PRIORITY },
1797 { "SORT_BY_NAME", SORT_BY_NAME },
1798 { "SPECIAL", SPECIAL },
1800 { "STARTUP", STARTUP },
1801 { "SUBALIGN", SUBALIGN },
1802 { "SYSLIB", SYSLIB },
1803 { "TARGET", TARGET_K },
1804 { "TRUNCATE", TRUNCATE },
1805 { "VERSION", VERSIONK },
1806 { "global", GLOBAL },
1812 { "sizeof_headers", SIZEOF_HEADERS },
1815 static const Keyword_to_parsecode
1816 script_keywords(&script_keyword_parsecodes[0],
1817 (sizeof(script_keyword_parsecodes)
1818 / sizeof(script_keyword_parsecodes[0])));
1820 static const Keyword_to_parsecode::Keyword_parsecode
1821 version_script_keyword_parsecodes[] =
1823 { "extern", EXTERN },
1824 { "global", GLOBAL },
1828 static const Keyword_to_parsecode
1829 version_script_keywords(&version_script_keyword_parsecodes[0],
1830 (sizeof(version_script_keyword_parsecodes)
1831 / sizeof(version_script_keyword_parsecodes[0])));
1833 static const Keyword_to_parsecode::Keyword_parsecode
1834 dynamic_list_keyword_parsecodes[] =
1836 { "extern", EXTERN },
1839 static const Keyword_to_parsecode
1840 dynamic_list_keywords(&dynamic_list_keyword_parsecodes[0],
1841 (sizeof(dynamic_list_keyword_parsecodes)
1842 / sizeof(dynamic_list_keyword_parsecodes[0])));
1846 // Comparison function passed to bsearch.
1858 ktt_compare(const void* keyv, const void* kttv)
1860 const Ktt_key* key = static_cast<const Ktt_key*>(keyv);
1861 const Keyword_to_parsecode::Keyword_parsecode* ktt =
1862 static_cast<const Keyword_to_parsecode::Keyword_parsecode*>(kttv);
1863 int i = strncmp(key->str, ktt->keyword, key->len);
1866 if (ktt->keyword[key->len] != '\0')
1871 } // End extern "C".
1874 Keyword_to_parsecode::keyword_to_parsecode(const char* keyword,
1880 void* kttv = bsearch(&key,
1881 this->keyword_parsecodes_,
1882 this->keyword_count_,
1883 sizeof(this->keyword_parsecodes_[0]),
1887 Keyword_parsecode* ktt = static_cast<Keyword_parsecode*>(kttv);
1888 return ktt->parsecode;
1891 // The following structs are used within the VersionInfo class as well
1892 // as in the bison helper functions. They store the information
1893 // parsed from the version script.
1895 // A single version expression.
1896 // For example, pattern="std::map*" and language="C++".
1897 struct Version_expression
1899 Version_expression(const std::string& a_pattern,
1900 Version_script_info::Language a_language,
1902 : pattern(a_pattern), language(a_language), exact_match(a_exact_match),
1903 was_matched_by_symbol(false)
1906 std::string pattern;
1907 Version_script_info::Language language;
1908 // If false, we use glob() to match pattern. If true, we use strcmp().
1910 // True if --no-undefined-version is in effect and we found this
1911 // version in get_symbol_version. We use mutable because this
1912 // struct is generally not modifiable after it has been created.
1913 mutable bool was_matched_by_symbol;
1916 // A list of expressions.
1917 struct Version_expression_list
1919 std::vector<struct Version_expression> expressions;
1922 // A list of which versions upon which another version depends.
1923 // Strings should be from the Stringpool.
1924 struct Version_dependency_list
1926 std::vector<std::string> dependencies;
1929 // The total definition of a version. It includes the tag for the
1930 // version, its global and local expressions, and any dependencies.
1934 : tag(), global(NULL), local(NULL), dependencies(NULL)
1938 const struct Version_expression_list* global;
1939 const struct Version_expression_list* local;
1940 const struct Version_dependency_list* dependencies;
1943 // Helper class that calls cplus_demangle when needed and takes care of freeing
1946 class Lazy_demangler
1949 Lazy_demangler(const char* symbol, int options)
1950 : symbol_(symbol), options_(options), demangled_(NULL), did_demangle_(false)
1954 { free(this->demangled_); }
1956 // Return the demangled name. The actual demangling happens on the first call,
1957 // and the result is later cached.
1962 // The symbol to demangle.
1963 const char* symbol_;
1964 // Option flags to pass to cplus_demagle.
1966 // The cached demangled value, or NULL if demangling didn't happen yet or
1969 // Whether we already called cplus_demangle
1973 // Return the demangled name. The actual demangling happens on the first call,
1974 // and the result is later cached. Returns NULL if the symbol cannot be
1978 Lazy_demangler::get()
1980 if (!this->did_demangle_)
1982 this->demangled_ = cplus_demangle(this->symbol_, this->options_);
1983 this->did_demangle_ = true;
1985 return this->demangled_;
1988 // Class Version_script_info.
1990 Version_script_info::Version_script_info()
1991 : dependency_lists_(), expression_lists_(), version_trees_(), globs_(),
1992 default_version_(NULL), default_is_global_(false), is_finalized_(false)
1994 for (int i = 0; i < LANGUAGE_COUNT; ++i)
1995 this->exact_[i] = NULL;
1998 Version_script_info::~Version_script_info()
2002 // Forget all the known version script information.
2005 Version_script_info::clear()
2007 for (size_t k = 0; k < this->dependency_lists_.size(); ++k)
2008 delete this->dependency_lists_[k];
2009 this->dependency_lists_.clear();
2010 for (size_t k = 0; k < this->version_trees_.size(); ++k)
2011 delete this->version_trees_[k];
2012 this->version_trees_.clear();
2013 for (size_t k = 0; k < this->expression_lists_.size(); ++k)
2014 delete this->expression_lists_[k];
2015 this->expression_lists_.clear();
2018 // Finalize the version script information.
2021 Version_script_info::finalize()
2023 if (!this->is_finalized_)
2025 this->build_lookup_tables();
2026 this->is_finalized_ = true;
2030 // Return all the versions.
2032 std::vector<std::string>
2033 Version_script_info::get_versions() const
2035 std::vector<std::string> ret;
2036 for (size_t j = 0; j < this->version_trees_.size(); ++j)
2037 if (!this->version_trees_[j]->tag.empty())
2038 ret.push_back(this->version_trees_[j]->tag);
2042 // Return the dependencies of VERSION.
2044 std::vector<std::string>
2045 Version_script_info::get_dependencies(const char* version) const
2047 std::vector<std::string> ret;
2048 for (size_t j = 0; j < this->version_trees_.size(); ++j)
2049 if (this->version_trees_[j]->tag == version)
2051 const struct Version_dependency_list* deps =
2052 this->version_trees_[j]->dependencies;
2054 for (size_t k = 0; k < deps->dependencies.size(); ++k)
2055 ret.push_back(deps->dependencies[k]);
2061 // A version script essentially maps a symbol name to a version tag
2062 // and an indication of whether symbol is global or local within that
2063 // version tag. Each symbol maps to at most one version tag.
2064 // Unfortunately, in practice, version scripts are ambiguous, and list
2065 // symbols multiple times. Thus, we have to document the matching
2068 // This is a description of what the GNU linker does as of 2010-01-11.
2069 // It walks through the version tags in the order in which they appear
2070 // in the version script. For each tag, it first walks through the
2071 // global patterns for that tag, then the local patterns. When
2072 // looking at a single pattern, it first applies any language specific
2073 // demangling as specified for the pattern, and then matches the
2074 // resulting symbol name to the pattern. If it finds an exact match
2075 // for a literal pattern (a pattern enclosed in quotes or with no
2076 // wildcard characters), then that is the match that it uses. If
2077 // finds a match with a wildcard pattern, then it saves it and
2078 // continues searching. Wildcard patterns that are exactly "*" are
2079 // saved separately.
2081 // If no exact match with a literal pattern is ever found, then if a
2082 // wildcard match with a global pattern was found it is used,
2083 // otherwise if a wildcard match with a local pattern was found it is
2086 // This is the result:
2087 // * If there is an exact match, then we use the first tag in the
2088 // version script where it matches.
2089 // + If the exact match in that tag is global, it is used.
2090 // + Otherwise the exact match in that tag is local, and is used.
2091 // * Otherwise, if there is any match with a global wildcard pattern:
2092 // + If there is any match with a wildcard pattern which is not
2093 // "*", then we use the tag in which the *last* such pattern
2095 // + Otherwise, we matched "*". If there is no match with a local
2096 // wildcard pattern which is not "*", then we use the *last*
2097 // match with a global "*". Otherwise, continue.
2098 // * Otherwise, if there is any match with a local wildcard pattern:
2099 // + If there is any match with a wildcard pattern which is not
2100 // "*", then we use the tag in which the *last* such pattern
2102 // + Otherwise, we matched "*", and we use the tag in which the
2103 // *last* such match occurred.
2105 // There is an additional wrinkle. When the GNU linker finds a symbol
2106 // with a version defined in an object file due to a .symver
2107 // directive, it looks up that symbol name in that version tag. If it
2108 // finds it, it matches the symbol name against the patterns for that
2109 // version. If there is no match with a global pattern, but there is
2110 // a match with a local pattern, then the GNU linker marks the symbol
2113 // We want gold to be generally compatible, but we also want gold to
2114 // be fast. These are the rules that gold implements:
2115 // * If there is an exact match for the mangled name, we use it.
2116 // + If there is more than one exact match, we give a warning, and
2117 // we use the first tag in the script which matches.
2118 // + If a symbol has an exact match as both global and local for
2119 // the same version tag, we give an error.
2120 // * Otherwise, we look for an extern C++ or an extern Java exact
2121 // match. If we find an exact match, we use it.
2122 // + If there is more than one exact match, we give a warning, and
2123 // we use the first tag in the script which matches.
2124 // + If a symbol has an exact match as both global and local for
2125 // the same version tag, we give an error.
2126 // * Otherwise, we look through the wildcard patterns, ignoring "*"
2127 // patterns. We look through the version tags in reverse order.
2128 // For each version tag, we look through the global patterns and
2129 // then the local patterns. We use the first match we find (i.e.,
2130 // the last matching version tag in the file).
2131 // * Otherwise, we use the "*" pattern if there is one. We give an
2132 // error if there are multiple "*" patterns.
2134 // At least for now, gold does not look up the version tag for a
2135 // symbol version found in an object file to see if it should be
2136 // forced local. There are other ways to force a symbol to be local,
2137 // and I don't understand why this one is useful.
2139 // Build a set of fast lookup tables for a version script.
2142 Version_script_info::build_lookup_tables()
2144 size_t size = this->version_trees_.size();
2145 for (size_t j = 0; j < size; ++j)
2147 const Version_tree* v = this->version_trees_[j];
2148 this->build_expression_list_lookup(v->local, v, false);
2149 this->build_expression_list_lookup(v->global, v, true);
2153 // If a pattern has backlashes but no unquoted wildcard characters,
2154 // then we apply backslash unquoting and look for an exact match.
2155 // Otherwise we treat it as a wildcard pattern. This function returns
2156 // true for a wildcard pattern. Otherwise, it does backslash
2157 // unquoting on *PATTERN and returns false. If this returns true,
2158 // *PATTERN may have been partially unquoted.
2161 Version_script_info::unquote(std::string* pattern) const
2163 bool saw_backslash = false;
2164 size_t len = pattern->length();
2166 for (size_t i = 0; i < len; ++i)
2169 saw_backslash = false;
2172 switch ((*pattern)[i])
2174 case '?': case '[': case '*':
2177 saw_backslash = true;
2185 (*pattern)[j] = (*pattern)[i];
2191 // Add an exact match for MATCH to *PE. The result of the match is
2195 Version_script_info::add_exact_match(const std::string& match,
2196 const Version_tree* v, bool is_global,
2197 const Version_expression* ve,
2200 std::pair<Exact::iterator, bool> ins =
2201 pe->insert(std::make_pair(match, Version_tree_match(v, is_global, ve)));
2204 // This is the first time we have seen this match.
2208 Version_tree_match& vtm(ins.first->second);
2209 if (vtm.real->tag != v->tag)
2211 // This is an ambiguous match. We still return the
2212 // first version that we found in the script, but we
2213 // record the new version to issue a warning if we
2214 // wind up looking up this symbol.
2215 if (vtm.ambiguous == NULL)
2218 else if (is_global != vtm.is_global)
2220 // We have a match for both the global and local entries for a
2221 // version tag. That's got to be wrong.
2222 gold_error(_("'%s' appears as both a global and a local symbol "
2223 "for version '%s' in script"),
2224 match.c_str(), v->tag.c_str());
2228 // Build fast lookup information for EXPLIST and store it in LOOKUP.
2229 // All matches go to V, and IS_GLOBAL is true if they are global
2233 Version_script_info::build_expression_list_lookup(
2234 const Version_expression_list* explist,
2235 const Version_tree* v,
2238 if (explist == NULL)
2240 size_t size = explist->expressions.size();
2241 for (size_t i = 0; i < size; ++i)
2243 const Version_expression& exp(explist->expressions[i]);
2245 if (exp.pattern.length() == 1 && exp.pattern[0] == '*')
2247 if (this->default_version_ != NULL
2248 && this->default_version_->tag != v->tag)
2249 gold_warning(_("wildcard match appears in both version '%s' "
2250 "and '%s' in script"),
2251 this->default_version_->tag.c_str(), v->tag.c_str());
2252 else if (this->default_version_ != NULL
2253 && this->default_is_global_ != is_global)
2254 gold_error(_("wildcard match appears as both global and local "
2255 "in version '%s' in script"),
2257 this->default_version_ = v;
2258 this->default_is_global_ = is_global;
2262 std::string pattern = exp.pattern;
2263 if (!exp.exact_match)
2265 if (this->unquote(&pattern))
2267 this->globs_.push_back(Glob(&exp, v, is_global));
2272 if (this->exact_[exp.language] == NULL)
2273 this->exact_[exp.language] = new Exact();
2274 this->add_exact_match(pattern, v, is_global, &exp,
2275 this->exact_[exp.language]);
2279 // Return the name to match given a name, a language code, and two
2283 Version_script_info::get_name_to_match(const char* name,
2285 Lazy_demangler* cpp_demangler,
2286 Lazy_demangler* java_demangler) const
2293 return cpp_demangler->get();
2295 return java_demangler->get();
2301 // Look up SYMBOL_NAME in the list of versions. Return true if the
2302 // symbol is found, false if not. If the symbol is found, then if
2303 // PVERSION is not NULL, set *PVERSION to the version tag, and if
2304 // P_IS_GLOBAL is not NULL, set *P_IS_GLOBAL according to whether the
2305 // symbol is global or not.
2308 Version_script_info::get_symbol_version(const char* symbol_name,
2309 std::string* pversion,
2310 bool* p_is_global) const
2312 Lazy_demangler cpp_demangled_name(symbol_name, DMGL_ANSI | DMGL_PARAMS);
2313 Lazy_demangler java_demangled_name(symbol_name,
2314 DMGL_ANSI | DMGL_PARAMS | DMGL_JAVA);
2316 gold_assert(this->is_finalized_);
2317 for (int i = 0; i < LANGUAGE_COUNT; ++i)
2319 Exact* exact = this->exact_[i];
2323 const char* name_to_match = this->get_name_to_match(symbol_name, i,
2324 &cpp_demangled_name,
2325 &java_demangled_name);
2326 if (name_to_match == NULL)
2328 // If the name can not be demangled, the GNU linker goes
2329 // ahead and tries to match it anyhow. That does not
2330 // make sense to me and I have not implemented it.
2334 Exact::const_iterator pe = exact->find(name_to_match);
2335 if (pe != exact->end())
2337 const Version_tree_match& vtm(pe->second);
2338 if (vtm.ambiguous != NULL)
2339 gold_warning(_("using '%s' as version for '%s' which is also "
2340 "named in version '%s' in script"),
2341 vtm.real->tag.c_str(), name_to_match,
2342 vtm.ambiguous->tag.c_str());
2344 if (pversion != NULL)
2345 *pversion = vtm.real->tag;
2346 if (p_is_global != NULL)
2347 *p_is_global = vtm.is_global;
2349 // If we are using --no-undefined-version, and this is a
2350 // global symbol, we have to record that we have found this
2351 // symbol, so that we don't warn about it. We have to do
2352 // this now, because otherwise we have no way to get from a
2353 // non-C language back to the demangled name that we
2355 if (p_is_global != NULL && vtm.is_global)
2356 vtm.expression->was_matched_by_symbol = true;
2362 // Look through the glob patterns in reverse order.
2364 for (Globs::const_reverse_iterator p = this->globs_.rbegin();
2365 p != this->globs_.rend();
2368 int language = p->expression->language;
2369 const char* name_to_match = this->get_name_to_match(symbol_name,
2371 &cpp_demangled_name,
2372 &java_demangled_name);
2373 if (name_to_match == NULL)
2376 if (fnmatch(p->expression->pattern.c_str(), name_to_match,
2379 if (pversion != NULL)
2380 *pversion = p->version->tag;
2381 if (p_is_global != NULL)
2382 *p_is_global = p->is_global;
2387 // Finally, there may be a wildcard.
2388 if (this->default_version_ != NULL)
2390 if (pversion != NULL)
2391 *pversion = this->default_version_->tag;
2392 if (p_is_global != NULL)
2393 *p_is_global = this->default_is_global_;
2400 // Give an error if any exact symbol names (not wildcards) appear in a
2401 // version script, but there is no such symbol.
2404 Version_script_info::check_unmatched_names(const Symbol_table* symtab) const
2406 for (size_t i = 0; i < this->version_trees_.size(); ++i)
2408 const Version_tree* vt = this->version_trees_[i];
2409 if (vt->global == NULL)
2411 for (size_t j = 0; j < vt->global->expressions.size(); ++j)
2413 const Version_expression& expression(vt->global->expressions[j]);
2415 // Ignore cases where we used the version because we saw a
2416 // symbol that we looked up. Note that
2417 // WAS_MATCHED_BY_SYMBOL will be true even if the symbol was
2418 // not a definition. That's OK as in that case we most
2419 // likely gave an undefined symbol error anyhow.
2420 if (expression.was_matched_by_symbol)
2423 // Just ignore names which are in languages other than C.
2424 // We have no way to look them up in the symbol table.
2425 if (expression.language != LANGUAGE_C)
2428 // Remove backslash quoting, and ignore wildcard patterns.
2429 std::string pattern = expression.pattern;
2430 if (!expression.exact_match)
2432 if (this->unquote(&pattern))
2436 if (symtab->lookup(pattern.c_str(), vt->tag.c_str()) == NULL)
2437 gold_error(_("version script assignment of %s to symbol %s "
2438 "failed: symbol not defined"),
2439 vt->tag.c_str(), pattern.c_str());
2444 struct Version_dependency_list*
2445 Version_script_info::allocate_dependency_list()
2447 dependency_lists_.push_back(new Version_dependency_list);
2448 return dependency_lists_.back();
2451 struct Version_expression_list*
2452 Version_script_info::allocate_expression_list()
2454 expression_lists_.push_back(new Version_expression_list);
2455 return expression_lists_.back();
2458 struct Version_tree*
2459 Version_script_info::allocate_version_tree()
2461 version_trees_.push_back(new Version_tree);
2462 return version_trees_.back();
2465 // Print for debugging.
2468 Version_script_info::print(FILE* f) const
2473 fprintf(f, "VERSION {");
2475 for (size_t i = 0; i < this->version_trees_.size(); ++i)
2477 const Version_tree* vt = this->version_trees_[i];
2479 if (vt->tag.empty())
2482 fprintf(f, " %s {\n", vt->tag.c_str());
2484 if (vt->global != NULL)
2486 fprintf(f, " global :\n");
2487 this->print_expression_list(f, vt->global);
2490 if (vt->local != NULL)
2492 fprintf(f, " local :\n");
2493 this->print_expression_list(f, vt->local);
2497 if (vt->dependencies != NULL)
2499 const Version_dependency_list* deps = vt->dependencies;
2500 for (size_t j = 0; j < deps->dependencies.size(); ++j)
2502 if (j < deps->dependencies.size() - 1)
2504 fprintf(f, " %s", deps->dependencies[j].c_str());
2514 Version_script_info::print_expression_list(
2516 const Version_expression_list* vel) const
2518 Version_script_info::Language current_language = LANGUAGE_C;
2519 for (size_t i = 0; i < vel->expressions.size(); ++i)
2521 const Version_expression& ve(vel->expressions[i]);
2523 if (ve.language != current_language)
2525 if (current_language != LANGUAGE_C)
2527 switch (ve.language)
2532 fprintf(f, " extern \"C++\" {\n");
2535 fprintf(f, " extern \"Java\" {\n");
2540 current_language = ve.language;
2544 if (current_language != LANGUAGE_C)
2549 fprintf(f, "%s", ve.pattern.c_str());
2556 if (current_language != LANGUAGE_C)
2560 } // End namespace gold.
2562 // The remaining functions are extern "C", so it's clearer to not put
2563 // them in namespace gold.
2565 using namespace gold;
2567 // This function is called by the bison parser to return the next
2571 yylex(YYSTYPE* lvalp, void* closurev)
2573 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2574 const Token* token = closure->next_token();
2575 switch (token->classification())
2580 case Token::TOKEN_INVALID:
2581 yyerror(closurev, "invalid character");
2584 case Token::TOKEN_EOF:
2587 case Token::TOKEN_STRING:
2589 // This is either a keyword or a STRING.
2591 const char* str = token->string_value(&len);
2593 switch (closure->lex_mode())
2595 case Lex::LINKER_SCRIPT:
2596 parsecode = script_keywords.keyword_to_parsecode(str, len);
2598 case Lex::VERSION_SCRIPT:
2599 parsecode = version_script_keywords.keyword_to_parsecode(str, len);
2601 case Lex::DYNAMIC_LIST:
2602 parsecode = dynamic_list_keywords.keyword_to_parsecode(str, len);
2609 lvalp->string.value = str;
2610 lvalp->string.length = len;
2614 case Token::TOKEN_QUOTED_STRING:
2615 lvalp->string.value = token->string_value(&lvalp->string.length);
2616 return QUOTED_STRING;
2618 case Token::TOKEN_OPERATOR:
2619 return token->operator_value();
2621 case Token::TOKEN_INTEGER:
2622 lvalp->integer = token->integer_value();
2627 // This function is called by the bison parser to report an error.
2630 yyerror(void* closurev, const char* message)
2632 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2633 gold_error(_("%s:%d:%d: %s"), closure->filename(), closure->lineno(),
2634 closure->charpos(), message);
2637 // Called by the bison parser to add an external symbol to the link.
2640 script_add_extern(void* closurev, const char* name, size_t length)
2642 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2643 closure->script_options()->add_symbol_reference(name, length);
2646 // Called by the bison parser to add a file to the link.
2649 script_add_file(void* closurev, const char* name, size_t length)
2651 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2653 // If this is an absolute path, and we found the script in the
2654 // sysroot, then we want to prepend the sysroot to the file name.
2655 // For example, this is how we handle a cross link to the x86_64
2656 // libc.so, which refers to /lib/libc.so.6.
2657 std::string name_string(name, length);
2658 const char* extra_search_path = ".";
2659 std::string script_directory;
2660 if (IS_ABSOLUTE_PATH(name_string.c_str()))
2662 if (closure->is_in_sysroot())
2664 const std::string& sysroot(parameters->options().sysroot());
2665 gold_assert(!sysroot.empty());
2666 name_string = sysroot + name_string;
2671 // In addition to checking the normal library search path, we
2672 // also want to check in the script-directory.
2673 const char* slash = strrchr(closure->filename(), '/');
2676 script_directory.assign(closure->filename(),
2677 slash - closure->filename() + 1);
2678 extra_search_path = script_directory.c_str();
2682 Input_file_argument file(name_string.c_str(),
2683 Input_file_argument::INPUT_FILE_TYPE_FILE,
2684 extra_search_path, false,
2685 closure->position_dependent_options());
2686 Input_argument& arg = closure->inputs()->add_file(file);
2687 arg.set_script_info(closure->script_info());
2690 // Called by the bison parser to add a library to the link.
2693 script_add_library(void* closurev, const char* name, size_t length)
2695 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2696 std::string name_string(name, length);
2698 if (name_string[0] != 'l')
2699 gold_error(_("library name must be prefixed with -l"));
2701 Input_file_argument file(name_string.c_str() + 1,
2702 Input_file_argument::INPUT_FILE_TYPE_LIBRARY,
2704 closure->position_dependent_options());
2705 Input_argument& arg = closure->inputs()->add_file(file);
2706 arg.set_script_info(closure->script_info());
2709 // Called by the bison parser to start a group. If we are already in
2710 // a group, that means that this script was invoked within a
2711 // --start-group --end-group sequence on the command line, or that
2712 // this script was found in a GROUP of another script. In that case,
2713 // we simply continue the existing group, rather than starting a new
2714 // one. It is possible to construct a case in which this will do
2715 // something other than what would happen if we did a recursive group,
2716 // but it's hard to imagine why the different behaviour would be
2717 // useful for a real program. Avoiding recursive groups is simpler
2718 // and more efficient.
2721 script_start_group(void* closurev)
2723 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2724 if (!closure->in_group())
2725 closure->inputs()->start_group();
2728 // Called by the bison parser at the end of a group.
2731 script_end_group(void* closurev)
2733 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2734 if (!closure->in_group())
2735 closure->inputs()->end_group();
2738 // Called by the bison parser to start an AS_NEEDED list.
2741 script_start_as_needed(void* closurev)
2743 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2744 closure->position_dependent_options().set_as_needed(true);
2747 // Called by the bison parser at the end of an AS_NEEDED list.
2750 script_end_as_needed(void* closurev)
2752 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2753 closure->position_dependent_options().set_as_needed(false);
2756 // Called by the bison parser to set the entry symbol.
2759 script_set_entry(void* closurev, const char* entry, size_t length)
2761 // We'll parse this exactly the same as --entry=ENTRY on the commandline
2762 // TODO(csilvers): FIXME -- call set_entry directly.
2763 std::string arg("--entry=");
2764 arg.append(entry, length);
2765 script_parse_option(closurev, arg.c_str(), arg.size());
2768 // Called by the bison parser to set whether to define common symbols.
2771 script_set_common_allocation(void* closurev, int set)
2773 const char* arg = set != 0 ? "--define-common" : "--no-define-common";
2774 script_parse_option(closurev, arg, strlen(arg));
2777 // Called by the bison parser to refer to a symbol.
2779 extern "C" Expression*
2780 script_symbol(void* closurev, const char* name, size_t length)
2782 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2783 if (length != 1 || name[0] != '.')
2784 closure->script_options()->add_symbol_reference(name, length);
2785 return script_exp_string(name, length);
2788 // Called by the bison parser to define a symbol.
2791 script_set_symbol(void* closurev, const char* name, size_t length,
2792 Expression* value, int providei, int hiddeni)
2794 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2795 const bool provide = providei != 0;
2796 const bool hidden = hiddeni != 0;
2797 closure->script_options()->add_symbol_assignment(name, length,
2798 closure->parsing_defsym(),
2799 value, provide, hidden);
2800 closure->clear_skip_on_incompatible_target();
2803 // Called by the bison parser to add an assertion.
2806 script_add_assertion(void* closurev, Expression* check, const char* message,
2809 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2810 closure->script_options()->add_assertion(check, message, messagelen);
2811 closure->clear_skip_on_incompatible_target();
2814 // Called by the bison parser to parse an OPTION.
2817 script_parse_option(void* closurev, const char* option, size_t length)
2819 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2820 // We treat the option as a single command-line option, even if
2821 // it has internal whitespace.
2822 if (closure->command_line() == NULL)
2824 // There are some options that we could handle here--e.g.,
2825 // -lLIBRARY. Should we bother?
2826 gold_warning(_("%s:%d:%d: ignoring command OPTION; OPTION is only valid"
2827 " for scripts specified via -T/--script"),
2828 closure->filename(), closure->lineno(), closure->charpos());
2832 bool past_a_double_dash_option = false;
2833 const char* mutable_option = strndup(option, length);
2834 gold_assert(mutable_option != NULL);
2835 closure->command_line()->process_one_option(1, &mutable_option, 0,
2836 &past_a_double_dash_option);
2837 // The General_options class will quite possibly store a pointer
2838 // into mutable_option, so we can't free it. In cases the class
2839 // does not store such a pointer, this is a memory leak. Alas. :(
2841 closure->clear_skip_on_incompatible_target();
2844 // Called by the bison parser to handle OUTPUT_FORMAT. OUTPUT_FORMAT
2845 // takes either one or three arguments. In the three argument case,
2846 // the format depends on the endianness option, which we don't
2847 // currently support (FIXME). If we see an OUTPUT_FORMAT for the
2848 // wrong format, then we want to search for a new file. Returning 0
2849 // here will cause the parser to immediately abort.
2852 script_check_output_format(void* closurev,
2853 const char* default_name, size_t default_length,
2854 const char*, size_t, const char*, size_t)
2856 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2857 std::string name(default_name, default_length);
2858 Target* target = select_target_by_bfd_name(name.c_str());
2859 if (target == NULL || !parameters->is_compatible_target(target))
2861 if (closure->skip_on_incompatible_target())
2863 closure->set_found_incompatible_target();
2866 // FIXME: Should we warn about the unknown target?
2871 // Called by the bison parser to handle TARGET.
2874 script_set_target(void* closurev, const char* target, size_t len)
2876 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2877 std::string s(target, len);
2878 General_options::Object_format format_enum;
2879 format_enum = General_options::string_to_object_format(s.c_str());
2880 closure->position_dependent_options().set_format_enum(format_enum);
2883 // Called by the bison parser to handle SEARCH_DIR. This is handled
2884 // exactly like a -L option.
2887 script_add_search_dir(void* closurev, const char* option, size_t length)
2889 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2890 if (closure->command_line() == NULL)
2891 gold_warning(_("%s:%d:%d: ignoring SEARCH_DIR; SEARCH_DIR is only valid"
2892 " for scripts specified via -T/--script"),
2893 closure->filename(), closure->lineno(), closure->charpos());
2894 else if (!closure->command_line()->options().nostdlib())
2896 std::string s = "-L" + std::string(option, length);
2897 script_parse_option(closurev, s.c_str(), s.size());
2901 /* Called by the bison parser to push the lexer into expression
2905 script_push_lex_into_expression_mode(void* closurev)
2907 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2908 closure->push_lex_mode(Lex::EXPRESSION);
2911 /* Called by the bison parser to push the lexer into version
2915 script_push_lex_into_version_mode(void* closurev)
2917 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2918 if (closure->version_script()->is_finalized())
2919 gold_error(_("%s:%d:%d: invalid use of VERSION in input file"),
2920 closure->filename(), closure->lineno(), closure->charpos());
2921 closure->push_lex_mode(Lex::VERSION_SCRIPT);
2924 /* Called by the bison parser to pop the lexer mode. */
2927 script_pop_lex_mode(void* closurev)
2929 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2930 closure->pop_lex_mode();
2933 // Register an entire version node. For example:
2939 // - tag is "GLIBC_2.1"
2940 // - tree contains the information "global: foo"
2941 // - deps contains "GLIBC_2.0"
2944 script_register_vers_node(void*,
2947 struct Version_tree* tree,
2948 struct Version_dependency_list* deps)
2950 gold_assert(tree != NULL);
2951 tree->dependencies = deps;
2953 tree->tag = std::string(tag, taglen);
2956 // Add a dependencies to the list of existing dependencies, if any,
2957 // and return the expanded list.
2959 extern "C" struct Version_dependency_list*
2960 script_add_vers_depend(void* closurev,
2961 struct Version_dependency_list* all_deps,
2962 const char* depend_to_add, int deplen)
2964 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2965 if (all_deps == NULL)
2966 all_deps = closure->version_script()->allocate_dependency_list();
2967 all_deps->dependencies.push_back(std::string(depend_to_add, deplen));
2971 // Add a pattern expression to an existing list of expressions, if any.
2973 extern "C" struct Version_expression_list*
2974 script_new_vers_pattern(void* closurev,
2975 struct Version_expression_list* expressions,
2976 const char* pattern, int patlen, int exact_match)
2978 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2979 if (expressions == NULL)
2980 expressions = closure->version_script()->allocate_expression_list();
2981 expressions->expressions.push_back(
2982 Version_expression(std::string(pattern, patlen),
2983 closure->get_current_language(),
2984 static_cast<bool>(exact_match)));
2988 // Attaches b to the end of a, and clears b. So a = a + b and b = {}.
2990 extern "C" struct Version_expression_list*
2991 script_merge_expressions(struct Version_expression_list* a,
2992 struct Version_expression_list* b)
2994 a->expressions.insert(a->expressions.end(),
2995 b->expressions.begin(), b->expressions.end());
2996 // We could delete b and remove it from expressions_lists_, but
2997 // that's a lot of work. This works just as well.
2998 b->expressions.clear();
3002 // Combine the global and local expressions into a a Version_tree.
3004 extern "C" struct Version_tree*
3005 script_new_vers_node(void* closurev,
3006 struct Version_expression_list* global,
3007 struct Version_expression_list* local)
3009 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3010 Version_tree* tree = closure->version_script()->allocate_version_tree();
3011 tree->global = global;
3012 tree->local = local;
3016 // Handle a transition in language, such as at the
3017 // start or end of 'extern "C++"'
3020 version_script_push_lang(void* closurev, const char* lang, int langlen)
3022 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3023 std::string language(lang, langlen);
3024 Version_script_info::Language code;
3025 if (language.empty() || language == "C")
3026 code = Version_script_info::LANGUAGE_C;
3027 else if (language == "C++")
3028 code = Version_script_info::LANGUAGE_CXX;
3029 else if (language == "Java")
3030 code = Version_script_info::LANGUAGE_JAVA;
3033 char* buf = new char[langlen + 100];
3034 snprintf(buf, langlen + 100,
3035 _("unrecognized version script language '%s'"),
3037 yyerror(closurev, buf);
3039 code = Version_script_info::LANGUAGE_C;
3041 closure->push_language(code);
3045 version_script_pop_lang(void* closurev)
3047 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3048 closure->pop_language();
3051 // Called by the bison parser to start a SECTIONS clause.
3054 script_start_sections(void* closurev)
3056 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3057 closure->script_options()->script_sections()->start_sections();
3058 closure->clear_skip_on_incompatible_target();
3061 // Called by the bison parser to finish a SECTIONS clause.
3064 script_finish_sections(void* closurev)
3066 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3067 closure->script_options()->script_sections()->finish_sections();
3070 // Start processing entries for an output section.
3073 script_start_output_section(void* closurev, const char* name, size_t namelen,
3074 const struct Parser_output_section_header* header)
3076 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3077 closure->script_options()->script_sections()->start_output_section(name,
3082 // Finish processing entries for an output section.
3085 script_finish_output_section(void* closurev,
3086 const struct Parser_output_section_trailer* trail)
3088 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3089 closure->script_options()->script_sections()->finish_output_section(trail);
3092 // Add a data item (e.g., "WORD (0)") to the current output section.
3095 script_add_data(void* closurev, int data_token, Expression* val)
3097 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3099 bool is_signed = true;
3121 closure->script_options()->script_sections()->add_data(size, is_signed, val);
3124 // Add a clause setting the fill value to the current output section.
3127 script_add_fill(void* closurev, Expression* val)
3129 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3130 closure->script_options()->script_sections()->add_fill(val);
3133 // Add a new input section specification to the current output
3137 script_add_input_section(void* closurev,
3138 const struct Input_section_spec* spec,
3141 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3142 bool keep = keepi != 0;
3143 closure->script_options()->script_sections()->add_input_section(spec, keep);
3146 // When we see DATA_SEGMENT_ALIGN we record that following output
3147 // sections may be relro.
3150 script_data_segment_align(void* closurev)
3152 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3153 if (!closure->script_options()->saw_sections_clause())
3154 gold_error(_("%s:%d:%d: DATA_SEGMENT_ALIGN not in SECTIONS clause"),
3155 closure->filename(), closure->lineno(), closure->charpos());
3157 closure->script_options()->script_sections()->data_segment_align();
3160 // When we see DATA_SEGMENT_RELRO_END we know that all output sections
3161 // since DATA_SEGMENT_ALIGN should be relro.
3164 script_data_segment_relro_end(void* closurev)
3166 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3167 if (!closure->script_options()->saw_sections_clause())
3168 gold_error(_("%s:%d:%d: DATA_SEGMENT_ALIGN not in SECTIONS clause"),
3169 closure->filename(), closure->lineno(), closure->charpos());
3171 closure->script_options()->script_sections()->data_segment_relro_end();
3174 // Create a new list of string/sort pairs.
3176 extern "C" String_sort_list_ptr
3177 script_new_string_sort_list(const struct Wildcard_section* string_sort)
3179 return new String_sort_list(1, *string_sort);
3182 // Add an entry to a list of string/sort pairs. The way the parser
3183 // works permits us to simply modify the first parameter, rather than
3186 extern "C" String_sort_list_ptr
3187 script_string_sort_list_add(String_sort_list_ptr pv,
3188 const struct Wildcard_section* string_sort)
3191 return script_new_string_sort_list(string_sort);
3194 pv->push_back(*string_sort);
3199 // Create a new list of strings.
3201 extern "C" String_list_ptr
3202 script_new_string_list(const char* str, size_t len)
3204 return new String_list(1, std::string(str, len));
3207 // Add an element to a list of strings. The way the parser works
3208 // permits us to simply modify the first parameter, rather than copy
3211 extern "C" String_list_ptr
3212 script_string_list_push_back(String_list_ptr pv, const char* str, size_t len)
3215 return script_new_string_list(str, len);
3218 pv->push_back(std::string(str, len));
3223 // Concatenate two string lists. Either or both may be NULL. The way
3224 // the parser works permits us to modify the parameters, rather than
3227 extern "C" String_list_ptr
3228 script_string_list_append(String_list_ptr pv1, String_list_ptr pv2)
3234 pv1->insert(pv1->end(), pv2->begin(), pv2->end());
3238 // Add a new program header.
3241 script_add_phdr(void* closurev, const char* name, size_t namelen,
3242 unsigned int type, const Phdr_info* info)
3244 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3245 bool includes_filehdr = info->includes_filehdr != 0;
3246 bool includes_phdrs = info->includes_phdrs != 0;
3247 bool is_flags_valid = info->is_flags_valid != 0;
3248 Script_sections* ss = closure->script_options()->script_sections();
3249 ss->add_phdr(name, namelen, type, includes_filehdr, includes_phdrs,
3250 is_flags_valid, info->flags, info->load_address);
3251 closure->clear_skip_on_incompatible_target();
3254 // Convert a program header string to a type.
3256 #define PHDR_TYPE(NAME) { #NAME, sizeof(#NAME) - 1, elfcpp::NAME }
3263 } phdr_type_names[] =
3267 PHDR_TYPE(PT_DYNAMIC),
3268 PHDR_TYPE(PT_INTERP),
3270 PHDR_TYPE(PT_SHLIB),
3273 PHDR_TYPE(PT_GNU_EH_FRAME),
3274 PHDR_TYPE(PT_GNU_STACK),
3275 PHDR_TYPE(PT_GNU_RELRO)
3278 extern "C" unsigned int
3279 script_phdr_string_to_type(void* closurev, const char* name, size_t namelen)
3281 for (unsigned int i = 0;
3282 i < sizeof(phdr_type_names) / sizeof(phdr_type_names[0]);
3284 if (namelen == phdr_type_names[i].namelen
3285 && strncmp(name, phdr_type_names[i].name, namelen) == 0)
3286 return phdr_type_names[i].val;
3287 yyerror(closurev, _("unknown PHDR type (try integer)"));
3288 return elfcpp::PT_NULL;
3292 script_saw_segment_start_expression(void* closurev)
3294 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3295 Script_sections* ss = closure->script_options()->script_sections();
3296 ss->set_saw_segment_start_expression(true);
3300 script_set_section_region(void* closurev, const char* name, size_t namelen,
3303 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3304 if (!closure->script_options()->saw_sections_clause())
3306 gold_error(_("%s:%d:%d: MEMORY region '%.*s' referred to outside of "
3308 closure->filename(), closure->lineno(), closure->charpos(),
3309 static_cast<int>(namelen), name);
3313 Script_sections* ss = closure->script_options()->script_sections();
3314 Memory_region* mr = ss->find_memory_region(name, namelen);
3317 gold_error(_("%s:%d:%d: MEMORY region '%.*s' not declared"),
3318 closure->filename(), closure->lineno(), closure->charpos(),
3319 static_cast<int>(namelen), name);
3323 ss->set_memory_region(mr, set_vma);
3327 script_add_memory(void* closurev, const char* name, size_t namelen,
3328 unsigned int attrs, Expression* origin, Expression* length)
3330 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3331 Script_sections* ss = closure->script_options()->script_sections();
3332 ss->add_memory_region(name, namelen, attrs, origin, length);
3335 extern "C" unsigned int
3336 script_parse_memory_attr(void* closurev, const char* attrs, size_t attrlen,
3346 attributes |= MEM_READABLE; break;
3349 attributes |= MEM_READABLE | MEM_WRITEABLE; break;
3352 attributes |= MEM_EXECUTABLE; break;
3355 attributes |= MEM_ALLOCATABLE; break;
3360 attributes |= MEM_INITIALIZED; break;
3362 yyerror(closurev, _("unknown MEMORY attribute"));
3366 attributes = (~ attributes) & MEM_ATTR_MASK;
3372 script_include_directive(int first_token, void* closurev,
3373 const char* filename, size_t length)
3375 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3376 std::string name(filename, length);
3377 Command_line* cmdline = closure->command_line();
3378 read_script_file(name.c_str(), cmdline, &cmdline->script_options(),
3379 first_token, Lex::LINKER_SCRIPT);
3382 // Functions for memory regions.
3384 extern "C" Expression*
3385 script_exp_function_origin(void* closurev, const char* name, size_t namelen)
3387 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3388 Script_sections* ss = closure->script_options()->script_sections();
3389 Expression* origin = ss->find_memory_region_origin(name, namelen);
3393 gold_error(_("undefined memory region '%s' referenced "
3394 "in ORIGIN expression"),
3396 // Create a dummy expression to prevent crashes later on.
3397 origin = script_exp_integer(0);
3403 extern "C" Expression*
3404 script_exp_function_length(void* closurev, const char* name, size_t namelen)
3406 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
3407 Script_sections* ss = closure->script_options()->script_sections();
3408 Expression* length = ss->find_memory_region_length(name, namelen);
3412 gold_error(_("undefined memory region '%s' referenced "
3413 "in LENGTH expression"),
3415 // Create a dummy expression to prevent crashes later on.
3416 length = script_exp_integer(0);