1 // script.cc -- handle linker scripts for gold.
3 // Copyright 2006, 2007, 2008 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"
49 // A token read from a script file. We don't implement keywords here;
50 // all keywords are simply represented as a string.
55 // Token classification.
60 // Token indicates end of input.
62 // Token is a string of characters.
64 // Token is a quoted string of characters.
66 // Token is an operator.
68 // Token is a number (an integer).
72 // We need an empty constructor so that we can put this STL objects.
74 : classification_(TOKEN_INVALID), value_(NULL), value_length_(0),
75 opcode_(0), lineno_(0), charpos_(0)
78 // A general token with no value.
79 Token(Classification classification, int lineno, int charpos)
80 : classification_(classification), value_(NULL), value_length_(0),
81 opcode_(0), lineno_(lineno), charpos_(charpos)
83 gold_assert(classification == TOKEN_INVALID
84 || classification == TOKEN_EOF);
87 // A general token with a value.
88 Token(Classification classification, const char* value, size_t length,
89 int lineno, int charpos)
90 : classification_(classification), value_(value), value_length_(length),
91 opcode_(0), lineno_(lineno), charpos_(charpos)
93 gold_assert(classification != TOKEN_INVALID
94 && classification != TOKEN_EOF);
97 // A token representing an operator.
98 Token(int opcode, int lineno, int charpos)
99 : classification_(TOKEN_OPERATOR), value_(NULL), value_length_(0),
100 opcode_(opcode), lineno_(lineno), charpos_(charpos)
103 // Return whether the token is invalid.
106 { return this->classification_ == TOKEN_INVALID; }
108 // Return whether this is an EOF token.
111 { return this->classification_ == TOKEN_EOF; }
113 // Return the token classification.
115 classification() const
116 { return this->classification_; }
118 // Return the line number at which the token starts.
121 { return this->lineno_; }
123 // Return the character position at this the token starts.
126 { return this->charpos_; }
128 // Get the value of a token.
131 string_value(size_t* length) const
133 gold_assert(this->classification_ == TOKEN_STRING
134 || this->classification_ == TOKEN_QUOTED_STRING);
135 *length = this->value_length_;
140 operator_value() const
142 gold_assert(this->classification_ == TOKEN_OPERATOR);
143 return this->opcode_;
147 integer_value() const
149 gold_assert(this->classification_ == TOKEN_INTEGER);
151 std::string s(this->value_, this->value_length_);
152 return strtoull(s.c_str(), NULL, 0);
156 // The token classification.
157 Classification classification_;
158 // The token value, for TOKEN_STRING or TOKEN_QUOTED_STRING or
161 // The length of the token value.
162 size_t value_length_;
163 // The token value, for TOKEN_OPERATOR.
165 // The line number where this token started (one based).
167 // The character position within the line where this token started
172 // This class handles lexing a file into a sequence of tokens.
177 // We unfortunately have to support different lexing modes, because
178 // when reading different parts of a linker script we need to parse
179 // things differently.
182 // Reading an ordinary linker script.
184 // Reading an expression in a linker script.
186 // Reading a version script.
190 Lex(const char* input_string, size_t input_length, int parsing_token)
191 : input_string_(input_string), input_length_(input_length),
192 current_(input_string), mode_(LINKER_SCRIPT),
193 first_token_(parsing_token), token_(),
194 lineno_(1), linestart_(input_string)
197 // Read a file into a string.
199 read_file(Input_file*, std::string*);
201 // Return the next token.
205 // Return the current lexing mode.
208 { return this->mode_; }
210 // Set the lexing mode.
213 { this->mode_ = mode; }
217 Lex& operator=(const Lex&);
219 // Make a general token with no value at the current location.
221 make_token(Token::Classification c, const char* start) const
222 { return Token(c, this->lineno_, start - this->linestart_ + 1); }
224 // Make a general token with a value at the current location.
226 make_token(Token::Classification c, const char* v, size_t len,
229 { return Token(c, v, len, this->lineno_, start - this->linestart_ + 1); }
231 // Make an operator token at the current location.
233 make_token(int opcode, const char* start) const
234 { return Token(opcode, this->lineno_, start - this->linestart_ + 1); }
236 // Make an invalid token at the current location.
238 make_invalid_token(const char* start)
239 { return this->make_token(Token::TOKEN_INVALID, start); }
241 // Make an EOF token at the current location.
243 make_eof_token(const char* start)
244 { return this->make_token(Token::TOKEN_EOF, start); }
246 // Return whether C can be the first character in a name. C2 is the
247 // next character, since we sometimes need that.
249 can_start_name(char c, char c2);
251 // If C can appear in a name which has already started, return a
252 // pointer to a character later in the token or just past
253 // it. Otherwise, return NULL.
255 can_continue_name(const char* c);
257 // Return whether C, C2, C3 can start a hex number.
259 can_start_hex(char c, char c2, char c3);
261 // If C can appear in a hex number which has already started, return
262 // a pointer to a character later in the token or just past
263 // it. Otherwise, return NULL.
265 can_continue_hex(const char* c);
267 // Return whether C can start a non-hex number.
269 can_start_number(char c);
271 // If C can appear in a decimal number which has already started,
272 // return a pointer to a character later in the token or just past
273 // it. Otherwise, return NULL.
275 can_continue_number(const char* c)
276 { return Lex::can_start_number(*c) ? c + 1 : NULL; }
278 // If C1 C2 C3 form a valid three character operator, return the
279 // opcode. Otherwise return 0.
281 three_char_operator(char c1, char c2, char c3);
283 // If C1 C2 form a valid two character operator, return the opcode.
284 // Otherwise return 0.
286 two_char_operator(char c1, char c2);
288 // If C1 is a valid one character operator, return the opcode.
289 // Otherwise return 0.
291 one_char_operator(char c1);
293 // Read the next token.
295 get_token(const char**);
297 // Skip a C style /* */ comment. Return false if the comment did
300 skip_c_comment(const char**);
302 // Skip a line # comment. Return false if there was no newline.
304 skip_line_comment(const char**);
306 // Build a token CLASSIFICATION from all characters that match
307 // CAN_CONTINUE_FN. The token starts at START. Start matching from
308 // MATCH. Set *PP to the character following the token.
310 gather_token(Token::Classification,
311 const char* (Lex::*can_continue_fn)(const char*),
312 const char* start, const char* match, const char** pp);
314 // Build a token from a quoted string.
316 gather_quoted_string(const char** pp);
318 // The string we are tokenizing.
319 const char* input_string_;
320 // The length of the string.
321 size_t input_length_;
322 // The current offset into the string.
323 const char* current_;
324 // The current lexing mode.
326 // The code to use for the first token. This is set to 0 after it
329 // The current token.
331 // The current line number.
333 // The start of the current line in the string.
334 const char* linestart_;
337 // Read the whole file into memory. We don't expect linker scripts to
338 // be large, so we just use a std::string as a buffer. We ignore the
339 // data we've already read, so that we read aligned buffers.
342 Lex::read_file(Input_file* input_file, std::string* contents)
344 off_t filesize = input_file->file().filesize();
346 contents->reserve(filesize);
349 unsigned char buf[BUFSIZ];
350 while (off < filesize)
353 if (get > filesize - off)
354 get = filesize - off;
355 input_file->file().read(off, get, buf);
356 contents->append(reinterpret_cast<char*>(&buf[0]), get);
361 // Return whether C can be the start of a name, if the next character
362 // is C2. A name can being with a letter, underscore, period, or
363 // dollar sign. Because a name can be a file name, we also permit
364 // forward slash, backslash, and tilde. Tilde is the tricky case
365 // here; GNU ld also uses it as a bitwise not operator. It is only
366 // recognized as the operator if it is not immediately followed by
367 // some character which can appear in a symbol. That is, when we
368 // don't know that we are looking at an expression, "~0" is a file
369 // name, and "~ 0" is an expression using bitwise not. We are
373 Lex::can_start_name(char c, char c2)
377 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
378 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
379 case 'M': case 'N': case 'O': case 'Q': case 'P': case 'R':
380 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
382 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
383 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
384 case 'm': case 'n': case 'o': case 'q': case 'p': case 'r':
385 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
387 case '_': case '.': case '$':
391 return this->mode_ == LINKER_SCRIPT;
394 return this->mode_ == LINKER_SCRIPT && can_continue_name(&c2);
397 return (this->mode_ == VERSION_SCRIPT
398 || (this->mode_ == LINKER_SCRIPT
399 && can_continue_name(&c2)));
406 // Return whether C can continue a name which has already started.
407 // Subsequent characters in a name are the same as the leading
408 // characters, plus digits and "=+-:[],?*". So in general the linker
409 // script language requires spaces around operators, unless we know
410 // that we are parsing an expression.
413 Lex::can_continue_name(const char* c)
417 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
418 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
419 case 'M': case 'N': case 'O': case 'Q': case 'P': case 'R':
420 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
422 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
423 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
424 case 'm': case 'n': case 'o': case 'q': case 'p': case 'r':
425 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
427 case '_': case '.': case '$':
428 case '0': case '1': case '2': case '3': case '4':
429 case '5': case '6': case '7': case '8': case '9':
432 case '/': case '\\': case '~':
435 if (this->mode_ == LINKER_SCRIPT)
439 case '[': case ']': case '*': case '?': case '-':
440 if (this->mode_ == LINKER_SCRIPT || this->mode_ == VERSION_SCRIPT)
445 if (this->mode_ == VERSION_SCRIPT)
450 if (this->mode_ == LINKER_SCRIPT)
452 else if (this->mode_ == VERSION_SCRIPT && (c[1] == ':'))
454 // A name can have '::' in it, as that's a c++ namespace
455 // separator. But a single colon is not part of a name.
465 // For a number we accept 0x followed by hex digits, or any sequence
466 // of digits. The old linker accepts leading '$' for hex, and
467 // trailing HXBOD. Those are for MRI compatibility and we don't
468 // accept them. The old linker also accepts trailing MK for mega or
469 // kilo. FIXME: Those are mentioned in the documentation, and we
470 // should accept them.
472 // Return whether C1 C2 C3 can start a hex number.
475 Lex::can_start_hex(char c1, char c2, char c3)
477 if (c1 == '0' && (c2 == 'x' || c2 == 'X'))
478 return this->can_continue_hex(&c3);
482 // Return whether C can appear in a hex number.
485 Lex::can_continue_hex(const char* c)
489 case '0': case '1': case '2': case '3': case '4':
490 case '5': case '6': case '7': case '8': case '9':
491 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
492 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
500 // Return whether C can start a non-hex number.
503 Lex::can_start_number(char c)
507 case '0': case '1': case '2': case '3': case '4':
508 case '5': case '6': case '7': case '8': case '9':
516 // If C1 C2 C3 form a valid three character operator, return the
517 // opcode (defined in the yyscript.h file generated from yyscript.y).
518 // Otherwise return 0.
521 Lex::three_char_operator(char c1, char c2, char c3)
526 if (c2 == '<' && c3 == '=')
530 if (c2 == '>' && c3 == '=')
539 // If C1 C2 form a valid two character operator, return the opcode
540 // (defined in the yyscript.h file generated from yyscript.y).
541 // Otherwise return 0.
544 Lex::two_char_operator(char c1, char c2)
602 // If C1 is a valid operator, return the opcode. Otherwise return 0.
605 Lex::one_char_operator(char c1)
638 // Skip a C style comment. *PP points to just after the "/*". Return
639 // false if the comment did not end.
642 Lex::skip_c_comment(const char** pp)
645 while (p[0] != '*' || p[1] != '/')
656 this->linestart_ = p + 1;
665 // Skip a line # comment. Return false if there was no newline.
668 Lex::skip_line_comment(const char** pp)
671 size_t skip = strcspn(p, "\n");
680 this->linestart_ = p;
686 // Build a token CLASSIFICATION from all characters that match
687 // CAN_CONTINUE_FN. Update *PP.
690 Lex::gather_token(Token::Classification classification,
691 const char* (Lex::*can_continue_fn)(const char*),
696 const char* new_match = NULL;
697 while ((new_match = (this->*can_continue_fn)(match)))
700 return this->make_token(classification, start, match - start, start);
703 // Build a token from a quoted string.
706 Lex::gather_quoted_string(const char** pp)
708 const char* start = *pp;
709 const char* p = start;
711 size_t skip = strcspn(p, "\"\n");
713 return this->make_invalid_token(start);
715 return this->make_token(Token::TOKEN_QUOTED_STRING, p, skip, start);
718 // Return the next token at *PP. Update *PP. General guideline: we
719 // require linker scripts to be simple ASCII. No unicode linker
720 // scripts. In particular we can assume that any '\0' is the end of
724 Lex::get_token(const char** pp)
733 return this->make_eof_token(p);
736 // Skip whitespace quickly.
737 while (*p == ' ' || *p == '\t')
744 this->linestart_ = p;
748 // Skip C style comments.
749 if (p[0] == '/' && p[1] == '*')
751 int lineno = this->lineno_;
752 int charpos = p - this->linestart_ + 1;
755 if (!this->skip_c_comment(pp))
756 return Token(Token::TOKEN_INVALID, lineno, charpos);
762 // Skip line comments.
766 if (!this->skip_line_comment(pp))
767 return this->make_eof_token(p);
773 if (this->can_start_name(p[0], p[1]))
774 return this->gather_token(Token::TOKEN_STRING,
775 &Lex::can_continue_name,
778 // We accept any arbitrary name in double quotes, as long as it
779 // does not cross a line boundary.
783 return this->gather_quoted_string(pp);
786 // Check for a number.
788 if (this->can_start_hex(p[0], p[1], p[2]))
789 return this->gather_token(Token::TOKEN_INTEGER,
790 &Lex::can_continue_hex,
793 if (Lex::can_start_number(p[0]))
794 return this->gather_token(Token::TOKEN_INTEGER,
795 &Lex::can_continue_number,
798 // Check for operators.
800 int opcode = Lex::three_char_operator(p[0], p[1], p[2]);
804 return this->make_token(opcode, p);
807 opcode = Lex::two_char_operator(p[0], p[1]);
811 return this->make_token(opcode, p);
814 opcode = Lex::one_char_operator(p[0]);
818 return this->make_token(opcode, p);
821 return this->make_token(Token::TOKEN_INVALID, p);
825 // Return the next token.
830 // The first token is special.
831 if (this->first_token_ != 0)
833 this->token_ = Token(this->first_token_, 0, 0);
834 this->first_token_ = 0;
835 return &this->token_;
838 this->token_ = this->get_token(&this->current_);
840 // Don't let an early null byte fool us into thinking that we've
841 // reached the end of the file.
842 if (this->token_.is_eof()
843 && (static_cast<size_t>(this->current_ - this->input_string_)
844 < this->input_length_))
845 this->token_ = this->make_invalid_token(this->current_);
847 return &this->token_;
850 // class Symbol_assignment.
852 // Add the symbol to the symbol table. This makes sure the symbol is
853 // there and defined. The actual value is stored later. We can't
854 // determine the actual value at this point, because we can't
855 // necessarily evaluate the expression until all ordinary symbols have
858 // The GNU linker lets symbol assignments in the linker script
859 // silently override defined symbols in object files. We are
860 // compatible. FIXME: Should we issue a warning?
863 Symbol_assignment::add_to_table(Symbol_table* symtab)
865 elfcpp::STV vis = this->hidden_ ? elfcpp::STV_HIDDEN : elfcpp::STV_DEFAULT;
866 this->sym_ = symtab->define_as_constant(this->name_.c_str(),
875 true); // force_override
878 // Finalize a symbol value.
881 Symbol_assignment::finalize(Symbol_table* symtab, const Layout* layout)
883 this->finalize_maybe_dot(symtab, layout, false, 0, NULL);
886 // Finalize a symbol value which can refer to the dot symbol.
889 Symbol_assignment::finalize_with_dot(Symbol_table* symtab,
890 const Layout* layout,
892 Output_section* dot_section)
894 this->finalize_maybe_dot(symtab, layout, true, dot_value, dot_section);
897 // Finalize a symbol value, internal version.
900 Symbol_assignment::finalize_maybe_dot(Symbol_table* symtab,
901 const Layout* layout,
902 bool is_dot_available,
904 Output_section* dot_section)
906 // If we were only supposed to provide this symbol, the sym_ field
907 // will be NULL if the symbol was not referenced.
908 if (this->sym_ == NULL)
910 gold_assert(this->provide_);
914 if (parameters->target().get_size() == 32)
916 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
917 this->sized_finalize<32>(symtab, layout, is_dot_available, dot_value,
923 else if (parameters->target().get_size() == 64)
925 #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
926 this->sized_finalize<64>(symtab, layout, is_dot_available, dot_value,
938 Symbol_assignment::sized_finalize(Symbol_table* symtab, const Layout* layout,
939 bool is_dot_available, uint64_t dot_value,
940 Output_section* dot_section)
942 Output_section* section;
943 uint64_t final_val = this->val_->eval_maybe_dot(symtab, layout, true,
945 dot_value, dot_section,
947 Sized_symbol<size>* ssym = symtab->get_sized_symbol<size>(this->sym_);
948 ssym->set_value(final_val);
950 ssym->set_output_section(section);
953 // Set the symbol value if the expression yields an absolute value.
956 Symbol_assignment::set_if_absolute(Symbol_table* symtab, const Layout* layout,
957 bool is_dot_available, uint64_t dot_value)
959 if (this->sym_ == NULL)
962 Output_section* val_section;
963 uint64_t val = this->val_->eval_maybe_dot(symtab, layout, false,
964 is_dot_available, dot_value,
966 if (val_section != NULL)
969 if (parameters->target().get_size() == 32)
971 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
972 Sized_symbol<32>* ssym = symtab->get_sized_symbol<32>(this->sym_);
973 ssym->set_value(val);
978 else if (parameters->target().get_size() == 64)
980 #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
981 Sized_symbol<64>* ssym = symtab->get_sized_symbol<64>(this->sym_);
982 ssym->set_value(val);
991 // Print for debugging.
994 Symbol_assignment::print(FILE* f) const
996 if (this->provide_ && this->hidden_)
997 fprintf(f, "PROVIDE_HIDDEN(");
998 else if (this->provide_)
999 fprintf(f, "PROVIDE(");
1000 else if (this->hidden_)
1003 fprintf(f, "%s = ", this->name_.c_str());
1004 this->val_->print(f);
1006 if (this->provide_ || this->hidden_)
1012 // Class Script_assertion.
1014 // Check the assertion.
1017 Script_assertion::check(const Symbol_table* symtab, const Layout* layout)
1019 if (!this->check_->eval(symtab, layout, true))
1020 gold_error("%s", this->message_.c_str());
1023 // Print for debugging.
1026 Script_assertion::print(FILE* f) const
1028 fprintf(f, "ASSERT(");
1029 this->check_->print(f);
1030 fprintf(f, ", \"%s\")\n", this->message_.c_str());
1033 // Class Script_options.
1035 Script_options::Script_options()
1036 : entry_(), symbol_assignments_(), version_script_info_(),
1041 // Add a symbol to be defined.
1044 Script_options::add_symbol_assignment(const char* name, size_t length,
1045 Expression* value, bool provide,
1048 if (length != 1 || name[0] != '.')
1050 if (this->script_sections_.in_sections_clause())
1051 this->script_sections_.add_symbol_assignment(name, length, value,
1055 Symbol_assignment* p = new Symbol_assignment(name, length, value,
1057 this->symbol_assignments_.push_back(p);
1062 if (provide || hidden)
1063 gold_error(_("invalid use of PROVIDE for dot symbol"));
1064 if (!this->script_sections_.in_sections_clause())
1065 gold_error(_("invalid assignment to dot outside of SECTIONS"));
1067 this->script_sections_.add_dot_assignment(value);
1071 // Add an assertion.
1074 Script_options::add_assertion(Expression* check, const char* message,
1077 if (this->script_sections_.in_sections_clause())
1078 this->script_sections_.add_assertion(check, message, messagelen);
1081 Script_assertion* p = new Script_assertion(check, message, messagelen);
1082 this->assertions_.push_back(p);
1086 // Create sections required by any linker scripts.
1089 Script_options::create_script_sections(Layout* layout)
1091 if (this->saw_sections_clause())
1092 this->script_sections_.create_sections(layout);
1095 // Add any symbols we are defining to the symbol table.
1098 Script_options::add_symbols_to_table(Symbol_table* symtab)
1100 for (Symbol_assignments::iterator p = this->symbol_assignments_.begin();
1101 p != this->symbol_assignments_.end();
1103 (*p)->add_to_table(symtab);
1104 this->script_sections_.add_symbols_to_table(symtab);
1107 // Finalize symbol values. Also check assertions.
1110 Script_options::finalize_symbols(Symbol_table* symtab, const Layout* layout)
1112 for (Symbol_assignments::iterator p = this->symbol_assignments_.begin();
1113 p != this->symbol_assignments_.end();
1115 (*p)->finalize(symtab, layout);
1117 for (Assertions::iterator p = this->assertions_.begin();
1118 p != this->assertions_.end();
1120 (*p)->check(symtab, layout);
1122 this->script_sections_.finalize_symbols(symtab, layout);
1125 // Set section addresses. We set all the symbols which have absolute
1126 // values. Then we let the SECTIONS clause do its thing. This
1127 // returns the segment which holds the file header and segment
1131 Script_options::set_section_addresses(Symbol_table* symtab, Layout* layout)
1133 for (Symbol_assignments::iterator p = this->symbol_assignments_.begin();
1134 p != this->symbol_assignments_.end();
1136 (*p)->set_if_absolute(symtab, layout, false, 0);
1138 return this->script_sections_.set_section_addresses(symtab, layout);
1141 // This class holds data passed through the parser to the lexer and to
1142 // the parser support functions. This avoids global variables. We
1143 // can't use global variables because we need not be called by a
1144 // singleton thread.
1146 class Parser_closure
1149 Parser_closure(const char* filename,
1150 const Position_dependent_options& posdep_options,
1151 bool in_group, bool is_in_sysroot,
1152 Command_line* command_line,
1153 Script_options* script_options,
1155 : filename_(filename), posdep_options_(posdep_options),
1156 in_group_(in_group), is_in_sysroot_(is_in_sysroot),
1157 command_line_(command_line), script_options_(script_options),
1158 version_script_info_(script_options->version_script_info()),
1159 lex_(lex), lineno_(0), charpos_(0), lex_mode_stack_(), inputs_(NULL)
1161 // We start out processing C symbols in the default lex mode.
1162 language_stack_.push_back("");
1163 lex_mode_stack_.push_back(lex->mode());
1166 // Return the file name.
1169 { return this->filename_; }
1171 // Return the position dependent options. The caller may modify
1173 Position_dependent_options&
1174 position_dependent_options()
1175 { return this->posdep_options_; }
1177 // Return whether this script is being run in a group.
1180 { return this->in_group_; }
1182 // Return whether this script was found using a directory in the
1185 is_in_sysroot() const
1186 { return this->is_in_sysroot_; }
1188 // Returns the Command_line structure passed in at constructor time.
1189 // This value may be NULL. The caller may modify this, which modifies
1190 // the passed-in Command_line object (not a copy).
1193 { return this->command_line_; }
1195 // Return the options which may be set by a script.
1198 { return this->script_options_; }
1200 // Return the object in which version script information should be stored.
1201 Version_script_info*
1203 { return this->version_script_info_; }
1205 // Return the next token, and advance.
1209 const Token* token = this->lex_->next_token();
1210 this->lineno_ = token->lineno();
1211 this->charpos_ = token->charpos();
1215 // Set a new lexer mode, pushing the current one.
1217 push_lex_mode(Lex::Mode mode)
1219 this->lex_mode_stack_.push_back(this->lex_->mode());
1220 this->lex_->set_mode(mode);
1223 // Pop the lexer mode.
1227 gold_assert(!this->lex_mode_stack_.empty());
1228 this->lex_->set_mode(this->lex_mode_stack_.back());
1229 this->lex_mode_stack_.pop_back();
1232 // Return the current lexer mode.
1235 { return this->lex_mode_stack_.back(); }
1237 // Return the line number of the last token.
1240 { return this->lineno_; }
1242 // Return the character position in the line of the last token.
1245 { return this->charpos_; }
1247 // Return the list of input files, creating it if necessary. This
1248 // is a space leak--we never free the INPUTS_ pointer.
1252 if (this->inputs_ == NULL)
1253 this->inputs_ = new Input_arguments();
1254 return this->inputs_;
1257 // Return whether we saw any input files.
1260 { return this->inputs_ != NULL && !this->inputs_->empty(); }
1262 // Return the current language being processed in a version script
1263 // (eg, "C++"). The empty string represents unmangled C names.
1265 get_current_language() const
1266 { return this->language_stack_.back(); }
1268 // Push a language onto the stack when entering an extern block.
1269 void push_language(const std::string& lang)
1270 { this->language_stack_.push_back(lang); }
1272 // Pop a language off of the stack when exiting an extern block.
1275 gold_assert(!this->language_stack_.empty());
1276 this->language_stack_.pop_back();
1280 // The name of the file we are reading.
1281 const char* filename_;
1282 // The position dependent options.
1283 Position_dependent_options posdep_options_;
1284 // Whether we are currently in a --start-group/--end-group.
1286 // Whether the script was found in a sysrooted directory.
1287 bool is_in_sysroot_;
1288 // May be NULL if the user chooses not to pass one in.
1289 Command_line* command_line_;
1290 // Options which may be set from any linker script.
1291 Script_options* script_options_;
1292 // Information parsed from a version script.
1293 Version_script_info* version_script_info_;
1296 // The line number of the last token returned by next_token.
1298 // The column number of the last token returned by next_token.
1300 // A stack of lexer modes.
1301 std::vector<Lex::Mode> lex_mode_stack_;
1302 // A stack of which extern/language block we're inside. Can be C++,
1303 // java, or empty for C.
1304 std::vector<std::string> language_stack_;
1305 // New input files found to add to the link.
1306 Input_arguments* inputs_;
1309 // FILE was found as an argument on the command line. Try to read it
1310 // as a script. Return true if the file was handled.
1313 read_input_script(Workqueue* workqueue, const General_options& options,
1314 Symbol_table* symtab, Layout* layout,
1315 Dirsearch* dirsearch, Input_objects* input_objects,
1316 Mapfile* mapfile, Input_group* input_group,
1317 const Input_argument* input_argument,
1318 Input_file* input_file, Task_token* next_blocker,
1319 bool* used_next_blocker)
1321 *used_next_blocker = false;
1323 std::string input_string;
1324 Lex::read_file(input_file, &input_string);
1326 Lex lex(input_string.c_str(), input_string.length(), PARSING_LINKER_SCRIPT);
1328 Parser_closure closure(input_file->filename().c_str(),
1329 input_argument->file().options(),
1330 input_group != NULL,
1331 input_file->is_in_sysroot(),
1333 layout->script_options(),
1336 if (yyparse(&closure) != 0)
1339 if (!closure.saw_inputs())
1342 Task_token* this_blocker = NULL;
1343 for (Input_arguments::const_iterator p = closure.inputs()->begin();
1344 p != closure.inputs()->end();
1348 if (p + 1 == closure.inputs()->end())
1352 nb = new Task_token(true);
1355 workqueue->queue_soon(new Read_symbols(options, input_objects, symtab,
1356 layout, dirsearch, mapfile, &*p,
1357 input_group, this_blocker, nb));
1361 *used_next_blocker = true;
1366 // Helper function for read_version_script() and
1367 // read_commandline_script(). Processes the given file in the mode
1368 // indicated by first_token and lex_mode.
1371 read_script_file(const char* filename, Command_line* cmdline,
1372 int first_token, Lex::Mode lex_mode)
1374 // TODO: if filename is a relative filename, search for it manually
1375 // using "." + cmdline->options()->search_path() -- not dirsearch.
1376 Dirsearch dirsearch;
1378 // The file locking code wants to record a Task, but we haven't
1379 // started the workqueue yet. This is only for debugging purposes,
1380 // so we invent a fake value.
1381 const Task* task = reinterpret_cast<const Task*>(-1);
1383 // We don't want this file to be opened in binary mode.
1384 Position_dependent_options posdep = cmdline->position_dependent_options();
1385 if (posdep.format_enum() == General_options::OBJECT_FORMAT_BINARY)
1386 posdep.set_format_enum(General_options::OBJECT_FORMAT_ELF);
1387 Input_file_argument input_argument(filename, false, "", false, posdep);
1388 Input_file input_file(&input_argument);
1389 if (!input_file.open(cmdline->options(), dirsearch, task))
1392 std::string input_string;
1393 Lex::read_file(&input_file, &input_string);
1395 Lex lex(input_string.c_str(), input_string.length(), first_token);
1396 lex.set_mode(lex_mode);
1398 Parser_closure closure(filename,
1399 cmdline->position_dependent_options(),
1401 input_file.is_in_sysroot(),
1403 &cmdline->script_options(),
1405 if (yyparse(&closure) != 0)
1407 input_file.file().unlock(task);
1411 input_file.file().unlock(task);
1413 gold_assert(!closure.saw_inputs());
1418 // FILENAME was found as an argument to --script (-T).
1419 // Read it as a script, and execute its contents immediately.
1422 read_commandline_script(const char* filename, Command_line* cmdline)
1424 return read_script_file(filename, cmdline,
1425 PARSING_LINKER_SCRIPT, Lex::LINKER_SCRIPT);
1428 // FILE was found as an argument to --version-script. Read it as a
1429 // version script, and store its contents in
1430 // cmdline->script_options()->version_script_info().
1433 read_version_script(const char* filename, Command_line* cmdline)
1435 return read_script_file(filename, cmdline,
1436 PARSING_VERSION_SCRIPT, Lex::VERSION_SCRIPT);
1439 // Implement the --defsym option on the command line. Return true if
1443 Script_options::define_symbol(const char* definition)
1445 Lex lex(definition, strlen(definition), PARSING_DEFSYM);
1446 lex.set_mode(Lex::EXPRESSION);
1449 Position_dependent_options posdep_options;
1451 Parser_closure closure("command line", posdep_options, false, false, NULL,
1454 if (yyparse(&closure) != 0)
1457 gold_assert(!closure.saw_inputs());
1462 // Print the script to F for debugging.
1465 Script_options::print(FILE* f) const
1467 fprintf(f, "%s: Dumping linker script\n", program_name);
1469 if (!this->entry_.empty())
1470 fprintf(f, "ENTRY(%s)\n", this->entry_.c_str());
1472 for (Symbol_assignments::const_iterator p =
1473 this->symbol_assignments_.begin();
1474 p != this->symbol_assignments_.end();
1478 for (Assertions::const_iterator p = this->assertions_.begin();
1479 p != this->assertions_.end();
1483 this->script_sections_.print(f);
1485 this->version_script_info_.print(f);
1488 // Manage mapping from keywords to the codes expected by the bison
1489 // parser. We construct one global object for each lex mode with
1492 class Keyword_to_parsecode
1495 // The structure which maps keywords to parsecodes.
1496 struct Keyword_parsecode
1499 const char* keyword;
1500 // Corresponding parsecode.
1504 Keyword_to_parsecode(const Keyword_parsecode* keywords,
1506 : keyword_parsecodes_(keywords), keyword_count_(keyword_count)
1509 // Return the parsecode corresponding KEYWORD, or 0 if it is not a
1512 keyword_to_parsecode(const char* keyword, size_t len) const;
1515 const Keyword_parsecode* keyword_parsecodes_;
1516 const int keyword_count_;
1519 // Mapping from keyword string to keyword parsecode. This array must
1520 // be kept in sorted order. Parsecodes are looked up using bsearch.
1521 // This array must correspond to the list of parsecodes in yyscript.y.
1523 static const Keyword_to_parsecode::Keyword_parsecode
1524 script_keyword_parsecodes[] =
1526 { "ABSOLUTE", ABSOLUTE },
1528 { "ALIGN", ALIGN_K },
1529 { "ALIGNOF", ALIGNOF },
1530 { "ASSERT", ASSERT_K },
1531 { "AS_NEEDED", AS_NEEDED },
1536 { "CONSTANT", CONSTANT },
1537 { "CONSTRUCTORS", CONSTRUCTORS },
1538 { "CREATE_OBJECT_SYMBOLS", CREATE_OBJECT_SYMBOLS },
1539 { "DATA_SEGMENT_ALIGN", DATA_SEGMENT_ALIGN },
1540 { "DATA_SEGMENT_END", DATA_SEGMENT_END },
1541 { "DATA_SEGMENT_RELRO_END", DATA_SEGMENT_RELRO_END },
1542 { "DEFINED", DEFINED },
1544 { "EXCLUDE_FILE", EXCLUDE_FILE },
1545 { "EXTERN", EXTERN },
1548 { "FORCE_COMMON_ALLOCATION", FORCE_COMMON_ALLOCATION },
1551 { "INCLUDE", INCLUDE },
1552 { "INHIBIT_COMMON_ALLOCATION", INHIBIT_COMMON_ALLOCATION },
1555 { "LENGTH", LENGTH },
1556 { "LOADADDR", LOADADDR },
1560 { "MEMORY", MEMORY },
1563 { "NOCROSSREFS", NOCROSSREFS },
1564 { "NOFLOAT", NOFLOAT },
1565 { "ONLY_IF_RO", ONLY_IF_RO },
1566 { "ONLY_IF_RW", ONLY_IF_RW },
1567 { "OPTION", OPTION },
1568 { "ORIGIN", ORIGIN },
1569 { "OUTPUT", OUTPUT },
1570 { "OUTPUT_ARCH", OUTPUT_ARCH },
1571 { "OUTPUT_FORMAT", OUTPUT_FORMAT },
1572 { "OVERLAY", OVERLAY },
1574 { "PROVIDE", PROVIDE },
1575 { "PROVIDE_HIDDEN", PROVIDE_HIDDEN },
1577 { "SEARCH_DIR", SEARCH_DIR },
1578 { "SECTIONS", SECTIONS },
1579 { "SEGMENT_START", SEGMENT_START },
1581 { "SIZEOF", SIZEOF },
1582 { "SIZEOF_HEADERS", SIZEOF_HEADERS },
1583 { "SORT", SORT_BY_NAME },
1584 { "SORT_BY_ALIGNMENT", SORT_BY_ALIGNMENT },
1585 { "SORT_BY_NAME", SORT_BY_NAME },
1586 { "SPECIAL", SPECIAL },
1588 { "STARTUP", STARTUP },
1589 { "SUBALIGN", SUBALIGN },
1590 { "SYSLIB", SYSLIB },
1591 { "TARGET", TARGET_K },
1592 { "TRUNCATE", TRUNCATE },
1593 { "VERSION", VERSIONK },
1594 { "global", GLOBAL },
1600 { "sizeof_headers", SIZEOF_HEADERS },
1603 static const Keyword_to_parsecode
1604 script_keywords(&script_keyword_parsecodes[0],
1605 (sizeof(script_keyword_parsecodes)
1606 / sizeof(script_keyword_parsecodes[0])));
1608 static const Keyword_to_parsecode::Keyword_parsecode
1609 version_script_keyword_parsecodes[] =
1611 { "extern", EXTERN },
1612 { "global", GLOBAL },
1616 static const Keyword_to_parsecode
1617 version_script_keywords(&version_script_keyword_parsecodes[0],
1618 (sizeof(version_script_keyword_parsecodes)
1619 / sizeof(version_script_keyword_parsecodes[0])));
1621 // Comparison function passed to bsearch.
1633 ktt_compare(const void* keyv, const void* kttv)
1635 const Ktt_key* key = static_cast<const Ktt_key*>(keyv);
1636 const Keyword_to_parsecode::Keyword_parsecode* ktt =
1637 static_cast<const Keyword_to_parsecode::Keyword_parsecode*>(kttv);
1638 int i = strncmp(key->str, ktt->keyword, key->len);
1641 if (ktt->keyword[key->len] != '\0')
1646 } // End extern "C".
1649 Keyword_to_parsecode::keyword_to_parsecode(const char* keyword,
1655 void* kttv = bsearch(&key,
1656 this->keyword_parsecodes_,
1657 this->keyword_count_,
1658 sizeof(this->keyword_parsecodes_[0]),
1662 Keyword_parsecode* ktt = static_cast<Keyword_parsecode*>(kttv);
1663 return ktt->parsecode;
1666 // The following structs are used within the VersionInfo class as well
1667 // as in the bison helper functions. They store the information
1668 // parsed from the version script.
1670 // A single version expression.
1671 // For example, pattern="std::map*" and language="C++".
1672 // pattern and language should be from the stringpool
1673 struct Version_expression {
1674 Version_expression(const std::string& pattern,
1675 const std::string& language,
1677 : pattern(pattern), language(language), exact_match(exact_match) {}
1679 std::string pattern;
1680 std::string language;
1681 // If false, we use glob() to match pattern. If true, we use strcmp().
1686 // A list of expressions.
1687 struct Version_expression_list {
1688 std::vector<struct Version_expression> expressions;
1692 // A list of which versions upon which another version depends.
1693 // Strings should be from the Stringpool.
1694 struct Version_dependency_list {
1695 std::vector<std::string> dependencies;
1699 // The total definition of a version. It includes the tag for the
1700 // version, its global and local expressions, and any dependencies.
1701 struct Version_tree {
1703 : tag(), global(NULL), local(NULL), dependencies(NULL) {}
1706 const struct Version_expression_list* global;
1707 const struct Version_expression_list* local;
1708 const struct Version_dependency_list* dependencies;
1711 Version_script_info::~Version_script_info()
1717 Version_script_info::clear()
1719 for (size_t k = 0; k < dependency_lists_.size(); ++k)
1720 delete dependency_lists_[k];
1721 this->dependency_lists_.clear();
1722 for (size_t k = 0; k < version_trees_.size(); ++k)
1723 delete version_trees_[k];
1724 this->version_trees_.clear();
1725 for (size_t k = 0; k < expression_lists_.size(); ++k)
1726 delete expression_lists_[k];
1727 this->expression_lists_.clear();
1730 std::vector<std::string>
1731 Version_script_info::get_versions() const
1733 std::vector<std::string> ret;
1734 for (size_t j = 0; j < version_trees_.size(); ++j)
1735 if (!this->version_trees_[j]->tag.empty())
1736 ret.push_back(this->version_trees_[j]->tag);
1740 std::vector<std::string>
1741 Version_script_info::get_dependencies(const char* version) const
1743 std::vector<std::string> ret;
1744 for (size_t j = 0; j < version_trees_.size(); ++j)
1745 if (version_trees_[j]->tag == version)
1747 const struct Version_dependency_list* deps =
1748 version_trees_[j]->dependencies;
1750 for (size_t k = 0; k < deps->dependencies.size(); ++k)
1751 ret.push_back(deps->dependencies[k]);
1757 // Look up SYMBOL_NAME in the list of versions. If CHECK_GLOBAL is
1758 // true look at the globally visible symbols, otherwise look at the
1759 // symbols listed as "local:". Return true if the symbol is found,
1760 // false otherwise. If the symbol is found, then if PVERSION is not
1761 // NULL, set *PVERSION to the version.
1764 Version_script_info::get_symbol_version_helper(const char* symbol_name,
1766 std::string* pversion) const
1768 for (size_t j = 0; j < version_trees_.size(); ++j)
1770 // Is it a global symbol for this version?
1771 const Version_expression_list* explist =
1772 check_global ? version_trees_[j]->global : version_trees_[j]->local;
1773 if (explist != NULL)
1774 for (size_t k = 0; k < explist->expressions.size(); ++k)
1776 const char* name_to_match = symbol_name;
1777 const struct Version_expression& exp = explist->expressions[k];
1778 char* demangled_name = NULL;
1779 if (exp.language == "C++")
1781 demangled_name = cplus_demangle(symbol_name,
1782 DMGL_ANSI | DMGL_PARAMS);
1783 // This isn't a C++ symbol.
1784 if (demangled_name == NULL)
1786 name_to_match = demangled_name;
1788 else if (exp.language == "Java")
1790 demangled_name = cplus_demangle(symbol_name,
1791 (DMGL_ANSI | DMGL_PARAMS
1793 // This isn't a Java symbol.
1794 if (demangled_name == NULL)
1796 name_to_match = demangled_name;
1799 if (exp.exact_match)
1800 matched = strcmp(exp.pattern.c_str(), name_to_match) == 0;
1802 matched = fnmatch(exp.pattern.c_str(), name_to_match,
1804 if (demangled_name != NULL)
1805 free(demangled_name);
1808 if (pversion != NULL)
1809 *pversion = this->version_trees_[j]->tag;
1817 struct Version_dependency_list*
1818 Version_script_info::allocate_dependency_list()
1820 dependency_lists_.push_back(new Version_dependency_list);
1821 return dependency_lists_.back();
1824 struct Version_expression_list*
1825 Version_script_info::allocate_expression_list()
1827 expression_lists_.push_back(new Version_expression_list);
1828 return expression_lists_.back();
1831 struct Version_tree*
1832 Version_script_info::allocate_version_tree()
1834 version_trees_.push_back(new Version_tree);
1835 return version_trees_.back();
1838 // Print for debugging.
1841 Version_script_info::print(FILE* f) const
1846 fprintf(f, "VERSION {");
1848 for (size_t i = 0; i < this->version_trees_.size(); ++i)
1850 const Version_tree* vt = this->version_trees_[i];
1852 if (vt->tag.empty())
1855 fprintf(f, " %s {\n", vt->tag.c_str());
1857 if (vt->global != NULL)
1859 fprintf(f, " global :\n");
1860 this->print_expression_list(f, vt->global);
1863 if (vt->local != NULL)
1865 fprintf(f, " local :\n");
1866 this->print_expression_list(f, vt->local);
1870 if (vt->dependencies != NULL)
1872 const Version_dependency_list* deps = vt->dependencies;
1873 for (size_t j = 0; j < deps->dependencies.size(); ++j)
1875 if (j < deps->dependencies.size() - 1)
1877 fprintf(f, " %s", deps->dependencies[j].c_str());
1887 Version_script_info::print_expression_list(
1889 const Version_expression_list* vel) const
1891 std::string current_language;
1892 for (size_t i = 0; i < vel->expressions.size(); ++i)
1894 const Version_expression& ve(vel->expressions[i]);
1896 if (ve.language != current_language)
1898 if (!current_language.empty())
1900 fprintf(f, " extern \"%s\" {\n", ve.language.c_str());
1901 current_language = ve.language;
1905 if (!current_language.empty())
1910 fprintf(f, "%s", ve.pattern.c_str());
1917 if (!current_language.empty())
1921 } // End namespace gold.
1923 // The remaining functions are extern "C", so it's clearer to not put
1924 // them in namespace gold.
1926 using namespace gold;
1928 // This function is called by the bison parser to return the next
1932 yylex(YYSTYPE* lvalp, void* closurev)
1934 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
1935 const Token* token = closure->next_token();
1936 switch (token->classification())
1941 case Token::TOKEN_INVALID:
1942 yyerror(closurev, "invalid character");
1945 case Token::TOKEN_EOF:
1948 case Token::TOKEN_STRING:
1950 // This is either a keyword or a STRING.
1952 const char* str = token->string_value(&len);
1954 switch (closure->lex_mode())
1956 case Lex::LINKER_SCRIPT:
1957 parsecode = script_keywords.keyword_to_parsecode(str, len);
1959 case Lex::VERSION_SCRIPT:
1960 parsecode = version_script_keywords.keyword_to_parsecode(str, len);
1967 lvalp->string.value = str;
1968 lvalp->string.length = len;
1972 case Token::TOKEN_QUOTED_STRING:
1973 lvalp->string.value = token->string_value(&lvalp->string.length);
1974 return QUOTED_STRING;
1976 case Token::TOKEN_OPERATOR:
1977 return token->operator_value();
1979 case Token::TOKEN_INTEGER:
1980 lvalp->integer = token->integer_value();
1985 // This function is called by the bison parser to report an error.
1988 yyerror(void* closurev, const char* message)
1990 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
1991 gold_error(_("%s:%d:%d: %s"), closure->filename(), closure->lineno(),
1992 closure->charpos(), message);
1995 // Called by the bison parser to add a file to the link.
1998 script_add_file(void* closurev, const char* name, size_t length)
2000 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2002 // If this is an absolute path, and we found the script in the
2003 // sysroot, then we want to prepend the sysroot to the file name.
2004 // For example, this is how we handle a cross link to the x86_64
2005 // libc.so, which refers to /lib/libc.so.6.
2006 std::string name_string(name, length);
2007 const char* extra_search_path = ".";
2008 std::string script_directory;
2009 if (IS_ABSOLUTE_PATH(name_string.c_str()))
2011 if (closure->is_in_sysroot())
2013 const std::string& sysroot(parameters->options().sysroot());
2014 gold_assert(!sysroot.empty());
2015 name_string = sysroot + name_string;
2020 // In addition to checking the normal library search path, we
2021 // also want to check in the script-directory.
2022 const char *slash = strrchr(closure->filename(), '/');
2025 script_directory.assign(closure->filename(),
2026 slash - closure->filename() + 1);
2027 extra_search_path = script_directory.c_str();
2031 Input_file_argument file(name_string.c_str(), false, extra_search_path,
2032 false, closure->position_dependent_options());
2033 closure->inputs()->add_file(file);
2036 // Called by the bison parser to start a group. If we are already in
2037 // a group, that means that this script was invoked within a
2038 // --start-group --end-group sequence on the command line, or that
2039 // this script was found in a GROUP of another script. In that case,
2040 // we simply continue the existing group, rather than starting a new
2041 // one. It is possible to construct a case in which this will do
2042 // something other than what would happen if we did a recursive group,
2043 // but it's hard to imagine why the different behaviour would be
2044 // useful for a real program. Avoiding recursive groups is simpler
2045 // and more efficient.
2048 script_start_group(void* closurev)
2050 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2051 if (!closure->in_group())
2052 closure->inputs()->start_group();
2055 // Called by the bison parser at the end of a group.
2058 script_end_group(void* closurev)
2060 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2061 if (!closure->in_group())
2062 closure->inputs()->end_group();
2065 // Called by the bison parser to start an AS_NEEDED list.
2068 script_start_as_needed(void* closurev)
2070 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2071 closure->position_dependent_options().set_as_needed(true);
2074 // Called by the bison parser at the end of an AS_NEEDED list.
2077 script_end_as_needed(void* closurev)
2079 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2080 closure->position_dependent_options().set_as_needed(false);
2083 // Called by the bison parser to set the entry symbol.
2086 script_set_entry(void* closurev, const char* entry, size_t length)
2088 // We'll parse this exactly the same as --entry=ENTRY on the commandline
2089 // TODO(csilvers): FIXME -- call set_entry directly.
2090 std::string arg("--entry=");
2091 arg.append(entry, length);
2092 script_parse_option(closurev, arg.c_str(), arg.size());
2095 // Called by the bison parser to set whether to define common symbols.
2098 script_set_common_allocation(void* closurev, int set)
2100 const char* arg = set != 0 ? "--define-common" : "--no-define-common";
2101 script_parse_option(closurev, arg, strlen(arg));
2104 // Called by the bison parser to define a symbol.
2107 script_set_symbol(void* closurev, const char* name, size_t length,
2108 Expression* value, int providei, int hiddeni)
2110 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2111 const bool provide = providei != 0;
2112 const bool hidden = hiddeni != 0;
2113 closure->script_options()->add_symbol_assignment(name, length, value,
2117 // Called by the bison parser to add an assertion.
2120 script_add_assertion(void* closurev, Expression* check, const char* message,
2123 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2124 closure->script_options()->add_assertion(check, message, messagelen);
2127 // Called by the bison parser to parse an OPTION.
2130 script_parse_option(void* closurev, const char* option, size_t length)
2132 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2133 // We treat the option as a single command-line option, even if
2134 // it has internal whitespace.
2135 if (closure->command_line() == NULL)
2137 // There are some options that we could handle here--e.g.,
2138 // -lLIBRARY. Should we bother?
2139 gold_warning(_("%s:%d:%d: ignoring command OPTION; OPTION is only valid"
2140 " for scripts specified via -T/--script"),
2141 closure->filename(), closure->lineno(), closure->charpos());
2145 bool past_a_double_dash_option = false;
2146 const char* mutable_option = strndup(option, length);
2147 gold_assert(mutable_option != NULL);
2148 closure->command_line()->process_one_option(1, &mutable_option, 0,
2149 &past_a_double_dash_option);
2150 // The General_options class will quite possibly store a pointer
2151 // into mutable_option, so we can't free it. In cases the class
2152 // does not store such a pointer, this is a memory leak. Alas. :(
2156 // Called by the bison parser to handle SEARCH_DIR. This is handled
2157 // exactly like a -L option.
2160 script_add_search_dir(void* closurev, const char* option, size_t length)
2162 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2163 if (closure->command_line() == NULL)
2164 gold_warning(_("%s:%d:%d: ignoring SEARCH_DIR; SEARCH_DIR is only valid"
2165 " for scripts specified via -T/--script"),
2166 closure->filename(), closure->lineno(), closure->charpos());
2169 std::string s = "-L" + std::string(option, length);
2170 script_parse_option(closurev, s.c_str(), s.size());
2174 /* Called by the bison parser to push the lexer into expression
2178 script_push_lex_into_expression_mode(void* closurev)
2180 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2181 closure->push_lex_mode(Lex::EXPRESSION);
2184 /* Called by the bison parser to push the lexer into version
2188 script_push_lex_into_version_mode(void* closurev)
2190 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2191 closure->push_lex_mode(Lex::VERSION_SCRIPT);
2194 /* Called by the bison parser to pop the lexer mode. */
2197 script_pop_lex_mode(void* closurev)
2199 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2200 closure->pop_lex_mode();
2203 // Register an entire version node. For example:
2209 // - tag is "GLIBC_2.1"
2210 // - tree contains the information "global: foo"
2211 // - deps contains "GLIBC_2.0"
2214 script_register_vers_node(void*,
2217 struct Version_tree *tree,
2218 struct Version_dependency_list *deps)
2220 gold_assert(tree != NULL);
2221 tree->dependencies = deps;
2223 tree->tag = std::string(tag, taglen);
2226 // Add a dependencies to the list of existing dependencies, if any,
2227 // and return the expanded list.
2229 extern "C" struct Version_dependency_list *
2230 script_add_vers_depend(void* closurev,
2231 struct Version_dependency_list *all_deps,
2232 const char *depend_to_add, int deplen)
2234 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2235 if (all_deps == NULL)
2236 all_deps = closure->version_script()->allocate_dependency_list();
2237 all_deps->dependencies.push_back(std::string(depend_to_add, deplen));
2241 // Add a pattern expression to an existing list of expressions, if any.
2242 // TODO: In the old linker, the last argument used to be a bool, but I
2243 // don't know what it meant.
2245 extern "C" struct Version_expression_list *
2246 script_new_vers_pattern(void* closurev,
2247 struct Version_expression_list *expressions,
2248 const char *pattern, int patlen, int exact_match)
2250 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2251 if (expressions == NULL)
2252 expressions = closure->version_script()->allocate_expression_list();
2253 expressions->expressions.push_back(
2254 Version_expression(std::string(pattern, patlen),
2255 closure->get_current_language(),
2256 static_cast<bool>(exact_match)));
2260 // Attaches b to the end of a, and clears b. So a = a + b and b = {}.
2262 extern "C" struct Version_expression_list*
2263 script_merge_expressions(struct Version_expression_list *a,
2264 struct Version_expression_list *b)
2266 a->expressions.insert(a->expressions.end(),
2267 b->expressions.begin(), b->expressions.end());
2268 // We could delete b and remove it from expressions_lists_, but
2269 // that's a lot of work. This works just as well.
2270 b->expressions.clear();
2274 // Combine the global and local expressions into a a Version_tree.
2276 extern "C" struct Version_tree *
2277 script_new_vers_node(void* closurev,
2278 struct Version_expression_list *global,
2279 struct Version_expression_list *local)
2281 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2282 Version_tree* tree = closure->version_script()->allocate_version_tree();
2283 tree->global = global;
2284 tree->local = local;
2288 // Handle a transition in language, such as at the
2289 // start or end of 'extern "C++"'
2292 version_script_push_lang(void* closurev, const char* lang, int langlen)
2294 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2295 closure->push_language(std::string(lang, langlen));
2299 version_script_pop_lang(void* closurev)
2301 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2302 closure->pop_language();
2305 // Called by the bison parser to start a SECTIONS clause.
2308 script_start_sections(void* closurev)
2310 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2311 closure->script_options()->script_sections()->start_sections();
2314 // Called by the bison parser to finish a SECTIONS clause.
2317 script_finish_sections(void* closurev)
2319 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2320 closure->script_options()->script_sections()->finish_sections();
2323 // Start processing entries for an output section.
2326 script_start_output_section(void* closurev, const char* name, size_t namelen,
2327 const struct Parser_output_section_header* header)
2329 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2330 closure->script_options()->script_sections()->start_output_section(name,
2335 // Finish processing entries for an output section.
2338 script_finish_output_section(void* closurev,
2339 const struct Parser_output_section_trailer* trail)
2341 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2342 closure->script_options()->script_sections()->finish_output_section(trail);
2345 // Add a data item (e.g., "WORD (0)") to the current output section.
2348 script_add_data(void* closurev, int data_token, Expression* val)
2350 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2352 bool is_signed = true;
2374 closure->script_options()->script_sections()->add_data(size, is_signed, val);
2377 // Add a clause setting the fill value to the current output section.
2380 script_add_fill(void* closurev, Expression* val)
2382 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2383 closure->script_options()->script_sections()->add_fill(val);
2386 // Add a new input section specification to the current output
2390 script_add_input_section(void* closurev,
2391 const struct Input_section_spec* spec,
2394 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2395 bool keep = keepi != 0;
2396 closure->script_options()->script_sections()->add_input_section(spec, keep);
2399 // Create a new list of string/sort pairs.
2401 extern "C" String_sort_list_ptr
2402 script_new_string_sort_list(const struct Wildcard_section* string_sort)
2404 return new String_sort_list(1, *string_sort);
2407 // Add an entry to a list of string/sort pairs. The way the parser
2408 // works permits us to simply modify the first parameter, rather than
2411 extern "C" String_sort_list_ptr
2412 script_string_sort_list_add(String_sort_list_ptr pv,
2413 const struct Wildcard_section* string_sort)
2416 return script_new_string_sort_list(string_sort);
2419 pv->push_back(*string_sort);
2424 // Create a new list of strings.
2426 extern "C" String_list_ptr
2427 script_new_string_list(const char* str, size_t len)
2429 return new String_list(1, std::string(str, len));
2432 // Add an element to a list of strings. The way the parser works
2433 // permits us to simply modify the first parameter, rather than copy
2436 extern "C" String_list_ptr
2437 script_string_list_push_back(String_list_ptr pv, const char* str, size_t len)
2440 return script_new_string_list(str, len);
2443 pv->push_back(std::string(str, len));
2448 // Concatenate two string lists. Either or both may be NULL. The way
2449 // the parser works permits us to modify the parameters, rather than
2452 extern "C" String_list_ptr
2453 script_string_list_append(String_list_ptr pv1, String_list_ptr pv2)
2459 pv1->insert(pv1->end(), pv2->begin(), pv2->end());
2463 // Add a new program header.
2466 script_add_phdr(void* closurev, const char* name, size_t namelen,
2467 unsigned int type, const Phdr_info* info)
2469 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
2470 bool includes_filehdr = info->includes_filehdr != 0;
2471 bool includes_phdrs = info->includes_phdrs != 0;
2472 bool is_flags_valid = info->is_flags_valid != 0;
2473 Script_sections* ss = closure->script_options()->script_sections();
2474 ss->add_phdr(name, namelen, type, includes_filehdr, includes_phdrs,
2475 is_flags_valid, info->flags, info->load_address);
2478 // Convert a program header string to a type.
2480 #define PHDR_TYPE(NAME) { #NAME, sizeof(#NAME) - 1, elfcpp::NAME }
2487 } phdr_type_names[] =
2491 PHDR_TYPE(PT_DYNAMIC),
2492 PHDR_TYPE(PT_INTERP),
2494 PHDR_TYPE(PT_SHLIB),
2497 PHDR_TYPE(PT_GNU_EH_FRAME),
2498 PHDR_TYPE(PT_GNU_STACK),
2499 PHDR_TYPE(PT_GNU_RELRO)
2502 extern "C" unsigned int
2503 script_phdr_string_to_type(void* closurev, const char* name, size_t namelen)
2505 for (unsigned int i = 0;
2506 i < sizeof(phdr_type_names) / sizeof(phdr_type_names[0]);
2508 if (namelen == phdr_type_names[i].namelen
2509 && strncmp(name, phdr_type_names[i].name, namelen) == 0)
2510 return phdr_type_names[i].val;
2511 yyerror(closurev, _("unknown PHDR type (try integer)"));
2512 return elfcpp::PT_NULL;