* ldlex.l (yy_input): Correct error check.
[deliverable/binutils-gdb.git] / ld / ldlex.l
1 %{
2
3 /* Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 2000, 2001, 2002 Free Software Foundation, Inc.
5
6 This file is part of GLD, the Gnu Linker.
7
8 GLD 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 2, or (at your option)
11 any later version.
12
13 GLD 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.
17
18 You should have received a copy of the GNU General Public License
19 along with GLD; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
21 02111-1307, USA. */
22
23 /*
24 This was written by steve chamberlain
25 sac@cygnus.com
26 */
27
28
29 #include <ansidecl.h>
30 #include <stdio.h>
31
32 #ifdef MPW
33 /* Prevent enum redefinition problems. */
34 #define TRUE_FALSE_ALREADY_DEFINED
35 #endif /* MPW */
36
37 #include "bfd.h"
38 #include "sysdep.h"
39 #include "safe-ctype.h"
40 #include "ld.h"
41 #include "ldgram.h"
42 #include "ldmisc.h"
43 #include "ldexp.h"
44 #include "ldlang.h"
45 #include "ldfile.h"
46 #include "ldlex.h"
47 #include "ldmain.h"
48 #include "libiberty.h"
49
50 /* The type of top-level parser input.
51 yylex and yyparse (indirectly) both check this. */
52 input_type parser_input;
53
54 /* Line number in the current input file.
55 (FIXME Actually, it doesn't appear to get reset for each file?) */
56 unsigned int lineno = 1;
57
58 /* The string we are currently lexing, or NULL if we are reading a
59 file. */
60 const char *lex_string = NULL;
61
62 /* Support for flex reading from more than one input file (stream).
63 `include_stack' is flex's input state for each open file;
64 `file_name_stack' is the file names. `lineno_stack' is the current
65 line numbers.
66
67 If `include_stack_ptr' is 0, we haven't started reading anything yet.
68 Otherwise, stack elements 0 through `include_stack_ptr - 1' are valid. */
69
70 #undef YY_INPUT
71 #define YY_INPUT(buf,result,max_size) yy_input(buf, &result, max_size)
72
73 #define MAX_INCLUDE_DEPTH 10
74 static YY_BUFFER_STATE include_stack[MAX_INCLUDE_DEPTH];
75 static const char *file_name_stack[MAX_INCLUDE_DEPTH];
76 static unsigned int lineno_stack[MAX_INCLUDE_DEPTH];
77 static unsigned int include_stack_ptr = 0;
78 static int vers_node_nesting = 0;
79
80 static YY_BUFFER_STATE yy_create_string_buffer PARAMS ((const char *string,
81 size_t size));
82 static void yy_input PARAMS ((char *, int *result, int max_size));
83
84 static void comment PARAMS ((void));
85 static void lex_warn_invalid PARAMS ((char *where, char *what));
86
87 /* STATES
88 EXPRESSION definitely in an expression
89 SCRIPT definitely in a script
90 BOTH either EXPRESSION or SCRIPT
91 DEFSYMEXP in an argument to -defsym
92 MRI in an MRI script
93 VERS_START starting a Sun style mapfile
94 VERS_SCRIPT a Sun style mapfile
95 VERS_NODE a node within a Sun style mapfile
96 */
97 #define RTOKEN(x) { yylval.token = x; return x; }
98
99 /* Some versions of flex want this. */
100 #ifndef yywrap
101 int yywrap () { return 1; }
102 #endif
103 %}
104
105 %a 4000
106 %o 5000
107
108 CMDFILENAMECHAR [_a-zA-Z0-9\/\.\\_\+\$\:\[\]\\\,\=\&\!\<\>\-\~]
109 CMDFILENAMECHAR1 [_a-zA-Z0-9\/\.\\_\+\$\:\[\]\\\,\=\&\!\<\>\~]
110 FILENAMECHAR1 [_a-zA-Z\/\.\\\$\_\~]
111 SYMBOLCHARN [_a-zA-Z\/\.\\\$\_\~0-9]
112 FILENAMECHAR [_a-zA-Z0-9\/\.\-\_\+\=\$\:\[\]\\\,\~]
113 WILDCHAR [_a-zA-Z0-9\/\.\-\_\+\=\$\:\[\]\\\,\~\?\*]
114 WHITE [ \t\n\r]+
115
116 NOCFILENAMECHAR [_a-zA-Z0-9\/\.\-\_\+\$\:\[\]\\\~]
117
118 V_TAG [.$_a-zA-Z][._a-zA-Z0-9]*
119 V_IDENTIFIER [*?.$_a-zA-Z]([*?.$_a-zA-Z0-9]|::)*
120
121 %s SCRIPT
122 %s EXPRESSION
123 %s BOTH
124 %s DEFSYMEXP
125 %s MRI
126 %s VERS_START
127 %s VERS_SCRIPT
128 %s VERS_NODE
129 %%
130
131 if (parser_input != input_selected)
132 {
133 /* The first token of the input determines the initial parser state. */
134 input_type t = parser_input;
135 parser_input = input_selected;
136 switch (t)
137 {
138 case input_script: return INPUT_SCRIPT; break;
139 case input_mri_script: return INPUT_MRI_SCRIPT; break;
140 case input_version_script: return INPUT_VERSION_SCRIPT; break;
141 case input_defsym: return INPUT_DEFSYM; break;
142 default: abort ();
143 }
144 }
145
146 <BOTH,SCRIPT,EXPRESSION>"/*" { comment(); }
147
148
149 <DEFSYMEXP>"-" { RTOKEN('-');}
150 <DEFSYMEXP>"+" { RTOKEN('+');}
151 <DEFSYMEXP>{FILENAMECHAR1}{SYMBOLCHARN}* { yylval.name = xstrdup(yytext); return NAME; }
152 <DEFSYMEXP>"=" { RTOKEN('='); }
153
154 <MRI,EXPRESSION>"$"([0-9A-Fa-f])+ {
155 yylval.integer = bfd_scan_vma (yytext+1, 0,16);
156 return INT;
157 }
158
159 <MRI,EXPRESSION>([0-9A-Fa-f])+(H|h|X|x|B|b|O|o|D|d) {
160 int ibase ;
161 switch (yytext[yyleng-1]) {
162 case 'X':
163 case 'x':
164 case 'H':
165 case 'h':
166 ibase = 16;
167 break;
168 case 'O':
169 case 'o':
170 ibase = 8;
171 break;
172 case 'B':
173 case 'b':
174 ibase = 2;
175 break;
176 default:
177 ibase = 10;
178 }
179 yylval.integer = bfd_scan_vma (yytext, 0,
180 ibase);
181 return INT;
182 }
183 <SCRIPT,DEFSYMEXP,MRI,BOTH,EXPRESSION>((("$"|"0x")([0-9A-Fa-f])+)|(([0-9])+))(M|K|m|k)? {
184 char *s = yytext;
185
186 if (*s == '$')
187 ++s;
188 yylval.integer = bfd_scan_vma (s, 0, 0);
189 if (yytext[yyleng-1] == 'M'
190 || yytext[yyleng-1] == 'm')
191 yylval.integer *= 1024 * 1024;
192 if (yytext[yyleng-1] == 'K'
193 || yytext[yyleng-1]=='k')
194 yylval.integer *= 1024;
195 return INT;
196 }
197 <BOTH,SCRIPT,EXPRESSION,MRI>"]" { RTOKEN(']');}
198 <BOTH,SCRIPT,EXPRESSION,MRI>"[" { RTOKEN('[');}
199 <BOTH,SCRIPT,EXPRESSION,MRI>"<<=" { RTOKEN(LSHIFTEQ);}
200 <BOTH,SCRIPT,EXPRESSION,MRI>">>=" { RTOKEN(RSHIFTEQ);}
201 <BOTH,SCRIPT,EXPRESSION,MRI>"||" { RTOKEN(OROR);}
202 <BOTH,SCRIPT,EXPRESSION,MRI>"==" { RTOKEN(EQ);}
203 <BOTH,SCRIPT,EXPRESSION,MRI>"!=" { RTOKEN(NE);}
204 <BOTH,SCRIPT,EXPRESSION,MRI>">=" { RTOKEN(GE);}
205 <BOTH,SCRIPT,EXPRESSION,MRI>"<=" { RTOKEN(LE);}
206 <BOTH,SCRIPT,EXPRESSION,MRI>"<<" { RTOKEN(LSHIFT);}
207 <BOTH,SCRIPT,EXPRESSION,MRI>">>" { RTOKEN(RSHIFT);}
208 <BOTH,SCRIPT,EXPRESSION,MRI>"+=" { RTOKEN(PLUSEQ);}
209 <BOTH,SCRIPT,EXPRESSION,MRI>"-=" { RTOKEN(MINUSEQ);}
210 <BOTH,SCRIPT,EXPRESSION,MRI>"*=" { RTOKEN(MULTEQ);}
211 <BOTH,SCRIPT,EXPRESSION,MRI>"/=" { RTOKEN(DIVEQ);}
212 <BOTH,SCRIPT,EXPRESSION,MRI>"&=" { RTOKEN(ANDEQ);}
213 <BOTH,SCRIPT,EXPRESSION,MRI>"|=" { RTOKEN(OREQ);}
214 <BOTH,SCRIPT,EXPRESSION,MRI>"&&" { RTOKEN(ANDAND);}
215 <BOTH,SCRIPT,EXPRESSION,MRI>">" { RTOKEN('>');}
216 <BOTH,SCRIPT,EXPRESSION,MRI>"," { RTOKEN(',');}
217 <BOTH,SCRIPT,EXPRESSION,MRI>"&" { RTOKEN('&');}
218 <BOTH,SCRIPT,EXPRESSION,MRI>"|" { RTOKEN('|');}
219 <BOTH,SCRIPT,EXPRESSION,MRI>"~" { RTOKEN('~');}
220 <BOTH,SCRIPT,EXPRESSION,MRI>"!" { RTOKEN('!');}
221 <BOTH,SCRIPT,EXPRESSION,MRI>"?" { RTOKEN('?');}
222 <BOTH,SCRIPT,EXPRESSION,MRI>"*" { RTOKEN('*');}
223 <BOTH,SCRIPT,EXPRESSION,MRI>"+" { RTOKEN('+');}
224 <BOTH,SCRIPT,EXPRESSION,MRI>"-" { RTOKEN('-');}
225 <BOTH,SCRIPT,EXPRESSION,MRI>"/" { RTOKEN('/');}
226 <BOTH,SCRIPT,EXPRESSION,MRI>"%" { RTOKEN('%');}
227 <BOTH,SCRIPT,EXPRESSION,MRI>"<" { RTOKEN('<');}
228 <BOTH,SCRIPT,EXPRESSION,MRI>"=" { RTOKEN('=');}
229 <BOTH,SCRIPT,EXPRESSION,MRI>"}" { RTOKEN('}') ; }
230 <BOTH,SCRIPT,EXPRESSION,MRI>"{" { RTOKEN('{'); }
231 <BOTH,SCRIPT,EXPRESSION,MRI>")" { RTOKEN(')');}
232 <BOTH,SCRIPT,EXPRESSION,MRI>"(" { RTOKEN('(');}
233 <BOTH,SCRIPT,EXPRESSION,MRI>":" { RTOKEN(':'); }
234 <BOTH,SCRIPT,EXPRESSION,MRI>";" { RTOKEN(';');}
235 <BOTH,SCRIPT>"MEMORY" { RTOKEN(MEMORY);}
236 <BOTH,SCRIPT>"ORIGIN" { RTOKEN(ORIGIN);}
237 <BOTH,SCRIPT>"VERSION" { RTOKEN(VERSIONK);}
238 <EXPRESSION,BOTH,SCRIPT>"BLOCK" { RTOKEN(BLOCK);}
239 <EXPRESSION,BOTH,SCRIPT>"BIND" { RTOKEN(BIND);}
240 <BOTH,SCRIPT>"LENGTH" { RTOKEN(LENGTH);}
241 <EXPRESSION,BOTH,SCRIPT>"ALIGN" { RTOKEN(ALIGN_K);}
242 <EXPRESSION,BOTH,SCRIPT>"ADDR" { RTOKEN(ADDR);}
243 <EXPRESSION,BOTH,SCRIPT>"LOADADDR" { RTOKEN(LOADADDR);}
244 <EXPRESSION,BOTH>"MAX" { RTOKEN(MAX_K); }
245 <EXPRESSION,BOTH>"MIN" { RTOKEN(MIN_K); }
246 <EXPRESSION,BOTH>"ASSERT" { RTOKEN(ASSERT_K); }
247 <BOTH,SCRIPT>"ENTRY" { RTOKEN(ENTRY);}
248 <BOTH,SCRIPT,MRI>"EXTERN" { RTOKEN(EXTERN);}
249 <EXPRESSION,BOTH,SCRIPT>"NEXT" { RTOKEN(NEXT);}
250 <EXPRESSION,BOTH,SCRIPT>"sizeof_headers" { RTOKEN(SIZEOF_HEADERS);}
251 <EXPRESSION,BOTH,SCRIPT>"SIZEOF_HEADERS" { RTOKEN(SIZEOF_HEADERS);}
252 <BOTH,SCRIPT>"MAP" { RTOKEN(MAP);}
253 <EXPRESSION,BOTH,SCRIPT>"SIZEOF" { RTOKEN(SIZEOF);}
254 <BOTH,SCRIPT>"TARGET" { RTOKEN(TARGET_K);}
255 <BOTH,SCRIPT>"SEARCH_DIR" { RTOKEN(SEARCH_DIR);}
256 <BOTH,SCRIPT>"OUTPUT" { RTOKEN(OUTPUT);}
257 <BOTH,SCRIPT>"INPUT" { RTOKEN(INPUT);}
258 <EXPRESSION,BOTH,SCRIPT>"GROUP" { RTOKEN(GROUP);}
259 <EXPRESSION,BOTH,SCRIPT>"DEFINED" { RTOKEN(DEFINED);}
260 <BOTH,SCRIPT>"CREATE_OBJECT_SYMBOLS" { RTOKEN(CREATE_OBJECT_SYMBOLS);}
261 <BOTH,SCRIPT>"CONSTRUCTORS" { RTOKEN( CONSTRUCTORS);}
262 <BOTH,SCRIPT>"FORCE_COMMON_ALLOCATION" { RTOKEN(FORCE_COMMON_ALLOCATION);}
263 <BOTH,SCRIPT>"INHIBIT_COMMON_ALLOCATION" { RTOKEN(INHIBIT_COMMON_ALLOCATION);}
264 <BOTH,SCRIPT>"SECTIONS" { RTOKEN(SECTIONS);}
265 <BOTH,SCRIPT>"FILL" { RTOKEN(FILL);}
266 <BOTH,SCRIPT>"STARTUP" { RTOKEN(STARTUP);}
267 <BOTH,SCRIPT>"OUTPUT_FORMAT" { RTOKEN(OUTPUT_FORMAT);}
268 <BOTH,SCRIPT>"OUTPUT_ARCH" { RTOKEN( OUTPUT_ARCH);}
269 <BOTH,SCRIPT>"HLL" { RTOKEN(HLL);}
270 <BOTH,SCRIPT>"SYSLIB" { RTOKEN(SYSLIB);}
271 <BOTH,SCRIPT>"FLOAT" { RTOKEN(FLOAT);}
272 <BOTH,SCRIPT>"QUAD" { RTOKEN( QUAD);}
273 <BOTH,SCRIPT>"SQUAD" { RTOKEN( SQUAD);}
274 <BOTH,SCRIPT>"LONG" { RTOKEN( LONG);}
275 <BOTH,SCRIPT>"SHORT" { RTOKEN( SHORT);}
276 <BOTH,SCRIPT>"BYTE" { RTOKEN( BYTE);}
277 <BOTH,SCRIPT>"NOFLOAT" { RTOKEN(NOFLOAT);}
278 <EXPRESSION,BOTH,SCRIPT>"NOCROSSREFS" { RTOKEN(NOCROSSREFS);}
279 <BOTH,SCRIPT>"OVERLAY" { RTOKEN(OVERLAY); }
280 <BOTH,SCRIPT>"SORT" { RTOKEN(SORT); }
281 <EXPRESSION,BOTH,SCRIPT>"NOLOAD" { RTOKEN(NOLOAD);}
282 <EXPRESSION,BOTH,SCRIPT>"DSECT" { RTOKEN(DSECT);}
283 <EXPRESSION,BOTH,SCRIPT>"COPY" { RTOKEN(COPY);}
284 <EXPRESSION,BOTH,SCRIPT>"INFO" { RTOKEN(INFO);}
285 <EXPRESSION,BOTH,SCRIPT>"OVERLAY" { RTOKEN(OVERLAY);}
286 <BOTH,SCRIPT>"o" { RTOKEN(ORIGIN);}
287 <BOTH,SCRIPT>"org" { RTOKEN(ORIGIN);}
288 <BOTH,SCRIPT>"l" { RTOKEN( LENGTH);}
289 <BOTH,SCRIPT>"len" { RTOKEN( LENGTH);}
290 <BOTH,SCRIPT>"INCLUDE" { RTOKEN(INCLUDE);}
291 <BOTH,SCRIPT>"PHDRS" { RTOKEN (PHDRS); }
292 <EXPRESSION,BOTH,SCRIPT>"AT" { RTOKEN(AT);}
293 <EXPRESSION,BOTH,SCRIPT>"PROVIDE" { RTOKEN(PROVIDE); }
294 <EXPRESSION,BOTH,SCRIPT>"KEEP" { RTOKEN(KEEP); }
295 <EXPRESSION,BOTH,SCRIPT>"EXCLUDE_FILE" { RTOKEN(EXCLUDE_FILE); }
296 <MRI>"#".*\n? { ++ lineno; }
297 <MRI>"\n" { ++ lineno; RTOKEN(NEWLINE); }
298 <MRI>"*".* { /* Mri comment line */ }
299 <MRI>";".* { /* Mri comment line */ }
300 <MRI>"END" { RTOKEN(ENDWORD); }
301 <MRI>"ALIGNMOD" { RTOKEN(ALIGNMOD);}
302 <MRI>"ALIGN" { RTOKEN(ALIGN_K);}
303 <MRI>"CHIP" { RTOKEN(CHIP); }
304 <MRI>"BASE" { RTOKEN(BASE); }
305 <MRI>"ALIAS" { RTOKEN(ALIAS); }
306 <MRI>"TRUNCATE" { RTOKEN(TRUNCATE); }
307 <MRI>"LOAD" { RTOKEN(LOAD); }
308 <MRI>"PUBLIC" { RTOKEN(PUBLIC); }
309 <MRI>"ORDER" { RTOKEN(ORDER); }
310 <MRI>"NAME" { RTOKEN(NAMEWORD); }
311 <MRI>"FORMAT" { RTOKEN(FORMAT); }
312 <MRI>"CASE" { RTOKEN(CASE); }
313 <MRI>"START" { RTOKEN(START); }
314 <MRI>"LIST".* { RTOKEN(LIST); /* LIST and ignore to end of line */ }
315 <MRI>"SECT" { RTOKEN(SECT); }
316 <EXPRESSION,BOTH,SCRIPT,MRI>"ABSOLUTE" { RTOKEN(ABSOLUTE); }
317 <MRI>"end" { RTOKEN(ENDWORD); }
318 <MRI>"alignmod" { RTOKEN(ALIGNMOD);}
319 <MRI>"align" { RTOKEN(ALIGN_K);}
320 <MRI>"chip" { RTOKEN(CHIP); }
321 <MRI>"base" { RTOKEN(BASE); }
322 <MRI>"alias" { RTOKEN(ALIAS); }
323 <MRI>"truncate" { RTOKEN(TRUNCATE); }
324 <MRI>"load" { RTOKEN(LOAD); }
325 <MRI>"public" { RTOKEN(PUBLIC); }
326 <MRI>"order" { RTOKEN(ORDER); }
327 <MRI>"name" { RTOKEN(NAMEWORD); }
328 <MRI>"format" { RTOKEN(FORMAT); }
329 <MRI>"case" { RTOKEN(CASE); }
330 <MRI>"extern" { RTOKEN(EXTERN); }
331 <MRI>"start" { RTOKEN(START); }
332 <MRI>"list".* { RTOKEN(LIST); /* LIST and ignore to end of line */ }
333 <MRI>"sect" { RTOKEN(SECT); }
334 <EXPRESSION,BOTH,SCRIPT,MRI>"absolute" { RTOKEN(ABSOLUTE); }
335
336 <MRI>{FILENAMECHAR1}{NOCFILENAMECHAR}* {
337 /* Filename without commas, needed to parse mri stuff */
338 yylval.name = xstrdup(yytext);
339 return NAME;
340 }
341
342
343 <BOTH,EXPRESSION>{FILENAMECHAR1}{FILENAMECHAR}* {
344 yylval.name = xstrdup(yytext);
345 return NAME;
346 }
347 <BOTH,EXPRESSION>"-l"{FILENAMECHAR}+ {
348 yylval.name = xstrdup (yytext + 2);
349 return LNAME;
350 }
351 <SCRIPT>{WILDCHAR}* {
352 /* Annoyingly, this pattern can match comments, and we have
353 longest match issues to consider. So if the first two
354 characters are a comment opening, put the input back and
355 try again. */
356 if (yytext[0] == '/' && yytext[1] == '*')
357 {
358 yyless(2);
359 comment ();
360 }
361 else
362 {
363 yylval.name = xstrdup(yytext);
364 return NAME;
365 }
366 }
367
368 <EXPRESSION,BOTH,SCRIPT,VERS_NODE>"\""[^\"]*"\"" {
369 /* No matter the state, quotes
370 give what's inside */
371 yylval.name = xstrdup(yytext+1);
372 yylval.name[yyleng-2] = 0;
373 return NAME;
374 }
375 <BOTH,SCRIPT,EXPRESSION>"\n" { lineno++;}
376 <MRI,BOTH,SCRIPT,EXPRESSION>[ \t\r]+ { }
377
378 <VERS_NODE,VERS_SCRIPT>[:,;] { return *yytext; }
379
380 <VERS_NODE>global { RTOKEN(GLOBAL); }
381
382 <VERS_NODE>local { RTOKEN(LOCAL); }
383
384 <VERS_NODE>extern { RTOKEN(EXTERN); }
385
386 <VERS_NODE>{V_IDENTIFIER} { yylval.name = xstrdup (yytext);
387 return VERS_IDENTIFIER; }
388
389 <VERS_SCRIPT>{V_TAG} { yylval.name = xstrdup (yytext);
390 return VERS_TAG; }
391
392 <VERS_START>"{" { BEGIN(VERS_SCRIPT); return *yytext; }
393
394 <VERS_SCRIPT>"{" { BEGIN(VERS_NODE);
395 vers_node_nesting = 0;
396 return *yytext;
397 }
398 <VERS_SCRIPT>"}" { return *yytext; }
399 <VERS_NODE>"{" { vers_node_nesting++; return *yytext; }
400 <VERS_NODE>"}" { if (--vers_node_nesting < 0)
401 BEGIN(VERS_SCRIPT);
402 return *yytext;
403 }
404
405 <VERS_START,VERS_NODE,VERS_SCRIPT>[\n] { lineno++; }
406
407 <VERS_START,VERS_NODE,VERS_SCRIPT>#.* { /* Eat up comments */ }
408
409 <VERS_START,VERS_NODE,VERS_SCRIPT>[ \t\r]+ { /* Eat up whitespace */ }
410
411 <<EOF>> {
412 include_stack_ptr--;
413
414 if (include_stack_ptr == 0)
415 {
416 yyterminate();
417 }
418 else
419 {
420 yy_switch_to_buffer(include_stack[include_stack_ptr]);
421 }
422
423 ldfile_input_filename = file_name_stack[include_stack_ptr - 1];
424 lineno = lineno_stack[include_stack_ptr];
425
426 return END;
427 }
428
429 <SCRIPT,MRI,VERS_START,VERS_SCRIPT,VERS_NODE>. lex_warn_invalid(" in script", yytext);
430 <EXPRESSION,DEFSYMEXP,BOTH>. lex_warn_invalid(" in expression", yytext);
431
432 %%
433 \f
434
435 /* Switch flex to reading script file NAME, open on FILE,
436 saving the current input info on the include stack. */
437
438 void
439 lex_push_file (file, name)
440 FILE *file;
441 const char *name;
442 {
443 if (include_stack_ptr >= MAX_INCLUDE_DEPTH)
444 {
445 einfo("%F:includes nested too deeply\n");
446 }
447 file_name_stack[include_stack_ptr] = name;
448 lineno_stack[include_stack_ptr] = lineno;
449 include_stack[include_stack_ptr] = YY_CURRENT_BUFFER;
450
451 include_stack_ptr++;
452 lineno = 1;
453 yyin = file;
454 yy_switch_to_buffer(yy_create_buffer(yyin, YY_BUF_SIZE));
455 }
456
457 /* Return a newly created flex input buffer containing STRING,
458 which is SIZE bytes long. */
459
460 static YY_BUFFER_STATE
461 yy_create_string_buffer (string, size)
462 CONST char *string;
463 size_t size;
464 {
465 YY_BUFFER_STATE b;
466
467 /* Calls to m-alloc get turned by sed into xm-alloc. */
468 b = (YY_BUFFER_STATE) malloc (sizeof (struct yy_buffer_state));
469 b->yy_input_file = 0;
470 b->yy_buf_size = size;
471
472 /* yy_ch_buf has to be 2 characters longer than the size given because
473 we need to put in 2 end-of-buffer characters. */
474 b->yy_ch_buf = (char *) malloc ((unsigned) (b->yy_buf_size + 3));
475
476 b->yy_ch_buf[0] = '\n';
477 strcpy (b->yy_ch_buf+1, string);
478 b->yy_ch_buf[size+1] = YY_END_OF_BUFFER_CHAR;
479 b->yy_ch_buf[size+2] = YY_END_OF_BUFFER_CHAR;
480 b->yy_n_chars = size+1;
481 b->yy_buf_pos = &b->yy_ch_buf[1];
482
483 b->yy_is_our_buffer = 1;
484 b->yy_is_interactive = 0;
485 b->yy_at_bol = 1;
486 b->yy_fill_buffer = 0;
487
488 /* flex 2.4.7 changed the interface. FIXME: We should not be using
489 a flex internal interface in the first place! */
490 #ifdef YY_BUFFER_NEW
491 b->yy_buffer_status = YY_BUFFER_NEW;
492 #else
493 b->yy_eof_status = EOF_NOT_SEEN;
494 #endif
495
496 return b;
497 }
498
499 /* Switch flex to reading from STRING, saving the current input info
500 on the include stack. */
501
502 void
503 lex_redirect (string)
504 CONST char *string;
505 {
506 YY_BUFFER_STATE tmp;
507
508 yy_init = 0;
509 if (include_stack_ptr >= MAX_INCLUDE_DEPTH)
510 {
511 einfo("%F: macros nested too deeply\n");
512 }
513 file_name_stack[include_stack_ptr] = "redirect";
514 lineno_stack[include_stack_ptr] = lineno;
515 include_stack[include_stack_ptr] = YY_CURRENT_BUFFER;
516 include_stack_ptr++;
517 lineno = 1;
518 tmp = yy_create_string_buffer (string, strlen (string));
519 yy_switch_to_buffer (tmp);
520 }
521 \f
522 /* Functions to switch to a different flex start condition,
523 saving the current start condition on `state_stack'. */
524
525 static int state_stack[MAX_INCLUDE_DEPTH * 2];
526 static int *state_stack_p = state_stack;
527
528 void
529 ldlex_script ()
530 {
531 *(state_stack_p)++ = yy_start;
532 BEGIN (SCRIPT);
533 }
534
535 void
536 ldlex_mri_script ()
537 {
538 *(state_stack_p)++ = yy_start;
539 BEGIN (MRI);
540 }
541
542 void
543 ldlex_version_script ()
544 {
545 *(state_stack_p)++ = yy_start;
546 BEGIN (VERS_START);
547 }
548
549 void
550 ldlex_version_file ()
551 {
552 *(state_stack_p)++ = yy_start;
553 BEGIN (VERS_SCRIPT);
554 }
555
556 void
557 ldlex_defsym ()
558 {
559 *(state_stack_p)++ = yy_start;
560 BEGIN (DEFSYMEXP);
561 }
562
563 void
564 ldlex_expression ()
565 {
566 *(state_stack_p)++ = yy_start;
567 BEGIN (EXPRESSION);
568 }
569
570 void
571 ldlex_both ()
572 {
573 *(state_stack_p)++ = yy_start;
574 BEGIN (BOTH);
575 }
576
577 void
578 ldlex_popstate ()
579 {
580 yy_start = *(--state_stack_p);
581 }
582 \f
583
584 /* Place up to MAX_SIZE characters in BUF and return in *RESULT
585 either the number of characters read, or 0 to indicate EOF. */
586
587 static void
588 yy_input (buf, result, max_size)
589 char *buf;
590 int *result;
591 int max_size;
592 {
593 *result = 0;
594 if (yy_current_buffer->yy_input_file)
595 {
596 if (yyin)
597 {
598 *result = fread ((char *) buf, 1, max_size, yyin);
599 if (*result < max_size && ferror (yyin))
600 einfo ("%F%P: read in flex scanner failed\n");
601 }
602 }
603 }
604
605 /* Eat the rest of a C-style comment. */
606
607 static void
608 comment ()
609 {
610 int c;
611
612 while (1)
613 {
614 c = input();
615 while (c != '*' && c != EOF)
616 {
617 if (c == '\n')
618 lineno++;
619 c = input();
620 }
621
622 if (c == '*')
623 {
624 c = input();
625 while (c == '*')
626 c = input();
627 if (c == '/')
628 break; /* found the end */
629 }
630
631 if (c == '\n')
632 lineno++;
633
634 if (c == EOF)
635 {
636 einfo( "%F%P: EOF in comment\n");
637 break;
638 }
639 }
640 }
641
642 /* Warn the user about a garbage character WHAT in the input
643 in context WHERE. */
644
645 static void
646 lex_warn_invalid (where, what)
647 char *where, *what;
648 {
649 char buf[5];
650
651 /* If we have found an input file whose format we do not recognize,
652 and we are therefore treating it as a linker script, and we find
653 an invalid character, then most likely this is a real object file
654 of some different format. Treat it as such. */
655 if (ldfile_assumed_script)
656 {
657 bfd_set_error (bfd_error_file_not_recognized);
658 einfo ("%F%s: file not recognized: %E\n", ldfile_input_filename);
659 }
660
661 if (! ISPRINT (*what))
662 {
663 sprintf (buf, "\\%03o", (unsigned int) *what);
664 what = buf;
665 }
666
667 einfo ("%P:%S: ignoring invalid character `%s'%s\n", what, where);
668 }
This page took 0.047625 seconds and 5 git commands to generate.