re PR c++/69095 (internal compiler error: in dependent_type_p, at cp/pt.c:19399)
[gcc.git] / gcc / cp / lex.c
1 /* Separate lexical analyzer for GNU C++.
2 Copyright (C) 1987-2016 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
4
5 This file is part of GCC.
6
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
11
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
20
21
22 /* This file is the lexical analyzer for GNU C++. */
23
24 #include "config.h"
25 #include "system.h"
26 #include "coretypes.h"
27 #include "cp-tree.h"
28 #include "stringpool.h"
29 #include "c-family/c-pragma.h"
30 #include "c-family/c-objc.h"
31
32 static int interface_strcmp (const char *);
33 static void init_cp_pragma (void);
34
35 static tree parse_strconst_pragma (const char *, int);
36 static void handle_pragma_vtable (cpp_reader *);
37 static void handle_pragma_unit (cpp_reader *);
38 static void handle_pragma_interface (cpp_reader *);
39 static void handle_pragma_implementation (cpp_reader *);
40 static void handle_pragma_java_exceptions (cpp_reader *);
41
42 static void init_operators (void);
43 static void copy_lang_type (tree);
44
45 /* A constraint that can be tested at compile time. */
46 #define CONSTRAINT(name, expr) extern int constraint_##name [(expr) ? 1 : -1]
47
48 /* Functions and data structures for #pragma interface.
49
50 `#pragma implementation' means that the main file being compiled
51 is considered to implement (provide) the classes that appear in
52 its main body. I.e., if this is file "foo.cc", and class `bar'
53 is defined in "foo.cc", then we say that "foo.cc implements bar".
54
55 All main input files "implement" themselves automagically.
56
57 `#pragma interface' means that unless this file (of the form "foo.h"
58 is not presently being included by file "foo.cc", the
59 CLASSTYPE_INTERFACE_ONLY bit gets set. The effect is that none
60 of the vtables nor any of the inline functions defined in foo.h
61 will ever be output.
62
63 There are cases when we want to link files such as "defs.h" and
64 "main.cc". In this case, we give "defs.h" a `#pragma interface',
65 and "main.cc" has `#pragma implementation "defs.h"'. */
66
67 struct impl_files
68 {
69 const char *filename;
70 struct impl_files *next;
71 };
72
73 static struct impl_files *impl_file_chain;
74
75 /* True if we saw "#pragma GCC java_exceptions". */
76 bool pragma_java_exceptions;
77 \f
78 void
79 cxx_finish (void)
80 {
81 c_common_finish ();
82 }
83
84 /* A mapping from tree codes to operator name information. */
85 operator_name_info_t operator_name_info[(int) MAX_TREE_CODES];
86 /* Similar, but for assignment operators. */
87 operator_name_info_t assignment_operator_name_info[(int) MAX_TREE_CODES];
88
89 /* Initialize data structures that keep track of operator names. */
90
91 #define DEF_OPERATOR(NAME, C, M, AR, AP) \
92 CONSTRAINT (C, sizeof "operator " + sizeof NAME <= 256);
93 #include "operators.def"
94 #undef DEF_OPERATOR
95
96 static void
97 init_operators (void)
98 {
99 tree identifier;
100 char buffer[256];
101 struct operator_name_info_t *oni;
102
103 #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \
104 sprintf (buffer, ISALPHA (NAME[0]) ? "operator %s" : "operator%s", NAME); \
105 identifier = get_identifier (buffer); \
106 IDENTIFIER_OPNAME_P (identifier) = 1; \
107 \
108 oni = (ASSN_P \
109 ? &assignment_operator_name_info[(int) CODE] \
110 : &operator_name_info[(int) CODE]); \
111 oni->identifier = identifier; \
112 oni->name = NAME; \
113 oni->mangled_name = MANGLING; \
114 oni->arity = ARITY;
115
116 #include "operators.def"
117 #undef DEF_OPERATOR
118
119 operator_name_info[(int) ERROR_MARK].identifier
120 = get_identifier ("<invalid operator>");
121
122 /* Handle some special cases. These operators are not defined in
123 the language, but can be produced internally. We may need them
124 for error-reporting. (Eventually, we should ensure that this
125 does not happen. Error messages involving these operators will
126 be confusing to users.) */
127
128 operator_name_info [(int) INIT_EXPR].name
129 = operator_name_info [(int) MODIFY_EXPR].name;
130 operator_name_info [(int) EXACT_DIV_EXPR].name = "(ceiling /)";
131 operator_name_info [(int) CEIL_DIV_EXPR].name = "(ceiling /)";
132 operator_name_info [(int) FLOOR_DIV_EXPR].name = "(floor /)";
133 operator_name_info [(int) ROUND_DIV_EXPR].name = "(round /)";
134 operator_name_info [(int) CEIL_MOD_EXPR].name = "(ceiling %)";
135 operator_name_info [(int) FLOOR_MOD_EXPR].name = "(floor %)";
136 operator_name_info [(int) ROUND_MOD_EXPR].name = "(round %)";
137 operator_name_info [(int) ABS_EXPR].name = "abs";
138 operator_name_info [(int) TRUTH_AND_EXPR].name = "strict &&";
139 operator_name_info [(int) TRUTH_OR_EXPR].name = "strict ||";
140 operator_name_info [(int) RANGE_EXPR].name = "...";
141 operator_name_info [(int) UNARY_PLUS_EXPR].name = "+";
142
143 assignment_operator_name_info [(int) EXACT_DIV_EXPR].name
144 = "(exact /=)";
145 assignment_operator_name_info [(int) CEIL_DIV_EXPR].name
146 = "(ceiling /=)";
147 assignment_operator_name_info [(int) FLOOR_DIV_EXPR].name
148 = "(floor /=)";
149 assignment_operator_name_info [(int) ROUND_DIV_EXPR].name
150 = "(round /=)";
151 assignment_operator_name_info [(int) CEIL_MOD_EXPR].name
152 = "(ceiling %=)";
153 assignment_operator_name_info [(int) FLOOR_MOD_EXPR].name
154 = "(floor %=)";
155 assignment_operator_name_info [(int) ROUND_MOD_EXPR].name
156 = "(round %=)";
157 }
158
159 /* Initialize the reserved words. */
160
161 void
162 init_reswords (void)
163 {
164 unsigned int i;
165 tree id;
166 int mask = 0;
167
168 if (cxx_dialect < cxx11)
169 mask |= D_CXX11;
170 if (!flag_concepts)
171 mask |= D_CXX_CONCEPTS;
172 if (!flag_tm)
173 mask |= D_TRANSMEM;
174 if (flag_no_asm)
175 mask |= D_ASM | D_EXT;
176 if (flag_no_gnu_keywords)
177 mask |= D_EXT;
178
179 /* The Objective-C keywords are all context-dependent. */
180 mask |= D_OBJC;
181
182 ridpointers = ggc_cleared_vec_alloc<tree> ((int) RID_MAX);
183 for (i = 0; i < num_c_common_reswords; i++)
184 {
185 if (c_common_reswords[i].disable & D_CONLY)
186 continue;
187 id = get_identifier (c_common_reswords[i].word);
188 C_SET_RID_CODE (id, c_common_reswords[i].rid);
189 ridpointers [(int) c_common_reswords[i].rid] = id;
190 if (! (c_common_reswords[i].disable & mask))
191 C_IS_RESERVED_WORD (id) = 1;
192 }
193
194 for (i = 0; i < NUM_INT_N_ENTS; i++)
195 {
196 char name[50];
197 sprintf (name, "__int%d", int_n_data[i].bitsize);
198 id = get_identifier (name);
199 C_SET_RID_CODE (id, RID_FIRST_INT_N + i);
200 C_IS_RESERVED_WORD (id) = 1;
201 }
202 }
203
204 static void
205 init_cp_pragma (void)
206 {
207 c_register_pragma (0, "vtable", handle_pragma_vtable);
208 c_register_pragma (0, "unit", handle_pragma_unit);
209 c_register_pragma (0, "interface", handle_pragma_interface);
210 c_register_pragma (0, "implementation", handle_pragma_implementation);
211 c_register_pragma ("GCC", "interface", handle_pragma_interface);
212 c_register_pragma ("GCC", "implementation", handle_pragma_implementation);
213 c_register_pragma ("GCC", "java_exceptions", handle_pragma_java_exceptions);
214 }
215 \f
216 /* TRUE if a code represents a statement. */
217
218 bool statement_code_p[MAX_TREE_CODES];
219
220 /* Initialize the C++ front end. This function is very sensitive to
221 the exact order that things are done here. It would be nice if the
222 initialization done by this routine were moved to its subroutines,
223 and the ordering dependencies clarified and reduced. */
224 bool
225 cxx_init (void)
226 {
227 location_t saved_loc;
228 unsigned int i;
229 static const enum tree_code stmt_codes[] = {
230 CTOR_INITIALIZER, TRY_BLOCK, HANDLER,
231 EH_SPEC_BLOCK, USING_STMT, TAG_DEFN,
232 IF_STMT, CLEANUP_STMT, FOR_STMT,
233 RANGE_FOR_STMT, WHILE_STMT, DO_STMT,
234 BREAK_STMT, CONTINUE_STMT, SWITCH_STMT,
235 EXPR_STMT
236 };
237
238 memset (&statement_code_p, 0, sizeof (statement_code_p));
239 for (i = 0; i < ARRAY_SIZE (stmt_codes); i++)
240 statement_code_p[stmt_codes[i]] = true;
241
242 saved_loc = input_location;
243 input_location = BUILTINS_LOCATION;
244
245 init_reswords ();
246 init_tree ();
247 init_cp_semantics ();
248 init_operators ();
249 init_method ();
250
251 current_function_decl = NULL;
252
253 class_type_node = ridpointers[(int) RID_CLASS];
254
255 cxx_init_decl_processing ();
256
257 if (c_common_init () == false)
258 {
259 input_location = saved_loc;
260 return false;
261 }
262
263 init_cp_pragma ();
264
265 init_repo ();
266
267 input_location = saved_loc;
268 return true;
269 }
270 \f
271 /* Return nonzero if S is not considered part of an
272 INTERFACE/IMPLEMENTATION pair. Otherwise, return 0. */
273
274 static int
275 interface_strcmp (const char* s)
276 {
277 /* Set the interface/implementation bits for this scope. */
278 struct impl_files *ifiles;
279 const char *s1;
280
281 for (ifiles = impl_file_chain; ifiles; ifiles = ifiles->next)
282 {
283 const char *t1 = ifiles->filename;
284 s1 = s;
285
286 if (*s1 == 0 || filename_ncmp (s1, t1, 1) != 0)
287 continue;
288
289 while (*s1 != 0 && filename_ncmp (s1, t1, 1) == 0)
290 s1++, t1++;
291
292 /* A match. */
293 if (*s1 == *t1)
294 return 0;
295
296 /* Don't get faked out by xxx.yyy.cc vs xxx.zzz.cc. */
297 if (strchr (s1, '.') || strchr (t1, '.'))
298 continue;
299
300 if (*s1 == '\0' || s1[-1] != '.' || t1[-1] != '.')
301 continue;
302
303 /* A match. */
304 return 0;
305 }
306
307 /* No matches. */
308 return 1;
309 }
310
311 \f
312
313 /* Parse a #pragma whose sole argument is a string constant.
314 If OPT is true, the argument is optional. */
315 static tree
316 parse_strconst_pragma (const char* name, int opt)
317 {
318 tree result, x;
319 enum cpp_ttype t;
320
321 t = pragma_lex (&result);
322 if (t == CPP_STRING)
323 {
324 if (pragma_lex (&x) != CPP_EOF)
325 warning (0, "junk at end of #pragma %s", name);
326 return result;
327 }
328
329 if (t == CPP_EOF && opt)
330 return NULL_TREE;
331
332 error ("invalid #pragma %s", name);
333 return error_mark_node;
334 }
335
336 static void
337 handle_pragma_vtable (cpp_reader* /*dfile*/)
338 {
339 parse_strconst_pragma ("vtable", 0);
340 sorry ("#pragma vtable no longer supported");
341 }
342
343 static void
344 handle_pragma_unit (cpp_reader* /*dfile*/)
345 {
346 /* Validate syntax, but don't do anything. */
347 parse_strconst_pragma ("unit", 0);
348 }
349
350 static void
351 handle_pragma_interface (cpp_reader* /*dfile*/)
352 {
353 tree fname = parse_strconst_pragma ("interface", 1);
354 struct c_fileinfo *finfo;
355 const char *filename;
356
357 if (fname == error_mark_node)
358 return;
359 else if (fname == 0)
360 filename = lbasename (LOCATION_FILE (input_location));
361 else
362 filename = TREE_STRING_POINTER (fname);
363
364 finfo = get_fileinfo (LOCATION_FILE (input_location));
365
366 if (impl_file_chain == 0)
367 {
368 /* If this is zero at this point, then we are
369 auto-implementing. */
370 if (main_input_filename == 0)
371 main_input_filename = LOCATION_FILE (input_location);
372 }
373
374 finfo->interface_only = interface_strcmp (filename);
375 /* If MULTIPLE_SYMBOL_SPACES is set, we cannot assume that we can see
376 a definition in another file. */
377 if (!MULTIPLE_SYMBOL_SPACES || !finfo->interface_only)
378 finfo->interface_unknown = 0;
379 }
380
381 /* Note that we have seen a #pragma implementation for the key MAIN_FILENAME.
382 We used to only allow this at toplevel, but that restriction was buggy
383 in older compilers and it seems reasonable to allow it in the headers
384 themselves, too. It only needs to precede the matching #p interface.
385
386 We don't touch finfo->interface_only or finfo->interface_unknown;
387 the user must specify a matching #p interface for this to have
388 any effect. */
389
390 static void
391 handle_pragma_implementation (cpp_reader* /*dfile*/)
392 {
393 tree fname = parse_strconst_pragma ("implementation", 1);
394 const char *filename;
395 struct impl_files *ifiles = impl_file_chain;
396
397 if (fname == error_mark_node)
398 return;
399
400 if (fname == 0)
401 {
402 if (main_input_filename)
403 filename = main_input_filename;
404 else
405 filename = LOCATION_FILE (input_location);
406 filename = lbasename (filename);
407 }
408 else
409 {
410 filename = TREE_STRING_POINTER (fname);
411 if (cpp_included_before (parse_in, filename, input_location))
412 warning (0, "#pragma implementation for %qs appears after "
413 "file is included", filename);
414 }
415
416 for (; ifiles; ifiles = ifiles->next)
417 {
418 if (! filename_cmp (ifiles->filename, filename))
419 break;
420 }
421 if (ifiles == 0)
422 {
423 ifiles = XNEW (struct impl_files);
424 ifiles->filename = xstrdup (filename);
425 ifiles->next = impl_file_chain;
426 impl_file_chain = ifiles;
427 }
428 }
429
430 /* Indicate that this file uses Java-personality exception handling. */
431 static void
432 handle_pragma_java_exceptions (cpp_reader* /*dfile*/)
433 {
434 tree x;
435 if (pragma_lex (&x) != CPP_EOF)
436 warning (0, "junk at end of #pragma GCC java_exceptions");
437
438 choose_personality_routine (lang_java);
439 pragma_java_exceptions = true;
440 }
441
442 /* Issue an error message indicating that the lookup of NAME (an
443 IDENTIFIER_NODE) failed. Returns the ERROR_MARK_NODE. */
444
445 tree
446 unqualified_name_lookup_error (tree name)
447 {
448 if (IDENTIFIER_OPNAME_P (name))
449 {
450 if (name != ansi_opname (ERROR_MARK))
451 error ("%qD not defined", name);
452 }
453 else
454 {
455 if (!objc_diagnose_private_ivar (name))
456 {
457 error ("%qD was not declared in this scope", name);
458 suggest_alternatives_for (location_of (name), name);
459 }
460 /* Prevent repeated error messages by creating a VAR_DECL with
461 this NAME in the innermost block scope. */
462 if (local_bindings_p ())
463 {
464 tree decl;
465 decl = build_decl (input_location,
466 VAR_DECL, name, error_mark_node);
467 DECL_CONTEXT (decl) = current_function_decl;
468 push_local_binding (name, decl, 0);
469 /* Mark the variable as used so that we do not get warnings
470 about it being unused later. */
471 TREE_USED (decl) = 1;
472 }
473 }
474
475 return error_mark_node;
476 }
477
478 /* Like unqualified_name_lookup_error, but NAME is an unqualified-id
479 used as a function. Returns an appropriate expression for
480 NAME. */
481
482 tree
483 unqualified_fn_lookup_error (tree name)
484 {
485 if (processing_template_decl)
486 {
487 /* In a template, it is invalid to write "f()" or "f(3)" if no
488 declaration of "f" is available. Historically, G++ and most
489 other compilers accepted that usage since they deferred all name
490 lookup until instantiation time rather than doing unqualified
491 name lookup at template definition time; explain to the user what
492 is going wrong.
493
494 Note that we have the exact wording of the following message in
495 the manual (trouble.texi, node "Name lookup"), so they need to
496 be kept in synch. */
497 permerror (input_location, "there are no arguments to %qD that depend on a template "
498 "parameter, so a declaration of %qD must be available",
499 name, name);
500
501 if (!flag_permissive)
502 {
503 static bool hint;
504 if (!hint)
505 {
506 inform (input_location, "(if you use %<-fpermissive%>, G++ will accept your "
507 "code, but allowing the use of an undeclared name is "
508 "deprecated)");
509 hint = true;
510 }
511 }
512 return name;
513 }
514
515 return unqualified_name_lookup_error (name);
516 }
517
518 /* Wrapper around build_lang_decl_loc(). Should gradually move to
519 build_lang_decl_loc() and then rename build_lang_decl_loc() back to
520 build_lang_decl(). */
521
522 tree
523 build_lang_decl (enum tree_code code, tree name, tree type)
524 {
525 return build_lang_decl_loc (input_location, code, name, type);
526 }
527
528 /* Build a decl from CODE, NAME, TYPE declared at LOC, and then add
529 DECL_LANG_SPECIFIC info to the result. */
530
531 tree
532 build_lang_decl_loc (location_t loc, enum tree_code code, tree name, tree type)
533 {
534 tree t;
535
536 t = build_decl (loc, code, name, type);
537 retrofit_lang_decl (t);
538
539 return t;
540 }
541
542 /* Add DECL_LANG_SPECIFIC info to T. Called from build_lang_decl
543 and pushdecl (for functions generated by the back end). */
544
545 void
546 retrofit_lang_decl (tree t)
547 {
548 struct lang_decl *ld;
549 size_t size;
550 int sel;
551
552 if (DECL_LANG_SPECIFIC (t))
553 return;
554
555 if (TREE_CODE (t) == FUNCTION_DECL)
556 sel = 1, size = sizeof (struct lang_decl_fn);
557 else if (TREE_CODE (t) == NAMESPACE_DECL)
558 sel = 2, size = sizeof (struct lang_decl_ns);
559 else if (TREE_CODE (t) == PARM_DECL)
560 sel = 3, size = sizeof (struct lang_decl_parm);
561 else if (LANG_DECL_HAS_MIN (t))
562 sel = 0, size = sizeof (struct lang_decl_min);
563 else
564 gcc_unreachable ();
565
566 ld = (struct lang_decl *) ggc_internal_cleared_alloc (size);
567
568 ld->u.base.selector = sel;
569
570 DECL_LANG_SPECIFIC (t) = ld;
571 if (current_lang_name == lang_name_cplusplus
572 || decl_linkage (t) == lk_none)
573 SET_DECL_LANGUAGE (t, lang_cplusplus);
574 else if (current_lang_name == lang_name_c)
575 SET_DECL_LANGUAGE (t, lang_c);
576 else if (current_lang_name == lang_name_java)
577 SET_DECL_LANGUAGE (t, lang_java);
578 else
579 gcc_unreachable ();
580
581 if (GATHER_STATISTICS)
582 {
583 tree_node_counts[(int)lang_decl] += 1;
584 tree_node_sizes[(int)lang_decl] += size;
585 }
586 }
587
588 void
589 cxx_dup_lang_specific_decl (tree node)
590 {
591 int size;
592 struct lang_decl *ld;
593
594 if (! DECL_LANG_SPECIFIC (node))
595 return;
596
597 if (TREE_CODE (node) == FUNCTION_DECL)
598 size = sizeof (struct lang_decl_fn);
599 else if (TREE_CODE (node) == NAMESPACE_DECL)
600 size = sizeof (struct lang_decl_ns);
601 else if (TREE_CODE (node) == PARM_DECL)
602 size = sizeof (struct lang_decl_parm);
603 else if (LANG_DECL_HAS_MIN (node))
604 size = sizeof (struct lang_decl_min);
605 else
606 gcc_unreachable ();
607
608 ld = (struct lang_decl *) ggc_internal_alloc (size);
609 memcpy (ld, DECL_LANG_SPECIFIC (node), size);
610 DECL_LANG_SPECIFIC (node) = ld;
611
612 if (GATHER_STATISTICS)
613 {
614 tree_node_counts[(int)lang_decl] += 1;
615 tree_node_sizes[(int)lang_decl] += size;
616 }
617 }
618
619 /* Copy DECL, including any language-specific parts. */
620
621 tree
622 copy_decl (tree decl)
623 {
624 tree copy;
625
626 copy = copy_node (decl);
627 cxx_dup_lang_specific_decl (copy);
628 return copy;
629 }
630
631 /* Replace the shared language-specific parts of NODE with a new copy. */
632
633 static void
634 copy_lang_type (tree node)
635 {
636 int size;
637 struct lang_type *lt;
638
639 if (! TYPE_LANG_SPECIFIC (node))
640 return;
641
642 if (TYPE_LANG_SPECIFIC (node)->u.h.is_lang_type_class)
643 size = sizeof (struct lang_type);
644 else
645 size = sizeof (struct lang_type_ptrmem);
646 lt = (struct lang_type *) ggc_internal_alloc (size);
647 memcpy (lt, TYPE_LANG_SPECIFIC (node), size);
648 TYPE_LANG_SPECIFIC (node) = lt;
649
650 if (GATHER_STATISTICS)
651 {
652 tree_node_counts[(int)lang_type] += 1;
653 tree_node_sizes[(int)lang_type] += size;
654 }
655 }
656
657 /* Copy TYPE, including any language-specific parts. */
658
659 tree
660 copy_type (tree type)
661 {
662 tree copy;
663
664 copy = copy_node (type);
665 copy_lang_type (copy);
666 return copy;
667 }
668
669 tree
670 cxx_make_type (enum tree_code code)
671 {
672 tree t = make_node (code);
673
674 /* Create lang_type structure. */
675 if (RECORD_OR_UNION_CODE_P (code)
676 || code == BOUND_TEMPLATE_TEMPLATE_PARM)
677 {
678 struct lang_type *pi
679 = (struct lang_type *) ggc_internal_cleared_alloc
680 (sizeof (struct lang_type));
681
682 TYPE_LANG_SPECIFIC (t) = pi;
683 pi->u.c.h.is_lang_type_class = 1;
684
685 if (GATHER_STATISTICS)
686 {
687 tree_node_counts[(int)lang_type] += 1;
688 tree_node_sizes[(int)lang_type] += sizeof (struct lang_type);
689 }
690 }
691
692 /* Set up some flags that give proper default behavior. */
693 if (RECORD_OR_UNION_CODE_P (code))
694 {
695 struct c_fileinfo *finfo = \
696 get_fileinfo (LOCATION_FILE (input_location));
697 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (t, finfo->interface_unknown);
698 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
699 }
700
701 return t;
702 }
703
704 tree
705 make_class_type (enum tree_code code)
706 {
707 tree t = cxx_make_type (code);
708 SET_CLASS_TYPE_P (t, 1);
709 return t;
710 }
711
712 /* Returns true if we are currently in the main source file, or in a
713 template instantiation started from the main source file. */
714
715 bool
716 in_main_input_context (void)
717 {
718 struct tinst_level *tl = outermost_tinst_level();
719
720 if (tl)
721 return filename_cmp (main_input_filename,
722 LOCATION_FILE (tl->locus)) == 0;
723 else
724 return filename_cmp (main_input_filename, LOCATION_FILE (input_location)) == 0;
725 }