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
;
403 // Return whether C can continue a name which has already started.
404 // Subsequent characters in a name are the same as the leading
405 // characters, plus digits and "=+-:[],?*". So in general the linker
406 // script language requires spaces around operators, unless we know
407 // that we are parsing an expression.
410 Lex::can_continue_name(const char* c
)
414 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
415 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
416 case 'M': case 'N': case 'O': case 'Q': case 'P': case 'R':
417 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
419 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
420 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
421 case 'm': case 'n': case 'o': case 'q': case 'p': case 'r':
422 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
424 case '_': case '.': case '$':
425 case '0': case '1': case '2': case '3': case '4':
426 case '5': case '6': case '7': case '8': case '9':
429 case '/': case '\\': case '~':
432 if (this->mode_
== LINKER_SCRIPT
)
436 case '[': case ']': case '*': case '-':
437 if (this->mode_
== LINKER_SCRIPT
|| this->mode_
== VERSION_SCRIPT
)
442 if (this->mode_
== VERSION_SCRIPT
)
447 if (this->mode_
== LINKER_SCRIPT
)
449 else if (this->mode_
== VERSION_SCRIPT
&& (c
[1] == ':'))
451 // A name can have '::' in it, as that's a c++ namespace
452 // separator. But a single colon is not part of a name.
462 // For a number we accept 0x followed by hex digits, or any sequence
463 // of digits. The old linker accepts leading '$' for hex, and
464 // trailing HXBOD. Those are for MRI compatibility and we don't
465 // accept them. The old linker also accepts trailing MK for mega or
466 // kilo. FIXME: Those are mentioned in the documentation, and we
467 // should accept them.
469 // Return whether C1 C2 C3 can start a hex number.
472 Lex::can_start_hex(char c1
, char c2
, char c3
)
474 if (c1
== '0' && (c2
== 'x' || c2
== 'X'))
475 return this->can_continue_hex(&c3
);
479 // Return whether C can appear in a hex number.
482 Lex::can_continue_hex(const char* c
)
486 case '0': case '1': case '2': case '3': case '4':
487 case '5': case '6': case '7': case '8': case '9':
488 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
489 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
497 // Return whether C can start a non-hex number.
500 Lex::can_start_number(char c
)
504 case '0': case '1': case '2': case '3': case '4':
505 case '5': case '6': case '7': case '8': case '9':
513 // If C1 C2 C3 form a valid three character operator, return the
514 // opcode (defined in the yyscript.h file generated from yyscript.y).
515 // Otherwise return 0.
518 Lex::three_char_operator(char c1
, char c2
, char c3
)
523 if (c2
== '<' && c3
== '=')
527 if (c2
== '>' && c3
== '=')
536 // If C1 C2 form a valid two character operator, return the opcode
537 // (defined in the yyscript.h file generated from yyscript.y).
538 // Otherwise return 0.
541 Lex::two_char_operator(char c1
, char c2
)
599 // If C1 is a valid operator, return the opcode. Otherwise return 0.
602 Lex::one_char_operator(char c1
)
635 // Skip a C style comment. *PP points to just after the "/*". Return
636 // false if the comment did not end.
639 Lex::skip_c_comment(const char** pp
)
642 while (p
[0] != '*' || p
[1] != '/')
653 this->linestart_
= p
+ 1;
662 // Skip a line # comment. Return false if there was no newline.
665 Lex::skip_line_comment(const char** pp
)
668 size_t skip
= strcspn(p
, "\n");
677 this->linestart_
= p
;
683 // Build a token CLASSIFICATION from all characters that match
684 // CAN_CONTINUE_FN. Update *PP.
687 Lex::gather_token(Token::Classification classification
,
688 const char* (Lex::*can_continue_fn
)(const char*),
693 const char* new_match
= NULL
;
694 while ((new_match
= (this->*can_continue_fn
)(match
)))
697 return this->make_token(classification
, start
, match
- start
, start
);
700 // Build a token from a quoted string.
703 Lex::gather_quoted_string(const char** pp
)
705 const char* start
= *pp
;
706 const char* p
= start
;
708 size_t skip
= strcspn(p
, "\"\n");
710 return this->make_invalid_token(start
);
712 return this->make_token(Token::TOKEN_QUOTED_STRING
, p
, skip
, start
);
715 // Return the next token at *PP. Update *PP. General guideline: we
716 // require linker scripts to be simple ASCII. No unicode linker
717 // scripts. In particular we can assume that any '\0' is the end of
721 Lex::get_token(const char** pp
)
730 return this->make_eof_token(p
);
733 // Skip whitespace quickly.
734 while (*p
== ' ' || *p
== '\t')
741 this->linestart_
= p
;
745 // Skip C style comments.
746 if (p
[0] == '/' && p
[1] == '*')
748 int lineno
= this->lineno_
;
749 int charpos
= p
- this->linestart_
+ 1;
752 if (!this->skip_c_comment(pp
))
753 return Token(Token::TOKEN_INVALID
, lineno
, charpos
);
759 // Skip line comments.
763 if (!this->skip_line_comment(pp
))
764 return this->make_eof_token(p
);
770 if (this->can_start_name(p
[0], p
[1]))
771 return this->gather_token(Token::TOKEN_STRING
,
772 &Lex::can_continue_name
,
775 // We accept any arbitrary name in double quotes, as long as it
776 // does not cross a line boundary.
780 return this->gather_quoted_string(pp
);
783 // Check for a number.
785 if (this->can_start_hex(p
[0], p
[1], p
[2]))
786 return this->gather_token(Token::TOKEN_INTEGER
,
787 &Lex::can_continue_hex
,
790 if (Lex::can_start_number(p
[0]))
791 return this->gather_token(Token::TOKEN_INTEGER
,
792 &Lex::can_continue_number
,
795 // Check for operators.
797 int opcode
= Lex::three_char_operator(p
[0], p
[1], p
[2]);
801 return this->make_token(opcode
, p
);
804 opcode
= Lex::two_char_operator(p
[0], p
[1]);
808 return this->make_token(opcode
, p
);
811 opcode
= Lex::one_char_operator(p
[0]);
815 return this->make_token(opcode
, p
);
818 return this->make_token(Token::TOKEN_INVALID
, p
);
822 // Return the next token.
827 // The first token is special.
828 if (this->first_token_
!= 0)
830 this->token_
= Token(this->first_token_
, 0, 0);
831 this->first_token_
= 0;
832 return &this->token_
;
835 this->token_
= this->get_token(&this->current_
);
837 // Don't let an early null byte fool us into thinking that we've
838 // reached the end of the file.
839 if (this->token_
.is_eof()
840 && (static_cast<size_t>(this->current_
- this->input_string_
)
841 < this->input_length_
))
842 this->token_
= this->make_invalid_token(this->current_
);
844 return &this->token_
;
847 // A trivial task which waits for THIS_BLOCKER to be clear and then
848 // clears NEXT_BLOCKER. THIS_BLOCKER may be NULL.
850 class Script_unblock
: public Task
853 Script_unblock(Task_token
* this_blocker
, Task_token
* next_blocker
)
854 : this_blocker_(this_blocker
), next_blocker_(next_blocker
)
859 if (this->this_blocker_
!= NULL
)
860 delete this->this_blocker_
;
866 if (this->this_blocker_
!= NULL
&& this->this_blocker_
->is_blocked())
867 return this->this_blocker_
;
872 locks(Task_locker
* tl
)
873 { tl
->add(this, this->next_blocker_
); }
881 { return "Script_unblock"; }
884 Task_token
* this_blocker_
;
885 Task_token
* next_blocker_
;
888 // class Symbol_assignment.
890 // Add the symbol to the symbol table. This makes sure the symbol is
891 // there and defined. The actual value is stored later. We can't
892 // determine the actual value at this point, because we can't
893 // necessarily evaluate the expression until all ordinary symbols have
897 Symbol_assignment::add_to_table(Symbol_table
* symtab
, const Target
* target
)
899 elfcpp::STV vis
= this->hidden_
? elfcpp::STV_HIDDEN
: elfcpp::STV_DEFAULT
;
900 this->sym_
= symtab
->define_as_constant(target
,
912 // Finalize a symbol value.
915 Symbol_assignment::finalize(Symbol_table
* symtab
, const Layout
* layout
)
917 // If we were only supposed to provide this symbol, the sym_ field
918 // will be NULL if the symbol was not referenced.
919 if (this->sym_
== NULL
)
921 gold_assert(this->provide_
);
925 if (parameters
->get_size() == 32)
927 #if defined(HAVE_TARGET_32_LITTLE) || defined(HAVE_TARGET_32_BIG)
928 this->sized_finalize
<32>(symtab
, layout
);
933 else if (parameters
->get_size() == 64)
935 #if defined(HAVE_TARGET_64_LITTLE) || defined(HAVE_TARGET_64_BIG)
936 this->sized_finalize
<64>(symtab
, layout
);
947 Symbol_assignment::sized_finalize(Symbol_table
* symtab
, const Layout
* layout
)
949 Sized_symbol
<size
>* ssym
= symtab
->get_sized_symbol
<size
>(this->sym_
);
950 ssym
->set_value(this->val_
->eval(symtab
, layout
));
953 // Print for debugging.
956 Symbol_assignment::print(FILE* f
) const
958 if (this->provide_
&& this->hidden_
)
959 fprintf(f
, "PROVIDE_HIDDEN(");
960 else if (this->provide_
)
961 fprintf(f
, "PROVIDE(");
962 else if (this->hidden_
)
965 fprintf(f
, "%s = ", this->name_
.c_str());
966 this->val_
->print(f
);
968 if (this->provide_
|| this->hidden_
)
974 // Class Script_assertion.
976 // Check the assertion.
979 Script_assertion::check(const Symbol_table
* symtab
, const Layout
* layout
)
981 if (!this->check_
->eval(symtab
, layout
))
982 gold_error("%s", this->message_
.c_str());
985 // Print for debugging.
988 Script_assertion::print(FILE* f
) const
990 fprintf(f
, "ASSERT(");
991 this->check_
->print(f
);
992 fprintf(f
, ", \"%s\")\n", this->message_
.c_str());
995 // Class Script_options.
997 Script_options::Script_options()
998 : entry_(), symbol_assignments_(), version_script_info_(),
1003 // Add a symbol to be defined.
1006 Script_options::add_symbol_assignment(const char* name
, size_t length
,
1007 Expression
* value
, bool provide
,
1010 if (this->script_sections_
.in_sections_clause())
1011 this->script_sections_
.add_symbol_assignment(name
, length
, value
,
1015 Symbol_assignment
* p
= new Symbol_assignment(name
, length
, value
,
1017 this->symbol_assignments_
.push_back(p
);
1021 // Add an assertion.
1024 Script_options::add_assertion(Expression
* check
, const char* message
,
1027 if (this->script_sections_
.in_sections_clause())
1028 this->script_sections_
.add_assertion(check
, message
, messagelen
);
1031 Script_assertion
* p
= new Script_assertion(check
, message
, messagelen
);
1032 this->assertions_
.push_back(p
);
1036 // Add any symbols we are defining to the symbol table.
1039 Script_options::add_symbols_to_table(Symbol_table
* symtab
,
1040 const Target
* target
)
1042 for (Symbol_assignments::iterator p
= this->symbol_assignments_
.begin();
1043 p
!= this->symbol_assignments_
.end();
1045 (*p
)->add_to_table(symtab
, target
);
1048 // Finalize symbol values.
1051 Script_options::finalize_symbols(Symbol_table
* symtab
, const Layout
* layout
)
1053 for (Symbol_assignments::iterator p
= this->symbol_assignments_
.begin();
1054 p
!= this->symbol_assignments_
.end();
1056 (*p
)->finalize(symtab
, layout
);
1059 // This class holds data passed through the parser to the lexer and to
1060 // the parser support functions. This avoids global variables. We
1061 // can't use global variables because we need not be called by a
1062 // singleton thread.
1064 class Parser_closure
1067 Parser_closure(const char* filename
,
1068 const Position_dependent_options
& posdep_options
,
1069 bool in_group
, bool is_in_sysroot
,
1070 Command_line
* command_line
,
1071 Script_options
* script_options
,
1073 : filename_(filename
), posdep_options_(posdep_options
),
1074 in_group_(in_group
), is_in_sysroot_(is_in_sysroot
),
1075 command_line_(command_line
), script_options_(script_options
),
1076 version_script_info_(script_options
->version_script_info()),
1077 lex_(lex
), lineno_(0), charpos_(0), lex_mode_stack_(), inputs_(NULL
)
1079 // We start out processing C symbols in the default lex mode.
1080 language_stack_
.push_back("");
1081 lex_mode_stack_
.push_back(lex
->mode());
1084 // Return the file name.
1087 { return this->filename_
; }
1089 // Return the position dependent options. The caller may modify
1091 Position_dependent_options
&
1092 position_dependent_options()
1093 { return this->posdep_options_
; }
1095 // Return whether this script is being run in a group.
1098 { return this->in_group_
; }
1100 // Return whether this script was found using a directory in the
1103 is_in_sysroot() const
1104 { return this->is_in_sysroot_
; }
1106 // Returns the Command_line structure passed in at constructor time.
1107 // This value may be NULL. The caller may modify this, which modifies
1108 // the passed-in Command_line object (not a copy).
1111 { return this->command_line_
; }
1113 // Return the options which may be set by a script.
1116 { return this->script_options_
; }
1118 // Return the object in which version script information should be stored.
1119 Version_script_info
*
1121 { return this->version_script_info_
; }
1123 // Return the next token, and advance.
1127 const Token
* token
= this->lex_
->next_token();
1128 this->lineno_
= token
->lineno();
1129 this->charpos_
= token
->charpos();
1133 // Set a new lexer mode, pushing the current one.
1135 push_lex_mode(Lex::Mode mode
)
1137 this->lex_mode_stack_
.push_back(this->lex_
->mode());
1138 this->lex_
->set_mode(mode
);
1141 // Pop the lexer mode.
1145 gold_assert(!this->lex_mode_stack_
.empty());
1146 this->lex_
->set_mode(this->lex_mode_stack_
.back());
1147 this->lex_mode_stack_
.pop_back();
1150 // Return the current lexer mode.
1153 { return this->lex_mode_stack_
.back(); }
1155 // Return the line number of the last token.
1158 { return this->lineno_
; }
1160 // Return the character position in the line of the last token.
1163 { return this->charpos_
; }
1165 // Return the list of input files, creating it if necessary. This
1166 // is a space leak--we never free the INPUTS_ pointer.
1170 if (this->inputs_
== NULL
)
1171 this->inputs_
= new Input_arguments();
1172 return this->inputs_
;
1175 // Return whether we saw any input files.
1178 { return this->inputs_
!= NULL
&& !this->inputs_
->empty(); }
1180 // Return the current language being processed in a version script
1181 // (eg, "C++"). The empty string represents unmangled C names.
1183 get_current_language() const
1184 { return this->language_stack_
.back(); }
1186 // Push a language onto the stack when entering an extern block.
1187 void push_language(const std::string
& lang
)
1188 { this->language_stack_
.push_back(lang
); }
1190 // Pop a language off of the stack when exiting an extern block.
1193 gold_assert(!this->language_stack_
.empty());
1194 this->language_stack_
.pop_back();
1198 // The name of the file we are reading.
1199 const char* filename_
;
1200 // The position dependent options.
1201 Position_dependent_options posdep_options_
;
1202 // Whether we are currently in a --start-group/--end-group.
1204 // Whether the script was found in a sysrooted directory.
1205 bool is_in_sysroot_
;
1206 // May be NULL if the user chooses not to pass one in.
1207 Command_line
* command_line_
;
1208 // Options which may be set from any linker script.
1209 Script_options
* script_options_
;
1210 // Information parsed from a version script.
1211 Version_script_info
* version_script_info_
;
1214 // The line number of the last token returned by next_token.
1216 // The column number of the last token returned by next_token.
1218 // A stack of lexer modes.
1219 std::vector
<Lex::Mode
> lex_mode_stack_
;
1220 // A stack of which extern/language block we're inside. Can be C++,
1221 // java, or empty for C.
1222 std::vector
<std::string
> language_stack_
;
1223 // New input files found to add to the link.
1224 Input_arguments
* inputs_
;
1227 // FILE was found as an argument on the command line. Try to read it
1228 // as a script. We've already read BYTES of data into P, but we
1229 // ignore that. Return true if the file was handled.
1232 read_input_script(Workqueue
* workqueue
, const General_options
& options
,
1233 Symbol_table
* symtab
, Layout
* layout
,
1234 Dirsearch
* dirsearch
, Input_objects
* input_objects
,
1235 Input_group
* input_group
,
1236 const Input_argument
* input_argument
,
1237 Input_file
* input_file
, const unsigned char*, off_t
,
1238 Task_token
* this_blocker
, Task_token
* next_blocker
)
1240 std::string input_string
;
1241 Lex::read_file(input_file
, &input_string
);
1243 Lex
lex(input_string
.c_str(), input_string
.length(), PARSING_LINKER_SCRIPT
);
1245 Parser_closure
closure(input_file
->filename().c_str(),
1246 input_argument
->file().options(),
1247 input_group
!= NULL
,
1248 input_file
->is_in_sysroot(),
1250 layout
->script_options(),
1253 if (yyparse(&closure
) != 0)
1256 // THIS_BLOCKER must be clear before we may add anything to the
1257 // symbol table. We are responsible for unblocking NEXT_BLOCKER
1258 // when we are done. We are responsible for deleting THIS_BLOCKER
1259 // when it is unblocked.
1261 if (!closure
.saw_inputs())
1263 // The script did not add any files to read. Note that we are
1264 // not permitted to call NEXT_BLOCKER->unblock() here even if
1265 // THIS_BLOCKER is NULL, as we do not hold the workqueue lock.
1266 workqueue
->queue(new Script_unblock(this_blocker
, next_blocker
));
1270 for (Input_arguments::const_iterator p
= closure
.inputs()->begin();
1271 p
!= closure
.inputs()->end();
1275 if (p
+ 1 == closure
.inputs()->end())
1279 nb
= new Task_token(true);
1282 workqueue
->queue(new Read_symbols(options
, input_objects
, symtab
,
1283 layout
, dirsearch
, &*p
,
1284 input_group
, this_blocker
, nb
));
1291 // Helper function for read_version_script() and
1292 // read_commandline_script(). Processes the given file in the mode
1293 // indicated by first_token and lex_mode.
1296 read_script_file(const char* filename
, Command_line
* cmdline
,
1297 int first_token
, Lex::Mode lex_mode
)
1299 // TODO: if filename is a relative filename, search for it manually
1300 // using "." + cmdline->options()->search_path() -- not dirsearch.
1301 Dirsearch dirsearch
;
1303 // The file locking code wants to record a Task, but we haven't
1304 // started the workqueue yet. This is only for debugging purposes,
1305 // so we invent a fake value.
1306 const Task
* task
= reinterpret_cast<const Task
*>(-1);
1308 Input_file_argument
input_argument(filename
, false, "",
1309 cmdline
->position_dependent_options());
1310 Input_file
input_file(&input_argument
);
1311 if (!input_file
.open(cmdline
->options(), dirsearch
, task
))
1314 std::string input_string
;
1315 Lex::read_file(&input_file
, &input_string
);
1317 Lex
lex(input_string
.c_str(), input_string
.length(), first_token
);
1318 lex
.set_mode(lex_mode
);
1320 Parser_closure
closure(filename
,
1321 cmdline
->position_dependent_options(),
1323 input_file
.is_in_sysroot(),
1325 cmdline
->script_options(),
1327 if (yyparse(&closure
) != 0)
1329 input_file
.file().unlock(task
);
1333 input_file
.file().unlock(task
);
1335 gold_assert(!closure
.saw_inputs());
1340 // FILENAME was found as an argument to --script (-T).
1341 // Read it as a script, and execute its contents immediately.
1344 read_commandline_script(const char* filename
, Command_line
* cmdline
)
1346 return read_script_file(filename
, cmdline
,
1347 PARSING_LINKER_SCRIPT
, Lex::LINKER_SCRIPT
);
1350 // FILE was found as an argument to --version-script. Read it as a
1351 // version script, and store its contents in
1352 // cmdline->script_options()->version_script_info().
1355 read_version_script(const char* filename
, Command_line
* cmdline
)
1357 return read_script_file(filename
, cmdline
,
1358 PARSING_VERSION_SCRIPT
, Lex::VERSION_SCRIPT
);
1361 // Implement the --defsym option on the command line. Return true if
1365 Script_options::define_symbol(const char* definition
)
1367 Lex
lex(definition
, strlen(definition
), PARSING_DEFSYM
);
1368 lex
.set_mode(Lex::EXPRESSION
);
1371 Position_dependent_options posdep_options
;
1373 Parser_closure
closure("command line", posdep_options
, false, false, NULL
,
1376 if (yyparse(&closure
) != 0)
1379 gold_assert(!closure
.saw_inputs());
1384 // Print the script to F for debugging.
1387 Script_options::print(FILE* f
) const
1389 fprintf(f
, "%s: Dumping linker script\n", program_name
);
1391 if (!this->entry_
.empty())
1392 fprintf(f
, "ENTRY(%s)\n", this->entry_
.c_str());
1394 for (Symbol_assignments::const_iterator p
=
1395 this->symbol_assignments_
.begin();
1396 p
!= this->symbol_assignments_
.end();
1400 for (Assertions::const_iterator p
= this->assertions_
.begin();
1401 p
!= this->assertions_
.end();
1405 this->script_sections_
.print(f
);
1407 this->version_script_info_
.print(f
);
1410 // Manage mapping from keywords to the codes expected by the bison
1411 // parser. We construct one global object for each lex mode with
1414 class Keyword_to_parsecode
1417 // The structure which maps keywords to parsecodes.
1418 struct Keyword_parsecode
1421 const char* keyword
;
1422 // Corresponding parsecode.
1426 Keyword_to_parsecode(const Keyword_parsecode
* keywords
,
1428 : keyword_parsecodes_(keywords
), keyword_count_(keyword_count
)
1431 // Return the parsecode corresponding KEYWORD, or 0 if it is not a
1434 keyword_to_parsecode(const char* keyword
, size_t len
) const;
1437 const Keyword_parsecode
* keyword_parsecodes_
;
1438 const int keyword_count_
;
1441 // Mapping from keyword string to keyword parsecode. This array must
1442 // be kept in sorted order. Parsecodes are looked up using bsearch.
1443 // This array must correspond to the list of parsecodes in yyscript.y.
1445 static const Keyword_to_parsecode::Keyword_parsecode
1446 script_keyword_parsecodes
[] =
1448 { "ABSOLUTE", ABSOLUTE
},
1450 { "ALIGN", ALIGN_K
},
1451 { "ALIGNOF", ALIGNOF
},
1452 { "ASSERT", ASSERT_K
},
1453 { "AS_NEEDED", AS_NEEDED
},
1458 { "CONSTANT", CONSTANT
},
1459 { "CONSTRUCTORS", CONSTRUCTORS
},
1460 { "CREATE_OBJECT_SYMBOLS", CREATE_OBJECT_SYMBOLS
},
1461 { "DATA_SEGMENT_ALIGN", DATA_SEGMENT_ALIGN
},
1462 { "DATA_SEGMENT_END", DATA_SEGMENT_END
},
1463 { "DATA_SEGMENT_RELRO_END", DATA_SEGMENT_RELRO_END
},
1464 { "DEFINED", DEFINED
},
1466 { "EXCLUDE_FILE", EXCLUDE_FILE
},
1467 { "EXTERN", EXTERN
},
1470 { "FORCE_COMMON_ALLOCATION", FORCE_COMMON_ALLOCATION
},
1473 { "INCLUDE", INCLUDE
},
1474 { "INHIBIT_COMMON_ALLOCATION", INHIBIT_COMMON_ALLOCATION
},
1477 { "LENGTH", LENGTH
},
1478 { "LOADADDR", LOADADDR
},
1482 { "MEMORY", MEMORY
},
1485 { "NOCROSSREFS", NOCROSSREFS
},
1486 { "NOFLOAT", NOFLOAT
},
1487 { "ONLY_IF_RO", ONLY_IF_RO
},
1488 { "ONLY_IF_RW", ONLY_IF_RW
},
1489 { "OPTION", OPTION
},
1490 { "ORIGIN", ORIGIN
},
1491 { "OUTPUT", OUTPUT
},
1492 { "OUTPUT_ARCH", OUTPUT_ARCH
},
1493 { "OUTPUT_FORMAT", OUTPUT_FORMAT
},
1494 { "OVERLAY", OVERLAY
},
1496 { "PROVIDE", PROVIDE
},
1497 { "PROVIDE_HIDDEN", PROVIDE_HIDDEN
},
1499 { "SEARCH_DIR", SEARCH_DIR
},
1500 { "SECTIONS", SECTIONS
},
1501 { "SEGMENT_START", SEGMENT_START
},
1503 { "SIZEOF", SIZEOF
},
1504 { "SIZEOF_HEADERS", SIZEOF_HEADERS
},
1505 { "SORT_BY_ALIGNMENT", SORT_BY_ALIGNMENT
},
1506 { "SORT_BY_NAME", SORT_BY_NAME
},
1507 { "SPECIAL", SPECIAL
},
1509 { "STARTUP", STARTUP
},
1510 { "SUBALIGN", SUBALIGN
},
1511 { "SYSLIB", SYSLIB
},
1512 { "TARGET", TARGET_K
},
1513 { "TRUNCATE", TRUNCATE
},
1514 { "VERSION", VERSIONK
},
1515 { "global", GLOBAL
},
1521 { "sizeof_headers", SIZEOF_HEADERS
},
1524 static const Keyword_to_parsecode
1525 script_keywords(&script_keyword_parsecodes
[0],
1526 (sizeof(script_keyword_parsecodes
)
1527 / sizeof(script_keyword_parsecodes
[0])));
1529 static const Keyword_to_parsecode::Keyword_parsecode
1530 version_script_keyword_parsecodes
[] =
1532 { "extern", EXTERN
},
1533 { "global", GLOBAL
},
1537 static const Keyword_to_parsecode
1538 version_script_keywords(&version_script_keyword_parsecodes
[0],
1539 (sizeof(version_script_keyword_parsecodes
)
1540 / sizeof(version_script_keyword_parsecodes
[0])));
1542 // Comparison function passed to bsearch.
1554 ktt_compare(const void* keyv
, const void* kttv
)
1556 const Ktt_key
* key
= static_cast<const Ktt_key
*>(keyv
);
1557 const Keyword_to_parsecode::Keyword_parsecode
* ktt
=
1558 static_cast<const Keyword_to_parsecode::Keyword_parsecode
*>(kttv
);
1559 int i
= strncmp(key
->str
, ktt
->keyword
, key
->len
);
1562 if (ktt
->keyword
[key
->len
] != '\0')
1567 } // End extern "C".
1570 Keyword_to_parsecode::keyword_to_parsecode(const char* keyword
,
1576 void* kttv
= bsearch(&key
,
1577 this->keyword_parsecodes_
,
1578 this->keyword_count_
,
1579 sizeof(this->keyword_parsecodes_
[0]),
1583 Keyword_parsecode
* ktt
= static_cast<Keyword_parsecode
*>(kttv
);
1584 return ktt
->parsecode
;
1587 // The following structs are used within the VersionInfo class as well
1588 // as in the bison helper functions. They store the information
1589 // parsed from the version script.
1591 // A single version expression.
1592 // For example, pattern="std::map*" and language="C++".
1593 // pattern and language should be from the stringpool
1594 struct Version_expression
{
1595 Version_expression(const std::string
& pattern
,
1596 const std::string
& language
,
1598 : pattern(pattern
), language(language
), exact_match(exact_match
) {}
1600 std::string pattern
;
1601 std::string language
;
1602 // If false, we use glob() to match pattern. If true, we use strcmp().
1607 // A list of expressions.
1608 struct Version_expression_list
{
1609 std::vector
<struct Version_expression
> expressions
;
1613 // A list of which versions upon which another version depends.
1614 // Strings should be from the Stringpool.
1615 struct Version_dependency_list
{
1616 std::vector
<std::string
> dependencies
;
1620 // The total definition of a version. It includes the tag for the
1621 // version, its global and local expressions, and any dependencies.
1622 struct Version_tree
{
1624 : tag(), global(NULL
), local(NULL
), dependencies(NULL
) {}
1627 const struct Version_expression_list
* global
;
1628 const struct Version_expression_list
* local
;
1629 const struct Version_dependency_list
* dependencies
;
1632 Version_script_info::~Version_script_info()
1634 for (size_t k
= 0; k
< dependency_lists_
.size(); ++k
)
1635 delete dependency_lists_
[k
];
1636 for (size_t k
= 0; k
< version_trees_
.size(); ++k
)
1637 delete version_trees_
[k
];
1638 for (size_t k
= 0; k
< expression_lists_
.size(); ++k
)
1639 delete expression_lists_
[k
];
1642 std::vector
<std::string
>
1643 Version_script_info::get_versions() const
1645 std::vector
<std::string
> ret
;
1646 for (size_t j
= 0; j
< version_trees_
.size(); ++j
)
1647 ret
.push_back(version_trees_
[j
]->tag
);
1651 std::vector
<std::string
>
1652 Version_script_info::get_dependencies(const char* version
) const
1654 std::vector
<std::string
> ret
;
1655 for (size_t j
= 0; j
< version_trees_
.size(); ++j
)
1656 if (version_trees_
[j
]->tag
== version
)
1658 const struct Version_dependency_list
* deps
=
1659 version_trees_
[j
]->dependencies
;
1661 for (size_t k
= 0; k
< deps
->dependencies
.size(); ++k
)
1662 ret
.push_back(deps
->dependencies
[k
]);
1669 Version_script_info::get_symbol_version_helper(const char* symbol_name
,
1670 bool check_global
) const
1672 for (size_t j
= 0; j
< version_trees_
.size(); ++j
)
1674 // Is it a global symbol for this version?
1675 const Version_expression_list
* explist
=
1676 check_global
? version_trees_
[j
]->global
: version_trees_
[j
]->local
;
1677 if (explist
!= NULL
)
1678 for (size_t k
= 0; k
< explist
->expressions
.size(); ++k
)
1680 const char* name_to_match
= symbol_name
;
1681 const struct Version_expression
& exp
= explist
->expressions
[k
];
1682 char* demangled_name
= NULL
;
1683 if (exp
.language
== "C++")
1685 demangled_name
= cplus_demangle(symbol_name
,
1686 DMGL_ANSI
| DMGL_PARAMS
);
1687 // This isn't a C++ symbol.
1688 if (demangled_name
== NULL
)
1690 name_to_match
= demangled_name
;
1692 else if (exp
.language
== "Java")
1694 demangled_name
= cplus_demangle(symbol_name
,
1695 (DMGL_ANSI
| DMGL_PARAMS
1697 // This isn't a Java symbol.
1698 if (demangled_name
== NULL
)
1700 name_to_match
= demangled_name
;
1703 if (exp
.exact_match
)
1704 matched
= strcmp(exp
.pattern
.c_str(), name_to_match
) == 0;
1706 matched
= fnmatch(exp
.pattern
.c_str(), name_to_match
,
1708 if (demangled_name
!= NULL
)
1709 free(demangled_name
);
1711 return version_trees_
[j
]->tag
;
1714 static const std::string empty
= "";
1718 struct Version_dependency_list
*
1719 Version_script_info::allocate_dependency_list()
1721 dependency_lists_
.push_back(new Version_dependency_list
);
1722 return dependency_lists_
.back();
1725 struct Version_expression_list
*
1726 Version_script_info::allocate_expression_list()
1728 expression_lists_
.push_back(new Version_expression_list
);
1729 return expression_lists_
.back();
1732 struct Version_tree
*
1733 Version_script_info::allocate_version_tree()
1735 version_trees_
.push_back(new Version_tree
);
1736 return version_trees_
.back();
1739 // Print for debugging.
1742 Version_script_info::print(FILE* f
) const
1747 fprintf(f
, "VERSION {");
1749 for (size_t i
= 0; i
< this->version_trees_
.size(); ++i
)
1751 const Version_tree
* vt
= this->version_trees_
[i
];
1753 if (vt
->tag
.empty())
1756 fprintf(f
, " %s {\n", vt
->tag
.c_str());
1758 if (vt
->global
!= NULL
)
1760 fprintf(f
, " global :\n");
1761 this->print_expression_list(f
, vt
->global
);
1764 if (vt
->local
!= NULL
)
1766 fprintf(f
, " local :\n");
1767 this->print_expression_list(f
, vt
->local
);
1771 if (vt
->dependencies
!= NULL
)
1773 const Version_dependency_list
* deps
= vt
->dependencies
;
1774 for (size_t j
= 0; j
< deps
->dependencies
.size(); ++j
)
1776 if (j
< deps
->dependencies
.size() - 1)
1778 fprintf(f
, " %s", deps
->dependencies
[j
].c_str());
1788 Version_script_info::print_expression_list(
1790 const Version_expression_list
* vel
) const
1792 std::string current_language
;
1793 for (size_t i
= 0; i
< vel
->expressions
.size(); ++i
)
1795 const Version_expression
& ve(vel
->expressions
[i
]);
1797 if (ve
.language
!= current_language
)
1799 if (!current_language
.empty())
1801 fprintf(f
, " extern \"%s\" {\n", ve
.language
.c_str());
1802 current_language
= ve
.language
;
1806 if (!current_language
.empty())
1811 fprintf(f
, "%s", ve
.pattern
.c_str());
1818 if (!current_language
.empty())
1822 } // End namespace gold.
1824 // The remaining functions are extern "C", so it's clearer to not put
1825 // them in namespace gold.
1827 using namespace gold
;
1829 // This function is called by the bison parser to return the next
1833 yylex(YYSTYPE
* lvalp
, void* closurev
)
1835 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
1836 const Token
* token
= closure
->next_token();
1837 switch (token
->classification())
1842 case Token::TOKEN_INVALID
:
1843 yyerror(closurev
, "invalid character");
1846 case Token::TOKEN_EOF
:
1849 case Token::TOKEN_STRING
:
1851 // This is either a keyword or a STRING.
1853 const char* str
= token
->string_value(&len
);
1855 switch (closure
->lex_mode())
1857 case Lex::LINKER_SCRIPT
:
1858 parsecode
= script_keywords
.keyword_to_parsecode(str
, len
);
1860 case Lex::VERSION_SCRIPT
:
1861 parsecode
= version_script_keywords
.keyword_to_parsecode(str
, len
);
1868 lvalp
->string
.value
= str
;
1869 lvalp
->string
.length
= len
;
1873 case Token::TOKEN_QUOTED_STRING
:
1874 lvalp
->string
.value
= token
->string_value(&lvalp
->string
.length
);
1875 return QUOTED_STRING
;
1877 case Token::TOKEN_OPERATOR
:
1878 return token
->operator_value();
1880 case Token::TOKEN_INTEGER
:
1881 lvalp
->integer
= token
->integer_value();
1886 // This function is called by the bison parser to report an error.
1889 yyerror(void* closurev
, const char* message
)
1891 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
1892 gold_error(_("%s:%d:%d: %s"), closure
->filename(), closure
->lineno(),
1893 closure
->charpos(), message
);
1896 // Called by the bison parser to add a file to the link.
1899 script_add_file(void* closurev
, const char* name
, size_t length
)
1901 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
1903 // If this is an absolute path, and we found the script in the
1904 // sysroot, then we want to prepend the sysroot to the file name.
1905 // For example, this is how we handle a cross link to the x86_64
1906 // libc.so, which refers to /lib/libc.so.6.
1907 std::string
name_string(name
, length
);
1908 const char* extra_search_path
= ".";
1909 std::string script_directory
;
1910 if (IS_ABSOLUTE_PATH(name_string
.c_str()))
1912 if (closure
->is_in_sysroot())
1914 const std::string
& sysroot(parameters
->sysroot());
1915 gold_assert(!sysroot
.empty());
1916 name_string
= sysroot
+ name_string
;
1921 // In addition to checking the normal library search path, we
1922 // also want to check in the script-directory.
1923 const char *slash
= strrchr(closure
->filename(), '/');
1926 script_directory
.assign(closure
->filename(),
1927 slash
- closure
->filename() + 1);
1928 extra_search_path
= script_directory
.c_str();
1932 Input_file_argument
file(name_string
.c_str(), false, extra_search_path
,
1933 closure
->position_dependent_options());
1934 closure
->inputs()->add_file(file
);
1937 // Called by the bison parser to start a group. If we are already in
1938 // a group, that means that this script was invoked within a
1939 // --start-group --end-group sequence on the command line, or that
1940 // this script was found in a GROUP of another script. In that case,
1941 // we simply continue the existing group, rather than starting a new
1942 // one. It is possible to construct a case in which this will do
1943 // something other than what would happen if we did a recursive group,
1944 // but it's hard to imagine why the different behaviour would be
1945 // useful for a real program. Avoiding recursive groups is simpler
1946 // and more efficient.
1949 script_start_group(void* closurev
)
1951 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
1952 if (!closure
->in_group())
1953 closure
->inputs()->start_group();
1956 // Called by the bison parser at the end of a group.
1959 script_end_group(void* closurev
)
1961 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
1962 if (!closure
->in_group())
1963 closure
->inputs()->end_group();
1966 // Called by the bison parser to start an AS_NEEDED list.
1969 script_start_as_needed(void* closurev
)
1971 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
1972 closure
->position_dependent_options().set_as_needed();
1975 // Called by the bison parser at the end of an AS_NEEDED list.
1978 script_end_as_needed(void* closurev
)
1980 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
1981 closure
->position_dependent_options().clear_as_needed();
1984 // Called by the bison parser to set the entry symbol.
1987 script_set_entry(void* closurev
, const char* entry
, size_t length
)
1989 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
1990 closure
->script_options()->set_entry(entry
, length
);
1993 // Called by the bison parser to define a symbol.
1996 script_set_symbol(void* closurev
, const char* name
, size_t length
,
1997 Expression
* value
, int providei
, int hiddeni
)
1999 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2000 const bool provide
= providei
!= 0;
2001 const bool hidden
= hiddeni
!= 0;
2002 closure
->script_options()->add_symbol_assignment(name
, length
, value
,
2006 // Called by the bison parser to add an assertion.
2009 script_add_assertion(void* closurev
, Expression
* check
, const char* message
,
2012 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2013 closure
->script_options()->add_assertion(check
, message
, messagelen
);
2016 // Called by the bison parser to parse an OPTION.
2019 script_parse_option(void* closurev
, const char* option
, size_t length
)
2021 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2022 // We treat the option as a single command-line option, even if
2023 // it has internal whitespace.
2024 if (closure
->command_line() == NULL
)
2026 // There are some options that we could handle here--e.g.,
2027 // -lLIBRARY. Should we bother?
2028 gold_warning(_("%s:%d:%d: ignoring command OPTION; OPTION is only valid"
2029 " for scripts specified via -T/--script"),
2030 closure
->filename(), closure
->lineno(), closure
->charpos());
2034 bool past_a_double_dash_option
= false;
2035 char* mutable_option
= strndup(option
, length
);
2036 gold_assert(mutable_option
!= NULL
);
2037 closure
->command_line()->process_one_option(1, &mutable_option
, 0,
2038 &past_a_double_dash_option
);
2039 free(mutable_option
);
2043 /* Called by the bison parser to push the lexer into expression
2047 script_push_lex_into_expression_mode(void* closurev
)
2049 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2050 closure
->push_lex_mode(Lex::EXPRESSION
);
2053 /* Called by the bison parser to push the lexer into version
2057 script_push_lex_into_version_mode(void* closurev
)
2059 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2060 closure
->push_lex_mode(Lex::VERSION_SCRIPT
);
2063 /* Called by the bison parser to pop the lexer mode. */
2066 script_pop_lex_mode(void* closurev
)
2068 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2069 closure
->pop_lex_mode();
2072 // Register an entire version node. For example:
2078 // - tag is "GLIBC_2.1"
2079 // - tree contains the information "global: foo"
2080 // - deps contains "GLIBC_2.0"
2083 script_register_vers_node(void*,
2086 struct Version_tree
*tree
,
2087 struct Version_dependency_list
*deps
)
2089 gold_assert(tree
!= NULL
);
2090 gold_assert(tag
!= NULL
);
2091 tree
->dependencies
= deps
;
2092 tree
->tag
= std::string(tag
, taglen
);
2095 // Add a dependencies to the list of existing dependencies, if any,
2096 // and return the expanded list.
2098 extern "C" struct Version_dependency_list
*
2099 script_add_vers_depend(void* closurev
,
2100 struct Version_dependency_list
*all_deps
,
2101 const char *depend_to_add
, int deplen
)
2103 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2104 if (all_deps
== NULL
)
2105 all_deps
= closure
->version_script()->allocate_dependency_list();
2106 all_deps
->dependencies
.push_back(std::string(depend_to_add
, deplen
));
2110 // Add a pattern expression to an existing list of expressions, if any.
2111 // TODO: In the old linker, the last argument used to be a bool, but I
2112 // don't know what it meant.
2114 extern "C" struct Version_expression_list
*
2115 script_new_vers_pattern(void* closurev
,
2116 struct Version_expression_list
*expressions
,
2117 const char *pattern
, int patlen
, int exact_match
)
2119 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2120 if (expressions
== NULL
)
2121 expressions
= closure
->version_script()->allocate_expression_list();
2122 expressions
->expressions
.push_back(
2123 Version_expression(std::string(pattern
, patlen
),
2124 closure
->get_current_language(),
2125 static_cast<bool>(exact_match
)));
2129 // Attaches b to the end of a, and clears b. So a = a + b and b = {}.
2131 extern "C" struct Version_expression_list
*
2132 script_merge_expressions(struct Version_expression_list
*a
,
2133 struct Version_expression_list
*b
)
2135 a
->expressions
.insert(a
->expressions
.end(),
2136 b
->expressions
.begin(), b
->expressions
.end());
2137 // We could delete b and remove it from expressions_lists_, but
2138 // that's a lot of work. This works just as well.
2139 b
->expressions
.clear();
2143 // Combine the global and local expressions into a a Version_tree.
2145 extern "C" struct Version_tree
*
2146 script_new_vers_node(void* closurev
,
2147 struct Version_expression_list
*global
,
2148 struct Version_expression_list
*local
)
2150 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2151 Version_tree
* tree
= closure
->version_script()->allocate_version_tree();
2152 tree
->global
= global
;
2153 tree
->local
= local
;
2157 // Handle a transition in language, such as at the
2158 // start or end of 'extern "C++"'
2161 version_script_push_lang(void* closurev
, const char* lang
, int langlen
)
2163 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2164 closure
->push_language(std::string(lang
, langlen
));
2168 version_script_pop_lang(void* closurev
)
2170 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2171 closure
->pop_language();
2174 // Called by the bison parser to start a SECTIONS clause.
2177 script_start_sections(void* closurev
)
2179 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2180 closure
->script_options()->script_sections()->start_sections();
2183 // Called by the bison parser to finish a SECTIONS clause.
2186 script_finish_sections(void* closurev
)
2188 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2189 closure
->script_options()->script_sections()->finish_sections();
2192 // Start processing entries for an output section.
2195 script_start_output_section(void* closurev
, const char* name
, size_t namelen
,
2196 const struct Parser_output_section_header
* header
)
2198 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2199 closure
->script_options()->script_sections()->start_output_section(name
,
2204 // Finish processing entries for an output section.
2207 script_finish_output_section(void* closurev
,
2208 const struct Parser_output_section_trailer
* trail
)
2210 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2211 closure
->script_options()->script_sections()->finish_output_section(trail
);
2214 // Add a data item (e.g., "WORD (0)") to the current output section.
2217 script_add_data(void* closurev
, int data_token
, Expression
* val
)
2219 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2221 bool is_signed
= true;
2243 closure
->script_options()->script_sections()->add_data(size
, is_signed
, val
);
2246 // Add a clause setting the fill value to the current output section.
2249 script_add_fill(void* closurev
, Expression
* val
)
2251 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2252 closure
->script_options()->script_sections()->add_fill(val
);
2255 // Add a new input section specification to the current output
2259 script_add_input_section(void* closurev
,
2260 const struct Input_section_spec
* spec
,
2263 Parser_closure
* closure
= static_cast<Parser_closure
*>(closurev
);
2264 bool keep
= keepi
!= 0;
2265 closure
->script_options()->script_sections()->add_input_section(spec
, keep
);
2268 // Create a new list of string/sort pairs.
2270 extern "C" String_sort_list_ptr
2271 script_new_string_sort_list(const struct Wildcard_section
* string_sort
)
2273 return new String_sort_list(1, *string_sort
);
2276 // Add an entry to a list of string/sort pairs. The way the parser
2277 // works permits us to simply modify the first parameter, rather than
2280 extern "C" String_sort_list_ptr
2281 script_string_sort_list_add(String_sort_list_ptr pv
,
2282 const struct Wildcard_section
* string_sort
)
2284 pv
->push_back(*string_sort
);
2288 // Create a new list of strings.
2290 extern "C" String_list_ptr
2291 script_new_string_list(const char* str
, size_t len
)
2293 return new String_list(1, std::string(str
, len
));
2296 // Add an element to a list of strings. The way the parser works
2297 // permits us to simply modify the first parameter, rather than copy
2300 extern "C" String_list_ptr
2301 script_string_list_push_back(String_list_ptr pv
, const char* str
, size_t len
)
2303 pv
->push_back(std::string(str
, len
));
2307 // Concatenate two string lists. Either or both may be NULL. The way
2308 // the parser works permits us to modify the parameters, rather than
2311 extern "C" String_list_ptr
2312 script_string_list_append(String_list_ptr pv1
, String_list_ptr pv2
)
2318 pv1
->insert(pv1
->end(), pv2
->begin(), pv2
->end());