1 // script.cc -- handle linker scripts for gold.
3 // Copyright 2006, 2007, 2008, 2009, 2010 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
151 gold_assert(this->classification_
== TOKEN_INTEGER
);
153 std::string
s(this->value_
, this->value_length_
);
154 return strtoull(s
.c_str(), NULL
, 0);
158 // The token classification.
159 Classification classification_
;
160 // The token value, for TOKEN_STRING or TOKEN_QUOTED_STRING or
163 // The length of the token value.
164 size_t value_length_
;
165 // The token value, for TOKEN_OPERATOR.
167 // The line number where this token started (one based).
169 // The character position within the line where this token started
174 // This class handles lexing a file into a sequence of tokens.
179 // We unfortunately have to support different lexing modes, because
180 // when reading different parts of a linker script we need to parse
181 // things differently.
184 // Reading an ordinary linker script.
186 // Reading an expression in a linker script.
188 // Reading a version script.
190 // Reading a --dynamic-list file.
194 Lex(const char* input_string
, size_t input_length
, int parsing_token
)
195 : input_string_(input_string
), input_length_(input_length
),
196 current_(input_string
), mode_(LINKER_SCRIPT
),
197 first_token_(parsing_token
), token_(),
198 lineno_(1), linestart_(input_string
)
201 // Read a file into a string.
203 read_file(Input_file
*, std::string
*);
205 // Return the next token.
209 // Return the current lexing mode.
212 { return this->mode_
; }
214 // Set the lexing mode.
217 { this->mode_
= mode
; }
221 Lex
& operator=(const Lex
&);
223 // Make a general token with no value at the current location.
225 make_token(Token::Classification c
, const char* start
) const
226 { return Token(c
, this->lineno_
, start
- this->linestart_
+ 1); }
228 // Make a general token with a value at the current location.
230 make_token(Token::Classification c
, const char* v
, size_t len
,
233 { return Token(c
, v
, len
, this->lineno_
, start
- this->linestart_
+ 1); }
235 // Make an operator token at the current location.
237 make_token(int opcode
, const char* start
) const
238 { return Token(opcode
, this->lineno_
, start
- this->linestart_
+ 1); }
240 // Make an invalid token at the current location.
242 make_invalid_token(const char* start
)
243 { return this->make_token(Token::TOKEN_INVALID
, start
); }
245 // Make an EOF token at the current location.
247 make_eof_token(const char* start
)
248 { return this->make_token(Token::TOKEN_EOF
, start
); }
250 // Return whether C can be the first character in a name. C2 is the
251 // next character, since we sometimes need that.
253 can_start_name(char c
, char c2
);
255 // If C can appear in a name which has already started, return a
256 // pointer to a character later in the token or just past
257 // it. Otherwise, return NULL.
259 can_continue_name(const char* c
);
261 // Return whether C, C2, C3 can start a hex number.
263 can_start_hex(char c
, char c2
, char c3
);
265 // If C can appear in a hex number which has already started, return
266 // a pointer to a character later in the token or just past
267 // it. Otherwise, return NULL.
269 can_continue_hex(const char* c
);
271 // Return whether C can start a non-hex number.
273 can_start_number(char c
);
275 // If C can appear in a decimal number which has already started,
276 // return a pointer to a character later in the token or just past
277 // it. Otherwise, return NULL.
279 can_continue_number(const char* c
)
280 { return Lex::can_start_number(*c
) ? c
+ 1 : NULL
; }
282 // If C1 C2 C3 form a valid three character operator, return the
283 // opcode. Otherwise return 0.
285 three_char_operator(char c1
, char c2
, char c3
);
287 // If C1 C2 form a valid two character operator, return the opcode.
288 // Otherwise return 0.
290 two_char_operator(char c1
, char c2
);
292 // If C1 is a valid one character operator, return the opcode.
293 // Otherwise return 0.
295 one_char_operator(char c1
);
297 // Read the next token.
299 get_token(const char**);
301 // Skip a C style /* */ comment. Return false if the comment did
304 skip_c_comment(const char**);
306 // Skip a line # comment. Return false if there was no newline.
308 skip_line_comment(const char**);
310 // Build a token CLASSIFICATION from all characters that match
311 // CAN_CONTINUE_FN. The token starts at START. Start matching from
312 // MATCH. Set *PP to the character following the token.
314 gather_token(Token::Classification
,
315 const char* (Lex::*can_continue_fn
)(const char*),
316 const char* start
, const char* match
, const char** pp
);
318 // Build a token from a quoted string.
320 gather_quoted_string(const char** pp
);
322 // The string we are tokenizing.
323 const char* input_string_
;
324 // The length of the string.
325 size_t input_length_
;
326 // The current offset into the string.
327 const char* current_
;
328 // The current lexing mode.
330 // The code to use for the first token. This is set to 0 after it
333 // The current token.
335 // The current line number.
337 // The start of the current line in the string.
338 const char* linestart_
;
341 // Read the whole file into memory. We don't expect linker scripts to
342 // be large, so we just use a std::string as a buffer. We ignore the
343 // data we've already read, so that we read aligned buffers.
346 Lex::read_file(Input_file
* input_file
, std::string
* contents
)
348 off_t filesize
= input_file
->file().filesize();
350 contents
->reserve(filesize
);
353 unsigned char buf
[BUFSIZ
];
354 while (off
< filesize
)
357 if (get
> filesize
- off
)
358 get
= filesize
- off
;
359 input_file
->file().read(off
, get
, buf
);
360 contents
->append(reinterpret_cast<char*>(&buf
[0]), get
);
365 // Return whether C can be the start of a name, if the next character
366 // is C2. A name can being with a letter, underscore, period, or
367 // dollar sign. Because a name can be a file name, we also permit
368 // forward slash, backslash, and tilde. Tilde is the tricky case
369 // here; GNU ld also uses it as a bitwise not operator. It is only
370 // recognized as the operator if it is not immediately followed by
371 // some character which can appear in a symbol. That is, when we
372 // don't know that we are looking at an expression, "~0" is a file
373 // name, and "~ 0" is an expression using bitwise not. We are
377 Lex::can_start_name(char c
, char c2
)
381 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
382 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
383 case 'M': case 'N': case 'O': case 'Q': case 'P': case 'R':
384 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
386 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
387 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
388 case 'm': case 'n': case 'o': case 'q': case 'p': case 'r':
389 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
391 case '_': case '.': case '$':
395 return this->mode_
== LINKER_SCRIPT
;
398 return this->mode_
== LINKER_SCRIPT
&& can_continue_name(&c2
);
401 return (this->mode_
== VERSION_SCRIPT
402 || this->mode_
== DYNAMIC_LIST
403 || (this->mode_
== LINKER_SCRIPT
404 && can_continue_name(&c2
)));
411 // Return whether C can continue a name which has already started.
412 // Subsequent characters in a name are the same as the leading
413 // characters, plus digits and "=+-:[],?*". So in general the linker
414 // script language requires spaces around operators, unless we know
415 // that we are parsing an expression.
418 Lex::can_continue_name(const char* c
)
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 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
428 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
429 case 'm': case 'n': case 'o': case 'q': case 'p': case 'r':
430 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
432 case '_': case '.': case '$':
433 case '0': case '1': case '2': case '3': case '4':
434 case '5': case '6': case '7': case '8': case '9':
437 // TODO(csilvers): why not allow ~ in names for version-scripts?
438 case '/': case '\\': case '~':
441 if (this->mode_
== LINKER_SCRIPT
)
445 case '[': case ']': case '*': case '?': case '-':
446 if (this->mode_
== LINKER_SCRIPT
|| this->mode_
== VERSION_SCRIPT
447 || this->mode_
== DYNAMIC_LIST
)
451 // TODO(csilvers): why allow this? ^ is meaningless in version scripts.
453 if (this->mode_
== VERSION_SCRIPT
|| this->mode_
== DYNAMIC_LIST
)
458 if (this->mode_
== LINKER_SCRIPT
)
460 else if ((this->mode_
== VERSION_SCRIPT
|| this->mode_
== DYNAMIC_LIST
)
463 // A name can have '::' in it, as that's a c++ namespace
464 // separator. But a single colon is not part of a name.
474 // For a number we accept 0x followed by hex digits, or any sequence
475 // of digits. The old linker accepts leading '$' for hex, and
476 // trailing HXBOD. Those are for MRI compatibility and we don't
477 // accept them. The old linker also accepts trailing MK for mega or
478 // kilo. FIXME: Those are mentioned in the documentation, and we
479 // should accept them.
481 // Return whether C1 C2 C3 can start a hex number.
484 Lex::can_start_hex(char c1
, char c2
, char c3
)
486 if (c1
== '0' && (c2
== 'x' || c2
== 'X'))
487 return this->can_continue_hex(&c3
);
491 // Return whether C can appear in a hex number.
494 Lex::can_continue_hex(const char* c
)
498 case '0': case '1': case '2': case '3': case '4':
499 case '5': case '6': case '7': case '8': case '9':
500 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
501 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
509 // Return whether C can start a non-hex number.
512 Lex::can_start_number(char c
)
516 case '0': case '1': case '2': case '3': case '4':
517 case '5': case '6': case '7': case '8': case '9':
525 // If C1 C2 C3 form a valid three character operator, return the
526 // opcode (defined in the yyscript.h file generated from yyscript.y).
527 // Otherwise return 0.
530 Lex::three_char_operator(char c1
, char c2
, char c3
)
535 if (c2
== '<' && c3
== '=')
539 if (c2
== '>' && c3
== '=')
548 // If C1 C2 form a valid two character operator, return the opcode
549 // (defined in the yyscript.h file generated from yyscript.y).
550 // Otherwise return 0.
553 Lex::two_char_operator(char c1
, char c2
)
611 // If C1 is a valid operator, return the opcode. Otherwise return 0.
614 Lex::one_char_operator(char c1
)
647 // Skip a C style comment. *PP points to just after the "/*". Return
648 // false if the comment did not end.
651 Lex::skip_c_comment(const char** pp
)
654 while (p
[0] != '*' || p
[1] != '/')
665 this->linestart_
= p
+ 1;
674 // Skip a line # comment. Return false if there was no newline.
677 Lex::skip_line_comment(const char** pp
)
680 size_t skip
= strcspn(p
, "\n");
689 this->linestart_
= p
;
695 // Build a token CLASSIFICATION from all characters that match
696 // CAN_CONTINUE_FN. Update *PP.
699 Lex::gather_token(Token::Classification classification
,
700 const char* (Lex::*can_continue_fn
)(const char*),
705 const char* new_match
= NULL
;
706 while ((new_match
= (this->*can_continue_fn
)(match
)))
709 return this->make_token(classification
, start
, match
- start
, start
);
712 // Build a token from a quoted string.
715 Lex::gather_quoted_string(const char** pp
)
717 const char* start
= *pp
;
718 const char* p
= start
;
720 size_t skip
= strcspn(p
, "\"\n");
722 return this->make_invalid_token(start
);
724 return this->make_token(Token::TOKEN_QUOTED_STRING
, p
, skip
, start
);
727 // Return the next token at *PP. Update *PP. General guideline: we
728 // require linker scripts to be simple ASCII. No unicode linker
729 // scripts. In particular we can assume that any '\0' is the end of
733 Lex::get_token(const char** pp
)
742 return this->make_eof_token(p
);
745 // Skip whitespace quickly.
746 while (*p
== ' ' || *p
== '\t' || *p
== '\r')
753 this->linestart_
= p
;
757 // Skip C style comments.
758 if (p
[0] == '/' && p
[1] == '*')
760 int lineno
= this->lineno_
;
761 int charpos
= p
- this->linestart_
+ 1;
764 if (!this->skip_c_comment(pp
))
765 return Token(Token::TOKEN_INVALID
, lineno
, charpos
);
771 // Skip line comments.
775 if (!this->skip_line_comment(pp
))
776 return this->make_eof_token(p
);
782 if (this->can_start_name(p
[0], p
[1]))
783 return this->gather_token(Token::TOKEN_STRING
,
784 &Lex::can_continue_name
,
787 // We accept any arbitrary name in double quotes, as long as it
788 // does not cross a line boundary.
792 return this->gather_quoted_string(pp
);
795 // Check for a number.
797 if (this->can_start_hex(p
[0], p
[1], p
[2]))
798 return this->gather_token(Token::TOKEN_INTEGER
,
799 &Lex::can_continue_hex
,
802 if (Lex::can_start_number(p
[0]))
803 return this->gather_token(Token::TOKEN_INTEGER
,
804 &Lex::can_continue_number
,
807 // Check for operators.
809 int opcode
= Lex::three_char_operator(p
[0], p
[1], p
[2]);
813 return this->make_token(opcode
, p
);
816 opcode
= Lex::two_char_operator(p
[0], p
[1]);
820 return this->make_token(opcode
, p
);
823 opcode
= Lex::one_char_operator(p
[0]);
827 return this->make_token(opcode
, p
);
830 return this->make_token(Token::TOKEN_INVALID
, p
);
834 // Return the next token.
839 // The first token is special.
840 if (this->first_token_
!= 0)
842 this->token_
= Token(this->first_token_
, 0, 0);
843 this->first_token_
= 0;
844 return &this->token_
;
847 this->token_
= this->get_token(&this->current_
);
849 // Don't let an early null byte fool us into thinking that we've
850 // reached the end of the file.
851 if (this->token_
.is_eof()
852 && (static_cast<size_t>(this->current_
- this->input_string_
)
853 < this->input_length_
))
854 this->token_
= this->make_invalid_token(this->current_
);
856 return &this->token_
;
859 // class Symbol_assignment.
861 // Add the symbol to the symbol table. This makes sure the symbol is
862 // there and defined. The actual value is stored later. We can't
863 // determine the actual value at this point, because we can't
864 // necessarily evaluate the expression until all ordinary symbols have
867 // The GNU linker lets symbol assignments in the linker script
868 // silently override defined symbols in object files. We are
869 // compatible. FIXME: Should we issue a warning?
872 Symbol_assignment::add_to_table(Symbol_table
* symtab
)
874 elfcpp::STV vis
= this->hidden_
? elfcpp::STV_HIDDEN
: elfcpp::STV_DEFAULT
;
875 this->sym_
= symtab
->define_as_constant(this->name_
.c_str(),
878 ? Symbol_table::DEFSYM
879 : Symbol_table::SCRIPT
),
887 true); // force_override
890 // Finalize a symbol value.
893 Symbol_assignment::finalize(Symbol_table
* symtab
, const Layout
* layout
)
895 this->finalize_maybe_dot(symtab
, layout
, false, 0, NULL
);
898 // Finalize a symbol value which can refer to the dot symbol.
901 Symbol_assignment::finalize_with_dot(Symbol_table
* symtab
,
902 const Layout
* layout
,
904 Output_section
* dot_section
)
906 this->finalize_maybe_dot(symtab
, layout
, true, dot_value
, dot_section
);
909 // Finalize a symbol value, internal version.
912 Symbol_assignment::finalize_maybe_dot(Symbol_table
* symtab
,
913 const Layout
* layout
,
914 bool is_dot_available
,
916 Output_section
* dot_section
)
918 // If we were only supposed to provide this symbol, the sym_ field
919 // will be NULL if the symbol was not referenced.
920 if (this->sym_
== NULL
)
922 gold_assert(this->provide_
);
926 if (parameters
->target().get_size() == 32)
928 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
929 this->sized_finalize
<32>(symtab
, layout
, is_dot_available
, dot_value
,
935 else if (parameters
->target().get_size() == 64)
937 #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
938 this->sized_finalize
<64>(symtab
, layout
, is_dot_available
, dot_value
,
950 Symbol_assignment::sized_finalize(Symbol_table
* symtab
, const Layout
* layout
,
951 bool is_dot_available
, uint64_t dot_value
,
952 Output_section
* dot_section
)
954 Output_section
* section
;
955 uint64_t final_val
= this->val_
->eval_maybe_dot(symtab
, layout
, true,
957 dot_value
, dot_section
,
959 Sized_symbol
<size
>* ssym
= symtab
->get_sized_symbol
<size
>(this->sym_
);
960 ssym
->set_value(final_val
);
962 ssym
->set_output_section(section
);
965 // Set the symbol value if the expression yields an absolute value.
968 Symbol_assignment::set_if_absolute(Symbol_table
* symtab
, const Layout
* layout
,
969 bool is_dot_available
, uint64_t dot_value
)
971 if (this->sym_
== NULL
)
974 Output_section
* val_section
;
975 uint64_t val
= this->val_
->eval_maybe_dot(symtab
, layout
, false,
976 is_dot_available
, dot_value
,
978 if (val_section
!= NULL
)
981 if (parameters
->target().get_size() == 32)
983 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
984 Sized_symbol
<32>* ssym
= symtab
->get_sized_symbol
<32>(this->sym_
);
985 ssym
->set_value(val
);
990 else if (parameters
->target().get_size() == 64)
992 #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
993 Sized_symbol
<64>* ssym
= symtab
->get_sized_symbol
<64>(this->sym_
);
994 ssym
->set_value(val
);
1003 // Print for debugging.
1006 Symbol_assignment::print(FILE* f
) const
1008 if (this->provide_
&& this->hidden_
)
1009 fprintf(f
, "PROVIDE_HIDDEN(");
1010 else if (this->provide_
)
1011 fprintf(f
, "PROVIDE(");
1012 else if (this->hidden_
)
1015 fprintf(f
, "%s = ", this->name_
.c_str());
1016 this->val_
->print(f
);
1018 if (this->provide_
|| this->hidden_
)
1024 // Class Script_assertion.
1026 // Check the assertion.
1029 Script_assertion::check(const Symbol_table
* symtab
, const Layout
* layout
)
1031 if (!this->check_
->eval(symtab
, layout
, true))
1032 gold_error("%s", this->message_
.c_str());
1035 // Print for debugging.
1038 Script_assertion::print(FILE* f
) const
1040 fprintf(f
, "ASSERT(");
1041 this->check_
->print(f
);
1042 fprintf(f
, ", \"%s\")\n", this->message_
.c_str());
1045 // Class Script_options.
1047 Script_options::Script_options()
1048 : entry_(), symbol_assignments_(), version_script_info_(),
1053 // Add a symbol to be defined.
1056 Script_options::add_symbol_assignment(const char* name
, size_t length
,
1057 bool is_defsym
, Expression
* value
,
1058 bool provide
, bool hidden
)
1060 if (length
!= 1 || name
[0] != '.')
1062 if (this->script_sections_
.in_sections_clause())
1064 gold_assert(!is_defsym
);
1065 this->script_sections_
.add_symbol_assignment(name
, length
, value
,
1070 Symbol_assignment
* p
= new Symbol_assignment(name
, length
, is_defsym
,
1071 value
, provide
, hidden
);
1072 this->symbol_assignments_
.push_back(p
);
1077 if (provide
|| hidden
)
1078 gold_error(_("invalid use of PROVIDE for dot symbol"));
1080 // The GNU linker permits assignments to dot outside of SECTIONS
1081 // clauses and treats them as occurring inside, so we don't
1082 // check in_sections_clause here.
1083 this->script_sections_
.add_dot_assignment(value
);
1087 // Add an assertion.
1090 Script_options::add_assertion(Expression
* check
, const char* message
,
1093 if (this->script_sections_
.in_sections_clause())
1094 this->script_sections_
.add_assertion(check
, message
, messagelen
);
1097 Script_assertion
* p
= new Script_assertion(check
, message
, messagelen
);
1098 this->assertions_
.push_back(p
);
1102 // Create sections required by any linker scripts.
1105 Script_options::create_script_sections(Layout
* layout
)
1107 if (this->saw_sections_clause())
1108 this->script_sections_
.create_sections(layout
);
1111 // Add any symbols we are defining to the symbol table.
1114 Script_options::add_symbols_to_table(Symbol_table
* symtab
)
1116 for (Symbol_assignments::iterator p
= this->symbol_assignments_
.begin();
1117 p
!= this->symbol_assignments_
.end();
1119 (*p
)->add_to_table(symtab
);
1120 this->script_sections_
.add_symbols_to_table(symtab
);
1123 // Finalize symbol values. Also check assertions.
1126 Script_options::finalize_symbols(Symbol_table
* symtab
, const Layout
* layout
)
1128 // We finalize the symbols defined in SECTIONS first, because they
1129 // are the ones which may have changed. This way if symbol outside
1130 // SECTIONS are defined in terms of symbols inside SECTIONS, they
1131 // will get the right value.
1132 this->script_sections_
.finalize_symbols(symtab
, layout
);
1134 for (Symbol_assignments::iterator p
= this->symbol_assignments_
.begin();
1135 p
!= this->symbol_assignments_
.end();
1137 (*p
)->finalize(symtab
, layout
);
1139 for (Assertions::iterator p
= this->assertions_
.begin();
1140 p
!= this->assertions_
.end();
1142 (*p
)->check(symtab
, layout
);
1145 // Set section addresses. We set all the symbols which have absolute
1146 // values. Then we let the SECTIONS clause do its thing. This
1147 // returns the segment which holds the file header and segment
1151 Script_options::set_section_addresses(Symbol_table
* symtab
, Layout
* layout
)
1153 for (Symbol_assignments::iterator p
= this->symbol_assignments_
.begin();
1154 p
!= this->symbol_assignments_
.end();
1156 (*p
)->set_if_absolute(symtab
, layout
, false, 0);
1158 return this->script_sections_
.set_section_addresses(symtab
, layout
);
1161 // This class holds data passed through the parser to the lexer and to
1162 // the parser support functions. This avoids global variables. We
1163 // can't use global variables because we need not be called by a
1164 // singleton thread.
1166 class Parser_closure
1169 Parser_closure(const char* filename
,
1170 const Position_dependent_options
& posdep_options
,
1171 bool parsing_defsym
, bool in_group
, bool is_in_sysroot
,
1172 Command_line
* command_line
,
1173 Script_options
* script_options
,
1175 bool skip_on_incompatible_target
)
1176 : filename_(filename
), posdep_options_(posdep_options
),
1177 parsing_defsym_(parsing_defsym
), in_group_(in_group
),
1178 is_in_sysroot_(is_in_sysroot
),
1179 skip_on_incompatible_target_(skip_on_incompatible_target
),
1180 found_incompatible_target_(false),
1181 command_line_(command_line
), script_options_(script_options
),
1182 version_script_info_(script_options
->version_script_info()),
1183 lex_(lex
), lineno_(0), charpos_(0), lex_mode_stack_(), inputs_(NULL
)
1185 // We start out processing C symbols in the default lex mode.
1186 this->language_stack_
.push_back(Version_script_info::LANGUAGE_C
);
1187 this->lex_mode_stack_
.push_back(lex
->mode());
1190 // Return the file name.
1193 { return this->filename_
; }
1195 // Return the position dependent options. The caller may modify
1197 Position_dependent_options
&
1198 position_dependent_options()
1199 { return this->posdep_options_
; }
1201 // Whether we are parsing a --defsym.
1203 parsing_defsym() const
1204 { return this->parsing_defsym_
; }
1206 // Return whether this script is being run in a group.
1209 { return this->in_group_
; }
1211 // Return whether this script was found using a directory in the
1214 is_in_sysroot() const
1215 { return this->is_in_sysroot_
; }
1217 // Whether to skip to the next file with the same name if we find an
1218 // incompatible target in an OUTPUT_FORMAT statement.
1220 skip_on_incompatible_target() const
1221 { return this->skip_on_incompatible_target_
; }
1223 // Stop skipping to the next file on an incompatible target. This
1224 // is called when we make some unrevocable change to the data
1227 clear_skip_on_incompatible_target()
1228 { this->skip_on_incompatible_target_
= false; }
1230 // Whether we found an incompatible target in an OUTPUT_FORMAT
1233 found_incompatible_target() const
1234 { return this->found_incompatible_target_
; }
1236 // Note that we found an incompatible target.
1238 set_found_incompatible_target()
1239 { this->found_incompatible_target_
= true; }
1241 // Returns the Command_line structure passed in at constructor time.
1242 // This value may be NULL. The caller may modify this, which modifies
1243 // the passed-in Command_line object (not a copy).
1246 { return this->command_line_
; }
1248 // Return the options which may be set by a script.
1251 { return this->script_options_
; }
1253 // Return the object in which version script information should be stored.
1254 Version_script_info
*
1256 { return this->version_script_info_
; }
1258 // Return the next token, and advance.
1262 const Token
* token
= this->lex_
->next_token();
1263 this->lineno_
= token
->lineno();
1264 this->charpos_
= token
->charpos();
1268 // Set a new lexer mode, pushing the current one.
1270 push_lex_mode(Lex::Mode mode
)
1272 this->lex_mode_stack_
.push_back(this->lex_
->mode());
1273 this->lex_
->set_mode(mode
);
1276 // Pop the lexer mode.
1280 gold_assert(!this->lex_mode_stack_
.empty());
1281 this->lex_
->set_mode(this->lex_mode_stack_
.back());
1282 this->lex_mode_stack_
.pop_back();
1285 // Return the current lexer mode.
1288 { return this->lex_mode_stack_
.back(); }
1290 // Return the line number of the last token.
1293 { return this->lineno_
; }
1295 // Return the character position in the line of the last token.
1298 { return this->charpos_
; }
1300 // Return the list of input files, creating it if necessary. This
1301 // is a space leak--we never free the INPUTS_ pointer.
1305 if (this->inputs_
== NULL
)
1306 this->inputs_
= new Input_arguments();
1307 return this->inputs_
;
1310 // Return whether we saw any input files.
1313 { return this->inputs_
!= NULL
&& !this->inputs_
->empty(); }
1315 // Return the current language being processed in a version script
1316 // (eg, "C++"). The empty string represents unmangled C names.
1317 Version_script_info::Language
1318 get_current_language() const
1319 { return this->language_stack_
.back(); }
1321 // Push a language onto the stack when entering an extern block.
1323 push_language(Version_script_info::Language lang
)
1324 { this->language_stack_
.push_back(lang
); }
1326 // Pop a language off of the stack when exiting an extern block.
1330 gold_assert(!this->language_stack_
.empty());
1331 this->language_stack_
.pop_back();
1335 // The name of the file we are reading.
1336 const char* filename_
;
1337 // The position dependent options.
1338 Position_dependent_options posdep_options_
;
1339 // True if we are parsing a --defsym.
1340 bool parsing_defsym_
;
1341 // Whether we are currently in a --start-group/--end-group.
1343 // Whether the script was found in a sysrooted directory.
1344 bool is_in_sysroot_
;
1345 // If this is true, then if we find an OUTPUT_FORMAT with an
1346 // incompatible target, then we tell the parser to abort so that we
1347 // can search for the next file with the same name.
1348 bool skip_on_incompatible_target_
;
1349 // True if we found an OUTPUT_FORMAT with an incompatible target.
1350 bool found_incompatible_target_
;
1351 // May be NULL if the user chooses not to pass one in.
1352 Command_line
* command_line_
;
1353 // Options which may be set from any linker script.
1354 Script_options
* script_options_
;
1355 // Information parsed from a version script.
1356 Version_script_info
* version_script_info_
;
1359 // The line number of the last token returned by next_token.
1361 // The column number of the last token returned by next_token.
1363 // A stack of lexer modes.
1364 std::vector
<Lex::Mode
> lex_mode_stack_
;
1365 // A stack of which extern/language block we're inside. Can be C++,
1366 // java, or empty for C.
1367 std::vector
<Version_script_info::Language
> language_stack_
;
1368 // New input files found to add to the link.
1369 Input_arguments
* inputs_
;
1372 // FILE was found as an argument on the command line. Try to read it
1373 // as a script. Return true if the file was handled.
1376 read_input_script(Workqueue
* workqueue
, Symbol_table
* symtab
, Layout
* layout
,
1377 Dirsearch
* dirsearch
, int dirindex
,
1378 Input_objects
* input_objects
, Mapfile
* mapfile
,
1379 Input_group
* input_group
,
1380 const Input_argument
* input_argument
,
1381 Input_file
* input_file
, Task_token
* next_blocker
,
1382 bool* used_next_blocker
)
1384 *used_next_blocker
= false;
1386 std::string input_string
;
1387 Lex::read_file(input_file
, &input_string
);
1389 Lex
lex(input_string
.c_str(), input_string
.length(), PARSING_LINKER_SCRIPT
);
1391 Parser_closure
closure(input_file
->filename().c_str(),
1392 input_argument
->file().options(),
1394 input_group
!= NULL
,
1395 input_file
->is_in_sysroot(),
1397 layout
->script_options(),
1399 input_file
->will_search_for());
1401 bool old_saw_sections_clause
=
1402 layout
->script_options()->saw_sections_clause();
1404 if (yyparse(&closure
) != 0)
1406 if (closure
.found_incompatible_target())
1408 Read_symbols::incompatible_warning(input_argument
, input_file
);
1409 Read_symbols::requeue(workqueue
, input_objects
, symtab
, layout
,
1410 dirsearch
, dirindex
, mapfile
, input_argument
,
1411 input_group
, next_blocker
);
1417 if (!old_saw_sections_clause
1418 && layout
->script_options()->saw_sections_clause()
1419 && layout
->have_added_input_section())
1420 gold_error(_("%s: SECTIONS seen after other input files; try -T/--script"),
1421 input_file
->filename().c_str());
1423 if (!closure
.saw_inputs())
1426 Task_token
* this_blocker
= NULL
;
1427 for (Input_arguments::const_iterator p
= closure
.inputs()->begin();
1428 p
!= closure
.inputs()->end();
1432 if (p
+ 1 == closure
.inputs()->end())
1436 nb
= new Task_token(true);
1439 workqueue
->queue_soon(new Read_symbols(input_objects
, symtab
,
1440 layout
, dirsearch
, 0, mapfile
, &*p
,
1441 input_group
, this_blocker
, nb
));
1445 if (layout
->incremental_inputs())
1447 // Like new Read_symbols(...) above, we rely on close.inputs()
1448 // getting leaked by closure.
1449 Script_info
* info
= new Script_info(closure
.inputs());
1450 layout
->incremental_inputs()->report_script(
1452 input_file
->file().get_mtime(),
1455 *used_next_blocker
= true;
1460 // Helper function for read_version_script() and
1461 // read_commandline_script(). Processes the given file in the mode
1462 // indicated by first_token and lex_mode.
1465 read_script_file(const char* filename
, Command_line
* cmdline
,
1466 Script_options
* script_options
,
1467 int first_token
, Lex::Mode lex_mode
)
1469 // TODO: if filename is a relative filename, search for it manually
1470 // using "." + cmdline->options()->search_path() -- not dirsearch.
1471 Dirsearch dirsearch
;
1473 // The file locking code wants to record a Task, but we haven't
1474 // started the workqueue yet. This is only for debugging purposes,
1475 // so we invent a fake value.
1476 const Task
* task
= reinterpret_cast<const Task
*>(-1);
1478 // We don't want this file to be opened in binary mode.
1479 Position_dependent_options posdep
= cmdline
->position_dependent_options();
1480 if (posdep
.format_enum() == General_options::OBJECT_FORMAT_BINARY
)
1481 posdep
.set_format_enum(General_options::OBJECT_FORMAT_ELF
);
1482 Input_file_argument
input_argument(filename
,
1483 Input_file_argument::INPUT_FILE_TYPE_FILE
,
1485 Input_file
input_file(&input_argument
);
1487 if (!input_file
.open(dirsearch
, task
, &dummy
))
1490 std::string input_string
;
1491 Lex::read_file(&input_file
, &input_string
);
1493 Lex
lex(input_string
.c_str(), input_string
.length(), first_token
);
1494 lex
.set_mode(lex_mode
);
1496 Parser_closure
closure(filename
,
1497 cmdline
->position_dependent_options(),
1498 first_token
== Lex::DYNAMIC_LIST
,
1500 input_file
.is_in_sysroot(),
1505 if (yyparse(&closure
) != 0)
1507 input_file
.file().unlock(task
);
1511 input_file
.file().unlock(task
);
1513 gold_assert(!closure
.saw_inputs());
1518 // FILENAME was found as an argument to --script (-T).
1519 // Read it as a script, and execute its contents immediately.
1522 read_commandline_script(const char* filename
, Command_line
* cmdline
)
1524 return read_script_file(filename
, cmdline
, &cmdline
->script_options(),
1525 PARSING_LINKER_SCRIPT
, Lex::LINKER_SCRIPT
);
1528 // FILENAME was found as an argument to --version-script. Read it as
1529 // a version script, and store its contents in
1530 // cmdline->script_options()->version_script_info().
1533 read_version_script(const char* filename
, Command_line
* cmdline
)
1535 return read_script_file(filename
, cmdline
, &cmdline
->script_options(),
1536 PARSING_VERSION_SCRIPT
, Lex::VERSION_SCRIPT
);
1539 // FILENAME was found as an argument to --dynamic-list. Read it as a
1540 // list of symbols, and store its contents in DYNAMIC_LIST.
1543 read_dynamic_list(const char* filename
, Command_line
* cmdline
,
1544 Script_options
* dynamic_list
)
1546 return read_script_file(filename
, cmdline
, dynamic_list
,
1547 PARSING_DYNAMIC_LIST
, Lex::DYNAMIC_LIST
);
1550 // Implement the --defsym option on the command line. Return true if
1554 Script_options::define_symbol(const char* definition
)
1556 Lex
lex(definition
, strlen(definition
), PARSING_DEFSYM
);
1557 lex
.set_mode(Lex::EXPRESSION
);
1560 Position_dependent_options posdep_options
;
1562 Parser_closure
closure("command line", posdep_options
, true,
1563 false, false, NULL
, this, &lex
, false);
1565 if (yyparse(&closure
) != 0)
1568 gold_assert(!closure
.saw_inputs());
1573 // Print the script to F for debugging.
1576 Script_options::print(FILE* f
) const
1578 fprintf(f
, "%s: Dumping linker script\n", program_name
);
1580 if (!this->entry_
.empty())
1581 fprintf(f
, "ENTRY(%s)\n", this->entry_
.c_str());
1583 for (Symbol_assignments::const_iterator p
=
1584 this->symbol_assignments_
.begin();
1585 p
!= this->symbol_assignments_
.end();
1589 for (Assertions::const_iterator p
= this->assertions_
.begin();
1590 p
!= this->assertions_
.end();
1594 this->script_sections_
.print(f
);
1596 this->version_script_info_
.print(f
);
1599 // Manage mapping from keywords to the codes expected by the bison
1600 // parser. We construct one global object for each lex mode with
1603 class Keyword_to_parsecode
1606 // The structure which maps keywords to parsecodes.
1607 struct Keyword_parsecode
1610 const char* keyword
;
1611 // Corresponding parsecode.
1615 Keyword_to_parsecode(const Keyword_parsecode
* keywords
,
1617 : keyword_parsecodes_(keywords
), keyword_count_(keyword_count
)
1620 // Return the parsecode corresponding KEYWORD, or 0 if it is not a
1623 keyword_to_parsecode(const char* keyword
, size_t len
) const;
1626 const Keyword_parsecode
* keyword_parsecodes_
;
1627 const int keyword_count_
;
1630 // Mapping from keyword string to keyword parsecode. This array must
1631 // be kept in sorted order. Parsecodes are looked up using bsearch.
1632 // This array must correspond to the list of parsecodes in yyscript.y.
1634 static const Keyword_to_parsecode::Keyword_parsecode
1635 script_keyword_parsecodes
[] =
1637 { "ABSOLUTE", ABSOLUTE
},
1639 { "ALIGN", ALIGN_K
},
1640 { "ALIGNOF", ALIGNOF
},
1641 { "ASSERT", ASSERT_K
},
1642 { "AS_NEEDED", AS_NEEDED
},
1647 { "CONSTANT", CONSTANT
},
1648 { "CONSTRUCTORS", CONSTRUCTORS
},
1649 { "CREATE_OBJECT_SYMBOLS", CREATE_OBJECT_SYMBOLS
},
1650 { "DATA_SEGMENT_ALIGN", DATA_SEGMENT_ALIGN
},
1651 { "DATA_SEGMENT_END", DATA_SEGMENT_END
},
1652 { "DATA_SEGMENT_RELRO_END", DATA_SEGMENT_RELRO_END
},
1653 { "DEFINED", DEFINED
},
1655 { "EXCLUDE_FILE", EXCLUDE_FILE
},
1656 { "EXTERN", EXTERN
},
1659 { "FORCE_COMMON_ALLOCATION", FORCE_COMMON_ALLOCATION
},
1662 { "INCLUDE", INCLUDE
},
1663 { "INHIBIT_COMMON_ALLOCATION", INHIBIT_COMMON_ALLOCATION
},
1666 { "LENGTH", LENGTH
},
1667 { "LOADADDR", LOADADDR
},
1671 { "MEMORY", MEMORY
},
1674 { "NOCROSSREFS", NOCROSSREFS
},
1675 { "NOFLOAT", NOFLOAT
},
1676 { "ONLY_IF_RO", ONLY_IF_RO
},
1677 { "ONLY_IF_RW", ONLY_IF_RW
},
1678 { "OPTION", OPTION
},
1679 { "ORIGIN", ORIGIN
},
1680 { "OUTPUT", OUTPUT
},
1681 { "OUTPUT_ARCH", OUTPUT_ARCH
},
1682 { "OUTPUT_FORMAT", OUTPUT_FORMAT
},
1683 { "OVERLAY", OVERLAY
},
1685 { "PROVIDE", PROVIDE
},
1686 { "PROVIDE_HIDDEN", PROVIDE_HIDDEN
},
1688 { "SEARCH_DIR", SEARCH_DIR
},
1689 { "SECTIONS", SECTIONS
},
1690 { "SEGMENT_START", SEGMENT_START
},
1692 { "SIZEOF", SIZEOF
},
1693 { "SIZEOF_HEADERS", SIZEOF_HEADERS
},
1694 { "SORT", SORT_BY_NAME
},
1695 { "SORT_BY_ALIGNMENT", SORT_BY_ALIGNMENT
},
1696 { "SORT_BY_NAME", SORT_BY_NAME
},
1697 { "SPECIAL", SPECIAL
},
1699 { "STARTUP", STARTUP
},
1700 { "SUBALIGN", SUBALIGN
},
1701 { "SYSLIB", SYSLIB
},
1702 { "TARGET", TARGET_K
},
1703 { "TRUNCATE", TRUNCATE
},
1704 { "VERSION", VERSIONK
},
1705 { "global", GLOBAL
},
1711 { "sizeof_headers", SIZEOF_HEADERS
},
1714 static const Keyword_to_parsecode
1715 script_keywords(&script_keyword_parsecodes
[0],
1716 (sizeof(script_keyword_parsecodes
)
1717 / sizeof(script_keyword_parsecodes
[0])));
1719 static const Keyword_to_parsecode::Keyword_parsecode
1720 version_script_keyword_parsecodes
[] =
1722 { "extern", EXTERN
},
1723 { "global", GLOBAL
},
1727 static const Keyword_to_parsecode
1728 version_script_keywords(&version_script_keyword_parsecodes
[0],
1729 (sizeof(version_script_keyword_parsecodes
)
1730 / sizeof(version_script_keyword_parsecodes
[0])));
1732 static const Keyword_to_parsecode::Keyword_parsecode
1733 dynamic_list_keyword_parsecodes
[] =
1735 { "extern", EXTERN
},
1738 static const Keyword_to_parsecode
1739 dynamic_list_keywords(&dynamic_list_keyword_parsecodes
[0],
1740 (sizeof(dynamic_list_keyword_parsecodes
)
1741 / sizeof(dynamic_list_keyword_parsecodes
[0])));
1745 // Comparison function passed to bsearch.
1757 ktt_compare(const void* keyv
, const void* kttv
)
1759 const Ktt_key
* key
= static_cast<const Ktt_key
*>(keyv
);
1760 const Keyword_to_parsecode::Keyword_parsecode
* ktt
=
1761 static_cast<const Keyword_to_parsecode::Keyword_parsecode
*>(kttv
);
1762 int i
= strncmp(key
->str
, ktt
->keyword
, key
->len
);
1765 if (ktt
->keyword
[key
->len
] != '\0')
1770 } // End extern "C".
1773 Keyword_to_parsecode::keyword_to_parsecode(const char* keyword
,
1779 void* kttv
= bsearch(&key
,
1780 this->keyword_parsecodes_
,
1781 this->keyword_count_
,
1782 sizeof(this->keyword_parsecodes_
[0]),
1786 Keyword_parsecode
* ktt
= static_cast<Keyword_parsecode
*>(kttv
);
1787 return ktt
->parsecode
;
1790 // The following structs are used within the VersionInfo class as well
1791 // as in the bison helper functions. They store the information
1792 // parsed from the version script.
1794 // A single version expression.
1795 // For example, pattern="std::map*" and language="C++".
1796 struct Version_expression
1798 Version_expression(const std::string
& a_pattern
,
1799 Version_script_info::Language a_language
,
1801 : pattern(a_pattern
), language(a_language
), exact_match(a_exact_match
),
1802 was_matched_by_symbol(false)
1805 std::string pattern
;
1806 Version_script_info::Language language
;
1807 // If false, we use glob() to match pattern. If true, we use strcmp().
1809 // True if --no-undefined-version is in effect and we found this
1810 // version in get_symbol_version. We use mutable because this
1811 // struct is generally not modifiable after it has been created.
1812 mutable bool was_matched_by_symbol
;
1815 // A list of expressions.
1816 struct Version_expression_list
1818 std::vector
<struct Version_expression
> expressions
;
1821 // A list of which versions upon which another version depends.
1822 // Strings should be from the Stringpool.
1823 struct Version_dependency_list
1825 std::vector
<std::string
> dependencies
;
1828 // The total definition of a version. It includes the tag for the
1829 // version, its global and local expressions, and any dependencies.
1833 : tag(), global(NULL
), local(NULL
), dependencies(NULL
)
1837 const struct Version_expression_list
* global
;
1838 const struct Version_expression_list
* local
;
1839 const struct Version_dependency_list
* dependencies
;
1842 // Class Version_script_info.
1844 Version_script_info::Version_script_info()
1845 : dependency_lists_(), expression_lists_(), version_trees_(),
1846 is_finalized_(false)
1848 for (int i
= 0; i
< LANGUAGE_COUNT
; ++i
)
1850 this->globals_
[i
] = NULL
;
1851 this->locals_
[i
] = NULL
;
1855 Version_script_info::~Version_script_info()
1859 // Forget all the known version script information.
1862 Version_script_info::clear()
1864 for (size_t k
= 0; k
< this->dependency_lists_
.size(); ++k
)
1865 delete this->dependency_lists_
[k
];
1866 this->dependency_lists_
.clear();
1867 for (size_t k
= 0; k
< this->version_trees_
.size(); ++k
)
1868 delete this->version_trees_
[k
];
1869 this->version_trees_
.clear();
1870 for (size_t k
= 0; k
< this->expression_lists_
.size(); ++k
)
1871 delete this->expression_lists_
[k
];
1872 this->expression_lists_
.clear();
1875 // Finalize the version script information.
1878 Version_script_info::finalize()
1880 if (!this->is_finalized_
)
1882 this->build_lookup_tables();
1883 this->is_finalized_
= true;
1887 // Return all the versions.
1889 std::vector
<std::string
>
1890 Version_script_info::get_versions() const
1892 std::vector
<std::string
> ret
;
1893 for (size_t j
= 0; j
< this->version_trees_
.size(); ++j
)
1894 if (!this->version_trees_
[j
]->tag
.empty())
1895 ret
.push_back(this->version_trees_
[j
]->tag
);
1899 // Return the dependencies of VERSION.
1901 std::vector
<std::string
>
1902 Version_script_info::get_dependencies(const char* version
) const
1904 std::vector
<std::string
> ret
;
1905 for (size_t j
= 0; j
< this->version_trees_
.size(); ++j
)
1906 if (this->version_trees_
[j
]->tag
== version
)
1908 const struct Version_dependency_list
* deps
=
1909 this->version_trees_
[j
]->dependencies
;
1911 for (size_t k
= 0; k
< deps
->dependencies
.size(); ++k
)
1912 ret
.push_back(deps
->dependencies
[k
]);
1918 // Build a set of fast lookup tables for a version script.
1921 Version_script_info::build_lookup_tables()
1923 size_t size
= this->version_trees_
.size();
1924 for (size_t j
= 0; j
< size
; ++j
)
1926 const Version_tree
* v
= this->version_trees_
[j
];
1927 this->build_expression_list_lookup(v
->global
, v
, &this->globals_
[0]);
1928 this->build_expression_list_lookup(v
->local
, v
, &this->locals_
[0]);
1932 // Build fast lookup information for EXPLIST and store it in LOOKUP.
1935 Version_script_info::build_expression_list_lookup(
1936 const Version_expression_list
* explist
,
1937 const Version_tree
* v
,
1940 if (explist
== NULL
)
1942 size_t size
= explist
->expressions
.size();
1943 for (size_t j
= 0; j
< size
; ++j
)
1945 const Version_expression
& exp(explist
->expressions
[j
]);
1946 Lookup
**pp
= &lookup
[exp
.language
];
1951 if (!exp
.exact_match
&& strpbrk(exp
.pattern
.c_str(), "?*[") != NULL
)
1952 p
->globs
.push_back(Glob(exp
.pattern
.c_str(), v
));
1955 std::pair
<Exact::iterator
, bool> ins
=
1956 p
->exact
.insert(std::make_pair(exp
.pattern
, v
));
1959 const Version_tree
* v1
= ins
.first
->second
;
1960 if (v1
!= NULL
&& v1
->tag
!= v
->tag
)
1962 // This is an ambiguous match. It's OK if it's just
1963 // documenting symbol versions, but not if we look
1965 ins
.first
->second
= NULL
;
1972 // Record that we have matched a name found in the version script.
1975 Version_script_info::matched_symbol(const Version_tree
* version_tree
,
1976 const char* name
) const
1978 const struct Version_expression_list
* global
= version_tree
->global
;
1979 for (size_t i
= 0; i
< global
->expressions
.size(); ++i
)
1981 const Version_expression
& expression(global
->expressions
[i
]);
1982 if (expression
.pattern
== name
1983 && (expression
.exact_match
1984 || strpbrk(expression
.pattern
.c_str(), "?*[") == NULL
))
1986 expression
.was_matched_by_symbol
= true;
1993 // Look up SYMBOL_NAME in the list of versions. If CHECK_GLOBAL is
1994 // true look at the globally visible symbols, otherwise look at the
1995 // symbols listed as "local:". Return true if the symbol is found,
1996 // false otherwise. If the symbol is found, then if PVERSION is not
1997 // NULL, set *PVERSION to the version.
2000 Version_script_info::get_symbol_version_helper(const char* symbol_name
,
2002 std::string
* pversion
) const
2004 gold_assert(this->is_finalized_
);
2005 const Lookup
* const * pp
= (check_global
2006 ? &this->globals_
[0]
2007 : &this->locals_
[0]);
2008 for (int i
= 0; i
< LANGUAGE_COUNT
; ++i
)
2010 const Lookup
* lookup
= pp
[i
];
2014 const char* name_to_match
;
2020 name_to_match
= symbol_name
;
2023 allocated
= cplus_demangle(symbol_name
, DMGL_ANSI
| DMGL_PARAMS
);
2024 if (allocated
== NULL
)
2026 name_to_match
= allocated
;
2029 allocated
= cplus_demangle(symbol_name
,
2030 DMGL_ANSI
| DMGL_PARAMS
| DMGL_JAVA
);
2031 if (allocated
== NULL
)
2033 name_to_match
= allocated
;
2038 Exact::const_iterator pe
= lookup
->exact
.find(name_to_match
);
2039 if (pe
!= lookup
->exact
.end())
2041 if (pversion
!= NULL
)
2043 if (pe
->second
!= NULL
)
2044 *pversion
= pe
->second
->tag
;
2047 gold_error(_("'%s' has multiple versions in version script"),
2053 // If we are using --no-undefined-version, and this is a
2054 // global symbol, we have to record that we have found this
2055 // symbol, so that we don't warn about it. We have to do
2056 // this now, because otherwise we have no way to get from a
2057 // non-C language back to the demangled name that we
2059 if (check_global
&& !parameters
->options().undefined_version())
2060 this->matched_symbol(pe
->second
, name_to_match
);
2062 if (allocated
!= NULL
)
2068 for (std::vector
<Glob
>::const_iterator pg
= lookup
->globs
.begin();
2069 pg
!= lookup
->globs
.end();
2072 // Check for * specially since it is fairly common.
2073 if ((pg
->pattern
[0] == '*' && pg
->pattern
[1] == '\0')
2074 || fnmatch(pg
->pattern
, name_to_match
, FNM_NOESCAPE
) == 0)
2076 if (pversion
!= NULL
)
2077 *pversion
= pg
->version
->tag
;
2078 if (allocated
!= NULL
)
2084 if (allocated
!= NULL
)
2091 // Give an error if any exact symbol names (not wildcards) appear in a
2092 // version script, but there is no such symbol.
2095 Version_script_info::check_unmatched_names(const Symbol_table
* symtab
) const
2097 for (size_t i
= 0; i
< this->version_trees_
.size(); ++i
)
2099 const Version_tree
* vt
= this->version_trees_
[i
];
2100 if (vt
->global
== NULL
)
2102 for (size_t j
= 0; j
< vt
->global
->expressions
.size(); ++j
)
2104 const Version_expression
& expression(vt
->global
->expressions
[j
]);
2106 // Ignore cases where we used the version because we saw a
2107 // symbol that we looked up. Note that
2108 // WAS_MATCHED_BY_SYMBOL will be true even if the symbol was
2109 // not a definition. That's OK as in that case we most
2110 // likely gave an undefined symbol error anyhow.
2111 if (expression
.was_matched_by_symbol
)
2114 // Just ignore names which are in languages other than C.
2115 // We have no way to look them up in the symbol table.
2116 if (expression
.language
!= LANGUAGE_C
)
2119 // Ignore wildcard patterns.
2120 if (!expression
.exact_match
2121 && strpbrk(expression
.pattern
.c_str(), "?*[") != NULL
)
2124 if (symtab
->lookup(expression
.pattern
.c_str(),
2125 vt
->tag
.c_str()) == NULL
)
2127 gold_error(_("version script assignment of %s to symbol %s "
2128 "failed: symbol not defined"),
2129 vt
->tag
.c_str(), expression
.pattern
.c_str());
2135 struct Version_dependency_list
*
2136 Version_script_info::allocate_dependency_list()
2138 dependency_lists_
.push_back(new Version_dependency_list
);
2139 return dependency_lists_
.back();
2142 struct Version_expression_list
*
2143 Version_script_info::allocate_expression_list()
2145 expression_lists_
.push_back(new Version_expression_list
);
2146 return expression_lists_
.back();
2149 struct Version_tree
*
2150 Version_script_info::allocate_version_tree()
2152 version_trees_
.push_back(new Version_tree
);
2153 return version_trees_
.back();
2156 // Print for debugging.
2159 Version_script_info::print(FILE* f
) const
2164 fprintf(f
, "VERSION {");
2166 for (size_t i
= 0; i
< this->version_trees_
.size(); ++i
)
2168 const Version_tree
* vt
= this->version_trees_
[i
];
2170 if (vt
->tag
.empty())
2173 fprintf(f
, " %s {\n", vt
->tag
.c_str());
2175 if (vt
->global
!= NULL
)
2177 fprintf(f
, " global :\n");
2178 this->print_expression_list(f
, vt
->global
);
2181 if (vt
->local
!= NULL
)
2183 fprintf(f
, " local :\n");
2184 this->print_expression_list(f
, vt
->local
);
2188 if (vt
->dependencies
!= NULL
)
2190 const Version_dependency_list
* deps
= vt
->dependencies
;
2191 for (size_t j
= 0; j
< deps
->dependencies
.size(); ++j
)
2193 if (j
< deps
->dependencies
.size() - 1)
2195 fprintf(f
, " %s", deps
->dependencies
[j
].c_str());
2205 Version_script_info::print_expression_list(
2207 const Version_expression_list
* vel
) const
2209 Version_script_info::Language current_language
= LANGUAGE_C
;
2210 for (size_t i
= 0; i
< vel
->expressions
.size(); ++i
)
2212 const Version_expression
& ve(vel
->expressions
[i
]);
2214 if (ve
.language
!= current_language
)
2216 if (current_language
!= LANGUAGE_C
)
2218 switch (ve
.language
)
2223 fprintf(f
, " extern \"C++\" {\n");
2226 fprintf(f
, " extern \"Java\" {\n");
2231 current_language
= ve
.language
;
2235 if (current_language
!= LANGUAGE_C
)
2240 fprintf(f
, "%s", ve
.pattern
.c_str());
2247 if (current_language
!= LANGUAGE_C
)
2251 } // End namespace gold.
2253 // The remaining functions are extern "C", so it's clearer to not put
2254 // them in namespace gold.
2256 using namespace gold
;
2258 // This function is called by the bison parser to return the next
2262 yylex(YYSTYPE
* lvalp
, void* closurev
)
2264 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2265 const Token
* token
= closure
->next_token();
2266 switch (token
->classification())
2271 case Token::TOKEN_INVALID
:
2272 yyerror(closurev
, "invalid character");
2275 case Token::TOKEN_EOF
:
2278 case Token::TOKEN_STRING
:
2280 // This is either a keyword or a STRING.
2282 const char* str
= token
->string_value(&len
);
2284 switch (closure
->lex_mode())
2286 case Lex::LINKER_SCRIPT
:
2287 parsecode
= script_keywords
.keyword_to_parsecode(str
, len
);
2289 case Lex::VERSION_SCRIPT
:
2290 parsecode
= version_script_keywords
.keyword_to_parsecode(str
, len
);
2292 case Lex::DYNAMIC_LIST
:
2293 parsecode
= dynamic_list_keywords
.keyword_to_parsecode(str
, len
);
2300 lvalp
->string
.value
= str
;
2301 lvalp
->string
.length
= len
;
2305 case Token::TOKEN_QUOTED_STRING
:
2306 lvalp
->string
.value
= token
->string_value(&lvalp
->string
.length
);
2307 return QUOTED_STRING
;
2309 case Token::TOKEN_OPERATOR
:
2310 return token
->operator_value();
2312 case Token::TOKEN_INTEGER
:
2313 lvalp
->integer
= token
->integer_value();
2318 // This function is called by the bison parser to report an error.
2321 yyerror(void* closurev
, const char* message
)
2323 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2324 gold_error(_("%s:%d:%d: %s"), closure
->filename(), closure
->lineno(),
2325 closure
->charpos(), message
);
2328 // Called by the bison parser to add an external symbol to the link.
2331 script_add_extern(void* closurev
, const char* name
, size_t length
)
2333 // We treat exactly like -u NAME. FIXME: If it seems useful, we
2334 // could handle this after the command line has been read, by adding
2335 // entries to the symbol table directly.
2336 std::string
arg("--undefined=");
2337 arg
.append(name
, length
);
2338 script_parse_option(closurev
, arg
.c_str(), arg
.size());
2341 // Called by the bison parser to add a file to the link.
2344 script_add_file(void* closurev
, const char* name
, size_t length
)
2346 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2348 // If this is an absolute path, and we found the script in the
2349 // sysroot, then we want to prepend the sysroot to the file name.
2350 // For example, this is how we handle a cross link to the x86_64
2351 // libc.so, which refers to /lib/libc.so.6.
2352 std::string
name_string(name
, length
);
2353 const char* extra_search_path
= ".";
2354 std::string script_directory
;
2355 if (IS_ABSOLUTE_PATH(name_string
.c_str()))
2357 if (closure
->is_in_sysroot())
2359 const std::string
& sysroot(parameters
->options().sysroot());
2360 gold_assert(!sysroot
.empty());
2361 name_string
= sysroot
+ name_string
;
2366 // In addition to checking the normal library search path, we
2367 // also want to check in the script-directory.
2368 const char *slash
= strrchr(closure
->filename(), '/');
2371 script_directory
.assign(closure
->filename(),
2372 slash
- closure
->filename() + 1);
2373 extra_search_path
= script_directory
.c_str();
2377 Input_file_argument
file(name_string
.c_str(),
2378 Input_file_argument::INPUT_FILE_TYPE_FILE
,
2379 extra_search_path
, false,
2380 closure
->position_dependent_options());
2381 closure
->inputs()->add_file(file
);
2384 // Called by the bison parser to start a group. If we are already in
2385 // a group, that means that this script was invoked within a
2386 // --start-group --end-group sequence on the command line, or that
2387 // this script was found in a GROUP of another script. In that case,
2388 // we simply continue the existing group, rather than starting a new
2389 // one. It is possible to construct a case in which this will do
2390 // something other than what would happen if we did a recursive group,
2391 // but it's hard to imagine why the different behaviour would be
2392 // useful for a real program. Avoiding recursive groups is simpler
2393 // and more efficient.
2396 script_start_group(void* closurev
)
2398 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2399 if (!closure
->in_group())
2400 closure
->inputs()->start_group();
2403 // Called by the bison parser at the end of a group.
2406 script_end_group(void* closurev
)
2408 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2409 if (!closure
->in_group())
2410 closure
->inputs()->end_group();
2413 // Called by the bison parser to start an AS_NEEDED list.
2416 script_start_as_needed(void* closurev
)
2418 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2419 closure
->position_dependent_options().set_as_needed(true);
2422 // Called by the bison parser at the end of an AS_NEEDED list.
2425 script_end_as_needed(void* closurev
)
2427 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2428 closure
->position_dependent_options().set_as_needed(false);
2431 // Called by the bison parser to set the entry symbol.
2434 script_set_entry(void* closurev
, const char* entry
, size_t length
)
2436 // We'll parse this exactly the same as --entry=ENTRY on the commandline
2437 // TODO(csilvers): FIXME -- call set_entry directly.
2438 std::string
arg("--entry=");
2439 arg
.append(entry
, length
);
2440 script_parse_option(closurev
, arg
.c_str(), arg
.size());
2443 // Called by the bison parser to set whether to define common symbols.
2446 script_set_common_allocation(void* closurev
, int set
)
2448 const char* arg
= set
!= 0 ? "--define-common" : "--no-define-common";
2449 script_parse_option(closurev
, arg
, strlen(arg
));
2452 // Called by the bison parser to define a symbol.
2455 script_set_symbol(void* closurev
, const char* name
, size_t length
,
2456 Expression
* value
, int providei
, int hiddeni
)
2458 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2459 const bool provide
= providei
!= 0;
2460 const bool hidden
= hiddeni
!= 0;
2461 closure
->script_options()->add_symbol_assignment(name
, length
,
2462 closure
->parsing_defsym(),
2463 value
, provide
, hidden
);
2464 closure
->clear_skip_on_incompatible_target();
2467 // Called by the bison parser to add an assertion.
2470 script_add_assertion(void* closurev
, Expression
* check
, const char* message
,
2473 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2474 closure
->script_options()->add_assertion(check
, message
, messagelen
);
2475 closure
->clear_skip_on_incompatible_target();
2478 // Called by the bison parser to parse an OPTION.
2481 script_parse_option(void* closurev
, const char* option
, size_t length
)
2483 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2484 // We treat the option as a single command-line option, even if
2485 // it has internal whitespace.
2486 if (closure
->command_line() == NULL
)
2488 // There are some options that we could handle here--e.g.,
2489 // -lLIBRARY. Should we bother?
2490 gold_warning(_("%s:%d:%d: ignoring command OPTION; OPTION is only valid"
2491 " for scripts specified via -T/--script"),
2492 closure
->filename(), closure
->lineno(), closure
->charpos());
2496 bool past_a_double_dash_option
= false;
2497 const char* mutable_option
= strndup(option
, length
);
2498 gold_assert(mutable_option
!= NULL
);
2499 closure
->command_line()->process_one_option(1, &mutable_option
, 0,
2500 &past_a_double_dash_option
);
2501 // The General_options class will quite possibly store a pointer
2502 // into mutable_option, so we can't free it. In cases the class
2503 // does not store such a pointer, this is a memory leak. Alas. :(
2505 closure
->clear_skip_on_incompatible_target();
2508 // Called by the bison parser to handle OUTPUT_FORMAT. OUTPUT_FORMAT
2509 // takes either one or three arguments. In the three argument case,
2510 // the format depends on the endianness option, which we don't
2511 // currently support (FIXME). If we see an OUTPUT_FORMAT for the
2512 // wrong format, then we want to search for a new file. Returning 0
2513 // here will cause the parser to immediately abort.
2516 script_check_output_format(void* closurev
,
2517 const char* default_name
, size_t default_length
,
2518 const char*, size_t, const char*, size_t)
2520 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2521 std::string
name(default_name
, default_length
);
2522 Target
* target
= select_target_by_name(name
.c_str());
2523 if (target
== NULL
|| !parameters
->is_compatible_target(target
))
2525 if (closure
->skip_on_incompatible_target())
2527 closure
->set_found_incompatible_target();
2530 // FIXME: Should we warn about the unknown target?
2535 // Called by the bison parser to handle TARGET.
2538 script_set_target(void* closurev
, const char* target
, size_t len
)
2540 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2541 std::string
s(target
, len
);
2542 General_options::Object_format format_enum
;
2543 format_enum
= General_options::string_to_object_format(s
.c_str());
2544 closure
->position_dependent_options().set_format_enum(format_enum
);
2547 // Called by the bison parser to handle SEARCH_DIR. This is handled
2548 // exactly like a -L option.
2551 script_add_search_dir(void* closurev
, const char* option
, size_t length
)
2553 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2554 if (closure
->command_line() == NULL
)
2555 gold_warning(_("%s:%d:%d: ignoring SEARCH_DIR; SEARCH_DIR is only valid"
2556 " for scripts specified via -T/--script"),
2557 closure
->filename(), closure
->lineno(), closure
->charpos());
2560 std::string s
= "-L" + std::string(option
, length
);
2561 script_parse_option(closurev
, s
.c_str(), s
.size());
2565 /* Called by the bison parser to push the lexer into expression
2569 script_push_lex_into_expression_mode(void* closurev
)
2571 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2572 closure
->push_lex_mode(Lex::EXPRESSION
);
2575 /* Called by the bison parser to push the lexer into version
2579 script_push_lex_into_version_mode(void* closurev
)
2581 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2582 if (closure
->version_script()->is_finalized())
2583 gold_error(_("%s:%d:%d: invalid use of VERSION in input file"),
2584 closure
->filename(), closure
->lineno(), closure
->charpos());
2585 closure
->push_lex_mode(Lex::VERSION_SCRIPT
);
2588 /* Called by the bison parser to pop the lexer mode. */
2591 script_pop_lex_mode(void* closurev
)
2593 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2594 closure
->pop_lex_mode();
2597 // Register an entire version node. For example:
2603 // - tag is "GLIBC_2.1"
2604 // - tree contains the information "global: foo"
2605 // - deps contains "GLIBC_2.0"
2608 script_register_vers_node(void*,
2611 struct Version_tree
*tree
,
2612 struct Version_dependency_list
*deps
)
2614 gold_assert(tree
!= NULL
);
2615 tree
->dependencies
= deps
;
2617 tree
->tag
= std::string(tag
, taglen
);
2620 // Add a dependencies to the list of existing dependencies, if any,
2621 // and return the expanded list.
2623 extern "C" struct Version_dependency_list
*
2624 script_add_vers_depend(void* closurev
,
2625 struct Version_dependency_list
*all_deps
,
2626 const char *depend_to_add
, int deplen
)
2628 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2629 if (all_deps
== NULL
)
2630 all_deps
= closure
->version_script()->allocate_dependency_list();
2631 all_deps
->dependencies
.push_back(std::string(depend_to_add
, deplen
));
2635 // Add a pattern expression to an existing list of expressions, if any.
2637 extern "C" struct Version_expression_list
*
2638 script_new_vers_pattern(void* closurev
,
2639 struct Version_expression_list
*expressions
,
2640 const char *pattern
, int patlen
, int exact_match
)
2642 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2643 if (expressions
== NULL
)
2644 expressions
= closure
->version_script()->allocate_expression_list();
2645 expressions
->expressions
.push_back(
2646 Version_expression(std::string(pattern
, patlen
),
2647 closure
->get_current_language(),
2648 static_cast<bool>(exact_match
)));
2652 // Attaches b to the end of a, and clears b. So a = a + b and b = {}.
2654 extern "C" struct Version_expression_list
*
2655 script_merge_expressions(struct Version_expression_list
*a
,
2656 struct Version_expression_list
*b
)
2658 a
->expressions
.insert(a
->expressions
.end(),
2659 b
->expressions
.begin(), b
->expressions
.end());
2660 // We could delete b and remove it from expressions_lists_, but
2661 // that's a lot of work. This works just as well.
2662 b
->expressions
.clear();
2666 // Combine the global and local expressions into a a Version_tree.
2668 extern "C" struct Version_tree
*
2669 script_new_vers_node(void* closurev
,
2670 struct Version_expression_list
*global
,
2671 struct Version_expression_list
*local
)
2673 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2674 Version_tree
* tree
= closure
->version_script()->allocate_version_tree();
2675 tree
->global
= global
;
2676 tree
->local
= local
;
2680 // Handle a transition in language, such as at the
2681 // start or end of 'extern "C++"'
2684 version_script_push_lang(void* closurev
, const char* lang
, int langlen
)
2686 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2687 std::string
language(lang
, langlen
);
2688 Version_script_info::Language code
;
2689 if (language
.empty() || language
== "C")
2690 code
= Version_script_info::LANGUAGE_C
;
2691 else if (language
== "C++")
2692 code
= Version_script_info::LANGUAGE_CXX
;
2693 else if (language
== "Java")
2694 code
= Version_script_info::LANGUAGE_JAVA
;
2697 char* buf
= new char[langlen
+ 100];
2698 snprintf(buf
, langlen
+ 100,
2699 _("unrecognized version script language '%s'"),
2701 yyerror(closurev
, buf
);
2703 code
= Version_script_info::LANGUAGE_C
;
2705 closure
->push_language(code
);
2709 version_script_pop_lang(void* closurev
)
2711 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2712 closure
->pop_language();
2715 // Called by the bison parser to start a SECTIONS clause.
2718 script_start_sections(void* closurev
)
2720 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2721 closure
->script_options()->script_sections()->start_sections();
2722 closure
->clear_skip_on_incompatible_target();
2725 // Called by the bison parser to finish a SECTIONS clause.
2728 script_finish_sections(void* closurev
)
2730 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2731 closure
->script_options()->script_sections()->finish_sections();
2734 // Start processing entries for an output section.
2737 script_start_output_section(void* closurev
, const char* name
, size_t namelen
,
2738 const struct Parser_output_section_header
* header
)
2740 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2741 closure
->script_options()->script_sections()->start_output_section(name
,
2746 // Finish processing entries for an output section.
2749 script_finish_output_section(void* closurev
,
2750 const struct Parser_output_section_trailer
* trail
)
2752 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2753 closure
->script_options()->script_sections()->finish_output_section(trail
);
2756 // Add a data item (e.g., "WORD (0)") to the current output section.
2759 script_add_data(void* closurev
, int data_token
, Expression
* val
)
2761 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2763 bool is_signed
= true;
2785 closure
->script_options()->script_sections()->add_data(size
, is_signed
, val
);
2788 // Add a clause setting the fill value to the current output section.
2791 script_add_fill(void* closurev
, Expression
* val
)
2793 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2794 closure
->script_options()->script_sections()->add_fill(val
);
2797 // Add a new input section specification to the current output
2801 script_add_input_section(void* closurev
,
2802 const struct Input_section_spec
* spec
,
2805 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2806 bool keep
= keepi
!= 0;
2807 closure
->script_options()->script_sections()->add_input_section(spec
, keep
);
2810 // When we see DATA_SEGMENT_ALIGN we record that following output
2811 // sections may be relro.
2814 script_data_segment_align(void* closurev
)
2816 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2817 if (!closure
->script_options()->saw_sections_clause())
2818 gold_error(_("%s:%d:%d: DATA_SEGMENT_ALIGN not in SECTIONS clause"),
2819 closure
->filename(), closure
->lineno(), closure
->charpos());
2821 closure
->script_options()->script_sections()->data_segment_align();
2824 // When we see DATA_SEGMENT_RELRO_END we know that all output sections
2825 // since DATA_SEGMENT_ALIGN should be relro.
2828 script_data_segment_relro_end(void* closurev
)
2830 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2831 if (!closure
->script_options()->saw_sections_clause())
2832 gold_error(_("%s:%d:%d: DATA_SEGMENT_ALIGN not in SECTIONS clause"),
2833 closure
->filename(), closure
->lineno(), closure
->charpos());
2835 closure
->script_options()->script_sections()->data_segment_relro_end();
2838 // Create a new list of string/sort pairs.
2840 extern "C" String_sort_list_ptr
2841 script_new_string_sort_list(const struct Wildcard_section
* string_sort
)
2843 return new String_sort_list(1, *string_sort
);
2846 // Add an entry to a list of string/sort pairs. The way the parser
2847 // works permits us to simply modify the first parameter, rather than
2850 extern "C" String_sort_list_ptr
2851 script_string_sort_list_add(String_sort_list_ptr pv
,
2852 const struct Wildcard_section
* string_sort
)
2855 return script_new_string_sort_list(string_sort
);
2858 pv
->push_back(*string_sort
);
2863 // Create a new list of strings.
2865 extern "C" String_list_ptr
2866 script_new_string_list(const char* str
, size_t len
)
2868 return new String_list(1, std::string(str
, len
));
2871 // Add an element to a list of strings. The way the parser works
2872 // permits us to simply modify the first parameter, rather than copy
2875 extern "C" String_list_ptr
2876 script_string_list_push_back(String_list_ptr pv
, const char* str
, size_t len
)
2879 return script_new_string_list(str
, len
);
2882 pv
->push_back(std::string(str
, len
));
2887 // Concatenate two string lists. Either or both may be NULL. The way
2888 // the parser works permits us to modify the parameters, rather than
2891 extern "C" String_list_ptr
2892 script_string_list_append(String_list_ptr pv1
, String_list_ptr pv2
)
2898 pv1
->insert(pv1
->end(), pv2
->begin(), pv2
->end());
2902 // Add a new program header.
2905 script_add_phdr(void* closurev
, const char* name
, size_t namelen
,
2906 unsigned int type
, const Phdr_info
* info
)
2908 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2909 bool includes_filehdr
= info
->includes_filehdr
!= 0;
2910 bool includes_phdrs
= info
->includes_phdrs
!= 0;
2911 bool is_flags_valid
= info
->is_flags_valid
!= 0;
2912 Script_sections
* ss
= closure
->script_options()->script_sections();
2913 ss
->add_phdr(name
, namelen
, type
, includes_filehdr
, includes_phdrs
,
2914 is_flags_valid
, info
->flags
, info
->load_address
);
2915 closure
->clear_skip_on_incompatible_target();
2918 // Convert a program header string to a type.
2920 #define PHDR_TYPE(NAME) { #NAME, sizeof(#NAME) - 1, elfcpp::NAME }
2927 } phdr_type_names
[] =
2931 PHDR_TYPE(PT_DYNAMIC
),
2932 PHDR_TYPE(PT_INTERP
),
2934 PHDR_TYPE(PT_SHLIB
),
2937 PHDR_TYPE(PT_GNU_EH_FRAME
),
2938 PHDR_TYPE(PT_GNU_STACK
),
2939 PHDR_TYPE(PT_GNU_RELRO
)
2942 extern "C" unsigned int
2943 script_phdr_string_to_type(void* closurev
, const char* name
, size_t namelen
)
2945 for (unsigned int i
= 0;
2946 i
< sizeof(phdr_type_names
) / sizeof(phdr_type_names
[0]);
2948 if (namelen
== phdr_type_names
[i
].namelen
2949 && strncmp(name
, phdr_type_names
[i
].name
, namelen
) == 0)
2950 return phdr_type_names
[i
].val
;
2951 yyerror(closurev
, _("unknown PHDR type (try integer)"));
2952 return elfcpp::PT_NULL
;
2956 script_saw_segment_start_expression(void* closurev
)
2958 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2959 Script_sections
* ss
= closure
->script_options()->script_sections();
2960 ss
->set_saw_segment_start_expression(true);