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.
30 #include "filenames.h"
34 #include "dirsearch.h"
37 #include "workqueue.h"
39 #include "parameters.h"
48 // A token read from a script file. We don't implement keywords here;
49 // all keywords are simply represented as a string.
54 // Token classification.
59 // Token indicates end of input.
61 // Token is a string of characters.
63 // Token is a quoted string of characters.
65 // Token is an operator.
67 // Token is a number (an integer).
71 // We need an empty constructor so that we can put this STL objects.
73 : classification_(TOKEN_INVALID
), value_(NULL
), value_length_(0),
74 opcode_(0), lineno_(0), charpos_(0)
77 // A general token with no value.
78 Token(Classification classification
, int lineno
, int charpos
)
79 : classification_(classification
), value_(NULL
), value_length_(0),
80 opcode_(0), lineno_(lineno
), charpos_(charpos
)
82 gold_assert(classification
== TOKEN_INVALID
83 || classification
== TOKEN_EOF
);
86 // A general token with a value.
87 Token(Classification classification
, const char* value
, size_t length
,
88 int lineno
, int charpos
)
89 : classification_(classification
), value_(value
), value_length_(length
),
90 opcode_(0), lineno_(lineno
), charpos_(charpos
)
92 gold_assert(classification
!= TOKEN_INVALID
93 && classification
!= TOKEN_EOF
);
96 // A token representing an operator.
97 Token(int opcode
, int lineno
, int charpos
)
98 : classification_(TOKEN_OPERATOR
), value_(NULL
), value_length_(0),
99 opcode_(opcode
), lineno_(lineno
), charpos_(charpos
)
102 // Return whether the token is invalid.
105 { return this->classification_
== TOKEN_INVALID
; }
107 // Return whether this is an EOF token.
110 { return this->classification_
== TOKEN_EOF
; }
112 // Return the token classification.
114 classification() const
115 { return this->classification_
; }
117 // Return the line number at which the token starts.
120 { return this->lineno_
; }
122 // Return the character position at this the token starts.
125 { return this->charpos_
; }
127 // Get the value of a token.
130 string_value(size_t* length
) const
132 gold_assert(this->classification_
== TOKEN_STRING
133 || this->classification_
== TOKEN_QUOTED_STRING
);
134 *length
= this->value_length_
;
139 operator_value() const
141 gold_assert(this->classification_
== TOKEN_OPERATOR
);
142 return this->opcode_
;
146 integer_value() const
148 gold_assert(this->classification_
== TOKEN_INTEGER
);
150 std::string
s(this->value_
, this->value_length_
);
151 return strtoull(s
.c_str(), NULL
, 0);
155 // The token classification.
156 Classification classification_
;
157 // The token value, for TOKEN_STRING or TOKEN_QUOTED_STRING or
160 // The length of the token value.
161 size_t value_length_
;
162 // The token value, for TOKEN_OPERATOR.
164 // The line number where this token started (one based).
166 // The character position within the line where this token started
171 // This class handles lexing a file into a sequence of tokens.
176 // We unfortunately have to support different lexing modes, because
177 // when reading different parts of a linker script we need to parse
178 // things differently.
181 // Reading an ordinary linker script.
183 // Reading an expression in a linker script.
185 // Reading a version script.
189 Lex(const char* input_string
, size_t input_length
, int parsing_token
)
190 : input_string_(input_string
), input_length_(input_length
),
191 current_(input_string
), mode_(LINKER_SCRIPT
),
192 first_token_(parsing_token
), token_(),
193 lineno_(1), linestart_(input_string
)
196 // Read a file into a string.
198 read_file(Input_file
*, std::string
*);
200 // Return the next token.
204 // Return the current lexing mode.
207 { return this->mode_
; }
209 // Set the lexing mode.
212 { this->mode_
= mode
; }
216 Lex
& operator=(const Lex
&);
218 // Make a general token with no value at the current location.
220 make_token(Token::Classification c
, const char* start
) const
221 { return Token(c
, this->lineno_
, start
- this->linestart_
+ 1); }
223 // Make a general token with a value at the current location.
225 make_token(Token::Classification c
, const char* v
, size_t len
,
228 { return Token(c
, v
, len
, this->lineno_
, start
- this->linestart_
+ 1); }
230 // Make an operator token at the current location.
232 make_token(int opcode
, const char* start
) const
233 { return Token(opcode
, this->lineno_
, start
- this->linestart_
+ 1); }
235 // Make an invalid token at the current location.
237 make_invalid_token(const char* start
)
238 { return this->make_token(Token::TOKEN_INVALID
, start
); }
240 // Make an EOF token at the current location.
242 make_eof_token(const char* start
)
243 { return this->make_token(Token::TOKEN_EOF
, start
); }
245 // Return whether C can be the first character in a name. C2 is the
246 // next character, since we sometimes need that.
248 can_start_name(char c
, char c2
);
250 // If C can appear in a name which has already started, return a
251 // pointer to a character later in the token or just past
252 // it. Otherwise, return NULL.
254 can_continue_name(const char* c
);
256 // Return whether C, C2, C3 can start a hex number.
258 can_start_hex(char c
, char c2
, char c3
);
260 // If C can appear in a hex number which has already started, return
261 // a pointer to a character later in the token or just past
262 // it. Otherwise, return NULL.
264 can_continue_hex(const char* c
);
266 // Return whether C can start a non-hex number.
268 can_start_number(char c
);
270 // If C can appear in a decimal number which has already started,
271 // return a pointer to a character later in the token or just past
272 // it. Otherwise, return NULL.
274 can_continue_number(const char* c
)
275 { return Lex::can_start_number(*c
) ? c
+ 1 : NULL
; }
277 // If C1 C2 C3 form a valid three character operator, return the
278 // opcode. Otherwise return 0.
280 three_char_operator(char c1
, char c2
, char c3
);
282 // If C1 C2 form a valid two character operator, return the opcode.
283 // Otherwise return 0.
285 two_char_operator(char c1
, char c2
);
287 // If C1 is a valid one character operator, return the opcode.
288 // Otherwise return 0.
290 one_char_operator(char c1
);
292 // Read the next token.
294 get_token(const char**);
296 // Skip a C style /* */ comment. Return false if the comment did
299 skip_c_comment(const char**);
301 // Skip a line # comment. Return false if there was no newline.
303 skip_line_comment(const char**);
305 // Build a token CLASSIFICATION from all characters that match
306 // CAN_CONTINUE_FN. The token starts at START. Start matching from
307 // MATCH. Set *PP to the character following the token.
309 gather_token(Token::Classification
,
310 const char* (Lex::*can_continue_fn
)(const char*),
311 const char* start
, const char* match
, const char** pp
);
313 // Build a token from a quoted string.
315 gather_quoted_string(const char** pp
);
317 // The string we are tokenizing.
318 const char* input_string_
;
319 // The length of the string.
320 size_t input_length_
;
321 // The current offset into the string.
322 const char* current_
;
323 // The current lexing mode.
325 // The code to use for the first token. This is set to 0 after it
328 // The current token.
330 // The current line number.
332 // The start of the current line in the string.
333 const char* linestart_
;
336 // Read the whole file into memory. We don't expect linker scripts to
337 // be large, so we just use a std::string as a buffer. We ignore the
338 // data we've already read, so that we read aligned buffers.
341 Lex::read_file(Input_file
* input_file
, std::string
* contents
)
343 off_t filesize
= input_file
->file().filesize();
345 contents
->reserve(filesize
);
348 unsigned char buf
[BUFSIZ
];
349 while (off
< filesize
)
352 if (get
> filesize
- off
)
353 get
= filesize
- off
;
354 input_file
->file().read(off
, get
, buf
);
355 contents
->append(reinterpret_cast<char*>(&buf
[0]), get
);
360 // Return whether C can be the start of a name, if the next character
361 // is C2. A name can being with a letter, underscore, period, or
362 // dollar sign. Because a name can be a file name, we also permit
363 // forward slash, backslash, and tilde. Tilde is the tricky case
364 // here; GNU ld also uses it as a bitwise not operator. It is only
365 // recognized as the operator if it is not immediately followed by
366 // some character which can appear in a symbol. That is, when we
367 // don't know that we are looking at an expression, "~0" is a file
368 // name, and "~ 0" is an expression using bitwise not. We are
372 Lex::can_start_name(char c
, char c2
)
376 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
377 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
378 case 'M': case 'N': case 'O': case 'Q': case 'P': case 'R':
379 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
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 '_': case '.': case '$':
390 return this->mode_
== LINKER_SCRIPT
;
393 return this->mode_
== LINKER_SCRIPT
&& can_continue_name(&c2
);
396 return (this->mode_
== VERSION_SCRIPT
397 || (this->mode_
== LINKER_SCRIPT
398 && can_continue_name(&c2
)));
405 // Return whether C can continue a name which has already started.
406 // Subsequent characters in a name are the same as the leading
407 // characters, plus digits and "=+-:[],?*". So in general the linker
408 // script language requires spaces around operators, unless we know
409 // that we are parsing an expression.
412 Lex::can_continue_name(const char* c
)
416 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
417 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
418 case 'M': case 'N': case 'O': case 'Q': case 'P': case 'R':
419 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
421 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
422 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
423 case 'm': case 'n': case 'o': case 'q': case 'p': case 'r':
424 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
426 case '_': case '.': case '$':
427 case '0': case '1': case '2': case '3': case '4':
428 case '5': case '6': case '7': case '8': case '9':
431 case '/': case '\\': case '~':
434 if (this->mode_
== LINKER_SCRIPT
)
438 case '[': case ']': case '*': case '-':
439 if (this->mode_
== LINKER_SCRIPT
|| this->mode_
== VERSION_SCRIPT
)
444 if (this->mode_
== VERSION_SCRIPT
)
449 if (this->mode_
== LINKER_SCRIPT
)
451 else if (this->mode_
== VERSION_SCRIPT
&& (c
[1] == ':'))
453 // A name can have '::' in it, as that's a c++ namespace
454 // separator. But a single colon is not part of a name.
464 // For a number we accept 0x followed by hex digits, or any sequence
465 // of digits. The old linker accepts leading '$' for hex, and
466 // trailing HXBOD. Those are for MRI compatibility and we don't
467 // accept them. The old linker also accepts trailing MK for mega or
468 // kilo. FIXME: Those are mentioned in the documentation, and we
469 // should accept them.
471 // Return whether C1 C2 C3 can start a hex number.
474 Lex::can_start_hex(char c1
, char c2
, char c3
)
476 if (c1
== '0' && (c2
== 'x' || c2
== 'X'))
477 return this->can_continue_hex(&c3
);
481 // Return whether C can appear in a hex number.
484 Lex::can_continue_hex(const char* c
)
488 case '0': case '1': case '2': case '3': case '4':
489 case '5': case '6': case '7': case '8': case '9':
490 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
491 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
499 // Return whether C can start a non-hex number.
502 Lex::can_start_number(char c
)
506 case '0': case '1': case '2': case '3': case '4':
507 case '5': case '6': case '7': case '8': case '9':
515 // If C1 C2 C3 form a valid three character operator, return the
516 // opcode (defined in the yyscript.h file generated from yyscript.y).
517 // Otherwise return 0.
520 Lex::three_char_operator(char c1
, char c2
, char c3
)
525 if (c2
== '<' && c3
== '=')
529 if (c2
== '>' && c3
== '=')
538 // If C1 C2 form a valid two character operator, return the opcode
539 // (defined in the yyscript.h file generated from yyscript.y).
540 // Otherwise return 0.
543 Lex::two_char_operator(char c1
, char c2
)
601 // If C1 is a valid operator, return the opcode. Otherwise return 0.
604 Lex::one_char_operator(char c1
)
637 // Skip a C style comment. *PP points to just after the "/*". Return
638 // false if the comment did not end.
641 Lex::skip_c_comment(const char** pp
)
644 while (p
[0] != '*' || p
[1] != '/')
655 this->linestart_
= p
+ 1;
664 // Skip a line # comment. Return false if there was no newline.
667 Lex::skip_line_comment(const char** pp
)
670 size_t skip
= strcspn(p
, "\n");
679 this->linestart_
= p
;
685 // Build a token CLASSIFICATION from all characters that match
686 // CAN_CONTINUE_FN. Update *PP.
689 Lex::gather_token(Token::Classification classification
,
690 const char* (Lex::*can_continue_fn
)(const char*),
695 const char* new_match
= NULL
;
696 while ((new_match
= (this->*can_continue_fn
)(match
)))
699 return this->make_token(classification
, start
, match
- start
, start
);
702 // Build a token from a quoted string.
705 Lex::gather_quoted_string(const char** pp
)
707 const char* start
= *pp
;
708 const char* p
= start
;
710 size_t skip
= strcspn(p
, "\"\n");
712 return this->make_invalid_token(start
);
714 return this->make_token(Token::TOKEN_QUOTED_STRING
, p
, skip
, start
);
717 // Return the next token at *PP. Update *PP. General guideline: we
718 // require linker scripts to be simple ASCII. No unicode linker
719 // scripts. In particular we can assume that any '\0' is the end of
723 Lex::get_token(const char** pp
)
732 return this->make_eof_token(p
);
735 // Skip whitespace quickly.
736 while (*p
== ' ' || *p
== '\t')
743 this->linestart_
= p
;
747 // Skip C style comments.
748 if (p
[0] == '/' && p
[1] == '*')
750 int lineno
= this->lineno_
;
751 int charpos
= p
- this->linestart_
+ 1;
754 if (!this->skip_c_comment(pp
))
755 return Token(Token::TOKEN_INVALID
, lineno
, charpos
);
761 // Skip line comments.
765 if (!this->skip_line_comment(pp
))
766 return this->make_eof_token(p
);
772 if (this->can_start_name(p
[0], p
[1]))
773 return this->gather_token(Token::TOKEN_STRING
,
774 &Lex::can_continue_name
,
777 // We accept any arbitrary name in double quotes, as long as it
778 // does not cross a line boundary.
782 return this->gather_quoted_string(pp
);
785 // Check for a number.
787 if (this->can_start_hex(p
[0], p
[1], p
[2]))
788 return this->gather_token(Token::TOKEN_INTEGER
,
789 &Lex::can_continue_hex
,
792 if (Lex::can_start_number(p
[0]))
793 return this->gather_token(Token::TOKEN_INTEGER
,
794 &Lex::can_continue_number
,
797 // Check for operators.
799 int opcode
= Lex::three_char_operator(p
[0], p
[1], p
[2]);
803 return this->make_token(opcode
, p
);
806 opcode
= Lex::two_char_operator(p
[0], p
[1]);
810 return this->make_token(opcode
, p
);
813 opcode
= Lex::one_char_operator(p
[0]);
817 return this->make_token(opcode
, p
);
820 return this->make_token(Token::TOKEN_INVALID
, p
);
824 // Return the next token.
829 // The first token is special.
830 if (this->first_token_
!= 0)
832 this->token_
= Token(this->first_token_
, 0, 0);
833 this->first_token_
= 0;
834 return &this->token_
;
837 this->token_
= this->get_token(&this->current_
);
839 // Don't let an early null byte fool us into thinking that we've
840 // reached the end of the file.
841 if (this->token_
.is_eof()
842 && (static_cast<size_t>(this->current_
- this->input_string_
)
843 < this->input_length_
))
844 this->token_
= this->make_invalid_token(this->current_
);
846 return &this->token_
;
849 // A trivial task which waits for THIS_BLOCKER to be clear and then
850 // clears NEXT_BLOCKER. THIS_BLOCKER may be NULL.
852 class Script_unblock
: public Task
855 Script_unblock(Task_token
* this_blocker
, Task_token
* next_blocker
)
856 : this_blocker_(this_blocker
), next_blocker_(next_blocker
)
861 if (this->this_blocker_
!= NULL
)
862 delete this->this_blocker_
;
868 if (this->this_blocker_
!= NULL
&& this->this_blocker_
->is_blocked())
869 return this->this_blocker_
;
874 locks(Task_locker
* tl
)
875 { tl
->add(this, this->next_blocker_
); }
883 { return "Script_unblock"; }
886 Task_token
* this_blocker_
;
887 Task_token
* next_blocker_
;
890 // class Symbol_assignment.
892 // Add the symbol to the symbol table. This makes sure the symbol is
893 // there and defined. The actual value is stored later. We can't
894 // determine the actual value at this point, because we can't
895 // necessarily evaluate the expression until all ordinary symbols have
898 // The GNU linker lets symbol assignments in the linker script
899 // silently override defined symbols in object files. We are
900 // compatible. FIXME: Should we issue a warning?
903 Symbol_assignment::add_to_table(Symbol_table
* symtab
)
905 elfcpp::STV vis
= this->hidden_
? elfcpp::STV_HIDDEN
: elfcpp::STV_DEFAULT
;
906 this->sym_
= symtab
->define_as_constant(this->name_
.c_str(),
915 true); // force_override
918 // Finalize a symbol value.
921 Symbol_assignment::finalize(Symbol_table
* symtab
, const Layout
* layout
)
923 this->finalize_maybe_dot(symtab
, layout
, false, 0, NULL
);
926 // Finalize a symbol value which can refer to the dot symbol.
929 Symbol_assignment::finalize_with_dot(Symbol_table
* symtab
,
930 const Layout
* layout
,
932 Output_section
* dot_section
)
934 this->finalize_maybe_dot(symtab
, layout
, true, dot_value
, dot_section
);
937 // Finalize a symbol value, internal version.
940 Symbol_assignment::finalize_maybe_dot(Symbol_table
* symtab
,
941 const Layout
* layout
,
942 bool is_dot_available
,
944 Output_section
* dot_section
)
946 // If we were only supposed to provide this symbol, the sym_ field
947 // will be NULL if the symbol was not referenced.
948 if (this->sym_
== NULL
)
950 gold_assert(this->provide_
);
954 if (parameters
->target().get_size() == 32)
956 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
957 this->sized_finalize
<32>(symtab
, layout
, is_dot_available
, dot_value
,
963 else if (parameters
->target().get_size() == 64)
965 #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
966 this->sized_finalize
<64>(symtab
, layout
, is_dot_available
, dot_value
,
978 Symbol_assignment::sized_finalize(Symbol_table
* symtab
, const Layout
* layout
,
979 bool is_dot_available
, uint64_t dot_value
,
980 Output_section
* dot_section
)
982 Output_section
* section
;
983 uint64_t final_val
= this->val_
->eval_maybe_dot(symtab
, layout
, true,
985 dot_value
, dot_section
,
987 Sized_symbol
<size
>* ssym
= symtab
->get_sized_symbol
<size
>(this->sym_
);
988 ssym
->set_value(final_val
);
990 ssym
->set_output_section(section
);
993 // Set the symbol value if the expression yields an absolute value.
996 Symbol_assignment::set_if_absolute(Symbol_table
* symtab
, const Layout
* layout
,
997 bool is_dot_available
, uint64_t dot_value
)
999 if (this->sym_
== NULL
)
1002 Output_section
* val_section
;
1003 uint64_t val
= this->val_
->eval_maybe_dot(symtab
, layout
, false,
1004 is_dot_available
, dot_value
,
1005 NULL
, &val_section
);
1006 if (val_section
!= NULL
)
1009 if (parameters
->target().get_size() == 32)
1011 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
1012 Sized_symbol
<32>* ssym
= symtab
->get_sized_symbol
<32>(this->sym_
);
1013 ssym
->set_value(val
);
1018 else if (parameters
->target().get_size() == 64)
1020 #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
1021 Sized_symbol
<64>* ssym
= symtab
->get_sized_symbol
<64>(this->sym_
);
1022 ssym
->set_value(val
);
1031 // Print for debugging.
1034 Symbol_assignment::print(FILE* f
) const
1036 if (this->provide_
&& this->hidden_
)
1037 fprintf(f
, "PROVIDE_HIDDEN(");
1038 else if (this->provide_
)
1039 fprintf(f
, "PROVIDE(");
1040 else if (this->hidden_
)
1043 fprintf(f
, "%s = ", this->name_
.c_str());
1044 this->val_
->print(f
);
1046 if (this->provide_
|| this->hidden_
)
1052 // Class Script_assertion.
1054 // Check the assertion.
1057 Script_assertion::check(const Symbol_table
* symtab
, const Layout
* layout
)
1059 if (!this->check_
->eval(symtab
, layout
, true))
1060 gold_error("%s", this->message_
.c_str());
1063 // Print for debugging.
1066 Script_assertion::print(FILE* f
) const
1068 fprintf(f
, "ASSERT(");
1069 this->check_
->print(f
);
1070 fprintf(f
, ", \"%s\")\n", this->message_
.c_str());
1073 // Class Script_options.
1075 Script_options::Script_options()
1076 : entry_(), symbol_assignments_(), version_script_info_(),
1081 // Add a symbol to be defined.
1084 Script_options::add_symbol_assignment(const char* name
, size_t length
,
1085 Expression
* value
, bool provide
,
1088 if (length
!= 1 || name
[0] != '.')
1090 if (this->script_sections_
.in_sections_clause())
1091 this->script_sections_
.add_symbol_assignment(name
, length
, value
,
1095 Symbol_assignment
* p
= new Symbol_assignment(name
, length
, value
,
1097 this->symbol_assignments_
.push_back(p
);
1102 if (provide
|| hidden
)
1103 gold_error(_("invalid use of PROVIDE for dot symbol"));
1104 if (!this->script_sections_
.in_sections_clause())
1105 gold_error(_("invalid assignment to dot outside of SECTIONS"));
1107 this->script_sections_
.add_dot_assignment(value
);
1111 // Add an assertion.
1114 Script_options::add_assertion(Expression
* check
, const char* message
,
1117 if (this->script_sections_
.in_sections_clause())
1118 this->script_sections_
.add_assertion(check
, message
, messagelen
);
1121 Script_assertion
* p
= new Script_assertion(check
, message
, messagelen
);
1122 this->assertions_
.push_back(p
);
1126 // Create sections required by any linker scripts.
1129 Script_options::create_script_sections(Layout
* layout
)
1131 if (this->saw_sections_clause())
1132 this->script_sections_
.create_sections(layout
);
1135 // Add any symbols we are defining to the symbol table.
1138 Script_options::add_symbols_to_table(Symbol_table
* symtab
)
1140 for (Symbol_assignments::iterator p
= this->symbol_assignments_
.begin();
1141 p
!= this->symbol_assignments_
.end();
1143 (*p
)->add_to_table(symtab
);
1144 this->script_sections_
.add_symbols_to_table(symtab
);
1147 // Finalize symbol values. Also check assertions.
1150 Script_options::finalize_symbols(Symbol_table
* symtab
, const Layout
* layout
)
1152 for (Symbol_assignments::iterator p
= this->symbol_assignments_
.begin();
1153 p
!= this->symbol_assignments_
.end();
1155 (*p
)->finalize(symtab
, layout
);
1157 for (Assertions::iterator p
= this->assertions_
.begin();
1158 p
!= this->assertions_
.end();
1160 (*p
)->check(symtab
, layout
);
1162 this->script_sections_
.finalize_symbols(symtab
, layout
);
1165 // Set section addresses. We set all the symbols which have absolute
1166 // values. Then we let the SECTIONS clause do its thing. This
1167 // returns the segment which holds the file header and segment
1171 Script_options::set_section_addresses(Symbol_table
* symtab
, Layout
* layout
)
1173 for (Symbol_assignments::iterator p
= this->symbol_assignments_
.begin();
1174 p
!= this->symbol_assignments_
.end();
1176 (*p
)->set_if_absolute(symtab
, layout
, false, 0);
1178 return this->script_sections_
.set_section_addresses(symtab
, layout
);
1181 // This class holds data passed through the parser to the lexer and to
1182 // the parser support functions. This avoids global variables. We
1183 // can't use global variables because we need not be called by a
1184 // singleton thread.
1186 class Parser_closure
1189 Parser_closure(const char* filename
,
1190 const Position_dependent_options
& posdep_options
,
1191 bool in_group
, bool is_in_sysroot
,
1192 Command_line
* command_line
,
1193 Script_options
* script_options
,
1195 : filename_(filename
), posdep_options_(posdep_options
),
1196 in_group_(in_group
), is_in_sysroot_(is_in_sysroot
),
1197 command_line_(command_line
), script_options_(script_options
),
1198 version_script_info_(script_options
->version_script_info()),
1199 lex_(lex
), lineno_(0), charpos_(0), lex_mode_stack_(), inputs_(NULL
)
1201 // We start out processing C symbols in the default lex mode.
1202 language_stack_
.push_back("");
1203 lex_mode_stack_
.push_back(lex
->mode());
1206 // Return the file name.
1209 { return this->filename_
; }
1211 // Return the position dependent options. The caller may modify
1213 Position_dependent_options
&
1214 position_dependent_options()
1215 { return this->posdep_options_
; }
1217 // Return whether this script is being run in a group.
1220 { return this->in_group_
; }
1222 // Return whether this script was found using a directory in the
1225 is_in_sysroot() const
1226 { return this->is_in_sysroot_
; }
1228 // Returns the Command_line structure passed in at constructor time.
1229 // This value may be NULL. The caller may modify this, which modifies
1230 // the passed-in Command_line object (not a copy).
1233 { return this->command_line_
; }
1235 // Return the options which may be set by a script.
1238 { return this->script_options_
; }
1240 // Return the object in which version script information should be stored.
1241 Version_script_info
*
1243 { return this->version_script_info_
; }
1245 // Return the next token, and advance.
1249 const Token
* token
= this->lex_
->next_token();
1250 this->lineno_
= token
->lineno();
1251 this->charpos_
= token
->charpos();
1255 // Set a new lexer mode, pushing the current one.
1257 push_lex_mode(Lex::Mode mode
)
1259 this->lex_mode_stack_
.push_back(this->lex_
->mode());
1260 this->lex_
->set_mode(mode
);
1263 // Pop the lexer mode.
1267 gold_assert(!this->lex_mode_stack_
.empty());
1268 this->lex_
->set_mode(this->lex_mode_stack_
.back());
1269 this->lex_mode_stack_
.pop_back();
1272 // Return the current lexer mode.
1275 { return this->lex_mode_stack_
.back(); }
1277 // Return the line number of the last token.
1280 { return this->lineno_
; }
1282 // Return the character position in the line of the last token.
1285 { return this->charpos_
; }
1287 // Return the list of input files, creating it if necessary. This
1288 // is a space leak--we never free the INPUTS_ pointer.
1292 if (this->inputs_
== NULL
)
1293 this->inputs_
= new Input_arguments();
1294 return this->inputs_
;
1297 // Return whether we saw any input files.
1300 { return this->inputs_
!= NULL
&& !this->inputs_
->empty(); }
1302 // Return the current language being processed in a version script
1303 // (eg, "C++"). The empty string represents unmangled C names.
1305 get_current_language() const
1306 { return this->language_stack_
.back(); }
1308 // Push a language onto the stack when entering an extern block.
1309 void push_language(const std::string
& lang
)
1310 { this->language_stack_
.push_back(lang
); }
1312 // Pop a language off of the stack when exiting an extern block.
1315 gold_assert(!this->language_stack_
.empty());
1316 this->language_stack_
.pop_back();
1320 // The name of the file we are reading.
1321 const char* filename_
;
1322 // The position dependent options.
1323 Position_dependent_options posdep_options_
;
1324 // Whether we are currently in a --start-group/--end-group.
1326 // Whether the script was found in a sysrooted directory.
1327 bool is_in_sysroot_
;
1328 // May be NULL if the user chooses not to pass one in.
1329 Command_line
* command_line_
;
1330 // Options which may be set from any linker script.
1331 Script_options
* script_options_
;
1332 // Information parsed from a version script.
1333 Version_script_info
* version_script_info_
;
1336 // The line number of the last token returned by next_token.
1338 // The column number of the last token returned by next_token.
1340 // A stack of lexer modes.
1341 std::vector
<Lex::Mode
> lex_mode_stack_
;
1342 // A stack of which extern/language block we're inside. Can be C++,
1343 // java, or empty for C.
1344 std::vector
<std::string
> language_stack_
;
1345 // New input files found to add to the link.
1346 Input_arguments
* inputs_
;
1349 // FILE was found as an argument on the command line. Try to read it
1350 // as a script. We've already read BYTES of data into P, but we
1351 // ignore that. Return true if the file was handled.
1354 read_input_script(Workqueue
* workqueue
, const General_options
& options
,
1355 Symbol_table
* symtab
, Layout
* layout
,
1356 Dirsearch
* dirsearch
, Input_objects
* input_objects
,
1357 Input_group
* input_group
,
1358 const Input_argument
* input_argument
,
1359 Input_file
* input_file
, const unsigned char*, off_t
,
1360 Task_token
* this_blocker
, Task_token
* next_blocker
)
1362 std::string input_string
;
1363 Lex::read_file(input_file
, &input_string
);
1365 Lex
lex(input_string
.c_str(), input_string
.length(), PARSING_LINKER_SCRIPT
);
1367 Parser_closure
closure(input_file
->filename().c_str(),
1368 input_argument
->file().options(),
1369 input_group
!= NULL
,
1370 input_file
->is_in_sysroot(),
1372 layout
->script_options(),
1375 if (yyparse(&closure
) != 0)
1378 // THIS_BLOCKER must be clear before we may add anything to the
1379 // symbol table. We are responsible for unblocking NEXT_BLOCKER
1380 // when we are done. We are responsible for deleting THIS_BLOCKER
1381 // when it is unblocked.
1383 if (!closure
.saw_inputs())
1385 // The script did not add any files to read. Note that we are
1386 // not permitted to call NEXT_BLOCKER->unblock() here even if
1387 // THIS_BLOCKER is NULL, as we do not hold the workqueue lock.
1388 workqueue
->queue(new Script_unblock(this_blocker
, next_blocker
));
1392 for (Input_arguments::const_iterator p
= closure
.inputs()->begin();
1393 p
!= closure
.inputs()->end();
1397 if (p
+ 1 == closure
.inputs()->end())
1401 nb
= new Task_token(true);
1404 workqueue
->queue(new Read_symbols(options
, input_objects
, symtab
,
1405 layout
, dirsearch
, &*p
,
1406 input_group
, this_blocker
, nb
));
1413 // Helper function for read_version_script() and
1414 // read_commandline_script(). Processes the given file in the mode
1415 // indicated by first_token and lex_mode.
1418 read_script_file(const char* filename
, Command_line
* cmdline
,
1419 int first_token
, Lex::Mode lex_mode
)
1421 // TODO: if filename is a relative filename, search for it manually
1422 // using "." + cmdline->options()->search_path() -- not dirsearch.
1423 Dirsearch dirsearch
;
1425 // The file locking code wants to record a Task, but we haven't
1426 // started the workqueue yet. This is only for debugging purposes,
1427 // so we invent a fake value.
1428 const Task
* task
= reinterpret_cast<const Task
*>(-1);
1430 // We don't want this file to be opened in binary mode.
1431 Position_dependent_options posdep
= cmdline
->position_dependent_options();
1432 if (posdep
.format() == General_options::OBJECT_FORMAT_BINARY
)
1433 posdep
.set_format("elf");
1434 Input_file_argument
input_argument(filename
, false, "", false, posdep
);
1435 Input_file
input_file(&input_argument
);
1436 if (!input_file
.open(cmdline
->options(), dirsearch
, task
))
1439 std::string input_string
;
1440 Lex::read_file(&input_file
, &input_string
);
1442 Lex
lex(input_string
.c_str(), input_string
.length(), first_token
);
1443 lex
.set_mode(lex_mode
);
1445 Parser_closure
closure(filename
,
1446 cmdline
->position_dependent_options(),
1448 input_file
.is_in_sysroot(),
1450 &cmdline
->script_options(),
1452 if (yyparse(&closure
) != 0)
1454 input_file
.file().unlock(task
);
1458 input_file
.file().unlock(task
);
1460 gold_assert(!closure
.saw_inputs());
1465 // FILENAME was found as an argument to --script (-T).
1466 // Read it as a script, and execute its contents immediately.
1469 read_commandline_script(const char* filename
, Command_line
* cmdline
)
1471 return read_script_file(filename
, cmdline
,
1472 PARSING_LINKER_SCRIPT
, Lex::LINKER_SCRIPT
);
1475 // FILE was found as an argument to --version-script. Read it as a
1476 // version script, and store its contents in
1477 // cmdline->script_options()->version_script_info().
1480 read_version_script(const char* filename
, Command_line
* cmdline
)
1482 return read_script_file(filename
, cmdline
,
1483 PARSING_VERSION_SCRIPT
, Lex::VERSION_SCRIPT
);
1486 // Implement the --defsym option on the command line. Return true if
1490 Script_options::define_symbol(const char* definition
)
1492 Lex
lex(definition
, strlen(definition
), PARSING_DEFSYM
);
1493 lex
.set_mode(Lex::EXPRESSION
);
1496 Position_dependent_options posdep_options
;
1498 Parser_closure
closure("command line", posdep_options
, false, false, NULL
,
1501 if (yyparse(&closure
) != 0)
1504 gold_assert(!closure
.saw_inputs());
1509 // Print the script to F for debugging.
1512 Script_options::print(FILE* f
) const
1514 fprintf(f
, "%s: Dumping linker script\n", program_name
);
1516 if (!this->entry_
.empty())
1517 fprintf(f
, "ENTRY(%s)\n", this->entry_
.c_str());
1519 for (Symbol_assignments::const_iterator p
=
1520 this->symbol_assignments_
.begin();
1521 p
!= this->symbol_assignments_
.end();
1525 for (Assertions::const_iterator p
= this->assertions_
.begin();
1526 p
!= this->assertions_
.end();
1530 this->script_sections_
.print(f
);
1532 this->version_script_info_
.print(f
);
1535 // Manage mapping from keywords to the codes expected by the bison
1536 // parser. We construct one global object for each lex mode with
1539 class Keyword_to_parsecode
1542 // The structure which maps keywords to parsecodes.
1543 struct Keyword_parsecode
1546 const char* keyword
;
1547 // Corresponding parsecode.
1551 Keyword_to_parsecode(const Keyword_parsecode
* keywords
,
1553 : keyword_parsecodes_(keywords
), keyword_count_(keyword_count
)
1556 // Return the parsecode corresponding KEYWORD, or 0 if it is not a
1559 keyword_to_parsecode(const char* keyword
, size_t len
) const;
1562 const Keyword_parsecode
* keyword_parsecodes_
;
1563 const int keyword_count_
;
1566 // Mapping from keyword string to keyword parsecode. This array must
1567 // be kept in sorted order. Parsecodes are looked up using bsearch.
1568 // This array must correspond to the list of parsecodes in yyscript.y.
1570 static const Keyword_to_parsecode::Keyword_parsecode
1571 script_keyword_parsecodes
[] =
1573 { "ABSOLUTE", ABSOLUTE
},
1575 { "ALIGN", ALIGN_K
},
1576 { "ALIGNOF", ALIGNOF
},
1577 { "ASSERT", ASSERT_K
},
1578 { "AS_NEEDED", AS_NEEDED
},
1583 { "CONSTANT", CONSTANT
},
1584 { "CONSTRUCTORS", CONSTRUCTORS
},
1585 { "CREATE_OBJECT_SYMBOLS", CREATE_OBJECT_SYMBOLS
},
1586 { "DATA_SEGMENT_ALIGN", DATA_SEGMENT_ALIGN
},
1587 { "DATA_SEGMENT_END", DATA_SEGMENT_END
},
1588 { "DATA_SEGMENT_RELRO_END", DATA_SEGMENT_RELRO_END
},
1589 { "DEFINED", DEFINED
},
1591 { "EXCLUDE_FILE", EXCLUDE_FILE
},
1592 { "EXTERN", EXTERN
},
1595 { "FORCE_COMMON_ALLOCATION", FORCE_COMMON_ALLOCATION
},
1598 { "INCLUDE", INCLUDE
},
1599 { "INHIBIT_COMMON_ALLOCATION", INHIBIT_COMMON_ALLOCATION
},
1602 { "LENGTH", LENGTH
},
1603 { "LOADADDR", LOADADDR
},
1607 { "MEMORY", MEMORY
},
1610 { "NOCROSSREFS", NOCROSSREFS
},
1611 { "NOFLOAT", NOFLOAT
},
1612 { "ONLY_IF_RO", ONLY_IF_RO
},
1613 { "ONLY_IF_RW", ONLY_IF_RW
},
1614 { "OPTION", OPTION
},
1615 { "ORIGIN", ORIGIN
},
1616 { "OUTPUT", OUTPUT
},
1617 { "OUTPUT_ARCH", OUTPUT_ARCH
},
1618 { "OUTPUT_FORMAT", OUTPUT_FORMAT
},
1619 { "OVERLAY", OVERLAY
},
1621 { "PROVIDE", PROVIDE
},
1622 { "PROVIDE_HIDDEN", PROVIDE_HIDDEN
},
1624 { "SEARCH_DIR", SEARCH_DIR
},
1625 { "SECTIONS", SECTIONS
},
1626 { "SEGMENT_START", SEGMENT_START
},
1628 { "SIZEOF", SIZEOF
},
1629 { "SIZEOF_HEADERS", SIZEOF_HEADERS
},
1630 { "SORT", SORT_BY_NAME
},
1631 { "SORT_BY_ALIGNMENT", SORT_BY_ALIGNMENT
},
1632 { "SORT_BY_NAME", SORT_BY_NAME
},
1633 { "SPECIAL", SPECIAL
},
1635 { "STARTUP", STARTUP
},
1636 { "SUBALIGN", SUBALIGN
},
1637 { "SYSLIB", SYSLIB
},
1638 { "TARGET", TARGET_K
},
1639 { "TRUNCATE", TRUNCATE
},
1640 { "VERSION", VERSIONK
},
1641 { "global", GLOBAL
},
1647 { "sizeof_headers", SIZEOF_HEADERS
},
1650 static const Keyword_to_parsecode
1651 script_keywords(&script_keyword_parsecodes
[0],
1652 (sizeof(script_keyword_parsecodes
)
1653 / sizeof(script_keyword_parsecodes
[0])));
1655 static const Keyword_to_parsecode::Keyword_parsecode
1656 version_script_keyword_parsecodes
[] =
1658 { "extern", EXTERN
},
1659 { "global", GLOBAL
},
1663 static const Keyword_to_parsecode
1664 version_script_keywords(&version_script_keyword_parsecodes
[0],
1665 (sizeof(version_script_keyword_parsecodes
)
1666 / sizeof(version_script_keyword_parsecodes
[0])));
1668 // Comparison function passed to bsearch.
1680 ktt_compare(const void* keyv
, const void* kttv
)
1682 const Ktt_key
* key
= static_cast<const Ktt_key
*>(keyv
);
1683 const Keyword_to_parsecode::Keyword_parsecode
* ktt
=
1684 static_cast<const Keyword_to_parsecode::Keyword_parsecode
*>(kttv
);
1685 int i
= strncmp(key
->str
, ktt
->keyword
, key
->len
);
1688 if (ktt
->keyword
[key
->len
] != '\0')
1693 } // End extern "C".
1696 Keyword_to_parsecode::keyword_to_parsecode(const char* keyword
,
1702 void* kttv
= bsearch(&key
,
1703 this->keyword_parsecodes_
,
1704 this->keyword_count_
,
1705 sizeof(this->keyword_parsecodes_
[0]),
1709 Keyword_parsecode
* ktt
= static_cast<Keyword_parsecode
*>(kttv
);
1710 return ktt
->parsecode
;
1713 // The following structs are used within the VersionInfo class as well
1714 // as in the bison helper functions. They store the information
1715 // parsed from the version script.
1717 // A single version expression.
1718 // For example, pattern="std::map*" and language="C++".
1719 // pattern and language should be from the stringpool
1720 struct Version_expression
{
1721 Version_expression(const std::string
& pattern
,
1722 const std::string
& language
,
1724 : pattern(pattern
), language(language
), exact_match(exact_match
) {}
1726 std::string pattern
;
1727 std::string language
;
1728 // If false, we use glob() to match pattern. If true, we use strcmp().
1733 // A list of expressions.
1734 struct Version_expression_list
{
1735 std::vector
<struct Version_expression
> expressions
;
1739 // A list of which versions upon which another version depends.
1740 // Strings should be from the Stringpool.
1741 struct Version_dependency_list
{
1742 std::vector
<std::string
> dependencies
;
1746 // The total definition of a version. It includes the tag for the
1747 // version, its global and local expressions, and any dependencies.
1748 struct Version_tree
{
1750 : tag(), global(NULL
), local(NULL
), dependencies(NULL
) {}
1753 const struct Version_expression_list
* global
;
1754 const struct Version_expression_list
* local
;
1755 const struct Version_dependency_list
* dependencies
;
1758 Version_script_info::~Version_script_info()
1764 Version_script_info::clear()
1766 for (size_t k
= 0; k
< dependency_lists_
.size(); ++k
)
1767 delete dependency_lists_
[k
];
1768 this->dependency_lists_
.clear();
1769 for (size_t k
= 0; k
< version_trees_
.size(); ++k
)
1770 delete version_trees_
[k
];
1771 this->version_trees_
.clear();
1772 for (size_t k
= 0; k
< expression_lists_
.size(); ++k
)
1773 delete expression_lists_
[k
];
1774 this->expression_lists_
.clear();
1777 std::vector
<std::string
>
1778 Version_script_info::get_versions() const
1780 std::vector
<std::string
> ret
;
1781 for (size_t j
= 0; j
< version_trees_
.size(); ++j
)
1782 ret
.push_back(version_trees_
[j
]->tag
);
1786 std::vector
<std::string
>
1787 Version_script_info::get_dependencies(const char* version
) const
1789 std::vector
<std::string
> ret
;
1790 for (size_t j
= 0; j
< version_trees_
.size(); ++j
)
1791 if (version_trees_
[j
]->tag
== version
)
1793 const struct Version_dependency_list
* deps
=
1794 version_trees_
[j
]->dependencies
;
1796 for (size_t k
= 0; k
< deps
->dependencies
.size(); ++k
)
1797 ret
.push_back(deps
->dependencies
[k
]);
1804 Version_script_info::get_symbol_version_helper(const char* symbol_name
,
1805 bool check_global
) const
1807 for (size_t j
= 0; j
< version_trees_
.size(); ++j
)
1809 // Is it a global symbol for this version?
1810 const Version_expression_list
* explist
=
1811 check_global
? version_trees_
[j
]->global
: version_trees_
[j
]->local
;
1812 if (explist
!= NULL
)
1813 for (size_t k
= 0; k
< explist
->expressions
.size(); ++k
)
1815 const char* name_to_match
= symbol_name
;
1816 const struct Version_expression
& exp
= explist
->expressions
[k
];
1817 char* demangled_name
= NULL
;
1818 if (exp
.language
== "C++")
1820 demangled_name
= cplus_demangle(symbol_name
,
1821 DMGL_ANSI
| DMGL_PARAMS
);
1822 // This isn't a C++ symbol.
1823 if (demangled_name
== NULL
)
1825 name_to_match
= demangled_name
;
1827 else if (exp
.language
== "Java")
1829 demangled_name
= cplus_demangle(symbol_name
,
1830 (DMGL_ANSI
| DMGL_PARAMS
1832 // This isn't a Java symbol.
1833 if (demangled_name
== NULL
)
1835 name_to_match
= demangled_name
;
1838 if (exp
.exact_match
)
1839 matched
= strcmp(exp
.pattern
.c_str(), name_to_match
) == 0;
1841 matched
= fnmatch(exp
.pattern
.c_str(), name_to_match
,
1843 if (demangled_name
!= NULL
)
1844 free(demangled_name
);
1846 return version_trees_
[j
]->tag
;
1849 static const std::string empty
= "";
1853 struct Version_dependency_list
*
1854 Version_script_info::allocate_dependency_list()
1856 dependency_lists_
.push_back(new Version_dependency_list
);
1857 return dependency_lists_
.back();
1860 struct Version_expression_list
*
1861 Version_script_info::allocate_expression_list()
1863 expression_lists_
.push_back(new Version_expression_list
);
1864 return expression_lists_
.back();
1867 struct Version_tree
*
1868 Version_script_info::allocate_version_tree()
1870 version_trees_
.push_back(new Version_tree
);
1871 return version_trees_
.back();
1874 // Print for debugging.
1877 Version_script_info::print(FILE* f
) const
1882 fprintf(f
, "VERSION {");
1884 for (size_t i
= 0; i
< this->version_trees_
.size(); ++i
)
1886 const Version_tree
* vt
= this->version_trees_
[i
];
1888 if (vt
->tag
.empty())
1891 fprintf(f
, " %s {\n", vt
->tag
.c_str());
1893 if (vt
->global
!= NULL
)
1895 fprintf(f
, " global :\n");
1896 this->print_expression_list(f
, vt
->global
);
1899 if (vt
->local
!= NULL
)
1901 fprintf(f
, " local :\n");
1902 this->print_expression_list(f
, vt
->local
);
1906 if (vt
->dependencies
!= NULL
)
1908 const Version_dependency_list
* deps
= vt
->dependencies
;
1909 for (size_t j
= 0; j
< deps
->dependencies
.size(); ++j
)
1911 if (j
< deps
->dependencies
.size() - 1)
1913 fprintf(f
, " %s", deps
->dependencies
[j
].c_str());
1923 Version_script_info::print_expression_list(
1925 const Version_expression_list
* vel
) const
1927 std::string current_language
;
1928 for (size_t i
= 0; i
< vel
->expressions
.size(); ++i
)
1930 const Version_expression
& ve(vel
->expressions
[i
]);
1932 if (ve
.language
!= current_language
)
1934 if (!current_language
.empty())
1936 fprintf(f
, " extern \"%s\" {\n", ve
.language
.c_str());
1937 current_language
= ve
.language
;
1941 if (!current_language
.empty())
1946 fprintf(f
, "%s", ve
.pattern
.c_str());
1953 if (!current_language
.empty())
1957 } // End namespace gold.
1959 // The remaining functions are extern "C", so it's clearer to not put
1960 // them in namespace gold.
1962 using namespace gold
;
1964 // This function is called by the bison parser to return the next
1968 yylex(YYSTYPE
* lvalp
, void* closurev
)
1970 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
1971 const Token
* token
= closure
->next_token();
1972 switch (token
->classification())
1977 case Token::TOKEN_INVALID
:
1978 yyerror(closurev
, "invalid character");
1981 case Token::TOKEN_EOF
:
1984 case Token::TOKEN_STRING
:
1986 // This is either a keyword or a STRING.
1988 const char* str
= token
->string_value(&len
);
1990 switch (closure
->lex_mode())
1992 case Lex::LINKER_SCRIPT
:
1993 parsecode
= script_keywords
.keyword_to_parsecode(str
, len
);
1995 case Lex::VERSION_SCRIPT
:
1996 parsecode
= version_script_keywords
.keyword_to_parsecode(str
, len
);
2003 lvalp
->string
.value
= str
;
2004 lvalp
->string
.length
= len
;
2008 case Token::TOKEN_QUOTED_STRING
:
2009 lvalp
->string
.value
= token
->string_value(&lvalp
->string
.length
);
2010 return QUOTED_STRING
;
2012 case Token::TOKEN_OPERATOR
:
2013 return token
->operator_value();
2015 case Token::TOKEN_INTEGER
:
2016 lvalp
->integer
= token
->integer_value();
2021 // This function is called by the bison parser to report an error.
2024 yyerror(void* closurev
, const char* message
)
2026 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2027 gold_error(_("%s:%d:%d: %s"), closure
->filename(), closure
->lineno(),
2028 closure
->charpos(), message
);
2031 // Called by the bison parser to add a file to the link.
2034 script_add_file(void* closurev
, const char* name
, size_t length
)
2036 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2038 // If this is an absolute path, and we found the script in the
2039 // sysroot, then we want to prepend the sysroot to the file name.
2040 // For example, this is how we handle a cross link to the x86_64
2041 // libc.so, which refers to /lib/libc.so.6.
2042 std::string
name_string(name
, length
);
2043 const char* extra_search_path
= ".";
2044 std::string script_directory
;
2045 if (IS_ABSOLUTE_PATH(name_string
.c_str()))
2047 if (closure
->is_in_sysroot())
2049 const std::string
& sysroot(parameters
->options().sysroot());
2050 gold_assert(!sysroot
.empty());
2051 name_string
= sysroot
+ name_string
;
2056 // In addition to checking the normal library search path, we
2057 // also want to check in the script-directory.
2058 const char *slash
= strrchr(closure
->filename(), '/');
2061 script_directory
.assign(closure
->filename(),
2062 slash
- closure
->filename() + 1);
2063 extra_search_path
= script_directory
.c_str();
2067 Input_file_argument
file(name_string
.c_str(), false, extra_search_path
,
2068 false, closure
->position_dependent_options());
2069 closure
->inputs()->add_file(file
);
2072 // Called by the bison parser to start a group. If we are already in
2073 // a group, that means that this script was invoked within a
2074 // --start-group --end-group sequence on the command line, or that
2075 // this script was found in a GROUP of another script. In that case,
2076 // we simply continue the existing group, rather than starting a new
2077 // one. It is possible to construct a case in which this will do
2078 // something other than what would happen if we did a recursive group,
2079 // but it's hard to imagine why the different behaviour would be
2080 // useful for a real program. Avoiding recursive groups is simpler
2081 // and more efficient.
2084 script_start_group(void* closurev
)
2086 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2087 if (!closure
->in_group())
2088 closure
->inputs()->start_group();
2091 // Called by the bison parser at the end of a group.
2094 script_end_group(void* closurev
)
2096 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2097 if (!closure
->in_group())
2098 closure
->inputs()->end_group();
2101 // Called by the bison parser to start an AS_NEEDED list.
2104 script_start_as_needed(void* closurev
)
2106 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2107 closure
->position_dependent_options().set_as_needed(true);
2110 // Called by the bison parser at the end of an AS_NEEDED list.
2113 script_end_as_needed(void* closurev
)
2115 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2116 closure
->position_dependent_options().set_as_needed(false);
2119 // Called by the bison parser to set the entry symbol.
2122 script_set_entry(void* closurev
, const char* entry
, size_t length
)
2124 // We'll parse this exactly the same as --entry=ENTRY on the commandline
2125 // TODO(csilvers): FIXME -- call set_entry directly.
2126 std::string
arg("--entry=");
2127 arg
.append(entry
, length
);
2128 script_parse_option(closurev
, arg
.c_str(), arg
.size());
2131 // Called by the bison parser to define a symbol.
2134 script_set_symbol(void* closurev
, const char* name
, size_t length
,
2135 Expression
* value
, int providei
, int hiddeni
)
2137 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2138 const bool provide
= providei
!= 0;
2139 const bool hidden
= hiddeni
!= 0;
2140 closure
->script_options()->add_symbol_assignment(name
, length
, value
,
2144 // Called by the bison parser to add an assertion.
2147 script_add_assertion(void* closurev
, Expression
* check
, const char* message
,
2150 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2151 closure
->script_options()->add_assertion(check
, message
, messagelen
);
2154 // Called by the bison parser to parse an OPTION.
2157 script_parse_option(void* closurev
, const char* option
, size_t length
)
2159 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2160 // We treat the option as a single command-line option, even if
2161 // it has internal whitespace.
2162 if (closure
->command_line() == NULL
)
2164 // There are some options that we could handle here--e.g.,
2165 // -lLIBRARY. Should we bother?
2166 gold_warning(_("%s:%d:%d: ignoring command OPTION; OPTION is only valid"
2167 " for scripts specified via -T/--script"),
2168 closure
->filename(), closure
->lineno(), closure
->charpos());
2172 bool past_a_double_dash_option
= false;
2173 char* mutable_option
= strndup(option
, length
);
2174 gold_assert(mutable_option
!= NULL
);
2175 closure
->command_line()->process_one_option(1, &mutable_option
, 0,
2176 &past_a_double_dash_option
);
2177 // The General_options class will quite possibly store a pointer
2178 // into mutable_option, so we can't free it. In cases the class
2179 // does not store such a pointer, this is a memory leak. Alas. :(
2183 // Called by the bison parser to handle SEARCH_DIR. This is handled
2184 // exactly like a -L option.
2187 script_add_search_dir(void* closurev
, const char* option
, size_t length
)
2189 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2190 if (closure
->command_line() == NULL
)
2191 gold_warning(_("%s:%d:%d: ignoring SEARCH_DIR; SEARCH_DIR is only valid"
2192 " for scripts specified via -T/--script"),
2193 closure
->filename(), closure
->lineno(), closure
->charpos());
2196 std::string s
= "-L" + std::string(option
, length
);
2197 script_parse_option(closurev
, s
.c_str(), s
.size());
2201 /* Called by the bison parser to push the lexer into expression
2205 script_push_lex_into_expression_mode(void* closurev
)
2207 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2208 closure
->push_lex_mode(Lex::EXPRESSION
);
2211 /* Called by the bison parser to push the lexer into version
2215 script_push_lex_into_version_mode(void* closurev
)
2217 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2218 closure
->push_lex_mode(Lex::VERSION_SCRIPT
);
2221 /* Called by the bison parser to pop the lexer mode. */
2224 script_pop_lex_mode(void* closurev
)
2226 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2227 closure
->pop_lex_mode();
2230 // Register an entire version node. For example:
2236 // - tag is "GLIBC_2.1"
2237 // - tree contains the information "global: foo"
2238 // - deps contains "GLIBC_2.0"
2241 script_register_vers_node(void*,
2244 struct Version_tree
*tree
,
2245 struct Version_dependency_list
*deps
)
2247 gold_assert(tree
!= NULL
);
2248 gold_assert(tag
!= NULL
);
2249 tree
->dependencies
= deps
;
2250 tree
->tag
= std::string(tag
, taglen
);
2253 // Add a dependencies to the list of existing dependencies, if any,
2254 // and return the expanded list.
2256 extern "C" struct Version_dependency_list
*
2257 script_add_vers_depend(void* closurev
,
2258 struct Version_dependency_list
*all_deps
,
2259 const char *depend_to_add
, int deplen
)
2261 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2262 if (all_deps
== NULL
)
2263 all_deps
= closure
->version_script()->allocate_dependency_list();
2264 all_deps
->dependencies
.push_back(std::string(depend_to_add
, deplen
));
2268 // Add a pattern expression to an existing list of expressions, if any.
2269 // TODO: In the old linker, the last argument used to be a bool, but I
2270 // don't know what it meant.
2272 extern "C" struct Version_expression_list
*
2273 script_new_vers_pattern(void* closurev
,
2274 struct Version_expression_list
*expressions
,
2275 const char *pattern
, int patlen
, int exact_match
)
2277 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2278 if (expressions
== NULL
)
2279 expressions
= closure
->version_script()->allocate_expression_list();
2280 expressions
->expressions
.push_back(
2281 Version_expression(std::string(pattern
, patlen
),
2282 closure
->get_current_language(),
2283 static_cast<bool>(exact_match
)));
2287 // Attaches b to the end of a, and clears b. So a = a + b and b = {}.
2289 extern "C" struct Version_expression_list
*
2290 script_merge_expressions(struct Version_expression_list
*a
,
2291 struct Version_expression_list
*b
)
2293 a
->expressions
.insert(a
->expressions
.end(),
2294 b
->expressions
.begin(), b
->expressions
.end());
2295 // We could delete b and remove it from expressions_lists_, but
2296 // that's a lot of work. This works just as well.
2297 b
->expressions
.clear();
2301 // Combine the global and local expressions into a a Version_tree.
2303 extern "C" struct Version_tree
*
2304 script_new_vers_node(void* closurev
,
2305 struct Version_expression_list
*global
,
2306 struct Version_expression_list
*local
)
2308 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2309 Version_tree
* tree
= closure
->version_script()->allocate_version_tree();
2310 tree
->global
= global
;
2311 tree
->local
= local
;
2315 // Handle a transition in language, such as at the
2316 // start or end of 'extern "C++"'
2319 version_script_push_lang(void* closurev
, const char* lang
, int langlen
)
2321 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2322 closure
->push_language(std::string(lang
, langlen
));
2326 version_script_pop_lang(void* closurev
)
2328 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2329 closure
->pop_language();
2332 // Called by the bison parser to start a SECTIONS clause.
2335 script_start_sections(void* closurev
)
2337 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2338 closure
->script_options()->script_sections()->start_sections();
2341 // Called by the bison parser to finish a SECTIONS clause.
2344 script_finish_sections(void* closurev
)
2346 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2347 closure
->script_options()->script_sections()->finish_sections();
2350 // Start processing entries for an output section.
2353 script_start_output_section(void* closurev
, const char* name
, size_t namelen
,
2354 const struct Parser_output_section_header
* header
)
2356 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2357 closure
->script_options()->script_sections()->start_output_section(name
,
2362 // Finish processing entries for an output section.
2365 script_finish_output_section(void* closurev
,
2366 const struct Parser_output_section_trailer
* trail
)
2368 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2369 closure
->script_options()->script_sections()->finish_output_section(trail
);
2372 // Add a data item (e.g., "WORD (0)") to the current output section.
2375 script_add_data(void* closurev
, int data_token
, Expression
* val
)
2377 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2379 bool is_signed
= true;
2401 closure
->script_options()->script_sections()->add_data(size
, is_signed
, val
);
2404 // Add a clause setting the fill value to the current output section.
2407 script_add_fill(void* closurev
, Expression
* val
)
2409 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2410 closure
->script_options()->script_sections()->add_fill(val
);
2413 // Add a new input section specification to the current output
2417 script_add_input_section(void* closurev
,
2418 const struct Input_section_spec
* spec
,
2421 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2422 bool keep
= keepi
!= 0;
2423 closure
->script_options()->script_sections()->add_input_section(spec
, keep
);
2426 // Create a new list of string/sort pairs.
2428 extern "C" String_sort_list_ptr
2429 script_new_string_sort_list(const struct Wildcard_section
* string_sort
)
2431 return new String_sort_list(1, *string_sort
);
2434 // Add an entry to a list of string/sort pairs. The way the parser
2435 // works permits us to simply modify the first parameter, rather than
2438 extern "C" String_sort_list_ptr
2439 script_string_sort_list_add(String_sort_list_ptr pv
,
2440 const struct Wildcard_section
* string_sort
)
2443 return script_new_string_sort_list(string_sort
);
2446 pv
->push_back(*string_sort
);
2451 // Create a new list of strings.
2453 extern "C" String_list_ptr
2454 script_new_string_list(const char* str
, size_t len
)
2456 return new String_list(1, std::string(str
, len
));
2459 // Add an element to a list of strings. The way the parser works
2460 // permits us to simply modify the first parameter, rather than copy
2463 extern "C" String_list_ptr
2464 script_string_list_push_back(String_list_ptr pv
, const char* str
, size_t len
)
2467 return script_new_string_list(str
, len
);
2470 pv
->push_back(std::string(str
, len
));
2475 // Concatenate two string lists. Either or both may be NULL. The way
2476 // the parser works permits us to modify the parameters, rather than
2479 extern "C" String_list_ptr
2480 script_string_list_append(String_list_ptr pv1
, String_list_ptr pv2
)
2486 pv1
->insert(pv1
->end(), pv2
->begin(), pv2
->end());
2490 // Add a new program header.
2493 script_add_phdr(void* closurev
, const char* name
, size_t namelen
,
2494 unsigned int type
, const Phdr_info
* info
)
2496 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2497 bool includes_filehdr
= info
->includes_filehdr
!= 0;
2498 bool includes_phdrs
= info
->includes_phdrs
!= 0;
2499 bool is_flags_valid
= info
->is_flags_valid
!= 0;
2500 Script_sections
* ss
= closure
->script_options()->script_sections();
2501 ss
->add_phdr(name
, namelen
, type
, includes_filehdr
, includes_phdrs
,
2502 is_flags_valid
, info
->flags
, info
->load_address
);
2505 // Convert a program header string to a type.
2507 #define PHDR_TYPE(NAME) { #NAME, sizeof(#NAME) - 1, elfcpp::NAME }
2514 } phdr_type_names
[] =
2518 PHDR_TYPE(PT_DYNAMIC
),
2519 PHDR_TYPE(PT_INTERP
),
2521 PHDR_TYPE(PT_SHLIB
),
2524 PHDR_TYPE(PT_GNU_EH_FRAME
),
2525 PHDR_TYPE(PT_GNU_STACK
),
2526 PHDR_TYPE(PT_GNU_RELRO
)
2529 extern "C" unsigned int
2530 script_phdr_string_to_type(void* closurev
, const char* name
, size_t namelen
)
2532 for (unsigned int i
= 0;
2533 i
< sizeof(phdr_type_names
) / sizeof(phdr_type_names
[0]);
2535 if (namelen
== phdr_type_names
[i
].namelen
2536 && strncmp(name
, phdr_type_names
[i
].name
, namelen
) == 0)
2537 return phdr_type_names
[i
].val
;
2538 yyerror(closurev
, _("unknown PHDR type (try integer)"));
2539 return elfcpp::PT_NULL
;