1 // script.cc -- handle linker scripts for gold.
3 // Copyright 2006, 2007 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.
29 #include "filenames.h"
31 #include "dirsearch.h"
34 #include "workqueue.h"
36 #include "parameters.h"
44 // A token read from a script file. We don't implement keywords here;
45 // all keywords are simply represented as a string.
50 // Token classification.
55 // Token indicates end of input.
57 // Token is a string of characters.
59 // Token is an operator.
61 // Token is a number (an integer).
65 // We need an empty constructor so that we can put this STL objects.
67 : classification_(TOKEN_INVALID), value_(), opcode_(0),
68 lineno_(0), charpos_(0)
71 // A general token with no value.
72 Token(Classification classification, int lineno, int charpos)
73 : classification_(classification), value_(), opcode_(0),
74 lineno_(lineno), charpos_(charpos)
76 gold_assert(classification == TOKEN_INVALID
77 || classification == TOKEN_EOF);
80 // A general token with a value.
81 Token(Classification classification, const std::string& value,
82 int lineno, int charpos)
83 : classification_(classification), value_(value), opcode_(0),
84 lineno_(lineno), charpos_(charpos)
86 gold_assert(classification != TOKEN_INVALID
87 && classification != TOKEN_EOF);
90 // A token representing a string of characters.
91 Token(const std::string& s, int lineno, int charpos)
92 : classification_(TOKEN_STRING), value_(s), opcode_(0),
93 lineno_(lineno), charpos_(charpos)
96 // A token representing an operator.
97 Token(int opcode, int lineno, int charpos)
98 : classification_(TOKEN_OPERATOR), value_(), opcode_(opcode),
99 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.
132 gold_assert(this->classification_ == TOKEN_STRING);
137 operator_value() const
139 gold_assert(this->classification_ == TOKEN_OPERATOR);
140 return this->opcode_;
144 integer_value() const
146 gold_assert(this->classification_ == TOKEN_INTEGER);
147 return strtoll(this->value_.c_str(), NULL, 0);
151 // The token classification.
152 Classification classification_;
153 // The token value, for TOKEN_STRING or TOKEN_INTEGER.
155 // The token value, for TOKEN_OPERATOR.
157 // The line number where this token started (one based).
159 // The character position within the line where this token started
164 // This class handles lexing a file into a sequence of tokens. We
165 // don't expect linker scripts to be large, so we just read them and
166 // tokenize them all at once.
171 Lex(Input_file* input_file)
172 : input_file_(input_file), tokens_()
175 // Tokenize the file. Return the final token, which will be either
176 // an invalid token or an EOF token. An invalid token indicates
177 // that tokenization failed.
182 typedef std::vector<Token> Token_sequence;
184 // Return the tokens.
185 const Token_sequence&
187 { return this->tokens_; }
191 Lex& operator=(const Lex&);
193 // Read the file into a string buffer.
195 read_file(std::string*);
197 // Make a general token with no value at the current location.
199 make_token(Token::Classification c, const char* p) const
200 { return Token(c, this->lineno_, p - this->linestart_ + 1); }
202 // Make a general token with a value at the current location.
204 make_token(Token::Classification c, const std::string& v, const char* p)
206 { return Token(c, v, this->lineno_, p - this->linestart_ + 1); }
208 // Make an operator token at the current location.
210 make_token(int opcode, const char* p) const
211 { return Token(opcode, this->lineno_, p - this->linestart_ + 1); }
213 // Make an invalid token at the current location.
215 make_invalid_token(const char* p)
216 { return this->make_token(Token::TOKEN_INVALID, p); }
218 // Make an EOF token at the current location.
220 make_eof_token(const char* p)
221 { return this->make_token(Token::TOKEN_EOF, p); }
223 // Return whether C can be the first character in a name. C2 is the
224 // next character, since we sometimes need that.
226 can_start_name(char c, char c2);
228 // Return whether C can appear in a name which has already started.
230 can_continue_name(char c);
232 // Return whether C, C2, C3 can start a hex number.
234 can_start_hex(char c, char c2, char c3);
236 // Return whether C can appear in a hex number.
238 can_continue_hex(char c);
240 // Return whether C can start a non-hex number.
242 can_start_number(char c);
244 // Return whether C can appear in a non-hex number.
246 can_continue_number(char c)
247 { return Lex::can_start_number(c); }
249 // If C1 C2 C3 form a valid three character operator, return the
250 // opcode. Otherwise return 0.
252 three_char_operator(char c1, char c2, char c3);
254 // If C1 C2 form a valid two character operator, return the opcode.
255 // Otherwise return 0.
257 two_char_operator(char c1, char c2);
259 // If C1 is a valid one character operator, return the opcode.
260 // Otherwise return 0.
262 one_char_operator(char c1);
264 // Read the next token.
266 get_token(const char**);
268 // Skip a C style /* */ comment. Return false if the comment did
271 skip_c_comment(const char**);
273 // Skip a line # comment. Return false if there was no newline.
275 skip_line_comment(const char**);
277 // Build a token CLASSIFICATION from all characters that match
278 // CAN_CONTINUE_FN. The token starts at START. Start matching from
279 // MATCH. Set *PP to the character following the token.
281 gather_token(Token::Classification, bool (*can_continue_fn)(char),
282 const char* start, const char* match, const char** pp);
284 // Build a token from a quoted string.
286 gather_quoted_string(const char** pp);
288 // The file we are reading.
289 Input_file* input_file_;
290 // The token sequence we create.
291 Token_sequence tokens_;
292 // The current line number.
294 // The start of the current line in the buffer.
295 const char* linestart_;
298 // Read the whole file into memory. We don't expect linker scripts to
299 // be large, so we just use a std::string as a buffer. We ignore the
300 // data we've already read, so that we read aligned buffers.
303 Lex::read_file(std::string* contents)
305 off_t filesize = this->input_file_->file().filesize();
307 contents->reserve(filesize);
310 unsigned char buf[BUFSIZ];
311 while (off < filesize)
314 if (get > filesize - off)
315 get = filesize - off;
316 this->input_file_->file().read(off, get, buf);
317 contents->append(reinterpret_cast<char*>(&buf[0]), get);
322 // Return whether C can be the start of a name, if the next character
323 // is C2. A name can being with a letter, underscore, period, or
324 // dollar sign. Because a name can be a file name, we also permit
325 // forward slash, backslash, and tilde. Tilde is the tricky case
326 // here; GNU ld also uses it as a bitwise not operator. It is only
327 // recognized as the operator if it is not immediately followed by
328 // some character which can appear in a symbol. That is, "~0" is a
329 // symbol name, and "~ 0" is an expression using bitwise not. We are
333 Lex::can_start_name(char c, char c2)
337 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
338 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
339 case 'M': case 'N': case 'O': case 'Q': case 'P': case 'R':
340 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
342 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
343 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
344 case 'm': case 'n': case 'o': case 'q': case 'p': case 'r':
345 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
347 case '_': case '.': case '$': case '/': case '\\':
351 return can_continue_name(c2);
358 // Return whether C can continue a name which has already started.
359 // Subsequent characters in a name are the same as the leading
360 // characters, plus digits and "=+-:[],?*". So in general the linker
361 // script language requires spaces around operators.
364 Lex::can_continue_name(char c)
368 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
369 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
370 case 'M': case 'N': case 'O': case 'Q': case 'P': case 'R':
371 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
373 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
374 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
375 case 'm': case 'n': case 'o': case 'q': case 'p': case 'r':
376 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
378 case '_': case '.': case '$': case '/': case '\\':
380 case '0': case '1': case '2': case '3': case '4':
381 case '5': case '6': case '7': case '8': case '9':
382 case '=': case '+': case '-': case ':': case '[': case ']':
383 case ',': case '?': case '*':
391 // For a number we accept 0x followed by hex digits, or any sequence
392 // of digits. The old linker accepts leading '$' for hex, and
393 // trailing HXBOD. Those are for MRI compatibility and we don't
394 // accept them. The old linker also accepts trailing MK for mega or
395 // kilo. Those are mentioned in the documentation, and we accept
398 // Return whether C1 C2 C3 can start a hex number.
401 Lex::can_start_hex(char c1, char c2, char c3)
403 if (c1 == '0' && (c2 == 'x' || c2 == 'X'))
404 return Lex::can_continue_hex(c3);
408 // Return whether C can appear in a hex number.
411 Lex::can_continue_hex(char c)
415 case '0': case '1': case '2': case '3': case '4':
416 case '5': case '6': case '7': case '8': case '9':
417 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
418 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
426 // Return whether C can start a non-hex number.
429 Lex::can_start_number(char c)
433 case '0': case '1': case '2': case '3': case '4':
434 case '5': case '6': case '7': case '8': case '9':
442 // If C1 C2 C3 form a valid three character operator, return the
443 // opcode (defined in the yyscript.h file generated from yyscript.y).
444 // Otherwise return 0.
447 Lex::three_char_operator(char c1, char c2, char c3)
452 if (c2 == '<' && c3 == '=')
456 if (c2 == '>' && c3 == '=')
465 // If C1 C2 form a valid two character operator, return the opcode
466 // (defined in the yyscript.h file generated from yyscript.y).
467 // Otherwise return 0.
470 Lex::two_char_operator(char c1, char c2)
528 // If C1 is a valid operator, return the opcode. Otherwise return 0.
531 Lex::one_char_operator(char c1)
564 // Skip a C style comment. *PP points to just after the "/*". Return
565 // false if the comment did not end.
568 Lex::skip_c_comment(const char** pp)
571 while (p[0] != '*' || p[1] != '/')
582 this->linestart_ = p + 1;
591 // Skip a line # comment. Return false if there was no newline.
594 Lex::skip_line_comment(const char** pp)
597 size_t skip = strcspn(p, "\n");
606 this->linestart_ = p;
612 // Build a token CLASSIFICATION from all characters that match
613 // CAN_CONTINUE_FN. Update *PP.
616 Lex::gather_token(Token::Classification classification,
617 bool (*can_continue_fn)(char),
622 while ((*can_continue_fn)(*match))
625 return this->make_token(classification,
626 std::string(start, match - start),
630 // Build a token from a quoted string.
633 Lex::gather_quoted_string(const char** pp)
635 const char* start = *pp;
636 const char* p = start;
638 size_t skip = strcspn(p, "\"\n");
640 return this->make_invalid_token(start);
642 return this->make_token(Token::TOKEN_STRING,
643 std::string(p, skip),
647 // Return the next token at *PP. Update *PP. General guideline: we
648 // require linker scripts to be simple ASCII. No unicode linker
649 // scripts. In particular we can assume that any '\0' is the end of
653 Lex::get_token(const char** pp)
662 return this->make_eof_token(p);
665 // Skip whitespace quickly.
666 while (*p == ' ' || *p == '\t')
673 this->linestart_ = p;
677 // Skip C style comments.
678 if (p[0] == '/' && p[1] == '*')
680 int lineno = this->lineno_;
681 int charpos = p - this->linestart_ + 1;
684 if (!this->skip_c_comment(pp))
685 return Token(Token::TOKEN_INVALID, lineno, charpos);
691 // Skip line comments.
695 if (!this->skip_line_comment(pp))
696 return this->make_eof_token(p);
702 if (Lex::can_start_name(p[0], p[1]))
703 return this->gather_token(Token::TOKEN_STRING,
704 Lex::can_continue_name,
707 // We accept any arbitrary name in double quotes, as long as it
708 // does not cross a line boundary.
712 return this->gather_quoted_string(pp);
715 // Check for a number.
717 if (Lex::can_start_hex(p[0], p[1], p[2]))
718 return this->gather_token(Token::TOKEN_INTEGER,
719 Lex::can_continue_hex,
722 if (Lex::can_start_number(p[0]))
723 return this->gather_token(Token::TOKEN_INTEGER,
724 Lex::can_continue_number,
727 // Check for operators.
729 int opcode = Lex::three_char_operator(p[0], p[1], p[2]);
733 return this->make_token(opcode, p);
736 opcode = Lex::two_char_operator(p[0], p[1]);
740 return this->make_token(opcode, p);
743 opcode = Lex::one_char_operator(p[0]);
747 return this->make_token(opcode, p);
750 return this->make_token(Token::TOKEN_INVALID, p);
754 // Tokenize the file. Return the final token.
759 std::string contents;
760 this->read_file(&contents);
762 const char* p = contents.c_str();
765 this->linestart_ = p;
769 Token t(this->get_token(&p));
771 // Don't let an early null byte fool us into thinking that we've
772 // reached the end of the file.
774 && static_cast<size_t>(p - contents.c_str()) < contents.length())
775 t = this->make_invalid_token(p);
777 if (t.is_invalid() || t.is_eof())
780 this->tokens_.push_back(t);
784 // A trivial task which waits for THIS_BLOCKER to be clear and then
785 // clears NEXT_BLOCKER. THIS_BLOCKER may be NULL.
787 class Script_unblock : public Task
790 Script_unblock(Task_token* this_blocker, Task_token* next_blocker)
791 : this_blocker_(this_blocker), next_blocker_(next_blocker)
796 if (this->this_blocker_ != NULL)
797 delete this->this_blocker_;
801 is_runnable(Workqueue*)
803 if (this->this_blocker_ != NULL && this->this_blocker_->is_blocked())
809 locks(Workqueue* workqueue)
811 return new Task_locker_block(*this->next_blocker_, workqueue);
819 Task_token* this_blocker_;
820 Task_token* next_blocker_;
823 // This class holds data passed through the parser to the lexer and to
824 // the parser support functions. This avoids global variables. We
825 // can't use global variables because we need not be called in the
831 Parser_closure(const char* filename,
832 const Position_dependent_options& posdep_options,
833 bool in_group, bool is_in_sysroot,
834 const Lex::Token_sequence* tokens)
835 : filename_(filename), posdep_options_(posdep_options),
836 in_group_(in_group), is_in_sysroot_(is_in_sysroot), tokens_(tokens),
837 next_token_index_(0), inputs_(NULL)
840 // Return the file name.
843 { return this->filename_; }
845 // Return the position dependent options. The caller may modify
847 Position_dependent_options&
848 position_dependent_options()
849 { return this->posdep_options_; }
851 // Return whether this script is being run in a group.
854 { return this->in_group_; }
856 // Return whether this script was found using a directory in the
859 is_in_sysroot() const
860 { return this->is_in_sysroot_; }
862 // Whether we are at the end of the token list.
865 { return this->next_token_index_ >= this->tokens_->size(); }
867 // Return the next token.
871 const Token* ret = &(*this->tokens_)[this->next_token_index_];
872 ++this->next_token_index_;
876 // Return the list of input files, creating it if necessary. This
877 // is a space leak--we never free the INPUTS_ pointer.
881 if (this->inputs_ == NULL)
882 this->inputs_ = new Input_arguments();
883 return this->inputs_;
886 // Return whether we saw any input files.
889 { return this->inputs_ != NULL && !this->inputs_->empty(); }
892 // The name of the file we are reading.
893 const char* filename_;
894 // The position dependent options.
895 Position_dependent_options posdep_options_;
896 // Whether we are currently in a --start-group/--end-group.
898 // Whether the script was found in a sysrooted directory.
901 // The tokens to be returned by the lexer.
902 const Lex::Token_sequence* tokens_;
903 // The index of the next token to return.
904 unsigned int next_token_index_;
905 // New input files found to add to the link.
906 Input_arguments* inputs_;
909 // FILE was found as an argument on the command line. Try to read it
910 // as a script. We've already read BYTES of data into P, but we
911 // ignore that. Return true if the file was handled.
914 read_input_script(Workqueue* workqueue, const General_options& options,
915 Symbol_table* symtab, Layout* layout,
916 const Dirsearch& dirsearch, Input_objects* input_objects,
917 Input_group* input_group,
918 const Input_argument* input_argument,
919 Input_file* input_file, const unsigned char*, off_t,
920 Task_token* this_blocker, Task_token* next_blocker)
923 if (lex.tokenize().is_invalid())
926 Parser_closure closure(input_file->filename().c_str(),
927 input_argument->file().options(),
929 input_file->is_in_sysroot(),
932 if (yyparse(&closure) != 0)
935 // If this routine was called from the main thread rather than a
936 // work queue -- as it is for the --script option -- then our
937 // work here is done.
939 // THIS_BLOCKER must be clear before we may add anything to the
940 // symbol table. We are responsible for unblocking NEXT_BLOCKER
941 // when we are done. We are responsible for deleting THIS_BLOCKER
942 // when it is unblocked.
944 if (!closure.saw_inputs())
946 // The script did not add any files to read. Note that we are
947 // not permitted to call NEXT_BLOCKER->unblock() here even if
948 // THIS_BLOCKER is NULL, as we are not in the main thread.
949 workqueue->queue(new Script_unblock(this_blocker, next_blocker));
953 for (Input_arguments::const_iterator p = closure.inputs()->begin();
954 p != closure.inputs()->end();
958 if (p + 1 == closure.inputs()->end())
962 nb = new Task_token();
965 workqueue->queue(new Read_symbols(options, input_objects, symtab,
966 layout, dirsearch, &*p,
967 input_group, this_blocker, nb));
974 // FILENAME was found as an argument to --script (-T).
975 // Read it as a script, and execute its contents immediately.
978 read_commandline_script(const char* filename, Command_line* cmdline)
980 // We don't need to use the real directory search path here:
981 // FILENAME was specified on the command line, and we don't want to
985 Input_file_argument input_argument(filename, false, "",
986 cmdline->position_dependent_options());
987 Input_file input_file(&input_argument);
988 if (!input_file.open(cmdline->options(), dirsearch))
991 Lex lex(&input_file);
992 if (lex.tokenize().is_invalid())
994 // Opening the file locked it, so now we need to unlock it.
995 input_file.file().unlock();
999 Parser_closure closure(filename,
1000 cmdline->position_dependent_options(),
1002 input_file.is_in_sysroot(),
1004 if (yyparse(&closure) != 0)
1006 input_file.file().unlock();
1010 input_file.file().unlock();
1014 // Manage mapping from keywords to the codes expected by the bison
1017 class Keyword_to_parsecode
1020 // The structure which maps keywords to parsecodes.
1021 struct Keyword_parsecode
1024 const char* keyword;
1025 // Corresponding parsecode.
1029 // Return the parsecode corresponding KEYWORD, or 0 if it is not a
1032 keyword_to_parsecode(const char* keyword);
1035 // The array of all keywords.
1036 static const Keyword_parsecode keyword_parsecodes_[];
1038 // The number of keywords.
1039 static const int keyword_count;
1042 // Mapping from keyword string to keyword parsecode. This array must
1043 // be kept in sorted order. Parsecodes are looked up using bsearch.
1044 // This array must correspond to the list of parsecodes in yyscript.y.
1046 const Keyword_to_parsecode::Keyword_parsecode
1047 Keyword_to_parsecode::keyword_parsecodes_[] =
1049 { "ABSOLUTE", ABSOLUTE },
1051 { "ALIGN", ALIGN_K },
1052 { "ASSERT", ASSERT_K },
1053 { "AS_NEEDED", AS_NEEDED },
1058 { "CONSTANT", CONSTANT },
1059 { "CONSTRUCTORS", CONSTRUCTORS },
1061 { "CREATE_OBJECT_SYMBOLS", CREATE_OBJECT_SYMBOLS },
1062 { "DATA_SEGMENT_ALIGN", DATA_SEGMENT_ALIGN },
1063 { "DATA_SEGMENT_END", DATA_SEGMENT_END },
1064 { "DATA_SEGMENT_RELRO_END", DATA_SEGMENT_RELRO_END },
1065 { "DEFINED", DEFINED },
1068 { "EXCLUDE_FILE", EXCLUDE_FILE },
1069 { "EXTERN", EXTERN },
1072 { "FORCE_COMMON_ALLOCATION", FORCE_COMMON_ALLOCATION },
1075 { "INCLUDE", INCLUDE },
1077 { "INHIBIT_COMMON_ALLOCATION", INHIBIT_COMMON_ALLOCATION },
1080 { "LENGTH", LENGTH },
1081 { "LOADADDR", LOADADDR },
1085 { "MEMORY", MEMORY },
1088 { "NOCROSSREFS", NOCROSSREFS },
1089 { "NOFLOAT", NOFLOAT },
1090 { "NOLOAD", NOLOAD },
1091 { "ONLY_IF_RO", ONLY_IF_RO },
1092 { "ONLY_IF_RW", ONLY_IF_RW },
1093 { "OPTION", OPTION },
1094 { "ORIGIN", ORIGIN },
1095 { "OUTPUT", OUTPUT },
1096 { "OUTPUT_ARCH", OUTPUT_ARCH },
1097 { "OUTPUT_FORMAT", OUTPUT_FORMAT },
1098 { "OVERLAY", OVERLAY },
1100 { "PROVIDE", PROVIDE },
1101 { "PROVIDE_HIDDEN", PROVIDE_HIDDEN },
1103 { "SEARCH_DIR", SEARCH_DIR },
1104 { "SECTIONS", SECTIONS },
1105 { "SEGMENT_START", SEGMENT_START },
1107 { "SIZEOF", SIZEOF },
1108 { "SIZEOF_HEADERS", SIZEOF_HEADERS },
1109 { "SORT_BY_ALIGNMENT", SORT_BY_ALIGNMENT },
1110 { "SORT_BY_NAME", SORT_BY_NAME },
1111 { "SPECIAL", SPECIAL },
1113 { "STARTUP", STARTUP },
1114 { "SUBALIGN", SUBALIGN },
1115 { "SYSLIB", SYSLIB },
1116 { "TARGET", TARGET_K },
1117 { "TRUNCATE", TRUNCATE },
1118 { "VERSION", VERSIONK },
1119 { "global", GLOBAL },
1125 { "sizeof_headers", SIZEOF_HEADERS },
1128 const int Keyword_to_parsecode::keyword_count =
1129 (sizeof(Keyword_to_parsecode::keyword_parsecodes_)
1130 / sizeof(Keyword_to_parsecode::keyword_parsecodes_[0]));
1132 // Comparison function passed to bsearch.
1138 ktt_compare(const void* keyv, const void* kttv)
1140 const char* key = static_cast<const char*>(keyv);
1141 const Keyword_to_parsecode::Keyword_parsecode* ktt =
1142 static_cast<const Keyword_to_parsecode::Keyword_parsecode*>(kttv);
1143 return strcmp(key, ktt->keyword);
1146 } // End extern "C".
1149 Keyword_to_parsecode::keyword_to_parsecode(const char* keyword)
1151 void* kttv = bsearch(keyword,
1152 Keyword_to_parsecode::keyword_parsecodes_,
1153 Keyword_to_parsecode::keyword_count,
1154 sizeof(Keyword_to_parsecode::keyword_parsecodes_[0]),
1158 Keyword_parsecode* ktt = static_cast<Keyword_parsecode*>(kttv);
1159 return ktt->parsecode;
1162 } // End namespace gold.
1164 // The remaining functions are extern "C", so it's clearer to not put
1165 // them in namespace gold.
1167 using namespace gold;
1169 // This function is called by the bison parser to return the next
1173 yylex(YYSTYPE* lvalp, void* closurev)
1175 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
1177 if (closure->at_eof())
1180 const Token* token = closure->next_token();
1182 switch (token->classification())
1185 case Token::TOKEN_INVALID:
1186 case Token::TOKEN_EOF:
1189 case Token::TOKEN_STRING:
1191 const char* str = token->string_value().c_str();
1192 int parsecode = Keyword_to_parsecode::keyword_to_parsecode(str);
1195 lvalp->string = str;
1199 case Token::TOKEN_OPERATOR:
1200 return token->operator_value();
1202 case Token::TOKEN_INTEGER:
1203 lvalp->integer = token->integer_value();
1208 // This function is called by the bison parser to report an error.
1211 yyerror(void* closurev, const char* message)
1213 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
1215 gold_error(_("%s: %s"), closure->filename(), message);
1218 // Called by the bison parser to add a file to the link.
1221 script_add_file(void* closurev, const char* name)
1223 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
1225 // If this is an absolute path, and we found the script in the
1226 // sysroot, then we want to prepend the sysroot to the file name.
1227 // For example, this is how we handle a cross link to the x86_64
1228 // libc.so, which refers to /lib/libc.so.6.
1229 std::string name_string;
1230 const char* extra_search_path = ".";
1231 std::string script_directory;
1232 if (IS_ABSOLUTE_PATH (name))
1234 if (closure->is_in_sysroot())
1236 const std::string& sysroot(parameters->sysroot());
1237 gold_assert(!sysroot.empty());
1238 name_string = sysroot + name;
1239 name = name_string.c_str();
1244 // In addition to checking the normal library search path, we
1245 // also want to check in the script-directory.
1246 const char *slash = strrchr(closure->filename(), '/');
1249 script_directory.assign(closure->filename(),
1250 slash - closure->filename() + 1);
1251 extra_search_path = script_directory.c_str();
1255 Input_file_argument file(name, false, extra_search_path,
1256 closure->position_dependent_options());
1257 closure->inputs()->add_file(file);
1260 // Called by the bison parser to start a group. If we are already in
1261 // a group, that means that this script was invoked within a
1262 // --start-group --end-group sequence on the command line, or that
1263 // this script was found in a GROUP of another script. In that case,
1264 // we simply continue the existing group, rather than starting a new
1265 // one. It is possible to construct a case in which this will do
1266 // something other than what would happen if we did a recursive group,
1267 // but it's hard to imagine why the different behaviour would be
1268 // useful for a real program. Avoiding recursive groups is simpler
1269 // and more efficient.
1272 script_start_group(void* closurev)
1274 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
1275 if (!closure->in_group())
1276 closure->inputs()->start_group();
1279 // Called by the bison parser at the end of a group.
1282 script_end_group(void* closurev)
1284 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
1285 if (!closure->in_group())
1286 closure->inputs()->end_group();
1289 // Called by the bison parser to start an AS_NEEDED list.
1292 script_start_as_needed(void* closurev)
1294 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
1295 closure->position_dependent_options().set_as_needed();
1298 // Called by the bison parser at the end of an AS_NEEDED list.
1301 script_end_as_needed(void* closurev)
1303 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
1304 closure->position_dependent_options().clear_as_needed();
1307 // Called by the bison parser to parse an OPTION.
1310 script_parse_option(void* closurev, const char* option)
1312 Parser_closure* closure = static_cast<Parser_closure*>(closurev);
1313 printf("%s: Saw option %s\n", closure->filename(), option); //!!